id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
8,853,198,550,386,280,000 |
мое новое расписание: пн-пт с 8.00 по 16.00 по москве, сб и вс - выходные; после 16.00 и на вых. отвечаю по возможности
Позиционирование относительно родителя на CSS
Если элементу задан relative, а его потомку - absolute, то этот потомок будет позиционироваться относительно своего родителя, а не относительно окна браузера.
Как правило, в таком случае родителю указывают relative без смещений. В этом случае с этим родителем ничего не происходит, но все его потомки теперь будут позиционироваться относительно него.
Давайте посмотрим на примерах.
Пример
Для начала давайте просто сделаем блок-родитель и блок-потомок без позиционирования:
<div id="parent"> <div id="child"></div> </div> #parent { width: 500px; height: 300px; margin: 0 auto; border: 1px solid red; } #child { width: 200px; height: 200px; border: 1px solid green; }
:
Пример
Давайте теперь абсолютно спозиционируем зеленый блок. Так как родителю не указан relative, то потомок будет позиционироваться относительно окна браузера:
<div id="parent"> <div id="child"></div> </div> #parent { width: 500px; height: 300px; margin: 0 auto; border: 1px solid red; } #child { position: absolute; top: 20px; left: 20px; width: 200px; height: 200px; border: 1px solid green; }
:
Пример
Укажем теперь родителю relative. В этом случае потомок будет позиционироваться относительно своего родителя:
<div id="parent"> <div id="child"></div> </div> #parent { position: relative; width: 500px; height: 300px; margin: 0 auto; border: 1px solid red; } #child { position: absolute; top: 20px; left: 20px; width: 200px; height: 200px; border: 1px solid green; }
:
Практические задачи
В следующих задачах основной блок стоит по центру с помощью margin в значении auto, а остальные позиционируются относительно него с помощью свойства position.
Повторите страницу по данному образцу:
Повторите страницу по данному образцу:
Повторите страницу по данному образцу:
Повторите страницу по данному образцу:
Повторите страницу по данному образцу:
|
{
"url": "http://code.mu/ru/markup/book/prime/positioning/absolute-relativly-to-parent/",
"source_domain": "code.mu",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "19011",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GP5UX7GBVOCHKPQ3SDEZ5LIETIBW3C4E",
"WARC-Concurrent-To": "<urn:uuid:7de59c8f-ebfd-4772-a597-f3ba462e0cfe>",
"WARC-Date": "2020-07-13T01:22:08Z",
"WARC-IP-Address": "93.125.99.43",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QMXJSYVLA7ZTAMYK3S5U4QZATGNLS6NW",
"WARC-Record-ID": "<urn:uuid:769b59d9-15a1-4def-b43d-d8099a296195>",
"WARC-Target-URI": "http://code.mu/ru/markup/book/prime/positioning/absolute-relativly-to-parent/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dec5cd59-dd78-41c0-9def-43178f6b28b3>"
},
"warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-82.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
120,
121,
167,
168,
327,
328,
520,
521,
552,
553,
560,
561,
646,
647,
840,
841,
843,
844,
851,
852,
1006,
1007,
1243,
1244,
1246,
1247,
1254,
1255,
1364,
1365,
1621,
1622,
1624,
1625,
1645,
1646,
1805,
1806,
1845,
1846,
1885,
1886,
1925,
1926,
1965,
1966
],
"line_end_idx": [
120,
121,
167,
168,
327,
328,
520,
521,
552,
553,
560,
561,
646,
647,
840,
841,
843,
844,
851,
852,
1006,
1007,
1243,
1244,
1246,
1247,
1254,
1255,
1364,
1365,
1621,
1622,
1624,
1625,
1645,
1646,
1805,
1806,
1845,
1846,
1885,
1886,
1925,
1926,
1965,
1966,
2004
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2004,
"ccnet_original_nlines": 46,
"rps_doc_curly_bracket": 0.005988019984215498,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009523809887468815,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7452381253242493,
"rps_doc_frac_unique_words": 0.4307115972042084,
"rps_doc_mean_word_length": 5.790262222290039,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0.014285709708929062,
"rps_doc_unigram_entropy": 4.496816158294678,
"rps_doc_word_count": 267,
"rps_doc_frac_chars_dupe_10grams": 0.3460543155670166,
"rps_doc_frac_chars_dupe_5grams": 0.47218629717826843,
"rps_doc_frac_chars_dupe_6grams": 0.47218629717826843,
"rps_doc_frac_chars_dupe_7grams": 0.3796895146369934,
"rps_doc_frac_chars_dupe_8grams": 0.3796895146369934,
"rps_doc_frac_chars_dupe_9grams": 0.3796895146369934,
"rps_doc_frac_chars_top_2gram": 0.03492885082960129,
"rps_doc_frac_chars_top_3gram": 0.05433376133441925,
"rps_doc_frac_chars_top_4gram": 0.08408796787261963,
"rps_doc_books_importance": -304.7938232421875,
"rps_doc_books_importance_length_correction": -304.7938232421875,
"rps_doc_openwebtext_importance": -183.10841369628906,
"rps_doc_openwebtext_importance_length_correction": -183.10841369628906,
"rps_doc_wikipedia_importance": -149.83457946777344,
"rps_doc_wikipedia_importance_length_correction": -149.83457946777344
},
"fasttext": {
"dclm": 0.920414924621582,
"english": 0.00037120000342838466,
"fineweb_edu_approx": 1.6488385200500488,
"eai_general_math": 0.000009420000424142927,
"eai_open_web_math": 0.19925659894943237,
"eai_web_code": 0.8851895332336426
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.435",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,101,141,880,057,172,700 |
Volatile table for EXTUSER
Database
Enthusiast
Volatile table for EXTUSER
Is it possible for a user logging in through EXTUSER (using LDAP) to create a volatile table? If not, is there any reasonable substitution or workaround where a user could create a temp table that would drop when the session disconnects?
|
{
"url": "http://community.teradata.com/t5/Database/Volatile-table-for-EXTUSER/td-p/14103",
"source_domain": "community.teradata.com",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "71016",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:V6O3JSQF4SWODGK7A5X7I7SPQKRWACBS",
"WARC-Concurrent-To": "<urn:uuid:cfe6df47-37ea-4dea-9140-a9f520c24d35>",
"WARC-Date": "2018-10-15T21:37:22Z",
"WARC-IP-Address": "208.74.204.160",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GURWV2EQEXDVEQ3OS5B574D6QK7LIX6J",
"WARC-Record-ID": "<urn:uuid:c57a109b-c1d8-47e3-ab92-67f4c3ca652f>",
"WARC-Target-URI": "http://community.teradata.com/t5/Database/Volatile-table-for-EXTUSER/td-p/14103",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c66c3beb-b379-4a9d-a086-c0cc70585c34>"
},
"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-79-252-22.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
27,
28,
37,
48,
49,
76,
77
],
"line_end_idx": [
27,
28,
37,
48,
49,
76,
77,
314
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 314,
"ccnet_original_nlines": 7,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4285714328289032,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0714285671710968,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.089285708963871,
"rps_doc_frac_unique_words": 0.7058823704719543,
"rps_doc_mean_word_length": 5.019608020782471,
"rps_doc_num_sentences": 2,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.438948154449463,
"rps_doc_word_count": 51,
"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.15234375,
"rps_doc_frac_chars_top_3gram": 0.125,
"rps_doc_frac_chars_top_4gram": 0.1796875,
"rps_doc_books_importance": -31.190805435180664,
"rps_doc_books_importance_length_correction": -31.190805435180664,
"rps_doc_openwebtext_importance": -11.343474388122559,
"rps_doc_openwebtext_importance_length_correction": -11.343474388122559,
"rps_doc_wikipedia_importance": -4.949746608734131,
"rps_doc_wikipedia_importance_length_correction": -4.949746608734131
},
"fasttext": {
"dclm": 0.9984514117240906,
"english": 0.7910752892494202,
"fineweb_edu_approx": 1.8769887685775757,
"eai_general_math": 0.9174558520317078,
"eai_open_web_math": 0.1318088173866272,
"eai_web_code": 0.9985182881355286
}
}
|
{
"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.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": "5",
"label": "Social/Forum"
},
"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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,383,734,054,695,786,000 |
1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!
Unions and Intersections
1. Oct 9, 2012 #1
1. The problem statement, all variables and given/known data
A and B are independent, P(A) = 0.30, P(B) = 0.50. Compute P(A U B) and P(A' intersect B).
3. The attempt at a solution
P(A U B) = 0.30 + 0.50 = 0.80
P(A' intersect B) = 1 - 0.30 = 0.70
this is obviously wrong
2. jcsd
3. Oct 9, 2012 #2
ehild
User Avatar
Homework Helper
Gold Member
It is really wrong. What does it mean that A and B are independent? When is it true that P(A U B) = P(A)+P(B)?
Try to draw the Venn diagram.
ehild
4. Oct 9, 2012 #3
Well I got the first one incorrect and I don't know exactly why because wouldn't the union be what is included in the set A and B. That's why I added them.
For the second on I'm no sure how to really do that one. I just understand it as not in A and in B
5. Oct 9, 2012 #4
ehild
User Avatar
Homework Helper
Gold Member
6. Oct 9, 2012 #5
SammyS
User Avatar
Staff Emeritus
Science Advisor
Homework Helper
Gold Member
Yes, of course you're correct, ehild !
(I have deleted my earlier post. )
7. Oct 9, 2012 #6
ehild
User Avatar
Homework Helper
Gold Member
P(AUB)=P(A)+P(B)-P(A[itex]\cap[/itex]B)
Look after how to calculate the probability P(A[itex]\cap [/itex]B) if A and B are independent.
It is the probability that A does not happen and B happens.
ehild
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook
Similar Discussions: Unions and Intersections
Loading...
|
{
"url": "https://www.physicsforums.com/threads/unions-and-intersections.642462/",
"source_domain": "www.physicsforums.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "67982",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5G225POI3GBLMVZ3WXJFN5NSDMT3JMXG",
"WARC-Concurrent-To": "<urn:uuid:6d187b9d-f493-4112-8b47-11229414da27>",
"WARC-Date": "2017-12-16T03:55:57Z",
"WARC-IP-Address": "74.86.200.109",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:J5ET3QZFDGHD27MBPSILDLT3G2XL7S3L",
"WARC-Record-ID": "<urn:uuid:98118f25-68b0-4b5a-866f-766e04f4cd0b>",
"WARC-Target-URI": "https://www.physicsforums.com/threads/unions-and-intersections.642462/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:78f80c2c-e739-4755-a8c0-3b34b4a5c3d3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-65-63-115.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,
88,
107,
122,
149,
257,
258,
283,
284,
304,
369,
464,
465,
466,
467,
500,
534,
574,
602,
608,
618,
638,
639,
649,
650,
666,
686,
702,
703,
818,
852,
853,
863,
869,
889,
1049,
1050,
1153,
1159,
1179,
1180,
1190,
1191,
1207,
1227,
1243,
1244,
1264,
1265,
1276,
1277,
1293,
1312,
1332,
1352,
1368,
1369,
1412,
1413,
1452,
1458,
1478,
1479,
1489,
1490,
1506,
1526,
1542,
1543,
1587,
1687,
1688,
1752,
1753,
1763,
1769,
1868,
1869,
1870,
1871,
1872,
1918
],
"line_end_idx": [
88,
107,
122,
149,
257,
258,
283,
284,
304,
369,
464,
465,
466,
467,
500,
534,
574,
602,
608,
618,
638,
639,
649,
650,
666,
686,
702,
703,
818,
852,
853,
863,
869,
889,
1049,
1050,
1153,
1159,
1179,
1180,
1190,
1191,
1207,
1227,
1243,
1244,
1264,
1265,
1276,
1277,
1293,
1312,
1332,
1352,
1368,
1369,
1412,
1413,
1452,
1458,
1478,
1479,
1489,
1490,
1506,
1526,
1542,
1543,
1587,
1687,
1688,
1752,
1753,
1763,
1769,
1868,
1869,
1870,
1871,
1872,
1918,
1928
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1928,
"ccnet_original_nlines": 81,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2295805662870407,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.12362030893564224,
"rps_doc_frac_lines_end_with_ellipsis": 0.012195119634270668,
"rps_doc_frac_no_alph_words": 0.3399558365345001,
"rps_doc_frac_unique_words": 0.5328947305679321,
"rps_doc_mean_word_length": 4.190789699554443,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0.015452539548277855,
"rps_doc_unigram_entropy": 4.76610803604126,
"rps_doc_word_count": 304,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.13657771050930023,
"rps_doc_frac_chars_dupe_6grams": 0.09183672815561295,
"rps_doc_frac_chars_dupe_7grams": 0.09183672815561295,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.018838299438357353,
"rps_doc_frac_chars_top_3gram": 0.0376766100525856,
"rps_doc_frac_chars_top_4gram": 0.0753532201051712,
"rps_doc_books_importance": -214.42950439453125,
"rps_doc_books_importance_length_correction": -214.42950439453125,
"rps_doc_openwebtext_importance": -136.24029541015625,
"rps_doc_openwebtext_importance_length_correction": -136.24029541015625,
"rps_doc_wikipedia_importance": -93.31501770019531,
"rps_doc_wikipedia_importance_length_correction": -93.31501770019531
},
"fasttext": {
"dclm": 0.7730613946914673,
"english": 0.9177318811416626,
"fineweb_edu_approx": 1.2983378171920776,
"eai_general_math": 0.019230129197239876,
"eai_open_web_math": 0.3467407822608948,
"eai_web_code": 0.000044699998397845775
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "511.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,180,467,156,301,428,000 |
Commit 2012224c authored by Yoann Dufresne's avatar Yoann Dufresne
Browse files
Modification for Rayan greedy
parent 0e6da685
number_try = 25
threshold = 0.95
number_try = 1
threshold = 0.9
rule d2_path_generation:
......@@ -12,7 +12,7 @@ rule d2_path_generation:
run:
best = 0
for _ in range(number_try):
shell("python3 deconvolution/main/d2_to_path.py {input.barcode} {input.d2} > {output}_tmp.out")
shell("python3 deconvolution/main/d2_to_path_simple.py {input.barcode} {input.d2} > {output}_tmp.out")
score = 0
with open(f"{output}_tmp.out") as out:
score_line = out.readlines()[-2].strip()
......@@ -25,5 +25,5 @@ rule d2_path_generation:
print("Score sufficient: quitting...")
break
shell("rm {output}_tmp.out")
shell("cp {output}.best {output}")
shell("mv {output}.best {output}")
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment
|
{
"url": "https://gitlab.pasteur.fr/ydufresne/linkedreadsmoleculeordering/-/commit/2012224cfc92392efec5dd2c0e570bdc2bc9e80d",
"source_domain": "gitlab.pasteur.fr",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "133895",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O5WPJENGQJVLEKN4XHNJAKWM7N3FI7GH",
"WARC-Concurrent-To": "<urn:uuid:2b250f30-3ade-4e60-b73a-d5f7921da900>",
"WARC-Date": "2022-05-26T01:45:14Z",
"WARC-IP-Address": "157.99.21.44",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WCONM7Z5PCRUYYVA34GZGCEADTZOXY7W",
"WARC-Record-ID": "<urn:uuid:104ef242-4e6a-4762-a2e3-2e3c532e90af>",
"WARC-Target-URI": "https://gitlab.pasteur.fr/ydufresne/linkedreadsmoleculeordering/-/commit/2012224cfc92392efec5dd2c0e570bdc2bc9e80d",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d4b8a984-e420-4350-976f-0324b090c39b>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-40\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,
67,
80,
81,
111,
112,
128,
144,
161,
176,
192,
217,
266,
271,
280,
308,
404,
507,
517,
556,
597,
646,
685,
691,
720,
755,
790,
812,
820,
891,
926
],
"line_end_idx": [
67,
80,
81,
111,
112,
128,
144,
161,
176,
192,
217,
266,
271,
280,
308,
404,
507,
517,
556,
597,
646,
685,
691,
720,
755,
790,
812,
820,
891,
926,
955
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 955,
"ccnet_original_nlines": 30,
"rps_doc_curly_bracket": 0.02513089030981064,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12608696520328522,
"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.48260870575904846,
"rps_doc_frac_unique_words": 0.7575757503509521,
"rps_doc_mean_word_length": 6.929293155670166,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0.021739130839705467,
"rps_doc_unigram_entropy": 4.223904132843018,
"rps_doc_word_count": 99,
"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.08746355772018433,
"rps_doc_frac_chars_top_3gram": 0.0903790071606636,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -60.70671844482422,
"rps_doc_books_importance_length_correction": -60.70671844482422,
"rps_doc_openwebtext_importance": -52.66244125366211,
"rps_doc_openwebtext_importance_length_correction": -39.477867126464844,
"rps_doc_wikipedia_importance": -48.28249740600586,
"rps_doc_wikipedia_importance_length_correction": -48.28249740600586
},
"fasttext": {
"dclm": 0.8433038592338562,
"english": 0.6004649996757507,
"fineweb_edu_approx": 2.0706305503845215,
"eai_general_math": 0.000104669998108875,
"eai_open_web_math": 0.5776577591896057,
"eai_web_code": -0.000009890000001178123
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.072",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
784,530,291,407,158,400 |
Get ExpressVPN Special Deal - Save 49% with 12 Months + 3 Months FREE at just $6.67 per month Get Exclusive Offer X
How to Watch Jurassic World Dominion(2022) Online From Anywhere
Are you search but have no idea where to watch it Jurassic World Dominion? In this quick guide, we are going to show you where and how you can watch Jurassic World Dominion from anywhere across the world.
Watch Jurassic World Dominion
Watch Jurassic World Dominion
TitleJurassic World Dominion(2022)
GenreAdventure, Action, Sci-Fi
DirectorColin Trevorrow
Jurassic World Dominion CastChris Pratt, Bryce Dallas Howard, Laura Dern, Sam Neill, Jeff Goldblum
Jurassic World Dominion is currently available on VUDU. VUDU is a US-based streaming platform available only in the US. To watch Jurassic World Dominion on VUDU outside the US, you need a VPN that gives you access to VUDU no matter where you are.
Quick Guide: How to watch Jurassic World Dominion(2022)?
1. Subscribe to a VPN like ExpressVPN. VPN is urgent to get access to VUDU outside US.
2. Download and Install the VPN app for your device or you can use in-built VPN app.
3. Log into your VPN app with the details provided after subscribing the ExpressVPN.
4. Connect to a server in the US. Connect US Expressvpn
5. Visit official Vudu website and login with your credentials.
6. Now search Jurassic World Dominion and Buy or Rent your movie.
Jurassic World Dominion(2022) Official Trailer
If you are accessing VUDU outside US to watch Jurassic World Dominion online it does not allow you to signup or login outside the US and shows an error like “Login failed! Please check your information and try again.
VUDU login error
VUDU login error
A VPN, essentially, unblocks geo-restricted streaming platforms by hiding your actual location. It makes you appear as though you’re surfing from the same country. So streaming platform won’t block you from viewing their content.
ExpressVPN is the best VPN for streaming VUDU outside the US. It boasts lightning-fast speeds that allow you to view without interruption. Furthermore, you may try it out risk-free for 30 days money-back guarantee.
So, with the help of a VPN, you’ll be able to stream Jurassic World Dominion on VUDU from your region!
FAQs
Where to watch Jurassic World Dominion(2022) in my country?
Currently, you can watch Jurassic World Dominion on VUDU but in the US only due to geoblocking restrictions.
Using a good VPN, you can stream Jurassic World Dominion in your country also. A good VPN will mask your location and change Your IP address to the US.
Why is Jurassic World Dominion(2022) inaccessible in my country?
Due to licensing and controlling issues, Jurassic World Dominion
is geoblocked by the corporation itself.
By unblocking the VUDU using a VPN, you can watch Jurassic World Dominion in your country. Follow our step by step guide to stream Jurassic World Dominion in your country.
Conclusion
Now you can easily watch Jurassic World Dominion on VUDU. But still, if you are facing any issues, you can comment us in the comment box. Our team will help you as soon as possible.
Leave a Comment
Your email address will not be published.
|
{
"url": "https://www.thesoftpot.com/watch-jurassic-world-dominion-on-vudu/",
"source_domain": "www.thesoftpot.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "122321",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SUS5L6GGLXY4LGAEFHA6BFPHK3IFP3Y6",
"WARC-Concurrent-To": "<urn:uuid:986abee0-586c-441f-9685-a4a0ebe9852f>",
"WARC-Date": "2022-08-08T14:26:56Z",
"WARC-IP-Address": "172.67.201.202",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:S7XMC2YEL5J4JTGEMETK2TWPQMC7IYQZ",
"WARC-Record-ID": "<urn:uuid:b4b9df46-0a0b-45c7-9367-28ea3ef24f8f>",
"WARC-Target-URI": "https://www.thesoftpot.com/watch-jurassic-world-dominion-on-vudu/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1fb2df18-e26a-493d-88fa-a62cc65f105d>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-115\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
116,
117,
181,
182,
387,
388,
418,
448,
483,
514,
538,
637,
638,
885,
886,
943,
944,
1033,
1120,
1207,
1265,
1331,
1399,
1400,
1447,
1448,
1665,
1666,
1683,
1700,
1701,
1931,
1932,
2147,
2148,
2251,
2252,
2257,
2258,
2318,
2319,
2428,
2580,
2581,
2646,
2647,
2712,
2714,
2755,
2927,
2928,
2939,
2940,
3122,
3123,
3139,
3140
],
"line_end_idx": [
116,
117,
181,
182,
387,
388,
418,
448,
483,
514,
538,
637,
638,
885,
886,
943,
944,
1033,
1120,
1207,
1265,
1331,
1399,
1400,
1447,
1448,
1665,
1666,
1683,
1700,
1701,
1931,
1932,
2147,
2148,
2251,
2252,
2257,
2258,
2318,
2319,
2428,
2580,
2581,
2646,
2647,
2712,
2714,
2755,
2927,
2928,
2939,
2940,
3122,
3123,
3139,
3140,
3181
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3181,
"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.34285715222358704,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06507936865091324,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1666666716337204,
"rps_doc_frac_unique_words": 0.4125475287437439,
"rps_doc_mean_word_length": 4.81939172744751,
"rps_doc_num_sentences": 41,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.800264835357666,
"rps_doc_word_count": 526,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1727810651063919,
"rps_doc_frac_chars_dupe_6grams": 0.14556212723255157,
"rps_doc_frac_chars_dupe_7grams": 0.05917159840464592,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.10769230872392654,
"rps_doc_frac_chars_top_3gram": 0.1325443834066391,
"rps_doc_frac_chars_top_4gram": 0.08205127716064453,
"rps_doc_books_importance": -237.7411346435547,
"rps_doc_books_importance_length_correction": -237.7411346435547,
"rps_doc_openwebtext_importance": -151.21279907226562,
"rps_doc_openwebtext_importance_length_correction": -151.21279907226562,
"rps_doc_wikipedia_importance": -123.8822250366211,
"rps_doc_wikipedia_importance_length_correction": -123.8822250366211
},
"fasttext": {
"dclm": 0.0356520414352417,
"english": 0.8476781249046326,
"fineweb_edu_approx": 1.4068642854690552,
"eai_general_math": 0.00001680999957898166,
"eai_open_web_math": 0.04670614004135132,
"eai_web_code": 0.00002443999983370304
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.677",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "791.4372",
"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": "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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,817,697,042,828,529,000 |
Extracting the text from a dxf file into grasshopper
Hey everyone, i have imported a dxf file into grasshopper (1st photo). All of the lines from the drawing(buildings, forces) all appeared(2nd photo). The problem is all the texts such as the value of the loads and title of the project all does not appear. Any ideas anyone?
I dont want to import directly to Rhino. I want to do it through grasshopper.
Standard grasshopper (for Rhino 7) doesn’t have annotation and texts data type.
You can generate texts and annotations but only as a bake operation, so not importing them from rhino document or another file.
You should import your .dxf file first, and then try your luck with some plugin like elefront to get more data/geometry types in grasshopper.
Thanks for answering, I tried following a script i got from
and it works as he said. But I guess the text that I was looking for is in something called Rhino.Geometry.TextEntity(photo below)
4
Any idea how to extract it?
PlainText property?
https://developer.rhino3d.com/api/rhinocommon/rhino.geometry.textentity
Use Ghpython or c# to read the TextEntity
2 Likes
Hello,
do you have any idea of how to do the the opposite? like export a text into a DXF file?
in my case i’m generating a text with visualARQ (because I couldn’t find another way to export text without baking) and i’m trying to export it to DXF using TT Toolbox but it doesn’t work because it doesn’t reconize text, only geometries, the problem is that i can’t not export a text as a group of curves because the CNC software i’m using doesn’t recognizes those curves as text
|
{
"url": "https://discourse.mcneel.com/t/extracting-the-text-from-a-dxf-file-into-grasshopper/162068",
"source_domain": "discourse.mcneel.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "35429",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GXZXJ2K6XIMHT5TXX7QYNNZ7D6MRJCDN",
"WARC-Concurrent-To": "<urn:uuid:bf6e0aaa-08d7-4f8d-a8f6-3d7845b944ee>",
"WARC-Date": "2024-04-15T13:11:42Z",
"WARC-IP-Address": "184.105.99.45",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OW3MCB6DGVZHSR5LU6QFNNKY57DLIW34",
"WARC-Record-ID": "<urn:uuid:72138c2a-2fd5-43bb-a173-0b02ec39eae3>",
"WARC-Target-URI": "https://discourse.mcneel.com/t/extracting-the-text-from-a-dxf-file-into-grasshopper/162068",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c3ee233d-6540-4b99-8d43-e1782dde64a0>"
},
"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-230\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,
327,
328,
406,
407,
408,
488,
616,
617,
759,
760,
820,
821,
952,
954,
955,
983,
984,
1004,
1005,
1077,
1078,
1120,
1121,
1129,
1130,
1137,
1138,
1226,
1227
],
"line_end_idx": [
53,
54,
327,
328,
406,
407,
408,
488,
616,
617,
759,
760,
820,
821,
952,
954,
955,
983,
984,
1004,
1005,
1077,
1078,
1120,
1121,
1129,
1130,
1137,
1138,
1226,
1227,
1607
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1607,
"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.4514285624027252,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02857143059372902,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16285714507102966,
"rps_doc_frac_unique_words": 0.5238094925880432,
"rps_doc_mean_word_length": 4.655677795410156,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0.0028571400325745344,
"rps_doc_unigram_entropy": 4.631405353546143,
"rps_doc_word_count": 273,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.036191970109939575,
"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.022029900923371315,
"rps_doc_frac_chars_top_3gram": 0.018882770091295242,
"rps_doc_frac_chars_top_4gram": 0.018882770091295242,
"rps_doc_books_importance": -148.62747192382812,
"rps_doc_books_importance_length_correction": -134.91253662109375,
"rps_doc_openwebtext_importance": -97.57258605957031,
"rps_doc_openwebtext_importance_length_correction": -97.57258605957031,
"rps_doc_wikipedia_importance": -55.161338806152344,
"rps_doc_wikipedia_importance_length_correction": -41.60715866088867
},
"fasttext": {
"dclm": 0.05098294839262962,
"english": 0.9148207306861877,
"fineweb_edu_approx": 1.817875623703003,
"eai_general_math": 0.9932379126548767,
"eai_open_web_math": 0.4627034068107605,
"eai_web_code": 0.9087120294570923
}
}
|
{
"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": "620.0042",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,727,158,992,379,621,000 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
PerlMonks
Re: The code I'm most proud of is:
by dwhite20899 (Friar)
on Mar 27, 2010 at 01:14 UTC ( #831303=note: print w/ replies, xml ) Need Help??
in reply to The code I'm most proud of is:
I'm most proud of the code I wrote in 1986 to monitor fish in real time, so they can be used to detect water quality changes. It's still in use.
http://news.google.com/newspapers?id=HNwfAAAAIBAJ&sjid=WNkEAAAAIBAJ&pg=1499%2C696260
My favorite perl code was a bit of munging I wrote for someone literally halfway around the world, to interpret GPS logs to prove illegal fishing took place.
Comment on Re: The code I'm most proud of is:
Re^2: The code I'm most proud of is:
by Illuminatus (Curate) on Mar 29, 2010 at 15:39 UTC
I didn't realize that the GPS system could detect baited hooks in the water. Maybe this is an 'undocumented feature' that is only accessible via a CPAN module (in which case, I would be *really* proud of that code)? Oh, wait, you meant the 'Global Phishing System'?
ok, I'll shut up now
fnord
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://831303]
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (4)
As of 2015-02-01 12:33 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
My top resolution in 2015 is:
Results (263 votes), past polls
|
{
"url": "http://www.perlmonks.org/index.pl/jacques?node_id=831303",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2015-06",
"warc_metadata": {
"Content-Length": "19260",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UVQPPJVGXLVFENKG5343RTZLY7UBXU45",
"WARC-Concurrent-To": "<urn:uuid:41c71e96-2988-4df8-8574-387f358fccc8>",
"WARC-Date": "2015-02-01T12:34:20Z",
"WARC-IP-Address": "216.92.34.251",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:TEVJMY4EELK3XGLJNBOCY2QEO2T4YJC2",
"WARC-Record-ID": "<urn:uuid:3bd6a1e7-d385-4329-840c-ba132eaa1331>",
"WARC-Target-URI": "http://www.perlmonks.org/index.pl/jacques?node_id=831303",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:62b3da3c-16d0-4105-b75c-0ce712cad81b>"
},
"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,
63,
90,
120,
122,
134,
135,
170,
171,
194,
275,
276,
277,
320,
321,
466,
551,
552,
710,
711,
712,
758,
795,
848,
1118,
1119,
1144,
1145,
1155,
1156,
1164,
1174,
1184,
1185,
1205,
1223,
1236,
1249,
1279,
1284,
1296,
1333,
1334,
1372,
1385,
1423,
1450,
1460,
1473,
1485,
1496,
1514,
1515,
1549,
1550,
1551,
1552,
1553,
1554,
1555,
1556,
1557,
1558,
1559,
1560,
1561,
1562,
1563,
1564,
1565,
1566
],
"line_end_idx": [
63,
90,
120,
122,
134,
135,
170,
171,
194,
275,
276,
277,
320,
321,
466,
551,
552,
710,
711,
712,
758,
795,
848,
1118,
1119,
1144,
1145,
1155,
1156,
1164,
1174,
1184,
1185,
1205,
1223,
1236,
1249,
1279,
1284,
1296,
1333,
1334,
1372,
1385,
1423,
1450,
1460,
1473,
1485,
1496,
1514,
1515,
1549,
1550,
1551,
1552,
1553,
1554,
1555,
1556,
1557,
1558,
1559,
1560,
1561,
1562,
1563,
1564,
1565,
1566,
1601
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1601,
"ccnet_original_nlines": 70,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27176782488822937,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.052770450711250305,
"rps_doc_frac_lines_end_with_ellipsis": 0.014084509573876858,
"rps_doc_frac_no_alph_words": 0.2928759753704071,
"rps_doc_frac_unique_words": 0.6590038537979126,
"rps_doc_mean_word_length": 4.517241477966309,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0.00527703994885087,
"rps_doc_unigram_entropy": 4.863780975341797,
"rps_doc_word_count": 261,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08142493665218353,
"rps_doc_frac_chars_dupe_6grams": 0.08142493665218353,
"rps_doc_frac_chars_dupe_7grams": 0.08142493665218353,
"rps_doc_frac_chars_dupe_8grams": 0.06276506185531616,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03562340885400772,
"rps_doc_frac_chars_top_3gram": 0.04664969816803932,
"rps_doc_frac_chars_top_4gram": 0.055131468921899796,
"rps_doc_books_importance": -152.5773162841797,
"rps_doc_books_importance_length_correction": -138.9370880126953,
"rps_doc_openwebtext_importance": -92.33043670654297,
"rps_doc_openwebtext_importance_length_correction": -92.33043670654297,
"rps_doc_wikipedia_importance": -65.057861328125,
"rps_doc_wikipedia_importance_length_correction": -51.405513763427734
},
"fasttext": {
"dclm": 0.04608219861984253,
"english": 0.925691545009613,
"fineweb_edu_approx": 1.2337766885757446,
"eai_general_math": 0.014241869561374187,
"eai_open_web_math": 0.28662383556365967,
"eai_web_code": 0.000029920000088168308
}
}
|
{
"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": "597.28",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Zoology",
"level_3": "Fishes, Amphibians, and Reptiles"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-235,354,627,254,419,940 |
5
\$\begingroup\$
This post is a follow-follow-up to this post and its follow-up.
In those two posts we managed to speed-up the solution of an Alberi puzzle, and to create a one-tree-per-region puzzle.
The complete code hereafter can be used to create multi-tree-per-region puzzles.
Using DFS I had little chance to find a valid puzzle, so I had to resort to a more exotic genetic algorithm.
The first class is the general genetic algorithm impementation (well the simplest of implementations):
"""Genetic algorithm simplicistic and generic implementation.
"""
import random
class GeneticAlgorithm(object):
"""Genetic algorithm iteration cycle.
The aim is to find an individual with the lowest fitness value
by evolving a population of such individuals.
Each individual is tested against a target value to evaluate its fitness
For each evolution loop part of the best are kept for the next cycle
(retain parameter for evolve method), part of the individuals are kept
indipendently from their fitness (random_select parameter), then these
individuals are mutated according to a mutation rate (mutate paramter),
the rest of the new population is made up crossing randomly picked
individuals.
"""
def __init__(self, individual, fitness, mutate, crossover):
"""Initializes the evolution functions from the problem factory.
Required argument:
individual -- function to generate a new individual. The function can
take a fixed number of parameters to initialize the individual.
This parameters are to be passed to the population method. The
return argument should be a mutable (see mutate).
fitness -- function to score an individual. An individual and the
target will be passed to the function. The target is set by the
evolve method. The function must return a numeric type.
mutate -- function to mutate in-place an individual. The function will
take a mutable as argument
crossover -- function to create a new individual using the genetic
code of the two individuals passed as argument. The return argument
should be a mutable.
"""
self.individual = individual
self.fitness = fitness
self.mutate_individual = mutate
self.crossover_individuals = crossover
def population(self, count, *args):
"""Create a number of individuals (i.e. a population).
Required argument:
count -- number of individuals to be created
*args -- parameters to be passed to the individual generation function
"""
return [self.individual(*args) for _ in range(count)]
def grade(self, pop, target):
"""Find average fitness for a population.
"""
summed = sum(self.fitness(x, target) for x in pop)
return summed / (len(pop) * 1.0)
def evolve(self, pop, target, retain=0.2, random_select=0.1, mutate=0.2):
"""Genetic algorithm evolution loop.
Required argument:
pop --- count of the elements of the population
target -- target value to obtain
Optional arguments:
retain -- Number of elements whith the lowest fitness to keep at
each iteration
random_select -- Rate of selection of elements whithout fitness
filtering
mutate -- Rate of mutation of elements
"""
graded = [(self.fitness(x, target), x) for x in pop]
graded = [x[1] for x in sorted(graded)]
retain_length = int(len(graded) * retain)
parents = graded[:retain_length]
# randomly add other individuals to
# promote genetic diversity
for individual in graded[retain_length:]:
if random_select > random.random():
parents.append(individual)
# mutate some individuals
for individual in parents:
if mutate > random.random():
self.mutate_individual(individual)
# crossover parents to create children
parents_length = len(parents)
desired_length = len(pop) - parents_length
children = []
while len(children) < desired_length:
male = random.randint(0, parents_length-1)
female = random.randint(0, parents_length-1)
if male != female:
male = parents[male]
female = parents[female]
child = self.crossover_individuals(male, female)
children.append(child)
parents.extend(children)
return parents
The class __init__ takes as argument the functions needed to generate an individual, evaluate its fitness against a target, mutate (in place) an individual and crossover two individual to make a third one.
The methods exposed are population, which creates the initial individuals to be evolved, grade, used to evaluate the global fitness of a population, and evolve, the core of the algorithm, that grows-up the population.
The functions I gave to the GeneticAlgorithm class are created by the following class:
"""Fill the empty cells of an Alberi puzzle using a genetic algorithm
"""
from AlberiCover import Alberi
from GeneticAlgorithm import GeneticAlgorithm
import random
class AlberiGeneticFactory(object):
"""Creates the functions needed for the evolution of the GA
"""
def __init__(self, m, n, per_row=2, per_column=2, per_region=2):
"""Initializes the factory parameters.
Required argument:
n -- Number of rows
m -- Number of columns
Optional arguments:
per_row -- Number of trees per row. (Default: 2.)
per_column -- Number of trees per column. (Default: 2.)
per_region -- Number of trees per region. (Default: 2.)
"""
self.m = m
self.n = n
self.size = size = m * n
self.per_row = per_row
self.per_column = per_column
self.per_region = per_region
neighbour = []
for idx in range(size):
row, col = divmod(idx, m)
neighbour.append(
[endr * n + col for endr in range(row - 1, row + 2)
if 0 <= endr < m and endr != row] +
[row * n + endc for endc in range(col - 1, col + 2)
if 0 <= endc < n and endc != col]
)
self.neighbour = neighbour
def individual_function(self):
"""Returns the function to create an Alberi puzzle.
"""
REGIONLESS = Alberi.REGIONLESS
ORL = ord(REGIONLESS)
neighbour = self.neighbour
def individual(puzzle):
""" Take a puzzle and makes a single mutation to it.
The mutation is made on a whitespace, labeling it with the letter
of a neighbouring field.
Required argument:
puzzle -- The puzzle to mutate, in the form of a string of n*m
letters indicating the regions. The whitespace ' ' can be
used as a placeholder for a cell with no region assigned.
"""
neighbour_field = [
set(puzzle[idx] for idx in lst if puzzle[idx] != REGIONLESS)
for lst in neighbour]
options = filter(lambda item: len(item[1])>0, enumerate(neighbour_field))
random.shuffle(options)
mypuzzle = bytearray(puzzle)
for option, vals in options:
if mypuzzle[option] != ORL:
continue
mypuzzle[option] = random.sample(vals, 1)[0]
break
return mypuzzle
return individual
def fitness_function(self):
"""Returns the function to evaluate the fitness an Alberi puzzle.
"""
m = self.m
n = self.n
size = self.size
per_row = self.per_row
per_column = self.per_column
per_region = self.per_region
REGIONLESS = Alberi.REGIONLESS
memo_fitness={}
def fitness(individual, target):
""" Take a partial puzzle and scores it.
The score is equal to the count of empty cells if the puzzle has
but one solution. The score defaults to size if the puzzle has
more than one solution.
The result is memoized, so it can speed up the scoring in case
of duplicate individuals.
Required argument:
individual -- The puzzle to score, in the form of a string of n*m
letters indicating the regions. The whitespace ' ' can be
used as a placeholder for a cell with no region assigned.
target -- unused. Here for compatibility with the GA
"""
puzzle = str(individual)
out = memo_fitness.get(puzzle)
if out:
return out
print(puzzle)
try:
asolver = Alberi(puzzle, m, n, per_row, per_column, per_region)
sols = [x for _, x in zip(xrange(2), asolver)]
out = puzzle.count(REGIONLESS) if len(sols) == 1 else size
except ValueError:
out = size
memo_fitness[puzzle] = out
return out
return fitness
def mutate_function(self):
"""Returns the function to mutate an Alberi puzzle.
"""
m = self.m
n = self.n
size = self.size
per_row = self.per_row
per_column = self.per_column
per_region = self.per_region
neighbour = self.neighbour
ORL = ord(Alberi.REGIONLESS)
def mutate_individual(individual):
""" Take a puzzle and makes a single mutation to it.
The mutation is made in-place.
If the mutation is made on a whitespace, this labels it with
the letter of a neighbouring field.
If the mutation is made on a labeled cell, this verifies that
the remaining cells still form a singly-connected region.
Required argument:
individual -- The puzzle to mutate, in the form of a string of n*m
letters indicating the regions. The whitespace ' ' can be
used as a placeholder for a cell with no region assigned.
"""
neighbour_field = [
set(individual[idx] for idx in lst if individual[idx] != ORL)
for lst in neighbour]
options = filter(
lambda item: len(item[1]) > 0,
enumerate(neighbour_field))
random.shuffle(options)
for option, vals in options:
if individual[option] == ORL:
individual[option] = random.sample(vals, 1)[0]
break
vals.difference_update([individual[option]])
if len(vals) == 0:
continue
# Tests if removing the element option from the region with
# its letter leaves a simply connected region. First make
# the region array with all the indexes of the cells with the
# letter at the index option (but without option), then do a
# BFS algorithm to assign a value (weight) to each cell (in
# this case is the minimum Manhattan distance from the first
# cell in the array). If every cell has been labeled with a
# value than the region is simply connected
region = [idx for idx, v in enumerate(individual)
if v == individual[option] and idx != option]
if len(region)==0:
continue
home = region.pop()
weights = [size+1] * len(region)
curlist = [home]
curval = 0
while len(curlist) > 0:
newlist = []
newval = curval + 1
for list_idx in curlist:
for cell in neighbour[list_idx]:
try:
idx = region.index(cell)
if weights[idx] > newval:
weights[idx] = newval
newlist.append(cell)
except:
pass
curlist = newlist
curval = newval
if all(w <= size for w in weights):
individual[option] = random.sample(vals, 1)[0]
else:
continue
break
return mutate_individual
def crossover_function(self):
"""Returns the function to crossover two puzzles.
"""
def crossover_individuals(male, female):
""" Returns a new puzzle made crossing the puzzles given as input.
The result is simply the first half of the male input joined to
the last half of the female input.
Required argument:
male, female -- The puzzles to crossover, in the form of a
string of n*m letters indicating the regions. The whitespace
' ' can be used as a placeholder for a cell with no region
assigned.
"""
half = len(male) / 2
child = male[:half] + female[half:]
return child
return crossover_individuals
The individuals are created from a starting puzzle by modifying one of the REGIONLESS cells. The fitness of each individual is the count of REGIONLESS cells, if the puzzle has one solution, else the size of the puzzle. The mutation is made by changing a cell to one of its neighbours' label (a check is made to control that the regions are always completely connected). The crossover simply shuffles the first half of a puzzle with the remaining of the other (this is dangerous because no check is made on the validity of the new puzzle).
The main solver class is about the same of the one in the last post. I just added a random parameter to the constructor to easily create random puzzles.
"""Solver for an Alberi puzzle using exact cover
"""
from collections import Iterator
from itertools import product
from ExactCoverExt import ExactCover
class Alberi(Iterator):
"""An iterator that yields the solutions to an Alberi problem.
>>> puzzle = '''
... aabbbccccccc
... accccccdddee
... accfcfdddgee
... afffffddggee
... aafffdddggee
... afffddddgggg
... hffffdiijjjj
... hffffiiikkkk
... hhhfiiiiiklk
... hhhffiilllll
... hhhffiilllll
... hhhfffilllll
... '''
>>> asolver = Alberi(*Alberi.multiline_to_solver_params(puzzle))
>>> print(asolver.decode_solution(next(asolver)))
>>> quit()
aaBbBccccccc
acccccCdddeE
acCfcfdddGee
AfffffDdggee
aafffdddGgEe
AfffDdddgggg
hffffdiiJjJj
hffFfIiikkkk
hhhfiiiiiKlK
hHhffiiLllll
hhhFfIilllll
hHhfffiLllll
"""
REGIONLESS = ' '
VOID = '.'
def __init__(self, puzzle, m, n, per_row=2, per_column=2, per_region=2, random=False):
"""Construct an Alberi instance.
Required argument:
puzzle -- The puzzle to solve, in the form of a string of n*m
letters indicating the regions. The whitespace ' ' can be used
as a placeholder for a cell with no region assigned. The
period '.' can be used to force an empty cell in the solution.
n -- Number of rows
m -- Number of columns
Optional arguments:
per_row -- Number of trees per row. (Default: 2.)
per_column -- Number of trees per column. (Default: 2.)
per_region -- Number of trees per region. (Default: 2.)
random -- True to make a random scheme
"""
self.m = m
self.n = n
self.puzzle = puzzle
REGIONLESS = Alberi.REGIONLESS
VOID = Alberi.VOID
regions = set(self.puzzle).difference(REGIONLESS + VOID)
trees = m * per_column
if trees != n * per_row or (
trees != len(regions) * per_region and len(regions) > 0):
raise ValueError("Bad puzzle instance. '" + puzzle + "'")
def constraints():
for x, y in product(range(m), range(n)):
cell_at_xy = self.puzzle[self.rc2idx(y, x)]
if cell_at_xy != VOID:
yield (y, x), [
('row', y), ('column', x)
] + ([('region', cell_at_xy)]
if cell_at_xy != REGIONLESS else []
) + [
('neighbour', p, q)
for p, q in product(range(x, x+2), range(y, y+2))
if 0 <= p < m and 0 <= q < n
]
def counts():
for x in range(m):
yield ('column', x), per_column
for y in range(n):
yield ('row', y), per_row
for r in regions:
yield ('region', r), per_region
self.solver = ExactCover(dict(constraints()),
counts=dict(counts()),
satisfy=dict(counts()),
random=random)
@staticmethod
def multiline_to_solver_params(puzzle):
"""Construct the set of parameters to call the Alberi constructor.
Required argument:
puzzle -- The puzzle to solve, in the form of a string of n
words, each word consisting of m letters indicating the
regions.
Returns:
puzzle -- A single line representetion of the input
m -- Number of columns
n -- Number of rows
"""
puzzle = puzzle.split()
m = len(puzzle[0])
n = len(puzzle)
puzzle = ''.join(puzzle)
return (puzzle, m, n)
def rc2idx(self, row, col):
"""Return the index of the cell at (row, col)."""
return row * self.m + col
def decode_solution(self, solution):
"""Decode an Alberi solution and return it as a string."""
grid = [
list(self.puzzle[(r*self.m):((r+1)*self.m)])
for r in xrange(self.n)
]
for y, x in solution:
grid[y][x] = grid[y][x].upper()
return '\n'.join(''.join(row) for row in grid)
def solution_to_string(self, solution):
"""Build a single line string for an Alberi solution."""
CELL_OCCUPIED = '*'
CELL_EMPTY = '|'
out = bytearray(CELL_EMPTY * (self.m * self.n))
for y, x in solution:
out[self.rc2idx(y, x)] = CELL_OCCUPIED
return str(out)
def render_board(self, puzzle=None, solution=None):
"""Draw a board for the Alberi problem.
Optional arguments:
puzzle -- If defined overrides self.puzzle (without changing it).
solution -- If defined the 'trees' are drawn inside the board.
"""
CELL_OCCUPIED = '*'
CELL_EMPTY = ' '
m = self.m
n = self.n
if puzzle is None:
puzzle = self.puzzle
lines = [
puzzle[(r * m):((r + 1) * m)]
for r in xrange(n)
]
hdiff = [
[
'|' if p[0] != p[1] else ' '
for p in zip(line[:-1], line[1:])
] + ['|']
for line in lines
]
vdiff = [
[
'---' if lines[r][c] != lines[r+1][c] else ' '
for c in xrange(m)
]
for r in xrange(n-1)
]
vdiff.append(['---' for c in xrange(m)])
if solution is not None:
grid = [
list(CELL_EMPTY * self.m)
for r in xrange(self.n)
]
for y, x in solution:
grid[y][x] = CELL_OCCUPIED
lines = [''.join(row) for row in grid]
out = '+' + '---+' * m
for r in xrange(n):
out += '\n|' + ''.join([
' {0} {1}'.format(q[0], q[1])
for q in zip(lines[r], hdiff[r])
])
out += '\n+' + ''.join([
'{0}+'.format(q)
for q in vdiff[r]
])
return out
def __next__(self):
return next(self.solver)
next = __next__ # for compatibility with Python 2
The AlberiMaker module is where the pieces are glued toghether.
"""Find an Alberi puzzle using a genetic algorithm
"""
from AlberiCover import Alberi
from random import sample
from string import ascii_letters
from collections import defaultdict
from GeneticAlgorithm import GeneticAlgorithm
from AlberiGenetic import AlberiGeneticFactory
from itertools import islice, combinations
def one_per_region_creator(m, n, per_row, per_column, origsol):
"""Creates a single solution Alberi scheme growing regions around the
trees positioned in the coordinates at origsol.
Required argument:
n -- Number of rows
m -- Number of columns
per_row -- Number of trees per row.
per_column -- Number of trees per column.
origsol -- Coordinates of the trees.
"""
size = m * n
REGIONLESS = Alberi.REGIONLESS
ORL = ord(REGIONLESS)
OVOID = ord(Alberi.VOID)
# Assigns a letter to each tree in the original solution
puzzle = bytearray(REGIONLESS * size)
asolver = Alberi(str(puzzle), m, n, per_row, per_column, per_region=1)
for coords, letter in zip(origsol, ascii_letters):
y, x = coords
puzzle[asolver.rc2idx(y, x)] = letter
# Just a debug output to verify that the solution did not change
print(str(puzzle))
asolver = Alberi(str(puzzle), m, n, per_row, per_column, per_region=1)
print(asolver.solution_to_string(next(asolver)))
# An array of neighbour's positions, to speed up calculations
neighbour = []
for idx in range(size):
row, col = divmod(idx, m)
neighbour.append(
[endr * n + col for endr in range(row - 1, row + 2)
if 0 <= endr < m and endr != row] +
[row * n + endc for endc in range(col - 1, col + 2)
if 0 <= endc < n and endc != col]
)
def recurse(puzzle):
"""Backtracking function. Assigns a letter to an empty cell,
neighbouring a cell with a letter assigned, and verify that the
new scheme has only one solution
"""
# Makes a set of neighbours for each empty cell in the puzzle
neighbour_field = [
set(puzzle[idx] for idx in lst
if puzzle[idx] != ORL and puzzle[idx] != OVOID)
for lst in neighbour]
# Sort the list of the neighbours placing first the cells with few
# neighbouring fields and then removes the cells without neighbours
best_list = sorted(enumerate(neighbour_field), key=lambda j: len(j[1]))
best_list = filter(lambda item: len(item[1]) > 0, best_list)
mypuzzle = puzzle[:]
for item in best_list:
best = item[0]
if mypuzzle[best] != ORL:
continue
vals = item[1]
for v in vals:
mypuzzle[best] = v
asolver = Alberi(
str(mypuzzle), m, n, per_row, per_column, per_region=1
)
sols = list(islice(asolver, None, 2))
if len(sols) == 1:
print(str(mypuzzle))
if mypuzzle.count(REGIONLESS) == 0:
yield mypuzzle
else:
for rec_puzzle in recurse(mypuzzle):
yield rec_puzzle
mypuzzle[best] = REGIONLESS
for scheme in recurse(puzzle):
print(asolver.render_board(puzzle=str(scheme)))
yield scheme
def region_factory(m, n, per_row, per_column, per_region, scheme):
"""Joins two or more regions of a one-tree-per-region scheme, and
returns a scheme with per_region trees per region.
The returned scheme usually have more than one solution.
Required argument:
n -- Number of rows
m -- Number of columns
per_row -- Number of trees per row.
per_column -- Number of trees per column.
per_region -- Number of trees per region.
scheme -- Initial scheme. Must be a one-tree-per-region scheme.
"""
if per_region == 1:
yield scheme
return
region_count = m * per_row / per_region
size = m * n
# A dictionary with the region identifier as key and a set of neighbouring
# regions' identifiers as value
neighbour_region = defaultdict(set)
for idx, v in enumerate(scheme):
row, col = divmod(idx, m)
for endr in range(row - 1, row + 2):
if 0 <= endr < m and endr != row:
p = scheme[endr * n + col]
if p == v or p == ord(Alberi.VOID):
continue
neighbour_region[v].add(p)
for endc in range(col - 1, col + 2):
if 0 <= endc < n and endc != col:
p = scheme[row * n + endc]
if p == v:
continue
neighbour_region[v].add(p)
def validate_connectivity(myneighbour):
"""Tests if the graph described in myneighbour is completely connected.
First make the region array with all the indexes of the cells
uncovered. Then do a BFS algorithm to assign a value (weight) to
each cell (in this case is the minimum Manhattan distance from the
first cell in the array). If every cell has been labeled with a
value than the graph is completely connected
"""
region = myneighbour.keys()
if len(region)==0:
return True
home = region[0]
weights = [size+1] * len(region)
weights[region.index(home)] = 0
curlist = [home]
curval = 0
while len(curlist) > 0:
newlist = []
newval = curval + 1
for key in curlist:
for item in myneighbour[key]:
try:
idx = region.index(item)
if weights[idx] > newval:
weights[idx] = newval
newlist.append(item)
except ValueError:
pass
curlist = newlist
curval = newval
if any(item>size for item in weights):
return False
return True
def region_select_recurse(neighbour_region, selection, depth):
"""Depth first search for the groups of regions.
Selects one of the remaining items in the list of neighbours of the
last item selected.
"""
neighbour_idx = [
k for k, q in neighbour_region.iteritems()
if len(q.intersection(selection))>0 and not k in selection]
myneighbour = {
k: q
for k, q in neighbour_region.iteritems()
if k != selection[-1]
}
best_list = sorted(neighbour_idx, key=lambda j: len(myneighbour[j].difference(selection)))
for v in best_list:
if depth == 1:
yield selection + (v,)
return
if len(myneighbour[v]) == 0:
continue
for p in region_select_recurse(myneighbour, selection + (v,), depth - 1):
yield p
def super_region_recurse(neighbour_region, super_regions):
"""Backtracking function. For each region take some element in the
set of neighbouring regions and mark these items as a super-region
"""
best_list = sorted(
neighbour_region,
key=lambda j: len(neighbour_region[j]))
for v in best_list:
no_group = True
if len(neighbour_region[v]) == 0:
return
for p in region_select_recurse(neighbour_region, (v,), per_region - 1):
no_group = False
myneighbour = {
k: q.difference(p)
for k, q in neighbour_region.iteritems() if k != v and k not in p
}
if not validate_connectivity(myneighbour):
continue
mysuper_regions = super_regions + [p]
if len(mysuper_regions) == region_count:
yield mysuper_regions
else:
for out in super_region_recurse(myneighbour, mysuper_regions):
yield out
if no_group:
return
for super_region in super_region_recurse(neighbour_region, []):
translator = bytearray(256)
for c, l in zip(super_region, ascii_letters):
for v in c:
translator[v] = l
translator[ord(Alberi.VOID)] = Alberi.VOID
scheme2 = scheme.translate(translator)
print(str(scheme2))
yield scheme2
def reduce_scheme(m, n, per_row, per_column, per_region, scheme3, origsol):
"""Blanks as much cell as is possible in a region keeping the trees
in origsol connected by a strip of cells.
The returned scheme usually have more than one solution.
Required argument:
n -- Number of rows
m -- Number of columns
per_row -- Number of trees per row.
per_column -- Number of trees per column.
per_region -- Number of trees per region.
scheme3 -- Initial scheme. Must be a one-tree-per-region scheme.
origsol -- Positions of the trees.
"""
if per_region == 1:
for idx in range(len(scheme3)):
if divmod(idx, m) not in origsol:
scheme3[idx] = Alberi.REGIONLESS
return
size = m * n
for letter in set(scheme3):
region = [divmod(idx, m) for idx, value in enumerate(scheme3) if value == letter]
pivots = set(region).intersection(origsol)
# Uses Dijkstra algorithm to find the best path between the cells.
# home is the first of the trees, weights is a list of the distances
# from home, origin is the previous cell in the best path. curlist
# holds the array of the cells to test in the next iteration.
home = pivots.pop()
weights = [size+1] * len(region)
origin = [None] * len(region)
weights[region.index(home)] = 0
curlist = [home]
curval = 0
while any(weights[region.index(pivot)] > size for pivot in pivots):
newlist = []
newval = curval + 1
for r, c in curlist:
for cell in [(r + 1, c), (r - 1, c), (r, c + 1), (r, c - 1)]:
try:
idx = region.index(cell)
if weights[idx] > newval:
weights[idx] = newval
origin[idx] = (r, c)
newlist.append(cell)
except ValueError:
pass
curlist = newlist
curval = newval
path = set()
for pivot in pivots:
path.add(pivot)
while origin[region.index(pivot)]:
pivot = origin[region.index(pivot)]
path.add(pivot)
for idx, l in enumerate(scheme3):
if l == letter:
cell = divmod(idx, m)
if cell in path:
continue
scheme3[idx] = Alberi.REGIONLESS
def make_it(m, n, per_row, per_column, per_region):
"""Creates a single solution Alberi scheme.
This function find the solution using the following sub-steps:
* Create a solution vector with the desired trees per row and column.
* Create a single-tree-per-region puzzle around these solutions.
* Group the regions of this puzzle to have super-regions with enough
trees per region.
* Leave only a strip of cells joining the solution cells to ensure having
a single solution puzzle. The remaining cells become REGIONLESS.
* Evolve this scheme decreasing the number of REGIONLESS cells while
mantaining a single solution for the result.
* When the scheme has no more REGIONLESS cells, return it.
Required argument:
n -- Number of rows
m -- Number of columns
per_row -- Number of trees per row.
per_column -- Number of trees per column.
per_region -- Number of trees per region.
"""
size = m * n
alberiGeneticFactory = AlberiGeneticFactory(
m, n,
per_row, per_column, per_region)
alberiGenetic = GeneticAlgorithm(
alberiGeneticFactory.individual_function(),
alberiGeneticFactory.fitness_function(),
alberiGeneticFactory.mutate_function(),
alberiGeneticFactory.crossover_function())
target = 0
p_count = 40
asolver = Alberi('a' * size, m, n, per_row, per_column, m * per_row, True)
origsol = next(asolver)
one_per_region = one_per_region_creator(m, n, per_row, per_column, origsol)
for scheme in one_per_region:
for scheme3 in region_factory(m, n, per_row, per_column, per_region, scheme):
str_scheme = str(scheme3)
print(asolver.render_board(puzzle=str_scheme, solution=origsol))
reduce_scheme(m, n, per_row, per_column, per_region, scheme3, origsol)
print(str(scheme3))
lst = [idx for idx, cell in enumerate(scheme3) if cell != ord(Alberi.REGIONLESS)]
print(asolver.render_board(puzzle=str_scheme, solution=[divmod(idx, m) for idx in lst]))
p = alberiGenetic.population(p_count, str(scheme3))
fitness_history = [alberiGenetic.grade(p, target),]
while alberiGenetic.fitness(p[0], target) > 0:
p = alberiGenetic.evolve(p, target)
population_grade = alberiGenetic.grade(p, target)
fitness_history.append(population_grade)
print('{0} {1} {2}'.format(str(p[0]), p[0].count(' '), population_grade))
if population_grade == size:
break
else:
return str(p[0])
if __name__ == '__main__':
m = n = 9
per_row = 2
per_column = 2
per_region = 2
asolver = Alberi('a' * (m * n), m, n, per_row, per_column, m * per_row)
puzzle = make_it(m, n, per_row, per_column, per_region)
print(asolver.render_board(puzzle=puzzle))
In this module two iterators are defined: one_per_region and region_factory.
The first one takes the solutions of a regionless puzzle and grow regions around those cells, keeping a single solution for the puzzle.
The second one takes the regions from the former and take groups of regions to make super-regions that will accomodate more than a tree.
This step is needed only to group solutions, in fact, in the reduce_scheme function, we keep only a strip of cells connecting the solutions of the original scheme.
Now we (should) have a single-solution-multi-tree-per-region puzzle, with many holes inside.
Here it cames the genetic algorithm: we feed this puzzle as the seed for the individuals and let the population evolve.
Everything I described is implemented in the make_it function, that takes only the carachteristics of the puzzle and (hopefully) outputs a complete puzzle.
Everything is fine you say? Well, the time for a 12 by 12 scheme like the one in the first post is about 24 hours. The number of puzzles tested to find it is not so large: in one of the tests I measured 6935 tentatives (after memoization of the fitness), so the bottleneck is still the puzzle solver. Maybe a change can be made to the ExactCover to solve more than one puzzle at the same time, maybe accepting a topology change after a solution is found... but this would be a really hard task.
Other problems are
• sometimes, the creation of the starting solution vector is too long (maybe the random parameter is not so good for ExactCover);
• sometimes the region_factory recursion seem to get into a neverending loop (we need some euristic for the task).
Any suggestions are very welcome... squeeze your brains and let me know!!
PS. I must credit Will Larson for his genetic algorithm implementation. Sorry for the delay but I lost the source link.
\$\endgroup\$
1 Answer 1
2
\$\begingroup\$
Your code looks good, well organised and well documented.
Here are a few details that you could probably improve (I haven't read the whole code).
float division
I assume summed / (len(pop) * 1.0) is just a hacky way to get a float division. Float division is the default behavior in Python 3 (you use // for integer division).
Thus, a probably clearer way to have what you want is to use : from __future__ import division .
Sort with key
The following code is quite confusing :
graded = [(self.fitness(x, target), x) for x in pop]
graded = [x[1] for x in sorted(graded)]
I guess you are trying to get elements from pop sorted by their fitness by constructing tuples, sorting them and then retrieving the initial element from the tuple.
Good new, the sorted function has a parameter key to do exactly this.
graded = sorted(pop, key=lambda e: fitness(e, target))
(This is not tested)
Try except pass
This piece of code
try:
whatever
except:
pass
gave me shivers.
You should (almost) always specify the type of Exception you are trying to catch. Also, there is usually no good reason to pass on exception catching. More about this : Why is “except: pass” a bad programming practice?, The Most Diabolical Python Antipattern .
Consistent documentation
Your function docstrings use both imperative mode ("do something") and declarative mode ("does something").
As a side-note, PEP 257 suggests :
The docstring is a phrase ending in a period. It prescribes the function or method's effect as a command ("Do this", "Return that"), not as a description; e.g. don't write "Returns the pathname ...".
(And I think that pep257 tries to detect this).
Looping over a grid
self.m = m
self.n = n
self.size = size = m * n
for idx in range(size):
row, col = divmod(idx, m)
...
Seems a bit unnatural. You know the two dimensions of a grid and you want to iterate over all cells. The natural (yet verbose) way to do so is probably to have 2 nested loops but you are using some mathematical trick in order to have a simple loop.
You might like to know that itertools offers a solution to this exact problem : itertools.product.
It works like this :
>>> n, m = 2, 3
>>> [divmod(i, m) for i in range(n*m)]
[(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2)]
>>> list(itertools.product(range(n), range(m)))
[(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2)]
\$\endgroup\$
3
• \$\begingroup\$ Thank you for your valuable help. About the try/except, do your complains refer to the one in mutate_individual, or do you also think the except ValueError are a bad habit? \$\endgroup\$
– N74
Dec 21, 2015 at 16:25
• 1
\$\begingroup\$ I was thinking about with no exception type provided. \$\endgroup\$
– SylvainD
Dec 21, 2015 at 16:26
• \$\begingroup\$ OK, I agree with you... You managed to spot the only one I missed while reviewing the code. \$\endgroup\$
– N74
Dec 21, 2015 at 16:30
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://codereview.stackexchange.com/questions/111033/alberi-creator-keepalive",
"source_domain": "codereview.stackexchange.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "207763",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DVP3OKKX4V62OQF7UTB6HM47TYT4UOQ6",
"WARC-Concurrent-To": "<urn:uuid:be227ba5-7d61-4bcc-9df2-83b8315a6066>",
"WARC-Date": "2023-12-06T09:04:58Z",
"WARC-IP-Address": "104.18.43.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PESM6L2IHME4GMG6AFWXZLS5C5XJJUSN",
"WARC-Record-ID": "<urn:uuid:0c9a385e-12a0-4776-b306-789abe0ff22d>",
"WARC-Target-URI": "https://codereview.stackexchange.com/questions/111033/alberi-creator-keepalive",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1a9b4ca9-fb8e-43c1-8d9d-cdf21ac23a6f>"
},
"warc_info": "isPartOf: CC-MAIN-2023-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-150\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
18,
19,
83,
84,
204,
205,
286,
287,
396,
397,
500,
501,
563,
567,
568,
582,
583,
615,
657,
658,
725,
775,
776,
853,
854,
927,
1002,
1077,
1153,
1224,
1241,
1249,
1313,
1386,
1387,
1414,
1492,
1568,
1643,
1705,
1779,
1855,
1923,
2002,
2041,
2116,
2196,
2229,
2241,
2278,
2309,
2349,
2396,
2397,
2437,
2500,
2501,
2528,
2581,
2660,
2672,
2734,
2735,
2769,
2819,
2831,
2890,
2931,
2932,
3010,
3055,
3056,
3083,
3139,
3180,
3181,
3209,
3282,
3309,
3381,
3403,
3450,
3462,
3523,
3571,
3621,
3662,
3706,
3742,
3792,
3840,
3883,
3917,
3952,
3993,
4044,
4091,
4129,
4180,
4202,
4248,
4303,
4360,
4391,
4428,
4469,
4534,
4573,
4606,
4629,
4630,
4836,
4837,
5055,
5056,
5143,
5144,
5214,
5218,
5249,
5295,
5309,
5310,
5346,
5410,
5418,
5487,
5534,
5535,
5562,
5590,
5621,
5622,
5650,
5708,
5772,
5836,
5837,
5849,
5850,
5869,
5888,
5921,
5952,
5989,
6026,
6027,
6050,
6082,
6120,
6150,
6218,
6274,
6342,
6396,
6410,
6445,
6446,
6481,
6541,
6553,
6592,
6622,
6657,
6658,
6690,
6755,
6756,
6834,
6871,
6872,
6903,
6978,
7052,
7126,
7142,
7174,
7251,
7289,
7375,
7411,
7412,
7453,
7494,
7538,
7567,
7628,
7650,
7678,
7679,
7705,
7706,
7738,
7812,
7824,
7843,
7862,
7887,
7918,
7955,
7992,
7993,
8032,
8033,
8057,
8098,
8151,
8152,
8229,
8304,
8340,
8341,
8416,
8454,
8455,
8486,
8564,
8638,
8712,
8777,
8793,
8830,
8873,
8893,
8920,
8946,
8963,
9043,
9106,
9181,
9212,
9239,
9278,
9301,
9302,
9325,
9326,
9357,
9417,
9429,
9448,
9467,
9492,
9523,
9560,
9597,
9632,
9633,
9670,
9671,
9714,
9779,
9780,
9823,
9824,
9897,
9945,
10019,
10089,
10090,
10121,
10200,
10274,
10348,
10364,
10396,
10474,
10512,
10542,
10589,
10633,
10669,
10670,
10711,
10757,
10824,
10850,
10851,
10912,
10947,
10976,
10977,
11053,
11127,
11205,
11282,
11358,
11435,
11511,
11571,
11637,
11703,
11738,
11767,
11803,
11852,
11885,
11912,
11952,
11985,
12025,
12070,
12127,
12160,
12217,
12275,
12333,
12390,
12426,
12463,
12501,
12537,
12538,
12590,
12657,
12679,
12708,
12730,
12731,
12764,
12765,
12799,
12857,
12869,
12870,
12919,
12998,
12999,
13075,
13122,
13123,
13154,
13225,
13302,
13377,
13403,
13419,
13452,
13500,
13525,
13526,
13563,
13564,
14103,
14104,
14257,
14258,
14307,
14311,
14344,
14374,
14411,
14412,
14436,
14503,
14504,
14525,
14546,
14567,
14588,
14609,
14630,
14651,
14672,
14693,
14714,
14735,
14756,
14777,
14789,
14858,
14912,
14927,
14944,
14961,
14978,
14995,
15012,
15029,
15046,
15063,
15080,
15097,
15114,
15131,
15132,
15140,
15161,
15176,
15177,
15268,
15309,
15310,
15337,
15407,
15482,
15551,
15626,
15654,
15685,
15686,
15714,
15772,
15836,
15900,
15947,
15948,
15960,
15979,
15998,
16027,
16066,
16093,
16094,
16159,
16190,
16227,
16301,
16371,
16398,
16451,
16511,
16550,
16586,
16636,
16686,
16746,
16772,
16816,
16890,
16943,
16965,
16987,
17018,
17066,
17097,
17139,
17169,
17217,
17271,
17327,
17384,
17432,
17433,
17451,
17495,
17570,
17571,
17598,
17666,
17734,
17755,
17756,
17773,
17833,
17864,
17892,
17904,
17936,
17963,
17987,
18020,
18050,
18051,
18083,
18141,
18175,
18176,
18217,
18284,
18301,
18358,
18394,
18404,
18434,
18478,
18533,
18534,
18578,
18643,
18671,
18696,
18697,
18753,
18783,
18834,
18858,
18859,
18915,
18963,
18964,
18992,
19066,
19137,
19149,
19177,
19202,
19203,
19222,
19241,
19268,
19301,
19319,
19361,
19392,
19402,
19420,
19434,
19479,
19529,
19551,
19581,
19591,
19609,
19623,
19688,
19723,
19737,
19770,
19780,
19829,
19862,
19883,
19925,
19965,
19979,
20013,
20056,
20107,
20138,
20166,
20203,
20249,
20298,
20313,
20350,
20383,
20417,
20432,
20433,
20452,
20453,
20477,
20510,
20511,
20577,
20578,
20642,
20643,
20694,
20698,
20729,
20755,
20788,
20824,
20870,
20917,
20960,
20961,
21025,
21099,
21151,
21152,
21175,
21199,
21226,
21266,
21312,
21353,
21361,
21378,
21413,
21439,
21468,
21469,
21530,
21572,
21647,
21702,
21724,
21770,
21771,
21840,
21863,
21938,
21991,
21992,
22058,
22077,
22105,
22139,
22165,
22229,
22281,
22345,
22395,
22405,
22406,
22431,
22500,
22572,
22613,
22625,
22695,
22723,
22766,
22826,
22860,
22861,
22936,
23012,
23092,
23161,
23162,
23191,
23222,
23249,
23287,
23312,
23339,
23366,
23401,
23435,
23510,
23528,
23582,
23617,
23658,
23714,
23753,
23779,
23840,
23885,
23925,
23926,
23961,
24017,
24038,
24039,
24040,
24107,
24177,
24232,
24233,
24294,
24295,
24318,
24342,
24369,
24409,
24455,
24501,
24569,
24577,
24601,
24622,
24637,
24638,
24682,
24699,
24700,
24779,
24815,
24855,
24892,
24926,
24971,
25017,
25060,
25112,
25141,
25184,
25229,
25275,
25318,
25345,
25374,
25417,
25418,
25462,
25542,
25612,
25685,
25760,
25832,
25885,
25897,
25933,
25960,
25984,
26009,
26050,
26090,
26115,
26134,
26166,
26191,
26223,
26255,
26301,
26326,
26375,
26425,
26475,
26524,
26563,
26592,
26622,
26650,
26651,
26698,
26723,
26743,
26744,
26811,
26868,
26944,
26972,
26984,
27010,
27065,
27137,
27161,
27178,
27231,
27265,
27275,
27276,
27375,
27376,
27404,
27431,
27470,
27493,
27494,
27535,
27560,
27561,
27647,
27671,
27672,
27735,
27810,
27885,
27897,
27925,
27955,
28007,
28008,
28036,
28064,
28110,
28133,
28217,
28250,
28282,
28321,
28407,
28425,
28426,
28485,
28514,
28515,
28569,
28626,
28668,
28690,
28773,
28807,
28832,
28855,
28856,
28924,
28960,
29014,
29038,
29072,
29123,
29170,
29171,
29199,
29221,
29222,
29223,
29299,
29371,
29417,
29418,
29479,
29480,
29503,
29527,
29554,
29594,
29640,
29686,
29755,
29794,
29802,
29826,
29866,
29912,
29961,
29976,
29977,
29994,
30026,
30116,
30167,
30168,
30243,
30320,
30395,
30465,
30493,
30534,
30572,
30612,
30637,
30656,
30732,
30757,
30789,
30822,
30900,
30925,
30974,
31024,
31074,
31123,
31172,
31211,
31240,
31270,
31298,
31299,
31320,
31349,
31377,
31424,
31476,
31508,
31509,
31551,
31579,
31617,
31650,
31679,
31728,
31729,
31730,
31782,
31830,
31831,
31898,
31972,
32041,
32114,
32138,
32216,
32287,
32360,
32411,
32474,
32475,
32498,
32522,
32549,
32589,
32635,
32681,
32689,
32706,
32707,
32756,
32770,
32811,
32812,
32850,
32902,
32951,
32999,
33050,
33051,
33066,
33083,
33084,
33163,
33191,
33271,
33272,
33306,
33392,
33430,
33507,
33590,
33622,
33716,
33817,
33818,
33882,
33946,
34005,
34057,
34123,
34180,
34270,
34315,
34341,
34359,
34392,
34393,
34394,
34421,
34435,
34451,
34470,
34489,
34490,
34566,
34626,
34673,
34674,
34751,
34752,
34888,
34889,
35026,
35027,
35191,
35192,
35285,
35286,
35406,
35407,
35563,
35564,
36059,
36060,
36079,
36080,
36212,
36329,
36330,
36404,
36405,
36525,
36526,
36540,
36541,
36552,
36553,
36555,
36571,
36572,
36630,
36631,
36719,
36720,
36735,
36736,
36902,
36903,
37000,
37001,
37015,
37016,
37056,
37057,
37114,
37158,
37159,
37324,
37325,
37395,
37396,
37451,
37452,
37473,
37474,
37490,
37491,
37510,
37511,
37540,
37577,
37609,
37642,
37643,
37660,
37661,
37922,
37923,
37948,
37949,
38057,
38058,
38093,
38094,
38294,
38295,
38343,
38344,
38364,
38365,
38380,
38395,
38424,
38425,
38453,
38487,
38499,
38500,
38749,
38750,
38849,
38850,
38871,
38872,
38888,
38927,
38976,
39024,
39073,
39087,
39089,
39296,
39306,
39332,
39338,
39426,
39441,
39467,
39593,
39603,
39629,
39630,
39642,
39643,
39799,
39800
],
"line_end_idx": [
2,
18,
19,
83,
84,
204,
205,
286,
287,
396,
397,
500,
501,
563,
567,
568,
582,
583,
615,
657,
658,
725,
775,
776,
853,
854,
927,
1002,
1077,
1153,
1224,
1241,
1249,
1313,
1386,
1387,
1414,
1492,
1568,
1643,
1705,
1779,
1855,
1923,
2002,
2041,
2116,
2196,
2229,
2241,
2278,
2309,
2349,
2396,
2397,
2437,
2500,
2501,
2528,
2581,
2660,
2672,
2734,
2735,
2769,
2819,
2831,
2890,
2931,
2932,
3010,
3055,
3056,
3083,
3139,
3180,
3181,
3209,
3282,
3309,
3381,
3403,
3450,
3462,
3523,
3571,
3621,
3662,
3706,
3742,
3792,
3840,
3883,
3917,
3952,
3993,
4044,
4091,
4129,
4180,
4202,
4248,
4303,
4360,
4391,
4428,
4469,
4534,
4573,
4606,
4629,
4630,
4836,
4837,
5055,
5056,
5143,
5144,
5214,
5218,
5249,
5295,
5309,
5310,
5346,
5410,
5418,
5487,
5534,
5535,
5562,
5590,
5621,
5622,
5650,
5708,
5772,
5836,
5837,
5849,
5850,
5869,
5888,
5921,
5952,
5989,
6026,
6027,
6050,
6082,
6120,
6150,
6218,
6274,
6342,
6396,
6410,
6445,
6446,
6481,
6541,
6553,
6592,
6622,
6657,
6658,
6690,
6755,
6756,
6834,
6871,
6872,
6903,
6978,
7052,
7126,
7142,
7174,
7251,
7289,
7375,
7411,
7412,
7453,
7494,
7538,
7567,
7628,
7650,
7678,
7679,
7705,
7706,
7738,
7812,
7824,
7843,
7862,
7887,
7918,
7955,
7992,
7993,
8032,
8033,
8057,
8098,
8151,
8152,
8229,
8304,
8340,
8341,
8416,
8454,
8455,
8486,
8564,
8638,
8712,
8777,
8793,
8830,
8873,
8893,
8920,
8946,
8963,
9043,
9106,
9181,
9212,
9239,
9278,
9301,
9302,
9325,
9326,
9357,
9417,
9429,
9448,
9467,
9492,
9523,
9560,
9597,
9632,
9633,
9670,
9671,
9714,
9779,
9780,
9823,
9824,
9897,
9945,
10019,
10089,
10090,
10121,
10200,
10274,
10348,
10364,
10396,
10474,
10512,
10542,
10589,
10633,
10669,
10670,
10711,
10757,
10824,
10850,
10851,
10912,
10947,
10976,
10977,
11053,
11127,
11205,
11282,
11358,
11435,
11511,
11571,
11637,
11703,
11738,
11767,
11803,
11852,
11885,
11912,
11952,
11985,
12025,
12070,
12127,
12160,
12217,
12275,
12333,
12390,
12426,
12463,
12501,
12537,
12538,
12590,
12657,
12679,
12708,
12730,
12731,
12764,
12765,
12799,
12857,
12869,
12870,
12919,
12998,
12999,
13075,
13122,
13123,
13154,
13225,
13302,
13377,
13403,
13419,
13452,
13500,
13525,
13526,
13563,
13564,
14103,
14104,
14257,
14258,
14307,
14311,
14344,
14374,
14411,
14412,
14436,
14503,
14504,
14525,
14546,
14567,
14588,
14609,
14630,
14651,
14672,
14693,
14714,
14735,
14756,
14777,
14789,
14858,
14912,
14927,
14944,
14961,
14978,
14995,
15012,
15029,
15046,
15063,
15080,
15097,
15114,
15131,
15132,
15140,
15161,
15176,
15177,
15268,
15309,
15310,
15337,
15407,
15482,
15551,
15626,
15654,
15685,
15686,
15714,
15772,
15836,
15900,
15947,
15948,
15960,
15979,
15998,
16027,
16066,
16093,
16094,
16159,
16190,
16227,
16301,
16371,
16398,
16451,
16511,
16550,
16586,
16636,
16686,
16746,
16772,
16816,
16890,
16943,
16965,
16987,
17018,
17066,
17097,
17139,
17169,
17217,
17271,
17327,
17384,
17432,
17433,
17451,
17495,
17570,
17571,
17598,
17666,
17734,
17755,
17756,
17773,
17833,
17864,
17892,
17904,
17936,
17963,
17987,
18020,
18050,
18051,
18083,
18141,
18175,
18176,
18217,
18284,
18301,
18358,
18394,
18404,
18434,
18478,
18533,
18534,
18578,
18643,
18671,
18696,
18697,
18753,
18783,
18834,
18858,
18859,
18915,
18963,
18964,
18992,
19066,
19137,
19149,
19177,
19202,
19203,
19222,
19241,
19268,
19301,
19319,
19361,
19392,
19402,
19420,
19434,
19479,
19529,
19551,
19581,
19591,
19609,
19623,
19688,
19723,
19737,
19770,
19780,
19829,
19862,
19883,
19925,
19965,
19979,
20013,
20056,
20107,
20138,
20166,
20203,
20249,
20298,
20313,
20350,
20383,
20417,
20432,
20433,
20452,
20453,
20477,
20510,
20511,
20577,
20578,
20642,
20643,
20694,
20698,
20729,
20755,
20788,
20824,
20870,
20917,
20960,
20961,
21025,
21099,
21151,
21152,
21175,
21199,
21226,
21266,
21312,
21353,
21361,
21378,
21413,
21439,
21468,
21469,
21530,
21572,
21647,
21702,
21724,
21770,
21771,
21840,
21863,
21938,
21991,
21992,
22058,
22077,
22105,
22139,
22165,
22229,
22281,
22345,
22395,
22405,
22406,
22431,
22500,
22572,
22613,
22625,
22695,
22723,
22766,
22826,
22860,
22861,
22936,
23012,
23092,
23161,
23162,
23191,
23222,
23249,
23287,
23312,
23339,
23366,
23401,
23435,
23510,
23528,
23582,
23617,
23658,
23714,
23753,
23779,
23840,
23885,
23925,
23926,
23961,
24017,
24038,
24039,
24040,
24107,
24177,
24232,
24233,
24294,
24295,
24318,
24342,
24369,
24409,
24455,
24501,
24569,
24577,
24601,
24622,
24637,
24638,
24682,
24699,
24700,
24779,
24815,
24855,
24892,
24926,
24971,
25017,
25060,
25112,
25141,
25184,
25229,
25275,
25318,
25345,
25374,
25417,
25418,
25462,
25542,
25612,
25685,
25760,
25832,
25885,
25897,
25933,
25960,
25984,
26009,
26050,
26090,
26115,
26134,
26166,
26191,
26223,
26255,
26301,
26326,
26375,
26425,
26475,
26524,
26563,
26592,
26622,
26650,
26651,
26698,
26723,
26743,
26744,
26811,
26868,
26944,
26972,
26984,
27010,
27065,
27137,
27161,
27178,
27231,
27265,
27275,
27276,
27375,
27376,
27404,
27431,
27470,
27493,
27494,
27535,
27560,
27561,
27647,
27671,
27672,
27735,
27810,
27885,
27897,
27925,
27955,
28007,
28008,
28036,
28064,
28110,
28133,
28217,
28250,
28282,
28321,
28407,
28425,
28426,
28485,
28514,
28515,
28569,
28626,
28668,
28690,
28773,
28807,
28832,
28855,
28856,
28924,
28960,
29014,
29038,
29072,
29123,
29170,
29171,
29199,
29221,
29222,
29223,
29299,
29371,
29417,
29418,
29479,
29480,
29503,
29527,
29554,
29594,
29640,
29686,
29755,
29794,
29802,
29826,
29866,
29912,
29961,
29976,
29977,
29994,
30026,
30116,
30167,
30168,
30243,
30320,
30395,
30465,
30493,
30534,
30572,
30612,
30637,
30656,
30732,
30757,
30789,
30822,
30900,
30925,
30974,
31024,
31074,
31123,
31172,
31211,
31240,
31270,
31298,
31299,
31320,
31349,
31377,
31424,
31476,
31508,
31509,
31551,
31579,
31617,
31650,
31679,
31728,
31729,
31730,
31782,
31830,
31831,
31898,
31972,
32041,
32114,
32138,
32216,
32287,
32360,
32411,
32474,
32475,
32498,
32522,
32549,
32589,
32635,
32681,
32689,
32706,
32707,
32756,
32770,
32811,
32812,
32850,
32902,
32951,
32999,
33050,
33051,
33066,
33083,
33084,
33163,
33191,
33271,
33272,
33306,
33392,
33430,
33507,
33590,
33622,
33716,
33817,
33818,
33882,
33946,
34005,
34057,
34123,
34180,
34270,
34315,
34341,
34359,
34392,
34393,
34394,
34421,
34435,
34451,
34470,
34489,
34490,
34566,
34626,
34673,
34674,
34751,
34752,
34888,
34889,
35026,
35027,
35191,
35192,
35285,
35286,
35406,
35407,
35563,
35564,
36059,
36060,
36079,
36080,
36212,
36329,
36330,
36404,
36405,
36525,
36526,
36540,
36541,
36552,
36553,
36555,
36571,
36572,
36630,
36631,
36719,
36720,
36735,
36736,
36902,
36903,
37000,
37001,
37015,
37016,
37056,
37057,
37114,
37158,
37159,
37324,
37325,
37395,
37396,
37451,
37452,
37473,
37474,
37490,
37491,
37510,
37511,
37540,
37577,
37609,
37642,
37643,
37660,
37661,
37922,
37923,
37948,
37949,
38057,
38058,
38093,
38094,
38294,
38295,
38343,
38344,
38364,
38365,
38380,
38395,
38424,
38425,
38453,
38487,
38499,
38500,
38749,
38750,
38849,
38850,
38871,
38872,
38888,
38927,
38976,
39024,
39073,
39087,
39089,
39296,
39306,
39332,
39338,
39426,
39441,
39467,
39593,
39603,
39629,
39630,
39642,
39643,
39799,
39800,
39890
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 39890,
"ccnet_original_nlines": 1042,
"rps_doc_curly_bracket": 0.0004512399900704622,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27236276865005493,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011198669672012329,
"rps_doc_frac_lines_end_with_ellipsis": 0.0009587699896655977,
"rps_doc_frac_no_alph_words": 0.3475736081600189,
"rps_doc_frac_unique_words": 0.23228803277015686,
"rps_doc_mean_word_length": 5.429500579833984,
"rps_doc_num_sentences": 367,
"rps_doc_symbol_to_word_ratio": 0.005944970063865185,
"rps_doc_unigram_entropy": 5.824943542480469,
"rps_doc_word_count": 4305,
"rps_doc_frac_chars_dupe_10grams": 0.14991016685962677,
"rps_doc_frac_chars_dupe_5grams": 0.23945409059524536,
"rps_doc_frac_chars_dupe_6grams": 0.21258662641048431,
"rps_doc_frac_chars_dupe_7grams": 0.19521690905094147,
"rps_doc_frac_chars_dupe_8grams": 0.16847780346870422,
"rps_doc_frac_chars_dupe_9grams": 0.14991016685962677,
"rps_doc_frac_chars_top_2gram": 0.012663640081882477,
"rps_doc_frac_chars_top_3gram": 0.009454949758946896,
"rps_doc_frac_chars_top_4gram": 0.011636859737336636,
"rps_doc_books_importance": -3379.503662109375,
"rps_doc_books_importance_length_correction": -3379.503662109375,
"rps_doc_openwebtext_importance": -1683.8408203125,
"rps_doc_openwebtext_importance_length_correction": -1683.8408203125,
"rps_doc_wikipedia_importance": -1268.2042236328125,
"rps_doc_wikipedia_importance_length_correction": -1268.2042236328125
},
"fasttext": {
"dclm": 0.8827119469642639,
"english": 0.7368923425674438,
"fineweb_edu_approx": 2.645674467086792,
"eai_general_math": 0.9808461666107178,
"eai_open_web_math": 0.2267308235168457,
"eai_web_code": 0.9374432563781738
}
}
|
{
"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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,664,415,246,639,974,000 |
{- | Copyright : (c) Henning Thielemann 2007 Maintainer : [email protected] Stability : stable Portability : Haskell 98 Markov chains can be used to recompose a list of elements respecting the fact that the probability of a certain element depends on preceding elements in the list. -} module Data.MarkovChain (run, runMulti, ) where import Data.Map (Map) import qualified Data.Map as Map import System.Random (RandomGen, randomR) import Control.Monad.State (State(State), evalState) {- | Creates a chain of elements respecting to the probabilities of possible successors. The list is considered being cyclic in order to have successors for the last elements. Example: > take 100 $ run 2 "The sad cat sat on the mat. " 0 (Random.mkStdGen 123) -} run :: (Ord a, RandomGen g) => Int -- ^ size of prediction context -> [a] -- ^ training sequence, the one to walk through randomly -> Int -- ^ index to start the random walk within the training sequence -> g -- ^ random generator state -> [a] run n dict start g = let keyError = error "key is not contained in dictionary" fm = createMap n dict {- This is the main function of this program. It is quite involved. If you want to understand it, imagine that the list 'y' completely exists before the computation. -} y = take n (drop start dict) ++ -- run them on the initial random generator state (flip evalState g $ -- this turns the list of possible successors -- into an action that generate a list -- of randomly chosen items mapM (randomItem . -- lookup all possible successors of an infix flip (Map.findWithDefault keyError) fm . -- turn suffix into an infixes of length n take n) $ iterate tail y) in y runMulti :: (Ord a, RandomGen g) => Int -- ^ size of prediction context -> [[a]] -- ^ training sequences, the order is relevant -> Int -- ^ index of starting training sequence -> g -- ^ random generator state -> [[a]] runMulti n dicts i g = let wrappedDicts = map ((Nothing :) . map Just) dicts k = sum (map length (take i wrappedDicts)) xs = run n (concat wrappedDicts) k g ([], ys) = segment (maybe (Left ()) Right) xs in map snd ys {- runMulti :: (Ord a, RandomGen g) => Int -- ^ size of prediction context -> [[a]] -- ^ training sequences, the order is relevant -> (Int,Int) -- ^ index to start the random walk within a training sequence -> g -- ^ random generator state -> [[a]] runMulti n dicts (i,j) g = let wrappedDicts = map ((Nothing :) . map Just) dicts k = sum (map length (take i wrappedDicts)) + j xs = run n (concat wrappedDicts) k g (y, ys) = segment (maybe (Left ()) Right) xs in y : map snd ys -} segment :: (a -> Either b c) -> [a] -> ([c], [(b,[c])]) segment p = foldr (\ x ~(y,ys) -> either (\b -> ([], (b,y):ys)) (\c -> (c:y, ys)) (p x)) ([], []) {- | Choose a random item from a list. -} randomItem :: (RandomGen g) => [a] -> State g a randomItem x = fmap (x!!) (randomRState (0, length x - 1)) {- | 'System.Random.randomR' wrapped in a State monad. -} randomRState :: (RandomGen g) => (Int,Int) -> State g Int randomRState bnds = State (randomR bnds) {- | Create a map that lists for each string all possible successors. -} createMap :: (Ord a) => Int -> [a] -> Map [a] [a] createMap n x = let xc = cycle x -- list of the map keys sufxs = map (take n) (iterate tail xc) -- list of the map images, i.e. single element lists imgxs = map (:[]) (drop n xc) mapList = takeMatch x (zip sufxs imgxs) in Map.fromListWith (++) mapList {- | Lazy variant of 'take'. -} takeMatch :: [b] -> [a] -> [a] takeMatch = zipWith (flip const)
|
{
"url": "http://hackage.haskell.org/package/markov-chain-0.0.2/src/src/Data/MarkovChain.hs",
"source_domain": "hackage.haskell.org",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "4423",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SITWJHAVJDWTBPONML6B3UGJV2U6QUIF",
"WARC-Concurrent-To": "<urn:uuid:ca14beae-8f19-4e96-bb4a-a1811c1e0f9a>",
"WARC-Date": "2020-01-29T20:42:50Z",
"WARC-IP-Address": "151.101.248.68",
"WARC-Identified-Payload-Type": "text/x-haskell",
"WARC-Payload-Digest": "sha1:NBJQGLMXOJCIMWKS2XHR2BE7U7YR5CXR",
"WARC-Record-ID": "<urn:uuid:973ca49a-c1e4-4a04-b5b9-d2588cd7ee3b>",
"WARC-Target-URI": "http://hackage.haskell.org/package/markov-chain-0.0.2/src/src/Data/MarkovChain.hs",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9295c5a7-a55f-48b7-b5d1-57f9c6223a3b>"
},
"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-103.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
],
"line_end_idx": [
3511
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3511,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.0045571099035441875,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2445213347673416,
"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.3840830326080322,
"rps_doc_frac_unique_words": 0.3918918967247009,
"rps_doc_mean_word_length": 4.621621608734131,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.846798419952393,
"rps_doc_word_count": 518,
"rps_doc_frac_chars_dupe_10grams": 0.19089390337467194,
"rps_doc_frac_chars_dupe_5grams": 0.2769423723220825,
"rps_doc_frac_chars_dupe_6grams": 0.2769423723220825,
"rps_doc_frac_chars_dupe_7grams": 0.2769423723220825,
"rps_doc_frac_chars_dupe_8grams": 0.19089390337467194,
"rps_doc_frac_chars_dupe_9grams": 0.19089390337467194,
"rps_doc_frac_chars_top_2gram": 0.01253132987767458,
"rps_doc_frac_chars_top_3gram": 0.033416878432035446,
"rps_doc_frac_chars_top_4gram": 0.017543859779834747,
"rps_doc_books_importance": -504.06640625,
"rps_doc_books_importance_length_correction": -504.06640625,
"rps_doc_openwebtext_importance": -278.3217468261719,
"rps_doc_openwebtext_importance_length_correction": -278.3217468261719,
"rps_doc_wikipedia_importance": -233.48916625976562,
"rps_doc_wikipedia_importance_length_correction": -233.48916625976562
},
"fasttext": {
"dclm": 0.10607284307479858,
"english": 0.7095217108726501,
"fineweb_edu_approx": 2.5778119564056396,
"eai_general_math": 0.9887400269508362,
"eai_open_web_math": 0.766886293888092,
"eai_web_code": 0.9434053301811218
}
}
|
{
"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.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,047,375,668,084,550,000 |
Win95 does not start up in graphics mode (GUI)
Yesterday I found an extra option in my F8 startup menu 8) start with previous DOS version. Of course I tried this but now my win95 will not start automaticly anymore. Every time I reboot I will end up at the dos prompt (win95 DOS version). Even when I choose safe mode at the F8 startup menu I will get the DOS prompt. Then I have to type win to start win95 in safe mode. I have looked in MSDOS.SYS but I did not find any clue. However MSDOS.SYS doesn't seem to be read by win95. When I put in the sentence Logo=0 I just get the win95 logo screen. Also BootGUI=1 does not solve the problem. So it seems win95 does not react on lines in MSDOS.SYS. the file size is linger than 1024 bytes.
Gert van Cappellen
[email protected]
cappellenAsked:
Who is Participating?
I wear a lot of hats...
"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.
jerrydCommented:
1. Make sure your MSDOS.SYS file is at least 1024 bytes. The original should have had about 19 lines (71 chars long) starting with a semicolon (;), 69 x's and ending with a sequential letter of the alphabet - 1st line a, 2nd line b and so on. Just pad it out with enough lines of x's but be sure to start each line with a semicolon (the same as REM in a batch file).
2. Add the line:
BootGUI=1
This should force Win95 to start.
0
Experts Exchange Solution brought to you by
Your issues matter to us.
Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.
Start your 7-day free trial
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
Windows OS
From novice to tech pro — start learning today.
|
{
"url": "https://www.experts-exchange.com/questions/10003446/Win95-does-not-start-up-in-graphics-mode-GUI.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "87805",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XWB3HAQ5Z6HOJ6MYZJNM5YH7HB6CNDWN",
"WARC-Concurrent-To": "<urn:uuid:94f7c9c2-2979-4ced-8ff4-3e462ea905db>",
"WARC-Date": "2018-08-16T04:55:24Z",
"WARC-IP-Address": "104.20.168.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YJNGXSBMWREQIY32K5FIOLS7WDTBT2Q4",
"WARC-Record-ID": "<urn:uuid:d3ef04eb-a739-47bf-bc06-f45b73043069>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/10003446/Win95-does-not-start-up-in-graphics-mode-GUI.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b5dbc5f8-da99-41e6-a775-dc80675e776f>"
},
"warc_info": "isPartOf: CC-MAIN-2018-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-167-236.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,
47,
48,
738,
739,
758,
788,
804,
826,
850,
851,
1216,
1217,
1234,
1603,
1620,
1635,
1672,
1673,
1675,
1676,
1720,
1721,
1747,
1748,
1902,
1903,
1931,
2325,
2336,
2337
],
"line_end_idx": [
47,
48,
738,
739,
758,
788,
804,
826,
850,
851,
1216,
1217,
1234,
1603,
1620,
1635,
1672,
1673,
1675,
1676,
1720,
1721,
1747,
1748,
1902,
1903,
1931,
2325,
2336,
2337,
2384
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2384,
"ccnet_original_nlines": 30,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3481624722480774,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05996131896972656,
"rps_doc_frac_lines_end_with_ellipsis": 0.032258059829473495,
"rps_doc_frac_no_alph_words": 0.1702127754688263,
"rps_doc_frac_unique_words": 0.5308057069778442,
"rps_doc_mean_word_length": 4.395734786987305,
"rps_doc_num_sentences": 41,
"rps_doc_symbol_to_word_ratio": 0.0019342399900779128,
"rps_doc_unigram_entropy": 5.0600972175598145,
"rps_doc_word_count": 422,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03450135141611099,
"rps_doc_frac_chars_dupe_6grams": 0.016172509640455246,
"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.010781669989228249,
"rps_doc_frac_chars_top_3gram": 0.0097035001963377,
"rps_doc_frac_chars_top_4gram": 0.0097035001963377,
"rps_doc_books_importance": -211.81881713867188,
"rps_doc_books_importance_length_correction": -211.81881713867188,
"rps_doc_openwebtext_importance": -120.84192657470703,
"rps_doc_openwebtext_importance_length_correction": -120.84192657470703,
"rps_doc_wikipedia_importance": -104.30429077148438,
"rps_doc_wikipedia_importance_length_correction": -104.30429077148438
},
"fasttext": {
"dclm": 0.032309651374816895,
"english": 0.9338754415512085,
"fineweb_edu_approx": 1.0258562564849854,
"eai_general_math": 0.1370430588722229,
"eai_open_web_math": 0.14031726121902466,
"eai_web_code": 0.013555879704654217
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.162",
"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": "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
|
-632,574,582,219,184,600 |
What is State Management?
Updated on October 07, 2014 VIKRAM 1038
A new instance of the Web page class is created each time the page is posted to the server. In traditional Web programming, this would typically mean that all information associated with the page and the controls on the page would be lost with each round trip. For example, if a user enters information into a text box, that information would be lost in the round trip from the browser or client device to the server.
To overcome this inherent limitation of traditional Web programming, ASP.NET includes several options that help you preserve data on both a per-page basis and an application-wide basis.
Types of state management:
There are two types of state management techniques: client side and server side.
Client side
1. View State
2. Control State
3. Hidden fields
4. Cookies
5. Query Strings
Server side
1. Application State
2. Session State
3. Profile Properties
View state, control state, hidden fields, cookies, and query strings all involve storing data on the client in various ways. However, application state, session state, and profile properties all store data in memory on the server. Each option has distinct advantages and disadvantages, depending on the scenario.
Source: MSDN
If you enjoyed this post, please like (or) share this article.
Comments
|
{
"url": "http://studentboxoffice.in/dotnet/interview-question/23",
"source_domain": "studentboxoffice.in",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "9883",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B3YKZQEMVANSTHKG3QV3U5PXYM2XKDYR",
"WARC-Concurrent-To": "<urn:uuid:116d2e8c-6a7d-4dcd-a210-1d7c8184ade6>",
"WARC-Date": "2018-03-23T18:36:43Z",
"WARC-IP-Address": "162.222.225.71",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4XEW42UG6UVPKBA3UZNK6ZVRYBYWMYXN",
"WARC-Record-ID": "<urn:uuid:fda1c68b-1036-43b3-9c7d-7389b61c1300>",
"WARC-Target-URI": "http://studentboxoffice.in/dotnet/interview-question/23",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4d42efa5-c245-411a-9bf9-0ff9a0f374f9>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-7-230-53.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
26,
27,
76,
77,
495,
496,
682,
683,
710,
711,
792,
793,
805,
806,
822,
841,
860,
873,
892,
893,
905,
906,
929,
948,
972,
973,
1286,
1287,
1300,
1301,
1364,
1365,
1366
],
"line_end_idx": [
26,
27,
76,
77,
495,
496,
682,
683,
710,
711,
792,
793,
805,
806,
822,
841,
860,
873,
892,
893,
905,
906,
929,
948,
972,
973,
1286,
1287,
1300,
1301,
1364,
1365,
1366,
1374
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1374,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30534350872039795,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019083969295024872,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19465649127960205,
"rps_doc_frac_unique_words": 0.534246563911438,
"rps_doc_mean_word_length": 4.9178080558776855,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.505225658416748,
"rps_doc_word_count": 219,
"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.018570100888609886,
"rps_doc_frac_chars_top_3gram": 0.02042710967361927,
"rps_doc_frac_chars_top_4gram": 0.04085421934723854,
"rps_doc_books_importance": -93.35553741455078,
"rps_doc_books_importance_length_correction": -93.35405731201172,
"rps_doc_openwebtext_importance": -50.01935958862305,
"rps_doc_openwebtext_importance_length_correction": -50.01935958862305,
"rps_doc_wikipedia_importance": -25.6331844329834,
"rps_doc_wikipedia_importance_length_correction": -24.922466278076172
},
"fasttext": {
"dclm": 0.293277382850647,
"english": 0.876197338104248,
"fineweb_edu_approx": 2.2870733737945557,
"eai_general_math": 0.06466144323348999,
"eai_open_web_math": 0.1053471565246582,
"eai_web_code": 0.005552649963647127
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.13",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,387,666,776,373,347,000 |
Booking a specific open access computer
Each open access computer has been allocated a number. If you want to book a specific computer, find or check its number via the Chichester maps or Bognor maps computer availability links. When you have this information:
1. Log in to the open access booking system (MyPC) with your University username and password
2. Use the where, what, and when sections of the Booking toolbar to see the availability of computers in each location for the day of your choice Illustrative image
3. After making your selections you will see a colour coded grid for each computer, showing the availability for your chosen day Illustrative image Illustrative image
4. To book a slot, click on an available white square on the grid
5. The Booking Properties window will open. Make any required alterations to your booking start and end time, check the box if you want an email booking receipt, and select Save Illustrative image
6. If you chose to receive a booking receipt you will be emailed confirmation Illustrative image
Still need help?
|
{
"url": "http://help.chi.ac.uk/booking-specific-open-access-computer",
"source_domain": "help.chi.ac.uk",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "46215",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QQNTBRPYPAO2TAFJDJERWT776CGWPUJ4",
"WARC-Concurrent-To": "<urn:uuid:c59757b8-b39c-40ef-850b-a9ed64e88a67>",
"WARC-Date": "2020-08-03T23:33:21Z",
"WARC-IP-Address": "23.185.0.3",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5ISQI5WRE5SFVUGEGRUSS5XDLJRLGFKR",
"WARC-Record-ID": "<urn:uuid:5f114592-753e-4a11-b210-455e1cce2be9>",
"WARC-Target-URI": "http://help.chi.ac.uk/booking-specific-open-access-computer",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a90cd798-33ca-4404-8825-bf2463da8257>"
},
"warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-21.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,
40,
41,
262,
263,
357,
358,
523,
524,
693,
694,
760,
761,
958,
959,
1058,
1059,
1061,
1062,
1064,
1065
],
"line_end_idx": [
40,
41,
262,
263,
357,
358,
523,
524,
693,
694,
760,
761,
958,
959,
1058,
1059,
1061,
1062,
1064,
1065,
1081
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1081,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3700000047683716,
"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.12999999523162842,
"rps_doc_frac_unique_words": 0.550000011920929,
"rps_doc_mean_word_length": 4.800000190734863,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.3260498046875,
"rps_doc_word_count": 180,
"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.09837962687015533,
"rps_doc_frac_chars_top_3gram": 0.0416666716337204,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -76.22171783447266,
"rps_doc_books_importance_length_correction": -76.22171783447266,
"rps_doc_openwebtext_importance": -40.90531921386719,
"rps_doc_openwebtext_importance_length_correction": -30.362014770507812,
"rps_doc_wikipedia_importance": -32.401588439941406,
"rps_doc_wikipedia_importance_length_correction": -32.401588439941406
},
"fasttext": {
"dclm": 0.270846426486969,
"english": 0.809171736240387,
"fineweb_edu_approx": 2.3970696926116943,
"eai_general_math": 0.06486433744430542,
"eai_open_web_math": 0.16851449012756348,
"eai_web_code": 0.0076162200421094894
}
}
|
{
"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": "378.1968",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Higher and Universities and colleges"
}
}
},
"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
|
6,274,838,175,609,393,000 |
1
I wish to have two different datasets positioned each other, like that when you have position="dodge" (area of erosion and deposition), and then plot two line graphs showing erosion and deposition rates for each reach. Right now, the area of deposition and erosion bar graphs are overlapping each other. I am able to get them to stack if I reorganise the data and plot it with geom_bar(position="dodge") (see right at the bottom), but in the process, my rates data get represented as a bar as well, which I do not want. Thank you in advance.
This is my current graph: here I wish to get something like this: enter image description here
EroDepoStuff <- tibble::tribble(
~Reach, ~Total.lateral.erosion, ~Total.lateral.deposition, ~Lateral.erosion.rate, ~Lateral.deposition.rate,
"Reach 1", 44.818334, 17.400127, 4.4818334, 1.7400127,
"Reach 2", 91.865675, 91.39827, 9.1865675, 9.139827,
"Reach 3", 7.40573, 16.654819, 0.740573, 1.6654819,
"Reach 4", 25.214554, 52.084122, 2.5214554, 5.2084122,
"All", 169.304293, 177.537338, 16.9304293, 17.7537338
)
EroDepoGraph <- ggplot(EroDepoStuff,aes(x=Reach,group=4)) +
geom_bar(aes(y=Total.lateral.erosion,fill="Lateral erosion"),position="dodge",stat="identity") +
geom_point(aes(y=Lateral.erosion.rate*10,colour="Lateral erosion rate")) +
geom_line(aes(y=Lateral.erosion.rate*10,colour="Lateral erosion rate")) +
geom_bar(aes(y=Total.lateral.deposition,fill="Lateral deposition"),position="dodge",stat="identity")+
geom_line(aes(y=Lateral.deposition.rate*10,colour="Lateral deposition rate")) +
geom_point(aes(y=Lateral.deposition.rate*10,colour="Lateral deposition rate")) +
labs(y="Area (sq km)") +
scale_fill_manual(values=c("Lateral erosion"="skyblue4","Lateral deposition"="blue")) +
scale_colour_manual(values=c("Lateral erosion rate"="violetred3","Lateral deposition rate"="tan1")) +
labs(color = "", fill = "")
#adding second axis
EroDepoGraph <- EroDepoGraph + scale_y_continuous(sec.axis = sec_axis(~./10,name = expression(paste("Rate (sq km/yr)"))))
#formatting axes
EroDepoGraph <- EroDepoGraph + theme(
axis.title.x = element_blank(),
axis.title.y = element_text(size=11),
axis.text.x = element_text(size=11,angle=90,hjust=1),
legend.position="bottom",
legend.spacing.y = unit(-0.1, "cm"),
plot.title = element_text(size=12, face="bold")
)
EroDepoGraph
reOrganisedData <- ReorderedData <- tibble::tribble(
~Reach, ~Value, ~Type,
"Reach 1", 44.818334, "Total lateral erosion",
"Reach 2", 91.865675, "Total lateral erosion",
"Reach 3", 7.40573, "Total lateral erosion",
"Reach 4", 25.214554, "Total lateral erosion",
"All", 169.304293, "Total lateral erosion",
"Reach 1", 17.400127, "Total.lateral.deposition",
"Reach 2", 91.39827, "Total.lateral.deposition",
"Reach 3", 16.654819, "Total.lateral.deposition",
"Reach 4", 52.084122, "Total.lateral.deposition",
"All", 177.537338, "Total.lateral.deposition",
"Reach 1", 4.4818334, "Lateral erosion rate",
"Reach 2", 9.1865675, "Lateral erosion rate",
"Reach 3", 0.740573, "Lateral erosion rate",
"Reach 4", 2.5214554, "Lateral erosion rate",
"All", 16.9304293, "Lateral erosion rate",
"Reach 1", 1.7400127, "Lateral deposition rate",
"Reach 2", 9.139827, "Lateral deposition rate",
"Reach 3", 1.6654819, "Lateral deposition rate",
"Reach 4", 5.2084122, "Lateral deposition rate",
"All", 17.7537338, "Lateral deposition rate"
)
• Gather the two total columns into one column, and the two rate columns into another. Then you can use position ="dodge" on the bar chart. – iod Mar 24 at 11:52
• Thank you for responding. I have tried that (as shown by the dataset right at the bottom) but in the process, the line graphs end up being displayed as a bar graph which I don't want /: @iod – catlovingtaco Mar 24 at 11:54
0
EroDepoGraph <- gather(EroDepoGraph, "totalType" , "totalVal",
Total.lateral.erosion, Total.lateral.deposition) %>%
gather( "rateType" , "rateVal",Lateral.erosion.rate,
Lateral.deposition.rate )
EroDepoStuff$Reach<-factor(EroDepoStuff$Reach)
ggplot(EroDepoStuff,aes(x=as.numeric(Reach))) +
geom_bar(aes(y=totalVal,fill=totalType),position="dodge",stat="identity") +
geom_line(aes(y=rateVal*10,colour=rateType))+
geom_point(aes(y=rateVal*10,colour=rateType)) +
scale_x_continuous(name="Reach", breaks=1:5, labels=levels(EroDepoStuff$Reach))
result
Note that for the geom_line to work the x axis has to be continuous, hence changing it to factor and then using as.numeric(Reach) to define the x axis in ggplot. You tried to get over this by overriding it with including group=4 in the aes() call, but then you also override the grouping for everything else, which causes the problem you experienced.
• hi, thank you for your help. I tried your suggestion but the graphs still overlap :( and the erosion/deposition rate shows up as a single line instead of two :( – catlovingtaco Mar 24 at 12:31
• Added code for the plot with sample result (didn't add all the theme stuff included in your sample code). Note that for the geom_line to work the x axis has to be continuous, hence changing it to factor and then using as.numeric(Reach) to define the x axis in ggplot. Honestly, I don't even know how you got lines in your original plot... – iod Mar 24 at 15:14
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://stackoverflow.com/questions/55323466/stop-bar-plots-from-overlapping-in-ggplot",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2019-39",
"warc_metadata": {
"Content-Length": "145643",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:G3DF73RVF5T4AIQ63UO4WKKY4KQV2GQ2",
"WARC-Concurrent-To": "<urn:uuid:c899cf88-0675-46a5-9c4d-7a43b642525d>",
"WARC-Date": "2019-09-17T11:23:29Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Z6JJ4O2M3TKR7IAZLPMW5YN7OSTASQ32",
"WARC-Record-ID": "<urn:uuid:5f554dbf-4e39-4405-9e0c-41532a4bd4ab>",
"WARC-Target-URI": "https://stackoverflow.com/questions/55323466/stop-bar-plots-from-overlapping-in-ggplot",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:68fe2341-d014-49b0-841b-10db43ce8675>"
},
"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-102.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
545,
546,
641,
642,
643,
676,
801,
927,
1053,
1179,
1305,
1430,
1446,
1447,
1507,
1606,
1683,
1759,
1863,
1945,
2028,
2055,
2145,
2249,
2280,
2281,
2282,
2303,
2425,
2426,
2427,
2444,
2482,
2516,
2556,
2612,
2641,
2680,
2730,
2732,
2745,
2746,
2799,
2869,
2939,
3009,
3079,
3149,
3219,
3289,
3359,
3429,
3499,
3569,
3639,
3709,
3779,
3849,
3919,
3989,
4059,
4129,
4199,
4268,
4289,
4290,
4291,
4292,
4293,
4294,
4295,
4459,
4686,
4688,
4753,
4808,
4864,
4892,
4939,
4987,
5067,
5118,
5171,
5255,
5256,
5263,
5264,
5615,
5616,
5813,
6178,
6179,
6191,
6192,
6292,
6293
],
"line_end_idx": [
2,
3,
545,
546,
641,
642,
643,
676,
801,
927,
1053,
1179,
1305,
1430,
1446,
1447,
1507,
1606,
1683,
1759,
1863,
1945,
2028,
2055,
2145,
2249,
2280,
2281,
2282,
2303,
2425,
2426,
2427,
2444,
2482,
2516,
2556,
2612,
2641,
2680,
2730,
2732,
2745,
2746,
2799,
2869,
2939,
3009,
3079,
3149,
3219,
3289,
3359,
3429,
3499,
3569,
3639,
3709,
3779,
3849,
3919,
3989,
4059,
4129,
4199,
4268,
4289,
4290,
4291,
4292,
4293,
4294,
4295,
4459,
4686,
4688,
4753,
4808,
4864,
4892,
4939,
4987,
5067,
5118,
5171,
5255,
5256,
5263,
5264,
5615,
5616,
5813,
6178,
6179,
6191,
6192,
6292,
6293,
6383
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6383,
"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.1772058755159378,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006617649924010038,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4794117510318756,
"rps_doc_frac_unique_words": 0.42625609040260315,
"rps_doc_mean_word_length": 6.525121688842773,
"rps_doc_num_sentences": 109,
"rps_doc_symbol_to_word_ratio": 0.002205879893153906,
"rps_doc_unigram_entropy": 5.113685131072998,
"rps_doc_word_count": 617,
"rps_doc_frac_chars_dupe_10grams": 0.06259313970804214,
"rps_doc_frac_chars_dupe_5grams": 0.09388972073793411,
"rps_doc_frac_chars_dupe_6grams": 0.07799305021762848,
"rps_doc_frac_chars_dupe_7grams": 0.07799305021762848,
"rps_doc_frac_chars_dupe_8grams": 0.07799305021762848,
"rps_doc_frac_chars_dupe_9grams": 0.06259313970804214,
"rps_doc_frac_chars_top_2gram": 0.034773968160152435,
"rps_doc_frac_chars_top_3gram": 0.023596620187163353,
"rps_doc_frac_chars_top_4gram": 0.02384500950574875,
"rps_doc_books_importance": -627.9210815429688,
"rps_doc_books_importance_length_correction": -627.9210815429688,
"rps_doc_openwebtext_importance": -350.7400817871094,
"rps_doc_openwebtext_importance_length_correction": -350.7400817871094,
"rps_doc_wikipedia_importance": -345.50897216796875,
"rps_doc_wikipedia_importance_length_correction": -345.50897216796875
},
"fasttext": {
"dclm": 0.09308481216430664,
"english": 0.7214699387550354,
"fineweb_edu_approx": 1.4099701642990112,
"eai_general_math": 0.350422203540802,
"eai_open_web_math": 0.23362857103347778,
"eai_web_code": 0.13806331157684326
}
}
|
{
"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": "551.48",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Geology and Earth sciences",
"level_3": "Physical geology and Geodynamics"
}
}
},
"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": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,878,400,374,039,007,700 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
I newly started working on Github via their native Windows Application, it's quite good however it's crashing so often and the horrible thing is that I lose all the recent changes after it's crashing. All the local files will rollback to the last version of the successful commit or sync.
I'm on a 64bit windows 8 machine. Any ideas?
The exact error after crash is Couldn't find a HEAD in this repository
share|improve this question
add comment
3 Answers
up vote 7 down vote accepted
I sent an email to GitHub For Windows support. Their answer was this:
Hi David,
I am sorry for the trouble.
I have been able to reproduce this problem, and have filed a report for our developers to look at. The reason the application is crashing is likely due to merge conflicts between the local and remote repositories.
The easiest way to resolve this would be to go into the repository that is saying 'failed looking for HEAD', closing that pop-up, and clicking Tools -> Open a Shell Here.
• From the shell, you can run 'git reset --merge' to undo the merge that caused GitHub for Windows to crash.
• From there, run 'git checkout master' to switch from the detached HEAD.
• After that, run 'git pull' in the shell to pull down any new changes. It will prompt you to fix any merge conflicts (which is what caused the app to crash).
Once you fix the merge conflicts in the files, you should then be able to sync correctly in GitHub for WIndows.
I have been testing this issue, and after I resolved the conflicts with the initial crash, I no longer had any further trouble with GitHub for Windows. It correctly prompted me to open the shell and resolve merge conflicts rather than crashing.
Let me know if you have any further questions, and hopefully we will have a fix out for this soon.
Best, Steve
share|improve this answer
Interesting to know. +1 – VonC Oct 11 '12 at 20:23
Thank, this helped a lot. – Ultimate Nov 5 '13 at 21:26
add comment
This is the solution I received from Github support. I'll copy & paste the exact text here:
The easiest way to resolve this would be to go into the repository that is saying 'failed looking for HEAD', closing that pop-up, and clicking Tools -> Open a Shell Here. From the shell, you can run 'git reset --merge' to undo the merge that caused GitHub for Windows to crash. After that, run 'git pull' in the shell to pull down any changes. It will prompt you to fix any merge conflicts. Once you fix the merge conflicts in the files, you should then be able to sync correctly in GitHub for WIndows.
I have been testing this issue, and after I resolved the conflicts with the initial crash, I no longer had any further trouble with GitHub for Windows. It correctly prompted me to open the shell and resolve merge conflicts rather than crashing.
share|improve this answer
add comment
I had this problem after I made an unstable change to my .gitconfig user file.
I only detected the issue after I tried using TortoiseGIT and it outlined the error parsting the config file with an unexpected token.
So the fix was to correct the bad .gitconfig file.
share|improve this answer
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/12780095/github-for-windows-crashing-several-times-a-day?answertab=votes",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "73809",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5PSJPYTPSFGUDYIULACGU6PRQGMCZNWK",
"WARC-Concurrent-To": "<urn:uuid:33405023-1fc5-4c06-9366-568dcfc2176c>",
"WARC-Date": "2014-03-07T15:33:00Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FEN7C4G4P2LUIFFZAQD7RMPQH65QKWCR",
"WARC-Record-ID": "<urn:uuid:8f88032b-f12b-409d-aadf-1aede68304ab>",
"WARC-Target-URI": "http://stackoverflow.com/questions/12780095/github-for-windows-crashing-several-times-a-day?answertab=votes",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:94862b6b-887b-4898-878c-d1d7c60d362b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
447,
448,
493,
494,
565,
566,
594,
606,
607,
617,
618,
647,
648,
718,
719,
729,
730,
758,
759,
973,
974,
1145,
1146,
1257,
1333,
1494,
1495,
1607,
1608,
1853,
1854,
1953,
1954,
1966,
1967,
1993,
1995,
2047,
2049,
2106,
2118,
2119,
2211,
2212,
2715,
2716,
2961,
2962,
2988,
3000,
3001,
3080,
3081,
3216,
3217,
3268,
3269,
3295,
3307,
3308,
3320,
3321,
3323,
3331,
3332,
3410,
3411
],
"line_end_idx": [
25,
157,
158,
447,
448,
493,
494,
565,
566,
594,
606,
607,
617,
618,
647,
648,
718,
719,
729,
730,
758,
759,
973,
974,
1145,
1146,
1257,
1333,
1494,
1495,
1607,
1608,
1853,
1854,
1953,
1954,
1966,
1967,
1993,
1995,
2047,
2049,
2106,
2118,
2119,
2211,
2212,
2715,
2716,
2961,
2962,
2988,
3000,
3001,
3080,
3081,
3216,
3217,
3268,
3269,
3295,
3307,
3308,
3320,
3321,
3323,
3331,
3332,
3410,
3411,
3501
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3501,
"ccnet_original_nlines": 70,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40136054158210754,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029931969940662384,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1646258533000946,
"rps_doc_frac_unique_words": 0.3824959397315979,
"rps_doc_mean_word_length": 4.42625617980957,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.92799186706543,
"rps_doc_word_count": 617,
"rps_doc_frac_chars_dupe_10grams": 0.42987915873527527,
"rps_doc_frac_chars_dupe_5grams": 0.45331379771232605,
"rps_doc_frac_chars_dupe_6grams": 0.42987915873527527,
"rps_doc_frac_chars_dupe_7grams": 0.42987915873527527,
"rps_doc_frac_chars_dupe_8grams": 0.42987915873527527,
"rps_doc_frac_chars_dupe_9grams": 0.42987915873527527,
"rps_doc_frac_chars_top_2gram": 0.023068470880389214,
"rps_doc_frac_chars_top_3gram": 0.04101061820983887,
"rps_doc_frac_chars_top_4gram": 0.010984989814460278,
"rps_doc_books_importance": -387.23406982421875,
"rps_doc_books_importance_length_correction": -387.23406982421875,
"rps_doc_openwebtext_importance": -195.13934326171875,
"rps_doc_openwebtext_importance_length_correction": -195.13934326171875,
"rps_doc_wikipedia_importance": -124.94947052001953,
"rps_doc_wikipedia_importance_length_correction": -124.94947052001953
},
"fasttext": {
"dclm": 0.11801832914352417,
"english": 0.9365742802619934,
"fineweb_edu_approx": 1.054232120513916,
"eai_general_math": 0.01809507980942726,
"eai_open_web_math": 0.10434991121292114,
"eai_web_code": 0.003705380018800497
}
}
|
{
"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.778",
"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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,099,273,812,711,867,400 |
Links
Comment on page
Notifications
Actions performed like add, update or delete, table and view can be seen in notification area.
This way, when the user shares a Workspace, the recipient receives an automatic email.
Viewing notifications
The actions are performed on a table basis and record the actions of the user. When there is a notification you can view it as follows.
1. 1.
Click on the bell icon in the upper right corner of the screen.
2. 2.
View user's action on the view, table and project.
3. 3.
Notifications of data operations on the table are instantly visible to all users working in the table.
© 2023 Retable Limited | All product and company names and logos are trademarks of their respective owners
|
{
"url": "https://docs.retable.io/retable-user-guide/managing-retable/notification",
"source_domain": "docs.retable.io",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "251464",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OZHV4VRTBHPXXEQMMIMDYGTCB364PY65",
"WARC-Concurrent-To": "<urn:uuid:8e732828-680f-42ae-a67c-b63be77a701a>",
"WARC-Date": "2023-12-07T03:09:34Z",
"WARC-IP-Address": "104.18.40.47",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AL2235EQNLVJK27PEO24C5NV2N5JYITX",
"WARC-Record-ID": "<urn:uuid:72b2c5dd-4b19-4eae-8e55-c151fe91fcbf>",
"WARC-Target-URI": "https://docs.retable.io/retable-user-guide/managing-retable/notification",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2f8ad679-a786-43aa-b4ba-1c1b2d6a7fde>"
},
"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-252\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,
6,
22,
23,
37,
38,
133,
220,
221,
243,
244,
380,
388,
456,
464,
519,
527,
634,
635
],
"line_end_idx": [
6,
22,
23,
37,
38,
133,
220,
221,
243,
244,
380,
388,
456,
464,
519,
527,
634,
635,
741
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 741,
"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.36301371455192566,
"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.19178082048892975,
"rps_doc_frac_unique_words": 0.6159999966621399,
"rps_doc_mean_word_length": 4.584000110626221,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.092706680297852,
"rps_doc_word_count": 125,
"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.026178009808063507,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -46.60112762451172,
"rps_doc_books_importance_length_correction": -46.60154724121094,
"rps_doc_openwebtext_importance": -24.572473526000977,
"rps_doc_openwebtext_importance_length_correction": -24.572893142700195,
"rps_doc_wikipedia_importance": -20.929780960083008,
"rps_doc_wikipedia_importance_length_correction": -20.930200576782227
},
"fasttext": {
"dclm": 0.07298386096954346,
"english": 0.916120707988739,
"fineweb_edu_approx": 0.9667160511016846,
"eai_general_math": 0.008384699933230877,
"eai_open_web_math": 0.04750293120741844,
"eai_web_code": 0.008126500062644482
}
}
|
{
"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.402",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,146,259,724,044,170,900 |
Question
-8 - 12
Expert Answer
Want to see the step-by-step answer?
Check out a sample Q&A here.
Want to see this answer and more?
Experts are waiting 24/7 to provide step-by-step solutions in as fast as 30 minutes!*
*Response times may vary by subject and question complexity. Median response time is 34 minutes for paid subscribers and may be longer for promotional offers.
Tagged in
Math
Algebra
Related Algebra Q&A
Find answers to questions asked by students like you.
Q: Graph the solution to the following system of inequalities. x-5 yz-4 3x+4y8 10 6 ? 4 -10 -8 -6 6 10 ...
A: Given information:The system of equation is shown below:
Q: A Web music store offers two versions of a popular song. The size of the standard version is 2.4 meg...
A: Given:The size of the standard version is 2.4 megabytes (MB). The size of the high-quality version i...
Q: 2 47) Use the graph of f(x) shown to the right to solve: a) f(x)-0 b) f(x)<0 y-f(x)
A: a) Consider the given function to be y = f(x). Solve the equation f(x) = 0 using the given graph as ...
Q: Lashonda's Coffee Shop makes a blend that is a mixture of two types of coffee. Type A coffee costs L...
A: According to the given information, the cost information of the coffee bleands in given below:Cost o...
Q: O SYSTEMS OF LINEAR EQUATIONS Paul Solving a distance, rate, time problem using a system of linea......
A: Let speed of the boat is x and the speed of the current is y.
Q: Solve the equation by factoring. Please explain how you did your work. 4x2+11x-45=0.
A: We have to compare 4x^2+11x-45=0 with ax^2+bx+c. So, a=4 , b= 11 , c = -45. In ax^2+bx+c form we hav...
Q: I am needing help solving the question: The quantity represents a real number. Find any restrictio...
A: Given information:The given equation is 1/2x-5=10
Q: Determine the domain of the function f (x) = 1 − x.
A: The domain of f(x)=1-x is the possible values of x.
Q: How do you solve the polynomial inequality x4 + 36 ≤ 13x2
A: The given polynomial inequality is x^4+36≤-13x^2.
Q: 6 and g(x) = X find the following functions For f(x)= X a. (fo g)(x), b. (g o f)(x), c. (f o g)(7), ...
A: Given,
Q: Linda, Frank, and Chau sent a total of 76 text messages over their cell phones during the weekend. F...
A: Let the text messages that Linda got be x.Then the text messages that Frank got is 8+x.The text mess...
Q: List all values of x for which each rational expression is undefined.
A: Given information:The given function is as shown below:
Q: Solve the inequality using a graphing utility. X+ 1 s2 X- 2 Graph the given inequality using a graph...
A: Calculation:Use a graphing calculator and obtain the graph of the given rational function as shown b...
Q: How do I solve 6x/x-6 =9 +7x2/x-6?
A: Click to see the answer
Q: # 13 and # 14
A: (13)Let Felix invests $ x amount at 7% annual interest and then according to question, the amount th...
Q: Find f(g(x)) and g(f(x)) and determine whether the pair of functions f and g are inverses of each ot...
A: Consider f(g(x)) and plugging the values:
Q: If x^3=3x^2, then what is x using the Zero-Product rule?
A: Given that x3 = 3x2.
Q: Solve for y in the equation below.Round your answer to the nearest hundredth.Do not round any interm...
A: Consider the given equation
Q: Condense the expression to the logarithm of a single quantity (c) 4 [lnz +ln(z +5)] −2ln(z −5)
A: Consider the provided expression.
Q: For following function, select (on the same set of coordinate axes) a graph for c = -3, 5, and 4. ...
A: The function is given by,
Q: List all values of x for which the rational expression is undefined 12/-3x
A: To calculate the all possible value of x for which the rational expression 12/(-3x) undefined. Now, ...
Q: Begin by graphing the absolute value function, f(x) = |x|. Then use transformations of this graph to...
A: Given:The function f(x) = |x|.
Q: Write the equation of the line that has slope m = − 1 and passes through the point (0, 2) . Explain ...
A: Refer to the question the line has slope m = -1 and it passes through the point (0, 2).Then consider...
Q: Solve the inequality and graph the solution set on a real number line. Express the solution set in i...
A: First solve the given inequality as follows.
Q: A car is purchased for $31,000 . Each year it loses 30% of its value. After how many years will the ...
A: Let the depreciated amount be represented by D(t). then according to the given condition.
Q: Linear Algebra Question: determine whether the following set of vectors are subspaces: H= {[a b c] :...
A: To determine: The set of vectors are subspaces such that
Q: Determine the domain of the function f (x) = x − 2x + 8
A: The given function is f(x) =x–2x+8.
Q: At the movie theatre, child admission is $5.70 and adult admission is $9.70 . On Wednesday, four tim...
A: Let x be the number of adult tickets and y be the number of child tickets be sold.
Q: Use properties of logarithms to expand the logarithmic expression as much as possible. Evaluate loga...
A: Given expression is,
Q: (2z-11)2+3=17
A: Given information:The given equation is (2z-11)^2+3=17.
Q: The following equation is given. x3-3x-4x+12=0 X a. List all rational roots that are possible accord...
A: a. Find the possible rational roots.
Q: find the equation of a circle whose diameter has endpoints (-3,-3) and (-3,6)
A: We have been given endpoints of diameter of circle as (-3,-3) and (-3,6) and we need to find the equ...
Q: Solve the system. If there is no solution or if there are infinitely many solutions and the system's...
A: Consider the given system of equations:
Q: The points (-4,-4) and (3,6) are the endpoints of the diameter of a circle. Find the length of...
A: The distance between two points (x1,y1) and (x2,y2) is given by:Given points are (x1,y1) = (-4,-4)...
Q: Which expression is equivalent to162 Question 6 options: 6¯10 • 68 ...
A: This expression is not equivalent to 162.
Q: graph g(x)=4log1/2x plot at least two points on the graph, draw all asymptotes,
A: Given information:The given gunction is g(x)=4log1/2x.
Q: 7) In a triangle, the measure of the first angle is twice the measure of the second angle. The measu...
A: Click to see the answer
Q: Find an equation of the circle whose diameter has endpoints (-5, -6) and (1, -6). ? X
A: Center is the mid point of (-5,-6) and (1,-6). Center =(-2,-6)
Q: The graph of a quadratic function is given. Match the equation with its graph. fx)-(X + 4)2-1 ) (X-4...
A: (a)We can find vertex of first function
Q: The number of bacteria in a certain population increases according to a continuous exponential growt...
A: To use the given data (exponential model) to determine the initial data
Q: Aldo is walking. The number of calories he has burned varies directly with the number of minutes he ...
A: The number of calories burned by Aldo in one minute.As per graph, Aldo burn 12 units of calories in ...
|
{
"url": "https://www.bartleby.com/questions-and-answers/8-12/57749f8c-95a9-4f7a-8712-f1e9b0acad05",
"source_domain": "www.bartleby.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "235435",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AFFNQ3LYRRR57MSH6OBVDWLHMOVH4PD5",
"WARC-Concurrent-To": "<urn:uuid:244d1e32-bd77-44cb-91d1-f8c5c70da97d>",
"WARC-Date": "2021-12-01T15:00:07Z",
"WARC-IP-Address": "13.32.208.116",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SGJ35NY34ZMCX457Z5XEV7NPPRY3UGBM",
"WARC-Record-ID": "<urn:uuid:e7cde86e-732f-42e0-84fe-2e6e4108dfba>",
"WARC-Target-URI": "https://www.bartleby.com/questions-and-answers/8-12/57749f8c-95a9-4f7a-8712-f1e9b0acad05",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:900b5386-be2f-43ab-93ef-0fba137bd300>"
},
"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-159\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
9,
10,
18,
19,
33,
34,
71,
72,
101,
102,
136,
137,
223,
224,
383,
393,
398,
406,
407,
427,
428,
482,
483,
590,
591,
652,
653,
760,
761,
868,
869,
956,
957,
1064,
1065,
1172,
1173,
1280,
1281,
1388,
1389,
1454,
1455,
1543,
1544,
1651,
1652,
1759,
1760,
1814,
1815,
1870,
1871,
1926,
1927,
1988,
1989,
2042,
2043,
2150,
2151,
2161,
2162,
2269,
2270,
2377,
2378,
2451,
2452,
2512,
2513,
2620,
2621,
2728,
2729,
2767,
2768,
2795,
2796,
2813,
2814,
2921,
2922,
3029,
3030,
3075,
3076,
3136,
3137,
3161,
3162,
3269,
3270,
3301,
3302,
3400,
3401,
3438,
3439,
3545,
3546,
3575,
3576,
3654,
3655,
3762,
3763,
3870,
3871,
3905,
3906,
4013,
4014,
4121,
4122,
4229,
4230,
4278,
4279,
4386,
4387,
4480,
4481,
4588,
4589,
4649,
4650,
4709,
4710,
4749,
4750,
4857,
4858,
4944,
4945,
5052,
5053,
5078,
5079,
5096,
5097,
5156,
5157,
5264,
5265,
5305,
5306,
5387,
5388,
5495,
5496,
5603,
5604,
5647,
5648,
5755,
5756,
5863,
5864,
5945,
5946,
5991,
5992,
6075,
6076,
6134,
6135,
6242,
6243,
6270,
6271,
6360,
6361,
6427,
6428,
6535,
6536,
6581,
6582,
6689,
6690,
6765,
6766,
6873,
6874
],
"line_end_idx": [
9,
10,
18,
19,
33,
34,
71,
72,
101,
102,
136,
137,
223,
224,
383,
393,
398,
406,
407,
427,
428,
482,
483,
590,
591,
652,
653,
760,
761,
868,
869,
956,
957,
1064,
1065,
1172,
1173,
1280,
1281,
1388,
1389,
1454,
1455,
1543,
1544,
1651,
1652,
1759,
1760,
1814,
1815,
1870,
1871,
1926,
1927,
1988,
1989,
2042,
2043,
2150,
2151,
2161,
2162,
2269,
2270,
2377,
2378,
2451,
2452,
2512,
2513,
2620,
2621,
2728,
2729,
2767,
2768,
2795,
2796,
2813,
2814,
2921,
2922,
3029,
3030,
3075,
3076,
3136,
3137,
3161,
3162,
3269,
3270,
3301,
3302,
3400,
3401,
3438,
3439,
3545,
3546,
3575,
3576,
3654,
3655,
3762,
3763,
3870,
3871,
3905,
3906,
4013,
4014,
4121,
4122,
4229,
4230,
4278,
4279,
4386,
4387,
4480,
4481,
4588,
4589,
4649,
4650,
4709,
4710,
4749,
4750,
4857,
4858,
4944,
4945,
5052,
5053,
5078,
5079,
5096,
5097,
5156,
5157,
5264,
5265,
5305,
5306,
5387,
5388,
5495,
5496,
5603,
5604,
5647,
5648,
5755,
5756,
5863,
5864,
5945,
5946,
5991,
5992,
6075,
6076,
6134,
6135,
6242,
6243,
6270,
6271,
6360,
6361,
6427,
6428,
6535,
6536,
6581,
6582,
6689,
6690,
6765,
6766,
6873,
6874,
6980
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6980,
"ccnet_original_nlines": 185,
"rps_doc_curly_bracket": 0.0001432699937140569,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30912071466445923,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.059530310332775116,
"rps_doc_frac_lines_end_with_ellipsis": 0.20430107414722443,
"rps_doc_frac_no_alph_words": 0.3342435657978058,
"rps_doc_frac_unique_words": 0.33799341320991516,
"rps_doc_mean_word_length": 4.122532844543457,
"rps_doc_num_sentences": 110,
"rps_doc_symbol_to_word_ratio": 0.022392140701413155,
"rps_doc_unigram_entropy": 5.121685028076172,
"rps_doc_word_count": 1216,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09834430366754532,
"rps_doc_frac_chars_dupe_6grams": 0.06762418150901794,
"rps_doc_frac_chars_dupe_7grams": 0.05366047844290733,
"rps_doc_frac_chars_dupe_8grams": 0.023538799956440926,
"rps_doc_frac_chars_dupe_9grams": 0.013564730063080788,
"rps_doc_frac_chars_top_2gram": 0.013963690027594566,
"rps_doc_frac_chars_top_3gram": 0.013165770098567009,
"rps_doc_frac_chars_top_4gram": 0.01994813047349453,
"rps_doc_books_importance": -844.0394287109375,
"rps_doc_books_importance_length_correction": -844.0394287109375,
"rps_doc_openwebtext_importance": -498.56787109375,
"rps_doc_openwebtext_importance_length_correction": -498.56787109375,
"rps_doc_wikipedia_importance": -362.580810546875,
"rps_doc_wikipedia_importance_length_correction": -362.580810546875
},
"fasttext": {
"dclm": 0.9841692447662354,
"english": 0.8208780288696289,
"fineweb_edu_approx": 2.8146495819091797,
"eai_general_math": 0.9991708993911743,
"eai_open_web_math": 0.5055106282234192,
"eai_web_code": 0.42602086067199707
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "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": "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,953,620,962,817,014,000 |
Tag Info
New answers tagged
0
I would recommend you to move your Selenium version and drivers for your other browsers (IE,Chrome) to the latest version. So far 2.44. Verify Selenium and drivers from browsers are same version and also check according to your US (32 bits, 64 bits)
0
You can identify element using XPATH by utilizing display text as below: driver.findElement(By.xpath("//div[text()='Update Profile Picture']")).click();
1
You need to tell it to return the value. Change this line: String mainURL = (String) js.executeScript("productObj.mainURL"); to: String mainURL = (String) js.executeScript("return productObj.mainURL");
0
As Twaldigas said, use contains in an xpath query to find all elements with 'selectedDetailsRadio' in the input id, then iterate through the results. You can analyze the numbers in the id either using string indices or regex.
1
Use xpath. I don't know what language you're using, but in Python it would be: driver.find_elements_by_xpath('//div[@class="item"]')
1
You can use the "not" pseudo-class in a CSS selector like this: div.item:not(.sold-out)
2
you can pass the driver as argument to the methods , so no need to re create them.
0
We use fancybox on our site, and it is usually inside of an iFrame (at least with our implementation). In order to find and interact with elements inside an iFrame, you have to switch your driver to the frame first. Here's a simple implementation in c#. var iframe = driver.FindElement(By.CssSelector("youriframeselector"); driver.SwitchTo().Frame(iframe); ...
0
GMail has official JAVA API. Here is your bag: https://developers.google.com/gmail/api/quickstart/quickstart-java
0
First thing to check is for duplicate elements on the page. Debug your code and ensure that: driver.findElements(By.className("fancybox-item fancybox-close")).size() evaluates to 1 Often times, if Selenium doesn't complain when you do a .click() but the action you expect doesn't happen, you'll find that there is more than one element matching your Find.By ...
0
I just replaced our Gmail-based tests with a tool called Inbucket (http://www.inbucket.org/) and just query its REST API to check the email contents. It works pretty well so far. If you use c#, it's pretty simple to create a small class to query the API using RestSharp.
2
Seems that you want to have a tool which can translate requirements/test cases (written by business people with no experience in programming) into executable code. In our practice FitNesse is not that tool. We started with FitNesse, and keep maintaining existing tests and even adding new when feasible, but these tests are written by developers, not business ...
0
Ok, I found documentation for Appium that shows how to automate Chrome. Here is the link to the documentation. And here are the desired capabilities to send when you're starting the session: DesiredCapabilities capabilities = new DesiredCapabilities(); capabilities.setCapability(MobileCapabilityType.PLATFORM_NAME, "Android"); ...
0
You can get list of all elements say by type, then loop over them, check the ID, and by some custom rules decide which one to pick. You have quite a mess on your hands, but do what you can.
0
After you driver.get(URL) to your page, you can execute javascript in it from webdriver, like this driver.get('javascript:<your JS snippet here>') so try driver.get('javascript:localStorage.clear();')
0
This scenario works with maven-surefire-plugin 2.16 or higher, JUnit 4.7 or higher. The Parameterized runner is a suite and therefore every single configuration means a new class. In your configuration of maven-surefire-plugin you should use parallel=classes and certain threadCount. You have many possibilities like classesAndMethods or threadCount + ...
0
Someone develop a webdriverjs-helper: https://github.com/surevine/webdriverjs-helper This helper provide a function to get the values of a dropdown: browser.dropdownlist(selector).value(valueHandler) https://github.com/surevine/webdriverjs-helper#browserdropdownlistselectorvaluesvalueshandler
0
//create a list/array of the partner codes found within the source file List<MindsparkPartnerCode> records = new ArrayList<MindsparkPartnerCode>(); //set the location of the file and create a read buffer FileReader r = new FileReader("C:\\DailyLocalGuidePartnerCode.csv"); BufferedReader bfr = new ...
0
line contains nothing but commas. That causes line.split to return a zero-length array. Since the array is empty, chunks[0] causes an ArrayOutOfBoundsException.
2
You can use WebDriverWait to synch with page load. Something like the following might help WebDriverWait wait = new WebDriverWait(driver, 15); //you can play with the time integer to wait for longer than 15 seconds.` wait.until(ExpectedConditions.titleContains("title")); //if you want to wait for a particular title to show up OR ...
0
I have tested an ExtJS application. Most of the page element attributes are dynamic. They change not only when you add a new user or something, they change every time when you open the application. I have found the xpath expressions I get from the tools (Firebug etc.) is not very useful. Here is why: hard to read break easily hard to debug What I do ...
0
Back end testing is as important as front end testing. We had performed database testing with TestingWhiz tool. Please take a look at this webinar video that we conducted on automated database testing - Webinar Video. You can also learn more on database testing with the articles in learn more section.
0
You have the following options: driver.findElement(By.className="k-button").click(); // Do not work if you have several HTML elements with the k-button CSS class on the same page driver.findElement(By.xpath("//input[@onclick='Post();']")).click; //Do not work if you have several HTML elements with this onlick action on the same page ...
0
We can use something like By.xpath("//td[contains(text(),'youruser')]") //here user text is case sensitive By.xpath("//td[contains(lower-case(text()),'youruser')]") //to handle case sensitivity. Here user is not case sensitive
0
there will be 2 reasons : 1 - May be it is trying to click the button before page loads completly in this case you should use wait() 2 - may be that button is located in iframe in this case u need to move to iframe and then click on button
3
You should be splitting the xpath to fetch individual tables for clarity sake. I suggest the following: // Get the content or container WebElement content = driver.findElement(By.id("contentText")); //Get the table of users WebElement tblUsers = content.findElement(By.xpath(".//table/tbody/tr[2]/td/table/tbody/tr/td[1]/table")); // Get the rows which ...
Top 50 recent answers are included
|
{
"url": "http://sqa.stackexchange.com/tags/selenium/new",
"source_domain": "sqa.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "93167",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:USC4RBVJX6E7ORSBKYC4CCYM26DO5I2J",
"WARC-Concurrent-To": "<urn:uuid:5e613df1-ed1b-4732-a367-5e3e4ba85ea3>",
"WARC-Date": "2014-12-19T12:13:35Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:2HEUZIRMIAHWTRYXNREZVI5BLTGVJQPQ",
"WARC-Record-ID": "<urn:uuid:70141b94-46e5-4f93-8e9e-67c7b78b66ed>",
"WARC-Target-URI": "http://sqa.stackexchange.com/tags/selenium/new",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0ccdf18d-a1d3-4eb4-8556-c296eca21415>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-231-17-201.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-52\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for December 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
9,
10,
29,
30,
32,
33,
283,
284,
285,
287,
288,
441,
442,
443,
445,
446,
648,
649,
650,
652,
653,
879,
880,
881,
883,
884,
1017,
1018,
1019,
1021,
1022,
1110,
1111,
1112,
1114,
1115,
1198,
1199,
1200,
1202,
1203,
1564,
1565,
1566,
1568,
1569,
1683,
1684,
1685,
1687,
1688,
2050,
2051,
2052,
2054,
2055,
2326,
2327,
2328,
2330,
2331,
2695,
2696,
2697,
2699,
2700,
3032,
3033,
3034,
3036,
3037,
3227,
3228,
3229,
3231,
3232,
3433,
3434,
3435,
3437,
3438,
3794,
3795,
3796,
3798,
3799,
4093,
4094,
4095,
4097,
4098,
4400,
4401,
4402,
4404,
4405,
4566,
4567,
4568,
4570,
4571,
4906,
4907,
4908,
4910,
4911,
5267,
5268,
5269,
5271,
5272,
5575,
5576,
5577,
5579,
5580,
5919,
5920,
5921,
5923,
5924,
6151,
6152,
6153,
6155,
6156,
6396,
6397,
6398,
6400,
6401,
6758,
6759,
6760,
6761
],
"line_end_idx": [
9,
10,
29,
30,
32,
33,
283,
284,
285,
287,
288,
441,
442,
443,
445,
446,
648,
649,
650,
652,
653,
879,
880,
881,
883,
884,
1017,
1018,
1019,
1021,
1022,
1110,
1111,
1112,
1114,
1115,
1198,
1199,
1200,
1202,
1203,
1564,
1565,
1566,
1568,
1569,
1683,
1684,
1685,
1687,
1688,
2050,
2051,
2052,
2054,
2055,
2326,
2327,
2328,
2330,
2331,
2695,
2696,
2697,
2699,
2700,
3032,
3033,
3034,
3036,
3037,
3227,
3228,
3229,
3231,
3232,
3433,
3434,
3435,
3437,
3438,
3794,
3795,
3796,
3798,
3799,
4093,
4094,
4095,
4097,
4098,
4400,
4401,
4402,
4404,
4405,
4566,
4567,
4568,
4570,
4571,
4906,
4907,
4908,
4910,
4911,
5267,
5268,
5269,
5271,
5272,
5575,
5576,
5577,
5579,
5580,
5919,
5920,
5921,
5923,
5924,
6151,
6152,
6153,
6155,
6156,
6396,
6397,
6398,
6400,
6401,
6758,
6759,
6760,
6761,
6795
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6795,
"ccnet_original_nlines": 135,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33239635825157166,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018974000588059425,
"rps_doc_frac_lines_end_with_ellipsis": 0.07352940738201141,
"rps_doc_frac_no_alph_words": 0.25228390097618103,
"rps_doc_frac_unique_words": 0.4429319500923157,
"rps_doc_mean_word_length": 5.494240760803223,
"rps_doc_num_sentences": 104,
"rps_doc_symbol_to_word_ratio": 0.00913562998175621,
"rps_doc_unigram_entropy": 5.484316825866699,
"rps_doc_word_count": 955,
"rps_doc_frac_chars_dupe_10grams": 0.01562798023223877,
"rps_doc_frac_chars_dupe_5grams": 0.01562798023223877,
"rps_doc_frac_chars_dupe_6grams": 0.01562798023223877,
"rps_doc_frac_chars_dupe_7grams": 0.01562798023223877,
"rps_doc_frac_chars_dupe_8grams": 0.01562798023223877,
"rps_doc_frac_chars_dupe_9grams": 0.01562798023223877,
"rps_doc_frac_chars_top_2gram": 0.011435110121965408,
"rps_doc_frac_chars_top_3gram": 0.002668190049007535,
"rps_doc_frac_chars_top_4gram": 0.004192870110273361,
"rps_doc_books_importance": -607.387451171875,
"rps_doc_books_importance_length_correction": -607.387451171875,
"rps_doc_openwebtext_importance": -372.6012268066406,
"rps_doc_openwebtext_importance_length_correction": -372.6012268066406,
"rps_doc_wikipedia_importance": -308.3525390625,
"rps_doc_wikipedia_importance_length_correction": -308.3525390625
},
"fasttext": {
"dclm": 0.08796489238739014,
"english": 0.8162571787834167,
"fineweb_edu_approx": 1.9609036445617676,
"eai_general_math": 0.4978863000869751,
"eai_open_web_math": 0.10640174150466919,
"eai_web_code": 0.8203322887420654
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,992,553,144,102,040,000 |
Knihovna přípon souborů
Přípona souboru .NPFX
• Vývojář: Symantec
• Kategorie: Soubory nastavení
Co jsou soubory .NPFX a jak je otevřít?
Nelze otevřít soubor .NPFX? Ptáte se, co obsahuje? Na našich stránkách vám vysvětlíme, co tento soubor je, k čemu se používá a jaký software otevírá soubor .NPFX.
Co je přípona souboru .NPFX?
Přípona souboru .NPFX je vytvořena společností Symantec. .NPFX byl klasifikován jako soubory nastavení.
.NPFX je soubor nastavení brány Norton Internet Security Firewall
Soubor nastavení vytvořený programem brány firewall, který je součástí aplikace Symantec Norton Internet Security for Mac; ukládá nastavení blokování připojení brány firewall, jako jsou filtry IP, portů, služeb a aplikací; slouží k migraci nastavení brány firewall z jednoho počítače na druhý.
Seznam veškerého softwaru, který může otevřít soubor nastavení brány Norton Internet Security Firewall
Mac
Symantec Norton Internet Security 5
Jak opravit problémy se soubory .NPFX
1. Musíte aktualizovat aplikaci, kterou běžně používáte k otevírání souborů .NPFX. Pouze nejnovější verze softwaru podporuje aktuální formát souboru .NPFX
2. Musíte zkontrolovat, zda soubor .NPFX neobsahuje viry. Chcete-li to provést, musíte jej oskenovat pomocí oblíbeného antiviru (Norton, Nod32, Kaspersky, Dr.Web atd.)
|
{
"url": "http://www.ac.msk.su/cs/npfx.html",
"source_domain": "www.ac.msk.su",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "18336",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H7A7OVWHXBF3FIINI642RVXYCIDZWO6X",
"WARC-Concurrent-To": "<urn:uuid:2cd8d83b-d102-4934-9ca3-5289be0ead4c>",
"WARC-Date": "2024-03-04T15:09:16Z",
"WARC-IP-Address": "188.127.225.100",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:B4HB3V3XKCMUICQ2DLGLHPID4E43XHGN",
"WARC-Record-ID": "<urn:uuid:eb4e8adf-5db8-4b24-9295-0d3006832331>",
"WARC-Target-URI": "http://www.ac.msk.su/cs/npfx.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ab916714-da30-4dcc-abd4-2174d6e00433>"
},
"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-145\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,
24,
25,
26,
48,
49,
71,
104,
105,
145,
146,
309,
310,
339,
340,
444,
445,
511,
512,
806,
807,
910,
914,
950,
951,
989,
990,
1147
],
"line_end_idx": [
24,
25,
26,
48,
49,
71,
104,
105,
145,
146,
309,
310,
339,
340,
444,
445,
511,
512,
806,
807,
910,
914,
950,
951,
989,
990,
1147,
1316
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1316,
"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.0476190485060215,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05627705901861191,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22077922523021698,
"rps_doc_frac_unique_words": 0.568306028842926,
"rps_doc_mean_word_length": 6.366120338439941,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.348958969116211,
"rps_doc_word_count": 183,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08927039057016373,
"rps_doc_frac_chars_dupe_6grams": 0.08927039057016373,
"rps_doc_frac_chars_dupe_7grams": 0.08927039057016373,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03776824101805687,
"rps_doc_frac_chars_top_3gram": 0.07553648203611374,
"rps_doc_frac_chars_top_4gram": 0.04806866869330406,
"rps_doc_books_importance": -115.40557098388672,
"rps_doc_books_importance_length_correction": -115.40557098388672,
"rps_doc_openwebtext_importance": -53.019527435302734,
"rps_doc_openwebtext_importance_length_correction": -53.019527435302734,
"rps_doc_wikipedia_importance": -64.36652374267578,
"rps_doc_wikipedia_importance_length_correction": -64.3664321899414
},
"fasttext": {
"dclm": 0.2871693968772888,
"english": 0.0005806999979540706,
"fineweb_edu_approx": 1.8768585920333862,
"eai_general_math": 0.00032543999259360135,
"eai_open_web_math": 0.8406516909599304,
"eai_web_code": 0.35865622758865356
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.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": "1",
"label": "Factual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"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
|
2,792,007,891,616,535,600 |
We are reader supported and sometimes earn a commission if you buy through a link on our site.
How to Watch NFL Game Pass While Abroad in 2022
Don't miss out on any of the NFL Game Pass action while you're away! In this article, I discuss the best VPN to use to watch NFL Game Pass.
The National Football League’s NFL Game Pass offers online access to professional American football action.
However, if you’re a U.S. resident who has subscribed to NFL Game Pass and is now living or visiting abroad, you’ll find that you can’t access the streaming service from outside the U.S.
The same is true for NFL fans around the globe who subscribe to international versions of NFL Game Pass. Once international fans are outside of their own country, they also find that their service is blocked.
Much like many other streaming services – such as Netflix, Hulu, BBC iPlayer, and others – access to NFL Game Pass is restricted to the borders of the countries that it’s available in. No access to your favorite team’s games? UGH!
Much like other streaming services, this is all due to the contracts the NFL has in place with broadcast and cable networks in various countries, which limit online streaming of games.
In this article, I’ll tell you how to watch NFL Game Pass while you’re traveling outside of your home country.
What Is the Best VPN for Streaming NFL Game Pass?
NordVPN
NordVPN Dec 2022
NordVPN is the best VPN for opening access to NFL American football action on NFL Game Pass. The provider delivers reliable access to the service while you’re traveling or living abroad.
NordVPN’s thousands of servers located around the globe provide reliable access to NFL Game Pass. This includes the U.S., the U.K., Mexico, and other countries where NFL Game Pass is available.
The provider’s high-speed connections have no problem delivering the HD streams that NFL Game Pass provides and will also be able to handle 4K streams when the service begins broadcasting in the ultra high definition 4K format.
All of the provider’s connections are well-protected, thanks to military-grade encryption, a kill switch, DNS leak and IPv6 leak protections, and more.
The provider also does an excellent job of protecting your privacy thanks to a strict no-server-logs-ever policy and a Bitcoin payment option, which helps keep your payment info protected.
NFL Game Pass is available on most popular device platforms, and NordVPN has it covered. Apps are available for the Windows, macOS, iOS, Android, Amazon Fire, Linux, and Android TV device platforms.
Firefox and Chrome browser extensions are available to protect and enhance your browser-based gridiron action.
Registering and setting up the NordVPN service takes just a few minutes, as you can quickly select a subscription length (1 month, 1 year, or 2 years), enter your credit card or Bitcoin payment info, then download the app.
The VPN provider offers a 30-day money-back guarantee, which provides more than enough time to decide if the provider is the right VPN for your needs.
BEST VPN FOR VIEWING NFL GAME PASS:NordVPN is the best way to view American football games via NFL Game Pass. Fast connection speeds, comprehensive security and privacy protections, and excellent global server coverage all add up to the best way to watch NFL Game Pass.
Read my full review of NordVPN.
NordVPN Coupon
SAVE up to 68% + 3 months FREE
Get Deal ›
Coupon applied automatically
How to Stream NFL Game Pass Using a VPN
Using a VPN to view NFL Game Pass requires but a few easy steps:
1. Subscribe to a VPN provider. (I use and recommend NordVPN.) However, Surfshark is an excellent budget-priced option for users who are watching their pennies, and ExpressVPN is a great option for users who don’t mind paying more for reliable VPN service.)
2. Download and install the provider’s VPN app(s) on your device(s).
3. Log into the VPN service.
4. Select a server located in the U.S. or whichever is your home country.
5. Put on your team jersey and enjoy the action! (Face painting optional.)
How to Watch Live Games From Anywhere
The NFL is based in, and arguably best known in, the United States.
However, the league is also popular in other countries. (The NFL plays regular-season games in other parts of the world each season, including in the U.K. and Mexico.)
This means NFL Game Pass is available in numerous countries, including the United States, Mexico, the United Kingdom, and other locations around the globe.
However, only NFL Game Pass subscribers outside of the U.S. and Mexico enjoy access to live games, so I’ll be explaining how you can enjoy games as they happen, even if you’re in a replay-only country.
While the difference in the levels of service seems odd, it’s all due to the contracts the NFL has in place with broadcast and cable networks in the U.S., which limit online streaming of live games.
The official word from NFL Game Pass customer support is:
Personally streaming live NFL games online in the United States using a computer, a mobile device or a video game console requires a subscription to a cable, satellite, or mobile phone service from a provider that offers streaming in addition to a subscription.
Examples include DirecTV, Verizon, and our list of companies that also allow watching the NFL Network and the Redzone on the internet.
Luckily, you can get around the “replay-only” sticking point that applies to U.S.- and Mexico-based viewing.
To do this, simply load your VPN app, select a country where the full version of NFL Game Pass is available (for our purposes, let’s say the United Kingdom), go to the NFL Game Pass website and sign up for the service. (U.S./Mexico and international subscriptions are not interchangeable, so you would need to buy an international subscription.)
From then on, you can load up your VPN app, log into a server in the U.K., and see all of the gridiron action using the foreign version of Game Pass.
Can I Use a Free VPN to View NFL Game Pass?
Attempting to use a free VPN to view NFL Game Pass is like being a fan of the 2019 Cincinnati Bengals – a frustrating experience at best.
There are numerous reasons to avoid a free VPN like a running back avoids a defensive tackle. They involve reliability, convenience, and last but not least, privacy and security.
First off, let’s take a look at reliability. You’ve put on your team jersey, grabbed your foam finger, and logged into your free VPN provider. You visit the NFL Game Pass website, and you’re turned away at the gate because NFL Game Pass has detected you’re using a VPN.
While once upon a time any VPN could access NFL Game Pass and other streaming services, like Netflix, those streaming services have become quite adept at intercepting your attempt by detecting and blocking your VPN connection.
NFL Game Pass does this by tracking and blocking users who use IP addresses that belong to VPNs. This means a VPN provider must have the resources to quickly set up new servers sporting fresh IP addresses that can do an end-run around the NFL’s defenses.
Free VPNs are usually run on a shoestring, meaning they simply do not have the resources to participate in this virtual game of sack the quarterback.
Now for convenience. When you connect to a free VPN, you may find that you’re forced to wait in a queue for a while before being allowed to connect to a VPN server.
Then, once you’re allowed to connect, you will either find that your server selection is severely limited or that you don’t get to select a server, but are instead automatically connected to a server of the VPN provider’s choice.
As far as privacy and online security go, freebie VPNs don’t exactly do a great job of protecting either of those.
“Free” VPNs keep their servers humming by tracking their users’ online activities, saving them in a big ol’ file, and then selling that info to advertisers and other interested parties.
Some sans-fee VPN providers also insert unwanted tracking cookies and advertisements into their users’ browsing sessions. (Those tracking cookies stick around long after you’ve disconnected from the provider’s servers.)
So, if you’re used to defeat (I’m looking at you, Bengals fans), go ahead and give a free VPN a shot.
But if you enjoy having reliable access to your favorite NFL teams’ games, then spring for a paid VPN. It’ll cost you less per month than that big foam finger did the last time you attended a game, and it’s much more useful.
What Else Is a VPN Good For?
In addition to providing access to NFL Game Pass, a VPN is also a great way to unblock other streaming services, including Netflix, Amazon Prime Video, BBC iPlayer, Hulu, HBO, Disney+, and more.
Plus, it unblocks other services and sites, including financial websites, gaming servers, and more.
A VPN’s encrypted connection protection prevents your ISP from monitoring your online activities and throttling your connection speeds simply because you’re engaging in “unapproved” activities, such as streaming from certain video services or sharing files via BitTorrent.
That same encryption also keeps your online activities safe from observation from the guy in the Patriots jersey one table over at Starbucks.
Unencrypted public Wi-Fi connections are a big attraction for hackers who are looking to steal your banking, credit card, or shopping information. Encryption ensures they cannot steal your info, because they cannot see your info.
Conclusion
A VPN can ensure that you never miss a big game because you’re turned away at the NFL’s virtual gate. It offers reliable access to NFL Game Pass from home, no matter where you’re traveling abroad.
NordVPN Logo
A VPN – like my top choice, NordVPN – allows you to watch your favorite teams, while also enhancing and protecting all of your other online activities.
For more information or to subscribe, visit NordVPN’s website.
NordVPN Coupon
SAVE up to 68% + 3 months FREE
Get Deal ›
Coupon applied automatically
NFL logo” by Mohamed Hassan licensed under Pixabay License
Leave a Comment
|
{
"url": "https://pixelprivacy.com/vpn/streaming/nfl-gamepass-vpn/",
"source_domain": "pixelprivacy.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "409296",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:272IOYOLUXWJKXL2QLMBO7SAC4HGPUDC",
"WARC-Concurrent-To": "<urn:uuid:c6539ed3-b6a1-4d80-94c9-41fbce5d7421>",
"WARC-Date": "2022-12-07T03:09:47Z",
"WARC-IP-Address": "172.66.43.45",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QE3C3E3WCFHMOJVKF7T7FJERM5XFGMQO",
"WARC-Record-ID": "<urn:uuid:c3284640-7d10-48a2-8b84-f69ad56a34b5>",
"WARC-Target-URI": "https://pixelprivacy.com/vpn/streaming/nfl-gamepass-vpn/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d00874ab-7f13-4438-a8a2-37a15d9e1249>"
},
"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-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,
95,
96,
144,
145,
285,
286,
394,
395,
582,
583,
792,
793,
1024,
1025,
1210,
1211,
1322,
1323,
1373,
1374,
1382,
1383,
1400,
1401,
1588,
1589,
1783,
1784,
2012,
2013,
2165,
2166,
2355,
2356,
2555,
2556,
2667,
2668,
2891,
2892,
3043,
3044,
3314,
3315,
3347,
3348,
3363,
3394,
3405,
3434,
3435,
3475,
3476,
3541,
3542,
3802,
3873,
3904,
3981,
4058,
4059,
4097,
4098,
4166,
4167,
4335,
4336,
4492,
4493,
4695,
4696,
4897,
4898,
4956,
4957,
5219,
5220,
5355,
5356,
5465,
5466,
5812,
5813,
5963,
5964,
6008,
6009,
6147,
6148,
6327,
6328,
6598,
6599,
6826,
6827,
7082,
7083,
7233,
7234,
7399,
7400,
7630,
7631,
7746,
7747,
7933,
7934,
8154,
8155,
8257,
8258,
8483,
8484,
8513,
8514,
8709,
8710,
8810,
8811,
9084,
9085,
9227,
9228,
9458,
9459,
9470,
9471,
9668,
9669,
9682,
9683,
9835,
9836,
9899,
9900,
9915,
9946,
9957,
9986,
9987,
9989,
9990,
10049,
10050
],
"line_end_idx": [
95,
96,
144,
145,
285,
286,
394,
395,
582,
583,
792,
793,
1024,
1025,
1210,
1211,
1322,
1323,
1373,
1374,
1382,
1383,
1400,
1401,
1588,
1589,
1783,
1784,
2012,
2013,
2165,
2166,
2355,
2356,
2555,
2556,
2667,
2668,
2891,
2892,
3043,
3044,
3314,
3315,
3347,
3348,
3363,
3394,
3405,
3434,
3435,
3475,
3476,
3541,
3542,
3802,
3873,
3904,
3981,
4058,
4059,
4097,
4098,
4166,
4167,
4335,
4336,
4492,
4493,
4695,
4696,
4897,
4898,
4956,
4957,
5219,
5220,
5355,
5356,
5465,
5466,
5812,
5813,
5963,
5964,
6008,
6009,
6147,
6148,
6327,
6328,
6598,
6599,
6826,
6827,
7082,
7083,
7233,
7234,
7399,
7400,
7630,
7631,
7746,
7747,
7933,
7934,
8154,
8155,
8257,
8258,
8483,
8484,
8513,
8514,
8709,
8710,
8810,
8811,
9084,
9085,
9227,
9228,
9458,
9459,
9470,
9471,
9668,
9669,
9682,
9683,
9835,
9836,
9899,
9900,
9915,
9946,
9957,
9986,
9987,
9989,
9990,
10049,
10050,
10065
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10065,
"ccnet_original_nlines": 144,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37572532892227173,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06237911060452461,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1537717580795288,
"rps_doc_frac_unique_words": 0.338823527097702,
"rps_doc_mean_word_length": 4.71999979019165,
"rps_doc_num_sentences": 107,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.554666042327881,
"rps_doc_word_count": 1700,
"rps_doc_frac_chars_dupe_10grams": 0.03364904969930649,
"rps_doc_frac_chars_dupe_5grams": 0.10294117778539658,
"rps_doc_frac_chars_dupe_6grams": 0.06231306120753288,
"rps_doc_frac_chars_dupe_7grams": 0.047108668833971024,
"rps_doc_frac_chars_dupe_8grams": 0.04062812030315399,
"rps_doc_frac_chars_dupe_9grams": 0.04062812030315399,
"rps_doc_frac_chars_top_2gram": 0.027916250750422478,
"rps_doc_frac_chars_top_3gram": 0.042497508227825165,
"rps_doc_frac_chars_top_4gram": 0.009720839560031891,
"rps_doc_books_importance": -872.8182983398438,
"rps_doc_books_importance_length_correction": -872.8182983398438,
"rps_doc_openwebtext_importance": -529.1533813476562,
"rps_doc_openwebtext_importance_length_correction": -529.1533813476562,
"rps_doc_wikipedia_importance": -370.3009948730469,
"rps_doc_wikipedia_importance_length_correction": -370.3009948730469
},
"fasttext": {
"dclm": 0.022297320887446404,
"english": 0.9312811493873596,
"fineweb_edu_approx": 1.1856478452682495,
"eai_general_math": 0.0007265200256370008,
"eai_open_web_math": 0.03232895955443382,
"eai_web_code": 0.002029780065640807
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.677",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "796.3312",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": "Sports and Athletics"
}
}
},
"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": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,485,734,334,474,879,000 |
HealthKit for iOS8: Part 2
So you got past the intro and learned about the health store and how we need authorization from the user in order to have read and write access to certain properties. Now that the user trusts your app, let’s learn how to interact with the health store.
1. HKObjects and the health store
Before we get into reading and writing, let’s get to know HKObjects. Here is the class tree:
HealthKit HKObject Hierarchy Santiapps.com
HealthKit HKObject Hierarchy
As you can see, HKObjectType inherits directly from NSObject. You can basically have 2 types of HKObjects; HKCharacteristic and HKSample -Type. HKCharacteristicType doesn’t change over time whereas HKSampleType does change, such as calories consumed, calories burnt, Glucose levels etc. Let’s see some examples:
HKCharactersiticType has 3 main objects:
Biological Sex
Blood Type
Birthdate.
HKSampleType has objects like:
-HKCategoryType: discrete, finite values that can be enumerated such as sleep analysis.
-HKCorrelationType: for creating correlated objects grouped as one.
-HKQuantityType: used for creating objects that store numerical values.
-HKWorkoutType: used for creating workout objects.
-FURTHERMORE: HKSample has HKCategorySample & HKQuantitySample
For the most part you will simply fetch HKCharacteristic types from the health store of the user. The user will have input those values through his/her Health app. HKSample types on the other hand you will read and write constantly. Let’s think about how we need to write data:
A. Decide on a Type Identifier
B. Create a matching HKObjectType
C. Create an HKSample
D. Call saveObject on the health store
Let’s take a look at saving data:
self.healthStore?.saveObject(calorieSample, withCompletion: { (success, error) in
// do a bunch of UI stuff probably in the main queue
})
Ok so you might be thinking, what kinds of objects are involved here. What is dateOfBirth or calorieSample? Well the best way of understanding is to see an example. Here are images representing the logic behind writing data to the store. As mentioned earlier, you find a matching type, set it, create a sample for it and saveObject! This is the process for a Category type:
HealthKit iOS8 HKCategory by Santiapps.com
HealthKit iOS8 HKCategory
We need to find the matching identifier for the category type in order to save a Category Sample. Likewise for the Quantity type:
HealthKit iOS8 HKQuantity by Santiapps.com
HealthKit iOS8 HKQuantity
What this means is that before you call saveObject and pass it in that calorieSample, you need to have properly defined calorieSample:
// 1. MUST FIND THE RIGHT TYPE FOR ENERGY BEING CONSUMED
var quantityType: HKQuantityType = HKQuantityType.quantityTypeForIdentifier(HKQuantityTypeIdentifierDietaryEnergyConsumed)
// 2. MUST CREATE AND HKQUANTITY FOR THAT TYPE
var quantity: HKQuantity = HKQuantity(unit: HKUnit.jouleUnit(), doubleValue:300)
// 3. MUST DEFINE A DATE FOR THE SAMPLE AND OPTIONALLY SOME METADATA
var now: NSDate = NSDate()
var metadata: NSDictionary = ["HKMetadataKeyFoodType":"Ham Sandwich"]
//4. CREATE HKOBJECT TO BE SAVED
var calorieSample: HKQuantitySample = HKQuantitySample(type: quantityType, quantity:quantity, startDate:now, endDate:now, metadata:metadata)
Finally you can call the saveObject method. That’s not so bad. So you would do the same for energy burnt in a workout, calcium intake, etc.
Now let’s take a look at how we would read data from the store:
func fetchUsersAge () -> () {
var error: NSError?
var dateOfBirth = self.healthStore?.dateOfBirthWithError(&error)
if error != nil {
NSLog("An error occured fetching the user's age information. In your app, try to handle this gracefully. The error was: \(error)")
//Present VC
abort()
}
}
As you can see, this is quite simple, we basically say self.healthStore?.dateOfBirthWithError.
Now dateOfBirth is not only a finite, or discrete measure but its also a Characteristic type, it doesn’t change with time. How would you read other data, HKSampleTypes such as height and weight or Dietary Calories which are not discrete, in other words not whole numbers but infinitesimally scalar and change constantly? That’s what HKQuery is for!
2. Queries & Stats
Sometimes you want to be able to query the health store for data, that’s what HKQuery is for. If it’s a quantity sample type then we probably want to save the start and end date with it as before. So here is an example of how to query our health store:
// 1. Create a date
var now: NSDate = NSDate()
let calendar : NSCalendar = NSCalendar.currentCalendar()
var components: NSDateComponents = calendar.components(.CalendarUnitYear | .CalendarUnitMonth | .CalendarUnitDay, fromDate: now)
var startDate: NSDate = calendar.dateFromComponents(components)!
var endDate: NSDate = calendar.dateByAddingUnit(.CalendarUnitDay, value:1, toDate:startDate, options:nil)!
// 2. Create the identifier
var sampleType: HKSampleType = HKSampleType.quantityTypeForIdentifier(HKQuantityTypeIdentifierDietaryEnergyConsumed)
// 3. Create the predicate to search with
var predicate: NSPredicate = HKQuery.predicateForSamplesWithStartDate(startDate, endDate:endDate, options:.None)
// 4. Create the HKSampleQuery because we are querying sample types
var query: HKSampleQuery = HKSampleQuery(sampleType: sampleType, predicate: predicate, limit: 0, sortDescriptors: nil) { (query:HKSampleQuery?, results:[AnyObject]!, error:NSError!) -> Void in
if (error != nil) {
NSLog("An error occured fetching the user's tracked food. In your app, try to handle this gracefully. The error was: %@.", error)
abort()
}
if results != nil {
NSLog("Got something!")
}
// do UI stuff probably in the main queue
self.healthStore?.executeQuery(query) // EXECUTE QUERY
}
3. User input UI
So let’s start creating an app. As you can see, this is all based on the sample app from Apple called Fit. But it has been modified to add some workout data. What we want is to be able to read data from our health store (which will provide us with a user’s profile view), collect some user info on how much energy was consumed (which will give us our Energy Consumption view) and have the user input their workout info which in our case is going to be a swimming app (this will give us a Workout view). For the last 2 data, we will write to the health store how much energy we consumed and how much we burnt.
Ok so we have our AppDelegate and Storyboard. To recap, you’ve activated the HealthKit capabilities in your project which if you go to the Dev Center, Xcode has created a Team provisioning profile for this app you created and its enabled for HealthKit. This also gave you an Entitlements file in your navigator which looks like this:
HealthKit app iOS8 by Santiapps.com
HealthKit app iOS8
The Journal file is something I create to keep track of my work, ignore that. The FoodItem is a file we will quickly throw up on the screen but is a simple Custom Class file to be used in the UI part of this app. For the first part which deals with the Profile view controller we won’t concern ourselves with it.
Ok so let’s take a quick look at our Profile view controller class. As always we start out with our properties:
class ProfileViewController: UITableViewController, UITextFieldDelegate {
@IBOutlet var ageValueLabel: UITextField!
@IBOutlet var ageUnitLabel: UILabel?
@IBOutlet var heightValueTextField: UITextField!
@IBOutlet var heightUnitLabel: UILabel?
@IBOutlet var weightValueTextField: UITextField!
@IBOutlet var weightUnitLabel: UILabel?
var healthStore: HKHealthStore?
}
We have created 6 IBOutlet’s. Each UILabel will hold unit values and each corresponding UITextField will hold the respective data we fetch from the health store.
Then we create a variable for our HealthStore which, if you recall, is set for us from our AppDelegate once it receives authorization.
Now our methods:
Each time our view will appear, we want to update our data, since it may have changed:
override func viewWillAppear(animated: Bool) {
// Update the user interface based on the current user's health information.
self.updateUsersAge()
self.updateUsersHeight()
self.updateUsersWeight()
}
Ok so with each viewWillAppear, we call methods to update our UI with the latest data from our store, which of course means we will fetch from the store and as you recall, it was different fetching a CharacteristicType such as DOB vs a Sample Type such as weight. So let’s take a look at the simplest one first:
func updateUsersAge () -> () {
var error: NSError?
var dateOfBirth = self.healthStore?.dateOfBirthWithError(&error)
if error != nil {
NSLog("An error occured fetching the user's age information. In your app, try to handle this gracefully. The error was: \(error)")
abort()
}
if dateOfBirth != nil {
NSLog("Found a DOB \(dateOfBirth)")
}
if dateOfBirth == nil {
var dateFormatter = NSDateFormatter()
dateFormatter.dateFormat = "yyyy-MM-dd"
dateOfBirth = dateFormatter.dateFromString("1974-10-18")!
}
// Compute the age of the user.
let now: NSDate = NSDate()
let calendar : NSCalendar = NSCalendar.currentCalendar()
var ageComponents = calendar.components(.CalendarUnitYear,
fromDate: dateOfBirth!,
toDate: now,
options:nil)
var usersAge: Int = ageComponents.year
var ageValueString: NSString = NSNumberFormatter.localizedStringFromNumber(usersAge, numberStyle:NSNumberFormatterStyle.NoStyle)
if let something = self.ageValueLabel!.text {
self.ageValueLabel!.text = ageValueString
}
}
Ok so first we simply fetch the value for dateOfBirth from our store and if we get an error back, we log it. If dateOfBirth is not nil, then we log success. You will see a strange bit now, where it checks whether if DOB is nil. I know, we already checked if error was nil, so DOB should not be nil, but sometimes its empty. The user may not have set DOB on his or her device yet. This means you will get nil and your app will crash. So in case DOB IS nil, we hard code one. Finally we compute the user’s age based on their DOB by using NSDateComponents and we assign the computed Int to our label using NSNumberFormatter.localizedStringFromNumber method.
Now let’s see how to get height and weight, which are Sample types:
func updateUsersHeight () -> () {
// Fetch user's default height unit in inches.
var lengthFormatter: NSLengthFormatter = NSLengthFormatter()
lengthFormatter.unitStyle = NSFormattingUnitStyle.Long
var heightFormatterUnit: NSLengthFormatterUnit = NSLengthFormatterUnit.Inch
self.heightUnitLabel!.text = lengthFormatter.unitStringFromValue(10, unit:heightFormatterUnit)
var heightType: HKQuantityType = HKQuantityType.quantityTypeForIdentifier(HKQuantityTypeIdentifierHeight)
self.fetchMostRecentDataOfQuantityType(heightType, withCompletion: { (mostRecentQuantity:HKQuantity?, error:NSError?) -> () in
//some code
if let something = error {
NSLog("An error occured fetching the user's height information. In your app, try to handle this gracefully. The error was: %@.", something)
abort()
}
//Determine the height in the required unit.
var usersHeight: Double = 0.0
if let somethingElse = mostRecentQuantity {
var heightUnit: HKUnit = HKUnit.inchUnit()
usersHeight = mostRecentQuantity!.doubleValueForUnit(heightUnit)
// Update the user interface.
dispatch_async(dispatch_get_main_queue(), {
self.heightValueTextField.text = NSNumberFormatter.localizedStringFromNumber(usersHeight, numberStyle:.NoStyle)
})
}
})
}
Ok so we use NSLengthFormatter to determine the length style to use. Then we use its NSLengthFormatterUnit in order to specify the unit in order to set the label for the height value. Now we get into fetching requirements, so we must create the matching type first and then pass it into our fetch method which is called fetchMostRecentDataOfQuantityType. So we are passing our quantity type of height, to this method. We will study that method in a bit, but for the time being, notice we pass in a completion handler. If that completion handler receives an error, it will log the error. Otherwise, we create a variable for height, use the received mostRecentQuantity variable and test it since its an optional, create a heightUnit from HKUnit and unwrap the mostRecentQuantity value into our usersHeight variable using our heightUnit.
What? Double take! Ok, here we go, this time with weight:
func updateUsersWeight () -> (){
// Fetch the user's default weight unit in pounds.
var massFormatter: NSMassFormatter = NSMassFormatter()
massFormatter.unitStyle = NSFormattingUnitStyle.Long
var weightFormatterUnit: NSMassFormatterUnit = NSMassFormatterUnit.Pound
self.weightUnitLabel!.text = massFormatter.unitStringFromValue(10, unit:weightFormatterUnit)
// Query to get the user's latest weight, if it exists.
var weightType: HKQuantityType = HKQuantityType.quantityTypeForIdentifier(HKQuantityTypeIdentifierBodyMass)
self.fetchMostRecentDataOfQuantityType(weightType, withCompletion: { (mostRecentQuantity: HKQuantity?, error: NSError?) -> () in
if ((error) != nil) {
NSLog("An error occured fetching the user's weight information. In your app, try to handle this gracefully. The error was: %@.", error!);
abort()
}
// Determine the weight in the required unit.
var usersWeight:Double = 0.0
if let somethingArse = mostRecentQuantity {
var weightUnit: HKUnit = HKUnit.poundUnit()
usersWeight = mostRecentQuantity!.doubleValueForUnit(weightUnit)
// Update the user interface.
dispatch_async(dispatch_get_main_queue(), {
self.weightValueTextField.text = NSNumberFormatter.localizedStringFromNumber(usersWeight, numberStyle:.NoStyle)
})
}
})
}
Again, we use NSMassFormatter for our style, its NSMassFormatterUnit for our unit, create the weight type identifier and pass it in to our fetch method along with a completion handler. If the completion handler returns error, we log it. Otherwise, we create a local variable to store the usersWeight, if let check mostRecentQuantity because its an optional and use it to assign its doubleValue using weightUnit to our local usersWeight variable. Finally we update the UI in the main queue as always.
Ok so let’s take a look at this magical method, fetch something or other:
func fetchMostRecentDataOfQuantityType(quantityType: HKQuantityType, withCompletion completion: ((mostRecentQuantity:HKQuantity?, error:NSError?) -> ())? ) {
let timeSortDescriptor = NSSortDescriptor(key: HKSampleSortIdentifierEndDate, ascending: false)
let query = HKSampleQuery(sampleType: quantityType, predicate: nil, limit: 1, sortDescriptors: [timeSortDescriptor]) { query, results, error in
if completion != nil && error != nil {
completion!(mostRecentQuantity: nil, error: error)
return;
}
let resultsArray = results as NSArray?
var quantitySample: HKQuantitySample? = resultsArray?.firstObject as HKQuantitySample?
var quantity: HKQuantity? = quantitySample?.quantity
if completion != nil {
completion!(mostRecentQuantity: quantity, error: error)
}
}
self.healthStore?.executeQuery(query)
}
Ok, not that complicated really. We create a NSSortDescriptor in order to arrange our results and be able to get the latest one. We create the HKQuery and pass it in the sampleType (height or weight, depending on what was passed into the fetch method), limit results to 1 and no predicate. We pass in the sort descriptor and another completion handler. Here are the cases tested next:
– If the HKQuery completion handler is NOT nil && the error is also NOT nil, then there is an error, so return the other completion handler with nil
– Otherwise, take the results AnyObject from the HKQuery and cast it as NSArray, get its firstObject as HKQuantitySample, get its quantity and set it to some local variable called quantity. Then again check if the original completion is NOT nil, then return the original completion handler with the quantity results. Finally execute the query!
Finally, you may have noticed the user can update their height and weight. And we adopted the UITextFieldDelegate protocol for that. So let’s:
func textFieldShouldReturn (textField: UITextField) -> (ObjCBool) {
textField.resignFirstResponder()
if textField == self.heightValueTextField {
self.saveHeightIntoHealthStore()
} else if textField == self.weightValueTextField {
self.saveWeightIntoHealthStore()
}
return true;
}
call save each time the user modifies their height or weight. And those methods are simply:
func saveHeightIntoHealthStore () -> () {
var formatter: NSNumberFormatter = self.numberFormatter()
var height: NSNumber?
if let somethingA = self.heightValueTextField!.text {
height = formatter.numberFromString(self.heightValueTextField!.text)
}
let cosa:NSNumber = 8
var otra = cosa.doubleValue
if height == height {
// Save the user's height into HealthKit.
var heightType: HKQuantityType = HKQuantityType.quantityTypeForIdentifier(HKQuantityTypeIdentifierHeight)
var heightQuantity: HKQuantity = HKQuantity(unit:HKUnit.inchUnit(), doubleValue: height!.doubleValue)
var heightSample: HKQuantitySample = HKQuantitySample(type: heightType, quantity:heightQuantity, startDate:NSDate(), endDate:NSDate())
self.healthStore?.saveObject(heightSample, withCompletion: { (success, error) in
if (!success) {
NSLog("An error occured saving the height sample %@. In your app, try to handle this gracefully. The error was: %@.", heightSample, error)
abort()
}
})
}
}
Format the value, carefully unwrap the textfield value, create a new height type identifier, height quantity and height sample and save it to the health store. Likewise for the weight:
func saveWeightIntoHealthStore () -> () {
var formatter: NSNumberFormatter = self.numberFormatter()
var weight: NSNumber?
if let somethingIsInsideOf = self.weightValueTextField!.text {
weight = formatter.numberFromString(self.weightValueTextField!.text)!
NSLog("The weight entered is not numeric. In your app, try to handle this gracefully.");
abort()
}
if weight == weight {
// Save the user's weight into HealthKit.
var weightType: HKQuantityType = HKQuantityType.quantityTypeForIdentifier(HKQuantityTypeIdentifierBodyMass)
var weightQuantity: HKQuantity = HKQuantity(unit: HKUnit.inchUnit(), doubleValue: weight!.doubleValue)
var weightSample: HKQuantitySample = HKQuantitySample(type:weightType, quantity:weightQuantity, startDate:NSDate(), endDate:NSDate())
self.healthStore?.saveObject(weightSample, withCompletion: { (success, error) in
if (!success) {
NSLog("An error occured saving the weight sample %@. In your app, try to handle this gracefully. The error was: %@.", weightSample, error)
abort()
}
})
}
}
And we need the number formatter method:
func numberFormatter ()->(NSNumberFormatter) {
var numberFormatter: NSNumberFormatter?
dispatch_once(&onceToken, {
numberFormatter = NSNumberFormatter()
})
return numberFormatter!
}
Since we use this onceToken, we need to define it globally at the top of the class by adding this line below the following imports:
import UIKit
import HealthKit
var onceToken: dispatch_once_t = 0
See you in Part 3!
HealthKit for iOS8: Part 1
HealthKit iOS8 by Santiapps.com
HealthKit iOS8
Intro: What it’s for?
HealthKit is a framework that allows you to store health data to a persistent store on the users device. We will begin with an app from Part 1 but we will take some detours that are important to understand so bare with me.
The first steps are:
– Create a tab bar application in Swift for iPhone Only
– Rename First and Second view controllers to Profile and Journal and make them UITableViewControllers
– In Capabilities turn on HealthKit
HealthKit, (HK), requires permissions to access the health store since most of this data is considered confidential. So to do this, move over to the AppDelegate.swift. Add this to appDidFinishLaunching method in AppDelegate:
if (HKHealthStore.isHealthDataAvailable() == true) {
self.healthStore = HKHealthStore() //needs to be var for it to work?
var writeDataTypes = self.dataTypesToWrite()
var readDataTypes = self.dataTypesToRead()
self.healthStore!.requestAuthorizationToShareTypes(writeDataTypes, readTypes: readDataTypes, completion: { (success, error) -> Void in
NSLog(“success \(error)”)
if (!success) {
NSLog(“You didn’t allow HealthKit to access these read/write data types. In your app, try to handle this error gracefully when a user decides not to provide access. The error was: %@. If you’re using a simulator, try it on a device.”, error)
//Present VC
return
} else {
NSLog(“success authorizing the healthstore!”)
NSLog(“writeDataTypes is%@”,writeDataTypes)
NSLog(“readDataTypes is%@”,readDataTypes)
}
// Handle success in your app here.
self.setupHealthStoreForTabBarControllers()
})
}
This requests permission from the user’s health store (on their device) in order to read and write personal data. The user will be prompted to authorize whatever data he or she feels comfortable with.
Those NSSets containing the user data to read and write are created like so:
func dataTypesToWrite () -> (NSSet) {
var dietaryCalorieEnergyType: HKQuantityType = HKQuantityType.quantityTypeForIdentifier(HKQuantityTypeIdentifierDietaryEnergyConsumed)
var activeEnergyBurnType: HKQuantityType = HKQuantityType.quantityTypeForIdentifier(HKQuantityTypeIdentifierActiveEnergyBurned)
var heightType: HKQuantityType = HKQuantityType.quantityTypeForIdentifier(HKQuantityTypeIdentifierHeight)
var weightType: HKQuantityType = HKQuantityType.quantityTypeForIdentifier(HKQuantityTypeIdentifierBodyMass)
var aSet: NSSet = NSSet(objects: dietaryCalorieEnergyType, activeEnergyBurnType, heightType, weightType)
return aSet
}
We do something a little different in the read types:
func dataTypesToRead () -> NSSet {
let values = [HKQuantityTypeIdentifierDietaryEnergyConsumed,
HKQuantityTypeIdentifierActiveEnergyBurned,
HKQuantityTypeIdentifierHeight,
HKQuantityTypeIdentifierBodyMass,
HKCharacteristicTypeIdentifierDateOfBirth,
HKCharacteristicTypeIdentifierBiologicalSex]
return values.reduce(NSMutableSet()) { (var theSet, let identifier) in
if identifier != nil {
if let something = HKCharacteristicType.characteristicTypeForIdentifier(identifier) {
theSet.addObject(something)
} else if let quantity = HKQuantityType.quantityTypeForIdentifier(identifier) {
theSet.addObject(quantity)
}
}
return theSet
}
}
And finally, since we are going to be using the health store to read and write from many view controllers so we need to propagate our central health store throughout those view controllers. So we need to use this method:
func setupHealthStoreForTabBarControllers () -> () {
var tabBarController = self.window!.rootViewController as UITabBarController
for navigationController: UINavigationController in tabBarController.viewControllers as Array {
var viewController = navigationController.topViewController
if viewController.isKindOfClass(ProfileViewController) {
var profileViewController: ProfileViewController = viewController as ProfileViewController
profileViewController.healthStore = self.healthStore!
} else if viewController.isKindOfClass(JournalViewController) {
var journalViewController: JournalViewController = viewController as JournalViewController
journalViewController.healthStore = self.healthStore!
} else if viewController.isKindOfClass(EnergyViewController) {
var energyViewController: EnergyViewController = viewController as EnergyViewController
energyViewController.healthStore = self.healthStore!
}
}
}
Now our app has access to our health store. So recapping what we’ve done in this intro part, we basically requested permission from the health store, specified the data types to read and write and finally propagated our fully authorized health store to our child view controllers.
This is what our storyboard will look like:
Storyboard for HealtKit App Santiapps.com
Storyboard for HealthKit App
Here we start out with a tab bar controller with 3 UITableViewControllers as children. The best way to do this is to drag UITableViewControllers from the Object Library in case you removed the original First and Second placeholder view controllers supplied by the template. But you could also just drag a tableview and a cell into each of those 2 supplied view controllers and drag an additional one into the storyboard, its up to you. Then select each of the 3, one by one, and in Editor -> Embed in Navigation Controller.
Here is the ProfileViewController:
HealthKit iOS8 App by Santiapps.com
HealthKit iOS8 App – Profile
As you can see, these are not prototype-dynamic cells but rather custom static cells. In this case we have given the UINavBar a title and we have divided up the tableview into 3 sections: one for the users age, another for the users height and the last one for the users weight. You can do this by setting the Sections property of the tableview in the Attributes Inspector, setting the style to Grouped and giving each section a name.
The Journal view controller is the only one that has prototype cells actually. It looks like this:
HealthKit App iOS8 by Santiapps.com
HealthKit App iOS8 – Journal
Here we will simply create a tableview with dynamically populated data from a hardcoded array. The type of cell is Detail Style and we add a button on the top right. The idea here is that the user can select items from a list that provide a certain number of calories or joules as input. Remember, this is the Energy Consumption tab where the user can specify his daily intake. So of course the “Add” button calls a view controller where the user can select from a list of items:
HealthKit app iOS8 by Santiapps.com
HealthKit app iOS8 – FoodPicker
Ok so this one also has dynamic cells, this is the tableview that will actually be filled with the hardcoded items. Once the user selects an item, it will be passed back to the Journal view controller. This is the FoodPicker view controller.
Finally here is the EnergyViewController which will basically unify all data:
HealthKit app iOS8 by Santiapps.com
HealthKit app iOS8
Wait! What do you mean all the data, so far we only have the profile data read from the health store and consumed data, what about the workout? Well that comes in the next view controller but for now, suffice it to say that this is a static table view cell with data fed in by:
Active Energy Burned = what you burn exercising
Resting Basal Burn = what you burn just breathing
Consumed Energy = what you ate
Net Energy = your final tally for the day
You input the Active Energy from the Workout view controller called when you tap the “Add” button in the Energy view controller which looks like this:
HealthKit app iOS8 by Santiapps.com
HealthKit app iOS8
Notice something important here, we are capturing workout specific data such as laps, time, meters and pace. This is not health data per se. And that is precisely what HealthStore was NOT made for. Its important to make this distinction because if you open your Health app you will not find laps, meters, km biked, tennis sets played. That is workout-specific data and the only specific data Health app records, is Steps, because its something the iPhone can record by itself. The Health app and the health store was conceived to record health data and it can’t very well cover all sport-specific needs. However all that workout-specific data, laps swam, km biked or sets played, translates, somehow, into calories burned. Now THAT is a point of convergence for all workouts and that is the kind of thing stored by the health store. Take a look at your Health app and you will see a Health Data icon which lets you see the kinds of data the app stores.
So why is this important, well, as you will see, we will be storing energy in and energy out. But we are still capturing laps and meters and time from the user and of course that IS important to the user. He or she will still want to see their progress in terms of laps and time. So we will need to incorporate CoreData in the end, in order to store that kind of data.
Ok in the next part (Part 2) we will look at the core of health data in iOS, HKObjects and how to use them!
|
{
"url": "http://santiapps.com/?m=201412",
"source_domain": "santiapps.com",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "129980",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VXLMPSLI5ZFLH7XDWQMFM2Z5QROWPA3U",
"WARC-Concurrent-To": "<urn:uuid:14401c24-37e1-4ca5-aee9-ca0ad889c4c7>",
"WARC-Date": "2019-01-20T10:48:34Z",
"WARC-IP-Address": "216.70.104.48",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ANH7DY4MBM32DXB6FJGXHGB2GZJLAOF3",
"WARC-Record-ID": "<urn:uuid:ed01cab9-d638-4b3f-b539-8905402532e8>",
"WARC-Target-URI": "http://santiapps.com/?m=201412",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5aff8616-5706-456b-9d2a-edd120545eb5>"
},
"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-138-249-133.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,
27,
28,
282,
283,
317,
318,
412,
413,
456,
485,
486,
801,
802,
843,
844,
859,
860,
871,
872,
883,
884,
915,
916,
1004,
1005,
1073,
1074,
1146,
1147,
1198,
1199,
1262,
1263,
1544,
1545,
1576,
1577,
1611,
1612,
1634,
1635,
1674,
1675,
1709,
1710,
1792,
1845,
1848,
1849,
2228,
2229,
2272,
2298,
2299,
2430,
2431,
2474,
2500,
2501,
2636,
2637,
2695,
2696,
2819,
2820,
2867,
2868,
2949,
2950,
3019,
3020,
3047,
3048,
3118,
3119,
3152,
3153,
3294,
3295,
3437,
3438,
3502,
3503,
3533,
3534,
3554,
3555,
3620,
3621,
3639,
3640,
3771,
3772,
3785,
3786,
3794,
3795,
3797,
3798,
3800,
3801,
3896,
4247,
4248,
4267,
4268,
4523,
4524,
4544,
4545,
4572,
4573,
4630,
4631,
4760,
4761,
4826,
4827,
4934,
4935,
4963,
4964,
5081,
5082,
5124,
5125,
5238,
5239,
5307,
5308,
5501,
5502,
5522,
5523,
5653,
5654,
5662,
5663,
5665,
5666,
5686,
5687,
5711,
5712,
5714,
5715,
5757,
5758,
5817,
5818,
5820,
5821,
5838,
5839,
6452,
6453,
6789,
6790,
6826,
6845,
6846,
7161,
7162,
7275,
7276,
7350,
7392,
7429,
7478,
7518,
7567,
7607,
7639,
7641,
7642,
7805,
7806,
7941,
7942,
7959,
7960,
8047,
8048,
8095,
8172,
8194,
8219,
8244,
8246,
8247,
8560,
8561,
8592,
8593,
8613,
8614,
8679,
8680,
8698,
8699,
8830,
8831,
8839,
8840,
8842,
8843,
8867,
8868,
8904,
8905,
8907,
8908,
8932,
8933,
8971,
8972,
9012,
9013,
9071,
9072,
9074,
9075,
9107,
9108,
9135,
9136,
9193,
9194,
9253,
9254,
9278,
9279,
9292,
9293,
9306,
9307,
9346,
9347,
9476,
9477,
9523,
9524,
9566,
9567,
9569,
9570,
9572,
9573,
10235,
10236,
10304,
10305,
10339,
10340,
10387,
10388,
10449,
10450,
10505,
10506,
10582,
10583,
10678,
10679,
10785,
10786,
10913,
10914,
10926,
10927,
10954,
10955,
11095,
11096,
11104,
11105,
11107,
11108,
11153,
11154,
11184,
11185,
11229,
11230,
11273,
11274,
11339,
11340,
11370,
11371,
11415,
11416,
11528,
11529,
11532,
11533,
11535,
11536,
11539,
11540,
11542,
11543,
12384,
12385,
12445,
12446,
12479,
12480,
12531,
12532,
12587,
12588,
12641,
12642,
12715,
12716,
12809,
12810,
12866,
12867,
12975,
12976,
13105,
13106,
13128,
13129,
13267,
13268,
13276,
13277,
13279,
13280,
13326,
13327,
13356,
13357,
13401,
13402,
13446,
13447,
13512,
13513,
13543,
13544,
13588,
13589,
13701,
13702,
13705,
13706,
13708,
13709,
13712,
13713,
13715,
13716,
14219,
14220,
14294,
14295,
14453,
14454,
14550,
14551,
14695,
14696,
14735,
14736,
14787,
14788,
14796,
14797,
14799,
14800,
14839,
14840,
14927,
14928,
14981,
14982,
15005,
15006,
15062,
15063,
15065,
15066,
15068,
15069,
15107,
15108,
15110,
15111,
15500,
15501,
15650,
15651,
15997,
15998,
16143,
16144,
16212,
16213,
16246,
16247,
16291,
16292,
16325,
16326,
16377,
16378,
16411,
16412,
16414,
16415,
16428,
16429,
16431,
16432,
16525,
16526,
16568,
16569,
16627,
16628,
16650,
16651,
16705,
16706,
16775,
16776,
16778,
16779,
16801,
16802,
16830,
16831,
16853,
16854,
16896,
16897,
17003,
17004,
17106,
17107,
17242,
17243,
17324,
17325,
17341,
17342,
17481,
17482,
17490,
17491,
17493,
17494,
17497,
17498,
17500,
17501,
17503,
17504,
17690,
17691,
17733,
17734,
17792,
17793,
17815,
17816,
17879,
17880,
17950,
17951,
18040,
18041,
18049,
18050,
18052,
18053,
18075,
18076,
18118,
18119,
18227,
18228,
18331,
18332,
18467,
18468,
18549,
18550,
18566,
18567,
18706,
18707,
18715,
18716,
18718,
18719,
18722,
18723,
18725,
18726,
18728,
18729,
18770,
18771,
18818,
18819,
18859,
18860,
18888,
18889,
18927,
18928,
18931,
18932,
18956,
18957,
18959,
18960,
19092,
19093,
19106,
19123,
19158,
19159,
19178,
19179,
19206,
19207,
19239,
19254,
19255,
19279,
19280,
19504,
19505,
19526,
19527,
19583,
19584,
19687,
19688,
19724,
19725,
19952,
19953,
20006,
20007,
20076,
20077,
20122,
20123,
20166,
20167,
20302,
20303,
20329,
20330,
20346,
20347,
20589,
20590,
20603,
20604,
20611,
20612,
20621,
20622,
20668,
20669,
20713,
20714,
20756,
20757,
20759,
20760,
20796,
20797,
20841,
20842,
20845,
20846,
20848,
20849,
21051,
21052,
21129,
21130,
21168,
21169,
21304,
21305,
21433,
21434,
21540,
21541,
21649,
21650,
21755,
21756,
21768,
21769,
21771,
21772,
21826,
21827,
21862,
21863,
21924,
21925,
21969,
21970,
22002,
22003,
22037,
22038,
22081,
22082,
22127,
22128,
22199,
22200,
22223,
22224,
22310,
22311,
22339,
22340,
22420,
22421,
22448,
22449,
22451,
22452,
22454,
22455,
22469,
22470,
22472,
22473,
22475,
22476,
22698,
22699,
22752,
22753,
22830,
22831,
22927,
22928,
22988,
22989,
23046,
23047,
23138,
23139,
23193,
23194,
23258,
23259,
23350,
23351,
23405,
23406,
23469,
23470,
23558,
23559,
23612,
23613,
23615,
23616,
23618,
23619,
23621,
23622,
23904,
23905,
23949,
23950,
23992,
24021,
24022,
24024,
24025,
24552,
24553,
24588,
24589,
24625,
24654,
24655,
25092,
25093,
25193,
25194,
25230,
25259,
25260,
25262,
25263,
25747,
25748,
25784,
25816,
25817,
25819,
25820,
26064,
26065,
26143,
26144,
26180,
26199,
26200,
26480,
26528,
26529,
26579,
26580,
26611,
26612,
26654,
26655,
26657,
26658,
26809,
26810,
26846,
26865,
26866,
26868,
26869,
27830,
27831,
28203,
28204,
28312,
28313
],
"line_end_idx": [
27,
28,
282,
283,
317,
318,
412,
413,
456,
485,
486,
801,
802,
843,
844,
859,
860,
871,
872,
883,
884,
915,
916,
1004,
1005,
1073,
1074,
1146,
1147,
1198,
1199,
1262,
1263,
1544,
1545,
1576,
1577,
1611,
1612,
1634,
1635,
1674,
1675,
1709,
1710,
1792,
1845,
1848,
1849,
2228,
2229,
2272,
2298,
2299,
2430,
2431,
2474,
2500,
2501,
2636,
2637,
2695,
2696,
2819,
2820,
2867,
2868,
2949,
2950,
3019,
3020,
3047,
3048,
3118,
3119,
3152,
3153,
3294,
3295,
3437,
3438,
3502,
3503,
3533,
3534,
3554,
3555,
3620,
3621,
3639,
3640,
3771,
3772,
3785,
3786,
3794,
3795,
3797,
3798,
3800,
3801,
3896,
4247,
4248,
4267,
4268,
4523,
4524,
4544,
4545,
4572,
4573,
4630,
4631,
4760,
4761,
4826,
4827,
4934,
4935,
4963,
4964,
5081,
5082,
5124,
5125,
5238,
5239,
5307,
5308,
5501,
5502,
5522,
5523,
5653,
5654,
5662,
5663,
5665,
5666,
5686,
5687,
5711,
5712,
5714,
5715,
5757,
5758,
5817,
5818,
5820,
5821,
5838,
5839,
6452,
6453,
6789,
6790,
6826,
6845,
6846,
7161,
7162,
7275,
7276,
7350,
7392,
7429,
7478,
7518,
7567,
7607,
7639,
7641,
7642,
7805,
7806,
7941,
7942,
7959,
7960,
8047,
8048,
8095,
8172,
8194,
8219,
8244,
8246,
8247,
8560,
8561,
8592,
8593,
8613,
8614,
8679,
8680,
8698,
8699,
8830,
8831,
8839,
8840,
8842,
8843,
8867,
8868,
8904,
8905,
8907,
8908,
8932,
8933,
8971,
8972,
9012,
9013,
9071,
9072,
9074,
9075,
9107,
9108,
9135,
9136,
9193,
9194,
9253,
9254,
9278,
9279,
9292,
9293,
9306,
9307,
9346,
9347,
9476,
9477,
9523,
9524,
9566,
9567,
9569,
9570,
9572,
9573,
10235,
10236,
10304,
10305,
10339,
10340,
10387,
10388,
10449,
10450,
10505,
10506,
10582,
10583,
10678,
10679,
10785,
10786,
10913,
10914,
10926,
10927,
10954,
10955,
11095,
11096,
11104,
11105,
11107,
11108,
11153,
11154,
11184,
11185,
11229,
11230,
11273,
11274,
11339,
11340,
11370,
11371,
11415,
11416,
11528,
11529,
11532,
11533,
11535,
11536,
11539,
11540,
11542,
11543,
12384,
12385,
12445,
12446,
12479,
12480,
12531,
12532,
12587,
12588,
12641,
12642,
12715,
12716,
12809,
12810,
12866,
12867,
12975,
12976,
13105,
13106,
13128,
13129,
13267,
13268,
13276,
13277,
13279,
13280,
13326,
13327,
13356,
13357,
13401,
13402,
13446,
13447,
13512,
13513,
13543,
13544,
13588,
13589,
13701,
13702,
13705,
13706,
13708,
13709,
13712,
13713,
13715,
13716,
14219,
14220,
14294,
14295,
14453,
14454,
14550,
14551,
14695,
14696,
14735,
14736,
14787,
14788,
14796,
14797,
14799,
14800,
14839,
14840,
14927,
14928,
14981,
14982,
15005,
15006,
15062,
15063,
15065,
15066,
15068,
15069,
15107,
15108,
15110,
15111,
15500,
15501,
15650,
15651,
15997,
15998,
16143,
16144,
16212,
16213,
16246,
16247,
16291,
16292,
16325,
16326,
16377,
16378,
16411,
16412,
16414,
16415,
16428,
16429,
16431,
16432,
16525,
16526,
16568,
16569,
16627,
16628,
16650,
16651,
16705,
16706,
16775,
16776,
16778,
16779,
16801,
16802,
16830,
16831,
16853,
16854,
16896,
16897,
17003,
17004,
17106,
17107,
17242,
17243,
17324,
17325,
17341,
17342,
17481,
17482,
17490,
17491,
17493,
17494,
17497,
17498,
17500,
17501,
17503,
17504,
17690,
17691,
17733,
17734,
17792,
17793,
17815,
17816,
17879,
17880,
17950,
17951,
18040,
18041,
18049,
18050,
18052,
18053,
18075,
18076,
18118,
18119,
18227,
18228,
18331,
18332,
18467,
18468,
18549,
18550,
18566,
18567,
18706,
18707,
18715,
18716,
18718,
18719,
18722,
18723,
18725,
18726,
18728,
18729,
18770,
18771,
18818,
18819,
18859,
18860,
18888,
18889,
18927,
18928,
18931,
18932,
18956,
18957,
18959,
18960,
19092,
19093,
19106,
19123,
19158,
19159,
19178,
19179,
19206,
19207,
19239,
19254,
19255,
19279,
19280,
19504,
19505,
19526,
19527,
19583,
19584,
19687,
19688,
19724,
19725,
19952,
19953,
20006,
20007,
20076,
20077,
20122,
20123,
20166,
20167,
20302,
20303,
20329,
20330,
20346,
20347,
20589,
20590,
20603,
20604,
20611,
20612,
20621,
20622,
20668,
20669,
20713,
20714,
20756,
20757,
20759,
20760,
20796,
20797,
20841,
20842,
20845,
20846,
20848,
20849,
21051,
21052,
21129,
21130,
21168,
21169,
21304,
21305,
21433,
21434,
21540,
21541,
21649,
21650,
21755,
21756,
21768,
21769,
21771,
21772,
21826,
21827,
21862,
21863,
21924,
21925,
21969,
21970,
22002,
22003,
22037,
22038,
22081,
22082,
22127,
22128,
22199,
22200,
22223,
22224,
22310,
22311,
22339,
22340,
22420,
22421,
22448,
22449,
22451,
22452,
22454,
22455,
22469,
22470,
22472,
22473,
22475,
22476,
22698,
22699,
22752,
22753,
22830,
22831,
22927,
22928,
22988,
22989,
23046,
23047,
23138,
23139,
23193,
23194,
23258,
23259,
23350,
23351,
23405,
23406,
23469,
23470,
23558,
23559,
23612,
23613,
23615,
23616,
23618,
23619,
23621,
23622,
23904,
23905,
23949,
23950,
23992,
24021,
24022,
24024,
24025,
24552,
24553,
24588,
24589,
24625,
24654,
24655,
25092,
25093,
25193,
25194,
25230,
25259,
25260,
25262,
25263,
25747,
25748,
25784,
25816,
25817,
25819,
25820,
26064,
26065,
26143,
26144,
26180,
26199,
26200,
26480,
26528,
26529,
26579,
26580,
26611,
26612,
26654,
26655,
26657,
26658,
26809,
26810,
26846,
26865,
26866,
26868,
26869,
27830,
27831,
28203,
28204,
28312,
28313,
28314
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 28314,
"ccnet_original_nlines": 742,
"rps_doc_curly_bracket": 0.0040262797847390175,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31326451897621155,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01242354977875948,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25592508912086487,
"rps_doc_frac_unique_words": 0.24437740445137024,
"rps_doc_mean_word_length": 6.134668350219727,
"rps_doc_num_sentences": 365,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.806270599365234,
"rps_doc_word_count": 3646,
"rps_doc_frac_chars_dupe_10grams": 0.04716769978404045,
"rps_doc_frac_chars_dupe_5grams": 0.10412661731243134,
"rps_doc_frac_chars_dupe_6grams": 0.06920909881591797,
"rps_doc_frac_chars_dupe_7grams": 0.06227925047278404,
"rps_doc_frac_chars_dupe_8grams": 0.058613140136003494,
"rps_doc_frac_chars_dupe_9grams": 0.04931372031569481,
"rps_doc_frac_chars_top_2gram": 0.010327709838747978,
"rps_doc_frac_chars_top_3gram": 0.009388829581439495,
"rps_doc_frac_chars_top_4gram": 0.00482854014262557,
"rps_doc_books_importance": -2623.09814453125,
"rps_doc_books_importance_length_correction": -2623.09814453125,
"rps_doc_openwebtext_importance": -1426.80712890625,
"rps_doc_openwebtext_importance_length_correction": -1426.80712890625,
"rps_doc_wikipedia_importance": -987.2119750976562,
"rps_doc_wikipedia_importance_length_correction": -987.2119750976562
},
"fasttext": {
"dclm": 0.4805389642715454,
"english": 0.7218221426010132,
"fineweb_edu_approx": 2.4797089099884033,
"eai_general_math": 0.4532802700996399,
"eai_open_web_math": 0.1066785529255867,
"eai_web_code": 0.863431990146637
}
}
|
{
"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": "610",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "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
|
15,242,157,824,026,862 |
VGMaps
General Boards => Mapping Tips/Guides => Topic started by: Zerker on November 14, 2012, 06:13:37 PM
Title: PC Game Hacking and Mapping Tutorial: Xargon
Post by: Zerker on November 14, 2012, 06:13:37 PM
After finishing ROTT and the Shadow Caster maps, I decided to tackle something much simpler, but also to document the process as I go along. That game is Xargon, which can be obtained at Classic Dos Games (http://www.classicdosgames.com/game/Xargon.html). According to that site, Allen Pilgrim released the full version available as freeware with a very short license, so we will be able to map all three episodes. However, since I already have it on my computer, I will start with Episode 1. Note that the Source Code is released, so that is an option if I get stuck. However, to hopefuly make this tutorial more useful (and fun), I'm planning to do this as a black-box exercise. Obviously, if the game has a source code release, or is well documented, that can help reduce the guesswork.
As with Shadow Caster and ROTT, I will be using Python (http://www.python.org/) and the Python Imaging Library (PIL) (http://www.pythonware.com/index.htm). I will also need a Hex editor to look through the game resources before digging in, so Bless (http://home.gna.org/bless/) is my editor of choice. Windows users will obviously need something else.
Generally speaking, creating a map via hacking is composed of three phases:
Phase 1: Figure out the map format
Phase 2: Figure out the image data format(s)
Phase 3: Put it all together and make the map (this the real meat of it)
Phases 1 and 2 can be done in either order, but I will start in the order above.
So, the map format. Xargon is split into a number of different files, and I'm going to take a wild guess that the BOARD_##.XR1 files are the maps. Let's look at one in a hex editor:
(http://www.zerker.ca/misc/xargon/day1_1.png)
The first thing to notice is there's definately a repeating pattern. The second thing is that it looks like a 16 bit pattern. This can mean either 2 individual bytes per location, or a single 16 bit number per location. Either way, we know the size of a location, but not the dimensions of the map. We also know that there is no header, because the pattern starts immediately at the top of the file. Given the nature of the game, we will start with the assumption that the game map is simply a direct listing of tiles without any grouping, compression or other tricks. So, let's take the file size and figure out how many tiles we have total:
19255 bytes / 2 = 9627.5. This already tells us that we must have some sort of footer that isn't part of the map data. Scrolling down to the bottom of the file confirms this, as the map ends in the string "TOO LATE TO TURN BACK!". However, the footer is unlikely to be a huge portion of the file, so let's ignore it for now. Taking the square root of the file size gives us the dimensions if the game used square levels: 98.11. This gives us an order-of-magnitude to guess for. I know that the maps aren't square, but let's run with this and see where it gets us.
The next step is to visualize the map to see if we guessed correctly. 8-bit numbers are easiest, as we can go direct to grayscale. 16 bit numbers present us with two options: if we think the numbers present different information, we can try two parallel grayscale images. If we think it's just one 16 bit tile number, we should just pick two out of the three RGB channels and generate a colour image. I'm going with the latter option initially. I'm also going to cheat a little bit and copy some boilerplate code from my other scripts as far as grabbing the input file and checking for # of input parameters. Here's the basic visualizer script:
Code: [Select]
import struct, sys
from PIL import Image
if __name__ == "__main__":
if len(sys.argv) < 2:
print """Usage: python xargonmap.py [Map File]
TODO
"""
else:
for filename in sys.argv[1:]:
mapfile = open(filename, 'rb')
outname = filename + '.png'
# Load the map data as a 98 x 98 array of 2-byte positions:
# This will be switched to proper 16 bit numbers when we
# actually want to start generating the tile map.
# struct
pattern = '<{}B'.format(98*98*2)
mapdata = struct.unpack(pattern,
mapfile.read(struct.calcsize(pattern)) )
mapfile.close()
# Turn the map data into a list of 3-byte tuples to visualize it.
# Start by pre-creating an empty list of zeroes then copy it in
visualdata = [None] * (98*98)
for index in range(98*98):
visualdata[index] = (mapdata[index * 2], mapdata[index * 2 + 1], 0)
# Tell PIL to interpret the map data as a RAW image:
mapimage = Image.new("RGB", (98, 98) )
mapimage.putdata(visualdata)
mapimage.save(outname)
'<{}B' means a little endian pattern of {} bytes, where the actual number is filled in by the format call. Refer to the Python Struct module documention (http://docs.python.org/2/library/struct.html) for more information on these strings.
So we run it and get:
(http://www.zerker.ca/misc/xargon/day1_2.png)
That's cute. Obviously wrong too, but there's a clear pattern shift to the image. We should be able to figure out exactly how far we are off on each row. Opening in GIMP and counting the pixel shift shows that we appear to repeat every 64 pixels. Taking our original dimensions, and using 64 as one dimension yields 9627.5/64 = 150.4 for the other. Some of that is going to be footer, but we should be able to clearly see the breakdown when we finish. Our adjusted script becomes:
Code: [Select]
import struct, sys
from PIL import Image
if __name__ == "__main__":
if len(sys.argv) < 2:
print """Usage: python xargonmap.py [Map File]
TODO
"""
else:
for filename in sys.argv[1:]:
mapfile = open(filename, 'rb')
outname = filename + '.png'
# Load the map data as a 98 x 98 array of 2-byte positions:
# This will be switched to proper 16 bit numbers when we
# actually want to start generating the tile map.
# struct
pattern = '<{}B'.format(64*150*2)
mapdata = struct.unpack(pattern,
mapfile.read(struct.calcsize(pattern)) )
mapfile.close()
# Turn the map data into a list of 3-byte tuples to visualize it.
# Start by pre-creating an empty list of zeroes then copy it in
visualdata = [None] * (64*150)
for index in range(64*150):
visualdata[index] = (mapdata[index * 2], mapdata[index * 2 + 1], 0)
# Tell PIL to interpret the map data as a RAW image:
mapimage = Image.new("RGB", (64, 150) )
mapimage.putdata(visualdata)
mapimage.save(outname)
Yeilding:
(http://www.zerker.ca/misc/xargon/day1_3.png)
That looks WAY better. But it looks sideways. And we can clearly see the garbage at the bottom is the footer and is not tile data (we'll have to figure it out later; I suspect it is item/monster placement). Opening in GIMP again shows that the map is only 128 pixels tall, so let's fix that dimension. Let's also rotate it -90 degrees.
Code: [Select]
import struct, sys
from PIL import Image
if __name__ == "__main__":
if len(sys.argv) < 2:
print """Usage: python xargonmap.py [Map File]
TODO
"""
else:
for filename in sys.argv[1:]:
mapfile = open(filename, 'rb')
outname = filename + '.png'
# Load the map data as a 98 x 98 array of 2-byte positions:
# This will be switched to proper 16 bit numbers when we
# actually want to start generating the tile map.
# struct
pattern = '<{}B'.format(64*128*2)
mapdata = struct.unpack(pattern,
mapfile.read(struct.calcsize(pattern)) )
mapfile.close()
# Turn the map data into a list of 3-byte tuples to visualize it.
# Start by pre-creating an empty list of zeroes then copy it in
visualdata = [None] * (64*128)
for index in range(64*128):
visualdata[index] = (mapdata[index * 2], mapdata[index * 2 + 1], 0)
# Tell PIL to interpret the map data as a RAW image:
mapimage = Image.new("RGB", (64, 128) )
mapimage.putdata(visualdata)
mapimage.rotate(-90).save(outname)
And the final result (for today) is:
(http://www.zerker.ca/misc/xargon/day1_4.png)
Title: Day 2
Post by: Zerker on November 15, 2012, 06:09:45 PM
Yesterday we got the map format decoded. While I can visualize more of the maps the same way, let's go ahead and try to figure out the tile format. Now, Xargon is a 256 colour VGA game, so we're going to need a colour palette. We also need to know what dimension of tile we are looking for. Both of these goals can be accompished by taking a simple screenshot (via Dosbox for me):
(http://www.zerker.ca/misc/xargon/day2_1.png)
Looks like 16 x 16 tiles to me. Looking through the Xargon directory, GRAPHICS.XR1 is the most likely candidate for containing tile information. With the lack of a better idea, I'm going to just assume it contains a whole bunch of RAW 16 x 16 images in order. With a filesize of 697555, and each tile taking up 16*16 = 256 bytes, that is about 2724.8 tiles. Let's cook up a quick looping RAW image importer with PIL and see what we get:
Code: [Select]
import struct, sys, os
from PIL import Image
if __name__ == "__main__":
if len(sys.argv) < 2:
print """Usage: python xargongraphics.py [Graphics File]
TODO
"""
else:
for filename in sys.argv[1:]:
filesize = os.path.getsize(filename)
graphicsfile = open(filename, 'rb')
# Use the screenshot to grab the proper colour palette:
palimage = Image.open('screeny.png')
palette = palimage.getpalette()
for tilenum in range(filesize/(16*16)):
tile = Image.fromstring("P", (16, 16),
graphicsfile.read(16*16))
tile.putpalette(palette)
tile.save(os.path.join('output', '{:04}.png'.format(tilenum)) )
# Since the file does not evenly align with the tiles we are
# attempting to read, explicitly re-read the very end of the
# file as a tile.
graphicsfile.seek(filesize - (16*16) )
tile = Image.fromstring("P", (16, 16),
graphicsfile.read(16*16))
tile.putpalette(palette)
tile.save(os.path.join('output', 'last.png') )
And the results are:
(http://www.zerker.ca/misc/xargon/day2_2.png)
Not a horrible assumption. There are some properly decoded (be it shifted) tiles among there. But there are also some images that look misaligned (i.e. not 16 x 16), and some random pixels (which imply headers). There's also a repeating pattern at the top of the file with random pixels that may be an overall file header (i.e. Images 0000 and 0002). Zooming the image shows that each record appears to be 4 bytes in length.
Scrolling through each of these 4-byte regions and looking at the decoding panel in my hex editor, each region appears to be a simple 32-bit integer, and each number is larger than the previous. (example below)
(http://www.zerker.ca/misc/xargon/day2_3.png)
Let's decode those numbers. I locally commented out the image code and am excluding it from below for brevity. Counting the bytes in the Hex editor, it appears to end at offset 0xF8 for a total of 62 records. Also note that pdb.set_trace() in the below example invokes the python debugger where we can inspect data interactively. This also saves me the trouble writing a print statement for debug data.
Code: [Select]
import struct, sys, os, pdb
from PIL import Image
if __name__ == "__main__":
if len(sys.argv) < 2:
print """Usage: python xargongraphics.py [Graphics File]
TODO
"""
else:
for filename in sys.argv[1:]:
filesize = os.path.getsize(filename)
graphicsfile = open(filename, 'rb')
header = '<62L'
headerdata = struct.unpack(header,
graphicsfile.read(struct.calcsize(header)) )
pdb.set_trace()
Running that gives us the the python debugger prompt:
Code: [Select]
zerker@Iota:/data/GameFiles/Dos/dosroot/Xargon$ python xargongraphics.py GRAPHICS.XR1
> /data/GameFiles/Dos/dosroot/Xargon/xargongraphics.py(28)<module>()
-> for filename in sys.argv[1:]:
(Pdb) headerdata
At which we can simply type the name of the variable we want to inspect to see its content:
Code: [Select]
(Pdb) headerdata
(0, 768, 9359, 14366, 15087, 21646, 22560, 54601, 61481, 68227, 74973, 87197, 94720, 98099, 101737, 124062, 131326, 140144, 148185, 155708, 160382, 163761, 171284, 178030, 197467, 204731, 214326, 235317, 253718, 262277, 266692, 296888, 305411, 309719, 321156, 325931, 343340, 353794, 363293, 374943, 395189, 407614, 0, 415826, 433431, 439659, 0, 451922, 473916, 0, 481227, 485490, 488542, 491213, 554159, 563460, 566188, 597635, 629082, 650040, 662219, 664428)
Keep in mind the file size of this graphics file is 697555. The last number is close, but does not exceed this number. This implies to me that these are all file offsets, probably delimiting the start of a region of data in the file. Since image 0002 also looks like header data, let's look at that too:
(http://www.zerker.ca/misc/xargon/day2_4.png)
Well, it's smaller. Suspiciously looks like half as small, in fact. Let's grab that too and decode it as a series of 16 bit integers.
Code: [Select]
import struct, sys, os, pdb
from PIL import Image
if __name__ == "__main__":
if len(sys.argv) < 2:
print """Usage: python xargongraphics.py [Graphics File]
TODO
"""
else:
for filename in sys.argv[1:]:
filesize = os.path.getsize(filename)
graphicsfile = open(filename, 'rb')
header = '<62L'
headerdata = struct.unpack(header,
graphicsfile.read(struct.calcsize(header)) )
graphicsfile.seek(0x200)
header2 = '<62H'
headerdata2 = struct.unpack(header2,
graphicsfile.read(struct.calcsize(header2)) )
pdb.set_trace()
And compare the two headers:
Code: [Select]
(Pdb) headerdata
(0, 768, 9359, 14366, 15087, 21646, 22560, 54601, 61481, 68227, 74973, 87197, 94720, 98099, 101737, 124062, 131326, 140144, 148185, 155708, 160382, 163761, 171284, 178030, 197467, 204731, 214326, 235317, 253718, 262277, 266692, 296888, 305411, 309719, 321156, 325931, 343340, 353794, 363293, 374943, 395189, 407614, 0, 415826, 433431, 439659, 0, 451922, 473916, 0, 481227, 485490, 488542, 491213, 554159, 563460, 566188, 597635, 629082, 650040, 662219, 664428)
(Pdb) headerdata2
(0, 8591, 5007, 721, 6559, 914, 32041, 6880, 6746, 6746, 12224, 7523, 3379, 3638, 22325, 7264, 8818, 8041, 7523, 4674, 3379, 7523, 6746, 19437, 7264, 9595, 20991, 18401, 8559, 4415, 30196, 8523, 4308, 11437, 4775, 17409, 10454, 9499, 11650, 20246, 12425, 8212, 0, 17605, 6228, 12263, 0, 21994, 7311, 0, 4263, 3052, 2671, 62946, 9301, 2728, 31447, 31447, 20958, 12179, 2209, 25423)
Interesting. Record sizes maybe? Let's compare differences between offsets for a few adjacent regions to the second set of data to test this theory:
Code: [Select]
(Pdb) headerdata[2]-headerdata[1]
8591
(Pdb) headerdata[3]-headerdata[2]
5007
(Pdb) headerdata[4]-headerdata[3]
721
Perfect match. I'm convinced. Now, going by the debug images I already generated, the first region appears to be a whole lot of blue and will be difficult to determine on its own. Let's start with the second region, at offset 9359 (0x248F hex). Since each picture is 256 bytes (0x100 hex), that puts towards the end of picture 0x24 (36 decimal). Hrm, still too much blue. Let's jump ahead until we get to the images. The next is 14366 -> image 56, which is still blue, but the following is 15087 -> 58 which starts to look like something. It also puts is one pixel before the last row of the image, which looks like another header. Since we're offset by 1, and the next image matches the last pixel in this image, I suspect the header is 16 bytes. I'll just copy the bytes from the hex editor:
24 01 00 D0 06 10 0D 90 19 08 04 00 08 10 00 10
Now we need to guess the bit size of each field in this header. Remember that we are little endian. The first four bytes are:
24 01 00 D0
If we think this is 32 bits, that's either -805306076 (signed) or 3489661220 (unsigned), or -8.590234E+09 (floating). None of those are particularly likely (and floats aren't very common for old DOS games in general).
16 bits yields 292, while 8 bits yield 36. Both are possible.
If we go with 36, 01 is unused, and is obviously just a simple 1. Let's convert the whole sequence to simple 8 bit decimal numbers and see if it makes sense:
36 1 0 208 6 16 13 144 25 8 4 0 8 16 0 16
And as 16 bits (unsigned):
292 53248 4102 36877 2073 4 4104 4096
I think it's likely we have either an 8 bit sequence or some sort of hybrid.
I'm scratching my head, so let's get another sample. The next few sample images look like noise, so they may be some other form of data, or just unrecognizably misaligned. Let's jump ahead to the really recognizable tiles around image 293. 293 is offset 75008, and from above, the closest record starts at 74973 (image 292, pixel 221). Looks like another 16 byte header to me. Hex values are:
2F 01 00 7C 0C 3C 18 BC 2F 08 04 00 10 10 00 0F
Decimal:
47 1 0 124 12 60 24 188 47 8 4 0 16 16 0 15
Gah, let's just grab them all and decode this way, then turn it into a CSV.
Code: [Select]
import struct, sys, os, pdb, csv
from PIL import Image
def imageheader(fileref, offset):
fileref.seek(offset)
headerstruct = '<16B'
return struct.unpack(headerstruct,
fileref.read(struct.calcsize(headerstruct)) )
if __name__ == "__main__":
if len(sys.argv) < 2:
print """Usage: python xargongraphics.py [Graphics File]
TODO
"""
else:
for filename in sys.argv[1:]:
filesize = os.path.getsize(filename)
graphicsfile = open(filename, 'rb')
header = '<62L'
headerdata = struct.unpack(header,
graphicsfile.read(struct.calcsize(header)) )
graphicsfile.seek(0x200)
header2 = '<62H'
headerdata2 = struct.unpack(header2,
graphicsfile.read(struct.calcsize(header2)) )
# Create the header records using list comprehension
imageheaders = [imageheader(graphicsfile, offset) for offset in headerdata if offset > 0]
# Save as a CSV
with open('debug.csv', 'wb') as csvfile:
writer = csv.writer(csvfile)
writer.writerows(imageheaders)
[code]
128 1 0 0 10 0 18 0 34 2 1 0 8 8 0 1
128 1 0 0 8 0 14 0 26 2 1 0 6 6 0 1
10 1 0 200 0 104 1 168 2 2 1 0 8 8 0 3
36 1 0 208 6 16 13 144 25 8 4 0 8 16 0 16
1 1 0 196 0 132 1 4 3 8 4 0 64 12 0 0
38 1 0 186 31 224 62 32 125 8 0 0 24 40 0 0
27 1 0 28 6 204 11 44 23 8 4 0 8 16 0 120
25 1 0 164 6 228 12 100 25 8 4 0 16 16 0 176
25 1 0 164 6 228 12 100 25 8 4 0 16 16 0 16
47 1 0 124 12 60 24 188 47 8 4 0 16 16 0 15
28 1 0 112 7 112 14 112 28 8 4 0 16 16 0 16
12 1 0 48 3 48 6 48 12 8 4 0 16 16 0 16
13 1 0 116 3 180 6 52 13 8 4 0 16 16 0 250
86 1 0 216 22 88 44 88 87 8 4 0 16 16 0 250
27 1 0 44 7 236 13 108 27 8 4 0 16 16 0 136
33 1 0 196 8 4 17 132 33 8 4 0 16 16 0 16
30 1 0 248 7 120 15 120 30 8 4 0 16 16 0 250
28 1 0 112 7 112 14 112 28 8 4 0 16 16 0 109
17 1 0 132 4 196 8 68 17 8 4 0 16 16 0 25
12 1 0 48 3 48 6 48 12 8 4 0 16 16 0 23
28 1 0 112 7 112 14 112 28 8 4 0 16 16 0 17
25 1 0 164 6 228 12 100 25 8 4 0 16 16 0 34
74 1 0 168 19 40 38 40 75 8 4 0 16 16 0 247
27 1 0 44 7 236 13 108 27 8 4 0 16 16 0 195
36 1 0 144 9 144 18 144 36 8 4 0 16 16 0 250
80 1 0 64 21 64 41 64 81 8 4 0 16 16 0 19
70 1 0 152 18 24 36 24 71 8 4 0 16 16 0 157
32 1 0 128 8 128 16 128 32 8 4 0 16 16 0 23
16 1 0 64 4 64 8 64 16 8 4 0 16 16 0 250
77 1 0 221 30 28 62 216 119 8 0 0 32 28 0 64
36 1 0 80 8 16 21 144 31 8 0 0 12 20 0 0
7 1 0 12 4 252 7 220 15 8 0 0 24 24 0 0
12 1 0 24 11 20 22 208 43 8 0 0 32 28 0 64
8 1 0 224 3 160 7 32 15 8 0 0 32 15 0 21
18 1 0 220 17 112 35 152 70 8 0 0 38 25 0 0
37 1 0 90 10 116 20 172 39 8 0 0 32 16 0 0
36 1 0 56 9 80 18 48 35 8 0 0 16 16 0 0
7 1 0 64 11 0 24 172 44 8 0 0 60 68 0 0
27 1 0 129 20 68 45 192 80 8 0 0 36 22 0 0
30 1 0 195 12 44 25 164 49 8 0 0 30 30 0 0
31 1 0 60 8 252 15 124 31 8 4 0 16 16 0 18
18 1 0 40 17 8 34 200 67 8 0 0 40 24 0 0
23 1 0 28 6 220 11 92 23 8 4 0 16 16 0 120
8 1 0 128 12 160 27 160 49 8 0 0 34 44 0 0
25 1 0 8 22 68 46 244 86 8 0&nbs
Title: Day 3
Post by: Zerker on November 16, 2012, 04:22:52 PM
For today's effort, let's try to see if we can get better decoding of each image record. It may not be perfect, but we should be able to get good-enough decoding to get the map tiles ready for use. It's very hard to guess what every number might mean from a black box perspective, so some of those fields will just have to remain unknowns for now. Usually, the best approach is to start with a number that you think should be present and try to find it.
The most likely candidates I see are the 3rd and 4th last numbers. Since we know the tile images are 16 x 16, we see a lot of records with those numbers. What I'm going to do is split each record up into a series of images, using those dimensions for each series. We'll see how well that turns out. I'm also going to need to clean up my code a bit more to support this, so it's time to group things into classes. The updated script is below:
Code: [Select]
import struct, sys, os, pdb, csv
from PIL import Image
def createpath(pathname):
""" Simple utility method for creating a path only if it does
not already exist.
"""
if not os.path.exists(pathname):
os.mkdir(pathname)
class imagefile(object):
def __init__(self, filename, palette):
filesize = os.path.getsize(filename)
graphicsfile = open(filename, 'rb')
header = '<62L'
headerdata = struct.unpack(header,
graphicsfile.read(struct.calcsize(header)) )
graphicsfile.seek(0x200)
header2 = '<62H'
headerdata2 = struct.unpack(header2,
graphicsfile.read(struct.calcsize(header2)) )
# Create the image records using list comprehension
self.records = [imagerecord(graphicsfile, offset, size, palette)
for (offset, size) in zip(headerdata, headerdata2) if offset > 0]
def debug_csv(self, filename):
with open(filename, 'wb') as csvfile:
writer = csv.writer(csvfile)
for recnum, record in enumerate(self.records):
writer.writerow([recnum, record.offset, record.size] + list(record.header))
def save(self, outpath):
createpath(outpath)
for recnum, record in enumerate(self.records):
record.save(os.path.join(outpath, '{:02}-{}'.format(recnum, record.offset)))
class imagerecord(object):
def __init__(self, filedata, offset, size, palette):
self.offset = offset
self.size = size
filedata.seek(offset)
headerstruct = '<16B'
self.header = struct.unpack(headerstruct,
filedata.read(struct.calcsize(headerstruct)) )
self.width = self.header[12]
self.height = self.header[13]
self.images = []
for tilenum in range(size/(self.width*self.height)):
tile = Image.fromstring("P", (self.width, self.height),
filedata.read(self.width*self.height))
tile.putpalette(palette)
self.images.append(tile)
def save(self, outpath):
createpath(outpath)
for tilenum, tile in enumerate(self.images):
tile.save(os.path.join(outpath, '{:04}.png'.format(tilenum)) )
if __name__ == "__main__":
if len(sys.argv) < 2:
print """Usage: python xargongraphics.py [Graphics File]
TODO
"""
else:
# Use the screenshot to grab the proper colour palette:
palimage = Image.open('screeny.png')
palette = palimage.getpalette()
for filename in sys.argv[1:]:
xargonimages = imagefile(filename, palette)
xargonimages.debug_csv('debug.csv')
xargonimages.save('output')
So now we have an imagefile class for the overall file, and an imagerecord for each record in the file's table of contents. I also moved my save CSV code and load/save image code into functions for each class.
Anyone unfamiliar with zip, enumerate (http://docs.python.org/2/library/functions.html) or Python classes in general (http://docs.python.org/2/tutorial/classes.html) can refer to the corresponding Python documentation sections linked for each. I used one yesterday, but if you are unfamiliar with list comprehensions (http://docs.python.org/2/tutorial/datastructures.html#list-comprehensions), I recommend looking that up too. I'm sure I'll use more going forward.
The first few sets of images start to look more like something, but they're still a bit weird. Set #5, however, is where things start to get interesting. Here we have an almost-correct decoding of the player sprite!
(http://www.zerker.ca/misc/xargon/day3_1.png)
Guess the guess wasn't too far off. Since we're shifting between each sub-image, I suspect there may be a small header between each image. Let's see what we can find. I'm going to use image set #9, because it's 16 by 16 and very easy to see image alignment. The first image seems to be shifted by 1 pixel, and the the second image seems to be shifted by 2 pixels. Hrm. 3 pixel header? Let's find this in a hex editor. My debug code nicely names the directories by their offsets, so start from offset 74973 + 16 for header + 256 for first image -1 for first image error gets me to 75244. And this decodes to:
16 16 0
So, it looks like the end of the previous header was actually the start of the first image's header. And it also appears I was accidentally grabbing the first pixel from the image. Let's go fix all this, and decode the headers for each image. Also, looking at record 9, I ended up with 47 images. The header for that record has 47 as the first number. Since I know now that we can have variable size images, I'm going to assume this is the number of images in a record.
On my first attempt, I got the following exception
Code: [Select]
Traceback (most recent call last):
File "xargongraphics.py", line 100, in <module>
xargonimages = imagefile(filename, palette)
File "xargongraphics.py", line 46, in __init__
for (offset, size) in zip(headerdata, headerdata2) if offset > 0]
File "xargongraphics.py", line 78, in __init__
filedata.read(width*height))
File "/usr/lib/python2.7/dist-packages/PIL/Image.py", line 1797, in fromstring
im.fromstring(data, decoder_name, args)
File "/usr/lib/python2.7/dist-packages/PIL/Image.py", line 590, in fromstring
d.setimage(self.im)
ValueError: tile cannot extend outside image
Which implies something is mixed up. Debugger time.
Code: [Select]
-> tile = Image.fromstring("P", (width, height),
(Pdb) width
1
(Pdb) height
0
(Pdb) self.header
(128, 1, 0, 0, 10, 0, 18, 0, 34, 2)
(Pdb)
Oops. I think I subtracted too many bytes when I shrunk the header. Here's the code with that fixed.
Code: [Select]
import struct, sys, os, pdb, csv
from PIL import Image
def createpath(pathname):
""" Simple utility method for creating a path only if it does
not already exist.
"""
if not os.path.exists(pathname):
os.mkdir(pathname)
class imagefile(object):
def __init__(self, filename, palette):
filesize = os.path.getsize(filename)
graphicsfile = open(filename, 'rb')
header = '<62L'
headerdata = struct.unpack(header,
graphicsfile.read(struct.calcsize(header)) )
graphicsfile.seek(0x200)
header2 = '<62H'
headerdata2 = struct.unpack(header2,
graphicsfile.read(struct.calcsize(header2)) )
# Create the image records using list comprehension
self.records = [imagerecord(graphicsfile, offset, size, palette)
for (offset, size) in zip(headerdata, headerdata2) if offset > 0]
def debug_csv(self, filename):
with open(filename, 'wb') as csvfile:
writer = csv.writer(csvfile)
for recnum, record in enumerate(self.records):
writer.writerow([recnum, record.offset, record.size] + list(record.header))
def save(self, outpath):
createpath(outpath)
for recnum, record in enumerate(self.records):
record.save(os.path.join(outpath, '{:02}-{}'.format(recnum, record.offset)))
class imagerecord(object):
def __init__(self, filedata, offset, size, palette):
self.offset = offset
self.size = size
filedata.seek(offset)
headerstruct = '<12B'
self.header = struct.unpack(headerstruct,
filedata.read(struct.calcsize(headerstruct)) )
self.numimages = self.header[0]
self.images = []
for tilenum in range(self.numimages):
(width, height, unknown) = struct.unpack('<3B',
filedata.read(3))
tile = Image.fromstring("P", (width, height),
filedata.read(width*height))
tile.putpalette(palette)
self.images.append(tile)
def save(self, outpath):
createpath(outpath)
for tilenum, tile in enumerate(self.images):
tile.save(os.path.join(outpath, '{:04}.png'.format(tilenum)) )
if __name__ == "__main__":
if len(sys.argv) < 2:
print """Usage: python xargongraphics.py [Graphics File]
TODO
"""
else:
# Use the screenshot to grab the proper colour palette:
palimage = Image.open('screeny.png')
palette = palimage.getpalette()
for filename in sys.argv[1:]:
xargonimages = imagefile(filename, palette)
xargonimages.debug_csv('debug.csv')
xargonimages.save('output')
And the output for a random record with variable-sized images:
(http://www.zerker.ca/misc/xargon/day3_2.png)
Nailed it!
Now, to top things off, let's mask transparent areas of sprites. It looks like colour 0 (black) is used for transparency. Let's just add a routine to loop through the image data, create a mask, then convert each to RGBA. This will make our lives much easier going forward. I'm actually going to just copy a routine I already wrote for my Shadow Caster maps.
And done...
Code: [Select]
import struct, sys, os, pdb, csv
from PIL import Image
def createpath(pathname):
""" Simple utility method for creating a path only if it does
not already exist.
"""
if not os.path.exists(pathname):
os.mkdir(pathname)
class imagefile(object):
def __init__(self, filename, palette):
filesize = os.path.getsize(filename)
graphicsfile = open(filename, 'rb')
header = '<62L'
headerdata = struct.unpack(header,
graphicsfile.read(struct.calcsize(header)) )
graphicsfile.seek(0x200)
header2 = '<62H'
headerdata2 = struct.unpack(header2,
graphicsfile.read(struct.calcsize(header2)) )
# Create the image records using list comprehension
self.records = [imagerecord(graphicsfile, offset, size, palette)
for (offset, size) in zip(headerdata, headerdata2) if offset > 0]
def debug_csv(self, filename):
with open(filename, 'wb') as csvfile:
writer = csv.writer(csvfile)
for recnum, record in enumerate(self.records):
writer.writerow([recnum, record.offset, record.size] + list(record.header))
def save(self, outpath):
createpath(outpath)
for recnum, record in enumerate(self.records):
record.save(os.path.join(outpath, '{:02}-{}'.format(recnum, record.offset)))
class imagerecord(object):
@staticmethod
def maskimage(inimage):
""" Masks colour 0 in the given image, turning those pixels
transparent. Returns the resulting RGBA image.
"""
tempmask = Image.new('L', inimage.size, 255)
maskdata = list(tempmask.getdata())
outimage = inimage.convert("RGBA")
for pos, value in enumerate(inimage.getdata()):
if value == 0:
maskdata[pos] = 0
tempmask.putdata(maskdata)
outimage.putalpha(tempmask)
return outimage
def __init__(self, filedata, offset, size, palette):
self.offset = offset
self.size = size
filedata.seek(offset)
headerstruct = '<12B'
self.header = struct.unpack(headerstruct,
filedata.read(struct.calcsize(headerstruct)) )
self.numimages = self.header[0]
self.images = []
for tilenum in range(self.numimages):
(width, height, unknown) = struct.unpack('<3B',
filedata.read(3))
tile = Image.fromstring("P", (width, height),
filedata.read(width*height))
tile.putpalette(palette)
self.images.append(self.maskimage(tile))
def save(self, outpath):
createpath(outpath)
for tilenum, tile in enumerate(self.images):
tile.save(os.path.join(outpath, '{:04}.png'.format(tilenum)) )
if __name__ == "__main__":
if len(sys.argv) < 2:
print """Usage: python xargongraphics.py [Graphics File]
TODO
"""
else:
# Use the screenshot to grab the proper colour palette:
palimage = Image.open('screeny.png')
palette = palimage.getpalette()
for filename in sys.argv[1:]:
xargonimages = imagefile(filename, palette)
xargonimages.debug_csv('debug.csv')
xargonimages.save('output')
A quick audit of the map tile groups show that there
Title: Day 4
Post by: Zerker on November 17, 2012, 08:59:50 AM
Before we start identifying tiles and creating the image map, there are two things I noticed yesterday about the image data that I want to investigate.
1) The GRAPHICS file table of contents had a few blank entries. My current algorithm skips those positions entirely. However, when we start identifying tile mappings, the fact that there was a field allocated for them may be important. I will therefore update my algorithm to specifically create blank places in order to keep the record alignment accurate. It also appears to have space for more records, so I'm going to at least process those regions in case there are more records in the registered version.
2) Record 4 and Record 49 have a garbage 64*12 image in each of them. Also, record 49 appears to have the wrong colour palette. The interesting thing about a 64*12 image is that it takes up 768 bytes. A full 256 colour palette also takes up 768 bytes, so I suspect these records are actually colour palettes. If so, we don't need our sample screenshot and we can pull the colour palette direct from the game data. It also means we can correct the palette for the Record 49 images, if this is accurate.
Also, as the source files are going to get a bit more plentiful (and of increasing length) I'm also going to change to only posting snippets of code and include the full listing in a zip at the end of this day's post.
Finally, because I'm paranoid, I'm going to put in a warning of a record still has data after we read the last image in that record. I *think* I'm decoding that right, but if there's more data, we don't want to miss it.
For the blank entries, it couldn't be easier. Increasing the size of the record removes the need for the seek command and the IF on the list comprehension:
Code: [Select]
header = '<128L'
headerdata = struct.unpack(header,
graphicsfile.read(struct.calcsize(header)) )
header2 = '<128H'
headerdata2 = struct.unpack(header2,
graphicsfile.read(struct.calcsize(header2)) )
# Create the image records using list comprehension
self.records = [imagerecord(graphicsfile, offset, size, palette)
for (offset, size) in zip(headerdata, headerdata2)]
Instead, the IF needs to go inside the image record instead. It also needs to be added to the debug output so we don't get a ton of empty folders. I'll let the debug CSV actually attempt to write out data for these blank records so it's easier to see the breakdown. I'm also going to add my paranoid sanity check to the __init__ method now. Here is the updated imagerecord class:
Code: [Select]
class imagerecord(object):
@staticmethod
def maskimage(inimage):
""" Masks colour 0 in the given image, turning those pixels
transparent. Returns the resulting RGBA image.
"""
tempmask = Image.new('L', inimage.size, 255)
maskdata = list(tempmask.getdata())
outimage = inimage.convert("RGBA")
for pos, value in enumerate(inimage.getdata()):
if value == 0:
maskdata[pos] = 0
tempmask.putdata(maskdata)
outimage.putalpha(tempmask)
return outimage
def __init__(self, filedata, offset, size, palette):
self.offset = offset
self.size = size
self.images = []
if offset > 0:
filedata.seek(offset)
headerstruct = '<12B'
self.header = struct.unpack(headerstruct,
filedata.read(struct.calcsize(headerstruct)) )
self.numimages = self.header[0]
for tilenum in range(self.numimages):
(width, height, unknown) = struct.unpack('<3B',
filedata.read(3))
tile = Image.fromstring("P", (width, height),
filedata.read(width*height))
tile.putpalette(palette)
self.images.append(self.maskimage(tile))
# Check to see if we actually loaded all data from this record
leftover = self.offset + self.size - filedata.tell()
if leftover > 0:
print "Record at offset {} has {} bytes unaccounted for.".format(self.offset, leftover)
elif leftover < 0:
print "Record at offset {} read {} bytes beyond its boundary.".format(self.offset, -leftover)
else:
self.numimages = 0
self.header = []
def save(self, outpath):
if self.numimages > 0:
createpath(outpath)
for tilenum, tile in enumerate(self.images):
tile.save(os.path.join(outpath, '{:04}.png'.format(tilenum)) )
And running again...
Code: [Select]
Record at offset 768 has 3 bytes unaccounted for.
Record at offset 9359 has 3 bytes unaccounted for.
Record at offset 14366 has 39 bytes unaccounted for.
Record at offset 15087 has 39 bytes unaccounted for.
Record at offset 21646 has 131 bytes unaccounted for.
Record at offset 22560 has 39 bytes unaccounted for.
Record at offset 54601 has 963 bytes unaccounted for.
Record at offset 61481 has 259 bytes unaccounted for.
Record at offset 68227 has 259 bytes unaccounted for.
Record at offset 74973 has 39 bytes unaccounted for.
Record at offset 87197 has 259 bytes unaccounted for.
Record at offset 94720 has 259 bytes unaccounted for.
Record at offset 98099 has 259 bytes unaccounted for.
Record at offset 101737 has 39 bytes unaccounted for.
Record at offset 124062 has 259 bytes unaccounted for.
Record at offset 131326 has 259 bytes unaccounted for.
Record at offset 140144 has 259 bytes unaccounted for.
Record at offset 148185 has 259 bytes unaccounted for.
Record at offset 155708 has 259 bytes unaccounted for.
Record at offset 160382 has 259 bytes unaccounted for.
Record at offset 163761 has 259 bytes unaccounted for.
Record at offset 171284 has 259 bytes unaccounted for.
Record at offset 178030 has 259 bytes unaccounted for.
Record at offset 197467 has 259 bytes unaccounted for.
Record at offset 204731 has 259 bytes unaccounted for.
Record at offset 214326 has 259 bytes unaccounted for.
Record at offset 235317 has 259 bytes unaccounted for.
Record at offset 253718 has 259 bytes unaccounted for.
Record at offset 262277 has 259 bytes unaccounted for.
Record at offset 266692 has 259 bytes unaccounted for.
Record at offset 296888 has 531 bytes unaccounted for.
Record at offset 305411 has 243 bytes unaccounted for.
Record at offset 309719 has 243 bytes unaccounted for.
Record at offset 321156 has 899 bytes unaccounted for.
Record at offset 325931 has 243 bytes unaccounted for.
Record at offset 343340 has 531 bytes unaccounted for.
Record at offset 353794 has 515 bytes unaccounted for.
Record at offset 363293 has 259 bytes unaccounted for.
Record at offset 374943 has 259 bytes unaccounted for.
Record at offset 395189 has 171 bytes unaccounted for.
Record at offset 407614 has 171 bytes unaccounted for.
Record at offset 415826 has 259 bytes unaccounted for.
Record at offset 433431 has 259 bytes unaccounted for.
Record at offset 439659 has 259 bytes unaccounted for.
Record at offset 451922 has 259 bytes unaccounted for.
Record at offset 473916 has 147 bytes unaccounted for.
Record at offset 481227 has 515 bytes unaccounted for.
Record at offset 485490 has 243 bytes unaccounted for.
Record at offset 488542 has 147 bytes unaccounted for.
Record at offset 491213 has 3 bytes unaccounted for.
Record at offset 554159 has 259 bytes unaccounted for.
Record at offset 563460 has 903 bytes unaccounted for.
Record at offset 566188 has 259 bytes unaccounted for.
Record at offset 597635 has 259 bytes unaccounted for.
Record at offset 629082 has 1299 bytes unaccounted for.
Record at offset 650040 has 1299 bytes unaccounted for.
Record at offset 662219 has 323 bytes unaccounted for.
Record at offset 664428 has 787 bytes unaccounted for.
Record at offset 689851 has 1539 bytes unaccounted for.
Well, we are missing data. Now, is this actual data, or blank regions? Let's investigate one. Offset 54601 is record #7, and according to my debug CSV has a size of 6880. If we have 969 unaccounted bytes, that puts at offset 54601+6880-963 = 60518. And it looks like there's a header for a 24 * 40 pixel image here. This implies that we are off by 1 on the number of images in a region. However, the 3 byte misalignments look a bit too small. Sure enough, investigating one of those shows that it actually is a 0, 0, 0 header. So, let's expand to grab that last image, but provide the ability to ignore an empty image if needed.
Code: [Select]
self.numimages = self.header[0] + 1
for tilenum in range(self.numimages):
(width, height, unknown) = struct.unpack('<3B',
filedata.read(3))
if width > 0 and height > 0:
tile = Image.fromstring("P", (width, height),
filedata.read(width*height))
tile.putpalette(palette)
self.images.append(self.maskimage(tile))
No more warnings, but some of these extra images seem a bit out of place. Hrm, maybe it is just garbage data after all. It doesn't hurt to decode it though.
Now for palette time! This will require delaying loading the picture data a bit later, so we can load the palette explicitly first. Here are the updates to the imagerecord class:
Code: [Select]
def __init__(self, filedata, offset, size):
self.offset = offset
self.size = size
self.images = []
# Store the file handle for future use
self.filedata = filedata
if offset > 0:
filedata.seek(offset)
headerstruct = '<12B'
self.header = struct.unpack(headerstruct,
filedata.read(struct.calcsize(headerstruct)) )
self.numimages = self.header[0] + 1
else:
self.numimages = 0
self.header = []
def loadimages(self, palette, skipimages=0):
if self.offset > 0:
self.filedata.seek(self.offset + 12)
for tilenum in range(self.numimages):
(width, height, unknown) = struct.unpack('<3B',
self.filedata.read(3))
# Skip past this image if requested (i.e. for palettes)
if skipimages > 0:
self.filedata.seek(width*height, os.SEEK_CUR)
skipimages = skipimages - 1
elif width > 0 and height > 0:
tile = Image.fromstring("P", (width, height),
self.filedata.read(width*height))
tile.putpalette(palette)
self.images.append(self.maskimage(tile))
# Check to see if we actually loaded all data from this record
leftover = self.offset + self.size - self.filedata.tell()
if leftover > 0:
print "Record at offset {} has {} bytes unaccounted for.".format(self.offset, leftover)
elif leftover < 0:
print "Record at offset {} read {} bytes beyond its boundary.".format(self.offset, -leftover)
def getpalette(self):
""" Loads the first image in this record as a palette."""
self.filedata.seek(self.offset + 12)
(width, height, unknown) = struct.unpack('<3B',
self.filedata.read(3))
if width*height != 768:
raise Exception('This image is not a palette!')
else:
return self.filedata.read(width*height)
And the main load routine:
Code: [Select]
# Create the image records using list comprehension
self.records = [imagerecord(graphicsfile, offset, size)
for (offset, size) in zip(headerdata, headerdata2)]
palette1 = self.records[5].getpalette()
palette2 = self.records[53].getpalette()
for recnum, record in enumerate(self.records):
if recnum == 53:
record.loadimages(palette2, skipimages=1)
elif recnum == 5:
record.loadimages(palette1, skipimages=1)
else:
record.loadimages(palette1, skipimages=1)
Weird. Everything looks like the correct colours, just VERY dark. Either it's in some strange format, or it's an alternate palette. A quick comparison using GIMP and a Hex editor doesn't show any direct correlation. Bah. It's not worth it right now. I'll keep the code in, but I will limit it for group 53 data and leave the main data using the screenshot for the palette. Let's get to the mapping!
In order to get started on the mapping, I need to refactor how I load the map. Previously, we loaded the map byte-at-a-time to make visualization easy. Now we should load as a series of 16-bit halfwords instead. I should also add a quick routine to generate a map csv so I can see the data values for each tile easily. Before I do that, let's get the previous functionality refactored and try it on a few other maps for comparison.
Code: [Select]
import struct, sys, os
from PIL import Image
class xargonmap(object):
def __init__(self, filename):
# Grab the map from the file name (sans ext)
# TODO: Maps may have embedded names. To consider
(temppath, tempfname) = os.path.split(filename)
(self.name, tempext) = os.path.splitext(tempfname)
# Load the map data as a 98 x 98 array of 2-byte positions:
mapfile = open(filename, 'rb')
pattern = '<{}H'.format(64*128)
self.tiles = struct.unpack(pattern,
mapfile.read(struct.calcsize(pattern)) )
mapfile.close()
def debugcsv(self):
# Remember that the map is height-first. We need to convert to
# width-first
pass
def debugimage(self):
# Turn the map data into a list of 3-byte tuples to visualize it.
# Start by pre-creating an empty list of zeroes then copy it in
visualdata = [None] * (64*128)
for index in range(64*128):
visualdata[index] = (self.tiles[index]%256, self.tiles[index]/256, 0)
# Tell PIL to interpret the map data as a RAW image:
mapimage = Image.new("RGB", (64, 128) )
mapimage.putdata(visualdata)
mapimage.rotate(-90).save(self.name + '.png')
if __name__ == "__main__":
if len(sys.argv) < 2:
print """Usage: python xargonmap.py [Map File]
TODO
"""
else:
for filename in sys.argv[1:]:
themap = xargonmap(filename)
themap.debugcsv()
themap.debugimage()
Title: Re: PC Game Hacking and Mapping Tutorial: Xargon
Post by: Revned on November 17, 2012, 02:59:07 PM
This is great stuff, thanks for posting!
I tried to do something similar with Mega Man 9 before the Dolphin emulator was able to play it, but sadly, the graphics tiles weren't laid out so nicely in the data file. I stared at them in a hex editor for hours and hours before I finally gave up and eventually just fixed Dolphin so I could assemble the maps manually.
Title: Day 5
Post by: Zerker on November 18, 2012, 10:27:57 AM
Yeah, I'm thinking the black box method is only really practical with old DOS games. The newer games are more likely to be using strange compression schemes and alternate image formats. That said, some games may just use standard image formats (like PNG), so it may be entirely possible to start looking for headers of known image files.
Then again, the entire resource file is probably compressed too.
On to Day 5: the day where I stop teasing and actually create a map.
To support this, we need to start a lookup routine in the graphics file to get the corresponding tile for a map tile index. Unfortunately, we don't know the mapping yet, so we need to pre-populate with debug tiles. Since we found out that the tile index is only an 8-bit number, we should be able to fit it (in hex notation) in the 16 x 16 pixel debug tile. This may make the CSV we made obsolete, but what can you do.
We need a font to generate the text, so I'm going to copy in the Android favourite, DroidSans. Here's the routine to create a simple debug tile (adapted from my Shadow Caster mapper) and the font declaration:
Code: [Select]
debugfont = ImageFont.truetype("DroidSans.ttf", 12)
@staticmethod
def debugimage(colour, text):
""" Creates a 16x16 debug image for tiles:
colour -- the background colour for the image.
text -- the text to display
"""
tempimage = Image.new("RGBA", (16, 16), colour)
textcolor = (255, 255, 255) if colour[0] < 96 else (0, 0, 0)
pen = ImageDraw.Draw(tempimage)
pen.text((1, 2), text, font=imagefile.debugfont, fill=textcolor)
return tempimage
Here's the addition to the __init__ method for the graphics file:
Code: [Select]
# Group by map tile:
self.tilelookup = [self.debugimage( (i, i, i), '{:02X}'.format(i) )
for i in range(256) ]
And the lookup method, which will change once we figure out real mappings:
Code: [Select]
def gettile(self, tilenum):
return self.tilelookup(tilenum)
Now, we start a new file for generating the map. In this file, we're going to import the other two files we wrote in order to use their features in tandem. This will start out extremely simple: we will create a large Image object to hold the map, then paste every debug tile according to its coordinates. Since the map is a linear set of tiles, we need to use integer division and modulus (i.e. the "remainder") to split that up into X, Y coordinates.
Here's the initial mapper file. I set up the mapper as a class, but you can do it as a standalone set of functions as well. Personally, I like to split it up into phases. the Shadow Caster had initialize, generate and save phases, but I think we can combine the first two in this case.
Code: [Select]
import sys
from PIL import Image
from xargonmap import xargonmap
from xargongraphics import imagefile
class xargonmapper(object):
def __init__(self, graphics, mapdata):
self.mappicture = Image.new("RGB", (128*16, 64*16) )
self.name = mapdata.name
for index, tileval in enumerate(mapdata.tiles):
# Remember: maps are height first
(x, y) = (index/64, index%64)
self.mappicture.paste(graphics.gettile(tileval),
(x*16, y*16) )
def save(self):
self.mappicture.save(self.name + '.png')
if __name__ == "__main__":
if len(sys.argv) < 3:
print """Usage: python xargonmapper.py [Graphics File] [Map File(s)...]
TODO
"""
else:
xargonimages = imagefile(sys.argv[1])
for filename in sys.argv[2:]:
themap = xargonmap(filename)
print "Generating Map '{}'".format(themap.name)
mapper = xargonmapper(xargonimages, themap)
print "Saving Map '{}'".format(themap.name)
mapper.save()
And here's our first output with no tiles identified:
(http://www.zerker.ca/misc/xargon/day5_1.png)
Remember this screenshot from Day 2?
(http://www.zerker.ca/misc/xargon/day2_1.png)
Well, that's same area. So now we need to go look through our extracted tiles and match a few to IDs. Usually we can figure out a trend to unlock the rest for us; otherwise it can become a bit tedious. I see a few tiles in graphics record #8, so I'm going to go ahead and map those. Actually, I already see a pattern: it looks like map tile values 1 to at least 0A correspond to the first few tiles in group 8. But there appears to be a discontinuity at index 6. GRR. Let's do what we can with it.
Code: [Select]
def gettile(self, tilenum):
if tilenum >= 2 and tilenum <=5:
return self.records[8].images[tilenum-2]
elif tilenum >= 7 and tilenum <=10:
return self.records[8].images[tilenum-3]
else:
return self.tilelookup[tilenum]
Not too bad so far, but I can see this getting awkward after a bit. Let's see what this does to the map:
(http://www.zerker.ca/misc/xargon/day5_2.png)
Okay, that's progress. Now let me go ahead and try to identify some of the other tiles... gah, what is that??
(http://www.zerker.ca/misc/xargon/day5_3.png)
Looks like I was wrong about the 8-bit tiles. This all falls under the red area in the original visualisations. Looking a bit closer at my grayscale meta files in GIMP show that even the non-black regions appear to have a few very-close-but-not-identical colour values. Time so switch back to 16-bit tiles (grumble). I'm not quite sure how to make 4-digits visible on a 16 pixel tile though. I'll try, but I may need to rely more on the CSV.
Code: [Select]
debugfont = ImageFont.truetype("DroidSans.ttf", 8)
@staticmethod
def debugimage(index):
""" Creates a 16x16 debug image for tiles """
colour = (index%256, index/256, 0)
tempimage = Image.new("RGBA", (16, 16), colour)
textcolor = (255, 255, 255) if colour[0] < 96 and colour[1] < 96 else (0, 0, 0)
pen = ImageDraw.Draw(tempimage)
pen.text((4, 0), '{:02X}'.format(index/256), font=imagefile.debugfont, fill=textcolor)
pen.text((4, 8), '{:02X}'.format(index%256), font=imagefile.debugfont, fill=textcolor)
return tempimage
8-point font FTW. Just readable. It takes a noticeable delay to generate 65535 debug tiles though :(. Now to adapt my previous identifications (+ a couple more):
Code: [Select]
def gettile(self, tilenum):
if tilenum == 0xC000:
return self.records[9].images[15]
elif tilenum == 0xC001:
return self.records[8].images[24]
elif tilenum >= 0xC002 and tilenum <=0xC005:
return self.records[8].images[tilenum-0xC002]
elif tilenum >= 0xC007 and tilenum <=0xC00A:
return self.records[8].images[tilenum-0xC003]
elif tilenum >= 0xC1AF and tilenum <=0xC1B3:
return self.records[14].images[tilenum-0xC1AF+18]
elif tilenum >= 0xC0F5 and tilenum <=0xC0F6:
return self.records[25].images[tilenum-0xC0F5+2]
elif tilenum >= 0xC0D3 and tilenum <=0xC0D6:
return self.records[25].images[tilenum-0xC0D3+9]
elif tilenum >= 0xC2DE and tilenum <=0xC2DF:
return self.records[25].images[tilenum-0xC2DE+13]
elif tilenum >= 0xC2E2 and tilenum <=0xC2E3:
return self.records[25].images[tilenum-0xC2E2+19]
elif tilenum >= 0xC2EE and tilenum <=0xC2F1:
return self.records[25].images[tilenum-0xC2EE+31]
else:
return self.tilelookup[tilenum]
(http://www.zerker.ca/misc/xargon/day5_4.png)
No more misidentified tiles, but we aren't exactly coming up with much of a trend, even if we were to calculate out the offsets (i.e. -0xC0F5+2 = -0xC0F3, but -0xC0D3+9 = -0xC0CA). It seems that almost every group of tiles, even those in the same record, ends up discontinuous. At this point, we have two options. Either keep identifying tiles manually (and up with some sort of mapping database), or see if there is some information we are missing. Hey now, there's a file called TILES.XR1. Let's see what's in it. Looks like a whole bunch of strings with some supplementary information. It's a very regular file, so it should be fairly simple to decode.
Here's the last record in the file (with ASCII characters substituting the obvious text portion):
81 03 3A 5B 01 00 07 MPBRDG1
The last byte appears to be the string length, so it's just the first 6 to guess about. Since we are dealing with 16-bit tile values, I'm going to decode each of these at 16 bits on a hunch.
Here's our new file:
Code: [Select]
import struct, sys, os, pdb, csv
from PIL import Image, ImageFont, ImageDraw
class tilefile(object):
debugfont = ImageFont.truetype("DroidSans.ttf", 8)
def __init__(self, filename):
filesize = os.path.getsize(filename)
infile = open(filename, 'rb')
self.tiles = []
commonheader = '<3HB'
while infile.tell() < filesize:
headerdata = struct.unpack(commonheader,
infile.read(struct.calcsize(commonheader)) )
stringlen = headerdata[3]
print headerdata
self.tiles.append(headerdata[0:3] +
struct.unpack('<{}s'.format(stringlen), infile.read(stringlen)) )
def debug_csv(self, filename):
with open(filename, 'wb') as csvfile:
writer = csv.writer(csvfile)
for recnum, tiledata in enumerate(self.tiles):
writer.writerow((recnum,) + tiledata)
if __name__ == "__main__":
if len(sys.argv) < 2:
print """Usage: python xargontiles.py [Tiles File]
TODO
"""
else:
for filename in sys.argv[1:]:
xargontiles = tilefile(filename)
xargontiles.debug_csv('tiles.csv')
And part of the output. First column is the index in the file, the rest is data from the file:
Code: [Select]
0 0 18704 1 0
1 1 18432 1 SK1
2 2 18433 1 SK2
3 3 18434 1 SK3
4 4 18435 1 SK4
5 5 18436 1 SK5
6 6 18707 1 CLD1
7 7 18437 1 VL
8 8 18438 1 VR
9 9 18439 0 S1L
10 10 18440 0 S1R
11 11 18708 1 CLD2
12 12 18709 1 CLD3
13 13 18441 1 R1
14 14 18442 1 R2
15 15 18443 1 R3
16 16 18444 1 R4
17 17 18445 3 GS1
18 18 18446 3 GS2
19 19 18447 1 R5
20 20 18448 1 R6
21 21 18449 0 S2
22 22 18450 0 S2C
23 23 18451 0 S2M
24 24 18452 0 S2B
25 25 18453 1 S2U
26 26 18454 1 S2BK
27 27 18710 1 CLD4
28 28 18711 1 CLD5
29 29 18712 1 CLD6
Still no direct correlation to the values we see on the map, as C000 (for example) is 49152 in decimal. Let me do one more thing today. I'm going to re-interpret some of our unknown GRAPHICS record header values as 16-bit numbers.
[code]
0 0 0
1 768 8591 128 1 2560 4608 8704 2 1 0
2 9359 5007 128 1 2048 3584 6656 2 1 0
3 14366 721 10 1 200 360 680 2 1 0
4 15087 6559 36 1 1744 3344 6544 8 4 0
5 21646 914 1 1 196 388 772 8 4 0
6 22560 32041 38 1 8122 16096 32032 8 0 0
7 54601 6880 27 1 1564 3020 5932 8 4 0
8 61481 6746 25 1 1700 3300 6500 8 4 0
9 68227 6746 25 1 1700 3300 6500 8 4 0
10 74973 12224 47 1 3196 6204 12220 8 4 0
11 87197 7523 28 1 1904 3696 7280 8 4 0
12 94720 3379 12 1 816 1584 3120 8 4 0
13 98099 3638 13 1 884 1716 3380 8 4 0
14 101737 22325 86 1 5848 11352 22360 8 4 0
15 124062 7264 27 1 1836 3564 7020 8 4 0
16 131326 8818 33 1 2244 4356 8580 8 4 0
17 140144 8041 30 1 2040 3960 7800 8 4 0
18 148185 7523 28 1 1904 3696 7280 8 4 0
19 155708 4674 17 1 1156 2244 4420 8 4 0
20 160382 3379 12 1 816 1584 3120 8 4 0
21 163761 7523 28 1 1904 3696 7280 8 4 0
22 171284 6746 25 1 1700 3300 6500 8 4 0
23 178030 19437 74 1 5032 9768 19240 8 4 0
24 197467 7264 27 1 1836 3564 7020 8 4 0
25 204731 9595 36 1 2448 4752 9360 8 4 0
26 214326 20991 80 1 5440 10560 20800 8 4 0
27 235317 18401 70 1 4760 9240 18200 8 4 0
28 253718 8559 32 1 2176 4224 8320 8 4 0
29 262277 4415 16 1 1088 2112 4160 8 4 0
30 266692 30196 77 1 7901 15900 30680 8 0 0
31 296888 8523 36 1 2128 5392 8080 8 0 0
32 305411 4308 7 1 1036 2044 4060 8 0 0
33 309719 11437 12 1 2840 5652 11216 8 0 0
34 321156 4775 8 1 992 1952 3872 8 0 0
35 325931 17409 18 1 4572 9072 18072 8 0 0
36 343340 10454 37 1 2650 5236 10156 8 0 0
37 353794 9499 36 1 2360 4688 9008 8 0 0
38 363293 11650 7 1 2880 6144 11436 8 0 0
39 374943 20246
Title: Re: PC Game Hacking and Mapping Tutorial: Xargon
Post by: TerraEsperZ on November 18, 2012, 10:47:46 AM
Fascinating. Definitely out of my league though, and not really usable for the console/handheld games I prefer to map, but fascinating none the less :).
Title: Re: PC Game Hacking and Mapping Tutorial: Xargon
Post by: DarkWolf on November 19, 2012, 08:01:42 AM
Something to note about old DOS games as well: sprites are often stored with some sort of run-length encoding. It's an outdated method of reducing the size of bitmaps. What it does is translate the drawing of the image into commands similar to:
Move X pixels
New row
Draw X pixels of color
Each game seems to be slightly different in the encoding, but with trial and error, it can be figured out.
Title: Re: PC Game Hacking and Mapping Tutorial: Xargon
Post by: Zerker on November 19, 2012, 06:03:11 PM
Thanks for the feedback guys. To expand on Darkwolf's comment, Xargon is a very simple game with some basic data structures. It makes it a good example, but note that other games may be more difficult. Both games I did prior to this (ROTT and ShadowCaster) had more complicated sprite schemes. ROTT used an RLE encoding scheme as DarkWolf described, while ShadowCaster actually had a simple scheme of specifying the start and end pixel in a column, but not otherwise compressing the image. That said, a lot of games have had some prior investigation, or even a source code release, which can help reduce the guesswork immensely. As I mentioned, the source code for Xargon has been released, but I'm intentionally avoiding it to make this guide (hopefully) more useful.
To start off today's exercise, I'm going to play around in a spreadsheet. Exciting stuff. Basically, for every known sprite thus far, I want to figure out the exact relationship between the TILES file, the Record ID, and the Map ID. One thing I noticed yesterday was that the Record ID column in the TILES file appeared to shift by a 256 boundary for each record. We should be able to use the classic divide and modulus pair to split out the record number. I just need to confirm to make sure we don't start drifting for whatever offset I end up calculating.
Records appear to be easy. The record number is just the TILES entry / 256 - 64, and the entry in the record is the TILES entry % 256 -1. The only two things that we need to pay special attention to are:
1) The "extra" tile we mentioned before (i.e. that I thought might be garbage data) appears to be referred to by position -1. That said, index -1 in Python already refers to the last element in a list, so we don't actually need to handle this explicitly.
2) The tiles file refers to record 49, which does not exist. We will just need to keep an eye out if this happens. I expect this is just placeholder data (maybe for the registered version).
The Tile IDs appear to just be offset by C000, which is pretty simple. I'll need to figure out the tiles that are in the 0 to FF range on the map, but that can wait. I'll just put an IF statement to avoid processing them for now.
So let's expand our xargontiles.py file to do the lookup for us. We have two options for linking together the graphics and tile files:
1) Pass in the Graphics file when creating the Tiles file and store a reference for future use
2) Pass in the Graphics file for the lookup operation to the Tiles file
Since I prefer to keep each class tailored to just the file it is responsible for, I will be doing the second option. The xargonmapper.py is the only file that will know about all the related files and will tie them together.
First, we need to set up xargontile to do easier lookups. I will expand the initialization routine to populate a dictionary of tile to record mappings:
Code: [Select]
def __init__(self, filename):
filesize = os.path.getsize(filename)
infile = open(filename, 'rb')
self.tiles = []
self.lookup = {}
commonheader = '<3HB'
while infile.tell() < filesize:
headerdata = struct.unpack(commonheader,
infile.read(struct.calcsize(commonheader)) )
stringlen = headerdata[3]
self.tiles.append(headerdata[0:3] +
struct.unpack('<{}s'.format(stringlen), infile.read(stringlen)) )
self.lookup[headerdata[0]] = headerdata[1]
Then we write the lookup routine itself to use this lookup and take the offsets into account:
Code: [Select]
def gettile(self, graphics, tilenum):
if tilenum < 0xC000:
return graphics.tilelookup[tilenum]
else:
graphindex = self.lookup[tilenum - 0xC000]
recnum = graphindex / 256 - 64
recindex = graphindex % 256 - 1
return graphics.records[recnum].images[recindex]
And this results in a very minor change to xargonmapper:
Code: [Select]
def __init__(self, graphics, tiledata, mapdata):
self.mappicture = Image.new("RGB", (128*16, 64*16) )
self.name = mapdata.name
for index, tileval in enumerate(mapdata.tiles):
# Remember: maps are height first
(x, y) = (index/64, index%64)
self.mappicture.paste(tiledata.gettile(graphics, tileval),
(x*16, y*16) )
Then we run it!
(http://www.zerker.ca/misc/xargon/day6_1.png)
And would you look at that? THAT is progress. But it's not perfect, and it has some glitches we need to investigate. Notably, we haven't looked into the map index 0 -> FF area yet. I also noticed a couple glitches over in this part of the map which we need to investigate further:
(http://www.zerker.ca/misc/xargon/day6_2.png)
But first, the region that doesn't start with C000:
(http://www.zerker.ca/misc/xargon/day6_3.png)
And let's start identifying some tiles. I already have a theory that these are simply direct indicies into the TILES file, so let's test that out with the black tiles (00AD it looks like). 0xAD -> 173 decimal, which has the name of 0NO and record 9, index 16. Sure enough, that tile is totally black. Let's implement it and see how it turns out:
Code: [Select]
def gettile(self, graphics, tilenum):
if tilenum < 0xC000:
graphindex = self.lookup[tilenum]
else:
graphindex = self.lookup[tilenum - 0xC000]
recnum = graphindex / 256 - 64
recindex = graphindex % 256 - 1
return graphics.records[recnum].images[recindex]
(http://www.zerker.ca/misc/xargon/day6_4.png)
Almost there, but we ran into the same glitch again. Let's look into that. I'm just going to open up the debug CSV to grab the tile value that screwed up... and it looks like 174. In the TILES array, 174 is called RNSLDGM... and it's in record 10, index -1. ARGH. Looks like the out-of-place "extra" graphics really are out of place! And I can't figure out a clear reason why the "extra" tile looks wrong. However, this tile in particular looks like record 10, index 3 (although that is also assigned a tile name).
What I'm going to is remove the debug image list from before, since we have the tiles nominally identified. Instead, I will create a much shorter list to handle the cases where we run into a -1 tile and re-direct it to the correct index (if, in fact, such a tile exists). Hopefully we can get something working.
Code: [Select]
neg1mapping = {8: (8, 24), 10: (10, 3)}
def gettile(self, graphics, tilenum):
if tilenum < 0xC000:
graphindex = self.lookup[tilenum]
else:
graphindex = self.lookup[tilenum - 0xC000]
recnum = graphindex / 256 - 64
recindex = graphindex % 256 - 1
# Negative 1 index needs special handling. The correct image does
# not always appear in the correct spot.
if recindex == -1:
if recnum in self.neg1mapping:
(recnum, recindex) = self.neg1mapping[recnum]
else:
return graphics.unknown[recnum]
return graphics.records[recnum].images[recindex]
And a modification to the debug tile code:
Code: [Select]
@staticmethod
def debugimage(index):
""" Creates a 16x16 debug image for tiles """
colour = (index, index, index)
tempimage = Image.new("RGBA", (16, 16), colour)
textcolor = (255, 255, 255) if index < 96 else (0, 0, 0)
pen = ImageDraw.Draw(tempimage)
pen.text((1, 2), '{:02}'.format(index), font=imagefile.debugfont, fill=textcolor)
return tempimage
So yes, it looks like all the glitched tiles ARE the -1 tiles. Unfortunately, the tile we picked was wrong; the correct tile should have more of a highlight. We also need to find a suitable rope tile, it looks like.
(http://www.zerker.ca/misc/xargon/day6_5.png)
And I can't find either of them! *cries*.
Wait a minute. I am an idiot. Raise your hand if you see the bug below:
Code: [Select]
for recnum, record in enumerate(self.records):
if recnum == 53:
record.loadimages(palette2, skipimages=1)
elif recnum == 5:
record.loadimages(palette1, skipimages=1)
else:
record.loadimages(palette1, skipimages=1)
That's right, I ALWAYS skip the first image! GAH! This explains the whole subtract 1 thing (which, obviously now, is wrong). Let's fix both problems and re-run to generate:
(http://www.zerker.ca/misc/xargon/day6_6.png)
Yay! For run, I also ran it on the rest of the maps, and most everything looks okay, except for a few maps:
(http://www.zerker.ca/misc/xargon/day6_7.png)
Looks like there may be some sort of transparency behaviour with the sky colour on other maps? Or a different colour palette? I'll need to investigate when I decode more of the map format. That will be tomorrow's topic.
And finally, day6.zip (http://www.zerker.ca/misc/xargon/day6.zip) is available for anyone who wants it. It includes the full output images thus far if anyone wants to see what the current versions of the rest of the maps look like.
Title: Day 7
Post by: Zerker on November 20, 2012, 06:23:00 PM
Hello and welcome back. Today we will be looking at the rest of the map format. We're looking for two major things to include in our map:
1) some sort of header information that will hopefully give us more information on background colours
2) Monsters and Pickups!
Remember the garbage at the bottom of this image?
(http://www.zerker.ca/misc/xargon/day1_3.png)
Well, let's try to figure out what it means. There's obviously a repeating pattern here, but it's a bit skewed because we were decoding two bytes at a time. From the image, it looks about 15-16 pixels, or probably 31 bytes in length. Let's see if we can find the bounds of this record in a hex editor. The map is 128*64*2 bytes long, so we should start at offset 0x4000.
(http://www.zerker.ca/misc/xargon/day7_1.png)
Looks about right. But now we need to find the bounds of this region, and to figure out what comes before and after it. Let's start at the end of the file instead.
(http://www.zerker.ca/misc/xargon/day7_2.png)
Well, that's very clearly delineated. There is a number followed by a string then the next string, etc. The number appears to be the string length. The previous section also has a clear empty buffer region between, so I'm going to assume that the last record ends with a non-zero number. If I then grab the last record, it looks like:
F0 02 00 00 00 00 10 00 0C 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 01 00 05
That seems like a fairly likely record alignment. The first two characters correspond to a 16 number of 752, which is a reasonable decoding. The F0 is at offset 0x4A8E, so let's keep going back in intervals of 31 until we reach a reasonable first record. (0x4000 - 0x4A8E) / 0x57.29, so it looks like we have approximately 0x57 (87) records here. My first guess places the start of these records at address 0x4005.
Lining up the first few records:
Code: [Select]
80 00 00 00 00 00 18 00 28 00 04 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 11 20 00
90 00 00 00 00 00 10 00 10 00 01 00 00 00 00 00 01 00 00 00 04 00 A6 48 00 00 00 00 3E D0 02
E0 00 00 00 00 00 10 00 10 00 00 00 00 00 00 00 01 00 00 00 00 00 00 00 00 00 00 00 3D D0 02
F0 00 00 00 00 00 10 00 10 00 00 00 00 00 00 00 02 00 00 00 00 00 00 00 00 00 00 00 3D 80 06
00 03 00 00 00 00 10 00 10 00 00 00 00 00 00 00 01 00 00 00 00 00 00 00 00 00 00 00 3E 80 06
F0 02 00 00 00 00 10 00 10 00 00 00 00 00 00 00 02 00 00 00 00 00 00 00 00 00 00 00 3F 20 00
Looks right to me. That means we have 5 unique bytes:
58 00 00 20 00
0x58 = 88, which appears to be the number of records we have. That leaves us with 0x20 (i.e. 32). Let's look at the headers for a couple different stages set together:
Code: [Select]
58 00 00 20 00
58 00 00 20 00
6C 00 00 30 00
AD 00 00 B0 03
B6 00 00 30 00
85 00 00 B0 01
A1 00 00 90 00
B6 00 00 E0 01
9A 00 00 40 07
A1 00 00 90 00
B5 00 00 80 00
2E 00 00 30 07
70 00 00 30 02
Well, I can't figure out a correlation right now, but I think this is a 16 bit number.
Let's assign bit decoding characters for the repeating record. I'm going to grab a few more examples just to get a clearer picture. This may be incorrect, but we need to start with something:
Code: [Select]
H H H H H H H H H H H B B H H B H
80 00 00 00 00 00 18 00 28 00 04 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 11 20 00
90 00 00 00 00 00 10 00 10 00 01 00 00 00 00 00 01 00 00 00 04 00 A6 48 00 00 00 00 3E D0 02
E0 00 00 00 00 00 10 00 10 00 00 00 00 00 00 00 01 00 00 00 00 00 00 00 00 00 00 00 3D D0 02
F0 00 00 00 00 00 10 00 10 00 00 00 00 00 00 00 02 00 00 00 00 00 00 00 00 00 00 00 3D 80 06
00 03 00 00 00 00 10 00 10 00 00 00 00 00 00 00 01 00 00 00 00 00 00 00 00 00 00 00 3E 80 06
F0 02 00 00 00 00 10 00 10 00 00 00 00 00 00 00 02 00 00 00 00 00 00 00 00 00 00 00 3F 20 00
A0 00 01 00 00 00 00 00 00 00 03 00 00 00 00 00 01 00 00 00 00 00 00 00 00 00 00 00 48 90 07
B0 00 00 00 00 00 10 00 10 00 04 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 11 A0 07
B0 00 00 00 00 00 10 00 10 00 00 00 00 00 00 00 00 00 00 00 04 00 A5 48 00 00 00 00 48 A0 07
B0 00 00 00 00 00 10 00 10 00 04 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 21 40 07
A0 01 00 00 00 00 10 00 10 00 02 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 21 50 07
90 01 00 00 00 00 10 00 10 00 02 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 21 60 07
Or, condensed, '<11H2B2HBH'. Time to update our map script to decode this information and write it out to a debug CSV so we can hopefully figure something useful out of it (like an object ID and coordinates).
Code: [Select]
class xargonmap(object):
def __init__(self, filename):
# Grab the map from the file name (sans ext)
(temppath, tempfname) = os.path.split(filename)
(self.name, tempext) = os.path.splitext(tempfname)
# Load the map data as a 64*128 array of 16 bit values:
mapfile = open(filename, 'rb')
pattern = '<{}H'.format(64*128)
self.tiles = struct.unpack(pattern,
mapfile.read(struct.calcsize(pattern)) )
# Decode the object header then the object list
objheader = '<HBH'
objrecord = '<11H2B2HBH'
(numobjs, blank, self.unknown) = struct.unpack(objheader,
mapfile.read(struct.calcsize(objheader)) )
self.objs = [struct.unpack(objrecord,
mapfile.read(struct.calcsize(objrecord)) )
for i in range(numobjs)]
# There always appears to be a 0x5E spacer region
mapfile.read(0x5E)
# Capture any strings until the end of the file
self.strings = []
sizebytes = mapfile.read(2)
while (len(sizebytes) == 2):
(stringlen,) = struct.unpack('<H', sizebytes)
self.strings.append(mapfile.read(stringlen))
mapfile.read(1)
sizebytes = mapfile.read(2)
mapfile.close()
def debugcsv(self):
# Remember that the map is height-first. We need to convert to
# width-first. This only outputs tile data for now.
with open(self.name + '.csv', 'wb') as csvfile:
writer = csv.writer(csvfile)
for y in range(64):
writer.writerow([self.tiles[x*64+y] for x in range(128)])
# Next, output the object list:
with open(self.name + '_objs.csv', 'wb') as csvfile:
writer = csv.writer(csvfile)
writer.writerows(self.objs)
# Finally, the header and strings list:
with open(self.name + '_info.csv', 'wb') as csvfile:
writer = csv.writer(csvfile)
writer.writerow([self.unknown] + self.strings)
And a subset of the object csv output:
Code: [Select]
176 0 0 16 16 4 0 0 0 0 0 0 0 0 0 17 1952
176 0 0 16 16 0 0 0 0 0 4 165 72 0 0 72 1952
176 0 0 16 16 4 0 0 0 0 0 0 0 0 0 33 1856
416 0 0 16 16 2 0 0 0 0 0 0 0 0 0 33 1872
400 0 0 16 16 2 0 0 0 0 0 0 0 0 0 33 1888
400 0 0 16 16 2 0 0 0 0 0 0 0 0 0 33 1904
416 0 0 16 16 2 0 0 0 0 0 0 0 0 0 21 1936
240 0 0 16 16 0 0 0 0 0 0 0 0 0 0 7 1584
788 9 65535 184 8 0 0 0 0 0 4 55 68 0 0 22 1584
752 0 0 16 12 0 0 0 0 0 0 0 0 0 0 22 1600
736 0 0 16 12 0 0 0 0 0 0 0 0 0 0 22 1600
704 0 0 16 12 0 0 0 0 0 0 0 0 0 0 22 1584
720 0 0 16 12 0 0 0 0 0 0 0 0 0 0 22 1744
704 0 0 16 12 0 0 0 0 0 0 0 0 0 0 22 1760
720 0 0 16 12 0 0 0 0 0 0 0 0 0 0 22 1744
736 0 0 16 12 0 0 0 0 0 0 0 0 0 0 22 1760
752 0 0 16 12 0 0 0 0 0 0 0 0 0 0 21 1440
464 0 0 16 16 0 0 0 0 0 0 0 0 0 0 72 1936
160 0 0 32 16 11 0 0 0 0 0 0 0 0 0 51 160
128 1 0 80 16 0 0 0 0 0 0 0 0 0 0 51 1824
Well, whatever is in that 65535's column, it is probably signed. However, it's unlikely that data will be relevant for us (since it's normally zero). We need to pick out likely coordinate and item ID columns. The easiest way to do this is to locate a known object (or pattern of objects) in the game world and try to find their representation.
This classic screenshot provides some useful objects. All of the same type in close proximity:
(http://www.zerker.ca/misc/xargon/day2_1.png)
Opening up the pixelmap image in GIMP, drawing in the item locations, then checking their coordinates results in the following zero-based indicies:
(3, 11) (3, 12) (2, 13) (4, 13)
1-based:
(4, 12) (4, 13) (3, 14) (5, 14)
And I'm coming up pretty empty. I'm not even sure what could look like coordinates or an index in the data I have. Nothing is obviously a coordinate system, and a direct index would require a number between 0 and 8192, and nothing goes anywhere near this value. But I have a strange idea that the indicies could possibly be given in absolute pixel coordinates. Let's divide the first and last columns by 16 and see if we see any patterns.
And.... (drum roll):
Code: [Select]
176 0 0 16 16 0 0 0 0 0 0 0 0 0 0 33 32 | 11 2
208 0 0 16 16 5 0 0 0 0 0 0 0 0 0 33 48 | 13 3
176 0 0 16 16 5 0 0 0 0 0 0 0 0 0 33 64 | 11 4
208 0 0 16 16 5 0 0 0 0 0 0 0 0 0 33 48 | 13 3
Hrm, not a perfect match, but close. Also, every entry appears to be within the bounds for a 64 x 128 map, and appears sane. I'm not going to implement today, but I have a theoretical decoding. I will number the columns below:
Code: [Select]
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
176 0 0 16 16 0 0 0 0 0 0 0 0 0 0 33 32 | 11 2
208 0 0 16 16 5 0 0 0 0 0 0 0 0 0 33 48 | 13 3
176 0 0 16 16 5 0 0 0 0 0 0 0 0 0 33 64 | 11 4
208 0 0 16 16 5 0 0 0 0 0 0 0 0 0 33 48 | 13 3
Column 1: Y coordinate * 16
Column 17: X coordinate * 16
Columns 4 and 5: Nominal sprite dimensions
Column 16: Sprite type
And a few tenative identifications:
17 : Player Start
25: Wandering Monster thing
33 : Lolly Pop pickup
The nominal sprite dimensions entry I guessed because I noticed the coordinates 2, 8 would put something pretty close to the start of the level and the dimensions were 24, 40 (same as the player sprite). Also, the first-level monster sprite dimensions are 38, 25, which shows up several times in this file.
day7.zip (http://www.zerker.ca/misc/xargon/day7.zip) is available for anyone who wants it.
Title: Re: PC Game Hacking and Mapping Tutorial: Xargon
Post by: Zerker on November 21, 2012, 06:02:06 PM
Looking at the decoding from yesterday again, I think I misaligned the record start after all. I think the 20 00 at the start of the record area is actually the X coordinate for the first record. That means that the trailing number of 05 is its own thing. Let's move that around and see if that fixes our "almost correct" alignment for the pickups at the start. Remember, we expected either
0-based:
(3, 11) (3, 12) (2, 13) (4, 13)
or 1-based:
(4, 12) (4, 13) (3, 14) (5, 14)
And we get:
Code: [Select]
32 208 0 0 16 16 5 0 0 0 0 0 0 0 0 0 33 2 13
48 176 0 0 16 16 5 0 0 0 0 0 0 0 0 0 33 3 11
64 208 0 0 16 16 5 0 0 0 0 0 0 0 0 0 33 4 13
48 192 0 0 16 16 5 0 0 0 0 0 0 0 0 0 59 3 12
Coordinates match up, but the item ID is off for the last one. Looks like we are off by TWO fields. Let's fix that again and get:
Code: [Select]
33 32 208 0 0 16 16 5 0 0 0 0 0 0 0 0 0 2 13
33 48 176 0 0 16 16 5 0 0 0 0 0 0 0 0 0 3 11
33 64 208 0 0 16 16 5 0 0 0 0 0 0 0 0 0 4 13
33 48 192 0 0 16 16 5 0 0 0 0 0 0 0 0 0 3 12
I also switched the half-words to signed due to the strange 65535 entries. Nothing appears to "normally" approach the 16 bit boundary, so this should be safe. I also changed how I skip/capture the apparently unused map region. Hopefully I can find a pattern for the maps with different background colours, when I get there. Here's the updated code:
Code: [Select]
# Decode the object header then the object list
objrecord = '<B12h2B2H'
(numobjs,) = struct.unpack('<H', mapfile.read(2) )
self.objs = [struct.unpack(objrecord,
mapfile.read(struct.calcsize(objrecord)) )
for i in range(numobjs)]
# There always appears to be a 0x61 byte unknown region between
# the records and strings. Let's just collect it as bytes for now.
unknownregion = '<97B'
self.unknown = struct.unpack(unknownregion,
mapfile.read(struct.calcsize(unknownregion)) )
Okay, now we think we have a reasonable decoding, and a few sample mappings (corrected due to the misalignment):
0 - Player start
33 - Lolly Pop
25 - Monster
Unfortunately, pickup/monster/object sprites are typically defined in code due the additional logic that is typically needed. It's unlikely we will find a direct mapping like we did for the Tiles. That said, there usually isn't an overwhelming number of interactable objects in a game, so we should be able to identify them as-we-go. We know there aren't more than 256 of them, after all. In order to track the mappings, we should start a new Python file for the sprite database. This will contain a lookup table for record entries, and a method to grab the correct sprite for a given sprite ID. We will also re-use the debug code from unknown tiles to provide placeholders for unknown sprites.
Finally, we need to make a decision on how sprites get drawn into the world. There are two options: have the mapper handle everything and add additional logic there, or defer processing to the sprite file, and pass in a reference to the map-in-progress. I'm going to choose the later, because it helps keep all the sprite processing in one place. Here's the first cut at the sprite file:
Code: [Select]
lookup = { 0: (6, 9),
25: (35, 2),
33: (37, 5)
}
def drawsprite(mappicture, graphics, spriterecord):
(spriteid, x, y) = spriterecord[0:3]
(width, height) = spriterecord[5:7]
if spriteid in lookup:
(recnum, imagenum) = lookup[spriteid]
spriteimage = graphics.records[recnum].images[imagenum]
else:
spriteimage = graphics.unknown[spriteid]
# When pasting masked images, need to specify the mask for the paste.
# RGBA images can be used as their own masks.
mappicture.paste(spriteimage, (x, y), spriteimage)
And the addition to the mapper:
Code: [Select]
for objrecord in mapdata.objs:
spritedb.drawsprite(self.mappicture, graphics, objrecord)
(http://www.zerker.ca/misc/xargon/day8_1.png)
Looking good. A couple things to note that we will need to take care of:
1) There are some objects that appear functional but not visual in nature (object IDs 17 and 63). We could provide markup to indicate what we think they mean, but I think a better approach would be to simply not draw anything.
2) The player start appears slightly in the ground. We will either need to figure out an alignment algorithm to correct this sort of thing, or make a special case for the player sprite.
3) The sprites have Dimensions. We should take this into account for our debug images to make them easier to identify by shape as well as location.
To make this sort of thing easier, I'm going to expand our spritedb file into an actual class which will keep a copy of the corresponding sprite images. This way it can generate debug images on-the-fly when a sprite is not found, and we can make specific entries for empty sprites. To consolidate functionality, I made the debug image function return empty sprites if called with 0 width and height.
Code: [Select]
class spritedb(object):
def __init__(self, graphics):
self.sprites = {}
# Simple sprite mapping:
for (spriteid, recnum, imagenum) in [(0, 6, 9), (25, 35, 2),
(33, 37, 5)]:
self.sprites[spriteid] = graphics.records[recnum].images[imagenum]
# Empty sprites:
# For future reference, possible meanings are:
# 17: Respawn point
# 63: Start??
for spriteid in [17, 63]:
self.sprites[spriteid] = graphics.debugimage(spriteid, 0, 0)
# Cache a reference to the graphics object for future use
self.graphics = graphics
def drawsprite(self, mappicture, spriterecord):
(spriteid, x, y) = spriterecord[0:3]
(width, height) = spriterecord[5:7]
if spriteid not in self.sprites:
self.sprites[spriteid] = self.graphics.debugimage(spriteid, width, height)
# When pasting masked images, need to specify the mask for the paste.
# RGBA images can be used as their own masks.
mappicture.paste(self.sprites[spriteid], (x, y), self.sprites[spriteid])
Updated debug image function:
Code: [Select]
def debugimage(index, width, height):
""" Creates a debug image for sprites """
if width > 0 and height > 0:
colour = (index, index, index)
tempimage = Image.new("RGBA", (width, height), colour)
textcolor = (255, 255, 255) if index < 96 else (0, 0, 0)
pen = ImageDraw.Draw(tempimage)
pen.text((width/2 - 7, height/2 - 6), '{:02}'.format(index),
font=imagefile.debugfont, fill=textcolor)
return tempimage
else:
# 1 pixel transparent image
return Image.new("RGBA", (width, height))
(http://www.zerker.ca/misc/xargon/day8_2.png)
And now, we get to identifying. Time to fire up DosBox. Those 51 sprites look like movable clouds, so I'll go find their sprite first. Once I get in-game, I'm going to go ahead and start identifying world map sprites too.
Hrm, it actually looks like the map goes by different sprite IDs!
(http://www.zerker.ca/misc/xargon/day8_3.png)
That's fine, we can maintain two lookups. I'm going to go ahead and split it, then identify a few sprites. Then again, that doesn't look to be enough info. For instance, the 88 sprites on the map screen appear to be mountains, but mountains have two sides. I think there is some sort of sub-ID going on here. And I think I found it:
Code: [Select]
88 288 112 0 0 48 53 2 0 0 0 0 0 0 0 0 0
88 336 112 0 0 48 53 3 0 0 0 0 0 0 0 0 0
88 1232 592 0 0 48 53 6 0 0 0 0 0 0 0 0 0
88 768 112 0 0 48 53 2 0 0 0 0 0 0 0 0 0
88 816 112 0 0 48 53 3 0 0 0 0 0 0 0 0 0
88 976 176 0 0 48 53 0 0 0 0 0 0 0 0 0 0
88 1024 176 0 0 48 53 1 0 0 0 0 0 0 0 0 0
I think it's that column that counts 2, 3, 6, 2, 3, 0, 1. Next I'm going to need to expand the sprite identification to take that into account. But that's a task for tomorrow. I'll also need to figure out some way to clearly indicate the sub ID in the debug image. I may need to move back to 8 point font :)
day8.zip (http://www.zerker.ca/misc/xargon/day8.zip) is available for anyone who wants it.
Title: Day 9
Post by: Zerker on November 22, 2012, 06:27:28 PM
Hello folks. Let's get things restructured to allow item varients. I'm also going to introduce two new classes to make things more flexable: an object record class so I don't need to manually specify decoding every time, and a sprite class. The sprite class will be used to allow custom handling for certain sprites, like the player sprite (which needs an offset).
The objrecord class gets added to the xargonmap file:
Code: [Select]
class objrecord(object):
def __init__(self, record):
self.rawdata = record
(self.sprtype, self.x, self.y) = record[0:3]
(self.width, self.height, self.subtype) = record[5:8]
With minor changes to init and debug output methods to compensate.
Next we need to update our sprite db and graphics file (i.e. debug image) to support the two identifiers. Let's do the debug image first. Note that I'm changing this to draw a slightly larger image if needed, and make the image rectangle semi-transparent. I also stopped bothering to pick different shades of gray.
Code: [Select]
@staticmethod
def debugimage(index, subindex, width, height):
""" Creates a debug image for sprites """
if width > 0 and height > 0:
# Provide sufficient space to display text
imgwidth = max(width, 32)
imgheight = max(height, 16)
tempimage = Image.new("RGBA", (imgwidth, imgheight))
pen = ImageDraw.Draw(tempimage)
pen.rectangle(((0, 0), (width, height)), fill=(64, 64, 64, 128))
pen.text((imgwidth/2 - 15, imgheight/2 - 6), '{}:{}'.format(index,subindex),
font=imagefile.debugfont, fill=(255,255,255))
return tempimage
else:
# 1 pixel transparent image
return Image.new("RGBA", (width, height))
And the spritedb changes for both the two identifiers, and the dedicated sprite class. I also get rid of the two record structures, since that appears to be (another) misinterpretation.
Code: [Select]
class spritedb(object):
def addsprite(self, sprtype, subtype, sprite):
if sprtype not in self.sprites:
self.sprites[sprtype] = {}
self.sprites[sprtype][subtype] = sprite
def __init__(self, graphics):
self.sprites = {}
self.mapsprites = {}
# Manually-defined sprites (i.e. special handling needed
self.addsprite(0, 4, sprite(graphics.records[6].images[9], yoffs=-8))
# Simple sprite mapping. Stage sprites, then Map sprites
for (sprtype, subtype, recnum, imagenum) in [(25, 0, 35, 2), # Monsters
(33, 5, 37, 5), # Pickups
(51, 0, 36, 33), # Clouds
(5, 0, 47, 8)]: # Map Player
self.addsprite(sprtype, subtype, sprite(graphics.records[recnum].images[imagenum]))
# Empty sprites:
# For future reference, possible meanings are:
# 17-1: Respawn point
# 63-3: Start??
for sprtype, subtype in [(17,1), (63,3), (19,0)]:
self.addsprite(sprtype, subtype, sprite(graphics.debugimage(sprtype, subtype, 0, 0)))
# Cache a reference to the graphics object for future use
self.graphics = graphics
def drawsprite(self, mappicture, objrec):
if objrec.sprtype not in self.sprites or \
objrec.subtype not in self.sprites[objrec.sprtype]:
self.addsprite(objrec.sprtype, objrec.subtype, sprite(
self.graphics.debugimage(objrec.sprtype, objrec.subtype,
objrec.width, objrec.height)))
self.sprites[objrec.sprtype][objrec.subtype].draw(mappicture, objrec)
class sprite(object):
def __init__(self, image, xoffs=0, yoffs=0):
self.image = image
self.xoffs = xoffs
self.yoffs = yoffs
def draw(self, mappicture, objrec):
# When pasting masked images, need to specify the mask for the paste.
# RGBA images can be used as their own masks.
mappicture.paste(self.image, (objrec.x +self.xoffs,
objrec.y +self.yoffs), self.image)
(http://www.zerker.ca/misc/xargon/day9_1.png)
Excellant. Now it's time to ACTUALLY get decoding things, since we won't end up with overlapping definitions any more. Things a pretty straightforward at this point. Here's the properly identified first section of the map:
(http://www.zerker.ca/misc/xargon/day9_2.png)
And a bit further into level 1:
(http://www.zerker.ca/misc/xargon/day9_3.png)
But it looks like our interior room has a special sprite for the in-game text.
(http://www.zerker.ca/misc/xargon/day9_4.png)
That's going to require something special to implement. Also, we're going to want to indicate what is INSIDE a present, since we can decode that information. That too, will require special handling. With the architecture we have now, we can simply set up subclasses of the sprite class to draw more complicated information. Unfortunately, we're out of time for today, so that will have to be tomorrow.
day9.zip (http://www.zerker.ca/misc/xargon/day9.zip) is available.
Title: Day 10
Post by: Zerker on November 23, 2012, 06:20:24 PM
Good evening. Time to tackle the two enhancements we wanted yesterday. Enhancement #1 is for present contents. For these I'm just going to expand the capabilities of the basic sprite class and not even make a separate class. I will simply add an optional parameter for the content sprite. When drawing the sprite, if contents are assigned, they will be drawn immediately above the sprite itself.
Code: [Select]
class sprite(object):
def __init__(self, image, xoffs=0, yoffs=0, contents=None):
self.image = image
self.xoffs = xoffs
self.yoffs = yoffs
self.contents = contents
def draw(self, mappicture, objrec):
# When pasting masked images, need to specify the mask for the paste.
# RGBA images can be used as their own masks.
mappicture.paste(self.image, (objrec.x +self.xoffs,
objrec.y +self.yoffs), self.image)
if contents != None:
# Place contents immediately above the current sprite
mappicture.paste(self.contents, (objrec.x +self.xoffs,
objrec.y +self.yoffs - self.contents.size[1]), self.contents)
And minor changes to the database:
Code: [Select]
# Presents have contents:
for (sprtype, subtype, recnum, imagenum, crecnum, cimagenum) in [
(26, 2, 37, 27, 37, 6), # Treasure (Cherry)
(26, 0, 37, 27, 37, 33) # Treasure (Health)
]:
self.addsprite(sprtype, subtype, sprite(graphics.records[recnum].images[imagenum],
contents=graphics.records[crecnum].images[cimagenum]))
(http://www.zerker.ca/misc/xargon/day10_1.png)
That was easy. Now for text. There are two approaches we can use for text:
1) Use the raw text images we have to reproduce the in-game text
2) Find a close match and just go with it
That said, what we got directly out of the reference file appears a bit strange and would need some post-processing to get it to appear correct. The second option is certainly simpler, and I will go with that for now. As long as I can find a fixed-width font with reasonably similar weight and size, it should be pretty equivalent. For reference, here is the direct font data from the GRAPHICS file:
(http://www.zerker.ca/misc/xargon/day10_2.png)
Stage 1 is easy, but we need to figure out the general solution for picking the correct text string. For that, we will refer to stages 3 and 33 (aka the ending).
Let me include the records for object 7 from each stage together below (stage # is the first column). I will also number the columns from the original file as a zero-based index along top.
Code: [Select]
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
1 7 1584 788 9 -1 184 8 0 0 0 0 0 4 55 68 0 0
3 7 1824 560 6 -1 112 8 0 0 0 0 0 4 95 72 0 0
3 7 1856 576 6 -1 32 8 0 0 0 0 0 4 94 72 0 0
33 7 1104 36 7 -1 160 8 0 0 0 0 0 4 71 72 0 0
33 7 1440 36 7 -1 160 8 0 0 0 0 0 4 69 72 0 0
33 7 1120 130 7 -1 120 8 0 0 0 0 0 4 55 72 0 0
33 7 1456 130 7 -1 120 8 0 0 0 0 0 4 44 72 0 0
33 7 112 484 7 -1 136 8 0 0 0 0 0 4 31 72 0 0
33 7 112 578 7 -1 120 8 0 0 0 0 0 4 25 72 0 0
33 7 144 708 7 -1 56 8 0 0 0 0 0 4 24 72 0 0
33 7 80 48 6 -1 176 8 0 0 0 0 0 4 5 72 0 0
33 7 112 64 6 -1 112 8 0 0 0 0 0 4 3 72 0 0
33 7 112 96 7 -1 112 8 0 0 0 0 0 4 1 72 0 0
33 7 512 820 8 -1 120 8 0 0 0 0 0 4 250 71 0 0
We've already identified indices 0 to 2 and 5 - 7, although the obvious choice of the subtype does not appear to be used to select the specific string to be displayed. The only one that appears different for each string is column 13, but that doesn't make much sense on its own. That said, I think column 3 might be the colour index, of the first 16 colours in the palette. 9 is blue, 7 is white, 6 is yellow, 8 is dark gray.
Hrm, giving it a bit more of a look, it's possible that it might be part of a 16-bit number. The wrap around from 1 72 to 250 71 seems to imply that. Let me fix my decoding and try again. Here are just the numbers, (+ some in hex)
Code: [Select]
1 17463 0x4437
3 18527 0x485F
3 18526 0x485E
33 18503
33 18501
33 18487
33 18476
33 18463
33 18457
33 18456
33 18437
33 18435
33 18433
33 18426
I don't get it. I'm just going to have to hack something together. The ONLY pattern I think I can figure out is that these numbers are decreasing compared to the order of the strings. I also noticed that apparently object #17 also uses strings, as does object 6. Object 17 appears to be for internal use, so I won't actually draw those, but object 6 appears to be another string region (different font maybe?). Either way, here's what my hacked up approach will be:
1) Look for all numbers in this column, and collect them in a list in descending order.
2) When I have a string to grab, I will pull the string that corresponds to the order within the strings array corresponding to this number.
That should work for maps 1 and 3, but I have no idea how well it will sort itself out for map 33. At least it will get us un-stuck for now. First, let's add the new fields to the record:
Code: [Select]
class objrecord(object):
def __init__(self, record):
self.rawdata = record
(self.sprtype, self.x, self.y, self.colour) = record[0:4]
(self.width, self.height, self.subtype) = record[5:8]
self.stringref = record[13]
Now, let's get that lookup table implemented:
Code: [Select]
# String reference lookup table. This is a bit of a hack for now.
# Sort all known string references in reverse order:
self.stringlookup = [record.stringref for record in self.objs if record.stringref > 0]
self.stringlookup.sort(reverse=True)
And a lookup method to get the correct string:
Code: [Select]
def getstring(self, stringref):
strindex = self.stringlookup.index(stringref)
return self.strings[strindex]
To get the right text colour, I will need a palette lookup method for the graphics object:
Code: [Select]
def getcolour(self, index):
return tuple(self.palette[index*3:index*3+3])
To be able to do the text lookup, I need to pass a reference to the map into my sprite draw routine. Then I need to actually write the text sprite class to take advantage of all this new infrastructure. For the font, I'll just go with DroidSansMono for now. I'll pick 10 point font for object 7 and 8 point font for object 6. Here's how the text sprite class ended up:
Code: [Select]
class textsprite(sprite):
def __init__(self, font, graphics):
self.font = font
self.graphics = graphics
def draw(self, mappicture, objrec, mapdata):
pen = ImageDraw.Draw(mappicture)
pen.text((objrec.x, objrec.y), mapdata.getstring(objrec.stringref),
font=self.font, fill=self.graphics.getcolour(objrec.colour))
More importantly, it works!
(http://www.zerker.ca/misc/xargon/day10_3.png)
And even works for Board 33!
(http://www.zerker.ca/misc/xargon/day10_4.png)
But the font is a bit too thin. Let me see if I can find a monospaced font that has a dedicated bold version. I'll also tweak the alignment a bit.
Here's FreeMonoBold, with a bit larger size. It'll do for a while. It's not that great, so I think we will want to get some handling for the ingame font. But that can wait now that we have the actual text display working nicely.
(http://www.zerker.ca/misc/xargon/day10_5.png)
Now on to identifying items. Stage 1 is done, so stage 2 is next.
But it looks like we hit a snag on level 2. There is a centipede monster in this stage, which is stored as a series of segments in the graphics file, so we can't just draw a single sprite. We need a method for creating a compound image to draw him properly. Also, sprite 73 appears to be a hidden pickup. We will want to indicate these some way (i.e. by making them semi-transparent, probably). I will tackle all this tomorrow. Both cases should be just a matter of pre-processing the images before creating the corresponding sprite object and shouldn't require their own types of sprites.
day10.zip (http://www.zerker.ca/misc/xargon/day10.zip) is available.
Title: Day 11
Post by: Zerker on November 24, 2012, 01:31:56 PM
Today I'm going to handle the slightly more complicated sprites we want to handle. First, here's a screenshot of the centipede monster we want to re-create from the individual segment sprites:
(http://www.zerker.ca/misc/xargon/day11_1.png)
I count a head, six segments, then a tail. The map data tells me that the bounding box is 76 x 22, although the actual sprite dimensions vary from 16x20 (head) to 8x17 (segment) to 12x8 (tail). However, each segment appears to connect directly to the next with no padding on the sprite image itself, so that will make things easy. Adding up the required widths adds up to exactly 76, so there's some additional confirmation. Let's make up a method for making a composite sprite. I'm adding this to the graphics file, since it owns the original images. It could have also been added to the spritedb file, but it would need a copy of the graphics file, so that seems somewhat silly.
Code: [Select]
def compositeimage(self, dimensions, imgrequests):
tempimage = Image.new("RGBA", dimensions)
for (x, y, recnum, imgnum) in imgrequests:
pasteimage = self.records[recnum].images[imgnum]
tempimage.paste(pasteimage, (x, y), pasteimage)
return tempimage
Code: [Select]
self.addsprite(52, 7, sprite(graphics.compositeimage((76, 22), [(0, 0, 52, 0),
(16, 5, 52, 1), (24, 5, 52, 2), (32, 5, 52, 3), (40, 5, 52, 4),
(48, 5, 52, 5), (56, 5, 52, 6), (64, 7, 52, 7)] )))
And that worked out well enough:
(http://www.zerker.ca/misc/xargon/day11_2.png)
On to transparency. Again, I'll add this to the graphics file, although it does not really need to go there. It's going to be a static method that simply takes the image to make transparent and the desired alpha value. We're simply going to use the multiply channel operation to perform this:
Code: [Select]
@staticmethod
def semitransparent(inimage, alpha):
alphaimage = Image.new("RGBA", inimage.size, (255, 255, 255, alpha))
return ImageChops.multiply(inimage, alphaimage)
And expanding our pickup population loop:
Code: [Select]
# Pickups appear to be in the same order as their corresponding record.
# There are two types of pickups: normal and hidden.
for subtype in range(24):
self.addsprite(33, subtype, sprite(graphics.records[37].images[subtype]))
self.addsprite(73, subtype, sprite(graphics.semitransparent(
graphics.records[37].images[subtype], 128) ))
Looking good:
(http://www.zerker.ca/misc/xargon/day11_3.png)
Stage 2 is done now. On to stage 3.
Well now. Stage 3 had a black background (that sometimes flashes with lightning). That is a far cry from the blue the map generates for it. Taking a look at the colour palette of the screenshot, and it is indeed different. Board 6 and 7 also look like they should have black backgrounds. However, looking at the map data doesn't seem to imply anything different between those maps and the maps with blue backgrounds. I think I'm just going to have to by the map number for this.
Oh yeah, and re-architect my graphics and sprite routines to allow switching palettes. Piece of cake, right?
Also, we have another problem in stage 3:
(http://www.zerker.ca/misc/xargon/day11_4.png)
Alternate present boxes! Back to the object csv:
Code: [Select]
26 864 800 0 0 16 16 0 0 0 2 0 0 0 0 0
26 560 784 1 0 16 16 2 0 0 3 0 0 0 0 0
26 608 768 1 0 16 16 1 0 0 3 0 0 0 0 0
26 496 720 1 0 16 16 2 0 0 3 0 0 0 0 0
26 528 736 1 0 16 16 2 0 0 3 0 0 0 0 0
26 128 112 0 0 16 16 13 0 0 4 0 0 0 0 0
26 112 128 0 0 16 16 11 0 0 4 0 0 0 0 0
26 144 112 0 0 16 16 11 0 0 4 0 0 0 0 0
26 160 96 0 0 16 16 11 0 0 4 0 0 0 0 0
26 176 128 0 0 16 16 11 0 0 4 0 0 0 0 0
26 192 112 0 0 16 16 13 0 0 4 0 0 0 0 0
26 864 272 0 -1 16 16 0 0 0 0 0 0 0 0 0
26 1936 144 0 -1 16 16 0 0 0 0 0 0 0 0 0
26 1824 896 0 -1 16 16 11 0 0 0 0 0 0 0 0
26 1472 896 1 -1 16 16 2 0 0 0 0 0 0 0 0
26 1856 528 0 -1 16 16 11 0 0 0 0 0 0 0 0
26 1376 608 1 0 16 16 2 0 0 5 0 0 0 0 0
26 1328 624 1 0 16 16 13 0 0 5 0 0 0 0 0
26 1280 608 1 0 16 16 13 0 0 5 0 0 0 0 0
26 1264 624 1 0 16 16 2 0 0 5 0 0 0 0 0
26 1168 624 1 0 16 16 2 0 0 5 0 0 0 0 0
26 1040 736 1 0 16 16 2 0 0 5 0 0 0 0 0
26 1936 992 0 -1 16 16 0 0 0 0 0 0 0 0 0
26 272 944 0 -1 16 16 0 0 0 0 0 0 0 0 0
26 1312 992 1 -1 16 16 4 0 0 0 0 0 0 0 0
26 704 816 1 0 16 16 12 0 0 3 0 0 0 0 0
I'm going to guess it's that column that goes 2, 3, 4, 0, 5, 3. To avoid totally re-architecting my sprite algorithm for ONE special case, I'm going to create a new type of sprite for treasure boxes. And yank the contents handling from the normal sprite class, since it doesn't get used in any other context.
Code: [Select]
class treasuresprite(sprite):
def __init__(self, graphics, contents):
# Create a lookup of possible boxes
self.types = {0 : graphics.records[37].images[25],
1 : graphics.debugimage('T', 1, 16, 16),
2 : graphics.debugimage('T', 2, 16, 16),
3 : graphics.records[37].images[27],
4 : graphics.debugimage('T', 4, 16, 16),
5 : graphics.debugimage('T', 5, 16, 16)
}
self.xoffs = 0
self.yoffs = 0
self.contents = contents
def draw(self, mappicture, objrec, mapdata):
# Pick the correct image then use the parent routine to draw the box
self.image = self.types[objrec.info]
super(treasuresprite, self).draw(mappicture, objrec, mapdata)
# Place contents immediately above the current sprite
mappicture.paste(self.contents, (objrec.x +self.xoffs,
objrec.y +self.yoffs - self.contents.size[1]), self.contents)
Well, that works and all, but it misidentifies several treasure boxes. Hrm, comparing map 1 to this map, it appears that map 1 always uses '3' in the 'colour' field, while this map uses 0 and 1. Let's assume it's the colour field instead and re-do this.
(http://www.zerker.ca/misc/xargon/day11_5.png)
Fixed that. Next is the palette thing. To do this, we need to defer the masking operation in the graphics file. We should store the images in index format initially, then create the masked version on-demand. Since we already have other functions directly referencing graphics.records[n].images[m], we should store the raw data in a different location:
Code: [Select]
tile = Image.fromstring("P", (width, height),
self.filedata.read(width*height))
tile.putpalette(palette)
self.origimages.append(tile)
self.images.append(self.maskimage(tile))
Then we need a method of switching palettes:
Code: [Select]
def changepalette(self, palette):
for imagepos, image in enumerate(self.origimages):
image.putpalette(palette)
self.images[imagepos] = self.maskimage(image)
Finally, some control at the graphics file level to switch between a choice of palettes. I will also add a check to save time by not switching to the same palette if it is already loaded:
Code: [Select]
def changepalette(self, palnum):
if self.activepal != palnum:
self.activepal = palnum
for record in self.records:
record.changepalette(self.palette[self.activepal])
And don't forget the getcolour method:
Code: [Select]
def getcolour(self, index):
return tuple(self.palette[self.activepal][index*3:index*3+3])
Then we just need to change palettes for each map. We could go by the map name, but I noticed the first byte in the "unknown" region of the map data appears to be the map number. I'm going to go by that.
Code: [Select]
if mapdata.mapnum in [3, 6, 7, 10]:
graphics.changepalette(1)
else:
graphics.changepalette(0)
sprites = spritedb(graphics)
And it works as expected. Now we don't have the garish blue background in the dark levels. Time to continue identifying sprites in level 3.
Well, I ran into another interesting thing. Sprite 12 can sometimes be visible! We need to determine what decides this and adjust accordingly. Checking the object CSV, it looks like it has a 1 in what I called the "colour" column. Looks like I should expand my treasure box sprite into something that can also handle other similar variable sprites. I will then have to make the contents optional again. Let's see how that turns out:
Code: [Select]
class variablesprite(sprite):
def __init__(self, imagelookup, contents=None):
# Create a lookup of possible boxes
self.types = imagelookup
self.xoffs = 0
self.yoffs = 0
self.contents = contents
def draw(self, mappicture, objrec, mapdata):
# Pick the correct image then use the parent routine to draw the box
self.image = self.types[objrec.colour]
super(variablesprite, self).draw(mappicture, objrec, mapdata)
# Place contents immediately above the current sprite
if self.contents != None:
mappicture.paste(self.contents, (objrec.x +self.xoffs,
objrec.y +self.yoffs - self.contents.size[1]), self.contents)
The actual lookup gets pulled out into the sprite db prior to creating the treasure boxes:
Code: [Select]
# Treasures (+ contents)
treasurelookup = {0 : graphics.records[37].images[24],
1 : graphics.records[37].images[25],
2 : graphics.debugimage('T', 2, 16, 16),
3 : graphics.records[37].images[27] }
for (sprtype, subtype, crecnum, cimagenum) in [
(26, 0, 37, 33), # Health
(26, 1, 37, 2), # Grapes
(26, 2, 37, 6), # Cherry
(26, 4, 37, 14), # Orange
(26, 11, 30, 28), # Emerald
(26, 12, 48, 2), # Nitro!
(26, 13, 36, 29) # Empty
]:
self.addsprite(sprtype, subtype, variablesprite(treasurelookup,
contents=graphics.records[crecnum].images[cimagenum]))
And the switches. FYI: 30, 19 is an empty sprite
Code: [Select]
# Switches:
self.addsprite(12, 0, variablesprite({
0 : graphics.records[30].images[19],
1 : graphics.records[51].images[0]}))
Oh yeah, and there's a series of hidden platforms that are exposed by this switch. Let's create them as a composite AND semi-transparent sprite:
Code: [Select]
self.addsprite(11, 0, sprite(graphics.semitransparent(
graphics.compositeimage((32, 16), [(0, 0, 25, 14),
(16, 0, 25, 15)]), 128) ))
And here's how the switch and hidden platforms look:
(http://www.zerker.ca/misc/xargon/day11_6.png)
With that, and a few more sprites identified, stage 3 is done. day11.zip (http://www.zerker.ca/misc/xargon/day11.zip) is available.
Title: Day 12
Post by: Zerker on November 25, 2012, 09:47:47 AM
Good morning folks. When doing the switches and treasure boxes yesterday, I came to a realization. The column that I first attempted as the treasure box appearance actually seems to be the link between a switch and what it affects. Why don't we try drawing this identifier into the world to clearly indicate the effects of switches? If we don't like how it turns out, we can always disable it again.
To do this, I'm simply going to create a new method in the spritedb file to draw this onto the map. Since this is NOT debug text, we're going to want to draw this in a way that is more visible. I'm going to re-use the code from my Shadow Caster map to draw it first offset a couple times in black, then in white to get a bordered effect.
Code: [Select]
def drawsprite(self, mappicture, objrec, mapdata):
if objrec.sprtype not in self.sprites or \
objrec.subtype not in self.sprites[objrec.sprtype]:
self.addsprite(objrec.sprtype, objrec.subtype, sprite(
self.graphics.debugimage(objrec.sprtype, objrec.subtype,
objrec.width, objrec.height)))
self.sprites[objrec.sprtype][objrec.subtype].draw(mappicture, objrec, mapdata)
if objrec.info != 0:
self.drawlabel(mappicture, (objrec.x -8, objrec.y -8), str(objrec.info))
def drawlabel(self, mappicture, coords, text):
# Draw the text 5 times to create an outline
# (4 x black then 1 x white)
pen = ImageDraw.Draw(mappicture)
for offset, colour in [( (-1,-1), (0,0,0) ),
( (-1,1), (0,0,0) ),
( (1,-1), (0,0,0) ),
( (1,1), (0,0,0) ),
( (0,0), (255,255,255) )]:
pen.text((coords[0] + offset[0], coords[1] + offset[1]),
text, font=self.markupfont, fill=colour)
(http://www.zerker.ca/misc/xargon/day12_1.png)
Well, it seems to show up in too many places. I'm going to comment it out for now, but let's keep it in the back of our minds. We may still want something similar, but only for specific scenarios. This also appears to provide links for doorways, which is always handy.
In any case, I'm just going to go ahead and identify items in stage 4 now. Though I'm getting really tired of going in and out of subfolders to try to find sprites. I'm going to flatten my export structure from the graphics file, and remove the record offset.
Code: [Select]
def save(self, outpath):
createpath(outpath)
for recnum, record in enumerate(self.records):
record.save(outpath, recnum)
Code: [Select]
def save(self, outpath, recnum):
if self.numimages > 0:
createpath(outpath)
for tilenum, tile in enumerate(self.images):
tile.save(os.path.join(outpath, '{:02}-{:04}.png'.format(recnum, tilenum)) )
The first few sprites weren't anything special, although I found the sprite number of an illusionary wall, which I made semi-transparent. However, I ran into the following location on the map:
(http://www.zerker.ca/misc/xargon/day12_2.png)
Which doesn't contain any unknown sprites in my current map. This must be another object I'm not drawing. Let me comment out my hidden objects and find which one it is. But even turning off every identified sprite STILL doesn't draw anything in this location. It doesn't make any sense. I will finish mapping this stage, then double-check my map decoding to make sure I'm not missing any sprites somehow.
I also ran into ceiling sprites, which are apparently the same ID as floor spikes. Probably differentiated by the "colour" field. I'm going to go ahead and rename that field to appearance. Though looking at the objs file, it appears to be the next field one over. I'll tentatively call this one "direction" and update the variablesprite class to specify which field to look up. I'll have to use access the raw underlying python field dictionary to make it work, though.
Code: [Select]
class variablesprite(sprite):
def __init__(self, imagelookup, contents=None, field='apperance'):
# Create a lookup of possible boxes
self.types = imagelookup
self.xoffs = 0
self.yoffs = 0
self.contents = contents
self.field = field
def draw(self, mappicture, objrec, mapdata):
# Pick the correct image then use the parent routine to draw the box
self.image = self.types[objrec.__dict__[self.field]]
super(variablesprite, self).draw(mappicture, objrec, mapdata)
# Place contents immediately above the current sprite
if self.contents != None:
mappicture.paste(self.contents, (objrec.x +self.xoffs,
objrec.y +self.yoffs - self.contents.size[1]), self.contents)
Code: [Select]
# Spikes:
self.addsprite(59, 0, variablesprite({
0 : graphics.records[36].images[28],
1 : graphics.records[36].images[32]},
field='direction'))
Looking over the objects file, I figured out what was going on. Those bouncing ball traps reported themselves as having no size in the objects file! This malfunctioned by creating an invisible debug image. I'm going to go ahead and switch to always generate a debug image. For any sprites I did not want to draw, I'm going to redirect to record 36, image 28 instead (i.e. an empty sprite).
With that, stage 4 is complete.
(http://www.zerker.ca/misc/xargon/day12_3.png)
day12.zip (http://www.zerker.ca/misc/xargon/day12.zip) is available. I've moved the CSVs and flat maps into a sub-folder in order to better organize things.
Title: Day 13
Post by: Zerker on November 26, 2012, 05:59:17 PM
Now for something different. Today is font day!
For ROTT, I made my own font class, which contained an array of images that got pasted into the map. It worked, but this time I'd like to leverage the PIL ImageFont (http://www.pythonware.com/library/pil/handbook/imagefont.htm) capabilities (especially for the re-colouring). Problem is, I need to get the font data into a format that PIL can use. I see two options here:
1) Look up the format for BDF or PCF font files, and create one
2) Figure out the underlying PIL font code and create a compatible implementation based on the in-game font.
Looking at the definition of BDF (http://en.wikipedia.org/wiki/Glyph_Bitmap_Distribution_Format), that format doesn't look too bad, so I think that is the most likely avenue here. A side-effect of this is that we can actually use the Xargon font in BDF-supporting applications.
To get the font ready, I'm going to start a new file called xargonfontgen.py. This will create a BDF from both main fonts in the Xargon GRAPHICS file. To do this, we're going to need to convert the font images into 1-bit images. That said, we should get 256-colour exports of the font images to decide which "colours" are used. Let's update the xargongraphics save routines and main function:
Code: [Select]
xargonimages.save('Images')
xargonimages.save('OriginalImages', masked=False)
Code: [Select]
def save(self, outpath, masked=True):
createpath(outpath)
for recnum, record in enumerate(self.records):
record.save(outpath, recnum, masked)
Code: [Select]
def save(self, outpath, recnum, masked=True):
if self.numimages > 0:
createpath(outpath)
if (masked):
for tilenum, tile in enumerate(self.images):
tile.save(os.path.join(outpath, '{:02}-{:04}.png'.format(recnum, tilenum)) )
else:
for tilenum, tile in enumerate(self.origimages):
tile.save(os.path.join(outpath, '{:02}-{:04}.png'.format(recnum, tilenum)) )
I actually worked a bit ahead on this yesterday, but knew I wasn't going to finish in one day. Astute followers may have noticed the above updates already in yesterday's zip file.
Looking at one of the font images, they appear to be effectively 3-bit images, using values of 1, 2 and 3 (not 0). Value 3 is transparent. From my observations, the menu text appears to use the two different colours, but all the in-map text (i.e. what we care about) does not.
Next, let's compare the images to an ASCII table to make sure they're in the same order... and they are. Same indices too, although the non-printable characters appear to be re-used. So let's start with a basic class that can convert to 1-bit images, but instead of writing the font at first, let's write some debug images to make sure we're categorizing things correctly.
Code: [Select]
from xargongraphics import createpath, imagefile
import sys, os
from PIL import Image
class xargonfont(object):
@staticmethod
def conv1bit(inimage):
outimage = Image.new('1', inimage.size )
imgdata = list(inimage.getdata())
for index, pixel in enumerate(imgdata):
imgdata[index] = 0 if pixel==3 else 1
outimage.putdata(imgdata)
return outimage
def __init__(self, graphics, recnum):
self.dimensions = graphics.records[recnum].images[0].size
self.characters = [self.conv1bit(image) for image in graphics.records[recnum].origimages]
def debugimages(self, outfolder):
createpath(outfolder)
for glyphnum, glyph in enumerate(self.characters):
if glyphnum >= 32:
glyph.save(os.path.join(outfolder, '{:02}.png'.format(glyphnum)) )
if __name__ == "__main__":
if len(sys.argv) < 2:
print """Usage: python xargongraphics.py [Graphics File]
TODO
"""
else:
for filename in sys.argv[1:]:
graphics = imagefile(filename)
font1 = xargonfont(graphics, 1)
font2 = xargonfont(graphics, 2)
font1.debugimages('font1')
font2.debugimages('font2')
(http://www.zerker.ca/misc/xargon/day13_1.png)
Looks about right. Note that the PIL 1-bit image has 1 = white, 0 = black. We can ignore this. The BDF format has the reverse definition, and that's what we really want to match.
So here's what I came up with to write out the BDF file:
Code: [Select]
def createbdf(self, outname):
with open(outname, 'w') as outfile:
outfile.write("""STARTFONT 2.1
FONT {0}
SIZE {1[0]} 75 75
FONTBOUNDINGBOX {1[0]} {1[1]} 0 0
CHARS {2}\n""".format(self.name, self.size, 95))
for charnum, char in enumerate(self.characters):
if charnum >= 32 and charnum < 127:
outfile.write("""STARTCHAR U+{0:04X}
ENCODING {0}
SWIDTH 0 0
DWIDTH {1[0]} 0
BBX {1[0]} {1[1]} 0 0
BITMAP\n""".format(charnum, self.size))
for y in range(self.size[1]):
value = 0
for x in range(self.size[0]):
value = value + (char.getpixel((x,y)) << self.size[0]-x-1)
# Note: this will break if font width is > 8 bits!
outfile.write("{:02X}\n".format(value))
outfile.write("ENDCHAR\n")
outfile.write("ENDFONT\n")
Note that the alignment is a little bit funny because I'm using multi-line strings. Python's string format method really helps for filling in the data in the appropriate fields. For the meat of the function, I'm just combining each row of the image into a number by using add and bit shift. I'm sure there's a more efficient/pythonic way of doing it, but I only need this to work ONCE to get me a valid BDF file, then I can just keep using the output.
And here's what I get for the first two characters:
Code: [Select]
STARTFONT 2.1
FONT xargon-font1
SIZE 8 75 75
FONTBOUNDINGBOX 8 8 0 0
CHARS 95
STARTCHAR U+0020
ENCODING 32
SWIDTH 0 0
DWIDTH 8 0
BBX 8 8 0 0
BITMAP
00
00
00
00
00
00
00
00
ENDCHAR
STARTCHAR U+0021
ENCODING 33
SWIDTH 0 0
DWIDTH 8 0
BBX 8 8 0 0
BITMAP
18
3C
3C
18
18
00
18
00
ENDCHAR
Seems promising. Let's try this font out.
Code: [Select]
$ pilfont.py *.bdf
xargonfont1.bdf...
Traceback (most recent call last):
File "/usr/bin/pilfont.py", line 48, in <module>
p = BdfFontFile.BdfFontFile(fp)
File "/usr/lib/python2.7/dist-packages/PIL/BdfFontFile.py", line 114, in __init__
font[4] = bdf_slant[string.upper(font[4])]
IndexError: list index out of range
Uh oh. Now I need to debug someone ELSE's code. Well, more accurately, why my output is wrong and causing the code to crash. Anyhow, let's go open this up. The which command tells me pilfont.py is in /usr/bin/pilfont.py, so I'm going to open that up and find the line in question.
And that just points to the BdfFontFile class inside of PIL, so let's find that. Ah, it's processing the FONT line. I didn't think it would actually need any useful information from that. Let me try and update that to be more representative. It seems to me that it's just performing some adjustments to the name, so I should just need to make sure I have the right number of fields. I'll just grab the wikipedia example and code to match.
Code: [Select]
outfile.write("""STARTFONT 2.1
FONT -{0}-medium-r-normal--{1[0]}-160-75-75-c-80-us-ascii
SIZE {1[0]} 75 75
FONTBOUNDINGBOX {1[0]} {1[1]} 0 0
CHARS {2}\n""".format(self.name, self.size, 95))
That gets us past that block, but now we get: KeyError: 'FONT_ASCENT'. Well, we omitted FONT_ASCENT because the BDF spec says it's optional, and it doesn't really apply to us. Guess pilfont requires it. Let's just put it in and set it to the height with the DESCENT set to 0.
Code: [Select]
outfile.write("""STARTFONT 2.1
FONT -{0}-medium-r-normal--{1[0]}-160-75-75-c-80-us-ascii
SIZE {1[0]} 75 75
FONTBOUNDINGBOX {1[0]} {1[1]} 0 0
STARTPROPERTIES 2
FONT_ASCENT {1[1]}
FONT_DESCENT 0
ENDPROPERTIES
CHARS {2}\n""".format(self.name, self.size, 95))
Now, pilfont runs with no errors. Let's try out the new .pil files.
Code: [Select]
# Text sprites:
self.addsprite(6, 0, textsprite(ImageFont.load("font2.pil"), graphics))
self.addsprite(7, 0, textsprite(ImageFont.load("font1.pil"), graphics))
We can also take out the alignment corrections we added for the true-type font we picked inside the textsprite class.
(http://www.zerker.ca/misc/xargon/day13_2.png)
Well, one font looks good, but the other is cut off. You know, I bet the BDF spec has left-aligned pixels instead of right-aligned pixels. This means I need to shift my 6-pixel font 2 images over 2 more pixels. For simplicity, I will simply update to align to an 8 bit number in my BDF export:
Code: [Select]
for x in range(self.size[0]):
value = value + (char.getpixel((x,y)) << 7-x)
(http://www.zerker.ca/misc/xargon/day13_3.png)
There we go. Font victory!
Now, just for fun, I'm going to use the built-in Xargon font for all my debug images and stop including DroidSans.
Oh, BTW, I just noticed additional files that actually contain map data (DEMO*.XR1, INTRO.XR1, STORY.XR1), so I'll be sure to include those too. Unfortunately, my clever hackery for string processing has malfunctioned on the STORY scene:
(http://www.zerker.ca/misc/xargon/day13_4.png)
I'll have to keep that in mind, but I probably won't be changing anything there for a while. Also, the map ID isn't a good way to recognize alternate palettes, as some of the auxiliary files have different palettes but the same map id of 0. I'm going to switch over to filenames.
Code: [Select]
if self.name.upper() in ['BOARD_03', 'BOARD_05', 'BOARD_06',
'BOARD_07', 'BOARD_09', 'BOARD_10', 'INTRO', 'DEMO1',
'DEMO2', 'DEMO3']:
graphics.changepalette(1)
else:
graphics.changepalette(0)
FYI: day13.zip (http://www.zerker.ca/misc/xargon/day13.zip) is available.
Title: Day 14
Post by: Zerker on November 27, 2012, 05:41:23 PM
Good evening. The next couple days are likely going to be fairly boring. We have most of the functionality implemented, so I'm going to spend the time playing the game and identifying sprites. Yesterday we noticed a problem with the sprites in the Story map. I'll likely need to get some debug data output to look into that further, so I'm going to defer that to the weekend when I can look into it more.
The first thing I'm going to do is identify any sprite I can find in the menu maps and the demos. Following that, I'll continue where I left off in the game on stage 5.
The story scene sprites all appear continuous, so I can populate all of those with a simple loop:
Code: [Select]
# Story Scenes:
for subtype in range(24):
self.addsprite(85, subtype, sprite(graphics.records[56].images[subtype]))
self.addsprite(86, subtype, sprite(graphics.records[57].images[subtype]))
(http://www.zerker.ca/misc/xargon/day14_3.png)
Mapping for a bit, I found out that the Episode 3 demo has a slightly different colour palette, so I'll incorporate that.
(http://www.zerker.ca/misc/xargon/day14_1.png)
Code: [Select]
if self.name.upper() in ['BOARD_03', 'BOARD_05', 'BOARD_06',
'BOARD_07', 'BOARD_09', 'BOARD_10', 'INTRO', 'DEMO1', 'DEMO2']:
graphics.changepalette(1)
elif self.name.upper() == 'DEMO3':
graphics.changepalette(2)
else:
graphics.changepalette(0)
Code: [Select]
palimage = Image.open('palimage3.png')
self.palette[2] = palimage.getpalette()
For Demo 1, I added an entry for floor/ceiling spears. However, I need to expand the variable sprite to allow offsets, because the floor image spear appears inside the floor. I also need to make the offets a list to match with the lookup.
Code: [Select]
# Ceiling Spear
self.addsprite(43, 0, variablesprite({
0 : graphics.records[36].images[9],
1 : graphics.records[36].images[12]},
offsets={0: (0, 0), 1:(0, -4) },
field='direction'))
Code: [Select]
class variablesprite(sprite):
def __init__(self, imagelookup, contents=None, field='apperance', offsets=None):
# Create a lookup of possible boxes
self.types = imagelookup
self.xoffs = 0
self.yoffs = 0
self.contents = contents
self.offsets = offsets
self.field = field
def draw(self, mappicture, objrec, mapdata):
# Pick the correct image then use the parent routine to draw the box
self.image = self.types[objrec.__dict__[self.field]]
if self.offsets != None:
(self.xoffs, self.yoffs) = self.offsets[objrec.__dict__[self.field]]
super(variablesprite, self).draw(mappicture, objrec, mapdata)
# Place contents immediately above the current sprite
if self.contents != None:
mappicture.paste(self.contents, (objrec.x +self.xoffs,
objrec.y +self.yoffs - self.contents.size[1]), self.contents)
I also notice that it looks like the flaming jet face has a hidden ice cream cone instead of the sprite that would say "this is a flaming jet face".
(http://www.zerker.ca/misc/xargon/day14_2.png)
Since the face is in the background, I just need to recognize this case and simply not draw anything. Looking at the Object file, it appears that the flame jet instance has a 1 in what I called the "Direction" field, while the other two have 4. I'm going to rename that field to variant, and make a special variablesprite case for sprite 73, type 0 in the spritedb:
Code: [Select]
# Special case for 73, type 0. Variant 4 appears to be the pickup item.
# Other variants (all rendered invisible) appear to be:
# 1 : Flaming Face Jet (Down)
# 2 : Flaming Lava Jet (Up)
# 3 : TBC
self.addsprite(73, 0, variablesprite({
1 : graphics.records[30].images[19],
2 : graphics.records[30].images[19],
3 : graphics.debugimage(73, 'T3', 16, 16),
4 : sprite(graphics.semitransparent(
graphics.records[37].images[0], 128))},
field='variant'))
That works for most stages, but it looks like I somehow broke something in DEMO3:
Code: [Select]
Generating Map 'DEMO3'
Traceback (most recent call last):
File "xargonmapper.py", line 68, in <module>
mapper = xargonmapper(xargonimages, tiledata, themap)
File "xargonmapper.py", line 49, in __init__
sprites.drawsprite(self.mappicture, objrecord, mapdata)
File "/data/Projects/Xargon/spritedb.py", line 196, in drawsprite
self.sprites[objrec.sprtype][objrec.subtype].draw(mappicture, objrec, mapdata)
File "/data/Projects/Xargon/spritedb.py", line 255, in draw
super(variablesprite, self).draw(mappicture, objrec, mapdata)
File "/data/Projects/Xargon/spritedb.py", line 226, in draw
objrec.y +self.yoffs), self.image)
File "/usr/lib/python2.7/dist-packages/PIL/Image.py", line 1079, in paste
"cannot determine region size; use 4-item box"
ValueError: cannot determine region size; use 4-item box
That's a bit cryptic, so I think it's time to make my own exception handler to get more info.
Code: [Select]
def drawsprite(self, mappicture, objrec, mapdata):
try:
if objrec.sprtype not in self.sprites or \
objrec.subtype not in self.sprites[objrec.sprtype]:
self.addsprite(objrec.sprtype, objrec.subtype, sprite(
self.graphics.debugimage(objrec.sprtype, objrec.subtype,
objrec.width, objrec.height)))
self.sprites[objrec.sprtype][objrec.subtype].draw(mappicture, objrec, mapdata)
#if objrec.info != 0:
# self.drawlabel(mappicture, (objrec.x -8, objrec.y -8), str(objrec.info))
except:
print "Problem with Sprite {}, Type {}, Appearance {}, Variant {} at ({}, {})".format(
objrec.sprtype, objrec.subtype, objrec.apperance, objrec.variant,
objrec.x, objrec.y)
traceback.print_exc()
FYI: traceback.print_exc() will print the standard stack trace you get without any exception handler.
When I run it again, I get:
Code: [Select]
Problem with Sprite 73, Type 0, Appearance 0, Variant 4 at (848, 640)
Traceback (most recent call last):
< Snip >
Problem with Sprite 73, Type 0, Appearance 0, Variant 4 at (240, 592)
Traceback (most recent call last):
< Snip >
Okay, so it's something about the NORMAL semi-transparent ice cream cone. Let's look at that line.
Code: [Select]
4 : sprite(graphics.semitransparent(
graphics.records[37].images[0], 128))},
Gah, I'm declaring a sprite inside a variable sprite declaration! I should just be passing the semi-transparent image in directly. Fixing now.
And that's everything I can access from the main menu. I think I'll stop for today. day14.zip (http://www.zerker.ca/misc/xargon/day14.zip) is available.
Title: Day 15
Post by: Zerker on November 28, 2012, 06:02:09 PM
Hello again. Today will mostly just be me identifying some more sprites, but I thought I'd fix one general bug I noticed yesterday (and no, not the string order in the STORY stage). It's the problem where sprites are drawn over text, contrary to the in-game appearance.
(http://www.zerker.ca/misc/xargon/day15_1.png)
So what I'm going to do is split the text sprites and non-text sprites into two separate lists, and always draw the text after everything else. The main change is in the map loading:
Code: [Select]
self.objs = [objrecord(struct.unpack(objrecstruct,
mapfile.read(struct.calcsize(objrecstruct)) ) )
for i in range(numobjs)]
# Create separate sprite and text lists:
self.text = [obj for obj in self.objs if obj.sprtype in [6, 7] ]
self.sprites = [obj for obj in self.objs if obj.sprtype not in [6, 7] ]
And use these two lists for the map:
Code: [Select]
for objrecord in mapdata.sprites:
sprites.drawsprite(self.mappicture, objrecord, mapdata)
for objrecord in mapdata.text:
sprites.drawsprite(self.mappicture, objrecord, mapdata)
Also, I'm going to make a really minor change and make the static flame sprites on the menus screens variable to take into account each version:
Code: [Select]
# Menu Flame Jets:
self.addsprite(47, 0, variablesprite({
6 : graphics.records[48].images[3],
8 : graphics.records[48].images[4]},
field='info'))
And here's the update:
(http://www.zerker.ca/misc/xargon/day15_2.png)
And on a total whim, I decided to check the palette of the title screen and see if that's the correct palette for image record 53. Turns out it is!
(http://www.zerker.ca/misc/xargon/day15_3.png)
Sorry folks, that's about all the excitement today. Now I just get to play the game some more and identify more sprites. Well, that's not true. I found out that invisible platforms can come in multiple variants. I just added one to support stage 6:
Code: [Select]
# Variant of Compound and semi-transparent for hidden platform(s)
self.addsprite(11, 0, variablesprite({
6: graphics.semitransparent(
graphics.compositeimage((32, 16), [(0, 0, 25, 14),
(16, 0, 25, 15)]), 128),
7: graphics.semitransparent(
graphics.compositeimage((32, 16), [(0, 0, 51, 10),
(16, 0, 51, 11)]), 128) }
))
Stage 6 complete:
(http://www.zerker.ca/misc/xargon/day15_4.png)
I did the stages out of order, so going back to stage 5 doesn't result in anything extraordinary. It has another palette, so I'll add that to the list. It also has switches and toggle-able walls. I will hide the wall sprites and draw the switches. I'll add the switches and walls to my "maybe label the link" list. A few more trap and item types round out the list.
Stage 5 complete:
(http://www.zerker.ca/misc/xargon/day15_5.png)
Stage 7 complete too. Nothing major here. I'll pencil in the stalactites as another possible sprite to mark with trigger identifiers, so we can tell when they would drop (and what causes them).
(http://www.zerker.ca/misc/xargon/day15_6.png)
day15.zip (http://www.zerker.ca/misc/xargon/day15.zip) is available.
Title: Re: PC Game Hacking and Mapping Tutorial: Xargon
Post by: Zerker on November 30, 2012, 03:48:57 PM
Looks like I forgot to post what I wrote up yesterday. Let me get that out of the way:
Another day, more maps. Today I will be filling in the gaps for the next couple levels in the game. The further we get, the fewer sprites need identification. We'll see when we identify them all :).
Another map, another palette. I'm going to rename the palette images to start at 0 and generalize this a bit:
Code: [Select]
self.palette = {}
for i in range(6):
palimage = Image.open('palimage{}.png'.format(i) )
self.palette[i] = palimage.getpalette()
Stage 8 is done:
(http://www.zerker.ca/misc/xargon/day16_1.png)
And Stage 9:
(http://www.zerker.ca/misc/xargon/day16_2.png)
Not a big day today. I'll map the final stage of Episode 1 tomorrow, then get to some of the other tasks I've been putting off before submitting them for the site. Episode 2 will follow that. day16.zip (http://www.zerker.ca/misc/xargon/day16.zip) is available.
Title: Day 17
Post by: Zerker on November 30, 2012, 05:59:23 PM
And here's today's post. Time for the final level(s) and ending! Stage 10 isn't too complicated. There's just another illusionary wall, and the "To Reactor" Sign. There's also some sort of unidentified pickup hidden behind an illusionary wall with the ID of 42:0. Since the yellow gem was 42:3, I'm going to take the educated guess that this is the green gem. I'll comment it as "TBC" in case I actually see one in Episodes 2 or 3.
Stage 10 done:
(http://www.zerker.ca/misc/xargon/day17_1.png)
Now, the Reactor stage. First, it appears to have the wrong palette, so I'll fix that immediately. Second, it has these infinite floating robot spawners. I'm going to create a "composite" sprite containing a couple robots clustered together and see how that looks.
Code: [Select]
# Special case for 73, type 0. Variant 4 appears to be the pickup item.
# Other variants (all rendered invisible) appear to be:
# 1 : Flaming Face Jet (Down)
# 2 : Flaming Lava Jet (Up)
# 3 : Robot Spawner
self.addsprite(73, 0, variablesprite({
1 : graphics.records[30].images[19],
2 : graphics.records[30].images[19],
3 : graphics.compositeimage((32, 32), [(0, 0, 59, 1),
(16, 0, 59, 4), (8, 12, 59, 1)]),
4 : graphics.semitransparent(
graphics.records[37].images[0], 128)},
field='variant'))
Reactor Stage (32) Done:
(http://www.zerker.ca/misc/xargon/day17_2.png)
Ending sequence time. It looks like the ending has a special font-mode which actually uses the two colours for the fonts. Since my setup doesn't let me do that, I'm going to work-around this by drawing the text twice, once for each colour, to get a somewhat similar effect. Right now it shows up as dark gray, which is wrong.
(http://www.zerker.ca/misc/xargon/day17_3.png)
Code: [Select]
def draw(self, mappicture, objrec, mapdata):
pen = ImageDraw.Draw(mappicture)
if objrec.appearance == 8:
# Simulate multi-colour appearance by creating a fake shadow effect
pen.text((objrec.x, objrec.y), mapdata.getstring(objrec.stringref),
font=self.font, fill=self.graphics.getcolour(14))
pen.text((objrec.x-1, objrec.y), mapdata.getstring(objrec.stringref),
font=self.font, fill=self.graphics.getcolour(6))
else:
pen.text((objrec.x, objrec.y), mapdata.getstring(objrec.stringref),
font=self.font, fill=self.graphics.getcolour(objrec.appearance))
(http://www.zerker.ca/misc/xargon/day17_4.png)
Not perfect, but a reasonable facsimile. It will do. With that, the shareware game is fully mapped. It just needs a few tweaks before it's ready for the site.
Oh, but there are a few sprites in the "demo" stages that we haven't identified. And, unfortunately, we CAN'T identify without playing the original versions of those stages. Since the demo stages are essentially identical to their original versions, there's no real reason to submit these.
day17.zip (http://www.zerker.ca/misc/xargon/day17.zip) is available.
Title: Day 18 (Episode 1 complete)
Post by: Zerker on December 01, 2012, 12:45:56 PM
Hello folks. It's cleanup day. Here are the outstanding tasks I have written down, in the order I'm going to tackle them:
We'll see if we can get these all done today, or if it will spill over into tomorrow.
Task 1 is easy, we just add an offset of 4 to each sprite:
Code: [Select]
# Map Images that need alignment:
for (sprtype, subtype, recnum, imagenum) in [
(5, 0, 47, 8), # Map Player
(88, 4, 47, 22), (88, 5, 47, 23)]:
self.addsprite(sprtype, subtype, sprite(
graphics.records[recnum].images[imagenum], xoffs=4))
For task 2, I'm going to start by enabling the existing code, and adding the sprite ID to each string for easy debugging (and filter list population). I'm also going to use the smaller font for this.
Code: [Select]
if objrec.info != 0:
self.drawlabel(mappicture, (objrec.x -8, objrec.y -8),
"{} ({}:{})".format(objrec.info, objrec.sprtype, objrec.subtype))
With that done, I need a mechanism for filtering our numbers on some sprites. I'm going to add some optional parameters to the sprite __init__ methods. Then, I move the label code into the sprite code, and adjust accordingly. It also looks like some of the high numbers (>=90) are used for form changes, so I will hide those automatically. I'll also add the ability to specify the label offset, for entries (like the trigger pickups) where the switch is the primary purpose.
Code: [Select]
class sprite(object):
def __init__(self, image, xoffs=0, yoffs=0, hidelabel=False,
labelpref='', labeloffs=(-8, -8)):
self.image = image
self.xoffs = xoffs
self.yoffs = yoffs
self.hidelabel = hidelabel
self.labelpref = labelpref
self.labeloffs = labeloffs
def draw(self, mappicture, objrec, mapdata):
# When pasting masked images, need to specify the mask for the paste.
# RGBA images can be used as their own masks.
mappicture.paste(self.image, (objrec.x +self.xoffs,
objrec.y +self.yoffs), self.image)
if objrec.info != 0 and objrec.info < 90 and not self.hidelabel:
text = "{}{} ({}:{})".format(self.labelpref, objrec.info,
objrec.sprtype, objrec.subtype)
# Draw the text 5 times to create an outline
# (4 x black then 1 x white)
pen = ImageDraw.Draw(mappicture)
for offset, colour in [( (-1,-1), (0,0,0) ),
( (-1,1), (0,0,0) ),
( (1,-1), (0,0,0) ),
( (1,1), (0,0,0) ),
( (0,0), (255,255,255) )]:
pen.text( (objrec.x +self.xoffs +offset[0] +self.labeloffs[0],
objrec.y +self.yoffs +offset[1] +self.labeloffs[0]),
text, font=markupfont, fill=colour)
Then I just need to actually use hidelabel and labelpref members for some good. Hidelabel is just to remove the clutter of useless information, but labelpref is to ADD info. Specifically, to give the label numbers more context. I'm going to use this for the doorways first:
Code: [Select]
self.addsprite(61, 0, sprite(graphics.records[30].images[19])) # Out Door
self.addsprite(62, 0, sprite(graphics.records[30].images[19], labelpref='To ')) # In Door
And the main ones to hide:
Code: [Select]
for sprtype in [17, 63]:
for subtype in range(-1, 11):
self.addsprite(sprtype, subtype, sprite(graphics.records[30].images[19],
hidelabel=True))
Now I'll just go ahead and hide anything else that looks like it needs it.
And done. However, there are two cases that need to be fixed, and I think they will both require pre-processing. Case 1 is that all locked doors appear to have switch triggers. We don't want to display these, because the use of locked doors is fairly obvious. In order to remove this ONE use of triggers, we will need to first find all locked doors, then erase the info value for any triggers that match.
The second update is very minor, but on stage 5, it appears that two triggers are on the same tile. The pre-processing will simply need to move one down (or up) about 8 pixels.
Code: [Select]
def preprocessmap(self, mapdata):
switchlocations = []
doorinfos = []
# First loop: find all door info values and move doubled up sprites.
for objrec in mapdata.sprites:
if objrec.sprtype == 12:
while (objrec.x + objrec.y*128*16) in switchlocations:
objrec.y += 8
switchlocations.append(objrec.x + objrec.y*128*16)
if objrec.sprtype == 9:
doorinfos.append(objrec.info)
# Second loop: Erase switches that align with doors
for objrec in mapdata.sprites:
if objrec.sprtype == 12 and objrec.info in doorinfos:
objrec.info = 0
Not too hard. Now I just take out the debug sprite ID, and the labels are good to go.
(http://www.zerker.ca/misc/xargon/day18_1.png)(http://www.zerker.ca/misc/xargon/day18_2.png)
My convention is to add "To" for a Doorway transition, "TR" for a pickup trigger, and "SW" for a toggle switch. Let me know if anything is unclear or you have any suggestions. I thought of adding "W" for the toggle walls, but I think they should be okay as-is.
Monster facing is next. Let's start with Stage 3, which obviously has monsters facing both directions. If we filter by monster 55, we get:
Code: [Select]
55 880 400 2 0 32 48 0 0 0 0 0 0 0 0 0
55 560 304 2 0 32 48 0 0 0 0 0 0 0 0 0
55 1440 336 2 0 32 48 0 0 0 0 0 0 0 0 0
55 400 944 -2 0 32 48 0 0 0 0 0 0 0 0 0
55 1904 960 3 0 32 48 0 0 0 0 0 0 0 0 0
55 160 864 3 0 32 48 0 0 0 0 0 0 0 0 0
55 560 864 -1 0 32 48 0 0 0 0 0 0 0 0 0
55 1232 400 -4 0 32 48 0 0 0 0 0 0 0 0 0
55 1712 928 -1 0 32 48 0 0 0 0 0 0 0 0 0
55 304 336 1 0 32 48 0 0 0 0 0 0 0 0 0
So, I don't see a left-right, but I do see a positive-negative correlation. The actual number probably specifies the exact initial sprite, which we will likely have a very hard time guessing. I'm going to assume positive is left, and negative is right. I'm also going to use a different frame of animation for each ID just for the hell of it.
Code: [Select]
# Monsters:
# Brute
self.addsprite(55, 0, variablesprite({
-4 : graphics.records[61].images[4],
-3 : graphics.records[61].images[5],
-2 : graphics.records[61].images[6],
-1 : graphics.records[61].images[7],
0 : graphics.records[61].images[8],
1 : graphics.records[61].images[9],
2 : graphics.records[61].images[10],
3 : graphics.records[61].images[11],
4 : graphics.records[61].images[12],
} ))
But it's not correct. Compare the below screenshot to the STORY screen:
(http://www.zerker.ca/misc/xargon/day18_3.png)(http://www.zerker.ca/misc/xargon/day18_4.png)
Well, STORY is easy, because the sprites don't move, so I'll pick exact matches for them. Then I'll go play through Stage 3 again and see if I can figure out the initial facing of each monster.
Unfortunately, that's rather difficult to do. Here's the best I was able to come up with:
Code: [Select]
self.addsprite(55, 0, variablesprite({
-4 : graphics.records[61].images[12],
-3 : graphics.records[61].images[11],
-2 : graphics.records[61].images[10],
-1 : graphics.records[61].images[9],
0 : graphics.records[61].images[8],
1 : graphics.records[61].images[0],
2 : graphics.records[61].images[1],
3 : graphics.records[61].images[2],
4 : graphics.records[61].images[3]
} ))
Let's go ahead and do some other monsters. I'll leave the centipede as-is, because the only known instances all face in the same direction. Most other monsters appear to just use 0 and 2.
That's done. Still not 100% convinced, but it adds variety, and it's better than we had before.
Now strings. We're going to need more information for this, so let's add another output to the debug mode for xargonmap.py.
Code: [Select]
# Standalone debug string list:
with open(self.name + '_strings.csv', 'wb') as csvfile:
writer = csv.writer(csvfile)
for stringnum, lookupval in enumerate(self.stringlookup):
writer.writerow([stringnum, lookupval, self.strings[stringnum]])
With that listing in place, I will try to identify all the discrepancies by comparing screenshots against my map output. For each discrepancy, to the right of the string that "actually appears", I will put the string that "should be there", as well as the index in the string array for that string. Without a better idea, I think I'm just going to have to correct the alignment discrepancy in the lookup array.
With that in place, I can put together a simple set of corrections to fix the alignment. Most of them are shifted by 4, so we only need to take into account the entries OTHER than the ones that shift by 4. Generally, this just means moving a few of the page number entries to different places in the list.
Code: [Select]
# String adjust for STORY map:
if mapdata.name.upper() == 'STORY':
page3to5 = mapdata.stringlookup[117:120]
page6 = mapdata.stringlookup[82]
page7 = mapdata.stringlookup[81]
page8 = mapdata.stringlookup[84]
page9 = mapdata.stringlookup[83]
page10 = mapdata.stringlookup[116]
del mapdata.stringlookup[116:120]
del mapdata.stringlookup[81:85]
mapdata.stringlookup[81:81] = page3to5 + [page6, page7, page8, page9, page10]
I confused myself a little bit figuring out exactly which value I was moving (original string ID vs string position in array). All is good now, however. This means that Episode 1 maps are complete!
day18.zip (http://www.zerker.ca/misc/xargon/day18.zip) is available. Episode 1 maps are also on my website (http://www.zerker.ca/zzone/2012/12/01/xargon-episode-1-maps/), and submitted to VGMaps. Tomorrow I will start Episode 2.
Title: Day 19
Post by: Zerker on December 02, 2012, 07:58:05 AM
Hello again. Today is the day we make the mapper script work with Episodes 2 and 3. The first thing I noticed when firing up the other two episodes is that each one has a different colour palette:
(http://www.zerker.ca/misc/xargon/day19_1.png)(http://www.zerker.ca/misc/xargon/day19_2.png)
And I suspect the Graphics file will have slightly different contents. Before doing anything else, I'm going to run my Graphics script on the other GRAPHICS files with the episode 1 palette. I should be able to compare the results to see what's different.
And Beyond Compare tells me there's very little that's actually different. A few missing sprites (notably the story scenes) and a few extra. Nothing that should totally break things, but the spritedb will need to be populated based on the episode number. We can't have it populating sprites that don't exist.
Also, there's the nature of the alternate palettes per episode. So let's get the files upgraded to detect episode number from the file extension. To do this, we add this line to xargonmap.py:
Code: [Select]
self.epnum = int(tempext[-1])
and to xargongraphics.py:
Code: [Select]
self.epnum = int(filename[-1])
...
if self.epnum == 2:
self.activepal = 6
elif self.epnum == 3:
self.activepal = 7
else:
self.activepal = 0
And for debug:
Code: [Select]
xargonimages.save('Episode{}Images'.format(xargonimages.epnum))
xargonimages.save('Episode{}OriginalImages'.format(xargonimages.epnum), masked=False)
Let's update xargonmapper.py to tie this together. I'll also clean up the Episode 1 palette choice, since more stages use the "DARK" palette than otherwise:
Code: [Select]
if self.epnum == 2:
# Episode 2
graphics.changepalette(6)
elif self.epnum == 3:
# Episode 3
graphics.changepalette(7)
else:
# Episode 1
if self.name.upper() in ['BOARD_01', 'BOARD_02', 'BOARD_04']:
graphics.changepalette(0)
elif self.name.upper() == 'DEMO3':
graphics.changepalette(2)
elif self.name.upper() == 'BOARD_05':
graphics.changepalette(4)
elif self.name.upper() in ['BOARD_08', 'BOARD_33']:
graphics.changepalette(5)
else:
graphics.changepalette(1)
sprites = spritedb(graphics, mapdata.epnum)
And save to a subfolder:
Code: [Select]
def save(self):
epfolder = 'Episode{}'.format(self.epnum)
createpath(epfolder)
self.mappicture.save(os.path.join(epfolder, self.name + '.png'))
And go by my sprite comparison to see which sprites are not in Episode 2, which looks like 56, 57 and 62. 62 I expect is in Episode 3, though.
Code: [Select]
# Skull Slug!
if epnum != 2:
self.addsprite(75, 0, variablesprite({
-1 : graphics.records[62].images[2],
0 : graphics.records[62].images[0],
1 : graphics.records[62].images[5],
2 : graphics.records[62].images[3]
}, hidelabel=True ))
...
# Story Scenes:
if epnum == 1:
for subtype in range(24):
self.addsprite(85, subtype, sprite(graphics.records[56].images[subtype]))
self.addsprite(86, subtype, sprite(graphics.records[57].images[subtype]))
Then we run it and find out what breaks...
On the whole, it works. There are a few monster sprites with unmatched direction indices. Let me just fill those in now, run it again to confirm, then run it on Episode 3. Episode 3 has a couple more indices to fill in, including new hidden platform types. I will add those as debug images until I can see them in-game.
Code: [Select]
# Variant of Compound and semi-transparent for hidden platform(s)
self.addsprite(11, 0, variablesprite({
2: graphics.debugimage(11, 'T2', 32, 16),
4: graphics.debugimage(11, 'T4', 32, 16),
6: graphics.semitransparent(
graphics.compositeimage((32, 16), [(0, 0, 25, 14),
(16, 0, 25, 15)]), 128),
7: graphics.semitransparent(
graphics.compositeimage((32, 16), [(0, 0, 51, 10),
(16, 0, 51, 11)]), 128) }
))
Same goes for the new spawner varient (sprite 73).
Well, that's all done. Now we just need to identify new sprites to get the Episode 2 maps up to code. But first, I'm going to make one fix to the Episode 1 maps based on what I've seen of Episodes 2 and 3: Trigger Number of -1. This doesn't ever appear to be linked to anything and doesn't have any specific use for a map. So I will exclude it and only draw positive numbers:
Code: [Select]
if objrec.info > 0 and objrec.info < 90 and not self.hidelabel:
With that, a new palette, and a couple new sprites, Episode 2, Stage 1 is complete:
(http://www.zerker.ca/misc/xargon/day19_3.png)
Oh, btw, the world map was complete before we even started (yay for reuse), but DarkWolf has already submitted the map to the site.
Stage 2 was almost done for me, and only needed a single new treasure box type. That said, one of the doorway labels is obscured by a spider, so I'm going to add doorways and triggers to the "text" list so they are drawn on top.
Code: [Select]
self.text = [obj for obj in self.objs if obj.sprtype in [6, 7, 12, 61, 62] ]
self.sprites = [obj for obj in self.objs if obj.sprtype not in [6, 7, 12, 61, 62] ]
Since switches moved to the "text" list, we also need to adjust our post-processing routines:
Code: [Select]
# First loop: find all door info values
for objrec in mapdata.sprites:
if objrec.sprtype == 9:
doorinfos.append(objrec.info)
# Second loop: Erase switches that align with doors and move doubled up sprites.
for objrec in mapdata.text:
if objrec.sprtype == 12:
while (objrec.x + objrec.y*128*16) in switchlocations:
objrec.y += 8
switchlocations.append(objrec.x + objrec.y*128*16)
if objrec.info in doorinfos:
objrec.info = 0
And here's stage 2, illustrating the tricky asymmetric doorways :).
(http://www.zerker.ca/misc/xargon/day19_4.png)
Stage 3 introduces two new enemies: evil purple bunnies and mini dinosaur things. Let's add them both to the sprite DB and continue. I'm also going to pick the jumping animation for the bunny because they are SMALL otherwise.
Code: [Select]
# Mini Dino
if epnum != 1:
self.addsprite(58, 0, variablesprite({
-1 : graphics.records[56].images[5],
0 : graphics.records[56].images[4],
1 : graphics.records[56].images[1],
2 : graphics.records[56].images[0],
} ))
...
# Evil Bunny
if epnum != 1:
self.addsprite(70, 0, variablesprite({
0 : graphics.records[63].images[4],
2 : graphics.records[63].images[1],
} ))
Stage 3 is ALMOST done now. I realize there's a minor glitch, that didn't manifest in Episode 1:
(http://www.zerker.ca/misc/xargon/day19_5.png)
We need to make sure to use the tile mask data, and draw the map with the proper background colour (index 250 in the palette). This should be fairly simple. First, the initial map image should start from this colour, then we need to paste in tiles using their mask.
Code: [Select]
self.mappicture = Image.new("RGB", (128*16, 64*16), graphics.getcolour(250) )
...
tileimg = tiledata.gettile(graphics, tileval)
self.mappicture.paste(tileimg, (x*16, y*16), tileimg )
Better now:
(http://www.zerker.ca/misc/xargon/day19_6.png)
I could keep going, but I think that's enough for today.
day19.zip (http://www.zerker.ca/misc/xargon/day19.zip) is available.
Title: Re: PC Game Hacking and Mapping Tutorial: Xargon
Post by: Zerker on December 03, 2012, 05:21:25 PM
Good evening. From here on our things will likely be pretty straightforward. Stage 4 just has one new sprite to identify, which appears to be a simple bat enemy. Yes, another small hard-to-see enemy. See if you can find them in the image below:
(http://www.zerker.ca/misc/xargon/day20_1.png)
Stage 5 has one new enemy (some sort of goopy creature) and a new palette:
(http://www.zerker.ca/misc/xargon/day20_2.png)
Stage 6 has a new trap and a new treasure box type (containing a red key no less).
(http://www.zerker.ca/misc/xargon/day20_3.png)
The next two stages I did out of order. Stage 8 just has one new treasure box (yellow key):
(http://www.zerker.ca/misc/xargon/day20_4.png)
And Stage 7 I will get to tomorrow. day20.zip (http://www.zerker.ca/misc/xargon/day20.zip) is available.
Title: Day 21
Post by: Zerker on December 04, 2012, 06:03:30 PM
Hello folks. Time for more maps. Things are getting easier and easier as we go along. Soon everything will be done for us before we even start.
But not stage 7. It has ONE identified sprite, which is just the Eagle character again. And a new palette.
(http://www.zerker.ca/misc/xargon/day21_1.png)
Stage 9 has a few new things. We've got another illusionary wall, more spikey trap guys, a blue key treasure box, and a variant of the bouncy ball trap. The latter I need to switch over to using varients so I can update this accordingly.
Code: [Select]
# Bouncing Balls:
for i in range(2):
self.addsprite(46, i, variablesprite({
0 : graphics.records[51].images[4],
3 : graphics.records[51].images[7]},
field='info', hidelabel=True))
Oh, and I may as well fill in the Green Key treasure box, since all four keys appear to be in order.
(http://www.zerker.ca/misc/xargon/day21_2.png)
I'm playing stages out-of-order again. Stage 11 has an alternate palette and one new ID for the same spike spear we've already seen. I also realize that I screwed up the shrimp monster, which also appears in Episode 1. I've re-uploaded the fixed copy to my site and get it corrected here after I finish Episode 2 (to make sure we didn't miss anything else).
(http://www.zerker.ca/misc/xargon/day21_3.png)
And Stage 10 just has a different palette, an epic disk in a treasure box and ANOTHER version of the eagle sprite. I think I'm just going to assume all his variants are the same and populate via a loop:
Code: [Select]
# Silvertongue
for i in range (25):
self.addsprite(23, i, sprite(graphics.records[45].images[1]))
(http://www.zerker.ca/misc/xargon/day21_4.png)
day21.zip (http://www.zerker.ca/misc/xargon/day21.zip) is available.
Title: Day 22
Post by: Zerker on December 05, 2012, 04:47:54 PM
Another day, more maps. Today, I play Stage 12 only to discover it's already fully mapped:
(http://www.zerker.ca/misc/xargon/day22_1.png)
Same with stage 13:
(http://www.zerker.ca/misc/xargon/day22_2.png)
And 14:
(http://www.zerker.ca/misc/xargon/day22_3.png)
And 15 (once I selected the correct palette):
(http://www.zerker.ca/misc/xargon/day22_4.png)
See what I mean about things becoming easier? Now, there's one new sprite in the reactor level (stage 32), and that's for the larger reactor:
(http://www.zerker.ca/misc/xargon/day22_5.png)
However, there's also misaligned text again for the ending sequence, so I'm going to need to do the same trick as with the Episode 1 Story scene:
Code: [Select]
# String adjust for Episode 2 Ending:
if mapdata.name.upper() == 'BOARD_32' and mapdata.epnum == 2:
blank = mapdata.stringlookup[-1]
del mapdata.stringlookup[-1]
mapdata.stringlookup.insert(8, blank)
And with that, Episode 2 is complete! I'll post it on my site tomorrow.
day22.zip (http://www.zerker.ca/misc/xargon/day22.zip) is available.
Title: Day 23
Post by: Zerker on December 06, 2012, 05:08:31 PM
Episode 2 is now posted on my web site (http://www.zerker.ca/zzone/2012/12/06/xargon-episode-2-maps/), and submitted to VGMaps. I also submitted the correction to Episode 1.
Episode 3 time. The first task we need to do is fix THIS error when generating the Episode 3 maps:
Code: [Select]
Generating Map 'BOARD_01'
Traceback (most recent call last):
File "xargonmapper.py", line 139, in <module>
mapper = xargonmapper(xargonimages, tiledata, themap)
File "xargonmapper.py", line 66, in __init__
sprites = spritedb(graphics, mapdata.epnum)
File "/data/Projects/Xargon/spritedb.py", line 247, in __init__
self.addsprite(56, 0, sprite(graphics.records[46].images[2]))
IndexError: list index out of range
Looks to me like that slime creature is an Episode 2 exclusive. So let's change that:
Code: [Select]
if epnum == 2:
# Goo Monster
self.addsprite(56, 0, sprite(graphics.records[46].images[2]))
Then it looks like we just need to add keys 1 and 2 for the bouncing ball trap. I will use debug images for now until we ID them:
Code: [Select]
# Bouncing Balls:
for i in range(2):
self.addsprite(46, i, variablesprite({
0 : graphics.records[51].images[4],
1 : graphics.debugimage(46, 'T1', 32, 16),
2 : graphics.debugimage(46, 'T2', 32, 16),
3 : graphics.records[51].images[7]},
field='info', hidelabel=True))
After that, it looks like the first three stages are all identified, excluding their palettes. Let's add a few more entries to our palette list and finish those up:
(http://www.zerker.ca/misc/xargon/day23_1.png)
(http://www.zerker.ca/misc/xargon/day23_2.png)
(http://www.zerker.ca/misc/xargon/day23_3.png)
And that's all for today. day23.zip (http://www.zerker.ca/misc/xargon/day23.zip) is available.
Title: Day 24
Post by: Zerker on December 07, 2012, 05:38:51 PM
Good evening. There's not a whole lot left, so this is pretty much turning into a daily progress report until I finish. Almost all of the interesting stuff is already done.
Today, I start with Stage 4, which has one new sprite in the ceiling. It appears to be a ceiling switch of some sort:
(http://www.zerker.ca/misc/xargon/day24_1.png)
Also, I died far too many times in that damn lava pit.
And I'm out of order again. Stage 6 appears to have some timers for periodically triggered events, so I will draw them by adding a prefix to their label number and make them otherwise invisible:
Code: [Select]
# Timers:
for i in [30, 40, 50, 60]:
self.addsprite(73, i, sprite(graphics.records[30].images[19],
labelpref="Timer ", labeloffs = (-4, 4)) )
(http://www.zerker.ca/misc/xargon/day24_2.png)
Stages 5, 7 and 8 are fully identified. I just needed to find the right palette, and voila:
(http://www.zerker.ca/misc/xargon/day24_3.png)
(http://www.zerker.ca/misc/xargon/day24_4.png)
(http://www.zerker.ca/misc/xargon/day24_5.png)
day24.zip (http://www.zerker.ca/misc/xargon/day24.zip) is available.
Title: Day 25
Post by: Zerker on December 08, 2012, 07:31:09 AM
Good Morning. Time for a bit more Episode 3. Stage 9 sees the return of those cloak guys from the last level of Episode 1, be it with a different number:
(http://www.zerker.ca/misc/xargon/day25_1.png)
Stage 10 was fully mapped, but it also proved the value of the doorway identifiers when I was playing it:
(http://www.zerker.ca/misc/xargon/day25_2.png)
Stage 11 has a few new sprites: some snake-like creature, a new pickup gem, a new variant of the bouncing balls, high-jump boots in a treasure box, and a new invisible platform. And a different palette. Nothing we haven't already done.
(http://www.zerker.ca/misc/xargon/day25_3.png)
Stage 13 is the demo stage, and just needs a new palette to finish it off:
(http://www.zerker.ca/misc/xargon/day25_4.png)
Stage 12 just needed us to select the correct palette and...
(http://www.zerker.ca/misc/xargon/day25_5.png)
Augh! No! Wrong! Guess the palette isn't *quite* identical to the earlier stage. Let's use a screenshot from this stage directly:
(http://www.zerker.ca/misc/xargon/day25_6.png)
Better.
Next up is Xargon's Castle, i.e. the last set of levels. I will do that tomorrow. However, I can at least fill in the correct sprites for the map image:
(http://www.zerker.ca/misc/xargon/day25_7.png)
Some assembly required? Let's see if we can't get the alignment on some of these sprites fixed up. After a few attempts, and some careful examination of a screenshot, here's what I came up with:
Code: [Select]
# Xargon's castle:
if epnum == 3:
self.addsprite(88, 7, sprite(graphics.records[47].images[25], yoffs=6, xoffs=4))
self.addsprite(88, 8, sprite(graphics.records[47].images[26], yoffs=6, xoffs=10))
self.addsprite(88, 9, sprite(graphics.records[47].images[27]))
self.addsprite(88, 10, sprite(graphics.records[47].images[28], xoffs=4))
self.addsprite(88, 11, sprite(graphics.records[47].images[29], xoffs=10))
self.addsprite(88, 12, sprite(graphics.records[47].images[30]))
(http://www.zerker.ca/misc/xargon/day25_8.png)
day25.zip (http://www.zerker.ca/misc/xargon/day25.zip) is available.
Title: Re: PC Game Hacking and Mapping Tutorial: Xargon
Post by: Zerker on December 09, 2012, 08:59:31 AM
Hello again. Today we finish Episode 3 of Xargon, and thus the entire game. The first thing I need to do is play the last few levels with an eye to what is missing in the maps, and take screenshots of each so I don't forget. Since I can't save between levels, I'm going to just finish the game in one go then go back and update the maps.
And I finished the game. Now, Stage 14 is the castle stage, and it actually only has one missing sprite: another toggle platform. Let me add it now. Since it has a shadow when it appears (even on the right side), I'm going to create it as a 48 x 32 image and also include the shadow:
Code: [Select]
4: graphics.semitransparent(
graphics.compositeimage((48, 32), [(0, 0, 11, 1),
(16, 0, 11, 1), (0, 16, 11, 2), (16, 16, 11, 2),
(32, 0, 11, 19), (32, 16, 11, 19)]), 128),
(http://www.zerker.ca/misc/xargon/day26_1.png)
However, there appears to be a hidden rapid fire over one of the flame spitters, which as far as I can tell, is not there. This looks like the same issue as the ice cream cone thing. I suspect the "mapping" based on the variant field has priority over the subtype when this behaves as an ordinary hidden item. Since this is the only alternate case I have come across, I will simply add it as a special entry in the sprite DB:
Code: [Select]
for i in range(2):
self.addsprite(73, i, variablesprite({
0 : graphics.records[30].images[19],
1 : graphics.records[30].images[19],
2 : graphics.records[30].images[19],
3 : graphics.compositeimage((32, 32), [(0, 0, 59, 1),
(16, 0, 59, 4), (8, 12, 59, 1)]),
4 : graphics.semitransparent(
graphics.records[37].images[i], 128),
...
Stage 15 only has one new type of bouncing ball, after which it is complete:
(http://www.zerker.ca/misc/xargon/day26_2.png)
The boss & ending stage, Stage 32, has one new sprite for a slug spawner, so we'll clump a couple slugs together for this (also, we need to account for the fact that slugs aren't in Episode 2):
Code: [Select]
if epnum != 2:
slugspawner = graphics.compositeimage((32, 14),
[(2, 0, 62, 2), (-3, 0, 62, 0)])
else:
slugspawner = graphics.records[30].images[19]
...
5 : slugspawner,
Incidentally, Xargon was already identified from the Episode 1 ending. However, the ending picture doesn't show up at all!
(http://www.zerker.ca/misc/xargon/day26_3.png)
Let's look into this further; Going through the entire set of sprites for this map, I can't see anything that looks like it would trigger the ending image. Everything is fairly well identified. The last column in the unidentified header region has the number 143, which is unique. I can only theorize that this must be some special function to draw the ending image. Therefore, we will just have to do it the hard way.
First thing, I'm going to take advantage of my composite sprite code to make up a fake sprite that does not appear in the game to contain the full image. Looking through the graphics output, it appears to be stored in record 57 as 100 16 x 16 pixel chunks (i.e. 10 x 10). Let's put this together:
Code: [Select]
# Fake sprite for the ending scene (which does not appear to have a sprite OR use Tiles):
tilelist = []
for x in range(10):
for y in range(10):
tilelist.append( (x*16, y*16, 57, x + 10*y) )
self.addsprite(1000, 0, sprite(graphics.compositeimage((160, 160), tilelist)))
Then we need to go into GIMP and find out the exact upper-left corner. With that determined, we can add this fake sprite to the end of the sprite list for Episode 3, Stage 32:
Code: [Select]
# Fake Sprite for Episode 3 Ending:
if mapdata.name.upper() == 'BOARD_32' and mapdata.epnum == 3:
mapdata.sprites.append(objrecord( (1000, 48, 240, 0, 0, 160, 160,
0, 0, 0, 0, 0, 0, 0, 0) ))
That worked:
(http://www.zerker.ca/misc/xargon/day26_4.png)
And that's it. The complete game is mapped. I have posted the Episode 3 maps on my web site (http://www.zerker.ca/zzone/2012/12/09/xargon-episode-3-maps/) and submitted them to VGMaps. The only thing remaining (for me) is to do a bit more code cleanup and documentation before I release the tool "officially".
day26.zip (http://www.zerker.ca/misc/xargon/day26.zip) is available if you want to see the complete tool "as-is".
Title: Re: PC Game Hacking and Mapping Tutorial: Xargon
Post by: Zerker on December 10, 2012, 03:41:55 PM
Hey guys. For the next couple days, I'm just going to be adding better comments and interface documentation to the code, as well as writing usage instructions. I won't be posting a daily log of this process, but I will post when everything is complete and on my web site.
If anyone has any questions, they are of course quite welcome.
EDIT: That actually didn't take long. It's released on my web site now (http://www.zerker.ca/zzone/2012/12/11/xargon-mapper-and-resource-extractor/).
|
{
"url": "https://www.vgmaps.com/forums/index.php?action=printpage;topic=1867.0",
"source_domain": "www.vgmaps.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "279461",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NUYLZFPWRJHLB24BTKZQ5GEJGOQPNLPC",
"WARC-Concurrent-To": "<urn:uuid:114cbfb1-6287-4777-a1aa-422b2707d4af>",
"WARC-Date": "2021-09-18T08:21:04Z",
"WARC-IP-Address": "132.148.58.24",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:HQFWIRKJOT5BN46S3ADB33TP5RIWXKXR",
"WARC-Record-ID": "<urn:uuid:5d9d7354-1e87-40d0-9cd5-de01290dbb99>",
"WARC-Target-URI": "https://www.vgmaps.com/forums/index.php?action=printpage;topic=1867.0",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9122f318-e61c-4c98-99f2-7154cb7ea1ab>"
},
"warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-22\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,
8,
108,
109,
161,
211,
1001,
1002,
1354,
1355,
1431,
1466,
1511,
1584,
1585,
1666,
1667,
1849,
1850,
1896,
1897,
2540,
2541,
3105,
3106,
3752,
3753,
3768,
3787,
3809,
3810,
3837,
3863,
3918,
3923,
3927,
3937,
3975,
4018,
4058,
4059,
4131,
4200,
4262,
4283,
4328,
4329,
4374,
4431,
4459,
4460,
4538,
4614,
4656,
4695,
4779,
4780,
4845,
4896,
4937,
4972,
4973,
5212,
5213,
5235,
5236,
5282,
5283,
5764,
5765,
5780,
5799,
5821,
5822,
5849,
5875,
5930,
5935,
5939,
5949,
5987,
6030,
6070,
6071,
6143,
6212,
6274,
6295,
6341,
6342,
6387,
6444,
6472,
6473,
6551,
6627,
6670,
6710,
6794,
6795,
6860,
6912,
6953,
6988,
6989,
6999,
7000,
7046,
7047,
7383,
7384,
7399,
7418,
7440,
7441,
7468,
7494,
7549,
7554,
7558,
7568,
7606,
7649,
7689,
7690,
7762,
7831,
7893,
7914,
7960,
7961,
8006,
8063,
8091,
8092,
8170,
8246,
8289,
8329,
8413,
8414,
8479,
8531,
8572,
8619,
8620,
8657,
8703,
8716,
8766,
9147,
9148,
9194,
9195,
9632,
9633,
9648,
9671,
9693,
9694,
9721,
9747,
9812,
9817,
9821,
9831,
9869,
9918,
9966,
9967,
10035,
10084,
10128,
10129,
10181,
10236,
10282,
10323,
10403,
10404,
10477,
10550,
10580,
10581,
10632,
10683,
10725,
10762,
10821,
10822,
10843,
10889,
10890,
11315,
11316,
11527,
11528,
11574,
11575,
11978,
11993,
12021,
12043,
12044,
12071,
12097,
12162,
12167,
12171,
12181,
12219,
12268,
12316,
12317,
12345,
12346,
12393,
12454,
12455,
12483,
12484,
12538,
12553,
12639,
12708,
12741,
12758,
12759,
12851,
12866,
12883,
13344,
13345,
13649,
13650,
13696,
13697,
13831,
13832,
13847,
13875,
13897,
13898,
13925,
13951,
14016,
14021,
14025,
14035,
14073,
14122,
14170,
14171,
14199,
14200,
14247,
14308,
14309,
14346,
14347,
14376,
14377,
14426,
14488,
14489,
14517,
14518,
14547,
14548,
14563,
14580,
15041,
15059,
15440,
15441,
15590,
15605,
15639,
15644,
15678,
15683,
15717,
15721,
15722,
16516,
16564,
16565,
16691,
16703,
16704,
16922,
16923,
16985,
16986,
17144,
17186,
17187,
17214,
17252,
17253,
17330,
17331,
17724,
17725,
17773,
17782,
17826,
17827,
17903,
17918,
17951,
17973,
17974,
18008,
18033,
18059,
18098,
18152,
18153,
18154,
18181,
18207,
18272,
18277,
18281,
18291,
18329,
18378,
18426,
18427,
18455,
18456,
18503,
18564,
18565,
18602,
18603,
18632,
18633,
18682,
18744,
18745,
18810,
18912,
18913,
18941,
18994,
19039,
19086,
19087,
19094,
19156,
19218,
19280,
19343,
19405,
19467,
19531,
19595,
19658,
19721,
19784,
19847,
19911,
19975,
20039,
20102,
20166,
20230,
20293,
20356,
20419,
20482,
20546,
20610,
20674,
20737,
20801,
20864,
20928,
20991,
21053,
21115,
21178,
21241,
21303,
21365,
21427,
21489,
21551,
21613,
21676,
21738,
21802,
21864,
21910,
21923,
21973,
22427,
22428,
22870,
22871,
22886,
22919,
22941,
22942,
22968,
23034,
23057,
23065,
23102,
23129,
23130,
23155,
23198,
23243,
23287,
23288,
23312,
23355,
23412,
23413,
23446,
23447,
23472,
23517,
23575,
23576,
23636,
23709,
23787,
23788,
23823,
23869,
23910,
23969,
24061,
24062,
24091,
24119,
24174,
24263,
24264,
24265,
24292,
24349,
24378,
24403,
24404,
24434,
24464,
24514,
24573,
24574,
24611,
24649,
24650,
24675,
24676,
24737,
24805,
24860,
24897,
24934,
24935,
24936,
24965,
24993,
25046,
25121,
25122,
25123,
25150,
25176,
25241,
25246,
25250,
25260,
25324,
25369,
25409,
25410,
25448,
25504,
25552,
25592,
25593,
25803,
25804,
26269,
26270,
26486,
26487,
26533,
26534,
27142,
27150,
27151,
27621,
27622,
27673,
27688,
27723,
27773,
27821,
27870,
27940,
27989,
28022,
28103,
28147,
28227,
28251,
28296,
28297,
28349,
28364,
28413,
28425,
28427,
28440,
28442,
28460,
28496,
28502,
28503,
28604,
28619,
28652,
28674,
28675,
28701,
28767,
28790,
28798,
28835,
28862,
28863,
28888,
28931,
28976,
29020,
29021,
29045,
29088,
29145,
29146,
29179,
29180,
29205,
29250,
29308,
29309,
29369,
29442,
29520,
29521,
29556,
29602,
29643,
29702,
29794,
29795,
29824,
29852,
29907,
29996,
29997,
29998,
30025,
30082,
30111,
30136,
30137,
30167,
30197,
30247,
30306,
30307,
30347,
30372,
30373,
30419,
30479,
30513,
30514,
30572,
30617,
30654,
30691,
30692,
30693,
30722,
30750,
30803,
30878,
30879,
30880,
30907,
30933,
30998,
31003,
31007,
31017,
31081,
31126,
31166,
31167,
31205,
31261,
31309,
31349,
31350,
31413,
31459,
31460,
31471,
31472,
31830,
31831,
31843,
31858,
31891,
31913,
31914,
31940,
32006,
32029,
32037,
32074,
32101,
32102,
32127,
32170,
32215,
32259,
32260,
32284,
32327,
32384,
32385,
32418,
32419,
32444,
32489,
32547,
32548,
32608,
32681,
32759,
32760,
32795,
32841,
32882,
32941,
33033,
33034,
33063,
33091,
33146,
33235,
33236,
33237,
33264,
33265,
33283,
33311,
33379,
33434,
33446,
33499,
33543,
33586,
33587,
33643,
33670,
33704,
33705,
33740,
33776,
33800,
33801,
33858,
33887,
33912,
33913,
33943,
33973,
34023,
34082,
34083,
34123,
34148,
34149,
34195,
34255,
34289,
34290,
34348,
34393,
34430,
34483,
34484,
34485,
34514,
34542,
34595,
34670,
34671,
34672,
34699,
34725,
34790,
34795,
34799,
34809,
34873,
34918,
34958,
34959,
34997,
35053,
35101,
35141,
35142,
35195,
35208,
35258,
35410,
35411,
35921,
35922,
36424,
36425,
36643,
36644,
36864,
36865,
36866,
37022,
37037,
37054,
37089,
37138,
37156,
37193,
37243,
37244,
37296,
37361,
37417,
37418,
37798,
37799,
37814,
37841,
37842,
37860,
37888,
37956,
38011,
38023,
38076,
38120,
38163,
38164,
38220,
38247,
38281,
38282,
38317,
38353,
38377,
38378,
38435,
38464,
38489,
38490,
38515,
38516,
38539,
38573,
38607,
38661,
38724,
38725,
38769,
38770,
38820,
38884,
38922,
38923,
38985,
39034,
39075,
39132,
39133,
39208,
39273,
39302,
39406,
39437,
39547,
39548,
39562,
39593,
39622,
39623,
39624,
39653,
39684,
39716,
39773,
39852,
39853,
39874,
39875,
39890,
39940,
39991,
40044,
40097,
40151,
40204,
40258,
40312,
40366,
40419,
40473,
40527,
40581,
40635,
40690,
40745,
40800,
40855,
40910,
40965,
41020,
41075,
41130,
41185,
41240,
41295,
41350,
41405,
41460,
41515,
41570,
41625,
41680,
41735,
41790,
41845,
41900,
41955,
42010,
42065,
42120,
42175,
42230,
42285,
42340,
42395,
42450,
42505,
42560,
42613,
42668,
42723,
42778,
42833,
42889,
42945,
43000,
43055,
43111,
43112,
43741,
43742,
43757,
43793,
43794,
43832,
43884,
43910,
43943,
43997,
44038,
44071,
44120,
44121,
44278,
44279,
44458,
44459,
44474,
44522,
44551,
44576,
44577,
44602,
44649,
44682,
44683,
44706,
44740,
44774,
44828,
44891,
44892,
44940,
44941,
44955,
44986,
45015,
45016,
45065,
45093,
45142,
45143,
45193,
45257,
45300,
45372,
45407,
45473,
45521,
45568,
45634,
45692,
45737,
45798,
45799,
45874,
45944,
45973,
46077,
46108,
46218,
46219,
46245,
46311,
46356,
46412,
46447,
46479,
46539,
46553,
46605,
46606,
46633,
46634,
46649,
46701,
46757,
46813,
46814,
46854,
46895,
46896,
46943,
46964,
47014,
47036,
47086,
47096,
47146,
47147,
47546,
47547,
47979,
47994,
48017,
48039,
48040,
48065,
48099,
48152,
48210,
48266,
48325,
48326,
48394,
48433,
48473,
48474,
48518,
48571,
48595,
48596,
48620,
48691,
48713,
48726,
48727,
48753,
48827,
48899,
48938,
48974,
49056,
49057,
49118,
49166,
49203,
49257,
49258,
49259,
49286,
49312,
49367,
49372,
49376,
49386,
49424,
49465,
49495,
49527,
49528,
49584,
49634,
49675,
49676,
49999,
50012,
50062,
50400,
50401,
50466,
50467,
50536,
50537,
50956,
50957,
51166,
51167,
51182,
51234,
51235,
51249,
51279,
51326,
51327,
51378,
51410,
51418,
51470,
51535,
51571,
51640,
51661,
51662,
51728,
51729,
51744,
51765,
51833,
51859,
51860,
51935,
51950,
51978,
52014,
52015,
52467,
52468,
52754,
52755,
52770,
52781,
52803,
52835,
52872,
52873,
52901,
52944,
53005,
53038,
53039,
53095,
53141,
53183,
53244,
53275,
53276,
53296,
53345,
53346,
53347,
53374,
53400,
53480,
53485,
53489,
53499,
53545,
53583,
53624,
53625,
53685,
53741,
53797,
53823,
53824,
53878,
53879,
53925,
53926,
53963,
53964,
54010,
54011,
54509,
54510,
54525,
54557,
54598,
54651,
54695,
54748,
54762,
54806,
54807,
54912,
54913,
54959,
54960,
55070,
55071,
55117,
55118,
55560,
55561,
55576,
55627,
55628,
55642,
55665,
55715,
55754,
55806,
55890,
55926,
56017,
56108,
56129,
56130,
56292,
56293,
56308,
56336,
56362,
56404,
56432,
56474,
56523,
56577,
56626,
56680,
56729,
56787,
56836,
56893,
56942,
56999,
57048,
57106,
57155,
57213,
57262,
57320,
57330,
57370,
57371,
57417,
57418,
58074,
58075,
58173,
58202,
58203,
58394,
58395,
58416,
58431,
58464,
58508,
58509,
58533,
58588,
58589,
58623,
58668,
58706,
58707,
58731,
58732,
58762,
58802,
58855,
58916,
58954,
58983,
59031,
59113,
59114,
59149,
59195,
59236,
59295,
59349,
59350,
59351,
59378,
59404,
59463,
59468,
59472,
59482,
59520,
59565,
59612,
59613,
59708,
59723,
59745,
59769,
59793,
59817,
59841,
59865,
59890,
59913,
59936,
59960,
59984,
60009,
60034,
60057,
60080,
60103,
60126,
60150,
60174,
60197,
60220,
60243,
60267,
60291,
60315,
60339,
60364,
60389,
60414,
60439,
60440,
60671,
60672,
60679,
60689,
60751,
60813,
60875,
60937,
60999,
61061,
61123,
61185,
61247,
61309,
61371,
61433,
61495,
61557,
61619,
61681,
61743,
61805,
61867,
61929,
61991,
62053,
62115,
62177,
62239,
62301,
62363,
62425,
62487,
62549,
62611,
62673,
62735,
62797,
62859,
62921,
62983,
63045,
63064,
63120,
63175,
63328,
63384,
63436,
63682,
63683,
63697,
63705,
63728,
63729,
63836,
63892,
63942,
64711,
64712,
65271,
65272,
65476,
65731,
65921,
65922,
66152,
66153,
66288,
66383,
66455,
66456,
66682,
66683,
66835,
66836,
66851,
66881,
66922,
66956,
66957,
66977,
66998,
66999,
67025,
67061,
67110,
67167,
67201,
67245,
67323,
67324,
67375,
67376,
67470,
67471,
67486,
67524,
67549,
67593,
67603,
67654,
67655,
67694,
67734,
67735,
67792,
67793,
67850,
67865,
67914,
67971,
68000,
68001,
68053,
68095,
68133,
68200,
68227,
68228,
68244,
68245,
68291,
68292,
68573,
68574,
68620,
68621,
68673,
68674,
68720,
68721,
69067,
69068,
69083,
69121,
69146,
69188,
69198,
69249,
69250,
69285,
69321,
69322,
69375,
69376,
69422,
69423,
69938,
69939,
70251,
70252,
70267,
70307,
70308,
70346,
70371,
70413,
70423,
70474,
70475,
70510,
70546,
70547,
70617,
70662,
70685,
70724,
70782,
70796,
70840,
70841,
70894,
70895,
70938,
70953,
70967,
70990,
71040,
71075,
71127,
71188,
71224,
71310,
71331,
71332,
71548,
71549,
71595,
71596,
71638,
71639,
71711,
71726,
71773,
71794,
71844,
71866,
71916,
71926,
71976,
71977,
72150,
72151,
72197,
72198,
72306,
72307,
72353,
72354,
72574,
72575,
72807,
72820,
72870,
73008,
73110,
73135,
73136,
73186,
73232,
73233,
73604,
73605,
73651,
73652,
73816,
73817,
73863,
73864,
74199,
74292,
74293,
74708,
74709,
74742,
74757,
74850,
74943,
75036,
75129,
75222,
75315,
75316,
75370,
75385,
75386,
75554,
75569,
75584,
75599,
75614,
75629,
75644,
75659,
75674,
75689,
75704,
75719,
75734,
75749,
75764,
75765,
75852,
75853,
76045,
76060,
76149,
76242,
76335,
76428,
76521,
76614,
76707,
76800,
76893,
76986,
77079,
77172,
77265,
77266,
77475,
77476,
77491,
77516,
77550,
77603,
77659,
77718,
77719,
77783,
77822,
77862,
77863,
77907,
77960,
77961,
78017,
78044,
78077,
78078,
78144,
78199,
78200,
78246,
78301,
78338,
78339,
78397,
78424,
78425,
78481,
78507,
78543,
78580,
78638,
78695,
78723,
78763,
78764,
78788,
78789,
78790,
78814,
78885,
78945,
79001,
79042,
79074,
79148,
79149,
79189,
79250,
79291,
79331,
79332,
79380,
79441,
79482,
79541,
79542,
79581,
79582,
79597,
79670,
79743,
79816,
79889,
79962,
80035,
80108,
80181,
80254,
80327,
80400,
80473,
80546,
80619,
80692,
80765,
80838,
80911,
80983,
81056,
81057,
81401,
81402,
81497,
81543,
81544,
81692,
81724,
81725,
81734,
81766,
81767,
82206,
82207,
82228,
82243,
82318,
82393,
82468,
82543,
82544,
82771,
82786,
82853,
82928,
83003,
83078,
83153,
83154,
83182,
83211,
83254,
83277,
83278,
83314,
83332,
83360,
83382,
83383,
83690,
83691,
83782,
83838,
83888,
84279,
84288,
84320,
84321,
84333,
84365,
84366,
84378,
84393,
84468,
84543,
84618,
84693,
84694,
84824,
84825,
84840,
84915,
84990,
85065,
85140,
85141,
85490,
85491,
85506,
85554,
85578,
85579,
85630,
85631,
85669,
85716,
85745,
85746,
85810,
85877,
85900,
85944,
85995,
85996,
86109,
86126,
86141,
86154,
86155,
86850,
86851,
87239,
87240,
87255,
87278,
87302,
87325,
87336,
87337,
87389,
87430,
87470,
87471,
87498,
87544,
87608,
87618,
87667,
87668,
87742,
87792,
87847,
87848,
87880,
87881,
87896,
87927,
87989,
87990,
88036,
88037,
88110,
88337,
88523,
88671,
88672,
89072,
89073,
89088,
89112,
89146,
89172,
89173,
89206,
89275,
89305,
89384,
89385,
89410,
89465,
89493,
89515,
89549,
89622,
89623,
89689,
89722,
89723,
89775,
89820,
89864,
89865,
89906,
89993,
89994,
90072,
90126,
90207,
90208,
90238,
90253,
90291,
90337,
90370,
90409,
90472,
90537,
90577,
90646,
90700,
90725,
90735,
90771,
90821,
90822,
90868,
90869,
91091,
91092,
91158,
91159,
91205,
91206,
91539,
91554,
91624,
91694,
91764,
91834,
91904,
91974,
92044,
92045,
92353,
92354,
92445,
92458,
92508,
92873,
92874,
92928,
92943,
92968,
93000,
93030,
93083,
93145,
93146,
93213,
93214,
93529,
93544,
93558,
93606,
93652,
93685,
93736,
93770,
93806,
93867,
93907,
93980,
94065,
94123,
94148,
94158,
94194,
94244,
94245,
94431,
94432,
94447,
94471,
94522,
94562,
94601,
94649,
94650,
94684,
94710,
94739,
94740,
94805,
94883,
94884,
94949,
95029,
95071,
95113,
95158,
95254,
95255,
95280,
95335,
95365,
95389,
95447,
95545,
95546,
95612,
95645,
95646,
95692,
95743,
95811,
95878,
95951,
95998,
95999,
96077,
96078,
96100,
96149,
96176,
96203,
96230,
96231,
96271,
96349,
96403,
96463,
96510,
96511,
96557,
96558,
96781,
96782,
96828,
96829,
96861,
96862,
96908,
96909,
96988,
96989,
97035,
97036,
97438,
97439,
97506,
97520,
97570,
97966,
97967,
97982,
98004,
98068,
98095,
98122,
98149,
98182,
98183,
98223,
98301,
98355,
98415,
98462,
98463,
98492,
98558,
98625,
98703,
98704,
98705,
98740,
98755,
98781,
98847,
98899,
98951,
98962,
99049,
99112,
99113,
99160,
99161,
99236,
99301,
99343,
99344,
99744,
99745,
99792,
99793,
99955,
99956,
100145,
100160,
100235,
100309,
100383,
100457,
100531,
100605,
100679,
100753,
100827,
100901,
100975,
101049,
101123,
101197,
101271,
101272,
101698,
101699,
101930,
101945,
101964,
101983,
102002,
102012,
102022,
102032,
102042,
102052,
102062,
102072,
102082,
102092,
102102,
102112,
102113,
102579,
102667,
102808,
102809,
102997,
102998,
103013,
103038,
103070,
103100,
103166,
103228,
103264,
103265,
103311,
103326,
103392,
103445,
103532,
103569,
103570,
103617,
103632,
103664,
103714,
103748,
103749,
103840,
103855,
103883,
103933,
103934,
104303,
104304,
104319,
104345,
104385,
104410,
104443,
104444,
104493,
104534,
104610,
104687,
104688,
104716,
104717,
104764,
104765,
104794,
104795,
104842,
104843,
104990,
104991,
105220,
105221,
105268,
105269,
105335,
105336,
105926,
105927,
105996,
106010,
106060,
106253,
106254,
106301,
106302,
106983,
106984,
106999,
107050,
107096,
107143,
107200,
107256,
107277,
107278,
107293,
107372,
107440,
107496,
107497,
107530,
107577,
107578,
107871,
107872,
107887,
107901,
107938,
108011,
108063,
108064,
108106,
108107,
108122,
108194,
108247,
108273,
108351,
108416,
108470,
108471,
108485,
108532,
108533,
108569,
108570,
109049,
109050,
109159,
109160,
109202,
109249,
109250,
109299,
109314,
109380,
109446,
109512,
109578,
109644,
109710,
109776,
109842,
109908,
109974,
110040,
110106,
110172,
110238,
110304,
110370,
110436,
110502,
110568,
110634,
110700,
110766,
110832,
110898,
110964,
111030,
111031,
111340,
111341,
111356,
111386,
111430,
111474,
111533,
111586,
111639,
111688,
111741,
111793,
111807,
111830,
111853,
111886,
111887,
111936,
112013,
112058,
112128,
112129,
112191,
112254,
112328,
112329,
112583,
112584,
112631,
112632,
112984,
112999,
113045,
113083,
113108,
113137,
113178,
113179,
113224,
113239,
113273,
113328,
113362,
113416,
113417,
113605,
113606,
113621,
113654,
113687,
113719,
113755,
113818,
113819,
113858,
113859,
113874,
113902,
113968,
113969,
114173,
114174,
114189,
114225,
114255,
114261,
114291,
114320,
114321,
114461,
114462,
114895,
114896,
114911,
114941,
114993,
115037,
115070,
115093,
115116,
115149,
115150,
115199,
115276,
115323,
115393,
115394,
115456,
115490,
115557,
115635,
115636,
115727,
115742,
115767,
115822,
115863,
115908,
115950,
115951,
115999,
116033,
116066,
116099,
116133,
116169,
116203,
116236,
116247,
116315,
116378,
116379,
116428,
116443,
116455,
116494,
116535,
116577,
116578,
116723,
116724,
116739,
116794,
116849,
116880,
116881,
116934,
116981,
116982,
117114,
117128,
117178,
117578,
117579,
117917,
117918,
117933,
117984,
118031,
118095,
118158,
118227,
118270,
118271,
118354,
118355,
118380,
118461,
118462,
118463,
118510,
118559,
118592,
118629,
118678,
118711,
118744,
118776,
118815,
118880,
118933,
118934,
118981,
118982,
119251,
119252,
119512,
119513,
119528,
119557,
119585,
119640,
119681,
119696,
119729,
119756,
119784,
119837,
119926,
119927,
120120,
120121,
120168,
120169,
120574,
120575,
121045,
121046,
121061,
121091,
121162,
121206,
121239,
121262,
121285,
121318,
121345,
121346,
121395,
121472,
121533,
121603,
121604,
121666,
121700,
121767,
121845,
121860,
121870,
121909,
121950,
121992,
122016,
122017,
122407,
122408,
122440,
122441,
122488,
122489,
122646,
122660,
122710,
122758,
122759,
123131,
123195,
123304,
123305,
123583,
123584,
123977,
123978,
123993,
124021,
124071,
124086,
124124,
124148,
124199,
124244,
124259,
124305,
124332,
124360,
124381,
124438,
124531,
124545,
124606,
124699,
124700,
124880,
124881,
125158,
125159,
125532,
125533,
125548,
125597,
125612,
125634,
125635,
125661,
125679,
125706,
125755,
125797,
125845,
125895,
125929,
125953,
125954,
125996,
126062,
126160,
126161,
126199,
126229,
126288,
126319,
126402,
126403,
126404,
126431,
126457,
126522,
126527,
126531,
126541,
126579,
126622,
126666,
126710,
126749,
126788,
126789,
126836,
126837,
127016,
127017,
127074,
127089,
127119,
127159,
127198,
127207,
127225,
127259,
127308,
127365,
127413,
127466,
127479,
127490,
127506,
127528,
127568,
127614,
127644,
127694,
127777,
127848,
127908,
127951,
127986,
128438,
128439,
128491,
128506,
128520,
128538,
128551,
128575,
128584,
128601,
128613,
128624,
128635,
128647,
128654,
128657,
128660,
128663,
128666,
128669,
128672,
128675,
128678,
128686,
128703,
128715,
128726,
128737,
128749,
128756,
128759,
128762,
128765,
128768,
128771,
128774,
128777,
128780,
128788,
128789,
128831,
128846,
128865,
128884,
128919,
128970,
129006,
129090,
129137,
129173,
129454,
129455,
129894,
129895,
129910,
129941,
129999,
130017,
130051,
130100,
130101,
130377,
130378,
130393,
130424,
130482,
130500,
130534,
130552,
130571,
130586,
130600,
130649,
130650,
130718,
130719,
130734,
130750,
130822,
130894,
130895,
131013,
131014,
131061,
131062,
131356,
131357,
131372,
131402,
131452,
131453,
131500,
131501,
131528,
131529,
131644,
131645,
131883,
131884,
131931,
131932,
132212,
132213,
132228,
132289,
132351,
132378,
132408,
132414,
132444,
132445,
132446,
132520,
132534,
132584,
132989,
132990,
133159,
133160,
133258,
133273,
133289,
133315,
133393,
133471,
133472,
133519,
133520,
133642,
133643,
133690,
133691,
133706,
133767,
133839,
133869,
133904,
133934,
133940,
133970,
133971,
133986,
134025,
134065,
134066,
134305,
134306,
134321,
134337,
134376,
134416,
134458,
134495,
134519,
134520,
134535,
134565,
134650,
134694,
134727,
134750,
134773,
134806,
134837,
134864,
134865,
134914,
134991,
135052,
135085,
135166,
135236,
135237,
135299,
135333,
135400,
135478,
135479,
135628,
135629,
135676,
135677,
136043,
136044,
136059,
136131,
136187,
136217,
136245,
136255,
136294,
136335,
136376,
136423,
136464,
136512,
136534,
136535,
136617,
136632,
136655,
136690,
136737,
136795,
136842,
136902,
136970,
137053,
137115,
137181,
137243,
137282,
137358,
137409,
137466,
137467,
137561,
137562,
137577,
137628,
137637,
137688,
137756,
137823,
137896,
137943,
137944,
138031,
138032,
138062,
138148,
138160,
138255,
138333,
138365,
138395,
138396,
138498,
138526,
138541,
138611,
138646,
138655,
138656,
138726,
138761,
138770,
138771,
138870,
138871,
138886,
138923,
138979,
138980,
139123,
139124,
139277,
139291,
139341,
139611,
139612,
139659,
139660,
139843,
139844,
139859,
139910,
139962,
139991,
139992,
140033,
140098,
140170,
140171,
140208,
140223,
140257,
140317,
140348,
140408,
140409,
140554,
140555,
140570,
140589,
140628,
140668,
140709,
140728,
140729,
140752,
140753,
140800,
140801,
140949,
140950,
140997,
140998,
141247,
141248,
141263,
141329,
141368,
141401,
141459,
141491,
141524,
141582,
141615,
141623,
141624,
141642,
141689,
141690,
142056,
142057,
142075,
142122,
142123,
142317,
142318,
142365,
142366,
142435,
142491,
142541,
142628,
142629,
142828,
142829,
142939,
142954,
142972,
142991,
143046,
143090,
143091,
143108,
143109,
143156,
143157,
143170,
143171,
143218,
143219,
143480,
143494,
143544,
143976,
143977,
143992,
144039,
144040,
144305,
144306,
144321,
144393,
144449,
144479,
144507,
144527,
144566,
144607,
144648,
144706,
144747,
144781,
144828,
144850,
144851,
144876,
144923,
144924,
145251,
145252,
145299,
145300,
145315,
145360,
145397,
145398,
145429,
145505,
145581,
145647,
145725,
145790,
145800,
145876,
145957,
145958,
146005,
146006,
146165,
146166,
146456,
146457,
146526,
146561,
146611,
146733,
146734,
146820,
146821,
146880,
146895,
146929,
146975,
147011,
147054,
147099,
147160,
147161,
147361,
147362,
147377,
147398,
147457,
147531,
147532,
148007,
148008,
148023,
148045,
148110,
148157,
148184,
148211,
148238,
148273,
148308,
148343,
148344,
148393,
148471,
148525,
148585,
148632,
148633,
148706,
148776,
148824,
148825,
148882,
148923,
148968,
149025,
149066,
149107,
149147,
149194,
149273,
149346,
149402,
149403,
149677,
149678,
149693,
149767,
149857,
149858,
149885,
149886,
149901,
149926,
149960,
150041,
150070,
150071,
150146,
150147,
150552,
150553,
150730,
150731,
150746,
150780,
150805,
150824,
150825,
150898,
150933,
150966,
151033,
151063,
151126,
151127,
151159,
151201,
151202,
151258,
151293,
151355,
151383,
151384,
151470,
151471,
151564,
151565,
151826,
151827,
151828,
151967,
151982,
152048,
152114,
152180,
152246,
152312,
152378,
152444,
152510,
152576,
152642,
152643,
152986,
152987,
153002,
153014,
153022,
153061,
153102,
153143,
153184,
153225,
153265,
153305,
153346,
153387,
153428,
153437,
153438,
153510,
153603,
153604,
153798,
153799,
153889,
153904,
153943,
153985,
154027,
154069,
154110,
154150,
154190,
154230,
154270,
154309,
154318,
154319,
154507,
154508,
154604,
154605,
154606,
154730,
154731,
154746,
154778,
154834,
154867,
154929,
155002,
155003,
155414,
155415,
155721,
155736,
155767,
155803,
155848,
155885,
155922,
155959,
155996,
156035,
156036,
156074,
156110,
156111,
156193,
156194,
156392,
156393,
156622,
156636,
156686,
156883,
156884,
156977,
156978,
157234,
157235,
157544,
157545,
157737,
157752,
157782,
157808,
157809,
157824,
157855,
157859,
157879,
157902,
157924,
157947,
157953,
157976,
157991,
158006,
158070,
158156,
158157,
158314,
158329,
158349,
158365,
158395,
158417,
158433,
158463,
158469,
158485,
158551,
158585,
158624,
158658,
158700,
158734,
158790,
158824,
158834,
158868,
158869,
158913,
158914,
158939,
158940,
158955,
158971,
159017,
159042,
159111,
159112,
159255,
159256,
159271,
159285,
159300,
159343,
159388,
159432,
159476,
159519,
159548,
159549,
159553,
159554,
159570,
159585,
159615,
159697,
159779,
159780,
159781,
159824,
159825,
159826,
160146,
160147,
160162,
160228,
160267,
160313,
160359,
160392,
160450,
160482,
160515,
160573,
160606,
160614,
160615,
160666,
160667,
161043,
161058,
161122,
161123,
161207,
161254,
161255,
161387,
161388,
161617,
161632,
161709,
161793,
161794,
161888,
161889,
161904,
161944,
161975,
162003,
162041,
162042,
162123,
162151,
162180,
162243,
162269,
162328,
162365,
162393,
162394,
162462,
162509,
162510,
162736,
162737,
162752,
162764,
162779,
162822,
162867,
162911,
162955,
162999,
163012,
163016,
163029,
163044,
163087,
163131,
163175,
163188,
163189,
163286,
163333,
163334,
163600,
163601,
163616,
163694,
163695,
163699,
163700,
163746,
163801,
163802,
163814,
163861,
163862,
163919,
163920,
163989,
164045,
164095,
164340,
164341,
164388,
164389,
164464,
164465,
164512,
164513,
164596,
164597,
164644,
164645,
164737,
164784,
164785,
164890,
164904,
164954,
165098,
165099,
165206,
165207,
165254,
165255,
165493,
165494,
165509,
165527,
165546,
165589,
165633,
165678,
165717,
165718,
165819,
165820,
165867,
165868,
166226,
166227,
166274,
166275,
166478,
166479,
166494,
166509,
166530,
166596,
166597,
166644,
166645,
166714,
166728,
166778,
166869,
166870,
166917,
166918,
166938,
166985,
166986,
166994,
167041,
167042,
167088,
167135,
167136,
167278,
167325,
167326,
167472,
167473,
167488,
167526,
167588,
167625,
167626,
167659,
167701,
167702,
167774,
167775,
167844,
167858,
167908,
168082,
168083,
168182,
168197,
168223,
168258,
168306,
168364,
168411,
168459,
168525,
168591,
168627,
168628,
168714,
168715,
168730,
168745,
168763,
168829,
168830,
168960,
168961,
168976,
168994,
169013,
169056,
169100,
169151,
169202,
169247,
169286,
169287,
169452,
169453,
169500,
169547,
169594,
169595,
169690,
169704,
169754,
169927,
169928,
170046,
170093,
170148,
170149,
170150,
170345,
170346,
170361,
170371,
170398,
170464,
170515,
170516,
170563,
170564,
170656,
170657,
170704,
170751,
170798,
170799,
170868,
170882,
170932,
171086,
171133,
171134,
171240,
171287,
171288,
171524,
171525,
171572,
171573,
171648,
171695,
171696,
171757,
171804,
171805,
171935,
171982,
171983,
171991,
171992,
172145,
172192,
172193,
172388,
172389,
172404,
172423,
172438,
172524,
172611,
172679,
172756,
172834,
172902,
172903,
172950,
172951,
173020,
173076,
173126,
173464,
173465,
173749,
173764,
173793,
173846,
173898,
173944,
173945,
173992,
173993,
174419,
174434,
174453,
174496,
174541,
174586,
174631,
174693,
174738,
174776,
174826,
174838,
174839,
174916,
174917,
174964,
174965,
175159,
175160,
175175,
175190,
175242,
175287,
175293,
175343,
175344,
175348,
175349,
175366,
175367,
175490,
175491,
175538,
175539,
175958,
175959,
176256,
176257,
176272,
176362,
176376,
176396,
176420,
176474,
176553,
176554,
176730,
176731,
176746,
176782,
176844,
176914,
176949,
176950,
176963,
177010,
177011,
177321,
177322,
177436,
177492,
177542,
177814,
177815,
177878,
177879
],
"line_end_idx": [
7,
8,
108,
109,
161,
211,
1001,
1002,
1354,
1355,
1431,
1466,
1511,
1584,
1585,
1666,
1667,
1849,
1850,
1896,
1897,
2540,
2541,
3105,
3106,
3752,
3753,
3768,
3787,
3809,
3810,
3837,
3863,
3918,
3923,
3927,
3937,
3975,
4018,
4058,
4059,
4131,
4200,
4262,
4283,
4328,
4329,
4374,
4431,
4459,
4460,
4538,
4614,
4656,
4695,
4779,
4780,
4845,
4896,
4937,
4972,
4973,
5212,
5213,
5235,
5236,
5282,
5283,
5764,
5765,
5780,
5799,
5821,
5822,
5849,
5875,
5930,
5935,
5939,
5949,
5987,
6030,
6070,
6071,
6143,
6212,
6274,
6295,
6341,
6342,
6387,
6444,
6472,
6473,
6551,
6627,
6670,
6710,
6794,
6795,
6860,
6912,
6953,
6988,
6989,
6999,
7000,
7046,
7047,
7383,
7384,
7399,
7418,
7440,
7441,
7468,
7494,
7549,
7554,
7558,
7568,
7606,
7649,
7689,
7690,
7762,
7831,
7893,
7914,
7960,
7961,
8006,
8063,
8091,
8092,
8170,
8246,
8289,
8329,
8413,
8414,
8479,
8531,
8572,
8619,
8620,
8657,
8703,
8716,
8766,
9147,
9148,
9194,
9195,
9632,
9633,
9648,
9671,
9693,
9694,
9721,
9747,
9812,
9817,
9821,
9831,
9869,
9918,
9966,
9967,
10035,
10084,
10128,
10129,
10181,
10236,
10282,
10323,
10403,
10404,
10477,
10550,
10580,
10581,
10632,
10683,
10725,
10762,
10821,
10822,
10843,
10889,
10890,
11315,
11316,
11527,
11528,
11574,
11575,
11978,
11993,
12021,
12043,
12044,
12071,
12097,
12162,
12167,
12171,
12181,
12219,
12268,
12316,
12317,
12345,
12346,
12393,
12454,
12455,
12483,
12484,
12538,
12553,
12639,
12708,
12741,
12758,
12759,
12851,
12866,
12883,
13344,
13345,
13649,
13650,
13696,
13697,
13831,
13832,
13847,
13875,
13897,
13898,
13925,
13951,
14016,
14021,
14025,
14035,
14073,
14122,
14170,
14171,
14199,
14200,
14247,
14308,
14309,
14346,
14347,
14376,
14377,
14426,
14488,
14489,
14517,
14518,
14547,
14548,
14563,
14580,
15041,
15059,
15440,
15441,
15590,
15605,
15639,
15644,
15678,
15683,
15717,
15721,
15722,
16516,
16564,
16565,
16691,
16703,
16704,
16922,
16923,
16985,
16986,
17144,
17186,
17187,
17214,
17252,
17253,
17330,
17331,
17724,
17725,
17773,
17782,
17826,
17827,
17903,
17918,
17951,
17973,
17974,
18008,
18033,
18059,
18098,
18152,
18153,
18154,
18181,
18207,
18272,
18277,
18281,
18291,
18329,
18378,
18426,
18427,
18455,
18456,
18503,
18564,
18565,
18602,
18603,
18632,
18633,
18682,
18744,
18745,
18810,
18912,
18913,
18941,
18994,
19039,
19086,
19087,
19094,
19156,
19218,
19280,
19343,
19405,
19467,
19531,
19595,
19658,
19721,
19784,
19847,
19911,
19975,
20039,
20102,
20166,
20230,
20293,
20356,
20419,
20482,
20546,
20610,
20674,
20737,
20801,
20864,
20928,
20991,
21053,
21115,
21178,
21241,
21303,
21365,
21427,
21489,
21551,
21613,
21676,
21738,
21802,
21864,
21910,
21923,
21973,
22427,
22428,
22870,
22871,
22886,
22919,
22941,
22942,
22968,
23034,
23057,
23065,
23102,
23129,
23130,
23155,
23198,
23243,
23287,
23288,
23312,
23355,
23412,
23413,
23446,
23447,
23472,
23517,
23575,
23576,
23636,
23709,
23787,
23788,
23823,
23869,
23910,
23969,
24061,
24062,
24091,
24119,
24174,
24263,
24264,
24265,
24292,
24349,
24378,
24403,
24404,
24434,
24464,
24514,
24573,
24574,
24611,
24649,
24650,
24675,
24676,
24737,
24805,
24860,
24897,
24934,
24935,
24936,
24965,
24993,
25046,
25121,
25122,
25123,
25150,
25176,
25241,
25246,
25250,
25260,
25324,
25369,
25409,
25410,
25448,
25504,
25552,
25592,
25593,
25803,
25804,
26269,
26270,
26486,
26487,
26533,
26534,
27142,
27150,
27151,
27621,
27622,
27673,
27688,
27723,
27773,
27821,
27870,
27940,
27989,
28022,
28103,
28147,
28227,
28251,
28296,
28297,
28349,
28364,
28413,
28425,
28427,
28440,
28442,
28460,
28496,
28502,
28503,
28604,
28619,
28652,
28674,
28675,
28701,
28767,
28790,
28798,
28835,
28862,
28863,
28888,
28931,
28976,
29020,
29021,
29045,
29088,
29145,
29146,
29179,
29180,
29205,
29250,
29308,
29309,
29369,
29442,
29520,
29521,
29556,
29602,
29643,
29702,
29794,
29795,
29824,
29852,
29907,
29996,
29997,
29998,
30025,
30082,
30111,
30136,
30137,
30167,
30197,
30247,
30306,
30307,
30347,
30372,
30373,
30419,
30479,
30513,
30514,
30572,
30617,
30654,
30691,
30692,
30693,
30722,
30750,
30803,
30878,
30879,
30880,
30907,
30933,
30998,
31003,
31007,
31017,
31081,
31126,
31166,
31167,
31205,
31261,
31309,
31349,
31350,
31413,
31459,
31460,
31471,
31472,
31830,
31831,
31843,
31858,
31891,
31913,
31914,
31940,
32006,
32029,
32037,
32074,
32101,
32102,
32127,
32170,
32215,
32259,
32260,
32284,
32327,
32384,
32385,
32418,
32419,
32444,
32489,
32547,
32548,
32608,
32681,
32759,
32760,
32795,
32841,
32882,
32941,
33033,
33034,
33063,
33091,
33146,
33235,
33236,
33237,
33264,
33265,
33283,
33311,
33379,
33434,
33446,
33499,
33543,
33586,
33587,
33643,
33670,
33704,
33705,
33740,
33776,
33800,
33801,
33858,
33887,
33912,
33913,
33943,
33973,
34023,
34082,
34083,
34123,
34148,
34149,
34195,
34255,
34289,
34290,
34348,
34393,
34430,
34483,
34484,
34485,
34514,
34542,
34595,
34670,
34671,
34672,
34699,
34725,
34790,
34795,
34799,
34809,
34873,
34918,
34958,
34959,
34997,
35053,
35101,
35141,
35142,
35195,
35208,
35258,
35410,
35411,
35921,
35922,
36424,
36425,
36643,
36644,
36864,
36865,
36866,
37022,
37037,
37054,
37089,
37138,
37156,
37193,
37243,
37244,
37296,
37361,
37417,
37418,
37798,
37799,
37814,
37841,
37842,
37860,
37888,
37956,
38011,
38023,
38076,
38120,
38163,
38164,
38220,
38247,
38281,
38282,
38317,
38353,
38377,
38378,
38435,
38464,
38489,
38490,
38515,
38516,
38539,
38573,
38607,
38661,
38724,
38725,
38769,
38770,
38820,
38884,
38922,
38923,
38985,
39034,
39075,
39132,
39133,
39208,
39273,
39302,
39406,
39437,
39547,
39548,
39562,
39593,
39622,
39623,
39624,
39653,
39684,
39716,
39773,
39852,
39853,
39874,
39875,
39890,
39940,
39991,
40044,
40097,
40151,
40204,
40258,
40312,
40366,
40419,
40473,
40527,
40581,
40635,
40690,
40745,
40800,
40855,
40910,
40965,
41020,
41075,
41130,
41185,
41240,
41295,
41350,
41405,
41460,
41515,
41570,
41625,
41680,
41735,
41790,
41845,
41900,
41955,
42010,
42065,
42120,
42175,
42230,
42285,
42340,
42395,
42450,
42505,
42560,
42613,
42668,
42723,
42778,
42833,
42889,
42945,
43000,
43055,
43111,
43112,
43741,
43742,
43757,
43793,
43794,
43832,
43884,
43910,
43943,
43997,
44038,
44071,
44120,
44121,
44278,
44279,
44458,
44459,
44474,
44522,
44551,
44576,
44577,
44602,
44649,
44682,
44683,
44706,
44740,
44774,
44828,
44891,
44892,
44940,
44941,
44955,
44986,
45015,
45016,
45065,
45093,
45142,
45143,
45193,
45257,
45300,
45372,
45407,
45473,
45521,
45568,
45634,
45692,
45737,
45798,
45799,
45874,
45944,
45973,
46077,
46108,
46218,
46219,
46245,
46311,
46356,
46412,
46447,
46479,
46539,
46553,
46605,
46606,
46633,
46634,
46649,
46701,
46757,
46813,
46814,
46854,
46895,
46896,
46943,
46964,
47014,
47036,
47086,
47096,
47146,
47147,
47546,
47547,
47979,
47994,
48017,
48039,
48040,
48065,
48099,
48152,
48210,
48266,
48325,
48326,
48394,
48433,
48473,
48474,
48518,
48571,
48595,
48596,
48620,
48691,
48713,
48726,
48727,
48753,
48827,
48899,
48938,
48974,
49056,
49057,
49118,
49166,
49203,
49257,
49258,
49259,
49286,
49312,
49367,
49372,
49376,
49386,
49424,
49465,
49495,
49527,
49528,
49584,
49634,
49675,
49676,
49999,
50012,
50062,
50400,
50401,
50466,
50467,
50536,
50537,
50956,
50957,
51166,
51167,
51182,
51234,
51235,
51249,
51279,
51326,
51327,
51378,
51410,
51418,
51470,
51535,
51571,
51640,
51661,
51662,
51728,
51729,
51744,
51765,
51833,
51859,
51860,
51935,
51950,
51978,
52014,
52015,
52467,
52468,
52754,
52755,
52770,
52781,
52803,
52835,
52872,
52873,
52901,
52944,
53005,
53038,
53039,
53095,
53141,
53183,
53244,
53275,
53276,
53296,
53345,
53346,
53347,
53374,
53400,
53480,
53485,
53489,
53499,
53545,
53583,
53624,
53625,
53685,
53741,
53797,
53823,
53824,
53878,
53879,
53925,
53926,
53963,
53964,
54010,
54011,
54509,
54510,
54525,
54557,
54598,
54651,
54695,
54748,
54762,
54806,
54807,
54912,
54913,
54959,
54960,
55070,
55071,
55117,
55118,
55560,
55561,
55576,
55627,
55628,
55642,
55665,
55715,
55754,
55806,
55890,
55926,
56017,
56108,
56129,
56130,
56292,
56293,
56308,
56336,
56362,
56404,
56432,
56474,
56523,
56577,
56626,
56680,
56729,
56787,
56836,
56893,
56942,
56999,
57048,
57106,
57155,
57213,
57262,
57320,
57330,
57370,
57371,
57417,
57418,
58074,
58075,
58173,
58202,
58203,
58394,
58395,
58416,
58431,
58464,
58508,
58509,
58533,
58588,
58589,
58623,
58668,
58706,
58707,
58731,
58732,
58762,
58802,
58855,
58916,
58954,
58983,
59031,
59113,
59114,
59149,
59195,
59236,
59295,
59349,
59350,
59351,
59378,
59404,
59463,
59468,
59472,
59482,
59520,
59565,
59612,
59613,
59708,
59723,
59745,
59769,
59793,
59817,
59841,
59865,
59890,
59913,
59936,
59960,
59984,
60009,
60034,
60057,
60080,
60103,
60126,
60150,
60174,
60197,
60220,
60243,
60267,
60291,
60315,
60339,
60364,
60389,
60414,
60439,
60440,
60671,
60672,
60679,
60689,
60751,
60813,
60875,
60937,
60999,
61061,
61123,
61185,
61247,
61309,
61371,
61433,
61495,
61557,
61619,
61681,
61743,
61805,
61867,
61929,
61991,
62053,
62115,
62177,
62239,
62301,
62363,
62425,
62487,
62549,
62611,
62673,
62735,
62797,
62859,
62921,
62983,
63045,
63064,
63120,
63175,
63328,
63384,
63436,
63682,
63683,
63697,
63705,
63728,
63729,
63836,
63892,
63942,
64711,
64712,
65271,
65272,
65476,
65731,
65921,
65922,
66152,
66153,
66288,
66383,
66455,
66456,
66682,
66683,
66835,
66836,
66851,
66881,
66922,
66956,
66957,
66977,
66998,
66999,
67025,
67061,
67110,
67167,
67201,
67245,
67323,
67324,
67375,
67376,
67470,
67471,
67486,
67524,
67549,
67593,
67603,
67654,
67655,
67694,
67734,
67735,
67792,
67793,
67850,
67865,
67914,
67971,
68000,
68001,
68053,
68095,
68133,
68200,
68227,
68228,
68244,
68245,
68291,
68292,
68573,
68574,
68620,
68621,
68673,
68674,
68720,
68721,
69067,
69068,
69083,
69121,
69146,
69188,
69198,
69249,
69250,
69285,
69321,
69322,
69375,
69376,
69422,
69423,
69938,
69939,
70251,
70252,
70267,
70307,
70308,
70346,
70371,
70413,
70423,
70474,
70475,
70510,
70546,
70547,
70617,
70662,
70685,
70724,
70782,
70796,
70840,
70841,
70894,
70895,
70938,
70953,
70967,
70990,
71040,
71075,
71127,
71188,
71224,
71310,
71331,
71332,
71548,
71549,
71595,
71596,
71638,
71639,
71711,
71726,
71773,
71794,
71844,
71866,
71916,
71926,
71976,
71977,
72150,
72151,
72197,
72198,
72306,
72307,
72353,
72354,
72574,
72575,
72807,
72820,
72870,
73008,
73110,
73135,
73136,
73186,
73232,
73233,
73604,
73605,
73651,
73652,
73816,
73817,
73863,
73864,
74199,
74292,
74293,
74708,
74709,
74742,
74757,
74850,
74943,
75036,
75129,
75222,
75315,
75316,
75370,
75385,
75386,
75554,
75569,
75584,
75599,
75614,
75629,
75644,
75659,
75674,
75689,
75704,
75719,
75734,
75749,
75764,
75765,
75852,
75853,
76045,
76060,
76149,
76242,
76335,
76428,
76521,
76614,
76707,
76800,
76893,
76986,
77079,
77172,
77265,
77266,
77475,
77476,
77491,
77516,
77550,
77603,
77659,
77718,
77719,
77783,
77822,
77862,
77863,
77907,
77960,
77961,
78017,
78044,
78077,
78078,
78144,
78199,
78200,
78246,
78301,
78338,
78339,
78397,
78424,
78425,
78481,
78507,
78543,
78580,
78638,
78695,
78723,
78763,
78764,
78788,
78789,
78790,
78814,
78885,
78945,
79001,
79042,
79074,
79148,
79149,
79189,
79250,
79291,
79331,
79332,
79380,
79441,
79482,
79541,
79542,
79581,
79582,
79597,
79670,
79743,
79816,
79889,
79962,
80035,
80108,
80181,
80254,
80327,
80400,
80473,
80546,
80619,
80692,
80765,
80838,
80911,
80983,
81056,
81057,
81401,
81402,
81497,
81543,
81544,
81692,
81724,
81725,
81734,
81766,
81767,
82206,
82207,
82228,
82243,
82318,
82393,
82468,
82543,
82544,
82771,
82786,
82853,
82928,
83003,
83078,
83153,
83154,
83182,
83211,
83254,
83277,
83278,
83314,
83332,
83360,
83382,
83383,
83690,
83691,
83782,
83838,
83888,
84279,
84288,
84320,
84321,
84333,
84365,
84366,
84378,
84393,
84468,
84543,
84618,
84693,
84694,
84824,
84825,
84840,
84915,
84990,
85065,
85140,
85141,
85490,
85491,
85506,
85554,
85578,
85579,
85630,
85631,
85669,
85716,
85745,
85746,
85810,
85877,
85900,
85944,
85995,
85996,
86109,
86126,
86141,
86154,
86155,
86850,
86851,
87239,
87240,
87255,
87278,
87302,
87325,
87336,
87337,
87389,
87430,
87470,
87471,
87498,
87544,
87608,
87618,
87667,
87668,
87742,
87792,
87847,
87848,
87880,
87881,
87896,
87927,
87989,
87990,
88036,
88037,
88110,
88337,
88523,
88671,
88672,
89072,
89073,
89088,
89112,
89146,
89172,
89173,
89206,
89275,
89305,
89384,
89385,
89410,
89465,
89493,
89515,
89549,
89622,
89623,
89689,
89722,
89723,
89775,
89820,
89864,
89865,
89906,
89993,
89994,
90072,
90126,
90207,
90208,
90238,
90253,
90291,
90337,
90370,
90409,
90472,
90537,
90577,
90646,
90700,
90725,
90735,
90771,
90821,
90822,
90868,
90869,
91091,
91092,
91158,
91159,
91205,
91206,
91539,
91554,
91624,
91694,
91764,
91834,
91904,
91974,
92044,
92045,
92353,
92354,
92445,
92458,
92508,
92873,
92874,
92928,
92943,
92968,
93000,
93030,
93083,
93145,
93146,
93213,
93214,
93529,
93544,
93558,
93606,
93652,
93685,
93736,
93770,
93806,
93867,
93907,
93980,
94065,
94123,
94148,
94158,
94194,
94244,
94245,
94431,
94432,
94447,
94471,
94522,
94562,
94601,
94649,
94650,
94684,
94710,
94739,
94740,
94805,
94883,
94884,
94949,
95029,
95071,
95113,
95158,
95254,
95255,
95280,
95335,
95365,
95389,
95447,
95545,
95546,
95612,
95645,
95646,
95692,
95743,
95811,
95878,
95951,
95998,
95999,
96077,
96078,
96100,
96149,
96176,
96203,
96230,
96231,
96271,
96349,
96403,
96463,
96510,
96511,
96557,
96558,
96781,
96782,
96828,
96829,
96861,
96862,
96908,
96909,
96988,
96989,
97035,
97036,
97438,
97439,
97506,
97520,
97570,
97966,
97967,
97982,
98004,
98068,
98095,
98122,
98149,
98182,
98183,
98223,
98301,
98355,
98415,
98462,
98463,
98492,
98558,
98625,
98703,
98704,
98705,
98740,
98755,
98781,
98847,
98899,
98951,
98962,
99049,
99112,
99113,
99160,
99161,
99236,
99301,
99343,
99344,
99744,
99745,
99792,
99793,
99955,
99956,
100145,
100160,
100235,
100309,
100383,
100457,
100531,
100605,
100679,
100753,
100827,
100901,
100975,
101049,
101123,
101197,
101271,
101272,
101698,
101699,
101930,
101945,
101964,
101983,
102002,
102012,
102022,
102032,
102042,
102052,
102062,
102072,
102082,
102092,
102102,
102112,
102113,
102579,
102667,
102808,
102809,
102997,
102998,
103013,
103038,
103070,
103100,
103166,
103228,
103264,
103265,
103311,
103326,
103392,
103445,
103532,
103569,
103570,
103617,
103632,
103664,
103714,
103748,
103749,
103840,
103855,
103883,
103933,
103934,
104303,
104304,
104319,
104345,
104385,
104410,
104443,
104444,
104493,
104534,
104610,
104687,
104688,
104716,
104717,
104764,
104765,
104794,
104795,
104842,
104843,
104990,
104991,
105220,
105221,
105268,
105269,
105335,
105336,
105926,
105927,
105996,
106010,
106060,
106253,
106254,
106301,
106302,
106983,
106984,
106999,
107050,
107096,
107143,
107200,
107256,
107277,
107278,
107293,
107372,
107440,
107496,
107497,
107530,
107577,
107578,
107871,
107872,
107887,
107901,
107938,
108011,
108063,
108064,
108106,
108107,
108122,
108194,
108247,
108273,
108351,
108416,
108470,
108471,
108485,
108532,
108533,
108569,
108570,
109049,
109050,
109159,
109160,
109202,
109249,
109250,
109299,
109314,
109380,
109446,
109512,
109578,
109644,
109710,
109776,
109842,
109908,
109974,
110040,
110106,
110172,
110238,
110304,
110370,
110436,
110502,
110568,
110634,
110700,
110766,
110832,
110898,
110964,
111030,
111031,
111340,
111341,
111356,
111386,
111430,
111474,
111533,
111586,
111639,
111688,
111741,
111793,
111807,
111830,
111853,
111886,
111887,
111936,
112013,
112058,
112128,
112129,
112191,
112254,
112328,
112329,
112583,
112584,
112631,
112632,
112984,
112999,
113045,
113083,
113108,
113137,
113178,
113179,
113224,
113239,
113273,
113328,
113362,
113416,
113417,
113605,
113606,
113621,
113654,
113687,
113719,
113755,
113818,
113819,
113858,
113859,
113874,
113902,
113968,
113969,
114173,
114174,
114189,
114225,
114255,
114261,
114291,
114320,
114321,
114461,
114462,
114895,
114896,
114911,
114941,
114993,
115037,
115070,
115093,
115116,
115149,
115150,
115199,
115276,
115323,
115393,
115394,
115456,
115490,
115557,
115635,
115636,
115727,
115742,
115767,
115822,
115863,
115908,
115950,
115951,
115999,
116033,
116066,
116099,
116133,
116169,
116203,
116236,
116247,
116315,
116378,
116379,
116428,
116443,
116455,
116494,
116535,
116577,
116578,
116723,
116724,
116739,
116794,
116849,
116880,
116881,
116934,
116981,
116982,
117114,
117128,
117178,
117578,
117579,
117917,
117918,
117933,
117984,
118031,
118095,
118158,
118227,
118270,
118271,
118354,
118355,
118380,
118461,
118462,
118463,
118510,
118559,
118592,
118629,
118678,
118711,
118744,
118776,
118815,
118880,
118933,
118934,
118981,
118982,
119251,
119252,
119512,
119513,
119528,
119557,
119585,
119640,
119681,
119696,
119729,
119756,
119784,
119837,
119926,
119927,
120120,
120121,
120168,
120169,
120574,
120575,
121045,
121046,
121061,
121091,
121162,
121206,
121239,
121262,
121285,
121318,
121345,
121346,
121395,
121472,
121533,
121603,
121604,
121666,
121700,
121767,
121845,
121860,
121870,
121909,
121950,
121992,
122016,
122017,
122407,
122408,
122440,
122441,
122488,
122489,
122646,
122660,
122710,
122758,
122759,
123131,
123195,
123304,
123305,
123583,
123584,
123977,
123978,
123993,
124021,
124071,
124086,
124124,
124148,
124199,
124244,
124259,
124305,
124332,
124360,
124381,
124438,
124531,
124545,
124606,
124699,
124700,
124880,
124881,
125158,
125159,
125532,
125533,
125548,
125597,
125612,
125634,
125635,
125661,
125679,
125706,
125755,
125797,
125845,
125895,
125929,
125953,
125954,
125996,
126062,
126160,
126161,
126199,
126229,
126288,
126319,
126402,
126403,
126404,
126431,
126457,
126522,
126527,
126531,
126541,
126579,
126622,
126666,
126710,
126749,
126788,
126789,
126836,
126837,
127016,
127017,
127074,
127089,
127119,
127159,
127198,
127207,
127225,
127259,
127308,
127365,
127413,
127466,
127479,
127490,
127506,
127528,
127568,
127614,
127644,
127694,
127777,
127848,
127908,
127951,
127986,
128438,
128439,
128491,
128506,
128520,
128538,
128551,
128575,
128584,
128601,
128613,
128624,
128635,
128647,
128654,
128657,
128660,
128663,
128666,
128669,
128672,
128675,
128678,
128686,
128703,
128715,
128726,
128737,
128749,
128756,
128759,
128762,
128765,
128768,
128771,
128774,
128777,
128780,
128788,
128789,
128831,
128846,
128865,
128884,
128919,
128970,
129006,
129090,
129137,
129173,
129454,
129455,
129894,
129895,
129910,
129941,
129999,
130017,
130051,
130100,
130101,
130377,
130378,
130393,
130424,
130482,
130500,
130534,
130552,
130571,
130586,
130600,
130649,
130650,
130718,
130719,
130734,
130750,
130822,
130894,
130895,
131013,
131014,
131061,
131062,
131356,
131357,
131372,
131402,
131452,
131453,
131500,
131501,
131528,
131529,
131644,
131645,
131883,
131884,
131931,
131932,
132212,
132213,
132228,
132289,
132351,
132378,
132408,
132414,
132444,
132445,
132446,
132520,
132534,
132584,
132989,
132990,
133159,
133160,
133258,
133273,
133289,
133315,
133393,
133471,
133472,
133519,
133520,
133642,
133643,
133690,
133691,
133706,
133767,
133839,
133869,
133904,
133934,
133940,
133970,
133971,
133986,
134025,
134065,
134066,
134305,
134306,
134321,
134337,
134376,
134416,
134458,
134495,
134519,
134520,
134535,
134565,
134650,
134694,
134727,
134750,
134773,
134806,
134837,
134864,
134865,
134914,
134991,
135052,
135085,
135166,
135236,
135237,
135299,
135333,
135400,
135478,
135479,
135628,
135629,
135676,
135677,
136043,
136044,
136059,
136131,
136187,
136217,
136245,
136255,
136294,
136335,
136376,
136423,
136464,
136512,
136534,
136535,
136617,
136632,
136655,
136690,
136737,
136795,
136842,
136902,
136970,
137053,
137115,
137181,
137243,
137282,
137358,
137409,
137466,
137467,
137561,
137562,
137577,
137628,
137637,
137688,
137756,
137823,
137896,
137943,
137944,
138031,
138032,
138062,
138148,
138160,
138255,
138333,
138365,
138395,
138396,
138498,
138526,
138541,
138611,
138646,
138655,
138656,
138726,
138761,
138770,
138771,
138870,
138871,
138886,
138923,
138979,
138980,
139123,
139124,
139277,
139291,
139341,
139611,
139612,
139659,
139660,
139843,
139844,
139859,
139910,
139962,
139991,
139992,
140033,
140098,
140170,
140171,
140208,
140223,
140257,
140317,
140348,
140408,
140409,
140554,
140555,
140570,
140589,
140628,
140668,
140709,
140728,
140729,
140752,
140753,
140800,
140801,
140949,
140950,
140997,
140998,
141247,
141248,
141263,
141329,
141368,
141401,
141459,
141491,
141524,
141582,
141615,
141623,
141624,
141642,
141689,
141690,
142056,
142057,
142075,
142122,
142123,
142317,
142318,
142365,
142366,
142435,
142491,
142541,
142628,
142629,
142828,
142829,
142939,
142954,
142972,
142991,
143046,
143090,
143091,
143108,
143109,
143156,
143157,
143170,
143171,
143218,
143219,
143480,
143494,
143544,
143976,
143977,
143992,
144039,
144040,
144305,
144306,
144321,
144393,
144449,
144479,
144507,
144527,
144566,
144607,
144648,
144706,
144747,
144781,
144828,
144850,
144851,
144876,
144923,
144924,
145251,
145252,
145299,
145300,
145315,
145360,
145397,
145398,
145429,
145505,
145581,
145647,
145725,
145790,
145800,
145876,
145957,
145958,
146005,
146006,
146165,
146166,
146456,
146457,
146526,
146561,
146611,
146733,
146734,
146820,
146821,
146880,
146895,
146929,
146975,
147011,
147054,
147099,
147160,
147161,
147361,
147362,
147377,
147398,
147457,
147531,
147532,
148007,
148008,
148023,
148045,
148110,
148157,
148184,
148211,
148238,
148273,
148308,
148343,
148344,
148393,
148471,
148525,
148585,
148632,
148633,
148706,
148776,
148824,
148825,
148882,
148923,
148968,
149025,
149066,
149107,
149147,
149194,
149273,
149346,
149402,
149403,
149677,
149678,
149693,
149767,
149857,
149858,
149885,
149886,
149901,
149926,
149960,
150041,
150070,
150071,
150146,
150147,
150552,
150553,
150730,
150731,
150746,
150780,
150805,
150824,
150825,
150898,
150933,
150966,
151033,
151063,
151126,
151127,
151159,
151201,
151202,
151258,
151293,
151355,
151383,
151384,
151470,
151471,
151564,
151565,
151826,
151827,
151828,
151967,
151982,
152048,
152114,
152180,
152246,
152312,
152378,
152444,
152510,
152576,
152642,
152643,
152986,
152987,
153002,
153014,
153022,
153061,
153102,
153143,
153184,
153225,
153265,
153305,
153346,
153387,
153428,
153437,
153438,
153510,
153603,
153604,
153798,
153799,
153889,
153904,
153943,
153985,
154027,
154069,
154110,
154150,
154190,
154230,
154270,
154309,
154318,
154319,
154507,
154508,
154604,
154605,
154606,
154730,
154731,
154746,
154778,
154834,
154867,
154929,
155002,
155003,
155414,
155415,
155721,
155736,
155767,
155803,
155848,
155885,
155922,
155959,
155996,
156035,
156036,
156074,
156110,
156111,
156193,
156194,
156392,
156393,
156622,
156636,
156686,
156883,
156884,
156977,
156978,
157234,
157235,
157544,
157545,
157737,
157752,
157782,
157808,
157809,
157824,
157855,
157859,
157879,
157902,
157924,
157947,
157953,
157976,
157991,
158006,
158070,
158156,
158157,
158314,
158329,
158349,
158365,
158395,
158417,
158433,
158463,
158469,
158485,
158551,
158585,
158624,
158658,
158700,
158734,
158790,
158824,
158834,
158868,
158869,
158913,
158914,
158939,
158940,
158955,
158971,
159017,
159042,
159111,
159112,
159255,
159256,
159271,
159285,
159300,
159343,
159388,
159432,
159476,
159519,
159548,
159549,
159553,
159554,
159570,
159585,
159615,
159697,
159779,
159780,
159781,
159824,
159825,
159826,
160146,
160147,
160162,
160228,
160267,
160313,
160359,
160392,
160450,
160482,
160515,
160573,
160606,
160614,
160615,
160666,
160667,
161043,
161058,
161122,
161123,
161207,
161254,
161255,
161387,
161388,
161617,
161632,
161709,
161793,
161794,
161888,
161889,
161904,
161944,
161975,
162003,
162041,
162042,
162123,
162151,
162180,
162243,
162269,
162328,
162365,
162393,
162394,
162462,
162509,
162510,
162736,
162737,
162752,
162764,
162779,
162822,
162867,
162911,
162955,
162999,
163012,
163016,
163029,
163044,
163087,
163131,
163175,
163188,
163189,
163286,
163333,
163334,
163600,
163601,
163616,
163694,
163695,
163699,
163700,
163746,
163801,
163802,
163814,
163861,
163862,
163919,
163920,
163989,
164045,
164095,
164340,
164341,
164388,
164389,
164464,
164465,
164512,
164513,
164596,
164597,
164644,
164645,
164737,
164784,
164785,
164890,
164904,
164954,
165098,
165099,
165206,
165207,
165254,
165255,
165493,
165494,
165509,
165527,
165546,
165589,
165633,
165678,
165717,
165718,
165819,
165820,
165867,
165868,
166226,
166227,
166274,
166275,
166478,
166479,
166494,
166509,
166530,
166596,
166597,
166644,
166645,
166714,
166728,
166778,
166869,
166870,
166917,
166918,
166938,
166985,
166986,
166994,
167041,
167042,
167088,
167135,
167136,
167278,
167325,
167326,
167472,
167473,
167488,
167526,
167588,
167625,
167626,
167659,
167701,
167702,
167774,
167775,
167844,
167858,
167908,
168082,
168083,
168182,
168197,
168223,
168258,
168306,
168364,
168411,
168459,
168525,
168591,
168627,
168628,
168714,
168715,
168730,
168745,
168763,
168829,
168830,
168960,
168961,
168976,
168994,
169013,
169056,
169100,
169151,
169202,
169247,
169286,
169287,
169452,
169453,
169500,
169547,
169594,
169595,
169690,
169704,
169754,
169927,
169928,
170046,
170093,
170148,
170149,
170150,
170345,
170346,
170361,
170371,
170398,
170464,
170515,
170516,
170563,
170564,
170656,
170657,
170704,
170751,
170798,
170799,
170868,
170882,
170932,
171086,
171133,
171134,
171240,
171287,
171288,
171524,
171525,
171572,
171573,
171648,
171695,
171696,
171757,
171804,
171805,
171935,
171982,
171983,
171991,
171992,
172145,
172192,
172193,
172388,
172389,
172404,
172423,
172438,
172524,
172611,
172679,
172756,
172834,
172902,
172903,
172950,
172951,
173020,
173076,
173126,
173464,
173465,
173749,
173764,
173793,
173846,
173898,
173944,
173945,
173992,
173993,
174419,
174434,
174453,
174496,
174541,
174586,
174631,
174693,
174738,
174776,
174826,
174838,
174839,
174916,
174917,
174964,
174965,
175159,
175160,
175175,
175190,
175242,
175287,
175293,
175343,
175344,
175348,
175349,
175366,
175367,
175490,
175491,
175538,
175539,
175958,
175959,
176256,
176257,
176272,
176362,
176376,
176396,
176420,
176474,
176553,
176554,
176730,
176731,
176746,
176782,
176844,
176914,
176949,
176950,
176963,
177010,
177011,
177321,
177322,
177436,
177492,
177542,
177814,
177815,
177878,
177879,
178028
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 178028,
"ccnet_original_nlines": 3508,
"rps_doc_curly_bracket": 0.001258229953236878,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23272399604320526,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02220267988741398,
"rps_doc_frac_lines_end_with_ellipsis": 0.00313479988835752,
"rps_doc_frac_no_alph_words": 0.4337604343891144,
"rps_doc_frac_unique_words": 0.13552090525627136,
"rps_doc_mean_word_length": 4.829432487487793,
"rps_doc_num_sentences": 3028,
"rps_doc_symbol_to_word_ratio": 0.004873179830610752,
"rps_doc_unigram_entropy": 6.408982753753662,
"rps_doc_word_count": 25081,
"rps_doc_frac_chars_dupe_10grams": 0.20307610929012299,
"rps_doc_frac_chars_dupe_5grams": 0.2906453609466553,
"rps_doc_frac_chars_dupe_6grams": 0.26932889223098755,
"rps_doc_frac_chars_dupe_7grams": 0.2543776333332062,
"rps_doc_frac_chars_dupe_8grams": 0.24293510615825653,
"rps_doc_frac_chars_dupe_9grams": 0.2148241102695465,
"rps_doc_frac_chars_top_2gram": 0.012928579933941364,
"rps_doc_frac_chars_top_3gram": 0.0133248595520854,
"rps_doc_frac_chars_top_4gram": 0.014431130141019821,
"rps_doc_books_importance": -17689.548828125,
"rps_doc_books_importance_length_correction": -17689.548828125,
"rps_doc_openwebtext_importance": -10608.0791015625,
"rps_doc_openwebtext_importance_length_correction": -10608.0791015625,
"rps_doc_wikipedia_importance": -8102.072265625,
"rps_doc_wikipedia_importance_length_correction": -8102.072265625
},
"fasttext": {
"dclm": 0.058317601680755615,
"english": 0.6248331665992737,
"fineweb_edu_approx": 1.766754150390625,
"eai_general_math": 0.006234169937670231,
"eai_open_web_math": 0.5620129704475403,
"eai_web_code": 0.9997923970222473
}
}
|
{
"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": "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": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "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
|
-2,795,982,553,702,908,400 |
VPS Hosting
What is VPS Hosting? How it work + types
What is VPS hosting?
Virtual Private Server (VPS) Hosting is a service that divides a physical server into multiple virtual servers.
With virtual server operating independently, provides you with dedicated resources and offers you greater control and performance.
VPS hosting is very useful if your business needs more resources and customisation options. It provides you scalability and cost-effectiveness compared to other types of hosting.
How does VPS Hosting work?
VPS hosting uses virtualisation technology to divide a private server into multiple virtual servers. Here's how it typically operates 👇
1- Server Virtualisation
The physical server is partitioned into isolated virtual environments using a hypervisor. Each server runs its own operating system and has allocated CPU power, RAM, storage, unlimited bandwidth and network resources.
2- Resource Allocation
Each virtual server is assigned a specific resource based on the chosen hosting plan. This ensures that the entire server resources are dedicated and not shared with other virtual servers on the same physical server.
3- Operating System Installation
You can install your preferred operating system on your virtual server. This gives you root access, more control and flexibility to customise your server configurations as needed.
4- Server Management
You have administrative access to your virtual server, allowing you to install software, change settings and manage applications just like you would on a dedicated hosting server.
5- Isolation and Security
The virtualisation technology ensures that each virtual server is isolated from others, providing enhanced security and preventing one server from impacting the performance or stability of others.
6- Scalability
VPS hosting offers scalability, allowing you to upgrade or downgrade your resources per your requirements. This flexibility is beneficial for handling increased traffic or resource-intensive applications.
7- Network Connectivity
The virtual servers within a VPS hosting environment typically share the same physical hardware network, ensuring reliable network connectivity and internet access.
Overall, VPS hosting provides you with a virtualised environment that mimics the functionalities of a dedicated server space while offering better affordability, scalability and resource allocation options.
VPS hosting vs other types of hosting
VPS hosting can be compared to different types of hosting options:
1- Shared hosting
In shared hosting, multiple websites share the resources of a single server. This often leads to lower performance and limited customisation options since resources are divided among all users. Shared hosting is also the cheapest option.
On the other hand, VPS hosting provides dedicated resources for each virtual server, offering better performance and greater control over the server environment.
2- Dedicated hosting
Dedicated hosting involves having an entire physical server dedicated to a single user. Dedicated hosting offers the highest level of performance, control, and security. However, it’s the most expensive option.
VPS hosting works as a middle ground by providing a cost-effective alternative by offering dedicated resources within a virtualised environment, giving you a similar level of control and performance without the high costs associated with a dedicated server.
3- Cloud hosting
Cloud hosting relies on interconnected servers to distribute resources and handle personal website traffic. It provides scalability and reliability, as resources can be easily scaled up or down based on demand.
VPS hosting can be considered a form of cloud hosting since it utilises virtualisation technology to create virtual servers within a physical server. However, VPS hosting typically offers more dedicated resources and control than traditional cloud hosting solutions.
4- Managed hosting
Managed hosting services are designed to offload server management tasks to a hosting provider. This includes software updates, security monitoring, backups and technical support.
While managed hosting can be available for various hosting types, including VPS hosting, it typically comes at an additional cost. Users who prefer a hands-off approach to server management may opt for managed VPS hosting to leverage the expertise of the hosting provider.
Conclusion
In conclusion, VPS hosting offers a compelling solution for you and your business if you need more control, resources and performance than shared hosting can provide, but without the high costs associated with dedicated hosting.
VPS hosting grants you root access and customisation options, allowing you to install software, configure settings and manage applications as needed. It offers better privacy and security than shared hosting since each virtual server operates in isolation. Additionally, VPS hosting provides scalability, enabling you to easily adjust resources to accommodate changing needs.
VPS hosting balances affordability and functionality, making it an attractive option for websites, online stores and applications that require more resources and flexibility. Whether you're a small business, a growing website or an individual with specific hosting needs, VPS hosting can provide the performance, control and scalability necessary to meet your requirements.
Your apps made to order
Trusted by the world's leading brands
BBC logoMakro logoVirgin Unite logoNBC logoFujitsu logo
Your apps made to order
|
{
"url": "https://www.builder.ai/glossary/vpshosting",
"source_domain": "www.builder.ai",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "82801",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PCSQKKT5A55RAQO2CH4544O73U6NTNQJ",
"WARC-Concurrent-To": "<urn:uuid:848977e7-74d6-41cf-9b3d-d913389ed065>",
"WARC-Date": "2023-09-30T22:45:19Z",
"WARC-IP-Address": "172.66.40.201",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2HIOTJEYD3IJQIEJT6I35PIBBMNMYTHX",
"WARC-Record-ID": "<urn:uuid:3717e8a5-e272-4a77-8c62-144967939888>",
"WARC-Target-URI": "https://www.builder.ai/glossary/vpshosting",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:55480e6d-cb2b-4a4f-a9fe-f18e80e6bca5>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-105\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
12,
13,
54,
55,
76,
77,
189,
190,
321,
322,
501,
502,
529,
530,
666,
667,
692,
693,
911,
912,
935,
936,
1153,
1154,
1187,
1188,
1368,
1369,
1390,
1391,
1571,
1572,
1598,
1599,
1796,
1797,
1812,
1813,
2018,
2019,
2043,
2044,
2209,
2210,
2417,
2418,
2456,
2457,
2524,
2525,
2543,
2544,
2782,
2783,
2945,
2946,
2967,
2968,
3179,
3180,
3438,
3439,
3456,
3457,
3668,
3669,
3936,
3937,
3956,
3957,
4137,
4138,
4411,
4412,
4423,
4424,
4653,
4654,
5030,
5031,
5405,
5406,
5430,
5431,
5469,
5470,
5526
],
"line_end_idx": [
12,
13,
54,
55,
76,
77,
189,
190,
321,
322,
501,
502,
529,
530,
666,
667,
692,
693,
911,
912,
935,
936,
1153,
1154,
1187,
1188,
1368,
1369,
1390,
1391,
1571,
1572,
1598,
1599,
1796,
1797,
1812,
1813,
2018,
2019,
2043,
2044,
2209,
2210,
2417,
2418,
2456,
2457,
2524,
2525,
2543,
2544,
2782,
2783,
2945,
2946,
2967,
2968,
3179,
3180,
3438,
3439,
3456,
3457,
3668,
3669,
3936,
3937,
3956,
3957,
4137,
4138,
4411,
4412,
4423,
4424,
4653,
4654,
5030,
5031,
5405,
5406,
5430,
5431,
5469,
5470,
5526,
5549
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5549,
"ccnet_original_nlines": 87,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31463146209716797,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028602860867977142,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12541253864765167,
"rps_doc_frac_unique_words": 0.36295369267463684,
"rps_doc_mean_word_length": 5.764705657958984,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.026447296142578,
"rps_doc_word_count": 799,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.048632219433784485,
"rps_doc_frac_chars_dupe_6grams": 0.014329140074551105,
"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.04993487149477005,
"rps_doc_frac_chars_top_3gram": 0.014763349667191505,
"rps_doc_frac_chars_top_4gram": 0.006947460118681192,
"rps_doc_books_importance": -311.03350830078125,
"rps_doc_books_importance_length_correction": -311.03350830078125,
"rps_doc_openwebtext_importance": -192.31431579589844,
"rps_doc_openwebtext_importance_length_correction": -192.31431579589844,
"rps_doc_wikipedia_importance": -84.06101989746094,
"rps_doc_wikipedia_importance_length_correction": -84.06101989746094
},
"fasttext": {
"dclm": 0.8684501647949219,
"english": 0.9273345470428467,
"fineweb_edu_approx": 2.4922168254852295,
"eai_general_math": 0.04740815982222557,
"eai_open_web_math": 0.026579080149531364,
"eai_web_code": 0.24742072820663452
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,753,029,308,865,608,000 |
Tag Archive: hierarchy: Social Memory Complex
Closing the Gender Gap From the Bottom Up
Women in Tech, Donglegate, and Revolution
I have wanted to write about the issue of "women in tech" for a long time, and now donglegate has elevated the matter to a level I can no longer ignore. It's like a train wreck from which you can't look away, but the underlying tension speaks to a broader conflict in the tech community. While I find Amanda Blum's excellent post on the matter pretty authoritative, I don't want to focus on Adria Richards' behavior, but instead talk about the background issue of sexism and gender parity in the technology community that informed her behavior.
So, first off: are women and minorities underprivileged in the technology sector? Of course; they are underprivileged in almost every sector of society. Biases, hostile environments, outdated socially constructed roles, bigotry and outright discrimination are pervasive in our community, as they are in most communities. And it doesn't just suck for our community because it's manifestly unjust, but also because it hurts us and our work.
We technologists can write all the code, build all the gadgets, run all the software we want--but if people can't use it, if it doesn't actually solve their problems, if it doesn't speak to their diverse experiences, then it's useless. As women become an ever larger user base, we require their perspective as first-class citizens in the creation of software, hardware, and other high tech products that have become so important. We need to listen to them, sure, but they should also be part of our community as creators themselves, possessing the same skills and ability to pursue their vision in concert with, or independent of, male technologists.
Read more...
Written on Wednesday, March 27, 2013
Tags: women-in-tech, gender, hierarchy, corporatism, feminism, donglegate
Comments
|
{
"url": "http://www.socialmemorycomplex.net/tags/hierarchy.html",
"source_domain": "www.socialmemorycomplex.net",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "6018",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6OGMQBYZJALKVYYKSXWUP5OG47JUH6JL",
"WARC-Concurrent-To": "<urn:uuid:47f28eed-de00-4d0d-9654-55d7a8b65359>",
"WARC-Date": "2017-06-24T15:28:46Z",
"WARC-IP-Address": "50.116.55.86",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OX2A4EVJYXYOPBJAJ6UBXKYVQSHZKNZ2",
"WARC-Record-ID": "<urn:uuid:0d01f177-73a7-4efe-aaf0-1e9420a896a8>",
"WARC-Target-URI": "http://www.socialmemorycomplex.net/tags/hierarchy.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:abb44f11-1928-4da8-aa58-901ba28c3898>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-195-140.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
46,
47,
89,
131,
132,
677,
678,
1117,
1118,
1769,
1770,
1783,
1784,
1821,
1895
],
"line_end_idx": [
46,
47,
89,
131,
132,
677,
678,
1117,
1118,
1769,
1770,
1783,
1784,
1821,
1895,
1903
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1903,
"ccnet_original_nlines": 15,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41558441519737244,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010389610193669796,
"rps_doc_frac_lines_end_with_ellipsis": 0.0625,
"rps_doc_frac_no_alph_words": 0.17402596771717072,
"rps_doc_frac_unique_words": 0.6111111044883728,
"rps_doc_mean_word_length": 4.980391979217529,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0.002597399987280369,
"rps_doc_unigram_entropy": 4.936972141265869,
"rps_doc_word_count": 306,
"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.013123360462486744,
"rps_doc_frac_chars_top_3gram": 0.01443570014089346,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -154.03802490234375,
"rps_doc_books_importance_length_correction": -154.0378875732422,
"rps_doc_openwebtext_importance": -91.98416137695312,
"rps_doc_openwebtext_importance_length_correction": -91.98416137695312,
"rps_doc_wikipedia_importance": -36.38762283325195,
"rps_doc_wikipedia_importance_length_correction": -36.38762283325195
},
"fasttext": {
"dclm": 0.09657204151153564,
"english": 0.9679430723190308,
"fineweb_edu_approx": 1.9441273212432861,
"eai_general_math": 0.062462568283081055,
"eai_open_web_math": 0.1303412914276123,
"eai_web_code": 0.25801384449005127
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "305.42",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social sciences — Periodicals"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "4",
"label": "Metacognitive"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"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": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-219,736,548,370,900,700 |
爬去起点中文网小说
爬取《起点》中文网 免费小说
前言： 第一次写这么复杂的程序，欢迎各位大佬批评指正。。
1. 去分析《起点》中文网的响应数据 (https://www.qidian.com/free/all)
第一步，检查网页的response响应，通过打开NETwork发现起点中文网的有Referer反爬，
在这里插入图片描述
2.通过调试和分析数据 发现我们要的数据是嵌套在html里面的,我们利用xpath提取出我们想的每一部小说的url 和名字
在这里插入图片描述
在这里插入图片描述
3.我们拿到了 每一页中的所有的小说url 下一步就是提取小说的入口 通过分析得知 小说的入口也是嵌套html里面的
在这里插入图片描述
4.分析小说文本的数据
在这里插入图片描述
import requests
from lxml import etree
from fake_useragent import FakeUserAgent
if name == ‘main’:
for i in range(int(input(‘输入爬取的页说(一页是二十本小说)>>>>>>:’))):
# 确定目标的url——
url_ = f’https://www.qidian.com/free/all?orderId=&vip=hidden&style=1&pageSize=20&siteid=1&pubflag=0&hiddenField=1&page={i + 1}’
# 构造身user身份
user = FakeUserAgent().random
headers_ = {
‘User-Agent’: ‘Mozilla/5.0 (Windows NT 6.1; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/87.0.4280.141 Safari/537.36’,
‘Cooie’: ‘e1=%7B%22pid%22%3A%22qd_P_free%22%2C%22eid%22%3A%22qd_C44%22%7D; e2=%7B%22pid%22%3A%22qd_P_free%22%2C%22eid%22%3A%22qd_C44%22%7D; csrfToken=Bf8rW9wM2hTvLVvBKEeorxq58HVuMaROuzWo9N2E; newstatisticUUID=1610114709_606719731; yep_uuid=325a69ff-672a-68c2-ed48-6e113af5cb65; qdrs=0%7C3%7C0%7C0%7C1; showSectionCommentGuide=1; qdgd=1; e1=%7B%22pid%22%3A%22qd_P_limitfree%22%2C%22eid%22%3A%22qd_E01%22%2C%22l1%22%3A4%7D; e2=%7B%22pid%22%3A%22qd_P_limitfree%22%2C%22eid%22%3A%22qd_A18%22%2C%22l1%22%3A3%7D; bc=1021516016%2C1017918245%2C1025325411%2C1024892080; lrbc=1025325411%7C625665811%7C0%2C1024892080%7C613857996%7C0%2C1021516016%7C630782911%7C1; rcr=1025325411%2C1024892080%2C1017918245%2C1021516016’,
‘Referer’: ‘https://book.qidian.com/’
}
# 发送请求得到响应
res
= requests.get(url
, headers=headers_).text
data_ = etree.HTML(res_)
# 提取每一本小说对应的url
url_list = data_.xpath(’//div[@class=“book-mid-info”]/h4/a/@href’)
a = []
for k in url_list:
j = ‘http:’ + k
a.append(j)
b = []
for p in a:
res_1 = requests.get(url=p, headers=headers_).text
data = etree.HTML(res_1)
name1 = 'http:' + data.xpath('//div[@class="book-img"]/a/@href')[0]
b.append(name1)
print(b)
# 给每一本对应的小说的url 发送请求 然后一次下载小说
for l_3 in b:
# 发送网络请求
response_ = requests.get(url=l_3, headers=headers_).text
# print(response_)
# 转换xpath格式 提取数据
data_1 = etree.HTML(response_)
# 小说《名字》
name_ = data_1.xpath('//div[@class="crumbs-nav"]/a[@class="act"]/text()')[0]
print(name_)
# 对应章节标题
res_1 = data_1.xpath('//h3/span[@class="content-wrap"]/text()')[0]
# print(res_)
# 提取小说内容
res_data = '\n'.join(data_1.xpath('//div[@class="read-content j_readContent"]/p/text()'))
# print(res_data)
# 提取下一章的url
url_list1 = 'http:' + data_1.xpath('//div[@class="text-wrap"]/@data-nurl')[0]
print(url_list1)
with open(f'{name_}.txt', 'a', encoding='utf-8')as f:
f.write(f'{res_1}\n')
f.write(res_data)
print(f'[{name_}]章节>>>【{res_1}】下载完毕')
try:
# 同过提取下一章的url 把它放在一个死循环里。依次写入
while True:
res_2 = requests.get(url=url_list1, headers=headers_).text
# 文章标题
res_two = etree.HTML(res_2)
res_hea = res_two.xpath('//h3/span[@class="content-wrap"]/text()')[0]
# 文 章内容
res_two_data = '\n'.join(res_two.xpath('//div[@class="read-content j_readContent"]/p/text()'))
# 判断文章的内容是否为空 如果为空的话就结束死循环
if not res_two_data:
break
# 下一章的url_会依次传入到73的get请求 来到达循环下载
url_list1 = 'https:' + res_two.xpath('//div[@class="text-wrap"]/@data-nurl')[0]
f = open(f'{name_}.txt', 'a', encoding='utf-8')
f.write(f'{res_hea}\n')
f.write(f'{res_two_data}')
print(f'[{name_}]章节[{res_hea}]下载完毕')
except:
print(f'{name_}所有章节下载完成>>>>>>>>>>>>！！！！！')
• 1
点赞
• 2
收藏
觉得还不错? 一键收藏
• 0
评论
评论
添加红包
请填写红包祝福语或标题
红包个数最小为10个
红包金额最低5元
当前余额3.43前往充值 >
需支付：10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0
抵扣说明：
1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。
余额充值
|
{
"url": "https://blog.csdn.net/weixin_51662537/article/details/113525794",
"source_domain": "blog.csdn.net",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "139676",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VQK3RYJ34K2OFGP3KCDA6PKYOASQNP3Y",
"WARC-Concurrent-To": "<urn:uuid:a9a09f70-84d9-4543-bc4f-a1974ccbfdff>",
"WARC-Date": "2024-08-08T10:37:11Z",
"WARC-IP-Address": "129.227.248.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:APR6HDZDUPVON4VHH3QXD5TXADH3BSC6",
"WARC-Record-ID": "<urn:uuid:fceeb22b-90f4-4b7d-9629-ea5be9e861fd>",
"WARC-Target-URI": "https://blog.csdn.net/weixin_51662537/article/details/113525794",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:51840c7a-cc47-4049-9009-1018c89e37aa>"
},
"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-57\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,
10,
11,
26,
27,
56,
57,
112,
167,
181,
247,
248,
258,
268,
327,
337,
349,
359,
360,
376,
399,
440,
441,
460,
516,
529,
657,
669,
699,
712,
844,
1552,
1590,
1592,
1603,
1607,
1626,
1651,
1676,
1692,
1759,
1766,
1785,
1801,
1813,
1814,
1825,
1841,
1900,
1933,
2009,
2033,
2046,
2080,
2098,
2106,
2123,
2188,
2215,
2240,
2279,
2296,
2381,
2402,
2419,
2494,
2516,
2533,
2631,
2657,
2677,
2763,
2788,
2850,
2884,
2914,
2964,
2977,
3020,
3044,
3119,
3120,
3143,
3187,
3273,
3297,
3298,
3409,
3454,
3491,
3517,
3567,
3663,
3727,
3767,
3810,
3863,
3879,
3934,
3940,
3947,
3953,
3960,
3976,
3982,
3989,
3992,
3997,
3998,
4010,
4011,
4022,
4023,
4032,
4033,
4048,
4058,
4067,
4089,
4101,
4107,
4110,
4117,
4124,
4129,
4136,
4137,
4143,
4144,
4178,
4208,
4209
],
"line_end_idx": [
10,
11,
26,
27,
56,
57,
112,
167,
181,
247,
248,
258,
268,
327,
337,
349,
359,
360,
376,
399,
440,
441,
460,
516,
529,
657,
669,
699,
712,
844,
1552,
1590,
1592,
1603,
1607,
1626,
1651,
1676,
1692,
1759,
1766,
1785,
1801,
1813,
1814,
1825,
1841,
1900,
1933,
2009,
2033,
2046,
2080,
2098,
2106,
2123,
2188,
2215,
2240,
2279,
2296,
2381,
2402,
2419,
2494,
2516,
2533,
2631,
2657,
2677,
2763,
2788,
2850,
2884,
2914,
2964,
2977,
3020,
3044,
3119,
3120,
3143,
3187,
3273,
3297,
3298,
3409,
3454,
3491,
3517,
3567,
3663,
3727,
3767,
3810,
3863,
3879,
3934,
3940,
3947,
3953,
3960,
3976,
3982,
3989,
3992,
3997,
3998,
4010,
4011,
4022,
4023,
4032,
4033,
4048,
4058,
4067,
4089,
4101,
4107,
4110,
4117,
4124,
4129,
4136,
4137,
4143,
4144,
4178,
4208,
4209,
4213
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4213,
"ccnet_original_nlines": 131,
"rps_doc_curly_bracket": 0.005696650128811598,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06986027956008911,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04890219867229462,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6097804307937622,
"rps_doc_frac_unique_words": 0.8295964002609253,
"rps_doc_mean_word_length": 11.878923416137695,
"rps_doc_num_sentences": 57,
"rps_doc_symbol_to_word_ratio": 0.018962079659104347,
"rps_doc_unigram_entropy": 5.130163192749023,
"rps_doc_word_count": 223,
"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.01661003939807415,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -396.4778137207031,
"rps_doc_books_importance_length_correction": -396.4778137207031,
"rps_doc_openwebtext_importance": -251.3560791015625,
"rps_doc_openwebtext_importance_length_correction": -251.3560791015625,
"rps_doc_wikipedia_importance": -100.55699157714844,
"rps_doc_wikipedia_importance_length_correction": -100.55699157714844
},
"fasttext": {
"dclm": 0.999481737613678,
"english": 0.13033901154994965,
"fineweb_edu_approx": 3.382835865020752,
"eai_general_math": 0.9863574504852295,
"eai_open_web_math": 0.24907910823822021,
"eai_web_code": 0.7869530320167542
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,646,876,568,889,580,000 |
NCL Website header
NCL Home> Application examples> Data sets || Data files for some examples
Example pages containing: tips | resources | functions/procedures
HDF: Hierarchical Data Format
HDF-SDS: Scientific Data Set
HDF-EOS: Earth Observing System
HDF and HDF-EOS
In 1993, NASA chose the Hierarchical Data Format Version 4 (HDF4) to be the official format for all data products derived by the Earth Observing System (EOS). It is commonly used for satellite based data sets. There are several 'models' of HDF4 which can be a bit confusing. Each model addresses different needs. One model is the Scientific Data Set (SDS) which is similar to netCDF-3 (Classic netCDF). It supports multi-dimensional gridded data with meta-data including support for an unlimited dimension.
To better serve a broader spectrum within the user community with needs for geolocated data, a new format or convention, HDF-EOS2 was developed. HDF-EOS supports three geospatial data types: grid, point, and swath.
Limitations of the HDF4 format, needs for improved data compression and changing computer paradigms led to the introduction of a new HDF format (HDF5) in 2008. The HDF4 and HDF5 appellations might imply some level of compatibility. Unfortunately, no! These are completely independent formats. The calling interfaces and underlying storage formats are different.
Unlike the netCDF community which has a well established history of conventions (eg., Climate and Forecast convention), there seems to be a lack of commonly accepted conventions by the HDF satellite community. For example the "units" for geographical coordinates under the CF convention must be recognized by the udunits package. Often on HDF files the latitude and longitude variables will have the units "degrees" while netCDF's CF convention would require "degrees_north" and "degrees_east" or some other recognized units.
Some experiments (eg, AURA) have developed "guidelines" for data. However, perhaps because the spectrum of experiments is large, the HDF community does not have a "culture" where broadly accepted conventions are commonly used.
NASA Data Processing Levels
NASA data products are processed at various Data Processing Levels ranging from Level 0 to Level 4. Level 0 products are raw data at full instrument resolution. At higher levels, the data are converted into more useful parameters and formats. Often the levels are included in the file name: eg. L0, L1, L1A, L1B, ..., L3, L4.
NCL General Comments
NCL recognizes and supports multiple data formats including HDF4, HDF5, HDF-EOS2 and HDF-EOS5. The following HDF related file extensions are recognized: "hdf", "hdfeos", "he2", "he4", and "he5".
The first rule of 'data processing' is to look at the data. The command line utility ncl_filedump can be used to examine a file's contents. Information such as a variable's type, size, shape can allow users to develop optimal code for processing.
The stat_dispersion and pdfx functions can be used to examine a variable's distribution. It is not uncommon for outliers to be present. If so, it is best to manually specify the contour limits and spacing to maximize information content on the plots.
A possible source of confusion is that variables that are "short" or "byte" can be unpacked to float via two different formulations. If x represents a variable of type "short" or "byte", the unpacked or scaled value can be derived via:
value = x*scale_factor + add_offset
or
value = (x - add_offset)*scale_factor
Examples of files that use the latter formula are at MYDATML_2, MYD04_L2.
The NCL functions short2flt/ byte2flt can be used to unpack the former, while, short2flt_hdf/ byte2flt_hdf can be used to unpack the latter.
FYI: An Inconsistency between Reading HDF4 and HDF-EOS2
The following does not apply for NCL versions 6.2.0 and newer. NCL v6.2.0 perform a 'double read' HDF and HDF-EOS and merges the appropriate meta data.
An issue which may confuse users reading HDF-EOS2 files is that a variable imported after a file has been opened with a .hdf extension may have different meta data associated with it then if it had been imported after being opened with a .hdfeos or .he2 extension. The reason is that although HDF-EOS2 library has an interface for getting variable attributes, many of the attributes that would be visible when reading using the straight HDF library are not accessible using the HDFEOS library. Conversely, the coordinates are often only visible using the HDF-EOS2 library. So, currently, the only solution is for the user to examine the variable by opening the file via each extension (ie: a 'double read').
Data used in the Examples
Regardless of the dataset used, the same principle can be used to process the data.
HDF-SDS [hdf]
TRMM - Tropical Rainfall Measuring Mission
MODIS - Moderate Resolution Imaging Spectroradiometer
SeaWiFS- Sea-viewing Wide Field-of-view Sensor [ SeaWiFS examples ]
HDF4EOS [he2, he4, hdfeos]
AIRS - Atmospheric Infrared Sounder
MODIS - Moderate Resolution Imaging Spectroradiometer
HDF5EOS [he5]
HIRDLS - High Resolution Dynamics Limb Sounder
MLS - Microwave Limb Sounder
OMI - Ozone Monitoring Instrument
TES - Tropospheric Emission Spectrometer
HDF5 [h5]
GPM - Global Precipitation Mission
SMAP - Soil Moisture Active Passive
HDF Group Comprehensive Examples
The HDF-Group has created a suite of examples called the hdfeos.org/zoo. It contains NCL, Matlab, IDL and Python example scripts and the associated images. A 'side-benefit' is that looking at these examples provides some insight on how the different tools accomplish the same task. Caveat: Possibly, an expert in any one of these languages could create a more elegent script and better image.
They also provide NCL specific comments.
Some HDF examples may need a library named HDFEOS_LIB.ncl .
hdf4sds_1.ncl: Read a TRMM file containing 3-hourly precipitation at 0.25 degree resolution. The geographical extent is 40S to 40N. This data is from the Tropical Rainfall Measuring Mission (TRMM).
Create a packed netCDF using the pack_values function. This creates a file half the size of those created using float values. Some precision is lost but is not important here.
This HDF file is classifed as a "Scientific Data Set" (HDF4-SDS). Unfortunately, the file is not 'self-contained'. because the file contnts do not contain the geographical coordinates or temporal information The former must be obtained via a web site while the time is embedded within the file name.
hdf4sds_2.ncl: Read an HDF4-SDS file that contains high resolution (1km) data over India and Sri Lanka. The file does not explicitly contain any coordinate arrays. However, the variable on the file "Mapped_Composited_mapped" does have the following attributes:
Slope : 1
Intercept : 0
Scaling : linear
Limit : ( 4, 62, 27, 95 )
Projection_ID : 8
Latitude_Center : 0
Longitude_Center : 78.5
Rotation : 0
The Slope/Intercept attributes would indicate that no scaling has been applied to the data. The Limit attribute indicates the geographical limits and the Latitude_Center/Longitude_Center/Rotation specify map attributes. The variable does not specify any missing value [_FillValue] attribute but, after looking at the data, it was noted that the value -1 is appropriate.
The stat_dispersion function was used to determine the standard and robust estimates of the variable's dispersion. Outliers are present and the contour information was manually specified.
hdf4sds_3.ncl: Read multiple files (here, 131 files) for one particular day; for each file bin and sum the satellite data using bin_sum; after all files have been read, use bin_avg to average all the summed values; plot; create a netCDF of the binned (gridded data).
Note: Here the data are netCDF files. However, the original files were HDF-SDS (eg: MYD06_L2.A2005364.1405.005.2006127140531.hdf). The originating scientist converted these to netCDF for some reason. NCL can handle either. Only the file extension need be changed (.nc to .hdf).
hdf4sds_4.ncl: Read a HDF-SDS dataset containing MODIS Aqua Level-3 SSTs. The file attributes contain the geographical information and this is used to generate coordinate variables. One issue is that the data "l3m_data" are of type "unsigned short". These are not explicitly supported through v5.1.1 (but will be in 5.2.0). Hence, a simple 'work-around' is used.
In addition to plotting the original 9KM data, the area_hi2lores is used to interpolate the data to a 0.5x0.5 grid. A netCDF file is created.
Other 'L3' datasets could be directly used in the sample script. For example: Example 3 on the SeaWiFS Application page.
hdf4sds_5.ncl: Read four MODIS HDF datasets and create a series of swath contours over an Orthographic map. The 2D lat/lon data is read off of each file and used to determine where on the map to overlay the contours.
This example uses gsn_csm_contour_map to create the map plot with the first set of contours, and then creates the remaining contour plots with gsn_csm_contour. The overlay procedure is then used to overlay these remaining contour plots over the existing contour/map plot.
hdf4sds_6.ncl: TRMM 2A12: TMI Hydrometeor (cloud liquid water, prec. water, cloud ice, prec. ice) contains profiles in 14 layers at 5 km horizontal resolution, along with latent heat and surface rain, over a 760 km swath. Specify a variable (here, "latentHeat") and plot (a) the entire swath; (b) region near India; (c) a vertical profile at locations where the latent heat exceeds 1500. The file contains no units information for the variables.
hdf4sds_7.ncl: A SEVIRI Level-3 water vapor data set. The variable is packed in a rather unusual fashion. The flags should be viewed to determine the source of the data.
hdf4sds_8.ncl: A TRMM A25 file is read. At each pixel, the maximum 'correctZFactor' from all levels is extracted using dim_max_n. Several ways of presenting the data for a swath are illustrated.
hdf4sds_9.ncl: A TRMM A25 file is read. The 'nearSurfZ' is imported. Several ways of presenting the data for a swath are illustrated.
hdf4eos_1.ncl: Read a HDF-EOS2 file containing swath data. NCL identifies the swath as MODIS_SWATH_Type_L1B. Create a simple plot of reflectance with coordinates of scanline and pixel.
The eos.hdf that appears as the file name is an alias for MOOD021KM.A2000303.1920.002.2000317044659.hdf. It is not uncommon for a HDF-EOS2 file to have the ".hdf" file extension. In this case, NCL will open and read the file sucessfully but it is best to manually append the ".hdfeos" extension when opening the file in the addfile function.
ncl_filedump eos.hdf
yields
filename: eos
path: eos.hdf
file global attributes:
HDFEOSVersion : HDFEOS_V2.6
StructMetadata_0 : GROUP=SwathStructure
GROUP=SWATH_1
SwathName="MODIS_SWATH_Type_L1B"
[...SNIP...]
END_GROUP=SWATH_1
END_GROUP=SwathStructure
[...SNIP...]
hdf4eos_2.ncl: Example of a radiance plot. Note that the color table is reversed from example 1.
hdf4eos_3.ncl: A multiple contour plot of other quantities on the MODIS file.
hdf4eos_4.ncl: MODIS data placed on a geographical projection. A rather awkward aspect of this file is that the Latitude and Longitude variables differ in size from the variable being plotted.
The 5 added to the map limits is arbitrary (not required). Here it is used to specify extra space around the plot.
hdf4eos_5.ncl: Illustrates the use of dim_gbits to extract specic bits within a bit-stream. A data (variable) issue is that the cloud mask variable is on a 1-km grid while the latitude/longitude variables are on a 5-km grid. NCL array syntax (::5) is used to decimate (sub-sample) the 1-km array to the 5-km array) It also demonstrates explicitly labeling different label bar colors with a specific integers.
The use of res@trGridType = "TriangularMesh" makes the plotting faster.
NCL 6.5.0 introduces a new function, get_bitfield, that will simplify the use of dim_gbits. hdf4eos_5a.ncl illustrates the use of this new function to obtain the same result.
hdf4eos_6.ncl: Read an AIRS Level-3 file (here, product type AIRX3STD). This uses the AIR IR and MSU instruments. Although on a 1x1 degree grid, the grid point values represent satellite swaths that have been binned over a period of time (24 hours). The data to the left and right of the Date Line represent values that were sampled at different times. Hence, the gridded values are not cyclic in longitude.
Support for HDF5 and HDF-EOS5 is present in v5.2.0 which was released April 14, 2010. Some samples follow.
hdf5eos_1.ncl: Read a HDF-EOS5 (available v5.2.0) file from the Aura OMI (Ozone Monitoring Instrument) and plot all the variables on the file. Here only two of the variables are shown.
hdf5eos_2.ncl: Read an HDF-EOS5 (available v5.2.0) file (OMI) and plot selected variables on the file. (The ncl_filedump utility was used to preview the file's contents,) This example also demonstrates how to retrieve a variable's type prior to reading it into memory. (See getfilevartypes.) It is best to use short2flt or byte2flt if the variable type is "short" or "byte". These functions will automatically apply the proper scaling.
Note that the units for the "EffectiveTemperature" variable appear to be incorrect. They indicate "degrees Celsius" but the range would indicate "degrees Kelvin". This could be addressed by adding the following to the script after the variable has been imported:
if (vNam(nv).eq."EffectiveTemperature_ColumnAmountO3") then
x@units = "degrees Kelvin" ; fix bad units
end if
hdf5eos_3.ncl: Read an HDF-EOS5 (available v5.2.0) file from the MLS (Aura Microwave Limb Sounder) and plot a two-dimensional cross-section (pressure/time) of temperature. Then plot the trajectory of the satellite over this time.
Sean Davis (NOAA) has put together a gridded satellite WV/ozone product called SWOOSH that includes MLS data.
hdf5eos_3a.ncl: Very similar to the previous example: (a) Different data set (MLS-Aura_L2GP-O3); (b) trajectory values are colored by value. The 3 left figures show the vertical profile of O3 along the trajectory for (i) all levels; (b) a smaller subset; and (c) a very small subset. A user requested an example of gridding the sparsely sampled trajectory data. Obviously it was not a 'nice' picture.
Sean Davis (NOAA) has put together a gridded satellite WV/ozone product called SWOOSH that includes MLS data.
hdf5eos_4.ncl: Read an HDF-EOS5 (available v5.2.0) file from the HIRDLS: (a) Use stat_dispersion to print the statistical information for each variable; (b) compute PDFs via pdfx; (c) plot cross-sections; and, (d) plot time series of three different variables.
hdf5eos_5.ncl: Read two similar OMI files (L3-OMDOAO3e and L3-OMTO3e). This illustrates that users must look at a file's contents before using. (Use ncl_filedump) Here, there are two files with similar variables but NCL assigns slightly different names.
The OMI L3 files used in this example have a bug in the way the OMI data were written to the files. NCL version 6.1.0 and later will be able to identify OMI data files and will automatically correct for the latitude reversal.
amsr_1.ncl: Swaths containing soil moisture from the Advanced Microwave Scanning Radiometer (AMSR) are read from multiple h5 files. Documentation was not available but there were file 'issues': (1) The variable name has a space ("Geophysical Data"); (2) The variable has an attribute FillValue and not _FillValue; (3) There are two 'missing value categories' (-32767s, -32768s) (4) The unrecognized unpacking attribute ["SCALE FACTOR"] to must be converted to "scale_factor" for use by NCL's short2flt function.
MOPITT_MOP03M_1.ncl: Read a variable and plot a user specified level. The grid is (180x360). Missing values are present. A common issue with HDF files is that they do not contain all the desired information or units. Hence, they must be manually provided.
MOPITT_MOP03M_2.ncl: Read a variable and plot all levels.
MOPITT_MOP03M_3.ncl: Read a variable and interpolate to a much coarser 46x72 grid using linint2_Wrap and area_hi2lores_Wrap. Missing areas are present. Then use poisson_grid_fill to fill in the missing values and repeat the interpolations.
MOPITT_MOP02T_1.ncl: Reads "CO Total Column" across a time interval and a selected spatial region, and plots it on a map using a range of colored markers.
This script was contributed by Rebecca Buchholz, a researcher in the Atmospheric Chemistry Division at NCAR.
hdf5_1.ncl: Read a variable and plot it according to a palette specified on the file. The MSG (Meteosat Second Generation) file is HDF5. The desired variables contain a dash and a space which are not allowed in NCL variable names. Hence, the variables are enclosed in quotes to make them type string. For the -> file syntax operator to successfully access the string variables, they must be enclosed within dollar sign ($).
hdf5_2.ncl: HDF5 (h5) files can be complicated. Users should become acquainted with the file's contents prior to creating a script. An ncl_filedump of the file would yield:
%> ncl_filedump K1VHR_15NOV2013_1200_L02_OLR.h5 | less
Variable: f
Type: file
filename: K1VHR_15NOV2013_1200_L02_OLR
path: K1VHR_15NOV2013_1200_L02_OLR.h5
file global attributes:
dimensions:
DIM_000 = 250601
variables:
group </OLR>
compound <OLR_Dataset> (Latitude, Longitude, OLR) (DIM_000)
group </OLR/GP_PARAM_INFO>
GP_PARAM_DESCRIPTION : Every_Acquisition
GP_PARAM_NAME : Outgoing Longwave Radiation (OLR)
Input_Channels : TIR
LatInterval : 0.25
Latitude_Unit : Degrees
LonInterval : 0.25
Longitude_Unit : Degrees
MissingValueInProduct : 999
OLR_Unit : Watts/sq. met.
ValidBottomLat : -60
ValidLeftLon : 10
ValidRightLon : 140
ValidTopLat : 60
group </PRODUCT_INFORMATION>
GROUND_STATION : BES,SAC/ISRO,Ahmedabad,INDIA.
HDF_PRODUCT_FILE_NAME : K1VHR_15NOV2013_1200_L02_OLR.h5
OUTPUT_FORMAT : hdf5-1.6.6
PRODUCT_CREATION_TIME : 2013-11-15T18:01:49 _L02_OLR.h5
STATION_ID : BES3-11-15T18:01:49 _L02_OLR.h5
UNIQUE_ID : K1VHR_15NOV2013_1200_L02_OLR.h5
group </PRODUCT_METADATA>
group </PRODUCT_METADATA/PRODUCT_DETAILS>
ACQUISITION_DATE : 15NOV2013
ACQUISITION_TIME_IN_GMT : 1200V2013
PROCESSING_LEVEL : L020V2013
PROCESSING_SOFTWARE : InPGS_XXXXXXXXXXXXXX
PRODUCT_NAME : GP_OLR XXXXX
PRODUCT_TYPE : GEOPHY
SENSOR_ID : VHRPHY
SPACECRAFT_ID : KALPANA-1
Read a h5 (HDF5) file with 'group' fields. Note the syntax used by NCL. The Latitude, Longitude and OLR are one-dimensional arrays of size 250601. There are no general file conventions for HDF5 files. Users must examine the file's contents and explicitly extract desired information. The region of the globe is defined as attributes of the group /OLR/GP_PARAM_INFO. These are used to create rectilinear grid coordinates which are associated with the variable to be plotted (olr) and written to a netCDF file.
FYI: It is not necessay to make a two-dimensional grid. NCL can plot one-dimensional latitude/longitudinal/values with appropriate graphical resource settings. However, since a script option is to create a netCDF file. It was designed to create the variable as a conventional two-dimensional array.
seawif_4.ncl: Read a SeaWIFS variable and use meta data contained within the file attributes to construct a complete (ie, self contained) variable. The initial look at the file was via the ncl_filedump command line operator.
Data files were obtained here.
Additional SeaWIFS examples are available here.
smap_l3_1.ncl:
NOTE: It is recommended that users use ncl_filedump to carefully examine the SMAP level-3 (l3) file prior to use. Note the 'complexity' of the file. Assorted variables are within 'groups.' NCL offers two ways to access data within groups. This and other examples use the 'full path' method. (see script)
Read soil moisture from an individual H5 SMAP level-3 (l3) file. The data are on a regular grid BUT the data is from a swath. The desired variable is named 'soil_moisture'. It is located within the group named Soil_Moisture_Retrieval_Data. The latitude and longitude variables are within this group also. A peculiarity is that the 'latitude' and 'longitude' variables do not have an _FillValue attribute associated with them. However, a printMinMax indicates a minimum value of -9999.0 for each. The script assigns these manually.
smap_l3_2.ncl: Similar to smap_l3_1. The difference is that this read mutiple files. The files are processed one-by-one. Only the first three of of nine SMAP files are shown.
smap_l3_3.ncl: This loops over the nine files for a particular period and creates a composite plot by overlaying individual graphical swath grids. Setting, res@cnMissingValFillColor= "Transparent", keeps plotting from previous grids from being overwritten.
smap_l3_4.ncl: Similar result to smap_l3_3.ncl. However, it is obtained via a different method. A 'super variable' is create and the grid points are filled by use of a where function. After reading the EASE latitude and longitude variables from a separate file (SMAP_EASE.406x964.nc), the resulting super variable is plotted.
|
{
"url": "http://ncl.ucar.edu/Applications/HDF.shtml",
"source_domain": "ncl.ucar.edu",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "50441",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CFNUJL7NEHDBQE2KCL3LJNYOXFRS3RPF",
"WARC-Concurrent-To": "<urn:uuid:943e709b-e3c1-48f8-87d2-88bd797ad5e1>",
"WARC-Date": "2018-12-10T06:17:55Z",
"WARC-IP-Address": "128.117.225.48",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:HRWZ3W6VLBK5RZ7WCBOXFG4HXXYGWTOT",
"WARC-Record-ID": "<urn:uuid:782b1c12-edb3-4e2c-9b0b-e2aabfba782f>",
"WARC-Target-URI": "http://ncl.ucar.edu/Applications/HDF.shtml",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:616d02e6-522f-4003-adc0-34b86c0f0518>"
},
"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-168-82-48.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,
19,
93,
94,
160,
161,
191,
220,
252,
253,
269,
270,
777,
778,
993,
994,
1356,
1357,
1883,
1884,
2111,
2112,
2140,
2141,
2467,
2468,
2489,
2490,
2685,
2686,
2933,
2934,
3185,
3186,
3422,
3423,
3470,
3473,
3521,
3522,
3596,
3597,
3738,
3739,
3795,
3796,
3948,
3949,
4657,
4658,
4684,
4685,
4769,
4770,
4784,
4832,
4890,
4961,
4962,
4989,
5030,
5088,
5089,
5103,
5153,
5188,
5228,
5275,
5276,
5286,
5327,
5369,
5370,
5403,
5404,
5797,
5798,
5839,
5840,
5900,
5901,
6099,
6100,
6276,
6277,
6577,
6578,
6839,
6866,
6893,
6924,
6975,
7009,
7046,
7083,
7112,
7482,
7483,
7671,
7672,
7939,
7940,
8218,
8219,
8582,
8583,
8725,
8726,
8847,
8848,
9065,
9066,
9338,
9339,
9785,
9786,
9956,
9957,
10152,
10153,
10287,
10288,
10473,
10474,
10816,
10817,
10843,
10850,
10875,
10891,
10918,
10952,
10998,
11020,
11069,
11098,
11124,
11149,
11162,
11259,
11337,
11530,
11531,
11646,
12055,
12056,
12128,
12129,
12304,
12305,
12713,
12820,
13005,
13441,
13442,
13705,
13706,
13771,
13829,
13841,
14071,
14072,
14182,
14183,
14584,
14585,
14695,
14696,
14957,
15211,
15212,
15438,
15439,
15951,
16207,
16265,
16505,
16660,
16661,
16770,
16771,
17195,
17368,
17369,
17427,
17428,
17446,
17463,
17514,
17560,
17593,
17614,
17643,
17644,
17664,
17689,
17696,
17771,
17778,
17817,
17824,
17880,
17952,
18007,
18042,
18097,
18132,
18187,
18238,
18285,
18328,
18363,
18406,
18441,
18448,
18489,
18496,
18565,
18643,
18692,
18770,
18832,
18894,
18901,
18939,
18946,
19000,
19007,
19055,
19111,
19159,
19218,
19269,
19306,
19343,
19391,
19392,
19901,
19902,
20201,
20202,
20427,
20428,
20459,
20460,
20508,
20509,
20524,
20828,
20829,
21360,
21361,
21536,
21793,
22119,
22120
],
"line_end_idx": [
19,
93,
94,
160,
161,
191,
220,
252,
253,
269,
270,
777,
778,
993,
994,
1356,
1357,
1883,
1884,
2111,
2112,
2140,
2141,
2467,
2468,
2489,
2490,
2685,
2686,
2933,
2934,
3185,
3186,
3422,
3423,
3470,
3473,
3521,
3522,
3596,
3597,
3738,
3739,
3795,
3796,
3948,
3949,
4657,
4658,
4684,
4685,
4769,
4770,
4784,
4832,
4890,
4961,
4962,
4989,
5030,
5088,
5089,
5103,
5153,
5188,
5228,
5275,
5276,
5286,
5327,
5369,
5370,
5403,
5404,
5797,
5798,
5839,
5840,
5900,
5901,
6099,
6100,
6276,
6277,
6577,
6578,
6839,
6866,
6893,
6924,
6975,
7009,
7046,
7083,
7112,
7482,
7483,
7671,
7672,
7939,
7940,
8218,
8219,
8582,
8583,
8725,
8726,
8847,
8848,
9065,
9066,
9338,
9339,
9785,
9786,
9956,
9957,
10152,
10153,
10287,
10288,
10473,
10474,
10816,
10817,
10843,
10850,
10875,
10891,
10918,
10952,
10998,
11020,
11069,
11098,
11124,
11149,
11162,
11259,
11337,
11530,
11531,
11646,
12055,
12056,
12128,
12129,
12304,
12305,
12713,
12820,
13005,
13441,
13442,
13705,
13706,
13771,
13829,
13841,
14071,
14072,
14182,
14183,
14584,
14585,
14695,
14696,
14957,
15211,
15212,
15438,
15439,
15951,
16207,
16265,
16505,
16660,
16661,
16770,
16771,
17195,
17368,
17369,
17427,
17428,
17446,
17463,
17514,
17560,
17593,
17614,
17643,
17644,
17664,
17689,
17696,
17771,
17778,
17817,
17824,
17880,
17952,
18007,
18042,
18097,
18132,
18187,
18238,
18285,
18328,
18363,
18406,
18441,
18448,
18489,
18496,
18565,
18643,
18692,
18770,
18832,
18894,
18901,
18939,
18946,
19000,
19007,
19055,
19111,
19159,
19218,
19269,
19306,
19343,
19391,
19392,
19901,
19902,
20201,
20202,
20427,
20428,
20459,
20460,
20508,
20509,
20524,
20828,
20829,
21360,
21361,
21536,
21793,
22119,
22120,
22121
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 22121,
"ccnet_original_nlines": 255,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3018689453601837,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06505796313285828,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23894014954566956,
"rps_doc_frac_unique_words": 0.31602564454078674,
"rps_doc_mean_word_length": 5.324038505554199,
"rps_doc_num_sentences": 311,
"rps_doc_symbol_to_word_ratio": 0.0011828700080513954,
"rps_doc_unigram_entropy": 5.890545845031738,
"rps_doc_word_count": 3120,
"rps_doc_frac_chars_dupe_10grams": 0.017097100615501404,
"rps_doc_frac_chars_dupe_5grams": 0.054120760411024094,
"rps_doc_frac_chars_dupe_6grams": 0.036662448197603226,
"rps_doc_frac_chars_dupe_7grams": 0.026127269491553307,
"rps_doc_frac_chars_dupe_8grams": 0.021551979705691338,
"rps_doc_frac_chars_dupe_9grams": 0.017097100615501404,
"rps_doc_frac_chars_top_2gram": 0.008849560283124447,
"rps_doc_frac_chars_top_3gram": 0.006020110100507736,
"rps_doc_frac_chars_top_4gram": 0.008729159832000732,
"rps_doc_books_importance": -1902.3582763671875,
"rps_doc_books_importance_length_correction": -1902.3582763671875,
"rps_doc_openwebtext_importance": -1059.2989501953125,
"rps_doc_openwebtext_importance_length_correction": -1059.2989501953125,
"rps_doc_wikipedia_importance": -699.534912109375,
"rps_doc_wikipedia_importance_length_correction": -699.534912109375
},
"fasttext": {
"dclm": 0.04508275166153908,
"english": 0.8331881761550903,
"fineweb_edu_approx": 2.9215281009674072,
"eai_general_math": 0.9326838850975037,
"eai_open_web_math": 0.3411635160446167,
"eai_web_code": 0.9212943315505981
}
}
|
{
"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": "551.0285",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Geology and Earth sciences",
"level_3": "Physical geology and Geodynamics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-7,743,727,494,395,265,000 |
blog.audioacrobat.com
Audacity: How To Add Intro Music (Windows 7) | AudioAcrobat
In today's post we walk our readers through the process of using our favorite free, open source audio editing software for PC, aka Audacity to add a short intro to any spoken word audio track, such as interviews, coaching sessions, teleconferences, audiobooks and more!
|
{
"url": "https://www.tumblr.com/widgets/share/tool/preview?shareSource=legacy&canonicalUrl=&url=http%3A%2F%2Fblog.audioacrobat.com%2F2012%2F10%2Faudacity-how-to-add-intro-music-windows-7%2F&title=Audacity%3A+How+To+Add+Intro+Music+%28Windows+7%29",
"source_domain": "www.tumblr.com",
"snapshot_id": "crawl=CC-MAIN-2019-09",
"warc_metadata": {
"Content-Length": "33672",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZVATPGXCZIUMNY3ENAHRY5TRBPYFULYX",
"WARC-Concurrent-To": "<urn:uuid:8b2135e5-78ac-4650-8b04-9375cb02d068>",
"WARC-Date": "2019-02-17T10:59:45Z",
"WARC-IP-Address": "69.147.92.13",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HPPUZRUF5EUY22UKWZFJATATHRKBUBGO",
"WARC-Record-ID": "<urn:uuid:93043853-942c-4d75-8464-a32be2894939>",
"WARC-Target-URI": "https://www.tumblr.com/widgets/share/tool/preview?shareSource=legacy&canonicalUrl=&url=http%3A%2F%2Fblog.audioacrobat.com%2F2012%2F10%2Faudacity-how-to-add-intro-music-windows-7%2F&title=Audacity%3A+How+To+Add+Intro+Music+%28Windows+7%29",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:586522ce-1c0a-4b2f-b9d9-d198266ac373>"
},
"warc_info": "isPartOf: CC-MAIN-2019-09\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-171-229-147.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,
22,
82
],
"line_end_idx": [
22,
82,
351
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 351,
"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.2535211443901062,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014084509573876858,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2112676054239273,
"rps_doc_frac_unique_words": 0.8703703880310059,
"rps_doc_mean_word_length": 5.240740776062012,
"rps_doc_num_sentences": 3,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.7995893955230713,
"rps_doc_word_count": 54,
"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.035335689783096313,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -39.99976348876953,
"rps_doc_books_importance_length_correction": -39.99976348876953,
"rps_doc_openwebtext_importance": -13.65477466583252,
"rps_doc_openwebtext_importance_length_correction": -13.65477466583252,
"rps_doc_wikipedia_importance": -9.732004165649414,
"rps_doc_wikipedia_importance_length_correction": -9.732004165649414
},
"fasttext": {
"dclm": 0.17884492874145508,
"english": 0.8470102548599243,
"fineweb_edu_approx": 1.2835791110992432,
"eai_general_math": 0.0029853000305593014,
"eai_open_web_math": 0.03085183911025524,
"eai_web_code": 0.0013551099691540003
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "781.2",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": "Music theory"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,499,588,135,933,819,000 |
Coding, Development, Internet, Technology, Web
Programming languages For Artificial Intelligence and Machine Learning
Artificial Intelligence (AI) has now become one of the most important parts of our everyday lives, and AI Provides all the opportunities...
avatar Written by Sushant Gupta · 4 min read >
Artificial Intelligence (AI) has now become one of the most important parts of our everyday lives, and AI Provides all the opportunities it offers in hundreds of diverse uses cases and circumstances, to not even say how quick and convenient it has made a life for us. With both the increase in recent years, AI has come a long way toward helping companies develop and reach their maximum potential. These advances in AI might not have been feasible without a significant change in the programming languages supporting them.
Mostly with an increase in AI, there is a need for effective and professional programmers and developers to have increased, along with developments in programming languages. Although there are a lot of programming languages that have to go and get clients to start to develop on AI, hardly any single programming language is indeed a yet another-step solution for AI programming, and although it’s very different objectives require a particular approach for each project.Â
Well here we are discussing some of the more commonly used Programming languages in AI is ones mentioned below and give decision-taking to you —
Top Programming Language for Artificial Intelligence and Machine Learning
If it seems like you’re developing a new machine learning or Artificial Intelligence project and you haven’t determined which vocabulary you can use to design it, so you’re in the right spot. Artificial Intelligence is primarily aimed at making constructively thought-provoking machines in the same way as intelligent people think. Here are all some of the top languages which are most widely used during Making AI projects:
Python
Python language is one of the strong languages that you can still use or read. Python Language was introduced in 1991, Python was a survey that tends to suggest that 57% of developers are much more likely to choose Python over C++, C, and Java as their preferred programming language for developing any AI software solutions. Being quick to learn, Python makes it easier for software developers and data scientists to enter the field of AI development. Python is also an exercise about just how much more freedom programmers want. Much more freedom and no one can ever read another code; too little or short and expressiveness is in risk and syntax-free code.
 Python does not offer you can still get outstanding community support and a wide range of libraries, but Python can also enjoy the potential impact of some other programming languages. Many of the new and advanced features that you can benefit even more from Python and Python is completely platform-independent and exhaustive frameworks for artificial intelligence and Machine Learning.
• TensorFlow:Â TensorFlow for artificial intelligence tasks and databases.
• Scikit-learn:Â Scikit-learn for having trained machine learning techniques.
• PyTorch:Â PyTorch is pattern recognition and machine learning processing.
• Keras:Â Keras is just a code application for highly huge amounts of data and operational activities.
• SparkMLlib:Â SparkMLlib such as Apache Spark’s Artificial Intelligent and machine learning makes machine learning accessible for anyone with tools including algorithms and appliances.
Java
Java programming language is also another option for the development of AI. Artificial intelligence seems to have a lot to be doing with searching algorithms, artificial neural networks, and genetic engineering. Java provides several benefits: simplicity of using it, the efficiency of debugging, kit utilities, streamlined function for large-scale projects, dynamic statistical analysis, and better user experience. It also includes Swings and SWT. These devices enable the visuals and applications interface to look appealing and elegant.
Java Programming Language has been used to create AI in several ways to learn about several Library are:
• TensorFlow Library
The TensorFlow list of benefits programming languages as well will include Java via an API. Help is not as feature-rich as some other completely implemented languages but is being developed at a fast rate.
• Deep Java
Deep Java Library was Developed by Amazon to develop and deploy Java machine learning capabilities.
• Kubeflow
Kubeflow supports quick installation and control of Machine Learning of Kubenet frameworks, offering ready-to-use ML applications.
• Prolog
This is Short for Logic Programming language, Prolog language has first appeared in 1972. It is an amazing method to improve Artificial Intelligence, especially natural language. Prolog functions well to build mobile applications, ELIZA was the very first mobile chat app ever to work with Prolog.
Prolog language stays opposite Lisp Language when we talk about innovations in the AI sector. The capabilities it offers include effective regular expressions, graphical-based data structuring, and automated backtracking. Both of these features have remarkably strong and versatile programming structures. Prolog is commonly used for continuing to work on clinical projects as well as for designing specialized AI technology.
Lisp
Lisp Language is one of the older and most suitable languages for Artificial intelligence. John McCarthy, the founder of machine learning, developed it in 1958. This can interpret abstract information efficiently. This is also well known for its high development and testing capability and fast creative development of new models with automated waste management. The development process enables the dynamic validation of symbols and the recompiling of functions or data while the software still is working. Through the years of owing to development, all of these characteristics have spread to most of the other languages, impacting the individuality of Lisp.
Haskell
This Haskell Language is Established in 1990 and This Programming Language was named just after the name of famous mathematician Haskell Wallace Curry, Haskell is a strictly functional and head office programming language, coupled with lazy validation and short language. It’s also known as a very secure programming language because it seems to provide more consistency when it comes to managing errors. After all, they seldom happen in Haskell relative to some of the other programming languages. Even if they do occur, most non-synthetic errors are recorded at compile-time rather than just runtime. Haskell features help to improve the productive capacity of the software developer. Haskell is much like most programming languages, only used with a small community of developers. Disregarding the challenges, Haskell could even prove to be about as good as some other trying to compete for languages besides AI to increase acceptance by the development community.
R Language
R is among the most powerful languages and frameworks for the study and processing of data for data collection. Using R, we could easily generate particularly poorly-designed publisher-quality graphs, incorporating mathematical formulas and formulas where appropriate. Besides being a multipurpose language, R has several packages, such as RODBC, Models, Class, and Tm, that also can be used in artificial intelligence and machine learning. All of these best features have remarkably strong and versatile programming structures. Such applications make it simple to apply machine learning techniques to solve business-related problems.
Suggested:
How can Redis be a Solution to Build an AI-Interference Engine for Real-Time Applications?
Written by Sushant Gupta
Is an Online Geek. Who Diggs out the different ways for how can we make money online. He has been earning through e-commerce sites for years and wants to share his experience with all.
Profile
One Reply to “Programming languages For Artificial Intelligence and Machine Learning”
Leave a Reply
Your email address will not be published.
|
{
"url": "https://www.trickyenough.com/programming-languages-for-artificial-intelligence-machine-learning/",
"source_domain": "www.trickyenough.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "156448",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IIOIL2NCCLRM4JDPTOKIWBNHY4AVNBYH",
"WARC-Concurrent-To": "<urn:uuid:3bf35f97-0305-4e82-a5ac-ae3fc21a9085>",
"WARC-Date": "2022-09-30T06:19:47Z",
"WARC-IP-Address": "3.0.124.199",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DGZZF3RMAQRUY2FIX6YGEHB7F6EKKZHU",
"WARC-Record-ID": "<urn:uuid:d6e26b8d-81d0-4ff1-aed3-022690630244>",
"WARC-Target-URI": "https://www.trickyenough.com/programming-languages-for-artificial-intelligence-machine-learning/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:338e4280-4862-49f3-8f1f-131edf8fa0ae>"
},
"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-96\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,
47,
48,
119,
120,
260,
261,
308,
309,
833,
834,
1308,
1309,
1456,
1457,
1531,
1532,
1957,
1958,
1965,
1966,
2626,
2627,
3017,
3018,
3095,
3175,
3253,
3358,
3546,
3547,
3552,
3553,
4094,
4095,
4200,
4201,
4224,
4225,
4431,
4432,
4447,
4448,
4548,
4549,
4562,
4563,
4694,
4695,
4706,
4707,
5005,
5006,
5432,
5433,
5438,
5439,
6099,
6100,
6108,
6109,
7077,
7078,
7089,
7090,
7725,
7726,
7737,
7738,
7829,
7830,
7855,
8040,
8042,
8052,
8053,
8139,
8140,
8154,
8155
],
"line_end_idx": [
47,
48,
119,
120,
260,
261,
308,
309,
833,
834,
1308,
1309,
1456,
1457,
1531,
1532,
1957,
1958,
1965,
1966,
2626,
2627,
3017,
3018,
3095,
3175,
3253,
3358,
3546,
3547,
3552,
3553,
4094,
4095,
4200,
4201,
4224,
4225,
4431,
4432,
4447,
4448,
4548,
4549,
4562,
4563,
4694,
4695,
4706,
4707,
5005,
5006,
5432,
5433,
5438,
5439,
6099,
6100,
6108,
6109,
7077,
7078,
7089,
7090,
7725,
7726,
7737,
7738,
7829,
7830,
7855,
8040,
8042,
8052,
8053,
8139,
8140,
8154,
8155,
8196
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8196,
"ccnet_original_nlines": 79,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4050455391407013,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025928519666194916,
"rps_doc_frac_lines_end_with_ellipsis": 0.012500000186264515,
"rps_doc_frac_no_alph_words": 0.12403643876314163,
"rps_doc_frac_unique_words": 0.40740740299224854,
"rps_doc_mean_word_length": 5.438003063201904,
"rps_doc_num_sentences": 59,
"rps_doc_symbol_to_word_ratio": 0.0007007700041867793,
"rps_doc_unigram_entropy": 5.531987190246582,
"rps_doc_word_count": 1242,
"rps_doc_frac_chars_dupe_10grams": 0.03316552937030792,
"rps_doc_frac_chars_dupe_5grams": 0.08942849189043045,
"rps_doc_frac_chars_dupe_6grams": 0.07817590236663818,
"rps_doc_frac_chars_dupe_7grams": 0.051228899508714676,
"rps_doc_frac_chars_dupe_8grams": 0.051228899508714676,
"rps_doc_frac_chars_dupe_9grams": 0.03316552937030792,
"rps_doc_frac_chars_top_2gram": 0.042345281690359116,
"rps_doc_frac_chars_top_3gram": 0.022209059447050095,
"rps_doc_frac_chars_top_4gram": 0.023689670488238335,
"rps_doc_books_importance": -679.7789306640625,
"rps_doc_books_importance_length_correction": -679.7789306640625,
"rps_doc_openwebtext_importance": -494.797119140625,
"rps_doc_openwebtext_importance_length_correction": -494.797119140625,
"rps_doc_wikipedia_importance": -375.5218505859375,
"rps_doc_wikipedia_importance_length_correction": -375.5218505859375
},
"fasttext": {
"dclm": 0.2637339234352112,
"english": 0.9421988725662231,
"fineweb_edu_approx": 2.6469178199768066,
"eai_general_math": 0.33002036809921265,
"eai_open_web_math": 0.1446850299835205,
"eai_web_code": 0.3271905779838562
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "006.3",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "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": "12",
"label": "Listicle"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,729,161,358,940,792,000 |
Interactive City: Click,Click, and There Were None.
By: Yun Mi Koh
Screenshot (35)
For this project, I decided to create a digital interactive display to get a sense of how people react to on-screen interactive display. I installed my project on library where many people were passing by. The project was inspired from article about nature and harming of it through resource gathering. The article talks about how as humans “explore” nature, the ecosystem is broken and bit by bit, ending in complete destruction. I wanted to give symbolic simulation in destruction of nature through human interference.
The project is composed of three major coding designs from processing: spiral, mouse-click, and color gradation. I used my laptop and mouse with the code in full screen. The code is re-development of the spiral coding the class did two week ago. Since the design was about flower, I thought I could develop it to the idea and message I wanted to convey.
The display starts with dots spinning into trail of spiral, looking like patch of flowers. Then interactor would click and realize that the background color changes as different areas of the screen are clicked. As the interator click, the spirals would disperse on screen and more clicking results in the dots and spirals disappearing. By the time the interactor finds all the colors, they realize that there are no more animation of spirals and dots. The background colors are chosen form color of nature: woods, sea, coals, etc… and more one finds variety of background colors aka the nature and its resources, the living part of the environment, the spirals and the dots, disappear.
IMG_0435 IMG_0434
Screenshot (42)
After putting the display up, I asked some people to interact with the design just to get it started and afterward, many approached without me having to ask. I left the display up and observed for about 1.5 hours.
Pro in result of interaction: May people enjoyed it and took interest in the display. I asked random people about what the meaning might be behind the display and surprisingly, many got near or did get what I was trying to convey. I also noticed that many were talking about the display, sharing ideas, etc…
Con in result of interaction: Some people were shy about it or did not really know what to do. Some were hogging the computer or tried to go on different parts of the computer by exiting the display. Also, many just stood and watched rather than actually interacting with the display.
The project and magic circle:
The project created a magic circle by creating sense of social entertainment where people were fathering to interact, talk about it, and try to figure out the interaction together. It also creates magic circle by giving a universal statement and the understanding of what the display is about, which implements identical ideology to the interactors, creating a connection through message.
Author: Yun Mi Koh
|
{
"url": "http://astoryisnotatree.net/?p=3689",
"source_domain": "astoryisnotatree.net",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "66335",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7QBEJGOTVYEPXLBSS6T42A3GIO7VEDTV",
"WARC-Concurrent-To": "<urn:uuid:b3142d81-d1d4-46e5-aff8-01bdc103b2ee>",
"WARC-Date": "2024-04-21T02:21:21Z",
"WARC-IP-Address": "208.109.61.155",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XA6B4LNZEKLWWPWFOHTUFNXYCLHUB23F",
"WARC-Record-ID": "<urn:uuid:250a1a23-eab2-47f6-8fcb-1095e6fe3959>",
"WARC-Target-URI": "http://astoryisnotatree.net/?p=3689",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8a5c8d42-f72b-4115-bb89-a4f6c9267f1d>"
},
"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-246\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
52,
53,
68,
69,
85,
86,
607,
608,
962,
963,
1649,
1650,
1668,
1669,
1685,
1686,
1900,
1901,
2209,
2210,
2496,
2497,
2527,
2528,
2917,
2918
],
"line_end_idx": [
52,
53,
68,
69,
85,
86,
607,
608,
962,
963,
1649,
1650,
1668,
1669,
1685,
1686,
1900,
1901,
2209,
2210,
2496,
2497,
2527,
2528,
2917,
2918,
2936
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2936,
"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.4102112650871277,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024647889658808708,
"rps_doc_frac_lines_end_with_ellipsis": 0.037037041038274765,
"rps_doc_frac_no_alph_words": 0.13204224407672882,
"rps_doc_frac_unique_words": 0.4776422679424286,
"rps_doc_mean_word_length": 4.8008131980896,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0.0035211299546062946,
"rps_doc_unigram_entropy": 4.918247222900391,
"rps_doc_word_count": 492,
"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.03810330107808113,
"rps_doc_frac_chars_top_3gram": 0.006773919798433781,
"rps_doc_frac_chars_top_4gram": 0.017781540751457214,
"rps_doc_books_importance": -200.15061950683594,
"rps_doc_books_importance_length_correction": -200.15061950683594,
"rps_doc_openwebtext_importance": -103.70550537109375,
"rps_doc_openwebtext_importance_length_correction": -103.70550537109375,
"rps_doc_wikipedia_importance": -79.65818786621094,
"rps_doc_wikipedia_importance_length_correction": -79.65818786621094
},
"fasttext": {
"dclm": 0.16298425197601318,
"english": 0.966200053691864,
"fineweb_edu_approx": 2.3858985900878906,
"eai_general_math": 0.5965719819068909,
"eai_open_web_math": 0.14368879795074463,
"eai_web_code": 0.12204408645629883
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0895",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "304.2",
"labels": {
"level_1": "Social sciences",
"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": "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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,185,680,610,004,131,000 |
While I am loving the question feature, when I want to go over the results of the bar graph with the class, several students names and answers can be seen which has already caused one of them anxiety. Is there any way to push their responses further down the screen? I have a screenshot attached.
|
{
"url": "https://otus.canny.io/feature-requests/p/lessons-hide-answers-in-questions",
"source_domain": "otus.canny.io",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "48712",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JFEQ3G7BMWIHGNLXKCKWQHJ44XL5Q6C3",
"WARC-Concurrent-To": "<urn:uuid:8e6d40d3-dde4-4b6f-ab02-ff2a90505081>",
"WARC-Date": "2024-07-14T06:37:46Z",
"WARC-IP-Address": "108.138.64.35",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WA7CIQDMGXJYV5ITHR7P2UFG6XIWS62A",
"WARC-Record-ID": "<urn:uuid:5bfe30bf-d4a2-4ca1-adc8-3a6a3b443c22>",
"WARC-Target-URI": "https://otus.canny.io/feature-requests/p/lessons-hide-answers-in-questions",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7888907a-5b52-42c2-9210-e390eb796a29>"
},
"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
],
"line_end_idx": [
296
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 296,
"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.550000011920929,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05000000074505806,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.0833333283662796,
"rps_doc_frac_unique_words": 0.8545454740524292,
"rps_doc_mean_word_length": 4.309091091156006,
"rps_doc_num_sentences": 3,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.750685691833496,
"rps_doc_word_count": 55,
"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": -30.16440200805664,
"rps_doc_books_importance_length_correction": -30.16440200805664,
"rps_doc_openwebtext_importance": -16.383848190307617,
"rps_doc_openwebtext_importance_length_correction": -16.383848190307617,
"rps_doc_wikipedia_importance": -12.386162757873535,
"rps_doc_wikipedia_importance_length_correction": -12.386162757873535
},
"fasttext": {
"dclm": 0.6716289520263672,
"english": 0.9806278944015503,
"fineweb_edu_approx": 0.9416638612747192,
"eai_general_math": 0.992780864238739,
"eai_open_web_math": 0.31299883127212524,
"eai_web_code": 0.98136305809021
}
}
|
{
"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": "371.392",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Teachers, Teaching, and School management and organization"
}
}
},
"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": "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": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,684,535,703,576,992,000 |
Over a million developers have joined DZone.
Who Is to Blame for IoT Security Risks?
As the Internet of Things continues to mature, and security continues to lag, it's important to remember to be your own best defender.
· IoT Zone
Access the survey results 'State of Industrial Internet Application Development' to learn about latest challenges, trends and opportunities with Industrial IoT, brought to you in partnership with GE Digital.
Cars. Thermostats. Refrigerators. Insulin pumps. Those are just a few examples of the multitude of everyday items that are getting connected to the internet and joining the Internet of Things (IoT) revolution. Being able to turn all the lights on in your house from your phone while you’re out at dinner, or kicking back in the driver’s seat while your car takes the wheel are exciting advancements in technology that recently were thought to still be decades in the making.
However, while the technological advancements in connected devices and the proliferation of their use have had a positive impact on innovation and business, they come with their own set of problems. Most concerns around today’s connected devices tend to be associated with the security of the device itself: What if someone breaks into my connected car and tampers with a sensor? What if my Amazon Dash is used to order a ton of detergent without my permission? What if my Nest gets remotely turned up to 90 degrees while I’m away on vacation? While these concerns are valid, they are focused on the physical device, which is actually not the real issue at hand.
The real cause for concern with connected devices lies in network security. In a recent Forbes article, a man was able to hack his own solar panels through an open Wi-Fi access point to connected to and control those solar panels.
This raises compelling questions about the hackability of devices connected to the Internet, not because the devices themselves are physically hackable, but because the network connections are insecure. To go back to the example of the Amazon Dash — it is unlikely that a stranger is in your house pranking you by ordering items you don’t need by pressing your Amazon Dash Button. What is more likely is that stranger outside of your home can hack your Wi-Fi network and order 10 gallons of milk and 30 tubs of detergent to prank you. In other words, the Dash Button is not what is putting you at risk; it is your unsecured network.
The Amazon Dash is just one example that has far less serious consequences than, say, a connected car or insulin pump — which, if maliciously hacked, could have deadly implications. If your Nest or Amazon Dash is hacked, could those hackers then be able to tap into your larger network — skimming your credit card information stored online or Social Security Number? It is absolutely possible, and consumers should take these possibilities into consideration when deciding to invite a connected device into their life and home. The best thing anyone who owns a connected device can do — whether it’s a phone, car or thermostat — is to ensure that the toughest network security settings are in place. For now, this is the best bet to protect your data against hackers.
Hopefully, as IoT and connected devices mature so will the security around them. We may never live in a world with completely un-hackable devices, but perhaps we will live in a world where protecting your data and devices won’t have to be such a chore. Remember, if you’re worried that someone is breaking into your house to push your Dash button, you probably have more things to worry about over the unwanted detergent (like a stranger in your house).
The IoT Zone is brought to you in partnership with GE Digital. Discover how IoT developers are using Predix to disrupt traditional industrial development models.
Topics:
wi-fi ,devices ,connected car ,amazon dash ,network ,security
Published at DZone with permission of Christopher Chin, DZone MVB. See the original article here.
Opinions expressed by DZone contributors are their own.
The best of DZone straight to your inbox.
SEE AN EXAMPLE
Please provide a valid email address.
Thanks for subscribing!
Awesome! Check your inbox to verify your email so you can start receiving the latest in tech news and resources.
Subscribe
{{ parent.title || parent.header.title}}
{{ parent.tldr }}
{{ parent.urlSource.name }}
|
{
"url": "https://dzone.com/articles/who-is-to-blame-for-iot-security-risks",
"source_domain": "dzone.com",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "119255",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JNJS2TUMI34CTNXNFACLWPQCMCQNJCMJ",
"WARC-Concurrent-To": "<urn:uuid:204b327c-af34-4577-8643-c70334675ff4>",
"WARC-Date": "2017-01-20T03:02:22Z",
"WARC-IP-Address": "52.72.201.57",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:EXGKOCWBDCAL6FSDCOL6OB2HJCYGMM7M",
"WARC-Record-ID": "<urn:uuid:04982911-c539-4aaf-970f-4b7701151ec4>",
"WARC-Target-URI": "https://dzone.com/articles/who-is-to-blame-for-iot-security-risks",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cb6feb7c-ec34-41c9-9da9-39cc2aa381e3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-70.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-04\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for January 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
45,
46,
86,
87,
222,
223,
234,
235,
443,
444,
919,
920,
1583,
1584,
1815,
1816,
2449,
2450,
3218,
3219,
3673,
3674,
3837,
3838,
3846,
3908,
3909,
4007,
4008,
4064,
4065,
4107,
4108,
4123,
4161,
4162,
4186,
4187,
4300,
4310,
4311,
4352,
4353,
4371,
4372
],
"line_end_idx": [
45,
46,
86,
87,
222,
223,
234,
235,
443,
444,
919,
920,
1583,
1584,
1815,
1816,
2449,
2450,
3218,
3219,
3673,
3674,
3837,
3838,
3846,
3908,
3909,
4007,
4008,
4064,
4065,
4107,
4108,
4123,
4161,
4162,
4186,
4187,
4300,
4310,
4311,
4352,
4353,
4371,
4372,
4399
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4399,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0.00272788992151618,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43309858441352844,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00821596011519432,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13262911140918732,
"rps_doc_frac_unique_words": 0.46364882588386536,
"rps_doc_mean_word_length": 4.854595184326172,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.2731757164001465,
"rps_doc_word_count": 729,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.021474989131093025,
"rps_doc_frac_chars_dupe_6grams": 0.021474989131093025,
"rps_doc_frac_chars_dupe_7grams": 0.021474989131093025,
"rps_doc_frac_chars_dupe_8grams": 0.021474989131093025,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01695393957197666,
"rps_doc_frac_chars_top_3gram": 0.00932466983795166,
"rps_doc_frac_chars_top_4gram": 0.01073750015348196,
"rps_doc_books_importance": -382.430419921875,
"rps_doc_books_importance_length_correction": -382.430419921875,
"rps_doc_openwebtext_importance": -219.2188262939453,
"rps_doc_openwebtext_importance_length_correction": -219.2188262939453,
"rps_doc_wikipedia_importance": -172.44622802734375,
"rps_doc_wikipedia_importance_length_correction": -172.44622802734375
},
"fasttext": {
"dclm": 0.13074535131454468,
"english": 0.9426369667053223,
"fineweb_edu_approx": 2.221242666244507,
"eai_general_math": 0.011667910031974316,
"eai_open_web_math": 0.18568825721740723,
"eai_web_code": 0.012447359971702099
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.8",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "1",
"label": "News/Editorial"
},
"secondary": {
"code": "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": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "14",
"label": "News Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,916,406,817,113,202,000 |
Deposit Funds
A deposit involves sending ETH or ERC20 tokens to the Vault smart contract on the root chain for subsequent use on the OMG network.
Implementation
1. Install omg-js, web3, bn.js
To access network features from your application, use our official libraries:
Node
Browser
React Native
Requires Node >= 8.11.3 < 13.0.0
1
npm install @omisego/omg-js web3 bn.js
Copied!
You can add omg-js to a website using a script tag:
1
<script src="https://unpkg.com/@omisego/browser-omg-js"></script>
Copied!
You can easily integrate omg-js with React Native projects. First, add this postinstall script to your project's package.json:
1
"scripts": {
2
"postinstall": "omgjs-nodeify"
3
}
Copied!
Then install the react native compatible library:
1
npm install @omisego/react-native-omg-js
Copied!
2. Import dependencies, define constants
Depositing funds to the OMG Network involves using 2 omg-js objects. Here's an example of how to instantiate them:
1
import Web3 from "web3";
2
import { RootChain, OmgUtil } from "@omisego/omg-js";
3
const web3 = new Web3(new Web3.providers.HttpProvider(web3_provider_url));
4
const rootChain = new RootChain({ web3, plasmaContractAddress });
5
6
const ethDeposit = {
7
amount: new BigNumber("100000000000000000"),
8
address: "0x8CB0DE6206f459812525F2BA043b14155C2230C0",
9
privateKey: OmgUtil.hexPrefix("CD55F2A7C476306B27315C7986BC50BD81DB4130D4B5CFD49E3EAF9ED1EDE4F7")
10
}
11
const erc20Deposit = {
12
amount: new BigNumber("50000000"),
13
currency: OmgUtil.hexPrefix("0xd92e713d051c37ebb2561803a3b5fbabc4962431"),
14
address: "0x8CB0DE6206f459812525F2BA043b14155C2230C0",
15
privateKey: OmgUtil.hexPrefix("CD55F2A7C476306B27315C7986BC50BD81DB4130D4B5CFD49E3EAF9ED1EDE4F7")
16
}
Copied!
web3_provider_url - the URL to a full Ethereum RPC node (local or from infrastructure provider, e.g. Infura).
plasmaContractAddress - CONTRACT_ADDRESS_PLASMA_FRAMEWORK for defined environment.
3. Make an ETH deposit
Performing any operation on the OMG Network requires funds. Fund deposits happen when a user sends ETH or ERC20 tokens to the Vault smart contract on Ethereum Network. A vault holds custody of tokens transferred to the Plasma Framework. Deposits increase the pool of funds held by the contract and also signals to the Childchain server that the funds should be accessible on the Childchain.
1
async function makeEthDeposit () {
2
const deposit = await rootChain.deposit({
3
amount: ethDeposit.amount,
4
currency: OmgUtil.transaction.ETH_CURRENCY,
5
txOptions: {
6
from: ethDeposit.address,
7
privateKey: ethDeposit.privateKey,
8
gas: gasLimit
9
}
10
});
11
return deposit;
12
}
Copied!
gasLimit - gas limit for your transaction. Please check the current data on Gas Station or similar resources.
Deposit amount is defined in WEI, the smallest denomination of ether (ETH), the currency used on Ethereum. You can use an ETH converter or an alternative tool to know how much WEI you have to put as the amount value.
A deposit generates a transaction receipt verifiable on Ethereum Network. A typical receipt has the following structure:
1
{
2
"blockHash": "0x41455ed19db8e5a495233e54c1813962edaf8a5fb87f847a704c72efa90e2c71",
3
"blockNumber": 7779244,
4
"contractAddress": null,
5
"cumulativeGasUsed": 391297,
6
"from": "0x0dc8e240d90f3b0d511b6447543b28ea2471401a",
7
"gasUsed": 130821,
8
"logs": [
9
{
10
"address": "0x895Cc6F20D386f5C0deae08B08cCFeC9f821E7D9",
11
"topics": [
12
"0x18569122d84f30025bb8dffb33563f1bdbfb9637f21552b11b8305686e9cb307",
13
"0x0000000000000000000000000dc8e240d90f3b0d511b6447543b28ea2471401a",
14
"0x0000000000000000000000000000000000000000000000000000000000023e42",
15
"0x0000000000000000000000000000000000000000000000000000000000000000"
16
],
17
"data": "0x000000000000000000000000000000000000000000000000006a94d74f430000",
18
"blockNumber": 7779244,
19
"transactionHash": "0x0e7d060a63cb65f629cc6d053e71397c7fa3250b41e36cb2cae40b2acb4350a2",
20
"transactionIndex": 12,
21
"blockHash": "0x41455ed19db8e5a495233e54c1813962edaf8a5fb87f847a704c72efa90e2c71",
22
"logIndex": 1,
23
"removed": false,
24
"id": "log_8b0a6416"
25
}
26
],
27
"logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000020000000000000000000000001000000000024000000000000000000800000000000000000000010080000000000000001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002000000000004000000010000000000000000000020000000000000000000000000000000000000080000022000000000000000000000",
28
"status": true,
29
"to": "0x895cc6f20d386f5c0deae08b08ccfec9f821e7d9",
30
"transactionHash": "0x0e7d060a63cb65f629cc6d053e71397c7fa3250b41e36cb2cae40b2acb4350a2",
31
"transactionIndex": 12
32
}
Copied!
After the funds are confirmed on the rootchain, the Childchain server generates a transaction in a form of UTXO corresponding to the deposited amount. UTXO (unspent transaction output) is a model used to keep a track of balances on the OMG Network.
If a transaction is successful, you will see a unique transactionHash that can be verified on Ethereum block explorer, such as Etherscan. Copy the hash and paste it in the search box for the transaction's details.
Depositing also involves forming a pseudo-block on the Childchain. The block contains a single transaction with the deposited funds as a new UTXO. You can check a new block on the OMG Block Explorer.
4. Make an ERC20 deposit
Depositing ERC20 tokens requires approval of the corresponding Vault contract. You can deposit tokens only after this process is finished.
1
async function makeErc20Deposit () {
2
3
const approval = await rootChain.approveToken({
4
erc20Address: erc20Deposit.currency,
5
amount: erc20Deposit.amount,
6
txOptions: {
7
from: erc20Deposit.address,
8
privateKey: erc20Deposit.privateKey
9
}
10
});
11
const receipt = await rootChain.deposit({
12
amount: erc20Deposit.amount,
13
currency: erc20Deposit.currency,
14
txOptions: {
15
from: erc20Deposit.address,
16
privateKey: erc20Deposit.privateKey,
17
gas: gasLimit
18
}
19
});
20
}
Copied!
gasLimit - gas limit for your transaction. Please check the current data on Gas Station or similar resources.
Last modified 8mo ago
|
{
"url": "https://docs.omg.network/network/deposit-funds",
"source_domain": "docs.omg.network",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "252182",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:L5VMATUK3KRFIKTXUTVGHVFFTGUXODGZ",
"WARC-Concurrent-To": "<urn:uuid:ebd3bc80-65e3-4c2d-bf32-615c1f76b964>",
"WARC-Date": "2021-10-16T21:16:21Z",
"WARC-IP-Address": "104.18.1.145",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BTJ3DOLZRWSFWHKNKI54RVQXNBAPBTZE",
"WARC-Record-ID": "<urn:uuid:7da6e238-1f04-4b90-9988-2d6b269aedb0>",
"WARC-Target-URI": "https://docs.omg.network/network/deposit-funds",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bf035244-97bf-4a76-9b03-341d0e2ea9fc>"
},
"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-217\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
14,
146,
147,
162,
163,
194,
195,
273,
278,
286,
299,
332,
334,
373,
381,
433,
435,
501,
509,
636,
638,
651,
653,
684,
686,
688,
696,
746,
748,
789,
797,
798,
839,
840,
955,
957,
982,
984,
1038,
1040,
1115,
1117,
1183,
1185,
1187,
1208,
1210,
1255,
1257,
1312,
1314,
1412,
1415,
1417,
1420,
1443,
1446,
1481,
1484,
1559,
1562,
1617,
1620,
1718,
1721,
1723,
1731,
1845,
1932,
1933,
1956,
1957,
2348,
2350,
2385,
2387,
2429,
2431,
2458,
2460,
2504,
2506,
2519,
2521,
2547,
2549,
2584,
2586,
2600,
2602,
2604,
2607,
2611,
2614,
2630,
2633,
2635,
2643,
2757,
2974,
3095,
3097,
3099,
3101,
3184,
3186,
3210,
3212,
3237,
3239,
3268,
3270,
3324,
3326,
3345,
3347,
3357,
3359,
3361,
3364,
3421,
3424,
3436,
3439,
3509,
3512,
3582,
3585,
3655,
3658,
3727,
3730,
3733,
3736,
3814,
3817,
3841,
3844,
3933,
3936,
3960,
3963,
4046,
4049,
4064,
4067,
4085,
4088,
4109,
4112,
4114,
4117,
4120,
4123,
4654,
4657,
4673,
4676,
4728,
4731,
4820,
4823,
4846,
4849,
4851,
4859,
5108,
5322,
5522,
5523,
5548,
5549,
5688,
5690,
5727,
5729,
5731,
5779,
5781,
5818,
5820,
5849,
5851,
5864,
5866,
5894,
5896,
5932,
5934,
5936,
5939,
5943,
5946,
5988,
5991,
6020,
6023,
6056,
6059,
6072,
6075,
6103,
6106,
6143,
6146,
6160,
6163,
6165,
6168,
6172,
6175,
6177,
6185,
6299
],
"line_end_idx": [
14,
146,
147,
162,
163,
194,
195,
273,
278,
286,
299,
332,
334,
373,
381,
433,
435,
501,
509,
636,
638,
651,
653,
684,
686,
688,
696,
746,
748,
789,
797,
798,
839,
840,
955,
957,
982,
984,
1038,
1040,
1115,
1117,
1183,
1185,
1187,
1208,
1210,
1255,
1257,
1312,
1314,
1412,
1415,
1417,
1420,
1443,
1446,
1481,
1484,
1559,
1562,
1617,
1620,
1718,
1721,
1723,
1731,
1845,
1932,
1933,
1956,
1957,
2348,
2350,
2385,
2387,
2429,
2431,
2458,
2460,
2504,
2506,
2519,
2521,
2547,
2549,
2584,
2586,
2600,
2602,
2604,
2607,
2611,
2614,
2630,
2633,
2635,
2643,
2757,
2974,
3095,
3097,
3099,
3101,
3184,
3186,
3210,
3212,
3237,
3239,
3268,
3270,
3324,
3326,
3345,
3347,
3357,
3359,
3361,
3364,
3421,
3424,
3436,
3439,
3509,
3512,
3582,
3585,
3655,
3658,
3727,
3730,
3733,
3736,
3814,
3817,
3841,
3844,
3933,
3936,
3960,
3963,
4046,
4049,
4064,
4067,
4085,
4088,
4109,
4112,
4114,
4117,
4120,
4123,
4654,
4657,
4673,
4676,
4728,
4731,
4820,
4823,
4846,
4849,
4851,
4859,
5108,
5322,
5522,
5523,
5548,
5549,
5688,
5690,
5727,
5729,
5731,
5779,
5781,
5818,
5820,
5849,
5851,
5864,
5866,
5894,
5896,
5932,
5934,
5936,
5939,
5943,
5946,
5988,
5991,
6020,
6023,
6056,
6059,
6072,
6075,
6103,
6106,
6143,
6146,
6160,
6163,
6165,
6168,
6172,
6175,
6177,
6185,
6299,
6320
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6320,
"ccnet_original_nlines": 214,
"rps_doc_curly_bracket": 0.0047468398697674274,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1769743114709854,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027592770755290985,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3977164626121521,
"rps_doc_frac_unique_words": 0.43805310130119324,
"rps_doc_mean_word_length": 7.625368595123291,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.291112422943115,
"rps_doc_word_count": 678,
"rps_doc_frac_chars_dupe_10grams": 0.05261122062802315,
"rps_doc_frac_chars_dupe_5grams": 0.05261122062802315,
"rps_doc_frac_chars_dupe_6grams": 0.05261122062802315,
"rps_doc_frac_chars_dupe_7grams": 0.05261122062802315,
"rps_doc_frac_chars_dupe_8grams": 0.05261122062802315,
"rps_doc_frac_chars_dupe_9grams": 0.05261122062802315,
"rps_doc_frac_chars_top_2gram": 0.007736939936876297,
"rps_doc_frac_chars_top_3gram": 0.006189560052007437,
"rps_doc_frac_chars_top_4gram": 0.00870405975729227,
"rps_doc_books_importance": -563.2534790039062,
"rps_doc_books_importance_length_correction": -563.2534790039062,
"rps_doc_openwebtext_importance": -336.0623779296875,
"rps_doc_openwebtext_importance_length_correction": -336.0623779296875,
"rps_doc_wikipedia_importance": -194.61294555664062,
"rps_doc_wikipedia_importance_length_correction": -194.61294555664062
},
"fasttext": {
"dclm": 0.46193456649780273,
"english": 0.6135141849517822,
"fineweb_edu_approx": 1.3127697706222534,
"eai_general_math": 0.4662052392959595,
"eai_open_web_math": 0.12511879205703735,
"eai_web_code": 0.24301570653915405
}
}
|
{
"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.87",
"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": "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
|
-425,838,817,647,892,000 |
node package manager
fastdom
fastdom Build Status NPM version npm Coverage Status gzip size
Eliminates layout thrashing by batching DOM read/write operations (~600 bytes minified gzipped).
fastdom.measure(() => {
console.log('measure');
});
fastdom.mutate(() => {
console.log('mutate');
});
fastdom.measure(() => {
console.log('measure');
});
fastdom.mutate(() => {
console.log('mutate');
});
Outputs:
measure
measure
mutate
mutate
Examples
Installation
FastDom is CommonJS and AMD compatible, you can install it in one of the following ways:
$ npm install fastdom --save
or download.
How it works
FastDom works as a regulatory layer between your app/library and the DOM. By batching DOM access we avoid unnecessary document reflows and dramatically speed up layout performance.
Each measure/mutate job is added to a corresponding measure/mutate queue. The queues are emptied (reads, then writes) at the turn of the next frame using window.requestAnimationFrame.
FastDom aims to behave like a singleton across all modules in your app. When any module requires 'fastdom' they get the same instance back, meaning FastDom can harmonize DOM access app-wide.
Potentially a third-party library could depend on FastDom, and better integrate within an app that itself uses it.
API
FastDom#measure(callback[, context])
Schedules a job for the 'measure' queue. Returns a unique ID that can be used to clear the scheduled job.
fastdom.measure(() => {
const width = element.clientWidth;
});
FastDom#mutate(callback[, context])
Schedules a job for the 'mutate' queue. Returns a unique ID that can be used to clear the scheduled job.
fastdom.mutate(() => {
element.style.width = width + 'px';
});
FastDom#clear(id)
Clears any scheduled job.
const read = fastdom.measure(() => {});
const write = fastdom.mutate(() => {});
fastdom.clear(read);
fastdom.clear(write);
Strict mode
It's very important that all DOM mutations or measurements go through fastdom to ensure good performance; to help you with this we wrote fastdom-strict. When fastdom-strict.js is loaded, it will throw errors when sensitive DOM APIs are called at the wrong time.
This is useful when working with a large team who might not all be aware of fastdom or its benefits. It can also prove useful for catching 'un-fastdom-ed' code when migrating an app to fastdom.
<script src="fastdom.js"></script>
<script src="fastdom-strict.js"></script>
element.clientWidth; // throws
fastdom.mutate(function() { element.clientWidth; }); // throws
fastdom.measure(function() { element.clientWidth; }); // does not throw
"Error: Can only get .clientWidth during 'measure' phase"
• fastdom-strict will not throw if nodes are not attached to the document.
• You should use fastdom-strict in development to catch rendering performance issues before they hit production.
• It is not advisable to use fastdom-strict in production.
Exceptions
FastDom is async, this can therefore mean that when a job comes around to being executed, the node you were working with may no longer be there. These errors are usually not critical, but they can cripple your app.
FastDom allows you to register an catch handler. If fastdom.catch has been registered, FastDom will catch any errors that occur in your jobs, and run the handler instead.
fastdom.catch = (error) => {
// Do something if you want
};
Extensions
The core fastdom library is designed to be as light as possible. Additional functionality can be bolted on in the form of 'extensions'. It's worth noting that fastdom is a 'singleton' by design, so all tasks (even those scheduled by extensions) will reach the same global task queue.
Fastdom ships with some extensions:
Using an extension
Use the .extend() method to extend the current fastdom to create a new object.
<script src="fastdom.js"></script>
<script src="extensions/fastdom-promised.js"></script>
// extend fastdom
const myFastdom = fastdom.extend(fastdomPromised);
// use new api
myFastdom.mutate(...).then(...);
Extensions can be chained to construct a fully customised fastdom.
const myFastdom = fastdom
.extend(fastdomPromised)
.extend(fastdomSandbox);
Writing an extension
const myFastdom = fastdom.extend({
measure(fn, ctx) {
// do custom stuff ...
// then call the parent method
return this.fastdom.measure(fn, ctx);
},
mutate: ...
});
You'll notice this.fastdom references the parent fastdom. If you're extending a core API and aren't calling the parent method, you're doing something wrong.
When distributing an extension only export a plain object to allow users to compose their own fastdom.
module.exports = {
measure: ...,
mutate: ...,
clear: ...
};
Tests
$ npm install
$ npm test
Author
Contributors
License
(The MIT License)
Copyright (c) 2016 Wilson Page [email protected]
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the 'Software'), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
{
"url": "https://www.npmjs.com/package/fastdom",
"source_domain": "www.npmjs.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "71384",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VNEJS7DJITCAI2FWUXF2MXBHULOGR2K6",
"WARC-Concurrent-To": "<urn:uuid:3797db9f-ba21-42c2-9200-b617cb548674>",
"WARC-Date": "2017-05-29T13:30:05Z",
"WARC-IP-Address": "151.101.32.162",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RP54ADK5TGCMZRKU7PRA6DTPADR3MPQF",
"WARC-Record-ID": "<urn:uuid:6dbc4e0f-37e4-479f-a4a1-1b3fb3257a98>",
"WARC-Target-URI": "https://www.npmjs.com/package/fastdom",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:334e6d5e-b965-43f1-b04a-8cfd6b79d49b>"
},
"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,
21,
22,
30,
31,
94,
95,
192,
193,
217,
243,
247,
249,
272,
297,
301,
303,
327,
353,
357,
359,
382,
407,
411,
412,
421,
422,
430,
438,
445,
452,
453,
462,
463,
476,
477,
566,
567,
596,
597,
610,
611,
624,
625,
806,
807,
991,
992,
1183,
1184,
1299,
1300,
1304,
1305,
1342,
1343,
1449,
1450,
1474,
1511,
1515,
1516,
1552,
1553,
1658,
1659,
1682,
1720,
1724,
1725,
1743,
1744,
1770,
1771,
1811,
1851,
1853,
1874,
1896,
1897,
1909,
1910,
2172,
2173,
2367,
2368,
2403,
2445,
2477,
2541,
2614,
2672,
2749,
2864,
2925,
2926,
2937,
2938,
3153,
3154,
3325,
3326,
3355,
3386,
3389,
3391,
3392,
3403,
3404,
3688,
3689,
3725,
3726,
3745,
3746,
3825,
3826,
3861,
3916,
3935,
3986,
3988,
4004,
4037,
4038,
4105,
4106,
4132,
4159,
4186,
4187,
4208,
4209,
4244,
4265,
4293,
4295,
4331,
4373,
4378,
4380,
4394,
4398,
4399,
4556,
4557,
4660,
4661,
4680,
4696,
4711,
4724,
4727,
4728,
4734,
4735,
4749,
4760,
4761,
4768,
4769,
4782,
4783,
4791,
4792,
4810,
4811,
4860,
4861,
5294,
5295,
5422,
5423
],
"line_end_idx": [
21,
22,
30,
31,
94,
95,
192,
193,
217,
243,
247,
249,
272,
297,
301,
303,
327,
353,
357,
359,
382,
407,
411,
412,
421,
422,
430,
438,
445,
452,
453,
462,
463,
476,
477,
566,
567,
596,
597,
610,
611,
624,
625,
806,
807,
991,
992,
1183,
1184,
1299,
1300,
1304,
1305,
1342,
1343,
1449,
1450,
1474,
1511,
1515,
1516,
1552,
1553,
1658,
1659,
1682,
1720,
1724,
1725,
1743,
1744,
1770,
1771,
1811,
1851,
1853,
1874,
1896,
1897,
1909,
1910,
2172,
2173,
2367,
2368,
2403,
2445,
2477,
2541,
2614,
2672,
2749,
2864,
2925,
2926,
2937,
2938,
3153,
3154,
3325,
3326,
3355,
3386,
3389,
3391,
3392,
3403,
3404,
3688,
3689,
3725,
3726,
3745,
3746,
3825,
3826,
3861,
3916,
3935,
3986,
3988,
4004,
4037,
4038,
4105,
4106,
4132,
4159,
4186,
4187,
4208,
4209,
4244,
4265,
4293,
4295,
4331,
4373,
4378,
4380,
4394,
4398,
4399,
4556,
4557,
4660,
4661,
4680,
4696,
4711,
4724,
4727,
4728,
4734,
4735,
4749,
4760,
4761,
4768,
4769,
4782,
4783,
4791,
4792,
4810,
4811,
4860,
4861,
5294,
5295,
5422,
5423,
5883
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5883,
"ccnet_original_nlines": 172,
"rps_doc_curly_bracket": 0.004759479779750109,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2554621696472168,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07478991895914078,
"rps_doc_frac_lines_end_with_ellipsis": 0.017341040074825287,
"rps_doc_frac_no_alph_words": 0.26386556029319763,
"rps_doc_frac_unique_words": 0.491782546043396,
"rps_doc_mean_word_length": 5.643489360809326,
"rps_doc_num_sentences": 85,
"rps_doc_symbol_to_word_ratio": 0.008403359912335873,
"rps_doc_unigram_entropy": 5.466088771820068,
"rps_doc_word_count": 791,
"rps_doc_frac_chars_dupe_10grams": 0.025089610368013382,
"rps_doc_frac_chars_dupe_5grams": 0.03673835098743439,
"rps_doc_frac_chars_dupe_6grams": 0.03673835098743439,
"rps_doc_frac_chars_dupe_7grams": 0.025089610368013382,
"rps_doc_frac_chars_dupe_8grams": 0.025089610368013382,
"rps_doc_frac_chars_dupe_9grams": 0.025089610368013382,
"rps_doc_frac_chars_top_2gram": 0.019713260233402252,
"rps_doc_frac_chars_top_3gram": 0.005824369844049215,
"rps_doc_frac_chars_top_4gram": 0.02688172087073326,
"rps_doc_books_importance": -545.8182983398438,
"rps_doc_books_importance_length_correction": -545.8182983398438,
"rps_doc_openwebtext_importance": -303.3487854003906,
"rps_doc_openwebtext_importance_length_correction": -303.3487854003906,
"rps_doc_wikipedia_importance": -248.63796997070312,
"rps_doc_wikipedia_importance_length_correction": -248.63796997070312
},
"fasttext": {
"dclm": 0.07663744688034058,
"english": 0.7167503237724304,
"fineweb_edu_approx": 1.62876296043396,
"eai_general_math": 0.15394210815429688,
"eai_open_web_math": 0.08695197105407715,
"eai_web_code": 0.5209038257598877
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,269,541,381,278,209,500 |
Connecting two computers with LAN cable UTP
One way to connect two computers is to use the network cable or UTP cable is known. Technique of connecting 2 computers with UTP cable directly in the model network peer to peer or point to point.
menghubungkan 2 komputer dengan kabel UTP
So that both computers can communicate with each other, there are at least three things that we have to do, namely:
Make sure both computers have Network cards that have the driver installed.
Prepare the cable UTP cable with Cross Over. For those who do not know the arrangement of wires cross can read my post about the sequence of the cable UTP Straight and Cross Over.
1. Set the IP Address of the second computer by IP Address is different but with the same subnet. As an example:
2. A computer IP Address: 192.168.1.1 with subnet mask: 255.255.255.0
3. IP Address of computer B: 192.168.1.2 with subnet mask: 255.255.255.0
After the cable UTP Cross Over is installed, the next step is to set the IP Address manually on each computer, here's how the computer with OS Windows XP:
1. click on Start-Control Panel, double-click Network Connections.
2. right-click on the Local Area Connection icon, click Properties
3. in the Local Area Connection Properties window, highlight Internet Protocol (TCP/IP), and then click the Properties button as shown in the picture below:
4. a window will open the Internet Protocol (TCP/IP) Properties, enter the IP Address as in the picture above.
5. Do the same on the other computer. Set with a different IP Address.
To test whether the communication between the two computers is already successful, do PING commands between computers via command prompt, if successful will appear a message like the picture below Repply.
PING antar komputer
If the computer cannot PING each other, checking such as the following:
1. Check the connection cables UTP Cross Over whether is correct
2. make sure the LAN adapters already active (enable)
3. check the IP Address of the second computer, is it one subnet
4 turn off your Firewall or enable (check) the option File and Printer Sharing Exception in Windows Firewall.
If both computers are connected then we can share data between computers or resource such as using printer sharing or short messaging each other over the network. For information about how to share data between computers in a network I will discuss in the next post.
4 komentar to "Connecting two computers with LAN cable UTP"
About This Blog
Auto Backlink
My Blogs
Blog Archive
Followers
Web hosting for webmasters
|
{
"url": "http://apricyber.blogspot.com/2013/01/connecting-two-computers-with-lan-cable.html",
"source_domain": "apricyber.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2017-17",
"warc_metadata": {
"Content-Length": "80215",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6YHYN4K2MXST6SQ2O7HYDK2UAQ5IJDBD",
"WARC-Concurrent-To": "<urn:uuid:c7d075ca-6d79-40e4-8954-f77ea4b4d7b8>",
"WARC-Date": "2017-04-27T03:18:33Z",
"WARC-IP-Address": "216.58.217.97",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:KCT43YSV6QZCYKAOOCLA6S6QPFG7KZ6Z",
"WARC-Record-ID": "<urn:uuid:b8396f4e-85f0-403e-a1a6-93405f9b0f66>",
"WARC-Target-URI": "http://apricyber.blogspot.com/2013/01/connecting-two-computers-with-lan-cable.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:68675156-cbee-4d12-b7f2-1f5fc73d95b1>"
},
"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,
1,
45,
46,
243,
244,
286,
287,
403,
404,
480,
660,
773,
843,
916,
917,
918,
1073,
1074,
1141,
1208,
1365,
1476,
1547,
1752,
1753,
1773,
1845,
1846,
1911,
1965,
2030,
2140,
2141,
2142,
2409,
2410,
2411,
2471,
2472,
2488,
2489,
2503,
2504,
2513,
2514,
2527,
2528,
2538,
2539
],
"line_end_idx": [
1,
45,
46,
243,
244,
286,
287,
403,
404,
480,
660,
773,
843,
916,
917,
918,
1073,
1074,
1141,
1208,
1365,
1476,
1547,
1752,
1753,
1773,
1845,
1846,
1911,
1965,
2030,
2140,
2141,
2142,
2409,
2410,
2411,
2471,
2472,
2488,
2489,
2503,
2504,
2513,
2514,
2527,
2528,
2538,
2539,
2565
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2565,
"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.3632887303829193,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06118547171354294,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20076481997966766,
"rps_doc_frac_unique_words": 0.42691415548324585,
"rps_doc_mean_word_length": 4.733178615570068,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.799124240875244,
"rps_doc_word_count": 431,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06666667014360428,
"rps_doc_frac_chars_dupe_6grams": 0.06666667014360428,
"rps_doc_frac_chars_dupe_7grams": 0.06666667014360428,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03529411926865578,
"rps_doc_frac_chars_top_3gram": 0.023529410362243652,
"rps_doc_frac_chars_top_4gram": 0.025490200147032738,
"rps_doc_books_importance": -198.43943786621094,
"rps_doc_books_importance_length_correction": -198.43943786621094,
"rps_doc_openwebtext_importance": -104.49977111816406,
"rps_doc_openwebtext_importance_length_correction": -104.49977111816406,
"rps_doc_wikipedia_importance": -79.6965560913086,
"rps_doc_wikipedia_importance_length_correction": -79.6965560913086
},
"fasttext": {
"dclm": 0.28800320625305176,
"english": 0.87660151720047,
"fineweb_edu_approx": 3.259472370147705,
"eai_general_math": 0.7463842630386353,
"eai_open_web_math": 0.38005316257476807,
"eai_web_code": 0.3158513903617859
}
}
|
{
"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": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,811,484,497,478,283,000 |
Xeon w/ L3 1MB cache vs Xeon w/o L3 cache
Erich Dollansky oceanare at pacific.net.sg
Wed Mar 3 20:53:36 PST 2004
Hi,
Simon wrote:
> Thanks, I read that under higher loads, the L3 cache becomes quite useful, too.
> But, what is considered high-load? what determines if L3 cache is used or not?
The range is very wide. I would define it for your case as soon as
cache trashing starts.
> is it app to the app to use it? or up to the kernel? or the CPU itself? or a
The CPU decides normally what is stored in the different caches.
Kernels and applications can help to support the CPU's decision.
But I do not know of any application supporting this.
> combination? We run a lot of services on our servers and I would say they are
> heavy loaded, but I could be mistaking, I mean, they do a lot of processing but
> not exactly crawling, they are still fast.
>
This sounds the envirnoment where I did those tests. Without
knowing what was in the boxes we started wondering some machines
started crawling for a short period of time while others did not.
A machine with some MB of extra L3 cache starts crawling much later.
The impact to the machine cannot predicted precisely. It depends
very much on the application. My experience ranges form hardly any
impact up to 30 times higher throughput.
It sounds like you have a lot of machines. I would consider
getting one machine with larger L3 caches to test it.
You also should consider this:
http://www.anandtech.com/IT/showdoc.html?i=1982
The cache does not really help if the memory interface becomes the
bottle-neck.
Erich
More information about the freebsd-hardware mailing list
|
{
"url": "http://lists.freebsd.org/pipermail/freebsd-hardware/2004-March/001250.html",
"source_domain": "lists.freebsd.org",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "4311",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GZWVHUHLK5NZUZZMS2YO6FGK7IQMDZ4J",
"WARC-Concurrent-To": "<urn:uuid:3874f990-a253-41f7-bb8b-d4bf13ddf0ba>",
"WARC-Date": "2014-08-28T11:06:59Z",
"WARC-IP-Address": "8.8.178.110",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:RYD4ZX7EDZNLFSABVF6LZNHS7CCLM227",
"WARC-Record-ID": "<urn:uuid:8c474467-2d92-42ad-85c9-fd8a465e27e7>",
"WARC-Target-URI": "http://lists.freebsd.org/pipermail/freebsd-hardware/2004-March/001250.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2caecbd5-8547-42db-af7f-6c7c04c2e73f>"
},
"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,
42,
43,
86,
114,
115,
116,
120,
121,
134,
135,
217,
298,
299,
367,
390,
391,
470,
471,
537,
603,
657,
658,
738,
820,
865,
868,
930,
996,
1062,
1063,
1132,
1133,
1199,
1267,
1308,
1309,
1370,
1424,
1425,
1456,
1457,
1505,
1506,
1574,
1587,
1588,
1594,
1595,
1596
],
"line_end_idx": [
42,
43,
86,
114,
115,
116,
120,
121,
134,
135,
217,
298,
299,
367,
390,
391,
470,
471,
537,
603,
657,
658,
738,
820,
865,
868,
930,
996,
1062,
1063,
1132,
1133,
1199,
1267,
1308,
1309,
1370,
1424,
1425,
1456,
1457,
1505,
1506,
1574,
1587,
1588,
1594,
1595,
1596,
1652
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1652,
"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.4106145203113556,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.061452511698007584,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18156425654888153,
"rps_doc_frac_unique_words": 0.5901060104370117,
"rps_doc_mean_word_length": 4.505300521850586,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.825971603393555,
"rps_doc_word_count": 283,
"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.021960780024528503,
"rps_doc_frac_chars_top_3gram": 0.014117649756371975,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -154.7342071533203,
"rps_doc_books_importance_length_correction": -141.16714477539062,
"rps_doc_openwebtext_importance": -103.21258544921875,
"rps_doc_openwebtext_importance_length_correction": -103.21258544921875,
"rps_doc_wikipedia_importance": -86.30389404296875,
"rps_doc_wikipedia_importance_length_correction": -74.19410705566406
},
"fasttext": {
"dclm": 0.18715715408325195,
"english": 0.9508568644523621,
"fineweb_edu_approx": 1.343021273612976,
"eai_general_math": 0.2113768458366394,
"eai_open_web_math": 0.3367457389831543,
"eai_web_code": 0.09310042858123779
}
}
|
{
"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.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,285,150,352,529,916,000 |
General discussion
Locked
uncompress a CAB file
By rgooding ·
I copied a compressed CAB file from my PC onto a unix server (AIX 4.3) and now I want to uncompress it. Is there a utility out there to do this.
Thanks
This conversation is currently closed to new comments.
7 total posts (Page 1 of 1)
Thread display: Collapse - | Expand +
All Comments
Collapse -
uncompress a CAB file
by TimTheToolMan In reply to uncompress a CAB file
Hi,
It might be easier to uncompress it on the PC (WinZip will do that), then tar it (plenty of PC tools will tar), copy it and tar -x at the unix end?
Cheers,
Tim.
Collapse -
uncompress a CAB file
by rgooding In reply to uncompress a CAB file
Poster rated this answer
Collapse -
uncompress a CAB file
by Q2Ggirl In reply to uncompress a CAB file
This will extract files from Windows cab files.
1. At a DOS promt, go to the directory where your .cab files are located. Ex. c:\windows\options\cabs
2. Type the following:
extract /a win98_21.cab *.* /y
fill in the wild card with the filename.extension
You can always type extract/? to get the correct syntax.
Collapse -
uncompress a CAB file
by rgooding In reply to uncompress a CAB file
Poster rated this answer
Collapse -
uncompress a CAB file
by jdelucas In reply to uncompress a CAB file
You mith also try cabextract:
http://www.kyz.uklinux.net/cabextract.php3
It works under FreeBSD
Hope this helps.
Jorge
Collapse -
uncompress a CAB file
by rgooding In reply to uncompress a CAB file
Poster rated this answer
Collapse -
uncompress a CAB file
by rgooding In reply to uncompress a CAB file
This question was closed by the author
Back to Linux Forum
7 total posts (Page 1 of 1)
Related Discussions
Related Forums
|
{
"url": "https://www.techrepublic.com/forums/discussions/uncompress-a-cab-file/",
"source_domain": "www.techrepublic.com",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "548332",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3GNMFEFGPPBNHE2H6VEEGDFQ5L2FUVS7",
"WARC-Concurrent-To": "<urn:uuid:4e0290d7-83e1-4760-83c7-a62b3eefcc6e>",
"WARC-Date": "2019-11-20T13:11:13Z",
"WARC-IP-Address": "184.27.45.7",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DYS4N2H37VN3ZXASVCUIOVD3DGEVUBE5",
"WARC-Record-ID": "<urn:uuid:7232440d-0fee-4a79-a586-b0bef3df9e5e>",
"WARC-Target-URI": "https://www.techrepublic.com/forums/discussions/uncompress-a-cab-file/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1462c54f-45b2-4cc4-b348-c493d001bc99>"
},
"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-133.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,
27,
28,
50,
51,
65,
210,
211,
218,
219,
274,
275,
305,
343,
344,
357,
358,
369,
370,
392,
393,
444,
445,
449,
450,
598,
599,
607,
612,
613,
624,
625,
647,
648,
694,
695,
720,
721,
732,
733,
755,
756,
801,
802,
850,
851,
953,
954,
977,
1008,
1058,
1059,
1116,
1117,
1128,
1129,
1151,
1152,
1198,
1199,
1224,
1225,
1236,
1237,
1259,
1260,
1306,
1307,
1337,
1380,
1403,
1420,
1426,
1427,
1438,
1439,
1461,
1462,
1508,
1509,
1534,
1535,
1546,
1547,
1569,
1570,
1616,
1617,
1656,
1657,
1677,
1707,
1708,
1728,
1729
],
"line_end_idx": [
19,
20,
27,
28,
50,
51,
65,
210,
211,
218,
219,
274,
275,
305,
343,
344,
357,
358,
369,
370,
392,
393,
444,
445,
449,
450,
598,
599,
607,
612,
613,
624,
625,
647,
648,
694,
695,
720,
721,
732,
733,
755,
756,
801,
802,
850,
851,
953,
954,
977,
1008,
1058,
1059,
1116,
1117,
1128,
1129,
1151,
1152,
1198,
1199,
1224,
1225,
1236,
1237,
1259,
1260,
1306,
1307,
1337,
1380,
1403,
1420,
1426,
1427,
1438,
1439,
1461,
1462,
1508,
1509,
1534,
1535,
1546,
1547,
1569,
1570,
1616,
1617,
1656,
1657,
1677,
1707,
1708,
1728,
1729,
1743
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1743,
"ccnet_original_nlines": 96,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28650137782096863,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06336087733507156,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1845729947090149,
"rps_doc_frac_unique_words": 0.4237288236618042,
"rps_doc_mean_word_length": 4.49491548538208,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.258408546447754,
"rps_doc_word_count": 295,
"rps_doc_frac_chars_dupe_10grams": 0.2797888517379761,
"rps_doc_frac_chars_dupe_5grams": 0.41779789328575134,
"rps_doc_frac_chars_dupe_6grams": 0.41779789328575134,
"rps_doc_frac_chars_dupe_7grams": 0.37556561827659607,
"rps_doc_frac_chars_dupe_8grams": 0.3061840236186981,
"rps_doc_frac_chars_dupe_9grams": 0.2797888517379761,
"rps_doc_frac_chars_top_2gram": 0.08446455746889114,
"rps_doc_frac_chars_top_3gram": 0.15837104618549347,
"rps_doc_frac_chars_top_4gram": 0.20361991226673126,
"rps_doc_books_importance": -143.3184814453125,
"rps_doc_books_importance_length_correction": -133.76161193847656,
"rps_doc_openwebtext_importance": -97.15046691894531,
"rps_doc_openwebtext_importance_length_correction": -97.15046691894531,
"rps_doc_wikipedia_importance": -54.66020202636719,
"rps_doc_wikipedia_importance_length_correction": -49.178401947021484
},
"fasttext": {
"dclm": 0.06313717365264893,
"english": 0.8923068642616272,
"fineweb_edu_approx": 1.614187240600586,
"eai_general_math": 0.012490450404584408,
"eai_open_web_math": 0.4617648720741272,
"eai_web_code": 0.000035519999073585495
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,944,131,752,651,147,000 |
ridis集群搭建部署详细文档
1. 云栖社区>
2. 博客>
3. 正文
ridis集群搭建部署详细文档
技术小牛人 2017-11-10 15:22:00 浏览707
展开阅读全文
1.安装依赖（不一定需要安装这么多，我的环境安装了mysql，php，所以没有测试具体需要那些依赖，全部安装反正没得错）
yum -y install make apr* autoconf automake curl-devel gcc gcc-c++ zlib-devel openssl openssl-devel pcre-devel gd kernel keyutils patch perl kernel-headers compat* mpfr cpp glibc libgomp libstdc++-devel ppl cloog-ppl keyutils-libs-devel libcom_err-devel libsepol-devel libselinux-devel krb5-devel zlib-devel libXpm* freetype libjpeg* libpng* php-common php-gd ncurses* libtool* libxml2 libxml2-devel patch freetype-devel cmake zlib ncurses* openssl* cmake gcc* autoconf bison libevent*
2.前面已经准备好了搭建集群的redis节点，接下来我们要把这些节点都串连起来搭建集群。官方提供了一个工具：redis-trib.rb （/usr/local/redis/src/redis-trib.rb） 看后缀就知道这鸟东西不能直接执行，它是用ruby写的一个程序，所以我们还得安装ruby.
yum -y install ruby ruby-devel rubygems rpm-build
3.解压安装redis：
tar -zxvf redis-3.0.6.tar
mv redis-3.0.6 redis-3
cd redis
make&& make install
注意：
redis集群要最低必须是3个主或者3主3从(每一个文件夹对应一个端口)
mkdir -p /opt/redis/cluster/7000
mkdir -p /opt/redis/cluster/7001
mkdir -p /opt/redis/cluster/7002
mkdir -p /opt/redis/cluster/7003
mkdir -p /opt/redis/cluster/7004
mkdir -p /opt/redis/cluster/7005
cp /opt/soft/redis/redis/redis.conf /opt/redis/cluster/7000
vi /opt/redis/cluster/7000/redis.conf
修改下面几项：
daemonize yes //redis后台运行
pidfile /var/run/redis_7000.pid //pidfile文件对应7000
port 7000 //端口7000
cluster-enabled yes //开启集群 把注释#去掉
cluster-config-file nodes.conf //集群的配置 配置文件首次启动自动生成
cluster-node-timeout 5000 //请求超时 设置5秒够了
appendonly yes //aof日志开启有需要就开启，它会每次写操作都记录一条日志
配置好了，就相应地把这个修改后的配置文件拷贝到 7001 7002目录，注意要修改监听端口port 和pidfile
4.到每一个文件夹启动redis
redis-server redis.conf
5. 创建集群
前面已经准备好了搭建集群的redis节点，接下来我们要把这些节点都串连起来搭建集群。官方提供了一个工具：redis-trib.rb （/usr/local/redis/src/redis-trib.rb） 看后缀就知道这鸟东西不能直接执行，它是用ruby写的一个程序，所以我们还得安装ruby.
yum -y install ruby ruby-devel rubygems rpm-build //网上不明觉厉，都是这么安装的，就跟着这样玩吧
再用 gem 这个命令来安装 redis接口 gem貌似是ruby的一个工具包 反正没错就是了。
gem install redis //等一会儿就好了
6. 确认所有的节点都启动，接下来使用参数create 创建
/opt/soft/redis/redis/src/redis-trib.rb create --replicas 1 127.0.0.1:7000 127.0.0.1:7001 127.0.0.1:7002 127.0.0.1:7003 127.0.0.1:7004 127.0.0.1:7005
解释下， --replicas 1 表示 自动为每一个master节点分配一个slave节点 上面有6个节点，程序会按照一定规则生成 3个master（主）3个slave(从)
前面已经提醒过的 防火墙一定要开放监听的端口，否则会创建失败。
到此redis集群安装完毕。
本文转自 674591788 51CTO博客，原文链接:http://blog.51cto.com/mrdeng/1768356
网友评论
登录后评论
0/500
评论
技术小牛人
+ 关注
|
{
"url": "https://yq.aliyun.com/articles/539048",
"source_domain": "yq.aliyun.com",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "69320",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ULATMDMVRDYJWM3IRUVHR2EYOV3WZGIX",
"WARC-Concurrent-To": "<urn:uuid:3d82ff0b-1d1b-41f6-8484-3460c77066e6>",
"WARC-Date": "2019-10-19T05:28:03Z",
"WARC-IP-Address": "106.15.100.122",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QDXG2QI2ROFYCQRT3ZH6CRR5J5NQHRIE",
"WARC-Record-ID": "<urn:uuid:a32f63f1-764e-42a5-a04d-c3b5aa0def33>",
"WARC-Target-URI": "https://yq.aliyun.com/articles/539048",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d4ee16a0-d502-4300-a96e-505ee3c48b5d>"
},
"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-81.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
16,
17,
28,
37,
45,
46,
62,
63,
95,
102,
103,
164,
165,
655,
656,
807,
808,
862,
863,
876,
877,
903,
904,
927,
928,
937,
938,
958,
959,
963,
964,
1001,
1002,
1035,
1036,
1069,
1070,
1103,
1104,
1137,
1138,
1171,
1172,
1205,
1206,
1266,
1267,
1306,
1307,
1315,
1316,
1370,
1371,
1425,
1426,
1479,
1480,
1535,
1536,
1595,
1596,
1643,
1644,
1692,
1693,
1753,
1754,
1771,
1772,
1799,
1800,
1808,
1809,
1958,
1959,
2037,
2038,
2091,
2092,
2123,
2124,
2155,
2156,
2313,
2314,
2315,
2409,
2410,
2443,
2444,
2459,
2460,
2527,
2528,
2533,
2534,
2540,
2546,
2549,
2555
],
"line_end_idx": [
16,
17,
28,
37,
45,
46,
62,
63,
95,
102,
103,
164,
165,
655,
656,
807,
808,
862,
863,
876,
877,
903,
904,
927,
928,
937,
938,
958,
959,
963,
964,
1001,
1002,
1035,
1036,
1069,
1070,
1103,
1104,
1137,
1138,
1171,
1172,
1205,
1206,
1266,
1267,
1306,
1307,
1315,
1316,
1370,
1371,
1425,
1426,
1479,
1480,
1535,
1536,
1595,
1596,
1643,
1644,
1692,
1693,
1753,
1754,
1771,
1772,
1799,
1800,
1808,
1809,
1958,
1959,
2037,
2038,
2091,
2092,
2123,
2124,
2155,
2156,
2313,
2314,
2315,
2409,
2410,
2443,
2444,
2459,
2460,
2527,
2528,
2533,
2534,
2540,
2546,
2549,
2555,
2559
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2559,
"ccnet_original_nlines": 100,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.02333332970738411,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0016666699666529894,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5983333587646484,
"rps_doc_frac_unique_words": 0.7881773114204407,
"rps_doc_mean_word_length": 9.571428298950195,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0.0016666699666529894,
"rps_doc_unigram_entropy": 4.9567179679870605,
"rps_doc_word_count": 203,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11528564244508743,
"rps_doc_frac_chars_dupe_6grams": 0.11528564244508743,
"rps_doc_frac_chars_dupe_7grams": 0.11528564244508743,
"rps_doc_frac_chars_dupe_8grams": 0.11528564244508743,
"rps_doc_frac_chars_dupe_9grams": 0.11528564244508743,
"rps_doc_frac_chars_top_2gram": 0.018528049811720848,
"rps_doc_frac_chars_top_3gram": 0.01698404923081398,
"rps_doc_frac_chars_top_4gram": 0.07822953909635544,
"rps_doc_books_importance": -348.55218505859375,
"rps_doc_books_importance_length_correction": -348.55218505859375,
"rps_doc_openwebtext_importance": -211.12843322753906,
"rps_doc_openwebtext_importance_length_correction": -211.12843322753906,
"rps_doc_wikipedia_importance": -176.59567260742188,
"rps_doc_wikipedia_importance_length_correction": -176.59567260742188
},
"fasttext": {
"dclm": 0.11916249990463257,
"english": 0.04974247142672539,
"fineweb_edu_approx": 2.3371472358703613,
"eai_general_math": -0.000009890000001178123,
"eai_open_web_math": 0.11029493808746338,
"eai_web_code": 0.9921529293060303
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "6",
"label": "Indeterminate"
}
},
"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,169,238,867,541,051,400 |
How To Pay With Apple Watch?
How To Pay With Apple Watch? You can apple watch to pay for things in stores, in apps, and on websites in Safari. Here’s how.
Checkout this video:
How to set up Apple Pay on your Apple Watch
Apple Pay is a mobile payment service that allows you to make purchases using apple watch You use apple pay to pay for goods and services at participating retailers, as well as in apps and on websites. To set up Apple Pay on your Apple Watch, you need to add a credit or debit card to the Wallet app on your iPhone. Once you’ve added a card, you can start using Apple Pay right away.
How use apple pay with your Apple Watch
Paying for things with your Apple Watch is easy and convenient. You use apple pay to pay for purchases both in stores and in apps. In this article, we’ll show you how use apple pay to pay for things with your Apple Watch.
To use Apple Pay with your Apple Watch, you’ll need to have an iPhone 5 or later running iOS 8.1 or later. You’ll also need to have a valid credit or debit card from a supported bank or financial institution.
If you meet the requirements listed above, using Apple Pay with your Apple Watch is easy. Just double-click the side button on your watch and hold it up to the contactless payment terminal when prompted. You’ll feel a gentle tap and see a checkmark on the screen when your payment is successful. That’s it!
Keep in mind that you can only use Apple Pay to pay for things if the merchant supports it. Many stores and apps do support it, but not all of them do. If you’re not sure whether a store or app supports Apple Pay, you can always ask the staff or look for signs or logos that indicate that Apple Pay is accepted.
How to add a credit or debit card to Apple Pay
When you add a card to Apple Pay, your card numbers are not stored on the device, nor on Apple servers. Instead, a unique Device Account Number is assigned, encrypted and securely stored in the Secure Element on your device. Each transaction is authorized with a one-time unique dynamic security code.
To add a credit or debit card to Apple Pay:
1. On your iPhone, open the Wallet app and tap the plus sign (+).
2. Follow the steps to add a new card. If you’re asked to add the card that you use with your iPhone, tap Continue.
3. Tap Next, then follow the steps to verify your information. When you’re finished, tap Next. Your bank or card issuer will verify your information and decide if you can use your card with Apple Pay.
4. After your bank or issuer verifies your card, tap Next. Then start using Apple Pay!
How to pay with Apple Pay
Apple Watch makes it easy to pay for your purchases with Apple Pay. To pay with Apple Pay, just hold your watch close to the contactless reader with your finger on the Touch ID sensor. You’ll feel a gentle tap and hear a beep when your payment is complete. You can also double-click the side button and hold the watch face close to the contactless reader.
How to use Apple Pay with Siri
Assuming you have an Apple Watch with cellular and are running watchOS 5 or later, open the Settings app on your iPhone, then go to “Wallet & Apple Pay.” Tap “Add Credit or Debit Card” and use your iPhone’s camera to capture your card information or enter it manually. You might need to verify your card.
With your card added to Wallet, open the app on your Watch and hold your Watch close to the contactless reader until you feel a tap. You might need to enter a PIN. If you’re paying for something in a store, you might also need to sign a receipt or provide additional identification.
How to use Apple Pay with the Wallet app
To use Apple Pay with the Wallet app, you first need to set up Apple Pay on your iPhone. Once you’ve done that, you can add your credit or debit cards to the Wallet app on your Apple Watch.
To pay with Apple Pay, just hold your Apple Watch up to the contactless reader at the checkout. You’ll feel a tap when your payment goes through.
If you’re using an iPhone 6 or later, you can also use Apple Pay within apps – just look for the Apple Pay logo at checkout.
How to use Apple Pay with the Messages app
Apple Watch has the ability to make payments using Apple Pay, and you can do so with the Messages app. Here’s how:
1. Open the Messages app on your Apple Watch.
2. Select the conversation in which you want to make a payment.
3. Scroll down and tap on the “Apple Pay” button.
4. Select the amount you want to pay from the list of options.
5. Confirm your payment with Face ID or Touch ID.
How to use Apple Pay with the Phone app
Apple has finally unleashed its long-awaited wearable device, the Apple Watch. Along with boasting a host of impressive features, the watch also allows users to make and receive payments via Apple Pay. Here’s a guide on how you can use Apple Pay with the Phone app on your Apple Watch.
To add a credit or debit card to your Apple Watch, launch the Watch app on your iPhone and navigate to the ‘My Watch’ tab. Scroll down and tap on ‘Wallet & Apple Pay’. Next, tap on ‘Add a Credit or Debit Card’ and follow the instructions to add your card details. You can also add your card by tapping on it in the Passbook app on your iPhone.
Once you have added your card, you can use it to make payments via Apple Pay by double-tapping the side button of your watch. This will bring up the Wallet app. From here, select the card that you want to use for payment and hold it close to the contactless reader until you see a tick in a green circle. You will feel a gentle tap and hear a beep when the payment is successful.
How to use Apple Pay with the Maps app
If you have an Apple Watch, you can use it to pay for transit in the Maps app.
To do so, first make sure that you have Apple Pay set up on your iPhone. Once that’s done, open the Maps app on your iPhone and search for the transit route you want to take.
Tap on the transit route to see more information, then scroll down and tap on the “Pay with Apple Watch” button. You’ll be prompted to confirm the payment with your Apple Watch.
Once the payment is confirmed, you’ll see a “Paid with Apple Watch” notification on your screen. This is valid for two hours, which should be plenty of time for most transit rides.
How to use Apple Pay with Safari
Apple Pay is a convenient way to pay for online purchases with your iPhone, iPad, or Apple Watch. You can use Apple Pay to pay for items on websites that support Apple Pay. To use Apple Pay with Safari, you need an iPhone 6 or later, an iPad Pro, iPad Air 2, or iPad mini 3 or later. You also need to be signed in to iCloud with apple id and have two-factor authentication turned on.
Scroll to Top
|
{
"url": "https://xverse10.com/how-to-pay-with-apple-watch/",
"source_domain": "xverse10.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "153820",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OOJTTSOQSN3UHVYLPYSPO7DDKJI3Y73R",
"WARC-Concurrent-To": "<urn:uuid:eaa2c8b4-9fbb-4931-9f06-d9f0696bcefe>",
"WARC-Date": "2023-02-02T13:49:58Z",
"WARC-IP-Address": "104.21.94.205",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2SM6FOR77SVXBFKZPXZYM57VYDPHEPFN",
"WARC-Record-ID": "<urn:uuid:d63f05d9-084d-428d-9418-819920293ee2>",
"WARC-Target-URI": "https://xverse10.com/how-to-pay-with-apple-watch/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:674ad2f3-f240-49cb-939a-c7acbeb30bf9>"
},
"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-96\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,
29,
30,
156,
157,
178,
179,
223,
224,
608,
609,
649,
650,
872,
873,
1082,
1083,
1390,
1391,
1703,
1704,
1751,
1752,
2054,
2055,
2099,
2100,
2166,
2282,
2483,
2570,
2571,
2597,
2598,
2954,
2955,
2986,
2987,
3292,
3293,
3576,
3577,
3618,
3619,
3809,
3810,
3956,
3957,
4082,
4083,
4126,
4127,
4242,
4243,
4289,
4353,
4403,
4466,
4516,
4517,
4557,
4558,
4844,
4845,
5189,
5190,
5570,
5571,
5610,
5611,
5690,
5691,
5866,
5867,
6045,
6046,
6227,
6228,
6261,
6262,
6646,
6647
],
"line_end_idx": [
29,
30,
156,
157,
178,
179,
223,
224,
608,
609,
649,
650,
872,
873,
1082,
1083,
1390,
1391,
1703,
1704,
1751,
1752,
2054,
2055,
2099,
2100,
2166,
2282,
2483,
2570,
2571,
2597,
2598,
2954,
2955,
2986,
2987,
3292,
3293,
3576,
3577,
3618,
3619,
3809,
3810,
3956,
3957,
4082,
4083,
4126,
4127,
4242,
4243,
4289,
4353,
4403,
4466,
4516,
4517,
4557,
4558,
4844,
4845,
5189,
5190,
5570,
5571,
5610,
5611,
5690,
5691,
5866,
5867,
6045,
6046,
6227,
6228,
6261,
6262,
6646,
6647,
6660
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6660,
"ccnet_original_nlines": 81,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42027026414871216,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.002702699974179268,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13108107447624207,
"rps_doc_frac_unique_words": 0.2335423231124878,
"rps_doc_mean_word_length": 4.076018810272217,
"rps_doc_num_sentences": 84,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.728188991546631,
"rps_doc_word_count": 1276,
"rps_doc_frac_chars_dupe_10grams": 0.012689869850873947,
"rps_doc_frac_chars_dupe_5grams": 0.2805229723453522,
"rps_doc_frac_chars_dupe_6grams": 0.21111324429512024,
"rps_doc_frac_chars_dupe_7grams": 0.14381849765777588,
"rps_doc_frac_chars_dupe_8grams": 0.08190733194351196,
"rps_doc_frac_chars_dupe_9grams": 0.03614689037203789,
"rps_doc_frac_chars_top_2gram": 0.06306479871273041,
"rps_doc_frac_chars_top_3gram": 0.03595462068915367,
"rps_doc_frac_chars_top_4gram": 0.03172466903924942,
"rps_doc_books_importance": -658.359619140625,
"rps_doc_books_importance_length_correction": -658.359619140625,
"rps_doc_openwebtext_importance": -354.9449157714844,
"rps_doc_openwebtext_importance_length_correction": -354.9449157714844,
"rps_doc_wikipedia_importance": -206.04342651367188,
"rps_doc_wikipedia_importance_length_correction": -206.04342651367188
},
"fasttext": {
"dclm": 0.23153167963027954,
"english": 0.9077141284942627,
"fineweb_edu_approx": 1.7424275875091553,
"eai_general_math": 0.0014060699613764882,
"eai_open_web_math": 0.031166259199380875,
"eai_web_code": 0.008574309758841991
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.68",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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
|
-3,408,054,919,378,989,000 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks Cowboy Neal with Hat
Just another Perl shrine
PerlMonks
Interpolating variables in JSON string
by j0se (Monk)
on Jan 29, 2013 at 11:25 UTC ( #1015856=perlquestion: print w/ replies, xml ) Need Help??
j0se has asked for the wisdom of the Perl Monks concerning the following question:
Hello Monks,
I am authenticating through Rackspace API with the following code (using LWP):
sub authenticate { # Create a request my $req = HTTP::Request->new( POST => 'https://identity.api.rackspacecloud.com/v2.0/tokens' +); $req->content_type('application/json'); #my $json = '{"auth":{"RAX-KSKEY:apiKeyCredentials":{"username":"f +oo", "apiKey":"00000000000000000000000000000000"}}}'; my $json = quotemeta( {"auth":{"RAX-KSKEY:apiKeyCredentials":{"use +rname":$USERNAME, "apiKey":$API_KEY}}} ); $req->content( $json ); # Pass request to the user agent and get a response back my $res = $ua->request($req); # Check the outcome of the response if ( $res->is_success ) { # Do stuff ... } else { print $res->status_line, "\n"; } }
The problem is that I am not able to interpolate the variables in JSON string ($USERNAME and $API_KEY) - I am getting 400 BadRequest response. I have tried quotemeta (in the code snippet above), \Q and \E operators, escaping JSON double quotes with \.
The commented out $json line (with hard-coded credentials) works just fine.
We are what we repeatedly do. Excellence, then, is not an act but a habit. -- Will Durant (Aristotle)
Comment on Interpolating variables in JSON string
Select or Download Code
Re: Interpolating variables in JSON string
by Corion (Pope) on Jan 29, 2013 at 11:28 UTC
Re: Interpolating variables in JSON string
by moritz (Cardinal) on Jan 29, 2013 at 11:34 UTC
The proper way to create JSON strings is to first create a data structure in Perl that matches the desired output structure, and then run it through a JSON module like JSON or JSON::XS:
use JSON qw/encode_json/; my $data = { auth => { "RAX-KSKEY:apiKeyCredentials" => { username => $USERNAME, apiKey => $API_KEY, }, }, }; my $json = encode_json($data);
Re: Interpolating variables in JSON string
by roboticus (Canon) on Jan 29, 2013 at 11:49 UTC
j0se:
I agree with the previous posters. However, it looks like you're just forgetting to put quotes around $USERNAME and $API_KEY. JSON is going to want quotes around string values, and you're just dropping them in without the quotes. You probably need:
my $json = quotemeta( {"auth":{"RAX-KSKEY:apiKeyCredentials":{"usernam +e":"$USERNAME", "apiKey":"$API_KEY"}}} );
So while this may get you going for now, just remember that it'll come back to bite you if you're not careful. Hence, the aforementioned suggestions.
...roboticus
When your only tool is a hammer, all problems look like your thumb.
Re: Interpolating variables in JSON string
by Anonymous Monk on Jan 29, 2013 at 13:23 UTC
It is definitely easier to use a JSON package, as noted, because this authentication request is only going to be the first of many requests that you will be sending to this host. Do as the Romans do ...
Re: Interpolating variables in JSON string
by muba (Curate) on Jan 29, 2013 at 13:52 UTC
The line
my $json = quotemeta( {"auth":{"RAX-KSKEY:apiKeyCredentials":{"use +rname":$USERNAME, "apiKey":$API_KEY}}} );
makes no sense. The character : is only part of the Perl syntax in rather specific places, and this isn't one of them. I get a syntax error message for this line.
The Perl equivalent of a JSON map is called a hash. Traditionally we use => to separate keys from their values, not :.
my $json = quotemeta( {"auth" => {"RAX-KSKEY:apiKeyCredentials" => + {"username" => $USERNAME, "apiKey" => $API_KEY}}} );
But even that would make little sense. That line would make the data structure, return a reference to it, try to quotemeta that reference, and store that in $json. So $json would end up being something like "HASH\(0x33c218\)". You don't need quotemeta here — you only need quotemeta when you're about to use a string inside a regular expressions and you're afraid that your string might have regex meta characters while you actually want to match them literally. What you do need is a real JSON module, like the good monks before me already suggested.
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: perlquestion [id://1015856]
Front-paged by Arunbear
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (11)
As of 2013-05-25 14:44 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
The best material for plates (tableware) is:
Results (520 votes), past polls
|
{
"url": "http://www.perlmonks.org/?node_id=1015856",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "28173",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:X4KKSTLCZUDDCEI4HW6E5E3ZGO3WEL6P",
"WARC-Concurrent-To": "<urn:uuid:8b66ca15-bc5d-40d1-ae48-d6fcf21ca9fa>",
"WARC-Date": "2013-05-25T14:45:20Z",
"WARC-IP-Address": "66.39.54.27",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HI3RDMA4YJZWII67S6XABH6M6WVTHK4U",
"WARC-Record-ID": "<urn:uuid:4b2fb3c2-4d21-4b97-84f5-762586cac011>",
"WARC-Target-URI": "http://www.perlmonks.org/?node_id=1015856",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:871b63e7-b238-4a1f-8537-76841f6f295d>"
},
"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,
84,
109,
111,
123,
124,
163,
164,
179,
269,
352,
353,
366,
367,
446,
447,
1085,
1086,
1338,
1339,
1415,
1416,
1518,
1519,
1569,
1593,
1636,
1682,
1725,
1775,
1776,
1966,
1967,
2138,
2181,
2231,
2232,
2242,
2243,
2496,
2497,
2615,
2616,
2770,
2771,
2788,
2789,
2861,
2862,
2905,
2952,
3159,
3202,
3248,
3249,
3262,
3263,
3377,
3544,
3545,
3668,
3669,
3795,
3796,
4352,
4353,
4361,
4371,
4381,
4382,
4402,
4420,
4433,
4446,
4485,
4509,
4514,
4526,
4563,
4564,
4602,
4615,
4665,
4692,
4702,
4715,
4727,
4738,
4756,
4757,
4806,
4807,
4808,
4809,
4810,
4811,
4812,
4813,
4814,
4815
],
"line_end_idx": [
84,
109,
111,
123,
124,
163,
164,
179,
269,
352,
353,
366,
367,
446,
447,
1085,
1086,
1338,
1339,
1415,
1416,
1518,
1519,
1569,
1593,
1636,
1682,
1725,
1775,
1776,
1966,
1967,
2138,
2181,
2231,
2232,
2242,
2243,
2496,
2497,
2615,
2616,
2770,
2771,
2788,
2789,
2861,
2862,
2905,
2952,
3159,
3202,
3248,
3249,
3262,
3263,
3377,
3544,
3545,
3668,
3669,
3795,
3796,
4352,
4353,
4361,
4371,
4381,
4382,
4402,
4420,
4433,
4446,
4485,
4509,
4514,
4526,
4563,
4564,
4602,
4615,
4665,
4692,
4702,
4715,
4727,
4738,
4756,
4757,
4806,
4807,
4808,
4809,
4810,
4811,
4812,
4813,
4814,
4815,
4850
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4850,
"ccnet_original_nlines": 99,
"rps_doc_curly_bracket": 0.008659790270030499,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2822429835796356,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0635514035820961,
"rps_doc_frac_lines_end_with_ellipsis": 0.019999999552965164,
"rps_doc_frac_no_alph_words": 0.32149532437324524,
"rps_doc_frac_unique_words": 0.47832369804382324,
"rps_doc_mean_word_length": 5.124277591705322,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0.00934579037129879,
"rps_doc_unigram_entropy": 5.311022758483887,
"rps_doc_word_count": 692,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.17033277451992035,
"rps_doc_frac_chars_dupe_6grams": 0.14608009159564972,
"rps_doc_frac_chars_dupe_7grams": 0.05358149856328964,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.015228429809212685,
"rps_doc_frac_chars_top_3gram": 0.03384095057845116,
"rps_doc_frac_chars_top_4gram": 0.0473773293197155,
"rps_doc_books_importance": -487.5941162109375,
"rps_doc_books_importance_length_correction": -487.5941162109375,
"rps_doc_openwebtext_importance": -228.93157958984375,
"rps_doc_openwebtext_importance_length_correction": -228.93157958984375,
"rps_doc_wikipedia_importance": -224.81895446777344,
"rps_doc_wikipedia_importance_length_correction": -224.81895446777344
},
"fasttext": {
"dclm": 0.13542026281356812,
"english": 0.8480601906776428,
"fineweb_edu_approx": 1.7775341272354126,
"eai_general_math": 0.12769651412963867,
"eai_open_web_math": 0.215875506401062,
"eai_web_code": 0.07393479347229004
}
}
|
{
"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": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,061,393,443,492,750,300 |
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Xen-devel] [patch 1/2] HV: allow HVM virtual PICs to have their interrupt vector reprogrammed
Hi,
> So the fix here is to first of all extend the virtual PIC provided by
> the hypervisor, supporting a new 2-byte control sequence which lets the
> guests change the interrupt vectors _without_ fully reinitialising the
> PIC
And this is the patch for that. The new control sequence is:
Write 0xff to ICW1: this is an otherwise unused value, since it has bit
4 set (ie. it's an initialisation register write), and yet bits 5--7 are
also set (only valid for MCS-80 mode, which the Xen vPIC doesn't emulate
at all.) This sets the PIC to expect ICW2 to follow, just as ICW1
usually does, except that it does not reset the PIC internal state.
Write the new vector to ICW2: completes the initialisation sequence.
This the same as a normal ICW2 write, except that it does not expect to
be followed by the usual ICW3/ICW4 writes.
Note that the flag used to indicate this "special" ICW1 write is shared
between the two vPICs (master and slave), so it is not legal for the
guest to write 0xff to both master/slave ICW1 before following up with
the ICW2 writes. But since the only software that will use this is the
modified vmxassist, that's OK.
--Stephen
--- xen-3.1.0-rc7-7041b52471c3/xen/arch/x86/hvm/vpic.c.~1~ 2007-05-03
17:49:31.000000000 +0100
+++ xen-3.1.0-rc7-7041b52471c3/xen/arch/x86/hvm/vpic.c 2007-05-22
14:25:05.000000000 +0100
@@ -178,13 +178,23 @@ static void vpic_ioport_write(struct hvm
{
int priority, cmd, irq;
uint8_t mask;
+ static int custom_revector_flag = 0;
vpic_lock(vpic);
addr &= 1;
if ( addr == 0 )
{
- if ( val & 0x10 )
+ if ( val == 0xff ) {
+ /* Extension to the PIC: lets us rewrite the icw2 vector
+ * without fully reinitialising the PIC, used by vmxassist
+ * to preserve icw2 vector translations across transitions
+ * into and back out of 32-bit mode.
+ */
+ vpic->init_state = 1;
+ custom_revector_flag = 1;
+ }
+ else if ( val & 0x10 )
{
/* ICW1 */
/* Clear edge-sensing logic. */
@@ -268,6 +278,10 @@ static void vpic_ioport_write(struct hvm
/* ICW2 */
vpic->irq_base = val & 0xf8;
vpic->init_state++;
+ if (custom_revector_flag) {
+ custom_revector_flag = 0;
+ vpic->init_state = 0;
+ }
if ( !(vpic->init_state & 8) )
break; /* CASCADE mode: wait for write to ICW3. */
/* SNGL mode: fall through (no ICW3). */
_______________________________________________
Xen-devel mailing list
Xen-devel@xxxxxxxxxxxxxxxxxxx
http://lists.xensource.com/xen-devel
Rackspace
Lists.xenproject.org is hosted with RackSpace, monitoring our
servers 24x7x365 and backed by RackSpace's Fanatical Support®.
|
{
"url": "https://old-list-archives.xen.org/archives/html/xen-devel/2007-05/msg00845.html",
"source_domain": "old-list-archives.xen.org",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "11968",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AKNZBX2X5ZOS76IJWUY3CGSOP3FDMT6F",
"WARC-Concurrent-To": "<urn:uuid:570f7aee-c976-47dc-b141-2bd79b860f47>",
"WARC-Date": "2021-12-06T12:46:55Z",
"WARC-IP-Address": "192.237.175.120",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:WCYVMVHRFIVYV4J6HNOZYRRYN5VXBVRO",
"WARC-Record-ID": "<urn:uuid:fc127d91-d7c2-4b14-bc9e-cdde7c7a7851>",
"WARC-Target-URI": "https://old-list-archives.xen.org/archives/html/xen-devel/2007-05/msg00845.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9e64d88a-6c8c-45e0-b906-3a7442c9fda4>"
},
"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-102\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
4,
79,
80,
175,
176,
177,
178,
182,
183,
255,
329,
402,
408,
409,
471,
472,
544,
617,
690,
757,
825,
826,
895,
967,
1010,
1011,
1083,
1152,
1223,
1295,
1326,
1327,
1337,
1338,
1339,
1415,
1440,
1508,
1533,
1596,
1599,
1628,
1647,
1689,
1691,
1713,
1715,
1731,
1753,
1760,
1787,
1816,
1885,
1956,
2027,
2076,
2092,
2126,
2164,
2174,
2206,
2217,
2241,
2286,
2348,
2372,
2414,
2447,
2487,
2529,
2567,
2581,
2625,
2693,
2747,
2795,
2818,
2848,
2885,
2886,
2888,
2889,
2890,
2900,
2901,
2963
],
"line_end_idx": [
2,
3,
4,
79,
80,
175,
176,
177,
178,
182,
183,
255,
329,
402,
408,
409,
471,
472,
544,
617,
690,
757,
825,
826,
895,
967,
1010,
1011,
1083,
1152,
1223,
1295,
1326,
1327,
1337,
1338,
1339,
1415,
1440,
1508,
1533,
1596,
1599,
1628,
1647,
1689,
1691,
1713,
1715,
1731,
1753,
1760,
1787,
1816,
1885,
1956,
2027,
2076,
2092,
2126,
2164,
2174,
2206,
2217,
2241,
2286,
2348,
2372,
2414,
2447,
2487,
2529,
2567,
2581,
2625,
2693,
2747,
2795,
2818,
2848,
2885,
2886,
2888,
2889,
2890,
2900,
2901,
2963,
3025
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3025,
"ccnet_original_nlines": 88,
"rps_doc_curly_bracket": 0.002314049983397126,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23420646786689758,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04006163030862808,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.40369799733161926,
"rps_doc_frac_unique_words": 0.5623268485069275,
"rps_doc_mean_word_length": 5.343490123748779,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.965619087219238,
"rps_doc_word_count": 361,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.052877139300107956,
"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.015552099794149399,
"rps_doc_frac_chars_top_3gram": 0.026956969872117043,
"rps_doc_frac_chars_top_4gram": 0.030067389830946922,
"rps_doc_books_importance": -399.1796569824219,
"rps_doc_books_importance_length_correction": -399.1796569824219,
"rps_doc_openwebtext_importance": -230.7897491455078,
"rps_doc_openwebtext_importance_length_correction": -230.7897491455078,
"rps_doc_wikipedia_importance": -157.86669921875,
"rps_doc_wikipedia_importance_length_correction": -157.86669921875
},
"fasttext": {
"dclm": 0.12232452630996704,
"english": 0.7929012775421143,
"fineweb_edu_approx": 1.515164852142334,
"eai_general_math": 0.2937168478965759,
"eai_open_web_math": 0.7717875838279724,
"eai_web_code": 0.09388356655836105
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "5",
"label": "Social/Forum"
}
},
"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": "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
|
-4,765,605,864,247,831,000 |
Linux Format
GET HELP NOW!
We’d love to try and answer any questions you send to , no matter
Citiți o mostră, înregistrați-vă pentru a citi în continuare.
Mai multe de la Linux Format
Linux Format4 min cititeInternet & Web
User Experience
At the very minimum, we’re looking for a browser that strikes the right balance between features and performance. It should be able to work with and render the popular websites and online services just as they’re intended. Of course, simply piling fe
Linux Format1 min cititeMathematics
Collision Warning
Our collision detection is pretty basic, but it does the job. Within runngun_classes.py we have a class set up specifically to calculate if two given shapes have collided: Given a point and a rectangle, if the points at teach end are interacting ou
Linux Format1 min cititeComputers
Quick Tip
Prometheus pulls data from its data sources, which means it needs to know where to look for this data. Additionally, each data source (including all presented Python applications) should wait for Prometheus to read its data using an HTTP connection.
|
{
"url": "https://ro.scribd.com/article/454437029/Get-Help-Now",
"source_domain": "ro.scribd.com",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "332082",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OK2FIL2LES4PCTY37W5IK64LOU3E4GOS",
"WARC-Concurrent-To": "<urn:uuid:be8099e1-e0cf-4ec3-9565-e29ac78865e5>",
"WARC-Date": "2021-05-11T20:02:45Z",
"WARC-IP-Address": "151.101.202.152",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:H5TJI2HFBL73Y3OZYEPTMZED3B3Z2IUR",
"WARC-Record-ID": "<urn:uuid:f1e1bdc6-b8ab-43fd-b6cd-a4c4444982e2>",
"WARC-Target-URI": "https://ro.scribd.com/article/454437029/Get-Help-Now",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9fcc35ac-4f93-46ad-ac4b-0225f603c8d5>"
},
"warc_info": "isPartOf: CC-MAIN-2021-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-193.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,
13,
14,
28,
29,
95,
96,
158,
159,
188,
189,
228,
244,
495,
531,
549,
798,
832,
842
],
"line_end_idx": [
13,
14,
28,
29,
95,
96,
158,
159,
188,
189,
228,
244,
495,
531,
549,
798,
832,
842,
1091
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1091,
"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.3689320385456085,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019417479634284973,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11650484800338745,
"rps_doc_frac_unique_words": 0.7627118825912476,
"rps_doc_mean_word_length": 5.039547920227051,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.737687587738037,
"rps_doc_word_count": 177,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02466367930173874,
"rps_doc_frac_chars_top_3gram": 0.03363228961825371,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -79.12519836425781,
"rps_doc_books_importance_length_correction": -79.12519836425781,
"rps_doc_openwebtext_importance": -46.44780349731445,
"rps_doc_openwebtext_importance_length_correction": -36.766746520996094,
"rps_doc_wikipedia_importance": -26.1761474609375,
"rps_doc_wikipedia_importance_length_correction": -26.1761474609375
},
"fasttext": {
"dclm": 0.48772668838500977,
"english": 0.8383538126945496,
"fineweb_edu_approx": 2.264993190765381,
"eai_general_math": 0.42572176456451416,
"eai_open_web_math": 0.1891235113143921,
"eai_web_code": 0.6991560459136963
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.028563",
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,284,459,662,366,544,000 |
CupertinoUserInterfaceLevel class Null safety
Establishes a subtree in which CupertinoUserInterfaceLevel.of resolves to the given data.
Querying the current elevation status using CupertinoUserInterfaceLevel.of will cause your widget to rebuild automatically whenever the CupertinoUserInterfaceLevelData changes.
If no CupertinoUserInterfaceLevel is in scope then the CupertinoUserInterfaceLevel.of method will throw an exception. Alternatively, CupertinoUserInterfaceLevel.maybeOf can be used, which returns null instead of throwing if no CupertinoUserInterfaceLevel is in scope.
See also:
Inheritance
Constructors
CupertinoUserInterfaceLevel({Key? key, required CupertinoUserInterfaceLevelData data, required Widget child})
Creates a CupertinoUserInterfaceLevel to change descendant Cupertino widget's visual level.
const
Properties
child Widget
The widget below this widget in the tree. [...]
final, inherited
hashCode int
The hash code for this object. [...]
@nonVirtual, read-only, inherited
key Key?
Controls how one widget replaces another widget in the tree. [...]
final, inherited
runtimeType Type
A representation of the runtime type of the object.
read-only, inherited
Methods
createElement() InheritedElement
Inflates this configuration to a concrete instance. [...]
inherited
debugDescribeChildren() List<DiagnosticsNode>
Returns a list of DiagnosticsNode objects describing this node's children. [...]
@protected, inherited
debugFillProperties(DiagnosticPropertiesBuilder properties) → void
Add additional properties associated with the node. [...]
override
noSuchMethod(Invocation invocation) → dynamic
Invoked when a non-existent method or property is accessed. [...]
inherited
toDiagnosticsNode({String? name, DiagnosticsTreeStyle? style}) DiagnosticsNode
Returns a debug representation of the object that is used by debugging tools and by DiagnosticsNode.toStringDeep. [...]
inherited
toString({DiagnosticLevel minLevel = DiagnosticLevel.info}) String
A string representation of this object. [...]
inherited
toStringDeep({String prefixLineOne = '', String? prefixOtherLines, DiagnosticLevel minLevel = DiagnosticLevel.debug}) String
Returns a string representation of this node and its descendants. [...]
inherited
toStringShallow({String joiner = ', ', DiagnosticLevel minLevel = DiagnosticLevel.debug}) String
Returns a one-line detailed description of the object. [...]
inherited
toStringShort() String
A short, textual description of this widget.
inherited
updateShouldNotify(covariant CupertinoUserInterfaceLevel oldWidget) bool
Whether the framework should notify widgets that inherit from this widget. [...]
override
Operators
operator ==(Object other) bool
The equality operator. [...]
@nonVirtual, inherited
Static Methods
maybeOf(BuildContext context) CupertinoUserInterfaceLevelData?
The data from the closest instance of this class that encloses the given context, if there is one. [...]
of(BuildContext context) CupertinoUserInterfaceLevelData
The data from the closest instance of this class that encloses the given context. [...]
|
{
"url": "https://api.flutter.dev/flutter/cupertino/CupertinoUserInterfaceLevel-class.html",
"source_domain": "api.flutter.dev",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "116512",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OJOVA6TNTBVTRR7ERJ3KZATZESKJP7YJ",
"WARC-Concurrent-To": "<urn:uuid:1b3c9b83-3266-405c-a057-b089cbab1806>",
"WARC-Date": "2021-12-09T13:26:02Z",
"WARC-IP-Address": "199.36.158.100",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RNZEIYRCLJH26PLWM4IWFBWX2JBEKX3J",
"WARC-Record-ID": "<urn:uuid:a36668a3-1a5f-4224-9874-c1eacedd0511>",
"WARC-Target-URI": "https://api.flutter.dev/flutter/cupertino/CupertinoUserInterfaceLevel-class.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3bffed7d-8020-445b-93b4-f995cae70d62>"
},
"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-123\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,
46,
47,
137,
138,
315,
316,
584,
585,
595,
596,
608,
609,
622,
623,
733,
825,
831,
832,
843,
844,
857,
905,
922,
935,
972,
1006,
1015,
1082,
1099,
1116,
1168,
1189,
1190,
1198,
1199,
1232,
1290,
1300,
1346,
1427,
1449,
1516,
1574,
1583,
1629,
1695,
1705,
1784,
1904,
1914,
1981,
2027,
2037,
2162,
2234,
2244,
2341,
2402,
2412,
2435,
2480,
2490,
2563,
2644,
2653,
2654,
2664,
2665,
2696,
2725,
2748,
2749,
2764,
2765,
2828,
2933,
2990
],
"line_end_idx": [
46,
47,
137,
138,
315,
316,
584,
585,
595,
596,
608,
609,
622,
623,
733,
825,
831,
832,
843,
844,
857,
905,
922,
935,
972,
1006,
1015,
1082,
1099,
1116,
1168,
1189,
1190,
1198,
1199,
1232,
1290,
1300,
1346,
1427,
1449,
1516,
1574,
1583,
1629,
1695,
1705,
1784,
1904,
1914,
1981,
2027,
2037,
2162,
2234,
2244,
2341,
2402,
2412,
2435,
2480,
2490,
2563,
2644,
2653,
2654,
2664,
2665,
2696,
2725,
2748,
2749,
2764,
2765,
2828,
2933,
2990,
3077
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3077,
"ccnet_original_nlines": 77,
"rps_doc_curly_bracket": 0.0032499199733138084,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25427350401878357,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00641026021912694,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24145299196243286,
"rps_doc_frac_unique_words": 0.5120481848716736,
"rps_doc_mean_word_length": 7.58433723449707,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0.03205128014087677,
"rps_doc_unigram_entropy": 4.739120006561279,
"rps_doc_word_count": 332,
"rps_doc_frac_chars_dupe_10grams": 0.08339951932430267,
"rps_doc_frac_chars_dupe_5grams": 0.20452739298343658,
"rps_doc_frac_chars_dupe_6grams": 0.1834789514541626,
"rps_doc_frac_chars_dupe_7grams": 0.08339951932430267,
"rps_doc_frac_chars_dupe_8grams": 0.08339951932430267,
"rps_doc_frac_chars_dupe_9grams": 0.08339951932430267,
"rps_doc_frac_chars_top_2gram": 0.011914219707250595,
"rps_doc_frac_chars_top_3gram": 0.013105640187859535,
"rps_doc_frac_chars_top_4gram": 0.02621128037571907,
"rps_doc_books_importance": -251.00274658203125,
"rps_doc_books_importance_length_correction": -251.00274658203125,
"rps_doc_openwebtext_importance": -161.69775390625,
"rps_doc_openwebtext_importance_length_correction": -161.69775390625,
"rps_doc_wikipedia_importance": -89.3131103515625,
"rps_doc_wikipedia_importance_length_correction": -89.3131103515625
},
"fasttext": {
"dclm": 0.02450340986251831,
"english": 0.6738590598106384,
"fineweb_edu_approx": 2.991239070892334,
"eai_general_math": 0.22924304008483887,
"eai_open_web_math": 0.011986490339040756,
"eai_web_code": 0.9417239427566528
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,694,771,531,577,599,000 |
The Golden Ratio ‐ a Masonic Number by rt3463df
VIEWS: 171 PAGES: 22
The Divine Proportion
– a Masonic Number
“Geometry has two great treasures…one is the theorem of
Pythagoras; the other, the division of a line into extreme and mean
ratio. The first we may compare to a measure of gold; the second we
may name a precious jewel”. (Johannes Kepler)
Why should Masons know about
the Divine Proportion?
The Divine Proportion, or Golden Section,
represented by the Greek letter Φ (phi), is one of
those mysterious natural numbers like π (pi) that
seem to arise out of the basic structure of the
universe.
Φ appears clearly and regularly in the realm of things
that grow and unfold in steps, especially living things
– but also in art and architecture.
• “To the Greeks therefore, and not to the Romans, we are indebted for all that is
great, judicious, and distinct in architecture.”
Why should Masons know about
the Divine Proportion?
The Greeks (and others, like Renaissance artists such as
Botticelli, Lippi, Michelangelo) may have felt that when a
building or artwork was designed to incorporate Φ that it had the
purest possible proportions and was the most pleasing to the
eye – we will see why in a minute.
• …allude to a proper application of the useful rules of architecture, whence a
structure will derive figure, strength, and beauty, and whence will result a due
proportion and a just correspondence in all its parts.”
The Golden Section – A
Ratio
The Golden Section is a RATIO – like 2:1. It is also called the
“Golden Mean”
If there is a piece of string, and you divide it into a 2:1 ratio, then
1 part is twice as long as the other.
Also, the short part is 1/3 the length of the whole string, and the
long part is 2/3 the length. The ratio of the shorter to the longer
is 1:2, and that of the longer to the whole is 2:3.
So then what is the
Golden Section?
But…the Golden Section is a special
ratio – where the ratio of the short part
to the long part is the same as the long
part to the whole.
So then what is the
Golden Section?
So, “a” is to “b” (a:b) as “b” is to “c” (b:c)
a:b = b:c
Some Examples - People
Some Examples - Nature
Hmmmm…
It seems as though the GAOTU may
have laid out the designs for creation on
his trestleboard using, among other
things, the Divine Proportion.
• “While we are employed in the study of this science we must perceive
unparalleled instances of wisdom and goodness, and, through the whole
creation, trace the Glorious Author by his works.”
So what is this ratio?
The Golden Section/Golden Mean/Divine
Proportion is an irregular number – like π,
and cannot be expressed fully in decimal
form (i.e. π = 3.14128…)
Φ = 1.618033… or (1+5)/2
Somehow it seems fitting that we cannot
represent the root of Sacred Geometry by an
ordinary number.
So what about
Architecture?
The Divine Proportion was used by the Greeks – and is still
being used by architects today to design buildings that are
aesthetically pleasing.
There is evidence that the Great Pyramid incorporates Φ – in
the so-called “King’s Chamber” and also in its overall
dimensions.
What about the
Parthenon?
Columns, anyone?
The graceful curves of the Ionic column
are designed using the Golden Section.
VOSL…
Exodus 25:10 – “Have them make a
chest of acacia wood = two and a
half cubits long, a cubit and a half
wide, and a cubit and a half high…”
(ratio 2.5:1.5 = 5:3 = 1.666)
Genesis 6:15 – “And this is the
fashion that thou shalt make it of:
The length of the ark shall be three
hundred cubits, the breadth of it 50
cubits, and the height of it 30
cubits…” (50:30 = 5:3 = 1.666)
Φ = 1.618033… or (1+5)/2
Anything Else?
It is likely that Virgil’s “Aeneid” and other great works of classical
poetry used φ to determine metrical structure of the poem.
Mozart’s sonatas tend to divide in parts exactly at the Golden
Section of total time of the work.
In Beethoven’s 5th Symphony the opening motto is repeated at
exactly the Φ point through the Symphony (Bar 372) and also at
the start of the recapitulation 1-Φ of the way through.
Stradivarius placed the “f” holes in his violins at the Φ point of
the body structure.
Hmmmm… (revisited)
It now seems that the Divine Proportion
was and still is used by men and
women to build beautiful monuments
and other works that are pleasing to the
senses.
• “…so as to compose delightful harmony by a mathematical and
proportional arrangement of acute, grave, and mixed sounds.”
A little more math for anyone that’s still
awake…
The Fibonacci series (1, 1, 2, 3, 5, 8,13, 21…)
which describes the growth pattern of a
population, is connected to the Golden Mean,
because the ratio of any 2 terms tends
towards Φ…
For instance.. 2:1 = 2.000, 8:5 =1.600, 13:8 =
1.625, 21:13 = 1.615…
Φ = 1.618033… or (1+5)/2
Each number in the series is called a
“Fibonacci Number”
Fibonacci Bunnies
Start with one
pair
Mate during first
month
One pair born
next month and
each month
thereafter
Building a Golden Spiral
Draw 2 squares of 1
unit each, side-by-side
Next draw a 2 unit
square, and then a 3,
and then a 5, etc
Draw quarter circles in
each square, joining
them up…
Building a Golden Spiral
The spirals increase in distance from the centre by phi every
quarter turn…sea shells, snails, ferns, and many other living
creatures are built to this specification
Operative Masonry
How did our ancient brethren construct
such mathematically rigorous designs,
using only the tools that were available
to them?
So what does this have
to do with Freemasonry?
The Golden Section and its derivative constructs can be
calculated using only 2 tools: the Square and Compasses.
If the S&C allow the calculation of the proportion used by the
GAOTU when laying out the design for Creation on His trestle
board, then I feel that there is some demonstrable validity to the
spiritual symbolism that they are supposed to display.
I ask you now, Brethren: “Is it still true in your minds that there
are no secrets in Freemasonry?”
To top
|
{
"url": "http://www.docstoc.com/docs/33292554/The-Golden-Ratio-%E2%80%90-a-Masonic-Number",
"source_domain": "www.docstoc.com",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "180092",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JUAYRCWC6ZEGFA6ABHX4OJM5JJQHU7YK",
"WARC-Concurrent-To": "<urn:uuid:e2dab7c2-4003-4518-97fe-f006c793f23c>",
"WARC-Date": "2015-06-03T13:56:06Z",
"WARC-IP-Address": "72.172.88.41",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:YTR25LD5U25U3M6ZXP6JQG64MFWRCUYI",
"WARC-Record-ID": "<urn:uuid:10e08343-e73b-4287-90be-1badaf4cee20>",
"WARC-Target-URI": "http://www.docstoc.com/docs/33292554/The-Golden-Ratio-%E2%80%90-a-Masonic-Number",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:42fa3784-54e5-439c-965e-4f5b1125472c>"
},
"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,
48,
49,
70,
71,
110,
138,
139,
140,
141,
203,
272,
340,
397,
430,
461,
507,
562,
616,
668,
682,
741,
801,
841,
842,
927,
980,
1013,
1044,
1105,
1168,
1238,
1303,
1342,
1343,
1344,
1345,
1346,
1428,
1513,
1573,
1596,
1610,
1674,
1688,
1760,
1798,
1866,
1934,
1986,
2008,
2027,
2028,
2064,
2106,
2147,
2166,
2189,
2209,
2256,
2266,
2289,
2312,
2342,
2379,
2425,
2465,
2500,
2501,
2502,
2575,
2649,
2704,
2728,
2766,
2810,
2851,
2876,
2902,
2942,
2986,
3003,
3027,
3051,
3111,
3171,
3195,
3256,
3311,
3323,
3338,
3350,
3370,
3410,
3449,
3455,
3489,
3523,
3561,
3598,
3629,
3662,
3699,
3737,
3775,
3808,
3840,
3867,
3893,
3964,
4023,
4086,
4121,
4182,
4245,
4301,
4368,
4388,
4412,
4456,
4493,
4532,
4577,
4589,
4590,
4654,
4719,
4762,
4785,
4786,
4834,
4874,
4919,
4958,
4969,
5016,
5038,
5064,
5102,
5121,
5139,
5166,
5183,
5213,
5231,
5257,
5284,
5307,
5330,
5355,
5388,
5425,
5457,
5492,
5523,
5560,
5594,
5616,
5641,
5642,
5643,
5644,
5645,
5707,
5769,
5811,
5832,
5871,
5909,
5950,
5959,
5983,
6007,
6064,
6122,
6123,
6187,
6249,
6317,
6373,
6374,
6443,
6476,
6477,
6486
],
"line_end_idx": [
48,
49,
70,
71,
110,
138,
139,
140,
141,
203,
272,
340,
397,
430,
461,
507,
562,
616,
668,
682,
741,
801,
841,
842,
927,
980,
1013,
1044,
1105,
1168,
1238,
1303,
1342,
1343,
1344,
1345,
1346,
1428,
1513,
1573,
1596,
1610,
1674,
1688,
1760,
1798,
1866,
1934,
1986,
2008,
2027,
2028,
2064,
2106,
2147,
2166,
2189,
2209,
2256,
2266,
2289,
2312,
2342,
2379,
2425,
2465,
2500,
2501,
2502,
2575,
2649,
2704,
2728,
2766,
2810,
2851,
2876,
2902,
2942,
2986,
3003,
3027,
3051,
3111,
3171,
3195,
3256,
3311,
3323,
3338,
3350,
3370,
3410,
3449,
3455,
3489,
3523,
3561,
3598,
3629,
3662,
3699,
3737,
3775,
3808,
3840,
3867,
3893,
3964,
4023,
4086,
4121,
4182,
4245,
4301,
4368,
4388,
4412,
4456,
4493,
4532,
4577,
4589,
4590,
4654,
4719,
4762,
4785,
4786,
4834,
4874,
4919,
4958,
4969,
5016,
5038,
5064,
5102,
5121,
5139,
5166,
5183,
5213,
5231,
5257,
5284,
5307,
5330,
5355,
5388,
5425,
5457,
5492,
5523,
5560,
5594,
5616,
5641,
5642,
5643,
5644,
5645,
5707,
5769,
5811,
5832,
5871,
5909,
5950,
5959,
5983,
6007,
6064,
6122,
6123,
6187,
6249,
6317,
6373,
6374,
6443,
6476,
6477,
6486,
6492
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6492,
"ccnet_original_nlines": 184,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3961424231529236,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017062310129404068,
"rps_doc_frac_lines_end_with_ellipsis": 0.0324324294924736,
"rps_doc_frac_no_alph_words": 0.2633531093597412,
"rps_doc_frac_unique_words": 0.4354838728904724,
"rps_doc_mean_word_length": 4.4430742263793945,
"rps_doc_num_sentences": 54,
"rps_doc_symbol_to_word_ratio": 0.014094959944486618,
"rps_doc_unigram_entropy": 5.347401142120361,
"rps_doc_word_count": 1054,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.037582751363515854,
"rps_doc_frac_chars_dupe_6grams": 0.03160367161035538,
"rps_doc_frac_chars_dupe_7grams": 0.03160367161035538,
"rps_doc_frac_chars_dupe_8grams": 0.019645530730485916,
"rps_doc_frac_chars_dupe_9grams": 0.019645530730485916,
"rps_doc_frac_chars_top_2gram": 0.017083069309592247,
"rps_doc_frac_chars_top_3gram": 0.02840059995651245,
"rps_doc_frac_chars_top_4gram": 0.009609219618141651,
"rps_doc_books_importance": -758.0115966796875,
"rps_doc_books_importance_length_correction": -758.0115966796875,
"rps_doc_openwebtext_importance": -431.6255187988281,
"rps_doc_openwebtext_importance_length_correction": -431.6255187988281,
"rps_doc_wikipedia_importance": -291.3868103027344,
"rps_doc_wikipedia_importance_length_correction": -291.3868103027344
},
"fasttext": {
"dclm": 0.5841471552848816,
"english": 0.9471496939659119,
"fineweb_edu_approx": 2.999873399734497,
"eai_general_math": 0.9259299635887146,
"eai_open_web_math": 0.5260814428329468,
"eai_web_code": 0.39052462577819824
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "366.1",
"labels": {
"level_1": "Social sciences",
"level_2": "Social service and Societies",
"level_3": "Secret societies"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,101,552,278,443,565,600 |
Начинаем общение
Несмотря на небольшой, хоть и понятно почему, отклик аудитории, я продолжнаю писать заметки по работе с Vesp на примере бота для Телеграм.
Сегодня наступила пора реальных действий. В нашем уютном чатике было голосование, в каком направлении развивать уроки, и там дружно решили, что это будет бот организации с выводом каталога.
Поэтому сегодня мы создаём таблицы в БД и сохраняем в них что-то, что будем потом выводить.
Для генерации тестовых данных очень удобно использовать библиотеку fakerphp/faker библиотеку. Мы же используем её вариацию pelmered/fake-car, для генерации данных автомобилей.
composer require pelmered/fake-car
Дальше мы уже начинаем использовать базу данных, поэтому нужно задать параметры подключения к ней в нашем файле .env.local:
DB_DRIVER=mysql
DB_HOST=127.0.0.1
DB_PORT=3306
DB_PREFIX=app_
DB_DATABASE=ExampleBot
DB_USERNAME=root
DB_PASSWORD=root
DB_CHARSET=utf8mb4
DB_COLLATION=utf8mb4_general_ci
Теперь можно создать стандартные таблицы и юзеров:
composer db:migrate
composer db:seed
Если здесь нет никаких ошибок - это хорошо, можно продолжать. Пишем новую миграцию.
cd core/
./vendor/bin/phinx create Vehicles
Это создаст файл миграции с датой и временем, который нужно отредактировать вот так:
<?php
use Illuminate\Database\Schema\Blueprint;
use Vesp\Services\Migration;
final class Vehicles extends Migration
{
// Действия при миграции
public function up(): void
{
// Создаём новую таблицу с автомобилями
$this->schema->create('vehicles', static function (Blueprint $table) {
$table->id();
$table->string('brand'); // Брэнд автомобиля
$table->string('model'); // Модель
$table->string('type'); // Тип: седан, хэтчбэк
$table->string('fuel'); // дизель, бензин, электро
$table->tinyInteger('doors'); // количество дверей
$table->tinyInteger('seats'); // количество седений
$table->string('gearbox'); // тип коробки передач
$table->json('properties')->nullable(); // кожаные сиденья и прочее
$table->boolean('active')->default(true); // Выводить ли запись
$table->timestamps(); // Даты создания и редактирования
});
}
// Удаление таблицы ари откате
public function down(): void
{
$this->schema->drop('vehicles');
}
}
Вот такая у нас будет миграция для новых данных, можно сразу же здесь её и запустить:
./vendor/bin/phinx migrate
Обратите внимание, что все работы с Phinx производятся из директории core, потому что в ней лежит её конфиг - phinx.php.
Таблица готова, теперь нужно создать модель в core/src/Models/Vehicle.php:
<?php
namespace App\Models;
use Illuminate\Database\Eloquent\Model;
/**
* Перечисление всё тех же полей таблицы с типами
* @property int $id
* @property string $brand
* @property string $model
* @property string $type
* @property string $fuel
* @property int $doors
* @property int $seats
* @property string $gearbox
* @property ?array $properties
* @property bool $active
*/
class Vehicle extends Model
{
// Эти поля нельзя указывать массовом заполнении
protected $guarded = ['id', 'created_at', 'updated_at'];
// Эти поля будут приобразоываться в указанные типы
protected $casts = [
'properties' => 'json',
'active' => 'bool',
];
}
Подробнее про модели Eloquent и работу с ними смотрите в документации.
Теперь мы можем работать с новой таблицей через новую модель, чем и воспользуемся. Пишем скрипт для заливки фейковых данных в core/db/seeds/Vehicles.php:
<?php
use App\Models\Vehicle;
use Faker\Factory;
use Faker\Provider\Fakecar;
use Phinx\Seed\AbstractSeed;
class Vehicles extends AbstractSeed
{
public function run(): void
{
// Запускаем библиотеку
$faker = Factory::create();
// Добавляем провайдера данных
$faker->addProvider(new Fakecar($faker));
// Забиваем тысячу записей в БД
for ($i = 0; $i < 1000; $i++) {
$vehicle = [
'brand' => $faker->vehicleBrand,
'model' => $faker->vehicleModel,
'type' => $faker->vehicleType,
'fuel' => $faker->vehicleFuelType,
'doors' => $faker->vehicleDoorCount,
'seats' => $faker->vehicleSeatCount,
'gearbox' => $faker->vehicleGearBoxType,
'properties' => $faker->vehicleProperties ?: null,
];
// Собстаенно, вот здесь идёт сохранение через модель
Vehicle::query()->create($vehicle);
}
}
}
Теперь нужно только запустить конкретно этот скрипт из core:
./vendor/bin/phinx seed:run -s Vehicles
Имейте в виду, что 1000 новых машин будет добавляться при каждом запуске! Но вы всегда может удалить новую таблицу со всем содержимым через
./vendor/bin/phinx rollback
А потом снова migrate и seed данные. Самое сложное позади, продолжаем работу с ботом.
Вывод каталога
Я решил, что при запуске /catalogue в боте мы будем получать все доступные марки автомобилей, в виде кнопочек, а затем кликая по ним просматривать конкретные модели.
Для этого в команде нам нужны раздельно методы вывод всех названий брендов и их марок с фильтрацией по бренду.
Но тонкость в том, что нажатия на кнопочки должны отправлять какую-то команду боту, и в ней нужно указать что именно делать, строкой. longman/telegram-bot обрабатывает все подобные действия в одной системной команде CallbackqueryCommand, и нам нужно её переопределить.
Дальше может быть немного запутано, но просто дочитайте до конца заметки, и у вам сложится понимание, как работает inline клавиатура у боте.
Создаём core/src/Commands/CallbackqueryCommand.php:
<?php
namespace App\Commands;
use Longman\TelegramBot\Entities\ServerResponse;
use Longman\TelegramBot\Request;
class CallbackqueryCommand extends \Longman\TelegramBot\Commands\SystemCommands\CallbackqueryCommand
{
public function execute(): ServerResponse
{
// Получаем объект callback query из API Telegram
$callback = $this->getCallbackQuery();
// И сообщение, в котором нажали на кнопку
$message = $callback->getMessage();
// Здесь мы получаем строку с командой и разбиваем её на состовляющие через разделитель '::'
if ($data = explode('::', $callback->getData())) {
// Первым должно идти имя команды
$command = array_shift($data);
// Оно начинается со слэша
if (strpos($command, '/') === 0) {
// И дальше пусть уже сама команда разбирается с запросом
return $this->getTelegram()->executeCommand(substr($command, 1));
}
}
// Если указаной команды нет, или действие неправильно уазано
// просто возвращаем в чат что нам пришло, для отладки
return Request::sendMessage([
'chat_id' => $message->getChat()->getId(),
'text' => $data,
]);
}
}
Грубо говоря, получился универсальный контроллер для всех нажатий на inline клавиатуру в проекте, который будет вызывать нужную команду для обработки. Так что к этому файлу нам больше возвращаться не нужно.
Теперь пишем собственно команду для работы с каталогом в core/src/Commands/CatalogueCommand.php. Я приведу немного сокращённый код с комментриями, а полный будет как обычно в репозитории:
<?php
namespace App\Commands;
use App\Models\Vehicle;
use Longman\TelegramBot\Commands\UserCommand;
use Longman\TelegramBot\Entities\InlineKeyboard;
use Longman\TelegramBot\Entities\ServerResponse;
use Longman\TelegramBot\Entities\Update;
use Longman\TelegramBot\Request;
use Longman\TelegramBot\Telegram;
use Vesp\Services\Eloquent;
class CatalogueCommand extends UserCommand
{
protected $name = 'catalogue';
protected $description = 'Работа с каталогом товаров';
protected $usage = '/catalogue';
public function __construct(Telegram $telegram, ?Update $update = null)
{
parent::__construct($telegram, $update);
// Так как это не контроллер Vesp, подключаться к базе данных приходится вручную, по старинкн
new Eloquent();
}
// Основной публичный метод для работы
public function execute(): ServerResponse
{
// Проверяем наличие callback query
// Если есть - то нужно обработать пришедшую команду от кнопки
if ($callback = $this->getCallbackQuery()) {
$message = $callback->getMessage();
// Разбираем команду на части, отбрасывая первую - мы ужеи так уже в нужном классе
$data = array_slice(explode('::', $callback->getData()), 1);
// Дальше идёт запрос метода этого класса, например 'getBrand'
$method = array_shift($data);
// Если он есть - вызываем его
$response = $method && method_exists($this, $method)
? $this->$method(...$data)
// А если нет - то выводим все бренды
: $this->getBrands();
// Метод должен вернуть array или null
if (is_array($response)) {
// Если пришёл массив, то всё в порядке, добавляем в него параметры
$response['chat_id'] = $message->getChat()->getId();
$response['message_id'] = $message->getMessageId();
// Чтобы изменить сообщение с клавиатурой
// Изменить, не написать новое!
return Request::editMessageText($response);
}
// А если пришёл null, то это ошибка, надо бы её залогировать, но нам пока некуда
return Request::sendMessage([
'chat_id' => $message->getChat()->getId(),
'message_id' => $message->getMessageId(),
'text' => 'Какая-то ошибка, увы...',
]);
}
// Если же никакого callback query нет, то просто выводим бренды новым сообщением
return $this->replyToChat('', $this->getBrands());
}
// Метод для выборки всех брендов
protected function getBrands(): array
{
// Тут магия Eloquent
$brands = Vehicle::query()
->where('active', true)
->groupBy('brand')
->orderBy('brand')
// пока просто лимит, а должна быть постраничная навигация, по идее
->limit(30)
// Группируем, сортируем и выбираем только бренд
->pluck('brand')
->toArray();
// А вот здесь мы генерируем кнопочки клавиатуры для брендов согласно документации Telegram
$rows = [];
foreach ($brands as $brand) {
$rows[] = [
'text' => $brand,
// Собственно, действие при нажатии, которое потом будем разбирать
// Здесь вывод всех автомобилей одного бренда
'callback_data' => implode('::', [$this->usage, 'getBrand', $brand]),
];
}
// Метод prepareKeyboard разделяет простой массив с кнопками на чуть более сложный
// чтобы уместить по несколько кнопок в ряд, если нужно
return [
'text' => 'Выберите бренд',
'reply_markup' => new InlineKeyboard(...$this->prepareKeyboard($rows)),
];
}
// Тут мы будем выбирать все модели одного бренда
protected function getBrand($brand): array
{
$vehicles = Vehicle::query()
->where(['brand' => $brand, 'active' => true])
->orderBy('id')
->limit(10);
$rows = [
// Добавляем действия по возврату назад, а точнее просто выводу всего каталога
['text' => 'Вернуться назад', 'callback_data' => $this->usage],
];
/** @var Vehicle $vehicle */
foreach ($vehicles->get() as $vehicle) {
// И набиваем новые кнопки для вывод конкретной модели
$rows[] = [
'text' => $vehicle->brand . ' ' . $vehicle->model,
'callback_data' => implode('::', [$this->usage, 'getVehicle', $vehicle->id]),
];
}
return [
'text' => 'Выберите модель',
'reply_markup' => new InlineKeyboard(...$this->prepareKeyboard($rows)),
];
}
// Вывод модели
// Просто печатаем её параметры с кнопками возврата
protected function getVehicle($id): ?array
{
if (!$vehicle = Vehicle::query()->find($id)) {
return null;
}
/** @var Vehicle $vehicle */
$rows = [
[
'text' => 'Другие модели ' . $vehicle->brand,
'callback_data' => implode('::', [$this->usage, 'getBrand', $vehicle->brand]),
],
['text' => 'Обратно в каталог', 'callback_data' => $this->usage],
];
return [
'text' => print_r($vehicle->toArray(), true),
'reply_markup' => new InlineKeyboard(...$this->prepareKeyboard($rows)),
];
}
protected function prepareKeyboard($rows): array
{
// Здесь функция по преобразованию простого плоского массива [ кнопка, кнопка, кнопка ] в более сложный
// [строка [ кнопка, кнопка], новая строка [кнопка], и т.д. ]
// в зависимости от количества этих кнопок
}
}
Итого - вся логика по работе с каталогом у нас в одном классе. Основной метод определяет, был ли это просто запрос, или нажата кнопка клавиатуры, и действует в зависимости от этого.
Все protected методы написаны так, чтобы их можно было использовать в обоих случая. Получается довольно удобно и гибко, можно добавить еще много разных действий без особых проблем.
Заключение
В логике работы с указаним действия на кнопках с параметрами есть 2 момента, которые лично мне очень нравится.
Во-первых, все нужные параметры у нас прописаны в кнопке, поэтому боту не нужно запоминать в каком разделе беседы сейчас находится юзер. Просматривает ли он все бренды, или выводит список моделей одного из них. Нажатая кнопка всегда вызовет что надо.
И во-вторых, при нажатии кнопки мы редактируем одно и то же сообщение, что превращает чат в какой-то интерактивный интерфейс для работы. Даже если вы ушли в своей беседе в другой раздел, при нажатии на кнопки в старом сообщении будет обновлено именно оно, на своём месте.
Получется, что с каталогом можно работать как-бы в отдельном окне. Не знаю, кому как, но мне такое кажется очень продвинутым для чата!
Само-собой, для нормальной работы мне пришлось перенести бота на сервер и сделать работу через Webhook вместо консольного скрипта. Вот вам домашнее задание - найдите этот контроллер, и путь к нему, ответ пишите в комментариях.
Если хотите покликать, то адрес прежний - https://t.me/VespExampleBot
Полный код изменений как обычно в репозитории, продолжение следует.
Увы, но нет, не следует.
Надеюсь, что прочитанной информации вам будет достаточно, чтобы дальше развивать логику чата.
Комментарии (8)
[email protected]Николай Каленников
03.03.2022 13:26
Завораживает) Вроде, этот контроллер
/core/src/Controllers/Web/Webhook.php
bezumkinВасилий Наумкин
03.03.2022 14:00
Верно! А какой для обращения к нему, и какие разрешены протоколы?
https://service.ru/api/дальше/что?
[email protected]Николай Каленников
03.03.2022 14:06
POST на адрес:
https://service.ru/api/web/webhook
bezumkinВасилий Наумкин
03.03.2022 14:11
Так и есть, молодец!
ElectricaМихаил
03.03.2022 13:56
Круто! Спасибо за пример.
Сергей Лелеко
04.03.2022 05:27
А что это? ...$this->prepareKeyboard($rows) клонирование как в vue ?
bezumkinВасилий Наумкин
04.03.2022 05:34
Это передача переменного количества аргументов в функцию из массива.
https://www.php.net/manual/ru/functions.arguments.php#functions.variable-arg-list
Сергей Лелеко
04.03.2022 06:12
О как! не знал! спасибо
ЕвгенийК
09.04.2022 03:35
Это хорошо, что такая возможность есть и может быть использована. А то тенденция, мания, что-то в по...
begoodco1
07.04.2022 05:49
Зарегистрировался чтобы выразить благодарность за доступное и подробное описание процесса. Была возм...
bezumkin
Василий Наумкин
18.03.2022 12:35
Авторизация есть из коробки, для входа в базовую админку. Можно установить через composer и собрать ...
bezumkin
Василий Наумкин
10.03.2022 12:08
Ну, я имел в виду, что по закону можно =) А в реальности с валютой очевидные проблемы.
Сергей Лелеко
04.03.2022 06:12
О как! не знал! спасибо
bezumkin
Василий Наумкин
01.03.2022 15:32
Я делал одного бота на botman/botman, но из-за своей универсальности конкретно с Телеграм на нём раб...
bezumkin
Василий Наумкин
25.02.2022 09:22
P.S. Кажется цитаты у тебя никак не стилизуются в комментариях... Спасибо, поправил!
Electrica
Михаил
08.02.2022 11:19
Работает!
Алексей
09.01.2019 10:55
Насыщенный год ) От души поздравляю с ДР! Счастья, успехов и семейного благополучия! Жаль лимит заме...
septa rose
28.05.2018 22:16
hmmm, keren abis
|
{
"url": "https://bezumkin.ru/lessons/vesp-telegram/3069",
"source_domain": "bezumkin.ru",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "131756",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LAFUVDM22JNT6JE66NKTPFENNIVIDT2X",
"WARC-Concurrent-To": "<urn:uuid:fcf7b725-6e3c-4121-bb8e-7b12ee8b56c5>",
"WARC-Date": "2022-05-18T07:19:39Z",
"WARC-IP-Address": "130.193.45.175",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DH6PVRFS5ZIG3DCB6BMJNR3TX5A5J4MH",
"WARC-Record-ID": "<urn:uuid:9e6ebfcc-056b-4b10-b1ab-1fd123662056>",
"WARC-Target-URI": "https://bezumkin.ru/lessons/vesp-telegram/3069",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:49336e8d-1832-4c0a-ace4-d306d73252af>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-28\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,
17,
18,
157,
158,
348,
349,
441,
442,
618,
619,
654,
655,
779,
780,
796,
814,
827,
842,
865,
882,
899,
918,
950,
951,
1002,
1003,
1023,
1040,
1041,
1125,
1126,
1135,
1170,
1171,
1256,
1257,
1263,
1264,
1306,
1335,
1336,
1375,
1377,
1406,
1437,
1443,
1491,
1570,
1597,
1654,
1701,
1760,
1823,
1886,
1950,
2012,
2092,
2168,
2236,
2248,
2254,
2255,
2290,
2323,
2329,
2370,
2376,
2378,
2379,
2465,
2466,
2493,
2494,
2615,
2616,
2691,
2692,
2698,
2699,
2721,
2722,
2762,
2763,
2767,
2817,
2838,
2865,
2892,
2918,
2944,
2968,
2992,
3021,
3053,
3079,
3083,
3111,
3113,
3166,
3227,
3283,
3308,
3340,
3368,
3375,
3377,
3378,
3449,
3450,
3604,
3605,
3611,
3612,
3636,
3655,
3683,
3712,
3713,
3749,
3751,
3783,
3789,
3821,
3857,
3896,
3946,
3947,
3987,
4027,
4052,
4101,
4150,
4197,
4248,
4301,
4354,
4411,
4478,
4493,
4494,
4560,
4608,
4618,
4624,
4626,
4627,
4688,
4689,
4729,
4730,
4870,
4871,
4899,
4900,
4986,
4987,
5002,
5003,
5169,
5170,
5281,
5282,
5551,
5552,
5693,
5694,
5746,
5747,
5753,
5754,
5778,
5779,
5828,
5861,
5862,
5963,
5965,
6011,
6017,
6075,
6122,
6173,
6217,
6218,
6319,
6378,
6424,
6467,
6506,
6553,
6627,
6709,
6723,
6733,
6734,
6804,
6868,
6906,
6961,
6990,
7002,
7008,
7010,
7011,
7218,
7219,
7407,
7408,
7414,
7415,
7439,
7440,
7464,
7510,
7559,
7608,
7649,
7682,
7716,
7744,
7745,
7788,
7790,
7825,
7884,
7921,
7922,
7998,
8004,
8053,
8155,
8180,
8186,
8187,
8188,
8231,
8277,
8283,
8327,
8398,
8451,
8499,
8500,
8595,
8668,
8743,
8785,
8828,
8893,
8936,
8990,
9028,
9029,
9080,
9119,
9203,
9272,
9340,
9341,
9399,
9447,
9507,
9521,
9522,
9616,
9658,
9717,
9775,
9828,
9844,
9854,
9855,
9945,
10004,
10010,
10011,
10049,
10091,
10097,
10127,
10162,
10198,
10229,
10260,
10340,
10364,
10425,
10454,
10479,
10480,
10580,
10600,
10638,
10662,
10696,
10779,
10841,
10927,
10942,
10952,
10953,
11044,
11108,
11125,
11165,
11249,
11260,
11266,
11267,
11321,
11368,
11374,
11411,
11470,
11498,
11523,
11524,
11542,
11633,
11709,
11720,
11757,
11806,
11873,
11897,
11964,
12058,
12073,
12083,
12084,
12101,
12142,
12226,
12237,
12243,
12244,
12264,
12320,
12367,
12373,
12428,
12453,
12463,
12464,
12501,
12519,
12533,
12595,
12690,
12705,
12783,
12794,
12795,
12812,
12870,
12954,
12965,
12971,
12972,
13025,
13031,
13143,
13213,
13264,
13270,
13272,
13273,
13455,
13456,
13637,
13638,
13649,
13650,
13761,
13762,
14013,
14014,
14286,
14287,
14422,
14423,
14650,
14651,
14721,
14722,
14790,
14791,
14816,
14817,
14911,
14912,
14928,
14965,
14982,
14983,
15020,
15021,
15059,
15083,
15100,
15101,
15167,
15168,
15203,
15240,
15257,
15258,
15273,
15274,
15309,
15333,
15350,
15351,
15372,
15373,
15389,
15406,
15407,
15433,
15434,
15448,
15465,
15466,
15535,
15536,
15560,
15577,
15578,
15647,
15648,
15730,
15731,
15745,
15762,
15763,
15787,
15788,
15797,
15814,
15918,
15928,
15945,
16049,
16058,
16074,
16091,
16195,
16204,
16220,
16237,
16324,
16338,
16355,
16379,
16388,
16404,
16421,
16525,
16534,
16550,
16567,
16652,
16662,
16669,
16686,
16696,
16704,
16721,
16825,
16836,
16853
],
"line_end_idx": [
17,
18,
157,
158,
348,
349,
441,
442,
618,
619,
654,
655,
779,
780,
796,
814,
827,
842,
865,
882,
899,
918,
950,
951,
1002,
1003,
1023,
1040,
1041,
1125,
1126,
1135,
1170,
1171,
1256,
1257,
1263,
1264,
1306,
1335,
1336,
1375,
1377,
1406,
1437,
1443,
1491,
1570,
1597,
1654,
1701,
1760,
1823,
1886,
1950,
2012,
2092,
2168,
2236,
2248,
2254,
2255,
2290,
2323,
2329,
2370,
2376,
2378,
2379,
2465,
2466,
2493,
2494,
2615,
2616,
2691,
2692,
2698,
2699,
2721,
2722,
2762,
2763,
2767,
2817,
2838,
2865,
2892,
2918,
2944,
2968,
2992,
3021,
3053,
3079,
3083,
3111,
3113,
3166,
3227,
3283,
3308,
3340,
3368,
3375,
3377,
3378,
3449,
3450,
3604,
3605,
3611,
3612,
3636,
3655,
3683,
3712,
3713,
3749,
3751,
3783,
3789,
3821,
3857,
3896,
3946,
3947,
3987,
4027,
4052,
4101,
4150,
4197,
4248,
4301,
4354,
4411,
4478,
4493,
4494,
4560,
4608,
4618,
4624,
4626,
4627,
4688,
4689,
4729,
4730,
4870,
4871,
4899,
4900,
4986,
4987,
5002,
5003,
5169,
5170,
5281,
5282,
5551,
5552,
5693,
5694,
5746,
5747,
5753,
5754,
5778,
5779,
5828,
5861,
5862,
5963,
5965,
6011,
6017,
6075,
6122,
6173,
6217,
6218,
6319,
6378,
6424,
6467,
6506,
6553,
6627,
6709,
6723,
6733,
6734,
6804,
6868,
6906,
6961,
6990,
7002,
7008,
7010,
7011,
7218,
7219,
7407,
7408,
7414,
7415,
7439,
7440,
7464,
7510,
7559,
7608,
7649,
7682,
7716,
7744,
7745,
7788,
7790,
7825,
7884,
7921,
7922,
7998,
8004,
8053,
8155,
8180,
8186,
8187,
8188,
8231,
8277,
8283,
8327,
8398,
8451,
8499,
8500,
8595,
8668,
8743,
8785,
8828,
8893,
8936,
8990,
9028,
9029,
9080,
9119,
9203,
9272,
9340,
9341,
9399,
9447,
9507,
9521,
9522,
9616,
9658,
9717,
9775,
9828,
9844,
9854,
9855,
9945,
10004,
10010,
10011,
10049,
10091,
10097,
10127,
10162,
10198,
10229,
10260,
10340,
10364,
10425,
10454,
10479,
10480,
10580,
10600,
10638,
10662,
10696,
10779,
10841,
10927,
10942,
10952,
10953,
11044,
11108,
11125,
11165,
11249,
11260,
11266,
11267,
11321,
11368,
11374,
11411,
11470,
11498,
11523,
11524,
11542,
11633,
11709,
11720,
11757,
11806,
11873,
11897,
11964,
12058,
12073,
12083,
12084,
12101,
12142,
12226,
12237,
12243,
12244,
12264,
12320,
12367,
12373,
12428,
12453,
12463,
12464,
12501,
12519,
12533,
12595,
12690,
12705,
12783,
12794,
12795,
12812,
12870,
12954,
12965,
12971,
12972,
13025,
13031,
13143,
13213,
13264,
13270,
13272,
13273,
13455,
13456,
13637,
13638,
13649,
13650,
13761,
13762,
14013,
14014,
14286,
14287,
14422,
14423,
14650,
14651,
14721,
14722,
14790,
14791,
14816,
14817,
14911,
14912,
14928,
14965,
14982,
14983,
15020,
15021,
15059,
15083,
15100,
15101,
15167,
15168,
15203,
15240,
15257,
15258,
15273,
15274,
15309,
15333,
15350,
15351,
15372,
15373,
15389,
15406,
15407,
15433,
15434,
15448,
15465,
15466,
15535,
15536,
15560,
15577,
15578,
15647,
15648,
15730,
15731,
15745,
15762,
15763,
15787,
15788,
15797,
15814,
15918,
15928,
15945,
16049,
16058,
16074,
16091,
16195,
16204,
16220,
16237,
16324,
16338,
16355,
16379,
16388,
16404,
16421,
16525,
16534,
16550,
16567,
16652,
16662,
16669,
16686,
16696,
16704,
16721,
16825,
16836,
16853,
16869
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 16869,
"ccnet_original_nlines": 471,
"rps_doc_curly_bracket": 0.002845460083335638,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.019445329904556274,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011157159693539143,
"rps_doc_frac_lines_end_with_ellipsis": 0.01059321966022253,
"rps_doc_frac_no_alph_words": 0.7810009717941284,
"rps_doc_frac_unique_words": 0.5209439396858215,
"rps_doc_mean_word_length": 6.703244686126709,
"rps_doc_num_sentences": 153,
"rps_doc_symbol_to_word_ratio": 0.004144090227782726,
"rps_doc_unigram_entropy": 6.348151683807373,
"rps_doc_word_count": 1695,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.00739305978640914,
"rps_doc_frac_chars_dupe_6grams": 0.00739305978640914,
"rps_doc_frac_chars_dupe_7grams": 0.00739305978640914,
"rps_doc_frac_chars_dupe_8grams": 0.00739305978640914,
"rps_doc_frac_chars_dupe_9grams": 0.00739305978640914,
"rps_doc_frac_chars_top_2gram": 0.00739305978640914,
"rps_doc_frac_chars_top_3gram": 0.008097169920802116,
"rps_doc_frac_chars_top_4gram": 0.004576660227030516,
"rps_doc_books_importance": -1372.8878173828125,
"rps_doc_books_importance_length_correction": -1372.8878173828125,
"rps_doc_openwebtext_importance": -835.4786987304688,
"rps_doc_openwebtext_importance_length_correction": -835.4786987304688,
"rps_doc_wikipedia_importance": -401.5168762207031,
"rps_doc_wikipedia_importance_length_correction": -401.5168762207031
},
"fasttext": {
"dclm": 0.933711051940918,
"english": 0.000881300016772002,
"fineweb_edu_approx": 3.136383533477783,
"eai_general_math": 0.0000479199989058543,
"eai_open_web_math": 0.11391221731901169,
"eai_web_code": 0.7721332907676697
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "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
|
-970,721,557,683,529,900 |
SharePoint Stack Exchange is a question and answer site for SharePoint enthusiasts. Join them; it only takes a minute:
Sign up
Here's how it works:
1. Anybody can ask a question
2. Anybody can answer
3. The best answers are voted up and rise to the top
I think my question is general enough to not be version-specific, but if not, we're running Foundation 2010 with minimal development (SPD, Vis Studio, etc.) capability.
I have a 3500-document repository that recently got converted to a SharePoint library. Our metadata is almost non-existent and we're relying on full text document searches to find content. Since keywords were not part of the initial repository, they were created from scratch in a spreadsheet a few years ago. Col 1 is the document name, Col 2 is a column delimited list of keywords. This is the data I'm trying to populate into SharePoint's metadata columns.
Here's where I'm having a hard time wrapping my head around things.
Let's say that an Excel record is this: document_foo.doc; keyword_foo1,keyword_foo2,...,keyword_foo8. I plan to cut-and-paste the records from Excel to a Datasheet view of my library.
My question is this: if I paste a list (keyword_foo1,keyword_foo2,...,keyword_foo8) into an empty metadata column does that whole string of 8 keywords become the sort value? or would Sharepoint recognize keyword_foo1 as a seaparate and distinct keyword from keyword_foo2? That's out intention, but I suspect it won't.
But if I create ten distinct keyword columns, and reformat the single Excel keyword field into up to ten separate keywords in ten separate columns, I end up potentially missing something if I search in keyword_foo2 and the value lives in keyword_foo4. With that, I run into the potential of having a list of thousands of keywords from which users get to choose when creating a new document--that seems needlessly unweildy to me.
In a perfect world, I'd like to see multiple choice check boxes created from the keyword list; but then I'd have to add a carriage return instead of the spaces in the filename, right? And I'd have to figure out a way to prevent a list of a few thousand keywords from accumulating over time.
I'm a little too close to the project too see it clearly. Does anyone have any suggestions or strategies for me?
share|improve this question
up vote 1 down vote accepted
If you were to use an enterprise key words column, and separate the existing keywords with a semicolon instead of a commar it would nicely separate them. However this would still be more editing than it sounds like you want to do...
share|improve this answer
Ah, but I can do a global replace in the Excel keyword column to replace "," with ";". 2 clicks, 2 keystrokes, another click. e viola--a properly formatted column to cut-n-paste. Is there a specific column type into which you'd recommend loading this data? – dwwilson66 Jan 29 '13 at 16:34
Follow instructions here: office.microsoft.com/en-us/sharepoint-help/… Using enterprise keywords rather than just adding a text metadata field means you can easily refine your searches later using the bar down the left hand side of the search results. – Charles Baker Jan 29 '13 at 16:38
AWESOME! I've been looking for this for a while. Just hoping that our admins have it enabled in our installation. But that's my issue.... – dwwilson66 Jan 29 '13 at 16:45
Cool :) Good luck. – Charles Baker Jan 29 '13 at 16:48
...aaaand buzzkill. Enterprise keywords not available in Foundation. :| Back to the ol' drawing board. – dwwilson66 Jan 29 '13 at 16:54
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://sharepoint.stackexchange.com/questions/58279/i-need-advice-on-a-keyword-strategy/58296",
"source_domain": "sharepoint.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "77332",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6GSAWBJZURDUTT4ICOWZWH4GEXYD3Q63",
"WARC-Concurrent-To": "<urn:uuid:6c9ba8b2-59a7-4584-8f62-b4381549fad1>",
"WARC-Date": "2016-07-25T16:00:24Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:V6WF7W2IPNMLRY6G77E5DY4S2HU4QVMF",
"WARC-Record-ID": "<urn:uuid:8a0574ab-b78f-4bf6-a537-b4f5fecc322f>",
"WARC-Target-URI": "http://sharepoint.stackexchange.com/questions/58279/i-need-advice-on-a-keyword-strategy/58296",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:42bcc72e-cf88-469a-804b-9db9fac73859>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-27-174.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-30\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for July 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
119,
120,
128,
149,
181,
205,
260,
261,
430,
431,
891,
892,
960,
961,
1145,
1146,
1464,
1465,
1894,
1895,
2186,
2187,
2300,
2301,
2329,
2358,
2359,
2592,
2593,
2619,
2624,
2914,
2919,
3207,
3212,
3383,
3388,
3443,
3448,
3584,
3585,
3597,
3598,
3600,
3608,
3609,
3687,
3688
],
"line_end_idx": [
119,
120,
128,
149,
181,
205,
260,
261,
430,
431,
891,
892,
960,
961,
1145,
1146,
1464,
1465,
1894,
1895,
2186,
2187,
2300,
2301,
2329,
2358,
2359,
2592,
2593,
2619,
2624,
2914,
2919,
3207,
3212,
3383,
3388,
3443,
3448,
3584,
3585,
3597,
3598,
3600,
3608,
3609,
3687,
3688,
3778
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3778,
"ccnet_original_nlines": 48,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39294710755348206,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023929469287395477,
"rps_doc_frac_lines_end_with_ellipsis": 0.020408159121870995,
"rps_doc_frac_no_alph_words": 0.20277078449726105,
"rps_doc_frac_unique_words": 0.5,
"rps_doc_mean_word_length": 4.713140964508057,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0.007556680124253035,
"rps_doc_unigram_entropy": 5.3029303550720215,
"rps_doc_word_count": 624,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0353621207177639,
"rps_doc_frac_chars_dupe_6grams": 0.0353621207177639,
"rps_doc_frac_chars_dupe_7grams": 0.014960899949073792,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.008500509895384312,
"rps_doc_frac_chars_top_3gram": 0.011900709941983223,
"rps_doc_frac_chars_top_4gram": 0.015300920233130455,
"rps_doc_books_importance": -269.8851623535156,
"rps_doc_books_importance_length_correction": -269.8851623535156,
"rps_doc_openwebtext_importance": -187.66554260253906,
"rps_doc_openwebtext_importance_length_correction": -187.66554260253906,
"rps_doc_wikipedia_importance": -137.86619567871094,
"rps_doc_wikipedia_importance_length_correction": -137.86619567871094
},
"fasttext": {
"dclm": 0.5997531414031982,
"english": 0.8929874897003174,
"fineweb_edu_approx": 1.3896559476852417,
"eai_general_math": 0.011128840036690235,
"eai_open_web_math": 0.15687942504882812,
"eai_web_code": 0.005330979824066162
}
}
|
{
"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.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,339,539,717,534,609,000 |
Java-Gaming.org
Featured games (79)
games approved by the League of Dukes
Games in Showcase (497)
games submitted by our members
Games in WIP (421)
games currently in development
News: Read the Java Gaming Resources, or peek at the official Java tutorials
Home Help Search Login Register
Pages: [1] 2
ignore | Print
storing limited range floating point numbers efficiently? (Read 4325 times)
0 Members and 1 Guest are viewing this topic.
Offline moogie
JGO Knight
Medals: 8
Projects: 5
Java games rock!
« Posted 2008-04-01 07:09:43 »
I want to store a set of floating points which have a maximum of 8 digits, sign and decimal point.
i.e
values between -99999999.0 and 99999999.0
e.g.
these would be valid
-78.2234
6733.2225
these would be invalid and truncated
224155.33366 tunc to 224155.33
-52.436627882 tunc to -52.436629
My current thought will only save a few bytes:
write sign (1 bit)
write decimal point position (3bit)
write digits (variable: 24 - 32 bits) digits 0-6 = 3 bits, digits 7-9 = 4 bits
so a number would be between 28 and 36 bits which is very similar to that of a normal float...
I might be able to get away with six digit values, however that only brings the bits needed to between 22 and 28bits which is not a large saving.
Anyone have any idea of a better way to store such values?
Offline Riven
« League of Dukes »
JGO Overlord
Medals: 528
Projects: 4
Hand over your head.
« Reply #1 - Posted 2008-04-01 07:48:01 »
That are 1799999991 unique values. (99999999*2+1)*9, as the decimal can be at 9 places...
This is like 31 bits, so I'd just use ints.
int encoded = ...;
double decoded = (val/9 - 99999999) / Math.pow(10, val%9)
or something like that.. oh, and you should cache the results of Math.pow in a double[9] ofcourse.
Hi, appreciate more people! Σ ♥ = ¾
Learn how to award medals... and work your way up the social rankings
Offline moogie
JGO Knight
Medals: 8
Projects: 5
Java games rock!
« Reply #2 - Posted 2008-04-01 10:04:36 »
I like your thinking.
If it turns out i can use fewer digits then your idea should give some savings... i.e.
for 6 digits the range is from -999999.0 to 999999.0 which should give 13999993 values and able to be put in 24bits
Games published by our own members! Check 'em out!
Legends of Yore - The Casual Retro Roguelike
Offline moogie
JGO Knight
Medals: 8
Projects: 5
Java games rock!
« Reply #3 - Posted 2008-04-01 10:41:30 »
I am a little lost at how you are proposing to convert the input floating point to an integer represenation? I am trying to reverse engineer it from your decoding formula but with little avail..
Offline Markus_Persson
JGO Wizard
Medals: 12
Projects: 19
Mojang Specifications
« Reply #4 - Posted 2008-04-01 14:24:43 »
I just have to say, elegant solution, Riven! Cheesy
Using some Math(tm), I figured out there was space for an exponent of up to 21, still fitting it all in 32 bits, allowing for silly small numbers and silly high numbers.
Here's a quick implementation: (the exponent is offset by 7 to allow for negative exponents)
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
public static final int EXPONENT_OFFSET = 7;
private static int doubleToInt(double in)
{
if (in==0) return 0;
if (in==Double.POSITIVE_INFINITY) return Integer.MAX_VALUE;
if (in==Double.NEGATIVE_INFINITY) return Integer.MIN_VALUE;
int sign=1;
if (in<0)
{
sign = -1;
in = -in;
}
// Horrible exponent counting ahead, at O(log n)
int exponent = EXPONENT_OFFSET;
for (;in<1.0; in*=10) exponent--;
for (;in>=10.0; in/=10) exponent++;
if (exponent<0) return 0; // Number is too close to zero, return 0.
if (exponent>=21) return sign==1?Integer.MAX_VALUE:Integer.MIN_VALUE; // Number is too large, pretend it's infinitely large.
int digits = (int)(in*10000000);
int out = digits*21+exponent;
return out*sign;
}
private static double intToDouble(int in)
{
if (in==Integer.MAX_VALUE) return Double.POSITIVE_INFINITY;
if (in==Integer.MIN_VALUE) return Double.NEGATIVE_INFINITY;
if (in==0) return 0;
int sign=1;
if (in<0)
{
sign = -1;
in = -in;
}
int exponent = in%21;
int digits = in/21;
double value = digits/10000000.0;
return value*Math.pow(10, exponent-EXPONENT_OFFSET)*sign;
}
Test code:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
public static void test(double in)
{
int encoded = doubleToInt(in);
double out = intToDouble(encoded);
System.out.println(in + " -> " + out);
}
public static void main(String[] args)
{
test(1);
test(0);
test(-99999999.0);
test(99999999.0);
test(-0.00000099999999);
test(0.00000099999999);
test(-99999999000000.0);
test(99999999000000.0);
}
Play Minecraft!
Offline moogie
JGO Knight
Medals: 8
Projects: 5
Java games rock!
« Reply #5 - Posted 2008-04-01 15:00:48 »
nice work Markus!
While driving home i had thought more on how to represent a floating point number as an integer and i have come up with this: (untested yet as i need to get some sleep Tongue )
for simplicity to demonstate the algorith i am going to encode a floating point number which can consist of 4 digits + sign + decimal point...
to encode:
float input =33.12F;
int count=4;
int temp=Math.abs((int) input);
while (temp>0)
{
temp>>>1;
count--;
}
int output=((int) (input*count)+9999)+(9999*2+1)*count;
to decode:
int input = previous output
int count = input/((9999*2+1);
int digits = input%(9999*2+1);
float output = ((float) (digits-9999))/ Math.pow(10,count);
Offline Markus_Persson
JGO Wizard
Medals: 12
Projects: 19
Mojang Specifications
« Reply #6 - Posted 2008-04-01 15:46:09 »
You might want to read this. That's how pretty much everyone stores floating point numbers these days.
Play Minecraft!
Offline Riven
« League of Dukes »
JGO Overlord
Medals: 528
Projects: 4
Hand over your head.
« Reply #7 - Posted 2008-04-02 00:14:09 »
I am a little lost at how you are proposing to convert the input floating point to an integer represenation? I am trying to reverse engineer it from your decoding formula but with little avail..
I'll explain a bit:
there are N possible values, with 9 decimal positions, so there are N*9 combinations.
there are M positive values in N, where M = (N-1)/2
when we have a value N and we multiply it by 9, we have the result R
1
double decoded = (R/9 - M) / Math.pow(10, R%9)
now the question is, how to encode a value into R...
my first inclination is:
1
2
3
4
5
6
7
8
9
10
11
double value = 567.4321;
int decimals = (9-1)-(int)Math.log10(value); // 8-3 = 5 decimal places even if we use only 4
int asDigitsInM = (int)Math.round(value*Math.pow(10, decimals)); // 56743210 out of M
int asDigitsInN = asDigitsInM + M; // 56743210 + M
int encoded = asDigitsInN * 9 + decimals; // (56743210 + M) * 9 + {0..8}
// in short:
double value = 567.4321;
int d = (9-1)-(int)Math.log10(value);
int encoded = ((int)Math.round(value*Math.pow(10, d)) + M) * 9 + d;
if you have 3 decimals, and you decode it, you will divide it by pow(10, 3) = 1000, which makes sense, so I guess it's reverse engineered...? Smiley
anyway, this is all just writing it without checking, with LOTs of room to optimize, so give it a try!
I just have to say, elegant solution, Riven! Cheesy
Using some Math(tm),
.... ..... ................. ............
You always gotta steal the show, don't you? Smiley
Hi, appreciate more people! Σ ♥ = ¾
Learn how to award medals... and work your way up the social rankings
Offline DzzD
« Reply #8 - Posted 2008-04-02 01:43:57 »
what about ?
int Float.floatToRawIntBits(float value);
float Float.intBitsToFloat(int bits);
EDIT:
having a look in the Float class JavaDoc you can easily pick the Sign, Mantissa and exponent
Quote
Bit 31 (the bit that is selected by the mask 0x80000000) represents the sign of the floating-point number.
Bits 30-23 (the bits that are selected by the mask 0x7f800000) represent the exponent.
Bits 22-0 (the bits that are selected by the mask 0x007fffff) represent the significand (sometimes called the mantissa) of the floating-point number.
If the argument is positive infinity, the result is 0x7f800000.
If the argument is negative infinity, the result is 0xff800000.
Offline Riven
« League of Dukes »
JGO Overlord
Medals: 528
Projects: 4
Hand over your head.
« Reply #9 - Posted 2008-04-02 02:01:05 »
float doesn't have 8 significant/guaranteed digits.
Hi, appreciate more people! Σ ♥ = ¾
Learn how to award medals... and work your way up the social rankings
Games published by our own members! Check 'em out!
Legends of Yore - The Casual Retro Roguelike
Offline Riven
« League of Dukes »
JGO Overlord
Medals: 528
Projects: 4
Hand over your head.
« Reply #10 - Posted 2008-04-02 02:21:16 »
Turned out there were quite a few corner cases:
1
2
3
4
5
6
7
8
9
10
public static final int encodeSlow(double d)
{
int e = 8 - (int) Math.max(0, Math.ceil(Math.log10(Math.abs(d))));
return (int) ((Math.floor(d * Math.pow(10, e)) + 99999999L) * 9 + e);
}
public static final double decodeSlow(int i)
{
return (i / 9 - 99999999) / Math.pow(10, i % 9);
}
A version that is 18.5x (!!) faster:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
private static double[] pows = new double[] { 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000 };
public static final int encodeFast(double d)
{
int e = 0;
double pow = 0.1;
double abs_d = Math.abs(d);
while (abs_d >= (pow *= 10.0) && e++ < 8);
e = Math.max(0, 8 - e);
return (int) ((Math.floor(d * pows[e]) + 99999999L) * 9 + e);
}
public static final double decodeFast(int i)
{
return (i / 9 - 99999999) / pows[i % 9];
}
I pretty much tested all possible values.
Hi, appreciate more people! Σ ♥ = ¾
Learn how to award medals... and work your way up the social rankings
Offline DzzD
« Reply #11 - Posted 2008-04-02 02:24:45 »
Quote
float doesn't have 8 significant/guaranteed digits
yes that's right but that's dont seems to be the goal:
Quote
I like your thinking.
If it turns out i can use fewer digits then your idea should give some savings... i.e.
for 6 digits the range is from -999999.0 to 999999.0 which should give 13999993 values and able to be put in 24bits
I mean storing a float with less bits knowing Sign Mantissa and exponent is quite simple
let's say
M=M>>7; //M 23 to 15 bit
E=E>>4; //E 8 to 4 bits
S=S; // 1 to 1 bits
or any other combination...
12 bits saved in the previous sample, ofcourse reducing precision:
S 1 bits
E 4 bits
M 15 bits
and than a new float format that fit in 20bits, just an idea....
@moogie: I may have missunderstood Undecided, do you want to store Fixed Decimal or real Float ?
float ususally use Base 2 not 10 : F = S*M*2^E not S*M*10^E
Offline moogie
JGO Knight
Medals: 8
Projects: 5
Java games rock!
« Reply #12 - Posted 2008-04-02 07:58:31 »
Lol! i should have looked at this thread during the day!
I have made an algorithm based on your original post and does seem to be quite similar
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
public class IntFloat {
static public void main(String[] arg)
{
Random random=new Random(-1);
int j=5;
for (int i=0;i<50;i++)
{
float val=(float) (random.nextDouble()*(maxNum[j]*2)-maxNum[j])/10000;
for (int k=1;k<9;k++)
{
System.out.println("digits: "+k+ " bits needed: "+maskBitCount[k]+" rounding: false input: "+val +" -> "+decode(encode(val,k,false),k));
System.out.println("digits: "+k+ " bits needed: "+maskBitCount[k]+" rounding: true input: "+val +" -> "+decode(encode(val,k,true),k));
}
}
}
static final private int[] multiplier = {1,10,100,1000,10000,100000,1000000,10000000,100000000};
static final private int[] maxNum = {1,9,99,999,9999,99999,999999,9999999,99999999,999999999};
static final private int[] maskBitCount = {0,6,10,13,17,21,24,28,31};
static final private int[] mask={0,63,1023,8191,131071,2097151,16777215,268435455,2147483647};
static public int encode(float val,int digitsCount,boolean round)
{
int max=maxNum[digitsCount];
int count=digitsCount;
// test for outliers
if (val>max) return max*2;
if (val<-max) val=-max;
// get the integer component of the input value
int temp=Math.abs((int) val);
// count the decimal places
while (temp>0)
{
temp/=10;
count--;
}
if (count<0)
count=0;
if (round ) return (Math.round(val*multiplier[count])+max)+(max*2+1)*count;
return ((int) (val*multiplier[count])+max)+(max*2+1)*count;
}
static public float decode(int val,int digitsCount)
{
// get the maximum number able to be represented by the number of digits
final int max=maxNum[digitsCount];
// calculate the total possible number of numbers able to represented
final int temp=(max*2+1);
// extract the number of decimal places
int count = val/temp;
// extract the digits
int digits = val%temp;
return ((float)(digits-max))/multiplier[count];
}
Offline moogie
JGO Knight
Medals: 8
Projects: 5
Java games rock!
« Reply #13 - Posted 2008-04-02 07:59:34 »
with the results as follows:
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
digits: 1 rounding: false input: -4.6211014 -> -4.0 bits needed: 6
digits: 1 rounding: true input: -4.6211014 -> -5.0 bits needed: 6
digits: 2 rounding: false input: -4.6211014 -> -4.6 bits needed: 10
digits: 2 rounding: true input: -4.6211014 -> -4.6 bits needed: 10
digits: 3 rounding: false input: -4.6211014 -> -4.62 bits needed: 13
digits: 3 rounding: true input: -4.6211014 -> -4.62 bits needed: 13
digits: 4 rounding: false input: -4.6211014 -> -4.621 bits needed: 17
digits: 4 rounding: true input: -4.6211014 -> -4.621 bits needed: 17
digits: 5 rounding: false input: -4.6211014 -> -4.6211 bits needed: 21
digits: 5 rounding: true input: -4.6211014 -> -4.6211 bits needed: 21
digits: 6 rounding: false input: -4.6211014 -> -4.6211 bits needed: 24
digits: 6 rounding: true input: -4.6211014 -> -4.6211 bits needed: 24
digits: 7 rounding: false input: -4.6211014 -> -4.621101 bits needed: 28
digits: 7 rounding: true input: -4.6211014 -> -4.621101 bits needed: 28
digits: 8 rounding: false input: -4.6211014 -> -4.6211014 bits needed: 31
digits: 8 rounding: true input: -4.6211014 -> -4.6211014 bits needed: 31
[truncated to fit word limit]
digits: 1 rounding: false input: -2.8565629 -> -2.0 bits needed: 6
digits: 1 rounding: true input: -2.8565629 -> -3.0 bits needed: 6
digits: 2 rounding: false input: -2.8565629 -> -2.8 bits needed: 10
digits: 2 rounding: true input: -2.8565629 -> -2.9 bits needed: 10
digits: 3 rounding: false input: -2.8565629 -> -2.85 bits needed: 13
digits: 3 rounding: true input: -2.8565629 -> -2.86 bits needed: 13
digits: 4 rounding: false input: -2.8565629 -> -2.856 bits needed: 17
digits: 4 rounding: true input: -2.8565629 -> -2.857 bits needed: 17
digits: 5 rounding: false input: -2.8565629 -> -2.8565 bits needed: 21
digits: 5 rounding: true input: -2.8565629 -> -2.8566 bits needed: 21
digits: 6 rounding: false input: -2.8565629 -> -2.85656 bits needed: 24
digits: 6 rounding: true input: -2.8565629 -> -2.85656 bits needed: 24
digits: 7 rounding: false input: -2.8565629 -> -2.856562 bits needed: 28
digits: 7 rounding: true input: -2.8565629 -> -2.856563 bits needed: 28
digits: 8 rounding: false input: -2.8565629 -> -2.8565629 bits needed: 31
digits: 8 rounding: true input: -2.8565629 -> -2.8565629 bits needed: 31
Offline moogie
JGO Knight
Medals: 8
Projects: 5
Java games rock!
« Reply #14 - Posted 2008-04-02 08:05:26 »
what about ?
int Float.floatToRawIntBits(float value);
float Float.intBitsToFloat(int bits);
EDIT:
having a look in the Float class JavaDoc you can easily pick the Sign, Mantissa and exponent
interesting! i initally went to the Float class source code to see if i could use the source to make a smaller bit depth float but found that it was implemented as a native method Sad
I will investigate this option as it may be faster/ more robust than rolling my own Tongue
True, it does not gurantee 8 digits but it might actually better represent my data... I will have to compare both methods to see which introduces the least error.
Offline moogie
JGO Knight
Medals: 8
Projects: 5
Java games rock!
« Reply #15 - Posted 2008-04-02 08:11:38 »
@moogie: I may have missunderstood Undecided, do you want to store Fixed Decimal or real Float ?
Definitely not fixed decimal as the values can go between the full range.
Offline Markus_Persson
JGO Wizard
Medals: 12
Projects: 19
Mojang Specifications
« Reply #16 - Posted 2008-04-02 09:02:01 »
You always gotta steal the show, don't you? Smiley
Pardon, that wasn't my intent. I thought you had come up with a very elegant solution and went on to test it. =)
Play Minecraft!
Offline Riven
« League of Dukes »
JGO Overlord
Medals: 528
Projects: 4
Hand over your head.
« Reply #17 - Posted 2008-04-02 10:26:04 »
Pardon, that wasn't my intent. I thought you had come up with a very elegant solution and went on to test it. =)
No prob, I took it as a compliment! Wink
It was simply to be expected you would come up with something (better) with lots of bit-shifts. Smiley
Hi, appreciate more people! Σ ♥ = ¾
Learn how to award medals... and work your way up the social rankings
Offline moogie
JGO Knight
Medals: 8
Projects: 5
Java games rock!
« Reply #18 - Posted 2008-04-03 02:31:24 »
I have made a specialised version of the method i created which is purely for 8 digit (or less) numbers... numbers higher than 99999999 will be set to 99999999 and numbers below -99999999 will be set to -99999999.
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
public class MoogieIntFloat {
static final private int[] multiplier = {1,10,100,1000,10000,100000,1000000,10000000,100000000};
static public int encode8Digits(double val)
{
int count;
// // test for outliers
val=Math.max(val,-99999999);
val=Math.min(val,99999999);
double temp=Math.abs(val);
if (temp>9999999) count=0;
else if (temp>999999) count=1;
else if (temp>99999) count=2;
else if (temp>9999) count=3;
else if (temp>999) count=4;
else if (temp>99) count=5;
else if (temp>9) count=6;
else if (temp>=1) count=7;
else count=8;
return (int) (val*multiplier[count])+99999999+199999999*count;
}
static public double decode8Digits(int val)
{
return ((double)(val%199999999-99999999))/multiplier[val/199999999];
}
}
It is very fast as well! I have made a test to time this specialsed version using Riven's method as a comparision.
1
2
3
4
5
Averages:
Riven Avg encode time=391
Moogie Avg encode time=123
Riven Avg decode time=66
Moogie Avg decode time=65
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
import java.util.Random;
public class Tester {
static final int numbers=999999;
static final int VALUE2 = numbers;
static final int VALUE = VALUE2/2;
static public void main (String[] args)
{
Random random=new Random(-1);
final double[] inputValues=new double[numbers];
int[] outputValues=new int[numbers];
System.out.print("making values... ");
for (int i=0;i<numbers;i++)
{
inputValues[i]=random.nextDouble()*VALUE2-VALUE;
}
System.out.println("done");
long[] moogieEncodeTimes=new long[100];
long[] moogieDecodeTimes=new long[100];
long[] rivenEncodeTimes=new long[100];
long[] rivenDecodeTimes=new long[100];
for (int j=0;j<100;j++)
{
long startTime=System.currentTimeMillis();
for (int i=0;i<numbers;i++)
{
outputValues[i]=RivenIntFloat.encodeFast(inputValues[i]);
}
long endTime=System.currentTimeMillis();
rivenEncodeTimes[j]=(endTime-startTime);
endTime=System.currentTimeMillis();
System.out.println("Riven encode time=" +rivenEncodeTimes[j]);
startTime=System.currentTimeMillis();
for (int i=0;i<numbers;i++)
{
RivenIntFloat.decodeFast(outputValues[i]);
}
endTime=System.currentTimeMillis();
rivenDecodeTimes[j]=(endTime-startTime);
endTime=System.currentTimeMillis();
System.out.println("Riven decode time=" +rivenDecodeTimes[j]);
startTime=System.currentTimeMillis();
for (int i=0;i<numbers;i++)
{
outputValues[i]=MoogieIntFloat.encode8Digits(inputValues[i]);
}
endTime=System.currentTimeMillis();
moogieEncodeTimes[j]=(endTime-startTime);
System.out.println("Moogie encode time=" +moogieEncodeTimes[j]);
startTime=System.currentTimeMillis();
for (int i=0;i<numbers;i++)
{
MoogieIntFloat.decode8Digits(outputValues[i]);
}
endTime=System.currentTimeMillis();
moogieDecodeTimes[j]=(endTime-startTime);
endTime=System.currentTimeMillis();
System.out.println("Moogie decode time=" +moogieDecodeTimes[j]);
}
System.out.println("Averages:");
long temp=0;
for (int i=0;i<100;i++)
{
temp+=rivenEncodeTimes[i];
}
System.out.println("Riven Avg encode time=" +temp/100);
temp=0;
for (int i=0;i<100;i++)
{
temp+=moogieEncodeTimes[i];
}
System.out.println("Moogie Avg encode time=" +temp/100);
temp=0;
for (int i=0;i<100;i++)
{
temp+=rivenDecodeTimes[i];
}
System.out.println("Riven Avg decode time=" +temp/100);
temp=0;
for (int i=0;i<100;i++)
{
temp+=moogieDecodeTimes[i];
}
System.out.println("Moogie Avg decode time=" +temp/100);
}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
public class RivenIntFloat {
private static double[] pows = new double[] { 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000 };
public static final int encodeFast(double d)
{
int e = 0;
double pow = 0.1;
double abs_d = Math.abs(d);
while (abs_d >= (pow *= 10.0) && e++ < 8);
e = Math.max(0, 8 - e);
return (int) ((Math.floor(d * pows[e]) + 99999999L) * 9 + e);
}
public static final double decodeFast(int i)
{
return (i / 9 - 99999999) / pows[i % 9];
}
}
Offline timfoden
Junior Member
Projects: 2
« Reply #19 - Posted 2008-04-03 17:49:38 »
Generally, shifts and mults are quicker than divides... so try this one:
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
class TimfodenIntFloat
{
private static double[] muls = new double[]
{
1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000
};
private static double[] divs = new double[]
{
1, 0.1, 0.01, 0.001, 0.0001, 0.00001, 0.000001, 0.0000001, 0.00000001,
};
public static final int encodeFast( double d )
{
// restrict range of d.
d = d < -99999999 ? -99999999 :
d > 99999999 ? 99999999 : d;
// find exponent.
double abs_d = Math.abs(d);
// double abs_d = d < 0 ? -d : d;
int e = 8;
if( abs_d >= 10000000 ) e = 0;
else if( abs_d >= 1000000 ) e = 1;
else if( abs_d >= 100000 ) e = 2;
else if( abs_d >= 10000 ) e = 3;
else if( abs_d >= 1000 ) e = 4;
else if( abs_d >= 100 ) e = 5;
else if( abs_d >= 10 ) e = 6;
else if( abs_d >= 1 ) e = 7;
// encode.
return (int)(d * muls[e]) + 0x08000000 + (e << 28);
}
public static final double decodeFast( int i )
{
int e = (i >> 28) & 0x0F;
int m = i & 0x0FFFFFFF - 0x08000000;
return m * divs[e];
}
}
And have a quick think about how (d > 9) != (d >= 10) for real numbers! Smiley
(and thus how the exponent would be effected.)
Cheers, Tim.
Try Pipe Extreme -- can you get to the end of the pipe?
Offline moogie
JGO Knight
Medals: 8
Projects: 5
Java games rock!
« Reply #20 - Posted 2008-04-03 23:41:38 »
impressive! your solution easily out performs both of ours Smiley
oops you are correct, it was a relic of a previous version of the algorithm which compared an int version of the input value instead of a real value.
Offline ddyer
Junior Member
Medals: 2
« Reply #21 - Posted 2008-04-04 08:56:41 »
I think you need to back up and explain why you think you can, or should, invent a more efficient
way to store floats than the native float type. Some very smart people designed the IEEE floating
point representation.
Offline moogie
JGO Knight
Medals: 8
Projects: 5
Java games rock!
« Reply #22 - Posted 2008-04-06 01:27:19 »
One should always be thinking of better solutions to problems! be that as it may, i am not attempting to make a "better" float, rather i have specific requirements which storing as a native float is not a good fit.
1. the number has a fixed maximum number of digits. e.g. 6
2. the number needs to be represented with as few bits as possible.
3. the encoded number should represent the actual number as close as possible.
3. the number has a maximum number derived from the maximum number of digits... e.g. for 6 digits, the max number is 999999.
3. likewise, the number has a minimum number derived from the maximum number of digits... e.g. for 8 digits, the minnumber is -999999.
4. the precision of the number is determined by the number of digits used in the "integer" part of the number with the remaining digits are used to represent the "fractional" part of the number.. e.g. representing the floating point number 812.633445: it uses 3 digits for the integer part leaving 3 digits for the fractional part giving the number 812.633
Offline DzzD
« Reply #23 - Posted 2008-04-06 11:41:46 »
how ok, I better understand your needing now
Offline ddyer
Junior Member
Medals: 2
« Reply #24 - Posted 2008-04-06 22:00:46 »
Ok, but where do these arcane specifications arise?
There can be reasons - for example in financial programs, you can never use normal floating point to
represent money, because rounding errors would cause your numbers to not add up properly. In this
case, it soulds like your specifications arise from a communications protocol - ie; a 6 digit field, where
the contstraints are on the representation, not on the underlying numbers.
I think you would do best by using regular floating point to represent your numbers, and meet your
constraints by controlling the conversion to and from floating point.
Offline moogie
JGO Knight
Medals: 8
Projects: 5
Java games rock!
« Reply #25 - Posted 2008-04-07 01:39:05 »
Quote
Ok, but where do these arcane specifications arise?
I have an idea for a video codec. I can control image quality / file size by reducing the accuracy of certian input "real" numbers.
Quote
I think you would do best by using regular floating point to represent your numbers, and meet your
constraints by controlling the conversion to and from floating point.
This is what is what all the methods so far do...
save to file
float --> integer representation --> bit stream --> file
read from file
file --> bit stream --> integer representation--> float
Offline ddyer
Junior Member
Medals: 2
« Reply #26 - Posted 2008-04-07 06:28:25 »
If this is a programming exercise "see how good a codec you can design" then of course go for it. But be aware
that real codecs are designed by very smart people with a lot of science and math at their disposal.. You are unlikely
to do better. There could be exceptions, if you have a particular video application in mind and you can apply domain
specific knowledge in ways that a general codec couldn't.
If you haven't already done so, read the specs for existing codecs such as JPEG and MP3.
It's really interesting reading.
On a similar note, if you read the IEEE floating point spec, it's fairly obvious how to use the design
but reduce the size of the exponent and matissa so they can only represent numbers in the ranges
you've specified. You'd end up with a few less bits - maybe 24 instead of 32 bits
Offline moogie
JGO Knight
Medals: 8
Projects: 5
Java games rock!
« Reply #27 - Posted 2008-04-07 06:57:17 »
i am not sure whether you are meaning to come across as a little insulting but one could read your replies that way.
Yes i do not think for a second that i will create a mpeg-4 or h264 killer codec Smiley i simply had an idea and want to implement it.
For my final year thesis I did develop a lossless codec which was specifically designed for animated video or similar which was able to out perform ( in terms of compression) the readily available codecs.
I wanted to try my hand at a lossless codec but trying a totally new approach. I do not think it will even get close to the compression from the current state of the art codecs but i have to start some where no?
I agree, the IEEE floating point spec can be readily converted to use less bits. I just thought that it would be a performance overhead to implement my on IEEE floating point class when another solution better suited to my problem could be deleveloped which would be faster.
Offline DzzD
« Reply #28 - Posted 2008-04-07 08:09:35 »
Quote
Yes i do not think for a second that i will create a mpeg-4 or h264 killer codec i simply had an idea and want to implement it
you should! it is always good to beleave in yourself Smiley at least I do Wink
@ddyer : you cant imagine all stuff that havn't been done yet , so doing computer research is always good, and is especially fun/interrisitng to do even when you fall with something useless. I love reinventing the whell as I think this is the only way to find real new stuff. My personal feeling about that is that reading paper and applying them dont bring to new stuff as papers "format" you. A good example is the DIVX format that have been created by someone that was playing to do a new codec Smiley lucky him Wink
Offline ddyer
Junior Member
Medals: 2
« Reply #29 - Posted 2008-04-07 08:42:48 »
My attitude is completely different if you are trying to solve a practical problem, or if you are just experimenting
to learn and see what develops. I'm all in favor of experimentation.
Pages: [1] 2
ignore | Print
You cannot reply to this message, because it is very, very old.
Add your game by posting it in the WIP section,
or publish it in Showcase.
The first screenshot will be displayed as a thumbnail.
wessles (43 views)
2013-11-28 23:37:31
wreed12345 (53 views)
2013-11-23 17:42:34
Damocles (101 views)
2013-11-15 12:23:59
StumpyStrust (80 views)
2013-11-14 14:42:32
StumpyStrust (75 views)
2013-11-14 14:41:43
EliwoodL (87 views)
2013-11-11 10:52:42
EliwoodL (82 views)
2013-11-11 10:52:33
EliwoodL (82 views)
2013-11-11 10:51:49
Samdy (100 views)
2013-11-07 10:06:49
Samdy (89 views)
2013-11-07 10:05:56
HotSpot Intrinsics
by Roquen
2013-11-25 17:44:34
How do I start Java Game Development?
by Nate
2013-11-18 18:35:15
Concurrency
by Roquen
2013-11-08 22:39:59
Concurrency
by Roquen
2013-11-08 20:43:31
Concurrency
by Roquen
2013-11-08 15:31:17
Concurrency
by Roquen
2013-11-08 15:20:42
Concurrency
by Roquen
2013-11-08 15:00:50
Resources for learning software design.
by lukasz1985
2013-10-17 16:25:24
Powered by MySQL Powered by PHP Powered by SMF 1.1.18 | SMF © 2013, Simple Machines | Managed by Enhanced Four Valid XHTML 1.0! Valid CSS!
|
{
"url": "http://www.java-gaming.org/index.php?topic=18428.msg144646",
"source_domain": "www.java-gaming.org",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "268402",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XXCU5LIXWWZRZGWLHV2XMIHSNTRQERJU",
"WARC-Concurrent-To": "<urn:uuid:ba80dd8a-befe-4181-bfa2-7d0f3724af13>",
"WARC-Date": "2013-12-07T06:48:13Z",
"WARC-IP-Address": "178.79.177.202",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:VE737YBJWGM56S4D4IU7AS453GPW3AXA",
"WARC-Record-ID": "<urn:uuid:7baa8326-fab1-4e31-a602-06d03c6cff6f>",
"WARC-Target-URI": "http://www.java-gaming.org/index.php?topic=18428.msg144646",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6633fa16-d8bf-4f65-88c4-3b9ded8f0509>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 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,
16,
36,
74,
98,
129,
148,
179,
256,
258,
307,
320,
341,
420,
466,
481,
482,
493,
494,
495,
505,
517,
518,
519,
536,
537,
538,
569,
570,
669,
670,
674,
716,
717,
722,
723,
744,
754,
764,
765,
802,
803,
834,
867,
868,
915,
916,
935,
971,
1052,
1053,
1148,
1149,
1295,
1296,
1356,
1357,
1371,
1391,
1392,
1405,
1406,
1407,
1419,
1431,
1432,
1433,
1454,
1455,
1456,
1498,
1499,
1590,
1591,
1635,
1636,
1655,
1713,
1714,
1813,
1814,
1815,
1816,
1852,
1922,
1937,
1938,
1949,
1950,
1951,
1961,
1973,
1974,
1975,
1992,
1993,
1994,
2036,
2037,
2059,
2060,
2147,
2148,
2264,
2265,
2266,
2317,
2362,
2377,
2378,
2389,
2390,
2391,
2401,
2413,
2414,
2415,
2432,
2433,
2434,
2476,
2477,
2672,
2695,
2696,
2707,
2708,
2709,
2720,
2733,
2734,
2735,
2757,
2758,
2759,
2801,
2802,
2855,
2856,
3026,
3119,
3120,
3124,
3128,
3132,
3136,
3140,
3144,
3148,
3152,
3156,
3161,
3166,
3171,
3176,
3181,
3186,
3191,
3196,
3201,
3206,
3211,
3216,
3221,
3226,
3231,
3236,
3241,
3246,
3251,
3256,
3261,
3266,
3271,
3276,
3281,
3286,
3291,
3296,
3301,
3306,
3311,
3316,
3321,
3326,
3331,
3336,
3341,
3346,
3394,
3398,
3443,
3448,
3475,
3541,
3607,
3608,
3626,
3642,
3650,
3670,
3689,
3697,
3703,
3758,
3795,
3835,
3877,
3883,
3957,
4087,
4093,
4132,
4168,
4191,
4196,
4197,
4242,
4247,
4313,
4379,
4406,
4407,
4425,
4441,
4449,
4469,
4488,
4496,
4502,
4530,
4556,
4596,
4602,
4666,
4671,
4672,
4673,
4684,
4685,
4689,
4693,
4697,
4701,
4705,
4709,
4713,
4717,
4721,
4726,
4731,
4736,
4741,
4746,
4751,
4756,
4761,
4766,
4771,
4776,
4814,
4819,
4856,
4897,
4942,
4947,
4948,
4990,
4995,
5010,
5025,
5031,
5056,
5080,
5081,
5112,
5142,
5173,
5203,
5208,
5209,
5225,
5240,
5241,
5252,
5253,
5254,
5264,
5276,
5277,
5278,
5295,
5296,
5297,
5339,
5340,
5358,
5359,
5536,
5537,
5680,
5681,
5682,
5693,
5694,
5715,
5716,
5729,
5730,
5762,
5777,
5779,
5789,
5798,
5800,
5801,
5857,
5858,
5859,
5870,
5871,
5899,
5900,
5931,
5962,
5963,
6023,
6024,
6025,
6026,
6049,
6050,
6061,
6062,
6063,
6074,
6087,
6088,
6089,
6111,
6112,
6113,
6155,
6156,
6259,
6260,
6276,
6290,
6310,
6311,
6324,
6325,
6326,
6338,
6350,
6351,
6352,
6373,
6374,
6375,
6417,
6418,
6613,
6614,
6615,
6635,
6636,
6722,
6774,
6843,
6844,
6848,
6895,
6896,
6897,
6898,
6899,
6952,
6953,
6978,
6982,
6986,
6990,
6994,
6998,
7002,
7006,
7010,
7014,
7019,
7024,
7049,
7145,
7233,
7286,
7359,
7360,
7373,
7374,
7399,
7440,
7508,
7509,
7510,
7511,
7512,
7661,
7662,
7663,
7766,
7767,
7768,
7769,
7822,
7823,
7844,
7845,
7888,
7889,
7940,
7941,
7942,
7943,
7979,
8049,
8062,
8104,
8105,
8118,
8119,
8161,
8199,
8200,
8206,
8299,
8300,
8306,
8413,
8500,
8650,
8714,
8778,
8779,
8793,
8813,
8814,
8827,
8828,
8829,
8841,
8853,
8854,
8855,
8876,
8877,
8878,
8920,
8921,
8973,
8974,
9010,
9080,
9131,
9176,
9190,
9210,
9211,
9224,
9225,
9226,
9238,
9250,
9251,
9252,
9273,
9274,
9275,
9318,
9319,
9367,
9368,
9372,
9376,
9380,
9384,
9388,
9392,
9396,
9400,
9404,
9409,
9457,
9462,
9535,
9611,
9616,
9617,
9665,
9670,
9725,
9730,
9731,
9732,
9733,
9770,
9771,
9775,
9779,
9783,
9787,
9791,
9795,
9799,
9803,
9807,
9812,
9817,
9822,
9827,
9832,
9837,
9842,
9956,
9957,
10005,
10010,
10027,
10051,
10085,
10134,
10164,
10232,
10237,
10238,
10286,
10291,
10338,
10343,
10344,
10345,
10387,
10388,
10424,
10494,
10507,
10550,
10551,
10557,
10608,
10609,
10664,
10665,
10671,
10693,
10694,
10781,
10782,
10898,
10899,
10988,
10998,
11023,
11047,
11067,
11068,
11096,
11097,
11164,
11173,
11182,
11192,
11193,
11258,
11259,
11356,
11357,
11417,
11418,
11433,
11434,
11445,
11446,
11447,
11457,
11469,
11470,
11471,
11488,
11489,
11490,
11533,
11534,
11591,
11592,
11679,
11680,
11684,
11688,
11692,
11696,
11700,
11704,
11708,
11712,
11716,
11721,
11726,
11731,
11736,
11741,
11746,
11751,
11756,
11761,
11766,
11771,
11776,
11781,
11786,
11791,
11796,
11801,
11806,
11811,
11816,
11821,
11826,
11831,
11836,
11841,
11846,
11851,
11856,
11861,
11866,
11871,
11876,
11881,
11886,
11891,
11896,
11901,
11906,
11911,
11916,
11921,
11926,
11931,
11936,
11941,
11946,
11951,
11956,
11961,
11966,
11971,
11976,
11981,
11986,
11991,
11996,
12001,
12006,
12011,
12035,
12036,
12077,
12082,
12118,
12124,
12139,
12168,
12176,
12256,
12266,
12297,
12308,
12457,
12604,
12615,
12625,
12633,
12638,
12642,
12742,
12840,
12913,
13011,
13012,
13081,
13086,
13121,
13150,
13151,
13178,
13210,
13240,
13241,
13247,
13301,
13336,
13342,
13376,
13396,
13404,
13423,
13441,
13449,
13455,
13474,
13492,
13493,
13575,
13641,
13646,
13650,
13705,
13710,
13789,
13829,
13835,
13911,
13942,
13943,
13989,
14016,
14022,
14050,
14078,
14079,
14133,
14138,
14139,
14140,
14155,
14156,
14167,
14168,
14169,
14179,
14191,
14192,
14193,
14210,
14211,
14212,
14255,
14256,
14285,
14286,
14290,
14294,
14298,
14302,
14306,
14310,
14314,
14318,
14322,
14327,
14332,
14337,
14342,
14347,
14352,
14357,
14362,
14367,
14372,
14377,
14382,
14387,
14392,
14397,
14402,
14407,
14412,
14417,
14422,
14427,
14432,
14437,
14442,
14447,
14452,
14519,
14585,
14653,
14720,
14789,
14857,
14927,
14996,
15067,
15137,
15208,
15278,
15351,
15423,
15497,
15570,
15571,
15601,
15602,
15669,
15735,
15803,
15870,
15939,
16007,
16077,
16146,
16217,
16287,
16359,
16430,
16503,
16575,
16649,
16722,
16737,
16738,
16749,
16750,
16751,
16761,
16773,
16774,
16775,
16792,
16793,
16794,
16837,
16838,
16851,
16852,
16894,
16932,
16933,
16939,
17032,
17034,
17035,
17219,
17220,
17311,
17312,
17475,
17490,
17491,
17502,
17503,
17504,
17514,
17526,
17527,
17528,
17545,
17546,
17547,
17590,
17591,
17688,
17689,
17763,
17786,
17787,
17798,
17799,
17800,
17811,
17824,
17825,
17826,
17848,
17849,
17850,
17893,
17894,
17945,
17946,
18059,
18060,
18076,
18090,
18110,
18111,
18124,
18125,
18126,
18138,
18150,
18151,
18152,
18173,
18174,
18175,
18218,
18219,
18332,
18333,
18374,
18375,
18478,
18479,
18515,
18585,
18600,
18601,
18612,
18613,
18614,
18624,
18636,
18637,
18638,
18655,
18656,
18657,
18700,
18701,
18915,
18916,
18920,
18924,
18928,
18932,
18936,
18940,
18944,
18948,
18952,
18957,
18962,
18967,
18972,
18977,
18982,
18987,
18992,
18997,
19002,
19007,
19012,
19017,
19022,
19027,
19032,
19037,
19042,
19047,
19052,
19057,
19087,
19088,
19188,
19235,
19240,
19257,
19258,
19287,
19321,
19355,
19361,
19394,
19427,
19464,
19500,
19535,
19569,
19602,
19634,
19667,
19687,
19688,
19757,
19762,
19766,
19813,
19818,
19893,
19898,
19900,
19901,
19902,
20017,
20018,
20022,
20026,
20030,
20034,
20038,
20048,
20074,
20101,
20126,
20152,
20153,
20154,
20158,
20162,
20166,
20170,
20174,
20178,
20182,
20186,
20190,
20195,
20200,
20205,
20210,
20215,
20220,
20225,
20230,
20235,
20240,
20245,
20250,
20255,
20260,
20265,
20270,
20275,
20280,
20285,
20290,
20295,
20300,
20305,
20310,
20315,
20320,
20325,
20330,
20335,
20340,
20345,
20350,
20355,
20360,
20365,
20370,
20375,
20380,
20385,
20390,
20395,
20400,
20405,
20410,
20415,
20420,
20425,
20430,
20435,
20440,
20445,
20450,
20455,
20460,
20465,
20470,
20475,
20480,
20485,
20490,
20495,
20500,
20505,
20510,
20515,
20520,
20525,
20530,
20535,
20540,
20545,
20550,
20555,
20560,
20565,
20570,
20575,
20580,
20585,
20590,
20595,
20600,
20605,
20610,
20615,
20620,
20625,
20630,
20635,
20640,
20646,
20652,
20658,
20664,
20670,
20676,
20682,
20688,
20694,
20700,
20706,
20712,
20718,
20724,
20730,
20736,
20742,
20748,
20754,
20760,
20766,
20791,
20792,
20814,
20815,
20851,
20889,
20927,
20970,
20975,
21011,
21017,
21071,
21114,
21120,
21165,
21199,
21207,
21265,
21273,
21307,
21313,
21359,
21405,
21411,
21456,
21501,
21507,
21537,
21545,
21597,
21634,
21645,
21715,
21726,
21736,
21786,
21796,
21846,
21891,
21901,
21973,
21983,
22030,
22067,
22078,
22133,
22144,
22154,
22199,
22209,
22259,
22304,
22314,
22386,
22396,
22443,
22480,
22491,
22565,
22576,
22586,
22631,
22641,
22692,
22702,
22712,
22786,
22796,
22843,
22880,
22891,
22950,
22961,
22971,
23016,
23026,
23077,
23122,
23132,
23206,
23214,
23220,
23259,
23265,
23284,
23314,
23322,
23358,
23366,
23372,
23434,
23440,
23454,
23484,
23492,
23529,
23537,
23543,
23606,
23607,
23621,
23651,
23659,
23695,
23703,
23709,
23771,
23777,
23791,
23821,
23829,
23866,
23874,
23880,
23949,
23955,
23956,
23961,
23965,
23967,
23968,
23969,
23973,
23977,
23981,
23985,
23989,
23993,
23997,
24001,
24005,
24010,
24015,
24020,
24025,
24030,
24035,
24040,
24045,
24050,
24079,
24195,
24196,
24247,
24255,
24275,
24302,
24339,
24391,
24424,
24495,
24503,
24504,
24555,
24563,
24613,
24621,
24623,
24624,
24641,
24642,
24656,
24657,
24658,
24670,
24671,
24672,
24673,
24716,
24717,
24790,
24791,
24795,
24799,
24803,
24807,
24811,
24815,
24819,
24823,
24827,
24832,
24837,
24842,
24847,
24852,
24857,
24862,
24867,
24872,
24877,
24882,
24887,
24892,
24897,
24902,
24907,
24912,
24917,
24922,
24927,
24932,
24937,
24942,
24947,
24952,
24957,
24962,
24967,
24972,
24977,
24982,
24987,
24992,
25015,
25017,
25064,
25069,
25137,
25143,
25147,
25194,
25199,
25276,
25282,
25283,
25333,
25338,
25368,
25405,
25445,
25446,
25470,
25503,
25542,
25558,
25600,
25642,
25684,
25726,
25768,
25810,
25852,
25894,
25895,
25912,
25969,
25974,
25978,
26028,
26033,
26065,
26108,
26134,
26139,
26141,
26142,
26143,
26223,
26270,
26271,
26284,
26285,
26341,
26356,
26357,
26368,
26369,
26370,
26380,
26392,
26393,
26394,
26411,
26412,
26413,
26456,
26457,
26523,
26524,
26674,
26675,
26689,
26690,
26704,
26705,
26706,
26716,
26717,
26718,
26719,
26762,
26763,
26861,
26960,
26982,
26997,
26998,
27009,
27010,
27011,
27021,
27033,
27034,
27035,
27052,
27053,
27054,
27097,
27098,
27313,
27314,
27373,
27442,
27521,
27646,
27781,
28138,
28139,
28152,
28195,
28196,
28241,
28242,
28256,
28257,
28271,
28272,
28273,
28283,
28284,
28285,
28286,
28329,
28330,
28331,
28384,
28385,
28486,
28585,
28692,
28767,
28768,
28867,
28937,
28938,
28953,
28954,
28965,
28966,
28967,
28977,
28989,
28990,
28991,
29008,
29009,
29010,
29053,
29054,
29060,
29113,
29114,
29246,
29247,
29253,
29352,
29422,
29423,
29473,
29474,
29487,
29488,
29545,
29546,
29561,
29562,
29618,
29619,
29620,
29621,
29622,
29623,
29637,
29638,
29652,
29653,
29654,
29664,
29665,
29666,
29667,
29710,
29711,
29823,
29942,
30060,
30118,
30119,
30209,
30242,
30243,
30346,
30443,
30526,
30541,
30542,
30553,
30554,
30555,
30565,
30577,
30578,
30579,
30596,
30597,
30598,
30641,
30642,
30759,
30760,
30896,
30897,
31102,
31103,
31315,
31316,
31591,
31592,
31605,
31648,
31649,
31655,
31784,
31863,
31864,
32384,
32385,
32399,
32400,
32414,
32415,
32416,
32426,
32427,
32428,
32429,
32472,
32473,
32590,
32662,
32675,
32696,
32698,
32700,
32764,
32765,
32767,
32768,
32816,
32843,
32844,
32899,
32900,
32919,
32939,
32940,
32962,
32982,
32983,
33004,
33024,
33025,
33049,
33069,
33070,
33094,
33114,
33115,
33135,
33155,
33156,
33176,
33196,
33197,
33217,
33237,
33238,
33256,
33276,
33277,
33294,
33314,
33333,
33343,
33363,
33364,
33402,
33410,
33430,
33431,
33443,
33453,
33473,
33474,
33486,
33496,
33516,
33517,
33529,
33539,
33559,
33560,
33572,
33582,
33602,
33603,
33615,
33625,
33645,
33646,
33686,
33700,
33720
],
"line_end_idx": [
16,
36,
74,
98,
129,
148,
179,
256,
258,
307,
320,
341,
420,
466,
481,
482,
493,
494,
495,
505,
517,
518,
519,
536,
537,
538,
569,
570,
669,
670,
674,
716,
717,
722,
723,
744,
754,
764,
765,
802,
803,
834,
867,
868,
915,
916,
935,
971,
1052,
1053,
1148,
1149,
1295,
1296,
1356,
1357,
1371,
1391,
1392,
1405,
1406,
1407,
1419,
1431,
1432,
1433,
1454,
1455,
1456,
1498,
1499,
1590,
1591,
1635,
1636,
1655,
1713,
1714,
1813,
1814,
1815,
1816,
1852,
1922,
1937,
1938,
1949,
1950,
1951,
1961,
1973,
1974,
1975,
1992,
1993,
1994,
2036,
2037,
2059,
2060,
2147,
2148,
2264,
2265,
2266,
2317,
2362,
2377,
2378,
2389,
2390,
2391,
2401,
2413,
2414,
2415,
2432,
2433,
2434,
2476,
2477,
2672,
2695,
2696,
2707,
2708,
2709,
2720,
2733,
2734,
2735,
2757,
2758,
2759,
2801,
2802,
2855,
2856,
3026,
3119,
3120,
3124,
3128,
3132,
3136,
3140,
3144,
3148,
3152,
3156,
3161,
3166,
3171,
3176,
3181,
3186,
3191,
3196,
3201,
3206,
3211,
3216,
3221,
3226,
3231,
3236,
3241,
3246,
3251,
3256,
3261,
3266,
3271,
3276,
3281,
3286,
3291,
3296,
3301,
3306,
3311,
3316,
3321,
3326,
3331,
3336,
3341,
3346,
3394,
3398,
3443,
3448,
3475,
3541,
3607,
3608,
3626,
3642,
3650,
3670,
3689,
3697,
3703,
3758,
3795,
3835,
3877,
3883,
3957,
4087,
4093,
4132,
4168,
4191,
4196,
4197,
4242,
4247,
4313,
4379,
4406,
4407,
4425,
4441,
4449,
4469,
4488,
4496,
4502,
4530,
4556,
4596,
4602,
4666,
4671,
4672,
4673,
4684,
4685,
4689,
4693,
4697,
4701,
4705,
4709,
4713,
4717,
4721,
4726,
4731,
4736,
4741,
4746,
4751,
4756,
4761,
4766,
4771,
4776,
4814,
4819,
4856,
4897,
4942,
4947,
4948,
4990,
4995,
5010,
5025,
5031,
5056,
5080,
5081,
5112,
5142,
5173,
5203,
5208,
5209,
5225,
5240,
5241,
5252,
5253,
5254,
5264,
5276,
5277,
5278,
5295,
5296,
5297,
5339,
5340,
5358,
5359,
5536,
5537,
5680,
5681,
5682,
5693,
5694,
5715,
5716,
5729,
5730,
5762,
5777,
5779,
5789,
5798,
5800,
5801,
5857,
5858,
5859,
5870,
5871,
5899,
5900,
5931,
5962,
5963,
6023,
6024,
6025,
6026,
6049,
6050,
6061,
6062,
6063,
6074,
6087,
6088,
6089,
6111,
6112,
6113,
6155,
6156,
6259,
6260,
6276,
6290,
6310,
6311,
6324,
6325,
6326,
6338,
6350,
6351,
6352,
6373,
6374,
6375,
6417,
6418,
6613,
6614,
6615,
6635,
6636,
6722,
6774,
6843,
6844,
6848,
6895,
6896,
6897,
6898,
6899,
6952,
6953,
6978,
6982,
6986,
6990,
6994,
6998,
7002,
7006,
7010,
7014,
7019,
7024,
7049,
7145,
7233,
7286,
7359,
7360,
7373,
7374,
7399,
7440,
7508,
7509,
7510,
7511,
7512,
7661,
7662,
7663,
7766,
7767,
7768,
7769,
7822,
7823,
7844,
7845,
7888,
7889,
7940,
7941,
7942,
7943,
7979,
8049,
8062,
8104,
8105,
8118,
8119,
8161,
8199,
8200,
8206,
8299,
8300,
8306,
8413,
8500,
8650,
8714,
8778,
8779,
8793,
8813,
8814,
8827,
8828,
8829,
8841,
8853,
8854,
8855,
8876,
8877,
8878,
8920,
8921,
8973,
8974,
9010,
9080,
9131,
9176,
9190,
9210,
9211,
9224,
9225,
9226,
9238,
9250,
9251,
9252,
9273,
9274,
9275,
9318,
9319,
9367,
9368,
9372,
9376,
9380,
9384,
9388,
9392,
9396,
9400,
9404,
9409,
9457,
9462,
9535,
9611,
9616,
9617,
9665,
9670,
9725,
9730,
9731,
9732,
9733,
9770,
9771,
9775,
9779,
9783,
9787,
9791,
9795,
9799,
9803,
9807,
9812,
9817,
9822,
9827,
9832,
9837,
9842,
9956,
9957,
10005,
10010,
10027,
10051,
10085,
10134,
10164,
10232,
10237,
10238,
10286,
10291,
10338,
10343,
10344,
10345,
10387,
10388,
10424,
10494,
10507,
10550,
10551,
10557,
10608,
10609,
10664,
10665,
10671,
10693,
10694,
10781,
10782,
10898,
10899,
10988,
10998,
11023,
11047,
11067,
11068,
11096,
11097,
11164,
11173,
11182,
11192,
11193,
11258,
11259,
11356,
11357,
11417,
11418,
11433,
11434,
11445,
11446,
11447,
11457,
11469,
11470,
11471,
11488,
11489,
11490,
11533,
11534,
11591,
11592,
11679,
11680,
11684,
11688,
11692,
11696,
11700,
11704,
11708,
11712,
11716,
11721,
11726,
11731,
11736,
11741,
11746,
11751,
11756,
11761,
11766,
11771,
11776,
11781,
11786,
11791,
11796,
11801,
11806,
11811,
11816,
11821,
11826,
11831,
11836,
11841,
11846,
11851,
11856,
11861,
11866,
11871,
11876,
11881,
11886,
11891,
11896,
11901,
11906,
11911,
11916,
11921,
11926,
11931,
11936,
11941,
11946,
11951,
11956,
11961,
11966,
11971,
11976,
11981,
11986,
11991,
11996,
12001,
12006,
12011,
12035,
12036,
12077,
12082,
12118,
12124,
12139,
12168,
12176,
12256,
12266,
12297,
12308,
12457,
12604,
12615,
12625,
12633,
12638,
12642,
12742,
12840,
12913,
13011,
13012,
13081,
13086,
13121,
13150,
13151,
13178,
13210,
13240,
13241,
13247,
13301,
13336,
13342,
13376,
13396,
13404,
13423,
13441,
13449,
13455,
13474,
13492,
13493,
13575,
13641,
13646,
13650,
13705,
13710,
13789,
13829,
13835,
13911,
13942,
13943,
13989,
14016,
14022,
14050,
14078,
14079,
14133,
14138,
14139,
14140,
14155,
14156,
14167,
14168,
14169,
14179,
14191,
14192,
14193,
14210,
14211,
14212,
14255,
14256,
14285,
14286,
14290,
14294,
14298,
14302,
14306,
14310,
14314,
14318,
14322,
14327,
14332,
14337,
14342,
14347,
14352,
14357,
14362,
14367,
14372,
14377,
14382,
14387,
14392,
14397,
14402,
14407,
14412,
14417,
14422,
14427,
14432,
14437,
14442,
14447,
14452,
14519,
14585,
14653,
14720,
14789,
14857,
14927,
14996,
15067,
15137,
15208,
15278,
15351,
15423,
15497,
15570,
15571,
15601,
15602,
15669,
15735,
15803,
15870,
15939,
16007,
16077,
16146,
16217,
16287,
16359,
16430,
16503,
16575,
16649,
16722,
16737,
16738,
16749,
16750,
16751,
16761,
16773,
16774,
16775,
16792,
16793,
16794,
16837,
16838,
16851,
16852,
16894,
16932,
16933,
16939,
17032,
17034,
17035,
17219,
17220,
17311,
17312,
17475,
17490,
17491,
17502,
17503,
17504,
17514,
17526,
17527,
17528,
17545,
17546,
17547,
17590,
17591,
17688,
17689,
17763,
17786,
17787,
17798,
17799,
17800,
17811,
17824,
17825,
17826,
17848,
17849,
17850,
17893,
17894,
17945,
17946,
18059,
18060,
18076,
18090,
18110,
18111,
18124,
18125,
18126,
18138,
18150,
18151,
18152,
18173,
18174,
18175,
18218,
18219,
18332,
18333,
18374,
18375,
18478,
18479,
18515,
18585,
18600,
18601,
18612,
18613,
18614,
18624,
18636,
18637,
18638,
18655,
18656,
18657,
18700,
18701,
18915,
18916,
18920,
18924,
18928,
18932,
18936,
18940,
18944,
18948,
18952,
18957,
18962,
18967,
18972,
18977,
18982,
18987,
18992,
18997,
19002,
19007,
19012,
19017,
19022,
19027,
19032,
19037,
19042,
19047,
19052,
19057,
19087,
19088,
19188,
19235,
19240,
19257,
19258,
19287,
19321,
19355,
19361,
19394,
19427,
19464,
19500,
19535,
19569,
19602,
19634,
19667,
19687,
19688,
19757,
19762,
19766,
19813,
19818,
19893,
19898,
19900,
19901,
19902,
20017,
20018,
20022,
20026,
20030,
20034,
20038,
20048,
20074,
20101,
20126,
20152,
20153,
20154,
20158,
20162,
20166,
20170,
20174,
20178,
20182,
20186,
20190,
20195,
20200,
20205,
20210,
20215,
20220,
20225,
20230,
20235,
20240,
20245,
20250,
20255,
20260,
20265,
20270,
20275,
20280,
20285,
20290,
20295,
20300,
20305,
20310,
20315,
20320,
20325,
20330,
20335,
20340,
20345,
20350,
20355,
20360,
20365,
20370,
20375,
20380,
20385,
20390,
20395,
20400,
20405,
20410,
20415,
20420,
20425,
20430,
20435,
20440,
20445,
20450,
20455,
20460,
20465,
20470,
20475,
20480,
20485,
20490,
20495,
20500,
20505,
20510,
20515,
20520,
20525,
20530,
20535,
20540,
20545,
20550,
20555,
20560,
20565,
20570,
20575,
20580,
20585,
20590,
20595,
20600,
20605,
20610,
20615,
20620,
20625,
20630,
20635,
20640,
20646,
20652,
20658,
20664,
20670,
20676,
20682,
20688,
20694,
20700,
20706,
20712,
20718,
20724,
20730,
20736,
20742,
20748,
20754,
20760,
20766,
20791,
20792,
20814,
20815,
20851,
20889,
20927,
20970,
20975,
21011,
21017,
21071,
21114,
21120,
21165,
21199,
21207,
21265,
21273,
21307,
21313,
21359,
21405,
21411,
21456,
21501,
21507,
21537,
21545,
21597,
21634,
21645,
21715,
21726,
21736,
21786,
21796,
21846,
21891,
21901,
21973,
21983,
22030,
22067,
22078,
22133,
22144,
22154,
22199,
22209,
22259,
22304,
22314,
22386,
22396,
22443,
22480,
22491,
22565,
22576,
22586,
22631,
22641,
22692,
22702,
22712,
22786,
22796,
22843,
22880,
22891,
22950,
22961,
22971,
23016,
23026,
23077,
23122,
23132,
23206,
23214,
23220,
23259,
23265,
23284,
23314,
23322,
23358,
23366,
23372,
23434,
23440,
23454,
23484,
23492,
23529,
23537,
23543,
23606,
23607,
23621,
23651,
23659,
23695,
23703,
23709,
23771,
23777,
23791,
23821,
23829,
23866,
23874,
23880,
23949,
23955,
23956,
23961,
23965,
23967,
23968,
23969,
23973,
23977,
23981,
23985,
23989,
23993,
23997,
24001,
24005,
24010,
24015,
24020,
24025,
24030,
24035,
24040,
24045,
24050,
24079,
24195,
24196,
24247,
24255,
24275,
24302,
24339,
24391,
24424,
24495,
24503,
24504,
24555,
24563,
24613,
24621,
24623,
24624,
24641,
24642,
24656,
24657,
24658,
24670,
24671,
24672,
24673,
24716,
24717,
24790,
24791,
24795,
24799,
24803,
24807,
24811,
24815,
24819,
24823,
24827,
24832,
24837,
24842,
24847,
24852,
24857,
24862,
24867,
24872,
24877,
24882,
24887,
24892,
24897,
24902,
24907,
24912,
24917,
24922,
24927,
24932,
24937,
24942,
24947,
24952,
24957,
24962,
24967,
24972,
24977,
24982,
24987,
24992,
25015,
25017,
25064,
25069,
25137,
25143,
25147,
25194,
25199,
25276,
25282,
25283,
25333,
25338,
25368,
25405,
25445,
25446,
25470,
25503,
25542,
25558,
25600,
25642,
25684,
25726,
25768,
25810,
25852,
25894,
25895,
25912,
25969,
25974,
25978,
26028,
26033,
26065,
26108,
26134,
26139,
26141,
26142,
26143,
26223,
26270,
26271,
26284,
26285,
26341,
26356,
26357,
26368,
26369,
26370,
26380,
26392,
26393,
26394,
26411,
26412,
26413,
26456,
26457,
26523,
26524,
26674,
26675,
26689,
26690,
26704,
26705,
26706,
26716,
26717,
26718,
26719,
26762,
26763,
26861,
26960,
26982,
26997,
26998,
27009,
27010,
27011,
27021,
27033,
27034,
27035,
27052,
27053,
27054,
27097,
27098,
27313,
27314,
27373,
27442,
27521,
27646,
27781,
28138,
28139,
28152,
28195,
28196,
28241,
28242,
28256,
28257,
28271,
28272,
28273,
28283,
28284,
28285,
28286,
28329,
28330,
28331,
28384,
28385,
28486,
28585,
28692,
28767,
28768,
28867,
28937,
28938,
28953,
28954,
28965,
28966,
28967,
28977,
28989,
28990,
28991,
29008,
29009,
29010,
29053,
29054,
29060,
29113,
29114,
29246,
29247,
29253,
29352,
29422,
29423,
29473,
29474,
29487,
29488,
29545,
29546,
29561,
29562,
29618,
29619,
29620,
29621,
29622,
29623,
29637,
29638,
29652,
29653,
29654,
29664,
29665,
29666,
29667,
29710,
29711,
29823,
29942,
30060,
30118,
30119,
30209,
30242,
30243,
30346,
30443,
30526,
30541,
30542,
30553,
30554,
30555,
30565,
30577,
30578,
30579,
30596,
30597,
30598,
30641,
30642,
30759,
30760,
30896,
30897,
31102,
31103,
31315,
31316,
31591,
31592,
31605,
31648,
31649,
31655,
31784,
31863,
31864,
32384,
32385,
32399,
32400,
32414,
32415,
32416,
32426,
32427,
32428,
32429,
32472,
32473,
32590,
32662,
32675,
32696,
32698,
32700,
32764,
32765,
32767,
32768,
32816,
32843,
32844,
32899,
32900,
32919,
32939,
32940,
32962,
32982,
32983,
33004,
33024,
33025,
33049,
33069,
33070,
33094,
33114,
33115,
33135,
33155,
33156,
33176,
33196,
33197,
33217,
33237,
33238,
33256,
33276,
33277,
33294,
33314,
33333,
33343,
33363,
33364,
33402,
33410,
33430,
33431,
33443,
33453,
33473,
33474,
33486,
33496,
33516,
33517,
33529,
33539,
33559,
33560,
33572,
33582,
33602,
33603,
33615,
33625,
33645,
33646,
33686,
33700,
33720,
33858
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 33858,
"ccnet_original_nlines": 1642,
"rps_doc_curly_bracket": 0.0028649100568145514,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2016352266073227,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018113210797309875,
"rps_doc_frac_lines_end_with_ellipsis": 0.0048691402189433575,
"rps_doc_frac_no_alph_words": 0.4870440363883972,
"rps_doc_frac_unique_words": 0.24825544655323029,
"rps_doc_mean_word_length": 4.7432861328125,
"rps_doc_num_sentences": 386,
"rps_doc_symbol_to_word_ratio": 0.007798740174621344,
"rps_doc_unigram_entropy": 6.170553684234619,
"rps_doc_word_count": 4729,
"rps_doc_frac_chars_dupe_10grams": 0.22981588542461395,
"rps_doc_frac_chars_dupe_5grams": 0.3426953852176666,
"rps_doc_frac_chars_dupe_6grams": 0.33302128314971924,
"rps_doc_frac_chars_dupe_7grams": 0.31674912571907043,
"rps_doc_frac_chars_dupe_8grams": 0.30007579922676086,
"rps_doc_frac_chars_dupe_9grams": 0.2330257147550583,
"rps_doc_frac_chars_top_2gram": 0.015603410080075264,
"rps_doc_frac_chars_top_3gram": 0.01364182960242033,
"rps_doc_frac_chars_top_4gram": 0.012750210240483284,
"rps_doc_books_importance": -3574.8662109375,
"rps_doc_books_importance_length_correction": -3574.8662109375,
"rps_doc_openwebtext_importance": -1886.2716064453125,
"rps_doc_openwebtext_importance_length_correction": -1886.2716064453125,
"rps_doc_wikipedia_importance": -1224.5589599609375,
"rps_doc_wikipedia_importance_length_correction": -1224.5589599609375
},
"fasttext": {
"dclm": 0.020722869783639908,
"english": 0.5264571309089661,
"fineweb_edu_approx": 1.723173975944519,
"eai_general_math": 0.0010873100254684687,
"eai_open_web_math": 0.48759233951568604,
"eai_web_code": 0.9987062811851501
}
}
|
{
"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": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"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": "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
|
750,129,710,770,566,700 |
Use Virtual RubyGems Repositories
JFrog Artifactory Documentation
Products
JFrog Artifactory
Content Type
User Guide
ft:sourceType
Paligo
Using a virtual RubyGems repository you can aggregate both your local and remote repositories.
You need to set the right repository source URL, in the same way as described in Usage for a local RubyGems repository, just with the appropriate repository key as follows:
source: http://localhost:8081/artifactory/api/gems/<repository key>/
target: http:// localhost:8081/artifactory/api/gems/<repository key> ( no slash at the end!)
|
{
"url": "https://jfrog.com/help/r/jfrog-artifactory-documentation/use-virtual-rubygems-repositories",
"source_domain": "jfrog.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "192295",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EEK7XW2MH4PWQTTIHWGKMDIH3Y3TRKAL",
"WARC-Concurrent-To": "<urn:uuid:acd3d1f4-7cb5-4155-a855-9a003d79eb49>",
"WARC-Date": "2024-06-15T04:48:35Z",
"WARC-IP-Address": "18.67.76.5",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VGLEFWOZHRKWF6B4NT7YJKG4NEW3REVR",
"WARC-Record-ID": "<urn:uuid:35c55dc7-fdb7-4fc2-b112-a8b40352fa9e>",
"WARC-Target-URI": "https://jfrog.com/help/r/jfrog-artifactory-documentation/use-virtual-rubygems-repositories",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:15cc93c2-629c-4f58-b1ab-dc71994a3e9b>"
},
"warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-161\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,
34,
35,
67,
68,
77,
95,
108,
119,
133,
140,
141,
236,
237,
410,
411,
480,
481
],
"line_end_idx": [
34,
35,
67,
68,
77,
95,
108,
119,
133,
140,
141,
236,
237,
410,
411,
480,
481,
573
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 573,
"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.2616822421550751,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00934579037129879,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23364485800266266,
"rps_doc_frac_unique_words": 0.7222222089767456,
"rps_doc_mean_word_length": 6.44444465637207,
"rps_doc_num_sentences": 2,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.8385415077209473,
"rps_doc_word_count": 72,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.06465516984462738,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -44.219486236572266,
"rps_doc_books_importance_length_correction": -58.542537689208984,
"rps_doc_openwebtext_importance": -29.316696166992188,
"rps_doc_openwebtext_importance_length_correction": -43.639747619628906,
"rps_doc_wikipedia_importance": -23.496826171875,
"rps_doc_wikipedia_importance_length_correction": -37.81987762451172
},
"fasttext": {
"dclm": 0.027210410684347153,
"english": 0.7170960903167725,
"fineweb_edu_approx": 1.8677135705947876,
"eai_general_math": 0.73443204164505,
"eai_open_web_math": 0.9380785822868347,
"eai_web_code": 0.874108612537384
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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
|
770,233,697,852,011,000 |
Knowledge to Power Your Website
A Strategy for Busting Cache in WordPress
A Strategy for Busting Cache in WordPress thumbnail
Like the other countless users who’ve downloaded the W3 Total Cache plugin, or manually set expires headers, I want my sites to be fast. Requests should be served from cache whenever possible. But what happens when you want to update a stylesheet in production? How can you tell your site to serve the latest version?
We’ve got a couple options on the table to accomplish this. I’ll run you through both below, with a css file as the example. Prior to the options, I’ll also provide a simple tutorial for how to setup a dynamic cache busting variable in PHP, which should update automatically for you when you make changes to your CSS file.
This tutorial will be specifically focused for WordPress users using the wp_register_style function to call their stylesheets, but these strategies will work for busting cache on any site.
Ok, let’s get to it!
WordPress Cache Busting?
Avoid troubleshooting when you sign up for DreamPress. Our friendly WordPress experts are available 24/7 to help solve website problems.
Dynamic Cache Busting Variable
First, we’ll setup a variable that will update every time we make a change to our file. This variable will later go into our requests for our cacheable assets.
PHP
$cacheBusterCSS = date(“Y m d”, filemtime( get_stylesheet_directory() . ‘/library/css/style.css’));
A few things are happening here. First, I’m calling the CSS file prepended with the get_stylesheet_directory function. This function is inherent to WordPress, and will ensure the correct absolute server path to our file, either locally or on our live site.
Next, we are wrapping the file call in the php filemtime function. This function returns the time when the content of the file was last changed.
Finally, we’ll pass that into a date function, which will return our variable in a nice clean format, ie. 20130410. This is the value we’ll pass to our files in order to bust cache. Since it updates every time we update the file, there is no manual work.
Now, we’ll focus on actually using this variable.
Query Strings
The first option for busting cache is appending a query string to the end of our requests. We’ll use the above variable as that query string.
PHP
// cache busting variables for statics
$cacheBusterCSS = date(“Y m d”, filemtime( get_stylesheet_directory() . ‘/library/css/style.css’));
// register main stylesheet
wp_register_style( ‘main-stylesheet’, get_stylesheet_directory_uri() . ‘/library/css/style.css’, array(), $cacheBusterCSS, ‘all’ );
As you can see, I’m using the wp_register_style function to call my stylesheet in the above code. You can call yours however you’d like. After setting up the source for my file, I’m then adding our cacheBusterCSS variable in as the fourth parameter, denoting a version. The version is appended to the stylesheet URL as a query string, such as ?ver=20130410. This query string will ensure the correct version of the file is sent to the client, regardless of cache.
File Naming
The second option is renaming the file altogether when you make a change, and using a rewrite rule to reroute the requests to the original file.
.htaccess
<IfModule mod_rewrite.c>
RewriteCond %{REQUEST_FILENAME} !-f
RewriteCond %{REQUEST_FILENAME} !-d
RewriteRule ^(.+)\.(\d+)\.(js|css|png|jpg|gif)$ $1.$3 [L] </IfModule>
This will route all requests to /path/filename.20130410.css to /path/filename.css, for example. It is scoped to the above file types, so change it as necessary.
PHP
// cache busting variables for statics
$cacheBusterCSS = date(“Y m d”, filemtime( get_stylesheet_directory() . ‘/library/css/style.css’));
// register main stylesheet
wp_register_style( ‘main-stylesheet’, get_stylesheet_directory_uri() . ‘/library/css/style.’ . $cacheBusterCSS . ‘.css’, array(), null, ‘all’ );
In our PHP, we will call the file in almost the same way as above, with a few small tweaks. Rather than passing our cacheBusterCSS variable as a query string parameter, we’ll concatenate it with the filename. Then we’ll pass null to the query string param. And there you have it! The above file will be style.20130410.css, which will route to style.css. The change in filename will bust our cache, sending the correct version to the client.
Which Is Better?
Well, if you’ve viewed source on my site, you can see that I’ve chosen the file renaming method. There are a few reasons for this. First, it’s the preferred method in HTML5 Boilerplate, which is about as close to a gold standard as you can get. Secondly, Steve Souders states that some popular proxies don’t cache resources with a query string.
So why include the option at all? Well, some of you may not have access to your .htaccess file for one reason or another, or may not be comfortable editing it (ignoring the obvious question of how you setup caching in the first place). It also seems to be the standard solution in WordPress, as the inherent functions support query strings.
What do you think? What strategies are you using for busting cache? I’d love to hear them!
This has been a guest post by Rob Stinogle.
Rob is a Web Developer who appreciates the art of padding. Currently, he manages the front end team at AE.com, and writes web related jargon with his other half here. In his free time he loves climbing, painting, and re-watching Star Wars.
me
About the Author:
The Guest Author profile is for all content coming from our amazing external contributors!
|
{
"url": "https://www.dreamhost.com/blog/a-strategy-for-busting-cache-in-wordpress/",
"source_domain": "www.dreamhost.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "54243",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RSWJI4HYXLCQTJO4EUMTX2GWEOEJEPCU",
"WARC-Concurrent-To": "<urn:uuid:18bd79f3-7dde-41d2-8f41-071655b6bad3>",
"WARC-Date": "2021-12-04T05:51:59Z",
"WARC-IP-Address": "18.67.76.19",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RXJQQZQLG2PZ2REVBVLYMU5B5MU3LJHR",
"WARC-Record-ID": "<urn:uuid:051a42e6-cd30-42b6-9f3b-8cd7791ed3a7>",
"WARC-Target-URI": "https://www.dreamhost.com/blog/a-strategy-for-busting-cache-in-wordpress/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d9b7d6b1-4acc-4985-aa76-76be9acaec7a>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-155\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
32,
33,
75,
76,
128,
129,
449,
450,
773,
774,
964,
965,
986,
987,
1012,
1013,
1150,
1151,
1183,
1184,
1344,
1345,
1349,
1449,
1450,
1711,
1712,
1859,
1860,
2115,
2116,
2166,
2167,
2181,
2323,
2324,
2328,
2367,
2467,
2468,
2496,
2628,
2629,
3097,
3098,
3110,
3255,
3256,
3267,
3292,
3328,
3364,
3434,
3435,
3596,
3597,
3601,
3640,
3740,
3741,
3769,
3914,
3915,
4358,
4359,
4376,
4721,
4722,
5063,
5064,
5155,
5156,
5201,
5202,
5442,
5443,
5446,
5447,
5465,
5466
],
"line_end_idx": [
32,
33,
75,
76,
128,
129,
449,
450,
773,
774,
964,
965,
986,
987,
1012,
1013,
1150,
1151,
1183,
1184,
1344,
1345,
1349,
1449,
1450,
1711,
1712,
1859,
1860,
2115,
2116,
2166,
2167,
2181,
2323,
2324,
2328,
2367,
2467,
2468,
2496,
2628,
2629,
3097,
3098,
3110,
3255,
3256,
3267,
3292,
3328,
3364,
3434,
3435,
3596,
3597,
3601,
3640,
3740,
3741,
3769,
3914,
3915,
4358,
4359,
4376,
4721,
4722,
5063,
5064,
5155,
5156,
5201,
5202,
5442,
5443,
5446,
5447,
5465,
5466,
5556
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5556,
"ccnet_original_nlines": 80,
"rps_doc_curly_bracket": 0.0007199399988166988,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35092127323150635,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023450590670108795,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21943049132823944,
"rps_doc_frac_unique_words": 0.4166666567325592,
"rps_doc_mean_word_length": 5.054398059844971,
"rps_doc_num_sentences": 82,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.2815985679626465,
"rps_doc_word_count": 864,
"rps_doc_frac_chars_dupe_10grams": 0.08518434315919876,
"rps_doc_frac_chars_dupe_5grams": 0.1351041942834854,
"rps_doc_frac_chars_dupe_6grams": 0.1351041942834854,
"rps_doc_frac_chars_dupe_7grams": 0.11815892159938812,
"rps_doc_frac_chars_dupe_8grams": 0.08518434315919876,
"rps_doc_frac_chars_dupe_9grams": 0.08518434315919876,
"rps_doc_frac_chars_top_2gram": 0.00915960967540741,
"rps_doc_frac_chars_top_3gram": 0.017174260690808296,
"rps_doc_frac_chars_top_4gram": 0.015800319612026215,
"rps_doc_books_importance": -523.5828247070312,
"rps_doc_books_importance_length_correction": -523.5828247070312,
"rps_doc_openwebtext_importance": -266.160400390625,
"rps_doc_openwebtext_importance_length_correction": -266.160400390625,
"rps_doc_wikipedia_importance": -173.7587890625,
"rps_doc_wikipedia_importance_length_correction": -173.7587890625
},
"fasttext": {
"dclm": 0.050323959439992905,
"english": 0.8196310997009277,
"fineweb_edu_approx": 1.3920555114746094,
"eai_general_math": 0.6182617545127869,
"eai_open_web_math": 0.1389845609664917,
"eai_web_code": 0.4895578622817993
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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
|
6,300,366,930,348,492,000 |
27 Comments
Supermod
Just tested using my account and also a ForumTestAccount (used as this is a general account with no site permissions) and both submitted as normal.
What happened when you tried to submit them?
just change this thread to the question
Original Poster
magicjay1986
Just tested using my account and also a ForumTestAccount (used as this is … Just tested using my account and also a ForumTestAccount (used as this is a general account with no site permissions) and both submitted as normal. What happened when you tried to submit them?
It looked like they were submitted like normal. But when I went to the ask section, questions not there. Can't be my settings as I haven't changed anything.
I seem to have this exact same problem. Tried to ask a question 3 times now. Each time I click on the button to post the question, the web page just resets back to an empty load of boxes to start submitting again.
I seem to be able to post in other sections though? Strange, eh?
Well, I just tried with a different OS and browser and still the same. Cannot post a question to "Ask" but can to anything else. What's going on?
Linux - Seamonkey browser = Fail.
Win 8 - IE11 = Fail.
This worked OK
For Mod review:
Right. Here's what seems to happen. After arriving on the "Ask the HUKD Community a question..." page, you type in your text and click "ASK QUESTION" button. Screen resets back to a blank page to start entering info again. Upon typing details a second time (without exiting page to anywhere else and back) you click "ASK QUESTION" button a second time and it sends the data correctly.
Do you think this is a browser issue? As mentioned in a feedback thread, I have tried with a Linux-based browser, IE11 via Windows OS and Chrome through my tablet and it did the same problem EVERY time.
Any thoughts?
Phsycronix
For Mod review:Right. Here's what seems to happen. After arriving on the … For Mod review:Right. Here's what seems to happen. After arriving on the "Ask the HUKD Community a question..." page, you type in your text and click "ASK QUESTION" button. Screen resets back to a blank page to start entering info again. Upon typing details a second time (without exiting page to anywhere else and back) you click "ASK QUESTION" button a second time and it sends the data correctly.Do you think this is a browser issue? As mentioned in a feedback thread, I have tried with a Linux-based browser, IE11 via Windows OS and Chrome through my tablet and it did the same problem EVERY time.Any thoughts?
It's common, I think it something to do with the inquiry into has your question been asked before. Maybe something to do with cookies.
kester76
It's common, I think it something to do with the inquiry into has your … It's common, I think it something to do with the inquiry into has your question been asked before. Maybe something to do with cookies.
Thanks for that, kester76. Something must've changed on the site as I've never had this issue before. Seems odd that it would do it on three differing browser platforms with separate 'cookie' configurations though? This "cookie" thing really annoys me.
A site's webpages should not really be designed with the sole purpose of dropping stuff on your computer to only work a certain way or under certain conditions. It should be a universally acceptable set of instructions. Yet, the sheer amount of sites you visit with bits missing on the page, buttons not working, text all jumbled up (because you might have an ad-blocker installed, God forbid!) just makes for a lousy browsing experience. And this is all because web-developers want to make your browsing experience better/personalised etc?
Ever since HUKD changed their layout last time, I've put up with clashing buttons, the logout section disappears off-screen so you have to guess where it is, the notification buttons seem 'offset' and the layout on the deals section is horrendous. You cannot actually click on a deal to read comments as the images clash with the details section. I have to circumvent it by carefully (within about 1-2 pixels) click on the posters profile and then navigate through their deals to the right one. A real pain. In essence - love the site - hate the faff!
I asked this question a few days ago. It's so annoying, I reported it, has have quite a few others who responded. It's exactly the same as you describe, but by the 13th attempt, you've forgotten what the hell you were trying to ask anyway. I hope it gets sorted soon. Now, I just copy the message after I've written it and keep trying until it works.
same here I get issues posting on others people questions aswell so this is test attempt #1
ok that went through but I keep getting the failed most times and then this has been flagged after about every 5 to 10 posts anyone else the same #1
muddassarsardar
ok that went through but I keep getting the failed most times and then … ok that went through but I keep getting the failed most times and then this has been flagged after about every 5 to 10 posts anyone else the same #1
No, thankfully, I seem to be able to post on other people's posts ok, it's just when posting my own it becomes a problem. There seems to be more and more problems creeping up on here.
I have the same problem. It's been going on for about three weeks now. I typed a long question the other day, forgot to copy the text, hit 'post' and it vanished. It's absolutely infuriating but you're not the only one with this problem!
same happens to me :O
Same here, so have taken habit of copying the text, though worked 1st time this morning, OK when replying though
I have been having the same problem for several days, fill in the ask section...submit and it disappears, I'm using win 10 and tried both ie and edge, whats going onn ?
Can not post an " ask " I fill it all in press submit and it disappears.
supermod
Moved this to Feedback and we'll raise it for further review / updates from the relevant team. If members can add further info this will help the development team - is it specific to certain devices / browing methods, are error messages displayed, can members upload supporting screenshots showing issue etc.
hotukdeals.com/fee…598
sigma
Moved this to Feedback and we'll raise it for further review / updates … Moved this to Feedback and we'll raise it for further review / updates from the relevant team. If members can add further info this will help the development team - is it specific to certain devices / browing methods, are error messages displayed, can members upload supporting screenshots showing issue etc.https://www.hotukdeals.com/feedback/how-to-post-and-host-images-for-thread-327598
Hi Sigma. Thanks for your attention. It would seem the problem is quite simple. As people have mentioned already, it is something to do with the submission of a question via the "Ask" form. After filling it in, you press the "Ask a question" button at the bottom and the data is sent. However, instead of the question being posted, the screen reverts back to a set of blank boxes again as if you never filled them in. I have discovered that it did this using a Linux-based OS browser, Win 8 (IE11) and Chrome browser on a tablet. No error messages are shown at all - well, not for me anyway. It just behaves as if you never tried to ask a question and have only just opened the page.
The only other thing I have worked out is that if you retype the same question in the new 'refreshed' boxes and try submitting the data, it will accept and post. You mustn't leave the refreshed page at any point BEFORE you resubmit the question though - otherwise I think it's treated as the first time again and it won't submit.
HTH,
Phsy.
Supermod
@airfix - just directed you to this thread. Does it seem it is the same issue as others were experiencing?
Phsycronix - are you still getting this issue?
Original Poster
magicjay1986
@airfix - just directed you to this thread. Does it seem it is the same … @airfix - just directed you to this thread. Does it seem it is the same issue as others were experiencing?Phsycronix - are you still getting this issue?
asked a question on 'ask' in the morning and again, it didn't populate. I wrote everything out, pressed submit, went to check and nope, not there.
Supermod
EN1GMA
asked a question on 'ask' in the morning and again, it didn't populate. I … asked a question on 'ask' in the morning and again, it didn't populate. I wrote everything out, pressed submit, went to check and nope, not there.
Thanks for letting me know. It was reported but can you just let me know the following you're using today?
Device and version
Browser and version
Any add-ons or extensions running
Thanks.
magicjay1986
@airfix - just directed you to this thread. Does it seem it is the same … @airfix - just directed you to this thread. Does it seem it is the same issue as others were experiencing?Phsycronix - are you still getting this issue?
Yep, I typed in all the correct fields, pressed the ask button and screen just refreshed with blank boxes etc.
Opera
All in one pc (aka laptop innards)
Edited by: "airfix" 17th Feb
Supermod
airfix
Yep, I typed in all the correct fields, pressed the ask button and screen … Yep, I typed in all the correct fields, pressed the ask button and screen just refreshed with blank boxes etc.
Ok, thanks. Can you also provide this information?
Device and version
Browser and version
Any add-ons or extensions running
Appreciate it.
magicjay1986
Ok, thanks. Can you also provide this information? Device and … Ok, thanks. Can you also provide this information? Device and versionBrowser and versionAny add-ons or extensions runningAppreciate it.
Version: 36.0.2130.80 - Opera is up to date
Update stream: Stable
System: Windows Vista 32-bit
No extensions/add ons
Original Poster
magicjay1986
Thanks for letting me know. It was reported but can you just let me know … Thanks for letting me know. It was reported but can you just let me know the following you're using today?Device and versionBrowser and versionAny add-ons or extensions runningThanks.
So was done from a works pc so no idea of the info required
Post a comment
Avatar
@
Text
|
{
"url": "https://www.hotukdeals.com/feedback/cant-start-a-ask-thread-in-ask-2598395",
"source_domain": "www.hotukdeals.com",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "270655",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XGBKTWYJLAPXFNEGBOAW3BLRJTARSIB2",
"WARC-Concurrent-To": "<urn:uuid:acea6994-d17b-4e63-b1b4-97c6d3156f16>",
"WARC-Date": "2017-09-24T08:47:54Z",
"WARC-IP-Address": "104.16.101.21",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HDEIBRVANPR3IT3RARIWDOWO3LTT2USY",
"WARC-Record-ID": "<urn:uuid:e0b49a26-41f2-464c-998f-37f328afc5bf>",
"WARC-Target-URI": "https://www.hotukdeals.com/feedback/cant-start-a-ask-thread-in-ask-2598395",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:66fd2301-4c21-4bbd-b695-2953acb5a065>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-150-123-222.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-39\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for September 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
12,
13,
22,
23,
171,
172,
217,
218,
258,
259,
275,
276,
289,
290,
559,
560,
561,
718,
719,
933,
934,
999,
1000,
1146,
1147,
1181,
1202,
1203,
1218,
1219,
1235,
1236,
1621,
1622,
1825,
1826,
1840,
1841,
1852,
1853,
2543,
2544,
2545,
2680,
2681,
2690,
2691,
2899,
2900,
2901,
2902,
3155,
3156,
3697,
3698,
4250,
4251,
4602,
4603,
4695,
4696,
4845,
4846,
4862,
4863,
5085,
5086,
5087,
5271,
5272,
5510,
5511,
5533,
5534,
5647,
5648,
5817,
5818,
5891,
5892,
5901,
5902,
6211,
6212,
6235,
6236,
6242,
6243,
6706,
6707,
6708,
6709,
7393,
7394,
7724,
7725,
7730,
7731,
7737,
7738,
7747,
7748,
7855,
7856,
7903,
7904,
7920,
7921,
7934,
7935,
8162,
8163,
8164,
8165,
8312,
8313,
8322,
8323,
8330,
8331,
8554,
8555,
8556,
8557,
8664,
8665,
8684,
8704,
8738,
8739,
8747,
8748,
8761,
8762,
8989,
8990,
8991,
8992,
9103,
9104,
9110,
9145,
9146,
9175,
9176,
9185,
9186,
9193,
9194,
9381,
9382,
9383,
9384,
9435,
9436,
9455,
9475,
9509,
9510,
9525,
9526,
9539,
9540,
9740,
9741,
9742,
9743,
9787,
9809,
9838,
9839,
9840,
9862,
9863,
9879,
9880,
9893,
9894,
10153,
10154,
10155,
10215,
10230,
10237,
10239
],
"line_end_idx": [
12,
13,
22,
23,
171,
172,
217,
218,
258,
259,
275,
276,
289,
290,
559,
560,
561,
718,
719,
933,
934,
999,
1000,
1146,
1147,
1181,
1202,
1203,
1218,
1219,
1235,
1236,
1621,
1622,
1825,
1826,
1840,
1841,
1852,
1853,
2543,
2544,
2545,
2680,
2681,
2690,
2691,
2899,
2900,
2901,
2902,
3155,
3156,
3697,
3698,
4250,
4251,
4602,
4603,
4695,
4696,
4845,
4846,
4862,
4863,
5085,
5086,
5087,
5271,
5272,
5510,
5511,
5533,
5534,
5647,
5648,
5817,
5818,
5891,
5892,
5901,
5902,
6211,
6212,
6235,
6236,
6242,
6243,
6706,
6707,
6708,
6709,
7393,
7394,
7724,
7725,
7730,
7731,
7737,
7738,
7747,
7748,
7855,
7856,
7903,
7904,
7920,
7921,
7934,
7935,
8162,
8163,
8164,
8165,
8312,
8313,
8322,
8323,
8330,
8331,
8554,
8555,
8556,
8557,
8664,
8665,
8684,
8704,
8738,
8739,
8747,
8748,
8761,
8762,
8989,
8990,
8991,
8992,
9103,
9104,
9110,
9145,
9146,
9175,
9176,
9185,
9186,
9193,
9194,
9381,
9382,
9383,
9384,
9435,
9436,
9455,
9475,
9509,
9510,
9525,
9526,
9539,
9540,
9740,
9741,
9742,
9743,
9787,
9809,
9838,
9839,
9840,
9862,
9863,
9879,
9880,
9893,
9894,
10153,
10154,
10155,
10215,
10230,
10237,
10239,
10247
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10247,
"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.44947415590286255,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030635569244623184,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17238226532936096,
"rps_doc_frac_unique_words": 0.26840317249298096,
"rps_doc_mean_word_length": 4.529445171356201,
"rps_doc_num_sentences": 125,
"rps_doc_symbol_to_word_ratio": 0.008230449631810188,
"rps_doc_unigram_entropy": 5.439599514007568,
"rps_doc_word_count": 1766,
"rps_doc_frac_chars_dupe_10grams": 0.48393547534942627,
"rps_doc_frac_chars_dupe_5grams": 0.5109388828277588,
"rps_doc_frac_chars_dupe_6grams": 0.5036879777908325,
"rps_doc_frac_chars_dupe_7grams": 0.5003125667572021,
"rps_doc_frac_chars_dupe_8grams": 0.48393547534942627,
"rps_doc_frac_chars_dupe_9grams": 0.48393547534942627,
"rps_doc_frac_chars_top_2gram": 0.012251529842615128,
"rps_doc_frac_chars_top_3gram": 0.009751220233738422,
"rps_doc_frac_chars_top_4gram": 0.012751590460538864,
"rps_doc_books_importance": -1010.7662963867188,
"rps_doc_books_importance_length_correction": -1010.7662963867188,
"rps_doc_openwebtext_importance": -602.7039184570312,
"rps_doc_openwebtext_importance_length_correction": -602.7039184570312,
"rps_doc_wikipedia_importance": -464.41650390625,
"rps_doc_wikipedia_importance_length_correction": -464.41650390625
},
"fasttext": {
"dclm": 0.11334937810897827,
"english": 0.9646800756454468,
"fineweb_edu_approx": 0.9205687046051025,
"eai_general_math": 0.6056971549987793,
"eai_open_web_math": 0.24760383367538452,
"eai_web_code": 0.3740040063858032
}
}
|
{
"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": "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": "-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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,201,803,755,436,751,000 |
November 28, 2014
Hot Topics:
Dissection of an Application Frameworks, Part 2
• May 24, 2005
• By Xin Chen
• Send Email »
• More Articles »
Gray-Box Frameworks
Gray-box frameworks take both inheritance and composition approach, is usually made up with combination of abstract classes and concrete classes. The approach of enabling its common spots and hot spots is determined on a component-by-component basis. Figure 9 shows a gray-box framework.
Note: Because a concrete class that contains virtual methods can either be used directly or inherited by another class that overrides the virtual methods to alter its behavior, it is possible for a gray-box framework to consist of only concrete classes, as long as the approach taken by the classes is a combination of composition and inheritance.
In the real world, the application frameworks you will be developing will most likely be gray-box frameworks. The decision whether a given components will follow the inheritance approach or composition approach is decided by which approach is best suited for what the component is trying to accomplish and how developers will likely use the component in their business applications.
As we are choosing the inheritance approach, the composition approach, or a mix of the two, we should consistently keep in mind the tradeoffs and implications for performance, maintenance, and usability with each approach.
Figure 9. A gray-box framework
From the performance point of view, the composition approach tends to beslower than the inheritance approach, primarily because of the extra components it has to load and access at run time to produce the desired results. As you are gathering the features from multiple components, you may also add a number of extra calls to bridge different components. In the inheritance approach, however, an inherited class often contains most of the required features within itself, hence reducing the number of objects the program needs to create and access to produce the same results and eliminating as well much of the extra code that would be needed to bridge different components if the composition approach were used.
Maintenance is another area in which we see the tradeoffs in both approaches. In the composition approach, developers work with a set of highly decoupled framework components, which makes their application more adaptive to changes, and hence more flexible and extensible. However, after the application is deployed, those who provide postproduction support will have to deal with many more "moving parts," which leads to extra maintenance effort. For example, a change in a business requirement may result in the modification of framework components. With a composition approach, such requirement changes may potentially affect a series of framework components that participate in a certain business feature, since the business requirement is supported by the collaboration of a number of components. Such changes in multiple components may also multiply the effort in testing and deployment of the application framework. On the other hand, the inheritance approach may be less flexible than the composition approach, but in compensation, it introduces fewer moving parts. When business features are served by a hierarchy of classes, a change in business requirements can often be resolved with changes to far fewer classes on the hierarchical tree. Of course, the real maintenance cost of your application framework depends on the design of the framework as well as the type of business-requirement changes involved. But generally speaking, you have less overhead on maintenance if you have fewer moving parts to deal with.
Usability is yet another area you need to consider in designing the application framework. The framework component that takes on the inheritance approach usually hides the complex coordination logic and process flow inside the parent class or abstract class, so the developer often needs only to implement or override a few methods to achieve the desired result. Hence, inheritance provides very good usability as long as developers aren't required to learn overwhelming details of the parent class or abstract class they inherit. Usability for the composition approach, on the other hand, depends considerably on how much composition developers have to support to achieve certain results. Having a set of highly decoupled components often requires developers to learn and code their own coordination logic and process flow to wire such components together to produce the desired results. However, if you are willing to sacrifice flexibility and create a few coarse-grained components so that developers need to work with only a small number of components to get what they want, then the framework will become easier to use and developers will be much more productive, since the composition approach significantly reduces the coordination logic developers have to learn and write.
As you approach many framework design decisions, you must keep in mind that there is no silver bullet. There is often a tradeoff between different approaches. It is your job to decide how to balance them and create an application framework that fits your objectives.
Design Patterns
As you are architecting and developing the application framework, you will often run into design challenges on recurring scenarios, such as how to improve handling of changes to the process flow and how to improve application-specific customization. Design patterns, which describe the solution to common software development problems, can assist you in solving some of these common problems in developing an application framework. Many commonly used design patterns are documented in the classic book Design Patterns: Elements of Reusable Object-Oriented Software, by Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides, the "gang of four" (GOF). Some design patterns are especially useful in application framework development. The following list describes some of these patterns and the problems they can solve:
Strategy: a design that handles the variation of algorithms in the application. It allows the developer to customize the framework by "plug and play"-ing different application-specific algorithms.
Bridge: a design that decouples the abstraction and implementation in the application. It allows developers to provide different implementations for part of the application without affecting other parts of the application.
Decorator: a design that provides a layer approach in processing data. It allows developers to easily assemble multiple components to process data.
Observer: a design that provides a publishsubscribe communication model. It allows developers to disperse information easily to multiple objects.
Mediator: a design that keeps objects from referring to each other explicitly. It allows developers to create loosely coupled communication between different objects.
Template method: a design that provides the skeleton of the algorithm it oper-ates. It allows developers to define process flow and coordination logic without having to define how the algorithm is implemented.
Visitor: a design that lets you define a new operation without changing the existing ones. It allows developers to decouple an operation from the coordination logic that is constantly changing.
Singleton: a design that ensures that only one instance of the class is created. It allows developers to have better control of the creation of the object.
Abstract factory: a design that provides an interface for creating families of objects without specifying their concrete classes. It allows developers to reduce the reference to concrete classes throughout the application, and hence reduce the amount of code changed when the concrete classes change.
For the rest of the book, we will look at how these design patterns can help us develop our application framework and how these patterns are implemented in .NET.
Summary
In this chapter, you have learned about processes and techniques of application framework development. We first looked at the different layers that make up the application framework and how each layer is related to the others. Then we looked at the framework development process, which involves analysis, design, development, and stabilization stages in an iterative fashion and specific tasks involved in each of these stages. Following that, you learned about the several approaches in framework development, such as white-box, black-box, and gray-box frameworks. We also looked at some key framework development techniques through discussion of common-spot, hot-spot, and design patterns.
About the Author
Xin Chen is the founder of Xtremework, Inc. Since the inception of .NET, Xin Chen has helped customers in a wide range of industries turn their business ideas into software products using .NET technology. Leveraging his expertise in .NET and EAI, Xin Chen has also worked with several technology leaders, such as Microsoft and Accenture, to bring winning solutions to their customers. When not working overtime, Xin enjoys reading books, writing books, and resting. He is the author of BizTalk 2002 Design and Implementation (Apress, 2003). Xin Chen earned a master's degree in statistics from Columbia University and is currently living in New Jersey.
About the Book
Developing Application Frameworks in .NET by Xin Chen
Published April 2004, Softbound, 392 pages
Published by Apress
ISBN 1-59059-288-3
Retail price: $49.99
This material is from Chapter 2 of the book.
Page 4 of 4
Comment and Contribute
(Maximum characters: 1200). You have characters left.
Enterprise Development Update
Don't miss an article. Subscribe to our newsletter below.
Sitemap | Contact Us
Rocket Fuel
|
{
"url": "http://www.developer.com/design/article.php/10925_3507216_4/Dissection-of-an-Application-Frameworks-Part-2.htm",
"source_domain": "www.developer.com",
"snapshot_id": "crawl=CC-MAIN-2014-49",
"warc_metadata": {
"Content-Length": "66425",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UI55IWEMDGXTACRU5UJWNFU2WZ3YZ2DU",
"WARC-Concurrent-To": "<urn:uuid:e37b7f68-ce5d-4ce4-ba99-e690737ccdc8>",
"WARC-Date": "2014-11-29T06:21:06Z",
"WARC-IP-Address": "23.15.9.74",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LAMSGNBZQJQFNEVUALGTF2OV6GAMVIK6",
"WARC-Record-ID": "<urn:uuid:cb228494-db79-4c3e-8cd9-ad7e69ff0811>",
"WARC-Target-URI": "http://www.developer.com/design/article.php/10925_3507216_4/Dissection-of-an-Application-Frameworks-Part-2.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:334f22c9-f00c-4389-80ad-adc30e4e361f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-23-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-49\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for November 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
18,
30,
31,
79,
80,
97,
113,
130,
150,
151,
171,
172,
460,
461,
809,
810,
1193,
1194,
1417,
1418,
1449,
1450,
2164,
2165,
3690,
3691,
4972,
4973,
5240,
5241,
5257,
5258,
6081,
6082,
6279,
6280,
6503,
6504,
6652,
6653,
6799,
6800,
6967,
6968,
7178,
7179,
7373,
7374,
7530,
7531,
7832,
7833,
7995,
7996,
8004,
8005,
8697,
8698,
8715,
8716,
9369,
9370,
9385,
9386,
9440,
9441,
9484,
9504,
9523,
9544,
9589,
9590,
9591,
9592,
9593,
9594,
9606,
9607,
9608,
9609,
9632,
9633,
9635,
9636,
9637,
9691,
9692,
9694,
9695,
9697,
9698,
9699,
9729,
9730,
9788,
9789,
9810,
9811
],
"line_end_idx": [
18,
30,
31,
79,
80,
97,
113,
130,
150,
151,
171,
172,
460,
461,
809,
810,
1193,
1194,
1417,
1418,
1449,
1450,
2164,
2165,
3690,
3691,
4972,
4973,
5240,
5241,
5257,
5258,
6081,
6082,
6279,
6280,
6503,
6504,
6652,
6653,
6799,
6800,
6967,
6968,
7178,
7179,
7373,
7374,
7530,
7531,
7832,
7833,
7995,
7996,
8004,
8005,
8697,
8698,
8715,
8716,
9369,
9370,
9385,
9386,
9440,
9441,
9484,
9504,
9523,
9544,
9589,
9590,
9591,
9592,
9593,
9594,
9606,
9607,
9608,
9609,
9632,
9633,
9635,
9636,
9637,
9691,
9692,
9694,
9695,
9697,
9698,
9699,
9729,
9730,
9788,
9789,
9810,
9811,
9822
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9822,
"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.4112528860569,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005220420192927122,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13109049201011658,
"rps_doc_frac_unique_words": 0.35180240869522095,
"rps_doc_mean_word_length": 5.378504753112793,
"rps_doc_num_sentences": 76,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.448140621185303,
"rps_doc_word_count": 1498,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03748292848467827,
"rps_doc_frac_chars_dupe_6grams": 0.00719870999455452,
"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.009308679960668087,
"rps_doc_frac_chars_top_3gram": 0.012287450022995472,
"rps_doc_frac_chars_top_4gram": 0.019858509302139282,
"rps_doc_books_importance": -811.484619140625,
"rps_doc_books_importance_length_correction": -811.484619140625,
"rps_doc_openwebtext_importance": -366.2762451171875,
"rps_doc_openwebtext_importance_length_correction": -366.2762451171875,
"rps_doc_wikipedia_importance": -258.1322937011719,
"rps_doc_wikipedia_importance_length_correction": -258.1322937011719
},
"fasttext": {
"dclm": 0.044490519911050797,
"english": 0.9352335929870605,
"fineweb_edu_approx": 2.6666862964630127,
"eai_general_math": 0.7317402958869934,
"eai_open_web_math": 0.23871421813964844,
"eai_web_code": 0.7656485438346863
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.13",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.14",
"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": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "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
|
-339,631,357,551,186,800 |
Google Earth Compatible With Other 3D Environments
Tony from Khronos.org wrote in with some details about 3D modelling for Google Earth in reply to a recent post about texture support. I don't know much about this stuff but I thought it was interesting, so here's his letter almost verbatim.
"By using COLLADA as their format for geometry and textures, Google has suddenly offered a mainstream 3D visualization environment and 3D world to anyone in the 3D modeling, AEC, and game model development communities."
"I saw your post on MIT Advertising Lab about Google Earth now supporting textures, and I thought you might be interested adding more details - something that was pretty significant but seems to have been missed by most of the press
Google Earth and KML 2.1 now use the COLLADA interchange format for 3D geometry and textures
COLLADA is an open standard for that defines an XML-based schema for 3D authoring applications to freely exchange digital assets without loss of information.
If you check out the textured 3D sample file in [Google's] KML 2.1tutorials you will see that they include both the COLLADA .dae file and the textures in a compressed zip file. They add the geospecific data in their own xml file.
Collada is a way to enable full interoperability between 3D applications - you can move content freely from one application, add something else in (like shaders or physics), and then pass the model on to the next in a tool chain sequence.
This is significant because (in addition to giving Google Earth the capabilities for 3D textures) it means you can use any of the popular 3D modeling applications including Maya, SoftImage|XSI, 3ds Max, Blender, and Sketchup of course, to create sophisticated models with textures, export them as COLLADA, and then import or drag and drop them into Google Earth.
Combined with the new KML support for LOD and streaming, you have some pretty high performance 3D visualization, virtual reality and advertising capabilities. Suddenly Google Earth is opened up to the entire creative community.
What is also interesting is that game developers, who are very familiar with COLLADA can now start exporting their assets to Google Earth. (FYI Collada is the file format for the new PlayStation3) IMHO it does not seem far off when this will enable Google Earth to beome the new Second Life but with true geospatial capabilities.
At this point, Google Earth has not implemented support for animation, shaders or physics. But these are supported in the COLLADA format, so it is likely only a matter of time.
Suddenly, there is this venue where anyone who does 3D models will have a place where they can display these models. And it is a mass market commodity venue. There has never been anything like this. Google Earth is single handedly making 3D visualization on the web, become an everyday thing. And with Collada support, they are making it easy for everyone to participate and contribute content.
Sure you can use high end systems like Autodesk or Maya to display 3D renderings and scenes. But that is not mainstream and not anywhere as easy as Google Earth to use. There is room for both, but Google Earth is compelling to untrained (as well as highly trained) users. It makes viewing 3D models in context, easier and more engaging. Google Earth's 3D look and fell is almost like a video game - and that is a good thing for getting people involved!
So with Collada and Google Earth, you have interoperability between programs for 3D content and you have a mainstream way to engage people with the content."
Related Posts with Thumbnails
|
{
"url": "https://adverlab.blogspot.com/2006/06/google-earth-compatible-with-other-3d.html",
"source_domain": "adverlab.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "114658",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GSPP2SBKGKJA4MHKQQYD637ZKAKOKED6",
"WARC-Concurrent-To": "<urn:uuid:44eb68db-d331-48d0-b33d-a067bf464428>",
"WARC-Date": "2021-06-14T06:15:47Z",
"WARC-IP-Address": "172.217.164.129",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:CGXPFKCYIRFOIHJYWEBZ2C5A7THABZTR",
"WARC-Record-ID": "<urn:uuid:54639681-0500-4811-b467-ca39606b5efe>",
"WARC-Target-URI": "https://adverlab.blogspot.com/2006/06/google-earth-compatible-with-other-3d.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:201d4cf4-d452-4baf-a561-882930b69136>"
},
"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-182.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
51,
52,
53,
54,
55,
56,
297,
298,
518,
519,
520,
753,
754,
847,
848,
1006,
1007,
1237,
1238,
1477,
1478,
1841,
1842,
2070,
2071,
2401,
2402,
2579,
2580,
2975,
2976,
3429,
3430,
3588
],
"line_end_idx": [
51,
52,
53,
54,
55,
56,
297,
298,
518,
519,
520,
753,
754,
847,
848,
1006,
1007,
1237,
1238,
1477,
1478,
1841,
1842,
2070,
2071,
2401,
2402,
2579,
2580,
2975,
2976,
3429,
3430,
3588,
3619
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3619,
"ccnet_original_nlines": 34,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4275362193584442,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.056521739810705185,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11304347962141037,
"rps_doc_frac_unique_words": 0.4537953734397888,
"rps_doc_mean_word_length": 4.805280685424805,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.117120742797852,
"rps_doc_word_count": 606,
"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.05288461968302727,
"rps_doc_frac_chars_top_3gram": 0.013392860069870949,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -278.58575439453125,
"rps_doc_books_importance_length_correction": -278.58575439453125,
"rps_doc_openwebtext_importance": -151.3333740234375,
"rps_doc_openwebtext_importance_length_correction": -151.3333740234375,
"rps_doc_wikipedia_importance": -108.06962585449219,
"rps_doc_wikipedia_importance_length_correction": -108.06962585449219
},
"fasttext": {
"dclm": 0.0403628908097744,
"english": 0.9473856091499329,
"fineweb_edu_approx": 2.168515682220459,
"eai_general_math": 0.42910850048065186,
"eai_open_web_math": 0.20581316947937012,
"eai_web_code": 0.21701890230178833
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "006.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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
|
3,885,239,903,286,013,400 |
Direct Upload to S3 (using AWS Signature v4 & PHP)
Direct Upload to S3 (using AWS Signature v4 & PHP)
135 Comments http://bit.ly/1wdd9c8
The contents of this article has been replaced by a PHP Composer package, hope you find it useful.
View on Github
This article is specifically about directly uploading files to S3 using the AWS Signature Version 4, which is mandatory for new S3 regions, like Frankfurt (EU). It will also become required on other regions at some point as Amazon migrate over, so it’s recommended to use this method where ever possible. For more info, you can read about Signature v4 in their documentation.
Specifically around the AWS Signature V4, the documentation is brief but complete. The one page in particular which is helpful to explain the process of building your policy, creating a signature and building a form is this one.
This code uses PHP to generate the policy and signature, but all before the initial request is sent and the upload made, so the file itself won’t be transferred through your server. This has many advantages, especially on cloud platforms where uploading a large file would cause unnecessary performance issues. Once the AWS signature and policy have been built, this method will then send the file with jQuery fileupload plugin to manage the ajax request for us, reporting back on it’s progress.
Instead of splitting the code up and explaining each bit, like we did in the previous post, below is a complete copy of the code. There’s also a download link and a github repo if you want to see it in action.
Download (zip) View on Github
The Result:
Screencast from 03-12-15 20_17_49
Full Code: (single page)
<?php
// TODO Enter your AWS credentials
// Note: these can be set as environment variables (with the same name) or constants.
define('AWS_ACCESS_KEY', '');
define('AWS_SECRET', '');
// TODO Enter your bucket and region details (see details below)
$s3FormDetails = getS3Details('', '');
/**
* Get all the necessary details to directly upload a private file to S3
* asynchronously with JavaScript using the Signature V4.
*
* @param string $s3Bucket your bucket's name on s3.
* @param string $region the bucket's location/region, see here for details: http://amzn.to/1FtPG6r
* @param string $acl the visibility/permissions of your file, see details: http://amzn.to/18s9Gv7
*
* @return array ['url', 'inputs'] the forms url to s3 and any inputs the form will need.
*/
function getS3Details($s3Bucket, $region, $acl = 'private') {
// Options and Settings
$awsKey = (!empty(getenv('AWS_ACCESS_KEY')) ? getenv('AWS_ACCESS_KEY') : AWS_ACCESS_KEY);
$awsSecret = (!empty(getenv('AWS_SECRET')) ? getenv('AWS_SECRET') : AWS_SECRET);
$algorithm = "AWS4-HMAC-SHA256";
$service = "s3";
$date = gmdate("Ymd\THis\Z");
$shortDate = gmdate("Ymd");
$requestType = "aws4_request";
$expires = "86400"; // 24 Hours
$successStatus = "201";
$url = "//{$s3Bucket}.{$service}-{$region}.amazonaws.com";
// Step 1: Generate the Scope
$scope = [
$awsKey,
$shortDate,
$region,
$service,
$requestType
];
$credentials = implode('/', $scope);
// Step 2: Making a Base64 Policy
$policy = [
'expiration' => gmdate('Y-m-d\TG:i:s\Z', strtotime('+6 hours')),
'conditions' => [
['bucket' => $s3Bucket],
['acl' => $acl],
['starts-with', '$key', ''],
['starts-with', '$Content-Type', ''],
['starts-with', '$Content-Length', ''],
['success_action_status' => $successStatus],
['x-amz-credential' => $credentials],
['x-amz-algorithm' => $algorithm],
['x-amz-date' => $date],
['x-amz-expires' => $expires],
]
];
$base64Policy = base64_encode(json_encode($policy));
// Step 3: Signing your Request (Making a Signature)
$dateKey = hash_hmac('sha256', $shortDate, 'AWS4' . $awsSecret, true);
$dateRegionKey = hash_hmac('sha256', $region, $dateKey, true);
$dateRegionServiceKey = hash_hmac('sha256', $service, $dateRegionKey, true);
$signingKey = hash_hmac('sha256', $requestType, $dateRegionServiceKey, true);
$signature = hash_hmac('sha256', $base64Policy, $signingKey);
// Step 4: Build form inputs
// This is the data that will get sent with the form to S3
$inputs = [
'Content-Type' => '',
'Content-Length' => '',
'acl' => $acl,
'success_action_status' => $successStatus,
'policy' => $base64Policy,
'X-amz-credential' => $credentials,
'X-amz-algorithm' => $algorithm,
'X-amz-date' => $date,
'X-amz-expires' => $expires,
'X-amz-signature' => $signature
];
return compact('url', 'inputs');
}
?>
<!doctype html>
<html>
<head>
<meta charset="utf-8">
<title>Direct Upload Example</title>
<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/normalize/3.0.3/normalize.min.css">
<link rel="stylesheet" href="style.css">
</head>
<body>
<div class="container">
<h1>Direct Upload</h1>
<!-- Direct Upload to S3 Form -->
<form action="<?php echo $s3FormDetails['url']; ?>"
method="POST"
enctype="multipart/form-data"
class="direct-upload">
<?php foreach ($s3FormDetails['inputs'] as $name => $value) { ?>
<input type="hidden" name="<?php echo $name; ?>" value="<?php echo $value; ?>">
<?php } ?>
<!-- Key is the file's name on S3 and will be filled in with JS -->
<input type="hidden" name="key" value="">
<input type="file" name="file" multiple>
<!-- Progress Bars to show upload completion percentage -->
<div class="progress-bar-area"></div>
</form>
<!-- This area will be filled with our results (mainly for debugging) -->
<div>
<h3>Files</h3>
<textarea id="uploaded"></textarea>
</div>
</div>
<!-- Start of the JavaScript -->
<!-- Load jQuery & jQuery UI (Needed for the FileUpload Plugin) -->
<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.2.0/jquery.min.js"></script>
<script src="https://ajax.googleapis.com/ajax/libs/jqueryui/1.11.4/jquery-ui.min.js"></script>
<!-- Load the FileUpload Plugin (more info @ https://github.com/blueimp/jQuery-File-Upload) -->
<script src="https://cdnjs.cloudflare.com/ajax/libs/blueimp-file-upload/9.5.7/jquery.fileupload.js"></script>
<script>
$(document).ready(function () {
// Assigned to variable for later use.
var form = $('.direct-upload');
var filesUploaded = [];
// Place any uploads within the descending folders
// so ['test1', 'test2'] would become /test1/test2/filename
var folders = [];
form.fileupload({
url: form.attr('action'),
type: form.attr('method'),
datatype: 'xml',
add: function (event, data) {
// Show warning message if your leaving the page during an upload.
window.onbeforeunload = function () {
return 'You have unsaved changes.';
};
// Give the file which is being uploaded it's current content-type (It doesn't retain it otherwise)
// and give it a unique name (so it won't overwrite anything already on s3).
var file = data.files[0];
var filename = Date.now() + '.' + file.name.split('.').pop();
form.find('input[name="Content-Type"]').val(file.type);
form.find('input[name="Content-Length"]').val(file.size);
form.find('input[name="key"]').val((folders.length ? folders.join('/') + '/' : '') + filename);
// Actually submit to form to S3.
data.submit();
// Show the progress bar
// Uses the file size as a unique identifier
var bar = $('<div class="progress" data-mod="'+file.size+'"><div class="bar"></div></div>');
$('.progress-bar-area').append(bar);
bar.slideDown('fast');
},
progress: function (e, data) {
// This is what makes everything really cool, thanks to that callback
// you can now update the progress bar based on the upload progress.
var percent = Math.round((data.loaded / data.total) * 100);
$('.progress[data-mod="'+data.files[0].size+'"] .bar').css('width', percent + '%').html(percent+'%');
},
fail: function (e, data) {
// Remove the 'unsaved changes' message.
window.onbeforeunload = null;
$('.progress[data-mod="'+data.files[0].size+'"] .bar').css('width', '100%').addClass('red').html('');
},
done: function (event, data) {
window.onbeforeunload = null;
// Upload Complete, show information about the upload in a textarea
// from here you can do what you want as the file is on S3
// e.g. save reference to your server using another ajax call or log it, etc.
var original = data.files[0];
var s3Result = data.result.documentElement.children;
filesUploaded.push({
"original_name": original.name,
"s3_name": s3Result[2].innerHTML,
"size": original.size,
"url": s3Result[0].innerHTML
});
$('#uploaded').html(JSON.stringify(filesUploaded, null, 2));
}
});
});
</script>
</body>
</html>
Note: If you’re looking for an ASP.NET version then I. Auty has created a port over on GitHub.
135 responses to “Direct Upload to S3 (using AWS Signature v4 & PHP)
1. Thanks for updating this post and the code to go with v4. I’m trying to implement this, but wonder if I have the CORS policy wrong for the bucket — assuming I need it the same as your previous post, yes?
1. Edd, thanks for your reply – I was finally able to get free of other work to check back on this, and it was a simple issue: I’m working in US-East-1, and so needed to drop out the S3_REGION value from your form action. Works like a charm now.
But I have another small issue I’ll work on this morning — I’m trying to use this code to help admins upload any *massive* supporting files for their website directly to S3, but some of those are images. This code uploads to S3 so that all files are seen as “Content-Type: binary/octet-stream” but it would be good if I can read the actual mime type before upload and then set accordingly — image/gif, image/png, application/pdf, and so on. This may have come up in the comments of the previous article so I’ll search there, but am going to work at that little snippet as I have time today.
Thanks for a great piece of code here, it’s quick and streamlined. I’m glad not to have to reinvent it.
1. Neal, I’m able to extract the Content-Type out of the File Upload plugin via “data.originalFiles[0].type” within the “add” event. From there I set the value in a hidden “Content-Type” input to appease AWS. It seems to be working pretty well thus far.
1. Ted, thanks for the comment back. I’d be interested to hammer this out as you describe. Just below the realName var within the add event, I have added var contType = data.originalFiles[0].type; to grab the Content-Type, then down a few lines added form.find('input[name=Content-Type]').val(contType); to throw that value up into a hidden input field named Content-Type. But I’m definitely missing something small — just getting a 403 Forbidden back from S3. Any suggestions?
2. You’re welcome, Neal!
Hmm, for the 403 error, did you add a new condition in the policy for $Content-Type? For example, when I added the new Content-Type hidden input to the “direct-upload” form I also added ['starts-with', '$Content-Type', ''] to $policy, per the following from http://docs.aws.amazon.com/AmazonS3/latest/API/sigv4-HTTPPOSTConstructPolicy.html#sigv4-PolicyConditions:
“Each form field that you specify in a form (except x-amz-signature, file, policy, and field names that have an x-ignore- prefix) must appear in the list of conditions.”
Hopefully this does the trick for you.
1. KAPOW! That did the trick, Ted. I was definitely forgetting to make a corresponding element in the policy statement to go with the Content-Type input. Works flawlessly now. I’m particularly glad to bypass all PHP size/post/max limitations with this code, as well as offload massive files off of our Gluster storage nodes.
Thanks so much, I appreciate you taking the time.
2. Edd, thanks so much for this post! With your help I was able to unravel a few mysteries and adapt this approach to a Java environment.
1. Thanks Ted, glad to hear you got it working. I think code snippets like this should be in the AWS documentation, but instead you have to piece it together from like 4 different places.
3. Thanks so much for an awesome post! Worked like a charm! Could you please tell me how to upload multiple files in a single form?
Also I need the form to be submitted by a button instead of auto upload. Could you please help me with this?
Thanks!
1. Hi Raja, good idea. I’ll have a look at multiple file upload when I can – I’m sure it’s possible. Uploading with a button would be a case of using a click listener instead of the form submit.
1. Hi Edd,
Thank you so much for this! I am still new at this and I just could not figure the signing part out, but I was able to thanks to you. Going back to Raja’s request for the button submit, when in the script should I add it? I’ve tried using a selector and a .click in every function in there but it just does not seem to work.
Thank you!
1. Hi, uploading on a button click is ok for a single file, but is a bit trickier for multiple files – is there a reason you need to do it onclick?
4. In this code you are generating date strings formatted to say they are UTC (GMT) dates but you are using date(), which generates local datetime strings. All date() functions need to be replaced with gmdate() or the policy expiry will not make sense.
5. Hi Guys
Firstly Thanks Edd for the script. I am very new to this AWS and like to take advantage of their S3 services for storing files. I am trying to follow their latest technology or requirement lets say when using their SDK and putting a script lets say, but I am all confused.
My main concern is now to upload few files at a time and not sure I must use this “Signature Version 4” or not using PHP.
I hope I made sense.
Appreciate any reply.
1. Hi Ben! First of all, is direct upload the best solution to your problem (or would you be happy for the file to hit your server first)? If you’re happy for the file to go to your server first there are some good AWS PHP libraries which do much of the heavy work for you.
It’s possible to upload multiple files (but I haven’t posted an example yet), just by replicating the form and tinkering with the JS.
The signature version 4 is AWS’s way of verifying you (it’s the PHP at the top of the script), version 4 is coming in to replace version 2 and it depends which S3 location (US/Ireland/Germany) your using as to whether you have to use v4 or can use v2 still.
6. Hi Edd
Thank for the reply. Yes, I like to directly upload to AWS S3 as there are other problems such as timeout and file size issues on virtual servers for example. I will be using Sydney for the location, but eventually would think they would change to Signature base as well.
I have also used some third-party S3 Classes, but would think if I create something for a client it would be best to stick to the main provider preferences than continually updating their script.
As for multiple upload, not multiple part upload, I will try something in line of jQuery, but not really sure how AWS would react to that.
But before I go where would you recommend that would be a good place to get more examples for this product and resources.
Thank you kindly for looking into this post.
1. In this example we’ve used the jQuery File Upload plugin, but another one off the top of my head is dropzone (http://www.dropzonejs.com/) which I know supports multiple files quite well (and I’ve used it with direct upload). As for examples of multiple file uploads with direct upload, I don’t know of any, I’ll have to write one 😉 – let me know how it goes.
7. Thanks for a very useful article. With this one, I can put file to bucket. But how can I put a file to a folder in bucket?
(bucket > folder_one > text.txt).
I try this “//s3-eu-west-1.amazonaws.com/bucket_name/folder_one”. But It does not work.
So please reply to me.
Regards
1. Afternoon Kin, instead of changing the URL, I think you’re going to have to change the input[name="key"] – like we do with Content-Type. The key is the filename but adding a folder name and a forward slash to it should put it in the folder. Let us know if that works 🙂
8. Can you post a demo of this? This isn’t working at all for me. I copied everything as is, and added my correct credentials to the provided constants.
9. Im getting following error while uploading the media file “a non-empty Access Key (AKID) must be provided in the credential.” , Actually this server attached with IAM Role, So It doesn’t have the access key and secret key , Please help me to direct upload to this server.
10. how can i direct upload to s3 bucket for that instance attached with IAM role. without credentials how we do the direct upload for s3 bucket.
11. Ec2 Instance launched as attached with IAM Role, so we didn’t get any access key and secret. If its possible how i can get that , please help me to fix this
12. Hi , Edd
Thanks for putting so much effort into this and un-complicating alot of stuff . I would like to ask one question regarding the flow of the application…
1. The form uploading script has the url as — form.attr(‘action’) —which in turn is the s3 url
right ?
So we that form is submitted, who will fill up the hidden fields ? Aren’t those fields meant to replaced by what your php script sends ?
I am a bit confused here…
1. Hi rahul, yep the php should be filling all the hidden inputs. The form should upload a file even if no JS is loaded (it just won’t work async).
Some like Content-type and key don’t get replaced however until the form is submitted with JS.
13. Hi Edd,
This is very detailed tutorial. Thank you for that.
I just have a small question.
How can I receive fully qualified URL for the file I uploaded ?
Currently I see it only returns the file name and not full url to file.
Thanks,
1. Hi Khushi, you know the url because you’ve specified it within the form’s action – and you know the filename (or key), so the two together should give you the full url. Thanks for the comment 🙂
1. Hi Edd,
Thank you for the response.
What you mentioned works sometimes.
However, S3 changes the spaces in file name to “+” symbol. I have not tried every other possible symbol in file name.
Hence, it is always better to read the tag from the response xml.
Can you please advice on how can I get it?
Thanks,
1. Hello again Khushi, I actually updated the script the other week – allowing for multiple files (hopefully) anyway, long story short, the new version should indeed read the name of the file from the response xml. Let me know if I misunderstood, enojy 🙂
14. Hello, I am trying this script and it’s not working anymore. I am getting 403 error. I think url structure has been changed mybucket.s3-us-west-2.amazonaws.com is not working anymore.
15. Hi Edd,
Thank you for the tutorial, but I get the following error: Uncaught TypeError: $.widget is not a function
It is situated in the jquery.fileupload.js file. I googled a bit, but looks like the jquery ui has been included, so I don’t know why this doesn’t work…
1. Hi, are you loading it over https? Also, are you running this through a web server? It sounds like either jQuery UI or jQuery itself hasn’t been loaded (hence the function wouldn’t exist).
1. Looks like I included the jquery fileupload twice in different places in my project. That solved it!
Got it all working now. Wonderful!
16. Perhaps another question.
I added some custom fields to the form and added them in the policy too like this: ['starts-with', '$x-amz-meta-spot-name', ''], but as soon as I try to upload a file, I get the following error in my console:
net::ERR_CONNECTION_RESET
Any guesses why this happens? I only added the extra fields in the form…
17. Hi Edd, thanks for this awesome script and tutorial but for some reason I can’t get it to work.
I’m getting this error: net::ERR_NAME_NOT_RESOLVED
Any idea why this happens?
1. One more question Edd. I want to limit the number of files to be upload it to 1. Right now even if I remove ‘multiple’ from , it will upload all selected files or even if I select a file and then go to choose file again to replace it with a different one, it will upload both of them.
18. Was anybody able to run it in Chrome? Works fine in Firefox (after CORS configuration edited). Still does not work in Chrome. Using ubuntu so have no idea what going on in IE.
Getting x-amz-id-2 and x-amz-request-id headers in OPTION request while in Firefox there are some additional ex. Content-Length, Vary, Server etc.
19. I had the same error within Chrome, after some changes it started working with this policy:
<?xml version="1.0" encoding="UTF-8"?>
<CORSConfiguration xmlns="http://s3.amazonaws.com/doc/2006-03-01/">
<CORSRule>
<AllowedOrigin>*</AllowedOrigin>
<AllowedMethod>GET</AllowedMethod>
<AllowedMethod>POST</AllowedMethod>
<AllowedMethod>PUT</AllowedMethod>
<MaxAgeSeconds>3000</MaxAgeSeconds>
<AllowedHeader>*</AllowedHeader>
</CORSRule>
</CORSConfiguration>
20. Hi Edd, thanks! Works great even locally but got a problem since my site works on https protocol. Is it possible to fix this (not sure it is).
getting security error in Firefox:
img.k.ua.s3.eu-central-1.amazonaws.com uses an invalid security certificate.
The certificate is only valid for the following names:
*.s3.eu-central-1.amazonaws.com, *.s3-eu-central-1.amazonaws.com, s3-eu-central-1.amazonaws.com, s3.eu-central-1.amazonaws.com
(Error code: ssl_error_bad_cert_domain)
in Chrome something like net::ERR_INSECURE_RESPONCE
1. solved this. may be usefull.
for sites with https bucket name should not contain “.” (dot). otherwise there’ll be error described above
21. This is a great tutorial and I’m working through it to adapt it for my form that has other fields. Essentially I’m having the file field upload the file and then put the S3 key in a text field that is submitted with the other data.
I’m having a problem with the file upload, getting the error: "Invalid Policy: Invalid 'conditions' value: must be a List."
I’m running a PHP5.3 server so I’ve had to change all the array brackets to parentheses like this:
// Step 2: Making a Base64 Policy
$policy = array(
'expiration' => gmdate('Y-m-dTG:i:sZ', strtotime('+6 hours')),
'conditions' => array(
'bucket' => $s3Bucket,
'acl' => $acl,
array('starts-with', '$key', ''),
array('starts-with', '$Content-Type', ''),
'success_action_status' => $successStatus,
'x-amz-credential' => $credentials,
'x-amz-algorithm' => $algorithm,
'x-amz-date' => $date,
'x-amz-expires' => $expires,
)
);
(Sorry I don’t know the markup to make that look fancy.) Any ideas what could be throwing this error? From what I can tell I’m sending the exact same array of data.
1. OK wait, I think I’m onto something. Since my file field is inside my main form (it’s not in its own form), it’s uploading all the other fields along with the file itself. Ted mentioned above that I need a condition for every field in the form. This sounds like a maintenance headache. Is there a way to tell it to ignore “any other fields?”
2. I tried putting this in a form all by itself and it still returns the “Invalid Policy: Invalid ‘conditions’ value: must be a List.” error. The funny thing is that if you Google this error, you get a SINGLE result, which is a git diff entry for a git project.
3. In the end I’ve upgraded my server to PHP 5.5, and used the new array syntax (square brackets [ ]) and it seems to be working now.
I think the problem was that not every “element” in the array I was passing was in it’s own array. In other words, it should’ve looked like this:
// Step 2: Making a Base64 Policy
$policy = array(
‘expiration’ => gmdate(‘Y-m-dTG:i:sZ’, strtotime(‘+6 hours’)),
‘conditions’ => array(
array(‘bucket’ => $s3Bucket),
array(‘acl’ => $acl),
array(array(‘starts-with’, ‘$key’, ”)),
array(‘starts-with’, ‘$Content-Type’, ”),
array(‘success_action_status’ => $successStatus),
array(‘x-amz-credential’ => $credentials),
array(‘x-amz-algorithm’ => $algorithm),
array(‘x-amz-date’ => $date),
array(‘x-amz-expires’ => $expires),
)
);
4. Hi Josh, pleased to hear it seems to be working now. I’m not too sure on the min version for this code, but you might have just found that out for me 🙂
ps. I’ll make the code look ‘fancy’ now 😉
22. Hi, thanks for the work buddy!
Do you know how to predefine the filename and don’t allow the user change it?
Thanks again!
1. No worries Salvador, if you set the key input to be anything other than ${filename} and remove all JavaScript attempts to change it when whatever the key value is will be the filename. Good luck
23. Thanks Edd, I am so happy to be able to use your example to upload to my s3.
But before that I had this error “400 – Bad Request”. This is cause by having two ‘name=”key”‘ in the html.
It seem like your function getFormInputsAsHtml() already generated out the ‘name=”key”‘.
So solve the error, I removed away the extra ‘name=”key”‘.
And it works.
1. No worries, pleased it works. Didn’t know whether to include the key input in that function but decided to, with the option of not having it if you pass in false as a parameter. Thanks for the feedback 🙂
1. I’m getting a Bad Request error in the fail: function as well, but I can’t figure out what extra ‘key’ needs to be removed to get it to work.
1. Hi David, I’m sure I’m way too late to help you out, but let me know if you’re still having issues. We’re you using the composer package or the code from this post?
24. Hi Edd,
This code has been great, I’m using it in an internal site for uploading a podcast. I can upload the mp3 audio file just fine since the user selects it from a local source, the issue I’m hoping to work through is uploading the XML file that is appended and saved server side. Any ideas on how to go about this, is it even possible with this project since the file is server side? Thanks for any thoughts!
1. Hi Zack, so if I’ve got this right, your mp3 is on S3 and your xml file is on your server – but you want your xml file also on s3? Sorry if I’m not quite understanding. Feel free to drop me an email edd at designedbyaturtle.co.uk – happy to help.
25. Hi Edd.
I read your blog post and have actually written a wrapper around the signature generating wrapper. The result in term of the policy, signature and the hidden inputs are the same.
The issue I’m having is that I’m always getting the “Access Denied” error. I’ve set my CORS to:
*
GET
POST
PUT
3000
*
And set the bucket policy to:
{
"Id": "Policy1477655077323",
"Version": "2012-10-17",
"Statement": [
{
"Sid": "Stmt1477655076022",
"Action": [
"s3:PutObject"
],
"Effect": "Allow",
"Resource": "arn:aws:s3:::bucket-name/subfolder/*",
"Principal": "*"
}
]
}
What am I missing? I can’t seem to figure this out :/
1. Okay, seems like using the triple (`) doesn’t make it look like code. Sorry for that. Can’t find the edit button as-well.
26. Hi Edd!
Just wanted to let you know I’ve used your great post to create a composer package for generating signatures with a little bit more functionality and slightly more modular.
I’ve also created a bridge for Laravel users. Ofcourse you get a huge thumbs up for this!
https://github.com/kfirba/Directo
27. Just wanted to let you know Edd, you saved my day by making this example. I was trying AWS Documentation which is not really that useful for an example like this one and I was going crazy adding strange things to the key on the policy etc when it was just as easy as adding it on the form input and voila!
1. Hi Nick, as far as I know this isn’t quite possible ‘prior’ to upload – the best way would probably to use an AWS Lambda function to progress any uploaded images when they’re added to your s3 bucket. Alternatively you can use a server side call to resize the images.
28. Great tutorial. Thank you!
All works great, except in IE/Edge I get: Unable to get property ‘2’ of undefined or null reference. on this line:
filesUploaded.push({
"original_name": original.name,
"s3_name": s3Result[2].innerHTML,
"size": original.size,
"url": s3Result[0].innerHTML
});
1. apparently s3Result is undefined in IE. I think it may be related to:
var single_s3Result = data.result.documentElement.children;
29. Hi Edd, This is a great tutorial and I’m working through it I am getting problem when I tried to upload any file it goes to “fail: function (e, data) {}” in JavaScript and gives me an error so if could help me out to solve this problem it would be great.
Thanks for your good work.
1. Hi Chirag, is the error you’re having in the javascript, or is that what you’re getting back from aws? And when do you get this error?
1. Hi Edd, Thanks for your reply. Actually when uploading process finished 100% then after it shows me jquery error. You can check over this link “http://www.goindiemusic.com/newsite/upload_ajax2.php” please open console and select multiple images it shows an error.
1. Hi again, this page is failing because html form’s action=”https://goindiemusic.s3.amazonaws.com” – which implies the us-east-1 AWS region, but a different region is being specified. The response from S3 is: the region ‘us-west-2’ is wrong; expecting ‘us-east-1’. Does this help?
30. My Bucket policy editor is:
{
"Id": "Policy1477655077323",
"Version": "2012-10-17",
"Statement": [
{
"Sid": "Stmt1477655076022",
"Action": "s3:*",
"Effect": "Allow",
"Resource": "arn:aws:s3:::bucket1/*",
"Principal": "*"
}
]
}
CORS Configuration is:
*
GET
POST
PUT
3000
*
1. Hi Michele (thanks for the email prompt) – if I understand right you want to upload multiple files? But you can’t? (there were a few words missing from the above comment)
31. I want upload the same file in two “folder”: ina bucket of amazon s3 and in a directory of server (server\php\).
In your form we have , and is correct for amazon s3.
But in Jquery File Upload I have , and so I don’t upload to amazon S3.
I must change “file” to “files[]”.
Thank you for Your ansker.
32. Hi Edd, great script, thank you for your sharing. I’m using your script to upload the file to s3. It works great. but now we need upload large file over 1G, it’s impossible to upload in one post. So I want to upload by multiple parts. Does this script support multiple parts upload? If yes, how? I’m trying for a long time. But no result. Can you help, or give me some suggestion? Thank you very much.
1. oh, surprised, you replied so quickly. Thank you for your answer, wait for your news. I will continue to work on this.
33. Great tutorial! after a couple of hicups I got it working, but the only problem I am having now is the uploaded files are not viewable to the public- how do I enable this?
1. Good work John! You can make files public by using a public ACL within the signature. So when calling this function the acl param needs to be ‘public-read’ I believe.
34. Hi Thanks for the awesome tutorial it helps me a lot but i am facing one problem the file progress bar is working correctly but when it reaches 100% then the request in the browsers still runs for 2 to 3 minutes after 2 to 3 minutes the ajax request return this response
RequestTimeout Your socket connection to the server was not read from or written to within the timeout period. Idle connections will be closed
and file is does not upload on S3.
kindly please help me on this issue thanks.
1. Hi Usama, thanks for the comment – are you able to provide an example? How did you get on (I appropriate you commented a little while ago now)
1. Hi Silpa, thanks for the comment but I think I’ll need some more information – do you get a response from AWS? Are there no errors in the JS or in the actual request?
1. Sorry about that mike, you don’t know what was causing the need to upgrade? I could always add a minimum version notice if we know what’s causing it.
35. Hi Edd,
Thanks for your kindness in sharing this. One quick question from a novice; how do you go about stopping the renaming of the file?
We have an automated QC system that checks filenames before assigning test plans to them so the original name is important to be maintained.
Thanks!
1. Hi Jack, there’s a JS line like this:
form.find('input[name="key"]').val((folders.length ? folders.join('/') + '/' : '') + filename);
which needs to be removed.
1. Thanks for the quick reply!
I did this however then the file never arrives on S3, nor does the textarea populate with a result.
I feel like there’s another line that I’m missing somewhere. Thoughts if you have a sec?
1. Hi again, yes, sorry there was more. I think the key input html will need to be: (yes with the dollar and brackets)
<input type="hidden" name="key" value="${filename}">
36. Hi,
Just a comment as a gigantic big thank you. I’ve been struggling with this in Python for ages and that was driving me crazy. Official docs are a mess. Your article is clean and crystal clear and helped me a lot to find my way to a solution.
Many, many thanks.
37. Hello,
Great plugin … really love how simple everything is.
Just curious is it possible to display debug information once when all files are uploaded
this line?
$('#uploaded').html(JSON.stringify(filesUploaded, null, 2));
38. Hi Edd,
I can’t reiterate enough what Matt says above. This has been driving me crazy for days. Massive thank you. I owe you a beer.
Cheers. J
39. And congratulations on the article that I have configured Amazon cloudfront with total wce cache but it returns this error to help fix it?
Error: Bucket location region is incorrect. Please select the right one.
40. Hi Edd,
Just FYI, I got this working but I had to remove the line [‘x-amz-expires’ => $expires] otherwise I received this error:
Invalid according to Policy: Policy Condition failed: [\”eq\”, \”$x-amz-expires\”, \”8640\”]
Is this necessary for the policy? We are already setting the policy ‘expiration’.
41. Hi Edd,
All works well at local server till I uploaded online and now I’m getting net::ERR_CERT_COMMON_NAME_INVALID error.
Any advise ?
1. Hi, if you inspect element on the form element, does it look like your S3 bucket url? Happy to take emails on edd@ [this domain name] which might be easier to share specifics
42. Hey Edd,
Super awesome stuff. Not sure if it’s just myself but I’ve ran into an issue where Amazon does not send back a 201 xml response after the file hits 100%. Just hangs there.
This would happen with relatively large files (200+ mb) being uploaded from locations that were remote from the bucket’s region. E.g. west coast uploading to us-east-1.
Adding Content-Length to the policy and input seems to have resolved this. Frustrating as it’s not even documented on amazon (only as a requirement for PUT requests, not POST).
1. Ahh good to know Matthew, just so I’m clear, once you’ve added the content length input do you fill it’s value with JavaScript?
1. Yes. For your example it would look something like this:
form.find(‘input[name=”Content-Type”]’).val(file.type);
form.find(‘input[name=”Content-Length”]’).val(file.size);
1. Hi Matthew, I think that’s a good shout so I’ve updated the code in this post to also send Content-Length
43. Hello and thank you so much for your script I plan to use for a new project. Quick question – if someone can help me here – how can I receive in PHP the name of the file after upload ? Thank you so much
44. Hello again, I thought I should add something : I know I can give the name I want to the name with but I actually need to know if the file has been sent or not, that’s why I asked you if there was a way to receive the uploaded file name in PHP.
45. Hello Edd, this has been very helpful. Any suggestions on how to upload a JPEG image after fixing its orientation, using your script? Looking for a client side solution… So far, no luck due to the browser restrictions on file manipulation.
1. Hi Krishna, I think your best solution, if you can, is to have a Lambda function which is triggered by a file being added to S3 and crops it – that way you have both the original and the crop.
I might be able to dig out an example, but there are plenty on the web.
E
46. Hello thanks got this great script
one small thing if I have multiple filed to upload.
how can I run I script when finish uploading all of them.
thank dani
1. Hi Dani, you can count how many files you’re uploading by incrementing a variable when adding them, then on completing an upload if the total = number of completions you know you’ve all finished.
47. Hi edd, ive manage to upload to S3 using these codes at home, problem is in my office we have proxy. In the normal sdk that i’ve used, we can configure proxy in S3Client. how does proxy being handle here? Thanks in advance.
1. I’ve been thinking on this one Shahril – I’m not quite sure how this should be handled, because I’m not sure if the proxy details would be entered into the php/signature generation or is it for the JS to use.
Leave a Reply
Your email address will not be published. Required fields are marked *
|
{
"url": "https://www.designedbyaturtle.co.uk/direct-upload-to-s3-using-aws-signature-v4-php/",
"source_domain": "www.designedbyaturtle.co.uk",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "261990",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OLDK76N6NKYAIZKZ66ETEQDKMU73J6BI",
"WARC-Concurrent-To": "<urn:uuid:9d949146-74e9-4799-b01f-92ad945f0d1c>",
"WARC-Date": "2019-07-17T13:18:04Z",
"WARC-IP-Address": "34.248.232.73",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:H36YWDNPTVQHNPFB7MMY5XR3VHRF73KM",
"WARC-Record-ID": "<urn:uuid:a86c712c-981e-4589-9ac8-ec9909feb3ca>",
"WARC-Target-URI": "https://www.designedbyaturtle.co.uk/direct-upload-to-s3-using-aws-signature-v4-php/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9ca33c0d-6279-47da-a68b-f7204594cdc2>"
},
"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-30-18-27.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
51,
52,
103,
104,
145,
146,
245,
246,
263,
264,
640,
641,
870,
871,
1367,
1368,
1578,
1579,
1580,
1614,
1615,
1627,
1628,
1662,
1663,
1688,
1689,
1695,
1696,
1731,
1817,
1847,
1873,
1874,
1939,
1978,
1979,
1983,
2056,
2114,
2117,
2170,
2272,
2376,
2379,
2469,
2473,
2535,
2536,
2564,
2658,
2743,
2744,
2781,
2802,
2836,
2868,
2903,
2939,
2967,
3030,
3031,
3065,
3080,
3097,
3117,
3134,
3152,
3173,
3180,
3221,
3222,
3260,
3276,
3349,
3375,
3412,
3441,
3482,
3532,
3584,
3641,
3691,
3738,
3775,
3818,
3828,
3835,
3892,
3893,
3950,
4025,
4092,
4173,
4255,
4256,
4322,
4323,
4356,
4419,
4435,
4465,
4497,
4520,
4571,
4606,
4650,
4691,
4722,
4759,
4799,
4806,
4807,
4844,
4846,
4847,
4850,
4851,
4867,
4874,
4885,
4916,
4961,
5073,
5122,
5134,
5145,
5146,
5178,
5213,
5214,
5260,
5324,
5356,
5404,
5445,
5446,
5527,
5627,
5654,
5655,
5739,
5797,
5854,
5855,
5931,
5985,
5986,
6006,
6007,
6093,
6111,
6142,
6194,
6213,
6214,
6229,
6230,
6271,
6347,
6444,
6547,
6548,
6652,
6770,
6771,
6788,
6832,
6833,
6888,
6936,
6976,
6977,
7044,
7120,
7154,
7155,
7189,
7235,
7282,
7319,
7369,
7370,
7461,
7523,
7587,
7614,
7615,
7739,
7840,
7890,
7976,
8056,
8138,
8258,
8259,
8317,
8356,
8357,
8406,
8475,
8592,
8653,
8700,
8723,
8774,
8868,
8961,
9045,
9171,
9194,
9241,
9306,
9360,
9486,
9509,
9560,
9614,
9615,
9707,
9790,
9892,
9946,
10023,
10068,
10128,
10190,
10241,
10298,
10326,
10411,
10433,
10453,
10469,
10487,
10499,
10507,
10508,
10509,
10604,
10605,
10674,
10675,
10884,
10885,
11137,
11138,
11737,
11738,
11850,
11851,
12113,
12114,
12602,
12603,
12636,
12637,
13011,
13012,
13192,
13193,
13242,
13243,
13578,
13579,
13641,
13642,
13782,
13783,
13975,
13976,
14110,
14111,
14224,
14225,
14237,
14238,
14437,
14438,
14455,
14456,
14789,
14790,
14809,
14810,
14966,
14967,
15222,
15223,
15236,
15513,
15639,
15664,
15690,
15691,
15969,
15970,
16110,
16111,
16375,
16376,
16388,
16664,
16665,
16865,
16866,
17009,
17010,
17136,
17137,
17186,
17187,
17553,
17554,
17682,
17720,
17812,
17839,
17851,
17852,
18128,
18129,
18284,
18285,
18562,
18563,
18711,
18712,
18875,
18876,
18891,
18892,
19048,
19049,
19148,
19160,
19161,
19302,
19303,
19333,
19334,
19486,
19487,
19588,
19589,
19603,
19659,
19693,
19761,
19837,
19849,
19850,
20051,
20052,
20069,
20105,
20106,
20150,
20276,
20277,
20351,
20352,
20403,
20419,
20420,
20683,
20684,
20874,
20875,
20889,
20890,
21000,
21001,
21158,
21159,
21355,
21356,
21466,
21467,
21510,
21511,
21543,
21544,
21757,
21758,
21788,
21793,
21794,
21871,
21872,
21974,
22029,
22060,
22061,
22355,
22356,
22538,
22689,
22690,
22788,
22789,
22832,
22904,
22923,
22968,
23015,
23063,
23110,
23158,
23203,
23223,
23248,
23253,
23402,
23441,
23442,
23523,
23528,
23587,
23722,
23727,
23772,
23777,
23778,
23834,
23835,
23871,
23984,
23985,
24223,
24224,
24352,
24353,
24456,
24457,
24495,
24516,
24584,
24612,
24641,
24662,
24702,
24751,
24800,
24842,
24881,
24910,
24945,
24952,
24959,
24964,
24965,
25134,
25135,
25484,
25485,
25751,
25752,
25890,
25891,
26043,
26044,
26084,
26107,
26177,
26207,
26246,
26277,
26326,
26377,
26436,
26488,
26538,
26578,
26623,
26633,
26642,
26649,
26808,
26809,
26857,
26858,
26895,
26896,
26978,
26979,
26997,
26998,
27200,
27201,
27284,
27285,
27397,
27398,
27491,
27492,
27555,
27556,
27574,
27575,
27786,
27787,
27938,
27939,
28115,
28116,
28130,
28131,
28540,
28541,
28795,
28796,
28810,
28811,
28994,
28995,
29095,
29096,
29105,
29119,
29135,
29152,
29168,
29185,
29199,
29208,
29213,
29214,
29248,
29249,
29255,
29289,
29319,
29339,
29347,
29382,
29401,
29424,
29434,
29460,
29519,
29543,
29551,
29558,
29564,
29569,
29570,
29628,
29629,
29758,
29759,
29773,
29774,
29951,
30045,
30046,
30084,
30085,
30397,
30398,
30672,
30673,
30706,
30825,
30826,
30851,
30891,
30933,
30964,
31001,
31009,
31086,
31152,
31153,
31414,
31445,
31446,
31588,
31589,
31862,
31863,
32154,
32155,
32189,
32190,
32196,
32230,
32260,
32280,
32288,
32323,
32348,
32374,
32419,
32443,
32451,
32458,
32464,
32465,
32492,
32493,
32499,
32507,
32516,
32524,
32533,
32539,
32540,
32718,
32719,
32838,
32895,
32970,
33009,
33040,
33041,
33449,
33450,
33578,
33579,
33757,
33758,
33932,
33933,
34210,
34357,
34396,
34444,
34445,
34595,
34596,
34770,
34771,
34928,
34929,
34943,
34944,
35079,
35080,
35225,
35226,
35238,
35239,
35284,
35285,
35387,
35388,
35421,
35422,
35459,
35460,
35568,
35569,
35666,
35667,
35794,
35795,
35858,
35868,
35869,
36114,
36115,
36138,
36139,
36152,
36153,
36210,
36211,
36305,
36320,
36321,
36386,
36400,
36401,
36530,
36531,
36545,
36546,
36691,
36768,
36769,
36783,
36784,
36909,
36910,
37007,
37008,
37094,
37095,
37109,
37110,
37229,
37230,
37247,
37248,
37430,
37431,
37446,
37447,
37623,
37624,
37797,
37798,
37979,
37980,
38115,
38116,
38182,
38183,
38184,
38248,
38314,
38315,
38432,
38433,
38642,
38643,
38894,
38895,
39141,
39142,
39342,
39343,
39421,
39422,
39430,
39431,
39472,
39528,
39590,
39605,
39606,
39809,
39810,
40040,
40041,
40257,
40258,
40272,
40273
],
"line_end_idx": [
51,
52,
103,
104,
145,
146,
245,
246,
263,
264,
640,
641,
870,
871,
1367,
1368,
1578,
1579,
1580,
1614,
1615,
1627,
1628,
1662,
1663,
1688,
1689,
1695,
1696,
1731,
1817,
1847,
1873,
1874,
1939,
1978,
1979,
1983,
2056,
2114,
2117,
2170,
2272,
2376,
2379,
2469,
2473,
2535,
2536,
2564,
2658,
2743,
2744,
2781,
2802,
2836,
2868,
2903,
2939,
2967,
3030,
3031,
3065,
3080,
3097,
3117,
3134,
3152,
3173,
3180,
3221,
3222,
3260,
3276,
3349,
3375,
3412,
3441,
3482,
3532,
3584,
3641,
3691,
3738,
3775,
3818,
3828,
3835,
3892,
3893,
3950,
4025,
4092,
4173,
4255,
4256,
4322,
4323,
4356,
4419,
4435,
4465,
4497,
4520,
4571,
4606,
4650,
4691,
4722,
4759,
4799,
4806,
4807,
4844,
4846,
4847,
4850,
4851,
4867,
4874,
4885,
4916,
4961,
5073,
5122,
5134,
5145,
5146,
5178,
5213,
5214,
5260,
5324,
5356,
5404,
5445,
5446,
5527,
5627,
5654,
5655,
5739,
5797,
5854,
5855,
5931,
5985,
5986,
6006,
6007,
6093,
6111,
6142,
6194,
6213,
6214,
6229,
6230,
6271,
6347,
6444,
6547,
6548,
6652,
6770,
6771,
6788,
6832,
6833,
6888,
6936,
6976,
6977,
7044,
7120,
7154,
7155,
7189,
7235,
7282,
7319,
7369,
7370,
7461,
7523,
7587,
7614,
7615,
7739,
7840,
7890,
7976,
8056,
8138,
8258,
8259,
8317,
8356,
8357,
8406,
8475,
8592,
8653,
8700,
8723,
8774,
8868,
8961,
9045,
9171,
9194,
9241,
9306,
9360,
9486,
9509,
9560,
9614,
9615,
9707,
9790,
9892,
9946,
10023,
10068,
10128,
10190,
10241,
10298,
10326,
10411,
10433,
10453,
10469,
10487,
10499,
10507,
10508,
10509,
10604,
10605,
10674,
10675,
10884,
10885,
11137,
11138,
11737,
11738,
11850,
11851,
12113,
12114,
12602,
12603,
12636,
12637,
13011,
13012,
13192,
13193,
13242,
13243,
13578,
13579,
13641,
13642,
13782,
13783,
13975,
13976,
14110,
14111,
14224,
14225,
14237,
14238,
14437,
14438,
14455,
14456,
14789,
14790,
14809,
14810,
14966,
14967,
15222,
15223,
15236,
15513,
15639,
15664,
15690,
15691,
15969,
15970,
16110,
16111,
16375,
16376,
16388,
16664,
16665,
16865,
16866,
17009,
17010,
17136,
17137,
17186,
17187,
17553,
17554,
17682,
17720,
17812,
17839,
17851,
17852,
18128,
18129,
18284,
18285,
18562,
18563,
18711,
18712,
18875,
18876,
18891,
18892,
19048,
19049,
19148,
19160,
19161,
19302,
19303,
19333,
19334,
19486,
19487,
19588,
19589,
19603,
19659,
19693,
19761,
19837,
19849,
19850,
20051,
20052,
20069,
20105,
20106,
20150,
20276,
20277,
20351,
20352,
20403,
20419,
20420,
20683,
20684,
20874,
20875,
20889,
20890,
21000,
21001,
21158,
21159,
21355,
21356,
21466,
21467,
21510,
21511,
21543,
21544,
21757,
21758,
21788,
21793,
21794,
21871,
21872,
21974,
22029,
22060,
22061,
22355,
22356,
22538,
22689,
22690,
22788,
22789,
22832,
22904,
22923,
22968,
23015,
23063,
23110,
23158,
23203,
23223,
23248,
23253,
23402,
23441,
23442,
23523,
23528,
23587,
23722,
23727,
23772,
23777,
23778,
23834,
23835,
23871,
23984,
23985,
24223,
24224,
24352,
24353,
24456,
24457,
24495,
24516,
24584,
24612,
24641,
24662,
24702,
24751,
24800,
24842,
24881,
24910,
24945,
24952,
24959,
24964,
24965,
25134,
25135,
25484,
25485,
25751,
25752,
25890,
25891,
26043,
26044,
26084,
26107,
26177,
26207,
26246,
26277,
26326,
26377,
26436,
26488,
26538,
26578,
26623,
26633,
26642,
26649,
26808,
26809,
26857,
26858,
26895,
26896,
26978,
26979,
26997,
26998,
27200,
27201,
27284,
27285,
27397,
27398,
27491,
27492,
27555,
27556,
27574,
27575,
27786,
27787,
27938,
27939,
28115,
28116,
28130,
28131,
28540,
28541,
28795,
28796,
28810,
28811,
28994,
28995,
29095,
29096,
29105,
29119,
29135,
29152,
29168,
29185,
29199,
29208,
29213,
29214,
29248,
29249,
29255,
29289,
29319,
29339,
29347,
29382,
29401,
29424,
29434,
29460,
29519,
29543,
29551,
29558,
29564,
29569,
29570,
29628,
29629,
29758,
29759,
29773,
29774,
29951,
30045,
30046,
30084,
30085,
30397,
30398,
30672,
30673,
30706,
30825,
30826,
30851,
30891,
30933,
30964,
31001,
31009,
31086,
31152,
31153,
31414,
31445,
31446,
31588,
31589,
31862,
31863,
32154,
32155,
32189,
32190,
32196,
32230,
32260,
32280,
32288,
32323,
32348,
32374,
32419,
32443,
32451,
32458,
32464,
32465,
32492,
32493,
32499,
32507,
32516,
32524,
32533,
32539,
32540,
32718,
32719,
32838,
32895,
32970,
33009,
33040,
33041,
33449,
33450,
33578,
33579,
33757,
33758,
33932,
33933,
34210,
34357,
34396,
34444,
34445,
34595,
34596,
34770,
34771,
34928,
34929,
34943,
34944,
35079,
35080,
35225,
35226,
35238,
35239,
35284,
35285,
35387,
35388,
35421,
35422,
35459,
35460,
35568,
35569,
35666,
35667,
35794,
35795,
35858,
35868,
35869,
36114,
36115,
36138,
36139,
36152,
36153,
36210,
36211,
36305,
36320,
36321,
36386,
36400,
36401,
36530,
36531,
36545,
36546,
36691,
36768,
36769,
36783,
36784,
36909,
36910,
37007,
37008,
37094,
37095,
37109,
37110,
37229,
37230,
37247,
37248,
37430,
37431,
37446,
37447,
37623,
37624,
37797,
37798,
37979,
37980,
38115,
38116,
38182,
38183,
38184,
38248,
38314,
38315,
38432,
38433,
38642,
38643,
38894,
38895,
39141,
39142,
39342,
39343,
39421,
39422,
39430,
39431,
39472,
39528,
39590,
39605,
39606,
39809,
39810,
40040,
40041,
40257,
40258,
40272,
40273,
40343
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 40343,
"ccnet_original_nlines": 740,
"rps_doc_curly_bracket": 0.001041069976054132,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3396312892436981,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.037673190236091614,
"rps_doc_frac_lines_end_with_ellipsis": 0.005398110020905733,
"rps_doc_frac_no_alph_words": 0.2900492548942566,
"rps_doc_frac_unique_words": 0.23634782433509827,
"rps_doc_mean_word_length": 4.771130561828613,
"rps_doc_num_sentences": 616,
"rps_doc_symbol_to_word_ratio": 0.0010305700125172734,
"rps_doc_unigram_entropy": 6.057850360870361,
"rps_doc_word_count": 5750,
"rps_doc_frac_chars_dupe_10grams": 0.014143030159175396,
"rps_doc_frac_chars_dupe_5grams": 0.054312169551849365,
"rps_doc_frac_chars_dupe_6grams": 0.03911205008625984,
"rps_doc_frac_chars_dupe_7grams": 0.03459211066365242,
"rps_doc_frac_chars_dupe_8grams": 0.03349858149886131,
"rps_doc_frac_chars_dupe_9grams": 0.024349350482225418,
"rps_doc_frac_chars_top_2gram": 0.005248960107564926,
"rps_doc_frac_chars_top_3gram": 0.003936720080673695,
"rps_doc_frac_chars_top_4gram": 0.002332869917154312,
"rps_doc_books_importance": -3325.53564453125,
"rps_doc_books_importance_length_correction": -3325.53564453125,
"rps_doc_openwebtext_importance": -2274.14892578125,
"rps_doc_openwebtext_importance_length_correction": -2274.14892578125,
"rps_doc_wikipedia_importance": -2021.0343017578125,
"rps_doc_wikipedia_importance_length_correction": -2021.0343017578125
},
"fasttext": {
"dclm": 0.03523712977766991,
"english": 0.871624767780304,
"fineweb_edu_approx": 1.043452501296997,
"eai_general_math": 0.44422203302383423,
"eai_open_web_math": 0.2727774977684021,
"eai_web_code": 0.02418673038482666
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "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,190,611,790,991,362,600 |
Lumberyard
User Guide (Version 1.21)
Using the InstantVR Slice
This topic references tools and features that are legacy. If you want to use legacy tools in Lumberyard Editor, disable the CryEntity Removal gem using the Project Configurator or the command line. To learn more about legacy features, see the Amazon Lumberyard Legacy Reference.
The instantVR slice is a set of entities, scripts, and assets that provide basic pieces of VR functionality to give you a starting point from which you can build your own VR application.
The VR functionality provided in this slice includes:
• Implementation of models-tracked controllers
• Teleportation using a navigation mesh to define a valid area
• Generation of a starting navigation area
The instantVR slice is part of the Virtual Reality Project sample level. Follow the instructions in VirtualRealityProject to download, install, and select the Virtual Reality Project before performing the following procedure.
To use the instantVR slice
1. In the Asset Browser, navigate to dev\VirtualRealityProject\slices\.
2. Drag instantvr.slice into the viewport.
The Lumberyard beaver is the starting location in this slice. Two controllers and a navigation area also appear.
3. Click the VR Preview button to enable VR preview, and then press Ctrl+G to run your level.
You can use the trigger buttons on your controllers to teleport around the space.
|
{
"url": "https://docs.aws.amazon.com/lumberyard/latest/userguide/virtual-reality-instant-vr.html",
"source_domain": "docs.aws.amazon.com",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "19985",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:26K4UNHVK6Q4HQKKAL344IZOY7LY3TVG",
"WARC-Concurrent-To": "<urn:uuid:0536acb3-a50c-474a-a6b3-824948726057>",
"WARC-Date": "2019-11-21T08:09:18Z",
"WARC-IP-Address": "176.32.98.189",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:FAGWSMDCYKSMHLPM32JBA5WOFV4YWPR3",
"WARC-Record-ID": "<urn:uuid:0cc4655d-0356-4113-a57c-c3c82f9c5391>",
"WARC-Target-URI": "https://docs.aws.amazon.com/lumberyard/latest/userguide/virtual-reality-instant-vr.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d2384b5f-3edf-4e27-991e-c384342fedac>"
},
"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-87.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,
37,
38,
64,
65,
344,
345,
532,
533,
587,
588,
637,
638,
703,
704,
749,
750,
976,
977,
1004,
1005,
1079,
1080,
1125,
1126,
1243,
1244,
1340,
1341
],
"line_end_idx": [
11,
37,
38,
64,
65,
344,
345,
532,
533,
587,
588,
637,
638,
703,
704,
749,
750,
976,
977,
1004,
1005,
1079,
1080,
1125,
1126,
1243,
1244,
1340,
1341,
1426
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1426,
"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.3176470696926117,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023529410362243652,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1568627506494522,
"rps_doc_frac_unique_words": 0.5529953837394714,
"rps_doc_mean_word_length": 5.2672810554504395,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.423482894897461,
"rps_doc_word_count": 217,
"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.04199475049972534,
"rps_doc_frac_chars_top_3gram": 0.0594925582408905,
"rps_doc_frac_chars_top_4gram": 0.033245839178562164,
"rps_doc_books_importance": -125.73764038085938,
"rps_doc_books_importance_length_correction": -124.27133178710938,
"rps_doc_openwebtext_importance": -69.4568099975586,
"rps_doc_openwebtext_importance_length_correction": -69.4568099975586,
"rps_doc_wikipedia_importance": -59.49222183227539,
"rps_doc_wikipedia_importance_length_correction": -53.232177734375
},
"fasttext": {
"dclm": 0.35282009840011597,
"english": 0.8062904477119446,
"fineweb_edu_approx": 2.7079267501831055,
"eai_general_math": 0.4223230481147766,
"eai_open_web_math": 0.10176438093185425,
"eai_web_code": 0.2111620306968689
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02856",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,355,544,360,863,572,000 |
. /** * Event vault interface * * @package core_calendar * @copyright 2017 Ryan Wyllie * @license http://www.gnu.org/copyleft/gpl.html GNU GPL v3 or later */ namespace core_calendar\local\event\data_access; defined('MOODLE_INTERNAL') || die(); use core_calendar\local\event\entities\event_interface; /** * Interface for an event vault class * * @copyright 2017 Ryan Wyllie * @license http://www.gnu.org/copyleft/gpl.html GNU GPL v3 or later */ interface event_vault_interface { /** * Retrieve an event for the given id. * * @param int $id The event id * @return event_interface|false */ public function get_event_by_id($id); /** * Get all events restricted by various parameters, taking in to account user and group overrides. * * @param int|null $timestartfrom Events with timestart from this value (inclusive). * @param int|null $timestartto Events with timestart until this value (inclusive). * @param int|null $timesortfrom Events with timesort from this value (inclusive). * @param int|null $timesortto Events with timesort until this value (inclusive). * @param event_interface|null $timestartafterevent Restrict the events in the timestart range to ones after this one. * @param event_interface|null $timesortafterevent Restrict the events in the timesort range to ones after this one. * @param int $limitnum Return at most this number of events. * @param int|null $type Return only events of this type. * @param array|null $usersfilter Return only events for these users. * @param array|null $groupsfilter Return only events for these groups. * @param array|null $coursesfilter Return only events for these courses. * @param bool $withduration If true return only events starting within specified * timestart otherwise return in progress events as well. * @param bool $ignorehidden If true don't return hidden events. * @param callable|null $filter Additional logic to filter out unwanted events. * Must return true to keep the event, false to discard it. * @return event_interface[] Array of event_interfaces. */ public function get_events( $timestartfrom = null, $timestartto = null, $timesortfrom = null, $timesortto = null, event_interface $timestartafterevent = null, event_interface $timesortafterevent = null, $limitnum = 20, $type = null, array $usersfilter = null, array $groupsfilter = null, array $coursesfilter = null, array $categoriesfilter = null, $withduration = true, $ignorehidden = true, callable $filter = null ); /** * Retrieve an array of events for the given user and time constraints. * * If using this function for pagination then you can provide the last event that you've seen * ($afterevent) and it will be used to appropriately offset the result set so that you don't * receive the same events again. * @param \stdClass $user The user for whom the events belong * @param int $timesortfrom Events with timesort from this value (inclusive) * @param int $timesortto Events with timesort until this value (inclusive) * @param event_interface $afterevent Only return events after this one * @param int $limitnum Return at most this number of events * @param bool $lmittononsuspendedevents Limit course events to courses the user is active in (not suspended). * @return event_interface */ public function get_action_events_by_timesort( \stdClass $user, $timesortfrom, $timesortto, event_interface $afterevent, $limitnum, $limittononsuspendedevents ); /** * Retrieve an array of events for the given user filtered by the course and time constraints. * * If using this function for pagination then you can provide the last event that you've seen * ($afterevent) and it will be used to appropriately offset the result set so that you don't * receive the same events again. * * @param \stdClass $user The user for whom the events belong * @param \stdClass $course The course to filter by * @param int $timesortfrom Events with timesort from this value (inclusive) * @param int $timesortto Events with timesort until this value (inclusive) * @param event_interface $afterevent Only return events after this one * @param int $limitnum Return at most this number of events * @return action_event_interface */ public function get_action_events_by_course( \stdClass $user, \stdClass $course, $timesortfrom, $timesortto, event_interface $afterevent, $limitnum ); }
|
{
"url": "https://git.moodle.org/gw?p=moodle.git;a=blob_plain;f=calendar/classes/local/event/data_access/event_vault_interface.php;hb=644ffbd332b47f9924f46ffdc4227e2a7e0615e1",
"source_domain": "git.moodle.org",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "6507",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6NF373UK25OHGUDEPT6VX2FLIYMPJFR6",
"WARC-Concurrent-To": "<urn:uuid:3871a3ff-9823-4c69-a330-148095ca001d>",
"WARC-Date": "2021-07-24T02:54:11Z",
"WARC-IP-Address": "52.208.113.116",
"WARC-Identified-Payload-Type": "text/x-php",
"WARC-Payload-Digest": "sha1:AOUF5GRTNPH7YICR5MZ6NKUPEIYIT64F",
"WARC-Record-ID": "<urn:uuid:4431d8b4-bc9c-49ce-9516-6705d08f0264>",
"WARC-Target-URI": "https://git.moodle.org/gw?p=moodle.git;a=blob_plain;f=calendar/classes/local/event/data_access/event_vault_interface.php;hb=644ffbd332b47f9924f46ffdc4227e2a7e0615e1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2d9e3fe6-1ce5-4062-89d2-cfe793cadf55>"
},
"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": [
4285
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4285,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.00046673999167978764,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22133028507232666,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005733939819037914,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3474770486354828,
"rps_doc_frac_unique_words": 0.2996254563331604,
"rps_doc_mean_word_length": 6.155430793762207,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.600669860839844,
"rps_doc_word_count": 534,
"rps_doc_frac_chars_dupe_10grams": 0.3440827429294586,
"rps_doc_frac_chars_dupe_5grams": 0.5047155618667603,
"rps_doc_frac_chars_dupe_6grams": 0.4259202778339386,
"rps_doc_frac_chars_dupe_7grams": 0.41344690322875977,
"rps_doc_frac_chars_dupe_8grams": 0.4015820026397705,
"rps_doc_frac_chars_dupe_9grams": 0.4015820026397705,
"rps_doc_frac_chars_top_2gram": 0.019470639526844025,
"rps_doc_frac_chars_top_3gram": 0.043808940798044205,
"rps_doc_frac_chars_top_4gram": 0.05597810074687004,
"rps_doc_books_importance": -402.3525085449219,
"rps_doc_books_importance_length_correction": -402.3525085449219,
"rps_doc_openwebtext_importance": -224.85504150390625,
"rps_doc_openwebtext_importance_length_correction": -224.85504150390625,
"rps_doc_wikipedia_importance": -206.39002990722656,
"rps_doc_wikipedia_importance_length_correction": -206.39002990722656
},
"fasttext": {
"dclm": 0.866231381893158,
"english": 0.6956694722175598,
"fineweb_edu_approx": 0.8462933301925659,
"eai_general_math": 0.3795076608657837,
"eai_open_web_math": 0.23507076501846313,
"eai_web_code": 0.8036720752716064
}
}
|
{
"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": "371.3922",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Teachers, Teaching, and School management and organization"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,775,103,336,666,527,000 |
blob: fa25d91243931b05dd962c415c72f8b93374670c [file] [log] [blame]
// Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file
// for details. All rights reserved. Use of this source code is governed by a
// BSD-style license that can be found in the LICENSE file.
import 'package:analyzer/dart/ast/ast.dart';
import 'package:analyzer/dart/ast/standard_ast_factory.dart';
import 'package:analyzer/dart/ast/token.dart';
import 'package:analyzer/dart/ast/visitor.dart';
import 'package:analyzer/src/generated/source.dart';
import 'argument_list_visitor.dart';
import 'call_chain_visitor.dart';
import 'chunk.dart';
import 'chunk_builder.dart';
import 'dart_formatter.dart';
import 'rule/argument.dart';
import 'rule/combinator.dart';
import 'rule/metadata.dart';
import 'rule/rule.dart';
import 'rule/type_argument.dart';
import 'source_code.dart';
import 'style_fix.dart';
import 'whitespace.dart';
/// Visits every token of the AST and passes all of the relevant bits to a
/// [ChunkBuilder].
class SourceVisitor extends ThrowingAstVisitor {
/// Returns `true` if [node] is a method invocation that looks like it might
/// be a static method or constructor call without a `new` keyword.
///
/// With optional `new`, we can no longer reliably identify constructor calls
/// statically, but we still don't want to mix named constructor calls into
/// a call chain like:
///
/// Iterable
/// .generate(...)
/// .toList();
///
/// And instead prefer:
///
/// Iterable.generate(...)
/// .toList();
///
/// So we try to identify these calls syntactically. The heuristic we use is
/// that a target that's a capitalized name (possibly prefixed by "_") is
/// assumed to be a class.
///
/// This has the effect of also keeping static method calls with the class,
/// but that tends to look pretty good too, and is certainly better than
/// splitting up named constructors.
static bool looksLikeStaticCall(Expression node) {
if (node is! MethodInvocation) return false;
if (node.target == null) return false;
// A prefixed unnamed constructor call:
//
// prefix.Foo();
if (node.target is SimpleIdentifier &&
_looksLikeClassName(node.methodName.name)) {
return true;
}
// A prefixed or unprefixed named constructor call:
//
// Foo.named();
// prefix.Foo.named();
var target = node.target;
if (target is PrefixedIdentifier) target = target.identifier;
return target is SimpleIdentifier && _looksLikeClassName(target.name);
}
/// Whether [name] appears to be a type name.
///
/// Type names begin with a capital letter and contain at least one lowercase
/// letter (so that we can distinguish them from SCREAMING_CAPS constants).
static bool _looksLikeClassName(String name) {
// Handle the weird lowercase corelib names.
if (name == 'bool') return true;
if (name == 'double') return true;
if (name == 'int') return true;
if (name == 'num') return true;
// TODO(rnystrom): A simpler implementation is to test against the regex
// "_?[A-Z].*?[a-z]". However, that currently has much worse performance on
// AOT: https://github.com/dart-lang/sdk/issues/37785.
const underscore = 95;
const capitalA = 65;
const capitalZ = 90;
const lowerA = 97;
const lowerZ = 122;
var start = 0;
var firstChar = name.codeUnitAt(start++);
// It can be private.
if (firstChar == underscore) {
if (name.length == 1) return false;
firstChar = name.codeUnitAt(start++);
}
// It must start with a capital letter.
if (firstChar < capitalA || firstChar > capitalZ) return false;
// And have at least one lowercase letter in it. Otherwise it could be a
// SCREAMING_CAPS constant.
for (var i = start; i < name.length; i++) {
var char = name.codeUnitAt(i);
if (char >= lowerA && char <= lowerZ) return true;
}
return false;
}
static bool _isControlFlowElement(AstNode node) =>
node is IfElement || node is ForElement;
/// The builder for the block that is currently being visited.
ChunkBuilder builder;
final DartFormatter _formatter;
/// Cached line info for calculating blank lines.
final LineInfo _lineInfo;
/// The source being formatted.
final SourceCode _source;
/// `true` if the visitor has written past the beginning of the selection in
/// the original source text.
bool _passedSelectionStart = false;
/// `true` if the visitor has written past the end of the selection in the
/// original source text.
bool _passedSelectionEnd = false;
/// The character offset of the end of the selection, if there is a selection.
///
/// This is calculated and cached by [_findSelectionEnd].
int? _selectionEnd;
/// How many levels deep inside a constant context the visitor currently is.
int _constNesting = 0;
/// Whether we are currently fixing a typedef declaration.
///
/// Set to `true` while traversing the parameters of a typedef being converted
/// to the new syntax. The new syntax does not allow `int foo()` as a
/// parameter declaration, so it needs to be converted to `int Function() foo`
/// as part of the fix.
bool _insideNewTypedefFix = false;
/// A stack that tracks forcing nested collections to split.
///
/// Each entry corresponds to a collection currently being visited and the
/// value is whether or not it should be forced to split. Every time a
/// collection is entered, it sets all of the existing elements to `true`
/// then it pushes `false` for itself.
///
/// When done visiting the elements, it removes its value. If it was set to
/// `true`, we know we visited a nested collection so we force this one to
/// split.
final List<bool> _collectionSplits = [];
/// The stack of current rules for handling parameter metadata.
///
/// Each time a parameter (or type parameter) list is begun, a single rule
/// for all of the metadata annotations on parameters in that list is pushed
/// onto this stack. We reuse this rule for all annotations so that they split
/// in unison.
final List<MetadataRule> _metadataRules = [];
/// The mapping for blocks that are managed by the argument list that contains
/// them.
///
/// When a block expression, such as a collection literal or a multiline
/// string, appears inside an [ArgumentSublist], the argument list provides a
/// rule for the body to split to ensure that all blocks split in unison. It
/// also tracks the chunk before the argument that determines whether or not
/// the block body is indented like an expression or a statement.
///
/// Before a block argument is visited, [ArgumentSublist] binds itself to the
/// beginning token of each block it controls. When we later visit that
/// literal, we use the token to find that association.
///
/// This mapping is also used for spread collection literals that appear
/// inside control flow elements to ensure that when a "then" collection
/// splits, the corresponding "else" one does too.
final Map<Token, Rule> _blockRules = {};
final Map<Token, Chunk> _blockPreviousChunks = {};
/// Comments and new lines attached to tokens added here are suppressed
/// from the output.
final Set<Token> _suppressPrecedingCommentsAndNewLines = {};
/// Initialize a newly created visitor to write source code representing
/// the visited nodes to the given [writer].
SourceVisitor(this._formatter, this._lineInfo, this._source)
: builder = ChunkBuilder(_formatter, _source);
/// Runs the visitor on [node], formatting its contents.
///
/// Returns a [SourceCode] containing the resulting formatted source and
/// updated selection, if any.
///
/// This is the only method that should be called externally. Everything else
/// is effectively private.
SourceCode run(AstNode node) {
visit(node);
// Output trailing comments.
writePrecedingCommentsAndNewlines(node.endToken.next!);
assert(_constNesting == 0, 'Should have exited all const contexts.');
// Finish writing and return the complete result.
return builder.end();
}
@override
void visitAdjacentStrings(AdjacentStrings node) {
// We generally want to indent adjacent strings because it can be confusing
// otherwise when they appear in a list of expressions, like:
//
// [
// "one",
// "two"
// "three",
// "four"
// ]
//
// Especially when these stings are longer, it can be hard to tell that
// "three" is a continuation of the previous argument.
//
// However, the indentation is distracting in argument lists that don't
// suffer from this ambiguity:
//
// test(
// "A very long test description..."
// "this indentation looks bad.", () { ... });
//
// To balance these, we omit the indentation when an adjacent string
// expression is the only string in an argument list.
var shouldNest = true;
var parent = node.parent;
if (parent is ArgumentList) {
shouldNest = false;
for (var argument in parent.arguments) {
if (argument == node) continue;
if (argument is StringLiteral) {
shouldNest = true;
break;
}
}
} else if (parent is Assertion) {
// Treat asserts like argument lists.
shouldNest = false;
if (parent.condition != node && parent.condition is StringLiteral) {
shouldNest = true;
}
if (parent.message != node && parent.message is StringLiteral) {
shouldNest = true;
}
} else if (parent is VariableDeclaration ||
parent is AssignmentExpression &&
parent.rightHandSide == node &&
parent.parent is ExpressionStatement) {
// Don't add extra indentation in a variable initializer or assignment:
//
// var variable =
// "no extra"
// "indent";
shouldNest = false;
} else if (parent is NamedExpression || parent is ExpressionFunctionBody) {
shouldNest = false;
}
builder.startSpan();
builder.startRule();
if (shouldNest) builder.nestExpression();
visitNodes(node.strings, between: splitOrNewline);
if (shouldNest) builder.unnest();
builder.endRule();
builder.endSpan();
}
@override
void visitAnnotation(Annotation node) {
token(node.atSign);
visit(node.name);
builder.nestExpression();
visit(node.typeArguments);
token(node.period);
visit(node.constructorName);
if (node.arguments != null) {
// Metadata annotations are always const contexts.
_constNesting++;
visitArgumentList(node.arguments!, nestExpression: false);
_constNesting--;
}
builder.unnest();
}
/// Visits an argument list.
///
/// This is a bit complex to handle the rules for formatting positional and
/// named arguments. The goals, in rough order of descending priority are:
///
/// 1. Keep everything on the first line.
/// 2. Keep the named arguments together on the next line.
/// 3. Keep everything together on the second line.
/// 4. Split between one or more positional arguments, trying to keep as many
/// on earlier lines as possible.
/// 5. Split the named arguments each onto their own line.
@override
void visitArgumentList(ArgumentList node, {bool nestExpression = true}) {
// Corner case: handle empty argument lists.
if (node.arguments.isEmpty) {
token(node.leftParenthesis);
// If there is a comment inside the parens, do allow splitting before it.
if (node.rightParenthesis.precedingComments != null) soloZeroSplit();
token(node.rightParenthesis);
return;
}
// If the argument list has a trailing comma, format it like a collection
// literal where each argument goes on its own line, they are indented +2,
// and the ")" ends up on its own line.
if (hasCommaAfter(node.arguments.last)) {
_visitCollectionLiteral(
null, node.leftParenthesis, node.arguments, node.rightParenthesis);
return;
}
if (nestExpression) builder.nestExpression();
ArgumentListVisitor(this, node).visit();
if (nestExpression) builder.unnest();
}
@override
void visitAsExpression(AsExpression node) {
builder.startSpan();
builder.nestExpression();
visit(node.expression);
soloSplit();
token(node.asOperator);
space();
visit(node.type);
builder.unnest();
builder.endSpan();
}
@override
void visitAssertInitializer(AssertInitializer node) {
token(node.assertKeyword);
var arguments = <Expression>[node.condition];
if (node.message != null) arguments.add(node.message!);
// If the argument list has a trailing comma, format it like a collection
// literal where each argument goes on its own line, they are indented +2,
// and the ")" ends up on its own line.
if (hasCommaAfter(arguments.last)) {
_visitCollectionLiteral(
null, node.leftParenthesis, arguments, node.rightParenthesis);
return;
}
builder.nestExpression();
var visitor = ArgumentListVisitor.forArguments(
this, node.leftParenthesis, node.rightParenthesis, arguments);
visitor.visit();
builder.unnest();
}
@override
void visitAssertStatement(AssertStatement node) {
_simpleStatement(node, () {
token(node.assertKeyword);
var arguments = [node.condition];
if (node.message != null) arguments.add(node.message!);
// If the argument list has a trailing comma, format it like a collection
// literal where each argument goes on its own line, they are indented +2,
// and the ")" ends up on its own line.
if (hasCommaAfter(arguments.last)) {
_visitCollectionLiteral(
null, node.leftParenthesis, arguments, node.rightParenthesis);
return;
}
var visitor = ArgumentListVisitor.forArguments(
this, node.leftParenthesis, node.rightParenthesis, arguments);
visitor.visit();
});
}
@override
void visitAssignmentExpression(AssignmentExpression node) {
builder.nestExpression();
visit(node.leftHandSide);
_visitAssignment(node.operator, node.rightHandSide);
builder.unnest();
}
@override
void visitAwaitExpression(AwaitExpression node) {
token(node.awaitKeyword);
space();
visit(node.expression);
}
@override
void visitBinaryExpression(BinaryExpression node) {
builder.startSpan();
// If a binary operator sequence appears immediately after a `=>`, don't
// add an extra level of nesting. Instead, let the subsequent operands line
// up with the first, as in:
//
// method() =>
// argument &&
// argument &&
// argument;
var isArrowBody = node.parent is ExpressionFunctionBody;
if (!isArrowBody) builder.nestExpression();
// Start lazily so we don't force the operator to split if a line comment
// appears before the first operand.
builder.startLazyRule();
// Flatten out a tree/chain of the same precedence. If we split on this
// precedence level, we will break all of them.
var precedence = node.operator.type.precedence;
@override
void traverse(Expression e) {
if (e is BinaryExpression && e.operator.type.precedence == precedence) {
traverse(e.leftOperand);
space();
token(e.operator);
split();
traverse(e.rightOperand);
} else {
visit(e);
}
}
// Blocks as operands to infix operators should always nest like regular
// operands. (Granted, this case is exceedingly rare in real code.)
builder.startBlockArgumentNesting();
traverse(node);
builder.endBlockArgumentNesting();
if (!isArrowBody) builder.unnest();
builder.endSpan();
builder.endRule();
}
@override
void visitBlock(Block node) {
// Treat empty blocks specially. In most cases, they are not allowed to
// split. However, an empty block as the then statement of an if with an
// else is always split.
if (_isEmptyCollection(node.statements, node.rightBracket)) {
token(node.leftBracket);
// Force a split when used as the then body of an if with an else:
//
// if (condition) {
// } else ...
if (node.parent is IfStatement) {
var ifStatement = node.parent as IfStatement;
if (ifStatement.elseStatement != null &&
ifStatement.thenStatement == node) {
newline();
}
}
token(node.rightBracket);
return;
}
// If the block is a function body, it may get expression-level indentation,
// so handle it specially. Otherwise, just bump the indentation and keep it
// in the current block.
if (node.parent is BlockFunctionBody) {
_startLiteralBody(node.leftBracket);
} else {
_beginBody(node.leftBracket);
}
var needsDouble = true;
for (var statement in node.statements) {
if (needsDouble) {
twoNewlines();
} else {
oneOrTwoNewlines();
}
visit(statement);
needsDouble = false;
if (statement is FunctionDeclarationStatement) {
// Add a blank line after non-empty block functions.
var body = statement.functionDeclaration.functionExpression.body;
if (body is BlockFunctionBody) {
needsDouble = body.block.statements.isNotEmpty;
}
}
}
if (node.statements.isNotEmpty) newline();
if (node.parent is BlockFunctionBody) {
_endLiteralBody(node.rightBracket,
forceSplit: node.statements.isNotEmpty);
} else {
_endBody(node.rightBracket);
}
}
@override
void visitBlockFunctionBody(BlockFunctionBody node) {
// Space after the parameter list.
space();
// The "async" or "sync" keyword.
token(node.keyword);
// The "*" in "async*" or "sync*".
token(node.star);
if (node.keyword != null) space();
visit(node.block);
}
@override
void visitBooleanLiteral(BooleanLiteral node) {
token(node.literal);
}
@override
void visitBreakStatement(BreakStatement node) {
_simpleStatement(node, () {
token(node.breakKeyword);
visit(node.label, before: space);
});
}
@override
void visitCascadeExpression(CascadeExpression node) {
var splitIfOperandsSplit =
node.cascadeSections.length > 1 || _isCollectionLike(node.target);
// If the cascade sections have consistent names they can be broken
// normally otherwise they always get their own line.
if (splitIfOperandsSplit) {
builder.startLazyRule(_allowInlineCascade(node) ? Rule() : Rule.hard());
}
// If the target of the cascade is a method call (or chain of them), we
// treat the nesting specially. Normally, you would end up with:
//
// receiver
// .method()
// .method()
// ..cascade()
// ..cascade();
//
// This is logical, since the method chain is an operand of the cascade
// expression, so it's more deeply nested. But it looks wrong, so we leave
// the method chain's nesting active until after the cascade sections to
// force the *cascades* to be deeper because it looks better:
//
// receiver
// .method()
// .method()
// ..cascade()
// ..cascade();
if (node.target is MethodInvocation) {
CallChainVisitor(this, node.target).visit(unnest: false);
} else {
visit(node.target);
}
builder.nestExpression(indent: Indent.cascade, now: true);
builder.startBlockArgumentNesting();
// If the cascade section shouldn't cause the cascade to split, end the
// rule early so it isn't affected by it.
if (!splitIfOperandsSplit) {
builder.startRule(_allowInlineCascade(node) ? Rule() : Rule.hard());
}
zeroSplit();
if (!splitIfOperandsSplit) {
builder.endRule();
}
visitNodes(node.cascadeSections, between: zeroSplit);
if (splitIfOperandsSplit) {
builder.endRule();
}
builder.endBlockArgumentNesting();
builder.unnest();
if (node.target is MethodInvocation) builder.unnest();
}
/// Whether [expression] is a collection literal, or a call with a trailing
/// comma in an argument list.
///
/// In that case, when the expression is a target of a cascade, we don't
/// force a split before the ".." as eagerly to avoid ugly results like:
///
/// [
/// 1,
/// 2,
/// ]..addAll(numbers);
bool _isCollectionLike(Expression expression) {
if (expression is ListLiteral) return false;
if (expression is SetOrMapLiteral) return false;
// If the target is a call with a trailing comma in the argument list,
// treat it like a collection literal.
ArgumentList? arguments;
if (expression is InvocationExpression) {
arguments = expression.argumentList;
} else if (expression is InstanceCreationExpression) {
arguments = expression.argumentList;
}
// TODO(rnystrom): Do we want to allow an invocation where the last
// argument is a collection literal? Like:
//
// foo(argument, [
// element
// ])..cascade();
return arguments == null ||
arguments.arguments.isEmpty ||
!hasCommaAfter(arguments.arguments.last);
}
/// Whether a cascade should be allowed to be inline as opposed to one
/// expression per line.
bool _allowInlineCascade(CascadeExpression node) {
// If the receiver is an expression that makes the cascade's very low
// precedence confusing, force it to split. For example:
//
// a ? b : c..d();
//
// Here, the cascade is applied to the result of the conditional, not "c".
if (node.target is ConditionalExpression) return false;
if (node.target is BinaryExpression) return false;
if (node.target is PrefixExpression) return false;
if (node.target is AwaitExpression) return false;
if (node.cascadeSections.length < 2) return true;
var name;
// We could be more forgiving about what constitutes sections with
// consistent names but for now we require all sections to have the same
// method name.
for (var expression in node.cascadeSections) {
if (expression is MethodInvocation) {
if (name == null) {
name = expression.methodName.name;
} else if (name != expression.methodName.name) {
return false;
}
} else {
return false;
}
}
return true;
}
@override
void visitCatchClause(CatchClause node) {
token(node.onKeyword, after: space);
visit(node.exceptionType);
if (node.catchKeyword != null) {
if (node.exceptionType != null) {
space();
}
token(node.catchKeyword);
space();
token(node.leftParenthesis);
visit(node.exceptionParameter);
token(node.comma, after: space);
visit(node.stackTraceParameter);
token(node.rightParenthesis);
space();
} else {
space();
}
visit(node.body);
}
@override
void visitClassDeclaration(ClassDeclaration node) {
visitMetadata(node.metadata);
builder.nestExpression();
modifier(node.abstractKeyword);
token(node.classKeyword);
space();
visit(node.name);
visit(node.typeParameters);
visit(node.extendsClause);
builder.startRule(CombinatorRule());
visit(node.withClause);
visit(node.implementsClause);
builder.endRule();
visit(node.nativeClause, before: space);
space();
builder.unnest();
_beginBody(node.leftBracket);
_visitMembers(node.members);
_endBody(node.rightBracket);
}
@override
void visitClassTypeAlias(ClassTypeAlias node) {
visitMetadata(node.metadata);
_simpleStatement(node, () {
modifier(node.abstractKeyword);
token(node.typedefKeyword);
space();
visit(node.name);
visit(node.typeParameters);
space();
token(node.equals);
space();
visit(node.superclass);
builder.startRule(CombinatorRule());
visit(node.withClause);
visit(node.implementsClause);
builder.endRule();
});
}
@override
void visitComment(Comment node) => null;
@override
void visitCommentReference(CommentReference node) => null;
@override
void visitCompilationUnit(CompilationUnit node) {
visit(node.scriptTag);
// Put a blank line between the library tag and the other directives.
Iterable<Directive> directives = node.directives;
if (directives.isNotEmpty && directives.first is LibraryDirective) {
visit(directives.first);
twoNewlines();
directives = directives.skip(1);
}
visitNodes(directives, between: oneOrTwoNewlines);
var needsDouble = true;
for (var declaration in node.declarations) {
var hasClassBody = declaration is ClassDeclaration ||
declaration is ExtensionDeclaration;
// Add a blank line before declarations with class-like bodies.
if (hasClassBody) needsDouble = true;
if (needsDouble) {
twoNewlines();
} else {
// Variables and arrow-bodied members can be more tightly packed if
// the user wants to group things together.
oneOrTwoNewlines();
}
visit(declaration);
needsDouble = false;
if (hasClassBody) {
// Add a blank line after declarations with class-like bodies.
needsDouble = true;
} else if (declaration is FunctionDeclaration) {
// Add a blank line after non-empty block functions.
var body = declaration.functionExpression.body;
if (body is BlockFunctionBody) {
needsDouble = body.block.statements.isNotEmpty;
}
}
}
}
@override
void visitConditionalExpression(ConditionalExpression node) {
// Don't nest if this expression is the else leg of another ternary
final shouldNest = !(node.parent is ConditionalExpression &&
(node.parent as ConditionalExpression).elseExpression == node);
if (shouldNest) builder.nestExpression();
// Start lazily so we don't force the operator to split if a line comment
// appears before the first operand. If we split after one clause in a
// conditional, always split after both.
builder.startLazyRule();
visit(node.condition);
// Push any block arguments all the way past the leading "?" and ":".
builder.nestExpression(indent: Indent.block, now: true);
builder.startBlockArgumentNesting();
builder.unnest();
builder.startSpan();
split();
token(node.question);
space();
builder.nestExpression();
visit(node.thenExpression);
builder.unnest();
split();
token(node.colon);
space();
visit(node.elseExpression);
// If conditional expressions are directly nested, force them all to split.
// This line here forces the child, which implicitly forces the surrounding
// parent rules to split too.
if (node.parent is ConditionalExpression) builder.forceRules();
builder.endRule();
builder.endSpan();
builder.endBlockArgumentNesting();
if (shouldNest) builder.unnest();
}
@override
void visitConfiguration(Configuration node) {
token(node.ifKeyword);
space();
token(node.leftParenthesis);
visit(node.name);
if (node.equalToken != null) {
builder.nestExpression();
space();
token(node.equalToken);
soloSplit();
visit(node.value);
builder.unnest();
}
token(node.rightParenthesis);
space();
visit(node.uri);
}
@override
void visitConstructorDeclaration(ConstructorDeclaration node) {
visitMetadata(node.metadata);
modifier(node.externalKeyword);
modifier(node.constKeyword);
modifier(node.factoryKeyword);
visit(node.returnType);
token(node.period);
visit(node.name);
// Make the rule for the ":" span both the preceding parameter list and
// the entire initialization list. This ensures that we split before the
// ":" if the parameters and initialization list don't all fit on one line.
if (node.initializers.isNotEmpty) builder.startRule();
// If the redirecting constructor happens to wrap, we want to make sure
// the parameter list gets more deeply indented.
if (node.redirectedConstructor != null) builder.nestExpression();
_visitBody(null, node.parameters, node.body, () {
// Check for redirects or initializer lists.
if (node.redirectedConstructor != null) {
_visitConstructorRedirects(node);
builder.unnest();
} else if (node.initializers.isNotEmpty) {
_visitConstructorInitializers(node);
// End the rule for ":" after all of the initializers.
builder.endRule();
}
});
}
void _visitConstructorRedirects(ConstructorDeclaration node) {
token(node.separator /* = */, before: space);
soloSplit();
visitCommaSeparatedNodes(node.initializers);
visit(node.redirectedConstructor);
}
void _visitConstructorInitializers(ConstructorDeclaration node) {
var hasTrailingComma = node.parameters.parameters.isNotEmpty &&
hasCommaAfter(node.parameters.parameters.last);
if (hasTrailingComma) {
// Since the ")", "])", or "})" on the preceding line doesn't take up
// much space, it looks weird to move the ":" onto it's own line. Instead,
// keep it and the first initializer on the current line but add enough
// space before it to line it up with any subsequent initializers.
//
// Foo(
// parameter,
// ) : field = value,
// super();
space();
if (node.initializers.length > 1) {
_writeText(node.parameters.parameters.last.isOptional ? ' ' : ' ',
node.separator!.offset);
}
// ":".
token(node.separator);
space();
builder.indent(6);
} else {
// Shift the itself ":" forward.
builder.indent(Indent.constructorInitializer);
// If the parameters or initializers split, put the ":" on its own line.
split();
// ":".
token(node.separator);
space();
// Try to line up the initializers with the first one that follows the ":":
//
// Foo(notTrailing)
// : initializer = value,
// super(); // +2 from previous line.
//
// Foo(
// trailing,
// ) : initializer = value,
// super(); // +4 from previous line.
//
// This doesn't work if there is a trailing comma in an optional parameter,
// but we don't want to do a weird +5 alignment:
//
// Foo({
// trailing,
// }) : initializer = value,
// super(); // Doesn't quite line up. :(
builder.indent(2);
}
for (var i = 0; i < node.initializers.length; i++) {
if (i > 0) {
// Preceding comma.
token(node.initializers[i].beginToken.previous);
newline();
}
node.initializers[i].accept(this);
}
builder.unindent();
if (!hasTrailingComma) builder.unindent();
}
@override
void visitConstructorFieldInitializer(ConstructorFieldInitializer node) {
builder.nestExpression();
token(node.thisKeyword);
token(node.period);
visit(node.fieldName);
_visitAssignment(node.equals, node.expression);
builder.unnest();
}
@override
void visitConstructorName(ConstructorName node) {
visit(node.type);
token(node.period);
visit(node.name);
}
@override
void visitContinueStatement(ContinueStatement node) {
_simpleStatement(node, () {
token(node.continueKeyword);
visit(node.label, before: space);
});
}
@override
void visitDeclaredIdentifier(DeclaredIdentifier node) {
modifier(node.keyword);
visit(node.type, after: space);
visit(node.identifier);
}
@override
void visitDefaultFormalParameter(DefaultFormalParameter node) {
visit(node.parameter);
if (node.separator != null) {
builder.startSpan();
builder.nestExpression();
if (_formatter.fixes.contains(StyleFix.namedDefaultSeparator)) {
// Change the separator to "=".
space();
writePrecedingCommentsAndNewlines(node.separator!);
_writeText('=', node.separator!.offset);
} else {
// The '=' separator is preceded by a space, ":" is not.
if (node.separator!.type == TokenType.EQ) space();
token(node.separator);
}
soloSplit(_assignmentCost(node.defaultValue!));
visit(node.defaultValue);
builder.unnest();
builder.endSpan();
}
}
@override
void visitDoStatement(DoStatement node) {
builder.nestExpression();
token(node.doKeyword);
space();
builder.unnest(now: false);
visit(node.body);
builder.nestExpression();
space();
token(node.whileKeyword);
space();
token(node.leftParenthesis);
soloZeroSplit();
visit(node.condition);
token(node.rightParenthesis);
token(node.semicolon);
builder.unnest();
}
@override
void visitDottedName(DottedName node) {
for (var component in node.components) {
// Write the preceding ".".
if (component != node.components.first) {
token(component.beginToken.previous);
}
visit(component);
}
}
@override
void visitDoubleLiteral(DoubleLiteral node) {
token(node.literal);
}
@override
void visitEmptyFunctionBody(EmptyFunctionBody node) {
token(node.semicolon);
}
@override
void visitEmptyStatement(EmptyStatement node) {
token(node.semicolon);
}
@override
void visitEnumConstantDeclaration(EnumConstantDeclaration node) {
visitMetadata(node.metadata);
visit(node.name);
}
@override
void visitEnumDeclaration(EnumDeclaration node) {
visitMetadata(node.metadata);
token(node.enumKeyword);
space();
visit(node.name);
space();
_beginBody(node.leftBracket, space: true);
visitCommaSeparatedNodes(node.constants, between: splitOrTwoNewlines);
// If there is a trailing comma, always force the constants to split.
if (hasCommaAfter(node.constants.last)) {
builder.forceRules();
}
_endBody(node.rightBracket, space: true);
}
@override
void visitExportDirective(ExportDirective node) {
_visitDirectiveMetadata(node);
_simpleStatement(node, () {
token(node.keyword);
space();
visit(node.uri);
_visitConfigurations(node.configurations);
builder.startRule(CombinatorRule());
visitNodes(node.combinators);
builder.endRule();
});
}
@override
void visitExpressionFunctionBody(ExpressionFunctionBody node) {
// Space after the parameter list.
space();
// The "async" or "sync" keyword.
token(node.keyword, after: space);
// Try to keep the "(...) => " with the start of the body for anonymous
// functions.
if (_isInLambda(node)) builder.startSpan();
token(node.functionDefinition); // "=>".
// Split after the "=>", using the rule created before the parameters
// by _visitBody().
split();
// If the body is a binary operator expression, then we want to force the
// split at `=>` if the operators split. See visitBinaryExpression().
if (node.expression is! BinaryExpression) builder.endRule();
if (_isInLambda(node)) builder.endSpan();
// If this function invocation appears in an argument list with trailing
// comma, don't add extra nesting to preserve normal indentation.
var isArgWithTrailingComma = false;
var parent = node.parent;
if (parent is FunctionExpression) {
isArgWithTrailingComma = _isTrailingCommaArgument(parent);
}
if (!isArgWithTrailingComma) builder.startBlockArgumentNesting();
builder.startSpan();
visit(node.expression);
builder.endSpan();
if (!isArgWithTrailingComma) builder.endBlockArgumentNesting();
if (node.expression is BinaryExpression) builder.endRule();
token(node.semicolon);
}
/// Synthesize a token with [type] to replace the given [operator].
///
/// Offset, comments, and previous/next links are all preserved.
static Token _synthesizeToken(TokenType type, Token operator) =>
Token(type, operator.offset, operator.precedingComments)
..previous = operator.previous
..next = operator.next;
static Expression _realTargetOf(Expression expression) {
if (expression is PropertyAccess) {
return expression.realTarget;
} else if (expression is MethodInvocation) {
return expression.realTarget!;
} else if (expression is IndexExpression) {
return expression.realTarget;
}
throw UnimplementedError('Unhandled ${expression.runtimeType}'
'($expression)');
}
/// Recursively insert [cascadeTarget] (the LHS of the cascade) into the
/// LHS of the assignment expression that used to be the cascade's RHS.
static Expression _insertCascadeTargetIntoExpression(
Expression expression, Expression cascadeTarget) {
// Base case: We've recursed as deep as possible.
if (expression == cascadeTarget) return cascadeTarget;
// Otherwise, copy `expression` and recurse into its LHS.
var expressionTarget = _realTargetOf(expression);
if (expression is PropertyAccess) {
return astFactory.propertyAccess(
_insertCascadeTargetIntoExpression(expressionTarget, cascadeTarget),
// If we've reached the end, replace the `..` operator with `.`
expressionTarget == cascadeTarget
? _synthesizeToken(TokenType.PERIOD, expression.operator)
: expression.operator,
expression.propertyName);
} else if (expression is MethodInvocation) {
return astFactory.methodInvocation(
_insertCascadeTargetIntoExpression(expressionTarget, cascadeTarget),
// If we've reached the end, replace the `..` operator with `.`
expressionTarget == cascadeTarget
? _synthesizeToken(TokenType.PERIOD, expression.operator!)
: expression.operator,
expression.methodName,
expression.typeArguments,
expression.argumentList);
} else if (expression is IndexExpression) {
var question = expression.question;
// A null-aware cascade treats the `?` in `?..` as part of the token, but
// for a non-cascade index, it is a separate `?` token.
if (expression.period?.type == TokenType.QUESTION_PERIOD_PERIOD) {
question = _synthesizeToken(TokenType.QUESTION, expression.period!);
}
return astFactory.indexExpressionForTarget2(
target: _insertCascadeTargetIntoExpression(
expressionTarget, cascadeTarget),
question: question,
leftBracket: expression.leftBracket,
index: expression.index,
rightBracket: expression.rightBracket);
}
throw UnimplementedError('Unhandled ${expression.runtimeType}'
'($expression)');
}
/// Parenthesize the target of the given statement's expression (assumed to
/// be a CascadeExpression) before removing the cascade.
void _fixCascadeByParenthesizingTarget(ExpressionStatement statement) {
var cascade = statement.expression as CascadeExpression;
assert(cascade.cascadeSections.length == 1);
// Write any leading comments and whitespace immediately, as they should
// precede the new opening parenthesis, but then prevent them from being
// written again after the parenthesis.
writePrecedingCommentsAndNewlines(cascade.target.beginToken);
_suppressPrecedingCommentsAndNewLines.add(cascade.target.beginToken);
var newTarget = astFactory.parenthesizedExpression(
Token(TokenType.OPEN_PAREN, 0)
..previous = statement.beginToken.previous
..next = cascade.target.beginToken,
cascade.target,
Token(TokenType.CLOSE_PAREN, 0)
..previous = cascade.target.endToken
..next = statement.semicolon);
// Finally, we can revisit a clone of this ExpressionStatement to actually
// remove the cascade.
visit(astFactory.expressionStatement(
astFactory.cascadeExpression(newTarget, cascade.cascadeSections),
statement.semicolon));
}
void _removeCascade(ExpressionStatement statement) {
var cascade = statement.expression as CascadeExpression;
var subexpression = cascade.cascadeSections.single;
builder.nestExpression();
if (subexpression is AssignmentExpression) {
// CascadeExpression("leftHandSide", "..",
// AssignmentExpression("target", "=", "rightHandSide"))
//
// transforms to
//
// AssignmentExpression(
// PropertyAccess("leftHandSide", ".", "target"),
// "=",
// "rightHandSide")
visit(astFactory.assignmentExpression(
_insertCascadeTargetIntoExpression(
subexpression.leftHandSide, cascade.target),
subexpression.operator,
subexpression.rightHandSide));
} else if (subexpression is MethodInvocation ||
subexpression is PropertyAccess) {
// CascadeExpression("leftHandSide", "..",
// MethodInvocation("target", ".", "methodName", ...))
//
// transforms to
//
// MethodInvocation(
// PropertyAccess("leftHandSide", ".", "target"),
// ".",
// "methodName", ...)
//
// And similarly for PropertyAccess expressions.
visit(_insertCascadeTargetIntoExpression(subexpression, cascade.target));
} else {
throw UnsupportedError(
'--fix-single-cascade-statements: subexpression of cascade '
'"$cascade" has unsupported type ${subexpression.runtimeType}.');
}
token(statement.semicolon);
builder.unnest();
}
/// Remove any unnecessary single cascade from the given expression statement,
/// which is assumed to contain a [CascadeExpression].
///
/// Returns true after applying the fix, which involves visiting the nested
/// expression. Callers must visit the nested expression themselves
/// if-and-only-if this method returns false.
bool _fixSingleCascadeStatement(ExpressionStatement statement) {
var cascade = statement.expression as CascadeExpression;
if (cascade.cascadeSections.length != 1) return false;
var target = cascade.target;
if (target is AsExpression ||
target is AwaitExpression ||
target is BinaryExpression ||
target is ConditionalExpression ||
target is IsExpression ||
target is PostfixExpression ||
target is PrefixExpression) {
// In these cases, the cascade target needs to be parenthesized before
// removing the cascade, otherwise the semantics will change.
_fixCascadeByParenthesizingTarget(statement);
return true;
} else if (target is BooleanLiteral ||
target is FunctionExpression ||
target is IndexExpression ||
target is InstanceCreationExpression ||
target is IntegerLiteral ||
target is ListLiteral ||
target is NullLiteral ||
target is MethodInvocation ||
target is ParenthesizedExpression ||
target is PrefixedIdentifier ||
target is PropertyAccess ||
target is SimpleIdentifier ||
target is StringLiteral ||
target is ThisExpression) {
// OK to simply remove the cascade.
_removeCascade(statement);
return true;
} else {
// If we get here, some new syntax was added to the language that the fix
// does not yet support. Leave it as is.
return false;
}
}
@override
void visitExpressionStatement(ExpressionStatement node) {
if (_formatter.fixes.contains(StyleFix.singleCascadeStatements) &&
node.expression is CascadeExpression &&
_fixSingleCascadeStatement(node)) {
return;
}
_simpleStatement(node, () {
visit(node.expression);
});
}
@override
void visitExtendsClause(ExtendsClause node) {
soloSplit();
token(node.extendsKeyword);
space();
visit(node.superclass);
}
@override
void visitExtensionDeclaration(ExtensionDeclaration node) {
visitMetadata(node.metadata);
builder.nestExpression();
token(node.extensionKeyword);
// Don't put a space after `extension` if the extension is unnamed. That
// way, generic unnamed extensions format like `extension<T> on ...`.
if (node.name != null) {
space();
visit(node.name);
}
visit(node.typeParameters);
soloSplit();
token(node.onKeyword);
space();
visit(node.extendedType);
space();
builder.unnest();
_beginBody(node.leftBracket);
_visitMembers(node.members);
_endBody(node.rightBracket);
}
@override
void visitFieldDeclaration(FieldDeclaration node) {
visitMetadata(node.metadata);
_simpleStatement(node, () {
modifier(node.externalKeyword);
modifier(node.staticKeyword);
modifier(node.abstractKeyword);
modifier(node.covariantKeyword);
visit(node.fields);
});
}
@override
void visitFieldFormalParameter(FieldFormalParameter node) {
visitParameterMetadata(node.metadata, () {
_beginFormalParameter(node);
token(node.keyword, after: space);
visit(node.type, after: split);
token(node.thisKeyword);
token(node.period);
visit(node.identifier);
visit(node.parameters);
token(node.question);
_endFormalParameter(node);
});
}
@override
void visitFormalParameterList(FormalParameterList node,
{bool nestExpression = true}) {
// Corner case: empty parameter lists.
if (node.parameters.isEmpty) {
token(node.leftParenthesis);
// If there is a comment, do allow splitting before it.
if (node.rightParenthesis.precedingComments != null) soloZeroSplit();
token(node.rightParenthesis);
return;
}
// If the parameter list has a trailing comma, format it like a collection
// literal where each parameter goes on its own line, they are indented +2,
// and the ")" ends up on its own line.
if (hasCommaAfter(node.parameters.last)) {
_visitTrailingCommaParameterList(node);
return;
}
var requiredParams = node.parameters
.where((param) => param is! DefaultFormalParameter)
.toList();
var optionalParams =
node.parameters.whereType<DefaultFormalParameter>().toList();
if (nestExpression) builder.nestExpression();
token(node.leftParenthesis);
_metadataRules.add(MetadataRule());
var rule;
if (requiredParams.isNotEmpty) {
rule = PositionalRule(null, 0, 0);
_metadataRules.last.bindPositionalRule(rule);
builder.startRule(rule);
if (_isInLambda(node)) {
// Don't allow splitting before the first argument (i.e. right after
// the bare "(" in a lambda. Instead, just stuff a null chunk in there
// to avoid confusing the arg rule.
rule.beforeArgument(null);
} else {
// Split before the first argument.
rule.beforeArgument(zeroSplit());
}
builder.startSpan();
for (var param in requiredParams) {
visit(param);
_writeCommaAfter(param);
if (param != requiredParams.last) rule.beforeArgument(split());
}
builder.endSpan();
builder.endRule();
}
if (optionalParams.isNotEmpty) {
var namedRule = NamedRule(null, 0, 0);
if (rule != null) rule.setNamedArgsRule(namedRule);
_metadataRules.last.bindNamedRule(namedRule);
builder.startRule(namedRule);
// Make sure multi-line default values are indented.
builder.startBlockArgumentNesting();
namedRule.beforeArgument(builder.split(space: requiredParams.isNotEmpty));
// "[" or "{" for optional parameters.
token(node.leftDelimiter);
for (var param in optionalParams) {
visit(param);
_writeCommaAfter(param);
if (param != optionalParams.last) namedRule.beforeArgument(split());
}
builder.endBlockArgumentNesting();
builder.endRule();
// "]" or "}" for optional parameters.
token(node.rightDelimiter);
}
_metadataRules.removeLast();
token(node.rightParenthesis);
if (nestExpression) builder.unnest();
}
@override
void visitForElement(ForElement node) {
// Treat a spread of a collection literal like a block in a for statement
// and don't split after the for parts.
var isSpreadBody = _isSpreadCollection(node.body);
builder.nestExpression();
token(node.awaitKeyword, after: space);
token(node.forKeyword);
space();
token(node.leftParenthesis);
// Start the body rule so that if the parts split, the body does too.
builder.startRule();
// The rule for the parts.
builder.startRule();
visit(node.forLoopParts);
token(node.rightParenthesis);
builder.endRule();
builder.unnest();
builder.nestExpression(indent: 2, now: true);
if (isSpreadBody) {
space();
} else {
split();
// If the body is a non-spread collection or lambda, indent it.
builder.startBlockArgumentNesting();
}
visit(node.body);
if (!isSpreadBody) builder.endBlockArgumentNesting();
builder.unnest();
// If a control flow element is nested inside another, force the outer one
// to split.
if (_isControlFlowElement(node.body)) builder.forceRules();
builder.endRule();
}
@override
void visitForStatement(ForStatement node) {
builder.nestExpression();
token(node.awaitKeyword, after: space);
token(node.forKeyword);
space();
token(node.leftParenthesis);
builder.startRule();
visit(node.forLoopParts);
token(node.rightParenthesis);
builder.endRule();
builder.unnest();
_visitLoopBody(node.body);
}
@override
void visitForEachPartsWithDeclaration(ForEachPartsWithDeclaration node) {
// TODO(rnystrom): The formatting logic here is slightly different from
// how parameter metadata is handled and from how variable metadata is
// handled. I think what it does works better in the context of a for-in
// loop, but consider trying to unify this with one of the above.
//
// Metadata on class and variable declarations is *always* split:
//
// @foo
// class Bar {}
//
// Metadata on parameters has some complex logic to handle multiple
// parameters with metadata. It also indents the parameters farther than
// the metadata when split:
//
// function(
// @foo(long arg list...)
// parameter1,
// @foo
// parameter2) {}
//
// For for-in variables, we allow it to not split, like parameters, but
// don't indent the variable when it does split:
//
// for (
// @foo
// @bar
// var blah in stuff) {}
// TODO(rnystrom): we used to call builder.startRule() here, but now we call
// it from visitForStatement2 prior to the `(`. Is that ok?
visitNodes(node.loopVariable.metadata, between: split, after: split);
visit(node.loopVariable);
// TODO(rnystrom): we used to call builder.endRule() here, but now we call
// it from visitForStatement2 after the `)`. Is that ok?
_visitForEachPartsFromIn(node);
}
void _visitForEachPartsFromIn(ForEachParts node) {
soloSplit();
token(node.inKeyword);
space();
visit(node.iterable);
}
@override
void visitForEachPartsWithIdentifier(ForEachPartsWithIdentifier node) {
visit(node.identifier);
_visitForEachPartsFromIn(node);
}
@override
void visitForPartsWithDeclarations(ForPartsWithDeclarations node) {
// Nest split variables more so they aren't at the same level
// as the rest of the loop clauses.
builder.nestExpression();
// Allow the variables to stay unsplit even if the clauses split.
builder.startRule();
var declaration = node.variables;
visitMetadata(declaration.metadata);
modifier(declaration.keyword);
visit(declaration.type, after: space);
visitCommaSeparatedNodes(declaration.variables, between: () {
split();
});
builder.endRule();
builder.unnest();
_visitForPartsFromLeftSeparator(node);
}
@override
void visitForPartsWithExpression(ForPartsWithExpression node) {
visit(node.initialization);
_visitForPartsFromLeftSeparator(node);
}
void _visitForPartsFromLeftSeparator(ForParts node) {
token(node.leftSeparator);
// The condition clause.
if (node.condition != null) split();
visit(node.condition);
token(node.rightSeparator);
// The update clause.
if (node.updaters.isNotEmpty) {
split();
// Allow the updates to stay unsplit even if the clauses split.
builder.startRule();
visitCommaSeparatedNodes(node.updaters, between: split);
builder.endRule();
}
}
@override
void visitFunctionDeclaration(FunctionDeclaration node) {
_visitMemberDeclaration(node, node.functionExpression);
}
@override
void visitFunctionDeclarationStatement(FunctionDeclarationStatement node) {
visit(node.functionDeclaration);
}
@override
void visitFunctionExpression(FunctionExpression node) {
// Inside a function body is no longer in the surrounding const context.
var oldConstNesting = _constNesting;
_constNesting = 0;
_visitBody(node.typeParameters, node.parameters, node.body);
_constNesting = oldConstNesting;
}
@override
void visitFunctionExpressionInvocation(FunctionExpressionInvocation node) {
// Try to keep the entire invocation one line.
builder.startSpan();
builder.nestExpression();
visit(node.function);
visit(node.typeArguments);
visitArgumentList(node.argumentList, nestExpression: false);
builder.unnest();
builder.endSpan();
}
@override
void visitFunctionTypeAlias(FunctionTypeAlias node) {
visitMetadata(node.metadata);
if (_formatter.fixes.contains(StyleFix.functionTypedefs)) {
_simpleStatement(node, () {
// Inlined visitGenericTypeAlias
_visitGenericTypeAliasHeader(node.typedefKeyword, node.name,
node.typeParameters, null, (node.returnType ?? node.name).offset);
space();
// Recursively convert function-arguments to Function syntax.
_insideNewTypedefFix = true;
_visitGenericFunctionType(
node.returnType, null, node.name.offset, null, node.parameters);
_insideNewTypedefFix = false;
});
return;
}
_simpleStatement(node, () {
token(node.typedefKeyword);
space();
visit(node.returnType, after: space);
visit(node.name);
visit(node.typeParameters);
visit(node.parameters);
});
}
@override
void visitFunctionTypedFormalParameter(FunctionTypedFormalParameter node) {
visitParameterMetadata(node.metadata, () {
if (!_insideNewTypedefFix) {
modifier(node.requiredKeyword);
modifier(node.covariantKeyword);
visit(node.returnType, after: space);
// Try to keep the function's parameters with its name.
builder.startSpan();
visit(node.identifier);
_visitParameterSignature(node.typeParameters, node.parameters);
token(node.question);
builder.endSpan();
} else {
_beginFormalParameter(node);
_visitGenericFunctionType(node.returnType, null, node.identifier.offset,
node.typeParameters, node.parameters);
token(node.question);
split();
visit(node.identifier);
_endFormalParameter(node);
}
});
}
@override
void visitGenericFunctionType(GenericFunctionType node) {
_visitGenericFunctionType(node.returnType, node.functionKeyword, null,
node.typeParameters, node.parameters);
token(node.question);
}
@override
void visitGenericTypeAlias(GenericTypeAlias node) {
visitNodes(node.metadata, between: newline, after: newline);
_simpleStatement(node, () {
_visitGenericTypeAliasHeader(node.typedefKeyword, node.name,
node.typeParameters, node.equals, null);
space();
visit(node.functionType);
});
}
@override
void visitHideCombinator(HideCombinator node) {
_visitCombinator(node.keyword, node.hiddenNames);
}
@override
void visitIfElement(IfElement node) {
// Treat a chain of if-else elements as a single unit so that we don't
// unnecessarily indent each subsequent section of the chain.
var ifElements = [
for (CollectionElement? thisNode = node;
thisNode is IfElement;
thisNode = thisNode.elseElement)
thisNode
];
// If the body of the then or else branch is a spread of a collection
// literal, then we want to format those collections more like blocks than
// like standalone objects. In particular, if both the then and else branch
// are spread collection literals, we want to ensure that they both split
// if either splits. So this:
//
// [
// if (condition) ...[
// thenClause
// ] else ...[
// elseClause
// ]
// ]
//
// And not something like this:
//
// [
// if (condition) ...[
// thenClause
// ] else ...[elseClause]
// ]
//
// To do that, if we see that either clause is a spread collection, we
// create a single rule and force both collections to use it.
var spreadRule = Rule();
var spreadBrackets = <CollectionElement, Token>{};
for (var element in ifElements) {
var spreadBracket = _findSpreadCollectionBracket(element.thenElement);
if (spreadBracket != null) {
spreadBrackets[element] = spreadBracket;
beforeBlock(spreadBracket, spreadRule, null);
}
}
var elseSpreadBracket =
_findSpreadCollectionBracket(ifElements.last.elseElement);
if (elseSpreadBracket != null) {
spreadBrackets[ifElements.last.elseElement!] = elseSpreadBracket;
beforeBlock(elseSpreadBracket, spreadRule, null);
}
void visitChild(CollectionElement element, CollectionElement child) {
builder.nestExpression(indent: 2, now: true);
// Treat a spread of a collection literal like a block in an if statement
// and don't split after the "else".
var isSpread = spreadBrackets.containsKey(element);
if (isSpread) {
space();
} else {
split();
// If the then clause is a non-spread collection or lambda, make sure the
// body is indented.
builder.startBlockArgumentNesting();
}
visit(child);
if (!isSpread) builder.endBlockArgumentNesting();
builder.unnest();
}
// Wrap the whole thing in a single rule. If a split happens inside the
// condition or the then clause, we want the then and else clauses to split.
builder.startLazyRule();
var hasInnerControlFlow = false;
for (var element in ifElements) {
// The condition.
token(element.ifKeyword);
space();
token(element.leftParenthesis);
visit(element.condition);
token(element.rightParenthesis);
visitChild(element, element.thenElement);
if (_isControlFlowElement(element.thenElement)) {
hasInnerControlFlow = true;
}
// Handle this element's "else" keyword and prepare to write the element,
// but don't write it. It will either be the next element in [ifElements]
// or the final else element handled after the loop.
if (element.elseElement != null) {
if (spreadBrackets.containsKey(element)) {
space();
} else {
split();
}
token(element.elseKeyword);
// If there is another if element in the chain, put a space between
// it and this "else".
if (element != ifElements.last) space();
}
}
// Handle the final trailing else if there is one.
var lastElse = ifElements.last.elseElement;
if (lastElse != null) {
visitChild(lastElse, lastElse);
if (_isControlFlowElement(lastElse)) {
hasInnerControlFlow = true;
}
}
// If a control flow element is nested inside another, force the outer one
// to split.
if (hasInnerControlFlow) builder.forceRules();
builder.endRule();
}
@override
void visitIfStatement(IfStatement node) {
builder.nestExpression();
token(node.ifKeyword);
space();
token(node.leftParenthesis);
visit(node.condition);
token(node.rightParenthesis);
builder.unnest();
@override
void visitClause(Statement clause) {
if (clause is Block || clause is IfStatement) {
space();
visit(clause);
} else {
// Allow splitting in a statement-bodied if even though it's against
// the style guide. Since we can't fix the code itself to follow the
// style guide, we should at least format it as well as we can.
builder.indent();
builder.startRule();
// If there is an else clause, always split before both the then and
// else statements.
if (node.elseStatement != null) {
builder.writeWhitespace(Whitespace.newline);
} else {
builder.split(nest: false, space: true);
}
visit(clause);
builder.endRule();
builder.unindent();
}
}
visitClause(node.thenStatement);
if (node.elseStatement != null) {
if (node.thenStatement is Block) {
space();
} else {
// Corner case where an else follows a single-statement then clause.
// This is against the style guide, but we still need to handle it. If
// it happens, put the else on the next line.
newline();
}
token(node.elseKeyword);
visitClause(node.elseStatement!);
}
}
@override
void visitImplementsClause(ImplementsClause node) {
_visitCombinator(node.implementsKeyword, node.interfaces);
}
@override
void visitImportDirective(ImportDirective node) {
_visitDirectiveMetadata(node);
_simpleStatement(node, () {
token(node.keyword);
space();
visit(node.uri);
_visitConfigurations(node.configurations);
if (node.asKeyword != null) {
soloSplit();
token(node.deferredKeyword, after: space);
token(node.asKeyword);
space();
visit(node.prefix);
}
builder.startRule(CombinatorRule());
visitNodes(node.combinators);
builder.endRule();
});
}
@override
void visitIndexExpression(IndexExpression node) {
builder.nestExpression();
if (node.isCascaded) {
token(node.period);
} else {
visit(node.target);
}
finishIndexExpression(node);
builder.unnest();
}
/// Visit the index part of [node], excluding the target.
///
/// Called by [CallChainVisitor] to handle index expressions in the middle of
/// call chains.
void finishIndexExpression(IndexExpression node) {
if (node.target is IndexExpression) {
// Edge case: On a chain of [] accesses, allow splitting between them.
// Produces nicer output in cases like:
//
// someJson['property']['property']['property']['property']...
soloZeroSplit();
}
builder.startSpan(Cost.index);
token(node.question);
token(node.leftBracket);
soloZeroSplit();
visit(node.index);
token(node.rightBracket);
builder.endSpan();
}
@override
void visitInstanceCreationExpression(InstanceCreationExpression node) {
builder.startSpan();
var includeKeyword = true;
if (node.keyword != null) {
if (node.keyword!.keyword == Keyword.NEW &&
_formatter.fixes.contains(StyleFix.optionalNew)) {
includeKeyword = false;
} else if (node.keyword!.keyword == Keyword.CONST &&
_formatter.fixes.contains(StyleFix.optionalConst) &&
_constNesting > 0) {
includeKeyword = false;
}
}
if (includeKeyword) {
token(node.keyword, after: space);
} else {
// Don't lose comments before the discarded keyword, if any.
writePrecedingCommentsAndNewlines(node.keyword!);
}
builder.startSpan(Cost.constructorName);
// Start the expression nesting for the argument list here, in case this
// is a generic constructor with type arguments. If it is, we need the type
// arguments to be nested too so they get indented past the arguments.
builder.nestExpression();
visit(node.constructorName);
_startPossibleConstContext(node.keyword);
builder.endSpan();
visitArgumentList(node.argumentList, nestExpression: false);
builder.endSpan();
_endPossibleConstContext(node.keyword);
builder.unnest();
}
@override
void visitIntegerLiteral(IntegerLiteral node) {
token(node.literal);
}
@override
void visitInterpolationExpression(InterpolationExpression node) {
builder.preventSplit();
token(node.leftBracket);
builder.startSpan();
visit(node.expression);
builder.endSpan();
token(node.rightBracket);
builder.endPreventSplit();
}
@override
void visitInterpolationString(InterpolationString node) {
_writeStringLiteral(node.contents);
}
@override
void visitIsExpression(IsExpression node) {
builder.startSpan();
builder.nestExpression();
visit(node.expression);
soloSplit();
token(node.isOperator);
token(node.notOperator);
space();
visit(node.type);
builder.unnest();
builder.endSpan();
}
@override
void visitLabel(Label node) {
visit(node.label);
token(node.colon);
}
@override
void visitLabeledStatement(LabeledStatement node) {
_visitLabels(node.labels);
visit(node.statement);
}
@override
void visitLibraryDirective(LibraryDirective node) {
_visitDirectiveMetadata(node);
_simpleStatement(node, () {
token(node.keyword);
space();
visit(node.name);
});
}
@override
void visitLibraryIdentifier(LibraryIdentifier node) {
visit(node.components.first);
for (var component in node.components.skip(1)) {
token(component.beginToken.previous); // "."
visit(component);
}
}
@override
void visitListLiteral(ListLiteral node) {
// Corner case: Splitting inside a list looks bad if there's only one
// element, so make those more costly.
var cost = node.elements.length <= 1 ? Cost.singleElementList : Cost.normal;
_visitCollectionLiteral(
node, node.leftBracket, node.elements, node.rightBracket, cost);
}
@override
void visitMapLiteralEntry(MapLiteralEntry node) {
builder.nestExpression();
visit(node.key);
token(node.separator);
soloSplit();
visit(node.value);
builder.unnest();
}
@override
void visitMethodDeclaration(MethodDeclaration node) {
_visitMemberDeclaration(node, node);
}
@override
void visitMethodInvocation(MethodInvocation node) {
// If there's no target, this is a "bare" function call like "foo(1, 2)",
// or a section in a cascade.
//
// If it looks like a constructor or static call, we want to keep the
// target and method together instead of including the method in the
// subsequent method chain. When this happens, it's important that this
// code here has the same rules as in [visitInstanceCreationExpression].
//
// That ensures that the way some code is formatted is not affected by the
// presence or absence of `new`/`const`. In particular, it means that if
// they run `dartfmt --fix`, and then run `dartfmt` *again*, the second run
// will not produce any additional changes.
if (node.target == null || looksLikeStaticCall(node)) {
// Try to keep the entire method invocation one line.
builder.nestExpression();
builder.startSpan();
if (node.target != null) {
builder.startSpan(Cost.constructorName);
visit(node.target);
soloZeroSplit();
}
// If target is null, this will be `..` for a cascade.
token(node.operator);
visit(node.methodName);
if (node.target != null) builder.endSpan();
// TODO(rnystrom): Currently, there are no constraints between a generic
// method's type arguments and arguments. That can lead to some funny
// splitting like:
//
// method<VeryLongType,
// AnotherTypeArgument>(argument,
// argument, argument, argument);
//
// The indentation is fine, but splitting in the middle of each argument
// list looks kind of strange. If this ends up happening in real world
// code, consider putting a constraint between them.
builder.nestExpression();
visit(node.typeArguments);
visitArgumentList(node.argumentList, nestExpression: false);
builder.unnest();
builder.endSpan();
builder.unnest();
return;
}
CallChainVisitor(this, node).visit();
}
@override
void visitMixinDeclaration(MixinDeclaration node) {
visitMetadata(node.metadata);
builder.nestExpression();
token(node.mixinKeyword);
space();
visit(node.name);
visit(node.typeParameters);
// If there is only a single superclass constraint, format it like an
// "extends" in a class.
var onClause = node.onClause;
if (onClause != null && onClause.superclassConstraints.length == 1) {
soloSplit();
token(onClause.onKeyword);
space();
visit(onClause.superclassConstraints.single);
}
builder.startRule(CombinatorRule());
// If there are multiple superclass constraints, format them like the
// "implements" clause.
if (onClause != null && onClause.superclassConstraints.length > 1) {
visit(onClause);
}
visit(node.implementsClause);
builder.endRule();
space();
builder.unnest();
_beginBody(node.leftBracket);
_visitMembers(node.members);
_endBody(node.rightBracket);
}
@override
void visitNamedExpression(NamedExpression node) {
visitNamedArgument(node);
}
@override
void visitNativeClause(NativeClause node) {
token(node.nativeKeyword);
visit(node.name, before: space);
}
@override
void visitNativeFunctionBody(NativeFunctionBody node) {
_simpleStatement(node, () {
builder.nestExpression(now: true);
soloSplit();
token(node.nativeKeyword);
visit(node.stringLiteral, before: space);
builder.unnest();
});
}
@override
void visitNullLiteral(NullLiteral node) {
token(node.literal);
}
@override
void visitOnClause(OnClause node) {
_visitCombinator(node.onKeyword, node.superclassConstraints);
}
@override
void visitParenthesizedExpression(ParenthesizedExpression node) {
builder.nestExpression();
token(node.leftParenthesis);
visit(node.expression);
builder.unnest();
token(node.rightParenthesis);
}
@override
void visitPartDirective(PartDirective node) {
_visitDirectiveMetadata(node);
_simpleStatement(node, () {
token(node.keyword);
space();
visit(node.uri);
});
}
@override
void visitPartOfDirective(PartOfDirective node) {
_visitDirectiveMetadata(node);
_simpleStatement(node, () {
token(node.keyword);
space();
token(node.ofKeyword);
space();
// Part-of may have either a name or a URI. Only one of these will be
// non-null. We visit both since visit() ignores null.
visit(node.libraryName);
visit(node.uri);
});
}
@override
void visitPostfixExpression(PostfixExpression node) {
visit(node.operand);
token(node.operator);
}
@override
void visitPrefixedIdentifier(PrefixedIdentifier node) {
CallChainVisitor(this, node).visit();
}
@override
void visitPrefixExpression(PrefixExpression node) {
token(node.operator);
// Edge case: put a space after "-" if the operand is "-" or "--" so we
// don't merge the operators.
var operand = node.operand;
if (operand is PrefixExpression &&
(operand.operator.lexeme == '-' || operand.operator.lexeme == '--')) {
space();
}
visit(node.operand);
}
@override
void visitPropertyAccess(PropertyAccess node) {
if (node.isCascaded) {
token(node.operator);
visit(node.propertyName);
return;
}
CallChainVisitor(this, node).visit();
}
@override
void visitRedirectingConstructorInvocation(
RedirectingConstructorInvocation node) {
builder.startSpan();
token(node.thisKeyword);
token(node.period);
visit(node.constructorName);
visit(node.argumentList);
builder.endSpan();
}
@override
void visitRethrowExpression(RethrowExpression node) {
token(node.rethrowKeyword);
}
@override
void visitReturnStatement(ReturnStatement node) {
_simpleStatement(node, () {
token(node.returnKeyword);
visit(node.expression, before: space);
});
}
@override
void visitScriptTag(ScriptTag node) {
// The lexeme includes the trailing newline. Strip it off since the
// formatter ensures it gets a newline after it. Since the script tag must
// come at the top of the file, we don't have to worry about preceding
// comments or whitespace.
_writeText(node.scriptTag.lexeme.trim(), node.offset);
twoNewlines();
}
@override
void visitSetOrMapLiteral(SetOrMapLiteral node) {
_visitCollectionLiteral(
node, node.leftBracket, node.elements, node.rightBracket);
}
@override
void visitShowCombinator(ShowCombinator node) {
_visitCombinator(node.keyword, node.shownNames);
}
@override
void visitSimpleFormalParameter(SimpleFormalParameter node) {
visitParameterMetadata(node.metadata, () {
_beginFormalParameter(node);
var hasType = node.type != null;
if (_insideNewTypedefFix && !hasType) {
// Parameters can use "var" instead of "dynamic". Since we are inserting
// "dynamic" in that case, remove the "var".
if (node.keyword != null) {
if (node.keyword!.type != Keyword.VAR) {
modifier(node.keyword);
} else {
// Keep any comment attached to "var".
writePrecedingCommentsAndNewlines(node.keyword!);
}
}
// In function declarations and the old typedef syntax, you can have a
// parameter name without a type. In the new syntax, you can have a type
// without a name. Add "dynamic" in that case.
// Ensure comments on the identifier comes before the inserted type.
token(node.identifier!.token, before: () {
_writeText('dynamic', node.identifier!.offset);
split();
});
} else {
modifier(node.keyword);
visit(node.type);
if (hasType && node.identifier != null) split();
visit(node.identifier);
}
_endFormalParameter(node);
});
}
@override
void visitSimpleIdentifier(SimpleIdentifier node) {
token(node.token);
}
@override
void visitSimpleStringLiteral(SimpleStringLiteral node) {
_writeStringLiteral(node.literal);
}
@override
void visitSpreadElement(SpreadElement node) {
token(node.spreadOperator);
visit(node.expression);
}
@override
void visitStringInterpolation(StringInterpolation node) {
for (var element in node.elements) {
visit(element);
}
}
@override
void visitSuperConstructorInvocation(SuperConstructorInvocation node) {
builder.startSpan();
token(node.superKeyword);
token(node.period);
visit(node.constructorName);
visit(node.argumentList);
builder.endSpan();
}
@override
void visitSuperExpression(SuperExpression node) {
token(node.superKeyword);
}
@override
void visitSwitchCase(SwitchCase node) {
_visitLabels(node.labels);
token(node.keyword);
space();
visit(node.expression);
token(node.colon);
builder.indent();
// TODO(rnystrom): Allow inline cases?
newline();
visitNodes(node.statements, between: oneOrTwoNewlines);
builder.unindent();
}
@override
void visitSwitchDefault(SwitchDefault node) {
_visitLabels(node.labels);
token(node.keyword);
token(node.colon);
builder.indent();
// TODO(rnystrom): Allow inline cases?
newline();
visitNodes(node.statements, between: oneOrTwoNewlines);
builder.unindent();
}
@override
void visitSwitchStatement(SwitchStatement node) {
builder.nestExpression();
token(node.switchKeyword);
space();
token(node.leftParenthesis);
soloZeroSplit();
visit(node.expression);
token(node.rightParenthesis);
space();
token(node.leftBracket);
builder.unnest();
builder.indent();
newline();
visitNodes(node.members, between: oneOrTwoNewlines, after: newline);
token(node.rightBracket, before: () {
builder.unindent();
newline();
});
}
@override
void visitSymbolLiteral(SymbolLiteral node) {
token(node.poundSign);
var components = node.components;
for (var component in components) {
// The '.' separator
if (component.previous!.lexeme == '.') {
token(component.previous);
}
token(component);
}
}
@override
void visitThisExpression(ThisExpression node) {
token(node.thisKeyword);
}
@override
void visitThrowExpression(ThrowExpression node) {
token(node.throwKeyword);
space();
visit(node.expression);
}
@override
void visitTopLevelVariableDeclaration(TopLevelVariableDeclaration node) {
visitMetadata(node.metadata);
_simpleStatement(node, () {
modifier(node.externalKeyword);
visit(node.variables);
});
}
@override
void visitTryStatement(TryStatement node) {
token(node.tryKeyword);
space();
visit(node.body);
visitNodes(node.catchClauses, before: space, between: space);
token(node.finallyKeyword, before: space, after: space);
visit(node.finallyBlock);
}
@override
void visitTypeArgumentList(TypeArgumentList node) {
_visitGenericList(node.leftBracket, node.rightBracket, node.arguments);
}
@override
void visitTypeName(TypeName node) {
visit(node.name);
visit(node.typeArguments);
token(node.question);
}
@override
void visitTypeParameter(TypeParameter node) {
visitParameterMetadata(node.metadata, () {
visit(node.name);
token(node.extendsKeyword, before: space, after: space);
visit(node.bound);
});
}
@override
void visitTypeParameterList(TypeParameterList node) {
_metadataRules.add(MetadataRule());
_visitGenericList(node.leftBracket, node.rightBracket, node.typeParameters);
_metadataRules.removeLast();
}
@override
void visitVariableDeclaration(VariableDeclaration node) {
visit(node.name);
if (node.initializer == null) return;
// If there are multiple variables being declared, we want to nest the
// initializers farther so they don't line up with the variables. Bad:
//
// var a =
// aValue,
// b =
// bValue;
//
// Good:
//
// var a =
// aValue,
// b =
// bValue;
var hasMultipleVariables =
(node.parent as VariableDeclarationList).variables.length > 1;
_visitAssignment(node.equals!, node.initializer!,
nest: hasMultipleVariables);
}
@override
void visitVariableDeclarationList(VariableDeclarationList node) {
visitMetadata(node.metadata);
// Allow but try to avoid splitting between the type and name.
builder.startSpan();
modifier(node.lateKeyword);
modifier(node.keyword);
visit(node.type, after: soloSplit);
builder.endSpan();
_startPossibleConstContext(node.keyword);
// Use a single rule for all of the variables. If there are multiple
// declarations, we will try to keep them all on one line. If that isn't
// possible, we split after *every* declaration so that each is on its own
// line.
builder.startRule();
// If there are multiple declarations split across lines, then we want any
// blocks in the initializers to indent past the variables.
if (node.variables.length > 1) builder.startBlockArgumentNesting();
visitCommaSeparatedNodes(node.variables, between: split);
if (node.variables.length > 1) builder.endBlockArgumentNesting();
builder.endRule();
_endPossibleConstContext(node.keyword);
}
@override
void visitVariableDeclarationStatement(VariableDeclarationStatement node) {
_simpleStatement(node, () {
visit(node.variables);
});
}
@override
void visitWhileStatement(WhileStatement node) {
builder.nestExpression();
token(node.whileKeyword);
space();
token(node.leftParenthesis);
soloZeroSplit();
visit(node.condition);
token(node.rightParenthesis);
builder.unnest();
_visitLoopBody(node.body);
}
@override
void visitWithClause(WithClause node) {
_visitCombinator(node.withKeyword, node.mixinTypes);
}
@override
void visitYieldStatement(YieldStatement node) {
_simpleStatement(node, () {
token(node.yieldKeyword);
token(node.star);
space();
visit(node.expression);
});
}
/// Visit a [node], and if not null, optionally preceded or followed by the
/// specified functions.
void visit(AstNode? node, {void Function()? before, void Function()? after}) {
if (node == null) return;
if (before != null) before();
node.accept(this);
if (after != null) after();
}
/// Visit metadata annotations on declarations, and members.
///
/// These always force the annotations to be on the previous line.
void visitMetadata(NodeList<Annotation> metadata) {
visitNodes(metadata, between: newline, after: newline);
}
/// Visit metadata annotations for a directive.
///
/// Always force the annotations to be on a previous line.
void _visitDirectiveMetadata(Directive directive) {
// Preserve a blank line before the first directive since users (in
// particular the test package) sometimes use that for metadata that
// applies to the entire library and not the following directive itself.
var isFirst =
directive == (directive.parent as CompilationUnit).directives.first;
visitNodes(directive.metadata,
between: newline, after: isFirst ? oneOrTwoNewlines : newline);
}
/// Visits metadata annotations on parameters and type parameters.
///
/// Unlike other annotations, these are allowed to stay on the same line as
/// the parameter.
void visitParameterMetadata(
NodeList<Annotation> metadata, void Function() visitParameter) {
if (metadata.isEmpty) {
visitParameter();
return;
}
// Split before all of the annotations or none.
builder.startLazyRule(_metadataRules.last);
visitNodes(metadata, between: split, after: () {
// Don't nest until right before the last metadata. Ensures we only
// indent the parameter and not any of the metadata:
//
// function(
// @LongAnnotation
// @LongAnnotation
// indentedParameter) {}
builder.nestExpression(now: true);
split();
});
visitParameter();
builder.unnest();
// Wrap the rule around the parameter too. If it splits, we want to force
// the annotations to split as well.
builder.endRule();
}
/// Visits [node], which may be in an argument list controlled by [rule].
///
/// This is called directly by [ArgumentListVisitor] so that it can pass in
/// the surrounding named argument rule. That way, this can ensure that a
/// split between the name and argument forces the argument list to split
/// too.
void visitNamedArgument(NamedExpression node, [NamedRule? rule]) {
builder.nestExpression();
builder.startSpan();
visit(node.name);
// Don't allow a split between a name and a collection. Instead, we want
// the collection itself to split, or to split before the argument.
if (node.expression is ListLiteral || node.expression is SetOrMapLiteral) {
space();
} else {
var split = soloSplit();
if (rule != null) split.imply(rule);
}
visit(node.expression);
builder.endSpan();
builder.unnest();
}
/// Visits the `=` and the following expression in any place where an `=`
/// appears:
///
/// * Assignment
/// * Variable declaration
/// * Constructor initialization
///
/// If [nest] is true, an extra level of expression nesting is added after
/// the "=".
void _visitAssignment(Token equalsOperator, Expression rightHandSide,
{bool nest = false}) {
space();
token(equalsOperator);
if (nest) builder.nestExpression(now: true);
soloSplit(_assignmentCost(rightHandSide));
builder.startSpan();
visit(rightHandSide);
builder.endSpan();
if (nest) builder.unnest();
}
/// Visits a type parameter or type argument list.
void _visitGenericList(
Token leftBracket, Token rightBracket, List<AstNode> nodes) {
var rule = TypeArgumentRule();
builder.startLazyRule(rule);
builder.startSpan();
builder.nestExpression();
token(leftBracket);
rule.beforeArgument(zeroSplit());
for (var node in nodes) {
visit(node);
// Write the trailing comma.
if (node != nodes.last) {
token(node.endToken.next);
rule.beforeArgument(split());
}
}
token(rightBracket);
builder.unnest();
builder.endSpan();
builder.endRule();
}
|
{
"url": "https://dart.googlesource.com/dart_style/+/1630914fbea0f8ebe7d4cd7c34fa741bc79e8f45/lib/src/source_visitor.dart",
"source_domain": "dart.googlesource.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "1049425",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5TIBMASRRYSZKEYX2OKMSM6FKFWV34VA",
"WARC-Concurrent-To": "<urn:uuid:10f25461-c034-4f08-b458-d6b64b8a79ba>",
"WARC-Date": "2022-08-18T16:52:06Z",
"WARC-IP-Address": "172.253.122.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SHYQGKJEIPTK47XOEI45GT7D5TKIYH6A",
"WARC-Record-ID": "<urn:uuid:94703713-9bb2-41bc-8651-eb7b434c3547>",
"WARC-Target-URI": "https://dart.googlesource.com/dart_style/+/1630914fbea0f8ebe7d4cd7c34fa741bc79e8f45/lib/src/source_visitor.dart",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ba4d6cc7-23cd-481a-9605-73cc0e5a900a>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-170\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
68,
145,
223,
283,
328,
390,
437,
486,
539,
576,
610,
631,
660,
690,
719,
750,
779,
804,
838,
865,
890,
916,
991,
1011,
1060,
1137,
1205,
1209,
1287,
1363,
1386,
1390,
1403,
1422,
1437,
1441,
1465,
1469,
1496,
1511,
1515,
1592,
1666,
1693,
1697,
1773,
1846,
1883,
1934,
1979,
2018,
2058,
2061,
2078,
2117,
2162,
2175,
2177,
2229,
2232,
2248,
2271,
2297,
2359,
2430,
2432,
2478,
2482,
2560,
2636,
2683,
2728,
2761,
2796,
2828,
2860,
2933,
3009,
3064,
3087,
3108,
3129,
3148,
3168,
3183,
3225,
3247,
3278,
3314,
3352,
3354,
3394,
3458,
3531,
3559,
3603,
3634,
3685,
3687,
3701,
3703,
3754,
3795,
3858,
3880,
3912,
3962,
3988,
4020,
4046,
4123,
4153,
4189,
4264,
4290,
4324,
4403,
4407,
4465,
4485,
4562,
4585,
4644,
4648,
4727,
4797,
4876,
4900,
4935,
4996,
5000,
5075,
5146,
5220,
5259,
5263,
5339,
5414,
5425,
5466,
5530,
5534,
5609,
5686,
5765,
5780,
5826,
5905,
5915,
5919,
5992,
6070,
6147,
6224,
6290,
6294,
6372,
6444,
6500,
6504,
6577,
6650,
6701,
6742,
6793,
6865,
6886,
6947,
7020,
7065,
7126,
7173,
7230,
7234,
7307,
7338,
7342,
7420,
7448,
7479,
7492,
7521,
7577,
7647,
7697,
7719,
7721,
7731,
7781,
7857,
7919,
7922,
7927,
7937,
7946,
7958,
7968,
7973,
7976,
8048,
8103,
8106,
8178,
8209,
8212,
8221,
8258,
8305,
8308,
8377,
8431,
8454,
8480,
8510,
8530,
8571,
8603,
8636,
8655,
8662,
8664,
8666,
8700,
8738,
8758,
8827,
8846,
8848,
8913,
8932,
8934,
8978,
9012,
9044,
9084,
9156,
9159,
9177,
9191,
9204,
9224,
9300,
9320,
9322,
9343,
9364,
9406,
9457,
9491,
9510,
9529,
9531,
9541,
9581,
9601,
9619,
9645,
9672,
9692,
9721,
9751,
9802,
9819,
9878,
9895,
9897,
9915,
9917,
9946,
9950,
10026,
10101,
10105,
10147,
10206,
10258,
10336,
10370,
10429,
10439,
10513,
10558,
10588,
10617,
10691,
10761,
10791,
10799,
10801,
10875,
10950,
10990,
11032,
11057,
11125,
11133,
11135,
11181,
11222,
11260,
11262,
11272,
11316,
11337,
11363,
11387,
11400,
11424,
11433,
11451,
11469,
11488,
11490,
11500,
11554,
11581,
11627,
11683,
11757,
11832,
11872,
11909,
11934,
11997,
12005,
12007,
12033,
12081,
12144,
12161,
12179,
12181,
12191,
12241,
12269,
12296,
12330,
12386,
12460,
12535,
12575,
12612,
12637,
12700,
12708,
12710,
12758,
12821,
12838,
12842,
12844,
12854,
12914,
12940,
12966,
13019,
13037,
13039,
13049,
13099,
13125,
13134,
13158,
13160,
13170,
13222,
13243,
13316,
13392,
13421,
13424,
13439,
13454,
13469,
13482,
13539,
13583,
13657,
13694,
13719,
13791,
13839,
13887,
13897,
13927,
14000,
14025,
14034,
14053,
14062,
14088,
14097,
14107,
14109,
14111,
14184,
14252,
14289,
14305,
14340,
14376,
14395,
14414,
14416,
14426,
14456,
14528,
14601,
14626,
14688,
14713,
14780,
14783,
14803,
14817,
14851,
14897,
14938,
14975,
14986,
14988,
14990,
15016,
15024,
15026,
15103,
15179,
15204,
15244,
15281,
15290,
15320,
15322,
15346,
15387,
15406,
15421,
15430,
15450,
15452,
15470,
15491,
15540,
15593,
15659,
15692,
15740,
15742,
15744,
15746,
15789,
15829,
15864,
15905,
15914,
15943,
15945,
15947,
15957,
16011,
16046,
16055,
16089,
16110,
16145,
16163,
16198,
16217,
16219,
16229,
16277,
16298,
16300,
16310,
16358,
16386,
16412,
16446,
16450,
16452,
16462,
16516,
16543,
16610,
16678,
16732,
16760,
16833,
16835,
16907,
16972,
16975,
16987,
17000,
17013,
17028,
17044,
17047,
17119,
17194,
17267,
17329,
17332,
17344,
17357,
17370,
17385,
17401,
17440,
17498,
17507,
17527,
17529,
17588,
17625,
17697,
17739,
17768,
17837,
17839,
17852,
17881,
17900,
17902,
17956,
17984,
18003,
18005,
18040,
18058,
18113,
18115,
18191,
18222,
18226,
18299,
18372,
18376,
18382,
18389,
18396,
18420,
18468,
18513,
18562,
18633,
18672,
18697,
18739,
18776,
18831,
18868,
18870,
18938,
18981,
18984,
19003,
19014,
19032,
19060,
19091,
19133,
19135,
19206,
19231,
19282,
19352,
19409,
19412,
19431,
19434,
19509,
19565,
19616,
19667,
19717,
19767,
19777,
19844,
19917,
19933,
19980,
20018,
20038,
20073,
20122,
20136,
20138,
20147,
20161,
20163,
20165,
20178,
20180,
20190,
20232,
20269,
20296,
20329,
20363,
20372,
20374,
20400,
20409,
20438,
20470,
20503,
20536,
20566,
20575,
20584,
20593,
20595,
20613,
20615,
20625,
20677,
20707,
20733,
20765,
20791,
20800,
20818,
20846,
20873,
20910,
20934,
20964,
20983,
21024,
21033,
21051,
21081,
21110,
21139,
21141,
21151,
21199,
21229,
21257,
21289,
21317,
21326,
21344,
21372,
21381,
21401,
21410,
21434,
21471,
21495,
21525,
21544,
21548,
21550,
21560,
21601,
21611,
21670,
21680,
21730,
21753,
21823,
21873,
21942,
21967,
21982,
22015,
22017,
22068,
22092,
22137,
22191,
22228,
22292,
22330,
22349,
22364,
22373,
22441,
22485,
22505,
22507,
22527,
22548,
22568,
22631,
22651,
22700,
22753,
22801,
22834,
22882,
22884,
22886,
22888,
22890,
22900,
22962,
23030,
23091,
23155,
23197,
23271,
23342,
23383,
23408,
23431,
23501,
23558,
23595,
23613,
23634,
23643,
23665,
23674,
23700,
23728,
23746,
23755,
23774,
23783,
23811,
23887,
23963,
23993,
24057,
24076,
24095,
24130,
24164,
24166,
24176,
24222,
24245,
24254,
24283,
24301,
24332,
24358,
24367,
24391,
24404,
24423,
24441,
24443,
24473,
24482,
24499,
24501,
24511,
24575,
24605,
24637,
24666,
24697,
24721,
24741,
24759,
24831,
24904,
24980,
25035,
25107,
25156,
25222,
25272,
25317,
25359,
25393,
25411,
25454,
25491,
25546,
25565,
25567,
25571,
25573,
25636,
25682,
25695,
25740,
25775,
25777,
25843,
25907,
25955,
25979,
26049,
26124,
26196,
26263,
26266,
26274,
26288,
26310,
26322,
26331,
26367,
26434,
26459,
26461,
26469,
26492,
26501,
26520,
26529,
26562,
26609,
26682,
26691,
26699,
26722,
26731,
26807,
26810,
26830,
26856,
26894,
26897,
26905,
26918,
26946,
26984,
26987,
27063,
27112,
27115,
27124,
27137,
27166,
27207,
27226,
27228,
27281,
27294,
27314,
27363,
27374,
27376,
27411,
27413,
27433,
27476,
27478,
27488,
27562,
27588,
27613,
27633,
27656,
27704,
27722,
27724,
27734,
27784,
27802,
27822,
27840,
27842,
27852,
27906,
27934,
27963,
27997,
28001,
28003,
28013,
28069,
28093,
28125,
28149,
28151,
28161,
28225,
28248,
28278,
28299,
28325,
28390,
28422,
28431,
28483,
28524,
28533,
28590,
28641,
28664,
28666,
28714,
28740,
28758,
28777,
28779,
28781,
28791,
28833,
28859,
28882,
28891,
28919,
28937,
28963,
28972,
28998,
29007,
29036,
29053,
29076,
29106,
29129,
29147,
29149,
29159,
29199,
29240,
29268,
29310,
29348,
29350,
29368,
29370,
29372,
29382,
29428,
29449,
29451,
29461,
29515,
29538,
29540,
29550,
29598,
29621,
29623,
29633,
29699,
29729,
29747,
29749,
29759,
29809,
29839,
29864,
29873,
29891,
29900,
29943,
30014,
30084,
30126,
30148,
30150,
30192,
30194,
30204,
30254,
30285,
30313,
30334,
30343,
30360,
30403,
30440,
30470,
30489,
30493,
30495,
30505,
30569,
30604,
30613,
30647,
30682,
30754,
30768,
30812,
30853,
30923,
30943,
30952,
31026,
31096,
31157,
31199,
31272,
31338,
31374,
31400,
31436,
31495,
31497,
31563,
31584,
31608,
31627,
31691,
31751,
31774,
31776,
31844,
31848,
31913,
31978,
32035,
32066,
32090,
32147,
32183,
32213,
32258,
32289,
32333,
32363,
32365,
32428,
32446,
32448,
32521,
32593,
32647,
32698,
32748,
32803,
32861,
32911,
32947,
32981,
33050,
33114,
33148,
33206,
33229,
33255,
33300,
33336,
33405,
33469,
33503,
33562,
33585,
33608,
33634,
33660,
33704,
33740,
33814,
33870,
33937,
34006,
34008,
34053,
34097,
34131,
34151,
34188,
34213,
34253,
34255,
34318,
34336,
34338,
34414,
34471,
34543,
34600,
34645,
34718,
34791,
34831,
34893,
34963,
35015,
35046,
35089,
35125,
35141,
35173,
35210,
35241,
35316,
35339,
35377,
35443,
35466,
35468,
35521,
35578,
35630,
35656,
35701,
35744,
35801,
35804,
35821,
35824,
35849,
35899,
35907,
35927,
35966,
36002,
36047,
36071,
36102,
36150,
36185,
36228,
36283,
36286,
36303,
36306,
36327,
36377,
36385,
36407,
36410,
36459,
36533,
36542,
36566,
36627,
36693,
36695,
36723,
36741,
36743,
36822,
36877,
36881,
36957,
37025,
37071,
37136,
37193,
37248,
37277,
37307,
37336,
37366,
37401,
37427,
37458,
37488,
37559,
37621,
37667,
37680,
37719,
37751,
37780,
37820,
37848,
37873,
37898,
37928,
37965,
37997,
38025,
38055,
38082,
38110,
38146,
38173,
38186,
38195,
38269,
38310,
38324,
38326,
38328,
38338,
38396,
38463,
38503,
38539,
38547,
38549,
38577,
38601,
38605,
38607,
38617,
38663,
38676,
38704,
38713,
38737,
38739,
38749,
38809,
38839,
38865,
38895,
38968,
39038,
39063,
39072,
39090,
39092,
39120,
39133,
39156,
39165,
39191,
39200,
39218,
39248,
39277,
39306,
39308,
39318,
39370,
39400,
39428,
39460,
39490,
39522,
39555,
39575,
39579,
39581,
39591,
39651,
39694,
39723,
39758,
39790,
39815,
39835,
39859,
39883,
39905,
39932,
39936,
39938,
39948,
40004,
40036,
40075,
40106,
40135,
40191,
40261,
40291,
40299,
40301,
40376,
40452,
40492,
40535,
40575,
40583,
40585,
40622,
40674,
40685,
40706,
40768,
40814,
40843,
40879,
40889,
40922,
40957,
41003,
41028,
41053,
41122,
41193,
41229,
41256,
41265,
41301,
41335,
41337,
41358,
41394,
41408,
41433,
41497,
41499,
41518,
41537,
41539,
41572,
41611,
41663,
41709,
41739,
41792,
41829,
41904,
41943,
41970,
42006,
42020,
42045,
42114,
42116,
42151,
42170,
42209,
42237,
42239,
42268,
42298,
42336,
42338,
42348,
42388,
42462,
42502,
42553,
42579,
42619,
42643,
42652,
42681,
42751,
42772,
42799,
42820,
42846,
42876,
42895,
42913,
42959,
42979,
42988,
42997,
43006,
43070,
43107,
43109,
43127,
43181,
43199,
43274,
43287,
43347,
43366,
43368,
43378,
43422,
43448,
43488,
43512,
43521,
43550,
43571,
43597,
43627,
43646,
43664,
43691,
43693,
43703,
43777,
43849,
43920,
43993,
44059,
44062,
44128,
44131,
44139,
44155,
44158,
44226,
44299,
44327,
44330,
44343,
44369,
44384,
44392,
44410,
44413,
44485,
44534,
44537,
44546,
44554,
44562,
44587,
44664,
44724,
44794,
44820,
44895,
44952,
44984,
44986,
45037,
45050,
45073,
45082,
45104,
45106,
45116,
45188,
45212,
45244,
45246,
45256,
45324,
45386,
45422,
45448,
45514,
45535,
45569,
45606,
45637,
45676,
45738,
45747,
45751,
45770,
45788,
45827,
45829,
45839,
45903,
45931,
45970,
45972,
46026,
46053,
46078,
46115,
46138,
46166,
46188,
46220,
46229,
46293,
46314,
46371,
46390,
46392,
46394,
46404,
46462,
46518,
46520,
46530,
46606,
46639,
46641,
46651,
46707,
46780,
46817,
46836,
46897,
46930,
46932,
46942,
47018,
47065,
47086,
47112,
47134,
47161,
47222,
47240,
47259,
47261,
47271,
47325,
47355,
47415,
47443,
47476,
47537,
47604,
47613,
47675,
47704,
47731,
47796,
47826,
47830,
47838,
47840,
47868,
47896,
47905,
47943,
47961,
47989,
48013,
48017,
48019,
48029,
48105,
48148,
48177,
48209,
48242,
48280,
48336,
48357,
48381,
48445,
48467,
48486,
48495,
48524,
48597,
48636,
48658,
48667,
48691,
48718,
48720,
48724,
48726,
48736,
48794,
48865,
48904,
48926,
48928,
48938,
48990,
49051,
49079,
49140,
49181,
49190,
49216,
49220,
49222,
49232,
49280,
49330,
49332,
49342,
49380,
49451,
49513,
49532,
49573,
49596,
49629,
49638,
49641,
49711,
49786,
49862,
49936,
49966,
49969,
49974,
49997,
50011,
50026,
50040,
50045,
50050,
50053,
50085,
50088,
50093,
50116,
50130,
50156,
50161,
50164,
50235,
50297,
50322,
50373,
50407,
50478,
50507,
50548,
50594,
50596,
50598,
50622,
50681,
50714,
50780,
50830,
50832,
50902,
50948,
51022,
51059,
51111,
51127,
51136,
51145,
51154,
51228,
51249,
51286,
51288,
51302,
51352,
51370,
51372,
51444,
51521,
51546,
51579,
51613,
51631,
51657,
51666,
51698,
51724,
51757,
51799,
51849,
51877,
51879,
51953,
52027,
52080,
52115,
52158,
52167,
52176,
52185,
52187,
52215,
52283,
52306,
52347,
52349,
52351,
52402,
52446,
52470,
52502,
52541,
52569,
52571,
52573,
52648,
52661,
52708,
52727,
52729,
52739,
52781,
52807,
52830,
52839,
52868,
52891,
52921,
52939,
52949,
52986,
53034,
53043,
53058,
53067,
53136,
53205,
53269,
53287,
53308,
53377,
53397,
53431,
53476,
53485,
53526,
53528,
53543,
53562,
53582,
53584,
53586,
53619,
53653,
53688,
53697,
53706,
53775,
53846,
53892,
53903,
53905,
53930,
53964,
53966,
53968,
53978,
54030,
54089,
54091,
54101,
54151,
54182,
54210,
54231,
54240,
54257,
54300,
54330,
54343,
54386,
54409,
54418,
54438,
54440,
54477,
54507,
54526,
54530,
54532,
54542,
54592,
54618,
54641,
54661,
54670,
54690,
54692,
54721,
54739,
54741,
54799,
54803,
54881,
54898,
54949,
54987,
55058,
55098,
55101,
55164,
55181,
55183,
55214,
55236,
55261,
55278,
55297,
55323,
55342,
55344,
55354,
55426,
55447,
55474,
55502,
55546,
55597,
55621,
55674,
55727,
55748,
55772,
55774,
55776,
55798,
55833,
55842,
55903,
55953,
55955,
55996,
56069,
56145,
56216,
56242,
56271,
56313,
56332,
56393,
56412,
56452,
56470,
56472,
56482,
56530,
56551,
56553,
56563,
56629,
56653,
56678,
56699,
56723,
56742,
56768,
56795,
56797,
56807,
56865,
56901,
56903,
56913,
56957,
56978,
57004,
57028,
57041,
57065,
57090,
57099,
57117,
57135,
57154,
57156,
57166,
57196,
57215,
57234,
57236,
57246,
57298,
57325,
57348,
57350,
57360,
57412,
57443,
57471,
57492,
57501,
57519,
57523,
57525,
57535,
57589,
57619,
57668,
57713,
57731,
57733,
57735,
57745,
57787,
57857,
57896,
57973,
57998,
58063,
58065,
58075,
58125,
58151,
58168,
58191,
58204,
58223,
58241,
58243,
58253,
58307,
58344,
58346,
58356,
58408,
58482,
58512,
58515,
58585,
58654,
58726,
58799,
58802,
58877,
58950,
59026,
59070,
59126,
59180,
59206,
59227,
59254,
59295,
59315,
59332,
59334,
59389,
59411,
59435,
59479,
59552,
59622,
59641,
59644,
59668,
59702,
59736,
59739,
59812,
59883,
59936,
59962,
59989,
60050,
60068,
60087,
60105,
60113,
60115,
60153,
60155,
60165,
60217,
60247,
60273,
60299,
60308,
60326,
60354,
60424,
60449,
60479,
60549,
60562,
60589,
60598,
60644,
60646,
60683,
60753,
60777,
60846,
60863,
60865,
60895,
60914,
60923,
60941,
60971,
61000,
61029,
61031,
61041,
61091,
61117,
61119,
61129,
61173,
61200,
61233,
61235,
61245,
61301,
61329,
61364,
61377,
61404,
61446,
61464,
61468,
61470,
61480,
61522,
61543,
61545,
61555,
61591,
61653,
61655,
61665,
61731,
61757,
61786,
61810,
61828,
61858,
61860,
61870,
61916,
61947,
61975,
61996,
62005,
62022,
62026,
62028,
62038,
62088,
62119,
62147,
62168,
62177,
62200,
62209,
62279,
62334,
62359,
62376,
62380,
62382,
62392,
62446,
62467,
62489,
62491,
62501,
62557,
62595,
62597,
62607,
62659,
62681,
62753,
62783,
62811,
62846,
62917,
62926,
62928,
62949,
62951,
62961,
63009,
63032,
63054,
63080,
63088,
63090,
63128,
63130,
63140,
63184,
63225,
63246,
63271,
63291,
63320,
63346,
63365,
63367,
63377,
63431,
63459,
63461,
63471,
63521,
63549,
63576,
63615,
63619,
63621,
63631,
63669,
63737,
63812,
63883,
63910,
63965,
63980,
63982,
63992,
64042,
64067,
64126,
64128,
64138,
64186,
64235,
64237,
64247,
64309,
64352,
64381,
64414,
64454,
64527,
64572,
64600,
64641,
64665,
64674,
64713,
64763,
64765,
64767,
64838,
64911,
64958,
65027,
65070,
65118,
65127,
65131,
65140,
65164,
65182,
65231,
65255,
65257,
65284,
65288,
65290,
65300,
65352,
65371,
65373,
65383,
65441,
65476,
65478,
65488,
65534,
65562,
65586,
65588,
65598,
65656,
65693,
65709,
65711,
65713,
65723,
65795,
65816,
65842,
65862,
65891,
65917,
65936,
65938,
65948,
65998,
66024,
66026,
66036,
66076,
66103,
66124,
66133,
66157,
66176,
66194,
66233,
66244,
66300,
66320,
66322,
66332,
66378,
66405,
66426,
66445,
66463,
66502,
66513,
66569,
66589,
66591,
66601,
66651,
66677,
66704,
66713,
66742,
66759,
66783,
66813,
66822,
66847,
66865,
66883,
66894,
66963,
67001,
67021,
67032,
67036,
67038,
67048,
67094,
67117,
67151,
67187,
67208,
67249,
67276,
67278,
67296,
67298,
67300,
67310,
67358,
67383,
67385,
67395,
67445,
67471,
67480,
67504,
67506,
67516,
67590,
67620,
67648,
67680,
67703,
67707,
67709,
67719,
67763,
67787,
67796,
67814,
67876,
67933,
67959,
67961,
67971,
68023,
68095,
68097,
68107,
68143,
68161,
68188,
68210,
68212,
68222,
68268,
68311,
68329,
68386,
68405,
68409,
68411,
68421,
68475,
68511,
68588,
68617,
68619,
68629,
68687,
68705,
68743,
68814,
68885,
68888,
68899,
68910,
68917,
68928,
68931,
68940,
68943,
68954,
68965,
68972,
68983,
69010,
69073,
69123,
69152,
69154,
69164,
69230,
69260,
69323,
69344,
69372,
69396,
69432,
69451,
69493,
69562,
69635,
69710,
69719,
69740,
69815,
69875,
69943,
70001,
70067,
70086,
70126,
70128,
70138,
70214,
70242,
70265,
70269,
70271,
70281,
70329,
70355,
70381,
70390,
70419,
70436,
70459,
70489,
70507,
70534,
70536,
70546,
70586,
70639,
70641,
70651,
70699,
70727,
70753,
70771,
70780,
70804,
70808,
70810,
70886,
70911,
70990,
71016,
71046,
71065,
71093,
71095,
71156,
71160,
71227,
71279,
71335,
71337,
71385,
71389,
71448,
71500,
71568,
71637,
71710,
71724,
71793,
71824,
71888,
71890,
71957,
71961,
72037,
72056,
72085,
72150,
72174,
72192,
72200,
72202,
72250,
72294,
72343,
72411,
72464,
72467,
72480,
72499,
72518,
72543,
72578,
72587,
72591,
72609,
72627,
72701,
72738,
72757,
72759,
72833,
72837,
72913,
72987,
73061,
73070,
73137,
73163,
73184,
73202,
73275,
73343,
73419,
73428,
73437,
73462,
73499,
73501,
73525,
73544,
73562,
73564,
73638,
73651,
73655,
73672,
73699,
73732,
73736,
73811,
73824,
73894,
73917,
73926,
73949,
73994,
74037,
74058,
74080,
74099,
74127,
74129,
74180,
74204,
74266,
74297,
74326,
74347,
74373,
74393,
74427,
74453,
74466,
74495,
74521,
74548,
74578,
74580,
74582,
74603,
74621,
74640,
74659
],
"line_end_idx": [
68,
145,
223,
283,
328,
390,
437,
486,
539,
576,
610,
631,
660,
690,
719,
750,
779,
804,
838,
865,
890,
916,
991,
1011,
1060,
1137,
1205,
1209,
1287,
1363,
1386,
1390,
1403,
1422,
1437,
1441,
1465,
1469,
1496,
1511,
1515,
1592,
1666,
1693,
1697,
1773,
1846,
1883,
1934,
1979,
2018,
2058,
2061,
2078,
2117,
2162,
2175,
2177,
2229,
2232,
2248,
2271,
2297,
2359,
2430,
2432,
2478,
2482,
2560,
2636,
2683,
2728,
2761,
2796,
2828,
2860,
2933,
3009,
3064,
3087,
3108,
3129,
3148,
3168,
3183,
3225,
3247,
3278,
3314,
3352,
3354,
3394,
3458,
3531,
3559,
3603,
3634,
3685,
3687,
3701,
3703,
3754,
3795,
3858,
3880,
3912,
3962,
3988,
4020,
4046,
4123,
4153,
4189,
4264,
4290,
4324,
4403,
4407,
4465,
4485,
4562,
4585,
4644,
4648,
4727,
4797,
4876,
4900,
4935,
4996,
5000,
5075,
5146,
5220,
5259,
5263,
5339,
5414,
5425,
5466,
5530,
5534,
5609,
5686,
5765,
5780,
5826,
5905,
5915,
5919,
5992,
6070,
6147,
6224,
6290,
6294,
6372,
6444,
6500,
6504,
6577,
6650,
6701,
6742,
6793,
6865,
6886,
6947,
7020,
7065,
7126,
7173,
7230,
7234,
7307,
7338,
7342,
7420,
7448,
7479,
7492,
7521,
7577,
7647,
7697,
7719,
7721,
7731,
7781,
7857,
7919,
7922,
7927,
7937,
7946,
7958,
7968,
7973,
7976,
8048,
8103,
8106,
8178,
8209,
8212,
8221,
8258,
8305,
8308,
8377,
8431,
8454,
8480,
8510,
8530,
8571,
8603,
8636,
8655,
8662,
8664,
8666,
8700,
8738,
8758,
8827,
8846,
8848,
8913,
8932,
8934,
8978,
9012,
9044,
9084,
9156,
9159,
9177,
9191,
9204,
9224,
9300,
9320,
9322,
9343,
9364,
9406,
9457,
9491,
9510,
9529,
9531,
9541,
9581,
9601,
9619,
9645,
9672,
9692,
9721,
9751,
9802,
9819,
9878,
9895,
9897,
9915,
9917,
9946,
9950,
10026,
10101,
10105,
10147,
10206,
10258,
10336,
10370,
10429,
10439,
10513,
10558,
10588,
10617,
10691,
10761,
10791,
10799,
10801,
10875,
10950,
10990,
11032,
11057,
11125,
11133,
11135,
11181,
11222,
11260,
11262,
11272,
11316,
11337,
11363,
11387,
11400,
11424,
11433,
11451,
11469,
11488,
11490,
11500,
11554,
11581,
11627,
11683,
11757,
11832,
11872,
11909,
11934,
11997,
12005,
12007,
12033,
12081,
12144,
12161,
12179,
12181,
12191,
12241,
12269,
12296,
12330,
12386,
12460,
12535,
12575,
12612,
12637,
12700,
12708,
12710,
12758,
12821,
12838,
12842,
12844,
12854,
12914,
12940,
12966,
13019,
13037,
13039,
13049,
13099,
13125,
13134,
13158,
13160,
13170,
13222,
13243,
13316,
13392,
13421,
13424,
13439,
13454,
13469,
13482,
13539,
13583,
13657,
13694,
13719,
13791,
13839,
13887,
13897,
13927,
14000,
14025,
14034,
14053,
14062,
14088,
14097,
14107,
14109,
14111,
14184,
14252,
14289,
14305,
14340,
14376,
14395,
14414,
14416,
14426,
14456,
14528,
14601,
14626,
14688,
14713,
14780,
14783,
14803,
14817,
14851,
14897,
14938,
14975,
14986,
14988,
14990,
15016,
15024,
15026,
15103,
15179,
15204,
15244,
15281,
15290,
15320,
15322,
15346,
15387,
15406,
15421,
15430,
15450,
15452,
15470,
15491,
15540,
15593,
15659,
15692,
15740,
15742,
15744,
15746,
15789,
15829,
15864,
15905,
15914,
15943,
15945,
15947,
15957,
16011,
16046,
16055,
16089,
16110,
16145,
16163,
16198,
16217,
16219,
16229,
16277,
16298,
16300,
16310,
16358,
16386,
16412,
16446,
16450,
16452,
16462,
16516,
16543,
16610,
16678,
16732,
16760,
16833,
16835,
16907,
16972,
16975,
16987,
17000,
17013,
17028,
17044,
17047,
17119,
17194,
17267,
17329,
17332,
17344,
17357,
17370,
17385,
17401,
17440,
17498,
17507,
17527,
17529,
17588,
17625,
17697,
17739,
17768,
17837,
17839,
17852,
17881,
17900,
17902,
17956,
17984,
18003,
18005,
18040,
18058,
18113,
18115,
18191,
18222,
18226,
18299,
18372,
18376,
18382,
18389,
18396,
18420,
18468,
18513,
18562,
18633,
18672,
18697,
18739,
18776,
18831,
18868,
18870,
18938,
18981,
18984,
19003,
19014,
19032,
19060,
19091,
19133,
19135,
19206,
19231,
19282,
19352,
19409,
19412,
19431,
19434,
19509,
19565,
19616,
19667,
19717,
19767,
19777,
19844,
19917,
19933,
19980,
20018,
20038,
20073,
20122,
20136,
20138,
20147,
20161,
20163,
20165,
20178,
20180,
20190,
20232,
20269,
20296,
20329,
20363,
20372,
20374,
20400,
20409,
20438,
20470,
20503,
20536,
20566,
20575,
20584,
20593,
20595,
20613,
20615,
20625,
20677,
20707,
20733,
20765,
20791,
20800,
20818,
20846,
20873,
20910,
20934,
20964,
20983,
21024,
21033,
21051,
21081,
21110,
21139,
21141,
21151,
21199,
21229,
21257,
21289,
21317,
21326,
21344,
21372,
21381,
21401,
21410,
21434,
21471,
21495,
21525,
21544,
21548,
21550,
21560,
21601,
21611,
21670,
21680,
21730,
21753,
21823,
21873,
21942,
21967,
21982,
22015,
22017,
22068,
22092,
22137,
22191,
22228,
22292,
22330,
22349,
22364,
22373,
22441,
22485,
22505,
22507,
22527,
22548,
22568,
22631,
22651,
22700,
22753,
22801,
22834,
22882,
22884,
22886,
22888,
22890,
22900,
22962,
23030,
23091,
23155,
23197,
23271,
23342,
23383,
23408,
23431,
23501,
23558,
23595,
23613,
23634,
23643,
23665,
23674,
23700,
23728,
23746,
23755,
23774,
23783,
23811,
23887,
23963,
23993,
24057,
24076,
24095,
24130,
24164,
24166,
24176,
24222,
24245,
24254,
24283,
24301,
24332,
24358,
24367,
24391,
24404,
24423,
24441,
24443,
24473,
24482,
24499,
24501,
24511,
24575,
24605,
24637,
24666,
24697,
24721,
24741,
24759,
24831,
24904,
24980,
25035,
25107,
25156,
25222,
25272,
25317,
25359,
25393,
25411,
25454,
25491,
25546,
25565,
25567,
25571,
25573,
25636,
25682,
25695,
25740,
25775,
25777,
25843,
25907,
25955,
25979,
26049,
26124,
26196,
26263,
26266,
26274,
26288,
26310,
26322,
26331,
26367,
26434,
26459,
26461,
26469,
26492,
26501,
26520,
26529,
26562,
26609,
26682,
26691,
26699,
26722,
26731,
26807,
26810,
26830,
26856,
26894,
26897,
26905,
26918,
26946,
26984,
26987,
27063,
27112,
27115,
27124,
27137,
27166,
27207,
27226,
27228,
27281,
27294,
27314,
27363,
27374,
27376,
27411,
27413,
27433,
27476,
27478,
27488,
27562,
27588,
27613,
27633,
27656,
27704,
27722,
27724,
27734,
27784,
27802,
27822,
27840,
27842,
27852,
27906,
27934,
27963,
27997,
28001,
28003,
28013,
28069,
28093,
28125,
28149,
28151,
28161,
28225,
28248,
28278,
28299,
28325,
28390,
28422,
28431,
28483,
28524,
28533,
28590,
28641,
28664,
28666,
28714,
28740,
28758,
28777,
28779,
28781,
28791,
28833,
28859,
28882,
28891,
28919,
28937,
28963,
28972,
28998,
29007,
29036,
29053,
29076,
29106,
29129,
29147,
29149,
29159,
29199,
29240,
29268,
29310,
29348,
29350,
29368,
29370,
29372,
29382,
29428,
29449,
29451,
29461,
29515,
29538,
29540,
29550,
29598,
29621,
29623,
29633,
29699,
29729,
29747,
29749,
29759,
29809,
29839,
29864,
29873,
29891,
29900,
29943,
30014,
30084,
30126,
30148,
30150,
30192,
30194,
30204,
30254,
30285,
30313,
30334,
30343,
30360,
30403,
30440,
30470,
30489,
30493,
30495,
30505,
30569,
30604,
30613,
30647,
30682,
30754,
30768,
30812,
30853,
30923,
30943,
30952,
31026,
31096,
31157,
31199,
31272,
31338,
31374,
31400,
31436,
31495,
31497,
31563,
31584,
31608,
31627,
31691,
31751,
31774,
31776,
31844,
31848,
31913,
31978,
32035,
32066,
32090,
32147,
32183,
32213,
32258,
32289,
32333,
32363,
32365,
32428,
32446,
32448,
32521,
32593,
32647,
32698,
32748,
32803,
32861,
32911,
32947,
32981,
33050,
33114,
33148,
33206,
33229,
33255,
33300,
33336,
33405,
33469,
33503,
33562,
33585,
33608,
33634,
33660,
33704,
33740,
33814,
33870,
33937,
34006,
34008,
34053,
34097,
34131,
34151,
34188,
34213,
34253,
34255,
34318,
34336,
34338,
34414,
34471,
34543,
34600,
34645,
34718,
34791,
34831,
34893,
34963,
35015,
35046,
35089,
35125,
35141,
35173,
35210,
35241,
35316,
35339,
35377,
35443,
35466,
35468,
35521,
35578,
35630,
35656,
35701,
35744,
35801,
35804,
35821,
35824,
35849,
35899,
35907,
35927,
35966,
36002,
36047,
36071,
36102,
36150,
36185,
36228,
36283,
36286,
36303,
36306,
36327,
36377,
36385,
36407,
36410,
36459,
36533,
36542,
36566,
36627,
36693,
36695,
36723,
36741,
36743,
36822,
36877,
36881,
36957,
37025,
37071,
37136,
37193,
37248,
37277,
37307,
37336,
37366,
37401,
37427,
37458,
37488,
37559,
37621,
37667,
37680,
37719,
37751,
37780,
37820,
37848,
37873,
37898,
37928,
37965,
37997,
38025,
38055,
38082,
38110,
38146,
38173,
38186,
38195,
38269,
38310,
38324,
38326,
38328,
38338,
38396,
38463,
38503,
38539,
38547,
38549,
38577,
38601,
38605,
38607,
38617,
38663,
38676,
38704,
38713,
38737,
38739,
38749,
38809,
38839,
38865,
38895,
38968,
39038,
39063,
39072,
39090,
39092,
39120,
39133,
39156,
39165,
39191,
39200,
39218,
39248,
39277,
39306,
39308,
39318,
39370,
39400,
39428,
39460,
39490,
39522,
39555,
39575,
39579,
39581,
39591,
39651,
39694,
39723,
39758,
39790,
39815,
39835,
39859,
39883,
39905,
39932,
39936,
39938,
39948,
40004,
40036,
40075,
40106,
40135,
40191,
40261,
40291,
40299,
40301,
40376,
40452,
40492,
40535,
40575,
40583,
40585,
40622,
40674,
40685,
40706,
40768,
40814,
40843,
40879,
40889,
40922,
40957,
41003,
41028,
41053,
41122,
41193,
41229,
41256,
41265,
41301,
41335,
41337,
41358,
41394,
41408,
41433,
41497,
41499,
41518,
41537,
41539,
41572,
41611,
41663,
41709,
41739,
41792,
41829,
41904,
41943,
41970,
42006,
42020,
42045,
42114,
42116,
42151,
42170,
42209,
42237,
42239,
42268,
42298,
42336,
42338,
42348,
42388,
42462,
42502,
42553,
42579,
42619,
42643,
42652,
42681,
42751,
42772,
42799,
42820,
42846,
42876,
42895,
42913,
42959,
42979,
42988,
42997,
43006,
43070,
43107,
43109,
43127,
43181,
43199,
43274,
43287,
43347,
43366,
43368,
43378,
43422,
43448,
43488,
43512,
43521,
43550,
43571,
43597,
43627,
43646,
43664,
43691,
43693,
43703,
43777,
43849,
43920,
43993,
44059,
44062,
44128,
44131,
44139,
44155,
44158,
44226,
44299,
44327,
44330,
44343,
44369,
44384,
44392,
44410,
44413,
44485,
44534,
44537,
44546,
44554,
44562,
44587,
44664,
44724,
44794,
44820,
44895,
44952,
44984,
44986,
45037,
45050,
45073,
45082,
45104,
45106,
45116,
45188,
45212,
45244,
45246,
45256,
45324,
45386,
45422,
45448,
45514,
45535,
45569,
45606,
45637,
45676,
45738,
45747,
45751,
45770,
45788,
45827,
45829,
45839,
45903,
45931,
45970,
45972,
46026,
46053,
46078,
46115,
46138,
46166,
46188,
46220,
46229,
46293,
46314,
46371,
46390,
46392,
46394,
46404,
46462,
46518,
46520,
46530,
46606,
46639,
46641,
46651,
46707,
46780,
46817,
46836,
46897,
46930,
46932,
46942,
47018,
47065,
47086,
47112,
47134,
47161,
47222,
47240,
47259,
47261,
47271,
47325,
47355,
47415,
47443,
47476,
47537,
47604,
47613,
47675,
47704,
47731,
47796,
47826,
47830,
47838,
47840,
47868,
47896,
47905,
47943,
47961,
47989,
48013,
48017,
48019,
48029,
48105,
48148,
48177,
48209,
48242,
48280,
48336,
48357,
48381,
48445,
48467,
48486,
48495,
48524,
48597,
48636,
48658,
48667,
48691,
48718,
48720,
48724,
48726,
48736,
48794,
48865,
48904,
48926,
48928,
48938,
48990,
49051,
49079,
49140,
49181,
49190,
49216,
49220,
49222,
49232,
49280,
49330,
49332,
49342,
49380,
49451,
49513,
49532,
49573,
49596,
49629,
49638,
49641,
49711,
49786,
49862,
49936,
49966,
49969,
49974,
49997,
50011,
50026,
50040,
50045,
50050,
50053,
50085,
50088,
50093,
50116,
50130,
50156,
50161,
50164,
50235,
50297,
50322,
50373,
50407,
50478,
50507,
50548,
50594,
50596,
50598,
50622,
50681,
50714,
50780,
50830,
50832,
50902,
50948,
51022,
51059,
51111,
51127,
51136,
51145,
51154,
51228,
51249,
51286,
51288,
51302,
51352,
51370,
51372,
51444,
51521,
51546,
51579,
51613,
51631,
51657,
51666,
51698,
51724,
51757,
51799,
51849,
51877,
51879,
51953,
52027,
52080,
52115,
52158,
52167,
52176,
52185,
52187,
52215,
52283,
52306,
52347,
52349,
52351,
52402,
52446,
52470,
52502,
52541,
52569,
52571,
52573,
52648,
52661,
52708,
52727,
52729,
52739,
52781,
52807,
52830,
52839,
52868,
52891,
52921,
52939,
52949,
52986,
53034,
53043,
53058,
53067,
53136,
53205,
53269,
53287,
53308,
53377,
53397,
53431,
53476,
53485,
53526,
53528,
53543,
53562,
53582,
53584,
53586,
53619,
53653,
53688,
53697,
53706,
53775,
53846,
53892,
53903,
53905,
53930,
53964,
53966,
53968,
53978,
54030,
54089,
54091,
54101,
54151,
54182,
54210,
54231,
54240,
54257,
54300,
54330,
54343,
54386,
54409,
54418,
54438,
54440,
54477,
54507,
54526,
54530,
54532,
54542,
54592,
54618,
54641,
54661,
54670,
54690,
54692,
54721,
54739,
54741,
54799,
54803,
54881,
54898,
54949,
54987,
55058,
55098,
55101,
55164,
55181,
55183,
55214,
55236,
55261,
55278,
55297,
55323,
55342,
55344,
55354,
55426,
55447,
55474,
55502,
55546,
55597,
55621,
55674,
55727,
55748,
55772,
55774,
55776,
55798,
55833,
55842,
55903,
55953,
55955,
55996,
56069,
56145,
56216,
56242,
56271,
56313,
56332,
56393,
56412,
56452,
56470,
56472,
56482,
56530,
56551,
56553,
56563,
56629,
56653,
56678,
56699,
56723,
56742,
56768,
56795,
56797,
56807,
56865,
56901,
56903,
56913,
56957,
56978,
57004,
57028,
57041,
57065,
57090,
57099,
57117,
57135,
57154,
57156,
57166,
57196,
57215,
57234,
57236,
57246,
57298,
57325,
57348,
57350,
57360,
57412,
57443,
57471,
57492,
57501,
57519,
57523,
57525,
57535,
57589,
57619,
57668,
57713,
57731,
57733,
57735,
57745,
57787,
57857,
57896,
57973,
57998,
58063,
58065,
58075,
58125,
58151,
58168,
58191,
58204,
58223,
58241,
58243,
58253,
58307,
58344,
58346,
58356,
58408,
58482,
58512,
58515,
58585,
58654,
58726,
58799,
58802,
58877,
58950,
59026,
59070,
59126,
59180,
59206,
59227,
59254,
59295,
59315,
59332,
59334,
59389,
59411,
59435,
59479,
59552,
59622,
59641,
59644,
59668,
59702,
59736,
59739,
59812,
59883,
59936,
59962,
59989,
60050,
60068,
60087,
60105,
60113,
60115,
60153,
60155,
60165,
60217,
60247,
60273,
60299,
60308,
60326,
60354,
60424,
60449,
60479,
60549,
60562,
60589,
60598,
60644,
60646,
60683,
60753,
60777,
60846,
60863,
60865,
60895,
60914,
60923,
60941,
60971,
61000,
61029,
61031,
61041,
61091,
61117,
61119,
61129,
61173,
61200,
61233,
61235,
61245,
61301,
61329,
61364,
61377,
61404,
61446,
61464,
61468,
61470,
61480,
61522,
61543,
61545,
61555,
61591,
61653,
61655,
61665,
61731,
61757,
61786,
61810,
61828,
61858,
61860,
61870,
61916,
61947,
61975,
61996,
62005,
62022,
62026,
62028,
62038,
62088,
62119,
62147,
62168,
62177,
62200,
62209,
62279,
62334,
62359,
62376,
62380,
62382,
62392,
62446,
62467,
62489,
62491,
62501,
62557,
62595,
62597,
62607,
62659,
62681,
62753,
62783,
62811,
62846,
62917,
62926,
62928,
62949,
62951,
62961,
63009,
63032,
63054,
63080,
63088,
63090,
63128,
63130,
63140,
63184,
63225,
63246,
63271,
63291,
63320,
63346,
63365,
63367,
63377,
63431,
63459,
63461,
63471,
63521,
63549,
63576,
63615,
63619,
63621,
63631,
63669,
63737,
63812,
63883,
63910,
63965,
63980,
63982,
63992,
64042,
64067,
64126,
64128,
64138,
64186,
64235,
64237,
64247,
64309,
64352,
64381,
64414,
64454,
64527,
64572,
64600,
64641,
64665,
64674,
64713,
64763,
64765,
64767,
64838,
64911,
64958,
65027,
65070,
65118,
65127,
65131,
65140,
65164,
65182,
65231,
65255,
65257,
65284,
65288,
65290,
65300,
65352,
65371,
65373,
65383,
65441,
65476,
65478,
65488,
65534,
65562,
65586,
65588,
65598,
65656,
65693,
65709,
65711,
65713,
65723,
65795,
65816,
65842,
65862,
65891,
65917,
65936,
65938,
65948,
65998,
66024,
66026,
66036,
66076,
66103,
66124,
66133,
66157,
66176,
66194,
66233,
66244,
66300,
66320,
66322,
66332,
66378,
66405,
66426,
66445,
66463,
66502,
66513,
66569,
66589,
66591,
66601,
66651,
66677,
66704,
66713,
66742,
66759,
66783,
66813,
66822,
66847,
66865,
66883,
66894,
66963,
67001,
67021,
67032,
67036,
67038,
67048,
67094,
67117,
67151,
67187,
67208,
67249,
67276,
67278,
67296,
67298,
67300,
67310,
67358,
67383,
67385,
67395,
67445,
67471,
67480,
67504,
67506,
67516,
67590,
67620,
67648,
67680,
67703,
67707,
67709,
67719,
67763,
67787,
67796,
67814,
67876,
67933,
67959,
67961,
67971,
68023,
68095,
68097,
68107,
68143,
68161,
68188,
68210,
68212,
68222,
68268,
68311,
68329,
68386,
68405,
68409,
68411,
68421,
68475,
68511,
68588,
68617,
68619,
68629,
68687,
68705,
68743,
68814,
68885,
68888,
68899,
68910,
68917,
68928,
68931,
68940,
68943,
68954,
68965,
68972,
68983,
69010,
69073,
69123,
69152,
69154,
69164,
69230,
69260,
69323,
69344,
69372,
69396,
69432,
69451,
69493,
69562,
69635,
69710,
69719,
69740,
69815,
69875,
69943,
70001,
70067,
70086,
70126,
70128,
70138,
70214,
70242,
70265,
70269,
70271,
70281,
70329,
70355,
70381,
70390,
70419,
70436,
70459,
70489,
70507,
70534,
70536,
70546,
70586,
70639,
70641,
70651,
70699,
70727,
70753,
70771,
70780,
70804,
70808,
70810,
70886,
70911,
70990,
71016,
71046,
71065,
71093,
71095,
71156,
71160,
71227,
71279,
71335,
71337,
71385,
71389,
71448,
71500,
71568,
71637,
71710,
71724,
71793,
71824,
71888,
71890,
71957,
71961,
72037,
72056,
72085,
72150,
72174,
72192,
72200,
72202,
72250,
72294,
72343,
72411,
72464,
72467,
72480,
72499,
72518,
72543,
72578,
72587,
72591,
72609,
72627,
72701,
72738,
72757,
72759,
72833,
72837,
72913,
72987,
73061,
73070,
73137,
73163,
73184,
73202,
73275,
73343,
73419,
73428,
73437,
73462,
73499,
73501,
73525,
73544,
73562,
73564,
73638,
73651,
73655,
73672,
73699,
73732,
73736,
73811,
73824,
73894,
73917,
73926,
73949,
73994,
74037,
74058,
74080,
74099,
74127,
74129,
74180,
74204,
74266,
74297,
74326,
74347,
74373,
74393,
74427,
74453,
74466,
74495,
74521,
74548,
74578,
74580,
74582,
74603,
74621,
74640,
74659,
74660
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 74660,
"ccnet_original_nlines": 2435,
"rps_doc_curly_bracket": 0.009000799618661404,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.16805292665958405,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0026851799339056015,
"rps_doc_frac_lines_end_with_ellipsis": 0.0008210199885070324,
"rps_doc_frac_no_alph_words": 0.4243893027305603,
"rps_doc_frac_unique_words": 0.22737179696559906,
"rps_doc_mean_word_length": 8.240011215209961,
"rps_doc_num_sentences": 1489,
"rps_doc_symbol_to_word_ratio": 0.0009823800064623356,
"rps_doc_unigram_entropy": 6.0835113525390625,
"rps_doc_word_count": 6883,
"rps_doc_frac_chars_dupe_10grams": 0.0421750508248806,
"rps_doc_frac_chars_dupe_5grams": 0.13936102390289307,
"rps_doc_frac_chars_dupe_6grams": 0.09942521154880524,
"rps_doc_frac_chars_dupe_7grams": 0.06742364913225174,
"rps_doc_frac_chars_dupe_8grams": 0.05166091024875641,
"rps_doc_frac_chars_dupe_9grams": 0.04538401961326599,
"rps_doc_frac_chars_top_2gram": 0.025812819600105286,
"rps_doc_frac_chars_top_3gram": 0.0034910799004137516,
"rps_doc_frac_chars_top_4gram": 0.0021158100571483374,
"rps_doc_books_importance": -5963.54638671875,
"rps_doc_books_importance_length_correction": -5963.54638671875,
"rps_doc_openwebtext_importance": -4015.298095703125,
"rps_doc_openwebtext_importance_length_correction": -4015.298095703125,
"rps_doc_wikipedia_importance": -4111.17626953125,
"rps_doc_wikipedia_importance_length_correction": -4111.17626953125
},
"fasttext": {
"dclm": 0.9061665534973145,
"english": 0.3384144604206085,
"fineweb_edu_approx": 2.3378772735595703,
"eai_general_math": 0.8745828866958618,
"eai_open_web_math": 0.17821407318115234,
"eai_web_code": 0.9693412184715271
}
}
|
{
"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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,323,959,622,880,267,000 |
Serato DJ Lite / Intro General Discussion
Talk about Serato DJ Lite / Intro software and controllers.
Sound Quality of Flac vs Wav Shocked!!
Johnny H 1:58 AM - 11 December, 2015
Hi guys
after purchasing a very high end studio RME sound Card I have been doing some A/B tests of Flacs Vs Wavs.
My DJ collection is all stored in Flac lossless format with Tags and Cover Art 500x500 Pixels.
I have never been over happy with the sound quality at times of my collection, I always felt it sounded a little dull and not great stereo reproduction.
So this lead me to do the following A/B tests on my PC with my high end studio quality sound card. I converted several of my FLAC files to WAV and compared the sound quality of the Wavs against the Flacs.
To my amazement the WAVs sounded noticeably better! the stereo separation was better, the dynamics was better and the music just sounded better all round and not so dull sounding.
I understand the bit for bit data of a flac file is identical to the original Wav audio file when it has been decompressed and is being playing. But for some very strange reason when playing FLAC files they just don't sound as Crisp and Clean as the Wav version
Now I'm not wishing to get in to an argument with any one who is going to state Wavs sound exactly the same and Flacs, because they don't sound the same there is a noticeable difference.
This could be due to several reasons,
1) The tagging info added to the flac file
2) The cover art added to the flac file
3) The fact the flac file has to be decoded before it can be played
The end result for me is.... I really think to achieve the best sound quality, I need my DJ collection in WAV format. The only reason I chose Flac over Wav is the ability of tagging and cover art for each file when moving my DJ music files between different DJ software packages.
So here lies a major problem when using Wavs,
1) No Cover Art
2) No Meta Tag Info
Is there no standard whereby for each Wav file, I could have a separate Tag file storing all the tag info and a separate image file associated with each wav file for the cover art. Thus the audio is in a pure native wav format and the different DJ programs can still read the Tag and cover art for each wav file.
I don't use Itunes and I don't plan to start now either, so i'm looking for some solution for tagging wavs, almost some central database for DJ collections that all DJ software can read the associated TAG and COVER ART
any help as always very much appreciated.
Johnny H 3:06 AM - 11 December, 2015
After further investigation I can confirm you can now tag WAVs and add cover art too !
Problem solved... for the highest sound quality don't use FLACS
WAV files definitely have the edge, period.....
Even Mode 2:59 PM - 2 April, 2017
*facepalm*
JamesBassdrop 5:54 PM - 11 June, 2017
Quote:
Now I'm not wishing to get in to an argument with any one who is going to state Wavs sound exactly the same and Flacs, because they don't sound the same there is a noticeable difference.
Quote:
So this lead me to do the following A/B tests on my PC with my high end studio quality sound card. I converted several of my FLAC files to WAV and compared the sound quality of the Wavs against the Flacs.
Just want to point out that you should've done double-blind ABX tests instead of just comparing A/B, to eliminate the possibility of unconscious (unintentional) bias.
Try Foobar2000 (foobar2000.org) w/ the 'ABX Comparator' add-on component (foobar2000.org) and see if you're still able to tell the difference... it's freeware.
Oh, and check if your FLAC files have any ReplayGain values set... you can use Foobar2000 to check for (and remove) ReplayGain metadata in your files too. (For more info about ReplayGain: wiki.hydrogenaud.io)
Cheers,
James
Peterpics 2:26 PM - 20 September, 2017
Hi Guys,
I am in the process of Digitalizing some of my vinyls and did a few experiments as I was recommended FLAC by a friend and as far as storing I think MP3 at 192 kbps is the best and if one plans to write on compact discs wave is better mainly as far as sound quality is concerned.
I use AIMP as my default Audio player and without any equalizing just flat. TO test the sound quality, 1. I used my Dell 2.1. system first and 2. I took a line out from the PC which I connected to Yamaha transistor analog amplifier connected to a 3 way Aiwa pair of speakers and next to set of 2 way Advent pair of speakers. plus next to a Pioneer transistor analog amplifier connected to a pair of Diatone 3 way spaekers and next to the 2 way Advent pair.
There was a slight notable difference in the wave file (Lows + Highs) compared to the FLAC.
StoryStratos 11:55 PM - 29 November, 2017
As it stands, based on blind AB tests, the best lossy codec is Opus, which currently matches 192kbps (VBR V2 --aka really quite lossy) or 270kbps (VBR V0 --aka getting better) MP3 & 256kbps AAC ("Very High" --aka really quite good) at only 128kbps VBR (so is much smaller), with no perceptible loss, and is effectively transparent (though you can go higher if you don't like having space in your hard drive). If your player supports it then it's currently the best format to store lossy audio. It's relatively new and so doesn't have universal support yet, but it's more well supported than you might think (AIMP, Amarok, cmus, Music Player Daemon, foobar2000, Mpxplay, MusicBee, SMplayer, VLC, Winamp, Xmplay...).
But, if you have anything archival, then FLAC is a no brainer. WAV and other uncompressed formats are excellent for working on, so are used in editing tools, but FLAC uses LOSSLESS compression, meaning, by definition, there is no difference in the sound when it is played back, and is simply stored in a more efficient manner. This means you can store more music on a hard drive. That is the only difference between FLAC and WAV. This isn't a question of blind AB tests, it's purely mathematical. The FLAC specification states that the sound you play back from a FLAC file MUST BE EXACTLY THE SAME as the sound you put into a FLAC file.
If you CONVERT your FLAC to WAV, you've just DECOMPRESSED the FLAC into a WAV file. Any differences in the output (and there shouldn't be any) should then be reported as a bug and passed on to Xiph, who maintain FLAC, or whoever's specific implementation of the FLAC codec you use (usually either Xiph or ffmpeg) or is something your audio player is doing to make your music "sound better" (aka less like the original file).
Basically, they shouldn't sound different unless either the conversion software is messing with the sound, or your music player is trying to make your music "sound better" without your knowledge. That, or, without blind AB testing, the good old placebo effect and the fact that most humans can't retain precise memory of sound for very long (the longer the sound bite you play, the more likely you are to forget the details that are the basis for comparison).
Foobar, as suggested, is a good one for blind testing, and by default it doesn't mess with the sound. You can also use Winamp or MusicBee, whatever you prefer. I personally use AIMP as my primary player, but it's not very good for blind AB testing unless I cover the popup with my hand. If you want a quick test to see if you can tell the difference between even lossless and lossy, try something like abx.digitalfeed.net or www.audiocheck.net. Then question if you can tell much of a difference between two lossless files that sound absolutely identical. You're brain will tell you that you can, and will focus on different tiny details between the two, and so will try and convince you there's a difference. This is natural, the brain is very good at trying to justify itself, even when it couldn't tell them apart. And that's okay, because we can then rule out humans for the comparison of lossless and uncompressed sound files, and note that they should be (as far as the codec's performance is concerned) absolutely identical.
TLDR; stick with FLAC unless you've found a bug, then stick with FLAC and tell the developers of the codec (Xiph or ffmpeg usually), only use WAV when editing sound, FLAC is the archival codec of choice for all major services and archives, Opus is the best for lossy and when you want to really save some space when distributing etc. (but still give a legacy option for mp3 in that case)
|
{
"url": "https://serato.com/forum/discussion/1541194",
"source_domain": "serato.com",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "33547",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H4V3IUS4OZHAUTPFKXRWPLLQXNLYJM7N",
"WARC-Concurrent-To": "<urn:uuid:2bef91c6-9caa-454b-a62a-00da63a3a843>",
"WARC-Date": "2018-04-23T08:08:13Z",
"WARC-IP-Address": "34.234.10.220",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZPJR2OV6G7TJXL3PNDU5T4SDU6FO45Q7",
"WARC-Record-ID": "<urn:uuid:ae499866-9119-4af6-9691-13ed5acbd8a9>",
"WARC-Target-URI": "https://serato.com/forum/discussion/1541194",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2800752d-ee86-4582-a53b-65d55b505004>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-141-249-121.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-17\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for April 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
42,
43,
103,
104,
143,
144,
181,
189,
190,
296,
297,
392,
393,
546,
547,
752,
753,
933,
934,
1196,
1197,
1384,
1385,
1423,
1424,
1467,
1507,
1575,
1576,
1856,
1857,
1903,
1904,
1920,
1940,
1941,
2254,
2255,
2474,
2475,
2517,
2554,
2641,
2642,
2706,
2707,
2755,
2789,
2800,
2838,
2845,
3032,
3033,
3040,
3245,
3246,
3413,
3414,
3574,
3575,
3784,
3785,
3793,
3799,
3838,
3847,
4126,
4583,
4584,
4676,
4718,
5433,
5434,
6071,
6072,
6497,
6498,
6958,
6959,
7991,
7992
],
"line_end_idx": [
42,
43,
103,
104,
143,
144,
181,
189,
190,
296,
297,
392,
393,
546,
547,
752,
753,
933,
934,
1196,
1197,
1384,
1385,
1423,
1424,
1467,
1507,
1575,
1576,
1856,
1857,
1903,
1904,
1920,
1940,
1941,
2254,
2255,
2474,
2475,
2517,
2554,
2641,
2642,
2706,
2707,
2755,
2789,
2800,
2838,
2845,
3032,
3033,
3040,
3245,
3246,
3413,
3414,
3574,
3575,
3784,
3785,
3793,
3799,
3838,
3847,
4126,
4583,
4584,
4676,
4718,
5433,
5434,
6071,
6072,
6497,
6498,
6958,
6959,
7991,
7992,
8379
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8379,
"ccnet_original_nlines": 81,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4305478632450104,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06253459304571152,
"rps_doc_frac_lines_end_with_ellipsis": 0.012195119634270668,
"rps_doc_frac_no_alph_words": 0.15771998465061188,
"rps_doc_frac_unique_words": 0.3351028561592102,
"rps_doc_mean_word_length": 4.3510284423828125,
"rps_doc_num_sentences": 68,
"rps_doc_symbol_to_word_ratio": 0.003320419928058982,
"rps_doc_unigram_entropy": 5.5179443359375,
"rps_doc_word_count": 1507,
"rps_doc_frac_chars_dupe_10grams": 0.09394539892673492,
"rps_doc_frac_chars_dupe_5grams": 0.12764984369277954,
"rps_doc_frac_chars_dupe_6grams": 0.11316151171922684,
"rps_doc_frac_chars_dupe_7grams": 0.09394539892673492,
"rps_doc_frac_chars_dupe_8grams": 0.09394539892673492,
"rps_doc_frac_chars_dupe_9grams": 0.09394539892673492,
"rps_doc_frac_chars_top_2gram": 0.012200700119137764,
"rps_doc_frac_chars_top_3gram": 0.006710390094667673,
"rps_doc_frac_chars_top_4gram": 0.005185300018638372,
"rps_doc_books_importance": -811.1582641601562,
"rps_doc_books_importance_length_correction": -811.1582641601562,
"rps_doc_openwebtext_importance": -481.8874816894531,
"rps_doc_openwebtext_importance_length_correction": -481.8874816894531,
"rps_doc_wikipedia_importance": -303.1675109863281,
"rps_doc_wikipedia_importance_length_correction": -303.1675109863281
},
"fasttext": {
"dclm": 0.22207480669021606,
"english": 0.9394025802612305,
"fineweb_edu_approx": 1.227198839187622,
"eai_general_math": 0.3359469771385193,
"eai_open_web_math": 0.305708110332489,
"eai_web_code": 0.04987854138016701
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "781.7",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": "Music theory"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "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": "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
|
-5,165,809,013,915,610,000 |
How do proxies help with Instagram?
Discussion in 'Proxies' started by delisov, Feb 13, 2015.
1. delisov
delisov Newbie
Joined:
Feb 13, 2015
Messages:
2
Likes Received:
0
Hello, BHW community!
You are great with helping noobs, thank you very much!
I have looked through the forum, but did not find an answer to a simple question.
I can understand how Instagram counts limits for each token separately, but how do proxies help? For example, iconosquare does not have proxies for millions of users and works fine.
2. VincentVega
VincentVega Regular Member
Joined:
Nov 19, 2014
Messages:
284
Likes Received:
49
You want to know what to use Proxies for? Basically you can create and run multiple proxy-accounts to comment and support your main account.
3. mexela
mexela Junior Member Premium Member
Joined:
Aug 13, 2014
Messages:
163
Likes Received:
67
Location:
where our clients need us
people are using the proxies because if they make too many accounts from the same IP you will get banned on all
• Thanks Thanks x 1
4. delisov
delisov Newbie
Joined:
Feb 13, 2015
Messages:
2
Likes Received:
0
Thank you, mexela! It means that proxies are only needed when I create Instagram accounts? I have an online service where users authorize with their existing accounts and set up automatic likes. Through one application user is allowed to do 100 likes an hour, so I have registered 50 applications, and my service goes through them by cycle.
If I already have user accounts, then I do not need proxies? Or probably I need proxies for some other reason?
Thank you!
5. Sarahlim
Sarahlim Newbie
Joined:
Dec 26, 2016
Messages:
13
Likes Received:
0
Gender:
Female
I'm from Indonesia Jakarta in need private proxy can changed IP every 3 minutes- scrapping box proxy tools for Facebook any Instagram - can open my blocked account from FB and IG "I'd like a lifetime discount code please email [email protected]
6. Warwolves
Warwolves Newbie
Joined:
Dec 18, 2016
Messages:
30
Likes Received:
4
Gender:
Male
To avoid getting banned.
|
{
"url": "https://www.blackhatworld.com/seo/how-do-proxies-help-with-instagram.739850/",
"source_domain": "www.blackhatworld.com",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "49286",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ATNOUZVPHXQH4WJZZ2RXEYQDAT6CM6NL",
"WARC-Concurrent-To": "<urn:uuid:13bf369e-14d0-4af9-8f81-bdf8511a6eb6>",
"WARC-Date": "2018-07-20T17:14:28Z",
"WARC-IP-Address": "104.25.214.49",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:V3RXJGNOCG5TL55Y2ATBRZW7T5YZRABJ",
"WARC-Record-ID": "<urn:uuid:a3099b19-04c7-4ad8-b27d-469017bf6afa>",
"WARC-Target-URI": "https://www.blackhatworld.com/seo/how-do-proxies-help-with-instagram.739850/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bcf2f4e2-79e4-4233-9df7-e3420523755f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-152-30-25.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
36,
37,
95,
96,
109,
110,
129,
130,
142,
159,
173,
179,
199,
205,
231,
232,
291,
377,
378,
564,
570,
587,
588,
619,
620,
632,
649,
663,
671,
691,
698,
843,
849,
861,
862,
902,
903,
915,
932,
946,
954,
974,
981,
995,
1025,
1141,
1147,
1171,
1184,
1185,
1204,
1205,
1217,
1234,
1248,
1254,
1274,
1280,
1625,
1740,
1755,
1761,
1775,
1776,
1796,
1797,
1809,
1826,
1840,
1847,
1867,
1873,
1885,
1896,
2145,
2151,
2166,
2167,
2188,
2189,
2201,
2218,
2232,
2239,
2259,
2265,
2277,
2286,
2315
],
"line_end_idx": [
36,
37,
95,
96,
109,
110,
129,
130,
142,
159,
173,
179,
199,
205,
231,
232,
291,
377,
378,
564,
570,
587,
588,
619,
620,
632,
649,
663,
671,
691,
698,
843,
849,
861,
862,
902,
903,
915,
932,
946,
954,
974,
981,
995,
1025,
1141,
1147,
1171,
1184,
1185,
1204,
1205,
1217,
1234,
1248,
1254,
1274,
1280,
1625,
1740,
1755,
1761,
1775,
1776,
1796,
1797,
1809,
1826,
1840,
1847,
1867,
1873,
1885,
1896,
2145,
2151,
2166,
2167,
2188,
2189,
2201,
2218,
2232,
2239,
2259,
2265,
2277,
2286,
2315,
2320
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2320,
"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.2949640154838562,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03597122058272362,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2589928209781647,
"rps_doc_frac_unique_words": 0.5743440389633179,
"rps_doc_mean_word_length": 4.670554161071777,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.030624866485596,
"rps_doc_word_count": 343,
"rps_doc_frac_chars_dupe_10grams": 0.072409488260746,
"rps_doc_frac_chars_dupe_5grams": 0.072409488260746,
"rps_doc_frac_chars_dupe_6grams": 0.072409488260746,
"rps_doc_frac_chars_dupe_7grams": 0.072409488260746,
"rps_doc_frac_chars_dupe_8grams": 0.072409488260746,
"rps_doc_frac_chars_dupe_9grams": 0.072409488260746,
"rps_doc_frac_chars_top_2gram": 0.048689138144254684,
"rps_doc_frac_chars_top_3gram": 0.016853930428624153,
"rps_doc_frac_chars_top_4gram": 0.019975030794739723,
"rps_doc_books_importance": -184.15524291992188,
"rps_doc_books_importance_length_correction": -184.15524291992188,
"rps_doc_openwebtext_importance": -125.22818756103516,
"rps_doc_openwebtext_importance_length_correction": -125.22818756103516,
"rps_doc_wikipedia_importance": -93.63787841796875,
"rps_doc_wikipedia_importance_length_correction": -93.63787841796875
},
"fasttext": {
"dclm": 0.019615229219198227,
"english": 0.9287316203117371,
"fineweb_edu_approx": 0.9895837306976318,
"eai_general_math": 0.00231606001034379,
"eai_open_web_math": 0.15254801511764526,
"eai_web_code": 0.000018599999748403206
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,653,620,498,689,842,000 |
You may also like
LOGO Challenge 5 - Patch
Using LOGO, can you construct elegant procedures that will draw this family of 'floor coverings'?
LOGO Challenge - Triangles-squares-stars
Can you recreate these designs? What are the basic units? What movement is required between each unit? Some elegant use of procedures will help - variables not essential.
LOGO Challenge - Tilings
Three examples of particular tilings of the plane, namely those where - NOT all corners of the tile are vertices of the tiling. You might like to produce an elegant program to replicate one or all of these.
Napoleon's Theorem
Age 14 to 18
Challenge Level
You might like to make a tessellation with copies of $\Delta ABC$ and three triangles drawn on the sides of $\Delta ABC$ and prove your conjecture from the tessellation. This uses only elementary geometry. An alternative method is to use the Cosine Rule.
Alternatively you can use vectors or complex numbers.
|
{
"url": "https://www.nrich.maths.org/1944/clue",
"source_domain": "www.nrich.maths.org",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "12919",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JA3WRMGKU5O75O53XC7M7EBTKLGBQSPV",
"WARC-Concurrent-To": "<urn:uuid:a47c3ddd-f4ca-44e5-b5d0-dd71e540bd75>",
"WARC-Date": "2022-12-07T15:57:15Z",
"WARC-IP-Address": "131.111.18.195",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:E3O4XK44R5EYJNBMRRS6K5F4T457OLGA",
"WARC-Record-ID": "<urn:uuid:65781180-4165-472b-aaaa-6088c97492bb>",
"WARC-Target-URI": "https://www.nrich.maths.org/1944/clue",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:653ba92f-5e70-4c83-8a99-9e8a3939607f>"
},
"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-182\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,
18,
19,
44,
45,
143,
144,
185,
186,
357,
358,
383,
384,
591,
592,
611,
612,
625,
641,
642,
897,
898
],
"line_end_idx": [
18,
19,
44,
45,
143,
144,
185,
186,
357,
358,
383,
384,
591,
592,
611,
612,
625,
641,
642,
897,
898,
951
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 951,
"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.3922652006149292,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03867403045296669,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16022099554538727,
"rps_doc_frac_unique_words": 0.6381579041481018,
"rps_doc_mean_word_length": 4.973684310913086,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.356636047363281,
"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.0515872985124588,
"rps_doc_frac_chars_top_3gram": 0.0317460298538208,
"rps_doc_frac_chars_top_4gram": 0.037037041038274765,
"rps_doc_books_importance": -88.70510864257812,
"rps_doc_books_importance_length_correction": -88.70510864257812,
"rps_doc_openwebtext_importance": -60.14042663574219,
"rps_doc_openwebtext_importance_length_correction": -47.133235931396484,
"rps_doc_wikipedia_importance": -32.314796447753906,
"rps_doc_wikipedia_importance_length_correction": -32.314796447753906
},
"fasttext": {
"dclm": 0.05202602967619896,
"english": 0.8897883296012878,
"fineweb_edu_approx": 2.9977972507476807,
"eai_general_math": 0.8958300948143005,
"eai_open_web_math": 0.34608036279678345,
"eai_web_code": 0.06375408172607422
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.004",
"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": "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": "23",
"label": "Tutorial"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"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
|
-3,668,268,515,467,919,400 |
ATI released OpenCL SDK with hardware support
Discussions related to GPU Acceleration in LuxRender
Moderators: Dade, jromang, tomb, coordinators
Re: ATI released OpenCL SDK with hardware support
Postby Sheltem » Sat Jan 09, 2010 5:46 am
@ Dade thanks for cornell test scene. The mini is running at 63K samples per sec. in luxrender...Oh man that is quite a difference! Will be watching this tread very closely! :shock:
Keep up the great work guys!!!!
Sheltem
Sheltem
Posts: 122
Joined: Sun Jun 15, 2008 11:06 am
Re: ATI released OpenCL SDK with hardware support
Postby Eros » Sat Jan 09, 2010 9:06 am
Unfortunately i cant get the OSX version to work still - gives me a black screen still :( - No matter though i guess things will be more stable with the arrival of 10.6.3
In the meantime ill be getting my Linux box fixed up with Fedora rather than Ubuntu (can be anything really i guess but ill give that a go first) so i can give the GTX295 a spin.
User avatar
Eros
Posts: 419
Joined: Wed Jul 22, 2009 8:37 am
Re: ATI released OpenCL SDK with hardware support
Postby mitchde » Sat Jan 09, 2010 10:05 am
Hi, the SmallptGPU (1.6) works well on my 8800GTX (hackintosh, real macs didnt have GTX )
Question: Can on user run my compiled commandline app (plus that preprocessed kernel) also on an ATI GPU ?
Or does perporcessed kernel means no, only for that card found on compie time ?
Thanks
PS: Around 1000K/Sec, cornel szene
Attachments
Bildschirmfoto 2010-01-09 um 16.03.57.jpg
8800GTX Mac OS X
mitchde
Posts: 256
Joined: Fri Dec 25, 2009 2:13 am
Re: ATI released OpenCL SDK with hardware support
Postby jensverwiebe » Sat Jan 09, 2010 10:32 am
@ mitch, it only means the includes inside kernel are preprocessed cause the "-I." statement does not work in all compilers, so we "bake" that together first.
Has nothing todo with vendor-specific .
@eros, get the newest smallpt 1.6 version from Dade´s site, has all needed changes now in, just comment in/out the platform-flags. Runs for all OSX.
If you only have a 32bit mashine, add -m32 -arch i386 to your flags.
@ Dade, got smallLuxGPU to run with these __global changes, but runs painfully slow, must do some other changes as you did to smallpt also there ( cl_mem )
CPU works still fine.
Can i remover the CL_MEM_USE_HOST_PTR and point to NULL instead as done in smallpt ? Ah now c++, looks all different :)
BTW: perhaps found solution for the not working -I.
less error-prone method of accomplishing this is to open
the current directory (`.') and use the fchdir(2) function to return. ---> #include <unistd.h> needed it seems
Jens
Last edited by jensverwiebe on Sat Jan 09, 2010 2:31 pm, edited 5 times in total.
User avatar
jensverwiebe
Developer
Posts: 3429
Joined: Wed Apr 02, 2008 4:34 pm
Re: ATI released OpenCL SDK with hardware support
Postby Dade » Sat Jan 09, 2010 10:33 am
mitchde wrote:Hi, the SmallptGPU (1.6) works well on my 8800GTX (hackintosh, real macs didnt have GTX )
Question: Can on user run my compiled commandline app (plus that preprocessed kernel) also on an ATI GPU ?
Or does perporcessed kernel means no, only for that card found on compie time ?
Preprocessed kernel is just a workaround to another Apple bug (i.e. it looks like the compiler "-I." directive doesn't work). It is just the kernel and the headers files packed in a single text file. OpenCL works like OpenGL, one executable works with any driver so, yes, ATI users can run your executable compiled on a Mac with an NVIDIA card. No problem.
P.S. Jens, was faster than me to answer :D
User avatar
Dade
Developer
Posts: 8404
Joined: Sat Apr 19, 2008 6:04 pm
Location: Italy
Re: ATI released OpenCL SDK with hardware support
Postby Eros » Sat Jan 09, 2010 6:42 pm
Ok massive nub question - I finally have ubuntu up (had to abandon the Fedora...) with the 190 release drivers which *should* have the OpenCL support - it is the latest driver available, I installed that, i also tried to install the Cuda drivers, tool kit SDK along with the OpenCL toolkit and SDK. (i think its installed properly)
I am trying to compile the smallptGPU code now and get the following error
make
gcc -O3 -msse2 -mfpmath=sse -ftree-vectorize -funroll-loops -Wall -I/home/ward/NVIDIA_GPU_Computing_SDK/include -L/home/ward/NVIDIA_GPU_Computing_SDK/lib/ -lglut -lOpenCL -DSMALLPT_CPU -o smallptCPU smallptCPU.c displayfunc.c
geomfunc.h:348: warning: ‘RadianceDirectLighting’ defined but not used
/usr/bin/ld: cannot find -lOpenCL
collect2: ld returned 1 exit status
make: *** [smallptCPU] Error 1
Im missing something or i got my Include wrong? any ideas?
Ill keep firing away, with this kind of stuff i tend to just guess alot more than knowing what im missing
User avatar
Eros
Posts: 419
Joined: Wed Jul 22, 2009 8:37 am
Re: ATI released OpenCL SDK with hardware support
Postby jensverwiebe » Sun Jan 10, 2010 3:05 am
@ Dade
Hey, was nearly out-of-the-box-compile ;) Runs really nice here. Pls take a look at the results, if all is plausible and as intended.
Code: Select all
jens-macpro:SmallptGPU-v2.0alpha1_OSX jensverwiebe$ ./smallptgpuUsage: ./smallptgpu
Usage: ./smallptgpu <use CPU devices (0 or 1)> <use GPU devices (0 or 1)> <GPU workgroup size (0=default value or anything > 0 and power of 2)> <window width> <window height> <scene file>
Reading scene: scenes/cornell.scn
Scene size: 9
OpenCL Platform 0: Apple
OpenCL Device name 0: GeForce 8800 GT
OpenCL Device type 0: TYPE_GPU
OpenCL Device units 0: 14
OpenCL Device name 1: Intel(R) Xeon(R) CPU 5150 @ 2.66GHz
OpenCL Device type 1: TYPE_CPU
OpenCL Device units 1: 4
[Device::GeForce 8800 GT] Kernel file size 13351bytes
[Device::GeForce 8800 GT] Compilation result:
[Device::GeForce 8800 GT] Suggested work group size: 192
[Device::GeForce 8800 GT] Camera buffer size: 0Kb
[Device::GeForce 8800 GT] Scene buffer size: 0Kb
[Device::Intel(R) Xeon(R) CPU 5150 @ 2.66GHz] Kernel file size 13351bytes
[Device::Intel(R) Xeon(R) CPU 5150 @ 2.66GHz] Compilation result:
[Device::Intel(R) Xeon(R) CPU 5150 @ 2.66GHz] Suggested work group size: 1
[Device::Intel(R) Xeon(R) CPU 5150 @ 2.66GHz] Camera buffer size: 0Kb
[Device::Intel(R) Xeon(R) CPU 5150 @ 2.66GHz] Scene buffer size: 0Kb
OpenCL Device used: [GeForce 8800 GT][Intel(R) Xeon(R) CPU 5150 @ 2.66GHz]
Updating OpenCL Device workloads
Updating OpenCL Device workloads
Updating OpenCL Device workloads
Releasing resources
[Device::GeForce 8800 GT] Rendering thread halted
[Device::Intel(R) Xeon(R) CPU 5150 @ 2.66GHz] Rendering thread halted
Done.
smallptGPU2.png
visual output
Again, adapted source with OSX_diff and compiled 64bit binary: http://www.jensverwiebe.de/LuxRender/SmallptGPU-v2.0alpha1_OSX.zip
Note: for non LuxRender builders: you need libboost_thread-xgcc40-mt-1_39.a now too. ( naming can differ )
You can find my instructions for building boostlibs for OSX in "complation and portability" threads (viewtopic.php?f=22&t=472#p21831)
Some command-examples:
./smallptgpu 1 1 0 640 480 scenes/cornell.scn ( run on cpu/gpu with max available workgroupsize )
./smallptgpu 0 1 32 640 480 scenes/cornell.scn ( run on GPU only with workgroupsize = 32
./smallptgpu 1 1 0 800 600 scenes/simple.scn ( run on cpu/gpu with max available workgroupsize , widowsize 800x600 and simple scene )
..and..Dade, must repeat here: you are doing great work :) I love being on bleeding edge :D
Jens
User avatar
jensverwiebe
Developer
Posts: 3429
Joined: Wed Apr 02, 2008 4:34 pm
Re: ATI released OpenCL SDK with hardware support
Postby Dade » Sun Jan 10, 2010 4:18 am
jensverwiebe wrote:Hey, was nearly out-of-the-box-compile ;) Runs really nice here. Pls take a look at the results, if all is plausible and as intended.
Jens, to check if the results are plausible, just run "./smallptgpu 0 1 ..." than "./smallptgpu 1 0 ..." and finally "./smallptgpu 1 1 ...". The number of samples/sec should be, in the case of CPU+GPU, only slightly lower than the sum of results with CPU alone and GPU alone. It is useful to do a comparison with SmallptGPU 1.6 too.
Your numbers look a bit low to me but I guess we just need to tune the code a bit.
jensverwiebe wrote:..and..Dade, must repeat here: you are doing great work :) I love being on bleeding edge :D
Don't tell me, I'm not sleeping anymore :D
@Eros: can you post the result of a "ls -l /home/ward/NVIDIA_GPU_Computing_SDK/lib/" ? I have never used the NVIDIA SDK so it is hard for me to offer any help but just to check if the libraries are really there :idea:
User avatar
Dade
Developer
Posts: 8404
Joined: Sat Apr 19, 2008 6:04 pm
Location: Italy
Re: ATI released OpenCL SDK with hardware support
Postby jensverwiebe » Sun Jan 10, 2010 4:30 am
The number of samples/sec should be, in the case of CPU+GPU, only slightly lower than the sum of results with CPU alone and GPU alone.
Yeah, thats definitely not the case :
cpu.png
CPU alone, cpu @ 380% ( max, 400 )
gpu.png
GPU alone, cpu @ 99% ( max, 400 )
cpu_gpu.png
CPU + GPU, cpu @ 270% ( max, 400 )
Looks as it is just balancing the profiled max to both gpu and cpu.
In dualmode the cpu is not maxed out any longer , so is the gpu.( spending lot of time in sys, again a bloody threading thing? i guess we should use CL-atomics.
Edit: added a timeprofile
Code: Select all
# Report 1 - Session 1 - Time Profile (All Thread States) of smallptgpu
SharkProfileViewer
# Generated from the visible portion of the outline view
+ 31.5%, __workq_kernreturn, libSystem.B.dylib
| + 31.5%, _pthread_wqthread, libSystem.B.dylib
| | 31.5%, start_wqthread, libSystem.B.dylib
+ 18.5%, mach_msg_trap, libSystem.B.dylib
| + 18.5%, mach_msg, libSystem.B.dylib
| | + 11.1%, glcDebugListener, OpenGL
| | | + 11.1%, _pthread_start, libSystem.B.dylib
| | | | 11.1%, thread_start, libSystem.B.dylib
| | + 7.3%, io_connect_method, IOKit
| | | + 7.3%, IOConnectCallMethod, IOKit
| | | | + 7.3%, 0x113f01070 [216B], libclh.dylib
| | | | | + 7.3%, 0x113ed9c17 [unknown], libclh.dylib
| | | | | | + 7.3%, 0x113ed8e30 [1.0KB], libclh.dylib
| | | | | | | + 7.3%, glrCompWaitForEvent, GeForce8xxxGLDriver
| | | | | | | | + 7.3%, cldWaitForEvent, OpenCL
| | | | | | | | | + 7.3%, clWaitForEvent, OpenCL
| | | | | | | | | | + 7.3%, clWaitForEvents, OpenCL
| | | | | | | | | | | + 7.3%, RenderDevice::RenderThread(RenderDevice*), smallptgpu
| | | | | | | | | | | | + 7.3%, thread_proxy, smallptgpu
| | | | | | | | | | | | | + 7.3%, _pthread_start, libSystem.B.dylib
| | | | | | | | | | | | | | 7.3%, thread_start, libSystem.B.dylib
| | | | + 0.0%, gldDestroyMemoryPlugin, GeForce8xxxGLDriver
| | | | | + 0.0%, gldReclaimBuffer, GeForce8xxxGLDriver
| | | | | | + 0.0%, gldDestroyBuffer, GeForce8xxxGLDriver
| | | | | | | + 0.0%, cleDestroyTransferBuffer, OpenCL
| | | | | | | | + 0.0%, clReleaseCommand, OpenCL
| | | | | | | | | + 0.0%, clReleaseCommandsUpTo, OpenCL
| | | | | | | | | | + 0.0%, clFinish, OpenCL
| | | | | | | | | | | + 0.0%, RenderDevice::RenderThread(RenderDevice*), smallptgpu
| | | | | | | | | | | | + 0.0%, thread_proxy, smallptgpu
| | | | | | | | | | | | | + 0.0%, _pthread_start, libSystem.B.dylib
| | | | | | | | | | | | | | 0.0%, thread_start, libSystem.B.dylib
| | | | | | | + 0.0%, _CLMemDeallocate, OpenCL
| | | | | | | | + 0.0%, _CFRelease, CoreFoundation
| | | | | | | | | + 0.0%, clReleaseMemObject, OpenCL
| | | | | | | | | | + 0.0%, RenderDevice::SetWorkLoad(unsigned int, unsigned int, unsigned int, unsigned int, unsigned int*), smallptgpu
| | | | | | | | | | | + 0.0%, idleFunc(), smallptgpu
| | | | | | | | | | | | + 0.0%, -[GLUTApplication run], GLUT
| | | | | | | | | | | | | + 0.0%, glutMainLoop, GLUT
| | | | | | | | | | | | | | + 0.0%, main, smallptgpu
| | | | | | | | | | | | | | | 0.0%, start, smallptgpu
| | | | + 0.0%, gldCreateTexture, GeForce8xxxGLDriver
| | | | | + 0.0%, gldGetQueryInfo, GeForce8xxxGLDriver
| | | | | | + 0.0%, gldCreateTexture, GeForce8xxxGLDriver
| | | | | | | + 0.0%, gldGetQueryInfo, GeForce8xxxGLDriver
| | | | | | | | + 0.0%, gldUpdateDispatch, GeForce8xxxGLDriver
| | | | | | | | | + 0.0%, glBegin_Exec, GLEngine
| | | | | | | | | | + 0.0%, gleDrawPixelsFast, GLEngine
| | | | | | | | | | | + 0.0%, glDrawPixels_Exec, GLEngine
| | | | | | | | | | | | + 0.0%, displayFunc(), smallptgpu
| | | | | | | | | | | | | + 0.0%, -[GLUTView drawRect:], GLUT
| | | | | | | | | | | | | | + 0.0%, -[GLUTView handleWorkEvent:], GLUT
| | | | | | | | | | | | | | | + 0.0%, processWindowWorkList, GLUT
| | | | | | | | | | | | | | | | + 0.0%, __glutProcessWorkEvents, GLUT
| | | | | | | | | | | | | | | | | + 0.0%, -[GLUTApplication run], GLUT
| | | | | | | | | | | | | | | | | | + 0.0%, glutMainLoop, GLUT
| | | | | | | | | | | | | | | | | | | + 0.0%, main, smallptgpu
| | | | | | | | | | | | | | | | | | | | 0.0%, start, smallptgpu
| | | | + 0.0%, gldInitDispatch, GeForce8xxxGLDriver
| | | | | + 0.0%, gldPageoffBuffer, GeForce8xxxGLDriver
| | | | | | + 0.0%, gldUpdateDispatch, GeForce8xxxGLDriver
| | | | | | | + 0.0%, glBitmap_Exec, GLEngine
| | | | | | | | + 0.0%, glutBitmapCharacter, GLUT
| | | | | | | | | + 0.0%, displayFunc(), smallptgpu
| | | | | | | | | | + 0.0%, -[GLUTView drawRect:], GLUT
| | | | | | | | | | | + 0.0%, -[GLUTView handleWorkEvent:], GLUT
| | | | | | | | | | | | + 0.0%, processWindowWorkList, GLUT
| | | | | | | | | | | | | + 0.0%, __glutProcessWorkEvents, GLUT
| | | | | | | | | | | | | | + 0.0%, -[GLUTApplication run], GLUT
| | | | | | | | | | | | | | | + 0.0%, glutMainLoop, GLUT
| | | | | | | | | | | | | | | | + 0.0%, main, smallptgpu
| | | | | | | | | | | | | | | | | 0.0%, start, smallptgpu
| | - 0.0%, 0x113f00b40 [98B], libclh.dylib
| | - 0.0%, io_connect_map_memory_into_task, IOKit
+ 11.6%, __semwait_signal, libSystem.B.dylib
| + 11.6%, _pthread_cond_wait, libSystem.B.dylib
| | + 11.6%, boost::condition_variable::wait(boost::unique_lock<boost::mutex>&), smallptgpu
| | | + 10.7%, idleFunc(), smallptgpu
| | | | + 10.7%, -[GLUTApplication run], GLUT
| | | | | + 10.7%, glutMainLoop, GLUT
| | | | | | + 10.7%, main, smallptgpu
| | | | | | | 10.7%, start, smallptgpu
| | | + 0.9%, RenderDevice::RenderThread(RenderDevice*), smallptgpu
| | | | + 0.9%, thread_proxy, smallptgpu
| | | | | + 0.9%, _pthread_start, libSystem.B.dylib
| | | | | | 0.9%, thread_start, libSystem.B.dylib
+ 11.1%, kevent, libSystem.B.dylib
| + 11.1%, _dispatch_mgr_invoke, libSystem.B.dylib
| | + 11.1%, _dispatch_queue_invoke, libSystem.B.dylib
| | | + 11.1%, _dispatch_worker_thread2, libSystem.B.dylib
| | | | + 11.1%, _pthread_wqthread, libSystem.B.dylib
| | | | | 11.1%, start_wqthread, libSystem.B.dylib
+ 11.0%, 0x1007fd5c0 [5.7KB], Unknown Library
| + 11.0%, cld_exec_workitem, libcldcpuengine.dylib
| | + 11.0%, _dispatch_apply2, libSystem.B.dylib
| | | + 8.2%, _dispatch_worker_thread2, libSystem.B.dylib
| | | | + 8.2%, _pthread_wqthread, libSystem.B.dylib
| | | | | 8.2%, start_wqthread, libSystem.B.dylib
| | | + 2.7%, dispatch_apply_f, libSystem.B.dylib
| | | | + 2.7%, cld_exec_kernel, libcldcpuengine.dylib
| | | | | + 2.7%, _dispatch_queue_drain, libSystem.B.dylib
| | | | | | + 2.7%, _dispatch_queue_invoke, libSystem.B.dylib
| | | | | | | + 2.7%, _dispatch_worker_thread2, libSystem.B.dylib
| | | | | | | | + 2.7%, _pthread_wqthread, libSystem.B.dylib
| | | | | | | | | 2.7%, start_wqthread, libSystem.B.dylib
+ 10.7%, semaphore_wait_signal_trap, libSystem.B.dylib
| + 10.7%, pthread_mutex_lock, libSystem.B.dylib
| | + 6.3%, _CLEventDeallocate, OpenCL
| | | + 6.3%, _CFRelease, CoreFoundation
| | | | + 6.3%, clReleaseCommand, OpenCL
| | | | | + 6.3%, clReleaseCommandsUpTo, OpenCL
| | | | | | + 6.3%, clFinish, OpenCL
| | | | | | | + 6.3%, RenderDevice::RenderThread(RenderDevice*), smallptgpu
| | | | | | | | + 6.3%, thread_proxy, smallptgpu
| | | | | | | | | + 6.3%, _pthread_start, libSystem.B.dylib
| | | | | | | | | | 6.3%, thread_start, libSystem.B.dylib
| | + 2.6%, processWork, OpenCL
| | | + 2.6%, clCommandDispatch, OpenCL
| | | | + 2.6%, clEnqueueReadBuffer, OpenCL
| | | | | + 2.6%, RenderDevice::RenderThread(RenderDevice*), smallptgpu
| | | | | | + 2.6%, thread_proxy, smallptgpu
| | | | | | | + 2.6%, _pthread_start, libSystem.B.dylib
| | | | | | | | 2.6%, thread_start, libSystem.B.dylib
| | + 1.1%, clFinish, OpenCL
| | | + 1.1%, RenderDevice::RenderThread(RenderDevice*), smallptgpu
| | | | + 1.1%, thread_proxy, smallptgpu
| | | | | + 1.1%, _pthread_start, libSystem.B.dylib
| | | | | | 1.1%, thread_start, libSystem.B.dylib
| | + 0.6%, cldWaitForEvent, OpenCL
| | | + 0.6%, clWaitForEvent, OpenCL
| | | | + 0.6%, clWaitForEvents, OpenCL
| | | | | + 0.6%, RenderDevice::RenderThread(RenderDevice*), smallptgpu
| | | | | | + 0.6%, thread_proxy, smallptgpu
| | | | | | | + 0.6%, _pthread_start, libSystem.B.dylib
| | | | | | | | 0.6%, thread_start, libSystem.B.dylib
| | + 0.0%, clEnqueueNDRangeKernel, OpenCL
| | | + 0.0%, RenderDevice::RenderThread(RenderDevice*), smallptgpu
| | | | + 0.0%, thread_proxy, smallptgpu
| | | | | + 0.0%, _pthread_start, libSystem.B.dylib
| | | | | | 0.0%, thread_start, libSystem.B.dylib
- 3.3%, semaphore_wait_trap, libSystem.B.dylib
- 0.9%, 0x7fff86ea5b53 [725B], libSystem.B.dylib
- 0.5%, cosf, libSystem.B.dylib
- 0.3%, powf$fenv_access_off, libSystem.B.dylib
- 0.3%, gldGetTextureLevelImage, GeForce8xxxGLDriver
- 0.1%, io_connect_method, IOKit
- 0.1%, __memcpy, libSystem.B.dylib
- 0.1%, 0x1007efde0 [53.0KB], Unknown Library
- 0.1%, IOConnectCallMethod, IOKit
- 0.0%, void glgConvertTo_32<GLGConverter_ABGR8_ARGB8, (GLGMemory)2>(GLGOperation const*, GLDPixelMode const*), libGLImage.dylib
- 0.0%, fmaxf$fenv_access_off, libSystem.B.dylib
- 0.0%, mach_msg, libSystem.B.dylib
0.0%, start_wqthread, libSystem.B.dylib
- 0.0%, memcpy, libSystem.B.dylib
- 0.0%, gldUpdateDispatch, GeForce8xxxGLDriver
- 0.0%, cld_exec_workitem, libcldcpuengine.dylib
- 0.0%, __memcpy_chk, libSystem.B.dylib
- 0.0%, semaphore_signal_trap, libSystem.B.dylib
- 0.0%, dyld_stub___memcpy_chk, IOKit
- 0.0%, 0x113f01070 [216B], libclh.dylib
- 0.0%, szone_size, libSystem.B.dylib
- 0.0%, semaphore_signal_all_trap, libSystem.B.dylib
- 0.0%, RenderDevice::RenderThread(RenderDevice*), smallptgpu
- 0.0%, pick_nextworkqueue_droplock, libSystem.B.dylib
- 0.0%, OSAtomicAdd32Barrier, libSystem.B.dylib
- 0.0%, glPixelStorei_Exec, GLEngine
- 0.0%, glGetIntegerv_Exec, GLEngine
- 0.0%, gleUpdateFragmentStateProgram, GLEngine
- 0.0%, gleGetState, GLEngine
- 0.0%, glBegin_Exec, GLEngine
- 0.0%, fminf$fenv_access_off, libSystem.B.dylib
- 0.0%, dyld_stub_memcpy, IOKit
- 0.0%, dyld_stub_mach_msg_trap, libSystem.B.dylib
- 0.0%, dyld_stub_glGetIntegerv, GLUT
- 0.0%, do_rand, libSystem.B.dylib
- 0.0%, __spin_lock, libSystem.B.dylib
- 0.0%, __longcopy, libSystem.B.dylib
- 0.0%, __cpu_number, libSystem.B.dylib
- 0.0%, 0x200367950 [214B], GeForce8xxxGLDriver
- 0.0%, 0x200350da0 [450B], GeForce8xxxGLDriver
- 0.0%, 0x113ed9c0d [unknown], libclh.dylib
- 0.0%, 0x113ed9c0b [unknown], libclh.dylib
- 0.0%, 0x113ed5617 [unknown], libclh.dylib
- 0.0%, 0x113ecfde8 [unknown], libclh.dylib
In solo-mode it is.
Note: smallptgpu-1.6 shows same results for both modes around 1100k on my sys, so cpu and gpu are around of the same power in my mashine.( for cornell )
BTW: in "Beyoind"-forums, results let mesuggest the same. Talonman´s results show a good spreading across multi-gpu indeed.
So could be interesting just to drop in a second card. Unfortunately my left empty pcie-slots are only v.1 and 8-lane.
Have another old NV 7300GT laying around, but that would not support openCL, mixing NV and ATI does too not sound good to me too ( in case of getting an 4870 )
( cries for a new mashine :P )
Don't tell me, I'm not sleeping anymore
..right, thats what we call enthusiasm :P You can count on me too, who needs sleep ? :o
Jens
Last edited by jensverwiebe on Sun Jan 10, 2010 5:39 am, edited 8 times in total.
User avatar
jensverwiebe
Developer
Posts: 3429
Joined: Wed Apr 02, 2008 4:34 pm
Re: ATI released OpenCL SDK with hardware support
Postby Eros » Sun Jan 10, 2010 4:34 am
Im not convinced things are installed correctly on my system, so im going to have a fish around, it does appear most of the folders of the SDK are empty... or at least they have examples in them but little in the way of libs or headers, and makefiles.
I will probably try and roll back and install the actual driver linked on the OpenCL webpage rather than just the latest, though i always just assumed that the latest would be fine. Inspection of pages via google say that the OpenCL files are only included in the 190.29 drivers, and NOT the 190.42 drivers which i have.
*shakes fist*
I 'should' get this up and running fairly quickly now i know this
[Edit] This was my problem, sorry for all the spam, Im pleased to report that everything compiled fine, and this is the result.
Two shots of SmallptGPU-v1.6, getting about 4Msamples/s on cornell and 20M-ish on the simple scene.
Attachments
Screenshot-1.png
Screenshot.png
User avatar
Eros
Posts: 419
Joined: Wed Jul 22, 2009 8:37 am
PreviousNext
Return to GPU Acceleration
Who is online
Users browsing this forum: No registered users and 3 guests
|
{
"url": "http://www.luxrender.net/forum/viewtopic.php?f=34&t=2947&sid=8014d82f6d403ffe2c1dd16391e6ce4a&start=260",
"source_domain": "www.luxrender.net",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "58438",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LASPPRJO2TVP5APIAFETKIKBPJQWRHX6",
"WARC-Concurrent-To": "<urn:uuid:bcad1e06-7ac3-4e1c-9628-fde0dde32416>",
"WARC-Date": "2018-04-21T17:03:18Z",
"WARC-IP-Address": "174.136.68.46",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:ACXXEAYNZKBV4VRHYP37OGAVOOWJY5BD",
"WARC-Record-ID": "<urn:uuid:46873fee-af43-4830-9bc9-5e6431a10a63>",
"WARC-Target-URI": "http://www.luxrender.net/forum/viewtopic.php?f=34&t=2947&sid=8014d82f6d403ffe2c1dd16391e6ce4a&start=260",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cea15c2b-e378-4eaf-aef8-31c79f9cb0a2>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-158-89-8.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-17\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for April 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
46,
47,
100,
101,
147,
148,
198,
199,
241,
242,
424,
425,
457,
458,
466,
474,
476,
487,
521,
522,
572,
573,
612,
613,
784,
785,
964,
976,
981,
983,
994,
1027,
1028,
1078,
1079,
1122,
1123,
1213,
1320,
1400,
1407,
1408,
1443,
1455,
1497,
1514,
1522,
1524,
1535,
1568,
1569,
1619,
1620,
1668,
1669,
1828,
1868,
1869,
2018,
2087,
2088,
2244,
2266,
2386,
2387,
2439,
2496,
2607,
2608,
2609,
2614,
2696,
2708,
2721,
2731,
2733,
2745,
2778,
2779,
2829,
2830,
2870,
2871,
2975,
3082,
3162,
3163,
3164,
3521,
3522,
3565,
3577,
3582,
3592,
3594,
3606,
3639,
3655,
3656,
3706,
3707,
3746,
3747,
4079,
4080,
4155,
4156,
4161,
4387,
4458,
4492,
4528,
4559,
4560,
4561,
4620,
4726,
4738,
4743,
4745,
4756,
4789,
4790,
4840,
4841,
4888,
4889,
4896,
4897,
5031,
5048,
5132,
5320,
5354,
5368,
5393,
5431,
5462,
5488,
5558,
5589,
5614,
5668,
5714,
5771,
5821,
5870,
5956,
6034,
6121,
6203,
6284,
6371,
6404,
6437,
6470,
6490,
6540,
6622,
6628,
6629,
6630,
6646,
6660,
6661,
6662,
6792,
6899,
7033,
7034,
7057,
7058,
7156,
7245,
7379,
7380,
7472,
7473,
7478,
7490,
7503,
7513,
7515,
7527,
7560,
7561,
7611,
7612,
7651,
7652,
7805,
7806,
7807,
8140,
8141,
8224,
8225,
8336,
8337,
8338,
8381,
8382,
8600,
8612,
8617,
8627,
8629,
8641,
8674,
8690,
8691,
8741,
8742,
8789,
8790,
8925,
8926,
8927,
8965,
8973,
9008,
9009,
9017,
9051,
9052,
9064,
9099,
9100,
9101,
9169,
9330,
9356,
9373,
9445,
9464,
9521,
9568,
9616,
9663,
9705,
9744,
9782,
9831,
9880,
9917,
9958,
10007,
10061,
10115,
10178,
10226,
10275,
10327,
10411,
10468,
10536,
10604,
10664,
10720,
10778,
10833,
10882,
10938,
10983,
11067,
11124,
11192,
11260,
11307,
11358,
11411,
11548,
11601,
11662,
11715,
11768,
11824,
11878,
11933,
11991,
12050,
12113,
12162,
12218,
12276,
12334,
12396,
12467,
12533,
12603,
12674,
12737,
12800,
12866,
12919,
12975,
13034,
13080,
13130,
13182,
13238,
13303,
13363,
13427,
13492,
13549,
13606,
13666,
13710,
13761,
13806,
13855,
13947,
13985,
14031,
14069,
14107,
14148,
14216,
14257,
14309,
14361,
14396,
14447,
14502,
14561,
14615,
14668,
14714,
14766,
14815,
14873,
14926,
14978,
15028,
15083,
15142,
15204,
15270,
15331,
15391,
15446,
15495,
15534,
15575,
15616,
15664,
15701,
15777,
15826,
15886,
15946,
15978,
16018,
16062,
16134,
16179,
16235,
16291,
16320,
16388,
16429,
16481,
16533,
16569,
16606,
16646,
16718,
16763,
16819,
16875,
16918,
16986,
17027,
17079,
17131,
17178,
17227,
17259,
17307,
17360,
17393,
17429,
17475,
17510,
17639,
17688,
17724,
17766,
17800,
17847,
17896,
17936,
17985,
18023,
18064,
18102,
18155,
18217,
18272,
18320,
18357,
18394,
18442,
18472,
18503,
18552,
18584,
18635,
18673,
18708,
18747,
18785,
18825,
18873,
18921,
18965,
19009,
19053,
19097,
19098,
19099,
19119,
19272,
19396,
19397,
19516,
19676,
19707,
19708,
19748,
19749,
19837,
19838,
19843,
19925,
19937,
19950,
19960,
19962,
19974,
20007,
20008,
20058,
20059,
20098,
20099,
20351,
20352,
20673,
20674,
20688,
20689,
20755,
20756,
20884,
20885,
20985,
20997,
21014,
21029,
21041,
21046,
21048,
21059,
21092,
21093,
21106,
21107,
21134,
21135,
21149,
21150
],
"line_end_idx": [
46,
47,
100,
101,
147,
148,
198,
199,
241,
242,
424,
425,
457,
458,
466,
474,
476,
487,
521,
522,
572,
573,
612,
613,
784,
785,
964,
976,
981,
983,
994,
1027,
1028,
1078,
1079,
1122,
1123,
1213,
1320,
1400,
1407,
1408,
1443,
1455,
1497,
1514,
1522,
1524,
1535,
1568,
1569,
1619,
1620,
1668,
1669,
1828,
1868,
1869,
2018,
2087,
2088,
2244,
2266,
2386,
2387,
2439,
2496,
2607,
2608,
2609,
2614,
2696,
2708,
2721,
2731,
2733,
2745,
2778,
2779,
2829,
2830,
2870,
2871,
2975,
3082,
3162,
3163,
3164,
3521,
3522,
3565,
3577,
3582,
3592,
3594,
3606,
3639,
3655,
3656,
3706,
3707,
3746,
3747,
4079,
4080,
4155,
4156,
4161,
4387,
4458,
4492,
4528,
4559,
4560,
4561,
4620,
4726,
4738,
4743,
4745,
4756,
4789,
4790,
4840,
4841,
4888,
4889,
4896,
4897,
5031,
5048,
5132,
5320,
5354,
5368,
5393,
5431,
5462,
5488,
5558,
5589,
5614,
5668,
5714,
5771,
5821,
5870,
5956,
6034,
6121,
6203,
6284,
6371,
6404,
6437,
6470,
6490,
6540,
6622,
6628,
6629,
6630,
6646,
6660,
6661,
6662,
6792,
6899,
7033,
7034,
7057,
7058,
7156,
7245,
7379,
7380,
7472,
7473,
7478,
7490,
7503,
7513,
7515,
7527,
7560,
7561,
7611,
7612,
7651,
7652,
7805,
7806,
7807,
8140,
8141,
8224,
8225,
8336,
8337,
8338,
8381,
8382,
8600,
8612,
8617,
8627,
8629,
8641,
8674,
8690,
8691,
8741,
8742,
8789,
8790,
8925,
8926,
8927,
8965,
8973,
9008,
9009,
9017,
9051,
9052,
9064,
9099,
9100,
9101,
9169,
9330,
9356,
9373,
9445,
9464,
9521,
9568,
9616,
9663,
9705,
9744,
9782,
9831,
9880,
9917,
9958,
10007,
10061,
10115,
10178,
10226,
10275,
10327,
10411,
10468,
10536,
10604,
10664,
10720,
10778,
10833,
10882,
10938,
10983,
11067,
11124,
11192,
11260,
11307,
11358,
11411,
11548,
11601,
11662,
11715,
11768,
11824,
11878,
11933,
11991,
12050,
12113,
12162,
12218,
12276,
12334,
12396,
12467,
12533,
12603,
12674,
12737,
12800,
12866,
12919,
12975,
13034,
13080,
13130,
13182,
13238,
13303,
13363,
13427,
13492,
13549,
13606,
13666,
13710,
13761,
13806,
13855,
13947,
13985,
14031,
14069,
14107,
14148,
14216,
14257,
14309,
14361,
14396,
14447,
14502,
14561,
14615,
14668,
14714,
14766,
14815,
14873,
14926,
14978,
15028,
15083,
15142,
15204,
15270,
15331,
15391,
15446,
15495,
15534,
15575,
15616,
15664,
15701,
15777,
15826,
15886,
15946,
15978,
16018,
16062,
16134,
16179,
16235,
16291,
16320,
16388,
16429,
16481,
16533,
16569,
16606,
16646,
16718,
16763,
16819,
16875,
16918,
16986,
17027,
17079,
17131,
17178,
17227,
17259,
17307,
17360,
17393,
17429,
17475,
17510,
17639,
17688,
17724,
17766,
17800,
17847,
17896,
17936,
17985,
18023,
18064,
18102,
18155,
18217,
18272,
18320,
18357,
18394,
18442,
18472,
18503,
18552,
18584,
18635,
18673,
18708,
18747,
18785,
18825,
18873,
18921,
18965,
19009,
19053,
19097,
19098,
19099,
19119,
19272,
19396,
19397,
19516,
19676,
19707,
19708,
19748,
19749,
19837,
19838,
19843,
19925,
19937,
19950,
19960,
19962,
19974,
20007,
20008,
20058,
20059,
20098,
20099,
20351,
20352,
20673,
20674,
20688,
20689,
20755,
20756,
20884,
20885,
20985,
20997,
21014,
21029,
21041,
21046,
21048,
21059,
21092,
21093,
21106,
21107,
21134,
21135,
21149,
21150,
21209
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 21209,
"ccnet_original_nlines": 473,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12714025378227234,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.041530050337314606,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5622950792312622,
"rps_doc_frac_unique_words": 0.3323828876018524,
"rps_doc_mean_word_length": 5.822810649871826,
"rps_doc_num_sentences": 455,
"rps_doc_symbol_to_word_ratio": 0.001821490004658699,
"rps_doc_unigram_entropy": 5.981584072113037,
"rps_doc_word_count": 2455,
"rps_doc_frac_chars_dupe_10grams": 0.19069604575634003,
"rps_doc_frac_chars_dupe_5grams": 0.2600909471511841,
"rps_doc_frac_chars_dupe_6grams": 0.23630639910697937,
"rps_doc_frac_chars_dupe_7grams": 0.23210912942886353,
"rps_doc_frac_chars_dupe_8grams": 0.20608603954315186,
"rps_doc_frac_chars_dupe_9grams": 0.19398391246795654,
"rps_doc_frac_chars_top_2gram": 0.02497377060353756,
"rps_doc_frac_chars_top_3gram": 0.013081500306725502,
"rps_doc_frac_chars_top_4gram": 0.015390000306069851,
"rps_doc_books_importance": -2612.901611328125,
"rps_doc_books_importance_length_correction": -2612.901611328125,
"rps_doc_openwebtext_importance": -1308.1832275390625,
"rps_doc_openwebtext_importance_length_correction": -1308.1832275390625,
"rps_doc_wikipedia_importance": -513.8370971679688,
"rps_doc_wikipedia_importance_length_correction": -513.8370971679688
},
"fasttext": {
"dclm": 1.0000100135803223,
"english": 0.7273933291435242,
"fineweb_edu_approx": 1.1150579452514648,
"eai_general_math": 0.028578760102391243,
"eai_open_web_math": 0.2010406255722046,
"eai_web_code": 0.519910991191864
}
}
|
{
"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": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "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": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,652,809,982,399,081,000 |
The Register® — Biting the hand that feeds IT
Feeds
Australia, give up your fixed broadband!
Look, Australia, you’ve got it all wrong. Wireless broadband is the future. It’s not just a future, it’s the genuine, authentic, sci-fi “wonders of the universe” future, complete with unicorns and no need for a National Broadband Network. And what do you do? You keep buying fixed broadband. I realise that some of you are …
COMMENTS
This topic is closed for new posts.
Page:
Comments
FAIL
Not only are we on the ar$e end of the planet.
... but also with our heads in the sand.
I live in Australia and the constant nickle and diming everyone for every inch drives me nuts. Having moved back here from Europe I can not believe what a pathetic state internet access is here in Auz.
$42billion for a NBN when all we want is a bigger pipe overseas. Here is a news flash Aus... the internet exists elsewhere having a fibre NBN just means we will be going no where faster!
1
3
Silver badge
Unhappy
When I moved back from urban China,
I felt much the same. Still do.
3
0
Go
Giving Telstra the finger
The Government of yesteryear made the big mistake of making the last-mile of Telecom Australia's monopoly part of the same company when going public, and then expecting competition to stand a chance. The NBN is a much delayed reaction to Telstra not playing fairly. They brought in the big guns (a loud-mouthed American CEO who enjoyed threats and scaremongering) and his style didn't fit in at all with the Australian psyche. He left with his tail between his legs, and a big chunk of shareholder value strapped to his back. The other Telco's didn't have the capital or market share to justify building the equivalent network, although some made a start. While I agree that the NBN shouldn't have been necessary (and equal access for all, even someone out in woop-woop, is a ridiculous goal for a country as large and city-centric as Australia - satellite and wireless definitely should win out there), I am glad that the Government didn't succumb to Telstra and give up on a fair game, and are ripping the tall poppy a new one!
Bigger international pipes are also not the solution - although there should be (and is) constant improvement.. Improved caching (of P2P protocols also) and CDNs are what we need. Some ISPs are already caching bittorrent traffic - clever packet sniffing, caching downloaded blocks, and pushing cached blocks to individual requesters is already possible - not that ISPs would admit they're working to improve the speed of probable copyrighted downloads in the current environment.
So, thumbs up for screwing over Telstra. Let's hope that a competitive playing field for all remains the goal of this network.
2
0
Short-sighted
That's a seriously short-sighted attitude.
0
0
Coat
Ha, because mobile internet is....
Why would you use 3G at home when you can wire up and not worry about the prohibitive costs that still anchor 3G / mobile services.
9
0
Flame
What a load of CRAP!
I have a great ADSL2+ connection, it's quick (14 megabit), cheap and gives me a great data allowance for my money. It's always on and doesn't drop out in bad weather.
My father on the other hand has a 3G Wireless broadband connection, he pays the same amount as me, often gets stuck with a GSM signal the same speed as dial-up and gets HALF my speed when he does manage a 3G link, the signal drops completely in bad weather and gets only 1%.. YES 1%!! of the data allowance I do on my fixed line service.
So to the author of this article, you can take your opinion on the future, and your supposed facts and figures and you can put them where the sun don't shine!
5
7
Silver badge
Maybe you should read the article again
Then you might feel a tad silly.
4
0
Coat
I R O N Y
(and I don't mean made of iron)
0
0
FAIL
Satire perception fail?
I suspect the author thinks the same as you do...
0
0
Silver badge
FAIL
Don't shoot the messenger
Didn't quite read that all the way though did we? Missed the 'Sincerely, Malcolm Turnbull, Minister Opposition Spokesman for Communications and Broadband' bit.
The author is taking the piss, there is a tiny-weeny-ikkle bit of sacrcasm there.
1
0
Paris Hilton
Sarcasm comprehension fail!
That is all. Paris of course...
0
0
i think you missed the sarcasm in the article.
see title.
0
0
FAIL
Irony?
See article re: Oz literacy http://www.theregister.co.uk/2011/04/04/australians_cannot_read_or_count/
3
0
FAIL
It's a satirical piece...
Robert, you really need to read it a little closer!
Having said that now hopefully you understand YOU are on the same side as the writer of this article I need to give you a few home truths.
1) Only a few years back 2G was paid in kb! to download 10MB cost you a considerable chunk of change. With the explosion in data limits on adsl in the last year the gap has again widened. Please remember this gap will again close.
2) Have you set up a dish on the roof for the 3G connection? (My parents who can't get ADSL get great service with 3G even when their satellite TV no longer works!) and they can't download the 3GB limit so it's cheaper for them then ADSL anyway, given all the other costs involved with ADSL.
0
0
Flame
Oh Noes....
Seems the author has never tried wireless broadband, especially between 4pm to 9pm weekdays....
Yet again, Australia lags behind on infrastructure to actually backup these grand plans and sky-high aims.
No thanks, I'll stick to the copper....
1
4
Anonymous Coward
Erm?
I thought the article was heavily laced with sarcasm.
0
0
Thumb Up
Someone should fwd this to M Turnbull
Until we work out how to punch holes in the void-which-binds and make our own datasphere, mobile will always be an over-contended, expensive, second-rate service. "Up to" 14.4Mb/s (HSPA+) means nothing if 2/3 of requests time out. Give me my 4Mb/s ADSL2+ any day.
0
0
Happy
Like us?
Maybe they, like us in the UK, can't get a 3G connection when sitting in our homes?
1
0
WTF?
Turnbull Time Machine
I live in an inner city suburb of Hobart and ASDL 2+ is "not available" in my area. Without the NBN, I'm going to be stuck with this hopeless speed (256k/64k) for the next decade. Even with the NBN I'll be waiting 2 or 3 years before the fibre gets to my door (so much for Tasmania being the first to get it).
If only the world would go back to basic HTML, tiny GIF images, no audio/video/flash, and blinking text (for dramatic effect) ... then I'd get my speed back.
Malcolm ... help us to turn back time ... or at minimum ... freeze time until Africa catches up.
0
0
Happy
You want your broadband (Good Luck)
NBN is one of the only the policies the government has left (with any credibility). If you want your NBN you'll have to vote in this bunch of liars for another term (Notice how long stage 2 has been delayed due to regulatory reasons), and GOD knows what else they'll have buggered up by then.
ADSL 2+ is not available in Hobart, cause Tel$tra(monopoly pricing) own the only fibre (in use) across Bass Straight. Dont expect it to improve that much with the baslink fibre. The University of Tasmania's Astronomy Department will probably gobble up the most bandwidth. With $2.1Billion of investment up for grabs on the SKA(square kilometer array) project, Tassies far flung Cambridge telescope will be funded.
0
0
Silver badge
I'll tell you why we don't use mobile boradband
It's because of two thieves called Telstra and Optus.
1
0
Thumb Up
Correct
People use landline internet connections because 3G is so expensive. And because coverage is fairly spotty.
BTW, nice username. :D
1
0
Alert
What he said...
I am one of those subscribers forced by circumstance into 3G HSDPA "broad"band everywhere, for everything. 90 bucks a month for s-l-o-w and unreliable internet connection.
Forget the advertising puffery about speeds of "3.6 mbps" or "7.2 mbps" or "21" or even "42" mbps. Those speeds are available only in Sydney or Melbourne CBD, and only if you are sitting across the road from the mobile phone tower.
Anywhere else, you will top out at whatever the tower sends: usually, 7.2 mbps. With very high latency, and inexplicable "fades" when the DNS simply stops responding. The actual experience is about the same as a good 56 kbps dialup connection.
Yes, the "Internet, everywhere" part is nice. But decent bandwidth would be a lot nicer.
Sorry Malcom: whatever the question, HSDPA wireless is not the answer.
1
0
Erm...
This article is surely pure sarcasm, right?
11
0
Silver badge
FAIL
indeed
I too was going to respond with quips about latency, gaming, weather, positional antenna in houses etc. I even needed to check to see if it was in bootnotes but no, it appears to be serious (which is worrying).
0
0
Gold badge
Re: Erm
Certainly looked that way to me. Apparently others felt differently.
0
0
Thumb Up
At least someone noticed...
I admit, I was wondering where it was going until the line about paying thousands to download torrents to your mobile which tipped it from idiotic opinion piece into sarcasm.
0
0
Pint
Shhh....
Don't disturb them in mid-rant.
0
0
Thumb Up
re: Erm...
yes, it is. Its pretty blatant. Some of the commentards above don't seem to be able to tell, though...
0
0
Silver badge
Yep
I thought so too, but some people don't get it.
0
0
Yep
+1 sarcasm. I <3 copper.
0
0
Thumb Up
Well done Pete 9
I'd have thought "most of you are miserly niggards who would rather buy a 60 GB per month plan on fixed networks than spend a couple of thousand running Torrents to a mobile" would have erased any doubt that remained that far down the piece. Still, you got there.
If you happen to have any clue going spare pass it on to Robert Heffernan, he appears to be without.
0
0
Bronze badge
Thumb Down
@Erm...
"This article is surely pure sarcasm, right?"
It has to be. Wireless anything here is overpriced and underperforming.
When they can't get basic wired cable right, what makes you think they'll get wireless anywhere close?
I'm thinking the author has never actually BEEN to Australia, to hell with the numbers, real life are the only numbers that actually count.
0
0
(Written by Reg staff)
Re: @Erm...
1. Sarcasm was the intent. I thought the unicorns in the second par were a pretty broad hint.
2. I haven't so much "been to Australia" as being born here, back when there were still reds under the bed, JFK wasn't the source of conspiracy theories, and stuff like that.
1
0
Silver badge
Wireless, the future ?
You mean, that radiative technology which gets me only 500kbps as soon as I move to the next room ? And 52kpbs if I go upstairs ?
You mean that publicly-accessible medium that anyone can snoop on from the street with the right hardware, and easily break into with its laughable WPA "encryption" ?
Surely you jest, hmm ? Either that or you work for Echelon.
Give me a shielded twisted pair and 8Mbps please. I'll take that over wireless any day.
Not to mention that, to listen in on my wire, you have to be physically attached to it - which is not easy to do from the street.
Oh, and in Japan they have an *average* connection speed of 60Mbps. That means that there are a lot of people with MORE than that - probably approaching Ethernet speeds. Wired connections are slated to reach the terabit per second range in the next decade or so. Wireless can drool all it wants, it'll never get there.
0
0
WTF?
context
This is apparently a clever sarcastic attack on... something. The Register is a UK site and it's perhaps optimistic to expect we readers to be up to speed on the details of Australian politics.
1
0
context is alright, I suppose, it placed in the proper context...
I'm in the US, and probably get Australian politics confused with Canadian, but it was pretty obvious to me that the article was satirically making the point that Australians were hanging on to their hardwire "not as fast as we'd like but still better than wireless, especially when costs are compared" internet access, rather than a lemming-like rush to slower and much more expensive wireless internet.
0
0
Flame
WTF was that drivel
Wireless my arse.
That's unless they can invent one that can penetrate everything on this god given earth without affecting the signal, and at the same time not sear the skin off our bodies.
Until then, I'll have my nice lovely wired connection please and thank you very much.
0
0
FAIL
@Pete 9
I think there's a satire perception failure at work...
0
0
it seems many
of the readers and comnters don't understand satire.
1
0
FAIL
@Robert Heffernan
Well done for completely missing the irony. Look again for the words "spend a couple of thousand" and re-read the article.
0
0
Joke
Re: This article is surely pure sarcasm, right?
"yet most of you are miserly niggards who would rather buy a 60 GB per month plan on fixed networks than spend a couple of thousand running Torrents to a mobile"
Yes, yes it is.
This would be an Australian response to the oppositions statements about how the NBN isn't required and that it can be delivered on wireless.
0
0
Bronze badge
Spot on
Anyone who clams that that any wireless technology present or future could be a replacement for fibre automatically identifies themself as someone who deserves to be summarily ignored on the subject.
0
0
Anonymous Coward
Re: Erm
I think we need a Joke Alert icon for the articles, not just the comments...
0
0
Gold badge
Megaphone
Re: Re: Erm
Actually I think we need a "This is sarcasm, shitwits." icon for both........
0
0
Silver badge
The world isn't ready for wireless yet
Wireless promises immense bandwidths at virtually no cost. The only problem is that the world isn't ready yet and still thinks in terms of network operators and network users. Once we learn that fixed position mains powered stations can also act as infrastructure, and we have the MIMO technology needed to take advantage of that, it might find a use.
Other than that, wireless broadband is still just a pipe dream. It rarely works where you need it, and when it works, it's hideously expensive.
0
0
Silver badge
WTF?
Wireless isn't some magic pill which solves all woes
It's a pile of shite. Inherently, you are all sharing that bandwidth, due to the shared spectrum - it simply does not scale, coverage is limited to urban areas and it generally is unstable where there are lots of users and suffers from high latency everywhere.
Britain has one of the best 3G networks. Use it in central London, and you'll quickly see how slow and overloaded it is. Try and use it outside of an urban area, and you'll find you have no coverage. For instance, at my parents house out in the 'sticks' (yet within sight of the biggest telecommunications research institute in the UK), and not only can you not get 1G reception inside the house, but you have to wander about half a mile down the road to get anything.
A national fibre network is the only way to get high speed, low latency internet into every house - and that's what people want. Ask the Swedish, they've been doing this for years - live in the middle of nowhere? No problem, they run the fibre right to you.
Of course they pay a lot more in taxes. Perhaps the aussies should fund this by taxing the massive international conglomerates that rape Australia of its natural resources a bit more.
1
0
WTF?
Shocking data in the detail...
60 GBP / Month for ASDL ? Really ?
Are there no cable operators in Australia ?
I know they are not perfect (and their SuperHub is far from super), but at least Virgin Media keep BT on their toes with respect to pricing for high speed internet...
0
1
60gbp a month?
60GBP/month? You'd only be paying that if you live out in a rural area, or go for one of the plans with a huge download quota (e.g. half a terabyte a month).
I pay ~45GBP a month for 150gb downstream quota (unlimited upstream) on "up to 24mbit" ADSL2+, which can sustain ~1.6mbyte/sec on file downloads (plus overheads). And that's because I go with one of the good but expensive ISPs, who have mirrors with lots of content that don't count against quota, and actually have knowledgable tech support people.
If you want one of the horrible companies, 60GBP will get you ADSL2+ with no quota and a landline phone.
0
0
Download quota?
What download quota? I'm with Be.
0
0
Page:
This topic is closed for new posts.
|
{
"url": "http://forums.theregister.co.uk/forum/1/2011/04/04/open_letter_turnbull/",
"source_domain": "forums.theregister.co.uk",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "109394",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QAOLN44MVG5UHIOKQVHH5JBNGFLVRNXL",
"WARC-Concurrent-To": "<urn:uuid:8578a710-be51-4ed0-aec7-c064c325bfa0>",
"WARC-Date": "2013-12-12T14:30:03Z",
"WARC-IP-Address": "50.57.15.204",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:SKIASZKLB6IZ5DMWVMDMA6F7UJMVTYSH",
"WARC-Record-ID": "<urn:uuid:97a65451-b42a-4557-a13a-f2081cde99ff>",
"WARC-Target-URI": "http://forums.theregister.co.uk/forum/1/2011/04/04/open_letter_turnbull/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8faefcb1-7387-4278-ab4c-286d57f1b04b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 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,
46,
47,
53,
54,
95,
96,
421,
422,
431,
432,
468,
469,
475,
476,
485,
490,
491,
538,
539,
580,
581,
783,
784,
971,
972,
974,
976,
989,
997,
998,
1034,
1035,
1067,
1068,
1070,
1072,
1075,
1076,
1102,
1103,
2133,
2134,
2614,
2615,
2742,
2743,
2745,
2747,
2748,
2762,
2763,
2806,
2807,
2809,
2811,
2816,
2817,
2852,
2853,
2985,
2986,
2988,
2990,
2996,
2997,
3018,
3019,
3186,
3187,
3525,
3526,
3685,
3686,
3688,
3690,
3703,
3704,
3744,
3745,
3778,
3779,
3781,
3783,
3788,
3789,
3799,
3800,
3832,
3833,
3835,
3837,
3842,
3843,
3867,
3868,
3918,
3919,
3921,
3923,
3936,
3941,
3942,
3968,
3969,
4129,
4130,
4212,
4213,
4215,
4217,
4230,
4231,
4259,
4260,
4292,
4293,
4295,
4297,
4298,
4345,
4346,
4357,
4358,
4360,
4362,
4367,
4368,
4375,
4376,
4478,
4479,
4481,
4483,
4488,
4489,
4515,
4516,
4568,
4569,
4708,
4709,
4940,
4941,
5233,
5234,
5236,
5238,
5244,
5245,
5257,
5258,
5354,
5355,
5462,
5463,
5503,
5504,
5506,
5508,
5525,
5526,
5531,
5532,
5586,
5587,
5589,
5591,
5600,
5601,
5639,
5640,
5904,
5905,
5907,
5909,
5915,
5916,
5925,
5926,
6010,
6011,
6013,
6015,
6020,
6021,
6043,
6044,
6354,
6355,
6513,
6514,
6611,
6612,
6614,
6616,
6622,
6623,
6659,
6660,
6953,
6954,
7368,
7369,
7371,
7373,
7386,
7387,
7435,
7436,
7490,
7491,
7493,
7495,
7504,
7505,
7513,
7514,
7622,
7623,
7646,
7647,
7649,
7651,
7657,
7658,
7674,
7675,
7847,
7848,
8080,
8081,
8325,
8326,
8415,
8416,
8487,
8488,
8490,
8492,
8493,
8500,
8501,
8545,
8546,
8549,
8551,
8564,
8569,
8570,
8577,
8578,
8789,
8790,
8792,
8794,
8805,
8806,
8814,
8815,
8884,
8885,
8887,
8889,
8898,
8899,
8927,
8928,
9103,
9104,
9106,
9108,
9113,
9114,
9123,
9124,
9156,
9157,
9159,
9161,
9170,
9171,
9182,
9183,
9286,
9287,
9289,
9291,
9304,
9305,
9309,
9310,
9358,
9359,
9361,
9363,
9364,
9368,
9369,
9394,
9395,
9397,
9399,
9408,
9409,
9426,
9427,
9691,
9692,
9793,
9794,
9796,
9798,
9811,
9822,
9823,
9831,
9832,
9878,
9879,
9951,
9952,
10055,
10056,
10196,
10197,
10199,
10201,
10224,
10225,
10237,
10238,
10332,
10333,
10508,
10509,
10511,
10513,
10526,
10527,
10550,
10551,
10681,
10682,
10849,
10850,
10910,
10911,
10999,
11000,
11130,
11131,
11450,
11451,
11453,
11455,
11460,
11461,
11469,
11470,
11664,
11665,
11667,
11669,
11670,
11736,
11737,
12142,
12143,
12145,
12147,
12153,
12154,
12174,
12175,
12193,
12194,
12367,
12368,
12454,
12455,
12457,
12459,
12464,
12465,
12473,
12474,
12529,
12530,
12532,
12534,
12535,
12549,
12550,
12603,
12604,
12606,
12608,
12613,
12614,
12632,
12633,
12756,
12757,
12759,
12761,
12766,
12767,
12815,
12816,
12978,
12979,
12995,
12996,
13138,
13139,
13141,
13143,
13156,
13157,
13165,
13166,
13366,
13367,
13369,
13371,
13388,
13389,
13397,
13398,
13475,
13476,
13478,
13480,
13491,
13501,
13502,
13514,
13515,
13593,
13594,
13596,
13598,
13611,
13612,
13651,
13652,
14004,
14005,
14149,
14150,
14152,
14154,
14167,
14172,
14173,
14226,
14227,
14488,
14489,
14958,
14959,
15217,
15218,
15402,
15403,
15405,
15407,
15412,
15413,
15444,
15445,
15480,
15481,
15525,
15526,
15693,
15694,
15696,
15698,
15699,
15714,
15715,
15873,
15874,
16224,
16225,
16330,
16331,
16333,
16335,
16336,
16352,
16353,
16387,
16388,
16390,
16392,
16393,
16399,
16400
],
"line_end_idx": [
46,
47,
53,
54,
95,
96,
421,
422,
431,
432,
468,
469,
475,
476,
485,
490,
491,
538,
539,
580,
581,
783,
784,
971,
972,
974,
976,
989,
997,
998,
1034,
1035,
1067,
1068,
1070,
1072,
1075,
1076,
1102,
1103,
2133,
2134,
2614,
2615,
2742,
2743,
2745,
2747,
2748,
2762,
2763,
2806,
2807,
2809,
2811,
2816,
2817,
2852,
2853,
2985,
2986,
2988,
2990,
2996,
2997,
3018,
3019,
3186,
3187,
3525,
3526,
3685,
3686,
3688,
3690,
3703,
3704,
3744,
3745,
3778,
3779,
3781,
3783,
3788,
3789,
3799,
3800,
3832,
3833,
3835,
3837,
3842,
3843,
3867,
3868,
3918,
3919,
3921,
3923,
3936,
3941,
3942,
3968,
3969,
4129,
4130,
4212,
4213,
4215,
4217,
4230,
4231,
4259,
4260,
4292,
4293,
4295,
4297,
4298,
4345,
4346,
4357,
4358,
4360,
4362,
4367,
4368,
4375,
4376,
4478,
4479,
4481,
4483,
4488,
4489,
4515,
4516,
4568,
4569,
4708,
4709,
4940,
4941,
5233,
5234,
5236,
5238,
5244,
5245,
5257,
5258,
5354,
5355,
5462,
5463,
5503,
5504,
5506,
5508,
5525,
5526,
5531,
5532,
5586,
5587,
5589,
5591,
5600,
5601,
5639,
5640,
5904,
5905,
5907,
5909,
5915,
5916,
5925,
5926,
6010,
6011,
6013,
6015,
6020,
6021,
6043,
6044,
6354,
6355,
6513,
6514,
6611,
6612,
6614,
6616,
6622,
6623,
6659,
6660,
6953,
6954,
7368,
7369,
7371,
7373,
7386,
7387,
7435,
7436,
7490,
7491,
7493,
7495,
7504,
7505,
7513,
7514,
7622,
7623,
7646,
7647,
7649,
7651,
7657,
7658,
7674,
7675,
7847,
7848,
8080,
8081,
8325,
8326,
8415,
8416,
8487,
8488,
8490,
8492,
8493,
8500,
8501,
8545,
8546,
8549,
8551,
8564,
8569,
8570,
8577,
8578,
8789,
8790,
8792,
8794,
8805,
8806,
8814,
8815,
8884,
8885,
8887,
8889,
8898,
8899,
8927,
8928,
9103,
9104,
9106,
9108,
9113,
9114,
9123,
9124,
9156,
9157,
9159,
9161,
9170,
9171,
9182,
9183,
9286,
9287,
9289,
9291,
9304,
9305,
9309,
9310,
9358,
9359,
9361,
9363,
9364,
9368,
9369,
9394,
9395,
9397,
9399,
9408,
9409,
9426,
9427,
9691,
9692,
9793,
9794,
9796,
9798,
9811,
9822,
9823,
9831,
9832,
9878,
9879,
9951,
9952,
10055,
10056,
10196,
10197,
10199,
10201,
10224,
10225,
10237,
10238,
10332,
10333,
10508,
10509,
10511,
10513,
10526,
10527,
10550,
10551,
10681,
10682,
10849,
10850,
10910,
10911,
10999,
11000,
11130,
11131,
11450,
11451,
11453,
11455,
11460,
11461,
11469,
11470,
11664,
11665,
11667,
11669,
11670,
11736,
11737,
12142,
12143,
12145,
12147,
12153,
12154,
12174,
12175,
12193,
12194,
12367,
12368,
12454,
12455,
12457,
12459,
12464,
12465,
12473,
12474,
12529,
12530,
12532,
12534,
12535,
12549,
12550,
12603,
12604,
12606,
12608,
12613,
12614,
12632,
12633,
12756,
12757,
12759,
12761,
12766,
12767,
12815,
12816,
12978,
12979,
12995,
12996,
13138,
13139,
13141,
13143,
13156,
13157,
13165,
13166,
13366,
13367,
13369,
13371,
13388,
13389,
13397,
13398,
13475,
13476,
13478,
13480,
13491,
13501,
13502,
13514,
13515,
13593,
13594,
13596,
13598,
13611,
13612,
13651,
13652,
14004,
14005,
14149,
14150,
14152,
14154,
14167,
14172,
14173,
14226,
14227,
14488,
14489,
14958,
14959,
15217,
15218,
15402,
15403,
15405,
15407,
15412,
15413,
15444,
15445,
15480,
15481,
15525,
15526,
15693,
15694,
15696,
15698,
15699,
15714,
15715,
15873,
15874,
16224,
16225,
16330,
16331,
16333,
16335,
16336,
16352,
16353,
16387,
16388,
16390,
16392,
16393,
16399,
16400,
16435
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 16435,
"ccnet_original_nlines": 500,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4099692106246948,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03724446892738342,
"rps_doc_frac_lines_end_with_ellipsis": 0.04391217976808548,
"rps_doc_frac_no_alph_words": 0.19322319328784943,
"rps_doc_frac_unique_words": 0.3443526327610016,
"rps_doc_mean_word_length": 4.362947463989258,
"rps_doc_num_sentences": 210,
"rps_doc_symbol_to_word_ratio": 0.008401010185480118,
"rps_doc_unigram_entropy": 6.004168510437012,
"rps_doc_word_count": 2904,
"rps_doc_frac_chars_dupe_10grams": 0.019889499992132187,
"rps_doc_frac_chars_dupe_5grams": 0.03954223170876503,
"rps_doc_frac_chars_dupe_6grams": 0.033070240169763565,
"rps_doc_frac_chars_dupe_7grams": 0.033070240169763565,
"rps_doc_frac_chars_dupe_8grams": 0.02588791958987713,
"rps_doc_frac_chars_dupe_9grams": 0.019889499992132187,
"rps_doc_frac_chars_top_2gram": 0.004893450066447258,
"rps_doc_frac_chars_top_3gram": 0.006629830226302147,
"rps_doc_frac_chars_top_4gram": 0.0051302299834787846,
"rps_doc_books_importance": -1792.990478515625,
"rps_doc_books_importance_length_correction": -1792.990478515625,
"rps_doc_openwebtext_importance": -1061.271240234375,
"rps_doc_openwebtext_importance_length_correction": -1061.271240234375,
"rps_doc_wikipedia_importance": -719.224365234375,
"rps_doc_wikipedia_importance_length_correction": -719.224365234375
},
"fasttext": {
"dclm": 0.20485621690750122,
"english": 0.9585714936256409,
"fineweb_edu_approx": 1.3614113330841064,
"eai_general_math": 0.1011689305305481,
"eai_open_web_math": 0.23704487085342407,
"eai_web_code": 0.012553690001368523
}
}
|
{
"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": "338.4",
"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": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,984,854,090,764,199,000 |
Q:
Rachel found this rate of change for the scenario represented in the table.A two column table with six rows. The first column is Time in hours, and has the entries, 4, 5, 6, 7, 8. To the left of this column there are arrows from 4 to 5, 5 to 6, 6 to 7, and 7 to 8 all labeled with plus 1. The second column is Juice in cups, and has the entries, 128, 181, 234, 287, 340. To the right of this column there are arrows from 128 to 181, 181 to 234, and 287 to 340 all labeled with plus 53.What can you conclude from her work? Check all that apply.The function is continuous.Time represents the dependent variable. The scenario is represented by a linear function, since the rate of change is constant.As the amount of time continues, there are fewer cups of juice poured per hour. For every additional hour, 53 cups of juice are poured.
Accepted Solution
A:
Answer:The Function is ContinuousThe scenario is represented by a linear function, since the rate of change is constant.For every additional hour, 53 cups of juice are poured.Brainliest Plz
|
{
"url": "https://mingadelcacao.com/general/rachel-found-this-rate-of-change-for-the-scenario-represented-in-the-table-a-two-column-table-with-six-rows-the-first-column-is-time-in-hours-and-has-the-entries-4-5-6-7-8-to-the-left-of-this-column-there-are-arrows-from-4-to-5-5-to-6-6-to",
"source_domain": "mingadelcacao.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "32324",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7SYPC6OLF5GBHG7PJUXJTTLWLJK4XNBN",
"WARC-Concurrent-To": "<urn:uuid:93ead450-37a7-4fa4-a5ab-bfeb313c73a5>",
"WARC-Date": "2024-04-13T20:18:50Z",
"WARC-IP-Address": "104.21.39.167",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NUURR2FPWTCYR2UXTRXTLNBUCPVT7DE2",
"WARC-Record-ID": "<urn:uuid:58fa9778-59ea-4d48-8f41-48a9362aae3f>",
"WARC-Target-URI": "https://mingadelcacao.com/general/rachel-found-this-rate-of-change-for-the-scenario-represented-in-the-table-a-two-column-table-with-six-rows-the-first-column-is-time-in-hours-and-has-the-entries-4-5-6-7-8-to-the-left-of-this-column-there-are-arrows-from-4-to-5-5-to-6-6-to",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c6cd5d45-a114-4db0-8996-4620d3f1db80>"
},
"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-47\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
3,
4,
837,
838,
856,
857,
860
],
"line_end_idx": [
3,
4,
837,
838,
856,
857,
860,
1049
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1049,
"ccnet_original_nlines": 7,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3499999940395355,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012500000186264515,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.28333333134651184,
"rps_doc_frac_unique_words": 0.4427083432674408,
"rps_doc_mean_word_length": 4.244791507720947,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.172785758972168,
"rps_doc_word_count": 192,
"rps_doc_frac_chars_dupe_10grams": 0.14723925292491913,
"rps_doc_frac_chars_dupe_5grams": 0.30674847960472107,
"rps_doc_frac_chars_dupe_6grams": 0.30674847960472107,
"rps_doc_frac_chars_dupe_7grams": 0.30674847960472107,
"rps_doc_frac_chars_dupe_8grams": 0.23312883079051971,
"rps_doc_frac_chars_dupe_9grams": 0.14723925292491913,
"rps_doc_frac_chars_top_2gram": 0.02208589017391205,
"rps_doc_frac_chars_top_3gram": 0.0441717803478241,
"rps_doc_frac_chars_top_4gram": 0.03926379978656769,
"rps_doc_books_importance": -108.46040344238281,
"rps_doc_books_importance_length_correction": -108.46040344238281,
"rps_doc_openwebtext_importance": -64.55439758300781,
"rps_doc_openwebtext_importance_length_correction": -51.877464294433594,
"rps_doc_wikipedia_importance": -57.36803436279297,
"rps_doc_wikipedia_importance_length_correction": -57.36803436279297
},
"fasttext": {
"dclm": 0.24328160285949707,
"english": 0.9416744709014893,
"fineweb_edu_approx": 1.6654984951019287,
"eai_general_math": 0.9983572959899902,
"eai_open_web_math": 0.8226807117462158,
"eai_web_code": 0.9618692398071289
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "510.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-760,023,285,139,394,800 |
Remap Sub-Dir
From DreamHost
(Difference between revisions)
Jump to: navigation, search
m (Categorized)
Line 7: Line 7:
Also, you can't use this area to change the web directory for an '''entire''' domain! To do that, just go to the "edit" link at [https://panel.dreamhost.com/?tree=domain.web "Domains > Web"].
Also, you can't use this area to change the web directory for an '''entire''' domain! To do that, just go to the "edit" link at [https://panel.dreamhost.com/?tree=domain.web "Domains > Web"].
== Parent Article ==
+
[[Category:Account Control Panel]]
* [[KB / Account Control Panel]]
+
+
Revision as of 07:42, 6 February 2006
Use "Domains > Remap Sub-Dir" to make a sub-directory of your domain use a non-standard location in your file system its source for web content.
Normally if you have
http://www.domain.com/ set up with the web directory /home/user/domain.com
then
http://www.domain.com/pictures/ would get its content from /home/user/domain.com/pictures automatically.
This area allows you to override this default setting and use any folder you'd like to provide content for sub-directories of your domain. It's great for sharing your domain among multiple ftp users. Now you could have:
http://www.domain.com/pictures/ get its content from /home/otheruser/images
Be warned, CGI scripts won't work in sub-directories remapped to other user's home directories because of file ownership issues.
Also, you can't use this area to change the web directory for an entire domain! To do that, just go to the "edit" link at "Domains > Web".
Personal tools
|
{
"url": "http://wiki.dreamhost.com/index.php?title=Remap_Sub-Dir&diff=6916&oldid=3244",
"source_domain": "wiki.dreamhost.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "17067",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DT75Q5TM2FJGE2DNK3SAXKE7K7XCBKVD",
"WARC-Concurrent-To": "<urn:uuid:d5092e64-3ec4-4e6c-97c5-0146dde2c856>",
"WARC-Date": "2013-12-11T21:09:54Z",
"WARC-IP-Address": "66.33.195.32",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FSQIOVWMSO37DF733RDN32QLAX2AQWIP",
"WARC-Record-ID": "<urn:uuid:88b05766-f5c2-46f1-8626-6fbc1ddee018>",
"WARC-Target-URI": "http://wiki.dreamhost.com/index.php?title=Remap_Sub-Dir&diff=6916&oldid=3244",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:109aa790-f2e1-450a-96ec-47ceed97e3fd>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 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,
14,
15,
30,
61,
89,
91,
107,
123,
125,
320,
322,
517,
520,
541,
543,
578,
611,
613,
615,
617,
618,
656,
657,
802,
803,
824,
899,
904,
1009,
1229,
1305,
1434,
1435,
1574,
1575
],
"line_end_idx": [
14,
15,
30,
61,
89,
91,
107,
123,
125,
320,
322,
517,
520,
541,
543,
578,
611,
613,
615,
617,
618,
656,
657,
802,
803,
824,
899,
904,
1009,
1229,
1305,
1434,
1435,
1574,
1575,
1589
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1589,
"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.2982005178928375,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005141390021890402,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.311053991317749,
"rps_doc_frac_unique_words": 0.5022026300430298,
"rps_doc_mean_word_length": 5.2466959953308105,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.446553707122803,
"rps_doc_word_count": 227,
"rps_doc_frac_chars_dupe_10grams": 0.3081444203853607,
"rps_doc_frac_chars_dupe_5grams": 0.3081444203853607,
"rps_doc_frac_chars_dupe_6grams": 0.3081444203853607,
"rps_doc_frac_chars_dupe_7grams": 0.3081444203853607,
"rps_doc_frac_chars_dupe_8grams": 0.3081444203853607,
"rps_doc_frac_chars_dupe_9grams": 0.3081444203853607,
"rps_doc_frac_chars_top_2gram": 0.026868179440498352,
"rps_doc_frac_chars_top_3gram": 0.05037783086299896,
"rps_doc_frac_chars_top_4gram": 0.035264480859041214,
"rps_doc_books_importance": -162.5843963623047,
"rps_doc_books_importance_length_correction": -149.16110229492188,
"rps_doc_openwebtext_importance": -101.32685852050781,
"rps_doc_openwebtext_importance_length_correction": -101.32685852050781,
"rps_doc_wikipedia_importance": -103.27677154541016,
"rps_doc_wikipedia_importance_length_correction": -89.49561309814453
},
"fasttext": {
"dclm": 0.034149229526519775,
"english": 0.8672502040863037,
"fineweb_edu_approx": 1.5928723812103271,
"eai_general_math": 0.10841614007949829,
"eai_open_web_math": 0.5638290047645569,
"eai_web_code": 0.0007989999721758068
}
}
|
{
"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": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,351,769,971,714,791,000 |
Disk Arrays
cancel
Showing results for
Search instead for
Did you mean:
Snapshot XP with Oracle ASM disk volumes...issues
SOLVED
Go to solution
Thomas Callahan
Valued Contributor
Snapshot XP with Oracle ASM disk volumes...issues
I'm working on creating snapshots using our XP24000 storage array. I will be snapshotting Oracle ASM volumes. The operating system is RHEL Linux 5.2 64-bit.
Each volume is a 25GB disk, with a single partition. The data stored within is managed by Oracle.
I'm creating the snapshots the usual way, onto a V-Vol with a 2TB pool behind it. The snapshots split correctly, and I can see the data change percentage changing, and I can see the pool space being used.
In my test, I am dd'ing the disk after the snapshot has been taken, (dd if=/dev/urandom of=/dev/sda bs=512 count=20000)
When I go to restore the ASM volume, I would expect to see the partition table recreated by the restore. However, that is not occurring. It's almost like the restore is just not working.
I am positive the snapshot configuration on the XP24000 is correct, and the raid manage commands I am using are correct, as I have performed the same test with an EXT3 filesystem, and I can see the data come back. It just seems that a snapshot restore is not restoring the partition table of the disk.
Does anyone have any experience or tips with this?
Thanks,
Tom Callahan
5 REPLIES
Ivan Ferreira
Honored Contributor
Re: Snapshot XP with Oracle ASM disk volumes...issues
In fact, that should work. Can you give a little more details about your tests, with error messages and the way you try to access your ASM information before/after restore/resync.
Por que hacerlo dificil si es posible hacerlo facil? - Why do it the hard way, when you can do it the easy way?
Thomas Callahan
Valued Contributor
Re: Snapshot XP with Oracle ASM disk volumes...issues
I'm working with an HP tech on this as well, but first thoughts are that because I'm changing the partition table, using a DD, that this may qualify as P-Vol corruption, whereby the snapshot is invalid.
Slightly ridiculous if you ask me, but we'll see I guess.
Our ASM disks have only one partition on them, created with a standard fdisk command. After this is done, I snapshot the volume. Then I dd the disk, effectively wiping out the partition table. Then a "pairresync -restore && pairevtwait" is done, and once status has gone back to pair, I check the disk again. But there is still no partition table.
Nigel Poulton
Respected Contributor
Solution
Re: Snapshot XP with Oracle ASM disk volumes...issues
Long long long shot here (Im no expert on how RHEL and associated file system works......).
Is it possible that the changes made to the partition table have not been flushed to disk (and hence to the COW S-VOL).
Ive worked with COW snapshots on XPs a lot in Windows environments and crazy things like this can happen if you dont take snapshots via the Windows API (VSS) as occasionally the changes are held in local OS cache on the server. Snapping via the API ensures that all filesystem changes etc are flushed to disk to ensure a consistent snap. Slightly different I know, because you are dd'ing the disk after tha snap, but may be the principle is the same - the changes might not have been flushed to the P-VOL and therefore the previous data not been preserved on the COW S-VOL........
May be try a sync or whatever the command is before performing the pairresync.
Just a thought
??
Talk about the XP and EVA @ http://blog.nigelpoulton.com
Thomas Callahan
Valued Contributor
Re: Snapshot XP with Oracle ASM disk volumes...issues
I never even thought about the cache on the OS. I repeated my steps again, with a sync inserted at appropriate times, and low and behold, it works.
Thanks a ton for the insight!!! Appreciated.
Thomas Callahan
Valued Contributor
Re: Snapshot XP with Oracle ASM disk volumes...issues
Closed
|
{
"url": "https://community.hpe.com/t5/Disk-Arrays/Snapshot-XP-with-Oracle-ASM-disk-volumes-issues/td-p/5195724",
"source_domain": "community.hpe.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "226786",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZIOYOX3DJJBGDLIYU5VRYY4Z26WXXHKR",
"WARC-Concurrent-To": "<urn:uuid:c74f1ddd-b9ab-4c8e-a8c6-3ff2df5e3503>",
"WARC-Date": "2017-05-28T01:19:35Z",
"WARC-IP-Address": "208.74.205.44",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NK5E4SKQ5YASHWKQRWHWO4Y23CAZII5K",
"WARC-Record-ID": "<urn:uuid:636425f2-46b9-4435-88d7-4fef834083ba>",
"WARC-Target-URI": "https://community.hpe.com/t5/Disk-Arrays/Snapshot-XP-with-Oracle-ASM-disk-volumes-issues/td-p/5195724",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fd7cb2f5-2dfa-49ec-996c-a987acf8f9ea>"
},
"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,
12,
19,
40,
60,
75,
76,
126,
127,
134,
149,
165,
184,
185,
235,
236,
393,
394,
492,
493,
698,
699,
819,
820,
1007,
1008,
1310,
1311,
1362,
1363,
1371,
1384,
1394,
1408,
1428,
1429,
1483,
1484,
1664,
1776,
1792,
1811,
1812,
1866,
1867,
2070,
2071,
2129,
2130,
2478,
2492,
2514,
2523,
2524,
2578,
2579,
2671,
2672,
2792,
2793,
3374,
3375,
3454,
3455,
3470,
3471,
3474,
3475,
3532,
3548,
3567,
3568,
3622,
3623,
3771,
3772,
3817,
3833,
3852,
3853,
3907,
3908
],
"line_end_idx": [
12,
19,
40,
60,
75,
76,
126,
127,
134,
149,
165,
184,
185,
235,
236,
393,
394,
492,
493,
698,
699,
819,
820,
1007,
1008,
1310,
1311,
1362,
1363,
1371,
1384,
1394,
1408,
1428,
1429,
1483,
1484,
1664,
1776,
1792,
1811,
1812,
1866,
1867,
2070,
2071,
2129,
2130,
2478,
2492,
2514,
2523,
2524,
2578,
2579,
2671,
2672,
2792,
2793,
3374,
3375,
3454,
3455,
3470,
3471,
3474,
3475,
3532,
3548,
3567,
3568,
3622,
3623,
3771,
3772,
3817,
3833,
3852,
3853,
3907,
3908,
3914
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3914,
"ccnet_original_nlines": 81,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38376384973526,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08364084362983704,
"rps_doc_frac_lines_end_with_ellipsis": 0.012195119634270668,
"rps_doc_frac_no_alph_words": 0.15129150450229645,
"rps_doc_frac_unique_words": 0.43288084864616394,
"rps_doc_mean_word_length": 4.615384578704834,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0.013530139811336994,
"rps_doc_unigram_entropy": 5.103827476501465,
"rps_doc_word_count": 663,
"rps_doc_frac_chars_dupe_10grams": 0.07156863063573837,
"rps_doc_frac_chars_dupe_5grams": 0.15000000596046448,
"rps_doc_frac_chars_dupe_6grams": 0.14575162529945374,
"rps_doc_frac_chars_dupe_7grams": 0.13464051485061646,
"rps_doc_frac_chars_dupe_8grams": 0.12156862765550613,
"rps_doc_frac_chars_dupe_9grams": 0.10784313827753067,
"rps_doc_frac_chars_top_2gram": 0.023529410362243652,
"rps_doc_frac_chars_top_3gram": 0.03202613815665245,
"rps_doc_frac_chars_top_4gram": 0.04575163125991821,
"rps_doc_books_importance": -361.90667724609375,
"rps_doc_books_importance_length_correction": -361.90667724609375,
"rps_doc_openwebtext_importance": -200.30003356933594,
"rps_doc_openwebtext_importance_length_correction": -200.30003356933594,
"rps_doc_wikipedia_importance": -157.6939239501953,
"rps_doc_wikipedia_importance_length_correction": -157.6939239501953
},
"fasttext": {
"dclm": 0.08072047680616379,
"english": 0.886935830116272,
"fineweb_edu_approx": 1.3576469421386719,
"eai_general_math": 0.4722074866294861,
"eai_open_web_math": 0.5269904732704163,
"eai_web_code": 0.09795451164245605
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,892,605,566,069,634,000 |
Hacker News new | past | comments | ask | show | jobs | submit login
Clarifying ProtonMail and Huawei (protonmail.com)
210 points by gavingmiller 35 days ago | hide | past | web | favorite | 64 comments
Looks like Bloomberg is doing the same as with the "implant" rumors and Supermicro a few months ago.
Gruber has a very nice disclaimer at the bottom of posts mentioning Bloomberg now:
"Bloomberg, of course, is the publication that published “The Big Hack” last October — a sensational story alleging that data centers of Apple, Amazon, and dozens of other companies were compromised by China’s intelligence services. The story presented no confirmable evidence at all, was vehemently denied by all companies involved, has not been confirmed by a single other publication (despite much effort to do so), and has been largely discredited by one of Bloomberg’s own sources. By all appearances “The Big Hack” was complete bullshit. Yet Bloomberg has issued no correction or retraction, and seemingly hopes we’ll all just forget about it. I say we do not just forget about it. Bloomberg’s institutional credibility is severely damaged, and everything they publish should be treated with skepticism until they retract the story or provide evidence that it was true."
https://daringfireball.net/linked/2019/09/05/gurman-touch-id
As commonly with stories like this, people will see the Bloomberg story and not see the correction issued by ProtonMail. The harm is done, and ProtonMail is likely going to miss out on subscriptions because of Bloomberg's irresponsible publication. This tendency likely holds true even if Bloomberg were publishing the correction themselves, as it has been observed time and time again.
If you apply for a writer's job at Bloomberg or many of these media companies, people will ask you if you have a following on Twitter, Facebook and the like with which you can share content you write so that your employment poses a smaller risk to your new employer than someone with little to no following. That in itself might just make writers statistically more loyal to big tech than really necessary.
I'm still completely astonished by how little attention this got and that Bloomberg has never been forced through public pressure to offer a correction. It's bizarre given how large the story was when it first broke.
Bloomberg is based in a country with secret courts and secret gag orders for electronic surveillance (USA). Is is really that surprising that they have been unable to provide evidence regarding major electronic surveillance efforts?
The irony would be if they were under a gag order not to issue a retraction.
But that's diving down the paranoia rabbit hole.
Thanks for reminding about this. I really don't know why people take Bloomberg seriously after "The Big Hack" article. From my point of view, they lost all credibility and I no longer believe what they write.
SuperMicro didn’t sue Bloomberg. That should be a huge clue about the accuracy of the original article.
I wonder why ProtonMail is getting so much negative press. They are releasing articles like that to clarify "the truth" on a regular base. Even here on HackerNews, there are so many negative voices repeating the same things over and over again. Even and especially those that (seem to) have been rectified by ProtonMail. Usually, the people here seem to be neutral and fact-based, but as soon as ProtonMail is involved many are getting wild.
While I have an inactive account at PM, I'm not involved with them in any way. This is just an observation that I have made over the recent years.
That article does not clarify anything. I want to provide a link. It is nothing but thousands of words saying they aren’t partnering by putting an app in Huawei App Store.
For years companies used to provide all sorts of incentives to put apps in their store. It benefits them highly.
This is ridiculous: https://protonmail.com/blog/clarifying-protonmail-and-huawei...
> For years companies used to provide all sorts of incentives to put apps in their store. It benefits them highly.
Are you implying that Huawei is paying ProtonMail so that they put their app in the Huawei AppGallery? Can you provide any proof?
As if I needed more evidence that Bloomberg is below 0 on the credibility scale. They are officially a tabloid to me now.
I still find it useful to read mainstream media, even 'free' publications like Metro and the Evening Standard in London. What I do is not read them for news per se, but a sort of high level scan of what the publication's bias is. What narratives are being pushed? How has the publication ordered, or prominently displayed articles? What news is completely omitted?
For example, no mainstream media outlet in the UK covers Al Quds day in London (absolutely nothing about this on the BBC or print media). Facts on the ground at the most recent (and previous) marches is that there is a lot of Hezbollah flags flown.
Another example is the BBC’s treatment of Brexit on three flagship panel shows, Question Time, Politics Live and Any Questions where Remain commentators outnumber Brexit commentators 3 to 1.
In this instance, Bloomberg seems to be wanting to push the 'Huawei is spying on you' narrative as well as 'Proton Mail isn't secure' narrative.
Make what you will of the points above, maybe they mean something, maybe they don't. I just keep an open mind, try to think for myself, see things from different perspectives, and do my best not to fall for my own cognitive biases.
I still use Proton Mail, and I trust their service more than GMail (I migrated from GMail to Proton Mail), but it's a nice reminder not to trust any corporation too much or get complacent with security. I really don't feel like rolling my own encrypted email solution so the question is, "Who am I willing to trust the solution to?" Ultimately I'm accountable to myself.
As for media bias, sometimes it is blatant, most times however I find it subtle. Either way it is pervasive. Unless you are scanning for it, I imagine it is incredibly easy not to think for yourself.
> Al Quds day in London
From what I can tell, the March on this day tends to attract less than 500 people. So lack of coverage is not a indication of BBC bias.
Regarding Brexit, Question Time seems to have Nigel Farrage on all the time, despite his lack of electoral success.
Still, I decide to take a look at last week's panel for you. And here is what I found:
Kwasi Kwarteng - Pro Brexit
Emily Thornberry - Remain
Layla Moran - Remain
Ian Blackford - Remain
Iain Dale - Pro Brexit
Richard Tice - Pro Bexit
No huge anti-Brexit bias in evidence.
Well Al Quds day might be perceived as news worthy due to Hezbollah being officially considered a terrorist organisation by the United Kingdom along with the United States, the European Union, the Arab League, the Gulf Cooperation Council, Israel, Canada, the Netherlands, Australia to name a few.
Considering London has suffered from multiple ideologically possessed terror attacks it might be worth reconsidering how newsworthy open support of a terrorist organisation is.
Additionally, the Jewish community in London are particularly sensitive to the march as Al Quds day brings about hate speech towards them.
I'm not saying Al Quds day should be banned in London, but I think a public dialogue and debate should be had. In my estimation the lack of it is due to the 'multiculturalism is our strength' narrative bias held at the BBC.
Now I'm not saying 'multiculturalism is bad', I'm the product of it, and I definitely think it has benefits. But there are problems with it, which need to be confronted and worked through for a better society. Without a doubt these are sensitive, and ugly issues, but pretending they don't exist because you are captured by bias, will not solve the issues.
As for your Brexit comment, I believe you are suffering from recency bias.
In a report published in January 2018 called ‘Brussels Broadcasting Corporation?’, think-tank Civitas in conjunction with the group News-watch, monitored thousands of hours of radio and TV shows dating back to 1999 including the BBC flagship Radio 4 programme Today.
Of 4,275 guests on Today between 2005 and 2015 who talked about the EU, only 132 were Brexiteers.
Put another way, just 3.2% of Today interviewees were anti-EU, despite consistent public support for EU withdrawal throughout this time.
There are also a plethora of articles about this on Google, so in a way you are kind of proving my point because the data is out there but you didn't want to, or think to, look for it.
However I'm far less concerned about being 'right' and far more concerned about dealing with reality... and I believe the more people that deal with reality there are the better the world will be.
I sympathise with the BBC as it must be hard finding people who are both articulate enough to appear and coherent when defending Brexit.
It's a valid point, although probably not in the way the young man intends it.
In the interest of remaining fair and balanced, media ultimately has to appear biased, if the supporters of the issue are... unbalanced in appeal.
I think this is less of an issue with Brexit, as one can make a cogent argument for Leave (although that doesn't seem to be the popular argument).
But for something like chemtrails? How could you possibly hold a "debate" that a believer couldn't look at and say "You're just biased against my side?"
> Facts on the ground at the most recent (...) marches is that there is a lot of Hezbollah flags flown.
[citation needed]. Flying the Hezbollah flag was made illegal by the British Parliament in March, ahead of the most recent march: https://www.algemeiner.com/2019/05/28/flying-the-hezbollah-f...
Thanks, I totally missed this piece of news and have fallen to bias myself! I gave up monitoring Al Quds day in 2018 after making a complaint to the BBC that got a boilerplate response. I just don't have the time or the resources to do anything about it.
The open support for Hezbollah was there in 2018 and in previous years... but from 2019 the reports I've read, it seems like the police enforced the new law. I would need to make a freedom of information request with the police to see if there were any arrests to verify this.
At the risk of making myself a punching-bag for downvoting, here.
Bloomberg is a source that investors and traders trust with getting them some level of access to the rumour mill (in the spirit of the saying that exists among traders that goes "buy the rumour, sell the news"). The problem here is that, fact or fiction, rumours affect the financial markets, and not knowing about them puts a market participant at a disadvantage.
The article starts by saying in indicative mood "ProtonMail is in talks with Huawei Technologies Co. about including its encrypted email service in future mobile devices [...]" ...I don't really see a problem with that part of the statement since they were indeed in talks of some kind, and there's a certain bandwidth of what "including" could mean. It could just mean "making available through Huawei AppGallery", so there is nothing wrong with using indicative mood here.
In the second paragraph, the article switches the modality and says "The Swiss company’s service COULD come preloaded ..." Now, it could of course be the case, as people are alleging, that they just completely made that shit up and MANUFACTURED a rumour. But it could also be the case that they were reflecting a rumour that was already out there and sufficiently widespread that they thought that investors and traders should know about it. They used subjunctive mood using the auxiliary verb COULD to signal that there was something going on here about the modality of the statement.
ProtonMail speculated that a misunderstanding of their earlier announcement must have been the basis of Bloomberg's article. But I guess we'll never find out if that was indeed so.
ProtonMail clarified their earlier announcement and took issue with the word "partnership" being used to describe their relationship with Huawei, but, interestingly, they did not come flat out to respond to these assertions. For example, they did not say that preloading was not a topic that was discussed.
Now, it stands to reason that preloading would amount to Huawei handing a huge chunk of marketshare to ProtonMail, and then it's up to users to make up their minds about the likelihood of Huawei asking for quid-pro-quo and ProtonMail's response.
Rather than there being no basis at all for the Bloomberg article, another scenario could be that ProtonMail saw that making-up-of-minds play out on social media in response to the Bloomberg article and decided to do a one-eighty on that as a result.
...I guess we'll never know.
It's inconceivable that a manufacturer would preload an app without some kind of discussion of the app's content, and I think it's reasonable to be afraid of even a non-explicit quid pro quo from Huawei. If ProtonMail-on-Huawei is using so much as a new logging library because Huawei said the old one is insecure, I want to know about that.
upvote for citing indicative and subjunctive.
It's a recurring theme: Media outlets publish whatever they 'want' to believe with little due diligence and the product makers have to scramble to put up clarifiers.
Media outlets certainly do that, but can't product makers sue them for damages, when they publish false information that can tank a stock or kill a company's sales?
Usually not. To prove libel you have to prove: 1. the information is false, 2. The speaker knew it was false, 3. The speaker spread the false information with the intent to harm the plantiff. Without all three it isn't libel in the US.
I'd me more interested in their clarification on NordVPN, ProtonMail/VPN and the data gathering agency Tesonet.
Do you have a link?
The best way to learn about the incident is to read the discussions first-hand from the Hacker News, for example, by searching "inurl:ycombinator protonvpn tesonet". There is no point in reading any journalistic articles if you can read Proton's responses here, except one article [0] - a compilation of changing Proton's responses and them successively admitting more and more things not in their favor. The compilation starts at the part called "Online accusations fly".
[0] https://restoreprivacy.com/lawsuit-names-nordvpn-tesonet/
If protonmail keeps changing their story like that, it seems pretty damning for their credibility.
This particular "story" was also another hit piece from anonymous "sources". We previously responded here: https://www.reddit.com/r/ProtonVPN/comments/8ww4h2/protonvpn...
But you don't have to just take our word on it. ProtonVPN in particularly has been heavily scrutinized, by both Mozilla (who we partnered with) and also the European Commission (which is providing funding): https://protonvpn.com/blog/is-protonvpn-trustworthy/
In other words, there are plenty of non-anonymous, legitimate third party sources, who have checked things out and confirmed the story is bogus.
One main allegation was that Proton shares an address with another company, but it fails to mention that our office in Vilnius is in a 30 story office building with hundreds of other companies: https://www.instagram.com/p/BxMz62oHb6K/
Does an F-Droid release mean Proton will finally remove their GSF dependencies?
That is indeed the plan, although there may be issues with battery life that we need to resolve first.
I'd like to point out one thing. The people at ProtonMail are clearly under the belief that they are only subject to Swiss law because they are located in Switzerland. That's not my understanding of the law at all. Granted, it seems like an obvious conclusion but legally the truth seems to be different.
For instance, at my employer we had training on the GDPR rules and how they relate to us. We are a US based company with many global clients. However, we do have a physical presence in some EU countries so that does differ with the ProtonMail situation. However, in our training we were told that our business presence in the EU is irrelevant to the actual law because we would still be bound by it as it relates to our global clients. The layman's explanation we were given was that if you are using the internet to conduct digital business across country borders then you are pretty much subject to the laws of both nations between the client and the service provider.
That generally translates to defaulting to whichever law is more restrictive. For companies like Facebook and Google, they've rolled out GDPR style protections for everyone globally because it's much easier to do so than to only have it apply to a portion of their users, but that's a separate story.
I think everyone intuitively understands and knows this to be true. We can all think of cases where hackers have committed crimes that may only violate, for example, US laws and have been tried and convicted of such crimes even though they were committed overseas but the aggrieved party is the US or its citizens.
I think what ProtonMail is really saying is that because Switzerland doesn't have laws similar to China in this regard, China won't be able to convince Switzerland to extradite them to China for prosecution.
That's also why Russia threatened to ban them - because they know there is zero chance they will be willingly handed over to Russian authorities for this.
Not all countries handle international law violations the same. ProtonMail makes this clear in the above explanation - other foreign countries are welcome to make claims, but they must do so under Swiss law and Swiss courts. Swiss law, afaik, does not allow the Russians to simply claim all user records.
> The people at ProtonMail are clearly under the belief that they are only subject to Swiss law because they are located in Switzerland.
What led you to believe this is so clear?
These excerpts taken together:
1) "As a Swiss company, when it comes to the data of Proton users, we will only comply with the laws of Switzerland, the jurisdiction of our headquarters and where all of our servers are located. As we have always consistently stated in our terms and conditions and privacy policy, any requests which fall outside of Swiss law will be politely refused"
2) "Proton does not have offices, employees, subsidiaries, or any permanent establishments in China or Russia, and as such, we do not fall under the scope of these laws, nor can these laws be enforced against us. However, this does not mean authorities in these countries would not try to enforce the laws anyways."
It's actually a bit more nuanced. Any government in any country can at any time decide that their laws apply to you (because hey, it's a government, they can do whatever they want). However, unless you are operating in that country, there is very little they can do in terms of enforcing that upon you.
Yes, that's the point I was trying to make - your country would have to be willing to participate. That's risky, albeit to varying degrees, depending on the country a person/business reside in because governments can change their opinion at any moment or enter in new agreements to combat whatever they may deem as "global crime".
Well that's kind of dramatically different than how the press is portraying it.
I was a gmail user a few months ago and I switched my entire life over to protonmail because I didn't want to contribute to Google. I would have to say the most frustrating part of the switch is the somewhat perplexed look I get from people when they ask why I don't have gmail, they have to learn to spell proton, fascinating. I would imagine we will see quite a few hit pieces against protonmail in the coming years, and likely other email providers as more and more people make the switch to a service that markets privacy.
You can give [email protected] instead of [email protected]
Yes, but first you have to activate it in the protonmail settings.
Are email addresses on private domains not a thing where you're from?
I don't understand why people ever believed Protonmail's privacy claims to begin with? Not that I have reason to doubt them either, but their security seems nothing more than an unverified promise? I'm skeptical of my privacy protection coming from small companies that could easily be bought outright by governmental or political groups.
By posting this you're practically caving to the mass media. In the long term, it's best for everybody that you ignore them. Never pay the ransom or they will become more powerful.
What are you talking about? Did you even read the article?
This article sounds like suspicious excuse, really. I don't wan't to touch any device/service affiliated with Huawei/Chinese intelligence.
Is there any good&reputable replacement for ProtonMail?
Why was protonmail ever considered good or reputable?
ProtonMail does not support Yubikeys. I would like to ask all of HN to think seriously about this and what this means. ProtonMail does many things exactly right. This 1 oversight suggests something very very scary going on at the organization.
HN does not allow you to delete comments. I would ask that if you think that not having Yubikeys does not require a significant and immediate answer from the ProtonMail team, to sign your name (I will) at the bottom of your response. If you can’t do that, perhaps provide a burner email address.
Dan Ehrlich
[email protected]
CISSP, CCSP, CISM
EDIT: spacing between my signature, change of comment to commentS
Can you elaborate why not supporting Yubikeys (yet) "suggests something very very scary going on at the organization"?
Yubikeys are one of the few forms of 2FA that are highly resilient to being phished. Google has not only an option to restrict SMS 2FA, but an additional one below to restrict “all 2FA options except security keys” in GSuite.
It has been known for some time that TOTP 6 digit codes are easy to intercept. SMS Codes can also be intercepted, or gained via SSB7 vulns/ SIM jacking. This made things like Google Authenticator or Authy more resilient but certainly still quite vulnerable.
To intercept and exploit MFA in ProtonMail would absolutely trivial for a skilled single person to do. DNS poisoning + this github library would be all you needed: https://github.com/kgretzky/evilginx2
EDIT: replaced quotemark with asterisk
That does not really answer my question. Why does missing support for Yubikeys "suggest [that] something very very scary going on at the organization"? Supporting Yubikeys is probably already in their list of planned features. But ProtonMail is a relatively small company and the user base requesting that feature might be relatively small. Yes, security is one of their top-most priorities but so is earning money. The latter requires a large paying audience where other features might be more important.
It’s such an oversight that to quote someone from early 20th century ... “is this stupidity or is this treason”.
Not doing this was a deliberate choice. The benefits of implementing it outweigh at maybe a dozen orders of magnitude not implementing it.
The very scary thing btw is simple. They were bribed the same way the WordPress Core Contributors have been for years. Let me discuss this quickly, and I’m happy to name names in a separate posting (Gary Pendergast out of Australia is going to jail though along with another America dev). That being said please review this discussion where several core contributors admit to not even reading an extremely important path from arguably one of the best PHP developers in the world (certainly in terms of security): https://core.trac.wordpress.org/ticket/39309
you're getting no traction with your argument because you're grossly overreaching with it.
not having yubikey support is obviously not "very very scary" since most people (even on hn) don't have yubikeys and we don't run around with our tails between our legs.
many reasons can lead to not supporting yubikey yet, including the simplest, which is that it's lower on the priority list for a resource-constrained organization. or another likely explanation: yubikey has unsolved ux issues that keep it a niche product (for now), so demand simply isn't there.
this seems to be an important issue for you, so if you want to effect change, then you need to come across as well-reasoned, not fud-filled. (edit: and don't let perfect be the enemy of good.)
I'd prefer to see them spending time on polishing their mobile app, which lacks in UX in important areas. For instance offline access to received, but yet unopened emails simply doesn't work. There is a (mis)feature where email bodies are downloaded only on notification, but in my case emails remain unavailable offline and Protonmail support was unhelpful.
But even if email-via-notification worked, it is still pretty much unusable. My usecase is to get to wifi, download emails and get offline, but with Proton mail I'd have to be super careful not to have my app open when enabling connection to wifi, otherwise it instantly downloads all headers and shows no notification, because app is in a foreground, after that there is simply no way to download message bodies other than opening them one by one in all folders. Surprisingly support saw not problem with this UX either.
This comment comes across as particularly callous. They are saying a part of why they may support the Huawei app store is to continue to provide access to the app to those in developing countries, and your response is to say you'd prefer them spend time on your personal UX pet peeve...
I don't use ProtonMail but this seems like a fairly fundamental issue rather than a personal pet peeve. In my naivety, it also seems like the kind of issue that would cause considerable pain in developing countries who might likely have spotty internet connections, which would lead them straight into said issue.
So whilst it might have been meant callously, from my third party glance it seems quite important.
It is personal in a sense that it is a personal experience and I am unsatisfied customer because of that. Offline access is pretty fundamental feature and it is utterly broken, when I see that they are going to spend company limited resources on a goal which doesn't benefit me as a customer, of course I am questioning whether their interests are aligned with mine.
FWIW, offline access is even more important in developing countries, yet devs living in Switzerland and clearly having no probem with their 4G coverage are failing to realise that.
As a counter, I wouldn't prefer that — yes, there are UX improvements to be made to both the app and the Web UI, but I think multiple distributions channels are welcome.
Ideally, pushing the APK to multiple distribution channels is mostly a one-time job to integrate with their build and deploy pipelines and then it's relatively business-as-usual, so I would imagine it won't take away a lot from development effort in other places once up & running.
As a non-Google Play user, I'm installing via Aptoide (a platform I don't _really_ trust yet) and relying on signatures to validate that the package is valid. Any moves by ProtonMail to offer '1st party' distributions (e.g. F-Droid) is really welcome.
I'd prefer WireGuard support.
But I guess there just is not enough demand for that.
You'd prefer WireGuard support in an email service? What do you mean by that?
For ProtonVPN. Same company. Statement made on the assumption that resources spend on ProtonMail can be spend on ProtonVPN (which I admit is a stretch).
Given how simple WireGuard is to set up I don't understand why they don't support it. Their UI etc, sure. Then just make it alpha or beta or whatever. I'd happily test it. Give feedback, etc.
Meanwhile, I paid for a 2 year sub and barely use it because of this reason. Instead, I run a WireGuard VPN _to_ my home cable connection.
OK for ProtonVPN I am less confused about where your request is coming from. But I still don't see why your ProtonVPN subscription is totally useless to you because of no WG.
Your WG tunnel to your home is nice for accessing home stuff from outside, and for protecting your use of the coffee shop wifi, but it isn't anonymizing your traffic to your home ISP or to websites you use, which is a big reason for using a VPN product.
Yes I can use it but performance is terrible. High latency and low throughput. I was under the impression they would support WireGuard soon. I will switch to a VPN provider with WireGuard support. I have various use cases, and yes one is indeed related to copyright infringement.
Guidelines | FAQ | Support | API | Security | Lists | Bookmarklet | Legal | Apply to YC | Contact
Search:
|
{
"url": "https://news.ycombinator.com/item?id=20914585",
"source_domain": "news.ycombinator.com",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "100547",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2LDHLVH5VCETD2T7IIKR3P6EIQPMQ4TV",
"WARC-Concurrent-To": "<urn:uuid:a7f3cfa9-5ddd-4894-8873-875d05979d4d>",
"WARC-Date": "2019-10-14T14:12:53Z",
"WARC-IP-Address": "209.216.230.240",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WQWVRYZFTKUOPQBPXQF52ZYVI2TD2ACN",
"WARC-Record-ID": "<urn:uuid:1cb524f8-87e3-4167-956c-905cc54f1197>",
"WARC-Target-URI": "https://news.ycombinator.com/item?id=20914585",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7f61fbd6-fdbf-4219-958d-91bb3bfda727>"
},
"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-144.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,
69,
119,
203,
204,
205,
206,
307,
308,
391,
392,
1269,
1270,
1331,
1332,
1333,
1720,
1721,
2128,
2129,
2130,
2347,
2348,
2349,
2582,
2583,
2584,
2661,
2662,
2711,
2712,
2713,
2922,
2923,
2924,
3028,
3029,
3030,
3472,
3473,
3620,
3621,
3622,
3794,
3795,
3908,
3909,
3993,
3994,
3995,
4110,
4111,
4241,
4242,
4243,
4365,
4366,
4367,
4732,
4733,
4982,
4983,
5174,
5175,
5320,
5321,
5553,
5554,
5925,
5926,
6126,
6127,
6128,
6152,
6153,
6289,
6290,
6406,
6407,
6494,
6495,
6523,
6524,
6550,
6551,
6572,
6573,
6596,
6597,
6620,
6621,
6646,
6647,
6685,
6686,
6687,
6985,
6986,
7163,
7164,
7303,
7304,
7528,
7529,
7886,
7887,
7962,
7963,
8230,
8231,
8329,
8330,
8467,
8468,
8653,
8654,
8851,
8852,
8853,
8990,
8991,
8992,
8993,
9072,
9073,
9220,
9221,
9368,
9369,
9522,
9523,
9524,
9628,
9629,
9823,
9824,
9825,
10080,
10081,
10358,
10359,
10360,
10426,
10427,
10792,
10793,
11268,
11269,
11855,
11856,
12037,
12038,
12345,
12346,
12592,
12593,
12844,
12845,
12874,
12875,
12876,
13218,
13219,
13220,
13266,
13267,
13268,
13434,
13435,
13436,
13601,
13602,
13603,
13839,
13840,
13841,
13953,
13954,
13955,
13975,
13976,
13977,
14450,
14451,
14513,
14514,
14515,
14614,
14615,
14616,
14787,
14788,
15048,
15049,
15194,
15195,
15430,
15431,
15432,
15512,
15513,
15514,
15617,
15618,
15619,
15924,
15925,
16596,
16597,
16898,
16899,
17214,
17215,
17423,
17424,
17579,
17580,
17581,
17886,
17887,
17888,
18025,
18026,
18068,
18069,
18070,
18101,
18102,
18455,
18456,
18772,
18773,
18774,
19077,
19078,
19079,
19410,
19411,
19412,
19492,
19493,
19494,
20021,
20022,
20023,
20084,
20085,
20086,
20153,
20154,
20155,
20225,
20226,
20227,
20566,
20567,
20568,
20749,
20750,
20751,
20810,
20811,
20812,
20951,
20952,
21008,
21009,
21010,
21064,
21065,
21066,
21310,
21311,
21607,
21608,
21620,
21621,
21643,
21644,
21662,
21663,
21729,
21730,
21731,
21850,
21851,
21852,
22078,
22079,
22337,
22338,
22540,
22541,
22580,
22581,
22582,
23088,
23089,
23090,
23203,
23204,
23343,
23344,
23902,
23903,
23904,
23995,
23996,
24166,
24167,
24463,
24464,
24657,
24658,
24659,
25018,
25019,
25541,
25542,
25543,
25830,
25831,
25832,
26146,
26147,
26246,
26247,
26248,
26615,
26616,
26797,
26798,
26799,
26969,
26970,
27252,
27253,
27505,
27506,
27507,
27537,
27538,
27592,
27593,
27594,
27672,
27673,
27674,
27827,
27828,
28020,
28021,
28160,
28161,
28162,
28337,
28338,
28592,
28593,
28594,
28874,
28875,
28876,
28877,
28878,
28976,
28977
],
"line_end_idx": [
69,
119,
203,
204,
205,
206,
307,
308,
391,
392,
1269,
1270,
1331,
1332,
1333,
1720,
1721,
2128,
2129,
2130,
2347,
2348,
2349,
2582,
2583,
2584,
2661,
2662,
2711,
2712,
2713,
2922,
2923,
2924,
3028,
3029,
3030,
3472,
3473,
3620,
3621,
3622,
3794,
3795,
3908,
3909,
3993,
3994,
3995,
4110,
4111,
4241,
4242,
4243,
4365,
4366,
4367,
4732,
4733,
4982,
4983,
5174,
5175,
5320,
5321,
5553,
5554,
5925,
5926,
6126,
6127,
6128,
6152,
6153,
6289,
6290,
6406,
6407,
6494,
6495,
6523,
6524,
6550,
6551,
6572,
6573,
6596,
6597,
6620,
6621,
6646,
6647,
6685,
6686,
6687,
6985,
6986,
7163,
7164,
7303,
7304,
7528,
7529,
7886,
7887,
7962,
7963,
8230,
8231,
8329,
8330,
8467,
8468,
8653,
8654,
8851,
8852,
8853,
8990,
8991,
8992,
8993,
9072,
9073,
9220,
9221,
9368,
9369,
9522,
9523,
9524,
9628,
9629,
9823,
9824,
9825,
10080,
10081,
10358,
10359,
10360,
10426,
10427,
10792,
10793,
11268,
11269,
11855,
11856,
12037,
12038,
12345,
12346,
12592,
12593,
12844,
12845,
12874,
12875,
12876,
13218,
13219,
13220,
13266,
13267,
13268,
13434,
13435,
13436,
13601,
13602,
13603,
13839,
13840,
13841,
13953,
13954,
13955,
13975,
13976,
13977,
14450,
14451,
14513,
14514,
14515,
14614,
14615,
14616,
14787,
14788,
15048,
15049,
15194,
15195,
15430,
15431,
15432,
15512,
15513,
15514,
15617,
15618,
15619,
15924,
15925,
16596,
16597,
16898,
16899,
17214,
17215,
17423,
17424,
17579,
17580,
17581,
17886,
17887,
17888,
18025,
18026,
18068,
18069,
18070,
18101,
18102,
18455,
18456,
18772,
18773,
18774,
19077,
19078,
19079,
19410,
19411,
19412,
19492,
19493,
19494,
20021,
20022,
20023,
20084,
20085,
20086,
20153,
20154,
20155,
20225,
20226,
20227,
20566,
20567,
20568,
20749,
20750,
20751,
20810,
20811,
20812,
20951,
20952,
21008,
21009,
21010,
21064,
21065,
21066,
21310,
21311,
21607,
21608,
21620,
21621,
21643,
21644,
21662,
21663,
21729,
21730,
21731,
21850,
21851,
21852,
22078,
22079,
22337,
22338,
22540,
22541,
22580,
22581,
22582,
23088,
23089,
23090,
23203,
23204,
23343,
23344,
23902,
23903,
23904,
23995,
23996,
24166,
24167,
24463,
24464,
24657,
24658,
24659,
25018,
25019,
25541,
25542,
25543,
25830,
25831,
25832,
26146,
26147,
26246,
26247,
26248,
26615,
26616,
26797,
26798,
26799,
26969,
26970,
27252,
27253,
27505,
27506,
27507,
27537,
27538,
27592,
27593,
27594,
27672,
27673,
27674,
27827,
27828,
28020,
28021,
28160,
28161,
28162,
28337,
28338,
28592,
28593,
28594,
28874,
28875,
28876,
28877,
28878,
28976,
28977,
28984
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 28984,
"ccnet_original_nlines": 366,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4617888927459717,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026387939229607582,
"rps_doc_frac_lines_end_with_ellipsis": 0.010899179615080357,
"rps_doc_frac_no_alph_words": 0.14633309841156006,
"rps_doc_frac_unique_words": 0.30139264464378357,
"rps_doc_mean_word_length": 4.789233207702637,
"rps_doc_num_sentences": 279,
"rps_doc_symbol_to_word_ratio": 0.002227549906820059,
"rps_doc_unigram_entropy": 6.190715312957764,
"rps_doc_word_count": 4811,
"rps_doc_frac_chars_dupe_10grams": 0.026127340272068977,
"rps_doc_frac_chars_dupe_5grams": 0.032290268689394,
"rps_doc_frac_chars_dupe_6grams": 0.030814630910754204,
"rps_doc_frac_chars_dupe_7grams": 0.030814630910754204,
"rps_doc_frac_chars_dupe_8grams": 0.030814630910754204,
"rps_doc_frac_chars_dupe_9grams": 0.028123779222369194,
"rps_doc_frac_chars_top_2gram": 0.002821059897542,
"rps_doc_frac_chars_top_3gram": 0.0023436499759554863,
"rps_doc_frac_chars_top_4gram": 0.0014322299975901842,
"rps_doc_books_importance": -2824.846923828125,
"rps_doc_books_importance_length_correction": -2824.846923828125,
"rps_doc_openwebtext_importance": -1662.8056640625,
"rps_doc_openwebtext_importance_length_correction": -1662.8056640625,
"rps_doc_wikipedia_importance": -1370.982177734375,
"rps_doc_wikipedia_importance_length_correction": -1370.982177734375
},
"fasttext": {
"dclm": 0.41001927852630615,
"english": 0.971950888633728,
"fineweb_edu_approx": 1.2740265130996704,
"eai_general_math": 0.18903058767318726,
"eai_open_web_math": 0.2060580849647522,
"eai_web_code": 0.09413058310747147
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.8",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "303.483",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social sciences — Dictionaries"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,332,935,843,488,519,000 |
WordPress как на ладони
Недорогой хостинг для сайтов на WordPress: wordpress.jino.ru
register_sidebar() WP 2.2
Регистрирует панель виджетов (место, куда размещаются виджеты в админ-панели, чтобы потом вывести их в лицевой части).
register_sidebar() регистрирует панель (место, контейнер) для виждетов и формат вывода для каждого виджета: html тег заголовка, html тег до и после виджета. Зарегистрировав панель, в админ-панели появится место, куда можно помещать виджеты. Разместив виджеты в панели, мы сможем вывести панель с виджетами в шаблоне с помощью функции dynamic_sidebar(), (см. пример 2).
Функцию нужно подключать к событию widgets_init.
Функция поддержки виджетов: add_theme_support('widgets') должна быть активирована для темы, в functions.php. Если этого нет, то register_sidebar() активирует её автоматически.
Не используйте названия идентификаторов для параметра ID из этого списка. Там же, по ссылке, вы найдете небольшую функцию, которая собирает уже используемые ID в WordPress.
Используйте register_sidebars(), чтобы создать несколько панелей за раз. Это позволит создать уникальное имя для каждой панели, например: "Правый сайдбар", "Левый сайдбар". Несмотря на то, что эти названия видны только в админ-панели, важно дать пользователю представление о том где будет выводиться панель.
register_sidebars() также рекомендуется использовать, если нужно зарегистрировать несколько однотипных панелей для виждетов (названия отличаются числами), например: Панель 1, Панель 2, Панель 3.
Дефолтные значения параметров before/after рассчитаны на темы, которые создают боковые панели в виде LI списка с заголовками в H2 теге. Такая регистрация рекомендуется разработчиками WordPress для всех тем.
Если по каким-то причинам, маркировку нужно изменить, рекомендуется скопировать id (id="%1$s") и class (class="widget %2$s") атрибуты как указано по умолчанию и не указывать их жестко. Нужно это, чтобы они создавались динамически с помощью функции sprintf().
Нельзя оставлять параметры name и id пустыми!
Их можно либо не указывать вообще, либо обязательно указать при этом, нужно чтобы они были уникальными и не пустыми.
Если не определить id или name, то для них будут использованы значения по умолчанию с инкрементом:
'name' => sprintf(__('Sidebar %d'), $i ),
'id' => "sidebar-$i",
Где $i будет числом равным кол-ву панелей на сайте + 1.
Является основой для: register_sidebars()
Хуки из функции
Возвращает
Строку. Идентификатор переданный в параметре ID.
Шаблон использования
add_action( 'widgets_init', 'register_my_widgets' );
function register_my_widgets(){
register_sidebar( array(
'name' => sprintf(__('Sidebar %d'), $i ),
'id' => "sidebar-$i",
'description' => '',
'class' => '',
'before_widget' => '<li id="%1$s" class="widget %2$s">',
'after_widget' => "</li>\n",
'before_title' => '<h2 class="widgettitle">',
'after_title' => "</h2>\n",
) );
}
Использование
register_sidebar( $args );
$args(строка/массив)
Аргументы для регистрации панели виджетов. Можно указывать в виде строки или массива:
Если в виде строки, тогда аргументы нужно разделять знаком &:
'name=Sidebar&id=my_prefix_sidebar'
Те же аргументы в массиве:
array(
'name' => 'Sidebar',
'id' => 'my_prefix_sidebar',
)
По умолчанию: параметры по умолчанию.
Аргументы параметра $args
name(строка)
Название панели виджетов. Название будет видно в админ-панели WordPress. По умолчанию "Боковая колонка 1" (локализация от Sidebar $i, где $i порядковый номер сайдбара). Значение не должно быть пустым!
По умолчанию: sprintf(__('Sidebar %d'), $i )
id(строка)
Идентификатор виджета. Строка, в которой не должно быть заглавных букв и пробелов. Значение не должно быть пустым, если оставить этот параметр пустым, то в режиме разработки (при дебаге) получите заметку типа E_USER_NOTICE.
По умолчанию: "sidebar-$i"
description(строка)
Текст описывающий где будет выводиться панель виджетов. Показывается в панели управления виджетами.
По умолчанию: ''
class(строка)
CSS класс, который будет добавлен главному HTML тегу панели виджетов.
По умолчанию: ''
before_widget(строка)
HTML код, который будет расположен перед каждым виджетом в панели. Например: <li class="my-widget">. Конструкции %1$s и %2$s будут заменены на id и class используемого в сайдбаре виджета.
По умолчанию: '<li id="%1$s" class="widget %2$s">'
after_widget(строка)
HTML код, который будет расположен после каждого виджета в панели. Например: </li>.
По умолчанию: "</li>\n"
before_title(строка)
HTML код перед заголовком виджета.
По умолчанию: '<h2 class="widgettitle">'
after_title(строка)
HTML код после заголовка виджета.
По умолчанию: "</h2>\n"
Основное назначение этих аргументов, указать подходящие для темы теги оборачивающие каждый виджет и его заголовок. В WordPress принято оборачивать виджет в li тег, а заголовок виджета в тег h2.
Примеры
#1 Регистрация виджетов для боковой панели сайта
Код ниже, зарегистрирует панель под названием "Правая боковая панель сайта". Название панели будет обвёрнуто в теги <div class="title"> и </div>:
function register_my_widgets(){
register_sidebar( array(
'name' => "Правая боковая панель сайта",
'id' => 'right-sidebar',
'description' => 'Эти виджеты будут показаны в правой колонке сайта',
'before_title' => '<h2>',
'after_title' => '</h2>'
) );
}
add_action( 'widgets_init', 'register_my_widgets' );
После того, как мы разместим этот код в файл темы functions.php, в админ-панели на странице виджетов, появится панель, куда мы сможем добавить виджеты. В шаблоне эта панель выводится с помощью функции dynamic_sidebar():
<?php
if ( function_exists('dynamic_sidebar') )
dynamic_sidebar('right-sidebar');
?>
#2 Зарегистрируем панель виджетов для главной страницы сайта
Добавим код в functions.php:
function register_my_widgets(){
register_sidebar( array(
'name' => 'Боковая панель на главной странице',
'id' => 'homepage-sidebar',
'description' => 'Выводиться как боковая панель только на главной странице сайта.',
'before_widget' => '<li class="homepage-widget-block">',
'after_widget' => '</li>',
'before_title' => '<h2 class="widgettitle">',
'after_title' => '</h2>',
) );
}
add_action( 'widgets_init', 'register_my_widgets' );
В файл home.php вставим вывод панели:
<div class="custom">
<?php
if ( function_exists('dynamic_sidebar') )
dynamic_sidebar('homepage-sidebar');
?>
</div>
Вы можете купить недорогие репины в Пинтерест с помощью сервиса Doctor SMM. На сайте Вам будет предложен выбор любого необходимого количества материала. К тому же, Вы сможете развивать не только посты, но и всю страницу целиком, сделав заказ еще и на подписчиков.
Заметки
• Global. Массив. $wp_registered_sidebars Stores the new sidebar in this array by sidebar ID.
Список изменений
С версии 2.2.0 Введена.
Код register sidebar: wp-includes/widgets.php WP 5.4.1
<?php
function register_sidebar( $args = array() ) {
global $wp_registered_sidebars;
$i = count( $wp_registered_sidebars ) + 1;
$id_is_empty = empty( $args['id'] );
$defaults = array(
/* translators: %d: Sidebar number. */
'name' => sprintf( __( 'Sidebar %d' ), $i ),
'id' => "sidebar-$i",
'description' => '',
'class' => '',
'before_widget' => '<li id="%1$s" class="widget %2$s">',
'after_widget' => "</li>\n",
'before_title' => '<h2 class="widgettitle">',
'after_title' => "</h2>\n",
);
/**
* Filters the sidebar default arguments.
*
* @since 5.3.0
*
* @see register_sidebar()
*
* @param array $defaults The default sidebar arguments.
*/
$sidebar = wp_parse_args( $args, apply_filters( 'register_sidebar_defaults', $defaults ) );
if ( $id_is_empty ) {
_doing_it_wrong(
__FUNCTION__,
sprintf(
/* translators: 1: The 'id' argument, 2: Sidebar name, 3: Recommended 'id' value. */
__( 'No %1$s was set in the arguments array for the "%2$s" sidebar. Defaulting to "%3$s". Manually set the %1$s to "%3$s" to silence this notice and keep existing sidebar content.' ),
'<code>id</code>',
$sidebar['name'],
$sidebar['id']
),
'4.2.0'
);
}
$wp_registered_sidebars[ $sidebar['id'] ] = $sidebar;
add_theme_support( 'widgets' );
/**
* Fires once a sidebar has been registered.
*
* @since 3.0.0
*
* @param array $sidebar Parsed arguments for the registered sidebar.
*/
do_action( 'register_sidebar', $sidebar );
return $sidebar['id'];
}
Cвязанные функции
Из метки: sidebar (widget Виджет)
Еще из тегов шаблона: Основные
17 комментов
Полезные 2 Вопросы 2 Все
• miha url.url
Вопрос, как добавить класс обёртке ul???
Ответить25.Июн.2014 00:19 #
• Kama7729
Про какую именно обертку идет речь?
Панель виджетов (sidebar) сама по себе не имеет ul тега... Она по умолчанию оборачивается в li, а заголовок в h2. Эти теги (li h2) меняются в параметрах:
before_widget after_widget before_title after_title
Если вы о ul для, списка, допустим, рубрик. То это уже контент который выводится в панели виджетов, т.е. сам виджет...
Ответить26.Июн.2014 02:19 #
• Дамир
привет,
а можно поподробней рассказать про вот эти вот штуки или где можно почитать об их описании?
%1$s %2$s %d $i
2
Ответить28.Ноя.2014 01:33 #
• Kama7729
$i - порядковый номер сайдбара ($i = count($wp_registered_sidebars) + 1;): пр. 1 если регистрируется первый бар, 2 если второй и т.д.
name
'name' => sprintf(__('Sidebar %d'), $i ),
Если не указывать "name", то name будет равно локализованному "Sidebar 1", "Sidebar 2" (%d заменится на вычисленное $i).
id
'id' => "sidebar-$i",
Если не указать "id", то id будет заменено на sidebar-1, sidebar-2.
before_widget
'before_widget' => '<li id="%1$s" class="widget %2$s">',
Конструкции %1$s и %2$s будут заменены на id и class используемого в сайдбаре виджета. Пр: укажем в before_widget строку:
<aside id="%1$s" class="widget %2$s">
теперь добавим виджет последних комментариев в тему и увидим что виджет обернут в строку
<aside id="recent-comments-2" class="widget widget_recent_comments">
2
Ответить28.Ноя.2014 08:55 #
• Дамир
спс биг
очень полезные параметры
Ответить28.Ноя.2014 14:21 #
• Спасибо) А данное толкование относится только к сайдбару ?
Ответить27.Май.2017 19:11 #
• Наталья internetdlyachainikov.ru
Здравствуйте, подскажите, пожалуйста, как заменить слова Рубрики на Каталог. Я поменяла с помощью плагина. Нашла что нужно найти строки
<h3>Рубрики</h3>
а где они находятся не пойму. Спасибо.
Ответить8.Дек.2014 23:02 #
• Дамир gabdrahimov.ru
просто зайдите "внешний вид > виджеты" и поменяйте в сайдбаре заголовки виджетов, никаких плагинов и кода не нужно
Ответить23.Мар.2015 17:58 #
• Алексей
Подскажите пожалуйста можно ли задать параметры чтобы на сайте не отображалась "общая" рубрика
1
Ответить11.Апр.2015 20:18 #
• Дамир gabdrahimov.ru
если хотите чтобы не отображалась конкретная рубрика, воспользуйтесь плагином (Category Order and Taxonomy Terms Order или Custom Taxonomy Order NE) или создайте вывод рубрик самостоятельно с помощью функции вывода рубрик wp_list_categories()
-1
Ответить11.Июн.2015 11:27 #
• Дамир
А если сразу несколько садбаров зарегить (без использования register_sidebarS()), чтобы выводить их через условные теги, косяков потом не возникнет изза например несколько раз использования add_action( 'widgets_init'?
function register_my_widgets1(){
register_sidebar( array(
...
) );
}
add_action( 'widgets_init', 'register_my_widgets1' );
function register_my_widgets2(){
register_sidebar( array(
...
) );
}
add_action( 'widgets_init', 'register_my_widgets2' );
function register_my_widgets3(){
register_sidebar( array(
...
) );
}
add_action( 'widgets_init', 'register_my_widgets3' );
Ответить5.Фев.2016 16:01 #
• Подскажите, как сделать, чтобы виджеты, которые я сделал, тоже можно было бы так редактировать, нажав на кнопку, как у меню
Ответить2.Июл.2018 23:29 #
• Евгений
Не совсем понял за что отвечает аргумент class. Какому элементу он задает класс??
Ответить22.Июл.2018 23:53 #
• поправьте плз, в примере кода не должен быть заголовок обёрнут в h1, минимум h2
1
Ответить25.Фев.2019 03:28 #
|
{
"url": "https://wp-kama.ru/function/register_sidebar",
"source_domain": "wp-kama.ru",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "158604",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BJRGQXEKI3TPKX42PEHAZT5LTF5C5SWD",
"WARC-Concurrent-To": "<urn:uuid:df78ef09-778a-4c8e-95fe-95d9fbe247ff>",
"WARC-Date": "2020-05-31T01:26:40Z",
"WARC-IP-Address": "87.236.16.123",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3HZS63KWZIUQE6BZUUBNYMCUMRVIANTO",
"WARC-Record-ID": "<urn:uuid:5672805d-e3c2-418a-8f7d-118707e29d8b>",
"WARC-Target-URI": "https://wp-kama.ru/function/register_sidebar",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4f24329d-5bb7-4130-a7df-6d0799a43948>"
},
"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,
24,
85,
86,
112,
113,
232,
233,
602,
603,
652,
653,
829,
830,
1003,
1004,
1312,
1313,
1508,
1509,
1716,
1717,
1976,
1977,
2023,
2024,
2141,
2142,
2241,
2242,
2284,
2306,
2307,
2363,
2364,
2406,
2422,
2433,
2434,
2483,
2484,
2505,
2506,
2559,
2591,
2617,
2670,
2705,
2730,
2755,
2814,
2846,
2895,
2927,
2933,
2935,
2936,
2950,
2951,
2978,
2999,
3000,
3086,
3148,
3149,
3185,
3186,
3213,
3214,
3221,
3243,
3275,
3277,
3278,
3316,
3317,
3343,
3344,
3357,
3558,
3603,
3614,
3838,
3865,
3885,
3985,
4002,
4016,
4086,
4103,
4125,
4313,
4364,
4385,
4469,
4493,
4514,
4549,
4590,
4610,
4644,
4668,
4669,
4863,
4864,
4872,
4873,
4922,
4923,
5069,
5070,
5102,
5128,
5171,
5198,
5270,
5298,
5325,
5331,
5333,
5386,
5387,
5607,
5608,
5614,
5657,
5693,
5696,
5697,
5758,
5759,
5788,
5789,
5821,
5847,
5897,
5927,
6013,
6072,
6101,
6149,
6177,
6183,
6185,
6238,
6239,
6277,
6278,
6299,
6306,
6349,
6388,
6392,
6399,
6400,
6664,
6665,
6673,
6674,
6770,
6771,
6788,
6789,
6813,
6814,
6869,
6870,
6876,
6923,
6956,
6957,
7001,
7002,
7040,
7041,
7061,
7102,
7158,
7193,
7218,
7243,
7302,
7334,
7383,
7415,
7419,
7420,
7425,
7468,
7472,
7489,
7493,
7521,
7525,
7583,
7588,
7681,
7682,
7705,
7724,
7741,
7753,
7842,
8030,
8053,
8075,
8094,
8100,
8111,
8116,
8119,
8120,
8175,
8176,
8209,
8210,
8215,
8261,
8265,
8282,
8286,
8357,
8362,
8406,
8407,
8431,
8433,
8434,
8452,
8453,
8487,
8488,
8519,
8520,
8533,
8558,
8575,
8576,
8621,
8622,
8654,
8669,
8670,
8712,
8713,
8873,
8931,
8932,
9057,
9058,
9092,
9102,
9103,
9115,
9211,
9231,
9232,
9238,
9270,
9285,
9286,
9426,
9427,
9438,
9439,
9487,
9488,
9615,
9616,
9625,
9626,
9654,
9655,
9729,
9730,
9750,
9751,
9814,
9815,
9943,
9987,
9988,
10083,
10084,
10159,
10160,
10168,
10202,
10216,
10217,
10233,
10266,
10267,
10303,
10370,
10371,
10407,
10444,
10445,
10585,
10606,
10607,
10650,
10651,
10682,
10709,
10710,
10831,
10832,
10866,
10878,
10879,
10978,
10979,
10985,
11017,
11044,
11045,
11294,
11295,
11304,
11338,
11348,
11349,
11571,
11572,
11609,
11639,
11649,
11659,
11665,
11723,
11728,
11765,
11795,
11805,
11815,
11821,
11879,
11884,
11921,
11951,
11961,
11971,
11977,
12035,
12066,
12067,
12195,
12196,
12227,
12239,
12240,
12326,
12327,
12359,
12443,
12444,
12450
],
"line_end_idx": [
24,
85,
86,
112,
113,
232,
233,
602,
603,
652,
653,
829,
830,
1003,
1004,
1312,
1313,
1508,
1509,
1716,
1717,
1976,
1977,
2023,
2024,
2141,
2142,
2241,
2242,
2284,
2306,
2307,
2363,
2364,
2406,
2422,
2433,
2434,
2483,
2484,
2505,
2506,
2559,
2591,
2617,
2670,
2705,
2730,
2755,
2814,
2846,
2895,
2927,
2933,
2935,
2936,
2950,
2951,
2978,
2999,
3000,
3086,
3148,
3149,
3185,
3186,
3213,
3214,
3221,
3243,
3275,
3277,
3278,
3316,
3317,
3343,
3344,
3357,
3558,
3603,
3614,
3838,
3865,
3885,
3985,
4002,
4016,
4086,
4103,
4125,
4313,
4364,
4385,
4469,
4493,
4514,
4549,
4590,
4610,
4644,
4668,
4669,
4863,
4864,
4872,
4873,
4922,
4923,
5069,
5070,
5102,
5128,
5171,
5198,
5270,
5298,
5325,
5331,
5333,
5386,
5387,
5607,
5608,
5614,
5657,
5693,
5696,
5697,
5758,
5759,
5788,
5789,
5821,
5847,
5897,
5927,
6013,
6072,
6101,
6149,
6177,
6183,
6185,
6238,
6239,
6277,
6278,
6299,
6306,
6349,
6388,
6392,
6399,
6400,
6664,
6665,
6673,
6674,
6770,
6771,
6788,
6789,
6813,
6814,
6869,
6870,
6876,
6923,
6956,
6957,
7001,
7002,
7040,
7041,
7061,
7102,
7158,
7193,
7218,
7243,
7302,
7334,
7383,
7415,
7419,
7420,
7425,
7468,
7472,
7489,
7493,
7521,
7525,
7583,
7588,
7681,
7682,
7705,
7724,
7741,
7753,
7842,
8030,
8053,
8075,
8094,
8100,
8111,
8116,
8119,
8120,
8175,
8176,
8209,
8210,
8215,
8261,
8265,
8282,
8286,
8357,
8362,
8406,
8407,
8431,
8433,
8434,
8452,
8453,
8487,
8488,
8519,
8520,
8533,
8558,
8575,
8576,
8621,
8622,
8654,
8669,
8670,
8712,
8713,
8873,
8931,
8932,
9057,
9058,
9092,
9102,
9103,
9115,
9211,
9231,
9232,
9238,
9270,
9285,
9286,
9426,
9427,
9438,
9439,
9487,
9488,
9615,
9616,
9625,
9626,
9654,
9655,
9729,
9730,
9750,
9751,
9814,
9815,
9943,
9987,
9988,
10083,
10084,
10159,
10160,
10168,
10202,
10216,
10217,
10233,
10266,
10267,
10303,
10370,
10371,
10407,
10444,
10445,
10585,
10606,
10607,
10650,
10651,
10682,
10709,
10710,
10831,
10832,
10866,
10878,
10879,
10978,
10979,
10985,
11017,
11044,
11045,
11294,
11295,
11304,
11338,
11348,
11349,
11571,
11572,
11609,
11639,
11649,
11659,
11665,
11723,
11728,
11765,
11795,
11805,
11815,
11821,
11879,
11884,
11921,
11951,
11961,
11971,
11977,
12035,
12066,
12067,
12195,
12196,
12227,
12239,
12240,
12326,
12327,
12359,
12443,
12444,
12450,
12481
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12481,
"ccnet_original_nlines": 358,
"rps_doc_curly_bracket": 0.0012819500407204032,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0437898114323616,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010350319556891918,
"rps_doc_frac_lines_end_with_ellipsis": 0.011142060160636902,
"rps_doc_frac_no_alph_words": 0.7981687784194946,
"rps_doc_frac_unique_words": 0.44092828035354614,
"rps_doc_mean_word_length": 6.236989974975586,
"rps_doc_num_sentences": 145,
"rps_doc_symbol_to_word_ratio": 0.008359869942069054,
"rps_doc_unigram_entropy": 5.917201995849609,
"rps_doc_word_count": 1422,
"rps_doc_frac_chars_dupe_10grams": 0.04149283841252327,
"rps_doc_frac_chars_dupe_5grams": 0.09020183235406876,
"rps_doc_frac_chars_dupe_6grams": 0.046904951333999634,
"rps_doc_frac_chars_dupe_7grams": 0.04149283841252327,
"rps_doc_frac_chars_dupe_8grams": 0.04149283841252327,
"rps_doc_frac_chars_dupe_9grams": 0.04149283841252327,
"rps_doc_frac_chars_top_2gram": 0.01736385002732277,
"rps_doc_frac_chars_top_3gram": 0.009583939798176289,
"rps_doc_frac_chars_top_4gram": 0.008569169789552689,
"rps_doc_books_importance": -1128.1396484375,
"rps_doc_books_importance_length_correction": -1128.1396484375,
"rps_doc_openwebtext_importance": -612.4819946289062,
"rps_doc_openwebtext_importance_length_correction": -612.4819946289062,
"rps_doc_wikipedia_importance": -514.0015869140625,
"rps_doc_wikipedia_importance_length_correction": -514.0015869140625
},
"fasttext": {
"dclm": 0.7061175107955933,
"english": 0.00036410000757314265,
"fineweb_edu_approx": 1.9855157136917114,
"eai_general_math": 0.000024319999283761717,
"eai_open_web_math": 0.42169660329818726,
"eai_web_code": 0.6583766341209412
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,835,736,827,752,134,000 |
Instance Settings
In the Administration Portal, you can view and define the preferences and settings you might have for how the application runs across your entire instance.
You can define several elements in Instance Settings including the maximum file size for attachments, the maximum process steps a process can have, etc.
To access and configure your Instance Settings:
1. In the Administration Portal, click Advanced Settings and then select Instance Settings in the side panel.
For information on how to access the Admin Portal, see the About the Administration Portal article.
2. In the Instance Settings Page displayed, you can define the following settings. For more details, click each link provided:
1. Access & Logging In
2. Import & Export
3. Bulk Edit
4. File Upload Restrictions
5. Attachments
6. Trace & Reuse
7. Move & Copy
8. Rich Text
9. Processes
10. Models.
3. Click Save to save and activate your changes.
To see and experience any changes made to Instance Settings, Blueprint users have to refresh their browsers.
|
{
"url": "https://blueprintsys.helpdocs.io/article/m1s9hrm7ng-instance-settings",
"source_domain": "blueprintsys.helpdocs.io",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "463158",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EURRCVICQ6T6KGBU2LX2AEVBA55T6H34",
"WARC-Concurrent-To": "<urn:uuid:6ededf4a-0da6-4a72-be14-b3c58cf01291>",
"WARC-Date": "2022-09-29T15:15:49Z",
"WARC-IP-Address": "146.148.41.214",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XNBA563MCHEO5T54363SV7KBSNQLQTNU",
"WARC-Record-ID": "<urn:uuid:a141bcb3-efb4-485b-bc49-54f22abff067>",
"WARC-Target-URI": "https://blueprintsys.helpdocs.io/article/m1s9hrm7ng-instance-settings",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a9c2493d-e6cc-4ad8-ae4b-86ecfa528533>"
},
"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-96\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,
18,
19,
175,
176,
329,
330,
378,
379,
491,
595,
724,
751,
774,
791,
823,
842,
863,
882,
899,
916,
932,
983
],
"line_end_idx": [
18,
19,
175,
176,
329,
330,
378,
379,
491,
595,
724,
751,
774,
791,
823,
842,
863,
882,
899,
916,
932,
983,
1095
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1095,
"ccnet_original_nlines": 22,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28358209133148193,
"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.23880596458911896,
"rps_doc_frac_unique_words": 0.5481927990913391,
"rps_doc_mean_word_length": 5.018072128295898,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.192277431488037,
"rps_doc_word_count": 166,
"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.11524610221385956,
"rps_doc_frac_chars_top_3gram": 0.08283313363790512,
"rps_doc_frac_chars_top_4gram": 0.05042016878724098,
"rps_doc_books_importance": -94.659912109375,
"rps_doc_books_importance_length_correction": -94.659912109375,
"rps_doc_openwebtext_importance": -42.918846130371094,
"rps_doc_openwebtext_importance_length_correction": -33.60837173461914,
"rps_doc_wikipedia_importance": -19.860937118530273,
"rps_doc_wikipedia_importance_length_correction": -19.860937118530273
},
"fasttext": {
"dclm": 0.20610105991363525,
"english": 0.8288424611091614,
"fineweb_edu_approx": 1.2683063745498657,
"eai_general_math": 0.17149847745895386,
"eai_open_web_math": 0.2727029323577881,
"eai_web_code": 0.01327436976134777
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,479,708,787,623,081,000 |
Преобразование объекта на карте с помощью дженериков
Проблема
Я загружаю вещи из localStorage и это должно быть сохранено как JSON, так что он должен иметь простой Object структуру можно JSON.parse().
Однако, сом методов не приемлю <any> в качестве параметра, потому что они хотят конкретной class или interfaceно я хочу, чтобы отправить мои объект в качестве параметра, так что я должен преобразовать его в Map для того, чтобы иметь ту же структуру, но видел как он имеет тип, это сейчас принято в качестве параметра.
Моя проблема заключается в конверсии от Object для Map
Решение
public static convertObjectToMap<V>(obj: any, classOfV): Map<string, V> {
let objectMap = new Map<string, V>();
if (obj !== undefined && obj !== null) {
for (let key in obj) {
if (obj.hasOwnProperty(key)) {
const initObject = new classOfV(obj[key]);
objectMap.set(key, initObject);
}
}
}
return objectMap;
}
Я принимаю obj и class где все значения будут в одном типе.
Пример использования
//This is purely for the example
const fibonacciObject:any = {"0": 1, "1": 1, "2": 2, "3": 3, "4": 5};
const fibonacciMap:Map<string, Number> = convertObjectToMap<Number>(fibonacciObject, Number);
fibonacciMap.get("0"); //1
fibonacciMap.get("4"); //5
Вопрос
Есть ли лучший способ, чтобы сделать это преобразование, я знаю о new () => Vно поскольку мне это нужно для каждого ключа, то это не совсем оправдано.
Также, Какой тип будет class из V быть, я получаю тип ошибки, когда я пытаюсь дать ему тип
101
4
задан 3 февраля 2018 в 03:02 Источник Поделиться
Комментарии
1 ответ
Несколько моментов первый.
1. Избежать any как чума. Вы можете почти всегда придумает лучше. Когда имеешь дело с сериализованный JSON-данные, я хотел бы иметь функцию, подобную этой, Чтобы избавиться от любого как можно скорее:
function verify<T>(obj: any, fallback: T, isT: (obj: any) => obj is T): T {
return isT(obj) ? obj : fallback;
}
2. Object.keys и Object.entries подходят для лупинга через объект, если вы собираетесь проверить hasOwnProperty. Я предпочитаю Object.entries когда это возможно, если у вас в браузере поддержку.
3. Выбрать const или letНе смешивать их без уважительных причин. const может привести к улучшению типа умозаключений, поэтому я предпочитаю использовать его, когда это возможно.
Вот как я бы реализовать эту функцию.
function convertObjectToMap<In, Out>(
obj: { [K: string]: In } | undefined | null,
classOfIn: new (v: In) => Out
): Map<string, Out> {
const result = new Map<string, Out>();
for (const [key, val] of Object.entries(obj || {})) {
result.set(key, new classOfIn(val));
}
return result;
}
5
ответ дан 3 февраля 2018 в 08:02 Источник Поделиться
|
{
"url": "http://qacode.ru/questions/50234/converting-object-to-map-using-generics",
"source_domain": "qacode.ru",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "22247",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:E4WT2JZTMVGMSDSBILIFGLDDBYUYWACW",
"WARC-Concurrent-To": "<urn:uuid:85b42696-7628-4ab9-b373-45a91a234e03>",
"WARC-Date": "2021-10-23T22:45:26Z",
"WARC-IP-Address": "212.109.198.136",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZFMAMMCCSGQYDBFHGD63W27MM5MMUL6U",
"WARC-Record-ID": "<urn:uuid:d0973eca-13b4-4b4e-95fc-566a22a076fb>",
"WARC-Target-URI": "http://qacode.ru/questions/50234/converting-object-to-map-using-generics",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d64a0cb1-8f20-4258-961a-3036b36b63e9>"
},
"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-88\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,
53,
54,
55,
64,
65,
204,
205,
523,
524,
579,
580,
588,
589,
663,
705,
750,
779,
818,
871,
913,
923,
931,
937,
959,
963,
964,
1024,
1025,
1046,
1047,
1080,
1150,
1151,
1245,
1246,
1273,
1300,
1301,
1308,
1309,
1460,
1461,
1552,
1553,
1554,
1555,
1559,
1561,
1610,
1622,
1630,
1631,
1658,
1659,
1660,
1863,
1864,
1944,
1982,
1988,
1989,
2186,
2187,
2367,
2368,
2406,
2407,
2445,
2490,
2520,
2542,
2581,
2582,
2636,
2673,
2675,
2676,
2691,
2693,
2694,
2696
],
"line_end_idx": [
53,
54,
55,
64,
65,
204,
205,
523,
524,
579,
580,
588,
589,
663,
705,
750,
779,
818,
871,
913,
923,
931,
937,
959,
963,
964,
1024,
1025,
1046,
1047,
1080,
1150,
1151,
1245,
1246,
1273,
1300,
1301,
1308,
1309,
1460,
1461,
1552,
1553,
1554,
1555,
1559,
1561,
1610,
1622,
1630,
1631,
1658,
1659,
1660,
1863,
1864,
1944,
1982,
1988,
1989,
2186,
2187,
2367,
2368,
2406,
2407,
2445,
2490,
2520,
2542,
2581,
2582,
2636,
2673,
2675,
2676,
2691,
2693,
2694,
2696,
2748
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2748,
"ccnet_original_nlines": 81,
"rps_doc_curly_bracket": 0.007278020028024912,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.047058820724487305,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025210080668330193,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7445378303527832,
"rps_doc_frac_unique_words": 0.6085790991783142,
"rps_doc_mean_word_length": 5.3619303703308105,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.191649436950684,
"rps_doc_word_count": 373,
"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.013500000350177288,
"rps_doc_frac_chars_top_3gram": 0.027000000700354576,
"rps_doc_frac_chars_top_4gram": 0.013000000268220901,
"rps_doc_books_importance": -330.78778076171875,
"rps_doc_books_importance_length_correction": -330.78778076171875,
"rps_doc_openwebtext_importance": -151.89993286132812,
"rps_doc_openwebtext_importance_length_correction": -151.89993286132812,
"rps_doc_wikipedia_importance": -118.85420227050781,
"rps_doc_wikipedia_importance_length_correction": -118.85420227050781
},
"fasttext": {
"dclm": 0.9431307315826416,
"english": 0.00022560000070370734,
"fineweb_edu_approx": 1.9482195377349854,
"eai_general_math": 0.0001087199998437427,
"eai_open_web_math": 0.49743038415908813,
"eai_web_code": 0.5956919193267822
}
}
|
{
"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": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,167,361,781,231,185,000 |
How To
How To Design a User-Friendly Mobile App
How To Design a User-Friendly Mobile App
Written by Robin Okwanma
Everyone might have experienced difficulties using a particular app. This app sometimes tends to be challenging to navigate, time-draining, and most times frustrating.
Designing a user-friendly mobile app is needed to create a positive user experience and ensure your application’s success. A user-friendly design focuses on simplicity, intuitiveness, and meeting the target audience’s needs.
We will look at fundamental principles and considerations to keep in mind when designing a user-friendly mobile app.
Define your target audience
Before starting the design process, it’s essential to understand who your target users are. Conduct user research to understand their preferences, behaviors, and needs.
This information will help you make design decisions catering to your target audience.
Read Also: Tips For Beginners; How To Avoid Common Mistakes in Programming
Please keep it simple
Simplicity is vital to creating a user-friendly mobile app. Avoid cluttered screens, excessive features, and complex navigation. Instead, strive for a clean and uncluttered interface that focuses on the core functionalities of your app.
Minimize the number of steps required to accomplish tasks and provide clear and concise instructions throughout the app.
Consistent and intuitive navigation
Navigation plays a vital role in ensuring a seamless user experience. Use standard navigation patterns and place navigation elements where users expect to find them.
Common navigation patterns include tab bars, hamburger menus, and bottom navigation bars. Aim for consistency in the placement and design of navigation elements across screens.
Visual Hierarchy and Information Architecture
Establish an excellent visual hierarchy to guide users’ attention and help them understand the importance and relationships between different elements.
Use appropriate typography, color, and size to differentiate between headings, subheadings, body text, and buttons. Organize information logically and use proper categorization and grouping to enhance user comprehension.
Responsive and adaptive design
Mobile devices come in various sizes and orientations. Ensure your app is responsive and adapts to different screen sizes and resolutions.
Test your app on multiple devices and use responsive design principles to ensure optimal usability and legibility across various screen sizes.
Use intuitive Icons and gestures
Icons are a universal language in mobile app design, allowing users to understand functionalities quickly. Use clear and recognizable icons that align with established design conventions.
Provide tooltips or labels for icons that might need to be clarified. Additionally, consider incorporating gestures like swiping, pinching, and tapping to enable intuitive interactions and streamline user actions.
Feedback and Error Handling
Provide clear and immediate feedback to users when they perform actions within your app. Visual cues such as animations, progress indicators, and notifications can help users understand the system’s response.
For error handling, offer meaningful messages explaining the issue and suggest potential solutions rather than generic error codes.
Read Also: Top 10 Programming Languages To Learn in 2023
User testing and iteration
Conduct usability testing throughout the design and development process. First, test your app with real users and gather their feedback to identify areas for improvement.
Then, iterate on the design based on user feedback, addressing pain points and enhancing the overall user experience.
Performance Optimization
Mobile app performance is crucial for user satisfaction. Optimize your app’s performance by minimizing loading times, reducing the assets’ size, and optimizing code.
A smooth and responsive app will enhance user engagement and minimize frustration.
Accessibility
Ensure your app is accessible to users with disabilities. For example, consider color contrast for visually impaired users, support for screen readers, and options for resizing text.
Design your app to accommodate users with different abilities, making it usable for a broader audience.
Onboarding and Help
Provide an onboarding experience that guides users through your app’s core features and functionality. Use tooltips, walkthroughs, or interactive tutorials to introduce users to the app’s key elements.
Additionally, include in-app help documentation or a frequently asked questions (FAQ) section to assist users in troubleshooting issues and answering common queries.
Continuous Improvement
A user-friendly app is never truly finished. Gather user feedback and monitor user behavior within the app to identify areas for improvement.
Regularly release updates that address user feedback, fix bugs, and introduce new features.
Stay engaged with your user base through app reviews, customer support, and social media channels to gather feedback and promptly address user concerns.
Performance Analytics
Implement analytics tools within your app to gather data on user behavior, such as screen flows, popular features, and user engagement.
Analyze this data to learn more about how users interact with your app and to see where they might run into problems or lose interest.
After that, employ this knowledge to set improvement priorities and make data-driven design decisions.
Aesthetics and Branding
While usability and functionality are paramount, aesthetics and branding significantly affect user satisfaction. Create a visually appealing app that aligns with your brand’s identity.
Consistent color schemes, typography, and visual elements will help users associate your app with your brand and establish trust and familiarity.
Read Also: The latest advancements in robotics and automation
Test, Test, Test
Before releasing your app to the public:
1. Conduct extensive testing on various devices, operating systems, and network conditions.
2. Test for usability, performance, and compatibility issues.
3. Consider beta testing with a group of users to gather feedback and identify any problems that need addressing.
User Feedback Channels
Provide multiple channels for users to share feedback, such as in-app feedback forms, email, or social media. Actively listen to user feedback and respond promptly.
Acknowledge user suggestions and bug reports, and communicate your plans for addressing them. Engaging with users and making them feel heard will build loyalty and trust.
Stay Updated on Design Trends
Stay current with the latest design trends, platform guidelines, and best practices in mobile app design.
Platforms like iOS and Android regularly update their design guidelines, and keeping up with these changes ensures that your app stays relevant and provides a familiar experience to users.
Localization
Consider localizing your app if you plan to target users in different regions. Translate the app’s text and adapt its design to accommodate other languages and cultural preferences.
Localization demonstrates your commitment to providing a user-friendly experience for users worldwide.
User Privacy and Security
Prioritize user privacy and security in your app design. Communicate your data collection practices and provide options for users to control their privacy settings.
Implement security measures to protect user data, such as secure authentication, encryption, and storage.
Continuous User Engagement
Once users have installed your app, focus on keeping them engaged. Send targeted notifications, provide relevant content, and offer personalized experiences based on user preferences and behavior.
Regularly update your app with new features and improvements to keep users interested and encourage continued use.
Conclusion
Always keep in mind that creating a user-friendly mobile app requires iteration.
It calls for a thorough comprehension of your target market, ongoing user testing, and a dedication to adopting suggestions and enhancing the user experience over time.
Nevertheless, you may make a mobile app that consumers like and find simple to use by adhering to these guidelines and considering their requirements at every stage of the design process.
About the author
Robin Okwanma
|
{
"url": "https://techranter.com/how-to-design-a-user-friendly-mobile-app/",
"source_domain": "techranter.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "117172",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GMV6JTFQEJ27JDGKXJO7KBB4GC6GNLBI",
"WARC-Concurrent-To": "<urn:uuid:61ef2409-b336-416a-b05b-27136883774d>",
"WARC-Date": "2023-06-09T04:10:19Z",
"WARC-IP-Address": "3.210.81.252",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:35JEBYMRDOLYW7G2Z7CYQPHW65T6GI46",
"WARC-Record-ID": "<urn:uuid:9778f9e7-25bb-4b82-b7ea-3a8b2566de2a>",
"WARC-Target-URI": "https://techranter.com/how-to-design-a-user-friendly-mobile-app/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:afa65736-6525-40df-a1e6-f0007eadff80>"
},
"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,
7,
8,
49,
50,
91,
116,
117,
285,
286,
512,
513,
630,
631,
659,
660,
829,
830,
917,
918,
994,
995,
1017,
1018,
1255,
1256,
1377,
1378,
1414,
1415,
1581,
1582,
1759,
1760,
1806,
1807,
1959,
1960,
2181,
2182,
2213,
2214,
2353,
2354,
2497,
2498,
2531,
2532,
2720,
2721,
2935,
2936,
2964,
2965,
3174,
3175,
3307,
3308,
3365,
3366,
3393,
3394,
3565,
3566,
3684,
3685,
3710,
3711,
3877,
3878,
3961,
3962,
3976,
3977,
4160,
4161,
4265,
4266,
4286,
4287,
4489,
4490,
4656,
4657,
4680,
4681,
4823,
4824,
4916,
4917,
5070,
5071,
5093,
5094,
5230,
5231,
5366,
5367,
5470,
5471,
5495,
5496,
5681,
5682,
5828,
5829,
5891,
5892,
5909,
5910,
5951,
5952,
6046,
6110,
6226,
6227,
6250,
6251,
6416,
6417,
6588,
6589,
6619,
6620,
6726,
6727,
6916,
6917,
6930,
6931,
7113,
7114,
7217,
7218,
7244,
7245,
7410,
7411,
7517,
7518,
7545,
7546,
7743,
7744,
7859,
7860,
7871,
7872,
7953,
7954,
8123,
8124,
8312,
8313,
8330,
8331
],
"line_end_idx": [
7,
8,
49,
50,
91,
116,
117,
285,
286,
512,
513,
630,
631,
659,
660,
829,
830,
917,
918,
994,
995,
1017,
1018,
1255,
1256,
1377,
1378,
1414,
1415,
1581,
1582,
1759,
1760,
1806,
1807,
1959,
1960,
2181,
2182,
2213,
2214,
2353,
2354,
2497,
2498,
2531,
2532,
2720,
2721,
2935,
2936,
2964,
2965,
3174,
3175,
3307,
3308,
3365,
3366,
3393,
3394,
3565,
3566,
3684,
3685,
3710,
3711,
3877,
3878,
3961,
3962,
3976,
3977,
4160,
4161,
4265,
4266,
4286,
4287,
4489,
4490,
4656,
4657,
4680,
4681,
4823,
4824,
4916,
4917,
5070,
5071,
5093,
5094,
5230,
5231,
5366,
5367,
5470,
5471,
5495,
5496,
5681,
5682,
5828,
5829,
5891,
5892,
5909,
5910,
5951,
5952,
6046,
6110,
6226,
6227,
6250,
6251,
6416,
6417,
6588,
6589,
6619,
6620,
6726,
6727,
6916,
6917,
6930,
6931,
7113,
7114,
7217,
7218,
7244,
7245,
7410,
7411,
7517,
7518,
7545,
7546,
7743,
7744,
7859,
7860,
7871,
7872,
7953,
7954,
8123,
8124,
8312,
8313,
8330,
8331,
8344
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8344,
"ccnet_original_nlines": 155,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30553558468818665,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.002875630045309663,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12940330803394318,
"rps_doc_frac_unique_words": 0.4145728647708893,
"rps_doc_mean_word_length": 5.781406879425049,
"rps_doc_num_sentences": 76,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.4581828117370605,
"rps_doc_word_count": 1194,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03563667833805084,
"rps_doc_frac_chars_dupe_6grams": 0.00956105999648571,
"rps_doc_frac_chars_dupe_7grams": 0.00956105999648571,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.016224829480051994,
"rps_doc_frac_chars_top_3gram": 0.01651456020772457,
"rps_doc_frac_chars_top_4gram": 0.01912211999297142,
"rps_doc_books_importance": -578.281005859375,
"rps_doc_books_importance_length_correction": -578.281005859375,
"rps_doc_openwebtext_importance": -315.18212890625,
"rps_doc_openwebtext_importance_length_correction": -315.18212890625,
"rps_doc_wikipedia_importance": -170.99143981933594,
"rps_doc_wikipedia_importance_length_correction": -170.99143981933594
},
"fasttext": {
"dclm": 0.8507288694381714,
"english": 0.8982162475585938,
"fineweb_edu_approx": 1.819879174232483,
"eai_general_math": 0.006416379939764738,
"eai_open_web_math": 0.022201599553227425,
"eai_web_code": 0.8695448637008667
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
-1,181,602,245,117,446,000 |
Introduction
Generalized Estimating Equations (GEEs) are mainly used for modeling longitudinal binary or count endpoints from clinical trials. Within this package, a GEE is used to estimate the parameters of a generalized linear model that includes as fixed effects the variables: treatment arm, categorical visit, and other covariates for adjustment (e.g. age, sex, race). The covariance structure of the residuals can take on different forms. Often, an unstructured (i.e. saturated parameterization) covariance matrix is assumed which can be represented by random effects in the model.
This vignette shows the general purpose and syntax of the tern.gee R package which provides an interface for GEEs within the tern framework. This package builds upon some of the GEE functionality included in the geepack and geeasy R packages. Within this package, we have implemented GEEs in R in such a way that they can easily be embedded into a shiny application. See teal.modules.clinical::tm_a_gee() and the teal.modules.clinical package for more details about using this code inside a shiny application.
Example
Here we will demonstrate how the tern.gee package functionality can be used to fit a GEE model and tabulate its output.
Setup
Our sample dataset, fev_data, is available in the tern.gee package and consists of seven variables: subject ID (USUBJID), visit number (AVISIT), treatment (ARMCD = TRT or PBO), 3-category RACE, SEX, FEV1 at baseline (%) (FEV1_BL), and FEV1 at study visits (%) (FEV1). Additionally we create an arbitrary binary variable FEV1_BINARY for our analysis which takes a value of 1 where FEV1 > 30 and 0 otherwise. FEV1 (forced expired volume in one second) is a measure of how quickly the lungs can be emptied. Low levels of FEV1 may indicate chronic obstructive pulmonary disease (COPD). The scientific question at hand is whether treatment leads to an increase in FEV1 over time after adjusting for baseline covariates.
library(tern.gee)
fev_data$FEV1_BINARY <- as.integer(fev_data$FEV1 > 30)
head(fev_data)
#> # A tibble: 6 × 8
#> USUBJID AVISIT ARMCD RACE SEX FEV1_BL FEV1 FEV1_BINARY
#> <fct> <fct> <fct> <fct> <fct> <dbl> <dbl> <int>
#> 1 PT1 VIS1 TRT Black or African American Fema… 25.3 NA NA
#> 2 PT1 VIS2 TRT Black or African American Fema… 25.3 40.0 1
#> 3 PT1 VIS3 TRT Black or African American Fema… 25.3 NA NA
#> 4 PT1 VIS4 TRT Black or African American Fema… 25.3 20.5 0
#> 5 PT2 VIS1 PBO Asian Male 45.0 NA NA
#> 6 PT2 VIS2 PBO Asian Male 45.0 31.5 1
Model Fitting
Fitting a GEE model is easy when you use tern.gee. By default, the model fitting function fit_gee() assumes unstructured correlation and proportional weights when calculating LS means, and fits a logistic regression model. Currently only logistic regression has been implemented as an available regression model when using fit_gee(). In future the package will be extended to include other models such as Poisson regression, etc. as alternative options.
fev_fit <- fit_gee(
vars = list(
response = "FEV1_BINARY",
covariates = c("RACE", "SEX", "FEV1_BL"),
arm = "ARMCD",
id = "USUBJID",
visit = "AVISIT"
),
data = fev_data
)
#> Registered S3 methods overwritten by 'geeasy':
#> method from
#> drop1.geeglm MESS
#> drop1.geem MESS
#> plot.geeglm geepack
fev_fit
#>
#> Call:
#> geeasy::geelm(formula = formula, id = .id, waves = .waves, data = data,
#> family = family$object, corstr = cor_details$str, Mv = cor_details$mv,
#> control = family$control)
#>
#> Coefficients:
#> (Intercept) ARMCDTRT
#> -0.20061892 0.74524533
#> RACEBlack or African American RACEWhite
#> 0.11627212 1.38199917
#> SEXFemale FEV1_BL
#> -0.14521343 0.05257141
#>
#> Degrees of Freedom: 537 Total (i.e. Null); 531 Residual
#>
#> Scale is fixed.
#>
#> Correlation: Structure = unstructured Link = identity
#> Estimated Correlation Parameters:
#> [1] -0.046922366 -0.130175920 0.071402079 -0.126586549 -0.062642853
#> [6] 0.006795836
#>
#> Number of clusters: 197 Maximum cluster size: 4
The resulting object consists of many pieces of information pertaining to the model such as the estimated coefficients, correlation parameters, etc. Additionally, the lsmeans() function from tern.gee can be used to extract the least squares means from any GEE model created using fit_gee().
fev_lsmeans <- lsmeans(fev_fit, data = fev_data)
fev_lsmeans
#> ARMCD prop_est prop_est_se prop_lower_cl prop_upper_cl n or_est
#> 1 PBO 0.9054200 0.01904206 0.8609409 0.9367178 420 NA
#> 2 TRT 0.9527634 0.01193578 0.9230409 0.9713629 380 2.106958
#> or_lower_cl or_upper_cl log_or_est log_or_lower_cl log_or_upper_cl conf_level
#> 1 NA NA NA NA NA 0.95
#> 2 1.127384 3.937677 0.7452453 0.1198996 1.370591 0.95
Based on the output, there is evidence to support that treatment leads to an increase in FEV1 over placebo. The GEE model can be refined by using different correlation structures and weighting schemes.
Tabulation
After fitting a GEE model and extracting the LS means you may want to display your results in a table. The tern.gee package contains functionality to summarize the results of a lsmeans() object in an rtable structure, using additional functions from the rtables package.
fev_counts
|
{
"url": "https://cran.ms.unimelb.edu.au/web/packages/tern.gee/vignettes/tern-gee.html",
"source_domain": "cran.ms.unimelb.edu.au",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "1048818",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EQ4WJUJSBP52SUSJECW7KOCFTC2R2ICK",
"WARC-Concurrent-To": "<urn:uuid:45296060-039d-48da-ab7e-fd54ca87e786>",
"WARC-Date": "2024-08-08T11:32:51Z",
"WARC-IP-Address": "128.250.121.23",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4FBSJIVVJZLE2SD3Y64K53RQQDTCZGUZ",
"WARC-Record-ID": "<urn:uuid:699e9e6a-97f1-4255-8059-d481d7eaefbb>",
"WARC-Target-URI": "https://cran.ms.unimelb.edu.au/web/packages/tern.gee/vignettes/tern-gee.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2b49b674-2955-4314-94ae-af0e7c241ec9>"
},
"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,
13,
14,
589,
590,
1100,
1101,
1102,
1110,
1111,
1231,
1232,
1238,
1239,
1954,
1955,
1973,
2028,
2043,
2064,
2148,
2232,
2316,
2400,
2484,
2568,
2652,
2736,
2737,
2751,
2752,
3206,
3207,
3227,
3242,
3272,
3318,
3337,
3357,
3378,
3383,
3401,
3403,
3453,
3479,
3505,
3531,
3557,
3565,
3569,
3578,
3654,
3733,
3766,
3770,
3787,
3851,
3915,
3979,
4043,
4107,
4171,
4175,
4235,
4239,
4258,
4262,
4324,
4361,
4433,
4453,
4457,
4512,
4513,
4804,
4805,
4854,
4866,
4940,
5014,
5088,
5171,
5254,
5337,
5338,
5540,
5541,
5552,
5553,
5824,
5825
],
"line_end_idx": [
13,
14,
589,
590,
1100,
1101,
1102,
1110,
1111,
1231,
1232,
1238,
1239,
1954,
1955,
1973,
2028,
2043,
2064,
2148,
2232,
2316,
2400,
2484,
2568,
2652,
2736,
2737,
2751,
2752,
3206,
3207,
3227,
3242,
3272,
3318,
3337,
3357,
3378,
3383,
3401,
3403,
3453,
3479,
3505,
3531,
3557,
3565,
3569,
3578,
3654,
3733,
3766,
3770,
3787,
3851,
3915,
3979,
4043,
4107,
4171,
4175,
4235,
4239,
4258,
4262,
4324,
4361,
4433,
4453,
4457,
4512,
4513,
4804,
4805,
4854,
4866,
4940,
5014,
5088,
5171,
5254,
5337,
5338,
5540,
5541,
5552,
5553,
5824,
5825,
5835
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5835,
"ccnet_original_nlines": 90,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 4,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21081577241420746,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07974334806203842,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3583868145942688,
"rps_doc_frac_unique_words": 0.5088676810264587,
"rps_doc_mean_word_length": 5.381991863250732,
"rps_doc_num_sentences": 87,
"rps_doc_symbol_to_word_ratio": 0.0449129194021225,
"rps_doc_unigram_entropy": 5.531635284423828,
"rps_doc_word_count": 733,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05373891070485115,
"rps_doc_frac_chars_dupe_6grams": 0.05373891070485115,
"rps_doc_frac_chars_dupe_7grams": 0.05373891070485115,
"rps_doc_frac_chars_dupe_8grams": 0.037008870393037796,
"rps_doc_frac_chars_dupe_9grams": 0.01875792071223259,
"rps_doc_frac_chars_top_2gram": 0.007097589783370495,
"rps_doc_frac_chars_top_3gram": 0.02154625952243805,
"rps_doc_frac_chars_top_4gram": 0.01723700948059559,
"rps_doc_books_importance": -566.225341796875,
"rps_doc_books_importance_length_correction": -566.225341796875,
"rps_doc_openwebtext_importance": -285.6971130371094,
"rps_doc_openwebtext_importance_length_correction": -285.6971130371094,
"rps_doc_wikipedia_importance": -240.54409790039062,
"rps_doc_wikipedia_importance_length_correction": -240.54409790039062
},
"fasttext": {
"dclm": 0.0897487998008728,
"english": 0.761457085609436,
"fineweb_edu_approx": 2.6911494731903076,
"eai_general_math": 0.9702047109603882,
"eai_open_web_math": 0.012650850228965282,
"eai_web_code": 0.9140709042549133
}
}
|
{
"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": "616.99",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Pathology and Diseases"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,354,923,321,982,378,000 |
Skip to main content
Version: v0.15.0
Import a Connection's models
After creating a Connection, H2O Model Validation enables you to import models located in the Platform associated with the Connection.
note
To learn how to create a Connection, see Create a Connection.
Instructions
To import models located in the Platform associated with a Connection, consider the following instructions:
1. In the H2O Model Validation navigation menu, click Connections.
2. In the Connections table, identify the Connection (row) that contains the models you want to import.
3. Click Kebab menu.
4. Select Import models.
5. In the models table, select the model(s) to import.
6. To import the dataset(s) of the model(s) to be imported, leave the Import model datasets to local platform checkbox as is.
7. Click Import.
Feedback
|
{
"url": "https://docs.h2o.ai/wave-apps/h2o-model-validation/v0.15.0/guide/connections/import-a-connections-models",
"source_domain": "docs.h2o.ai",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "31888",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KGG63TNOABW3A3XRRT6CFUEBEHGUG3PC",
"WARC-Concurrent-To": "<urn:uuid:605186cb-c9dc-4a69-9bff-0336a6442b26>",
"WARC-Date": "2024-05-23T10:16:17Z",
"WARC-IP-Address": "13.248.182.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XJO4UEO3PJKPZRVKN6FWZT27JDKBJPJW",
"WARC-Record-ID": "<urn:uuid:9d9d3645-3cb7-4f50-8113-9eb50cdf3e66>",
"WARC-Target-URI": "https://docs.h2o.ai/wave-apps/h2o-model-validation/v0.15.0/guide/connections/import-a-connections-models",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f8d407cd-1147-4fc2-979d-ae4f4c76c91f>"
},
"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-212\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,
21,
38,
39,
68,
69,
204,
205,
210,
211,
273,
274,
287,
288,
396,
397,
466,
572,
595,
622,
679,
807,
826,
827
],
"line_end_idx": [
21,
38,
39,
68,
69,
204,
205,
210,
211,
273,
274,
287,
288,
396,
397,
466,
572,
595,
622,
679,
807,
826,
827,
835
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 835,
"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.28070175647735596,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01169591024518013,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2631579041481018,
"rps_doc_frac_unique_words": 0.4651162922382355,
"rps_doc_mean_word_length": 5.031007766723633,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.701327323913574,
"rps_doc_word_count": 129,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.14791987836360931,
"rps_doc_frac_chars_dupe_6grams": 0.14791987836360931,
"rps_doc_frac_chars_dupe_7grams": 0.14791987836360931,
"rps_doc_frac_chars_dupe_8grams": 0.14791987836360931,
"rps_doc_frac_chars_dupe_9grams": 0.14791987836360931,
"rps_doc_frac_chars_top_2gram": 0.06163328140974045,
"rps_doc_frac_chars_top_3gram": 0.055469948798418045,
"rps_doc_frac_chars_top_4gram": 0.0647149533033371,
"rps_doc_books_importance": -76.068115234375,
"rps_doc_books_importance_length_correction": -76.068115234375,
"rps_doc_openwebtext_importance": -50.36420822143555,
"rps_doc_openwebtext_importance_length_correction": -49.542579650878906,
"rps_doc_wikipedia_importance": -20.72225570678711,
"rps_doc_wikipedia_importance_length_correction": -20.72225570678711
},
"fasttext": {
"dclm": 0.8917962908744812,
"english": 0.8418768048286438,
"fineweb_edu_approx": 1.1901482343673706,
"eai_general_math": 0.7059921026229858,
"eai_open_web_math": 0.10556452721357346,
"eai_web_code": 0.0020459298975765705
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.072",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-1,892,770,103,179,563,000 |
Tell me more ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
I have a large PDF file and I use Adobe Acrobat X Pro. The document comes straight from the publisher, so it has its TrimBox and BleedBox defined. The catch is that the cropping dimensions differ from page to page.
Is it possible within Adobe Acrobat X Pro to define a batch operation so that all the pages will be cropped automagically to the correct size (as is defined with the TrimBox settings per page)? I understand how to define a CropBox, but if I use those settings on the whole document (or even a folder filled with documents), all pages will be cropped with the same, fixed dimensions (which is not what we need).
I also found a useful Question that can help me solve this problem using ImageMagick and GhostScript (link), but I noticed that that resulted in some data loss, making the images too "smudgy" for my purpose. If there is a way to do this with ImageMagick without data loss, that would be fine too, but I prefer using the Batch operation of Adobe Acrobat X Pro if that would be possible.
Any ideas?
share|improve this question
add comment
2 Answers
You should try ImageMagick with the -density option. So something like:
convert -verbose -define pdf:use-trimbox=true -density 300x300 your_pdf.pdf output.format
The density option should make sure it does not get blurry, see: http://www.imagemagick.org/script/command-line-options.php#density
share|improve this answer
Dear Joost (Beste Joost :-)), thank you for the reply. I tried the ImageMagick before but would loose resolution that way. I am glad you replied on my question, as you remind me that I hadn't posted my answer yet. On the Acrobat-forum I found the following: answers.acrobatusers.com/… ; using the script for (var p=0; p<this.numPages; p++) { this.setPageBoxes("Crop", p, p, this.getPageBox("Trim", p)); }, the PDF shows purely the TrimBox and that was exactly what I needed! I will add this to the answers and close the thread. – Wim Jan 22 at 13:29
add comment
up vote 0 down vote accepted
Found the answer on AcrobatUsers.com: http://answers.acrobatusers.com/How-I-crop-PDF-TrimBox-data-q33436.aspx . Try67 gave me the following:
This script will set the crop box of each page in a document to be the same as the trim box. You can use it in an Action to apply it to multiple files:
for (var p=0; p<this.numPages; p++)
{
this.setPageBoxes("Crop", p, p,
this.getPageBox("Trim", p));
}
which had the result that I needed.
Thank you to user Joost to remind me that I hadn't closed the thread yet.
share|improve this answer
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/12353160/how-to-crop-a-pdf-using-the-trimbox-data?answertab=votes",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "52446",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EZXDY4NL3SM7PWNYD4226MW2PAYZJ3RW",
"WARC-Concurrent-To": "<urn:uuid:07d308cd-28fb-4b33-8c73-e387842519f0>",
"WARC-Date": "2013-12-05T18:49:04Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:M5FTG5CIPIUDLWXO37G7LHZLEROVIRGJ",
"WARC-Record-ID": "<urn:uuid:17cd78e5-6d60-4c7c-85eb-b270f2d59a95>",
"WARC-Target-URI": "http://stackoverflow.com/questions/12353160/how-to-crop-a-pdf-using-the-trimbox-data?answertab=votes",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:354bc822-f11b-45d1-9428-c436c5781fd0>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
15,
147,
148,
363,
364,
775,
776,
1162,
1163,
1174,
1175,
1203,
1215,
1216,
1226,
1227,
1299,
1300,
1390,
1391,
1523,
1524,
1550,
1552,
2103,
2115,
2144,
2145,
2286,
2287,
2439,
2440,
2477,
2480,
2518,
2553,
2556,
2557,
2593,
2594,
2668,
2669,
2695,
2707,
2708,
2720,
2721,
2723,
2731,
2732,
2810,
2811
],
"line_end_idx": [
15,
147,
148,
363,
364,
775,
776,
1162,
1163,
1174,
1175,
1203,
1215,
1216,
1226,
1227,
1299,
1300,
1390,
1391,
1523,
1524,
1550,
1552,
2103,
2115,
2144,
2145,
2286,
2287,
2439,
2440,
2477,
2480,
2518,
2553,
2556,
2557,
2593,
2594,
2668,
2669,
2695,
2707,
2708,
2720,
2721,
2723,
2731,
2732,
2810,
2811,
2901
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2901,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0.0013788300566375256,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3829457461833954,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03410853073000908,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21550388634204865,
"rps_doc_frac_unique_words": 0.4860215187072754,
"rps_doc_mean_word_length": 4.797849655151367,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.0031007800716906786,
"rps_doc_unigram_entropy": 5.0121989250183105,
"rps_doc_word_count": 465,
"rps_doc_frac_chars_dupe_10grams": 0.05647692084312439,
"rps_doc_frac_chars_dupe_5grams": 0.0726131796836853,
"rps_doc_frac_chars_dupe_6grams": 0.05647692084312439,
"rps_doc_frac_chars_dupe_7grams": 0.05647692084312439,
"rps_doc_frac_chars_dupe_8grams": 0.05647692084312439,
"rps_doc_frac_chars_dupe_9grams": 0.05647692084312439,
"rps_doc_frac_chars_top_2gram": 0.016136260703206062,
"rps_doc_frac_chars_top_3gram": 0.01748095080256462,
"rps_doc_frac_chars_top_4gram": 0.021515019237995148,
"rps_doc_books_importance": -297.7344665527344,
"rps_doc_books_importance_length_correction": -297.7344665527344,
"rps_doc_openwebtext_importance": -184.79002380371094,
"rps_doc_openwebtext_importance_length_correction": -184.79002380371094,
"rps_doc_wikipedia_importance": -138.8568572998047,
"rps_doc_wikipedia_importance_length_correction": -138.8568572998047
},
"fasttext": {
"dclm": 0.11371135711669922,
"english": 0.8613625764846802,
"fineweb_edu_approx": 1.2104113101959229,
"eai_general_math": 0.10350263118743896,
"eai_open_web_math": 0.5221419930458069,
"eai_web_code": 0.00041859998600557446
}
}
|
{
"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.089",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,005,441,515,491,630,800 |
How to Disable Attachment Pages in WordPress without using plugin
How to Disable Attachment Pages…
WordPress generates a URL for whatever file you post, including images. You can use a direct link or conduct a search to find this URL. Some people might prefer to block the attachment pages for different kinds of media, though.
This is due to the possibility that a visitor will click on one of those attachment sites and see only a single image with no accompanying text. This could give the impression that the page is unfinished and under construction, which would be extremely detrimental to your website’s SEO rankings.
I’ll walk you through the process of making WordPress disable those media attachment pages in this article. I’ll actually demonstrate the methods for doing this without using plugin.
Go to functions.php and add code as below:
function redirect_attachment(){
if(is_attachment()){
$attachment_ID = get_queried_object_id();
$file_url = wp_get_attachment_url($attachment_ID);
wp_redirect($file_url, 301);
exit();
}
}
add_action('template_redirect', 'redirect_attachment');
Don't forget to Share this Article !
You may like this
|
{
"url": "https://www.v-norm.com/how-to-disable-attachment-pages-in-wordpress-without-using-plugin/",
"source_domain": "www.v-norm.com",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "81805",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FU6S65BTJCJXAZMOCYSNUVIWFFDNHUAI",
"WARC-Concurrent-To": "<urn:uuid:d0ff2917-b685-42c2-a9bd-e86a4c5ed8d6>",
"WARC-Date": "2024-09-12T13:31:30Z",
"WARC-IP-Address": "64.90.33.58",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:33EQBQUEQMIRGXVDV4MGWPLSE4WICX55",
"WARC-Record-ID": "<urn:uuid:7e85737f-d00c-4cd4-a636-796593a31651>",
"WARC-Target-URI": "https://www.v-norm.com/how-to-disable-attachment-pages-in-wordpress-without-using-plugin/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0eeeea8d-0f96-41f5-8aa8-13b610e2605b>"
},
"warc_info": "isPartOf: CC-MAIN-2024-38\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-225\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
66,
67,
100,
101,
330,
331,
628,
811,
812,
855,
856,
888,
909,
951,
1002,
1031,
1039,
1041,
1043,
1099,
1100,
1137,
1138
],
"line_end_idx": [
66,
67,
100,
101,
330,
331,
628,
811,
812,
855,
856,
888,
909,
951,
1002,
1031,
1039,
1041,
1043,
1099,
1100,
1137,
1138,
1155
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1155,
"ccnet_original_nlines": 23,
"rps_doc_curly_bracket": 0.0034632000606507063,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36666667461395264,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02380952052772045,
"rps_doc_frac_lines_end_with_ellipsis": 0.0416666716337204,
"rps_doc_frac_no_alph_words": 0.18571428954601288,
"rps_doc_frac_unique_words": 0.6687116622924805,
"rps_doc_mean_word_length": 5.607361793518066,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0.004761899821460247,
"rps_doc_unigram_entropy": 4.477530002593994,
"rps_doc_word_count": 163,
"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.049234140664339066,
"rps_doc_frac_chars_top_3gram": 0.026258209720253944,
"rps_doc_frac_chars_top_4gram": 0.048140041530132294,
"rps_doc_books_importance": -112.2591781616211,
"rps_doc_books_importance_length_correction": -112.2591781616211,
"rps_doc_openwebtext_importance": -73.49915313720703,
"rps_doc_openwebtext_importance_length_correction": -71.34783935546875,
"rps_doc_wikipedia_importance": -46.46805191040039,
"rps_doc_wikipedia_importance_length_correction": -46.46805191040039
},
"fasttext": {
"dclm": 0.04117786884307861,
"english": 0.8381978869438171,
"fineweb_edu_approx": 2.3146872520446777,
"eai_general_math": 0.5956662893295288,
"eai_open_web_math": 0.48390495777130127,
"eai_web_code": 0.025761490687727928
}
}
|
{
"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.87",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,109,170,699,293,304,000 |
Skip to content
Tamarin part II – More on Array and Vector
December 5, 2009
Read Part I
Size in memory:
Start a flash app with
var a:Vector.<int> = new Vector.<int>(1024 * 1024);
Would result in a total memory use (System.totalMemory: including all the other junk)
System.totalMemory = 7 311 360
Start Over. now start with
var a:Vector.<int> = new Vector.<int>(1024 * 1024+1);
System.totalMemory = 7 315 456
Wow.. That’s a 4K jump for one int!
ok… lets add one more.
var a:Vector.<int> = new Vector.<int>(1024 * 1024+2);
System.totalMemory = 7 315 456
Exact same thing.. hmm
is it really caching a minimum of 4K for each allocation? A thousand elements caching? Nice 😉
Ok. Well that’s good to know.
So now let’s fill this array
var a:Vector.<int> = new Vector.<int>(1024 * 1024);
for (var i:int = 0; i <= 1024 * 1024; i++) { a[i] = 0 }
System.totalMemory = 8 364 032
WHAT!! That’s a 1 052 652 bytes (1 Mo) hole! ouchh
Ok… Start Over..
Let’s try to see what’s really happening in Tamarin:
So first of all, as I was explaining in my previous post, both Array and Vector use dense Array (DA).
This mean they are using a direct indexation in a block of memory pre-allocated.
When you allocate memory in flash you go through the Garbage Collector and ask him for some space.
(Yes, the GC is allocating the memory. For more on that, wait for my next post!)
So when allocating new block of memory, its going to use the “lowerLimitHeapBlocks” and use class size for good allocation size.
inline uint32_t GCPolicyManager::lowerLimitHeapBlocks() {
return 256; // 4KB blocks, that is, 1MB
}
// Size classes for our GC. From 8 to 128, size classes are spaced
// evenly 8 bytes apart. The finest granularity we can achieve is
// 8 bytes, as pointers must be 8-byte aligned thanks to our use
// of the bottom 3 bits of 32-bit atoms for Special Purposes.
// Above that, the size classes have been chosen to maximize the
// number of items that fit in a 4096-byte block, given our block
// header information.
const int16_t GC::kSizeClasses[kNumSizeClasses] = {
8, 16, 24, 32, 40, 48, 56, 64, 72, 80, //0-9
88, 96, 104, 112, 120, 128, 144, 160, 168, 176, //10-19
184, 192, 200, 216, 224, 240, 256, 280, 296, 328, //20-29
352, 392, 432, 488, 560, 656, 784, 984, 1312, 1968 //30-39
};
So yes, it really allocates a minimum of 4K.
So between 1 and 1024 int in your vector.. There is no difference in “real” weight.
var a:Vector.<int> = new Vector.<int>(1024 * 1024 +583);
Is not bigger than
var a:Vector.<int> = new Vector.<int>(1024 * 1024+1);
But why did it allocate that 1Mo when filling the array?
You may have noticed the ” <= ”
for (var i:int = 0; i <= 1024 * 1024; i++) { a[i] = 0 }
It was kinda cheating but still it demonstrates well the risk.
So by doing that pushed a value at the end of the array, at position 1024*1024+1.
that’s why the array grow that big.
There is two way of making the DA grow.
1: manually set the length of the array (array.length = X)
2: pushing a value at the end of it (if it wasn’t already big enough)
By using the first way, flash is growing the array to the EXACT size needed (within a 4K block) which is great when you already know what size you want.
But by using the second way, you tell flash to add data, but you don’t know what is going to happen next.
The algorithm for the Grow function is:
if CapacityNeeded < CurrentCapacity
if (!specified length) //using .length
newCapacity = CapacityNeeded + (CapacityNeeded >> 2);
So we’ve got a nice size = size + size / 4. that’s big!
That’s where the 1Mo is coming from.
*Edit: 2009/12/06*
By the way, the ByteArray class have an expension rate of:
uint32 newCapacity = m_capacity << 1;
hence making it twice the size each grow. and there is no “exact” set size like arrays or vectors. So watch out!
But that’s not all. The next step of growing the array, is the allocation!
Allocate New Size
Copy Old Data to new memory block
Reset old data to 0
Free the block (let it be Garbage Collected)
VMPI_memcpy(newArray, m_array, m_length * sizeof(Atom));
VMPI_memset(oldAtoms, 0, m_length*sizeof(Atom));
gc->Free(oldAtoms);
So if you have a 1Mo Vector, and you want it to be 1.00001 Mo, you need 2.00001 Mo of Ram to do it!
Okay… fine.
But what happen when I have a variable length vector? Something that’s going up at first but then stay stable?
Or what if i just want to use it as a generic buffer?
Well allocate the memory you need (vector.length = 1024*1024) and then reset it to zero to free the space
(vector.length = 0)… WRONG!
You can’t. You just can’t. Forget it.
Yup, there is nothing to make the array smaller once it has grow.
So what do you do? Create a new one and copy the whole thing in a smaller one.
In fact, there is a nice function “pack()” to do that job, but.. It’s not implemented.
What have we learn?
You should ALWAYS specify the length you want to use.
If you’re not sure, set it to 1000 (one block for int)
But if you do that, keep in mind that memory is copied and set in another memory space when growing.
Some smaller topics: Sorting
While in the vector class I took a look at the sorting algorithm.
At first I though I had something big. That it was inefficient. But it’s not that bad.
One thing you may want to know is that the vector is using the Array sort. They didn’t re-create a sort for the vector.
In the code you can see:
// Borrow the sort function from array
private static native function _sort(o, args:Array);
prototype.sort = function(comparefn){
var a : Array = [comparefn];
return _sort(castToThisType(this), a);
funny 😉
Ok so what is the array sorting algorithm? I’m just going to paste the exact comments from the code.
// This is an iterative implementation of the recursive quick sort.
// Recursive implementations are basically storing nested (lo,hi) pairs
// in the stack frame, so we can avoid the recursion by storing them
// in an array.
//
// Once partitioned, we sub-partition the smaller half first. This means
// the greatest stack depth happens with equal partitions, all the way down,
// which would be 1 + log2(size), which could never exceed 33.
It’s also good to know that under four elements in a stackframe they use simple comparison between items to skip unnecessary stackframe use.
Even if the Vector is using the exact array sort source, it doesn’t allow us to enter all the option that array does.
I don’t know why… I have no idea.
The algorithm does a pre-sort first to divide the data in three parts:
// The portion of the array containing defined values is now [0, iFirstUndefined).
// The portion of the array containing values undefined is now [iFirstUndefined, iFirstAbsent).
// The portion of the array containing absent values is now [iFirstAbsent, len).
And then do the QuickSort on the first part.
Also, when using the Array sort (array.sortOn) it’s going to do a FieldCompare.
By doing so, the algorithm first make a new array of the same size. And then copy all values in it.
It sorts this new array, and return it. Keep in mind that it’s allocating a lot of memory when sorting this way.
That’s all I got. Nothing too bad in here 😉
The code running flash is divided in some part. Some written in C++; Some in as3.
Here is the two utility function of the vector that are coded directly in AS3.
I assume there would be no loss of performance by re-writing those in your code.
AS3 function indexOf(value:Object, from:Number=0): Number {
var start:uint = clamp( from, length );
for ( var i:uint=start, limit:uint=length ; i < limit ; i++ )
if (this[i] === value)
return i;
return -1;
AS3 function indexOf(value:int, from:Number=0): Number {
var start:uint = clamp( from, length );
for ( var i:uint=start, limit:uint=length ; i < limit ; i++ )
if (this[i] === value)
return i;
return -1;
Ok that’s all for today!
There is two post coming very soon:
The GARBAGE COLLECTOR. Most of the work is done. I’m just making sure everything is true 😉
It’s a really interesting topic since it affects almost everyone that needs performances!
Also, there is a huge security problem in flash and I will talk about it in a few days.
Using this flaw, I was able to do *anything I wanted* in *any *flash app* I know!
Stay tuned!
add to del.icio.usAdd to Blinkslistadd to furlDigg itadd to ma.gnoliaStumble It!add to simpyseed the vineTailRankpost to facebook
From → general
8 Comments
1. A really interesting read. Thanks for the insights. But I’d like to take issue with this assertion (I’m happy to be corrected if I’m wrong):
>>What have we learn?
>>You should ALWAYS specify the length you want to use.
This may make memory management sense but I don’t think it makes performance sense. A quick test of this:
var st:int = getTimer();
var len:int = 10000000;
var array:Array = new Array(len);
//var array = [];
for (var a:int = 0; a < len; a++) {
array.push(a);
}
trace (array.length, getTimer() – st);
Swap out the two Array declarations and see the performance difference. The gradually lengthening array appears to be much faster. Am I missing something?
• I’m going to verify that a bit later, but you should definitively use array[a] = a; instead of push!
• A very fair catch (old habits die hard). As long as you use array[a] instead of push() there’s no noticeable difference. Does make one wonder, though, about the performance efficiency of the fixed-length version, though.
• This post was really about memory consumption and not so much about speed performances. If you insert data without specifying the length the final size in memory will be WAY bigger than if previously specified. That’s the real issue I’m talking about.
For a small application it’s not that important. but when you make something really big (let’s say a MMO) it’s VERY important to keep the memory low!
2. Very interesting article indeed. It will be helpful for the development of our new Flash 3D-Engine. If you’re interested, you’re welcome to become part of our community: http://blog.badnoob.com
Kind Regards from Germany,
Daniel
Trackbacks & Pingbacks
1. Base64 Optimized as3 lib « jpauclair
2. Tweets that mention Tamarin part II – More on Array and Vector « jpauclair -- Topsy.com
3. jpauclair.net: 6 Months – Articles recap. « jpauclair
Comments are closed.
%d bloggers like this:
|
{
"url": "https://jpauclair.net/2009/12/05/tamarin-part-ii-more-on-array-and-vector/",
"source_domain": "jpauclair.net",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "81648",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZXD6ZWJXFTDQCV7WF2YQWKUYW2FPC5L4",
"WARC-Concurrent-To": "<urn:uuid:0e727a01-1641-4cf0-86de-d0946fa8c9a1>",
"WARC-Date": "2020-04-08T01:17:28Z",
"WARC-IP-Address": "192.0.78.24",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:Q2TMDFSTU5VJ5WOVPM3MAIPHRPLW7TFM",
"WARC-Record-ID": "<urn:uuid:f012cd1a-d3fe-4810-8aa1-75b9ca15f6a3>",
"WARC-Target-URI": "https://jpauclair.net/2009/12/05/tamarin-part-ii-more-on-array-and-vector/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6d45cb41-1a69-4381-af4e-23469a8a8ed3>"
},
"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-222.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
16,
17,
60,
61,
78,
79,
91,
92,
108,
109,
132,
133,
185,
186,
272,
273,
304,
305,
332,
333,
387,
388,
419,
420,
456,
457,
480,
481,
535,
536,
567,
568,
591,
592,
686,
687,
717,
718,
747,
748,
800,
856,
857,
888,
889,
940,
941,
958,
959,
1012,
1013,
1115,
1116,
1197,
1198,
1297,
1298,
1379,
1380,
1509,
1510,
1568,
1613,
1615,
1683,
1750,
1815,
1877,
1942,
2008,
2031,
2083,
2144,
2217,
2291,
2366,
2369,
2370,
2415,
2416,
2500,
2501,
2558,
2559,
2578,
2579,
2633,
2634,
2691,
2692,
2724,
2725,
2781,
2782,
2845,
2846,
2928,
2929,
2965,
2966,
3006,
3007,
3066,
3067,
3137,
3138,
3291,
3292,
3398,
3399,
3439,
3440,
3476,
3517,
3575,
3576,
3632,
3633,
3670,
3671,
3690,
3749,
3750,
3788,
3901,
3902,
3977,
3978,
3996,
4030,
4050,
4095,
4152,
4201,
4221,
4222,
4322,
4323,
4335,
4336,
4447,
4448,
4502,
4503,
4609,
4610,
4638,
4639,
4677,
4678,
4744,
4745,
4824,
4825,
4912,
4913,
4933,
4934,
4988,
4989,
5044,
5045,
5146,
5147,
5176,
5177,
5243,
5244,
5331,
5332,
5452,
5453,
5478,
5479,
5518,
5571,
5609,
5642,
5685,
5686,
5694,
5695,
5796,
5797,
5865,
5937,
6006,
6022,
6025,
6098,
6175,
6238,
6239,
6380,
6381,
6499,
6500,
6534,
6535,
6606,
6607,
6690,
6786,
6867,
6868,
6913,
6914,
6994,
6995,
7095,
7096,
7209,
7210,
7254,
7255,
7337,
7338,
7417,
7418,
7499,
7500,
7560,
7612,
7686,
7725,
7755,
7778,
7779,
7836,
7888,
7962,
8001,
8031,
8054,
8055,
8080,
8081,
8117,
8118,
8209,
8210,
8300,
8301,
8389,
8390,
8472,
8473,
8485,
8486,
8616,
8617,
8632,
8633,
8644,
8790,
8791,
8817,
8877,
8878,
8988,
8989,
9018,
9046,
9084,
9106,
9146,
9165,
9171,
9214,
9215,
9374,
9375,
9482,
9483,
9712,
9713,
9971,
9972,
10128,
10129,
10328,
10329,
10360,
10371,
10372,
10395,
10396,
10438,
10531,
10590,
10591,
10612,
10613
],
"line_end_idx": [
16,
17,
60,
61,
78,
79,
91,
92,
108,
109,
132,
133,
185,
186,
272,
273,
304,
305,
332,
333,
387,
388,
419,
420,
456,
457,
480,
481,
535,
536,
567,
568,
591,
592,
686,
687,
717,
718,
747,
748,
800,
856,
857,
888,
889,
940,
941,
958,
959,
1012,
1013,
1115,
1116,
1197,
1198,
1297,
1298,
1379,
1380,
1509,
1510,
1568,
1613,
1615,
1683,
1750,
1815,
1877,
1942,
2008,
2031,
2083,
2144,
2217,
2291,
2366,
2369,
2370,
2415,
2416,
2500,
2501,
2558,
2559,
2578,
2579,
2633,
2634,
2691,
2692,
2724,
2725,
2781,
2782,
2845,
2846,
2928,
2929,
2965,
2966,
3006,
3007,
3066,
3067,
3137,
3138,
3291,
3292,
3398,
3399,
3439,
3440,
3476,
3517,
3575,
3576,
3632,
3633,
3670,
3671,
3690,
3749,
3750,
3788,
3901,
3902,
3977,
3978,
3996,
4030,
4050,
4095,
4152,
4201,
4221,
4222,
4322,
4323,
4335,
4336,
4447,
4448,
4502,
4503,
4609,
4610,
4638,
4639,
4677,
4678,
4744,
4745,
4824,
4825,
4912,
4913,
4933,
4934,
4988,
4989,
5044,
5045,
5146,
5147,
5176,
5177,
5243,
5244,
5331,
5332,
5452,
5453,
5478,
5479,
5518,
5571,
5609,
5642,
5685,
5686,
5694,
5695,
5796,
5797,
5865,
5937,
6006,
6022,
6025,
6098,
6175,
6238,
6239,
6380,
6381,
6499,
6500,
6534,
6535,
6606,
6607,
6690,
6786,
6867,
6868,
6913,
6914,
6994,
6995,
7095,
7096,
7209,
7210,
7254,
7255,
7337,
7338,
7417,
7418,
7499,
7500,
7560,
7612,
7686,
7725,
7755,
7778,
7779,
7836,
7888,
7962,
8001,
8031,
8054,
8055,
8080,
8081,
8117,
8118,
8209,
8210,
8300,
8301,
8389,
8390,
8472,
8473,
8485,
8486,
8616,
8617,
8632,
8633,
8644,
8790,
8791,
8817,
8877,
8878,
8988,
8989,
9018,
9046,
9084,
9106,
9146,
9165,
9171,
9214,
9215,
9374,
9375,
9482,
9483,
9712,
9713,
9971,
9972,
10128,
10129,
10328,
10329,
10360,
10371,
10372,
10395,
10396,
10438,
10531,
10590,
10591,
10612,
10613,
10635
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10635,
"ccnet_original_nlines": 293,
"rps_doc_curly_bracket": 0.0012223799712955952,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3402390480041504,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022310759872198105,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3123506009578705,
"rps_doc_frac_unique_words": 0.367441862821579,
"rps_doc_mean_word_length": 4.464534759521484,
"rps_doc_num_sentences": 156,
"rps_doc_symbol_to_word_ratio": 0.001992030069231987,
"rps_doc_unigram_entropy": 5.720058917999268,
"rps_doc_word_count": 1720,
"rps_doc_frac_chars_dupe_10grams": 0.04948560893535614,
"rps_doc_frac_chars_dupe_5grams": 0.10196640342473984,
"rps_doc_frac_chars_dupe_6grams": 0.07422842085361481,
"rps_doc_frac_chars_dupe_7grams": 0.058340929448604584,
"rps_doc_frac_chars_dupe_8grams": 0.058340929448604584,
"rps_doc_frac_chars_dupe_9grams": 0.058340929448604584,
"rps_doc_frac_chars_top_2gram": 0.013543429784476757,
"rps_doc_frac_chars_top_3gram": 0.012501630000770092,
"rps_doc_frac_chars_top_4gram": 0.022659199312329292,
"rps_doc_books_importance": -1132.0052490234375,
"rps_doc_books_importance_length_correction": -1132.0052490234375,
"rps_doc_openwebtext_importance": -622.8241577148438,
"rps_doc_openwebtext_importance_length_correction": -622.8241577148438,
"rps_doc_wikipedia_importance": -437.5222473144531,
"rps_doc_wikipedia_importance_length_correction": -437.5222473144531
},
"fasttext": {
"dclm": 0.10549622774124146,
"english": 0.8058742880821228,
"fineweb_edu_approx": 1.8306174278259277,
"eai_general_math": 0.6681016683578491,
"eai_open_web_math": 0.22155886888504028,
"eai_web_code": 0.401725172996521
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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": "16",
"label": "Personal Blog"
},
"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
|
-4,194,814,292,179,944,400 |
working on it ...
Filters
Explore Public Snippets
Sort by
Found 430 snippets matching: logical
public by sjschmalfeld 3307 9 5 2
Rename Logical Name Database SQL Server
Changes the logical name of a database
// Enter here the actual content of the snippet.
-- Rename logical names (only needed if restoring from a backup for a Different database):
ALTER DATABASE MyDatabase
MODIFY FILE (NAME = 'OrigDatabase_Data', NEWNAME = 'MyDatabase_data')
GO
ALTER DATABASE MyDatabase
MODIFY FILE (NAME = 'OrigDatabase_Log', NEWNAME = 'MyDatabase_log')
GO
public by cghersi 3364 3 6 4
Change the location of MS SQL Server database files
When you start playing with serious DB, one of the most important parts is to place (if possible) the files in different drives (physical, not only logical partitions!!!). But what if you already have your DB in production with tons of data on the same location? This script helps in solving the issue. It should be executed in three steps: 1) p
-- 1) Execute this first chunk to put the DB offline
ALTER DATABASE MyDBName SET SINGLE_USER WITH ROLLBACK IMMEDIATE;
ALTER DATABASE MyDBName SET OFFLINE;
ALTER DATABASE MyDBName MODIFY FILE
(
Name = MyDBName_Data,
Filename = 'D:\DB\MyDBName.mdf'
);
ALTER DATABASE MyDBName MODIFY FILE
(
Name = MyDBName_Log,
Filename = 'D:\DBLog\MyDBName_log.ldf'
);
ALTER DATABASE MyDBName MODIFY FILE
(
Name = MyDBName_Idx,
Filename = 'E:\DBIndex\MyDBName_log.ndf'
);
-- 2) Manually move the files in the right location
-- 3) Execute this second chunk to put the DB online
ALTER DATABASE my SET ONLINE;
ALTER DATABASE my SET MULTI_USER;
public by cghersi 3166 1 7 1
Find worst SQL performing queries
You might have seen a number of queries which provides you with top 10 or top 5 worst performing queries either by Logical IO’s or by CPU time or by Elapsed Time.. I have similar query but it does many more thing. I personally do not query either by total logical reads or total cpu time or total elapsed time individually. I usually use this quer
with PerformanceMetrics
as
(
select
--dest.text,
--statement_start_offset,
--statement_end_offset,
--LEN(dest.text) ln,
substring
(
dest.text,
statement_start_offset/2,
case when statement_end_offset = -1 then LEN(dest.text)
else statement_end_offset
end /2
) as 'Text of the SQL' ,
deqs.plan_generation_num as 'Number of times the plan was generated for this SQL',
execution_count as 'Total Number of Times the SQL was executed',
DENSE_RANK() over(order by execution_count desc) as 'Rank of the SQL by Total number of Executions',
total_elapsed_time/1000 as 'Total Elapsed Time in ms consumed by this SQL',
DENSE_RANK() over(order by total_elapsed_time desc) as 'Rank of the SQL by Total Elapsed Time',
Max_elapsed_time/1000 as 'Maximum Elapsed Time in ms consumed by this SQL',
min_elapsed_time/1000 as 'Minimum Elapsed Time in ms consumed by this SQL',
total_elapsed_time/1000*nullif(execution_count,0) as 'Average Elapsed Time in ms consumed by this SQL',
DENSE_RANK() over(order by total_elapsed_time/nullif(execution_count,0) desc) as 'Rank of the SQL by Average Elapsed Time',
total_worker_time as 'Total CPU Time in ms consumed by this SQL',
DENSE_RANK() over(order by total_worker_time desc) as 'Rank of the SQL by Total CPU Time',
Max_worker_time as 'Maximum CPU Time in ms consumed by this SQL',
min_worker_time as 'Minimum CPU Time in ms consumed by this SQL',
total_worker_time/nullif(execution_count,0) as 'Average CPU Time in ms consumed by this SQL',
DENSE_RANK() over(order by total_worker_time/nullif(execution_count,0) desc) as 'Rank of the SQL by Average CPU Time',
total_logical_reads as 'Total Logical Reads Clocked by this SQL',
DENSE_RANK() over(order by total_logical_reads desc) as 'Rank of the SQL by Total Logical reads',
Max_logical_reads as 'Maximum Logical Reads Clocked by this SQL',
min_logical_reads as 'Minimum Logical Reads Clocked by this SQL',
total_logical_reads/nullif(execution_count,0) as 'Average Logical Reads Clocked by this SQL',
DENSE_RANK() over(order by total_logical_reads/nullif(execution_count,0) desc) as 'Rank of the SQL by Average Logical reads',
total_physical_reads as 'Total Physical Reads Clocked by this SQL',
DENSE_RANK() over(order by total_physical_reads desc) as 'Rank of the SQL by Total Physical Reads',
Max_physical_reads as 'Maximum Physical Reads Clocked by this SQL',
min_physical_reads as 'Minimum Physical Reads Clocked by this SQL',
total_physical_reads/nullif(execution_count,0) as 'Average Physical Reads Clocked by this SQL',
DENSE_RANK() over(order by total_physical_reads/nullif(execution_count,0) desc) as 'Rank of the SQL by Average Physical Reads',
total_logical_writes as 'Total Logical Writes Clocked by this SQL',
DENSE_RANK() over(order by total_logical_writes desc) as 'Rank of the SQL by Total Logical Writes',
Max_logical_writes as 'Maximum Logical Writes Clocked by this SQL',
min_logical_writes as 'Minimum Logical Writes Clocked by this SQL',
total_logical_writes/nullif(execution_count,0) as 'Average Logical Writes Clocked by this SQL',
DENSE_RANK() over(order by total_logical_writes/nullif(execution_count,0) desc) as 'Rank of the SQL by Average Logical Writes',
deqp.query_plan as 'Plan of Query'
--similarly you can add the ranks for maximum values as well.That is quite useful in finding some of the perf issues.
from
sys.dm_exec_query_stats deqs
/*F0C6560A-9AD1-448B-9521-05258EF7E3FA*/ --use a newid so that we could exclude this query from the performanc emetrics output
outer apply sys.dm_exec_query_plan(deqs.plan_handle) deqp --sometimes the plan might not be in the cache any longer.So using outer apply
outer apply sys.dm_exec_sql_text(deqs.sql_handle) dest --Sometimes the text is not returned by the dmv so use outer apply.
where
dest.text not like '%F0C6560A-9AD1-448B-9521-05258EF7E3FA%'
)
select
*
from
PerformanceMetrics
where
1=1
--apply any of these where clause in any combinations or one by one..
--and [Rank of the SQL by Average CPU Time] <= 20 --Use this to find the top N queries by avg CPU time.
--and [Rank of the SQL by Average Elapsed Time] <= 20 --Use this to find the top N queries by avg elspsed time.
--and [Rank of the SQL by Average Logical reads] <= 20 --Use this to find the top N queries by avg logical reads.
--and [Rank of the SQL by Average Physical Reads] <= 20 --Use this to find the top N queries by avg physical reads.
and [Rank of the SQL by Total CPU Time] <= 20 --Use this to find the top N queries by total CPU time.
and [Rank of the SQL by Total Elapsed Time] <= 20 --Use this to find the top N queries by total elapsed time.
and [Rank of the SQL by Total Logical reads] <= 20 --Use this to find the top N queries by Total Logical reads.
and [Rank of the SQL by Total Physical Reads] <= 20 --Use this to find the top N queries by Total Physical Reads.
and [Rank of the SQL by Total number of Executions] <= 20 --Use this to find the top N queries by Total number of Executions.
--and [Rank of the SQL by Average Logical Writes] <= 20 --Use this to find the top N queries by Average Logical Writes.
and [Rank of the SQL by Total Logical Writes] <= 20 --Use this to find the top N queries by Total Logical Writes.
--I usually do the query by 6 rank types together Total logical reads,Total CPU time, Total Elapsed Time , Total Execution count ,Total Physical Reads and Total Logical Writes.Sometimes I exclude last two counters if i do not get any query in the output.
--If some queries are say in top 10 in all these 6 categories then these needs to tune first...
--But sometime you might not get any rows at all if u use these 6 categiories in that case remove one of these categories or try one by one..
public by cghersi 1925 0 6 0
Finding actual number of physical cpu installed
By Rahul Singh, 2013/01/14 The Sql Server always see Logical cpu it does not distinguish between Hyperthreaded logical cpu and physical processor using the below query we can find out actual number of physical cpu installed on the server The first column represent logical processor and second column represent actual physical processor insta
SELECT cpu_count AS Logical_CPU_Count , cpu_count / hyperthread_ratio AS Physical_CPU_Count FROM sys.dm_os_sys_info ;
public by msdn 2334 2 7 0
GetLogicalChildrenBreadthFirst: Retrieves all the logical children of a framework element using a breadth-first search. A visual element is assumed to be a logical child of another visual element if they are in the same namescop...
Retrieves all the logical children of a framework element using a breadth-first search. A visual element is assumed to be a logical child of another visual element if they are in the same namescope. For performance reasons this method manually manages the queue instead of using recursion. The parent framework element. The logical chil
using System.Collections.Generic;
using System.Diagnostics;
using System.Linq;
using System.Windows;
using System.Windows.Media;
/// <summary>
/// Retrieves all the logical children of a framework element using a
/// breadth-first search. A visual element is assumed to be a logical
/// child of another visual element if they are in the same namescope.
/// For performance reasons this method manually manages the queue
/// instead of using recursion.
/// </summary>
/// <param name="parent">The parent framework element.</param>
/// <returns>The logical children of the framework element.</returns>
public static IEnumerable<FrameworkElement> GetLogicalChildrenBreadthFirst(this FrameworkElement parent)
{
Debug.Assert(parent != null, "The parent cannot be null.");
Queue<FrameworkElement> queue =
new Queue<FrameworkElement>(parent.GetVisualChildren().OfType<FrameworkElement>());
while (queue.Count > 0)
{
FrameworkElement element = queue.Dequeue();
yield return element;
foreach (FrameworkElement visualChild in element.GetVisualChildren().OfType<FrameworkElement>())
{
queue.Enqueue(visualChild);
}
}
}
public by msdn 1514 0 6 0
DeleteObject: The DeleteObject function deletes a logical pen, brush, font, bitmap, region, or palette, freeing all system resources associated with the object. After the object is deleted, the specified handle is no longer valid.
The DeleteObject function deletes a logical pen, brush, font, bitmap, region, or palette, freeing all system resources associated with the object. After the object is deleted, the specified handle is no longer valid. A handle to a logical pen, brush, font, bitmap, region, or palette. If the function succeeds, the return value is nonzero. If t
using System;
using System.Runtime.InteropServices;
/// <summary>
/// The DeleteObject function deletes a logical pen, brush, font, bitmap, region, or palette, freeing all system resources associated with the object. After the object is deleted, the specified handle is no longer valid.
/// </summary>
/// <param name="hObject">A handle to a logical pen, brush, font, bitmap, region, or palette.</param>
/// <returns>If the function succeeds, the return value is nonzero. If the specified handle is not valid or is currently selected into a DC, the return value is zero.</returns>
[System.Diagnostics.CodeAnalysis.SuppressMessage("Microsoft.Interoperability", "CA1414:MarkBooleanPInvokeArgumentsWithMarshalAs", Justification = "Adding this attribute causes an error."), DllImport("gdi32.dll")]
internal static extern bool DeleteObject(IntPtr hObject);
public by msdn 1258 0 5 0
TraceStopLogicalOperation: Stops actual logical operation in trace repository
Stops actual logical operation in trace repository
/// <summary>
/// Stops actual logical operation in trace repository
/// </summary>
[System.Diagnostics.CodeAnalysis.SuppressMessage("Microsoft.Security", "CA2135:SecurityRuleSetLevel2MethodsShouldNotBeProtectedWithLinkDemandsFxCopRule"),
SecurityPermission(SecurityAction.LinkDemand)]
static public void TraceStopLogicalOperation()
{
try
{
System.Diagnostics.Trace.CorrelationManager.StopLogicalOperation();
}
catch (InvalidOperationException)
{
//stack empty
}
}
public by msdn 1044 2 7 0
TraceStartLogicalOperation: Starts logical operation in trace repository
Starts logical operation in trace repository
#endregion
#region Public Methods
/// <summary>
/// Starts logical operation in trace repository
/// </summary>
/// <param name="operationName"></param>
[System.Diagnostics.CodeAnalysis.SuppressMessage("Microsoft.Security", "CA2135:SecurityRuleSetLevel2MethodsShouldNotBeProtectedWithLinkDemandsFxCopRule"),
SecurityPermission(SecurityAction.LinkDemand)]
static public void TraceStartLogicalOperation(string operationName)
{
if (String.IsNullOrEmpty(operationName))
throw new ArgumentNullException("operationName","Trace message is null or empty string");
System.Diagnostics.Trace.CorrelationManager.ActivityId = Guid.NewGuid();
System.Diagnostics.Trace.CorrelationManager.StartLogicalOperation(operationName);
}
public by msdn 2773 3 6 0
CreateVirtualHardDisk: Creates a VHD or VHDX.
Creates a VHD or VHDX. The name of the server on which to perform the action. The path to the VHD/VHDX to create. The path to the parent VHD/VHDX. The type for the new VHD/VHDX. The format of the new VHD/VHDX. The size of the new VHD/VHDX. The block size of the new VHD/VHDX. The logical sector size of the new VHD/VHDX. The physical sec
/// <summary>
/// Creates a VHD or VHDX.
/// </summary>
/// <param name="ServerName">The name of the server on which to perform the action.</param>
/// <param name="VirtualHardDiskPath">The path to the VHD/VHDX to create.</param>
/// <param name="ParentPath">The path to the parent VHD/VHDX.</param>
/// <param name="Type">The type for the new VHD/VHDX.</param>
/// <param name="Format">The format of the new VHD/VHDX.</param>
/// <param name="FileSize">The size of the new VHD/VHDX.</param>
/// <param name="BlockSize">The block size of the new VHD/VHDX.</param>
/// <param name="LogicalSectorSize">The logical sector size of the new VHD/VHDX.</param>
/// <param name="PhysicalSectorSize">The physical sector size of the new VHD/VHDX.</param>
internal static void
CreateVirtualHardDisk(
string ServerName,
string VirtualHardDiskPath,
string ParentPath,
VirtualHardDiskType Type,
VirtualHardDiskFormat Format,
Int64 FileSize,
Int32 BlockSize,
Int32 LogicalSectorSize,
Int32 PhysicalSectorSize)
{
ManagementScope scope =
new ManagementScope("\\\\" + ServerName + "\\root\\virtualization\\v2");
VirtualHardDiskSettingData settingData =
new VirtualHardDiskSettingData(
Type,
Format,
VirtualHardDiskPath,
ParentPath,
FileSize,
BlockSize,
LogicalSectorSize,
PhysicalSectorSize);
using (ManagementObject imageManagementService =
StorageUtilities.GetImageManagementService(scope))
{
using (ManagementBaseObject inParams =
imageManagementService.GetMethodParameters("CreateVirtualHardDisk"))
{
inParams["VirtualDiskSettingData"] =
settingData.GetVirtualHardDiskSettingDataEmbeddedInstance(
ServerName,
imageManagementService.Path.Path);
using (ManagementBaseObject outParams = imageManagementService.InvokeMethod(
"CreateVirtualHardDisk", inParams, null))
{
WmiUtilities.ValidateOutput(outParams, scope);
}
}
}
}
external by ??? ??? 159 0 2 0
Add only with logical operation for general
Add only with logical operation for general: AddLogical.java
public class AddLogical {
public static void main(String[] args) {
int a = 231;
int b = 35;
System.out.printf("%d + %d = %d%n", a, b, a + b);
while(b != 0){
int c = a ^ b;
b = (a & b) << 1;
a = c;
}
System.out.println(a);
}
}
• Public Snippets
• Channels Snippets
|
{
"url": "https://www.snip2code.com/Explore/All?q=logical",
"source_domain": "www.snip2code.com",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "98420",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XGOA7MFEYVY2YF7FY5MUFVZ5DPAK54LK",
"WARC-Concurrent-To": "<urn:uuid:aba5192c-f809-44aa-9b5b-c639fc4a5c43>",
"WARC-Date": "2019-12-08T18:18:34Z",
"WARC-IP-Address": "76.217.54.191",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CNEWUNZ6IJPO4RRLI3JPPUZ7NRF52YAW",
"WARC-Record-ID": "<urn:uuid:55edcea5-cf8f-49ea-9b64-96f9a8a8b180>",
"WARC-Target-URI": "https://www.snip2code.com/Explore/All?q=logical",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a19be609-52e1-4c4a-9d8f-a3077cd484cb>"
},
"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-207.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
18,
19,
27,
28,
52,
53,
61,
62,
99,
100,
142,
143,
187,
188,
231,
296,
301,
396,
427,
501,
508,
539,
611,
642,
643,
680,
681,
737,
738,
1088,
1145,
1214,
1255,
1296,
1302,
1331,
1370,
1377,
1382,
1423,
1429,
1458,
1504,
1511,
1516,
1557,
1563,
1592,
1640,
1647,
1652,
1708,
1713,
1770,
1804,
1809,
1847,
1848,
1885,
1886,
1924,
1925,
2277,
2305,
2312,
2318,
2329,
2346,
2376,
2404,
2429,
2443,
2449,
2464,
2494,
2554,
2584,
2595,
2624,
2711,
2780,
2885,
2965,
3065,
3145,
3225,
3333,
3461,
3531,
3626,
3696,
3766,
3864,
3987,
4057,
4159,
4229,
4299,
4397,
4527,
4599,
4703,
4775,
4847,
4947,
5079,
5151,
5255,
5327,
5399,
5499,
5631,
5670,
5792,
5801,
5834,
5965,
6106,
6233,
6243,
6307,
6313,
6324,
6330,
6339,
6362,
6372,
6380,
6454,
6562,
6678,
6796,
6916,
7022,
7136,
7252,
7370,
7500,
7624,
7742,
7747,
8006,
8106,
8252,
8253,
8290,
8291,
8343,
8344,
8691,
8813,
8814,
8848,
8849,
9085,
9086,
9427,
9465,
9495,
9518,
9544,
9576,
9581,
9599,
9674,
9750,
9825,
9897,
9933,
9952,
10019,
10093,
10202,
10208,
10276,
10281,
10321,
10417,
10422,
10454,
10464,
10520,
10554,
10559,
10668,
10682,
10726,
10740,
10750,
10756,
10757,
10791,
10792,
11027,
11028,
11377,
11395,
11437,
11442,
11460,
11685,
11704,
11810,
11991,
12208,
12270,
12271,
12305,
12306,
12388,
12389,
12444,
12462,
12521,
12540,
12699,
12750,
12801,
12807,
12819,
12829,
12909,
12919,
12961,
12971,
12997,
13007,
13013,
13014,
13048,
13049,
13126,
13127,
13176,
13191,
13196,
13223,
13228,
13246,
13299,
13318,
13363,
13522,
13573,
13645,
13651,
13700,
13802,
13807,
13888,
13978,
13984,
13985,
14019,
14020,
14070,
14071,
14413,
14431,
14462,
14481,
14577,
14663,
14737,
14803,
14872,
14941,
15017,
15110,
15205,
15230,
15257,
15284,
15320,
15347,
15381,
15419,
15443,
15468,
15501,
15535,
15541,
15573,
15658,
15663,
15712,
15756,
15778,
15802,
15839,
15867,
15893,
15920,
15955,
15992,
15997,
16054,
16117,
16127,
16178,
16263,
16277,
16330,
16409,
16445,
16504,
16509,
16602,
16664,
16682,
16749,
16767,
16781,
16791,
16797,
16798,
16836,
16837,
16885,
16886,
16951,
16981,
17030,
17055,
17079,
17141,
17168,
17199,
17233,
17256,
17270,
17305,
17326,
17336,
17342,
17347,
17352,
17357,
17379
],
"line_end_idx": [
18,
19,
27,
28,
52,
53,
61,
62,
99,
100,
142,
143,
187,
188,
231,
296,
301,
396,
427,
501,
508,
539,
611,
642,
643,
680,
681,
737,
738,
1088,
1145,
1214,
1255,
1296,
1302,
1331,
1370,
1377,
1382,
1423,
1429,
1458,
1504,
1511,
1516,
1557,
1563,
1592,
1640,
1647,
1652,
1708,
1713,
1770,
1804,
1809,
1847,
1848,
1885,
1886,
1924,
1925,
2277,
2305,
2312,
2318,
2329,
2346,
2376,
2404,
2429,
2443,
2449,
2464,
2494,
2554,
2584,
2595,
2624,
2711,
2780,
2885,
2965,
3065,
3145,
3225,
3333,
3461,
3531,
3626,
3696,
3766,
3864,
3987,
4057,
4159,
4229,
4299,
4397,
4527,
4599,
4703,
4775,
4847,
4947,
5079,
5151,
5255,
5327,
5399,
5499,
5631,
5670,
5792,
5801,
5834,
5965,
6106,
6233,
6243,
6307,
6313,
6324,
6330,
6339,
6362,
6372,
6380,
6454,
6562,
6678,
6796,
6916,
7022,
7136,
7252,
7370,
7500,
7624,
7742,
7747,
8006,
8106,
8252,
8253,
8290,
8291,
8343,
8344,
8691,
8813,
8814,
8848,
8849,
9085,
9086,
9427,
9465,
9495,
9518,
9544,
9576,
9581,
9599,
9674,
9750,
9825,
9897,
9933,
9952,
10019,
10093,
10202,
10208,
10276,
10281,
10321,
10417,
10422,
10454,
10464,
10520,
10554,
10559,
10668,
10682,
10726,
10740,
10750,
10756,
10757,
10791,
10792,
11027,
11028,
11377,
11395,
11437,
11442,
11460,
11685,
11704,
11810,
11991,
12208,
12270,
12271,
12305,
12306,
12388,
12389,
12444,
12462,
12521,
12540,
12699,
12750,
12801,
12807,
12819,
12829,
12909,
12919,
12961,
12971,
12997,
13007,
13013,
13014,
13048,
13049,
13126,
13127,
13176,
13191,
13196,
13223,
13228,
13246,
13299,
13318,
13363,
13522,
13573,
13645,
13651,
13700,
13802,
13807,
13888,
13978,
13984,
13985,
14019,
14020,
14070,
14071,
14413,
14431,
14462,
14481,
14577,
14663,
14737,
14803,
14872,
14941,
15017,
15110,
15205,
15230,
15257,
15284,
15320,
15347,
15381,
15419,
15443,
15468,
15501,
15535,
15541,
15573,
15658,
15663,
15712,
15756,
15778,
15802,
15839,
15867,
15893,
15920,
15955,
15992,
15997,
16054,
16117,
16127,
16178,
16263,
16277,
16330,
16409,
16445,
16504,
16509,
16602,
16664,
16682,
16749,
16767,
16781,
16791,
16797,
16798,
16836,
16837,
16885,
16886,
16951,
16981,
17030,
17055,
17079,
17141,
17168,
17199,
17233,
17256,
17270,
17305,
17326,
17336,
17342,
17347,
17352,
17357,
17379,
17402
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 17402,
"ccnet_original_nlines": 339,
"rps_doc_curly_bracket": 0.0016090100398287177,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24428477883338928,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06564337015151978,
"rps_doc_frac_lines_end_with_ellipsis": 0.008823529817163944,
"rps_doc_frac_no_alph_words": 0.29980406165122986,
"rps_doc_frac_unique_words": 0.2591295540332794,
"rps_doc_mean_word_length": 6.019009590148926,
"rps_doc_num_sentences": 150,
"rps_doc_symbol_to_word_ratio": 0.0016329200007021427,
"rps_doc_unigram_entropy": 5.352972030639648,
"rps_doc_word_count": 1999,
"rps_doc_frac_chars_dupe_10grams": 0.16198471188545227,
"rps_doc_frac_chars_dupe_5grams": 0.4052526652812958,
"rps_doc_frac_chars_dupe_6grams": 0.3856382966041565,
"rps_doc_frac_chars_dupe_7grams": 0.29039227962493896,
"rps_doc_frac_chars_dupe_8grams": 0.28033578395843506,
"rps_doc_frac_chars_dupe_9grams": 0.22116023302078247,
"rps_doc_frac_chars_top_2gram": 0.01579122059047222,
"rps_doc_frac_chars_top_3gram": 0.015292550437152386,
"rps_doc_frac_chars_top_4gram": 0.021941490471363068,
"rps_doc_books_importance": -1250.9599609375,
"rps_doc_books_importance_length_correction": -1250.9599609375,
"rps_doc_openwebtext_importance": -809.1246948242188,
"rps_doc_openwebtext_importance_length_correction": -809.1246948242188,
"rps_doc_wikipedia_importance": -519.2413330078125,
"rps_doc_wikipedia_importance_length_correction": -519.2413330078125
},
"fasttext": {
"dclm": 0.23312097787857056,
"english": 0.7106744050979614,
"fineweb_edu_approx": 2.406240940093994,
"eai_general_math": 0.6146262884140015,
"eai_open_web_math": 0.3422086834907532,
"eai_web_code": 0.7109413743019104
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,584,625,071,967,872,500 |
CODE
Oracle Code Library
JOBS
Find Or Post Oracle Jobs
FORUM
Oracle Discussion & Chat
PSOUG Home Code Snippets Oracle Reference Oracle Functions PSOUG Forum Oracle Blogs Bookmark and Share
Search the Reference Library pages:
Free
Oracle Magazine
Subscriptions
and Oracle White Papers
Oracle NULLs
Version 11.1
NOTE: Null In Oracle is an absence of information. A null can be assigned but it cannot be equated with anything, including itself. NULL values represent missing or unknown data. NULL values are not an integer, a character, or any other specific data type. Note that NULL is not the same as an empty data string or the numerical value '0'.
While this behavior is ANSI compliant it is not similar to the behavior in many other commercial RDBMS products.
A simple SELECT statement to use for demonstrating the properties of NULL SELECT COUNT(*)
FROM all_tables
WHERE 1 = 1;
A NULL is not equal to a NULL SELECT COUNT(*)
FROM all_tables
WHERE NULL = NULL;
A NULL cannot be not equal to a NULL SELECT COUNT(*)
FROM all_tables
WHERE NULL <> NULL;
A NULL is does not equal an empty string SELECT COUNT(*)
FROM all_tables
WHERE NULL = '';
A NULL can be used in an INSERT
CREATE TABLE test (
test1 NUMBER(10),
test2 VARCHAR2(20));
INSERT INTO test
(test1, test2)
VALUES
(1, NULL);
INSERT INTO test
(test1, test2)
VALUES
(NULL, 'A');
SELECT *
FROM test;
NOTE: Null is a state of being that can be interrogated as to whether it does or does not exist.
A simple SELECT based on a column with a NULL SELECT *
FROM test
WHERE test1 IS NULL;
SELECT *
FROM test
WHERE test1 IS NOT NULL
A NULL can be used in an UPDATE UPDATE test
SET test1 = '2'
WHERE test2 IS NULL;
SELECT *
FROM test;
UPDATE test
SET test2 = 'B'
WHERE test2 IS NOT NULL;
SELECT *
FROM test;
A column can be updated to not contain a value UPDATE test
SET test1 = NULL
WHERE ROWNUM = 1;
SELECT *
FROM test;
NULL can be used as part of the WHERE clause criteria in a DELETE Statement DELETE FROM test
WHERE test1 IS NULL;
SELECT *
FROM test;
Understand the implications of NULL
CREATE TABLE t (
col1 NUMBER(3),
col2 NUMBER(3),
col3 NUMBER(3));
desc t
INSERT INTO t
(col1, col2, col3)
VALUES
(1, NULL, NULL);
INSERT INTO t
(col1, col2, col3)
VALUES
(NULL, 2, NULL);
INSERT INTO t
(col1, col2, col3)
VALUES
(NULL, NULL, 3);
INSERT INTO t
(col1, col2, col3)
VALUES
(4, 4, 4);
COMMIT;
SELECT *
FROM t;
SELECT SUM(RESULT_TMP) RESULT
FROM (
SELECT col1 - (col2 + col3) RESULT_TMP
FROM t);
SELECT SUM(col1) - (SUM(col2) + SUM(col3)) RESULT
FROM t;
Note: For any row that has one of the values null, the entire row sums to null and is not included in the second query but the other columns in the row contribute to the sums in the query. So the first query includes more terms than the second.
Related Topics
Miscellaneous Functions: NVL
Miscellaneous Functions: NVL2
Select
Home : Code Library : Sponsors : Privacy : Terms of Use : Contact Us [217 users online] © 2010 psoug.org
|
{
"url": "http://psoug.org/reference/null.html",
"source_domain": "psoug.org",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "26784",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SHIX7ELEO2543SYOWJIWQSUQEJDXTI44",
"WARC-Concurrent-To": "<urn:uuid:e7545994-3bce-473b-b228-b9a3768fd844>",
"WARC-Date": "2017-02-21T12:01:44Z",
"WARC-IP-Address": "64.182.123.20",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:VHIAOOCPNBQVI32BI22ZWREXYKCWZS5Z",
"WARC-Record-ID": "<urn:uuid:72b03f06-8d1f-461d-bd42-1735dab21e6a>",
"WARC-Target-URI": "http://psoug.org/reference/null.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a4536813-8ad2-494c-97eb-a8ea4b04c259>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-09\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
1,
2,
7,
27,
32,
57,
63,
88,
191,
193,
232,
233,
238,
254,
268,
292,
293,
306,
319,
321,
661,
662,
775,
865,
881,
894,
940,
956,
975,
1028,
1044,
1064,
1121,
1137,
1154,
1155,
1188,
1208,
1228,
1251,
1252,
1269,
1284,
1291,
1302,
1303,
1320,
1335,
1342,
1355,
1356,
1365,
1376,
1378,
1475,
1530,
1540,
1561,
1562,
1571,
1581,
1605,
1649,
1665,
1686,
1687,
1696,
1707,
1708,
1720,
1736,
1761,
1762,
1771,
1782,
1841,
1858,
1876,
1877,
1886,
1897,
1990,
2011,
2012,
2021,
2032,
2033,
2069,
2086,
2102,
2118,
2135,
2136,
2143,
2144,
2158,
2177,
2184,
2201,
2202,
2216,
2235,
2242,
2259,
2260,
2274,
2293,
2300,
2317,
2318,
2332,
2351,
2358,
2369,
2370,
2378,
2379,
2388,
2396,
2397,
2427,
2434,
2476,
2487,
2488,
2538,
2546,
2547,
2792,
2794,
2809,
2838,
2868,
2875,
2877
],
"line_end_idx": [
1,
2,
7,
27,
32,
57,
63,
88,
191,
193,
232,
233,
238,
254,
268,
292,
293,
306,
319,
321,
661,
662,
775,
865,
881,
894,
940,
956,
975,
1028,
1044,
1064,
1121,
1137,
1154,
1155,
1188,
1208,
1228,
1251,
1252,
1269,
1284,
1291,
1302,
1303,
1320,
1335,
1342,
1355,
1356,
1365,
1376,
1378,
1475,
1530,
1540,
1561,
1562,
1571,
1581,
1605,
1649,
1665,
1686,
1687,
1696,
1707,
1708,
1720,
1736,
1761,
1762,
1771,
1782,
1841,
1858,
1876,
1877,
1886,
1897,
1990,
2011,
2012,
2021,
2032,
2033,
2069,
2086,
2102,
2118,
2135,
2136,
2143,
2144,
2158,
2177,
2184,
2201,
2202,
2216,
2235,
2242,
2259,
2260,
2274,
2293,
2300,
2317,
2318,
2332,
2351,
2358,
2369,
2370,
2378,
2379,
2388,
2396,
2397,
2427,
2434,
2476,
2487,
2488,
2538,
2546,
2547,
2792,
2794,
2809,
2838,
2868,
2875,
2877,
3034
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3034,
"ccnet_original_nlines": 135,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2222222238779068,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.2389649897813797,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25418567657470703,
"rps_doc_frac_unique_words": 0.34530937671661377,
"rps_doc_mean_word_length": 4.4371256828308105,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.580583095550537,
"rps_doc_word_count": 501,
"rps_doc_frac_chars_dupe_10grams": 0.05128204822540283,
"rps_doc_frac_chars_dupe_5grams": 0.23841655254364014,
"rps_doc_frac_chars_dupe_6grams": 0.22941969335079193,
"rps_doc_frac_chars_dupe_7grams": 0.17453891038894653,
"rps_doc_frac_chars_dupe_8grams": 0.1385515034198761,
"rps_doc_frac_chars_dupe_9grams": 0.1187584325671196,
"rps_doc_frac_chars_top_2gram": 0.020242910832166672,
"rps_doc_frac_chars_top_3gram": 0.0440845713019371,
"rps_doc_frac_chars_top_4gram": 0.04048582911491394,
"rps_doc_books_importance": -328.11395263671875,
"rps_doc_books_importance_length_correction": -328.11395263671875,
"rps_doc_openwebtext_importance": -188.27159118652344,
"rps_doc_openwebtext_importance_length_correction": -188.27159118652344,
"rps_doc_wikipedia_importance": -91.03045654296875,
"rps_doc_wikipedia_importance_length_correction": -91.03045654296875
},
"fasttext": {
"dclm": 0.7291707396507263,
"english": 0.640129029750824,
"fineweb_edu_approx": 2.8610265254974365,
"eai_general_math": 0.010211770422756672,
"eai_open_web_math": 0.17127007246017456,
"eai_web_code": 0.07399929314851761
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,667,186,530,093,307,000 |
Skip to Content
WoW Insider has the latest on the Mists of Pandaria!
The lack of wands in Cataclysm
Very recently, a reader by the name of Jasper submitted a question via our tip line: Why can't enchanters make wands beyond level 30? I don't have an answer to that question, beyond "because they make enough money as it is." However, it made me look into the wands available at level 85 and items for the ranged slot in general.
There are no level 85, pre-heroic wands for classes that do not use spirit. There is only one ilevel 333 wand in the game, and it drops in Grim Batol. All other ranged slots have ilevel 333 (or ilevel 346) bind on equip items available. This puts casters at an obvious (though admittedly minor) disadvantage when trying to gear for heroics.
For classes that use relics, scribes are able to craft the following: Each of these items is ilevel 346 -- they're not cheap, but you can acquire them with a chunk of gold or a little time spent solo farming. Picking up one of these relics on the auction house (or having a friend craft one for you) will kick-start you on your way into heroics. They're legitimately good items on par with heroic gear, and they will help your average ilevel along.
For classes able to equip guns and crossbows, engineers can provide the following:
These items are ilevel 333. There is the ilevel 346 Kickback 5000, but that requires a Chaos Orb to craft and isn't nearly as accessible as the 333 items. Still, it is a bind on equip, heroic-quality gun that you could get off of the auction house if you wish to do so. There is no bow option -- but personal preferences aside, if you can use a bow, you can use a gun or a crossbow, so a bow option isn't necessary.
Update: There actually is an ilevel 346 bow crafted by engineers that I managed to miss, despite being a 525 engineer. The Overpowered Chicken Splitter is your friend!
There are zero bind on equip options for wands with an ilevel of 333 or higher. The last BOE wand is the world drop Cyu's Ornate Wand of ilevel 316, but more likely you'll be using the ilevel 318 Beach-Sweeper Wand (Alliance) / Shackle-Shatter Wand (Horde) from one of the earliest quests in Twilight Highlands.
The only ilevel 333 option for wands is the Wand of Untainted Power, a spirit wand that drops from Forgemaster Throngus in Grim Batol. Not only can casters not acquire a BoE wand like every other ranged item, there is only one pre-heroic wand, and it isn't particularly desirable to classes that don't utilize spirit heavily. At least you can reforge spirit -- despite being listed among the primary stats, it is considered a secondary stat. You can dump half of it if you'd like.
Why is there only one wand option prior to heroics? The lack of BoEs aside, the wand drops are just unfortunately placed. The ilevel 346 wands that become accessible in heroics are:
• Corla's Baton This wand drops from Corla, Herald of Twilight in Blackrock Caverns. The normal version of this wand is not a 333 item. Blackrock Caverns is likely the very first instance you will run stepping into Cataclysm content, so the non-heroic version of the wand is ilevel 308.
• Cookie's Stirring Rod The normal version of this wand doesn't even drop in post-80 content. The normal version of Deadmines is still for level 15+ players, so the normal version of this wand is a mere ilevel 20.
So of the three wands available with an ilevel of 346, only one of them has an ilevel 333 equivalent. This is an unfortunate gearing gap that could have been bridged with crafted wands. Why aren't there any crafted wands? I'm not sure. Was it intended, or did the problem just not cross the developers' minds? Enchanters haven't made wands since level 30, so the idea may not have ever been brought to the table.
Also, there really is the possibility that the developers believe enchanting is too profitable as it is, and I might even agree with that. Many enchanters have built castles made of gold at the release of this expansion and the last just via disenchanting items and selling dusts and essences at ludicrous prices. Making one trade skill too profitable is a real concern. Would crafted wands have pushed it over the edge? Maybe.
Is the lack of ilevel 333 wands a game-breaking concern? Not at all. Casters can still gear up for heroics fairly quickly if they set their mind to it; they're just at a small disadvantage compared to others. Their wand slot will be dragging down their ilevel, and they will need to make it up elsewhere, but it isn't going to be so damaging that they will be unable to gear up for heroics.
Still, it's an imbalance in gearing/itemization, and one that's easily fixed via crafted wands. Do other instances of itemization gaps exist in Cataclysm? Yes, but this is the most obvious and probably the easiest to fix.
Sorry Jasper, I don't have an answer to your question. I don't know why enchanters don't craft wands anymore -- but they should.
World of Warcraft: Cataclysm has destroyed Azeroth as we know it; nothing is the same! In WoW Insider's Guide to Cataclysm, you can find out everything you need to know about WoW's third expansion, from leveling up a new goblin or worgen to breaking news and strategies on endgame play.
Filed under: Analysis / Opinion, Cataclysm
Reader Comments (Page 6 of 6)
WoW Insider Show
Subscribe via iTunes for our latest show.
Hot Topics
Upcoming Events
Around Azeroth
Around Azeroth
Featured Galleries
It came from the Blog: Occupy Orgrimmar
Midsummer Flamefest 2013
Running of the Orphans 2013
World of Warcraft Tattoos
HearthStone Sample Cards
HearthStone Concept Art
Yaks
It came from the Blog: Lunar Lunacy 2013
Art of Blizzard Gallery Opening
Categories
|
{
"url": "http://wow.joystiq.com/2011/01/05/the-lack-of-wands-in-cataclysm/6",
"source_domain": "wow.joystiq.com",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "89960",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UAYPPQAPVPAQLNNHUXV35FXAPXXTJ3HQ",
"WARC-Concurrent-To": "<urn:uuid:e0f2944d-e947-455a-9252-1c05cb5db5a9>",
"WARC-Date": "2014-08-30T20:23:53Z",
"WARC-IP-Address": "149.174.149.2",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:YAELNGYBOZPPY7GAMORRSMA3YMKSZE76",
"WARC-Record-ID": "<urn:uuid:20168b74-0d08-4ea9-a3c9-103d49a13433>",
"WARC-Target-URI": "http://wow.joystiq.com/2011/01/05/the-lack-of-wands-in-cataclysm/6",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:44a7ba84-3982-4f20-b534-48f44d652029>"
},
"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,
16,
17,
70,
71,
102,
103,
432,
433,
774,
775,
1224,
1225,
1308,
1724,
1725,
1893,
1894,
2206,
2207,
2688,
2689,
2871,
3160,
3376,
3789,
3790,
4218,
4219,
4610,
4611,
4833,
4834,
4963,
5250,
5251,
5294,
5295,
5325,
5326,
5344,
5345,
5388,
5389,
5400,
5401,
5402,
5404,
5405,
5421,
5422,
5423,
5438,
5439,
5454,
5455,
5474,
5475,
5515,
5540,
5568,
5594,
5619,
5643,
5648,
5689,
5721,
5722,
5724,
5725
],
"line_end_idx": [
16,
17,
70,
71,
102,
103,
432,
433,
774,
775,
1224,
1225,
1308,
1724,
1725,
1893,
1894,
2206,
2207,
2688,
2689,
2871,
3160,
3376,
3789,
3790,
4218,
4219,
4610,
4611,
4833,
4834,
4963,
5250,
5251,
5294,
5295,
5325,
5326,
5344,
5345,
5388,
5389,
5400,
5401,
5402,
5404,
5405,
5421,
5422,
5423,
5438,
5439,
5454,
5455,
5474,
5475,
5515,
5540,
5568,
5594,
5619,
5643,
5648,
5689,
5721,
5722,
5724,
5725,
5735
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5735,
"ccnet_original_nlines": 69,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.430948406457901,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005823629908263683,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16139766573905945,
"rps_doc_frac_unique_words": 0.4085487127304077,
"rps_doc_mean_word_length": 4.493041515350342,
"rps_doc_num_sentences": 54,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.419889450073242,
"rps_doc_word_count": 1006,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03407080098986626,
"rps_doc_frac_chars_dupe_6grams": 0.02654867060482502,
"rps_doc_frac_chars_dupe_7grams": 0.012389379553496838,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.007743360009044409,
"rps_doc_frac_chars_top_3gram": 0.014159290120005608,
"rps_doc_frac_chars_top_4gram": 0.015929199755191803,
"rps_doc_books_importance": -544.2122192382812,
"rps_doc_books_importance_length_correction": -544.2122192382812,
"rps_doc_openwebtext_importance": -306.9592590332031,
"rps_doc_openwebtext_importance_length_correction": -306.9592590332031,
"rps_doc_wikipedia_importance": -233.9448699951172,
"rps_doc_wikipedia_importance_length_correction": -233.9448699951172
},
"fasttext": {
"dclm": 0.24141162633895874,
"english": 0.936836838722229,
"fineweb_edu_approx": 1.4210342168807983,
"eai_general_math": 0.11646831035614014,
"eai_open_web_math": 0.24450212717056274,
"eai_web_code": 0.06509500741958618
}
}
|
{
"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": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"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": "1",
"label": "News/Editorial"
},
"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": "16",
"label": "Personal Blog"
}
},
"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
|
-5,985,234,883,249,311,000 |
3
$\begingroup$
How could I load an external image and display it in Image Editor automatically? Basically the same as when rendering an image and displaying the Render Result.
I'm already able to load the image programatically. However, I don't get how to display the image in the Image Editor.
$\endgroup$
1 Answer 1
5
$\begingroup$
If the image editor is used in one of the visible areas of the current workspace, you can iterate through bpy.context.screen.areas to find the one with type IMAGE_EDITOR. The image that is shown in the editor can be set through the space of the area.
An image can be loaded through bpy.data.images.load().
import bpy
img = bpy.data.images["Render Result"]
# img = bpy.data.images.load(filepath)
for area in bpy.context.screen.areas:
if area.type == 'IMAGE_EDITOR':
area.spaces.active.image = img
$\endgroup$
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged .
|
{
"url": "https://blender.stackexchange.com/questions/173662/how-to-load-and-display-an-image-in-the-image-editor-using-python",
"source_domain": "blender.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "150917",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3P663U6XOCJRTCZCJAPJFDUVHJRPWAHJ",
"WARC-Concurrent-To": "<urn:uuid:62e09bc2-1c9c-4e6c-ba17-ee096902c9a1>",
"WARC-Date": "2024-05-30T07:59:33Z",
"WARC-IP-Address": "104.18.43.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RLV6EYQKT36G26ZE3C4UB2EGKJ4Q4TJZ",
"WARC-Record-ID": "<urn:uuid:bb0f1804-af5e-43be-97dd-2f4076e94739>",
"WARC-Target-URI": "https://blender.stackexchange.com/questions/173662/how-to-load-and-display-an-image-in-the-image-editor-using-python",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:17510c6f-06c9-435e-bd74-704f88b34ccc>"
},
"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-22\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,
16,
17,
178,
179,
298,
299,
311,
312,
323,
324,
326,
340,
341,
592,
593,
648,
649,
660,
661,
662,
701,
740,
741,
779,
815,
854,
866,
867,
908,
909
],
"line_end_idx": [
2,
16,
17,
178,
179,
298,
299,
311,
312,
323,
324,
326,
340,
341,
592,
593,
648,
649,
660,
661,
662,
701,
740,
741,
779,
815,
854,
866,
867,
908,
909,
975
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 975,
"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.301369845867157,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02283105067908764,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2602739632129669,
"rps_doc_frac_unique_words": 0.5664335489273071,
"rps_doc_mean_word_length": 5.153846263885498,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0.004566209856420755,
"rps_doc_unigram_entropy": 4.1006693840026855,
"rps_doc_word_count": 143,
"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.05427407845854759,
"rps_doc_frac_chars_top_3gram": 0.03799185901880264,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -78.64713287353516,
"rps_doc_books_importance_length_correction": -78.64713287353516,
"rps_doc_openwebtext_importance": -30.29879379272461,
"rps_doc_openwebtext_importance_length_correction": -16.477081298828125,
"rps_doc_wikipedia_importance": -26.471216201782227,
"rps_doc_wikipedia_importance_length_correction": -26.471216201782227
},
"fasttext": {
"dclm": 0.9049031138420105,
"english": 0.831424355506897,
"fineweb_edu_approx": 3.0942628383636475,
"eai_general_math": 0.013018550351262093,
"eai_open_web_math": 0.15748465061187744,
"eai_web_code": 0.00008166000043274835
}
}
|
{
"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": "745.5",
"labels": {
"level_1": "Arts",
"level_2": "Drawing, Decoration and ornament, and Design",
"level_3": "Decorative arts"
}
}
},
"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": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,717,303,563,898,210,000 |
Complete Winsock Client Code
The following is the complete source code for the basic Winsock TCP/IP Client Application.
Winsock Client Source Code
#define WIN32_LEAN_AND_MEAN
#include <windows.h>
#include <winsock2.h>
#include <ws2tcpip.h>
#include <stdlib.h>
#include <stdio.h>
// Need to link with Ws2_32.lib, Mswsock.lib, and Advapi32.lib
#pragma comment (lib, "Ws2_32.lib")
#pragma comment (lib, "Mswsock.lib")
#pragma comment (lib, "AdvApi32.lib")
#define DEFAULT_BUFLEN 512
#define DEFAULT_PORT "27015"
int __cdecl main(int argc, char **argv)
{
WSADATA wsaData;
SOCKET ConnectSocket = INVALID_SOCKET;
struct addrinfo *result = NULL,
*ptr = NULL,
hints;
char *sendbuf = "this is a test";
char recvbuf[DEFAULT_BUFLEN];
int iResult;
int recvbuflen = DEFAULT_BUFLEN;
// Validate the parameters
if (argc != 2) {
printf("usage: %s server-name\n", argv[0]);
return 1;
}
// Initialize Winsock
iResult = WSAStartup(MAKEWORD(2,2), &wsaData);
if (iResult != 0) {
printf("WSAStartup failed with error: %d\n", iResult);
return 1;
}
ZeroMemory( &hints, sizeof(hints) );
hints.ai_family = AF_UNSPEC;
hints.ai_socktype = SOCK_STREAM;
hints.ai_protocol = IPPROTO_TCP;
// Resolve the server address and port
iResult = getaddrinfo(argv[1], DEFAULT_PORT, &hints, &result);
if ( iResult != 0 ) {
printf("getaddrinfo failed with error: %d\n", iResult);
WSACleanup();
return 1;
}
// Attempt to connect to an address until one succeeds
for(ptr=result; ptr != NULL ;ptr=ptr->ai_next) {
// Create a SOCKET for connecting to server
ConnectSocket = socket(ptr->ai_family, ptr->ai_socktype,
ptr->ai_protocol);
if (ConnectSocket == INVALID_SOCKET) {
printf("socket failed with error: %ld\n", WSAGetLastError());
WSACleanup();
return 1;
}
// Connect to server.
iResult = connect( ConnectSocket, ptr->ai_addr, (int)ptr->ai_addrlen);
if (iResult == SOCKET_ERROR) {
closesocket(ConnectSocket);
ConnectSocket = INVALID_SOCKET;
continue;
}
break;
}
freeaddrinfo(result);
if (ConnectSocket == INVALID_SOCKET) {
printf("Unable to connect to server!\n");
WSACleanup();
return 1;
}
// Send an initial buffer
iResult = send( ConnectSocket, sendbuf, (int)strlen(sendbuf), 0 );
if (iResult == SOCKET_ERROR) {
printf("send failed with error: %d\n", WSAGetLastError());
closesocket(ConnectSocket);
WSACleanup();
return 1;
}
printf("Bytes Sent: %ld\n", iResult);
// shutdown the connection since no more data will be sent
iResult = shutdown(ConnectSocket, SD_SEND);
if (iResult == SOCKET_ERROR) {
printf("shutdown failed with error: %d\n", WSAGetLastError());
closesocket(ConnectSocket);
WSACleanup();
return 1;
}
// Receive until the peer closes the connection
do {
iResult = recv(ConnectSocket, recvbuf, recvbuflen, 0);
if ( iResult > 0 )
printf("Bytes received: %d\n", iResult);
else if ( iResult == 0 )
printf("Connection closed\n");
else
printf("recv failed with error: %d\n", WSAGetLastError());
} while( iResult > 0 );
// cleanup
closesocket(ConnectSocket);
WSACleanup();
return 0;
}
Getting Started With Winsock
Running the Winsock Client and Server Code Sample
Complete Winsock Server Code
|
{
"url": "https://docs.microsoft.com/en-us/windows/desktop/WinSock/complete-client-code",
"source_domain": "docs.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2019-09",
"warc_metadata": {
"Content-Length": "20630",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WZBOW4Z4GQO4EVHQRQLOZRYYC6QP4GAG",
"WARC-Concurrent-To": "<urn:uuid:d6bf199a-0162-4243-b1b7-b9d8a567654b>",
"WARC-Date": "2019-02-17T10:15:35Z",
"WARC-IP-Address": "104.86.81.75",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:C6IFP6TX4GHVPDRTQSMZOFIZH3CLNPWG",
"WARC-Record-ID": "<urn:uuid:606e281a-009e-4b6e-b7c3-2c6d6853cfd5>",
"WARC-Target-URI": "https://docs.microsoft.com/en-us/windows/desktop/WinSock/complete-client-code",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b14cef71-c5b3-4ab5-bb6d-56b760a9732b>"
},
"warc_info": "isPartOf: CC-MAIN-2019-09\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-29-101-93.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,
29,
30,
121,
122,
149,
150,
178,
179,
200,
222,
244,
264,
283,
284,
285,
348,
384,
421,
459,
460,
461,
488,
517,
518,
559,
561,
582,
625,
661,
694,
721,
759,
793,
810,
847,
852,
883,
904,
956,
974,
980,
981,
1007,
1058,
1082,
1145,
1163,
1169,
1170,
1211,
1244,
1281,
1318,
1319,
1362,
1429,
1455,
1519,
1541,
1559,
1565,
1566,
1625,
1678,
1679,
1731,
1797,
1828,
1875,
1949,
1975,
1997,
2007,
2008,
2038,
2117,
2156,
2196,
2240,
2262,
2272,
2287,
2293,
2294,
2320,
2321,
2364,
2414,
2436,
2454,
2460,
2461,
2491,
2562,
2597,
2664,
2700,
2722,
2740,
2746,
2747,
2789,
2790,
2853,
2901,
2936,
3007,
3043,
3065,
3083,
3089,
3090,
3142,
3151,
3152,
3215,
3242,
3295,
3328,
3371,
3384,
3455,
3456,
3484,
3485,
3500,
3532,
3550,
3551,
3565,
3567,
3568,
3597,
3598,
3648,
3649,
3678,
3679,
3681,
3682
],
"line_end_idx": [
29,
30,
121,
122,
149,
150,
178,
179,
200,
222,
244,
264,
283,
284,
285,
348,
384,
421,
459,
460,
461,
488,
517,
518,
559,
561,
582,
625,
661,
694,
721,
759,
793,
810,
847,
852,
883,
904,
956,
974,
980,
981,
1007,
1058,
1082,
1145,
1163,
1169,
1170,
1211,
1244,
1281,
1318,
1319,
1362,
1429,
1455,
1519,
1541,
1559,
1565,
1566,
1625,
1678,
1679,
1731,
1797,
1828,
1875,
1949,
1975,
1997,
2007,
2008,
2038,
2117,
2156,
2196,
2240,
2262,
2272,
2287,
2293,
2294,
2320,
2321,
2364,
2414,
2436,
2454,
2460,
2461,
2491,
2562,
2597,
2664,
2700,
2722,
2740,
2746,
2747,
2789,
2790,
2853,
2901,
2936,
3007,
3043,
3065,
3083,
3089,
3090,
3142,
3151,
3152,
3215,
3242,
3295,
3328,
3371,
3384,
3455,
3456,
3484,
3485,
3500,
3532,
3550,
3551,
3565,
3567,
3568,
3597,
3598,
3648,
3649,
3678,
3679,
3681,
3682,
3683
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3683,
"ccnet_original_nlines": 140,
"rps_doc_curly_bracket": 0.005973389837890863,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1190817803144455,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03730272874236107,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4691535234451294,
"rps_doc_frac_unique_words": 0.4615384638309479,
"rps_doc_mean_word_length": 6.836923122406006,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0.01578192040324211,
"rps_doc_unigram_entropy": 4.642815589904785,
"rps_doc_word_count": 325,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10171017050743103,
"rps_doc_frac_chars_dupe_6grams": 0.06570657342672348,
"rps_doc_frac_chars_dupe_7grams": 0.06570657342672348,
"rps_doc_frac_chars_dupe_8grams": 0.06570657342672348,
"rps_doc_frac_chars_dupe_9grams": 0.06570657342672348,
"rps_doc_frac_chars_top_2gram": 0.022052209824323654,
"rps_doc_frac_chars_top_3gram": 0.04050404950976372,
"rps_doc_frac_chars_top_4gram": 0.03825382888317108,
"rps_doc_books_importance": -252.1150665283203,
"rps_doc_books_importance_length_correction": -252.1150665283203,
"rps_doc_openwebtext_importance": -136.55078125,
"rps_doc_openwebtext_importance_length_correction": -136.55078125,
"rps_doc_wikipedia_importance": -74.78583526611328,
"rps_doc_wikipedia_importance_length_correction": -74.78583526611328
},
"fasttext": {
"dclm": 0.6786600351333618,
"english": 0.4490700364112854,
"fineweb_edu_approx": 2.2510640621185303,
"eai_general_math": 0.541501522064209,
"eai_open_web_math": 0.05854630097746849,
"eai_web_code": 0.9206101894378662
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "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
|
5,169,514,172,036,270,000 |
A bit of an odd Question
A bit of an odd Question
So I listen to a lot of rock, alternative, and indie music and currently spotify gives me a lot of great recommendations on my discover weekly that are pretty accurate. I want to create a "study" playlist full of lofi hip-hop beats and classical music - but I'm afraid if I listen to it too often or during long study sessions, it'll ruin my current recommendations and start suggesting a lot of lofi or classical music for me. Have any of you done anything like this and if so did it mess up your recommendations? Thanks in advance haha
Reply
5 Replies
Hey @aidantyler, thanks for writing!
Well, actually there's a simple action to prevent it from happening.
Just use the Private Session when listening to those study songs.
In your desktop app, click on the arrow on the top right corner and you'll see it.
Let me know if this helps 🙂
BittencourtSpotify Star
Help others find this answer and click "Accept as Solution".
If you appreciate my answer, maybe give me a Like.
Note: I'm not a Spotify employee.
Thanks so much! I'll try it out!
Alright @aidantyler, keep me posted!
BittencourtSpotify Star
Help others find this answer and click "Accept as Solution".
If you appreciate my answer, maybe give me a Like.
Note: I'm not a Spotify employee.
I would like to add that I'm looking for a similar solution for the web player as I do not want to use the desktop app.
In other words: the web player needs private sessions, too!
Hey @Valynor, that would be great indeed.
You can suggest this idea here. If it gets enough votes, it might be implemented!
BittencourtSpotify Star
Help others find this answer and click "Accept as Solution".
If you appreciate my answer, maybe give me a Like.
Note: I'm not a Spotify employee.
Suggested posts
|
{
"url": "https://community.spotify.com/t5/Other-Podcasts-Partners-etc/A-bit-of-an-odd-Question/td-p/4730807",
"source_domain": "community.spotify.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "306665",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RARGSEJORPSYH2FZF4NG3ASSDGFQL6BD",
"WARC-Concurrent-To": "<urn:uuid:03f1c511-ac3e-4b02-bb09-fff6d799e34e>",
"WARC-Date": "2023-03-21T03:10:44Z",
"WARC-IP-Address": "18.160.18.29",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RZ4S7THXTMYUHGSKLUTMCPVFZ3NQUW2W",
"WARC-Record-ID": "<urn:uuid:a08a65d1-303a-4b2f-806e-e8546cc0a836>",
"WARC-Target-URI": "https://community.spotify.com/t5/Other-Podcasts-Partners-etc/A-bit-of-an-odd-Question/td-p/4730807",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1199b6ec-6004-4b2c-b6d2-fe21df4a01f9>"
},
"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-36\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,
25,
26,
51,
52,
590,
591,
593,
594,
600,
610,
611,
648,
649,
651,
652,
722,
723,
725,
726,
792,
793,
795,
796,
879,
880,
882,
883,
911,
912,
936,
997,
1048,
1082,
1083,
1116,
1117,
1154,
1155,
1157,
1158,
1182,
1243,
1294,
1328,
1329,
1450,
1451,
1453,
1454,
1514,
1515,
1557,
1558,
1560,
1561,
1643,
1644,
1668,
1729,
1780,
1814,
1815
],
"line_end_idx": [
25,
26,
51,
52,
590,
591,
593,
594,
600,
610,
611,
648,
649,
651,
652,
722,
723,
725,
726,
792,
793,
795,
796,
879,
880,
882,
883,
911,
912,
936,
997,
1048,
1082,
1083,
1116,
1117,
1154,
1155,
1157,
1158,
1182,
1243,
1294,
1328,
1329,
1450,
1451,
1453,
1454,
1514,
1515,
1557,
1558,
1560,
1561,
1643,
1644,
1668,
1729,
1780,
1814,
1815,
1830
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1830,
"ccnet_original_nlines": 62,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41794872283935547,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03333333134651184,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15897436439990997,
"rps_doc_frac_unique_words": 0.4781250059604645,
"rps_doc_mean_word_length": 4.384375095367432,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.742105960845947,
"rps_doc_word_count": 320,
"rps_doc_frac_chars_dupe_10grams": 0.2865288555622101,
"rps_doc_frac_chars_dupe_5grams": 0.3136136829853058,
"rps_doc_frac_chars_dupe_6grams": 0.3136136829853058,
"rps_doc_frac_chars_dupe_7grams": 0.2865288555622101,
"rps_doc_frac_chars_dupe_8grams": 0.2865288555622101,
"rps_doc_frac_chars_dupe_9grams": 0.2865288555622101,
"rps_doc_frac_chars_top_2gram": 0.008553099818527699,
"rps_doc_frac_chars_top_3gram": 0.012829650193452835,
"rps_doc_frac_chars_top_4gram": 0.06842479854822159,
"rps_doc_books_importance": -174.8498992919922,
"rps_doc_books_importance_length_correction": -173.327392578125,
"rps_doc_openwebtext_importance": -116.11128997802734,
"rps_doc_openwebtext_importance_length_correction": -116.11128997802734,
"rps_doc_wikipedia_importance": -87.80838012695312,
"rps_doc_wikipedia_importance_length_correction": -87.8034439086914
},
"fasttext": {
"dclm": 0.07035999745130539,
"english": 0.9304138422012329,
"fineweb_edu_approx": 1.0162662267684937,
"eai_general_math": 0.09552580118179321,
"eai_open_web_math": 0.187652587890625,
"eai_web_code": 0.0010073799639940262
}
}
|
{
"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": "780",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,182,115,941,222,399,000 |
bmcginn Mon, 04/21/2008 - 22:06
Hi there,
Is there any priority among the AF class?
It depends; the AF class encompasses several levels of precedence.. eg Af11, af12, af13, af21, af22, af23, af31, af32, af33, af41, af42, af43. Each AF class uses the six dscp bits, the first three of which are the IP Precedence bits. The last three bits can be used as drop precedence for RED/WRED..
So yes, there is a basic priority within an AF class. AF41 has a higher priority than AF31, AF21 or AF11 in a normal sense. You can in fact configure the qos to have af41, cs4, ipp4 have less priority than af11, cs1 or ipp1.
By and large the higher the AF class number the higher the priority.
Working from top to bottom:
IPP5 CS5 EF voice
IPP4 CS4 AF41,AF42,AF43 video
IPP3 CS3 AF31,AF32,AF33 Mission Critical
IPP2 CS2 AF21,AF22,AF23 Transactional
IPP1 CS1 AF11,AF12,AF13 Bulk Data
IPP0 CS0 BE Scavenger
cisco_lad2004 Mon, 04/21/2008 - 22:07
AFxy means AFx1 has a better dropping rate than AFx2 which is better than AFx3
HTH
Sam
mohammedmahmoud Tue, 04/22/2008 - 00:29
Hi,
AFxy translates to the following; x implies one of four queues (values 1 through 4), and y implies one of three drop priorities (values 1 through 3). The higher the x the higher the Queuing treatment as per the DiffServ model, and the higher the y the higher the drop priority accordingly AF41 is the best and AF13 is the worst.
BR,
Mohammed Mahmoud.
smallrain_2 Tue, 04/22/2008 - 11:03
I still want to verify as I thought I was given a bit different answers.
I do understand drop precedence, value of y in AFxy. But what standard says about class itself. I am talking about x here.
Some said higher x has higher queuing priority. I want to know this is a "common practise" or a "standard".
Thanks again,
cisco_lad2004 Tue, 04/22/2008 - 12:22
AFxy
higher x is better Queuing.
higher y is more dropping in case of congestion, so its higher probability drop.
AF41 will be treated better than AF31
AF43 will drop more than AF41
AF22 will drop more than AF32 (even if packets are treated better).
AF46 is usually applied for VoIP so Low Latency.
X is ur queuing treatment, y is ur drop probability.
HTH
Sam
Joseph W. Doherty Tue, 04/22/2008 - 13:15
With regard to standards, the x in AFxy maps one of the AF classes into a Class Selector Codepoint, see RFC 2474, which defines the relationship between different Class Selectors. Section 4.2.2.2, has ". . . PHBs selected by a Class Selector Codepoint SHOULD give packets a probability of timely forwarding that is not lower than that given to packets marked with a Class Selector codepoint of lower relative order, under reasonable operating conditions and traffic loads." Because of the "SHOULD" there is no requirement for different treatment between CS 1..4.
With regard to "common practice", either DSCP is totally ignored or it might be treated with bias in line with the prior IP Precedence recommendations, i.e. higher is better but how "better" can vary.
Actions
This Discussion
|
{
"url": "https://supportforums.cisco.com/discussion/10344566/assured-forwarding-af-class",
"source_domain": "supportforums.cisco.com",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "110299",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3FCIVIWEM5OPLKUCI4DZBOG5TA2YDUBV",
"WARC-Concurrent-To": "<urn:uuid:f97c9a55-b458-4718-8f75-917fc3c361d6>",
"WARC-Date": "2017-02-26T02:46:16Z",
"WARC-IP-Address": "104.16.120.49",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:PPNJMSSXU2RCBNMK66GDAOUMBCRRVEC6",
"WARC-Record-ID": "<urn:uuid:cd335f1f-40e1-4a71-b70d-c21fbc367e8f>",
"WARC-Target-URI": "https://supportforums.cisco.com/discussion/10344566/assured-forwarding-af-class",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:17ff103a-7d66-4d5a-841d-5fc62949b084>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-09\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
32,
33,
43,
44,
45,
87,
88,
89,
389,
390,
391,
616,
617,
618,
687,
688,
689,
717,
718,
736,
737,
767,
768,
809,
810,
848,
849,
883,
884,
906,
907,
945,
946,
1025,
1026,
1027,
1031,
1032,
1033,
1037,
1038,
1078,
1079,
1083,
1084,
1085,
1414,
1415,
1416,
1420,
1421,
1439,
1440,
1476,
1477,
1550,
1551,
1552,
1675,
1676,
1677,
1785,
1786,
1787,
1801,
1802,
1840,
1841,
1846,
1847,
1848,
1876,
1877,
1958,
1959,
1960,
1998,
1999,
2029,
2030,
2098,
2099,
2100,
2149,
2150,
2151,
2204,
2205,
2206,
2210,
2211,
2212,
2216,
2217,
2259,
2260,
2823,
2824,
2825,
3026,
3027,
3035,
3036,
3052,
3053,
3055,
3056
],
"line_end_idx": [
32,
33,
43,
44,
45,
87,
88,
89,
389,
390,
391,
616,
617,
618,
687,
688,
689,
717,
718,
736,
737,
767,
768,
809,
810,
848,
849,
883,
884,
906,
907,
945,
946,
1025,
1026,
1027,
1031,
1032,
1033,
1037,
1038,
1078,
1079,
1083,
1084,
1085,
1414,
1415,
1416,
1420,
1421,
1439,
1440,
1476,
1477,
1550,
1551,
1552,
1675,
1676,
1677,
1785,
1786,
1787,
1801,
1802,
1840,
1841,
1846,
1847,
1848,
1876,
1877,
1958,
1959,
1960,
1998,
1999,
2029,
2030,
2098,
2099,
2100,
2149,
2150,
2151,
2204,
2205,
2206,
2210,
2211,
2212,
2216,
2217,
2259,
2260,
2823,
2824,
2825,
3026,
3027,
3035,
3036,
3052,
3053,
3055,
3056,
3057
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3057,
"ccnet_original_nlines": 107,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3288288414478302,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.09759759902954102,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24624624848365784,
"rps_doc_frac_unique_words": 0.49510762095451355,
"rps_doc_mean_word_length": 4.569471836090088,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.122461795806885,
"rps_doc_word_count": 511,
"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.02312633953988552,
"rps_doc_frac_chars_top_3gram": 0.030835120007395744,
"rps_doc_frac_chars_top_4gram": 0.02955031953752041,
"rps_doc_books_importance": -324.8583984375,
"rps_doc_books_importance_length_correction": -324.8583984375,
"rps_doc_openwebtext_importance": -142.7130584716797,
"rps_doc_openwebtext_importance_length_correction": -142.7130584716797,
"rps_doc_wikipedia_importance": -90.0511245727539,
"rps_doc_wikipedia_importance_length_correction": -90.0511245727539
},
"fasttext": {
"dclm": 0.021899579092860222,
"english": 0.9054216742515564,
"fineweb_edu_approx": 2.3059821128845215,
"eai_general_math": 0.5066804885864258,
"eai_open_web_math": 0.49327391386032104,
"eai_web_code": 0.08895409107208252
}
}
|
{
"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": "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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,768,997,959,862,736,000 |
avatar_Mr. DVG
The compatibility of the M4 card...
Started by Mr. DVG, 17:26, 27 October 19
Previous topic - Next topic
0 Members and 1 Guest are viewing this topic.
sunn
I'm using 6128+ and m4. Is there a version of Rick Dangerous 128+ that will work with this setup? It crashes to the loading screen. Physical disk works nicely, though.
VincentGR
sunn
Quote from: VincentGR on 11:42, 14 February 23Can you try this please?
Thanks but still crashes to the loading screen.
XeNoMoRPH
Quote from: sunn on 11:24, 16 February 23
Quote from: VincentGR on 11:42, 14 February 23Can you try this please?
Thanks but still crashes to the loading screen.
Rick Dangerous 128+ not works from M4.
to play on a real machine, you have 2 options or you use a Gotek or as I have done, I record the DSK on a 3" floppy disk using the M4FE frontend and play from disk !!!
your amstrad news source in spanish language : https://auamstrad.es
sunn
#79
QuoteRick Dangerous 128+ not works from M4.
to play on a real machine, you have 2 options or you use a Gotek or as I have done, I record the DSK on a 3" floppy disk using the M4FE frontend and play from disk !!!
Yes, luckily physical disk works like I said. This would be fun to get working in the future.
Lomax
Can anyone successfully launch "They Sold A Million" disk 2? I'm having trouble. Depending on my ROM config, it either reboots, can't find AAAA.bin, or comes up but freezes.
poulette73
Hello,
I have the same issue, with "AAAA.bin" file not found (certainly the lack of FDC emulation).
No problem with the same DSK on Gotek or USIfAC II.
TotO
#82
AAAA.BIN is famously known as part of the SPEEDLOCK protection. May be the ROM table in RAM has moved the drive user entry (&A70x) to an upper address and the game loader do not read the good bit value to properly got the AMSDOS drive configuration. For example, it try to search the file in drive B instead of drive A. Can you select the DSK file for both drives A/B to see the result?
"You make one mistake in your life and the internet will never let you live it down" (Keith Goodyer)
poulette73
#83
"They Sold A Million disk 2" DSK on Gotek as drive A: ok
"They Sold A Million disk 2" DSK on Gotek as drive B:
1st attempt with a random floppy disc in drive A: "AAAA.BIN not found"
2nd attempt with no disc in drive A: "Drive A: disc missing. Retry, Ignore or Cancel?"
TotO
#84
Quote from: poulette73 on 10:02, 19 March 23"They Sold A Million disk 2" DSK on Gotek as drive A: ok
"They Sold A Million disk 2" DSK on Gotek as drive B:
1st attempt with a random floppy disc in drive A: "AAAA.BIN not found"
2nd attempt with no disc in drive A: "Drive A: disc missing. Retry, Ignore or Cancel?"
The DSK Into both drives, at the same time.
"You make one mistake in your life and the internet will never let you live it down" (Keith Goodyer)
poulette73
Sorry I misunderstood, I forgot to use the M4 Board.
"They Sold A Million disk 2" DSK on Gotek as drive A.
Launching the game from the M4 Board
3rd attempt: ok, but the loading continues on Gotek (as drive A)
Powered by SMFPacks Menu Editor Mod
|
{
"url": "https://www.cpcwiki.eu/forum/technical-support/the-compatibility-of-the-m4-card/75/?PHPSESSID=31hkikive6ss153u8jaun3lj54",
"source_domain": "www.cpcwiki.eu",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "61455",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CORFAP6VF5CHE4IB3ER3HWEFNP2SXMEM",
"WARC-Concurrent-To": "<urn:uuid:ca50cd16-039a-488e-81d9-3858a6ce634c>",
"WARC-Date": "2023-06-06T02:53:22Z",
"WARC-IP-Address": "142.4.215.89",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FD67KN2EZAIFWK3JA25AAPBPC3UEYJ43",
"WARC-Record-ID": "<urn:uuid:4f89f9eb-3d89-4a5b-8230-0fae40bf426e>",
"WARC-Target-URI": "https://www.cpcwiki.eu/forum/technical-support/the-compatibility-of-the-m4-card/75/?PHPSESSID=31hkikive6ss153u8jaun3lj54",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f3fad1fb-f1e1-4ed6-8bda-3b1d7f5613a7>"
},
"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-52\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
17,
18,
54,
55,
96,
97,
125,
126,
172,
173,
178,
179,
347,
348,
358,
359,
360,
365,
366,
437,
485,
486,
496,
497,
539,
610,
658,
697,
865,
866,
934,
935,
940,
941,
945,
989,
1157,
1158,
1252,
1253,
1259,
1260,
1434,
1435,
1446,
1447,
1454,
1455,
1548,
1600,
1601,
1606,
1607,
1611,
1998,
2099,
2100,
2111,
2112,
2116,
2173,
2174,
2228,
2299,
2386,
2387,
2392,
2393,
2397,
2498,
2499,
2553,
2624,
2711,
2755,
2856,
2857,
2868,
2869,
2922,
2923,
2977,
3014,
3015,
3080,
3081
],
"line_end_idx": [
2,
17,
18,
54,
55,
96,
97,
125,
126,
172,
173,
178,
179,
347,
348,
358,
359,
360,
365,
366,
437,
485,
486,
496,
497,
539,
610,
658,
697,
865,
866,
934,
935,
940,
941,
945,
989,
1157,
1158,
1252,
1253,
1259,
1260,
1434,
1435,
1446,
1447,
1454,
1455,
1548,
1600,
1601,
1606,
1607,
1611,
1998,
2099,
2100,
2111,
2112,
2116,
2173,
2174,
2228,
2299,
2386,
2387,
2392,
2393,
2397,
2498,
2499,
2553,
2624,
2711,
2755,
2856,
2857,
2868,
2869,
2922,
2923,
2977,
3014,
3015,
3080,
3081,
3116
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3116,
"ccnet_original_nlines": 87,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3094910681247711,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.09078404307365417,
"rps_doc_frac_lines_end_with_ellipsis": 0.011363640427589417,
"rps_doc_frac_no_alph_words": 0.23521320521831512,
"rps_doc_frac_unique_words": 0.39168110489845276,
"rps_doc_mean_word_length": 4.079722881317139,
"rps_doc_num_sentences": 41,
"rps_doc_symbol_to_word_ratio": 0.006877580191940069,
"rps_doc_unigram_entropy": 4.935173988342285,
"rps_doc_word_count": 577,
"rps_doc_frac_chars_dupe_10grams": 0.4651656746864319,
"rps_doc_frac_chars_dupe_5grams": 0.4910790026187897,
"rps_doc_frac_chars_dupe_6grams": 0.4740866720676422,
"rps_doc_frac_chars_dupe_7grams": 0.4651656746864319,
"rps_doc_frac_chars_dupe_8grams": 0.4651656746864319,
"rps_doc_frac_chars_dupe_9grams": 0.4651656746864319,
"rps_doc_frac_chars_top_2gram": 0.028037380427122116,
"rps_doc_frac_chars_top_3gram": 0.0305862408131361,
"rps_doc_frac_chars_top_4gram": 0.0407816506922245,
"rps_doc_books_importance": -295.4339904785156,
"rps_doc_books_importance_length_correction": -295.4339904785156,
"rps_doc_openwebtext_importance": -167.8901824951172,
"rps_doc_openwebtext_importance_length_correction": -167.8901824951172,
"rps_doc_wikipedia_importance": -97.2311782836914,
"rps_doc_wikipedia_importance_length_correction": -97.2311782836914
},
"fasttext": {
"dclm": 0.08090519905090332,
"english": 0.9355102777481079,
"fineweb_edu_approx": 1.1187248229980469,
"eai_general_math": 0.03368103876709938,
"eai_open_web_math": 0.16301840543746948,
"eai_web_code": 0.21826952695846558
}
}
|
{
"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": "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": "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
|
974,983,456,095,252,700 |
Q:
What is the Cube Root of 1030?
Accepted Solution
A:
Solution: Cube of Root Of 1030 is 10.099 Methods Step-by-step solution of the cube root of 1030 Let’s do a quick recap on what cube roots are and the different ways we can represent them. Cube root is the opposite operation of “cubing” a number. For example, when we say that we cubed the number 2, we are asking what the product is after multiplying 2 three times by itself : 2 x 2 x 2, which gives 8 (so the cube of 2 is 8). However, when a question asks for a cube root, we ask ourselves: what number when multiplied by itself three times produces that number. To use the same example, if we want to find the cube root of 8, we see that we can multiply 2 x 2 x 2, and the cube root of 8 is 2. Two other ways we can represent the cube root of 1030 is: Exponent form: 1030 1 / 3 {1030}^{1/3} 1030 1/3 Radical form: 1030 3 \sqrt[3]{1030} 3 1030 If the number is small and perfect, you might be able to tell what the cube root is just by looking at the problem, but sometimes when the number is big, it is best to find the prime factorization of 1030 and rewrite 1030 as its prime factorization. Remember : Be prepared knowing that sometimes, the cube root of a number may not be perfect. A perfect cube root means that the answer is a whole number and not a decimal. However, if your cube root is not perfect, then you would have a decimal answer. Since we know that the prime factorization of 1030 is 2^1 × 5^1 × 103^1, we can rewrite the cube root of 1030 like so: 1030 3 = 2 1 × 5 1 × 10 3 1 3 \sqrt[3]{1030} = \sqrt[3]{2^1 × 5^1 × 103^1} 3 1030 = 3 2 1 × 5 1 × 10 3 1 Unfortunately, there is no way to get rid of the cube root so that must mean our answer is not a perfect cube root and the only way is to punch it in the calculator to get a decimal answer. Therefore: 2 1 × 5 1 × 10 3 1 3 = 10.099 \sqrt[3]{2^1 × 5^1 × 103^1} = 10.099 3 2 1 × 5 1 × 10 3 1 = 10.099 Therefore, the cube root of 1030 is 10.099 (3 decimal places). Find the cube root of more numbers! You know the saying, “practice makes perfect”? Well, it’s definitely true - take a look at some more problems like this one to become a master at finding the cube root of a number What is the cube root of 4855? What is the cube root of 1889? What is the cube root of 3114? What is the cube root of 2877? What is the cube root of 1401?
|
{
"url": "https://derekmcculloch.com/qna/what-is-the-cube-root-of-1030",
"source_domain": "derekmcculloch.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "32389",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BMGCWCRZKSFGFTR5KY2Y4YKQEHTMKZVO",
"WARC-Concurrent-To": "<urn:uuid:690c4c3d-30a4-4399-b39d-baf9cc3d920e>",
"WARC-Date": "2024-04-23T21:00:05Z",
"WARC-IP-Address": "172.67.222.131",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CF7IDJJRDZ4ZPV4BTAYDBI3B66SOOQEV",
"WARC-Record-ID": "<urn:uuid:17ff668b-9410-40c6-884c-2d5961d36e52>",
"WARC-Target-URI": "https://derekmcculloch.com/qna/what-is-the-cube-root-of-1030",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c5c73a67-5ff6-439c-a65f-4417a6a66457>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-150\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
3,
4,
35,
36,
54,
55,
58
],
"line_end_idx": [
3,
4,
35,
36,
54,
55,
58,
2369
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2369,
"ccnet_original_nlines": 7,
"rps_doc_curly_bracket": 0.0050654299557209015,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3699515163898468,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00484653003513813,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3731825351715088,
"rps_doc_frac_unique_words": 0.32924336194992065,
"rps_doc_mean_word_length": 3.6073620319366455,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.385523319244385,
"rps_doc_word_count": 489,
"rps_doc_frac_chars_dupe_10grams": 0.026643989607691765,
"rps_doc_frac_chars_dupe_5grams": 0.25056689977645874,
"rps_doc_frac_chars_dupe_6grams": 0.13548752665519714,
"rps_doc_frac_chars_dupe_7grams": 0.026643989607691765,
"rps_doc_frac_chars_dupe_8grams": 0.026643989607691765,
"rps_doc_frac_chars_dupe_9grams": 0.026643989607691765,
"rps_doc_frac_chars_top_2gram": 0.09977324306964874,
"rps_doc_frac_chars_top_3gram": 0.10600907355546951,
"rps_doc_frac_chars_top_4gram": 0.11054421961307526,
"rps_doc_books_importance": -231.5767059326172,
"rps_doc_books_importance_length_correction": -231.5767059326172,
"rps_doc_openwebtext_importance": -182.32752990722656,
"rps_doc_openwebtext_importance_length_correction": -182.32752990722656,
"rps_doc_wikipedia_importance": -133.58006286621094,
"rps_doc_wikipedia_importance_length_correction": -133.58006286621094
},
"fasttext": {
"dclm": 0.9959473609924316,
"english": 0.9132830500602722,
"fineweb_edu_approx": 3.041905403137207,
"eai_general_math": 0.9990672469139099,
"eai_open_web_math": 0.675067126750946,
"eai_web_code": 0.39511287212371826
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.9",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,242,606,103,728,412,000 |
Improving SQL DB Migration Performance - Azure Database Migration Service
Published Nov 10 2023 08:58 AM 2,359 Views
Microsoft
When migrating large databases to Azure SQL DB, an issue often encountered is slower than desired SQL DB migration performance. This blog details how to investigate and pinpoint performance issues to improve the speed of your Azure SQL DB migration. Since this article focuses on migration performance, it is assumed that you are familiar with the process of successfully migrating using Azure Database Migration Service (DMS).
A SQL DB migration consists of three separate pieces that each play a role in impacting migration performance:
1. Source SQL Server
2. Self-hosted integration runtime
3. Target SQL DB
The first step to improving performance is determining which piece (or pieces) are causing a bottleneck in your migration pipeline.
Source SQL Server
A) Index columns
A SQL DB migration using DMS typically copies data one row at a time. However, we have a trick up our sleeve: we can parallelize tables with indexes. This means that we can copy different sections of the same table at the same time. Parallelization will automatically be enabled on your table if it has a clustered index and the index column is a supported data type. Behind the scenes, Database Migration Service (DMS) uses Azure Data Factory's "Copy" activity, meaning that at the time of writing this article only the following index column data types are supported for parallelization:
• int
• smallint
• bigint
• date
• smalldatetime
• datetime
• datetime2
• datetimeoffset.
You can read more about the ADF copy activity at the following link: Configure Azure SQL Database in a copy activity - Microsoft Fabric | Microsoft Learn. You can view whether a table is being parallelized in the Azure portal by clicking the "Monitor Migrations" button and selecting your ongoing migration. In the screenshot below, you can see tables with parallel copy type of "Dynamic range", this means they can be parallelized.
smartura_0-1698937462294.png
Keep in mind that a table without indexes cannot be parallelized. Instead, it will be copied one row at a time, linearly.
If your source table does not have any indexes, you can improve migration performance by the following:
1. Creating a clustered index on a column that is already in the table.
2. Creating a temporary column that will be used as a clustered index only for the purposes of the migration. This temporary column can simply contain a unique number.
It is completely understandable if you cannot or do not wish to modify your source database, but it is important to note the role that indexes play in migration performance.
B) Hardware limitations
The hardware of the source server will of course also play a role in the migration's performance. Since you are migrating away from the source server, it is unlikely you'd want to upgrade the hardware. However, it can be helpful to open task manager on the source server and analyze the performance of the CPU, memory, disk IO latency and network. If you find that source server is reaching its limits, that may in fact be your bottleneck. After all, you can't copy data faster than the source will allow you.
Self-Hosted Integration Runtime
The integration runtime (IR) is the compute infrastructure used by Azure Data Factory and provides us the data movement capabilities to migrate to Azure. It can be downloaded, installed on a machine and registered with your Database Migration Service. The integration runtime service is now being hosted on the machine, hence where the term "self-hosted integration runtime" (SHIR) comes from. All of the data being copied throughout the migration will flow through your SHIR. This is considered an SHIR "node" and is the engine driving your data copying activities.
A) SHIR node
It may seem intuitive to download the integration runtime software onto your source SQL server machine, however this is not recommended. An IR on the same machine as SQL server will mean that both components will be competing for hardware resources, in effect limiting your migration speed. On that same note, it is not recommended that you install the integration runtime software on your local machine that you use for development. This is especially discouraged if your local computer is connected to the internet wirelessly.
To achieve optimal migration performance, it is highly recommended that you dedicate a machine exclusively to running the SHIR. This machine should have a fast and reliable connection to your source and target database. Therefore, it is recommended that you use a machine on your local network connected via ethernet or a Virtual Machine on Azure.
B) Monitoring SHIR node performance
You can monitor SHIR performance from Azure portal by navigating to your DMS instance and clicking "Integration runtime" on the lefthand side. This will list every SHIR node registered with your DMS instance and metrics such as concurrent jobs, available memory, CPU utilization, and network speeds.
smartura_0-1698939570155.png
C) Registering multiple SHIR nodes.
If you notice that:
• Your current IR hardware usage is nearing its limits.
• Source and target hardware are not operating at full capacity.
You will likely benefit from registering more than one SHIR node. You can do this by installing the integration runtime software on a separate machine from your existing SHIR. When running the SHIR software for the first time, register the machine with an IR key from your DMS instance. You can find your IR keys by navigating to your DMS instance and clicking "Integration runtime" on the lefthand side, then clicking "Configure integration runtime".
smartura_1-1698939754895.png
It is important to note that each node must be on its own, individual machine. You may not host two nodes from the same machine. At this point in time, you may register up to 4 IR nodes at once.
Multiple registered IR nodes can improve copy speed in the following ways:
• A table with indexes can be split up and each IR will copy its own piece of the same table.
• Assuming we have multiple tables (with indexes or not), each IR node can copy one table, in effect copying multiple different tables simultaneously.
Target SQL DB
As with the other components of the migration, a slow target Azure SQL DB will cause a bottleneck and contribute to a slower overall migration. On the flip side, an underutilized target Azure SQL DB will mean you are migrating data at a slower speed than you could potentially achieve.
During the migration, you may wish to monitor Azure SQL DB from the Azure portal to ensure it’s operating efficiently. You can do so by navigating to your Azure SQL DB in the Azure portal, clicking on "Metrics" on the lefthand side, then adding metrics to analyze (shown below). You may notice periods of high data/log IO, and periods of high CPU usage (both average and max metrics). Periods of high IO are caused by data being copied to target database, meanwhile indexing contributes to periods of high CPU usage.
SQL DB Metrics in Azure portal:
smartura_0-1699573821236.png
In the example showing above, the average log IO percentage peaks at 21.25% and its max reaches 66%, meaning that the SQL DB is more than enough to run this migration. If your target SQL DB is reaching its limits of CPU, data/log IO or other metrics, you may wish to upgrade the SQL DB to a higher SKU/service tier. To determine which SQL DB SKU/service tier to upgrade to, refer to the following document: Single database vCore resource limits - Azure SQL Database | Microsoft Learn. In many cases, users scale up to a higher SKU of SQL DB during the migration, then scale down to a more reasonable SKU after the migration has completed.
Conclusion
In summary, your migration will only be as fast as the slowest component. Knowing where to look can help you ensure your migration is running as efficiently as possible. In the event a bottleneck is found, we can use things such as index columns, multiple, more reliable integration runtimes and a higher target SQL DB SKU to help alleviate some of these bottlenecks.
Helpful links
To troubleshoot DMS migration failing, visit https://aka.ms/dms-migrations-troubleshooting.
To learn more about DMS, visit https://azure.microsoft.com/en-us/products/database-migration/.
Co-Authors
Version history
Last update:
Nov 10 2023 09:01 AM
Updated by:
|
{
"url": "https://techcommunity.microsoft.com/t5/microsoft-data-migration-blog/improving-sql-db-migration-performance-azure-database-migration/ba-p/3968094",
"source_domain": "techcommunity.microsoft.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "307584",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RGK4TAJEYHDT2QG6MZIXFMNHEVRFUALQ",
"WARC-Concurrent-To": "<urn:uuid:38730c20-0545-4dac-b1c8-c3c34108fae6>",
"WARC-Date": "2024-02-29T03:03:20Z",
"WARC-IP-Address": "104.90.77.126",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:N3OY32JZVP4TJVDIWLLK7DWHML7Z7KH3",
"WARC-Record-ID": "<urn:uuid:1c9258ea-b7f4-4fb4-8948-efdc105f2cb0>",
"WARC-Target-URI": "https://techcommunity.microsoft.com/t5/microsoft-data-migration-blog/improving-sql-db-migration-performance-azure-database-migration/ba-p/3968094",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0417f947-5627-4d45-bb08-8483f14432f9>"
},
"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-126\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
74,
117,
127,
128,
559,
560,
562,
563,
675,
676,
699,
736,
756,
757,
890,
891,
893,
894,
913,
914,
932,
933,
1525,
1526,
1534,
1547,
1558,
1567,
1585,
1598,
1612,
1633,
1634,
2069,
2070,
2072,
2073,
2102,
2103,
2105,
2106,
2229,
2230,
2334,
2335,
2410,
2580,
2581,
2756,
2757,
2759,
2760,
2785,
2786,
3297,
3298,
3300,
3301,
3334,
3335,
3902,
3903,
3905,
3906,
3919,
3920,
4450,
4451,
4453,
4454,
4803,
4804,
4806,
4807,
4844,
4845,
5146,
5147,
5149,
5150,
5179,
5180,
5182,
5183,
5220,
5221,
5242,
5243,
5301,
5368,
5369,
5822,
5823,
5825,
5826,
5855,
5856,
5858,
5859,
5861,
5862,
6057,
6058,
6060,
6061,
6137,
6138,
6234,
6387,
6388,
6403,
6404,
6691,
6692,
6694,
6695,
7214,
7215,
7217,
7218,
7250,
7251,
7280,
7281,
7283,
7284,
7286,
7287,
7929,
7930,
7932,
7933,
7944,
7945,
8315,
8316,
8318,
8319,
8333,
8334,
8426,
8427,
8522,
8523,
8534,
8550,
8563,
8585
],
"line_end_idx": [
74,
117,
127,
128,
559,
560,
562,
563,
675,
676,
699,
736,
756,
757,
890,
891,
893,
894,
913,
914,
932,
933,
1525,
1526,
1534,
1547,
1558,
1567,
1585,
1598,
1612,
1633,
1634,
2069,
2070,
2072,
2073,
2102,
2103,
2105,
2106,
2229,
2230,
2334,
2335,
2410,
2580,
2581,
2756,
2757,
2759,
2760,
2785,
2786,
3297,
3298,
3300,
3301,
3334,
3335,
3902,
3903,
3905,
3906,
3919,
3920,
4450,
4451,
4453,
4454,
4803,
4804,
4806,
4807,
4844,
4845,
5146,
5147,
5149,
5150,
5179,
5180,
5182,
5183,
5220,
5221,
5242,
5243,
5301,
5368,
5369,
5822,
5823,
5825,
5826,
5855,
5856,
5858,
5859,
5861,
5862,
6057,
6058,
6060,
6061,
6137,
6138,
6234,
6387,
6388,
6403,
6404,
6691,
6692,
6694,
6695,
7214,
7215,
7217,
7218,
7250,
7251,
7280,
7281,
7283,
7284,
7286,
7287,
7929,
7930,
7932,
7933,
7944,
7945,
8315,
8316,
8318,
8319,
8333,
8334,
8426,
8427,
8522,
8523,
8534,
8550,
8563,
8585,
8596
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8596,
"ccnet_original_nlines": 148,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3685503602027893,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06142506003379822,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15110565721988678,
"rps_doc_frac_unique_words": 0.3110949993133545,
"rps_doc_mean_word_length": 4.939086437225342,
"rps_doc_num_sentences": 78,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.331662178039551,
"rps_doc_word_count": 1379,
"rps_doc_frac_chars_dupe_10grams": 0.022023199126124382,
"rps_doc_frac_chars_dupe_5grams": 0.05623256042599678,
"rps_doc_frac_chars_dupe_6grams": 0.022023199126124382,
"rps_doc_frac_chars_dupe_7grams": 0.022023199126124382,
"rps_doc_frac_chars_dupe_8grams": 0.022023199126124382,
"rps_doc_frac_chars_dupe_9grams": 0.022023199126124382,
"rps_doc_frac_chars_top_2gram": 0.013948029838502407,
"rps_doc_frac_chars_top_3gram": 0.008809279650449753,
"rps_doc_frac_chars_top_4gram": 0.012773450464010239,
"rps_doc_books_importance": -647.3458251953125,
"rps_doc_books_importance_length_correction": -647.3458251953125,
"rps_doc_openwebtext_importance": -329.09222412109375,
"rps_doc_openwebtext_importance_length_correction": -329.09222412109375,
"rps_doc_wikipedia_importance": -205.0012664794922,
"rps_doc_wikipedia_importance_length_correction": -205.0012664794922
},
"fasttext": {
"dclm": 0.17442119121551514,
"english": 0.8674141764640808,
"fineweb_edu_approx": 2.347146987915039,
"eai_general_math": 0.15049374103546143,
"eai_open_web_math": 0.22580569982528687,
"eai_web_code": 0.24180299043655396
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.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": "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": "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": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,424,474,439,174,655,000 |
monkeyrunner
monkeyrunner 工具提供了一个 API，用于编写可从 Android 代码外部控制 Android 设备或模拟器的程序。使用 monkeyrunner，您可以编写一个 Python 程序，以便安装 Android 应用或测试软件包，运行它，向其发送按键，截取其界面的屏幕截图，并将屏幕截图存储到工作站中。monkeyrunun 工具主要用于在功能/框架级测试应用和设备以及运行单元测试套件，但您也可以随意将其用于其他目的。
monkeyryrunner 工具与 UI/Application Exerciser Monkey（即 monkey 工具）不相关。monkey 工具直接在设备或模拟器上的 adb shell 中运行，并生成伪随机用户和系统事件流。相比之下，monkeyrunner 工具可以从 API 发送特定命令和事件，以便从工作站中控制设备和模拟器。
monkeyrunner 工具为 Android 测试提供了以下独特的功能：
• 多设备控制：monkeyrunner API 可以跨多个设备或模拟器应用一个或多个测试套件。您可以通过数据线连接所有设备并/或一次性立即启动所有模拟器，以编程方式依次连接到每个设备，然后运行一个或多个测试。您还可以编程方式启动模拟器配置，运行一个或多个测试，然后关闭模拟器。
• 功能测试：monkeyrunner 可以对 Android 应用运行自动化全面测试。您可以通过按键或轻触事件提供输入值，并查看屏幕截图形式的结果。
• 回归测试 - monkeyrunner 可通过以下方法测试应用稳定性：运行应用，并将其输出屏幕截图与一组已知正确的屏幕截图进行比较。
• 可扩展的自动化 - 由于 monkeyrunner 是一个 API 工具包，因此您可以开发一整套系统（包括基于 Python 的模块和用于控制 Android 设备的程序）。除了使用 monkeyrunner API 本身，您还可以使用标准 Python ossubprocess 模块来调用 Android 工具，例如 Android 调试桥
您还可以将自己的类添加到 monkeyrunner API 中。使用插件扩展 monkeyrunner 部分中对此进行了更详细的介绍。
monkeyrunun 工具使用 Jython，这是一种使用 Java 编程语言的 Python 实现。Jython 使 monkeyrunner API 能与 Android 框架轻松交互。借助 Jython，您可以使用 Python 语法访问 API 的常量、类和方法。
一个简单的 monkeyrunner 程序
下面介绍了一个简单的 monkeyrunner 程序，该程序会连接到一台设备，并创建一个 MonkeyDevice 对象。该程序使用 MonkeyDevice 对象安装 Android 应用软件包，运行其中一个 Activity，并向该 Activity 发送按键事件。然后，该程序会截取结果的屏幕截图，并创建一个 MonkeyImage 对象。在此对象中，该程序会写出包含屏幕截图的 .png 文件。
# Imports the monkeyrunner modules used by this program
from com.android.monkeyrunner import MonkeyRunner, MonkeyDevice
# Connects to the current device, returning a MonkeyDevice object
device = MonkeyRunner.waitForConnection()
# Installs the Android package. Notice that this method returns a boolean, so you can test
# to see if the installation worked.
device.installPackage('myproject/bin/MyApplication.apk')
# sets a variable with the package's internal name
package = 'com.example.android.myapplication'
# sets a variable with the name of an Activity in the package
activity = 'com.example.android.myapplication.MainActivity'
# sets the name of the component to start
runComponent = package + '/' + activity
# Runs the component
device.startActivity(component=runComponent)
# Presses the Menu button
device.press('KEYCODE_MENU', MonkeyDevice.DOWN_AND_UP)
# Takes a screenshot
result = device.takeSnapshot()
# Writes the screenshot to a file
result.writeToFile('myproject/shot1.png','png')
monkeyrunner API
monkeyrunner API 包含在 com.android.monkeyrunner 软件包中的三个模块中：
• MonkeyRunner：一个包含 monkeyrunner 程序的实用方法的类。此类提供了一个将 monkeyrunner 连接到设备或模拟器的方法。它还提供了为 monkeyrunner 程序创建界面以及显示内置帮助的方法。
• MonkeyDevice：表示设备或模拟器。此类提供了安装和卸载软件包、启动 Activity 以及向应用发送键盘或轻触事件的方法。此外，您还可以使用此类运行测试软件包。
• MonkeyImage：表示屏幕截图图片。此类提供了截屏、将位图转换为各种格式、比较两个 MonkeyImage 对象以及将图片写入文件的方法。
在 Python 程序中，您可以将每个类作为 Python 模块来访问。monkeyrunner 工具不会自动导入这些模块。要导入模块，请使用 Python from 语句：
from com.android.monkeyrunner import <module>
其中 <module> 是您要导入的类名称。您可以在同一个 from 语句中导入多个模块，只需用英文逗号分隔各模块名称即可。
运行 monkeyrunner
您可以从文件中运行 monkeyrunner 程序，也可以在交互式会话中输入 monkeyrunner 语句。您可以通过调用 monkeyrunner 命令（位于 SDK 目录的 tools/ 子目录中）来执行这两项操作。如果您提供文件名作为参数，monkeyrunner 命令会将文件的内容作为 Python 程序运行；否则，它会启动一个交互式会话。
monkeyrunner 命令的语法为
monkeyrunner -plugin <plugin_jar> <program_filename> <program_options>
表 1 介绍了各个标记和参数。
表 1. monkeyrunner 标记和参数。
参数 说明
-plugin <plugin_jar> （可选）指定包含 monkeyryrunner 插件的 .jar 文件。要详细了解 monkeyrunner 插件，请参阅使用插件扩展 monkeyrunner。要指定多个文件，请多次添加该参数。
<program_filename> 如果您提供此参数，monkeyrunner 命令会将文件的内容作为 Python 程序运行。如果未提供此参数，该命令将启动交互式会话。
<program_options> （可选）该程序在 <program_file> 中的标记和参数。
monkeyrunner 内置帮助
您可以通过运行以下命令为 monkeyrunner 生成 API 参考文档：
monkeyrunner help.py <format> <outfile>
参数如下：
• <format>text（对于纯文本输出）或 html（对于 HTML 输出）。
• <outfile> 是输出文件的路径限定名称。
使用插件扩展 monkeyrunner
您可以使用以 Java 编程语言编写的类扩展 monkeyrunner API，并将其编译为一个或多个 .jar 文件。您可以借助此功能使用自己的类扩展 monkeyrunner API，或扩展现有的类。您还可以使用此功能初始化 monongxununner 环境。
要为 monkeyrunner 提供插件，请在调用 monkeyrunner 命令时使用表 1 中所述的 -plugin <plugin_jar> 参数。
在插件代码中，您可以导入和扩展 com.android.monkeyrunner 中的 monkeyrunner 主类 MonkeyDeviceMonkeyImageMonkeyRunner（请参阅 monkeyrunner API）。
请注意，插件不会授予您对 Android SDK 的访问权限。您无法导入 com.android.app 等软件包。这是因为 monkeyrunner 会在框架 API 级别之下与设备或模拟器交互。
插件启动类
插件的 .jar 文件可以指定一个在脚本处理开始之前实例化的类。要指定此类，请将键 MonkeyRunnerStartupRunner 添加到 .jar 文件的清单中。该值应为启动时运行的类的名称。以下代码段展示了如何在 ant 编译脚本中执行此操作：
<jar jarfile="myplugin" basedir="${build.dir}">
<manifest>
<attribute name="MonkeyRunnerStartupRunner" value="com.myapp.myplugin"/>
</manifest>
</jar>
要访问 monkeyrunner 的运行时环境，启动类可以实现 com.google.common.base.Predicate<PythonInterpreter>。例如，此类会在默认命名空间中设置一些变量：
Kotlin
package com.android.example
import com.google.common.base.Predicate
import org.python.util.PythonInterpreter
class Main: Predicate<PythonInterpreter> {
override fun apply(anInterpreter: PythonInterpreter): Boolean {
/*
* Examples of creating and initializing variables in the monkeyrunner environment's
* namespace. During execution, the monkeyrunner program can refer to the variables
* "newtest" and "use_emulator"
*
*/
anInterpreter.set("newtest", "enabled")
anInterpreter.set("use_emulator", 1)
return true
}
}
Java
package com.android.example;
import com.google.common.base.Predicate;
import org.python.util.PythonInterpreter;
public class Main implements Predicate<PythonInterpreter> {
@Override
public boolean apply(PythonInterpreter anInterpreter) {
/*
* Examples of creating and initializing variables in the monkeyrunner environment's
* namespace. During execution, the monkeyrunner program can refer to the variables "newtest"
* and "use_emulator"
*
*/
anInterpreter.set("newtest", "enabled");
anInterpreter.set("use_emulator", 1);
return true;
}
}
|
{
"url": "https://developer.android.com/studio/test/monkeyrunner?hl=zh-cn",
"source_domain": "developer.android.com",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "90199",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JT556N24SC25RWTDYMLZMWMA6IUJROF6",
"WARC-Concurrent-To": "<urn:uuid:53f3efc0-eb94-407f-a654-fd5a761ee7da>",
"WARC-Date": "2019-12-09T17:29:45Z",
"WARC-IP-Address": "172.217.15.110",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:C5K3TPRWUVHKT6WFO63MQZGOVUKW65L3",
"WARC-Record-ID": "<urn:uuid:a01e3a27-d1ed-490e-ae93-678ac2fb166c>",
"WARC-Target-URI": "https://developer.android.com/studio/test/monkeyrunner?hl=zh-cn",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0287df3b-e461-42bf-bd28-fb0fd15a718c>"
},
"warc_info": "isPartOf: CC-MAIN-2019-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-206.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
13,
14,
231,
232,
404,
405,
444,
445,
587,
665,
736,
913,
914,
986,
987,
1125,
1126,
1148,
1149,
1351,
1352,
1412,
1480,
1481,
1551,
1597,
1598,
1693,
1734,
1795,
1796,
1851,
1901,
1902,
1968,
2032,
2033,
2079,
2123,
2124,
2149,
2198,
2199,
2229,
2288,
2289,
2314,
2349,
2350,
2388,
2440,
2445,
2446,
2463,
2464,
2522,
2523,
2642,
2732,
2809,
2810,
2898,
2899,
2949,
2954,
2955,
3018,
3019,
3035,
3036,
3213,
3214,
3234,
3235,
3310,
3315,
3316,
3332,
3333,
3358,
3359,
3365,
3485,
3572,
3623,
3624,
3642,
3643,
3682,
3683,
3727,
3732,
3733,
3739,
3740,
3785,
3813,
3814,
3834,
3835,
3969,
3970,
4048,
4049,
4168,
4169,
4269,
4270,
4276,
4277,
4404,
4405,
4457,
4472,
4549,
4565,
4576,
4577,
4582,
4583,
4689,
4690,
4697,
4698,
4730,
4731,
4775,
4820,
4821,
4868,
4869,
4941,
4956,
5053,
5149,
5193,
5208,
5224,
5276,
5325,
5349,
5359,
5365,
5370,
5371,
5376,
5377,
5410,
5411,
5456,
5502,
5503,
5567,
5585,
5649,
5650,
5665,
5761,
5866,
5899,
5913,
5928,
5981,
6031,
6032,
6057,
6067
],
"line_end_idx": [
13,
14,
231,
232,
404,
405,
444,
445,
587,
665,
736,
913,
914,
986,
987,
1125,
1126,
1148,
1149,
1351,
1352,
1412,
1480,
1481,
1551,
1597,
1598,
1693,
1734,
1795,
1796,
1851,
1901,
1902,
1968,
2032,
2033,
2079,
2123,
2124,
2149,
2198,
2199,
2229,
2288,
2289,
2314,
2349,
2350,
2388,
2440,
2445,
2446,
2463,
2464,
2522,
2523,
2642,
2732,
2809,
2810,
2898,
2899,
2949,
2954,
2955,
3018,
3019,
3035,
3036,
3213,
3214,
3234,
3235,
3310,
3315,
3316,
3332,
3333,
3358,
3359,
3365,
3485,
3572,
3623,
3624,
3642,
3643,
3682,
3683,
3727,
3732,
3733,
3739,
3740,
3785,
3813,
3814,
3834,
3835,
3969,
3970,
4048,
4049,
4168,
4169,
4269,
4270,
4276,
4277,
4404,
4405,
4457,
4472,
4549,
4565,
4576,
4577,
4582,
4583,
4689,
4690,
4697,
4698,
4730,
4731,
4775,
4820,
4821,
4868,
4869,
4941,
4956,
5053,
5149,
5193,
5208,
5224,
5276,
5325,
5349,
5359,
5365,
5370,
5371,
5376,
5377,
5410,
5411,
5456,
5502,
5503,
5567,
5585,
5649,
5650,
5665,
5761,
5866,
5899,
5913,
5928,
5981,
6031,
6032,
6057,
6067,
6072
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6072,
"ccnet_original_nlines": 167,
"rps_doc_curly_bracket": 0.0016468999674543738,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0833333283662796,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020348839461803436,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5804263353347778,
"rps_doc_frac_unique_words": 0.5729166865348816,
"rps_doc_mean_word_length": 9.885416984558105,
"rps_doc_num_sentences": 67,
"rps_doc_symbol_to_word_ratio": 0.010658909566700459,
"rps_doc_unigram_entropy": 5.139956951141357,
"rps_doc_word_count": 480,
"rps_doc_frac_chars_dupe_10grams": 0.09610115736722946,
"rps_doc_frac_chars_dupe_5grams": 0.1441517472267151,
"rps_doc_frac_chars_dupe_6grams": 0.13572180271148682,
"rps_doc_frac_chars_dupe_7grams": 0.09610115736722946,
"rps_doc_frac_chars_dupe_8grams": 0.09610115736722946,
"rps_doc_frac_chars_dupe_9grams": 0.09610115736722946,
"rps_doc_frac_chars_top_2gram": 0.015806110575795174,
"rps_doc_frac_chars_top_3gram": 0.013487880118191242,
"rps_doc_frac_chars_top_4gram": 0.007165439892560244,
"rps_doc_books_importance": -502.77978515625,
"rps_doc_books_importance_length_correction": -502.77978515625,
"rps_doc_openwebtext_importance": -359.6495056152344,
"rps_doc_openwebtext_importance_length_correction": -359.6495056152344,
"rps_doc_wikipedia_importance": -179.10678100585938,
"rps_doc_wikipedia_importance_length_correction": -179.10678100585938
},
"fasttext": {
"dclm": 0.9501364231109619,
"english": 0.055196668952703476,
"fineweb_edu_approx": 2.8280277252197266,
"eai_general_math": 0.07628625631332397,
"eai_open_web_math": 0.226645827293396,
"eai_web_code": 0.9570246934890747
}
}
|
{
"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": "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": "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
|
-9,132,460,365,739,979,000 |
PayPal/Venmo transactions not showing up?
I’m trying out Tiller with Google Sheets. I added a bank account and everything seemed to go smoothly and I can see three months of transactions.
I then added PayPal and Venmo accounts, and while there were no errors during the process (and they show up in the list of linked accounts), Tiller has no populated the spreadsheet with any transactions from either account, nor do the accounts show up in the “Balances” tab. It’s been a bit over an hour since adding both accounts.
I’ve tried clicking the “Fill sheets” button, but that just tells me “No new transactions available” and “No new balances available”.
Am I missing a step? Will these only updated overnight?
Thanks!
@larsks You may just need to link the new account to your sheet.
1. Open your Google Sheet
2. Launch the Tiller Money Feeds add-on from the Add-ons menu at the top
3. Click on “Connected Accounts”
4. Select the account that’s missing by adding a check mark
5. Click “Confirm” at the bottom of the sidebar
Let us know if those steps work
|
{
"url": "https://community.tillerhq.com/t/paypal-venmo-transactions-not-showing-up/9848",
"source_domain": "community.tillerhq.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "18443",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GRY5M3LFZXJEROY3FPPD2ZZ5BYWAZBNH",
"WARC-Concurrent-To": "<urn:uuid:6d43f64e-3e83-4631-abb4-76715931c7a8>",
"WARC-Date": "2021-10-16T21:02:08Z",
"WARC-IP-Address": "184.105.176.45",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CVFHFRDC5IPXV6JF47ZSAPDMZTHUA5CE",
"WARC-Record-ID": "<urn:uuid:200699b1-ecbd-4151-a675-e23f8c0a5052>",
"WARC-Target-URI": "https://community.tillerhq.com/t/paypal-venmo-transactions-not-showing-up/9848",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e815bc0e-15dc-4b32-ae0e-96d63f7e2814>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-190\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
42,
43,
189,
190,
522,
523,
657,
658,
714,
715,
723,
724,
789,
790,
818,
893,
928,
990,
1040,
1041
],
"line_end_idx": [
42,
43,
189,
190,
522,
523,
657,
658,
714,
715,
723,
724,
789,
790,
818,
893,
928,
990,
1040,
1041,
1072
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1072,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4094827473163605,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0258620698004961,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18965516984462738,
"rps_doc_frac_unique_words": 0.6881720423698425,
"rps_doc_mean_word_length": 4.537634372711182,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.6317644119262695,
"rps_doc_word_count": 186,
"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.014218010008335114,
"rps_doc_frac_chars_top_3gram": 0.01895735040307045,
"rps_doc_frac_chars_top_4gram": 0.02606634981930256,
"rps_doc_books_importance": -111.5611343383789,
"rps_doc_books_importance_length_correction": -111.5611343383789,
"rps_doc_openwebtext_importance": -64.95354461669922,
"rps_doc_openwebtext_importance_length_correction": -53.713233947753906,
"rps_doc_wikipedia_importance": -58.24172592163086,
"rps_doc_wikipedia_importance_length_correction": -58.24172592163086
},
"fasttext": {
"dclm": 0.02637368068099022,
"english": 0.9040018320083618,
"fineweb_edu_approx": 0.7657012343406677,
"eai_general_math": 0.2722736597061157,
"eai_open_web_math": 0.179906964302063,
"eai_web_code": 0.0871933102607727
}
}
|
{
"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.0285",
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,977,799,592,133,207,000 |
I often use 'Chrome' if I am expecting to have 20 tabs open or something -- I must say, it's very good for this specific reason. However, I just discovered something a little disconcerting (to me) whilst testing a few things.
Here's a nice example. I just typed in 'ANALUTICS' and it sent me straight to Google Analytics. That seems very presumptuous!? No "Did you mean...?" or any type of alternative, just straight to GA. Isn't that a bit iffy for many reasons? It's kind of like hijacking!
I'm loathe to repeat this with lots of phrases, but to my own, probably narrow view, this seems like it could open up all sorts of debates and questions:
• How many words/phrases is this happening with?
• Does this mean Google is totally focused on owning everything that it has a self-interest in and won't give any due credit to any other website or authority out there?
• Is this practice clear to users of the browser?( i.e., "We may not return unbiased results for natural typed searches")
• Do they have the right to 'own' this/these keyword(s)?
I'm aware that many might say it is their browser so they can do what they like, but I wonder...well, I wonder lots of things about the implications of this. I wasn't aware of this particular practice myself and I do tend to look at the small print more than others.
So, am I just paranoid or does this seem a tad wrong to you?
|
{
"url": "https://moz.com/ugc/analutics",
"source_domain": "moz.com",
"snapshot_id": "crawl=CC-MAIN-2019-09",
"warc_metadata": {
"Content-Length": "161843",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BJI67NCCBVQHLCRJ4U6OLFBIKFHLA3IN",
"WARC-Concurrent-To": "<urn:uuid:356b2c92-bd5b-40ca-948b-364d6343f3e9>",
"WARC-Date": "2019-02-17T15:52:01Z",
"WARC-IP-Address": "104.17.49.95",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RH3FN5MKY3HIJKQSF5NF7QRIIR4BMKZE",
"WARC-Record-ID": "<urn:uuid:d95d892e-af87-44a5-8877-526fa544ff8f>",
"WARC-Target-URI": "https://moz.com/ugc/analutics",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8fe0b018-1c1f-4184-8d58-dc1ca711ce32>"
},
"warc_info": "isPartOf: CC-MAIN-2019-09\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-137-198-92.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,
226,
227,
494,
495,
649,
700,
872,
996,
1055,
1322,
1323
],
"line_end_idx": [
226,
227,
494,
495,
649,
700,
872,
996,
1055,
1322,
1323,
1383
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1383,
"ccnet_original_nlines": 11,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.49685534834861755,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04402516037225723,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18238994479179382,
"rps_doc_frac_unique_words": 0.5976095795631409,
"rps_doc_mean_word_length": 4.207171440124512,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.006289309822022915,
"rps_doc_unigram_entropy": 4.741612911224365,
"rps_doc_word_count": 251,
"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.014204549603164196,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -111.7048110961914,
"rps_doc_books_importance_length_correction": -111.69837188720703,
"rps_doc_openwebtext_importance": -75.46060180664062,
"rps_doc_openwebtext_importance_length_correction": -75.46060180664062,
"rps_doc_wikipedia_importance": -68.0530014038086,
"rps_doc_wikipedia_importance_length_correction": -66.55054473876953
},
"fasttext": {
"dclm": 0.09991180896759033,
"english": 0.9735425114631653,
"fineweb_edu_approx": 1.2200541496276855,
"eai_general_math": 0.524584949016571,
"eai_open_web_math": 0.483235239982605,
"eai_web_code": 0.11129754781723022
}
}
|
{
"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": "354.0285",
"labels": {
"level_1": "Social sciences",
"level_2": "Public administration and Military art and science",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,305,662,405,211,040,000 |
http://www.sqlservercentral.com/blogs/steve_jones/2009/08/21/the-kindle-update-a-month-on-the-iphone-itouch/
Printed 2016/09/29 09:46PM
The Kindle Update - A Month on the iPhone/iTouch
By Steve Jones, 2009/08/21
Ever since my Kindle broke, I've been reading on my iTouch for the most part. I've been using both the Kindle iPhone app and the Barnes and Noble app and while they are different (Kindle notes, BN notes) , they both have a few quirks and I can't say one is amazingly better than the other. I do like the fact that Barnes and Noble allows me to read on the PC as well as the iTouch, and I have used my PC a couple times when I've had the laptop and not my iTouch.
I've been debating what to do about my reading habits. I have made a few trips to the library in the last month to get books for the kids (and encourage them to read), and gotten myself a few books as well. I like reading paper, but it's inconvenient for me. I find myself without that paper book as I move through a busy life. So I definitely like the idea of ebooks myself. But am I ready for a dedicated reader?
I do think that the Kindle works amazingly better than an LCD screen. It is easier on the eyes, and it lasts much longer. Right now I need to be sure I have power handy for the iTouch or I'll drain it within a day. That can be a problem on long flights, and if I go back to the UK, I'll need a power solution. The Sony reader (saw one in Wal-Mart), works on the same principle, but they have less selection than either B&N or Amazon. I'm sure that might change at some point, but what I'd like to do is see these items decoupled. I think Amazon is making a mistake by not supporting other devices, and the same with Barnes and Noble, though B&N did say they'll support the ePub format.
I've purchased books from both amazon and B&N, and right now the platform is more important to me. Being able to buy anytime, anyplace, is a killer feature. So much so that I'm considering actually moving to an iPhone from my Google G1 just so I can converge onto one device. If I can get books from multiple sources on the iPhone, listen to music, and have a phone, that's winning me over. Sure my Google phone can play music, but it's nowhere near as convenient as iTunes. It has AmazonMP3, but I love having all my music easily found on iTunes.
Overall, however, the big thing I've noticed is that the content is what matters. When I read a story I like, I get lost in the story, ignoring the medium. Whether it's an iPhone, Kindle, or paper book, the story draws me in and I enjoy it.
Copyright © 2002-2016 Simple Talk Publishing. All Rights Reserved. Privacy Policy. Terms of Use. Report Abuse.
|
{
"url": "http://www.sqlservercentral.com/blogs/steve_jones/2009/08/21/the-kindle-update-a-month-on-the-iphone-itouch/print/",
"source_domain": "www.sqlservercentral.com",
"snapshot_id": "crawl=CC-MAIN-2016-40",
"warc_metadata": {
"Content-Length": "4724",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JLEKDBJEBPNB3MGSOXIMXCTEWMQ6QRLR",
"WARC-Concurrent-To": "<urn:uuid:e405e463-c7f9-4e99-b20d-57899dd3fc10>",
"WARC-Date": "2016-09-30T03:46:43Z",
"WARC-IP-Address": "162.13.37.189",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:WVUBHP2CKLCEMWHSC2I4WXW5BPRYH4ZV",
"WARC-Record-ID": "<urn:uuid:a73786b8-0069-4631-8c44-6929875fe67e>",
"WARC-Target-URI": "http://www.sqlservercentral.com/blogs/steve_jones/2009/08/21/the-kindle-update-a-month-on-the-iphone-itouch/print/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b14aadeb-a2de-4835-8f0d-457725ce5752>"
},
"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,
109,
110,
137,
138,
187,
188,
215,
216,
679,
680,
1095,
1096,
1782,
1783,
2331,
2332,
2573,
2574,
2575
],
"line_end_idx": [
109,
110,
137,
138,
187,
188,
215,
216,
679,
680,
1095,
1096,
1782,
1783,
2331,
2332,
2573,
2574,
2575,
2685
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2685,
"ccnet_original_nlines": 19,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42592594027519226,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07098764926195145,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19135801494121552,
"rps_doc_frac_unique_words": 0.4817073345184326,
"rps_doc_mean_word_length": 4.1991868019104,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.00776481628418,
"rps_doc_word_count": 492,
"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.01210067979991436,
"rps_doc_frac_chars_top_3gram": 0.02032914012670517,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -321.80194091796875,
"rps_doc_books_importance_length_correction": -321.80194091796875,
"rps_doc_openwebtext_importance": -189.35006713867188,
"rps_doc_openwebtext_importance_length_correction": -189.35006713867188,
"rps_doc_wikipedia_importance": -162.42955017089844,
"rps_doc_wikipedia_importance_length_correction": -162.42955017089844
},
"fasttext": {
"dclm": 0.04192947968840599,
"english": 0.971453070640564,
"fineweb_edu_approx": 1.1507201194763184,
"eai_general_math": 0.10676605254411697,
"eai_open_web_math": 0.12460625171661377,
"eai_web_code": 0.2009446620941162
}
}
|
{
"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": "025.04",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "Library science",
"level_3": "Library administration"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "-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": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,746,599,376,393,138,000 |
What Has Changed Recently With Websites?
Importance of Web Design and SEO
Creating a web design means two things to look forward for. One is how attractive the design is and the second is how user-friendly and neat the website is.The whole thing can go wrng without these two things.If no one is coming to your website, then how in the world will you sell your products? If you are unable to sell your products or services, then it means your business is going down and eventually you will end up closing your site and this is the consequence if you just focu on the design.
We tend to pay a lot of attention to the design itself because we all believe that it’s the design that helps you create the type of atmosphere you want. Your site should be neat and clean because a badly cluttered website won’t be liked by anyone. This is where SEO company comes in. SEO, which is short for search engine optimization, is supposed to help you generate traffic to your website with the use of specific keywords that are related to what your website is all about.
If a website has been designed by an experienced web design company keeping SEO friendly concepts in mind, then it would be very easy for the SEO to drive more potential customers in a short span. There are plenty of factors that play a huge rule in building a SEO friendly website. To create a dynamic as well as user friendly website, then a high quality web design template should be used, and if you are uncertain of what to utilize and when to use, you can seek the services of a professional web design company.
Without the help of a professional, the whole thing is not an easy thing to do. Most Internet users use a search engine nowadays to find the product and services that they want, and you will lose out on the market share that you can pull in if you do not use SEO company effectively.
Therefore, when you build a website, you should always keep in mind that web design and SEO always work together. Web design and SEO always go hand in hand, and there are thousands of firms online that specialize in both. There was a time when people did keyword stuffing and managed to boost their rankings, but those days are long gone now.Once you have a natural content, you will enjoy free and targeted traffic to your website.
If you are not expert on web design and SEO, it is not too late for you to hire the best web design and SEO company.
The Essential Laws of Professionals Explained
Figuring Out Websites
Categories: Internet Services
|
{
"url": "http://healthsugar.us/2018/03/24/what-has-changed-recently-with-websites/",
"source_domain": "healthsugar.us",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "21549",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CKBQQR2LZZBU6SKSU746JTU43UL3HOL3",
"WARC-Concurrent-To": "<urn:uuid:3e60ad9d-7782-4ed7-9177-3fee33a8d556>",
"WARC-Date": "2018-04-24T01:13:18Z",
"WARC-IP-Address": "209.148.94.16",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IKSAS7LXQZ4OZUXPH62GLRLGYMSQQ4YZ",
"WARC-Record-ID": "<urn:uuid:0a3800ae-3bdc-4002-973c-29a8f7c5dc7a>",
"WARC-Target-URI": "http://healthsugar.us/2018/03/24/what-has-changed-recently-with-websites/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:19475464-735d-4fc9-beb6-75deed043bd3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-148-11-10.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-17\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for April 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
41,
42,
75,
76,
577,
578,
1058,
1059,
1577,
1578,
1862,
1863,
2296,
2297,
2414,
2415,
2461,
2462,
2484,
2485
],
"line_end_idx": [
41,
42,
75,
76,
577,
578,
1058,
1059,
1577,
1578,
1862,
1863,
2296,
2297,
2414,
2415,
2461,
2462,
2484,
2485,
2514
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2514,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5098814368247986,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021739130839705467,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.07905138283967972,
"rps_doc_frac_unique_words": 0.447826087474823,
"rps_doc_mean_word_length": 4.363043308258057,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.8112711906433105,
"rps_doc_word_count": 460,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.020926760509610176,
"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.04035874083638191,
"rps_doc_frac_chars_top_3gram": 0.029895370826125145,
"rps_doc_frac_chars_top_4gram": 0.03736921027302742,
"rps_doc_books_importance": -236.68618774414062,
"rps_doc_books_importance_length_correction": -236.68618774414062,
"rps_doc_openwebtext_importance": -149.45510864257812,
"rps_doc_openwebtext_importance_length_correction": -149.45510864257812,
"rps_doc_wikipedia_importance": -139.6400146484375,
"rps_doc_wikipedia_importance_length_correction": -139.6400146484375
},
"fasttext": {
"dclm": 0.14021897315979004,
"english": 0.9554245471954346,
"fineweb_edu_approx": 1.0940066576004028,
"eai_general_math": 0.004241410177201033,
"eai_open_web_math": 0.029062330722808838,
"eai_web_code": 0.03325909003615379
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "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
|
1,028,933,880,901,569,500 |
Fandom
Wikihack
American Standard Code for Information Interchange
2,032pages on
this wiki
Add New Page
Add New Page Talk0
The American Standard Code for Information Interchange, which everyone calls ASCII, is a character set which a computer uses to store characters. ASCII specifies a method for computers to store printable characters such as letters A to Z, a to z, digits 0 to 9, punctuation, and spaces. ASCII also includes control characters such as newline. Most computers either use ASCII, or a superset of ASCII that adds more characters, such as accented letters, Cyrillic letters, CJK characters, or hieroglyphics.
NetHack uses ASCII for everything. The source code is in ASCII. If you play in tty mode, everything on the screen is ASCII. Also, ASCII corresponds nicely with the keys found on most QWERTY keyboards in the United States. In fact, in modern NetHack 3.x.x, the dungeon contains every printable ASCII character except "6", "7", "8", "9", and "," (the comma). Some older versions of NetHack did use "8" for Medusa and "9" for giants, but NetHack 3.0.0 made monster symbols refer to classes of monsters rather than necessarily single monsters, and now Medusa is @ and giants are H.
The printable ASCII characters are:
~ ! @ # $ % ^ & * ( ) _ +
` 1 2 3 4 5 6 7 8 9 0 - =
Qq Ww Ee Rr Tt Yy Uu Ii Oo Pp {[ }] |\
Aa Ss Dd Ff Gg Hh Jj Kk Ll : ; " '
Zz Xx Cc Vv Bb Nn Mm < , > . ? /
The characters in the above tables all link to their informational page. The goal is to create an article in Wikihack for every character. In the article, mention which monster or object that character represents, and what that key does from the keyboard. Try to link to other articles; for example, d should link to both dog and drop.
NetHack also uses some non-printable ASCII characters for commands. Those are commands that use Ctrl key. Pressing Ctrl and another character sends a non-printable character. Alt key has similar function.
For technical reasons, angle brackets, curly brackets, square brackets, hash marks, pipes, or plus signs can not be used in the names of articles. Also, an article name cannot contain only underscores, and it cannot consist of exactly one or two dots. Thus all of those articles have words for names.
Also on Fandom
Random Wiki
|
{
"url": "http://nethack.wikia.com/wiki/American_Standard_Code_for_Information_Interchange",
"source_domain": "nethack.wikia.com",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "123336",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:53O67KXGCODCFDOFAYP2KPTI54NIZCGD",
"WARC-Concurrent-To": "<urn:uuid:9452ad99-d6fc-41ce-8539-59e0370074cf>",
"WARC-Date": "2016-10-23T14:17:33Z",
"WARC-IP-Address": "23.235.33.194",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ORXDOURA2JP7PEVL5CDZSSAHZQC2FV7S",
"WARC-Record-ID": "<urn:uuid:5cf2c68c-9785-4c76-a1bd-cf9a3201f05b>",
"WARC-Target-URI": "http://nethack.wikia.com/wiki/American_Standard_Code_for_Information_Interchange",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ba457897-2fb7-4513-9c1a-bc82a5d54a28>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-6-4.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-44\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for October 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
7,
8,
17,
18,
69,
70,
84,
94,
107,
126,
127,
631,
632,
1210,
1211,
1247,
1248,
1274,
1300,
1339,
1374,
1407,
1408,
1744,
1745,
1950,
1951,
2252,
2253,
2268,
2269
],
"line_end_idx": [
7,
8,
17,
18,
69,
70,
84,
94,
107,
126,
127,
631,
632,
1210,
1211,
1247,
1248,
1274,
1300,
1339,
1374,
1407,
1408,
1744,
1745,
1950,
1951,
2252,
2253,
2268,
2269,
2280
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2280,
"ccnet_original_nlines": 31,
"rps_doc_curly_bracket": 0.000877189973834902,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30894309282302856,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03455284982919693,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25406503677368164,
"rps_doc_frac_unique_words": 0.5535247921943665,
"rps_doc_mean_word_length": 4.5509138107299805,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0.002032520016655326,
"rps_doc_unigram_entropy": 5.020201683044434,
"rps_doc_word_count": 383,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05163510888814926,
"rps_doc_frac_chars_dupe_6grams": 0.05163510888814926,
"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.011474469676613808,
"rps_doc_frac_chars_top_3gram": 0.027538729831576347,
"rps_doc_frac_chars_top_4gram": 0.026391280815005302,
"rps_doc_books_importance": -196.35003662109375,
"rps_doc_books_importance_length_correction": -196.35003662109375,
"rps_doc_openwebtext_importance": -123.91131591796875,
"rps_doc_openwebtext_importance_length_correction": -123.91131591796875,
"rps_doc_wikipedia_importance": -97.11416625976562,
"rps_doc_wikipedia_importance_length_correction": -97.11416625976562
},
"fasttext": {
"dclm": 0.244032084941864,
"english": 0.8937085866928101,
"fineweb_edu_approx": 2.7428598403930664,
"eai_general_math": 0.3808276057243347,
"eai_open_web_math": 0.2564926743507385,
"eai_web_code": 0.4932789206504822
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "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,899,460,206,115,286,000 |
Главная / Информатика / Пример решения уравнения в табличном процессоре.
Пример решения уравнения в табличном процессоре.
Скачать материал
Пример решения уравнения в табличном процессоре. Скачать материал
• Информатика
Описание:
Уравнения, в которых встречаются разнородные функции трудно, а чаще, невозможно решить аналитически (например, уравнения, содержащие многочлен и показательную или логарифмическую функции, показательную и тригонометрические функции и т.п.). Можно предложить метод приближённого решения таких уравнений с помощью метода "Поиск решения" в табличном процессоре (например, в MS Excel). В данной разработке разобран пример решения уравнения log2x = x2 – 7x - 5 методом поиска решения.
Автор Дамаев Ряшит Харисович
Дата добавления 20.12.2014
Раздел Информатика
Подраздел
Просмотров 547
Номер материала 8954
Скачать свидетельство о публикации
Оставьте свой комментарий:
Введите символы, которые изображены на картинке:
Получить новый код
* Обязательные для заполнения.
Комментарии:
↓ Показать еще коментарии ↓
|
{
"url": "https://www.metod-kopilka.ru/primer_resheniya_uravneniya_v_tablichnom_processore.-8954.htm",
"source_domain": "www.metod-kopilka.ru",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "38421",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:T3CBP5XOWRTHB7LSS6CBHI6MUGRQHS4Y",
"WARC-Concurrent-To": "<urn:uuid:26d19636-54c8-4709-8d6d-27a785a80f0a>",
"WARC-Date": "2017-03-24T16:18:30Z",
"WARC-IP-Address": "178.63.85.137",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:53X5WNYWZ4QMGH5WK2LIGZRS6C6AXVUY",
"WARC-Record-ID": "<urn:uuid:1f7cb7dd-0a82-4af8-b641-45adb584caff>",
"WARC-Target-URI": "https://www.metod-kopilka.ru/primer_resheniya_uravneniya_v_tablichnom_processore.-8954.htm",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9da6e4b9-5bc6-4809-8e00-32bae2aac07b>"
},
"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,
73,
74,
123,
124,
141,
207,
223,
233,
234,
758,
759,
788,
815,
834,
844,
859,
880,
915,
916,
943,
944,
993,
994,
1013,
1044,
1045,
1046,
1059,
1060
],
"line_end_idx": [
73,
74,
123,
124,
141,
207,
223,
233,
234,
758,
759,
788,
815,
834,
844,
859,
880,
915,
916,
943,
944,
993,
994,
1013,
1044,
1045,
1046,
1059,
1060,
1087
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1087,
"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,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01234568003565073,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.9691358208656311,
"rps_doc_frac_unique_words": 0.703125,
"rps_doc_mean_word_length": 6.796875,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.278925895690918,
"rps_doc_word_count": 128,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.17931033670902252,
"rps_doc_frac_chars_dupe_6grams": 0.17931033670902252,
"rps_doc_frac_chars_dupe_7grams": 0.1310344785451889,
"rps_doc_frac_chars_dupe_8grams": 0.1310344785451889,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05977011099457741,
"rps_doc_frac_chars_top_3gram": 0.10114943236112595,
"rps_doc_frac_chars_top_4gram": 0.079310342669487,
"rps_doc_books_importance": -78.14103698730469,
"rps_doc_books_importance_length_correction": -78.14103698730469,
"rps_doc_openwebtext_importance": -39.57712936401367,
"rps_doc_openwebtext_importance_length_correction": -29.54013442993164,
"rps_doc_wikipedia_importance": -33.89397048950195,
"rps_doc_wikipedia_importance_length_correction": -33.89397048950195
},
"fasttext": {
"dclm": 0.19427788257598877,
"english": 0.000025720000849105418,
"fineweb_edu_approx": 2.033270835876465,
"eai_general_math": -0.000010009999641624745,
"eai_open_web_math": 0.950839102268219,
"eai_web_code": 0.9994891285896301
}
}
|
{
"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": "512.94",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,801,105,055,462,033,200 |
FIX: Xerox ColorQube 8700S V4 Driver
If you have landed on this page then it is highly likely you are having problems with your Xerox ColorQube 8700S V4 drivers and are experiencing an error similar to this one:
Driver Error - Xerox ColorQube 8700S V4
Error Icon
Unable to start program due to the Xerox ColorQube 8700S V4 driver being missing from your computer. Try reinstalling the program to fix the problem.
Drivers are an important part of your Microsoft Windows operating system and allow it to communicate with devices such as printers and graphics cards.
What is a driver?
A driver is essentially a collection of files that your Windows operating system uses in order to understand how hardware works.
When you connect a new device through USB for example Windows will quickly try to establish what it is.
Sometimes Windows will be able to recognize right away what it is and how it can interact with it, allowing software (such as programs and video games) to access its features.
Often you may find that a new device simply isn’t recognized straight away and so you need to find the correct “drivers” to make the link.
You can download these as an installable .exe file that has everything in it ready-to-go, you just double click and follow the instructions on the screen.
How to fix Xerox Xerox ColorQube 8700S V4 driver issues?
Luckily you have several options if you want to fix the missing Xerox ColorQube 8700S V4 driver problem your computer is experiencing.
1. The manual method – searching online for the correct version from the manufacturer
2. Have a program install it for you and take care of future driver updates
3. Look for the disk that came with the device that will have an older driver on
1. Search online for the correct and most recent driver executable
Google Search ExampleDoing a simple Google search for the Xerox ColorQube 8700S V4 drivers will probably eventually lead you to the devices page on the manufacturer’s website.
On this page, you are likely to see a link to the drivers available for this device along with versions and the date of their release.
You are most likely going to want to try out the most recent release first to see if that works with your copy of Windows and then work backward.
If you want to skip this trial and error and have this done for you by a program then move onto the second method below.
2. How to install the driver automatically?
The easiest and most hassle-free way of fixing any of your missing Xerox ColorQube 8700S V4 driver errors is to use a tool like Outbyte’s Driver Updater.
This program can easily and quickly search for the missing driver and install it correctly with almost zero input from you.
It works sort of like an anti-virus, it scans your computer and detects any missing drivers (some you may not even realize you are missing!) then downloads and applies the latest version.
Luckily the company offers a 7-day free trial of the software which is plenty of time to fix your missing driver issue and see if the program is worth paying for.
You can use the link below to check that it works with your version of Windows and then proceed to download it.
Download Now
See more information about Outbyte and uninstall instructions. Please review Outbyte EULA and Privacy Policy
File Size: 3.04 MB, Download time: < 1 min. on DSL/ADSL/Cable
This Tool is Compatible With:
Windows Versions
Laptop Running Driver Scan
Click "Download Now" to get the PC tool that comes with the Xerox ColorQube 8700S V4 drivers. The utility will determine missing drivers and offer to install them automatically. Being an easy-to-use utility, it is a great alternative to manual installation, which has been recognized by many computer experts and computer magazines. Limitations: trial version offers an unlimited number of scans, backup, restore of your windows registry for FREE. Full version must be purchased. It supports such operating systems as Windows 10, Windows 8 / 8.1, Windows 7 and Windows Vista (64/32 bit).
3. Install the Xerox ColorQube 8700S V4 driver from the disk that came with the device
A Pack of Disks SavedWhen you purchased your Xerox Xerox ColorQube 8700S V4 you should have got a disk in the box/packet that it came in.
On this disk (most probably a CD) you should find an installable file that contains the latest driver at the time of purchase.
Chances are though, that this is drastically out of date and for security reasons you should probably seek the newest version as possible online.
The company may have found issues with the device or how it interacts with newer versions of Windows and then patched them.
Popular DLL Files
Newest DLL Files
|
{
"url": "https://spydrivers.com/xerox/xerox-colorqube-8700s-v4/",
"source_domain": "spydrivers.com",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "35357",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QDHYQEMOFDHZ6YIFVUJEUHME6J2KMUBE",
"WARC-Concurrent-To": "<urn:uuid:32d32f66-e5c9-45f5-940d-e60207337a7f>",
"WARC-Date": "2021-05-14T16:51:24Z",
"WARC-IP-Address": "104.21.27.63",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TIFXB5HAXGK3JCP2RTL4NFPF3QKEHVKS",
"WARC-Record-ID": "<urn:uuid:e0e84477-aa2a-4d79-b4c0-8ad6aa49c9bc>",
"WARC-Target-URI": "https://spydrivers.com/xerox/xerox-colorqube-8700s-v4/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:25226ff5-675a-4406-a963-6927931dc7ca>"
},
"warc_info": "isPartOf: CC-MAIN-2021-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-185.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,
37,
38,
39,
214,
215,
255,
256,
267,
268,
418,
419,
570,
571,
589,
590,
719,
720,
824,
825,
1001,
1002,
1141,
1142,
1297,
1298,
1355,
1356,
1491,
1492,
1580,
1658,
1741,
1742,
1809,
1810,
1986,
1987,
2122,
2123,
2269,
2270,
2391,
2392,
2436,
2437,
2591,
2592,
2716,
2717,
2905,
2906,
3069,
3070,
3182,
3183,
3196,
3197,
3306,
3307,
3369,
3370,
3400,
3401,
3418,
3445,
3446,
4034,
4035,
4122,
4123,
4261,
4262,
4389,
4390,
4536,
4537,
4661,
4662,
4663,
4681,
4682
],
"line_end_idx": [
37,
38,
39,
214,
215,
255,
256,
267,
268,
418,
419,
570,
571,
589,
590,
719,
720,
824,
825,
1001,
1002,
1141,
1142,
1297,
1298,
1355,
1356,
1491,
1492,
1580,
1658,
1741,
1742,
1809,
1810,
1986,
1987,
2122,
2123,
2269,
2270,
2391,
2392,
2436,
2437,
2591,
2592,
2716,
2717,
2905,
2906,
3069,
3070,
3182,
3183,
3196,
3197,
3306,
3307,
3369,
3370,
3400,
3401,
3418,
3445,
3446,
4034,
4035,
4122,
4123,
4261,
4262,
4389,
4390,
4536,
4537,
4661,
4662,
4663,
4681,
4682,
4698
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4698,
"ccnet_original_nlines": 81,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4323432445526123,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03850385174155235,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11661165952682495,
"rps_doc_frac_unique_words": 0.373913049697876,
"rps_doc_mean_word_length": 4.670807361602783,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.076506614685059,
"rps_doc_word_count": 805,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09547872096300125,
"rps_doc_frac_chars_dupe_6grams": 0.06542553007602692,
"rps_doc_frac_chars_dupe_7grams": 0.014893620274960995,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04095745086669922,
"rps_doc_frac_chars_top_3gram": 0.0555851086974144,
"rps_doc_frac_chars_top_4gram": 0.06143616884946823,
"rps_doc_books_importance": -395.9314880371094,
"rps_doc_books_importance_length_correction": -395.9314880371094,
"rps_doc_openwebtext_importance": -227.82791137695312,
"rps_doc_openwebtext_importance_length_correction": -227.82791137695312,
"rps_doc_wikipedia_importance": -225.0736541748047,
"rps_doc_wikipedia_importance_length_correction": -225.0736541748047
},
"fasttext": {
"dclm": 0.04539709910750389,
"english": 0.932405948638916,
"fineweb_edu_approx": 1.528977870941162,
"eai_general_math": 0.10712546110153198,
"eai_open_web_math": 0.1665152907371521,
"eai_web_code": 0.0376514196395874
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,562,990,555,108,818,400 |
Skip to main content
1E 23.11 (SaaS)
HAACKTimeoutMins
The time-out period in minutes for the Peer Backup Assistant - High Availability (PBA-HA) task sequence action. If a machine running this action does not receive an acknowledgement message within this period from the PBA host performing the additional backups, the action will fail.
Registry value
Default value
Notes
Installer property
NMDS\ HAACKTimeoutMins
20
Applies to synchronized backups only. The PBA tost sends the acknowledgement messages back to the machine running the task sequence approximately every 5% of the synchronized copy. This registry value is found under the PBA registry key NomadBranch\NMDS.
MODULE.NOMAD.HAACKTIMEOUTMINS
|
{
"url": "https://help.1e.com/1E23.11/en/803955-804868-haacktimeoutmins.html",
"source_domain": "help.1e.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "401272",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KJY6F5NJLI4NNNDHCIYZYUTVNMX2TZVR",
"WARC-Concurrent-To": "<urn:uuid:f7f94804-678c-4194-a32d-1b57f3ef9b17>",
"WARC-Date": "2024-02-26T17:30:55Z",
"WARC-IP-Address": "20.56.132.78",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:OGLBQYCRZXQSFFPXO4UOMUW4KVODDOX4",
"WARC-Record-ID": "<urn:uuid:5df8cffa-fd70-46df-9647-31a276631dba>",
"WARC-Target-URI": "https://help.1e.com/1E23.11/en/803955-804868-haacktimeoutmins.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:db7221b5-249b-435c-932b-09596eac4207>"
},
"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-123\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
21,
22,
38,
39,
56,
57,
340,
341,
356,
357,
371,
372,
378,
379,
398,
399,
422,
423,
426,
427,
682,
683
],
"line_end_idx": [
21,
22,
38,
39,
56,
57,
340,
341,
356,
357,
371,
372,
378,
379,
398,
399,
422,
423,
426,
427,
682,
683,
712
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 712,
"ccnet_original_nlines": 22,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25600001215934753,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08799999952316284,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18400000035762787,
"rps_doc_frac_unique_words": 0.6899999976158142,
"rps_doc_mean_word_length": 5.820000171661377,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.018885135650635,
"rps_doc_word_count": 100,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.030927840620279312,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -55.49295425415039,
"rps_doc_books_importance_length_correction": -55.81459045410156,
"rps_doc_openwebtext_importance": -30.973909378051758,
"rps_doc_openwebtext_importance_length_correction": -31.29554557800293,
"rps_doc_wikipedia_importance": -30.69013214111328,
"rps_doc_wikipedia_importance_length_correction": -31.011768341064453
},
"fasttext": {
"dclm": 0.03857326880097389,
"english": 0.8034957051277161,
"fineweb_edu_approx": 1.171025037765503,
"eai_general_math": 0.05770045891404152,
"eai_open_web_math": 0.5537564158439636,
"eai_web_code": 0.0003607299877330661
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
403,722,826,496,889,900 |
Author alecsandru.patrascu
Recipients alecsandru.patrascu, brett.cannon, gregory.p.smith, larry, pitrou, python-dev, scoder, skip.montanaro, skrah, tzot, vstinner
Date 2016-02-08.19:45:12
SpamBayes Score -1.0
Marked as misclassified Yes
Message-id <[email protected]>
In-reply-to
Content
That's interesting. Even on CPython3, I still don't see any gcda's inside the build directory, nor the tree structure you are seeing there. Can you please give me a couple of details regarding your environment (os, distribution, gcc version, 32/64 bit, cross compilation, etc)?
If this is a general issue, I can add another patch to fix it.
History
Date User Action Args
2016-02-08 19:45:13alecsandru.patrascusetrecipients: + alecsandru.patrascu, skip.montanaro, brett.cannon, gregory.p.smith, tzot, pitrou, scoder, vstinner, larry, skrah, python-dev
2016-02-08 19:45:13alecsandru.patrascusetmessageid: <[email protected]>
2016-02-08 19:45:13alecsandru.patrasculinkissue24915 messages
2016-02-08 19:45:12alecsandru.patrascucreate
|
{
"url": "https://bugs.python.org/msg259878",
"source_domain": "bugs.python.org",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "12077",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:64FCJ5OPNTH733YVCLXHKNYXNWHIYBBX",
"WARC-Concurrent-To": "<urn:uuid:1c954d6e-e404-4eb5-9a09-fe01ff11f147>",
"WARC-Date": "2021-10-16T22:35:56Z",
"WARC-IP-Address": "188.166.48.69",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:YSDVP6C6SAZ45X6YPSN65U3JK2R2EZ5X",
"WARC-Record-ID": "<urn:uuid:92451653-610b-4b4b-814c-f66c49741391>",
"WARC-Target-URI": "https://bugs.python.org/msg259878",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9bd58397-7642-406e-adcf-761491592891>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-13\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
27,
163,
188,
209,
237,
314,
326,
334,
613,
614,
677,
685,
707,
887,
1005,
1067
],
"line_end_idx": [
27,
163,
188,
209,
237,
314,
326,
334,
613,
614,
677,
685,
707,
887,
1005,
1067,
1111
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1111,
"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.12681159377098083,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0072463802061975,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.510869562625885,
"rps_doc_frac_unique_words": 0.8018018007278442,
"rps_doc_mean_word_length": 8.054054260253906,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.417566299438477,
"rps_doc_word_count": 111,
"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.053691279143095016,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -129.33787536621094,
"rps_doc_books_importance_length_correction": -129.33787536621094,
"rps_doc_openwebtext_importance": -91.31832885742188,
"rps_doc_openwebtext_importance_length_correction": -83.63545989990234,
"rps_doc_wikipedia_importance": -86.38340759277344,
"rps_doc_wikipedia_importance_length_correction": -86.38340759277344
},
"fasttext": {
"dclm": 0.14581936597824097,
"english": 0.6141404509544373,
"fineweb_edu_approx": 1.009399652481079,
"eai_general_math": 0.07264208793640137,
"eai_open_web_math": 0.5076512098312378,
"eai_web_code": 0.0017434400506317616
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,033,014,687,402,522,200 |
Skip to content
So, tell me about your file... Given any file, PHP library describr will describe it http://www.boxuk.com/
PHP Shell
Find file
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Failed to load latest commit information.
bin
lib
tests
.gitignore
LICENCE-GPL
LICENCE-MIT
README.markdown
build.xml
composer.json
package.php
README.markdown
Describr
Describr is an object-oriented library for describing files. It uses a plugins to determine as much information as it can about a file.
Describr can be run from the command line via a supplied script, or it can be integrated into any PHP project to gather information about a variety of file types. You can write your own plugins, and a few of the file types Describr supports "out of the box" with the bundled plugins include:
• GIF
• JPEG
• PNG
• WMV
• MP4
• MP3
• AVI
• ... and many more!
If there's a file you want to interrogate and its type isn't supported, you can add a plugin to {describr root}/lib/BoxUK/Describr/Plugins and it will automatically be picked up and ready for use!
Requirements:
• PHP 5.3+
• Fileinfo extension
Plugins may have their own requirements. Some of the requirements for bundled plugins are:
Installation
It's easy to get Describring! If you just want to use it without writing plugins, you can install through our PEAR channel, pear.boxuk.net (check our Box UK Labs page for details on that), but we're assuming that because you're here on our Github you want to get stuck in and grab the source. Great! Here's how you do it:
1. Install Zend Framework version 1.(latest). Probably best installed via PEAR so it's automatically on your PHP path, else you'll need to add it to the path manually.
2. Download or checkout PHP-reader 1.8.1 or better and add it to your PHP include path.
3. Grab the source from Github by cloning the repo (or downloading the zip).
What if I can't add things to my php include path?
If, in stages (1) and (2), you weren't able to add Zend and PHP-Reader to your PHP include path, you can do the following:
In the root of Describr, copy {describr root}/lib/bootstrap.custom.php-sample to {describr root}/lib/bootstrap.custom.php. You'll now need to edit {describr root}/lib/bootstrap.custom.php and provide a path to PHP-Reader. You might also need to set a path to Zend Framework in there too.
If you don't include the Zend Framework and PHP-Reader, Describr will still work but you will not be able to use it to get much information about audio/video files.
Using Describr
It's time to test that Describr is installed and ready to rock! We've provided a simple command line executable script to help you do this, so if you're on Linux/OSX/Unix, chmod {describr root}/bin/describr to be executable. On Windows, you should just be able to run {describr root}/bin/describr.bat:
gavd@gavd-desktop:/opt/BoxUK/describr$ bin/describr
describr - tell me about your file...
(c) 2011 Box UK
Usage: describr [path to file]
describr [path to file 1] [path to file 2] ... [path to file N]
If you don't see the above, head back to the Installation section and see if there's anything you've missed. Failing that, there's a Troubleshooting section below
and then you should be able to do something like:
gavd@gavd-desktop:/opt/BoxUK/describr$ bin/describr tmp.txt
Analysing tmp.txt...
array(2) {
["BoxUK\General"]=>
array(6) {
["errors"]=>
array(0) {
}
["extension"]=>
string(3) "txt"
["type"]=>
string(8) "document"
["mimeType"]=>
string(10) "text/plain"
["fileSizeInBytes"]=>
int(4)
["fileSize"]=>
string(11) "Extra Small"
}
["BoxUK\PlainText"]=>
array(4) {
["errors"]=>
array(0) {
}
["lines"]=>
int(1)
["characters"]=>
int(4)
["words"]=>
int(1)
}
}
So, we're up and running! Unless we're not, in which case:
Troubleshooting
Please check that:
1. Make sure you've chmodded {describr}/bin/describr to be executable if you're on Linux/Unix/OSX:
gavd@gavd-desktop:/opt/BoxUK/describr$ chmod u+x bin/describr
1. Zend Framework and PHP-Reader are both on the PHP include path OR you are using a custom bootstrap.php. In the latter case, check that {describr root}lib/bootstrap.custom.php exists and $describr_pathToPHPReaderLibrary is set correctly. It must point to the "library" or "src" directory (depending on the version of php-reader you're using) - the one that contains the directory "Zend"
2. Zend Framework should be installed. Installing this by PEAR is probably the cleanest way to do this, but if you are not able to use PEAR (e.g. you're on restrictive shared hosting, you can add the following to {describr root}/lib/bootstrap.custom.php:
<?php
// ... add the line below to the end of the file
set_include_path('.:/home/you/yourProject/lib/ZendFramework-1.11.1/library');
Of course, you will have to adjust the paths to point to where Zend is installed. This is only as a last resort, it's better to use PEAR.
Any other problems, please put in an issue on the Github project for Describr and we'll try to help you out. As much info as possible, please!
Plugins
Describr is based around plugins. Each plugin has a list of file types that it knows how to describe. The built-in plugins live in {describr root}/lib/BoxUK/Describr/Plugins/BoxUK. Each plugin has one class that implements Plugin, mainly by extending AbstractPlugin.
Plugin dependencies
You specify the dependencies for each plugin in the plugin's code. Here's an example from ImagePlugin.php:
/**
* Make sure that this plugin has everything that it needs - i.e. GD
*
* @throws UnmetDependencyException If a dependency is not met
*/
public function checkDependencies() {
if (!extension_loaded('gd') || !function_exists('gd_info')) {
throw new UnmetDependencyException('GD is not installed');
}
}
If the dependencies of a plugin are not met (i.e. checkDependencies() fails), that plugin cannot be used, and will fail silently and record an error when it finds a file it can match but can't report on because of missing dependencies:
gavd@gavd-desktop:/opt/BoxUK/describr$ bin/describr tests/resources/test.mov
Analysing tests/resources/test.mov...
array(2) {
["BoxUK\General"]=>
*removed for brevity*
["BoxUK\AudioVideo\Iso14496Video"]=>
array(1) {
["errors"]=>
array(1) {
[0]=>
string(1236) "This plugin matched the file tests/resources/test.mov, but the dependencies could not be matched. Details:
exception 'BoxUK\Describr\Plugins\UnmetDependencyException' with message 'Class Zend_Media_Iso14496 is not loaded - please ensure the php-reader library is on the include path if you wish to use this plugin' in /opt/BoxUK/describr/lib/BoxUK/Describr/Plugins/BoxUK/AudioVideo/Iso14496VideoPlugin.php:30
Stack trace: *removed for brevity*
}
}
}
Creating a plugin
Let's create a trivial plugin. This plugin will just estimate the number of tags in an XML file by counting the < characters and dividing by two - of course, you'd probably not do this in a production application but it should serve to illustrate Describr plugins!
We create a file {describr root}/lib/BoxUK/Describr/Plugins/Custom/XmlPlugin.php with the following contents:
<?php
namespace BoxUK\Describr\Plugins\Custom;
/**
* Plugin for automatically describing XML files
*
* @package BoxUK\Describr\Plugins\BoxUK
* @author Box UK <[email protected]>
* @copyright Copyright (c) 2011, Box UK
* @license http://opensource.org/licenses/mit-license.php MIT License and http://www.gnu.org/licenses/gpl.html GPL license
* @link http://github.com/boxuk/describr
* @since 1.0.5
*/
class XmlPlugin extends \BoxUK\Describr\Plugins\AbstractPlugin
{
/**
* @return array Types of file this plugin can determine information about
*/
public function getMatchingMimeTypes() {
return array(
'text/xml'
);
}
/**
* @return array File extensions this plugin can determine information about.
* The "." is not included, so "wmf" is OK, ".wmf" is not
*/
public function getMatchingFileExtensions() {
return array(
'xml',
'xsl',
);
}
/**
* Stub out configuration loading
*/
protected function loadConfiguration() {}
/**
* @return array With key 'tags' which is a count of tags in this document
*/
protected function setAttributes() {
$fileContents = file_get_contents($this->fullPathToFileOnDisk);
$tagOpenCount = substr_count($fileContents, '<');
$tagCloseCount = substr_count($fileContents, '</');
$tagCount = $tagOpenCount - $tagCloseCount;
$this->attributes['tags'] = $tagCount;
}
}
Notice we haven't specified any dependencies here - it's all vanilla PHP.
Now, if we run our test script against Describr's own build.xml (for example), the XML plugin should automatically be used!
gavd@gavd-desktop:/opt/BoxUK/describr$ bin/describr build.xml
Analysing build.xml...
array(3) {
["BoxUK\General"]=>
array(5) {
["errors"]=>
array(0) {
}
["extension"]=>
string(3) "xml"
["type"]=>
NULL
["mimeType"]=>
string(15) "application/xml"
["fileSizeInBytes"]=>
int(1191)
}
["BoxUK\PlainText"]=>
array(4) {
["errors"]=>
array(0) {
}
["lines"]=>
int(34)
["characters"]=>
int(1191)
["words"]=>
int(122)
}
["Custom\Xml"]=>
array(2) {
["errors"]=>
array(0) {
}
["tags"]=>
int(15)
}
}
Accessing through your project
Using Describr on the command line is all well and good for getting going and testing plugins, but the meat of it is using it in a project to tell you about files. You can do something like:
<?php
// ...
$this->describr = new \BoxUK\Describr\Facade();
$responseFromDescribr = $this->describr->describeFile($pathToFile);
This will give you a BoxUK\Describr\MediaFileAttributes object, which you can interrogate to find out which plugins said what about the file! The toArray method gives you what we've used so far in the command line scripts, or you can access it plugin-by-plugin for more fine-grained and powerful control.
Get involved!
If you find this project useful, or you've found a cool way of using it, let us know! If you've written any useful plugins, then by all means submit a pull request and we'll take a look!
Something went wrong with that request. Please try again.
|
{
"url": "https://github.com/boxuk/describr",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "91988",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B2V4IGFEMGK3T3ZO3OY5A32EY27R2CDR",
"WARC-Concurrent-To": "<urn:uuid:5f2d5caa-07e9-4920-be59-f71552984aad>",
"WARC-Date": "2016-02-08T05:02:17Z",
"WARC-IP-Address": "192.30.252.131",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5E4EA4KMSW5ANNK3OP5Z7BQKYUEKY64P",
"WARC-Record-ID": "<urn:uuid:9fd17f09-3dd8-44e2-bd9d-41bd75f60fd8>",
"WARC-Target-URI": "https://github.com/boxuk/describr",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d5d46c10-56d1-4988-a7eb-1c9b5b76580a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-182-209.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-07\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
16,
123,
133,
143,
167,
215,
257,
261,
265,
271,
282,
294,
306,
322,
332,
346,
358,
359,
375,
376,
385,
386,
522,
523,
815,
816,
824,
833,
841,
849,
857,
865,
873,
896,
897,
1094,
1095,
1109,
1110,
1123,
1146,
1147,
1238,
1239,
1252,
1253,
1575,
1576,
1746,
1836,
1915,
1916,
1967,
1968,
2091,
2092,
2380,
2381,
2546,
2547,
2562,
2563,
2865,
2866,
2918,
2956,
2972,
3003,
3074,
3075,
3238,
3239,
3289,
3290,
3350,
3371,
3382,
3404,
3417,
3434,
3449,
3455,
3475,
3495,
3510,
3535,
3554,
3582,
3608,
3619,
3638,
3667,
3671,
3695,
3708,
3725,
3740,
3746,
3762,
3773,
3794,
3805,
3821,
3832,
3836,
3838,
3839,
3898,
3899,
3915,
3916,
3935,
3936,
4037,
4103,
4494,
4751,
4757,
4806,
4884,
4885,
5023,
5024,
5167,
5168,
5176,
5177,
5444,
5445,
5465,
5466,
5573,
5574,
5578,
5647,
5650,
5713,
5717,
5755,
5821,
5888,
5894,
5896,
5897,
6133,
6134,
6211,
6249,
6260,
6282,
6308,
6347,
6360,
6377,
6392,
6404,
6531,
6833,
6868,
6869,
6875,
6879,
6881,
6882,
6900,
6901,
7166,
7167,
7277,
7278,
7284,
7285,
7326,
7327,
7331,
7380,
7383,
7426,
7470,
7511,
7637,
7684,
7704,
7708,
7771,
7773,
7774,
7782,
7861,
7869,
7914,
7936,
7959,
7970,
7976,
7977,
7985,
8067,
8129,
8137,
8187,
8209,
8228,
8247,
8258,
8264,
8265,
8273,
8311,
8319,
8365,
8366,
8374,
8453,
8461,
8502,
8574,
8632,
8692,
8744,
8745,
8792,
8798,
8800,
8801,
8875,
8876,
9000,
9001,
9063,
9086,
9097,
9119,
9132,
9149,
9164,
9170,
9190,
9210,
9225,
9234,
9253,
9286,
9312,
9326,
9330,
9354,
9367,
9384,
9399,
9405,
9421,
9433,
9454,
9468,
9484,
9497,
9501,
9520,
9533,
9550,
9565,
9571,
9586,
9598,
9602,
9604,
9605,
9636,
9637,
9828,
9829,
9835,
9842,
9890,
9958,
9959,
10264,
10265,
10279,
10280,
10467,
10468
],
"line_end_idx": [
16,
123,
133,
143,
167,
215,
257,
261,
265,
271,
282,
294,
306,
322,
332,
346,
358,
359,
375,
376,
385,
386,
522,
523,
815,
816,
824,
833,
841,
849,
857,
865,
873,
896,
897,
1094,
1095,
1109,
1110,
1123,
1146,
1147,
1238,
1239,
1252,
1253,
1575,
1576,
1746,
1836,
1915,
1916,
1967,
1968,
2091,
2092,
2380,
2381,
2546,
2547,
2562,
2563,
2865,
2866,
2918,
2956,
2972,
3003,
3074,
3075,
3238,
3239,
3289,
3290,
3350,
3371,
3382,
3404,
3417,
3434,
3449,
3455,
3475,
3495,
3510,
3535,
3554,
3582,
3608,
3619,
3638,
3667,
3671,
3695,
3708,
3725,
3740,
3746,
3762,
3773,
3794,
3805,
3821,
3832,
3836,
3838,
3839,
3898,
3899,
3915,
3916,
3935,
3936,
4037,
4103,
4494,
4751,
4757,
4806,
4884,
4885,
5023,
5024,
5167,
5168,
5176,
5177,
5444,
5445,
5465,
5466,
5573,
5574,
5578,
5647,
5650,
5713,
5717,
5755,
5821,
5888,
5894,
5896,
5897,
6133,
6134,
6211,
6249,
6260,
6282,
6308,
6347,
6360,
6377,
6392,
6404,
6531,
6833,
6868,
6869,
6875,
6879,
6881,
6882,
6900,
6901,
7166,
7167,
7277,
7278,
7284,
7285,
7326,
7327,
7331,
7380,
7383,
7426,
7470,
7511,
7637,
7684,
7704,
7708,
7771,
7773,
7774,
7782,
7861,
7869,
7914,
7936,
7959,
7970,
7976,
7977,
7985,
8067,
8129,
8137,
8187,
8209,
8228,
8247,
8258,
8264,
8265,
8273,
8311,
8319,
8365,
8366,
8374,
8453,
8461,
8502,
8574,
8632,
8692,
8744,
8745,
8792,
8798,
8800,
8801,
8875,
8876,
9000,
9001,
9063,
9086,
9097,
9119,
9132,
9149,
9164,
9170,
9190,
9210,
9225,
9234,
9253,
9286,
9312,
9326,
9330,
9354,
9367,
9384,
9399,
9405,
9421,
9433,
9454,
9468,
9484,
9497,
9501,
9520,
9533,
9550,
9565,
9571,
9586,
9598,
9602,
9604,
9605,
9636,
9637,
9828,
9829,
9835,
9842,
9890,
9958,
9959,
10264,
10265,
10279,
10280,
10467,
10468,
10525
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10525,
"ccnet_original_nlines": 283,
"rps_doc_curly_bracket": 0.006270780228078365,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2815822958946228,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021267550066113472,
"rps_doc_frac_lines_end_with_ellipsis": 0.0211267601698637,
"rps_doc_frac_no_alph_words": 0.33815398812294006,
"rps_doc_frac_unique_words": 0.370728075504303,
"rps_doc_mean_word_length": 5.575037002563477,
"rps_doc_num_sentences": 127,
"rps_doc_symbol_to_word_ratio": 0.004253509920090437,
"rps_doc_unigram_entropy": 5.573387622833252,
"rps_doc_word_count": 1346,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.030383799225091934,
"rps_doc_frac_chars_dupe_6grams": 0.010127929970622063,
"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.0063965898007154465,
"rps_doc_frac_chars_top_3gram": 0.007462690118700266,
"rps_doc_frac_chars_top_4gram": 0.003997869789600372,
"rps_doc_books_importance": -1075.019775390625,
"rps_doc_books_importance_length_correction": -1075.019775390625,
"rps_doc_openwebtext_importance": -574.3403930664062,
"rps_doc_openwebtext_importance_length_correction": -574.3403930664062,
"rps_doc_wikipedia_importance": -505.41375732421875,
"rps_doc_wikipedia_importance_length_correction": -505.41375732421875
},
"fasttext": {
"dclm": 0.24474412202835083,
"english": 0.7691330909729004,
"fineweb_edu_approx": 1.8769811391830444,
"eai_general_math": 0.4470653533935547,
"eai_open_web_math": 0.4271578788757324,
"eai_web_code": 0.4172138571739197
}
}
|
{
"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": "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
|
-5,314,040,388,732,520,000 |
Postman
Postman is a well known application providing developers tools to ease API development.
While there is no native Blackfire integration in Postman, it is simple to profile requests using the Blackfire PHP SDK via an arbitrary HTTP header that triggers profiling.
The principle is simple: update the API front controller to enable profiling if a specific header is part of the HTTP request.
First, install the blackfire PHP SDK:
1
composer require blackfire/php-sdk
Note
If you're not familiar with the SDK, please read the dedicated SDK documentation.
Then update your front controller to activate the Blackfire Probe when the header BLACKFIRETRIGGER is present:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
require __DIR__.'/../vendor/autoload.php';
// If the header is set
if (isset($_SERVER['HTTP_BLACKFIRETRIGGER'])) {
// let's create a client
$blackfire = new \Blackfire\Client();
// then start the probe
$probe = $blackfire->createProbe();
// When runtime shuts down, let's finish the profiling session
register_shutdown_function(function () use ($blackfire, $probe) {
// See the PHP SDK documentation for using the $profile object
$profile = $blackfire->endProbe($probe);
});
}
Now, anytime Postman calls the front-controller with the BLACKFIRETRIGGER header, a profile is created.
/docs/postman.png
Caution
Be careful in choosing a random and not guessable HTTP header name to avoid DoS vulnerabilities.
For testing APIs in production, consider using the Blackfire Player
|
{
"url": "https://blackfire.io/docs/integrations/postman",
"source_domain": "blackfire.io",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "68771",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BWGUMP3I3267VUCBOWVCTUNC4XST66SB",
"WARC-Concurrent-To": "<urn:uuid:e1dc5279-9602-4847-ba72-da98f50ba15e>",
"WARC-Date": "2019-10-14T13:04:02Z",
"WARC-IP-Address": "54.75.240.245",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BW6REIDCRBCND5ZK4IE7JBXJHV2GOP5D",
"WARC-Record-ID": "<urn:uuid:fdcd12b3-0884-496b-aa0f-06adaad57b31>",
"WARC-Target-URI": "https://blackfire.io/docs/integrations/postman",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:717b8ec0-6e97-4838-a16d-23504411605c>"
},
"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-47.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,
8,
9,
97,
98,
272,
273,
400,
401,
439,
440,
442,
477,
478,
483,
484,
566,
567,
678,
679,
682,
685,
688,
691,
694,
697,
700,
703,
706,
709,
712,
715,
718,
721,
724,
767,
768,
792,
840,
869,
911,
939,
979,
980,
1047,
1117,
1188,
1237,
1245,
1247,
1248,
1352,
1353,
1371,
1372,
1380,
1381,
1478,
1479
],
"line_end_idx": [
8,
9,
97,
98,
272,
273,
400,
401,
439,
440,
442,
477,
478,
483,
484,
566,
567,
678,
679,
682,
685,
688,
691,
694,
697,
700,
703,
706,
709,
712,
715,
718,
721,
724,
767,
768,
792,
840,
869,
911,
939,
979,
980,
1047,
1117,
1188,
1237,
1245,
1247,
1248,
1352,
1353,
1371,
1372,
1380,
1381,
1478,
1479,
1546
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1546,
"ccnet_original_nlines": 58,
"rps_doc_curly_bracket": 0.002587320050224662,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24742268025875092,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06185567006468773,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2783505320549011,
"rps_doc_frac_unique_words": 0.6009615659713745,
"rps_doc_mean_word_length": 5.557692527770996,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.506922721862793,
"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.041522491723299026,
"rps_doc_frac_chars_top_3gram": 0.029411759227514267,
"rps_doc_frac_chars_top_4gram": 0.031141869723796844,
"rps_doc_books_importance": -162.60166931152344,
"rps_doc_books_importance_length_correction": -150.7045440673828,
"rps_doc_openwebtext_importance": -77.78412628173828,
"rps_doc_openwebtext_importance_length_correction": -77.78412628173828,
"rps_doc_wikipedia_importance": -51.45441436767578,
"rps_doc_wikipedia_importance_length_correction": -37.96053695678711
},
"fasttext": {
"dclm": 0.08215582370758057,
"english": 0.6545543670654297,
"fineweb_edu_approx": 1.74202299118042,
"eai_general_math": 0.24010038375854492,
"eai_open_web_math": 0.13457059860229492,
"eai_web_code": 0.9787551164627075
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,293,943,690,815,380,000 |
The tag has no wiki summary.
learn more… | top users | synonyms
1
vote
3answers
221 views
What features of a HP DL server make it so much more performant than commodity hardware?
I've used HP DL machines at work. I found them to be blazingly fast, but very expensive expensive - up to $15k, I am curious though, although the spec we typically used (e.g. dual AMD Opteron 2.6GHz, ...
0
votes
4answers
1k views
What is the difference between QuadCore and Core2Quad?
In Market there are two types of processors as Core2Quad and QuadCore. What is the architectural/performance difference between two flavours? I have the same question with older Core2Duo and Dualcore ...
|
{
"url": "http://serverfault.com/questions/tagged/hardware-architecture",
"source_domain": "serverfault.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "48281",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ETSUVCGUISSO32XQ7GHHZRIBGJEIS573",
"WARC-Concurrent-To": "<urn:uuid:d6df9622-35bc-4bb0-ab44-e65253fd47d0>",
"WARC-Date": "2014-03-11T13:05:58Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:N2YTH7J2AQAY5PP6KMABFPUHKEDDBICP",
"WARC-Record-ID": "<urn:uuid:57afcea0-95cb-4684-ba53-988c86bcf083>",
"WARC-Target-URI": "http://serverfault.com/questions/tagged/hardware-architecture",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a68200c4-4b14-42ad-aa18-d779c702893c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
29,
30,
65,
66,
68,
73,
82,
92,
93,
182,
183,
387,
389,
395,
404,
413,
414,
469,
470
],
"line_end_idx": [
29,
30,
65,
66,
68,
73,
82,
92,
93,
182,
183,
387,
389,
395,
404,
413,
414,
469,
470,
673
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 673,
"ccnet_original_nlines": 19,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3333333432674408,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06521739065647125,
"rps_doc_frac_lines_end_with_ellipsis": 0.10000000149011612,
"rps_doc_frac_no_alph_words": 0.19565217196941376,
"rps_doc_frac_unique_words": 0.792792797088623,
"rps_doc_mean_word_length": 4.738738536834717,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0.021739130839705467,
"rps_doc_unigram_entropy": 4.3855977058410645,
"rps_doc_word_count": 111,
"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.034220531582832336,
"rps_doc_frac_chars_top_3gram": 0.034220531582832336,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -69.02301025390625,
"rps_doc_books_importance_length_correction": -75.33782958984375,
"rps_doc_openwebtext_importance": -39.625343322753906,
"rps_doc_openwebtext_importance_length_correction": -45.940162658691406,
"rps_doc_wikipedia_importance": -35.926246643066406,
"rps_doc_wikipedia_importance_length_correction": -42.241065979003906
},
"fasttext": {
"dclm": 0.9809494018554688,
"english": 0.9496294856071472,
"fineweb_edu_approx": 2.819338083267212,
"eai_general_math": 0.06670427322387695,
"eai_open_web_math": 0.46072643995285034,
"eai_web_code": 0.00029491999885067344
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.17",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,870,491,160,953,897,500 |
XmlElement.SetAttribute Method
Definition
Sets the value of the specified attribute.
Overloads
SetAttribute(String, String)
Sets the value of the attribute with the specified name.
SetAttribute(String, String, String)
Sets the value of the attribute with the specified local name and namespace URI.
SetAttribute(String, String)
Source:
XmlElement.cs
Source:
XmlElement.cs
Source:
XmlElement.cs
Sets the value of the attribute with the specified name.
public:
virtual void SetAttribute(System::String ^ name, System::String ^ value);
public virtual void SetAttribute (string name, string value);
public virtual void SetAttribute (string name, string? value);
abstract member SetAttribute : string * string -> unit
override this.SetAttribute : string * string -> unit
Public Overridable Sub SetAttribute (name As String, value As String)
Parameters
name
String
The name of the attribute to create or alter. This is a qualified name. If the name contains a colon it is parsed into prefix and local name components.
value
String
The value to set for the attribute.
Exceptions
The specified name contains an invalid character.
The node is read-only.
Remarks
If an attribute with the same name is already present in the element, its value is changed to that of value. value is a simple string. It is not parsed as it is being set. Any markup, such as syntax to be recognized as an entity reference, is treated as literal text and needs to be properly escaped by the implementation when it is written out. In order to assign an attribute value that contains entity references, the user must create an XmlAttribute node plus any XmlText and XmlEntityReference nodes, build the appropriate subtree and use SetAttributeNode to assign it as the value of an attribute.
Applies to
SetAttribute(String, String, String)
Source:
XmlElement.cs
Source:
XmlElement.cs
Source:
XmlElement.cs
Sets the value of the attribute with the specified local name and namespace URI.
public:
virtual System::String ^ SetAttribute(System::String ^ localName, System::String ^ namespaceURI, System::String ^ value);
public virtual string SetAttribute (string localName, string namespaceURI, string value);
public virtual string? SetAttribute (string localName, string? namespaceURI, string? value);
abstract member SetAttribute : string * string * string -> string
override this.SetAttribute : string * string * string -> string
Public Overridable Function SetAttribute (localName As String, namespaceURI As String, value As String) As String
Parameters
localName
String
The local name of the attribute.
namespaceURI
String
The namespace URI of the attribute.
value
String
The value to set for the attribute.
Returns
The attribute value.
Applies to
|
{
"url": "https://learn.microsoft.com/it-it/dotnet/api/system.xml.xmlelement.setattribute?view=net-8.0",
"source_domain": "learn.microsoft.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "66897",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KB6KIULFL2RSQRCKMK5E7UT47HTAGUP4",
"WARC-Concurrent-To": "<urn:uuid:8c6c79ff-5239-4c77-9a17-9dd07e396cc2>",
"WARC-Date": "2024-04-14T22:11:20Z",
"WARC-IP-Address": "23.202.154.32",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LFBAGBVO5FH7CQJIQDTPPOFPU66E6MEA",
"WARC-Record-ID": "<urn:uuid:d1612386-376c-4359-9a50-93db2d7474a3>",
"WARC-Target-URI": "https://learn.microsoft.com/it-it/dotnet/api/system.xml.xmlelement.setattribute?view=net-8.0",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b5155d0a-a4f4-443b-8f96-0fbfdf0a645d>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-180\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
31,
32,
43,
44,
87,
88,
98,
99,
128,
129,
186,
187,
224,
225,
306,
307,
336,
337,
345,
359,
367,
381,
389,
403,
404,
461,
462,
470,
545,
607,
670,
725,
778,
848,
849,
860,
861,
866,
873,
874,
1027,
1028,
1034,
1041,
1042,
1078,
1079,
1090,
1091,
1141,
1142,
1165,
1166,
1174,
1175,
1779,
1780,
1791,
1792,
1829,
1830,
1838,
1852,
1860,
1874,
1882,
1896,
1897,
1978,
1979,
1987,
2110,
2200,
2293,
2359,
2423,
2537,
2538,
2549,
2550,
2560,
2567,
2568,
2601,
2602,
2615,
2622,
2623,
2659,
2660,
2666,
2673,
2674,
2710,
2711,
2719,
2720,
2741,
2742
],
"line_end_idx": [
31,
32,
43,
44,
87,
88,
98,
99,
128,
129,
186,
187,
224,
225,
306,
307,
336,
337,
345,
359,
367,
381,
389,
403,
404,
461,
462,
470,
545,
607,
670,
725,
778,
848,
849,
860,
861,
866,
873,
874,
1027,
1028,
1034,
1041,
1042,
1078,
1079,
1090,
1091,
1141,
1142,
1165,
1166,
1174,
1175,
1779,
1780,
1791,
1792,
1829,
1830,
1838,
1852,
1860,
1874,
1882,
1896,
1897,
1978,
1979,
1987,
2110,
2200,
2293,
2359,
2423,
2537,
2538,
2549,
2550,
2560,
2567,
2568,
2601,
2602,
2615,
2622,
2623,
2659,
2660,
2666,
2673,
2674,
2710,
2711,
2719,
2720,
2741,
2742,
2752
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2752,
"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.3118908405303955,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005847950000315905,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22417153418064117,
"rps_doc_frac_unique_words": 0.292553186416626,
"rps_doc_mean_word_length": 5.819149017333984,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.993673801422119,
"rps_doc_word_count": 376,
"rps_doc_frac_chars_dupe_10grams": 0.23354661464691162,
"rps_doc_frac_chars_dupe_5grams": 0.37888482213020325,
"rps_doc_frac_chars_dupe_6grams": 0.351919561624527,
"rps_doc_frac_chars_dupe_7grams": 0.351919561624527,
"rps_doc_frac_chars_dupe_8grams": 0.3171846270561218,
"rps_doc_frac_chars_dupe_9grams": 0.3171846270561218,
"rps_doc_frac_chars_top_2gram": 0.05484461039304733,
"rps_doc_frac_chars_top_3gram": 0.04478976130485535,
"rps_doc_frac_chars_top_4gram": 0.03199268877506256,
"rps_doc_books_importance": -257.11944580078125,
"rps_doc_books_importance_length_correction": -257.11944580078125,
"rps_doc_openwebtext_importance": -121.35990905761719,
"rps_doc_openwebtext_importance_length_correction": -121.35990905761719,
"rps_doc_wikipedia_importance": -102.34676361083984,
"rps_doc_wikipedia_importance_length_correction": -102.34676361083984
},
"fasttext": {
"dclm": 0.26805174350738525,
"english": 0.5814406275749207,
"fineweb_edu_approx": 3.080334424972534,
"eai_general_math": 0.5762478709220886,
"eai_open_web_math": 0.03820114955306053,
"eai_web_code": 0.21047157049179077
}
}
|
{
"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": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,446,273,933,939,019,000 |
Tomcat
Apache Tomcat Best Practices
Best practices are procedures that are accepted or prescribed as being correct or most effective. The Apache Tomcat software is an open source implementation of the Java Servlet, JavaServer Pages, Java Expression Language and Java WebSocket technologies.
1. The tools
• Java JDK
• Apache Tomcat
2. Introduction
In this example we are going to illustrate best practices using the Apache Tomcat Servlet container. We are going to install the Tomcat server to illustrate these practices.
3. Prerequisites
• JDK installed
4. Download Tomcat
Go to the page https://tomcat.apache.org/download-80.cgi.
Download the tomcat server as a zip compressed file for windows.
1 Download Tomcat for Windows
1 Download Tomcat for Windows
5. Tomcat Installation
5.1 Uncompress Apache Tomcat
Choose an installation directory and uncompress the Tomcat server in its own directory.
2 Uncompress Tomcat
2 Uncompress Tomcat
5.2 Install the Tomcat service
Open the Windows terminal and go to the Tomcat Installation bin directory.
Tomcat installation directory
C:\Java\Apache Tomcat 8.0.15\bin>
Install the service with the following command:
Install Tomcat service
C:\Java\Apache Tomcat 8.0.15\bin>service install
You should get an output similar to this:
install Tomcat output
Installing the service 'Tomcat8' ...
Using CATALINA_HOME: "C:\Java\Apache Tomcat 8.0.15"
Using CATALINA_BASE: "C:\Java\Apache Tomcat 8.0.15"
Using JAVA_HOME: "C:\Java\jdk1.8.0_40"
Using JRE_HOME: "C:\Java\jre1.8.0_40"
Using JVM: "C:\Java\jre1.8.0_40\bin\client\jvm.dll"
The service 'Tomcat8' has been installed.
5.3 Start the Tomcat service
Start the service with the following command:
Start tomcat output
C:\Java\Apache Tomcat 8.0.15\bin>sc start Tomcat8
You should get an output similar to the following:
console
SERVICE_NAME: Tomcat8
TYPE : 10 WIN32_OWN_PROCESS
STATUS : 2 START_PENDING
(NOT_STOPPABLE, NOT_PAUSABLE, IGNORES_SHUTDOWN)
WIN32_OUTPUT_CODE : 0 (0x0)
SERVICE_OUTPUT_CODE: 0 (0x0)
CHECK-POINT : 0x0
START-INDICATOR : 0x7d0
PID : 5552
MARKS :
5.4 Check that tomcat is running
Open the browser in the URL: http://localhost:8080
And you should see the Tomcat Welcome screen.
3 Tomcat Welcome
3 Tomcat Welcome
6. Install Tomcat as a Service
If you are going to use Tomcat in a server is often useful to install it as a service. Services start with the operative system and also your Tomcat service starts and stops with the machine shutdown & restart procedure.
Go to the Tomcat bin folder. Type the command:
Install service
C:\Java\Apache Tomcat 8.0.27\bin>service install
This command installs the Tomcat service in Windows. You should get the following output
Install service output
Installing the service 'Tomcat8' ...
Using CATALINA_HOME: "C:\Java\Apache Tomcat 8.0.27"
Using CATALINA_BASE: "C:\Java\Apache Tomcat 8.0.27"
Using JAVA_HOME: "C:\Java\jdk1.8.0_40"
Using JRE_HOME: "C:\Java\jdk1.8.0_40\jre"
Using JVM: "C:\Java\jdk1.8.0_40\jre\bin\server\jvm.dll"
The service 'Tomcat8' has been installed.
7. Remove everything from webapps
On a production server the webapps that come with Tomcat are not needed, so often it’s useful to remove all of them. Keep in mind that this also removes the manager and you are not longer allowed to access your tomcat server configuration from a remorte server. Instead you can use SSH and configure your Tomcat Server remotely from the command line.
4-tomcat-webapps
4-tomcat-webapps
8. Default Servlet
Make sure the default servlet is configured not to serve index pages when a welcome file is not present. In TOMCAT_HOME/conf/web.xml
web.xml
<servlet>
<servlet-name>default</servlet-name>
<servlet-class>org.apache.catalina.servlets.DefaultServlet</servlet-class>
<init-param>
<param-name>debug</param-name>
<param-value>0</param-value>
</init-param>
<init-param>
<param-name>listings</param-name>
<param-value>false</param-value> <!-- make sure this is false -->
</init-param>
<load-on-startup>1</load-on-startup>
</servlet>
9. Replace default error page
Replace default error page by adding the following into CATALINA_HOME/conf/web.xml. The default error page shows a full stack trace which is not recommended on a production web server.
A well configured web application should override the default error page.
xml
<error-page>
<exception-type>java.lang.Throwable</exception-type>
<location>/my-error.page.jsp</location>
</error-page>
10. Enable SSL
SSL, or Secure Socket Layer, is a technology which allows web browsers and web servers to communicate over a secured connection. This means that the data being sent is encrypted by one side, transmitted, and then decrypted by the other side before processing. This is a two-way process, meaning that both server AND the browser encrypt all traffic before sending out data.
11. Secure the manager application
If you are going to use the manager application, you should secure it with a user and a password for the appropriate role.
Edit the file
TOMCAT_HOME/conf/tomcat-users.xml
Tomcat Roles
<role rolename="manager"/>
<user username="darren" password="ReallyComplexPassword" roles="manager"/>
12. Use SSL in the manager application
When you access the password-protected manager webapp, the password you enter will be sent over the network in plain text. Using an SSL connection instead, you can transport the password securely.
After configuring an SSL Connector in server.xml, add the following to TOMCAT_HOME/webapps/manager/WEB-INF/web.xml inside of the security-constraint tag.
security-constraint
<user-data-constraint>
<transport-guarantee>CONFIDENTIAL</transport-guarantee>
</user-data-constraint>
13. Use an individual log file for each web application
By default additional webapp log entries are added to TOMCAT_HOME/logs/catalina.YYYY-MM-DD.log and System.out/System.err are redirected to TOMCAT_HOME/logs/catalina.out. To place webapp log entries in individual log files create a logging.properties file similar to the following within TOMCAT_HOME/webapps/APP_NAME/WEB-INF/classes (change the APP_NAME value to create a unique file for each webapp).
Logs
handlers = org.apache.juli.FileHandler, java.util.logging.ConsoleHandler
org.apache.juli.FileHandler.level = ALL
org.apache.juli.FileHandler.directory = ${catalina.base}/logs
org.apache.juli.FileHandler.prefix = APP_NAME.
14. Cleartext Passwords in server.xml
When configuring a resource, such as a JDBC pool, it is necessary to include clear text username and password in TOMCAT_HOME/conf/server.xml. Best practices advice us to never store clear text passwords, but it is very difficult to avoid here.
In the case of a JDBC pool what you can do is:
• make sure the database user only has access to the databases and tables they need.
• make sure the raw database files are only accessible to the user running the database services (e.g. mysql/postgresql user)
• make sure the Tomcat configuration files are only accessible to the tomcat user.
15. Conclusion
As you have seen these best practices are useful for your server and help you avoid some common mistakes and future problems with your tomcat server.
Jesus Boadas
I'm a self taught programmer, I began programming back in 1991 using an IBM A10 mainframe with Pascal an Assembler IBM 360/70 emulator and Turbo C on a X86 PC, since that I work for the banking industry with emerging technologies like Fox Pro, Visual Fox Pro, Visual Basic, Visual C++, Borland C++, lately I moved out to the Airline industry, leading designing and programming in-house web applications with Flex, Actionscript, PHP, Python and Rails and in the last 7 years I focused all my work in Java, working on Linux servers using GlassFish, TomCat, Apache and MySql.
Subscribe
Notify of
guest
This site uses Akismet to reduce spam. Learn how your comment data is processed.
0 Comments
Oldest
Newest Most Voted
Inline Feedbacks
View all comments
Back to top button
|
{
"url": "https://examples.javacodegeeks.com/java-development/enterprise-java/tomcat/apache-tomcat-best-practices/",
"source_domain": "examples.javacodegeeks.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "378124",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IFDHEFTJJNITR4KFA527YMDNYHLEAFPL",
"WARC-Concurrent-To": "<urn:uuid:2e39ca5a-4259-465f-8990-21bcc370d765>",
"WARC-Date": "2024-08-07T09:15:52Z",
"WARC-IP-Address": "104.26.2.29",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZFVFXPHB2PINUMQPJ34J47LFN5J6BC6U",
"WARC-Record-ID": "<urn:uuid:bcd328c6-e270-4ffd-9e12-76d64e1346bd>",
"WARC-Target-URI": "https://examples.javacodegeeks.com/java-development/enterprise-java/tomcat/apache-tomcat-best-practices/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cd791e62-61ac-4ad4-abcc-cc096683ed86>"
},
"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-90\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
7,
8,
37,
38,
293,
294,
307,
308,
321,
339,
340,
356,
357,
531,
532,
549,
550,
568,
569,
588,
589,
647,
648,
713,
714,
744,
774,
775,
798,
799,
828,
829,
917,
918,
938,
958,
959,
990,
991,
1066,
1067,
1097,
1098,
1132,
1133,
1181,
1182,
1205,
1206,
1255,
1256,
1298,
1299,
1321,
1322,
1359,
1414,
1469,
1515,
1561,
1626,
1668,
1669,
1698,
1699,
1745,
1746,
1766,
1767,
1817,
1818,
1869,
1870,
1878,
1879,
1901,
1952,
1998,
2078,
2116,
2154,
2187,
2222,
2256,
2285,
2286,
2319,
2320,
2371,
2372,
2418,
2419,
2436,
2453,
2454,
2485,
2486,
2707,
2708,
2755,
2756,
2772,
2773,
2822,
2823,
2912,
2913,
2936,
2937,
2974,
3029,
3084,
3130,
3180,
3249,
3291,
3292,
3326,
3327,
3678,
3679,
3696,
3713,
3714,
3733,
3734,
3867,
3868,
3876,
3877,
3888,
3928,
4006,
4022,
4058,
4092,
4109,
4125,
4164,
4236,
4253,
4293,
4305,
4306,
4336,
4337,
4522,
4596,
4597,
4601,
4602,
4615,
4670,
4712,
4726,
4727,
4742,
4743,
5116,
5117,
5152,
5153,
5276,
5277,
5291,
5325,
5326,
5339,
5340,
5367,
5442,
5443,
5482,
5483,
5680,
5834,
5835,
5855,
5856,
5879,
5937,
5961,
5962,
6018,
6019,
6420,
6421,
6426,
6427,
6501,
6542,
6605,
6653,
6654,
6692,
6693,
6937,
6938,
6985,
6986,
7073,
7201,
7286,
7287,
7302,
7303,
7453,
7454,
7467,
7468,
8041,
8051,
8061,
8067,
8068,
8149,
8150,
8161,
8168,
8186,
8203,
8221
],
"line_end_idx": [
7,
8,
37,
38,
293,
294,
307,
308,
321,
339,
340,
356,
357,
531,
532,
549,
550,
568,
569,
588,
589,
647,
648,
713,
714,
744,
774,
775,
798,
799,
828,
829,
917,
918,
938,
958,
959,
990,
991,
1066,
1067,
1097,
1098,
1132,
1133,
1181,
1182,
1205,
1206,
1255,
1256,
1298,
1299,
1321,
1322,
1359,
1414,
1469,
1515,
1561,
1626,
1668,
1669,
1698,
1699,
1745,
1746,
1766,
1767,
1817,
1818,
1869,
1870,
1878,
1879,
1901,
1952,
1998,
2078,
2116,
2154,
2187,
2222,
2256,
2285,
2286,
2319,
2320,
2371,
2372,
2418,
2419,
2436,
2453,
2454,
2485,
2486,
2707,
2708,
2755,
2756,
2772,
2773,
2822,
2823,
2912,
2913,
2936,
2937,
2974,
3029,
3084,
3130,
3180,
3249,
3291,
3292,
3326,
3327,
3678,
3679,
3696,
3713,
3714,
3733,
3734,
3867,
3868,
3876,
3877,
3888,
3928,
4006,
4022,
4058,
4092,
4109,
4125,
4164,
4236,
4253,
4293,
4305,
4306,
4336,
4337,
4522,
4596,
4597,
4601,
4602,
4615,
4670,
4712,
4726,
4727,
4742,
4743,
5116,
5117,
5152,
5153,
5276,
5277,
5291,
5325,
5326,
5339,
5340,
5367,
5442,
5443,
5482,
5483,
5680,
5834,
5835,
5855,
5856,
5879,
5937,
5961,
5962,
6018,
6019,
6420,
6421,
6426,
6427,
6501,
6542,
6605,
6653,
6654,
6692,
6693,
6937,
6938,
6985,
6986,
7073,
7201,
7286,
7287,
7302,
7303,
7453,
7454,
7467,
7468,
8041,
8051,
8061,
8067,
8068,
8149,
8150,
8161,
8168,
8186,
8203,
8221,
8239
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8239,
"ccnet_original_nlines": 222,
"rps_doc_curly_bracket": 0.00024275000032503158,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23255814611911774,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.050581399351358414,
"rps_doc_frac_lines_end_with_ellipsis": 0.008968610316514969,
"rps_doc_frac_no_alph_words": 0.3017441928386688,
"rps_doc_frac_unique_words": 0.4135338366031647,
"rps_doc_mean_word_length": 5.878759384155273,
"rps_doc_num_sentences": 139,
"rps_doc_symbol_to_word_ratio": 0.0011627899948507547,
"rps_doc_unigram_entropy": 5.442750930786133,
"rps_doc_word_count": 1064,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08792965859174728,
"rps_doc_frac_chars_dupe_6grams": 0.07577937841415405,
"rps_doc_frac_chars_dupe_7grams": 0.040287770330905914,
"rps_doc_frac_chars_dupe_8grams": 0.0214228592813015,
"rps_doc_frac_chars_dupe_9grams": 0.0214228592813015,
"rps_doc_frac_chars_top_2gram": 0.01582733914256096,
"rps_doc_frac_chars_top_3gram": 0.0063948798924684525,
"rps_doc_frac_chars_top_4gram": 0.0057553998194634914,
"rps_doc_books_importance": -606.7943115234375,
"rps_doc_books_importance_length_correction": -606.7943115234375,
"rps_doc_openwebtext_importance": -416.1395263671875,
"rps_doc_openwebtext_importance_length_correction": -416.1395263671875,
"rps_doc_wikipedia_importance": -282.834228515625,
"rps_doc_wikipedia_importance_length_correction": -282.834228515625
},
"fasttext": {
"dclm": 0.030103560537099838,
"english": 0.7442293167114258,
"fineweb_edu_approx": 2.14587140083313,
"eai_general_math": 0.33802294731140137,
"eai_open_web_math": 0.18472999334335327,
"eai_web_code": 0.3274507522583008
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,021,387,178,632,910,000 |
205Views4Replies
Author Options:
Creating an Invention and Instructable Mixing Software or Website Answered
I was wondering if we could create a new website device, we could call it the Invention Mixer Software.
It would basically be a large database of practical or groundbreaking inventions, and maybe many of the instructables here.
We could arrange it according to use (Renewable Energy, Agricultural, Games, etc) and we could arrange it like a shopping cart selection. Each item would contain Name of Invention, Its basic use and advantage over common inventions, and the link to the manufacturer or institution doing the research.
With the shopping cart, you can choose the inventions and instructables you like and store them in the website, or copy and paste to your friends to discuss,compare or talk over.
It would be more than hobbyists website. People making new inventions could compare with the products now in the market, and compare it to instructables that can make similar inventions.
It would be like a cheap, low cost utility compared to the very powerful but expensive invention making machines like:
INVENTION MACHINE Software
http://www.invention-machine.com/productsservices.aspx
or stuff like this:
CREAX Invention Software
http://www.creax.com/innovation_software.htm
This would be the every man's invention software on a website.
Discussions
0
None
mikedu
9 years ago
Invention Mixer Website It’s basically a New Invention Database website. People who have a new product will give us a brief description of their inventions, the use and advantage of their invention, and a link to their website. Including their invention to the website is free, to encourage people to give. Income to maintain the website can be from: 1. Some minimal Internet ads or streamers all around the website on related Industries. There could be a streamer on every topic (Renewable Energy, Gadgets, Utilities, Agricultural) and this would be just to fund further research on developing the website and maintaining it. 2. Premium content on some Industries. Maybe brief outlooks on Industries like Renewable Energy or the IT sector. 3. The bulk of its income would come from recruiting a network of traders or Researchers to use the website to market goods or Inventions available on the website. If we also had links of the Instructables here on the website, we could refer them to the Instructables, and promote the skills of the hobbyists in the website to companies using this website to compare it to existing inventions. I live in the Philippines, which is pretty urban but developing by my standards, and I see all these wonderful inventions on the net, and I say to myself, why can't I market these inventions? Coz I am limited by my expertise on my Industry. If we could create a network of Skilled marketers working on Commission, using this database to reduce the need for searching, we magnify our efforts to the people who know best how to make the product viable.
0
None
Kiteman
9 years ago
Have you ever seen Halfbaked?
0
None
lemonie
9 years ago
Do you have a business model or plan for this idea? L
|
{
"url": "https://www.instructables.com/community/Lets-Create-an-Invention-and-Instructable-Mixing-S/",
"source_domain": "www.instructables.com",
"snapshot_id": "crawl=CC-MAIN-2019-22",
"warc_metadata": {
"Content-Length": "46236",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OGR7F7WX52KQK4NZ57FAE2R2TYJWLMCR",
"WARC-Concurrent-To": "<urn:uuid:2246b966-fdd4-4c73-80a5-e51cefa789af>",
"WARC-Date": "2019-05-23T05:35:44Z",
"WARC-IP-Address": "151.101.201.105",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JQ4SPEZ5IT6PS7W6XEVNRT4BHKRAD2HD",
"WARC-Record-ID": "<urn:uuid:5a6ae1b8-6d81-494d-9e6a-8a2732e9964b>",
"WARC-Target-URI": "https://www.instructables.com/community/Lets-Create-an-Invention-and-Instructable-Mixing-S/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:571de56a-6ac7-4bf4-8ac8-37907b24a94f>"
},
"warc_info": "isPartOf: CC-MAIN-2019-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-109-171-211.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,
17,
18,
34,
35,
110,
111,
215,
216,
340,
341,
642,
643,
822,
823,
1010,
1011,
1130,
1157,
1212,
1213,
1233,
1234,
1259,
1304,
1305,
1368,
1369,
1381,
1382,
1384,
1389,
1396,
1397,
1409,
1410,
2996,
2997,
2999,
3004,
3012,
3013,
3025,
3026,
3056,
3057,
3059,
3064,
3072,
3073,
3085,
3086
],
"line_end_idx": [
17,
18,
34,
35,
110,
111,
215,
216,
340,
341,
642,
643,
822,
823,
1010,
1011,
1130,
1157,
1212,
1213,
1233,
1234,
1259,
1304,
1305,
1368,
1369,
1381,
1382,
1384,
1389,
1396,
1397,
1409,
1410,
2996,
2997,
2999,
3004,
3012,
3013,
3025,
3026,
3056,
3057,
3059,
3064,
3072,
3073,
3085,
3086,
3139
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3139,
"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.4364548623561859,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018394650891423225,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13712374866008759,
"rps_doc_frac_unique_words": 0.44117647409439087,
"rps_doc_mean_word_length": 4.964705944061279,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.872724533081055,
"rps_doc_word_count": 510,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.012638229876756668,
"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.035545021295547485,
"rps_doc_frac_chars_top_3gram": 0.010663510300219059,
"rps_doc_frac_chars_top_4gram": 0.011848339810967445,
"rps_doc_books_importance": -280.1851501464844,
"rps_doc_books_importance_length_correction": -280.1851501464844,
"rps_doc_openwebtext_importance": -189.81834411621094,
"rps_doc_openwebtext_importance_length_correction": -189.81834411621094,
"rps_doc_wikipedia_importance": -141.37738037109375,
"rps_doc_wikipedia_importance_length_correction": -141.37738037109375
},
"fasttext": {
"dclm": 0.5676989555358887,
"english": 0.9465696215629578,
"fineweb_edu_approx": 1.7298955917358398,
"eai_general_math": 0.07958436012268066,
"eai_open_web_math": 0.028014540672302246,
"eai_web_code": 0.00720172980800271
}
}
|
{
"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": "600",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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,512,632,497,684,231,000 |
TEAM-ADA Archives
Team Ada: Ada Programming Language Advocacy
[email protected]
Options: Use Forum View
Use Proportional Font
Show HTML Part by Default
Show All Mail Headers
Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]
Print Reply
Subject:
From:
Reply To:
Date:
Sat, 25 Oct 1997 16:45:54 -0400
Content-Type:
text/plain
Parts/Attachments:
text/plain (14 lines)
Is there any promising work on conceptualizing the abstractions of GUIs?
It's easy to make a binding thick enough to cover the calling sequences,
naming, etc differences between GUIs for different OSes, but once you
try to support 50 *different* styles for a window border on each OS,
portability goes down the tubes in a hurry. A GUI builder tool can
certainly customize, to the OS at hand, borders of windows, but what
about menus vs listboxes vs palettes as selection devices? It's
trivially easy for a GUI vendor to add little goodies that lock a
user, and a binding, into his system. Is there a good way to program
in terms of 'now let the user enter text, now select from these choices,
now indicate a position with the mouse, ...' and separate out the
particular widgets that enter text, do different kinds of choice
selections, etc?
ATOM RSS1 RSS2
|
{
"url": "https://listserv.acm.org/SCRIPTS/WA-ACMLPX.CGI?A2=TEAM-ADA;d6c64f3a.0006&FT=M&P=T&H=N&S=a",
"source_domain": "listserv.acm.org",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "78082",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D3GQ7EIGSXTP7LOZWI6Q5HVNDFFRWTHF",
"WARC-Concurrent-To": "<urn:uuid:9f0b00fb-03c4-4bbe-844f-4811f7bece84>",
"WARC-Date": "2024-04-13T10:58:39Z",
"WARC-IP-Address": "20.75.2.188",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZATFZSYZAVQPVNN2IL6FYJN5AS2SQGA6",
"WARC-Record-ID": "<urn:uuid:99435223-7206-42f8-9102-7423e1f911d9>",
"WARC-Target-URI": "https://listserv.acm.org/SCRIPTS/WA-ACMLPX.CGI?A2=TEAM-ADA;d6c64f3a.0006&FT=M&P=T&H=N&S=a",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a0fcc619-10e7-4f58-8fda-58e997ff3732>"
},
"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,
18,
19,
63,
64,
90,
91,
115,
116,
138,
164,
186,
187,
235,
281,
328,
329,
341,
350,
356,
366,
372,
404,
418,
429,
448,
470,
543,
618,
688,
757,
825,
894,
959,
1025,
1095,
1168,
1234,
1299,
1316,
1317
],
"line_end_idx": [
18,
19,
63,
64,
90,
91,
115,
116,
138,
164,
186,
187,
235,
281,
328,
329,
341,
350,
356,
366,
372,
404,
418,
429,
448,
470,
543,
618,
688,
757,
825,
894,
959,
1025,
1095,
1168,
1234,
1299,
1316,
1317,
1331
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1331,
"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.2693602740764618,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05387204885482788,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2794612944126129,
"rps_doc_frac_unique_words": 0.7081339955329895,
"rps_doc_mean_word_length": 4.7942585945129395,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0.003367000026628375,
"rps_doc_unigram_entropy": 4.821258544921875,
"rps_doc_word_count": 209,
"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.026946110650897026,
"rps_doc_frac_chars_top_3gram": 0.03892216086387634,
"rps_doc_frac_chars_top_4gram": 0.05089820176362991,
"rps_doc_books_importance": -109.05381774902344,
"rps_doc_books_importance_length_correction": -109.05381774902344,
"rps_doc_openwebtext_importance": -77.1666030883789,
"rps_doc_openwebtext_importance_length_correction": -77.1666030883789,
"rps_doc_wikipedia_importance": -38.86201858520508,
"rps_doc_wikipedia_importance_length_correction": -38.86064910888672
},
"fasttext": {
"dclm": 0.024627629667520523,
"english": 0.843858540058136,
"fineweb_edu_approx": 1.487583041191101,
"eai_general_math": 0.24377387762069702,
"eai_open_web_math": 0.5123031139373779,
"eai_web_code": 0.019329069182276726
}
}
|
{
"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": "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": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
4,548,138,231,796,500,000 |
6 Steps to Smart City Cyber Resilience
Many London boroughs are currently either procuring or intending to procure connected technology (Internet of Things, IoT) and smart city systems to support the delivery of public services. This emerging area of technology has the potential to reduce costs, generate new insights at the borough and city level, and improve the current and future state of services in London. At the same time, smart city technologies present new cyber security vulnerabilities and risks, some of which local authorities are likely to need external support to address.
While maturity is building around the use cases, technology and connectivity requirements for smart city technology, LOTI has identified cyber security and resilience alongside ethics and standards as areas that still need to be addressed on the path to wider adoption and scale up.
In this article, I will outline some of the potential cyber security and resilience risks and questions that arise with this type of technology, and share LOTI’s latest thinking on what needs to be done to support boroughs.
Ensuring services are resilient
With services becoming both digital and connected through networked technology, boroughs must plan for the impact of service interruption caused by system failure or malicious attack. Planning for these risks requires understanding the specifics of each service from the perspective of the user, as well as the underlying technology architecture.
The impact on individual service users will need to be considered carefully where, for example, vulnerable people are involved. An emerging example is Assistive Technology that combines sensors, and data analysis can be used to detect the possibility that a person has fallen over or is seriously ill. These systems can reduce the risk of a vulnerable adult falling and lying undetected until the next scheduled care visit. However, relying on technology alone comes with risks. Boroughs must assess what provisions are in place to support these individuals if the service becomes unavailable or reports incorrect data. Are backups required? Who is responsible for bringing the service online? Over what time period? And how can councils audit for false positives and false negatives?
Who is responsible if the lights go out?
Smart street lighting is becoming increasingly common in London. Its core functionality allows boroughs to remotely control and monitor the operation of street lights. Traditional street lighting relies on ‘dumb’ or ‘unconnected‘ timers or light sensors and on street surveys all of which councils are experienced in managing. While smart street lighting infrastructure and functionality uses a different set of technology, service and contractual arrangements. These new arrangements have new associated risks. For example, data aggregation and network control is usually provided by a third party platform. Boroughs must assess how secure those platforms are, and plan for the impact of malicious disruption to this service. How will boroughs respond if one light goes out? How about if lighting in the whole borough is affected?
Mitigation requires a detailed understanding of how the service operates and its weak points so that strong operational responses can be designed, supported by contracts and service level agreements. These will need to include provisions for what happens to the lights if the platform provider goes bust. Do the lights stay on all the time? Are they switched off? Or can another form of control be activated?
The challenge for boroughs
Procuring Smart city technology adds a number of complexities to the existing procurement process for more familiar line of business and IT systems.
Boroughs typically lack access to the information and resources required to identify, understand and mitigate the unique cyber security and resilience risks of procuring smart city technologies and systems.
This is because there are limited reference examples of the same technology deployed in other public sector contexts to learn from. Boroughs are also currently expected to convert or map a plethora of existing high-level guidance and recommendations into specific procurement requirements that can be acted upon and evaluated. Boroughs must navigate:
• Multiple standards and frameworks (such as from the National Cyber Security Centre, British Standards Institution and Crown Commercial Services)
• Complex supply chains, where cyber vulnerabilities may occur due to the combination of several technologies, rather than in any system alone
• An immature market
• Unfamiliar and complex risks such as disruption to critical infrastructure and national security e.g impact of EV charging point infrastructure on energy distribution grid
Understanding the challenge in detail
LOTI commissioned security researcher Meha Shukula to conduct a detailed discovery to collate details on the specific challenges facing boroughs. The work involved workshops with Brent, Greenwich, the South London Partnership boroughs, Westminster and Kensington and Chelsea.
Over the course of the workshops we identified six areas where boroughs currently lack the capabilities, resources and tools to ensure the resilience of their connected place technologies.
• Resilience and Security: There is a lack of actionable guidance to help borough officers create a repeatable, continuous method of procuring secure and resilient systems
• Risk Management: When purchasing smart city technologies, boroughs lack a consistent way to quantify their resilience risks and their exposure to cyber security liabilities, right from their discovery phase through to contract management.
• Strategy and Governance: There is no centralised procurement strategy and governance spanning Business, IT, operations and services across smart city initiatives and the need for this is also not widely understood. For example the risk of shadow IT emerging as standard highways components such as traffic systems are re-procured with embedded smart technology without ITs knowledge.
• Supply-chain assurance: There is a lack of a consistent method to assess supply-chain resilience measures for end-to-end services in all contract stages. Current supplier assessment questionnaires get incomplete responses from suppliers.
• Frameworks and standards: Many of the existing frameworks and standards for smart service security and resilience are not relevant or specific to local governments and are not applied consistently.
• Service Operations: Once systems are in place there are not adequate measures to monitor and detect errors and malicious attacks, particularly those that emerge from the changing technology and evolving threat landscape.
Moving from complexity to action
Clearly, the challenges are significant and the complexity and associated risks have the potential to lead to local authorities wondering where they should start.
To break it down into more manageable actions, at LOTI we have focused on the key actions that individual borough officers involved in the procurement of smart city technology can take.
We have highlighted 6 key steps to Cyber resilience that will help boroughs to bring cyber resilience principles into their procurement process. It is hoped that with this, they can build confidence, capability and an understanding of the remaining gaps in their cyber resilience strategy.
Alongside the steps are suggested activities where LOTI can help build resources to support boroughs in taking the step. This work will need to be in collaboration with boroughs and other government agencies including the Crown Commercial Service (CCS), National Cyber Security Centre (NCSC) and Department for Digital, Culture, Media & Sport (DCMS), drawing on expertise and insights from across the public sector.
6 Steps to Cyber Resilience
1. Publicise and educate procurement teams
• Publicise and educate procurement teams and suppliers on London’s smart city principles
• Ensure that visibility is given to already existing guidance and organisational strategies.
2. Identify relevant stakeholders (such as IT operations, service design, legal) and engage them upfront in procurement to establish a methodology to identify potential risks in smart services projects
• LOTI Role: Select a borough currently going through the process of procuring IoT technology and work with them to document and templatise their process. Validate the process with other boroughs and security experts.
3. Templatise the risk assessment methodology and create best practice checklists mapped to standards relevant to smart services. Create a tool to make this process faster and more repeatable
• LOTI Role: Collate a cross borough list of service risks. Ask boroughs to crowdsource a list of service risks based on previous risk assessment activities.
4. Develop and use an industry standard supplier assessment tool.
• LOTI Role: Lead a project to develop the supplier assessment tool working with boroughs to test and iterate the product
5. Include provisions in all contracts for ongoing resilience tests including clauses that capture the changing and emerging technology threat landscape.
• LOTI Role: CCS’s forthcoming playbook will include specifications that can be used by procurement teams when communicating with suppliers about their cyber security requirements. LOTI can support boroughs to adapt these requirements for use outside of the CCS framework.
6. Introduce auditing of data and reports from suppliers to detect and prevent malfunctioning and malicious data reporting from smart city systems
• LOTI Role: CCS’s forthcoming playbook will include specifications that can be used by procurement teams when communicating with suppliers about their cyber security requirements. LOTI can support boroughs to adapt these requirements for use outside of the CCS framework.
View the 6 steps in full detail:
Top 6 Recommendations for becoming Cyber Resilient in your IoT and Smart city deployments
Final Reflections
Cyber resilience is complicated to execute well but, like health and safety before it, it can and should become an intuitive part of project and service design. The starting point is to demonstrate small and effective interventions which, as a sector and a community, we can continuously improve to make the process easier and more intuitive.
Jay Saggar
28 April 2021 ·
Skip to content
Join the LOTI conversation
Sign up for our monthly newsletter to get the latest news and updates
|
{
"url": "https://loti.london/blog/6-steps-to-smart-city-cyber-resilience/",
"source_domain": "loti.london",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "116492",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ERN4M6P4RHIJXNFMAM5CIJR2FQREZO4J",
"WARC-Concurrent-To": "<urn:uuid:c49dd663-f5f9-4e09-a5c7-3f8163ec0d2f>",
"WARC-Date": "2024-09-18T00:24:35Z",
"WARC-IP-Address": "213.210.20.224",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:D3TVQWOWTNOZOITZYJQ2BVUID4RJFX2J",
"WARC-Record-ID": "<urn:uuid:2ead17a1-a997-43ad-a60f-aadf3250417c>",
"WARC-Target-URI": "https://loti.london/blog/6-steps-to-smart-city-cyber-resilience/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:42056125-4da5-480a-990e-d3e315850519>"
},
"warc_info": "isPartOf: CC-MAIN-2024-38\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-55\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,
39,
40,
41,
592,
593,
876,
877,
1101,
1102,
1134,
1135,
1136,
1483,
1484,
2269,
2270,
2311,
2312,
2313,
3146,
3147,
3556,
3557,
3584,
3585,
3586,
3735,
3736,
3944,
3945,
4296,
4297,
4446,
4591,
4614,
4790,
4791,
4829,
4830,
4831,
5107,
5108,
5298,
5299,
5474,
5718,
6107,
6350,
6552,
6779,
6780,
6813,
6814,
6815,
6978,
6979,
7165,
7166,
7456,
7457,
7873,
7874,
7902,
7903,
7904,
7947,
7948,
8040,
8136,
8137,
8339,
8340,
8560,
8561,
8753,
8754,
8914,
8915,
8981,
8982,
9106,
9107,
9261,
9262,
9537,
9538,
9685,
9686,
9961,
9962,
9995,
9996,
10086,
10087,
10105,
10106,
10107,
10450,
10451,
10452,
10463,
10479,
10495,
10496,
10523,
10524,
10525
],
"line_end_idx": [
39,
40,
41,
592,
593,
876,
877,
1101,
1102,
1134,
1135,
1136,
1483,
1484,
2269,
2270,
2311,
2312,
2313,
3146,
3147,
3556,
3557,
3584,
3585,
3586,
3735,
3736,
3944,
3945,
4296,
4297,
4446,
4591,
4614,
4790,
4791,
4829,
4830,
4831,
5107,
5108,
5298,
5299,
5474,
5718,
6107,
6350,
6552,
6779,
6780,
6813,
6814,
6815,
6978,
6979,
7165,
7166,
7456,
7457,
7873,
7874,
7902,
7903,
7904,
7947,
7948,
8040,
8136,
8137,
8339,
8340,
8560,
8561,
8753,
8754,
8914,
8915,
8981,
8982,
9106,
9107,
9261,
9262,
9537,
9538,
9685,
9686,
9961,
9962,
9995,
9996,
10086,
10087,
10105,
10106,
10107,
10450,
10451,
10452,
10463,
10479,
10495,
10496,
10523,
10524,
10525,
10594
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10594,
"ccnet_original_nlines": 107,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3751418888568878,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014755959622561932,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10669694095849991,
"rps_doc_frac_unique_words": 0.36888331174850464,
"rps_doc_mean_word_length": 5.491217136383057,
"rps_doc_num_sentences": 73,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.601909637451172,
"rps_doc_word_count": 1594,
"rps_doc_frac_chars_dupe_10grams": 0.052553411573171616,
"rps_doc_frac_chars_dupe_5grams": 0.07494573295116425,
"rps_doc_frac_chars_dupe_6grams": 0.052553411573171616,
"rps_doc_frac_chars_dupe_7grams": 0.052553411573171616,
"rps_doc_frac_chars_dupe_8grams": 0.052553411573171616,
"rps_doc_frac_chars_dupe_9grams": 0.052553411573171616,
"rps_doc_frac_chars_top_2gram": 0.012338629923760891,
"rps_doc_frac_chars_top_3gram": 0.005141090136021376,
"rps_doc_frac_chars_top_4gram": 0.00891122967004776,
"rps_doc_books_importance": -665.5409545898438,
"rps_doc_books_importance_length_correction": -665.5409545898438,
"rps_doc_openwebtext_importance": -369.38262939453125,
"rps_doc_openwebtext_importance_length_correction": -369.38262939453125,
"rps_doc_wikipedia_importance": -241.1591796875,
"rps_doc_wikipedia_importance_length_correction": -241.1591796875
},
"fasttext": {
"dclm": 0.22707706689834595,
"english": 0.9233750700950623,
"fineweb_edu_approx": 2.3463687896728516,
"eai_general_math": 0.07578229904174805,
"eai_open_web_math": 0.1954546570777893,
"eai_web_code": 0.03246926888823509
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.8",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "352.4",
"labels": {
"level_1": "Social sciences",
"level_2": "Public administration and Military art and science",
"level_3": "Local government"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.