Essential-Web v1.0
Collection
10 items
•
Updated
•
6
Dataset Viewer
id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
-5,963,930,584,327,863,000 | Printing Test
Printing Test
Once the BarTender Set-up and Salesforce Set-up are completed, the next step is to test the print job from a record or a List view. Example: Record button of the “Bartender Print with user input flow” Navigate to the record. Click on the newly created Print button....
Printing Test
Buttons Creation
You can use the template flows or adjust them based on your use case to create buttons on any object in Salesforce. The buttons can be added to a List view or on the Record page of the Account. Steps to create a list button: Navigate to “Object Manager” in Salesforce... | {
"url": "https://ascenterp.com/ascent-label-anything-kb/tag/salesforce-flow/",
"source_domain": "ascenterp.com",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "195693",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KBVISQ7HZWKNFBSM3AUKISC56PFVZ5BF",
"WARC-Concurrent-To": "<urn:uuid:546409a6-5934-4714-8b35-f6ff1a4c551d>",
"WARC-Date": "2024-09-15T00:46:46Z",
"WARC-IP-Address": "172.67.153.199",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AUCJFKYZQA4PY5WTTK5VDMKRV7NAIM3V",
"WARC-Record-ID": "<urn:uuid:aadac984-36fc-4efa-bdaa-a895770298bc>",
"WARC-Target-URI": "https://ascenterp.com/ascent-label-anything-kb/tag/salesforce-flow/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0025d615-9318-4202-a482-b066599ba694>"
},
"warc_info": "isPartOf: CC-MAIN-2024-38\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-248\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,
14,
15,
29,
30,
301,
315,
316,
333,
334
],
"line_end_idx": [
14,
15,
29,
30,
301,
315,
316,
333,
334,
605
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 605,
"ccnet_original_nlines": 9,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3739837408065796,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0.20000000298023224,
"rps_doc_frac_no_alph_words": 0.12195122241973877,
"rps_doc_frac_unique_words": 0.5471698045730591,
"rps_doc_mean_word_length": 4.5,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0.016260160133242607,
"rps_doc_unigram_entropy": 3.8132662773132324,
"rps_doc_word_count": 106,
"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.07547169923782349,
"rps_doc_frac_chars_top_3gram": 0.03773584961891174,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -43.94390106201172,
"rps_doc_books_importance_length_correction": -57.467674255371094,
"rps_doc_openwebtext_importance": -25.83477783203125,
"rps_doc_openwebtext_importance_length_correction": -39.358551025390625,
"rps_doc_wikipedia_importance": -27.022966384887695,
"rps_doc_wikipedia_importance_length_correction": -40.5467414855957
},
"fasttext": {
"dclm": 0.08238059282302856,
"english": 0.814240574836731,
"fineweb_edu_approx": 2.481435537338257,
"eai_general_math": 0.013503910042345524,
"eai_open_web_math": 0.012255489826202393,
"eai_web_code": 0.6026748418807983
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.403",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"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": "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"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
5,073,542,710,008,819,000 | ++ed by:
DRTECH TIMB AWNCORP ABRAXXA
4 PAUSE users
5 non-PAUSE users.
Clinton Gormley
NAME
Elastic::Model::TypeMap::Structured - Type maps for MooseX::Types::Structured
VERSION
version 0.52
DESCRIPTION
Elastic::Model::TypeMap::Structured provides mapping, inflation and deflation for the MooseX::Types::Structured type constraints. It is loaded automatically byElastic::Model::TypeMap::Default.
TYPES
Optional
Optional values are mapped, inflated and deflated according to their content type, eg Optional[Int]. An Optional type with no content type is mapped as <{ type = 'object', enabled => 'no' }>> and the value would be passed through unaltered when deflating/inflating.
Tuple
Because array refs are interpreted by Elasticsearch as multiple values of the same type, tuples are converted to hash refs whose keys are the index number. For instance, a field foo with Tuple[Int,Str] and value [5,'foo'] will be deflated to { 0 => 5, 1 => 'foo' }.
A tuple is mapped as an object, with:
{
type => 'object',
dynamic => 'strict',
properties => \%properties
}
The %properties mapping depends on the content types. A Tuple without content types is mapped as <{ type = 'object', enabled => 'no' }>> and the value would be passed through unaltered when deflating/inflating.
Dict
A Dict is mapped as an object, with:
{
type => 'object',
dynamic => 'strict',
properties => \%properties
}
The %properties mapping depends on the content types. A Dict without content types is mapped as <{ type = 'object', enabled => 'no' }>> and the value would be passed through unaltered when deflating/inflating.
Map
It is not advisable to allow arbitrary key names in indexed hashes, as you could end up generating many (and conflicting) field mappings. For this reason, Maps are mapped as { type => 'object', enabled => 0 }. In/deflation depends on the content type (eg Map[Str,Int]). A Map without a content type would pass through the value unaltered when inflating/deflatin.
AUTHOR
Clinton Gormley <[email protected]>
COPYRIGHT AND LICENSE
This software is copyright (c) 2015 by Clinton Gormley.
This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. | {
"url": "https://metacpan.org/pod/Elastic::Model::TypeMap::Structured",
"source_domain": "metacpan.org",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "47669",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QE5XRNSF533P2KXMZ64MMF46O4BMTXOU",
"WARC-Concurrent-To": "<urn:uuid:68305585-7f3b-43c4-9ed7-b01f256531a8>",
"WARC-Date": "2018-06-22T01:37:32Z",
"WARC-IP-Address": "151.101.2.217",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AYQ54SSWY3EZ7SLJMKU763D4MRBKKGBY",
"WARC-Record-ID": "<urn:uuid:13b0fef8-014d-4da6-9c80-34cd5c5777b6>",
"WARC-Target-URI": "https://metacpan.org/pod/Elastic::Model::TypeMap::Structured",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:93c00894-507f-4cca-b239-f45d3507900c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-144-111-253.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,
9,
37,
38,
52,
71,
72,
88,
89,
94,
95,
173,
174,
182,
183,
196,
197,
209,
210,
403,
404,
410,
411,
420,
421,
687,
688,
694,
695,
961,
962,
1000,
1001,
1007,
1039,
1071,
1106,
1112,
1113,
1324,
1325,
1330,
1331,
1368,
1369,
1375,
1407,
1439,
1474,
1480,
1481,
1691,
1692,
1696,
1697,
2060,
2061,
2068,
2069,
2103,
2104,
2126,
2127,
2183,
2184
],
"line_end_idx": [
9,
37,
38,
52,
71,
72,
88,
89,
94,
95,
173,
174,
182,
183,
196,
197,
209,
210,
403,
404,
410,
411,
420,
421,
687,
688,
694,
695,
961,
962,
1000,
1001,
1007,
1039,
1071,
1106,
1112,
1113,
1324,
1325,
1330,
1331,
1368,
1369,
1375,
1407,
1439,
1474,
1480,
1481,
1691,
1692,
1696,
1697,
2060,
2061,
2068,
2069,
2103,
2104,
2126,
2127,
2183,
2184,
2318
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2318,
"ccnet_original_nlines": 64,
"rps_doc_curly_bracket": 0.006039690226316452,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25267666578292847,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.040685221552848816,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2976445257663727,
"rps_doc_frac_unique_words": 0.43870967626571655,
"rps_doc_mean_word_length": 5.44516134262085,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.567994117736816,
"rps_doc_word_count": 310,
"rps_doc_frac_chars_dupe_10grams": 0.3145734667778015,
"rps_doc_frac_chars_dupe_5grams": 0.32938387989997864,
"rps_doc_frac_chars_dupe_6grams": 0.3145734667778015,
"rps_doc_frac_chars_dupe_7grams": 0.3145734667778015,
"rps_doc_frac_chars_dupe_8grams": 0.3145734667778015,
"rps_doc_frac_chars_dupe_9grams": 0.3145734667778015,
"rps_doc_frac_chars_top_2gram": 0.028436020016670227,
"rps_doc_frac_chars_top_3gram": 0.029620850458741188,
"rps_doc_frac_chars_top_4gram": 0.04265403002500534,
"rps_doc_books_importance": -231.4751434326172,
"rps_doc_books_importance_length_correction": -231.4751434326172,
"rps_doc_openwebtext_importance": -112.8292236328125,
"rps_doc_openwebtext_importance_length_correction": -112.8292236328125,
"rps_doc_wikipedia_importance": -84.80486297607422,
"rps_doc_wikipedia_importance_length_correction": -84.80486297607422
},
"fasttext": {
"dclm": 0.1139519214630127,
"english": 0.8500756621360779,
"fineweb_edu_approx": 2.82279896736145,
"eai_general_math": 0.6020268201828003,
"eai_open_web_math": 0.28986477851867676,
"eai_web_code": 0.2029852271080017
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-8,230,318,770,013,374,000 | 2
I'm guessing the answer is no, but I was wondering if there was anyway to tell innodb to not store fetched pages in the buffer pool?
The reason for looking at doing this is check summing tables. I'd like to minimize the effects of trashing the useful cached data.
1 Answer 1
2
Months later I stumbled across the effective solution to what I was seeking in my question.
From the docs itself there are two variables to help prevent the trashing of the buffer pool for large table scans such that would occur during a checksum or mysqldump.
The first is innodb_old_blocks_pct (default 37%). This the sublist of pages that are eligible for eviction when a new page is inserted. When a new page is first read it is added to the head of this list.
innodb_old_blocks_time (default 0) defines the number of milliseconds after being added must elapse before an access that cause it to move out of the old list to the head of the new list. Since the default is 0 the first access puts it to the head of the new list.
So in short set innodb_old_blocks_time to a nonzero value, say 500, and then a table scan will basically just cause the old sublist to continually get cycled through. Pages getting read for other purposes will remain in the new list allowing your DB to remain warmed with real application relevant data!
2
• Brilliant solution and a hearty +1 !!! Apr 3, 2012 at 19:07
• In MySQL 5.7 innodb_old_blocks_time defaults to 1000
– mvorisek
Dec 6, 2017 at 10:05
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://dba.stackexchange.com/questions/11742/sql-no-cache-for-innodb-buffer-pool",
"source_domain": "dba.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "154240",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZACVXUJJQASGEEKU2JR2FL4ZBER3W75O",
"WARC-Concurrent-To": "<urn:uuid:80c89eab-66b8-43b9-8c2b-a64ea10137b0>",
"WARC-Date": "2024-02-24T16:27:21Z",
"WARC-IP-Address": "104.18.43.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RSZSEIFC3UPRY7P2XGGRKUBYNWFN5YP6",
"WARC-Record-ID": "<urn:uuid:cabab721-7c5f-4f33-b3a7-3eea01eb8ae0>",
"WARC-Target-URI": "https://dba.stackexchange.com/questions/11742/sql-no-cache-for-innodb-buffer-pool",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:48a52389-1e6a-4dc7-b377-84721f6bf5a2>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-150\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
3,
136,
137,
268,
269,
280,
281,
283,
284,
376,
377,
546,
547,
751,
752,
1017,
1018,
1322,
1323,
1325,
1389,
1446,
1461,
1486,
1487,
1499,
1500,
1616,
1617
],
"line_end_idx": [
2,
3,
136,
137,
268,
269,
280,
281,
283,
284,
376,
377,
546,
547,
751,
752,
1017,
1018,
1322,
1323,
1325,
1389,
1446,
1461,
1486,
1487,
1499,
1500,
1616,
1617,
1707
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1707,
"ccnet_original_nlines": 30,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44897958636283875,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017492709681391716,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16618075966835022,
"rps_doc_frac_unique_words": 0.5657894611358643,
"rps_doc_mean_word_length": 4.375,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.789493560791016,
"rps_doc_word_count": 304,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05263157933950424,
"rps_doc_frac_chars_dupe_6grams": 0.031578950583934784,
"rps_doc_frac_chars_dupe_7grams": 0.031578950583934784,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.015037589706480503,
"rps_doc_frac_chars_top_3gram": 0.02030074968934059,
"rps_doc_frac_chars_top_4gram": 0.02481202967464924,
"rps_doc_books_importance": -172.1709747314453,
"rps_doc_books_importance_length_correction": -160.44566345214844,
"rps_doc_openwebtext_importance": -117.96476745605469,
"rps_doc_openwebtext_importance_length_correction": -117.96476745605469,
"rps_doc_wikipedia_importance": -101.29495239257812,
"rps_doc_wikipedia_importance_length_correction": -92.61141967773438
},
"fasttext": {
"dclm": 0.1388811469078064,
"english": 0.9287998080253601,
"fineweb_edu_approx": 1.3157992362976074,
"eai_general_math": 0.001300749951042235,
"eai_open_web_math": 0.0877530574798584,
"eai_web_code": 0.0003390299971215427
}
} | {
"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.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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
781,309,840,277,468,500 | blob: c8def1b7f8fbad81b43ea5c34d1a46cd1b46c085 [file] [log] [blame]
// SPDX-License-Identifier: GPL-2.0-only
/*
* xsave/xrstor support.
*
* Author: Suresh Siddha <[email protected]>
*/
#include <linux/compat.h>
#include <linux/cpu.h>
#include <linux/mman.h>
#include <linux/pkeys.h>
#include <linux/seq_file.h>
#include <linux/proc_fs.h>
#include <asm/fpu/api.h>
#include <asm/fpu/internal.h>
#include <asm/fpu/signal.h>
#include <asm/fpu/regset.h>
#include <asm/fpu/xstate.h>
#include <asm/tlbflush.h>
#include <asm/cpufeature.h>
/*
* Although we spell it out in here, the Processor Trace
* xfeature is completely unused. We use other mechanisms
* to save/restore PT state in Linux.
*/
static const char *xfeature_names[] =
{
"x87 floating point registers" ,
"SSE registers" ,
"AVX registers" ,
"MPX bounds registers" ,
"MPX CSR" ,
"AVX-512 opmask" ,
"AVX-512 Hi256" ,
"AVX-512 ZMM_Hi256" ,
"Processor Trace (unused)" ,
"Protection Keys User registers",
"PASID state",
"unknown xstate feature" ,
};
static short xsave_cpuid_features[] __initdata = {
X86_FEATURE_FPU,
X86_FEATURE_XMM,
X86_FEATURE_AVX,
X86_FEATURE_MPX,
X86_FEATURE_MPX,
X86_FEATURE_AVX512F,
X86_FEATURE_AVX512F,
X86_FEATURE_AVX512F,
X86_FEATURE_INTEL_PT,
X86_FEATURE_PKU,
X86_FEATURE_ENQCMD,
};
/*
* This represents the full set of bits that should ever be set in a kernel
* XSAVE buffer, both supervisor and user xstates.
*/
u64 xfeatures_mask_all __ro_after_init;
EXPORT_SYMBOL_GPL(xfeatures_mask_all);
static unsigned int xstate_offsets[XFEATURE_MAX] __ro_after_init =
{ [ 0 ... XFEATURE_MAX - 1] = -1};
static unsigned int xstate_sizes[XFEATURE_MAX] __ro_after_init =
{ [ 0 ... XFEATURE_MAX - 1] = -1};
static unsigned int xstate_comp_offsets[XFEATURE_MAX] __ro_after_init =
{ [ 0 ... XFEATURE_MAX - 1] = -1};
static unsigned int xstate_supervisor_only_offsets[XFEATURE_MAX] __ro_after_init =
{ [ 0 ... XFEATURE_MAX - 1] = -1};
/*
* The XSAVE area of kernel can be in standard or compacted format;
* it is always in standard format for user mode. This is the user
* mode standard format size used for signal and ptrace frames.
*/
unsigned int fpu_user_xstate_size __ro_after_init;
/*
* Return whether the system supports a given xfeature.
*
* Also return the name of the (most advanced) feature that the caller requested:
*/
int cpu_has_xfeatures(u64 xfeatures_needed, const char **feature_name)
{
u64 xfeatures_missing = xfeatures_needed & ~xfeatures_mask_all;
if (unlikely(feature_name)) {
long xfeature_idx, max_idx;
u64 xfeatures_print;
/*
* So we use FLS here to be able to print the most advanced
* feature that was requested but is missing. So if a driver
* asks about "XFEATURE_MASK_SSE | XFEATURE_MASK_YMM" we'll print the
* missing AVX feature - this is the most informative message
* to users:
*/
if (xfeatures_missing)
xfeatures_print = xfeatures_missing;
else
xfeatures_print = xfeatures_needed;
xfeature_idx = fls64(xfeatures_print)-1;
max_idx = ARRAY_SIZE(xfeature_names)-1;
xfeature_idx = min(xfeature_idx, max_idx);
*feature_name = xfeature_names[xfeature_idx];
}
if (xfeatures_missing)
return 0;
return 1;
}
EXPORT_SYMBOL_GPL(cpu_has_xfeatures);
static bool xfeature_is_supervisor(int xfeature_nr)
{
/*
* Extended State Enumeration Sub-leaves (EAX = 0DH, ECX = n, n > 1)
* returns ECX[0] set to (1) for a supervisor state, and cleared (0)
* for a user state.
*/
u32 eax, ebx, ecx, edx;
cpuid_count(XSTATE_CPUID, xfeature_nr, &eax, &ebx, &ecx, &edx);
return ecx & 1;
}
/*
* Enable the extended processor state save/restore feature.
* Called once per CPU onlining.
*/
void fpu__init_cpu_xstate(void)
{
if (!boot_cpu_has(X86_FEATURE_XSAVE) || !xfeatures_mask_all)
return;
cr4_set_bits(X86_CR4_OSXSAVE);
/*
* XCR_XFEATURE_ENABLED_MASK (aka. XCR0) sets user features
* managed by XSAVE{C, OPT, S} and XRSTOR{S}. Only XSAVE user
* states can be set here.
*/
xsetbv(XCR_XFEATURE_ENABLED_MASK, xfeatures_mask_uabi());
/*
* MSR_IA32_XSS sets supervisor states managed by XSAVES.
*/
if (boot_cpu_has(X86_FEATURE_XSAVES)) {
wrmsrl(MSR_IA32_XSS, xfeatures_mask_supervisor() |
xfeatures_mask_independent());
}
}
static bool xfeature_enabled(enum xfeature xfeature)
{
return xfeatures_mask_all & BIT_ULL(xfeature);
}
/*
* Record the offsets and sizes of various xstates contained
* in the XSAVE state memory layout.
*/
static void __init setup_xstate_features(void)
{
u32 eax, ebx, ecx, edx, i;
/* start at the beginning of the "extended state" */
unsigned int last_good_offset = offsetof(struct xregs_state,
extended_state_area);
/*
* The FP xstates and SSE xstates are legacy states. They are always
* in the fixed offsets in the xsave area in either compacted form
* or standard form.
*/
xstate_offsets[XFEATURE_FP] = 0;
xstate_sizes[XFEATURE_FP] = offsetof(struct fxregs_state,
xmm_space);
xstate_offsets[XFEATURE_SSE] = xstate_sizes[XFEATURE_FP];
xstate_sizes[XFEATURE_SSE] = sizeof_field(struct fxregs_state,
xmm_space);
for (i = FIRST_EXTENDED_XFEATURE; i < XFEATURE_MAX; i++) {
if (!xfeature_enabled(i))
continue;
cpuid_count(XSTATE_CPUID, i, &eax, &ebx, &ecx, &edx);
xstate_sizes[i] = eax;
/*
* If an xfeature is supervisor state, the offset in EBX is
* invalid, leave it to -1.
*/
if (xfeature_is_supervisor(i))
continue;
xstate_offsets[i] = ebx;
/*
* In our xstate size checks, we assume that the highest-numbered
* xstate feature has the highest offset in the buffer. Ensure
* it does.
*/
WARN_ONCE(last_good_offset > xstate_offsets[i],
"x86/fpu: misordered xstate at %d\n", last_good_offset);
last_good_offset = xstate_offsets[i];
}
}
static void __init print_xstate_feature(u64 xstate_mask)
{
const char *feature_name;
if (cpu_has_xfeatures(xstate_mask, &feature_name))
pr_info("x86/fpu: Supporting XSAVE feature 0x%03Lx: '%s'\n", xstate_mask, feature_name);
}
/*
* Print out all the supported xstate features:
*/
static void __init print_xstate_features(void)
{
print_xstate_feature(XFEATURE_MASK_FP);
print_xstate_feature(XFEATURE_MASK_SSE);
print_xstate_feature(XFEATURE_MASK_YMM);
print_xstate_feature(XFEATURE_MASK_BNDREGS);
print_xstate_feature(XFEATURE_MASK_BNDCSR);
print_xstate_feature(XFEATURE_MASK_OPMASK);
print_xstate_feature(XFEATURE_MASK_ZMM_Hi256);
print_xstate_feature(XFEATURE_MASK_Hi16_ZMM);
print_xstate_feature(XFEATURE_MASK_PKRU);
print_xstate_feature(XFEATURE_MASK_PASID);
}
/*
* This check is important because it is easy to get XSTATE_*
* confused with XSTATE_BIT_*.
*/
#define CHECK_XFEATURE(nr) do { \
WARN_ON(nr < FIRST_EXTENDED_XFEATURE); \
WARN_ON(nr >= XFEATURE_MAX); \
} while (0)
/*
* We could cache this like xstate_size[], but we only use
* it here, so it would be a waste of space.
*/
static int xfeature_is_aligned(int xfeature_nr)
{
u32 eax, ebx, ecx, edx;
CHECK_XFEATURE(xfeature_nr);
if (!xfeature_enabled(xfeature_nr)) {
WARN_ONCE(1, "Checking alignment of disabled xfeature %d\n",
xfeature_nr);
return 0;
}
cpuid_count(XSTATE_CPUID, xfeature_nr, &eax, &ebx, &ecx, &edx);
/*
* The value returned by ECX[1] indicates the alignment
* of state component 'i' when the compacted format
* of the extended region of an XSAVE area is used:
*/
return !!(ecx & 2);
}
/*
* This function sets up offsets and sizes of all extended states in
* xsave area. This supports both standard format and compacted format
* of the xsave area.
*/
static void __init setup_xstate_comp_offsets(void)
{
unsigned int next_offset;
int i;
/*
* The FP xstates and SSE xstates are legacy states. They are always
* in the fixed offsets in the xsave area in either compacted form
* or standard form.
*/
xstate_comp_offsets[XFEATURE_FP] = 0;
xstate_comp_offsets[XFEATURE_SSE] = offsetof(struct fxregs_state,
xmm_space);
if (!boot_cpu_has(X86_FEATURE_XSAVES)) {
for (i = FIRST_EXTENDED_XFEATURE; i < XFEATURE_MAX; i++) {
if (xfeature_enabled(i))
xstate_comp_offsets[i] = xstate_offsets[i];
}
return;
}
next_offset = FXSAVE_SIZE + XSAVE_HDR_SIZE;
for (i = FIRST_EXTENDED_XFEATURE; i < XFEATURE_MAX; i++) {
if (!xfeature_enabled(i))
continue;
if (xfeature_is_aligned(i))
next_offset = ALIGN(next_offset, 64);
xstate_comp_offsets[i] = next_offset;
next_offset += xstate_sizes[i];
}
}
/*
* Setup offsets of a supervisor-state-only XSAVES buffer:
*
* The offsets stored in xstate_comp_offsets[] only work for one specific
* value of the Requested Feature BitMap (RFBM). In cases where a different
* RFBM value is used, a different set of offsets is required. This set of
* offsets is for when RFBM=xfeatures_mask_supervisor().
*/
static void __init setup_supervisor_only_offsets(void)
{
unsigned int next_offset;
int i;
next_offset = FXSAVE_SIZE + XSAVE_HDR_SIZE;
for (i = FIRST_EXTENDED_XFEATURE; i < XFEATURE_MAX; i++) {
if (!xfeature_enabled(i) || !xfeature_is_supervisor(i))
continue;
if (xfeature_is_aligned(i))
next_offset = ALIGN(next_offset, 64);
xstate_supervisor_only_offsets[i] = next_offset;
next_offset += xstate_sizes[i];
}
}
/*
* Print out xstate component offsets and sizes
*/
static void __init print_xstate_offset_size(void)
{
int i;
for (i = FIRST_EXTENDED_XFEATURE; i < XFEATURE_MAX; i++) {
if (!xfeature_enabled(i))
continue;
pr_info("x86/fpu: xstate_offset[%d]: %4d, xstate_sizes[%d]: %4d\n",
i, xstate_comp_offsets[i], i, xstate_sizes[i]);
}
}
/*
* All supported features have either init state all zeros or are
* handled in setup_init_fpu() individually. This is an explicit
* feature list and does not use XFEATURE_MASK*SUPPORTED to catch
* newly added supported features at build time and make people
* actually look at the init state for the new feature.
*/
#define XFEATURES_INIT_FPSTATE_HANDLED \
(XFEATURE_MASK_FP | \
XFEATURE_MASK_SSE | \
XFEATURE_MASK_YMM | \
XFEATURE_MASK_OPMASK | \
XFEATURE_MASK_ZMM_Hi256 | \
XFEATURE_MASK_Hi16_ZMM | \
XFEATURE_MASK_PKRU | \
XFEATURE_MASK_BNDREGS | \
XFEATURE_MASK_BNDCSR | \
XFEATURE_MASK_PASID)
/*
* setup the xstate image representing the init state
*/
static void __init setup_init_fpu_buf(void)
{
static int on_boot_cpu __initdata = 1;
BUILD_BUG_ON((XFEATURE_MASK_USER_SUPPORTED |
XFEATURE_MASK_SUPERVISOR_SUPPORTED) !=
XFEATURES_INIT_FPSTATE_HANDLED);
WARN_ON_FPU(!on_boot_cpu);
on_boot_cpu = 0;
if (!boot_cpu_has(X86_FEATURE_XSAVE))
return;
setup_xstate_features();
print_xstate_features();
if (boot_cpu_has(X86_FEATURE_XSAVES))
init_fpstate.xsave.header.xcomp_bv = XCOMP_BV_COMPACTED_FORMAT |
xfeatures_mask_all;
/*
* Init all the features state with header.xfeatures being 0x0
*/
os_xrstor_booting(&init_fpstate.xsave);
/*
* All components are now in init state. Read the state back so
* that init_fpstate contains all non-zero init state. This only
* works with XSAVE, but not with XSAVEOPT and XSAVES because
* those use the init optimization which skips writing data for
* components in init state.
*
* XSAVE could be used, but that would require to reshuffle the
* data when XSAVES is available because XSAVES uses xstate
* compaction. But doing so is a pointless exercise because most
* components have an all zeros init state except for the legacy
* ones (FP and SSE). Those can be saved with FXSAVE into the
* legacy area. Adding new features requires to ensure that init
* state is all zeroes or if not to add the necessary handling
* here.
*/
fxsave(&init_fpstate.fxsave);
}
static int xfeature_uncompacted_offset(int xfeature_nr)
{
u32 eax, ebx, ecx, edx;
/*
* Only XSAVES supports supervisor states and it uses compacted
* format. Checking a supervisor state's uncompacted offset is
* an error.
*/
if (XFEATURE_MASK_SUPERVISOR_ALL & BIT_ULL(xfeature_nr)) {
WARN_ONCE(1, "No fixed offset for xstate %d\n", xfeature_nr);
return -1;
}
CHECK_XFEATURE(xfeature_nr);
cpuid_count(XSTATE_CPUID, xfeature_nr, &eax, &ebx, &ecx, &edx);
return ebx;
}
int xfeature_size(int xfeature_nr)
{
u32 eax, ebx, ecx, edx;
CHECK_XFEATURE(xfeature_nr);
cpuid_count(XSTATE_CPUID, xfeature_nr, &eax, &ebx, &ecx, &edx);
return eax;
}
/* Validate an xstate header supplied by userspace (ptrace or sigreturn) */
static int validate_user_xstate_header(const struct xstate_header *hdr)
{
/* No unknown or supervisor features may be set */
if (hdr->xfeatures & ~xfeatures_mask_uabi())
return -EINVAL;
/* Userspace must use the uncompacted format */
if (hdr->xcomp_bv)
return -EINVAL;
/*
* If 'reserved' is shrunken to add a new field, make sure to validate
* that new field here!
*/
BUILD_BUG_ON(sizeof(hdr->reserved) != 48);
/* No reserved bits may be set */
if (memchr_inv(hdr->reserved, 0, sizeof(hdr->reserved)))
return -EINVAL;
return 0;
}
static void __xstate_dump_leaves(void)
{
int i;
u32 eax, ebx, ecx, edx;
static int should_dump = 1;
if (!should_dump)
return;
should_dump = 0;
/*
* Dump out a few leaves past the ones that we support
* just in case there are some goodies up there
*/
for (i = 0; i < XFEATURE_MAX + 10; i++) {
cpuid_count(XSTATE_CPUID, i, &eax, &ebx, &ecx, &edx);
pr_warn("CPUID[%02x, %02x]: eax=%08x ebx=%08x ecx=%08x edx=%08x\n",
XSTATE_CPUID, i, eax, ebx, ecx, edx);
}
}
#define XSTATE_WARN_ON(x) do { \
if (WARN_ONCE(x, "XSAVE consistency problem, dumping leaves")) { \
__xstate_dump_leaves(); \
} \
} while (0)
#define XCHECK_SZ(sz, nr, nr_macro, __struct) do { \
if ((nr == nr_macro) && \
WARN_ONCE(sz != sizeof(__struct), \
"%s: struct is %zu bytes, cpu state %d bytes\n", \
__stringify(nr_macro), sizeof(__struct), sz)) { \
__xstate_dump_leaves(); \
} \
} while (0)
/*
* We have a C struct for each 'xstate'. We need to ensure
* that our software representation matches what the CPU
* tells us about the state's size.
*/
static void check_xstate_against_struct(int nr)
{
/*
* Ask the CPU for the size of the state.
*/
int sz = xfeature_size(nr);
/*
* Match each CPU state with the corresponding software
* structure.
*/
XCHECK_SZ(sz, nr, XFEATURE_YMM, struct ymmh_struct);
XCHECK_SZ(sz, nr, XFEATURE_BNDREGS, struct mpx_bndreg_state);
XCHECK_SZ(sz, nr, XFEATURE_BNDCSR, struct mpx_bndcsr_state);
XCHECK_SZ(sz, nr, XFEATURE_OPMASK, struct avx_512_opmask_state);
XCHECK_SZ(sz, nr, XFEATURE_ZMM_Hi256, struct avx_512_zmm_uppers_state);
XCHECK_SZ(sz, nr, XFEATURE_Hi16_ZMM, struct avx_512_hi16_state);
XCHECK_SZ(sz, nr, XFEATURE_PKRU, struct pkru_state);
XCHECK_SZ(sz, nr, XFEATURE_PASID, struct ia32_pasid_state);
/*
* Make *SURE* to add any feature numbers in below if
* there are "holes" in the xsave state component
* numbers.
*/
if ((nr < XFEATURE_YMM) ||
(nr >= XFEATURE_MAX) ||
(nr == XFEATURE_PT_UNIMPLEMENTED_SO_FAR) ||
((nr >= XFEATURE_RSRVD_COMP_11) && (nr <= XFEATURE_LBR))) {
WARN_ONCE(1, "no structure for xstate: %d\n", nr);
XSTATE_WARN_ON(1);
}
}
/*
* This essentially double-checks what the cpu told us about
* how large the XSAVE buffer needs to be. We are recalculating
* it to be safe.
*
* Independent XSAVE features allocate their own buffers and are not
* covered by these checks. Only the size of the buffer for task->fpu
* is checked here.
*/
static void do_extra_xstate_size_checks(void)
{
int paranoid_xstate_size = FXSAVE_SIZE + XSAVE_HDR_SIZE;
int i;
for (i = FIRST_EXTENDED_XFEATURE; i < XFEATURE_MAX; i++) {
if (!xfeature_enabled(i))
continue;
check_xstate_against_struct(i);
/*
* Supervisor state components can be managed only by
* XSAVES.
*/
if (!cpu_feature_enabled(X86_FEATURE_XSAVES))
XSTATE_WARN_ON(xfeature_is_supervisor(i));
/* Align from the end of the previous feature */
if (xfeature_is_aligned(i))
paranoid_xstate_size = ALIGN(paranoid_xstate_size, 64);
/*
* The offset of a given state in the non-compacted
* format is given to us in a CPUID leaf. We check
* them for being ordered (increasing offsets) in
* setup_xstate_features(). XSAVES uses compacted format.
*/
if (!cpu_feature_enabled(X86_FEATURE_XSAVES))
paranoid_xstate_size = xfeature_uncompacted_offset(i);
/*
* The compacted-format offset always depends on where
* the previous state ended.
*/
paranoid_xstate_size += xfeature_size(i);
}
XSTATE_WARN_ON(paranoid_xstate_size != fpu_kernel_xstate_size);
}
/*
* Get total size of enabled xstates in XCR0 | IA32_XSS.
*
* Note the SDM's wording here. "sub-function 0" only enumerates
* the size of the *user* states. If we use it to size a buffer
* that we use 'XSAVES' on, we could potentially overflow the
* buffer because 'XSAVES' saves system states too.
*/
static unsigned int __init get_xsaves_size(void)
{
unsigned int eax, ebx, ecx, edx;
/*
* - CPUID function 0DH, sub-function 1:
* EBX enumerates the size (in bytes) required by
* the XSAVES instruction for an XSAVE area
* containing all the state components
* corresponding to bits currently set in
* XCR0 | IA32_XSS.
*/
cpuid_count(XSTATE_CPUID, 1, &eax, &ebx, &ecx, &edx);
return ebx;
}
/*
* Get the total size of the enabled xstates without the independent supervisor
* features.
*/
static unsigned int __init get_xsaves_size_no_independent(void)
{
u64 mask = xfeatures_mask_independent();
unsigned int size;
if (!mask)
return get_xsaves_size();
/* Disable independent features. */
wrmsrl(MSR_IA32_XSS, xfeatures_mask_supervisor());
/*
* Ask the hardware what size is required of the buffer.
* This is the size required for the task->fpu buffer.
*/
size = get_xsaves_size();
/* Re-enable independent features so XSAVES will work on them again. */
wrmsrl(MSR_IA32_XSS, xfeatures_mask_supervisor() | mask);
return size;
}
static unsigned int __init get_xsave_size(void)
{
unsigned int eax, ebx, ecx, edx;
/*
* - CPUID function 0DH, sub-function 0:
* EBX enumerates the size (in bytes) required by
* the XSAVE instruction for an XSAVE area
* containing all the *user* state components
* corresponding to bits currently set in XCR0.
*/
cpuid_count(XSTATE_CPUID, 0, &eax, &ebx, &ecx, &edx);
return ebx;
}
/*
* Will the runtime-enumerated 'xstate_size' fit in the init
* task's statically-allocated buffer?
*/
static bool is_supported_xstate_size(unsigned int test_xstate_size)
{
if (test_xstate_size <= sizeof(union fpregs_state))
return true;
pr_warn("x86/fpu: xstate buffer too small (%zu < %d), disabling xsave\n",
sizeof(union fpregs_state), test_xstate_size);
return false;
}
static int __init init_xstate_size(void)
{
/* Recompute the context size for enabled features: */
unsigned int possible_xstate_size;
unsigned int xsave_size;
xsave_size = get_xsave_size();
if (boot_cpu_has(X86_FEATURE_XSAVES))
possible_xstate_size = get_xsaves_size_no_independent();
else
possible_xstate_size = xsave_size;
/* Ensure we have the space to store all enabled: */
if (!is_supported_xstate_size(possible_xstate_size))
return -EINVAL;
/*
* The size is OK, we are definitely going to use xsave,
* make it known to the world that we need more space.
*/
fpu_kernel_xstate_size = possible_xstate_size;
do_extra_xstate_size_checks();
/*
* User space is always in standard format.
*/
fpu_user_xstate_size = xsave_size;
return 0;
}
/*
* We enabled the XSAVE hardware, but something went wrong and
* we can not use it. Disable it.
*/
static void fpu__init_disable_system_xstate(void)
{
xfeatures_mask_all = 0;
cr4_clear_bits(X86_CR4_OSXSAVE);
setup_clear_cpu_cap(X86_FEATURE_XSAVE);
}
/*
* Enable and initialize the xsave feature.
* Called once per system bootup.
*/
void __init fpu__init_system_xstate(void)
{
unsigned int eax, ebx, ecx, edx;
static int on_boot_cpu __initdata = 1;
u64 xfeatures;
int err;
int i;
WARN_ON_FPU(!on_boot_cpu);
on_boot_cpu = 0;
if (!boot_cpu_has(X86_FEATURE_FPU)) {
pr_info("x86/fpu: No FPU detected\n");
return;
}
if (!boot_cpu_has(X86_FEATURE_XSAVE)) {
pr_info("x86/fpu: x87 FPU will use %s\n",
boot_cpu_has(X86_FEATURE_FXSR) ? "FXSAVE" : "FSAVE");
return;
}
if (boot_cpu_data.cpuid_level < XSTATE_CPUID) {
WARN_ON_FPU(1);
return;
}
/*
* Find user xstates supported by the processor.
*/
cpuid_count(XSTATE_CPUID, 0, &eax, &ebx, &ecx, &edx);
xfeatures_mask_all = eax + ((u64)edx << 32);
/*
* Find supervisor xstates supported by the processor.
*/
cpuid_count(XSTATE_CPUID, 1, &eax, &ebx, &ecx, &edx);
xfeatures_mask_all |= ecx + ((u64)edx << 32);
if ((xfeatures_mask_uabi() & XFEATURE_MASK_FPSSE) != XFEATURE_MASK_FPSSE) {
/*
* This indicates that something really unexpected happened
* with the enumeration. Disable XSAVE and try to continue
* booting without it. This is too early to BUG().
*/
pr_err("x86/fpu: FP/SSE not present amongst the CPU's xstate features: 0x%llx.\n",
xfeatures_mask_all);
goto out_disable;
}
/*
* Clear XSAVE features that are disabled in the normal CPUID.
*/
for (i = 0; i < ARRAY_SIZE(xsave_cpuid_features); i++) {
if (!boot_cpu_has(xsave_cpuid_features[i]))
xfeatures_mask_all &= ~BIT_ULL(i);
}
xfeatures_mask_all &= XFEATURE_MASK_USER_SUPPORTED |
XFEATURE_MASK_SUPERVISOR_SUPPORTED;
/* Store it for paranoia check at the end */
xfeatures = xfeatures_mask_all;
/* Enable xstate instructions to be able to continue with initialization: */
fpu__init_cpu_xstate();
err = init_xstate_size();
if (err)
goto out_disable;
/*
* Update info used for ptrace frames; use standard-format size and no
* supervisor xstates:
*/
update_regset_xstate_info(fpu_user_xstate_size, xfeatures_mask_uabi());
fpu__init_prepare_fx_sw_frame();
setup_init_fpu_buf();
setup_xstate_comp_offsets();
setup_supervisor_only_offsets();
/*
* Paranoia check whether something in the setup modified the
* xfeatures mask.
*/
if (xfeatures != xfeatures_mask_all) {
pr_err("x86/fpu: xfeatures modified from 0x%016llx to 0x%016llx during init, disabling XSAVE\n",
xfeatures, xfeatures_mask_all);
goto out_disable;
}
print_xstate_offset_size();
pr_info("x86/fpu: Enabled xstate features 0x%llx, context size is %d bytes, using '%s' format.\n",
xfeatures_mask_all,
fpu_kernel_xstate_size,
boot_cpu_has(X86_FEATURE_XSAVES) ? "compacted" : "standard");
return;
out_disable:
/* something went wrong, try to boot without any XSAVE support */
fpu__init_disable_system_xstate();
}
/*
* Restore minimal FPU state after suspend:
*/
void fpu__resume_cpu(void)
{
/*
* Restore XCR0 on xsave capable CPUs:
*/
if (cpu_feature_enabled(X86_FEATURE_XSAVE))
xsetbv(XCR_XFEATURE_ENABLED_MASK, xfeatures_mask_uabi());
/*
* Restore IA32_XSS. The same CPUID bit enumerates support
* of XSAVES and MSR_IA32_XSS.
*/
if (cpu_feature_enabled(X86_FEATURE_XSAVES)) {
wrmsrl(MSR_IA32_XSS, xfeatures_mask_supervisor() |
xfeatures_mask_independent());
}
}
/*
* Given an xstate feature nr, calculate where in the xsave
* buffer the state is. Callers should ensure that the buffer
* is valid.
*/
static void *__raw_xsave_addr(struct xregs_state *xsave, int xfeature_nr)
{
if (!xfeature_enabled(xfeature_nr)) {
WARN_ON_FPU(1);
return NULL;
}
return (void *)xsave + xstate_comp_offsets[xfeature_nr];
}
/*
* Given the xsave area and a state inside, this function returns the
* address of the state.
*
* This is the API that is called to get xstate address in either
* standard format or compacted format of xsave area.
*
* Note that if there is no data for the field in the xsave buffer
* this will return NULL.
*
* Inputs:
* xstate: the thread's storage area for all FPU data
* xfeature_nr: state which is defined in xsave.h (e.g. XFEATURE_FP,
* XFEATURE_SSE, etc...)
* Output:
* address of the state in the xsave area, or NULL if the
* field is not present in the xsave buffer.
*/
void *get_xsave_addr(struct xregs_state *xsave, int xfeature_nr)
{
/*
* Do we even *have* xsave state?
*/
if (!boot_cpu_has(X86_FEATURE_XSAVE))
return NULL;
/*
* We should not ever be requesting features that we
* have not enabled.
*/
WARN_ONCE(!(xfeatures_mask_all & BIT_ULL(xfeature_nr)),
"get of unsupported state");
/*
* This assumes the last 'xsave*' instruction to
* have requested that 'xfeature_nr' be saved.
* If it did not, we might be seeing and old value
* of the field in the buffer.
*
* This can happen because the last 'xsave' did not
* request that this feature be saved (unlikely)
* or because the "init optimization" caused it
* to not be saved.
*/
if (!(xsave->header.xfeatures & BIT_ULL(xfeature_nr)))
return NULL;
return __raw_xsave_addr(xsave, xfeature_nr);
}
EXPORT_SYMBOL_GPL(get_xsave_addr);
#ifdef CONFIG_ARCH_HAS_PKEYS
/*
* This will go out and modify PKRU register to set the access
* rights for @pkey to @init_val.
*/
int arch_set_user_pkey_access(struct task_struct *tsk, int pkey,
unsigned long init_val)
{
u32 old_pkru, new_pkru_bits = 0;
int pkey_shift;
/*
* This check implies XSAVE support. OSPKE only gets
* set if we enable XSAVE and we enable PKU in XCR0.
*/
if (!cpu_feature_enabled(X86_FEATURE_OSPKE))
return -EINVAL;
/*
* This code should only be called with valid 'pkey'
* values originating from in-kernel users. Complain
* if a bad value is observed.
*/
if (WARN_ON_ONCE(pkey >= arch_max_pkey()))
return -EINVAL;
/* Set the bits we need in PKRU: */
if (init_val & PKEY_DISABLE_ACCESS)
new_pkru_bits |= PKRU_AD_BIT;
if (init_val & PKEY_DISABLE_WRITE)
new_pkru_bits |= PKRU_WD_BIT;
/* Shift the bits in to the correct place in PKRU for pkey: */
pkey_shift = pkey * PKRU_BITS_PER_PKEY;
new_pkru_bits <<= pkey_shift;
/* Get old PKRU and mask off any old bits in place: */
old_pkru = read_pkru();
old_pkru &= ~((PKRU_AD_BIT|PKRU_WD_BIT) << pkey_shift);
/* Write old part along with new part: */
write_pkru(old_pkru | new_pkru_bits);
return 0;
}
#endif /* ! CONFIG_ARCH_HAS_PKEYS */
static void copy_feature(bool from_xstate, struct membuf *to, void *xstate,
void *init_xstate, unsigned int size)
{
membuf_write(to, from_xstate ? xstate : init_xstate, size);
}
/**
* copy_xstate_to_uabi_buf - Copy kernel saved xstate to a UABI buffer
* @to: membuf descriptor
* @tsk: The task from which to copy the saved xstate
* @copy_mode: The requested copy mode
*
* Converts from kernel XSAVE or XSAVES compacted format to UABI conforming
* format, i.e. from the kernel internal hardware dependent storage format
* to the requested @mode. UABI XSTATE is always uncompacted!
*
* It supports partial copy but @to.pos always starts from zero.
*/
void copy_xstate_to_uabi_buf(struct membuf to, struct task_struct *tsk,
enum xstate_copy_mode copy_mode)
{
const unsigned int off_mxcsr = offsetof(struct fxregs_state, mxcsr);
struct xregs_state *xsave = &tsk->thread.fpu.state.xsave;
struct xregs_state *xinit = &init_fpstate.xsave;
struct xstate_header header;
unsigned int zerofrom;
int i;
memset(&header, 0, sizeof(header));
header.xfeatures = xsave->header.xfeatures;
/* Mask out the feature bits depending on copy mode */
switch (copy_mode) {
case XSTATE_COPY_FP:
header.xfeatures &= XFEATURE_MASK_FP;
break;
case XSTATE_COPY_FX:
header.xfeatures &= XFEATURE_MASK_FP | XFEATURE_MASK_SSE;
break;
case XSTATE_COPY_XSAVE:
header.xfeatures &= xfeatures_mask_uabi();
break;
}
/* Copy FP state up to MXCSR */
copy_feature(header.xfeatures & XFEATURE_MASK_FP, &to, &xsave->i387,
&xinit->i387, off_mxcsr);
/* Copy MXCSR when SSE or YMM are set in the feature mask */
copy_feature(header.xfeatures & (XFEATURE_MASK_SSE | XFEATURE_MASK_YMM),
&to, &xsave->i387.mxcsr, &xinit->i387.mxcsr,
MXCSR_AND_FLAGS_SIZE);
/* Copy the remaining FP state */
copy_feature(header.xfeatures & XFEATURE_MASK_FP,
&to, &xsave->i387.st_space, &xinit->i387.st_space,
sizeof(xsave->i387.st_space));
/* Copy the SSE state - shared with YMM, but independently managed */
copy_feature(header.xfeatures & XFEATURE_MASK_SSE,
&to, &xsave->i387.xmm_space, &xinit->i387.xmm_space,
sizeof(xsave->i387.xmm_space));
if (copy_mode != XSTATE_COPY_XSAVE)
goto out;
/* Zero the padding area */
membuf_zero(&to, sizeof(xsave->i387.padding));
/* Copy xsave->i387.sw_reserved */
membuf_write(&to, xstate_fx_sw_bytes, sizeof(xsave->i387.sw_reserved));
/* Copy the user space relevant state of @xsave->header */
membuf_write(&to, &header, sizeof(header));
zerofrom = offsetof(struct xregs_state, extended_state_area);
for (i = FIRST_EXTENDED_XFEATURE; i < XFEATURE_MAX; i++) {
/*
* The ptrace buffer is in non-compacted XSAVE format.
* In non-compacted format disabled features still occupy
* state space, but there is no state to copy from in the
* compacted init_fpstate. The gap tracking will zero this
* later.
*/
if (!(xfeatures_mask_uabi() & BIT_ULL(i)))
continue;
/*
* If there was a feature or alignment gap, zero the space
* in the destination buffer.
*/
if (zerofrom < xstate_offsets[i])
membuf_zero(&to, xstate_offsets[i] - zerofrom);
if (i == XFEATURE_PKRU) {
struct pkru_state pkru = {0};
/*
* PKRU is not necessarily up to date in the
* thread's XSAVE buffer. Fill this part from the
* per-thread storage.
*/
pkru.pkru = tsk->thread.pkru;
membuf_write(&to, &pkru, sizeof(pkru));
} else {
copy_feature(header.xfeatures & BIT_ULL(i), &to,
__raw_xsave_addr(xsave, i),
__raw_xsave_addr(xinit, i),
xstate_sizes[i]);
}
/*
* Keep track of the last copied state in the non-compacted
* target buffer for gap zeroing.
*/
zerofrom = xstate_offsets[i] + xstate_sizes[i];
}
out:
if (to.left)
membuf_zero(&to, to.left);
}
static int copy_from_buffer(void *dst, unsigned int offset, unsigned int size,
const void *kbuf, const void __user *ubuf)
{
if (kbuf) {
memcpy(dst, kbuf + offset, size);
} else {
if (copy_from_user(dst, ubuf + offset, size))
return -EFAULT;
}
return 0;
}
static int copy_uabi_to_xstate(struct xregs_state *xsave, const void *kbuf,
const void __user *ubuf)
{
unsigned int offset, size;
struct xstate_header hdr;
u64 mask;
int i;
offset = offsetof(struct xregs_state, header);
if (copy_from_buffer(&hdr, offset, sizeof(hdr), kbuf, ubuf))
return -EFAULT;
if (validate_user_xstate_header(&hdr))
return -EINVAL;
/* Validate MXCSR when any of the related features is in use */
mask = XFEATURE_MASK_FP | XFEATURE_MASK_SSE | XFEATURE_MASK_YMM;
if (hdr.xfeatures & mask) {
u32 mxcsr[2];
offset = offsetof(struct fxregs_state, mxcsr);
if (copy_from_buffer(mxcsr, offset, sizeof(mxcsr), kbuf, ubuf))
return -EFAULT;
/* Reserved bits in MXCSR must be zero. */
if (mxcsr[0] & ~mxcsr_feature_mask)
return -EINVAL;
/* SSE and YMM require MXCSR even when FP is not in use. */
if (!(hdr.xfeatures & XFEATURE_MASK_FP)) {
xsave->i387.mxcsr = mxcsr[0];
xsave->i387.mxcsr_mask = mxcsr[1];
}
}
for (i = 0; i < XFEATURE_MAX; i++) {
u64 mask = ((u64)1 << i);
if (hdr.xfeatures & mask) {
void *dst = __raw_xsave_addr(xsave, i);
offset = xstate_offsets[i];
size = xstate_sizes[i];
if (copy_from_buffer(dst, offset, size, kbuf, ubuf))
return -EFAULT;
}
}
/*
* The state that came in from userspace was user-state only.
* Mask all the user states out of 'xfeatures':
*/
xsave->header.xfeatures &= XFEATURE_MASK_SUPERVISOR_ALL;
/*
* Add back in the features that came in from userspace:
*/
xsave->header.xfeatures |= hdr.xfeatures;
return 0;
}
/*
* Convert from a ptrace standard-format kernel buffer to kernel XSAVE[S]
* format and copy to the target thread. This is called from
* xstateregs_set().
*/
int copy_uabi_from_kernel_to_xstate(struct xregs_state *xsave, const void *kbuf)
{
return copy_uabi_to_xstate(xsave, kbuf, NULL);
}
/*
* Convert from a sigreturn standard-format user-space buffer to kernel
* XSAVE[S] format and copy to the target thread. This is called from the
* sigreturn() and rt_sigreturn() system calls.
*/
int copy_sigframe_from_user_to_xstate(struct xregs_state *xsave,
const void __user *ubuf)
{
return copy_uabi_to_xstate(xsave, NULL, ubuf);
}
static bool validate_xsaves_xrstors(u64 mask)
{
u64 xchk;
if (WARN_ON_FPU(!cpu_feature_enabled(X86_FEATURE_XSAVES)))
return false;
/*
* Validate that this is either a task->fpstate related component
* subset or an independent one.
*/
if (mask & xfeatures_mask_independent())
xchk = ~xfeatures_mask_independent();
else
xchk = ~xfeatures_mask_all;
if (WARN_ON_ONCE(!mask || mask & xchk))
return false;
return true;
}
/**
* xsaves - Save selected components to a kernel xstate buffer
* @xstate: Pointer to the buffer
* @mask: Feature mask to select the components to save
*
* The @xstate buffer must be 64 byte aligned and correctly initialized as
* XSAVES does not write the full xstate header. Before first use the
* buffer should be zeroed otherwise a consecutive XRSTORS from that buffer
* can #GP.
*
* The feature mask must either be a subset of the independent features or
* a subset of the task->fpstate related features.
*/
void xsaves(struct xregs_state *xstate, u64 mask)
{
int err;
if (!validate_xsaves_xrstors(mask))
return;
XSTATE_OP(XSAVES, xstate, (u32)mask, (u32)(mask >> 32), err);
WARN_ON_ONCE(err);
}
/**
* xrstors - Restore selected components from a kernel xstate buffer
* @xstate: Pointer to the buffer
* @mask: Feature mask to select the components to restore
*
* The @xstate buffer must be 64 byte aligned and correctly initialized
* otherwise XRSTORS from that buffer can #GP.
*
* Proper usage is to restore the state which was saved with
* xsaves() into @xstate.
*
* The feature mask must either be a subset of the independent features or
* a subset of the task->fpstate related features.
*/
void xrstors(struct xregs_state *xstate, u64 mask)
{
int err;
if (!validate_xsaves_xrstors(mask))
return;
XSTATE_OP(XRSTORS, xstate, (u32)mask, (u32)(mask >> 32), err);
WARN_ON_ONCE(err);
}
#ifdef CONFIG_PROC_PID_ARCH_STATUS
/*
* Report the amount of time elapsed in millisecond since last AVX512
* use in the task.
*/
static void avx512_status(struct seq_file *m, struct task_struct *task)
{
unsigned long timestamp = READ_ONCE(task->thread.fpu.avx512_timestamp);
long delta;
if (!timestamp) {
/*
* Report -1 if no AVX512 usage
*/
delta = -1;
} else {
delta = (long)(jiffies - timestamp);
/*
* Cap to LONG_MAX if time difference > LONG_MAX
*/
if (delta < 0)
delta = LONG_MAX;
delta = jiffies_to_msecs(delta);
}
seq_put_decimal_ll(m, "AVX512_elapsed_ms:\t", delta);
seq_putc(m, '\n');
}
/*
* Report architecture specific information
*/
int proc_pid_arch_status(struct seq_file *m, struct pid_namespace *ns,
struct pid *pid, struct task_struct *task)
{
/*
* Report AVX512 state if the processor and build option supported.
*/
if (cpu_feature_enabled(X86_FEATURE_AVX512F))
avx512_status(m, task);
return 0;
}
#endif /* CONFIG_PROC_PID_ARCH_STATUS */ | {
"url": "https://linux.googlesource.com/linux/kernel/git/tj/cgroup/+/d298b03506d3e161f7492c440babb0bfae35e650/arch/x86/kernel/fpu/xstate.c",
"source_domain": "linux.googlesource.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "450803",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HWZZU7S7LJASU3QYLMBKBODZHPZ5ZLWF",
"WARC-Concurrent-To": "<urn:uuid:7d693ce4-5ddb-4901-b3f8-6bd31fa5b3d4>",
"WARC-Date": "2022-05-22T08:58:59Z",
"WARC-IP-Address": "172.253.62.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:J52BNDAEVXCNQZ3QTNC5YGSAJ7CQ4G4L",
"WARC-Record-ID": "<urn:uuid:b145fc44-7440-4916-a086-4152af66b992>",
"WARC-Target-URI": "https://linux.googlesource.com/linux/kernel/git/tj/cgroup/+/d298b03506d3e161f7492c440babb0bfae35e650/arch/x86/kernel/fpu/xstate.c",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:146fafcd-9bd9-476f-98c3-dae0ad14887d>"
},
"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-200\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,
68,
109,
112,
136,
138,
190,
193,
219,
242,
266,
291,
319,
346,
371,
401,
429,
457,
485,
511,
539,
542,
598,
655,
692,
695,
733,
735,
768,
786,
804,
829,
841,
860,
878,
900,
929,
963,
978,
1005,
1008,
1059,
1076,
1093,
1110,
1127,
1144,
1165,
1186,
1207,
1229,
1246,
1266,
1269,
1272,
1347,
1397,
1400,
1440,
1479,
1546,
1581,
1646,
1681,
1753,
1788,
1871,
1906,
1909,
1976,
2042,
2105,
2108,
2159,
2162,
2217,
2219,
2300,
2303,
2374,
2376,
2440,
2470,
2498,
2519,
2522,
2581,
2641,
2710,
2771,
2783,
2786,
2809,
2846,
2851,
2887,
2928,
2968,
3011,
3057,
3059,
3082,
3092,
3102,
3104,
3142,
3194,
3196,
3199,
3267,
3335,
3355,
3358,
3382,
3446,
3462,
3464,
3467,
3527,
3559,
3562,
3594,
3596,
3657,
3665,
3696,
3699,
3758,
3819,
3845,
3848,
3906,
3909,
3966,
3969,
4009,
4060,
4091,
4093,
4095,
4148,
4150,
4197,
4199,
4202,
4262,
4298,
4301,
4348,
4350,
4377,
4430,
4491,
4513,
4516,
4584,
4650,
4670,
4673,
4706,
4764,
4776,
4834,
4897,
4909,
4968,
4994,
5004,
5058,
5081,
5084,
5143,
5170,
5173,
5204,
5214,
5239,
5242,
5307,
5369,
5380,
5383,
5431,
5488,
5526,
5528,
5530,
5587,
5589,
5615,
5666,
5755,
5757,
5760,
5807,
5810,
5857,
5859,
5899,
5940,
5981,
6026,
6070,
6114,
6161,
6207,
6249,
6292,
6294,
6297,
6358,
6388,
6391,
6425,
6466,
6497,
6509,
6512,
6570,
6614,
6617,
6665,
6667,
6691,
6720,
6758,
6819,
6833,
6843,
6845,
6909,
6912,
6967,
7018,
7069,
7072,
7092,
7094,
7097,
7165,
7235,
7256,
7259,
7310,
7312,
7338,
7345,
7348,
7416,
7482,
7502,
7505,
7543,
7609,
7621,
7662,
7721,
7746,
7790,
7792,
7800,
7802,
7846,
7905,
7931,
7941,
7969,
8007,
8045,
8077,
8079,
8081,
8084,
8142,
8144,
8217,
8292,
8366,
8422,
8425,
8480,
8482,
8508,
8515,
8559,
8618,
8674,
8684,
8712,
8750,
8799,
8831,
8833,
8835,
8838,
8885,
8888,
8938,
8940,
8947,
9006,
9032,
9042,
9110,
9158,
9160,
9162,
9165,
9230,
9294,
9359,
9422,
9477,
9480,
9521,
9543,
9565,
9587,
9612,
9640,
9667,
9690,
9716,
9741,
9762,
9765,
9818,
9821,
9865,
9867,
9906,
9951,
9990,
10023,
10050,
10067,
10105,
10113,
10138,
10163,
10201,
10266,
10286,
10289,
10351,
10354,
10394,
10397,
10460,
10524,
10585,
10648,
10676,
10678,
10741,
10800,
10864,
10928,
10989,
11053,
11115,
11123,
11126,
11156,
11158,
11214,
11216,
11240,
11243,
11306,
11368,
11380,
11383,
11442,
11504,
11515,
11517,
11546,
11610,
11622,
11624,
11659,
11661,
11685,
11714,
11778,
11790,
11792,
11868,
11940,
11942,
11993,
12038,
12054,
12102,
12121,
12137,
12140,
12210,
12233,
12236,
12279,
12313,
12370,
12386,
12396,
12398,
12437,
12439,
12446,
12470,
12498,
12516,
12524,
12541,
12544,
12598,
12645,
12648,
12690,
12744,
12812,
12850,
12852,
12854,
12887,
12954,
12980,
12984,
12996,
13049,
13075,
13111,
13162,
13212,
13238,
13242,
13254,
13257,
13315,
13371,
13406,
13409,
13457,
13459,
13462,
13503,
13506,
13534,
13537,
13592,
13605,
13608,
13661,
13723,
13784,
13849,
13921,
13986,
14039,
14099,
14102,
14155,
14204,
14215,
14218,
14245,
14269,
14313,
14373,
14424,
14443,
14445,
14447,
14450,
14510,
14573,
14590,
14592,
14660,
14729,
14748,
14751,
14797,
14799,
14856,
14863,
14922,
14948,
14958,
14990,
14993,
15046,
15056,
15059,
15105,
15148,
15197,
15225,
15281,
15284,
15335,
15385,
15434,
15491,
15494,
15540,
15595,
15598,
15652,
15680,
15683,
15725,
15727,
15791,
15793,
15796,
15852,
15854,
15918,
15981,
16042,
16093,
16096,
16145,
16147,
16180,
16183,
16223,
16272,
16315,
16353,
16394,
16413,
16416,
16470,
16482,
16484,
16487,
16566,
16578,
16581,
16645,
16647,
16688,
16707,
16718,
16744,
16780,
16831,
16834,
16890,
16944,
16947,
16973,
17045,
17103,
17116,
17118,
17166,
17168,
17201,
17204,
17244,
17293,
17335,
17380,
17427,
17430,
17484,
17496,
17498,
17501,
17561,
17599,
17602,
17670,
17672,
17724,
17737,
17811,
17858,
17872,
17874,
17915,
17917,
17972,
18007,
18032,
18063,
18101,
18158,
18163,
18198,
18251,
18304,
18320,
18323,
18379,
18433,
18436,
18483,
18514,
18517,
18560,
18563,
18598,
18608,
18610,
18613,
18675,
18708,
18711,
18761,
18763,
18787,
18820,
18860,
18862,
18865,
18908,
18941,
18944,
18986,
18988,
19021,
19060,
19075,
19084,
19091,
19118,
19135,
19173,
19212,
19220,
19222,
19262,
19304,
19358,
19366,
19368,
19416,
19432,
19440,
19442,
19445,
19493,
19496,
19550,
19595,
19598,
19652,
19655,
19709,
19755,
19831,
19834,
19893,
19951,
20001,
20004,
20087,
20108,
20126,
20128,
20131,
20193,
20196,
20253,
20297,
20332,
20334,
20387,
20423,
20468,
20500,
20577,
20601,
20627,
20636,
20654,
20657,
20727,
20749,
20752,
20824,
20857,
20879,
20908,
20941,
20944,
21005,
21023,
21026,
21065,
21162,
21194,
21212,
21214,
21242,
21341,
21361,
21385,
21447,
21455,
21468,
21534,
21569,
21571,
21574,
21617,
21620,
21647,
21649,
21652,
21690,
21693,
21737,
21795,
21798,
21856,
21886,
21889,
21936,
21987,
22018,
22020,
22022,
22025,
22084,
22145,
22157,
22160,
22234,
22236,
22274,
22290,
22303,
22305,
22362,
22364,
22367,
22436,
22460,
22462,
22527,
22580,
22582,
22648,
22673,
22675,
22685,
22738,
22806,
22830,
22840,
22897,
22941,
22944,
23009,
23011,
23014,
23047,
23050,
23088,
23101,
23104,
23156,
23176,
23179,
23235,
23264,
23267,
23315,
23361,
23411,
23441,
23443,
23494,
23542,
23589,
23608,
23611,
23666,
23679,
23724,
23726,
23761,
23790,
23793,
23855,
23888,
23891,
23956,
23980,
23982,
24015,
24031,
24034,
24086,
24138,
24141,
24186,
24202,
24205,
24257,
24309,
24339,
24342,
24385,
24401,
24437,
24473,
24503,
24538,
24568,
24631,
24671,
24701,
24756,
24780,
24836,
24878,
24916,
24926,
24928,
24965,
25041,
25079,
25081,
25141,
25143,
25147,
25217,
25242,
25295,
25333,
25335,
25410,
25484,
25545,
25547,
25611,
25614,
25686,
25719,
25721,
25790,
25848,
25897,
25926,
25949,
25956,
25992,
26036,
26091,
26112,
26133,
26171,
26178,
26199,
26257,
26264,
26288,
26331,
26338,
26340,
26372,
26441,
26467,
26528,
26601,
26646,
26669,
26703,
26753,
26804,
26835,
26905,
26956,
27009,
27041,
27077,
27087,
27115,
27162,
27197,
27269,
27328,
27372,
27434,
27493,
27496,
27550,
27607,
27664,
27722,
27731,
27734,
27777,
27787,
27790,
27848,
27877,
27880,
27914,
27962,
27988,
28018,
28021,
28065,
28114,
28136,
28139,
28169,
28209,
28218,
28267,
28295,
28323,
28341,
28343,
28346,
28405,
28438,
28441,
28489,
28491,
28496,
28509,
28536,
28538,
28617,
28660,
28662,
28674,
28708,
28717,
28763,
28779,
28781,
28791,
28793,
28869,
28894,
28896,
28923,
28949,
28959,
28966,
29013,
29074,
29090,
29129,
29145,
29209,
29274,
29302,
29316,
29363,
29427,
29443,
29486,
29522,
29538,
29598,
29641,
29671,
29706,
29708,
29710,
29747,
29773,
29801,
29841,
29869,
29893,
29946,
29962,
29964,
29966,
29969,
30030,
30077,
30080,
30137,
30140,
30196,
30199,
30241,
30251,
30253,
30256,
30329,
30389,
30409,
30412,
30493,
30495,
30542,
30544,
30547,
30618,
30691,
30738,
30741,
30806,
30831,
30833,
30880,
30882,
30928,
30930,
30940,
30999,
31013,
31016,
31081,
31113,
31116,
31157,
31195,
31200,
31228,
31268,
31282,
31295,
31297,
31301,
31363,
31396,
31451,
31453,
31527,
31596,
31671,
31682,
31684,
31758,
31808,
31811,
31861,
31863,
31872,
31908,
31916,
31978,
31997,
31999,
32003,
32071,
32104,
32162,
32164,
32235,
32281,
32283,
32343,
32368,
32370,
32444,
32494,
32497,
32548,
32550,
32559,
32595,
32603,
32666,
32685,
32687,
32722,
32725,
32794,
32813,
32816,
32888,
32890,
32962,
32974,
32992,
32995,
33026,
33029,
33041,
33050,
33087,
33090,
33138,
33141,
33156,
33174,
33207,
33209,
33263,
33282,
33284,
33287,
33330,
33333,
33404,
33447,
33449,
33452,
33519,
33522,
33568,
33592,
33602,
33604
],
"line_end_idx": [
68,
109,
112,
136,
138,
190,
193,
219,
242,
266,
291,
319,
346,
371,
401,
429,
457,
485,
511,
539,
542,
598,
655,
692,
695,
733,
735,
768,
786,
804,
829,
841,
860,
878,
900,
929,
963,
978,
1005,
1008,
1059,
1076,
1093,
1110,
1127,
1144,
1165,
1186,
1207,
1229,
1246,
1266,
1269,
1272,
1347,
1397,
1400,
1440,
1479,
1546,
1581,
1646,
1681,
1753,
1788,
1871,
1906,
1909,
1976,
2042,
2105,
2108,
2159,
2162,
2217,
2219,
2300,
2303,
2374,
2376,
2440,
2470,
2498,
2519,
2522,
2581,
2641,
2710,
2771,
2783,
2786,
2809,
2846,
2851,
2887,
2928,
2968,
3011,
3057,
3059,
3082,
3092,
3102,
3104,
3142,
3194,
3196,
3199,
3267,
3335,
3355,
3358,
3382,
3446,
3462,
3464,
3467,
3527,
3559,
3562,
3594,
3596,
3657,
3665,
3696,
3699,
3758,
3819,
3845,
3848,
3906,
3909,
3966,
3969,
4009,
4060,
4091,
4093,
4095,
4148,
4150,
4197,
4199,
4202,
4262,
4298,
4301,
4348,
4350,
4377,
4430,
4491,
4513,
4516,
4584,
4650,
4670,
4673,
4706,
4764,
4776,
4834,
4897,
4909,
4968,
4994,
5004,
5058,
5081,
5084,
5143,
5170,
5173,
5204,
5214,
5239,
5242,
5307,
5369,
5380,
5383,
5431,
5488,
5526,
5528,
5530,
5587,
5589,
5615,
5666,
5755,
5757,
5760,
5807,
5810,
5857,
5859,
5899,
5940,
5981,
6026,
6070,
6114,
6161,
6207,
6249,
6292,
6294,
6297,
6358,
6388,
6391,
6425,
6466,
6497,
6509,
6512,
6570,
6614,
6617,
6665,
6667,
6691,
6720,
6758,
6819,
6833,
6843,
6845,
6909,
6912,
6967,
7018,
7069,
7072,
7092,
7094,
7097,
7165,
7235,
7256,
7259,
7310,
7312,
7338,
7345,
7348,
7416,
7482,
7502,
7505,
7543,
7609,
7621,
7662,
7721,
7746,
7790,
7792,
7800,
7802,
7846,
7905,
7931,
7941,
7969,
8007,
8045,
8077,
8079,
8081,
8084,
8142,
8144,
8217,
8292,
8366,
8422,
8425,
8480,
8482,
8508,
8515,
8559,
8618,
8674,
8684,
8712,
8750,
8799,
8831,
8833,
8835,
8838,
8885,
8888,
8938,
8940,
8947,
9006,
9032,
9042,
9110,
9158,
9160,
9162,
9165,
9230,
9294,
9359,
9422,
9477,
9480,
9521,
9543,
9565,
9587,
9612,
9640,
9667,
9690,
9716,
9741,
9762,
9765,
9818,
9821,
9865,
9867,
9906,
9951,
9990,
10023,
10050,
10067,
10105,
10113,
10138,
10163,
10201,
10266,
10286,
10289,
10351,
10354,
10394,
10397,
10460,
10524,
10585,
10648,
10676,
10678,
10741,
10800,
10864,
10928,
10989,
11053,
11115,
11123,
11126,
11156,
11158,
11214,
11216,
11240,
11243,
11306,
11368,
11380,
11383,
11442,
11504,
11515,
11517,
11546,
11610,
11622,
11624,
11659,
11661,
11685,
11714,
11778,
11790,
11792,
11868,
11940,
11942,
11993,
12038,
12054,
12102,
12121,
12137,
12140,
12210,
12233,
12236,
12279,
12313,
12370,
12386,
12396,
12398,
12437,
12439,
12446,
12470,
12498,
12516,
12524,
12541,
12544,
12598,
12645,
12648,
12690,
12744,
12812,
12850,
12852,
12854,
12887,
12954,
12980,
12984,
12996,
13049,
13075,
13111,
13162,
13212,
13238,
13242,
13254,
13257,
13315,
13371,
13406,
13409,
13457,
13459,
13462,
13503,
13506,
13534,
13537,
13592,
13605,
13608,
13661,
13723,
13784,
13849,
13921,
13986,
14039,
14099,
14102,
14155,
14204,
14215,
14218,
14245,
14269,
14313,
14373,
14424,
14443,
14445,
14447,
14450,
14510,
14573,
14590,
14592,
14660,
14729,
14748,
14751,
14797,
14799,
14856,
14863,
14922,
14948,
14958,
14990,
14993,
15046,
15056,
15059,
15105,
15148,
15197,
15225,
15281,
15284,
15335,
15385,
15434,
15491,
15494,
15540,
15595,
15598,
15652,
15680,
15683,
15725,
15727,
15791,
15793,
15796,
15852,
15854,
15918,
15981,
16042,
16093,
16096,
16145,
16147,
16180,
16183,
16223,
16272,
16315,
16353,
16394,
16413,
16416,
16470,
16482,
16484,
16487,
16566,
16578,
16581,
16645,
16647,
16688,
16707,
16718,
16744,
16780,
16831,
16834,
16890,
16944,
16947,
16973,
17045,
17103,
17116,
17118,
17166,
17168,
17201,
17204,
17244,
17293,
17335,
17380,
17427,
17430,
17484,
17496,
17498,
17501,
17561,
17599,
17602,
17670,
17672,
17724,
17737,
17811,
17858,
17872,
17874,
17915,
17917,
17972,
18007,
18032,
18063,
18101,
18158,
18163,
18198,
18251,
18304,
18320,
18323,
18379,
18433,
18436,
18483,
18514,
18517,
18560,
18563,
18598,
18608,
18610,
18613,
18675,
18708,
18711,
18761,
18763,
18787,
18820,
18860,
18862,
18865,
18908,
18941,
18944,
18986,
18988,
19021,
19060,
19075,
19084,
19091,
19118,
19135,
19173,
19212,
19220,
19222,
19262,
19304,
19358,
19366,
19368,
19416,
19432,
19440,
19442,
19445,
19493,
19496,
19550,
19595,
19598,
19652,
19655,
19709,
19755,
19831,
19834,
19893,
19951,
20001,
20004,
20087,
20108,
20126,
20128,
20131,
20193,
20196,
20253,
20297,
20332,
20334,
20387,
20423,
20468,
20500,
20577,
20601,
20627,
20636,
20654,
20657,
20727,
20749,
20752,
20824,
20857,
20879,
20908,
20941,
20944,
21005,
21023,
21026,
21065,
21162,
21194,
21212,
21214,
21242,
21341,
21361,
21385,
21447,
21455,
21468,
21534,
21569,
21571,
21574,
21617,
21620,
21647,
21649,
21652,
21690,
21693,
21737,
21795,
21798,
21856,
21886,
21889,
21936,
21987,
22018,
22020,
22022,
22025,
22084,
22145,
22157,
22160,
22234,
22236,
22274,
22290,
22303,
22305,
22362,
22364,
22367,
22436,
22460,
22462,
22527,
22580,
22582,
22648,
22673,
22675,
22685,
22738,
22806,
22830,
22840,
22897,
22941,
22944,
23009,
23011,
23014,
23047,
23050,
23088,
23101,
23104,
23156,
23176,
23179,
23235,
23264,
23267,
23315,
23361,
23411,
23441,
23443,
23494,
23542,
23589,
23608,
23611,
23666,
23679,
23724,
23726,
23761,
23790,
23793,
23855,
23888,
23891,
23956,
23980,
23982,
24015,
24031,
24034,
24086,
24138,
24141,
24186,
24202,
24205,
24257,
24309,
24339,
24342,
24385,
24401,
24437,
24473,
24503,
24538,
24568,
24631,
24671,
24701,
24756,
24780,
24836,
24878,
24916,
24926,
24928,
24965,
25041,
25079,
25081,
25141,
25143,
25147,
25217,
25242,
25295,
25333,
25335,
25410,
25484,
25545,
25547,
25611,
25614,
25686,
25719,
25721,
25790,
25848,
25897,
25926,
25949,
25956,
25992,
26036,
26091,
26112,
26133,
26171,
26178,
26199,
26257,
26264,
26288,
26331,
26338,
26340,
26372,
26441,
26467,
26528,
26601,
26646,
26669,
26703,
26753,
26804,
26835,
26905,
26956,
27009,
27041,
27077,
27087,
27115,
27162,
27197,
27269,
27328,
27372,
27434,
27493,
27496,
27550,
27607,
27664,
27722,
27731,
27734,
27777,
27787,
27790,
27848,
27877,
27880,
27914,
27962,
27988,
28018,
28021,
28065,
28114,
28136,
28139,
28169,
28209,
28218,
28267,
28295,
28323,
28341,
28343,
28346,
28405,
28438,
28441,
28489,
28491,
28496,
28509,
28536,
28538,
28617,
28660,
28662,
28674,
28708,
28717,
28763,
28779,
28781,
28791,
28793,
28869,
28894,
28896,
28923,
28949,
28959,
28966,
29013,
29074,
29090,
29129,
29145,
29209,
29274,
29302,
29316,
29363,
29427,
29443,
29486,
29522,
29538,
29598,
29641,
29671,
29706,
29708,
29710,
29747,
29773,
29801,
29841,
29869,
29893,
29946,
29962,
29964,
29966,
29969,
30030,
30077,
30080,
30137,
30140,
30196,
30199,
30241,
30251,
30253,
30256,
30329,
30389,
30409,
30412,
30493,
30495,
30542,
30544,
30547,
30618,
30691,
30738,
30741,
30806,
30831,
30833,
30880,
30882,
30928,
30930,
30940,
30999,
31013,
31016,
31081,
31113,
31116,
31157,
31195,
31200,
31228,
31268,
31282,
31295,
31297,
31301,
31363,
31396,
31451,
31453,
31527,
31596,
31671,
31682,
31684,
31758,
31808,
31811,
31861,
31863,
31872,
31908,
31916,
31978,
31997,
31999,
32003,
32071,
32104,
32162,
32164,
32235,
32281,
32283,
32343,
32368,
32370,
32444,
32494,
32497,
32548,
32550,
32559,
32595,
32603,
32666,
32685,
32687,
32722,
32725,
32794,
32813,
32816,
32888,
32890,
32962,
32974,
32992,
32995,
33026,
33029,
33041,
33050,
33087,
33090,
33138,
33141,
33156,
33174,
33207,
33209,
33263,
33282,
33284,
33287,
33330,
33333,
33404,
33447,
33449,
33452,
33519,
33522,
33568,
33592,
33602,
33604,
33644
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 33644,
"ccnet_original_nlines": 1109,
"rps_doc_curly_bracket": 0.005171800032258034,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1786838322877884,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.056652359664440155,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.41745349764823914,
"rps_doc_frac_unique_words": 0.2645776569843292,
"rps_doc_mean_word_length": 6.606266975402832,
"rps_doc_num_sentences": 248,
"rps_doc_symbol_to_word_ratio": 0.004005719907581806,
"rps_doc_unigram_entropy": 5.948054790496826,
"rps_doc_word_count": 3670,
"rps_doc_frac_chars_dupe_10grams": 0.05196947976946831,
"rps_doc_frac_chars_dupe_5grams": 0.13714167475700378,
"rps_doc_frac_chars_dupe_6grams": 0.11977726966142654,
"rps_doc_frac_chars_dupe_7grams": 0.09197773039340973,
"rps_doc_frac_chars_dupe_8grams": 0.08447101712226868,
"rps_doc_frac_chars_dupe_9grams": 0.06764280796051025,
"rps_doc_frac_chars_top_2gram": 0.010435139760375023,
"rps_doc_frac_chars_top_3gram": 0.007424210198223591,
"rps_doc_frac_chars_top_4gram": 0.009898950345814228,
"rps_doc_books_importance": -2962.463134765625,
"rps_doc_books_importance_length_correction": -2962.463134765625,
"rps_doc_openwebtext_importance": -2093.7431640625,
"rps_doc_openwebtext_importance_length_correction": -2093.7431640625,
"rps_doc_wikipedia_importance": -1419.4786376953125,
"rps_doc_wikipedia_importance_length_correction": -1419.4786376953125
},
"fasttext": {
"dclm": 0.9252504110336304,
"english": 0.5788481831550598,
"fineweb_edu_approx": 1.855117678642273,
"eai_general_math": 0.4268137216567993,
"eai_open_web_math": 0.40793025493621826,
"eai_web_code": 0.8236135840415955
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.22",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-6,266,963,552,481,710,000 | Mastering the Basics: How to Copy and Paste on MacBook with Ease
How to Copy and Paste on MacBook: A Comprehensive Guide
In today's fast-paced world, the ability to quickly copy and paste information is essential for productivity and efficiency. While most people are familiar with the concept of copying and pasting, many may be unaware of the specific steps required to perform these actions on a MacBook. In this comprehensive guide, we will cover everything you need to know about how to copy and paste on MacBook, allowing you to share valuable information and streamline your workflow with just a few clicks.
Introduction
A. Definition of Copy and Paste
Copy and paste refer to the processes of duplicating and transferring text, images, or other content from one location to another within or between documents and applications. When you copy something, you create a duplicate of the selected content in your device's memory, known as the Clipboard. Pasting the copied content places the duplicate in the desired location, leaving the original content unchanged and unharmed.
B. Importance of Copy and Paste
Copying and pasting are crucial tools for many reasons. They save time and effort by eliminating the need for manual retyping or redrawing of content, and they allow users to quickly transfer and share information. This is particularly useful when incorporating quotes, data, or images from different sources into a single document or project.
C. Importance of Knowing How to Copy and Paste on a MacBook
MacBooks are known for their distinct design and unique features, and as such, they have specific methods for basic tasks like copying and pasting. Knowing how to execute these actions on a MacBook will enable you to work efficiently, avoid frustration, and boost your productivity.
II. Basic Knowledge for Copying and Pasting on a MacBook
A. Keyboard Shortcuts
1. Command+C
The primary method for copying on a MacBook is using the keyboard shortcut “Command+C.” To do this, select the content you want to copy, then press and hold the “Command” key (represented by the ⌘ symbol) while simultaneously pressing the “C” key.
2. Command+V
To paste the copied content, move your cursor to the desired location and use the “Command+V” keyboard shortcut. Press and hold the “Command” key while simultaneously pressing the “V” key.
B. Right-click Option
Another way to copy and paste on a MacBook is by using the right-click option. Select the content you want to copy, then perform a secondary click (either by clicking with two fingers on the trackpad or by holding the “Control” key while clicking). This will open a context menu, where you can select “Copy” to copy the content. To paste, perform a secondary click at the desired location and select “Paste” from the context menu.
C. Using the Menu Bar
You can also use the menu bar at the top of your screen to copy and paste on a MacBook. Select the content you want to copy, then click on “Edit” in the menu bar and choose “Copy” from the dropdown list. To paste, click on “Edit” again and select “Paste.”
III. Advanced Techniques for Copying and Pasting on a MacBook
A. Copy and Paste Between Different Applications
You can easily copy and paste content between different applications on a MacBook. To do this, use the keyboard shortcuts, right-click option, or menu bar method to copy the desired content. Then, switch to the target application and paste using your preferred method.
B. Copy and Paste with Formatting
To copy and paste content with its original formatting, use the “Option+Shift+Command+V” keyboard shortcut. This will paste the copied content with its original appearance, rather than adopting the formatting of the surrounding text in the target location.
C. Using the Clipboard
Though the Clipboard is mainly a behind-the-scenes tool, you may need to access it directly on occasion. For example, you might want to view or clear its contents. To do this, use a third-party application like “Clipboard Manager” or “Paste” from the App Store. These applications give you greater control and visibility of the data stored in your Clipboard.
IV. Troubleshooting Common Copy and Paste Issues
A. Clipboard Issues
If you encounter problems with the Clipboard, such as copied content not properly pasting, try restarting your MacBook, as this will clear the Clipboard's memory. If the problem persists, consider using a clipboard management application to better monitor and manage your Clipboard.
B. Keyboard Shortcuts Not Working
If your keyboard shortcuts aren't working, check your keyboard input settings and ensure that the correct language is selected. Additionally, verify that the “Command” key is functioning by testing it with other shortcuts.
C. Other Software Issues
If you continue to experience copy and paste issues, the problem may be related to specific applications or system settings. Consider reinstalling the affected or resetting your MacBook's System Management Controller (SMC) to resolve the issue.
V. Conclusion
Learning how to copy and paste on a MacBook is an essential skill that will enhance your efficiency and productivity. With this comprehensive guide, you're now armed with the knowledge to navigate these crucial tasks with ease. Embrace the endless possibilities of quickly sharing and transferring valuable information with just a few clicks!
FAQs
How do I select multiple items to copy and paste on a MacBook?
To select multiple items, hold down the “Command” key while clicking on each item. Once all desired items are selected, use your preferred method to copy and paste them.
Can I copy and paste files between folders on a MacBook?
Yes, you can copy and paste files between folders using the same methods as copying and pasting text or images. Select the file(s), copy, and paste in the desired location.
What's the difference between copying and cutting on a MacBook?
Copying creates a duplicate of the selected content in the Clipboard, whereas cutting removes the content from its original location and places it in the Clipboard. To cut, use the “Command+X” keyboard shortcut.
How do I undo a paste on a MacBook?
To undo a paste, use the “Command+Z” keyboard shortcut or select “Undo” from the “Edit” menu in the menu bar.
Why isn't the right-click method working on my MacBook trackpad?
If the right-click method isn't working, check your trackpad settings in System Preferences. Ensure that “Secondary click” is enabled and set to the appropriate option (two-finger click or bottom corner click).
Can I copy and paste text between a MacBook and an iPhone or iPad?
Yes, if both devices are logged into the same Apple ID and have “Handoff” enabled in settings. This feature will allow you to copy and paste text between devices seamlessly.
Are there any alternatives to “Copy” and “Paste” on a MacBook?
Yes, there are numerous tools and features available to help you manage content on your MacBook, such as drag-and-drop for files, “Cut” and “Paste,” and third-party clipboard management applications for more advanced capabilities.
Table of Contents
Tracy C.
Tracy C.
Hi! I'm Tracy and I am the owner of this little website. I build it as a resource center to troubleshoot common tech, hardware and software issues.
My mission with Techimperatives.net is to make tech less intimidating and more approachable for all. With easy-to-understand content, troubleshooting guides an how-to articles, I am committed to demystifying intricate tech problems and providing simple, easy-to-follow solutions.
Contact me at [email protected] if you have any questions.
All Posts | {
"url": "https://techimperatives.net/mastering-the-basics-how-to-copy-and-paste-on-macbook-with-ease/",
"source_domain": "techimperatives.net",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "183835",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BBSK6NB6WVA55YNXEAWFPX32TCNX2N7M",
"WARC-Concurrent-To": "<urn:uuid:7ee331ec-4975-493e-9ca9-23a8285fee50>",
"WARC-Date": "2023-12-09T20:37:07Z",
"WARC-IP-Address": "162.159.136.54",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:N3HDRJ2G6QOLAP6YDIPIT75GN5CCTPGL",
"WARC-Record-ID": "<urn:uuid:8a100c26-f2cf-45a9-b96b-68537960173f>",
"WARC-Target-URI": "https://techimperatives.net/mastering-the-basics-how-to-copy-and-paste-on-macbook-with-ease/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7504a8a9-278a-433e-b0f8-fd2ffded59a3>"
},
"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-94\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,
65,
66,
122,
123,
617,
618,
631,
632,
664,
665,
1088,
1089,
1121,
1122,
1466,
1467,
1527,
1528,
1811,
1812,
1869,
1870,
1892,
1893,
1906,
2154,
2155,
2168,
2357,
2358,
2380,
2381,
2812,
2813,
2835,
2836,
3092,
3093,
3155,
3156,
3205,
3206,
3475,
3476,
3510,
3511,
3768,
3769,
3792,
3793,
4152,
4153,
4202,
4203,
4223,
4224,
4507,
4508,
4542,
4543,
4766,
4767,
4792,
4793,
5038,
5039,
5053,
5054,
5397,
5398,
5403,
5404,
5467,
5468,
5638,
5639,
5696,
5697,
5870,
5871,
5935,
5936,
6148,
6149,
6185,
6186,
6296,
6297,
6362,
6363,
6574,
6575,
6642,
6643,
6817,
6818,
6881,
6882,
7113,
7114,
7132,
7133,
7142,
7151,
7152,
7300,
7301,
7581,
7582,
7641,
7642
],
"line_end_idx": [
65,
66,
122,
123,
617,
618,
631,
632,
664,
665,
1088,
1089,
1121,
1122,
1466,
1467,
1527,
1528,
1811,
1812,
1869,
1870,
1892,
1893,
1906,
2154,
2155,
2168,
2357,
2358,
2380,
2381,
2812,
2813,
2835,
2836,
3092,
3093,
3155,
3156,
3205,
3206,
3475,
3476,
3510,
3511,
3768,
3769,
3792,
3793,
4152,
4153,
4202,
4203,
4223,
4224,
4507,
4508,
4542,
4543,
4766,
4767,
4792,
4793,
5038,
5039,
5053,
5054,
5397,
5398,
5403,
5404,
5467,
5468,
5638,
5639,
5696,
5697,
5870,
5871,
5935,
5936,
6148,
6149,
6185,
6186,
6296,
6297,
6362,
6363,
6574,
6575,
6642,
6643,
6817,
6818,
6881,
6882,
7113,
7114,
7132,
7133,
7142,
7151,
7152,
7300,
7301,
7581,
7582,
7641,
7642,
7651
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7651,
"ccnet_original_nlines": 111,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37063857913017273,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025016460567712784,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16392363607883453,
"rps_doc_frac_unique_words": 0.32414910197257996,
"rps_doc_mean_word_length": 4.998379230499268,
"rps_doc_num_sentences": 87,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.172338008880615,
"rps_doc_word_count": 1234,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11381322890520096,
"rps_doc_frac_chars_dupe_6grams": 0.08900777995586395,
"rps_doc_frac_chars_dupe_7grams": 0.07020103931427002,
"rps_doc_frac_chars_dupe_8grams": 0.03939688950777054,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0324254184961319,
"rps_doc_frac_chars_top_3gram": 0.046692609786987305,
"rps_doc_frac_chars_top_4gram": 0.02496756985783577,
"rps_doc_books_importance": -764.4866943359375,
"rps_doc_books_importance_length_correction": -764.4866943359375,
"rps_doc_openwebtext_importance": -374.19635009765625,
"rps_doc_openwebtext_importance_length_correction": -374.19635009765625,
"rps_doc_wikipedia_importance": -293.18798828125,
"rps_doc_wikipedia_importance_length_correction": -293.18798828125
},
"fasttext": {
"dclm": 0.3874816298484802,
"english": 0.8863136172294617,
"fineweb_edu_approx": 1.9645130634307861,
"eai_general_math": 0.6970446109771729,
"eai_open_web_math": 0.13069158792495728,
"eai_web_code": 0.20328640937805176
}
} | {
"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": "658.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-268,431,426,291,249,440 | View Single Post
Old 02-19-2009, 05:45 PM #10
Gideon
Wearer of Pants
Gideon knows the square root of minus one.Gideon knows the square root of minus one.Gideon knows the square root of minus one.Gideon knows the square root of minus one.Gideon knows the square root of minus one.Gideon knows the square root of minus one.Gideon knows the square root of minus one.Gideon knows the square root of minus one.Gideon knows the square root of minus one.Gideon knows the square root of minus one.Gideon knows the square root of minus one.
Gideon's Avatar
Posts: 1,050
Karma: 7634
Join Date: Jan 2008
Location: Norman, OK
Device: Amazon Kindle DX / iPhone
I can see it on the computer hosting it. I can't see it anywhere else. Either off network or on.
I know how to find my real IP, and when I "test it" I can see my IP as far as my Mac is concerned but I'm not sure what the computer's name ".local" or whatever might be. How would I find that out?
But when I use that IP address on anything else it comes up short.
Firewall on the Mac itself is not turned on, and while I know how to change port forwarding I am not sure which IP to tie that to. (there is a place for TCP Port, UDP Port, IP, and then secret TCP, Secret UDP)
So here's what the Port Mapping setup looks likePicture 1)
And what I'm seeing when I go to test it: (Picture 2)
Attached Thumbnails
Click image for larger version
Name: Picture 1.png
Views: 122
Size: 67.8 KB
ID: 23960 Click image for larger version
Name: Picture 2.png
Views: 95
Size: 14.0 KB
ID: 23961
Gideon is offline Reply With Quote
| {
"url": "http://www.mobileread.com/forums/showpost.php?p=359841&postcount=10",
"source_domain": "www.mobileread.com",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "11596",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HAK4EL6C2UIXREZHSZ57LI3RY4B2BI3R",
"WARC-Concurrent-To": "<urn:uuid:c6a946fd-4aa8-42ce-81c2-7cf7eaee044a>",
"WARC-Date": "2014-07-25T11:47:02Z",
"WARC-IP-Address": "67.205.70.12",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4RXB5KEHC5BMDZRTAPAPE2WNZ7K5YQ5K",
"WARC-Record-ID": "<urn:uuid:c7a52707-765b-4579-882d-ef66ae6b5b1d>",
"WARC-Target-URI": "http://www.mobileread.com/forums/showpost.php?p=359841&postcount=10",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f9fef7f7-87b9-4046-a3cc-34c4d9725ff9>"
},
"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,
17,
48,
55,
71,
534,
536,
552,
554,
567,
579,
599,
620,
654,
751,
752,
950,
951,
1018,
1019,
1229,
1230,
1289,
1343,
1363,
1394,
1395,
1415,
1426,
1440,
1483,
1484,
1504,
1514,
1528,
1540,
1577
],
"line_end_idx": [
17,
48,
55,
71,
534,
536,
552,
554,
567,
579,
599,
620,
654,
751,
752,
950,
951,
1018,
1019,
1229,
1230,
1289,
1343,
1363,
1394,
1395,
1415,
1426,
1440,
1483,
1484,
1504,
1514,
1528,
1540,
1577,
1578
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1578,
"ccnet_original_nlines": 36,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3667546212673187,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07387863099575043,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22955144941806793,
"rps_doc_frac_unique_words": 0.4724137783050537,
"rps_doc_mean_word_length": 4.144827365875244,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0.002638519974425435,
"rps_doc_unigram_entropy": 4.496504783630371,
"rps_doc_word_count": 290,
"rps_doc_frac_chars_dupe_10grams": 0.3036605715751648,
"rps_doc_frac_chars_dupe_5grams": 0.3652246296405792,
"rps_doc_frac_chars_dupe_6grams": 0.3652246296405792,
"rps_doc_frac_chars_dupe_7grams": 0.3652246296405792,
"rps_doc_frac_chars_dupe_8grams": 0.3036605715751648,
"rps_doc_frac_chars_dupe_9grams": 0.3036605715751648,
"rps_doc_frac_chars_top_2gram": 0.07321131229400635,
"rps_doc_frac_chars_top_3gram": 0.1281197965145111,
"rps_doc_frac_chars_top_4gram": 0.16472545266151428,
"rps_doc_books_importance": -106.75724792480469,
"rps_doc_books_importance_length_correction": -93.61237335205078,
"rps_doc_openwebtext_importance": -60.56658172607422,
"rps_doc_openwebtext_importance_length_correction": -60.56658172607422,
"rps_doc_wikipedia_importance": -52.49786376953125,
"rps_doc_wikipedia_importance_length_correction": -38.67819595336914
},
"fasttext": {
"dclm": 0.0198635496199131,
"english": 0.898858368396759,
"fineweb_edu_approx": 1.696951985359192,
"eai_general_math": 0.05377399921417236,
"eai_open_web_math": 0.41751933097839355,
"eai_web_code": 0.00048613999388180673
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-5,768,072,604,473,334,000 | Adding other Admin users
If you are an existing admin you have responsibility of managing the organisation, project or group that you are admin of. If you would like to share the administrator role, you can give other users admin rights via the membership panel.
There is no limit to the number of Admin users an organisation, project, group, discussion etc. can have.
Making someone an Admin user can be done by any existing Admin user of the entity (e.g. organisation or project) in question.
Only Admin users have the ability to add, accept and remove members. This includes verifying new user accounts.
To give an existing user Admin permissions:
1. Click the members panel on your organisation/group/project/etc.
Editing permissions
2. Click the persons name and click Edit in the pop out that appears.
3. Click 'No' under the Admin option to turn it to a 'Yes'.
4. (this step only applies if you are making someone an Admin user of an organisation) - select the subscription from which the new Admin user will be able to assign user licences to new users joining the platform.
5. Click 'Save' on the page.
The user will then have Admin permissions over the entity you have just edited.
Organisation Admin permissions
Giving someone Admin permissions on an organisation will give them access to the Admin area of Life QI. This will allow them to manage user records, manage user licences, create user sign-up invites, as well as create report and dashboard templates. | {
"url": "https://help.lifeqisystem.com/admin-guide/adding-other-admin-users",
"source_domain": "help.lifeqisystem.com",
"snapshot_id": "crawl=CC-MAIN-2020-10",
"warc_metadata": {
"Content-Length": "53848",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:K3RTETBS4ZD7WTRQJF5SJHEQFYA3YU4B",
"WARC-Concurrent-To": "<urn:uuid:bf50d425-123d-4742-9069-25725b8552b2>",
"WARC-Date": "2020-02-21T13:10:22Z",
"WARC-IP-Address": "104.17.117.180",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LQG4EEYOFSGSEQAYOOEJDKS47MPF4MJE",
"WARC-Record-ID": "<urn:uuid:b434f214-13a5-44e6-888c-9b82cf9fdd25>",
"WARC-Target-URI": "https://help.lifeqisystem.com/admin-guide/adding-other-admin-users",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:80171129-980e-4c38-862f-e7f053648198>"
},
"warc_info": "isPartOf: CC-MAIN-2020-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-10.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,
25,
26,
264,
265,
371,
372,
498,
499,
611,
612,
656,
657,
724,
725,
745,
746,
816,
817,
877,
878,
1093,
1094,
1123,
1124,
1204,
1205,
1236,
1237
],
"line_end_idx": [
25,
26,
264,
265,
371,
372,
498,
499,
611,
612,
656,
657,
724,
725,
745,
746,
816,
817,
877,
878,
1093,
1094,
1123,
1124,
1204,
1205,
1236,
1237,
1486
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1486,
"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.3866666555404663,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0033333299215883017,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17000000178813934,
"rps_doc_frac_unique_words": 0.47791165113449097,
"rps_doc_mean_word_length": 4.722891807556152,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.359911918640137,
"rps_doc_word_count": 249,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.040816329419612885,
"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.030612239614129066,
"rps_doc_frac_chars_top_3gram": 0.01360544003546238,
"rps_doc_frac_chars_top_4gram": 0.03401361033320427,
"rps_doc_books_importance": -129.90711975097656,
"rps_doc_books_importance_length_correction": -122.14493560791016,
"rps_doc_openwebtext_importance": -64.10889434814453,
"rps_doc_openwebtext_importance_length_correction": -64.10889434814453,
"rps_doc_wikipedia_importance": -51.339210510253906,
"rps_doc_wikipedia_importance_length_correction": -40.2519645690918
},
"fasttext": {
"dclm": 0.02550661936402321,
"english": 0.8916414380073547,
"fineweb_edu_approx": 1.3601880073547363,
"eai_general_math": 0.030595779418945312,
"eai_open_web_math": 0.095443956553936,
"eai_web_code": 0.09579408168792725
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-3,317,683,279,688,874,000 | Uploaded image for project: 'Qt'
1. Qt
2. QTBUG-22420
Mouse input calculated wrongly on Ubuntu
XMLWordPrintable
Details
• Commits:
fba5fce6723a739aec73ef5184ccb6cc425402fe
Description
If you compile Qt Creator against the current 4.8 branch you will recognize that on Ubuntu 11.10 all mouse input is forwarded to the application ~30 pixels above. That makes usage of the whole application (specifically menubars) impossible. If you compile it against the current 4.7 everything works fine. Hence this is a 4.8.0 regression.
Jason also mentioned that he can reproduce it on his Ubuntu 11.04, hence this is not related to the latest release.
To get rid of this misbehavior, unmaximize the window and maximize it again. Then mouse input works as expected. So this is probably relate to the Unity menubar.
Attachments
No reviews matched the request. Check your Options in the drop-down menu of this sections header.
Activity
People
Assignee:
kleint Friedemann Kleint
Reporter:
mkalinow Maurice Kalinowski
Votes:
0 Vote for this issue
Watchers:
4 Start watching this issue
Dates
Created:
Updated:
Resolved:
Gerrit Reviews
There are no open Gerrit changes | {
"url": "https://bugreports.qt.io/browse/QTBUG-22420",
"source_domain": "bugreports.qt.io",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "94419",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GOUHE6V3VR3EMOMHE6DH33QP6C6GZBHK",
"WARC-Concurrent-To": "<urn:uuid:34cb458f-6b63-40c6-858c-c6c07bb68192>",
"WARC-Date": "2021-10-17T03:42:37Z",
"WARC-IP-Address": "52.49.248.140",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:756OF6V3QAVBR3G2P4A2AS63TQGYWFOV",
"WARC-Record-ID": "<urn:uuid:31da3680-f565-444a-8515-e1f6ac2ed66d>",
"WARC-Target-URI": "https://bugreports.qt.io/browse/QTBUG-22420",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6dfaece9-2ac6-411b-a5b2-2ea7580e4cd8>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-88\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
33,
41,
58,
59,
100,
101,
122,
123,
135,
136,
151,
198,
199,
217,
218,
564,
565,
687,
688,
856,
857,
877,
878,
984,
985,
1004,
1005,
1024,
1025,
1047,
1084,
1106,
1146,
1165,
1199,
1221,
1261,
1262,
1282,
1283,
1306,
1329,
1353,
1354,
1385,
1386
],
"line_end_idx": [
33,
41,
58,
59,
100,
101,
122,
123,
135,
136,
151,
198,
199,
217,
218,
564,
565,
687,
688,
856,
857,
877,
878,
984,
985,
1004,
1005,
1024,
1025,
1047,
1084,
1106,
1146,
1165,
1199,
1221,
1261,
1262,
1282,
1283,
1306,
1329,
1353,
1354,
1385,
1386,
1434
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1434,
"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.290909081697464,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004545450210571289,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2454545497894287,
"rps_doc_frac_unique_words": 0.7102272510528564,
"rps_doc_mean_word_length": 5.329545497894287,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.64678430557251,
"rps_doc_word_count": 176,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.031982939690351486,
"rps_doc_frac_chars_top_3gram": 0.02558634988963604,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -92.79659271240234,
"rps_doc_books_importance_length_correction": -90.47181701660156,
"rps_doc_openwebtext_importance": -55.299644470214844,
"rps_doc_openwebtext_importance_length_correction": -55.299644470214844,
"rps_doc_wikipedia_importance": -40.33282470703125,
"rps_doc_wikipedia_importance_length_correction": -33.286399841308594
},
"fasttext": {
"dclm": 0.019283059984445572,
"english": 0.8528814911842346,
"fineweb_edu_approx": 1.023671269416809,
"eai_general_math": 0.049001339823007584,
"eai_open_web_math": 0.46219897270202637,
"eai_web_code": 0.011446359567344189
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
2,018,109,378,813,162,800 | 3
$\begingroup$
I am running a regression analysis where my primary interest is to see if the outcome differs by the group (treatment vs. control). However, I have some 80 other clinical and socio-demographic variable that could potentially contribute to the outcome (no literature or theory, selection of these covariates are exploratory). I do not want to include all of these predictors in the regression model, rather would like to screen which ones to include based on some criterion.
Is looking at the bivariate correlation between the outcome and covariates is a good strategy to select potential predictors?
Also, for interaction, can I look into the association between the group and other covariates, and include the interactions where the association is significant?
Open to suggestions. Thank you in advance!
$\endgroup$
1 Answer 1
-1
$\begingroup$
Firstly you could compute a correlation matrix with the Y (dependent) in the first column and all the Xs (predictors). Look along the first row or column and eliminate the Xs that have low pairwise correlation with Y. So that may give you an initial reduction in the number of predictor variables. Regardless of whether you do this first step or not, you should: firstly do backward step-wise regressions, followed by forward step-wise regressions. I'll assume that you want a final model with 30 predictors. So the recipe goes like this: Subtract the mean of each variable (including Y) from the raw data, so that until you settle on a final model you needn't concern yourself about an intercept term.
1) Regress Y an all 80 Xs. Compute the t-stats for all 80 coefficients. Make note of the variable with the lowest t-stat and the R-square achieved. Then regress Y on the Xs again but this time exclude the predictor with the lowest t-stat from the previous regression. Again make note of of the variable with the lowest t-stat and the R-square achieved. The third regression will be run with 78 predictors having again eliminated the variable with the lowest t-stat from the previous regression. Repeat until you have a regression with only one predictor.
2) Now work in the opposite direction. Regress Y on one X variable, trialing all 80 predictors and select the X that gives you the highest R-square. Again keep track of your variables included and excluded and the R-square. The the second regression will include the first X selected and all of the remaining 79 are trialed to find the two predictor regression with the highest R-square. Compare this to the two predictor regression R-square achieved in 1) above. If you achieved a higher R-square in the backward step-wise regression then this is selected as the best variable selection moving forward. Adjust your included/excluded predictor schedule accordingly. Then the third regression will be the regression that gives you the highest R-square from the 78 Xs not included so far, and again compare to results given in 1). Repeat until you have a regression with your target 30 predictors.
The recipe given above almost invariably gives you the best variable selection. 1) and 2) may give similar selections but often the forward step-wise regressions in step 2) will provide some improvement.
$\endgroup$
1
• $\begingroup$ Univariate screening and stepwise variable selection do not represent acceptable statistical practice because of the complete unreliability of the result, not to mention ruination of standard errors. $\endgroup$ Commented Sep 7, 2023 at 11:14
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/362539/how-to-chose-covariates-to-adjust-for-in-a-regression-analysis",
"source_domain": "stats.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "159972",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D5M4G5VCDT6HZAEIQQHQ7YVN3QG2XKFD",
"WARC-Concurrent-To": "<urn:uuid:5cc8e8c2-16f5-4de1-9dd3-53a62c03cc85>",
"WARC-Date": "2024-09-15T09:14:38Z",
"WARC-IP-Address": "172.64.144.30",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IQCLBT5YBJOWGNPO66W7AVECH45RLPC4",
"WARC-Record-ID": "<urn:uuid:77ef3e2b-0c62-4044-a514-fa37b0b36ad9>",
"WARC-Target-URI": "https://stats.stackexchange.com/questions/362539/how-to-chose-covariates-to-adjust-for-in-a-regression-analysis",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ce0871d2-fd49-4c4e-8261-f1cec7b62cf7>"
},
"warc_info": "isPartOf: CC-MAIN-2024-38\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-225\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
16,
17,
491,
492,
618,
619,
781,
782,
825,
826,
838,
839,
850,
851,
854,
868,
869,
1572,
1573,
2128,
2129,
3025,
3026,
3230,
3231,
3243,
3245,
3506,
3507,
3519,
3520,
3636,
3637
],
"line_end_idx": [
2,
16,
17,
491,
492,
618,
619,
781,
782,
825,
826,
838,
839,
850,
851,
854,
868,
869,
1572,
1573,
2128,
2129,
3025,
3026,
3230,
3231,
3243,
3245,
3506,
3507,
3519,
3520,
3636,
3637,
3727
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3727,
"ccnet_original_nlines": 34,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4191780686378479,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030136989429593086,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17534247040748596,
"rps_doc_frac_unique_words": 0.4115702509880066,
"rps_doc_mean_word_length": 4.950413227081299,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.968090534210205,
"rps_doc_word_count": 605,
"rps_doc_frac_chars_dupe_10grams": 0.03472454100847244,
"rps_doc_frac_chars_dupe_5grams": 0.12454090267419815,
"rps_doc_frac_chars_dupe_6grams": 0.10851418972015381,
"rps_doc_frac_chars_dupe_7grams": 0.08547578752040863,
"rps_doc_frac_chars_dupe_8grams": 0.06343907117843628,
"rps_doc_frac_chars_dupe_9grams": 0.03472454100847244,
"rps_doc_frac_chars_top_2gram": 0.0140233701094985,
"rps_doc_frac_chars_top_3gram": 0.01736227050423622,
"rps_doc_frac_chars_top_4gram": 0.024040069431066513,
"rps_doc_books_importance": -357.7489929199219,
"rps_doc_books_importance_length_correction": -357.7489929199219,
"rps_doc_openwebtext_importance": -176.03579711914062,
"rps_doc_openwebtext_importance_length_correction": -176.03579711914062,
"rps_doc_wikipedia_importance": -183.7068634033203,
"rps_doc_wikipedia_importance_length_correction": -183.7068634033203
},
"fasttext": {
"dclm": 0.11086207628250122,
"english": 0.9100253582000732,
"fineweb_edu_approx": 1.5259184837341309,
"eai_general_math": 0.6127173900604248,
"eai_open_web_math": 0.38029593229293823,
"eai_web_code": 0.10150319337844849
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-6,982,023,364,923,333,000 | Razer Mamba Wireless Bedienungsanleitung
Razer Mamba Wireless
8.1 · 1
PDF Bedienungsanleitung
· 20 Seiten
Englisch
BedienungsanleitungRazer Mamba Wireless
Razer Mamba_MultiSku_MasterGuide
Rev: 090102
Open Size : 204mm x 81mm with customed diecut
Diecut : Razer Blade box
Printing : 2C x 2C (Grayscale & Pantone 802C),
: Only Page 10 - 3C (Grayscale +
Pantone 802C + Pantone Red 032C)
Pages : 36 pages
Material : (Cover) 230 gsm woodfree paper + blind emboss logo
(Contents) 105 gsm artpaper with matt varnish
Finishing : Trim & fold to size 102mm x 81mm
Binding : Saddle-stitch
IMPORTANT NOTE: Printer are require to paginate and product films accordingly to the page number as shown on FA.
MASTER GUIDE
Wireless Laser Gaming Mouse
www.razerzone.com | 3
2 | For Gamers. by Gamers.
www.razerzone.com | 76 | For Gamers. by Gamers.
www.razerzone.com | 98 | For Gamers. by Gamers.
www.razerzone.com | 5
4 | For Gamers. by Gamers.
www.razerzone.com | 11
10 | For Gamers. by Gamers.
www.razerzone.com | 13
12 | For Gamers. by Gamers.
www.razerzone.com | 15
14 | For Gamers. by Gamers.
www.razerzone.com | 17
16 | For Gamers. by Gamers.
www.razerzone.com | 19
18 | For Gamers. by Gamers.
www.razerzone.com | 21
20 | For Gamers. by Gamers.
www.razerzone.com | 23
22 | For Gamers. by Gamers.
www.razerzone.com | 25
24 | For Gamers. by Gamers.
www.razerzone.com | 27
26 | For Gamers. by Gamers.
www.razerzone.com | 29
28 | For Gamers. by Gamers.
www.razerzone.com | 31
30 | For Gamers. by Gamers.
www.razerzone.com | 33
32 | For Gamers. by Gamers.
www.razerzone.com | 35
34 | For Gamers. by Gamers.
36 | For Gamers. by Gamers.
contents
02 Introduction02 Package Contents 02 System Requirements03 Message from Razerguy04 Key Features06 Installation / Registration / Technical Support11 Configuring your Razer Mamba23 Using your Razer Mamba28 Safety and Maintenance30 Legalese33 FCC Declaration of Conformance33 FCC Caution34 WEEE informationpackaGe contents Razer Mamba Gaming Mouse Charging Dock Rechargeable Lithium-Ion Polymer Battery with Battery Door USB Cable Certificate of Authenticity Quick Start Guide Master Guidesystem requirements PC with USB port Windows XP / x64 / Vista / Vista64 Internet connection (for driver installation) 35MB of free hard disk spaceThe Razer Mamba™ wireless gaming mouse is engineered to free you from your reins while achieving the highest gaming standards within an impeccably designed shell. Combine that with a system that allows the flexibility of wired play and onboard memory that lets you bring your settings wherever you go, the Razer Mamba is the epitome of gaming mouse nirvana.Now you are Free to Frag.
Wireless Laser Gaming Mouse
installation / reGistration / technical supportkey FeaturesDefault button assignmentsBATTERY/SENSITIVITY STAGE INDICATOR BEHAVIORThe Razer Mamba has a Battery/Sensitivity LED Indicator on its left side, which displays the status of battery life/sensitivity stage.configuring your razer mambaRAZER SYNAPSE™ ONBOARD MEMORYWith Razer Synapse, all settings will be saved on the profile selected and will apply on another computer even without the Razer™ Configurator installed. (Note: On-The-Fly Sensitivity™ requires the Razer Mamba driver to be installed)ASSIGN BUTTONS TABIn the Assign Buttons tab, you can assign various functions to each of the buttons based on your own preferences. The following functions are possible:CLICKPerform a normal mouse click.
MENU
Open a context-sensitive menu.UNIVERSAL SCROLLINGActivate universal scrolling by clicking and holding the assigned button. Drag your Razer Mamba to scroll in the direction of the mouse movement.DOUBLE CLICKPerform a double click with the assigned button.MACROIf the button function or key is not listed, or if you would like to assign a macro to a button, select MACRO from the dropdown menu. In addition, all saved macros will be shown on a sub dropdown menu for quick selection when you mouse over the MACRO option.PROFILE SETTINGSSwitch to a profile on the fly and immediately load all your preferred mouse settings. When you select PROFILE SETTINGS from the dropdown menu, a sub-menu will appear and allow you to choose desired profile to switch to.FORWARDIssue a “Forward” command in Windows Explorer / Internet Explorer.BACKWARDIssue a “Back” command in Windows Explorer / Internet Explorer.ON-THE-FLY SENSITIVITYEnable change of sensitivity settings on the fly without the need to enter the configuration menu.SINGLE KEYActivate a key on your keyboard.SCROLL UPScroll up the page you are currently viewing.SCROLL DOWNScroll down the page you are currently viewing.BUTTON OFFDisable any function on the assigned button.BATTERY LIFE INDICATOR BEHAVIOR- 100% Battery3 green lit LEDs ( )- 70% Battery2 green lit LEDs ( )- 30% Battery1 green lit LED ( )- 5% Battery1 green blinking LED ( )SENSITIVITY STAGE INDICATOR BEHAVIOR- Sensitivity Stage 12 green and 1 red lit LEDs ( )- Sensitivity Stage 21 green and 2 red lit LEDs ( )- Sensitivity Stage 33 red lit LEDs ( )- Sensitivity Stage 42 red and 1 green lit LEDs ( )- Sensitivity Stage 51 red and 2 green lit LEDs ( )ADJUST PERFORMANCE TABCURRENT SENSITIVITYSensitivity is how much your cursor moves on the screen in relation to your physical movement of the mouse. A higher sensitivity value would translate to less physical movement of the mouse, and vice versa.In the ADJUST PERFORMANCE tab, the current sensitivity of your Razer Mamba in dots per inch (DPI) is indicated and can be easily adjusted by moving the arrow along the slider in steps of 100DPI. For greater flexibility in adjustment, you can select the ENABLE INDEPENDENT X-Y SENSITIVITY option and move the individual X and Y arrows along the slider. To display the On-The-Fly Sensitivity indicator onscreen whenever you make changes on the fly, select the ENABLE ON-THE-FLY SENSITIVITY ONSCREEN DISPLAY option.ACCELERATIONAcceleration allows you to increase your physical mouse movement to onscreen cursor movement ratio based on the rate of change of your movement speed. The higher the value of acceleration, the higher the ratio will be. You can activate acceleration by checking the ENABLE ACCELERATION box and moving the arrow along the slider.POLLING RATEThe polling rate determines the time intervals that the PC retrieves data from your mouse. A higher value would mean shorter intervals and therefore less latency. You can switch between 125Hz, 500Hz and 1000Hz by clicking on the individual polling rate buttons.MANAGE PROFILES TAB
A profile allows you to store your various mouse settings such as sensitivity, button assignments and macros as a single group for your convenience.In the Manage Profiles tab, you can create and launch customized profiles based on the application you have activated. a. Profile: Indicates the profile number b. Profile Name: Double-click this field to enter a profile name of your choice.c. Application: Double-click this field to open up directory browsing. Select the executable file of the program you want the profile to be tied to. d. Auto Switch: Select this option to activate the current profile as an On-The-Fly profile.With Razer Synapse, you can save up to five profiles on your Razer Mamba. If you require more profiles and do not wish to delete the existing profiles, simply export the existing profiles to your hard disk and import them back as and when needed.
Right-clicking inside the Manage Profile tab allows you to quickly access a list of extra commands.MANAGE MACROS TABA macro is a sequence of keystrokes executed in a particular order and timing. It allows you to execute a chain of commands, with the press of just one button, to optimize your gameplay.In the Manage Macros tab, you can record macros of up to 500 keystrokes (dependent on length of delays). These macros can also be imported and exported onto your hard disk for future usage.LIGHTING AND MAINTAINENCELIGHTINGTurn on/off the charging dock light, as well as the scroll button and battery indicator lights on the Razer Mamba.MAINTENANCEUpdate the Razer driver and firmware software by clicking on the CHECK FOR UPDATES button. This will connect you to www.razersupport.com for the latest driver/firmware downloads.using your razer mambaSETTING SENSITIVITY STAGESA sensitivity stage is a preset sensitivity value you can swap to on the fly. This means you can change to your preferred sensitivity instantly by toggling between sensitivity stages. To preset a sensitivity stage:1. Load the Razer configurator and click on the Adjust Performance tab.2. Click on the SENSITIVITY STAGE button. A Sensitivity Stage Settings pop up box will appear.3. Select the number of sensitivity stages needed.4. Click on the stage you would like to preset and adjust using the arrow on the slider below.5. Click APPLY when done. To switch between different sensitivity stages, simply assign the Sensitivity Stage Up and Sensitivity Stage Down functions to the desired buttons. (Default: Mouse buttons 6 and 7)CREATING MACROS A. Load the Razer configurator and click on the Manage Macros tab.B. Click RECORD to start creating a macro.C. Type out the desired sequence of keystrokes, then click STOP to end the recording.D. Right-click on the recorded keystroke to access more options.E. You can also insert additional commands by clicking on the ADVANCED button.F. Click APPLY when done.ON-THE-FLY SENSITIVITYOn-The-Fly Sensitivity is a feature that allows you to fine-tune your sensitivity settings even in the midst of gameplay. If On-The-Fly Sensitivity has been assigned to a button, pressing that assigned button and moving the scroll wheel will produce a bar at the lower right-hand corner of your screen. While this feature allows you to dynamically adjust your sensitivity settings, it is accessible only if the driver is installed.
CHARGING THE RAZER MAMBAThe Razer Mamba can be charged both during wired mode and when placed on the Charging Dock in wireless mode.During charging, the battery indicator on the mouse will blink. When charging in wireless mode, the Charging Dock will emit a pulsing glow. Once the battery is fully charged, the battery indicator will be fully lighted up and the Charging Dock will cease to pulse.For best results, please charge the battery fully the first time you use the Razer Mamba. A
depleted battery will be fully charged in about three hours. If the mouse has not been used
for an extended period, the battery might need to be recharged before usage.The Razer Mamba requires a USB connection that is able to supply sufficient power during battery charging process. The battery charging process of the Razer Mamba may be affected if connected to a non-powered USB hub or non-powered USB ports found on certain keyboards and other peripheralsWhen in doubt, it is preferable to connect the Razer Mamba directly to the USB port found on the CPU unit of your computer system.safety and maintenanceSAFETY GUIDELINES
In order to achieve maximum safety while using
your mouse, we suggest that you adopt the
following guidelines:
1. Avoid looking directly into the laser beam of
your mouse or pointing the beam in any one
else’s eye. Note that the infrared beam is NOT
visible to the naked human eye and is set on an
always-on mode.
2. Should you have trouble operating the mouse
properly and troubleshooting does not work,
unplug the device and contact the Razer hotline
or go to www.razerzone.com for support. Do
not attempt to service or fix the device yourself
at any time.
3. Do not take apart the mouse (doing so will also
void your warranty) and do not attempt to
service it yourself or operate it under abnormal
current loads.
4. Keep your mouse away from liquid, humidity or
moisture. Operate your mouse only within the
specified temperature range of 0˚C(32˚F) to
40˚C(104˚F). Should you operate it in a
temperature that is beyond this range, unplug
and switch off the device in order to let the
temperature stabilize within the optimal
temperature range.
COMFORT
Here are some tips to ensure that you are
comfortable while using your mouse. Research
has shown that long periods of repetitive motion,
improper positioning of your computer
peripherals, incorrect body position, and poor
habits may be associated with physical discomfort
and injury to nerves, tendons, and muscles. Please
follow these guidelines to ensure comfortable use
of your mouse and avoid injury.
1. Position your keyboard and monitor directly in
front of you with your mouse next to it. Place
your elbows next to your side, not too far away
and your mouse within easy reach.
2. Adjust the height of your chair and table so
that the keyboard and mouse are at or below
elbow height.
3. Keep your feet well supported, posture straight
and your shoulders relaxed.
4. During gameplay, relax your wrist and keep it
straight. If you do the same tasks with your
hands repeatedly, try not to bend, extend or
twist your hands for long periods.
5. Do not rest your wrists on hard surfaces for
long periods. Use a wrist support such as
Razer’s gel-filled eXactRest™ to support your
wrist while gaming.
6. Customize the buttons on your mouse to suit
your style of gaming in order to minimize
repetitive or awkward motions while gaming.
7. Make sure that your mouse fits comfortably in
your hands.
8. Do not sit in the same position all day. Get up,
step away from your desk and do exercises to
stretch your arms, shoulders, neck and legs.
9. If you should experience any physical discomfort
while using your mouse, such as pain,
numbness, or tingling in your hands, wrists,
elbows, shoulders, neck or back, please consult
a qualified medical doctor immediately.
MAINTENANCE AND USE
The Razer Mamba is equipped with a laser sensor,
which has a tracking beam that is invisible to the
naked human eye. There is a little regular
maintenance to keep the Razer Mamba in optimum
condition. Once a month we recommend you unplug
the mouse from the USB port and clean the lens
below the Razer Mamba with a soft cloth or cotton
swab. Use a little warm water but no soap or harsh
cleaning agents.
To get the ultimate experience in movement and
control, we highly recommend a premium mousing
surface from Razer. Some surfaces will cause
undue wear on the feet requiring constant
care and eventual replacement.
Do note that the sensor of the Razer Mamba
is ‘tuned’ or optimized especially for the
Razer mousing surfaces. This means that the
sensor has been tested extensively to
confirm that the Razer Mamba reads and
tracks best on Razer mousing surfaces.
Other premium mousing surfaces from
companies like Everglide™ may work just as
well.
BATTERY
Razer Mamba contains an internal,
lithium-ion polymer rechargeable battery. In
general, the life expectancy of such batteries
is dependent upon usage. Heavy daily usage
use will result in shorter battery life. Casual
use will extend battery life. If you suspect
that the lithium-ion polymer rechargeable
battery inside the Razer Mamba may be
drained (has a low charge), try charging it. If
the battery does not recharge after several
attempts, it may be non-operational. Please
dispose the battery promptly.
BATTERY WARNING
Caution: risk of explosion and personal injury if
batteries are replaced by incorrect type. Do not
open, mutilate, or expose to conducting materials
(metal), moisture, liquid, fire, or heat. Doing so
may cause batteries to leak or explode, resulting
in personal injury. Dispose of spent, leaking or
damaged batteries according to manufacturer
instructions and local laws. Do not use or charge
batteries (lithium-polymer rechargeables) if leaking,
discolored, or deformed. Do not mix battery types. Do
not charge alkaline batteries. Do not leave
rechargeable batteries discharged or unused for
extended periods. Battery life varies with usage. When
replacing, remove all spent batteries, and do not mix
old batteries with new. When device is not in used for
extended periods, remove batteries to avoid leakage
and store away from children in a cool, dry place at
room temperature.
CLASS 1M LASER PRODUCTS
International standards and safety. INVISIBLE LASER
RADIATION: DO NOT VIEW DIRECTLY WITH OPTICAL
INSTRUMENTS. Class 1m laser products comply with
International Standard IEC 60825-1 Ed 2: 2007, Class
1M Laser Product Invisible
SAFETY AND USAGE GUIDELINES FOR LASER PRODUCTS
Do not direct laser beam toward eye. For Class 1M
laser products, viewing laser output with optical
instruments (e.g., eye loupes, magnifiers, and
microscopes) within a distance of 100mm may posed
an eye hazard.
legalese COPYRIGHT INFORMATION
©2009 Razer USA Ltd. All Rights Reserved.
Razer™, the Razer Triple-Headed Snake
logo, the Razer distressed word logo, Mamba™ and
other trademarks contained herein are the property of
Razer USA Ltd and/or its affiliated or associated
companies, registered in the United States or other
countries. All other trademarks are the property of their
respective owners. Actual product may differ from
pictures.
Razer™ assumes no responsibility for any errors that
may appear in this software, manual or help file.
Information contained herein is subject to change
without notice.
Razer™ may have patents, patent applications,
trademarks, copyrights, trade secrets or other property
rights, intellectual and otherwise concerning the
product and subject matter in this manual and software.
Except as is provided in any written license agreement
provided by Razer™, furnishing of this manual does not
give you a license to any such patents, trademarks,
copyrights or other intellectual property rights, whether
registered or otherwise. Patent Pending.
SOFTWARE LICENSE AGREEMENT (‘AGREEMENT’)
Razer™ IS WILLING TO LICENSE THE ENCLOSED
SOFTWARE TO YOU ONLY ON THE CONDITION THAT YOU
ACCEPT ALL OF THE TERMS CONTAINED IN THIS
LICENSE AGREEMENT. This is a legal agreement
between you (either an individual end-user, corporate
entity or any other entity whatsoever) and Razer™. By
installing, uploading, copying or utilizing in any way the
software, you are agreeing to be bound by the
terms and conditions of this Agreement. If you do
not agree to the terms of this Agreement, do not
install the software and promptly return the
software package and other items that are part of
this product in their original package with your
payment receipt to your point of purchase for a full
refund.
GRANT OF LICENSE
Razer™ grants you a non-exclusive, revocable
license to use one copy of the enclosed software
program, licensed and not sold to you,
("Software") on one computer only with the Razer
™ product you have purchased. No other rights
are granted. The Software is in use if it is installed,
including but not limited to loaded on the
computer's permanent or temporary memory. For
backup purposes only, you may make one copy of
the Software for your own use. You must include
on the backup copy all copyright and other notices
included in the Software as supplied by Razer™.
Installation on a network server for the sole
purpose of your internal distribution of the
Software is permitted only if you have purchased
an individual Software package or concurrent
dedicated license for each networked computer to
which the Software is distributed.
RESTRICTIONS
Razer™ retains full ownership of the Software. You
shall not directly and/or indirectly attempt to
decompile, disassemble, reverse-engineer, or
modify the Software licensed to you in any way
except as allowed by law. You may not transmit the
Software over a network (except as expressly
permitted above) or electronically using any means.
You may not directly and/or indirectly transfer the
Software except upon a permanent transfer of the
enclosed Razer™ product provided that all Software
updates are included in the transfer, you do not
retain a copy of the Software, and the transferee
agrees to be bound by the terms and conditions in
this license. Upon any violation of any of the
provisions of the Agreement, your rights to use the
software shall automatically terminate and all
copies of the Software must be returned to Razer™
or destroyed.
LIMITATION OF LIABILITY
The warranties set forth in this agreement replace
and/or supersede all other warranties and your
remedies for breach of warranty are expressly
limited to those herein set forth. Razer™ expressly
disclaims all other warranties to the extent allowed
by law including, but not limited to, the implied
warranties of merchantability, fitness for a
particular purpose and non-infringement of
third-party rights with respect to the
documentation, software (including patches and/or
updates) and hardware. No Razer™ supplier,
dealer, agent, or employee is authorized to make
any modification, extension or alteration of the
warranty or to substitute products or services,
lost profits, loss of information or data, or any
other special, indirect, consequential or
incidental damages arising in any way out of the
distribution of, sale of, resale of, use of, or
inability to use any product or software subject to
warranty herein set forth. In no event will Razer™
be liable for any special, incidental, indirect or
consequential damages whatsoever.
COSTS OF PROCUREMENT PRODUCT OR SERVICE
For the avoidance of doubt, in no event will Razer
™ be liable for any costs of procurement unless it
has been advised of the possibility of such
damages, and in no case shall Razer™ be liable
for any costs of procurements liability exceeding
the actual money paid for the products subject to
warranty at issue.
In the event some jurisdictions do not allow the
limitation of implied warranties or liability for
incidental, consequential, special, or indirect
damages, the above limitation may not apply. The
above limitations will not apply in case of
personal injury where and to the extent that
applicable laws require such liability.
U.S. GOVERNMENT RESTRICTED RIGHTS
The Software is provided to the U.S. government
only with restricted rights and limited rights. Use,
duplication, or disclosure by the U.S. Government
is subject to restrictions set forth in 48 C.F.R.
2.101 (October 1995), consisting of '"Commercial
Computer Software" and 'Commercial Computer
Software Documentation as such terms are used
in 48C.F.R. 12.212 (September 1995), and in FAR
Sections 52-227-14 and 52-227-19 r DFARS
Section 52-227-7013 ©(1) (ii), or their
successors, as applicable. Consistent with 48
C.F.R. 12.512 and 48 C.F.R. 227-7202-1 through
27-7204-4 (June 1995), or any successor
regulations, this Software is provided to U.S.
Government users pursuant to the terms and
conditions herein.
fcc declaration of conformance
This equipment has been tested and found to
comply with the limits for a Class B digital device,
pursuant to part 15 of the FCC Rules. These
limits are designed to provide reasonable
protection against harmful interference in a
residential installation. This equipment
generates, uses and can radiate radio frequency
energy and, if not installed and used in
accordance with the instructions, may cause
harmful interference to radio communications. However,
there is no guarantee that interference will not occur in a
particular installation. If this equipment does cause
harmful interference to radio or television reception,
which can be determined by turning the equipment off
and on, the user is encouraged to try to correct the
interference by one or more of the following measures:
Reorient or relocate the receiving antenna.
Increase the separation between the equipment and the
receiver.
Connect the equipment into an outlet on a circuit different
from that to which the receiver is connected.
Consult the dealer or an experienced radio TV technician
for help.
For more information, refer to the online help system on
www.razerzone.com
FCC Caution
Any changes or modifications not expressly approved by
the party responsible for compliance could void the user's
authority to operate this equipment.
This device complies with Part 15 of the FCC Rules.
Operation is subject to the following two conditions:
(1) This device may not cause harmful interference, and
(2) this device must accept any interference received,
including interference that may cause undesired
operation.
This device and its antenna(s) must not be co-located or
operating in conjunction with any other antenna or
transmitter.
weee inFormation
ENGLISH
Correct Disposal of This Product (Waste Electrical & Electronic Equipment)
(Applicable in the European Union and other European countries with separate collection systems)
This marking shown on the product or its literature, indicates that it should not be disposed with other household wastes at the end of
its working life. To prevent possible harm to the environment or human health from uncontrolled waste disposal, please separate this
from other types of wastes and recycle it responsibly to promote the sustainable reuse of material resources. Household users should
contact either the retailer where they purchased this product, or their local government office, for details of where and how they can
take this item for environmentally safe recycling. Business users should contact their supplier and check the terms and conditions of
the purchase contract. This product should not be mixed with other commercial wastes for disposal.
FRANÇAIS
Comment éliminer ce produit (déchets d’équipements électriques et électroniques)
(Applicable dans les pays de l’Union Européen et aux autres pays européens disposant de systémes de collecte sélective)
Ce symbole sur le produit ou sa documentation indique qu’il ne doit pas être éliminé en fin de vie avec les autres déchets ménagers.
L’élimination incontrôlée des déchets pouvant porter préjudice à l’environnement ou à la santé humaine, veuillez le séparer des autres
types de déchets et le recycler de façon responsable. Vous favoriserez ainsi la réutilisation durable des ressources matérielles. Les
particuliers sont invités à contacter le distributeur leur ayant vendu le produit ou à se renseigner auprès de leur mairie pour savoir où et
comment ils peuvent se débarrasser de ce produit afin qu’il soit recyclé en respectant l’environnement. Les entreprises sont invitées à
contacter leurs fournisseurs et à consulter les conditions de leur contrat de vente. Ce produit ne doit pas être éliminé avec les autres
déchets commerciaux.
ITALIANO
Corretto smaltimento del prodotto (rifiuti elettrici ed elettronici)
(Applicabile in i paesi dell’Unione Europea e in quelli con sistema di raccolta differenziata)
Il marchio riportato sul prodotto o sulla sua documentazione indica che il prodotto non deve essere smaltito con altri rifiuti domestici al
termine del ciclo di vita. Per evitare eventuali danni all'ambiente o alla salute causati dall'inopportuno smaltimento dei rifiuti, si invita
l'utente a separare questo prodotto da altri tipi di rifiuti e di riciclarlo in maniera responsabile per favorire il riutilizzo sostenibile delle
risorse materiali. Gli utenti domestici sono invitati a contattare il rivenditore presso il quale è stato acquistato il prodotto o l'ufficio
locale preposto per tutte le informazioni relative alla raccolta differenziata e al riciclaggio per questo tipo di prodotto. Gli utenti
aziendali sono invitati a contattare il proprio fornitore e verificare i termini e le condizioni del contratto di acquisto. Questo prodotto non
deve essere smaltito unitamente ad altri rifiuti commerciali.
DEUTSCH
Korrekte Entsorgung dieses Produkts (Elektromüll)
(Anzuwenden in den Ländern der Europäischen Union und anderen europäischen Ländern mit einem separaten Sammelsystem)
Die Kennzeichnung auf dem Produkt bzw. auf der dazugehörigen Literatur gibt an, dass es nach seiner Lebensdauer nicht zusammen
mit dem normalen Haushaltsmüll entsorgt werden darf. Entsorgen Sie dieses Gerät bitte getrennt von anderen Abfällen, um der
Umwelt bzw. der menschlichen Gesundheit nicht durch unkontrollierte Müllbeseitigung zu schaden. Recyceln Sie das Gerät, um die
nachhaltige Wiederverwertung von stofflichen Ressourcen zu fördern. Private Nutzer sollten den Händler, bei dem das Produkt
gekauft wurde, oder die zuständigen Behörden kontaktieren, um in Erfahrung zu bringen, wie sie das Gerät auf umweltfreundliche
Weise recyceln können. Gewerbliche Nutzer sollten sich an Ihren Lieferanten wenden und die Bedingungen des Verkaufsvertrags
konsultieren. Dieses Produkt darf nicht zusammen mit anderem Gewerbemüll entsorgt werden.
ESPAÑOL
Eliminación correcta de este producto (material eléctrico y electrónico de descarte)
(Aplicable en la Unión Europea y en países europeos con sistenmas de recogida selectiva de residuos)
La presencia de esta marca en el producto o en el material informativo que lo acompaña, indica que al finalizar su vida útil no deberá
eliminarse junto con otros residuos domésticos. Para evitar los posibles daños al medio ambiente o a la salud humana que representa
la eliminación incontrolada de residuos, separe este producto de otros tipos de residuos y recíclelo correctamente para promover la
reutilización sostenible de recursos materiales. Los usuarios particulares pueden contactar con el establecimiento donde adquirieron
el producto, o con las autoridades locales pertinentes, para informarse sobre cómo y dónde pueden llevarlo para que sea sometido a
un reciclaje ecológico y seguro. Los usuarios comerciales pueden contactar con su proveedor y consultar las condiciones del contrato
de compra. Este producto no debe eliminarse mezclado con otros residuos comerciales.
PORTUGUÊS
Eliminação Correcta Deste Produto (Resíduo de Equipamentos Eléctricos e Electrónicos)
Esta marca, apresentada no produto ou na sua literatura indica que ele não deverá ser eliminado juntamente com os resíduos
domésticos indiferenciados no final do seu período de vida útil. Para impedir danos ao ambiente e à saúde humana causados pela
eliminação incontrolada de resíduos deverá separar este equipamento de outros tipos de resíduos e reciclá-lo de forma responsável,
para promover uma reutilização sustentável dos recursos materiais. Os utilizadores domésticos deverão contactar ou o
estabelecimento onde adquiriram este produto ou as entidades oficiais locais para obterem informações sobre onde e de que forma
podem levar este produto para permitir efectuar uma reciclagem segura em termos ambientais. Os utilizadores profissionais deverão
contactar o seu fornecedor e consultar os termos e condições do contrato de compra. Este produto não deverá ser misturado com
outros resíduos comerciais para eliminação.
DANSK
Korrekt affaldsbortskaffelse af dette produkt (elektrisk & elektronisk udstyr)
Mærket på dette produkt eller i den medfølgende dokumentation betyder, at produktet ikke må bortskaffes sammen med almindeligt
husholdningsaffald efter endt levetid. For at undgå skadelige miljø- eller sundhedspåvirkninger på grund af ukontrolleret
affaldsbortskaffelse skal dette produkt bortskaffes særskilt fra andet affald og indleveres behørigt til fremme for bæredygtig
materialegenvinding. Hjemmebrugere bedes kontakte forhandleren, hvor de har købt produktet, eller den lokale myndighed for oplysning
om, hvor og hvordan de kan indlevere produktet med henblik på miljøforsvarlig genvinding. Erhvervsbrugere bedes kontakte leverandøren
og læse betingelserne og vilkårene i købekontrakten. Dette produkt bør ikke bortskaffes sammen med andet erhvervsaffald.
POLISH
Prawidowe usuwanie produktu (Zużyty sprzęt elektryczny i elektroniczny)
Oznaczenie umieszczone na produkcie lub w odnoszących się do niego tekstach wskazuje, ×e produktu po up ywie okresu u×ytkowania nie
nale×y usuwać z innymi odpadami pochodzącymi z gospodarstw domowych. Aby uniknąć szkodliwego wpływu na środowisko naturalne i
zdrowie ludzi wskutek niekontrolowanego usuwania odpadów, prosimy o oddzielenie produktu od innego typu odpadów orazodpowiedzialny
recykling w celu promowania ponownego u×ycia zasobów materialnych jako staej praktyki. W celu uzyskania informacji na temat miejsca i
sposobu bezpiecznego dla śdowiska recyklingu tegoproduktu u×ytkownicy w gospodarstwach domowych powinni skontaktowa ć się z
punktem sprzeda×y detalicznej, w którym dokonali zakupu produktu, lubz organem wadz lokalnych. U×ytkownicy w firmach powinni
skontaktowa ć się ze swoim dostawcà i sprawdzić warunki umowy zakupu. Produktu nie nale×y usuwać razem z innymi odpadami
komercyjnymi.
GREEK
PAGE 10 - 3C (GRAYSCALE + PANTONE 802C + PANTONE RED 032C)
G
F
H
A B
C
D
E
O
R
L
O
A Mouse Button 1 – ClickB Mouse Button 2 – MenuC Mouse Button 3 – Scroll Wheel and ButtonD Mouse Button 6 – Sensitivity Stage UpE Mouse Button 7 – Sensitivity Stage DownF Battery / Sensitivity Stage IndicatorG Mouse Button 5 – Forward H Mouse Button 4 – BackwardI Razer Precision™ 3.5G Laser SensorJ Power On / Off SwitchK Pairing ButtonL Rechargeable BatteryM Ultraslick™ Teflon® Feet N Cable Lock / Unlock Button
O Connector Jack for Mini-USB End of Cable (Wired Mode / Battery Charging)
P Battery Charging Connector Q Pairing Button
R Connector Jack for Mini-USB End of Cable (Wireless Mode)
For best results, please charge the battery fully the first time you use the Razer Mamba. A depleted battery will be fully charged in about three hours.WIRELESS MODE1. Connect the mini-USB end of the cable to the Charging Dock.2. Pull back the pull-tab and insert the battery into the battery compartment. (The pull-tab shall allow you to remove the battery easily). 3. Close the battery compartment.4. Switch on the Razer Mamba.
5. Press the pairing buttons on the Razer Mamba and Charging Dock. The pairing button
on the Charging Dock will start blinking to indicate the pairing process.
6. When the pairing process is completed, the button will stop blinking. Your Razer Mamba
is then ready for use in wireless mode.
7. To charge the Razer Mamba in wireless mode, place it on the Charging Dock. Alternatively,
the Razer Mamba can be charged by plugging it directly into a PC USB port.
Razer Mamba USB connector
WIRED MODE1. Connect the mini-USB end of the cable to the Razer Mamba.2. Plug mouse into the USB port of your computer. The Razer Mamba is then ready for use as a high performance wired mouse. In addition, its battery will start charging automatically in this wired mode.
3.
To remove the cable, push cable button to the right as shown before pulling out the mini-USB connector.Windows XP / x64 / Vista / Vista64 installation instructions
1. Download the Driver Installer from http://www.razersupport.com
2. Unzip the file and run the installer program.3. The Razer Mamba introduction screen appears. Click CONTINUE.
4. Important information regarding the Razer Mamba driver will be shown. Click
CONTINUE after reading.5. Read the software license agreement and click CONTINUE.
6. A confirmation popup screen will appear. Click AGREE if you accept all terms of the
agreement.
7. If you wish to choose the destination folder where the driver software will reside, click
CHANGE INSTALL LOCATION. Otherwise, click INSTALL to begin installation.
8. At the end of the installation, follow the instructions onscreen to restart your
computer. Click RESTART.REGISTERING YOUR RAZER MAMBA
Please visit www.razerzone.com/registration/ for online product registration.
What you’ll get:• 2 years’ limited manufacturer’s warranty• Free online technical support at www.razersupport.com
J
M M
M
N
K
P
Q
P
I
messaGe From razerGuyWireless freedom, ergonomic design, and lag free speed make the Razer Mamba™ the first true wireless gaming mouse. From the company that invented the gaming mouse, the Razer Mamba™ brings gaming grade technologies to wireless gaming which were previously nonexistent.With latency measurements decreased and the wireless polling rate at 1ms, the Mamba, arguably the fastest snake in the world, does not disappoint its namesake. The wireless design combined with Razer’s zero-acoustic Ultraslick™ Teflon feet creates a frictionless experience that is as smooth as it is quick. The Razer Mamba also features a system that allows gamers instant wired / wireless convertibility. By inserting the braided USB cable, the Razer Mamba transforms into a wired mouse, the gamer is freed from battery life worries and wireless interference.With the much improved wireless performance and the flexibility to play either wired or wireless, we have now truly set you free. Free to Frag.
Sehen Sie sich hier kostenlos das Handbuch für Razer Mamba Wireless an. Dieses Handbuch fällt unter die Kategorie Computermäuse und wurde von 1 Personen mit einem Durchschnitt von 8.1 bewertet. Dieses Handbuch ist in den folgenden Sprachen verfügbar: Englisch. Haben Sie eine Frage zum Razer Mamba Wireless oder benötigen Sie Hilfe? Stellen Sie hier Ihre Frage
Brauchen Sie Hilfe?
Haben Sie eine Frage zum Razer und die Antwort steht nicht im Handbuch? Stellen Sie hier Ihre Frage. Geben Sie eine klare und umfassende Beschreibung des Problems und Ihrer Frage an. Je besser Ihr Problem und Ihre Frage beschrieben sind, desto einfacher ist es für andere Razer -Besitzer, Ihnen eine gute Antwort zu geben.
Anzahl der Fragen: 0
Allgemeines
Razer
Mamba Wireless | RZ0102710100R3U
Computermaus
0811659030818
Englisch
Benutzerhandbuch (PDF)
Maus
Geräteschnittstelle-
Zweck-
TastentypGedrückte Tasten
Knopfanzahl7
Scroll TypRad
Bewegungerfassungs TechnologieOptisch
Bewegung Auflösung16000 DPI
Empfohlene NutzungUniversal
Bewegungsgeschwindigkeit (max.)450 Zoll/min
FingerabdruckscannerNein
Programmierbare MausknöpfeJa
Anzahl der programmierbaren Tasten7
Beschleunigung (Max.)50 G
Anzahl der Scroll-Rollen1
Tastenhaltbarkeit (Millionen Klicks)50
Stimmabgabe Rate1000 Hz
Design
Formfaktorrechts
ProduktfarbeSchwarz
BeleuchtungJa
Beleuchtung Anzahl der Farben16800000
Intelligentes, ergonomisches DesignJa
Verpackungsdaten
Anzahl1
Lieferumfang
Receiver enthaltenJa
Gewicht und Abmessungen
Breite70 mm
Tiefe125.7 mm
Höhe43.2 mm
Gewicht106 g
Leistung
Akku-/Batteriebetriebsdauer50 h
Ergonomie
Kabellänge2.1 m
Mehr anzeigen
Finden Sie die Antwort auf Ihre Frage nicht im Handbuch? Vielleicht finden Sie die Antwort auf Ihre Frage in den FAQs zu Razer Mamba Wireless unten.
Ist Ihre Frage nicht aufgeführt? Stellen Sie hier Ihre Frage
Keine Ergebnisse
Bedienungsanleitu.ng
© Copyright 2023 Bedienungsanleitu.ng. Alle Rechte vorbehalten. | {
"url": "https://www.bedienungsanleitu.ng/razer/mamba-wireless/anleitung",
"source_domain": "www.bedienungsanleitu.ng",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "577118",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6ZEXY5WEGL76R5W7Y4F2VQDPY6MUMN7W",
"WARC-Concurrent-To": "<urn:uuid:0858ce6c-8a3e-4138-9172-b6d6b3a9e178>",
"WARC-Date": "2023-03-21T14:15:08Z",
"WARC-IP-Address": "51.210.210.107",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AK3OVSCUZ4AYAB7OQ75BRNZAYIMEVPZL",
"WARC-Record-ID": "<urn:uuid:0dd381cc-df3a-46ba-8412-f3e6fcd14820>",
"WARC-Target-URI": "https://www.bedienungsanleitu.ng/razer/mamba-wireless/anleitung",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fdd7329f-832e-4fb7-a47a-38d24817f747>"
},
"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-113\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,
41,
42,
63,
71,
95,
108,
117,
157,
158,
191,
192,
204,
205,
251,
252,
277,
278,
325,
326,
359,
360,
393,
394,
411,
412,
474,
475,
521,
522,
567,
568,
592,
593,
705,
706,
719,
747,
769,
796,
844,
892,
914,
941,
964,
992,
1015,
1043,
1066,
1094,
1117,
1145,
1168,
1196,
1219,
1247,
1270,
1298,
1321,
1349,
1372,
1400,
1423,
1451,
1474,
1502,
1525,
1553,
1576,
1604,
1632,
1641,
2654,
2682,
3437,
3442,
6501,
7359,
9786,
10273,
10365,
10900,
10947,
10989,
11011,
11060,
11103,
11150,
11198,
11214,
11261,
11305,
11353,
11396,
11445,
11458,
11509,
11551,
11600,
11615,
11664,
11709,
11752,
11792,
11838,
11884,
11925,
11944,
11952,
11994,
12039,
12089,
12127,
12174,
12224,
12275,
12325,
12357,
12407,
12454,
12502,
12536,
12584,
12628,
12642,
12693,
12721,
12770,
12815,
12860,
12895,
12943,
12985,
13030,
13050,
13097,
13139,
13183,
13231,
13243,
13295,
13340,
13385,
13437,
13475,
13520,
13568,
13607,
13627,
13676,
13727,
13770,
13817,
13865,
13912,
13962,
14013,
14030,
14077,
14124,
14169,
14211,
14242,
14285,
14328,
14372,
14410,
14448,
14487,
14523,
14566,
14572,
14580,
14614,
14659,
14706,
14749,
14797,
14842,
14884,
14922,
14970,
15014,
15058,
15088,
15104,
15154,
15203,
15253,
15303,
15353,
15402,
15446,
15496,
15550,
15604,
15648,
15696,
15751,
15805,
15860,
15912,
15965,
15983,
16007,
16059,
16104,
16153,
16206,
16233,
16280,
16330,
16380,
16426,
16476,
16491,
16522,
16564,
16602,
16651,
16705,
16754,
16806,
16864,
16914,
16924,
16977,
17026,
17076,
17092,
17138,
17194,
17244,
17300,
17355,
17410,
17462,
17520,
17561,
17602,
17644,
17691,
17733,
17778,
17832,
17886,
17945,
17991,
18041,
18090,
18135,
18185,
18234,
18287,
18295,
18312,
18357,
18406,
18445,
18494,
18540,
18596,
18639,
18685,
18732,
18780,
18831,
18879,
18925,
18970,
19019,
19064,
19113,
19148,
19161,
19212,
19260,
19305,
19352,
19403,
19448,
19500,
19552,
19601,
19652,
19701,
19751,
19801,
19848,
19900,
19947,
19997,
20011,
20035,
20086,
20133,
20179,
20231,
20284,
20334,
20378,
20421,
20460,
20510,
20553,
20602,
20650,
20698,
20747,
20789,
20838,
20886,
20938,
20989,
21040,
21074,
21114,
21165,
21216,
21260,
21307,
21357,
21407,
21426,
21475,
21525,
21573,
21622,
21666,
21711,
21751,
21785,
21833,
21886,
21936,
21986,
22035,
22079,
22125,
22173,
22214,
22254,
22300,
22347,
22387,
22434,
22477,
22496,
22527,
22571,
22624,
22668,
22710,
22755,
22796,
22844,
22885,
22929,
22984,
23044,
23098,
23153,
23206,
23259,
23314,
23358,
23412,
23422,
23482,
23528,
23585,
23595,
23652,
23670,
23682,
23736,
23795,
23832,
23884,
23938,
23994,
24049,
24097,
24108,
24165,
24216,
24229,
24246,
24254,
24329,
24426,
24562,
24695,
24828,
24962,
25096,
25195,
25204,
25285,
25405,
25537,
25672,
25806,
25947,
26082,
26219,
26240,
26249,
26317,
26412,
26551,
26692,
26837,
26977,
27113,
27256,
27317,
27325,
27375,
27492,
27619,
27743,
27870,
27993,
28120,
28244,
28334,
28342,
28427,
28528,
28662,
28794,
28926,
29059,
29190,
29323,
29408,
29418,
29504,
29627,
29753,
29884,
30001,
30128,
30257,
30383,
30427,
30433,
30512,
30639,
30761,
30888,
31021,
31155,
31276,
31283,
31355,
31487,
31613,
31744,
31878,
32002,
32126,
32247,
32261,
32267,
32326,
32328,
32330,
32332,
32336,
32338,
32340,
32342,
32344,
32346,
32348,
32350,
32764,
32839,
32885,
32944,
33373,
33459,
33533,
33623,
33663,
33756,
33831,
33857,
34129,
34132,
34296,
34362,
34473,
34552,
34634,
34720,
34731,
34824,
34897,
34981,
35034,
35112,
35226,
35228,
35232,
35234,
35236,
35238,
35240,
35242,
35244,
35246,
36236,
36237,
36598,
36599,
36619,
36620,
36943,
36944,
36965,
36966,
36978,
36984,
37017,
37030,
37044,
37053,
37076,
37081,
37102,
37109,
37135,
37148,
37162,
37200,
37228,
37256,
37300,
37325,
37354,
37390,
37416,
37442,
37481,
37505,
37512,
37529,
37549,
37563,
37601,
37639,
37656,
37664,
37677,
37698,
37722,
37734,
37748,
37760,
37773,
37782,
37814,
37824,
37840,
37854,
37855,
38004,
38005,
38066,
38067,
38084,
38085,
38106,
38107
],
"line_end_idx": [
41,
42,
63,
71,
95,
108,
117,
157,
158,
191,
192,
204,
205,
251,
252,
277,
278,
325,
326,
359,
360,
393,
394,
411,
412,
474,
475,
521,
522,
567,
568,
592,
593,
705,
706,
719,
747,
769,
796,
844,
892,
914,
941,
964,
992,
1015,
1043,
1066,
1094,
1117,
1145,
1168,
1196,
1219,
1247,
1270,
1298,
1321,
1349,
1372,
1400,
1423,
1451,
1474,
1502,
1525,
1553,
1576,
1604,
1632,
1641,
2654,
2682,
3437,
3442,
6501,
7359,
9786,
10273,
10365,
10900,
10947,
10989,
11011,
11060,
11103,
11150,
11198,
11214,
11261,
11305,
11353,
11396,
11445,
11458,
11509,
11551,
11600,
11615,
11664,
11709,
11752,
11792,
11838,
11884,
11925,
11944,
11952,
11994,
12039,
12089,
12127,
12174,
12224,
12275,
12325,
12357,
12407,
12454,
12502,
12536,
12584,
12628,
12642,
12693,
12721,
12770,
12815,
12860,
12895,
12943,
12985,
13030,
13050,
13097,
13139,
13183,
13231,
13243,
13295,
13340,
13385,
13437,
13475,
13520,
13568,
13607,
13627,
13676,
13727,
13770,
13817,
13865,
13912,
13962,
14013,
14030,
14077,
14124,
14169,
14211,
14242,
14285,
14328,
14372,
14410,
14448,
14487,
14523,
14566,
14572,
14580,
14614,
14659,
14706,
14749,
14797,
14842,
14884,
14922,
14970,
15014,
15058,
15088,
15104,
15154,
15203,
15253,
15303,
15353,
15402,
15446,
15496,
15550,
15604,
15648,
15696,
15751,
15805,
15860,
15912,
15965,
15983,
16007,
16059,
16104,
16153,
16206,
16233,
16280,
16330,
16380,
16426,
16476,
16491,
16522,
16564,
16602,
16651,
16705,
16754,
16806,
16864,
16914,
16924,
16977,
17026,
17076,
17092,
17138,
17194,
17244,
17300,
17355,
17410,
17462,
17520,
17561,
17602,
17644,
17691,
17733,
17778,
17832,
17886,
17945,
17991,
18041,
18090,
18135,
18185,
18234,
18287,
18295,
18312,
18357,
18406,
18445,
18494,
18540,
18596,
18639,
18685,
18732,
18780,
18831,
18879,
18925,
18970,
19019,
19064,
19113,
19148,
19161,
19212,
19260,
19305,
19352,
19403,
19448,
19500,
19552,
19601,
19652,
19701,
19751,
19801,
19848,
19900,
19947,
19997,
20011,
20035,
20086,
20133,
20179,
20231,
20284,
20334,
20378,
20421,
20460,
20510,
20553,
20602,
20650,
20698,
20747,
20789,
20838,
20886,
20938,
20989,
21040,
21074,
21114,
21165,
21216,
21260,
21307,
21357,
21407,
21426,
21475,
21525,
21573,
21622,
21666,
21711,
21751,
21785,
21833,
21886,
21936,
21986,
22035,
22079,
22125,
22173,
22214,
22254,
22300,
22347,
22387,
22434,
22477,
22496,
22527,
22571,
22624,
22668,
22710,
22755,
22796,
22844,
22885,
22929,
22984,
23044,
23098,
23153,
23206,
23259,
23314,
23358,
23412,
23422,
23482,
23528,
23585,
23595,
23652,
23670,
23682,
23736,
23795,
23832,
23884,
23938,
23994,
24049,
24097,
24108,
24165,
24216,
24229,
24246,
24254,
24329,
24426,
24562,
24695,
24828,
24962,
25096,
25195,
25204,
25285,
25405,
25537,
25672,
25806,
25947,
26082,
26219,
26240,
26249,
26317,
26412,
26551,
26692,
26837,
26977,
27113,
27256,
27317,
27325,
27375,
27492,
27619,
27743,
27870,
27993,
28120,
28244,
28334,
28342,
28427,
28528,
28662,
28794,
28926,
29059,
29190,
29323,
29408,
29418,
29504,
29627,
29753,
29884,
30001,
30128,
30257,
30383,
30427,
30433,
30512,
30639,
30761,
30888,
31021,
31155,
31276,
31283,
31355,
31487,
31613,
31744,
31878,
32002,
32126,
32247,
32261,
32267,
32326,
32328,
32330,
32332,
32336,
32338,
32340,
32342,
32344,
32346,
32348,
32350,
32764,
32839,
32885,
32944,
33373,
33459,
33533,
33623,
33663,
33756,
33831,
33857,
34129,
34132,
34296,
34362,
34473,
34552,
34634,
34720,
34731,
34824,
34897,
34981,
35034,
35112,
35226,
35228,
35232,
35234,
35236,
35238,
35240,
35242,
35244,
35246,
36236,
36237,
36598,
36599,
36619,
36620,
36943,
36944,
36965,
36966,
36978,
36984,
37017,
37030,
37044,
37053,
37076,
37081,
37102,
37109,
37135,
37148,
37162,
37200,
37228,
37256,
37300,
37325,
37354,
37390,
37416,
37442,
37481,
37505,
37512,
37529,
37549,
37563,
37601,
37639,
37656,
37664,
37677,
37698,
37722,
37734,
37748,
37760,
37773,
37782,
37814,
37824,
37840,
37854,
37855,
38004,
38005,
38066,
38067,
38084,
38085,
38106,
38107,
38170
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 38170,
"ccnet_original_nlines": 576,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.281338632106781,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04537719860672951,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.166335791349411,
"rps_doc_frac_unique_words": 0.35817307233810425,
"rps_doc_mean_word_length": 5.396119594573975,
"rps_doc_num_sentences": 439,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 6.6424431800842285,
"rps_doc_word_count": 5824,
"rps_doc_frac_chars_dupe_10grams": 0.009800489991903305,
"rps_doc_frac_chars_dupe_5grams": 0.06923983246088028,
"rps_doc_frac_chars_dupe_6grams": 0.026728609576821327,
"rps_doc_frac_chars_dupe_7grams": 0.02259203977882862,
"rps_doc_frac_chars_dupe_8grams": 0.016800839453935623,
"rps_doc_frac_chars_dupe_9grams": 0.012473350390791893,
"rps_doc_frac_chars_top_2gram": 0.012091509997844696,
"rps_doc_frac_chars_top_3gram": 0.008686799556016922,
"rps_doc_frac_chars_top_4gram": 0.009736849926412106,
"rps_doc_books_importance": -3342.879150390625,
"rps_doc_books_importance_length_correction": -3342.879150390625,
"rps_doc_openwebtext_importance": -1996.871826171875,
"rps_doc_openwebtext_importance_length_correction": -1996.871826171875,
"rps_doc_wikipedia_importance": -1581.7200927734375,
"rps_doc_wikipedia_importance_length_correction": -1581.7200927734375
},
"fasttext": {
"dclm": 0.04194008931517601,
"english": 0.6242435574531555,
"fineweb_edu_approx": 1.317888855934143,
"eai_general_math": 0.013968409970402718,
"eai_open_web_math": 0.1604630947113037,
"eai_web_code": 0.020701710134744644
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-5,953,935,742,703,541,000 | Programs
Multiple String Input In Java Using Scanner [With Coding Example]
Introduction
In java.util package, the scanner is one of the classes that help in collecting multiple inputs of the primitive types such as double, integer, strings, etc. Though it is not an efficient way of reading inputs in a Java program where time acts as a constraint, it is undoubtedly one of the easiest ways to collect multiple inputs from the user. In this blog, you will learn how to collect multiple string input from the user in a Java program using the scanner class.
Methods for Taking Multiple Inputs Using Scanner
You must import java.util package in a program before using the Scanner class. The following table lists the methods used to take multiple inputs of different types from the user in a Java program.
Method Inputs
nextInt() Integer
nextFloat() Float
nextDouble() Double
nextLong() Long
nextShort() Short
next() Single-word
nextLine() Line of Strings
nextBoolean() Boolean
Using Java nextLine() Method
The java.util.Scanner.nextLine() method returns the line that was skipped by advancing the scanner past the current line. If a line separator is given at the end of the current line, this method excludes it and returns the string’s rest from the current line. The scanner is set at the next line beginning and reads the entire string, including the words’ white spaces.
The syntax for nextLine() method is as follows:
Public String nextLine()
This method throws the following two exceptions:
• NoSuchElementException – If the string is empty or no line is found.
• IllegalStateException – If the scanner is closed.
Example
The following example demonstrates how java.util.Scanner.nextLine() method collects multiple inputs from the user.
import java.util.Scanner;
public class SacnnerDemoMultipleString
public static void main(String[] args)
Scanner demo = new Scanner(System.in);
System.out.print(“Please enter multiple inputs you want to print: “);
//takes an integer input
String[] string = new String [demo.nextInt()];
//consuming the <enter> from input above
demo.nextLine();
for (int i = 0; i < string.length; i++)
string[i] = demo.nextLine();
System.out.println(“\nYou have entered the following input: “);
//for-each loop to print the string
for(String str: string)
System.out.println(str);
// close the scanner
scanner.close();
The above program will print the following output
Please enter multiple inputs you want to print: 7
Misha
Harry
Robert
Harvey
Jill
Rachel
Jennifer
You have entered the following input:
Misha
Harry
Robert
Harvey
Jill
Rachel
Jennifer
Using Java nextInt() Method
The java.util.Scanner.nextInt() method scans the input provided by the user as an integer. If an integer is found, then the scanner advances past the matched input.
The syntax for nextInt() method is as follows:
Public int nextInt()
This method throws the following three exceptions:
• InputMismatchException – If the next token does not match the integer regular expression or if the next token is out of the range.
• NoSuchElementException – If the input is exhausted.
• IllegalStateException – If the scanner is closed.
Example
The following example demonstrates how java.util.Scanner.nextInt() method collects multiple inputs from the user.
// Java program to scan integer using Scanner
// class and print their mean.
import java.util.Scanner;
public class ScannerDemoInteger
{
public static void main(String[] args)
{
Scanner demo = new Scanner(System.in);
// Initialize sum and count of input elements
int sum = 0, count = 0;
// Check if an integer value is present
while (demo.hasNextInt())
{
// Scan an integer value
int num = demo.nextInt();
sum += num;
count++;
}
int mean = sum / count;
System.out.println(“Mean: ” + mean);
}
}
The above program is fed with the following input:
101
223
238
892
99
500
728
The above program will print the following output:
Mean: 397
Also Read: Java MVC Project
Using Java nextDouble() Method
The java.util.Scanner.nextDouble() method scans the input provided by the user as a double. If a float regular expression is found, then the scanner advances past the matched input.
The syntax for nextInt() method is as follows:
public double nextDouble()
This method throws the following three exceptions:
• InputMismatchException – If the next token does not match the float regular expression or if the next token is out of the range.
• NoSuchElementException – If the input is exhausted.
• IllegalStateException – If the scanner is closed.
Example
The example demonstrates how java.util.Scanner.nextDouble() method collects multiple inputs from the user.
// Java program to scan float using Scanner
import java.util.Scanner;
public class ScannerDoubleRegularExpression {
public static void main(String[] args) {
String new = “Good Morning! 3 + 3.0 = 6 true”;
// write a new scanner object with the specified String Object
Scanner demo = new Scanner(s);
// use US locale to be able to identify doubles in the string
demo.useLocale(Locale.US);
// search the next double token and print it
while (demo.hasNext()) {
// if the next is a double, print found and the float regular expression
if (demo.hasNextDouble()) {
System.out.println(“Found :” + demo.nextDouble());
}
// if a double regular expression is not found, print “Not Found” and the token
System.out.println(“Not Found :” + demo.next());
}
// close the scanner
scanner.close();
}
}
The above program will result in the following output:
Not Found: Good
Not Found: Morning!
Found: 3.0
Not Found: +
Found: 3.0
Not Found: =
Found: 6.0
Not Found: true
Learn Software Development Courses online from the World’s top Universities. Earn Executive PG Programs, Advanced Certificate Programs, or Masters Programs to fast-track your career.
Conclusion
For example, the codes given in this blog are the purpose and can be modified as per an individual’s needs. If you’re interested to learn more about Java & full-stack software development, check out upGrad & IIIT-B’s Executive PG Program in Full-stack Software Development which is designed for working professionals and offers 500+ hours of rigorous training, 9+ projects, and assignments, IIIT-B Alumni status, practical hands-on capstone projects & job assistance with top firms.
What is Scanner class in Java?
The Scanner class lets you read values from the keyboard without using Java's console input. Java's console input is slow, and so is its redirection. Scanner is faster and more convenient, so Scanner should be used in place of Java's console input. Scanner uses Java's regular input stream, so it can be chained with other parsers. Scanner is also easier to use than Java's console input. Scanner has three main subclasses, namely, BufferedReader, InputStreamReader, and FileReader. The most general one is BufferedReader. BufferedReader can read anything that can be read by InputStreamReader, and it has one big advantage: buffer. The buffer can hold one line at a time. An input stream has no buffer at all: when you call next(), it returns the value. This means you have to collect the values before you can do anything with them. Scanner does it for you.
What is a string builder in Java?
A string builder is a new type of class to create a string. The string builder class is introduced in Java from 1.3 version. It allows you to create a string by concatenating a number of strings and will automatically resize itself as you add more strings to it. Compared to string concatenation, using string builder is faster and flexible, though it's less readable. StringBuilder objects are objects that are used to create String values. StringBuilder objects have a number of methods.
What is an InputStreamReader in Java?
InputStreamReader reads a stream of characters from an input stream and decodes them into a specified character encoding. It provides an easy way to convert character streams from one encoding to another. InputStreamReader reads bytes from the underlying stream and converts them into characters using the specified charset encoding. It is a class that is used to convert byte stream data into character stream data. Byte stream represent binary data and character stream represent text.
Want to share this article?
Prepare for a Career of the Future
Leave a comment
Your email address will not be published. Required fields are marked *
Leave a comment
Your email address will not be published. Required fields are marked *
×
Get Free career counselling from upGrad experts!
Book a session with an industry professional today!
No Thanks
Let's do it
Get Free career counselling from upGrad experts!
Book a Session with an industry professional today!
Let's do it
No Thanks | {
"url": "https://prod-eks-app-alb-1037681640.ap-south-1.elb.amazonaws.com/blog/multiple-string-input-in-java-using-scanner/",
"source_domain": "prod-eks-app-alb-1037681640.ap-south-1.elb.amazonaws.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "389803",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XUVOQHMNYH2NBLNKOMGCLQDCQPZNRJLJ",
"WARC-Concurrent-To": "<urn:uuid:13c2368e-2481-456c-a6ce-94d8b4363469>",
"WARC-Date": "2022-08-15T00:26:03Z",
"WARC-IP-Address": "35.154.5.237",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2YMNAYDLRTDDTIIQPWDOK4O7IOTQW4LF",
"WARC-Record-ID": "<urn:uuid:36e3c6e7-f83e-4075-8d22-d31467f2e99c>",
"WARC-Target-URI": "https://prod-eks-app-alb-1037681640.ap-south-1.elb.amazonaws.com/blog/multiple-string-input-in-java-using-scanner/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eef82878-0985-4657-8220-b518062304c6>"
},
"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-71\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,
9,
10,
76,
77,
90,
91,
559,
560,
609,
610,
808,
809,
823,
841,
859,
879,
895,
913,
932,
959,
981,
982,
1011,
1012,
1382,
1383,
1431,
1432,
1457,
1458,
1507,
1508,
1581,
1635,
1636,
1644,
1645,
1760,
1761,
1788,
1789,
1829,
1830,
1871,
1872,
1912,
1913,
1985,
1986,
2015,
2016,
2064,
2065,
2107,
2108,
2127,
2128,
2170,
2171,
2201,
2202,
2267,
2268,
2305,
2306,
2332,
2333,
2358,
2359,
2380,
2381,
2398,
2399,
2449,
2450,
2501,
2502,
2508,
2509,
2515,
2516,
2523,
2524,
2531,
2532,
2537,
2538,
2545,
2546,
2555,
2556,
2594,
2595,
2601,
2602,
2608,
2609,
2616,
2617,
2624,
2625,
2630,
2631,
2638,
2639,
2648,
2649,
2677,
2678,
2843,
2844,
2891,
2892,
2913,
2914,
2965,
2966,
3101,
3157,
3211,
3212,
3220,
3221,
3335,
3336,
3382,
3383,
3414,
3415,
3441,
3442,
3474,
3475,
3477,
3478,
3517,
3518,
3520,
3521,
3561,
3562,
3608,
3609,
3635,
3636,
3676,
3677,
3703,
3704,
3707,
3708,
3733,
3734,
3760,
3761,
3773,
3774,
3783,
3784,
3787,
3788,
3812,
3813,
3850,
3851,
3853,
3854,
3856,
3857,
3908,
3909,
3913,
3914,
3918,
3919,
3923,
3924,
3928,
3929,
3932,
3933,
3937,
3938,
3942,
3943,
3994,
3995,
4005,
4006,
4036,
4037,
4068,
4069,
4251,
4252,
4299,
4300,
4327,
4328,
4379,
4380,
4513,
4569,
4623,
4624,
4632,
4633,
4740,
4741,
4785,
4786,
4812,
4813,
4859,
4860,
4901,
4902,
4949,
4950,
5013,
5014,
5045,
5046,
5109,
5110,
5137,
5138,
5183,
5184,
5209,
5210,
5283,
5284,
5312,
5313,
5365,
5366,
5369,
5370,
5450,
5451,
5500,
5501,
5504,
5505,
5526,
5527,
5544,
5545,
5547,
5548,
5550,
5551,
5606,
5607,
5623,
5624,
5644,
5645,
5656,
5657,
5670,
5671,
5682,
5683,
5696,
5697,
5708,
5709,
5725,
5726,
5909,
5910,
5921,
5922,
6405,
6406,
6437,
6438,
7298,
7299,
7333,
7334,
7824,
7825,
7863,
7864,
8352,
8353,
8381,
8382,
8417,
8418,
8434,
8435,
8506,
8507,
8523,
8524,
8595,
8596,
8598,
8647,
8699,
8709,
8721,
8770,
8822,
8834
],
"line_end_idx": [
9,
10,
76,
77,
90,
91,
559,
560,
609,
610,
808,
809,
823,
841,
859,
879,
895,
913,
932,
959,
981,
982,
1011,
1012,
1382,
1383,
1431,
1432,
1457,
1458,
1507,
1508,
1581,
1635,
1636,
1644,
1645,
1760,
1761,
1788,
1789,
1829,
1830,
1871,
1872,
1912,
1913,
1985,
1986,
2015,
2016,
2064,
2065,
2107,
2108,
2127,
2128,
2170,
2171,
2201,
2202,
2267,
2268,
2305,
2306,
2332,
2333,
2358,
2359,
2380,
2381,
2398,
2399,
2449,
2450,
2501,
2502,
2508,
2509,
2515,
2516,
2523,
2524,
2531,
2532,
2537,
2538,
2545,
2546,
2555,
2556,
2594,
2595,
2601,
2602,
2608,
2609,
2616,
2617,
2624,
2625,
2630,
2631,
2638,
2639,
2648,
2649,
2677,
2678,
2843,
2844,
2891,
2892,
2913,
2914,
2965,
2966,
3101,
3157,
3211,
3212,
3220,
3221,
3335,
3336,
3382,
3383,
3414,
3415,
3441,
3442,
3474,
3475,
3477,
3478,
3517,
3518,
3520,
3521,
3561,
3562,
3608,
3609,
3635,
3636,
3676,
3677,
3703,
3704,
3707,
3708,
3733,
3734,
3760,
3761,
3773,
3774,
3783,
3784,
3787,
3788,
3812,
3813,
3850,
3851,
3853,
3854,
3856,
3857,
3908,
3909,
3913,
3914,
3918,
3919,
3923,
3924,
3928,
3929,
3932,
3933,
3937,
3938,
3942,
3943,
3994,
3995,
4005,
4006,
4036,
4037,
4068,
4069,
4251,
4252,
4299,
4300,
4327,
4328,
4379,
4380,
4513,
4569,
4623,
4624,
4632,
4633,
4740,
4741,
4785,
4786,
4812,
4813,
4859,
4860,
4901,
4902,
4949,
4950,
5013,
5014,
5045,
5046,
5109,
5110,
5137,
5138,
5183,
5184,
5209,
5210,
5283,
5284,
5312,
5313,
5365,
5366,
5369,
5370,
5450,
5451,
5500,
5501,
5504,
5505,
5526,
5527,
5544,
5545,
5547,
5548,
5550,
5551,
5606,
5607,
5623,
5624,
5644,
5645,
5656,
5657,
5670,
5671,
5682,
5683,
5696,
5697,
5708,
5709,
5725,
5726,
5909,
5910,
5921,
5922,
6405,
6406,
6437,
6438,
7298,
7299,
7333,
7334,
7824,
7825,
7863,
7864,
8352,
8353,
8381,
8382,
8417,
8418,
8434,
8435,
8506,
8507,
8523,
8524,
8595,
8596,
8598,
8647,
8699,
8709,
8721,
8770,
8822,
8834,
8843
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8843,
"ccnet_original_nlines": 309,
"rps_doc_curly_bracket": 0.001583170029334724,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3002282977104187,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005707759875804186,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22602739930152893,
"rps_doc_frac_unique_words": 0.3093964755535126,
"rps_doc_mean_word_length": 5.241405487060547,
"rps_doc_num_sentences": 123,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.329089641571045,
"rps_doc_word_count": 1309,
"rps_doc_frac_chars_dupe_10grams": 0.17475587129592896,
"rps_doc_frac_chars_dupe_5grams": 0.29310595989227295,
"rps_doc_frac_chars_dupe_6grams": 0.2601661682128906,
"rps_doc_frac_chars_dupe_7grams": 0.2601661682128906,
"rps_doc_frac_chars_dupe_8grams": 0.2259145826101303,
"rps_doc_frac_chars_dupe_9grams": 0.20303162932395935,
"rps_doc_frac_chars_top_2gram": 0.018947679549455643,
"rps_doc_frac_chars_top_3gram": 0.006996059790253639,
"rps_doc_frac_chars_top_4gram": 0.012243109755218029,
"rps_doc_books_importance": -714.8922119140625,
"rps_doc_books_importance_length_correction": -714.8922119140625,
"rps_doc_openwebtext_importance": -399.94036865234375,
"rps_doc_openwebtext_importance_length_correction": -399.94036865234375,
"rps_doc_wikipedia_importance": -195.5640411376953,
"rps_doc_wikipedia_importance_length_correction": -195.5640411376953
},
"fasttext": {
"dclm": 0.2884024977684021,
"english": 0.7730528116226196,
"fineweb_edu_approx": 2.7545430660247803,
"eai_general_math": 0.17494195699691772,
"eai_open_web_math": 0.035579439252614975,
"eai_web_code": 0.38452136516571045
}
} | {
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
7,259,222,761,373,014,000 | Cannot update packages with zypper
Hi,
I ran zypper lr -d && sudo zypper up and it produces the following result:
https://paste.opensuse.org/pastes/71a52ea36988
I also tried running sudo zypper ref && sudo zypper -vvv up --allow-vendor-change
Can anyone help figure out why zypper won’t update?
Update Tumbleweed with zypper dup not zypper up
zypper up is for Leap.
The short reason is that you aren’t so much as updating packages as upgrading the whole distro at once.
Ah OK thanks(I installed Leap last week). Now I installed Tumbleweed on a different laptop.
So I never run zypper up on Tumbleweed? I always run zypper dup.
Will it always display the warning in the screenshot?
https://paste.opensuse.org/pastes/d03ee76a73ea
Yes and yes. Always dup, and it will always tell you you’re about to do a distro upgrade.
That message is important on Leap because there is a difference between upgrade (up) which installs patches to installed packages and distro-upgrade (dup) that would move from major/minor to the next major/minor (ie 15.5 to 15.6) which is a very different process in Leap.
Tumbleweed is released basically daily as snapshots. Each snapshot is akin to a major release in a traditional distro, so you have to use distro-upgrade to do the update properly. That is also why up doesn’t do anything, a snapshot isn’t updated after it has been created so there are no packages to upgrade in that release.
1 Like | {
"url": "https://forums.opensuse.org/t/cannot-update-packages-with-zypper/171971",
"source_domain": "forums.opensuse.org",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "21080",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M4DTMFQTE42JKK4KOBQCMWQJJ7LAY6HL",
"WARC-Concurrent-To": "<urn:uuid:2aa3bc0a-6293-4b03-be3c-407134ee8ec8>",
"WARC-Date": "2024-02-27T11:40:55Z",
"WARC-IP-Address": "195.135.223.50",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CXI323BYJR4K5E55ZT22K5CYBUS3JHBS",
"WARC-Record-ID": "<urn:uuid:40cb2636-372d-4d0f-9c5d-809376b66823>",
"WARC-Target-URI": "https://forums.opensuse.org/t/cannot-update-packages-with-zypper/171971",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9909fb15-6ba3-4446-a506-4cbcba0270d4>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-126\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
35,
36,
40,
41,
116,
117,
164,
165,
247,
248,
300,
301,
349,
350,
373,
374,
478,
479,
571,
572,
637,
638,
692,
693,
740,
741,
831,
832,
1105,
1106,
1431,
1432
],
"line_end_idx": [
35,
36,
40,
41,
116,
117,
164,
165,
247,
248,
300,
301,
349,
350,
373,
374,
478,
479,
571,
572,
637,
638,
692,
693,
740,
741,
831,
832,
1105,
1106,
1431,
1432,
1438
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1438,
"ccnet_original_nlines": 32,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39228296279907227,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022508040070533752,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1897106170654297,
"rps_doc_frac_unique_words": 0.5321888327598572,
"rps_doc_mean_word_length": 4.854077339172363,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.522082805633545,
"rps_doc_word_count": 233,
"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.02829355001449585,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -122.82105255126953,
"rps_doc_books_importance_length_correction": -120.04281616210938,
"rps_doc_openwebtext_importance": -82.05238342285156,
"rps_doc_openwebtext_importance_length_correction": -82.05238342285156,
"rps_doc_wikipedia_importance": -54.31473922729492,
"rps_doc_wikipedia_importance_length_correction": -46.89162063598633
},
"fasttext": {
"dclm": 0.16129356622695923,
"english": 0.9209242463111877,
"fineweb_edu_approx": 1.232053518295288,
"eai_general_math": 0.39328432083129883,
"eai_open_web_math": 0.07250850647687912,
"eai_web_code": 0.1163521409034729
}
} | {
"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.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
End of preview. Expand
in Data Studio
💻 EAI-Taxonomy Code w/ DCLM (100B sample)
A 100 billion token sample of high-quality code curated from web data using taxonomy-based filtering.
🎯 Dataset Overview
This dataset is part of the Essential-Web project, which introduces a new paradigm for dataset curation using expressive metadata and simple semantic filters. Unlike traditional code datasets that require complex domain-specific pipelines, our approach leverages a 12-category taxonomy to efficiently identify and extract high-quality code data.
💡 EAI-Taxonomy Code w/ DCLM (100B tokens): Documents targeting code that exhibit intermediate to advanced reasoning, combined with the DCLM classifier to filter for instruction-dense documents. Also includes mathematics content (51 - Mathematics) to match the scope of existing code datasets.
🏆 Performance
Our taxonomy-based approach achieves competitive results with significantly less curation effort:
| Dataset | HumanEval+ | MBPP+ | MMLU-CS | Curation Complexity |
|---|---|---|---|---|
| DCLM-baseline | 28.0% | 45.5% | 32.0% | General web filtering |
| OpenCoder FW | 26.2% | 45.8% | 27.7% | Complex domain pipeline |
| EAI-Taxonomy Code | 27.4% | 46.6% | 29.0% | Simple semantic filter |
| EAI-Taxonomy Code w/ DCLM | 28.7% | 45.0% | 47.0% | + DCLM classifier |
Results show competitive code generation performance with a +46.8% improvement in computer science knowledge (MMLU-CS) compared to baseline.
🔍 Key Findings
- Code Generation: All datasets perform within statistical error on single-function generation benchmarks (HumanEval+, MBPP+)
- Code Knowledge: Clear impact on general computer science knowledge when using taxonomy-curated data
- Efficiency: Achieves strong performance without complex domain-specific curation pipelines
Dataset Schema Documentation
Overview
This dataset contains web-crawled text data with comprehensive metadata, quality signals, and taxonomic classifications. Each record represents a document extracted from web archives with detailed provenance tracking and quality assessment metrics.
Core Fields
| Field | Type | Description | Path |
|---|---|---|---|
id |
Int64 |
Unique identifier based on document hash | id |
text |
String |
The main textual content of the document | text |
EAI Taxonomy Classification
Comprehensive hierarchical classification system with primary and secondary labels - the most important feature of this dataset. The taxonomy is designed to provide detailed subject categorization, document type identification, content quality assessment, and extraction quality indicators.
Free Decimal Correspondence (FDC)
A Dewey Decimal-inspired classification system with 3-level hierarchical labels. The FDC provides nested categories where each successive level refines its parent category. It's designed to be compatible with the Dewey Decimal System for library cataloging.
Level Structure:
- Level 1: Top-level categories (0-9) covering broad subject areas like General works, Philosophy, Religion, Social Sciences, etc.
- Level 2: Sub-divisions (00-99) that refine Level 1 categories
- Level 3: Specific categories (000-999) that further refine Level 2 categories
| Component | Description | Path |
|---|---|---|
| Primary Code | Main classification code | eai_taxonomy.free_decimal_correspondence.primary.code |
| Primary Level 1 | Top-level category (0=General works, 1=Philosophy, 2=Religion, 3=Social Sciences, 4=Language, 5=Science, 6=Technology, 7=Arts, 8=Literature, 9=History/Geography) | eai_taxonomy.free_decimal_correspondence.primary.labels.level_1 |
| Primary Level 2 | Mid-level category | eai_taxonomy.free_decimal_correspondence.primary.labels.level_2 |
| Primary Level 3 | Specific category | eai_taxonomy.free_decimal_correspondence.primary.labels.level_3 |
| Secondary Code | Alternative classification code | eai_taxonomy.free_decimal_correspondence.secondary.code |
| Secondary Level 1 | Alternative top-level category | eai_taxonomy.free_decimal_correspondence.secondary.labels.level_1 |
| Secondary Level 2 | Alternative mid-level category | eai_taxonomy.free_decimal_correspondence.secondary.labels.level_2 |
| Secondary Level 3 | Alternative specific category | eai_taxonomy.free_decimal_correspondence.secondary.labels.level_3 |
We recommend this viewer for easily navigating the FDC categories when curating filters: https://www.librarything.com/mds
Bloom's Taxonomy Integration
Based on Anderson and Krathwohl's 2001 revision of Bloom's Taxonomy of Educational Objectives, providing two complementary categorization dimensions for educational content analysis.
Knowledge Domain
Categorizes the type of knowledge demonstrated in the document:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main knowledge domain code | eai_taxonomy.bloom_knowledge_domain.primary.code |
| Primary Label | Main knowledge domain label | eai_taxonomy.bloom_knowledge_domain.primary.label |
| Secondary Code | Alternative knowledge domain code | eai_taxonomy.bloom_knowledge_domain.secondary.code |
| Secondary Label | Alternative knowledge domain label | eai_taxonomy.bloom_knowledge_domain.secondary.label |
Possible Values:
| Code | Label | Description |
|---|---|---|
-1 |
Abstain | Unable to determine |
1 |
Factual | Basic elements to learn or solve problems |
2 |
Conceptual | Interrelationships between basic elements within larger context |
3 |
Procedural | Methods and techniques in the discipline |
4 |
Metacognitive | Awareness of how learning works in relation to oneself |
Cognitive Processing Level
Assesses the learning and thinking skill levels demonstrated by the document author:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main cognitive process code | eai_taxonomy.bloom_cognitive_process.primary.code |
| Primary Label | Main cognitive process label | eai_taxonomy.bloom_cognitive_process.primary.label |
| Secondary Code | Alternative cognitive process code | eai_taxonomy.bloom_cognitive_process.secondary.code |
| Secondary Label | Alternative cognitive process label | eai_taxonomy.bloom_cognitive_process.secondary.label |
Possible Values:
| Code | Label | Description |
|---|---|---|
-1 |
Abstain | Unable to determine |
1 |
Remember | Retrieve relevant knowledge from memory |
2 |
Understand | Determine meaning of instructional messages |
3 |
Apply | Use a procedure in a given situation |
4 |
Analyze | Break materials into components and determine relationships |
5 |
Evaluate | Make judgments based on criteria and standards |
6 |
Create | Create new or original work |
Document Characteristics
Document Type v1
In-house classification of common web document types and formats:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main document type code | eai_taxonomy.document_type_v1.primary.code |
| Primary Label | Main document type label | eai_taxonomy.document_type_v1.primary.label |
| Secondary Code | Alternative document type code | eai_taxonomy.document_type_v1.secondary.code |
| Secondary Label | Alternative document type label | eai_taxonomy.document_type_v1.secondary.label |
Possible Values:
| Code | Label | Examples |
|---|---|---|
-1 |
Abstain | Unable to classify |
1 |
News/Editorial | CNN articles, opinion columns |
2 |
Academic/Research | ArXiv papers, research articles |
3 |
Reference/Encyclopedic/Educational | FAQs, Wikipedia entries |
4 |
Code/Software | GitHub repos, code examples |
5 |
Social/Forum | Conversation threads, Q&A boards |
6 |
Promotional/Advertisement | Product pages, calls to action |
7 |
Search/Directory/Bibliography | Link pages, search results |
8 |
Adult/Pornographic | Adult content |
9 |
Personal/Misc | Blogs, user profiles |
10 |
Machine-Generated | Lorem ipsum, garbled text |
11 |
Legal/Regulatory | Contracts, terms of service |
12 |
Government/Political | Legislation, press releases |
13 |
Literary/Creative | Poems, short stories |
14 |
Reviews/Critiques | Film critiques, product reviews |
15 |
E-Commerce/Marketplace | eBay listings, Amazon pages |
16 |
Images/Videos/Audio | YouTube videos, Imgur pages |
17 |
Other/Unclassified | Documents that resist classification |
Document Type v2
Updated classification based on WebOrganizer taxonomy with refined categories for improved document classification accuracy:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main document type code (v2) | eai_taxonomy.document_type_v2.primary.code |
| Primary Label | Main document type label (v2) | eai_taxonomy.document_type_v2.primary.label |
| Secondary Code | Alternative document type code (v2) | eai_taxonomy.document_type_v2.secondary.code |
| Secondary Label | Alternative document type label (v2) | eai_taxonomy.document_type_v2.secondary.label |
Complete Value Mapping:
| Code | Label | Examples |
|---|---|---|
-1 |
Abstain | Documents requiring human review |
1 |
About (Org.) | Company about pages, mission statements |
2 |
About (Personal) | Personal bios, LinkedIn profiles |
3 |
Academic Writing | Research papers, abstracts, dissertations |
4 |
Audio Transcript | Interview transcripts, court records, captions |
5 |
Comment Section | Reddit threads, blog comments |
6 |
Content Listing | Site maps, product catalogs, directory listings |
7 |
Creative Writing | Song lyrics, novel excerpts, poetry |
8 |
Documentation | API docs, README files, user manuals |
9 |
FAQ | FAQ pages, Q&A lists |
10 |
Knowledge Article | Wikipedia articles, Britannica entries |
11 |
Legal Notices | Privacy policies, license agreements, terms of service |
12 |
Listicle | Buzzfeed-style articles, "Top 10" lists |
13 |
News (Org.) | Government blog posts, corporate announcements |
14 |
News Article | Newspaper articles, CNN content, breaking news |
15 |
Nonfiction Writing | Editorials, obituaries, memoirs, opinion pieces |
16 |
Personal Blog | Personal journals, diary entries, lifestyle blogs |
17 |
Product Page | Product descriptions, course offerings, sales pages |
18 |
Q&A Forum | Quora posts, Stack Exchange discussions |
19 |
Spam / Ads | SEO keyword stuffing, promotional spam |
20 |
Structured Data | Datasheets, glossaries, JSON files, databases |
21 |
Customer Support | Help articles, troubleshooting guides |
22 |
Truncated | Paywalled sites, image galleries, partial content |
23 |
Tutorial | Cooking recipes, WikiHow pages, step-by-step guides |
24 |
User Review | Yelp reviews, TripAdvisor feedback, product reviews |
25 |
Other/Unclassified | Miscellaneous documents not fitting other categories |
Extraction Artifacts
Assessment of technical extraction quality, identifying issues from HTML-to-text conversion:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main extraction artifact code | eai_taxonomy.extraction_artifacts.primary.code |
| Primary Label | Main extraction artifact label | eai_taxonomy.extraction_artifacts.primary.label |
| Secondary Code | Alternative extraction artifact code | eai_taxonomy.extraction_artifacts.secondary.code |
| Secondary Label | Alternative extraction artifact label | eai_taxonomy.extraction_artifacts.secondary.label |
Possible Values:
| Code | Label | Description |
|---|---|---|
-1 |
Abstain | Unable to determine |
0 |
No Artifacts | Clean text with no leftover HTML or irrelevant elements |
1 |
Leftover HTML | HTML/code artifacts remaining after extraction |
2 |
Text Extraction Errors | Broken math expressions, encoding errors, improperly parsed tables |
3 |
Irrelevant Content | Headers, footers, nav menus extracted by mistake |
4 |
Indeterminate | Insufficient content to judge |
Missing Content
Assessment of content completeness and extraction success:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main missing content code | eai_taxonomy.missing_content.primary.code |
| Primary Label | Main missing content label | eai_taxonomy.missing_content.primary.label |
| Secondary Code | Alternative missing content code | eai_taxonomy.missing_content.secondary.code |
| Secondary Label | Alternative missing content label | eai_taxonomy.missing_content.secondary.label |
Possible Values:
| Code | Label | Description |
|---|---|---|
-1 |
Abstain | Unable to determine |
0 |
No Missing Content | Complete and coherent text |
1 |
Truncated Snippets | Obvious "...", incomplete paragraphs, cut-off text |
2 |
Click Here References | "Download here", "Click here" without linked content |
3 |
Incoherent Flow | Unreadable or illogical flow due to missing context |
4 |
Missing Images or Figures | Placeholders or references to missing visual content |
5 |
Missing Referenced Data | References to absent tables/datasets (e.g., "See Table 3") |
6 |
Indeterminate | Insufficient content to judge |
Text Structure Information
| Field | Type | Description | Path |
|---|---|---|---|
| Line Start Indices | List[Int32] |
Starting indices of each line | line_start_n_end_idx.line_start_idx |
| Line End Indices | List[Int32] |
Ending indices of each line | line_start_n_end_idx.line_end_idx |
Content Quality Dimensions
Quality assessment inspired by NaturalReasoning and FineWeb efforts to categorize web data by information sophistication.
Reasoning Depth
Assesses the complexity and sophistication of logical reasoning in the document:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main reasoning depth code | eai_taxonomy.reasoning_depth.primary.code |
| Primary Label | Main reasoning depth label | eai_taxonomy.reasoning_depth.primary.label |
| Secondary Code | Alternative reasoning depth code | eai_taxonomy.reasoning_depth.secondary.code |
| Secondary Label | Alternative reasoning depth label | eai_taxonomy.reasoning_depth.secondary.label |
Possible Values:
| Code | Label | Description |
|---|---|---|
-1 |
Abstain | Unable to determine |
1 |
No Reasoning | Facts present but no evidence of reasoning |
2 |
Basic Reasoning | Basic analysis with minimal explanation and summarization |
3 |
Intermediate Reasoning | Some logical steps connecting ideas and structured thinking |
4 |
Advanced Reasoning | Multi-step reasoning and thorough analysis with well-developed explanations |
5 |
Exceptional Reasoning | Novel abstractions, theoretical frameworks, long chain-of-thought, original insights, or proofs |
6 |
Indeterminate | Insufficient context to judge |
Technical Correctness
Evaluates the accuracy and precision of technical information:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main technical correctness code | eai_taxonomy.technical_correctness.primary.code |
| Primary Label | Main technical correctness label | eai_taxonomy.technical_correctness.primary.label |
| Secondary Code | Alternative technical correctness code | eai_taxonomy.technical_correctness.secondary.code |
| Secondary Label | Alternative technical correctness label | eai_taxonomy.technical_correctness.secondary.label |
Possible Values:
| Code | Label | Description |
|---|---|---|
-1 |
Abstain | Unable to determine |
1 |
Technically Flawed | Significant errors undermining content validity |
2 |
Partially Correct | Some correctness but contains flaws, omissions, or errors |
3 |
Mostly Correct | Technical correctness with minor flaws or incomplete explanations |
4 |
Highly Correct | High technical correctness with precise definitions and clear explanations |
5 |
Exceptionally Correct | Exceptional technical correctness with formal proofs and flawless content |
6 |
Not Applicable/Indeterminate | No technical content or insufficient context |
Education Level
Assesses the appropriate educational background required to comprehend the content:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main education level code | eai_taxonomy.education_level.primary.code |
| Primary Label | Main education level label | eai_taxonomy.education_level.primary.label |
| Secondary Code | Alternative education level code | eai_taxonomy.education_level.secondary.code |
| Secondary Label | Alternative education level label | eai_taxonomy.education_level.secondary.label |
Possible Values:
| Code | Label | Description |
|---|---|---|
-1 |
Abstain | Unable to determine |
1 |
General Audience | Accessible to anyone with basic literacy; simple terms |
2 |
High School Level | Requires high school education; specialized terminology explained for non-experts |
3 |
Undergraduate Level | Requires college education; uses specialized terminology and assumes background knowledge |
4 |
Graduate/Expert Level | Requires graduate education or domain expertise; assumes deep background knowledge |
5 |
Indeterminate | Insufficient content to judge educational level |
Metadata
Metadata Structure
The metadata field contains a nested structure with web archive information:
| Field | Type | Description | Path |
|---|---|---|---|
| URL Information | |||
| URL | String |
Original URL of the document | metadata.url |
| Source Domain | String |
Domain name of the source | metadata.source_domain |
| Snapshot ID | String |
Identifier for the web archive snapshot | metadata.snapshot_id |
| WARC Metadata | WARC (Web ARChive) format metadata | ||
| Content Length | String |
Size of the content | metadata.warc_metadata.Content-Length |
| Content Type | String |
MIME type of the content | metadata.warc_metadata.Content-Type |
| Block Digest | String |
Checksum of the WARC block | metadata.warc_metadata.WARC-Block-Digest |
| Concurrent To | String |
Related WARC records | metadata.warc_metadata.WARC-Concurrent-To |
| Date | String |
Timestamp of the crawl | metadata.warc_metadata.WARC-Date |
| IP Address | String |
Source server IP address | metadata.warc_metadata.WARC-IP-Address |
| Payload Type | String |
Identified content type | metadata.warc_metadata.WARC-Identified-Payload-Type |
| Payload Digest | String |
Checksum of the payload | metadata.warc_metadata.WARC-Payload-Digest |
| Record ID | String |
Unique WARC record identifier | metadata.warc_metadata.WARC-Record-ID |
| Target URI | String |
Original target URL | metadata.warc_metadata.WARC-Target-URI |
| Truncated | String |
Truncation status | metadata.warc_metadata.WARC-Truncated |
| Type | String |
WARC record type | metadata.warc_metadata.WARC-Type |
| Warcinfo ID | String |
Associated warcinfo record | metadata.warc_metadata.WARC-Warcinfo-ID |
| Additional Info | |||
| WARC Info | String |
Additional WARC information | metadata.warc_info |
Quality Signals
The dataset includes two comprehensive quality assessment frameworks:
Red Pajama v2 Quality Metrics
Text quality indicators derived from the Red Pajama v2 filtering pipeline:
Content Structure Metrics
| Metric | Description | Path |
|---|---|---|
| Original Length | Original document length | quality_signals.red_pajama_v2.ccnet_original_length |
| Original Lines | Number of lines in original document | quality_signals.red_pajama_v2.ccnet_original_nlines |
| Sentence Count | Total sentence count | quality_signals.red_pajama_v2.rps_doc_num_sentences |
| Word Count | Total word count | quality_signals.red_pajama_v2.rps_doc_word_count |
| Mean Word Length | Average word length | quality_signals.red_pajama_v2.rps_doc_mean_word_length |
Language Quality Metrics
| Metric | Description | Path |
|---|---|---|
| Stop Word Fraction | Proportion of stop words | quality_signals.red_pajama_v2.rps_doc_stop_word_fraction |
| Unique Words Fraction | Fraction of unique words | quality_signals.red_pajama_v2.rps_doc_frac_unique_words |
| All Caps Words | Fraction of words in all capitals | quality_signals.red_pajama_v2.rps_doc_frac_all_caps_words |
| Non-Alphabetic Words | Fraction of non-alphabetic words | quality_signals.red_pajama_v2.rps_doc_frac_no_alph_words |
| Unigram Entropy | Entropy measure of word distribution | quality_signals.red_pajama_v2.rps_doc_unigram_entropy |
Content Pattern Analysis
| Metric | Description | Path |
|---|---|---|
| Curly Bracket Density | Curly bracket density (code indicator) | quality_signals.red_pajama_v2.rps_doc_curly_bracket |
| Symbol-to-Word Ratio | Symbol-to-word ratio | quality_signals.red_pajama_v2.rps_doc_symbol_to_word_ratio |
| Ellipsis Line Endings | Lines ending with ellipsis | quality_signals.red_pajama_v2.rps_doc_frac_lines_end_with_ellipsis |
| Lorem Ipsum Detection | Lorem ipsum text detection | quality_signals.red_pajama_v2.rps_doc_lorem_ipsum |
| Offensive Content | Potentially offensive content detection | quality_signals.red_pajama_v2.rps_doc_ldnoobw_words |
| UT1 Blacklist | UT1 blacklist filtering score | quality_signals.red_pajama_v2.rps_doc_ut1_blacklist |
Duplication Detection
| Metric | Description | Path |
|---|---|---|
| 5-gram Duplication | Character-level duplication for 5-grams | quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_5grams |
| 6-gram Duplication | Character-level duplication for 6-grams | quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_6grams |
| 7-gram Duplication | Character-level duplication for 7-grams | quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_7grams |
| 8-gram Duplication | Character-level duplication for 8-grams | quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_8grams |
| 9-gram Duplication | Character-level duplication for 9-grams | quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_9grams |
| 10-gram Duplication | Character-level duplication for 10-grams | quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_10grams |
| Top 2-gram Coverage | Most frequent 2-gram coverage | quality_signals.red_pajama_v2.rps_doc_frac_chars_top_2gram |
| Top 3-gram Coverage | Most frequent 3-gram coverage | quality_signals.red_pajama_v2.rps_doc_frac_chars_top_3gram |
| Top 4-gram Coverage | Most frequent 4-gram coverage | quality_signals.red_pajama_v2.rps_doc_frac_chars_top_4gram |
Domain Importance Scores
| Metric | Description | Path |
|---|---|---|
| Books Importance | Similarity to book content | quality_signals.red_pajama_v2.rps_doc_books_importance |
| Books Importance (Length Corrected) | Length-corrected books similarity | quality_signals.red_pajama_v2.rps_doc_books_importance_length_correction |
| OpenWebText Importance | Similarity to OpenWebText | quality_signals.red_pajama_v2.rps_doc_openwebtext_importance |
| OpenWebText Importance (Length Corrected) | Length-corrected OpenWebText similarity | quality_signals.red_pajama_v2.rps_doc_openwebtext_importance_length_correction |
| Wikipedia Importance | Similarity to Wikipedia | quality_signals.red_pajama_v2.rps_doc_wikipedia_importance |
| Wikipedia Importance (Length Corrected) | Length-corrected Wikipedia similarity | quality_signals.red_pajama_v2.rps_doc_wikipedia_importance_length_correction |
FastText Classification Scores
Domain and content type classification probabilities:
| Metric | Description | Path |
|---|---|---|
| DCLM Score | DataComp-LM classifier score | quality_signals.fasttext.dclm |
| English Confidence | English language confidence | quality_signals.fasttext.english |
| Educational Content | Educational content approximation | quality_signals.fasttext.fineweb_edu_approx |
| General Math | General mathematics content | quality_signals.fasttext.eai_general_math |
| Web Math | OWM Web-based mathematics content | quality_signals.fasttext.eai_open_web_math |
| Code Content | Code content detection | quality_signals.fasttext.eai_web_code |
How to Load the Dataset
This section provides examples of how to load the EssentialAI/eai-taxonomy-code-w-dclm-100b-sample dataset using different Python libraries and frameworks.
Using Hugging Face Datasets (Standard Method)
The simplest way to load the dataset is using the Hugging Face datasets library:
from datasets import load_dataset
# Load the entire dataset
dataset = load_dataset("EssentialAI/eai-taxonomy-code-w-dclm-100b-sample")
# View dataset structure
print(dataset)
print(f"Number of examples: {len(dataset['train'])}")
You can also load the dataset in streaming mode to avoid downloading the entire dataset at once:
from datasets import load_dataset
# Load in streaming mode
dataset = load_dataset("EssentialAI/eai-taxonomy-code-w-dclm-100b-sample", streaming=True)
data_stream = dataset["train"]
# Iterate through examples
for example in data_stream.take(5):
print(example)
Using PySpark
For large-scale distributed processing, you can load the dataset using PySpark with the pyspark_huggingface library:
# First install the required library:
# pip install pyspark_huggingface
import pyspark_huggingface
from pyspark.sql import SparkSession
# Initialize Spark session
spark = SparkSession.builder.appName("EAI-Taxonomy-Code-w-DCLM").getOrCreate()
# Load the dataset using the "huggingface" data source
df = spark.read.format("huggingface").load("EssentialAI/eai-taxonomy-code-w-dclm-100b-sample")
# Basic dataset exploration
print(f"Dataset shape: {df.count()} rows, {len(df.columns)} columns")
df.show(10)
df.printSchema()
# Load only specific columns for efficiency
df_subset = (
spark.read.format("huggingface")
.option("columns", '["column1", "column2"]') # Replace with actual column names
.load("EssentialAI/eai-taxonomy-code-w-dclm-100b-sample")
)
# Run SQL queries on the dataset
df.createOrReplaceTempView("eai_taxonomy_code_w_dclm_dataset")
result = spark.sql("""
SELECT COUNT(*) as total_examples
FROM eai_taxonomy_code_w_dclm_dataset
""")
result.show()
Using Daft
Daft provides a modern DataFrame library optimized for machine learning workloads. You can load the dataset directly from Hugging Face:
import daft
# Load the entire dataset
df = daft.read_parquet("hf://datasets/EssentialAI/eai-taxonomy-code-w-dclm-100b-sample")
# Basic exploration
print("Dataset schema:")
df.schema()
print("First 5 rows:")
df.show(5)
If you need to access private datasets or use authentication:
import daft
from daft.io import IOConfig, HTTPConfig
io_config = IOConfig(http=HTTPConfig(bearer_token="your_token"))
df = daft.read_parquet("hf://datasets/EssentialAI/eai-taxonomy-code-w-dclm-100b-sample", io_config=io_config)
Installation Requirements
Make sure you have the required libraries installed:
# For Hugging Face datasets
pip install datasets
# For PySpark with Hugging Face integration
pip install pyspark_huggingface
# For Daft
pip install daft
📝 Citation
@misc{ai2025essentialwebv1024ttokens,
title={Essential-Web v1.0: 24T tokens of organized web data},
author={Essential AI and : and Andrew Hojel and Michael Pust and Tim Romanski and Yash Vanjani and Ritvik Kapila and Mohit Parmar and Adarsh Chaluvaraju and Alok Tripathy and Anil Thomas and Ashish Tanwer and Darsh J Shah and Ishaan Shah and Karl Stratos and Khoi Nguyen and Kurt Smith and Michael Callahan and Peter Rushton and Philip Monk and Platon Mazarakis and Saad Jamal and Saurabh Srivastava and Somanshu Singla and Ashish Vaswani},
year={2025},
eprint={2506.14111},
archivePrefix={arXiv},
primaryClass={cs.CL},
url={https://arxiv.org/abs/2506.14111},
}
- Downloads last month
- 355
Size of downloaded dataset files:
266 GB
Size of the auto-converted Parquet files:
266 GB
Number of rows:
46,192,864