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
|
-5,857,686,182,797,001,000 |
Example: Towers of Hanoi
Published 2010-05-25 | Authors: Berteun Damman, Martin Hofmann
Towers of Hanoi illustrated and computed by TeX. The problem is solved in TeX and for every move the situation is drawn. The idea and visualization were by Martin Hofmann, Berteun Damman programmed the actual recursion.
Download as: [PDF] [TEX] • [Open in writeLaTeX]
Towers of Hanoi
Do you have a question regarding this example, TikZ or LaTeX in general? Just ask in the LaTeX Forum.
Oder frag auf Deutsch auf TeXwelt.de.
%Towers of Hanoi illustrated and computed by TeX. The problem is solved in
%TeX and for every move the situation is drawn. The idea and visualization were
%by Martin Hofmann, Berteun Damman programmed the actual recursion.
%
% Authors: Martin Hofmann and Berteun Damman
% This is needed for a hyperref/beamer interaction bug
\RequirePackage{atbegshi}
\documentclass{beamer}
\usepackage{scalefnt}
\hypersetup{pdfpagemode=FullScreen}
\usetheme{Warsaw}
\usepackage{tikz}
\usetikzlibrary{shadows,patterns,shapes}
% The logic for Hanoi, we record the discs at every pole
% as a comma separated list ending with a '.'; i.e. the
% starting list for 4 discs would be 1,2,3,4,.
\newcount\ndiscs
\def\initpoles#1{
\def\disclist{}
\foreach \n in {1,...,#1} {
\xdef\disclist{\disclist\n,}
}
\expandafter\xdef\csname pole 1\endcsname{\disclist.}
\expandafter\gdef\csname pole 2\endcsname{.}
\expandafter\gdef\csname pole 3\endcsname{.}
}
% Delimited macro; #1 is everything up to the first ',' and
% #2 everything after it.
\def\head#1,#2.{#1}
\def\tail#1,#2.{#2}
% This macro updates the disc lists, its arguments are the name
% names of the macro's corresponding to the poles, for example
% 'pole 1' and 'pole 3'.
\def\movedisc#1#2{
\edef\lista{\csname #1\endcsname}
\edef\listb{\csname #2\endcsname}
\expandafter\xdef\csname #2\endcsname{\expandafter\head\lista,\listb}
\expandafter\xdef\csname #1\endcsname{\expandafter\tail\lista.}
}
% Updates the lists and then draws a new frame.
\def\move#1#2{
\movedisc{pole #1}{pole #2}
\gdef\fmsg{\node[anchor=north] at (3.8,-.5) {Moved disc from pole #1 to pole #2.};}
\drawpoles
}
% This macro boils down to a well-known recursive solution, as given
% here for example: http://en.wikipedia.org/wiki/Towers_of_Hanoi#Recursive_solution
%
% #1 Pole to move from
% #2 Pole to move to
% #3 Pole to use as scratch
% #4 Number of disks
\def\rhanoi#1#2#3#4{
\ifnum#4>1
{\advance#4 by -1 \rhanoi#1#3#2#4}
\move{#1}{#3}
{\advance#4 by -1 \rhanoi#2#1#3#4}
\else
\move{#1}{#3}
\fi
}
% Below is the TikZ code to draw the towers:
\tikzset{
disc/.style={shade, shading=radial, rounded rectangle,minimum height=.5cm,
inner color=#1!20, outer color=#1!60!gray},
disc 1/.style={disc=yellow, minimum width=15mm},
disc 2/.style={disc=orange, minimum width=20mm},
disc 3/.style={disc=red, minimum width=25mm},
disc 4/.style={disc=green, minimum width=30mm},
disc 5/.style={disc=blue, minimum width=35mm},
disc 6/.style={disc=purple, minimum width=40mm},
}
% Define some colors, I don't like plain green and brown.
\definecolor{darkgreen}{rgb}{0.2,0.55,0}
\definecolor{darkbrown}{rgb}{0.375,0.25,0.125}
\newcommand{\pole}{
\fill[darkbrown] (-1.6cm, 0) rectangle (1.6cm,0.25cm)
(-1.25mm,2.5mm) rectangle (1.25mm,4.25cm);
}
% Because the list starts with the topmost disc, we
% use two recursive macro's to invert the drawing process.
\newcount\curlevel
% This macro checks whether the list is empty, if not,
% it calls \rdrawdiscs which removes one element and
% calls this one again.
\def\drawdiscs#1.{
% If #1 is empty, this expands to \if.. which is true, otherwise
% we're safe to assume there's at least one element.
\expandafter\if#1..\else
\rdrawdiscs#1.
\advance\curlevel by 1\relax
\fi
}
\def\rdrawdiscs#1,#2.{
\drawdiscs#2.
{\edef\n{\the\curlevel}
% Draw the actual disk.
\node[disc #1,yshift={\n*5mm}] {#1};
}
}
\def\discs#1{
\curlevel=1
\expandafter\drawdiscs#1
}
% Draws the whole situation based on the lists.
\def\drawpoles{
\begin{frame}{\ftitle}
\begin{tikzpicture}
\foreach \n/\x in {1/0cm,2/3.8cm,3/7.6cm} {
\begin{scope}[xshift=\x]
\pole
\expandafter\discs\csname pole \n\endcsname
\end{scope}
}
% Macro that either contains something like OK or
% the last move.
\fmsg
% We use this to prevent the picture from jumping between
% frames.
\useasboundingbox (-1.6cm,-1.2cm) rectangle (9.2cm,4.25cm);
\end{tikzpicture}
\end{frame}
}
% Main macro, inits the lists for the current number, sets a title
% for the frame and starts the recursion.
\def\hanoi#1{
\ndiscs=#1
\initpoles{#1}
\ifnum\ndiscs=1
\xdef\ftitle{Tower of Hanoi -- \the\ndiscs\ Disc}
\else
\xdef\ftitle{Tower of Hanoi -- \the\ndiscs\ Discs}
\fi
\gdef\fmsg{}
% Starting frame.
\drawpoles
% Recursion draws a new frame for every step.
\rhanoi{1}{2}{3}{\ndiscs}
% Final frame.
\gdef\fmsg{\node[] at (3.8,2.5) {\Huge\scalefont{2}\color{darkgreen}OK};}
\drawpoles
}
\begin{document}
\hanoi{1}
\hanoi{2}
\hanoi{3}
\hanoi{4}
% For 5 discs we don't show everything (although it could be done).
\ndiscs=5
\initpoles{5}
\def\ftitle{Tower of Hanoi -- \the\ndiscs\ Disc}
\def\fmsg{\node[cloud, draw, fill=gray!20, aspect=2] at (3.8,2.5) {\Huge\scalefont{2}?};}
\drawpoles
\end{document}
Comments
• #1 Sebastian, May 29, 2012 at 3:50 p.m.
For some reason this does not work when trying to compile. (atbegshi.sty not found)
• #2 Mr. Platypus, June 27, 2012 at 6:24 p.m.
@Sebastian: Then install the package. :-)
Adding comments is currently not enabled.
|
{
"url": "http://www.texample.net/tikz/examples/towers-of-hanoi/",
"source_domain": "www.texample.net",
"snapshot_id": "crawl=CC-MAIN-2015-14",
"warc_metadata": {
"Content-Length": "22352",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NGATMUUQWWV3WVLXAQZWR74EJJYUTNG2",
"WARC-Concurrent-To": "<urn:uuid:d26cf075-3787-4afb-be3a-763c0f223e07>",
"WARC-Date": "2015-03-29T01:01:43Z",
"WARC-IP-Address": "78.46.26.61",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HQXUXNDJAT4YIA2HTVUIZ6X5CH6DEJOG",
"WARC-Record-ID": "<urn:uuid:6e23dd5c-32ce-452e-b0a3-405f54858150>",
"WARC-Target-URI": "http://www.texample.net/tikz/examples/towers-of-hanoi/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ad0d909a-f67a-41f6-8589-8f496f15c873>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-168-14-71.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-14\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
2,
3,
28,
29,
92,
93,
313,
314,
364,
365,
381,
382,
484,
522,
523,
598,
678,
746,
748,
793,
794,
849,
875,
898,
920,
921,
957,
975,
976,
994,
1035,
1036,
1093,
1149,
1196,
1213,
1231,
1251,
1283,
1320,
1326,
1384,
1433,
1482,
1484,
1485,
1545,
1571,
1591,
1611,
1612,
1676,
1739,
1764,
1783,
1821,
1859,
1933,
2001,
2003,
2004,
2052,
2067,
2099,
2187,
2202,
2204,
2205,
2274,
2358,
2360,
2383,
2404,
2432,
2453,
2474,
2489,
2532,
2554,
2597,
2607,
2629,
2637,
2639,
2640,
2685,
2695,
2774,
2826,
2879,
2932,
2982,
3034,
3085,
3138,
3140,
3141,
3199,
3240,
3287,
3288,
3308,
3364,
3411,
3413,
3414,
3466,
3525,
3544,
3545,
3600,
3653,
3677,
3696,
3765,
3822,
3851,
3874,
3911,
3919,
3921,
3922,
3945,
3963,
3991,
4023,
4068,
4074,
4076,
4077,
4091,
4107,
4136,
4138,
4139,
4187,
4203,
4230,
4254,
4306,
4343,
4365,
4425,
4449,
4459,
4517,
4542,
4556,
4622,
4640,
4708,
4730,
4746,
4748,
4749,
4816,
4858,
4872,
4887,
4906,
4926,
4984,
4994,
5053,
5061,
5078,
5100,
5115,
5165,
5195,
5214,
5292,
5307,
5309,
5310,
5327,
5341,
5355,
5369,
5383,
5384,
5456,
5470,
5488,
5541,
5635,
5650,
5665,
5666,
5675,
5676,
5720,
5721,
5809,
5810,
5858,
5859,
5905,
5906,
5948,
5949
],
"line_end_idx": [
2,
3,
28,
29,
92,
93,
313,
314,
364,
365,
381,
382,
484,
522,
523,
598,
678,
746,
748,
793,
794,
849,
875,
898,
920,
921,
957,
975,
976,
994,
1035,
1036,
1093,
1149,
1196,
1213,
1231,
1251,
1283,
1320,
1326,
1384,
1433,
1482,
1484,
1485,
1545,
1571,
1591,
1611,
1612,
1676,
1739,
1764,
1783,
1821,
1859,
1933,
2001,
2003,
2004,
2052,
2067,
2099,
2187,
2202,
2204,
2205,
2274,
2358,
2360,
2383,
2404,
2432,
2453,
2474,
2489,
2532,
2554,
2597,
2607,
2629,
2637,
2639,
2640,
2685,
2695,
2774,
2826,
2879,
2932,
2982,
3034,
3085,
3138,
3140,
3141,
3199,
3240,
3287,
3288,
3308,
3364,
3411,
3413,
3414,
3466,
3525,
3544,
3545,
3600,
3653,
3677,
3696,
3765,
3822,
3851,
3874,
3911,
3919,
3921,
3922,
3945,
3963,
3991,
4023,
4068,
4074,
4076,
4077,
4091,
4107,
4136,
4138,
4139,
4187,
4203,
4230,
4254,
4306,
4343,
4365,
4425,
4449,
4459,
4517,
4542,
4556,
4622,
4640,
4708,
4730,
4746,
4748,
4749,
4816,
4858,
4872,
4887,
4906,
4926,
4984,
4994,
5053,
5061,
5078,
5100,
5115,
5165,
5195,
5214,
5292,
5307,
5309,
5310,
5327,
5341,
5355,
5369,
5383,
5384,
5456,
5470,
5488,
5541,
5635,
5650,
5665,
5666,
5675,
5676,
5720,
5721,
5809,
5810,
5858,
5859,
5905,
5906,
5948,
5949,
5950
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5950,
"ccnet_original_nlines": 201,
"rps_doc_curly_bracket": 0.030588239431381226,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.15267175436019897,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0031806600745767355,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5146310329437256,
"rps_doc_frac_unique_words": 0.5234375,
"rps_doc_mean_word_length": 6.176562309265137,
"rps_doc_num_sentences": 92,
"rps_doc_symbol_to_word_ratio": 0.04134859889745712,
"rps_doc_unigram_entropy": 5.379179954528809,
"rps_doc_word_count": 640,
"rps_doc_frac_chars_dupe_10grams": 0.09107007086277008,
"rps_doc_frac_chars_dupe_5grams": 0.09107007086277008,
"rps_doc_frac_chars_dupe_6grams": 0.09107007086277008,
"rps_doc_frac_chars_dupe_7grams": 0.09107007086277008,
"rps_doc_frac_chars_dupe_8grams": 0.09107007086277008,
"rps_doc_frac_chars_dupe_9grams": 0.09107007086277008,
"rps_doc_frac_chars_top_2gram": 0.012395650148391724,
"rps_doc_frac_chars_top_3gram": 0.013154570013284683,
"rps_doc_frac_chars_top_4gram": 0.012142679654061794,
"rps_doc_books_importance": -923.0215454101562,
"rps_doc_books_importance_length_correction": -923.0215454101562,
"rps_doc_openwebtext_importance": -370.4253234863281,
"rps_doc_openwebtext_importance_length_correction": -370.4253234863281,
"rps_doc_wikipedia_importance": -133.5825958251953,
"rps_doc_wikipedia_importance_length_correction": -133.5825958251953
},
"fasttext": {
"dclm": 0.034689489752054214,
"english": 0.6759854555130005,
"fineweb_edu_approx": 1.4905823469161987,
"eai_general_math": 0.9507036805152893,
"eai_open_web_math": 0.9208403825759888,
"eai_web_code": 0.7299254536628723
}
}
|
{
"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": "511.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
3,893,387,544,577,266,000 |
Skip over navigation
Documentation
You are currently viewing documentation for a previously released version of OroCommerce. See the latest long-term support version.
MySQL Optimization
How To Avoid Performance Issuses When MySQL Data is Stored on HDD
It is recommended to use SSD to store the data in the MySQL 5.X database. However, if you do need to use the HDD, follow the steps described in the optimizing InnoDB Disk I/O article to avoid performance issues and set the following configuration parameters in the /etc/my.cnf file:
[mysqld]
innodb_file_per_table = 0
wait_timeout = 28800
Usage of The utf8mb4 Character Set (The Full 4-Byte UTF-8 Unicode Encoding) in MySQL
To store supplementary characters (such as 4-byte emojis), configure the options file to use the utf8mb4 character set. Put the following configuration settings in your options file /etc/my.cnf:
[client]
default-character-set = utf8mb4
[mysql]
default-character-set = utf8mb4
[mysqld]
character-set-server = utf8mb4
collation-server = utf8mb4_unicode_ci
MySQL also can load default options from another file (not /etc/my.cnf). In such cases, you have to put the configuration settings in this file. To find out which configuration files your MySQL server uses, run the following command:
$ mysqld --help --verbose 2> /dev/null | grep -A1 'Default options'
You will get the output with MySQL config files names similar to this:
Default options are read from the following files in the given order:
/etc/my.cnf /etc/mysql/my.cnf /usr/local/etc/my.cnf ~/.my.cnf
Note
You also can set up the character set and the collation on the other levels as well.
If you use the version of MySQL that is older than 5.7, the following configuration parameters should be set in the /etc/my.cnf file:
[mysqld]
innodb_file_format = Barracuda
innodb_large_prefix = 1
Since MySQL 5.7, these parameters are set by default.
You can find more information on MySQL configuration in the Unicode Support and InnoDB File-Format Management articles.
You can also change the defaults for Doctrine so that the generated SQL uses the correct character set. To achieve this, put the following configuration into the config/config.yml file:
doctrine:
dbal:
charset: utf8mb4
default_table_options:
charset: utf8mb4
collate: utf8mb4_unicode_ci
Note
If you use the version of MySQL that is older than 5.7, also add the row_format: DYNAMIC option to the default_table_options section.
For more details, please see the Setting up the Database to be UTF8 article.
Forums
Back to top
|
{
"url": "https://oroinc.com/b2b-ecommerce/doc/1.6/install-upgrade/reinstall-and-troubleshooting/mysql-optimization/",
"source_domain": "oroinc.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "200601",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OQFYHAEMKCVDGVRH2FCJMMHVHRRJWG3C",
"WARC-Concurrent-To": "<urn:uuid:5ed4ede3-fd50-4a63-b5a2-e17bc7ffe7c2>",
"WARC-Date": "2023-02-06T10:14:15Z",
"WARC-IP-Address": "35.227.210.216",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UCSJT64JIJ54DYWKIH2LLVIIXPGUAAKE",
"WARC-Record-ID": "<urn:uuid:beade925-4382-49ae-bff9-b0975ec94162>",
"WARC-Target-URI": "https://oroinc.com/b2b-ecommerce/doc/1.6/install-upgrade/reinstall-and-troubleshooting/mysql-optimization/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5ca87198-2988-468f-9e9e-0173d21c444f>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-197\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,
21,
35,
167,
168,
187,
188,
254,
255,
538,
539,
548,
574,
595,
596,
681,
682,
877,
878,
887,
919,
920,
928,
960,
961,
970,
1001,
1039,
1040,
1274,
1275,
1343,
1344,
1415,
1416,
1486,
1548,
1549,
1554,
1555,
1640,
1641,
1775,
1776,
1785,
1816,
1840,
1841,
1895,
1896,
2016,
2017,
2203,
2204,
2214,
2224,
2249,
2280,
2309,
2349,
2350,
2355,
2356,
2490,
2491,
2568,
2569,
2576
],
"line_end_idx": [
21,
35,
167,
168,
187,
188,
254,
255,
538,
539,
548,
574,
595,
596,
681,
682,
877,
878,
887,
919,
920,
928,
960,
961,
970,
1001,
1039,
1040,
1274,
1275,
1343,
1344,
1415,
1416,
1486,
1548,
1549,
1554,
1555,
1640,
1641,
1775,
1776,
1785,
1816,
1840,
1841,
1895,
1896,
2016,
2017,
2203,
2204,
2214,
2224,
2249,
2280,
2309,
2349,
2350,
2355,
2356,
2490,
2491,
2568,
2569,
2576,
2587
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2587,
"ccnet_original_nlines": 67,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3051823377609253,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021113239228725433,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24376200139522552,
"rps_doc_frac_unique_words": 0.47297295928001404,
"rps_doc_mean_word_length": 5.413513660430908,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.693577289581299,
"rps_doc_word_count": 370,
"rps_doc_frac_chars_dupe_10grams": 0.04193709045648575,
"rps_doc_frac_chars_dupe_5grams": 0.0649026483297348,
"rps_doc_frac_chars_dupe_6grams": 0.04193709045648575,
"rps_doc_frac_chars_dupe_7grams": 0.04193709045648575,
"rps_doc_frac_chars_dupe_8grams": 0.04193709045648575,
"rps_doc_frac_chars_dupe_9grams": 0.04193709045648575,
"rps_doc_frac_chars_top_2gram": 0.014977529644966125,
"rps_doc_frac_chars_top_3gram": 0.04992511123418808,
"rps_doc_frac_chars_top_4gram": 0.034947581589221954,
"rps_doc_books_importance": -271.44085693359375,
"rps_doc_books_importance_length_correction": -271.44085693359375,
"rps_doc_openwebtext_importance": -103.37742614746094,
"rps_doc_openwebtext_importance_length_correction": -103.37742614746094,
"rps_doc_wikipedia_importance": -81.79341888427734,
"rps_doc_wikipedia_importance_length_correction": -81.79341888427734
},
"fasttext": {
"dclm": 0.30951523780822754,
"english": 0.7665400505065918,
"fineweb_edu_approx": 2.4131271839141846,
"eai_general_math": 0.7934830188751221,
"eai_open_web_math": 0.282695472240448,
"eai_web_code": 0.558957040309906
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
8,031,562,641,808,501,000 |
How many images can I store on my card?
One of the most useful image formats is JPEG (short for Joint Photographic Experts Group), which uses a .jpg file extension. JPEG compresses files to create a smaller size file. On a digital camera a "quality" setting sets how much compression is used when saving the file. The levels are often referred to as fine, normal and basic. These settings are associated with a compression ratio.
The higher the level of compression you choose, the smaller the size of the file. The drawback to this compression is that every time the file is saved again, a small amount of image quality is lost. This method is similar to making a photocopy of a photocopy of a photocopy. Each successive copy is slightly reduced in quality from the original. If the image is going to be edited and saved numerous times, then another file format such as Tagged Image File Format (TIFF) should be used for the interim saves of the file. The TIFF file format is lossless, it does not lose image quality in exchange for a smaller file size, but it also does not compress files, so files are larger and require more space to store. Note: A new image format JPEG 2000 is rapidly gaining support and this allows for 'lossless' compression i.e. an image can be saved multiple times without loss of quality.
Estimate of Image Capacity
Memory Cards Number of images
Storage Capacity 2 MP 3 MP 4 MP 5 MP 6 MP 8 MP
128 MB 150 115 95 75 60 40
256 MB 300 230 180 150 120 80
512 MB 600 450 380 300 240 160
1 GB 1200 900 760 600 480 320
2 GB 2400 1800 1520 1190 950 635
4 GB 4800 3600 3050 2400 1900 1300
8 GB 9500 7200 6100 4800 3800 2500
Notes
1) Some of your cards listed capacity is used for formatting and other functions and hence is not available for image storage.
2) Please note these are estimates only and are for standard JPEG images. The JPEG file sizes will vary depending not only on your camera model and its default settings, but also the compression mode settings and the subject matter in your photos.
MP=Megapixels: 1 Megabyte (MB) = 1,000,000 bytes; 1 Gigabyte (GB) = 1,000 Megabytes
The file sizes and number of images stored on memory are an average only. As is the case with JPEG it's difficult to predict the size of an image because it will vary a fair amount depending on the content of the image (especially the amount of detail captured). For example, take a photograph of a fairly empty wall and you'll get a small JPEG, take a photograph of a crowd of people with a lot of detail and you'll get a larger image. Different camera manufacturers also use slightly different compression ratios and different terms for describing them.
Loading...
Home | Services | Contact Us | Help | Terms of Service | Privacy Policy | FrogPrints Australia
© FrogPrints 2019 - Online Digital Photo Prints, Photo Books & Gifts
|
{
"url": "http://frogprints.co.nz/help/compression.cfm",
"source_domain": "frogprints.co.nz",
"snapshot_id": "crawl=CC-MAIN-2019-18",
"warc_metadata": {
"Content-Length": "19944",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NVWQ4ZSOOZJZNJBKRUHG6RJKLZLXLCNA",
"WARC-Concurrent-To": "<urn:uuid:a292a607-69b4-4ee8-b881-95e9355d926e>",
"WARC-Date": "2019-04-19T12:35:14Z",
"WARC-IP-Address": "113.21.225.3",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:R7PWMQ6BNDTY4RBH66U2QXYLWEDPO4LN",
"WARC-Record-ID": "<urn:uuid:9c9d5a04-83e1-484b-8708-5d39a1703ef5>",
"WARC-Target-URI": "http://frogprints.co.nz/help/compression.cfm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:efb16b42-1f22-422b-b68a-47224a01a004>"
},
"warc_info": "isPartOf: CC-MAIN-2019-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-109-209-241.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
40,
42,
432,
434,
1321,
1323,
1350,
1380,
1427,
1454,
1484,
1515,
1545,
1578,
1613,
1648,
1654,
1781,
2029,
2113,
2114,
2116,
2672,
2674,
2685,
2780
],
"line_end_idx": [
40,
42,
432,
434,
1321,
1323,
1350,
1380,
1427,
1454,
1484,
1515,
1545,
1578,
1613,
1648,
1654,
1781,
2029,
2113,
2114,
2116,
2672,
2674,
2685,
2780,
2848
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2848,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3350253701210022,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04568528011441231,
"rps_doc_frac_lines_end_with_ellipsis": 0.037037041038274765,
"rps_doc_frac_no_alph_words": 0.23181049525737762,
"rps_doc_frac_unique_words": 0.5087719559669495,
"rps_doc_mean_word_length": 4.3684210777282715,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0.001692050020210445,
"rps_doc_unigram_entropy": 5.109859943389893,
"rps_doc_word_count": 513,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.031236059963703156,
"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.015618029981851578,
"rps_doc_frac_chars_top_3gram": 0.013386880047619343,
"rps_doc_frac_chars_top_4gram": 0.010709499940276146,
"rps_doc_books_importance": -292.0692443847656,
"rps_doc_books_importance_length_correction": -292.0692443847656,
"rps_doc_openwebtext_importance": -158.39666748046875,
"rps_doc_openwebtext_importance_length_correction": -158.39666748046875,
"rps_doc_wikipedia_importance": -114.63174438476562,
"rps_doc_wikipedia_importance_length_correction": -114.63174438476562
},
"fasttext": {
"dclm": 0.07911372184753418,
"english": 0.8845862746238708,
"fineweb_edu_approx": 2.408862590789795,
"eai_general_math": 0.09530150890350342,
"eai_open_web_math": 0.3760204315185547,
"eai_web_code": 0.014946820214390755
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "686.222",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Handicraft and Occupations",
"level_3": "Bookbinding and Printing"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-8,883,490,535,848,037,000 |
xfs
[Top] [All Lists]
[PATCH 03/28] xfs: work around bogus gcc warning in xfs_allocbt_init_cur
To: xfs@xxxxxxxxxxx
Subject: [PATCH 03/28] xfs: work around bogus gcc warning in xfs_allocbt_init_cursor
From: Christoph Hellwig <hch@xxxxxxxxxxxxx>
Date: Thu, 07 Jul 2011 07:05:38 -0400
References: <20110707110535.205001532@xxxxxxxxxxxxxxxxxxxxxx>
User-agent: quilt/0.48-1
GCC 4.6 complains about an array subscript is above array bounds when
using the btree index to index into the agf_levels array. The only
two indices passed in are 0 and 1, and we have an assert insuring that.
Replace the trick of using the array index directly with using constants
in the already existing branch for assigning the XFS_BTREE_LASTREC_UPDATE
flag.
Signed-off-by: Christoph Hellwig <hch@xxxxxx>
Reviewed-by: Alex Elder <aelder@xxxxxxx>
Reviewed-by: Dave Chinner <dchinner@xxxxxxxxxx>
Index: xfs/fs/xfs/xfs_alloc_btree.c
===================================================================
--- xfs.orig/fs/xfs/xfs_alloc_btree.c 2011-06-17 14:16:27.929065669 +0200
+++ xfs/fs/xfs/xfs_alloc_btree.c 2011-06-17 14:17:22.145729599 +0200
@@ -427,13 +427,16 @@ xfs_allocbt_init_cursor(
cur->bc_tp = tp;
cur->bc_mp = mp;
- cur->bc_nlevels = be32_to_cpu(agf->agf_levels[btnum]);
cur->bc_btnum = btnum;
cur->bc_blocklog = mp->m_sb.sb_blocklog;
-
cur->bc_ops = &xfs_allocbt_ops;
- if (btnum == XFS_BTNUM_CNT)
+
+ if (btnum == XFS_BTNUM_CNT) {
+ cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]);
cur->bc_flags = XFS_BTREE_LASTREC_UPDATE;
+ } else {
+ cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]);
+ }
cur->bc_private.a.agbp = agbp;
cur->bc_private.a.agno = agno;
<Prev in Thread] Current Thread [Next in Thread>
|
{
"url": "http://oss.sgi.com/archives/xfs/2011-07/msg00184.html",
"source_domain": "oss.sgi.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "10177",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:E2VLLW6RGWIUUF4R6FIC4WCTNNH27OQW",
"WARC-Concurrent-To": "<urn:uuid:86071100-bbd1-4f70-b7eb-5a545c787dd8>",
"WARC-Date": "2017-10-21T14:03:17Z",
"WARC-IP-Address": "192.48.182.195",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6UXM25PXBZ4DYSPHJODDVLWTKKWNREB3",
"WARC-Record-ID": "<urn:uuid:b668b546-88b7-44e5-86f2-b9489ee8f040>",
"WARC-Target-URI": "http://oss.sgi.com/archives/xfs/2011-07/msg00184.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2a701129-f477-42e4-894e-2147813743e9>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-152-37-148.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
4,
22,
23,
96,
97,
117,
202,
246,
284,
346,
371,
441,
509,
581,
582,
655,
729,
735,
736,
782,
823,
871,
872,
908,
976,
1052,
1128,
1175,
1177,
1202,
1227,
1290,
1321,
1370,
1372,
1412,
1448,
1450,
1488,
1567,
1625,
1642,
1721,
1731,
1733,
1772,
1811,
1812
],
"line_end_idx": [
4,
22,
23,
96,
97,
117,
202,
246,
284,
346,
371,
441,
509,
581,
582,
655,
729,
735,
736,
782,
823,
871,
872,
908,
976,
1052,
1128,
1175,
1177,
1202,
1227,
1290,
1321,
1370,
1372,
1412,
1448,
1450,
1488,
1567,
1625,
1642,
1721,
1731,
1733,
1772,
1811,
1812,
1860
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1860,
"ccnet_original_nlines": 48,
"rps_doc_curly_bracket": 0.002150540007278323,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12280701845884323,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02255639061331749,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5062656402587891,
"rps_doc_frac_unique_words": 0.7090908885002136,
"rps_doc_mean_word_length": 7.290909290313721,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.611539840698242,
"rps_doc_word_count": 165,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06483791023492813,
"rps_doc_frac_chars_dupe_6grams": 0.06483791023492813,
"rps_doc_frac_chars_dupe_7grams": 0.06483791023492813,
"rps_doc_frac_chars_dupe_8grams": 0.06483791023492813,
"rps_doc_frac_chars_dupe_9grams": 0.06483791023492813,
"rps_doc_frac_chars_top_2gram": 0.014962590299546719,
"rps_doc_frac_chars_top_3gram": 0.01995011977851391,
"rps_doc_frac_chars_top_4gram": 0.026600170880556107,
"rps_doc_books_importance": -176.5395965576172,
"rps_doc_books_importance_length_correction": -176.46426391601562,
"rps_doc_openwebtext_importance": -99.88761138916016,
"rps_doc_openwebtext_importance_length_correction": -99.88761138916016,
"rps_doc_wikipedia_importance": -80.41188049316406,
"rps_doc_wikipedia_importance_length_correction": -80.41183471679688
},
"fasttext": {
"dclm": 0.9619248509407043,
"english": 0.5565194487571716,
"fineweb_edu_approx": 2.758822202682495,
"eai_general_math": 0.3089672923088074,
"eai_open_web_math": 0.40657877922058105,
"eai_web_code": 0.0208284892141819
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-8,949,971,187,019,392,000 |
Need help getting started with modern web development
Discussion in 'Programming' started by NickelPlate, Feb 11, 2013.
1. NickelPlate
NickelPlate Senior member
Joined:
Nov 9, 2006
Messages:
636
Likes Received:
0
Hi Folks,
It's been a long time since I did basic web sites using authoring tools such as Front Page, Coffecup HTML editor etc.
My work requires me to start learning to develop using PHP and MySQL and I am a complete noob on both topics although not a stranger to programming. I need a way to get started and want to set up a windows based development environment on my local PC. Even though Linux/Ubuntu seems to be the most popular choice for this sort of thing, I want to stick with Windows because that's what I'm familiar with. The learning curve already is seeming pretty steep without having to learn a new OS.
Step 1 is I apparently need web server software and Apache seems the popular choice (I don't know anything about Apache either). However they (Apache or whomever "they" are) don't provide binary installers for their latest version only source code which needs to be compiled first using any number of tools. I have Visual Studio 2010 which supposedly can accomplish this but I'm not sure what "source" file to download from the Apache web site at the below link. There are two Unix source files, a Netware binary and a link to "other" files none of which jumps out at me as being the correct one.
http://httpd.apache.org/download.cgi#apache24
I've run across other websites where people have apparently accomplished this feat and offer these installers but I'm a bit leery downloading them from untrusted sources. It's a shame I can't seem to find a package installer for Windows which provides/installs everything without having to go through all this manual installation hassle that requires all sorts of prerequisite knowledge. How does one get started learning?
Any other suggestions for a complete newb like myself are appreciated :).
Thanks,
NP
2. NickelPlate
NickelPlate Senior member
Joined:
Nov 9, 2006
Messages:
636
Likes Received:
0
3. aceO07
aceO07 Diamond Member
Joined:
Nov 6, 2000
Messages:
4,492
Likes Received:
0
Using Linux is going to make learning this so much easier for you. It's the more popular configuration, so you'll be able to research and get more results/tutorials.
Install vmware player and install Ubuntu 12.04 or other version. Then you can run Linux as a virtual machine on Windows. This is probably the 'hardest' part of getting it running. Ubuntu won't be hard, and there is still Netbeans which you can use as an editor or Eclipse.
Then you'll have access to lots of tutorials that will show you how to get started with php/mysql under Linux.
4. NickelPlate
NickelPlate Senior member
Joined:
Nov 9, 2006
Messages:
636
Likes Received:
0
Thanks for the response Ace. I did manage to get XAMPP installed and works pretty good. I went through some basic php/mysql tutorials and am off and running. I'm just using this as a development/educational platform which is why I wanted Windows, and another distribution package I found for anyone who is interested WampServer.
http://www.wampserver.com/en/
I'm not going to set all this up myself in the end though. I just need an environment to learn php scripting and connecting to and managing mysql databases. Once I get my work's application to a point where it's useful, we'll just go to an online hosting service most of which run Linux in a far more secure environment than I could ever manage myself.
#4 NickelPlate, Feb 11, 2013
Last edited: Feb 11, 2013
5. Cogman
Cogman Lifer
Joined:
Sep 19, 2000
Messages:
10,086
Likes Received:
14
Like aceO07 said, you are actually making things harder for yourself by relying on a windows setup for this stuff. It really is a lot easier to do this stuff in linux (learning curve of a new OS and all). The LAMP setup is so common that it isn't even funny. (seriously, I started out doing exactly what you are doing now. Looking back on it, the main thing it taught me was that setting up an AMP architecture on windows shouldn't be done.) It has little to do with security and everything to do with ease of use.
But that is besides the point. From a language standpoint, PHP is a pretty nasty language. I get that you need it for work, however, I would question calling it "modern" as far as web development goes. We are starting to see more Python, Ruby, and JVM languages (Java, Groovy, JRuby, etc) on the web. PHP is a dying web language IMO.
Now for suggestions.
It is VERY easy to write very bad PHP. I would suggest that you do your best not to. If there is one programming principal I would suggest following almost dogmatically, it is DRY (Do not repeat yourself). If you find yourself hitting copy/paste, you are likely making something less maintainable.
For web stuff, it is very important that you separate concerns as much as possible. If you have PHP/HTML/Javascript/and CSS all in one file, you are doing it wrong. Keep things as separate as possible.
For example, it is tempting to write code that creates a table and computes the value of each cell in that table. That is bad. You are mixing business logic with UI logic. The better approach is to have code that creates the data, code that creates the table, and then you feed the table making code with the data making code. The more you separate concerns like this, the easier it will be in the future to do something like change the way a chunk of data is calculated, or change what a table looks like.
Testing. Get in the habit of testing. I'm not a "everything should be tested" sort of guy.. I do, however, find a lot of value in good tests and in writing code that is testable. Tests should be flexible. If a tests fails, it should mean "This code is really REALLY wrong" not "Bob changed a variable name". Write your tests and your code in such a way that swapping out logic will be easy and natural.
While, btw, leads me to this point. Minimize the number of concerns any chunk of code has. Methods that are 100+ lines long are a pain to test and maintain. On top of that, they tend to grow steadily with time becoming ever increasing pains to deal with.
Good luck, have fun, and don't be afraid to play with stuff.
6. NickelPlate
NickelPlate Senior member
Joined:
Nov 9, 2006
Messages:
636
Likes Received:
0
Thanks Cog. I'm curious what makes it so much easier to setup on Linux though? I literally had XAMPP up and running in minutes which surprised the heck out of me after struggling all weekend with trying to manually install all the components needed. Within the first hour or so I managed to get a basic php script written to connect and display some data from a mysql database which ultimately will be updated from remote machines out in the field and displayed on a web portal. I suppose the reason for choosing php is it's so common with most hosting providers I've been told. So far it seems not too dissimilar from from C which is what I'm most fluent in.
My main job function is not web development but I got nominated because I'm the engineer :p. I spend most of my time these days writing embedded microprocessor code in C for M2M applications and have a fair bit of controls programming in Codesys and ladder. A lot of your suggestions are good ones though and common practice in embedded systems too. I write a lot of stuff using state machine principles and write with portability and scalability in mind.
Cheers!
#6 NickelPlate, Feb 11, 2013
Last edited: Feb 11, 2013
7. PhatoseAlpha
PhatoseAlpha Platinum Member
Joined:
Apr 10, 2005
Messages:
2,120
Likes Received:
0
Cogman, did you have any experience with Linux when you started testing? There is a world of difference between "Use other OS which I already know" and "Learn new OS too".
8. beginner99
beginner99 Platinum Member
Joined:
Jun 2, 2009
Messages:
2,832
Likes Received:
4
I'm gonna say for development it does not matter that much if you do it on Windows. The down side is that you might encounter strange issues when moving your code to Linux due to the simple fact that these are different OS and might be running different versions of Apache, PHP and MySQL.
Since you mentioned hosting you need to be aware that depending where you host you won't have control over all settings (Apache, PHP and MySQL) and that can even influence your design.
What I consider problematic is that you are hosting so I assume the app will be freely visible to the internet? This means security will be a huge concern.
You will need to consider this:
https://www.owasp.org/index.php/Top_10_2013-Main
which is in itself a huge topic. The most important part IMHO is SQL Injection. First because it is well known and any half-intelligent 10 year old kid can use it to do harm.
This can at least partially made easier by using a framework. However that required that the hoster allows installing the framework of your choice and that you actually need to learn the framework.
9. beginner99
beginner99 Platinum Member
Joined:
Jun 2, 2009
Messages:
2,832
Likes Received:
4
I basically had 0 experience with Linux and found it 10 times easier to install a LAMP on Ubuntu Server (no GUI) than WAMP. (if you ignore WAMP, XAMPP etc. which are not usable for production). Installing PHP and Apache on Windows was a pain and often it was difficult to find your extensions that were compiled in the exact right way you require for the right apache or php version.
10. watdaflip
watdaflip Member
Joined:
Feb 11, 2013
Messages:
25
Likes Received:
0
I haven't checked for anything better in years, but my go to PHP tutorial site is http://www.tizag.com/phpT/
PHP is back end programming, it's only half of what you have to do with web development.
Modern web development will involve HTML (most likely HTML5), CSS, and Javascript for client site dynamic functionality. You can use Java and Flash for front end assets as well, but JS will fit your needs in most cases. (Personally, I'd avoid Java applets completely, especially since Oracle bought Sun, especially with recent security issues).
In addition to these different technologies/languages, you have worry about browser compatibility. Javascript and CSS in particular have set standards which browser should abide by, but not all of them do (or at least not all version do). You need to determine your target market for the website, as well the what browser and version they might be using so if it's worth supporting. Supporting a browser might involve browser specific fixes, many of which you can find from a google search, finding people who have had similar issues.
You can choose to support only modern browser, or legacy browsers such as ie 6 & 7, and Firefox < 4.x
As far as runtime environment, even if you don't have to worry about getting servers up and running with Linux, it might be worth your time to get a dev environment running on Linux as it's very possible there might be bugs on that environment you can help fix. For instance, with my job, if I didn't have any knowledge of Linux, having 75+ servers running PHP on a linux machine and a bug comes up from code I deployed, it would suck to not have any knowledge to help fix it. It might not apply to you with your job, but it can definitely be helpful to assist in debugging what is happening on your production servers. I would seriously recommend developing on a mac/linux if your production servers are going to be running linux. If you will be deploying on Windows/ISS, then you should be set with a WAMP setup.
11. Cogman
Cogman Lifer
Joined:
Sep 19, 2000
Messages:
10,086
Likes Received:
14
There wasn't an XAMPP when I first got into this stuff. So from that perspective, there were a lot of different binaries that you had to get and place in the correct directories. Random files also needed to be configured differently on windows than on linux. On top of that, most documentation available at the time assumed that you were running a linux system, so there was a lot of annoying things in the window system that you had to care about that were practically undocumented.
With most modern distros, the installation of those products boils down to running the package manager and telling it to install the packages you care about. Yeah, there was SOME configurations that you needed to do, but it was configuration that needed to be done on both windows and linux.
Gotcha. I wasn't sure where you were coming from. IMO the general principles are really about the only tutorial you need. After that, most languages are really pretty easy to pick up after a couple of tutorials.
Just be careful with SQL injections (as someone else mentioned) it is one of the biggest problems of the Internet even today and it is very easy to do. The issue is that writing code that can be injected into is generally much more intuitive than writing code that is safe from injection attacks.
12. Cogman
Cogman Lifer
Joined:
Sep 19, 2000
Messages:
10,086
Likes Received:
14
Yup, that was pretty much my experience. Getting everything in the right place and then setting things up was just a pain. Once it is done, it wasn't too bad, but getting to the "it is done" stage was just yucky.
I did this in the era when perl was a big web language as well, so I had both perl and PHP installation steps going.
It wasn't until much later that I got into linux. At that point, it was pretty shocking how easy installing those system were compared to the windows alternative (Even compiling things from source was much easier).
13. AyashiKaibutsu
AyashiKaibutsu Diamond Member
Joined:
Jan 24, 2004
Messages:
9,308
Likes Received:
1
As long as you cleanse your database parameters you won't really need to worry about that. I know using parameterized sql statements in c# cleanses it. I suspect it does in java as well although I haven't really looked into how my code isn't injectable (using a lot of code someone else wrote). Main thing is to just make sure raw user input never gets sent as a sql statement.
14. Cogman
Cogman Lifer
Joined:
Sep 19, 2000
Messages:
10,086
Likes Received:
14
If you are sending in data, you should always use parameterized sql. Every library that I've seen which does SQL stuff supports this. It doesn't even really cleanse the string so much as signal to the DB "This is what I'm executing and this is the data that is coming in". The separation of data and commands is the key that keeps things safe.
However, rolling your own (something like "replace("'", "''")") is doomed to failure. There are just WAY to many ways that someone can encode their data to bypass that sort of cleansing.
In general, when it comes to user input/output you should try and avoid doing your own thing, you will almost assuredly get it wrong or miss some corner case.
15. NickelPlate
NickelPlate Senior member
Joined:
Nov 9, 2006
Messages:
636
Likes Received:
0
Good discussion so far. Thanks for the info on the SQL injection. Interesting reading and I had no idea but I'll be sure to read more about it. My hope eventually once I get this working on a basic levl is to hand it off to someone who knows more about it than I do to not only pretty it up (because it's going to look like an engineer did it :)), but also make it more secure.
16. tfinch2
tfinch2 Lifer
Joined:
Feb 3, 2004
Messages:
22,120
Likes Received:
0
Take the time to learn some PHP, then adopt a framework. Chances are, someone has already done what you want to do.
17. tech7
tech7 Junior Member
Joined:
Feb 22, 2013
Messages:
7
Likes Received:
0
There's nothing wrong with developing in a Windows environment. XAMP is a good choice to quickly get setup and hitting some tutorials but in the future you might want to look into installing Apache, PHP and MySQL yourself (it's really easy) and you have complete control over your system. I don't think having the most up to date version of Apache is a major issue - you probably won't make use of any missing features anyway. Unless there are any major reasons not to use the version available (such as security issues).
18. ButterRum
ButterRum Member
Joined:
Feb 26, 2013
Messages:
37
Likes Received:
0
It sounds like you want a development server to practice Web coding. If I understand the question, Then you do not need to worry much about the deep sysadmin. It shouldn't matter if you have Windows or Linux. You can Web program on both – however, Microsoft does have their own stuff such as ASP.net (which isn't very modern anymore).
But yeah, you can learn any programming language on Windows and port the code to a Linux server. You'd have to make a few adjustments such as file locations but nothing too drastic.
You can download stacks at http://bitnami.org
Bitnami pretty much creates your own development server on your localhost. It works great.
Also, engineers should be able to grasp higher-level languages, and I'd imagine they'd have potential to write more efficient code than non-engineers.
#18 ButterRum, Feb 28, 2013
Last edited: Feb 28, 2013
19. DaveSimmons
DaveSimmons Elite Member
Joined:
Aug 12, 2001
Messages:
38,741
Likes Received:
33
I prefer Apache Friends / XAMPP to binami -- last time I tried bitnami (admittedly a couple of years ago) their package was missing some PHP features I needed like libmcrypt.
XAMPP is run one install script and go.
For windows development, the main gotcha I've found is remembering that the Windows file system ignores case. That means:
- You can't have 2 pages HELLO.php and hello.php. Not that you should :) , Windows would see these as a single file.
- If you are sloppy, that means you could write file access code with incorrect names (HELLO.dat vs. hello.dat) that works under Windows but fails for linux when you move it to a production server.
Besides that, if you need to run something external using a shell command, you won't have the right set of programs (Windows vs. Linux).
20. rozkan
rozkan Member
Joined:
Mar 1, 2013
Messages:
44
Likes Received:
0
NickelPlate, what exactly are you going to need to do once you learn PHP/MySQL? Because, as far as I read this thread, I don't really see why a company would try to make a web developer out of an engineer? I mean, a web developer is a usually a full time worker who write and/or maintain code. Don't tell me that the company needs a website and they figured it would be more cost efficient to turn an engineer into a web developer (because it is not). :)
Also, I see no reason to try to learn Linux while you are already trying to learn web programming. Benefits would be marginal, if any. Use wampserver to test your code, PHP will do fine in most cases and is NOT going anywhere at least for another decade.
Loading...
|
{
"url": "https://forums.anandtech.com/threads/need-help-getting-started-with-modern-web-development.2301166/",
"source_domain": "forums.anandtech.com",
"snapshot_id": "crawl=CC-MAIN-2016-40",
"warc_metadata": {
"Content-Length": "143765",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:77A7HB6TSSR2IL4BTGFAICQ4RR6CVWOC",
"WARC-Concurrent-To": "<urn:uuid:4c08572d-3440-47e7-94f4-d9ab60387114>",
"WARC-Date": "2016-09-27T10:31:20Z",
"WARC-IP-Address": "23.50.225.130",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HJLRNY2HFVUI3572AH2CEWENI7CUZIEB",
"WARC-Record-ID": "<urn:uuid:f9b728a7-2c85-40e2-87d5-248ea5e52e76>",
"WARC-Target-URI": "https://forums.anandtech.com/threads/need-help-getting-started-with-modern-web-development.2301166/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1d684919-c198-41e6-b550-bf1966cfd169>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-143-35-109.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-40\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for September 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
54,
55,
121,
122,
139,
140,
170,
171,
183,
199,
213,
221,
241,
247,
261,
262,
384,
385,
879,
880,
1481,
1482,
1532,
1533,
1960,
1961,
2039,
2040,
2052,
2053,
2060,
2066,
2083,
2084,
2114,
2115,
2127,
2143,
2157,
2165,
2185,
2191,
2203,
2204,
2230,
2231,
2243,
2259,
2273,
2283,
2303,
2309,
2479,
2480,
2757,
2758,
2873,
2879,
2896,
2897,
2927,
2928,
2940,
2956,
2970,
2978,
2998,
3004,
3337,
3338,
3372,
3373,
3730,
3736,
3769,
3799,
3811,
3812,
3829,
3830,
3842,
3859,
3873,
3884,
3904,
3911,
4430,
4431,
4769,
4770,
4795,
4796,
5098,
5099,
5305,
5306,
5817,
5818,
6225,
6226,
6485,
6486,
6551,
6557,
6574,
6575,
6605,
6606,
6618,
6634,
6648,
6656,
6676,
6682,
7346,
7347,
7807,
7808,
7820,
7826,
7859,
7889,
7907,
7908,
7941,
7942,
7954,
7971,
7985,
7995,
8015,
8021,
8197,
8203,
8219,
8220,
8251,
8252,
8264,
8280,
8294,
8304,
8324,
8330,
8623,
8624,
8813,
8814,
8974,
8975,
9011,
9012,
9065,
9066,
9245,
9447,
9453,
9469,
9470,
9501,
9502,
9514,
9530,
9544,
9554,
9574,
9580,
9968,
9974,
9990,
9991,
10012,
10013,
10025,
10042,
10056,
10063,
10083,
10089,
10202,
10203,
10296,
10297,
10646,
10647,
11186,
11187,
11293,
11294,
12113,
12119,
12132,
12133,
12150,
12151,
12163,
12180,
12194,
12205,
12225,
12232,
12720,
12721,
13017,
13018,
13234,
13235,
13536,
13542,
13555,
13556,
13573,
13574,
13586,
13603,
13617,
13628,
13648,
13655,
13872,
13873,
13994,
13995,
14214,
14220,
14241,
14242,
14276,
14277,
14289,
14306,
14320,
14330,
14350,
14356,
14738,
14744,
14757,
14758,
14775,
14776,
14788,
14805,
14819,
14830,
14850,
14857,
15205,
15206,
15397,
15398,
15561,
15567,
15585,
15586,
15616,
15617,
15629,
15645,
15659,
15667,
15687,
15693,
16075,
16081,
16095,
16096,
16114,
16115,
16127,
16143,
16157,
16168,
16188,
16194,
16314,
16320,
16332,
16333,
16357,
16358,
16370,
16387,
16401,
16407,
16427,
16433,
16959,
16965,
16981,
16982,
17003,
17004,
17016,
17033,
17047,
17054,
17074,
17080,
17425,
17426,
17612,
17613,
17663,
17664,
17759,
17760,
17915,
17921,
17953,
17983,
18001,
18002,
18031,
18032,
18044,
18061,
18075,
18086,
18106,
18113,
18292,
18293,
18337,
18338,
18464,
18465,
18586,
18587,
18789,
18790,
18931,
18937,
18950,
18951,
18969,
18970,
18982,
18998,
19012,
19019,
19039,
19045,
19504,
19505,
19764,
19770
],
"line_end_idx": [
54,
55,
121,
122,
139,
140,
170,
171,
183,
199,
213,
221,
241,
247,
261,
262,
384,
385,
879,
880,
1481,
1482,
1532,
1533,
1960,
1961,
2039,
2040,
2052,
2053,
2060,
2066,
2083,
2084,
2114,
2115,
2127,
2143,
2157,
2165,
2185,
2191,
2203,
2204,
2230,
2231,
2243,
2259,
2273,
2283,
2303,
2309,
2479,
2480,
2757,
2758,
2873,
2879,
2896,
2897,
2927,
2928,
2940,
2956,
2970,
2978,
2998,
3004,
3337,
3338,
3372,
3373,
3730,
3736,
3769,
3799,
3811,
3812,
3829,
3830,
3842,
3859,
3873,
3884,
3904,
3911,
4430,
4431,
4769,
4770,
4795,
4796,
5098,
5099,
5305,
5306,
5817,
5818,
6225,
6226,
6485,
6486,
6551,
6557,
6574,
6575,
6605,
6606,
6618,
6634,
6648,
6656,
6676,
6682,
7346,
7347,
7807,
7808,
7820,
7826,
7859,
7889,
7907,
7908,
7941,
7942,
7954,
7971,
7985,
7995,
8015,
8021,
8197,
8203,
8219,
8220,
8251,
8252,
8264,
8280,
8294,
8304,
8324,
8330,
8623,
8624,
8813,
8814,
8974,
8975,
9011,
9012,
9065,
9066,
9245,
9447,
9453,
9469,
9470,
9501,
9502,
9514,
9530,
9544,
9554,
9574,
9580,
9968,
9974,
9990,
9991,
10012,
10013,
10025,
10042,
10056,
10063,
10083,
10089,
10202,
10203,
10296,
10297,
10646,
10647,
11186,
11187,
11293,
11294,
12113,
12119,
12132,
12133,
12150,
12151,
12163,
12180,
12194,
12205,
12225,
12232,
12720,
12721,
13017,
13018,
13234,
13235,
13536,
13542,
13555,
13556,
13573,
13574,
13586,
13603,
13617,
13628,
13648,
13655,
13872,
13873,
13994,
13995,
14214,
14220,
14241,
14242,
14276,
14277,
14289,
14306,
14320,
14330,
14350,
14356,
14738,
14744,
14757,
14758,
14775,
14776,
14788,
14805,
14819,
14830,
14850,
14857,
15205,
15206,
15397,
15398,
15561,
15567,
15585,
15586,
15616,
15617,
15629,
15645,
15659,
15667,
15687,
15693,
16075,
16081,
16095,
16096,
16114,
16115,
16127,
16143,
16157,
16168,
16188,
16194,
16314,
16320,
16332,
16333,
16357,
16358,
16370,
16387,
16401,
16407,
16427,
16433,
16959,
16965,
16981,
16982,
17003,
17004,
17016,
17033,
17047,
17054,
17074,
17080,
17425,
17426,
17612,
17613,
17663,
17664,
17759,
17760,
17915,
17921,
17953,
17983,
18001,
18002,
18031,
18032,
18044,
18061,
18075,
18086,
18106,
18113,
18292,
18293,
18337,
18338,
18464,
18465,
18586,
18587,
18789,
18790,
18931,
18937,
18950,
18951,
18969,
18970,
18982,
18998,
19012,
19019,
19039,
19045,
19504,
19505,
19764,
19770,
19780
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 19780,
"ccnet_original_nlines": 347,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4238095283508301,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03583959862589836,
"rps_doc_frac_lines_end_with_ellipsis": 0.0028735599480569363,
"rps_doc_frac_no_alph_words": 0.1827067732810974,
"rps_doc_frac_unique_words": 0.2789634168148041,
"rps_doc_mean_word_length": 4.495426654815674,
"rps_doc_num_sentences": 207,
"rps_doc_symbol_to_word_ratio": 0.0017543899593874812,
"rps_doc_unigram_entropy": 5.938024520874023,
"rps_doc_word_count": 3280,
"rps_doc_frac_chars_dupe_10grams": 0.05188199132680893,
"rps_doc_frac_chars_dupe_5grams": 0.05907087028026581,
"rps_doc_frac_chars_dupe_6grams": 0.05717191845178604,
"rps_doc_frac_chars_dupe_7grams": 0.05717191845178604,
"rps_doc_frac_chars_dupe_8grams": 0.05717191845178604,
"rps_doc_frac_chars_dupe_9grams": 0.05717191845178604,
"rps_doc_frac_chars_top_2gram": 0.017633099108934402,
"rps_doc_frac_chars_top_3gram": 0.011393689550459385,
"rps_doc_frac_chars_top_4gram": 0.011529330164194107,
"rps_doc_books_importance": -1447.574462890625,
"rps_doc_books_importance_length_correction": -1447.574462890625,
"rps_doc_openwebtext_importance": -914.2424926757812,
"rps_doc_openwebtext_importance_length_correction": -914.2424926757812,
"rps_doc_wikipedia_importance": -691.62939453125,
"rps_doc_wikipedia_importance_length_correction": -691.62939453125
},
"fasttext": {
"dclm": 0.17205864191055298,
"english": 0.9638627171516418,
"fineweb_edu_approx": 1.7222644090652466,
"eai_general_math": 0.4110707640647888,
"eai_open_web_math": 0.2828500270843506,
"eai_web_code": 0.12393707036972046
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
5,949,739,070,214,739,000 |
Are you seeking for a feasible way to completely get rid of and uninstall itKeyboard Lite 5.0.1? If you're having some trouble doing that, here is the right place to help you thoroughly uninstall itKeyboard Lite 5.0.1. If itKeyboard Lite 5.0.1 is corrupted or damaged, the best way to get it work properly is to uninstall it and then reinstall it. But what can you do when you receive error messages during the uninstallation process or when you can't find it in your Programs and Features? Now, in order not to make your situation worse, please stop trying your own methods to uninstall itKeyboard Lite 5.0.1, and follow the listed professional methods to remove itKeyboard Lite 5.0.1.
Possible Error Caused by Incorrect Uninstall Methods
Error example
The above error messages are all caused by incomplete uninstallation of related programs. Incompletely uninstallation of a program will leave some invalid keys in the system registry, which will cause such error pop-ups when the system still executes them.
Automatically Uninstall itKeyboard Lite 5.0.1 (Recommended):
This specialized uninstaller can not only help you uninstall itKeyboard Lite 5.0.1 from the computer effectively, but also identify and delete all leftover files, folders and invalid registry entries belonging to itKeyboard Lite 5.0.1.
Manually Uninstall itKeyboard Lite 5.0.1:
Step 1: End all processes that are related to itKeyboard Lite 5.0.1
Step 2: Uninstall itKeyboard Lite 5.0.1
Step 3: Delete invalid entries of itKeyboard Lite 5.0.1 in the registry
Step 4: Delete leftovers of itKeyboard Lite 5.0.1 in hard drive
Step 1: End all processes that are related to itKeyboard Lite 5.0.1
Hold Ctrl, Shift and Esc keys on the keyboard to open Task Manager. Then click on the related process and click End Process (in Windows 7, Vista) or End Task (in Windows 8) button.
Step 2: Uninstall itKeyboard Lite 5.0.1
You can uninstall itKeyboard Lite 5.0.1 by any of the following uninstall methods:
Method 1: Uninstall itKeyboard Lite 5.0.1 via Control Panel
1. Open Programs and Features.
In Windows 7 and Vista,
a. Click Start menu and click Control Panel
b. Select View by Category and click Uninstall a program
In Windows 8 or later,
Hover the cursor in the bottom-left corner of the screen, right-click on the Start button when a small image of the Start Screen appears and select Programs and Features
2. Click on itKeyboard Lite 5.0.1 and click Uninstall to uninstall it from your computer.
Method 2: Uninstall itKeyboard Lite 5.0.1 using its Uninstall.exe
If you cannot find itKeyboard Lite 5.0.1 in Programs and Features, then you may be able to uninstall it thru its uninstall.exe.
a. For 32-bit Windows 7, Vista, 8 or later, open the C:\Program Files folder, open the program's folder (ex: WinRAR), and go to step 3 below.
b. For 64-bit Windows 7, Vista, 8 or later, open either the C:\Program Files folder for an installed 64-bit program or C:\Program Files (x86) folder for a installed 32-bit program, and open the program's folder (ex: WinRAR).
Method 3: Uninstall itKeyboard Lite 5.0.1 via Windows Registry
1. Open regedit. To do so, press Windows and R keys, type in regedit and hit Enter.
2. Navigate to the following key:
HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall
3. Find the program you want to uninstall, search for a string value called UninstallString in the right panel.
4. Double-click on it and copy its value.
5. Press Windows and R keys, type in cmd to open command prompt.
6. Right click, paste the value and hit Enter key. After that, the program will begin to uninstall. Click Yes when it asks for your confirmation.
Note: If you have a 64-bit Windows system, you may need to navigate to the following key to look for 32-bit programs:
HKEY_LOCAL_MACHINE\SOFTWARE\Wow6432Node\Microsoft\Windows\CurrentVersion\Uninstall
Method 4: Uninstall itKeyboard Lite 5.0.1 via Virus Removal Tool
Some unwanted programs can install into your computer without being noticed, as they like to spread by attaching to free software and games that people often download online. Sometimes, you cannot remember when certain program was installed on your computer until you suffer a lot from its annoying pop-ups. Usually, this kind of potentially unwanted programs can escape from the detection of your installed antivirus. If you have tried the above methods but still fail to remove itKeyboard Lite 5.0.1, it's really necessary for you to check whether it's a virus or not. Click and download this powerful Virus Removal Tool to check your PC. If it's a computer virus, it will be automatically deleted when you click Remove after the scan.
Step 3: Delete invalid entries of itKeyboard Lite 5.0.1 in the registry
Video Guide: How to back up and edit the registry
Note: It's very important for you to know that the registry is one of the most important part of the Windows system, you should be extremely careful when deleting any keys in the registry. Any small mistake can result in severe problems or even system crash. So removing itKeyboard Lite 5.0.1 by editing the registry is only recommended to computer users with certain computer knowledge. If you don't want to take the risk to damage your computer system, it's recomended that you use this Automatic Registry Cleaner to clean invalid keys.
Step 4: End all processes that are related to itKeyboard Lite 5.0.1
Even you uninstall itKeyboard Lite 5.0.1 in Control Panel and remove invalid keys in the registry, there are still some folders left in hard drive. To completely remove itKeyboard Lite 5.0.1 from your system, you can go to the following locations to delete the folders of itKeyboard Lite 5.0.1.
C:\Program Files (x86)
C:\Program Files
C:\ProgramData
C:\Users\Default\AppData\Local
C:\Users\Default\AppData\Roaming
Uninstall itKeyboard Lite 5.0.1 via Automatic Uninstaller
Manually uninstalling itKeyboard Lite 5.0.1 cannot promise a 100% removal of itKeyboard Lite 5.0.1, especially for computer users with little computer knowledge. If you have tried the above manual uninstall steps but still cannot get itKeyboard Lite 5.0.1 removed from your system, it's very necessary for you to use this Automatic Uninstaller to do it for you. With only a few clicks, you can easily uninstall any stubborn program from your computer system.
|
{
"url": "http://www.uninstallfix.com/uninstall/uninstall-itKeyboard-Lite-5.0.1-completely.html",
"source_domain": "www.uninstallfix.com",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "31230",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JP55THBZYJ5YYXPMWDRHHB4YHUT2N2TD",
"WARC-Concurrent-To": "<urn:uuid:009d9172-5fc4-4ac0-b926-05e34080034c>",
"WARC-Date": "2020-09-22T17:25:07Z",
"WARC-IP-Address": "45.56.121.35",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:B5IXSW7AEBO5FU3KHVX2X5RQTFZGMR76",
"WARC-Record-ID": "<urn:uuid:768d2bf9-14ce-4fcf-aba6-2070653c66a6>",
"WARC-Target-URI": "http://www.uninstallfix.com/uninstall/uninstall-itKeyboard-Lite-5.0.1-completely.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:404477df-7bb3-46a6-87f4-c3a1557e3176>"
},
"warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-108.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
687,
688,
741,
742,
756,
757,
1014,
1015,
1076,
1077,
1313,
1314,
1356,
1357,
1425,
1426,
1466,
1467,
1539,
1540,
1604,
1605,
1673,
1674,
1855,
1856,
1896,
1897,
1980,
1981,
2041,
2042,
2073,
2074,
2098,
2099,
2143,
2144,
2201,
2202,
2225,
2226,
2396,
2397,
2487,
2488,
2554,
2555,
2683,
2684,
2826,
2827,
3052,
3053,
3116,
3117,
3201,
3202,
3236,
3237,
3308,
3309,
3421,
3422,
3464,
3465,
3530,
3531,
3677,
3678,
3796,
3797,
3880,
3881,
3946,
3947,
4685,
4686,
4758,
4759,
4809,
4810,
5349,
5350,
5418,
5419,
5714,
5715,
5738,
5755,
5770,
5801,
5834,
5835,
5893,
5894
],
"line_end_idx": [
687,
688,
741,
742,
756,
757,
1014,
1015,
1076,
1077,
1313,
1314,
1356,
1357,
1425,
1426,
1466,
1467,
1539,
1540,
1604,
1605,
1673,
1674,
1855,
1856,
1896,
1897,
1980,
1981,
2041,
2042,
2073,
2074,
2098,
2099,
2143,
2144,
2201,
2202,
2225,
2226,
2396,
2397,
2487,
2488,
2554,
2555,
2683,
2684,
2826,
2827,
3052,
3053,
3116,
3117,
3201,
3202,
3236,
3237,
3308,
3309,
3421,
3422,
3464,
3465,
3530,
3531,
3677,
3678,
3796,
3797,
3880,
3881,
3946,
3947,
4685,
4686,
4758,
4759,
4809,
4810,
5349,
5350,
5418,
5419,
5714,
5715,
5738,
5755,
5770,
5801,
5834,
5835,
5893,
5894,
6352
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6352,
"ccnet_original_nlines": 96,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32163742184638977,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010964909568428993,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.27485379576683044,
"rps_doc_frac_unique_words": 0.31027668714523315,
"rps_doc_mean_word_length": 4.979249000549316,
"rps_doc_num_sentences": 118,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.056673049926758,
"rps_doc_word_count": 1012,
"rps_doc_frac_chars_dupe_10grams": 0.05318516120314598,
"rps_doc_frac_chars_dupe_5grams": 0.1861480474472046,
"rps_doc_frac_chars_dupe_6grams": 0.10597340762615204,
"rps_doc_frac_chars_dupe_7grams": 0.07342726737260818,
"rps_doc_frac_chars_dupe_8grams": 0.05318516120314598,
"rps_doc_frac_chars_dupe_9grams": 0.05318516120314598,
"rps_doc_frac_chars_top_2gram": 0.09168486297130585,
"rps_doc_frac_chars_top_3gram": 0.11133161187171936,
"rps_doc_frac_chars_top_4gram": 0.07739631086587906,
"rps_doc_books_importance": -672.7235717773438,
"rps_doc_books_importance_length_correction": -672.7235717773438,
"rps_doc_openwebtext_importance": -393.344482421875,
"rps_doc_openwebtext_importance_length_correction": -393.344482421875,
"rps_doc_wikipedia_importance": -277.6964416503906,
"rps_doc_wikipedia_importance_length_correction": -277.6964416503906
},
"fasttext": {
"dclm": 0.0910118818283081,
"english": 0.8665233850479126,
"fineweb_edu_approx": 1.8764163255691528,
"eai_general_math": 0.5649446845054626,
"eai_open_web_math": 0.24996531009674072,
"eai_web_code": 0.15175467729568481
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
3,779,167,277,201,177,600 |
1. marvi0's Avatar
Hello hope am in the right section first time using Tapatalk, so still getting used to navigating the menus. I wanted to ask those who now own the new 4s, if the signal issues, have been resolved,not the antenna gate issues but the phones ability to capture signal, because the last time, on the 4, the signal was really bad, in comparison to my Samsung galaxy s2. I remember having both phones on the table, both with vodafone sim cards, but the iPhone 4 would struggle, and for me it was a deal breaker, cause i stay in the hospital were the signal is very bad, yet I rely enormously on the phone. I have read some reviews saying the signal is better on 4s but I need your user experience please.
10-18-2011 01:15 AM
2. Timhewitt's Avatar
The antennae issues were resolved in later revisions of the iPhone 4
10-18-2011 03:53 AM
3. Cheggy's Avatar
I got the latest iphone 4 available and still have issues, nothing was resolved.
10-18-2011 04:51 AM
4. paul-c's Avatar
I haven't had a single problem with the antenna on the Verizon iPhone 4. The iPhone 4S takes it's antenna cues from that version, so I can't imagine any problems.
10-18-2011 04:53 AM
5. sting7k's Avatar
Signal attenuation effects every single cell phone ever made. Some more than others, with the iPhone the attenuation spot just happens to be not in the best spot and can be engaged very easily.
10-18-2011 09:18 AM
6. marvi0's Avatar
Thanks for your replies, i raised the exact same query on the vodafone iPhone forum, and what emerged, after some forumers went to test, the iPhone 4s still suffers signal issues. It's ok in areas of good coverage, but when you venture into areas of poor signal, that's when you realise how frustrating it can be. I bought a new 4s, anyway to make the miss happy, and when I took it to my hospital flat, the iPhone had the exact same issue with the 4,because I had it next to my Samsung galaxy s2, same network, the gs2 was able to open pages no issues, but the 4s struggled, as it's data connection was flickering. In areas of good network coverage however the iPhone urged forward better, bearing in mind the gs2, has flash player.
10-23-2011 02:41 PM
7. Wallace's Avatar
Are both phones an the same network? I use Vodafone on my company mobile (Nokia N95 8GB) but have O2 on my iPhone4. The signal strength varies depending on how close you are to the transmitter.
Not teaching you to suck eggs. Just trying to help.
10-23-2011 05:13 PM
8. The_colombian's Avatar
I think this goes for all apple products. While deployed last year no one with an MacBook or iPhone/itouch could connect to the weak wifi signal we had but people with windows laptops didn't have a problem throughout the whole time we were there. I know this is about the wifi antenna but seems to be true for the 3G antenna too.
10-23-2011 05:57 PM
9. j_benj's Avatar
I've been really happy with the reception on my VZ 4S. Comparing it side by side with my VZ Palm Pre 2 the 4S has at least 1 more bar of signal consistently.
10-23-2011 08:06 PM
10. matrix2004's Avatar
Full bars-----Verizon.
10-23-2011 09:13 PM
11. noaim's Avatar
as an example I had an iphone 4 and in my basement I would get one bar.. now with the iPhone 4s I get 3 bars in my basement
10-23-2011 09:57 PM
12. ghostface147's Avatar
I got the latest iphone 4 available and still have issues, nothing was resolved.
Well you are most certainly in the minority.
10-23-2011 10:26 PM
13. ame's Avatar
With this replacement it appears fine. With the one that I got preordered it was horrendous.
10-23-2011 10:33 PM
14. Dark_Blu's Avatar
Maybe I'm not having any signal problems because I have my iPhone 4S in a case, but I'm not having signal problems.
10-23-2011 10:37 PM
15. dwayne.williams's Avatar
The antenna is awesome.
Sent from my iPhone 4S using Tapatalk
10-23-2011 11:51 PM
LINK TO POST COPIED TO CLIPBOARD
|
{
"url": "https://forums.imore.com/iphone-4s/221701-4s-signal-not-antenna-gate-please.html",
"source_domain": "forums.imore.com",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "91207",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GC3YJ7XP4T64LMBKUFAYXNM6SRCFN7VQ",
"WARC-Concurrent-To": "<urn:uuid:f14b7980-58b0-465b-a447-d7ded8f15380>",
"WARC-Date": "2019-12-14T16:26:17Z",
"WARC-IP-Address": "104.18.15.41",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:ATPNYIMEXEKUF6KP2WYJWEDVS7F7RLW7",
"WARC-Record-ID": "<urn:uuid:fc687e7b-2828-4664-b359-e73d71c7427b>",
"WARC-Target-URI": "https://forums.imore.com/iphone-4s/221701-4s-signal-not-antenna-gate-please.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:63f71de7-bd02-4997-be3a-05f98b32a449>"
},
"warc_info": "isPartOf: CC-MAIN-2019-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-99.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
21,
724,
748,
772,
845,
869,
890,
975,
999,
1020,
1187,
1211,
1233,
1431,
1455,
1476,
2214,
2238,
2260,
2458,
2459,
2515,
2539,
2567,
2901,
2925,
2946,
3108,
3132,
3158,
3185,
3209,
3230,
3358,
3382,
3410,
3495,
3544,
3568,
3587,
3684,
3708,
3732,
3852,
3876,
3907,
3935,
3936,
3937,
3979,
4003
],
"line_end_idx": [
21,
724,
748,
772,
845,
869,
890,
975,
999,
1020,
1187,
1211,
1233,
1431,
1455,
1476,
2214,
2238,
2260,
2458,
2459,
2515,
2539,
2567,
2901,
2925,
2946,
3108,
3132,
3158,
3185,
3209,
3230,
3358,
3382,
3410,
3495,
3544,
3568,
3587,
3684,
3708,
3732,
3852,
3876,
3907,
3935,
3936,
3937,
3979,
4003,
4035
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4035,
"ccnet_original_nlines": 51,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37459632754325867,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.059203438460826874,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2766415476799011,
"rps_doc_frac_unique_words": 0.4605451822280884,
"rps_doc_mean_word_length": 4.318507671356201,
"rps_doc_num_sentences": 48,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.2066802978515625,
"rps_doc_word_count": 697,
"rps_doc_frac_chars_dupe_10grams": 0.04717608168721199,
"rps_doc_frac_chars_dupe_5grams": 0.059800658375024796,
"rps_doc_frac_chars_dupe_6grams": 0.04717608168721199,
"rps_doc_frac_chars_dupe_7grams": 0.04717608168721199,
"rps_doc_frac_chars_dupe_8grams": 0.04717608168721199,
"rps_doc_frac_chars_dupe_9grams": 0.04717608168721199,
"rps_doc_frac_chars_top_2gram": 0.023920269683003426,
"rps_doc_frac_chars_top_3gram": 0.010963460430502892,
"rps_doc_frac_chars_top_4gram": 0.011295679956674576,
"rps_doc_books_importance": -391.242431640625,
"rps_doc_books_importance_length_correction": -391.242431640625,
"rps_doc_openwebtext_importance": -222.54803466796875,
"rps_doc_openwebtext_importance_length_correction": -222.54803466796875,
"rps_doc_wikipedia_importance": -127.1766128540039,
"rps_doc_wikipedia_importance_length_correction": -127.1766128540039
},
"fasttext": {
"dclm": 0.029029669240117073,
"english": 0.9530803561210632,
"fineweb_edu_approx": 0.9072990417480469,
"eai_general_math": 0.021637199446558952,
"eai_open_web_math": 0.2481479048728943,
"eai_web_code": 0.0007899400079622865
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.68",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "24",
"label": "User Review"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-4,045,555,396,803,551,000 |
Back
Mobile App vs Website: Which is Ideal for Your Business?
If you want to give your company or organization a mobile presence, one of the things you’ll need to do is to create a mobile app for customers to download (app), a mobile website, or both. At first sight, mobile websites and apps may appear to be very similar, and deciding which is best for your needs will be determined by various criteria, including target audiences, available budget, intended purpose, and essential functionality.
What’s the Difference Between a Mobile Website and an App (Application)?
It’s crucial to grasp the fundamental distinctions between a mobile website and an app before weighing the advantages of each. People use handheld devices such as smartphones (e.g., iPhone, Android, and Blackberry) and tablets to view both apps and mobile websites.
Like any other website, a mobile website comprises browser-based HTML pages linked together and viewed via the Internet (for mobile, typically WiFi or 3G or 4G networks). It features a touch-screen interface that distinguishes it from a regular website. Responsive web design is increasingly becoming the new standard for mobile-friendly websites and scalable to any device size—from desktop to tablet and smartphone.
Both mobile websites and responsive sites can display text, data, photos, and video just like any other site. They can also use mobile-specific capabilities like click-to-call (which allows them to dial a phone number) and location-based mapping.
Unlike sites displayed on browsers, a mobile app is genuine software designed by an eCommerce mobile app development agency and downloaded and installed on a mobile device. To locate and download apps for a specific operating system, users go to device-specific portals like Apple’s App Store, Android Market, or Blackberry App World. The app can either extract material and data from the Internet in the same way that a website does or download the content so that users can access it without a connection.
Which is Better: an App or a Mobile (Responsive) Website?
As mobile usage grows worldwide, the subject of “app vs. web” will become increasingly crucial for businesses looking to develop a mobile presence. A mobile-friendly responsive website is an appropriate choice if your goals are primarily marketing-driven. It is also a great choice if your goal is to supply content and develop a broad mobile presence that can be easily maintained, shared among users, and found on search engines.
If you want to deliver a user experience that seems more like a gaming interface or a computer program than a website, or if you need access to a user’s phone storage and native functionalities, you’ll almost certainly need an app.
It’s also worth noting that a mobile/responsive website and a native app aren’t always mutually exclusive. Many businesses have a mobile-friendly public website and a native app that people can download to meet more particular needs. It’s all about selecting the appropriate tool for the job.
Make the Right Choice by Hiring the Right Agency!
If your company is considering a mobile app strategy, Nahr Development can assist you in making informed decisions. As a trusted mobile app development agency in Cairo, we can provide you with the right project plan to meet your objectives. For more information, please get in touch with us or submit a query using our contact form.
Nahr Dev
Nahr Dev
https://nahrdev.com
×
|
{
"url": "https://nahrdev.com/mobile-app-vs-website-which-is-ideal-for-your-business/",
"source_domain": "nahrdev.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "165140",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GQTSLMZSQZ2XIAD27JETBPM7HG45BUW3",
"WARC-Concurrent-To": "<urn:uuid:0e9656fc-a02d-49db-ad90-0e811daeb2ca>",
"WARC-Date": "2024-06-17T07:50:12Z",
"WARC-IP-Address": "70.32.23.79",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:42VYWTJ7PDHEGQSGRYLNPPLBJBVMYQLH",
"WARC-Record-ID": "<urn:uuid:5f790e5d-6c9f-4b0b-8b3a-614b057753ef>",
"WARC-Target-URI": "https://nahrdev.com/mobile-app-vs-website-which-is-ideal-for-your-business/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bc08f16b-25de-4330-98a0-f59673961242>"
},
"warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-21\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,
5,
6,
63,
64,
501,
502,
575,
576,
842,
843,
1261,
1262,
1509,
1510,
2018,
2019,
2077,
2078,
2510,
2511,
2743,
2744,
3037,
3038,
3088,
3089,
3422,
3423,
3432,
3441,
3461
],
"line_end_idx": [
5,
6,
63,
64,
501,
502,
575,
576,
842,
843,
1261,
1262,
1509,
1510,
2018,
2019,
2077,
2078,
2510,
2511,
2743,
2744,
3037,
3038,
3088,
3089,
3422,
3423,
3432,
3441,
3461,
3462
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3462,
"ccnet_original_nlines": 31,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3949704170227051,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005917159840464592,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14053253829479218,
"rps_doc_frac_unique_words": 0.4937163293361664,
"rps_doc_mean_word_length": 5.034111499786377,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.061227321624756,
"rps_doc_word_count": 557,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03495007008314133,
"rps_doc_frac_chars_dupe_6grams": 0.02068473957479,
"rps_doc_frac_chars_dupe_7grams": 0.02068473957479,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.027460770681500435,
"rps_doc_frac_chars_top_3gram": 0.019971469417214394,
"rps_doc_frac_chars_top_4gram": 0.007845929823815823,
"rps_doc_books_importance": -328.7214660644531,
"rps_doc_books_importance_length_correction": -328.7214660644531,
"rps_doc_openwebtext_importance": -158.1141357421875,
"rps_doc_openwebtext_importance_length_correction": -158.1141357421875,
"rps_doc_wikipedia_importance": -117.47750091552734,
"rps_doc_wikipedia_importance_length_correction": -117.47750091552734
},
"fasttext": {
"dclm": 0.022503500804305077,
"english": 0.9143325090408325,
"fineweb_edu_approx": 1.7351057529449463,
"eai_general_math": 0.0012266599806025624,
"eai_open_web_math": 0.01259469985961914,
"eai_web_code": 0.03969347104430199
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.87",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-3,331,639,900,029,295,000 |
Working with null
In Cypher®, null is used to represent missing or undefined values. All data types in Cypher are nullable.
Conceptually, null means a missing or unknown value, and it is treated somewhat differently from other values. For example, returning a property from a node that does not have said property produces null. Most expressions that take null as input will produce null. In the case of a predicate used in a WHERE clause, anything that is not true is interpreted as being false.
null is not equal to null. Not knowing two values does not imply that they are the same value. This means that the expression null = null yields null, and not true.
Logical operations with null
The logical operators (AND, OR, XOR, NOT) treat null as the unknown value of three-valued logic.
Table 1. Truth table for logical operators
a b a AND b a OR b a XOR b NOT a
false
false
false
false
false
true
false
null
false
null
null
true
false
true
false
true
true
true
true
false
false
true
true
false
true
null
null
true
null
false
true
true
true
true
false
false
null
false
false
null
null
null
null
null
null
null
null
null
null
true
null
true
null
null
The IN operator and null
The IN operator follows similar logic. If Cypher can ascertain that something exists in a list, the result will be true. Any list that contains a null and does not have a matching element will return null. Otherwise, the result will be false.
Table 2. examples of expressions containing the IN operator
Expression Result
2 IN [1, 2, 3]
true
2 IN [1, null, 3]
null
2 IN [1, 2, null]
true
2 IN [1]
false
2 IN []
false
null IN [1, 2, 3]
null
null IN [1, null, 3]
null
null IN []
false
Using all, any, none, and single follows a similar rule. If the result can be calculated definitively, true or false is returned. Otherwise null is produced.
The [] operator and null
Accessing a list or a map with null will result in null:
Expression Result
[1, 2, 3][null]
null
[1, 2, 3, 4][null..2]
null
[1, 2, 3][1..null]
null
{age: 25}[null]
null
Using parameters to pass in the bounds, such as a[$lower..$upper], may result in a null for the lower or upper bound (or both). The following workaround will prevent this from happening by setting the absolute minimum and maximum bound values:
a[coalesce($lower,0)..coalesce($upper,size(a))]
Expressions that return null
• Getting a missing element from a list: [][0], head([]).
• Trying to access a property that does not exist on a node or relationship: n.missingProperty.
• Comparisons when either side is null: 1 < null.
• Arithmetic expressions containing null: 1 + null.
• Some function calls where any argument is null: e.g., sin(null).
Using IS NULL and IS NOT NULL
Testing any value against null, either with the = operator or with the <> operator, always evaluates to null. Therefore, use the special equality operators IS NULL or IS NOT NULL.
|
{
"url": "https://neo4j.com/docs/cypher-manual/current/values-and-types/working-with-null/",
"source_domain": "neo4j.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "57590",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PLT6D5NG7GZZ7SQ5HLJLHFP3UTNW6UVB",
"WARC-Concurrent-To": "<urn:uuid:daf4649c-7cc4-478d-9405-82a50f776b8a>",
"WARC-Date": "2023-05-29T18:43:47Z",
"WARC-IP-Address": "18.160.46.52",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SZM67YHNUSUONY52GFFUFFSNGE6GY67Y",
"WARC-Record-ID": "<urn:uuid:de266532-ffc0-461a-8ad1-b9f9ae191aa1>",
"WARC-Target-URI": "https://neo4j.com/docs/cypher-manual/current/values-and-types/working-with-null/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:32238a47-5ada-41fc-8f5a-ff0eee2c292e>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-34\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
18,
19,
125,
126,
499,
500,
665,
666,
695,
696,
793,
794,
837,
870,
871,
877,
878,
884,
885,
891,
892,
898,
899,
905,
906,
911,
912,
918,
919,
924,
925,
931,
932,
937,
938,
943,
944,
949,
950,
956,
957,
962,
963,
969,
970,
975,
976,
981,
982,
987,
988,
993,
994,
1000,
1001,
1007,
1008,
1013,
1014,
1019,
1020,
1026,
1027,
1032,
1033,
1038,
1039,
1044,
1045,
1050,
1051,
1056,
1057,
1063,
1064,
1069,
1070,
1075,
1076,
1081,
1082,
1087,
1088,
1094,
1095,
1101,
1102,
1107,
1108,
1114,
1115,
1121,
1122,
1127,
1128,
1133,
1134,
1139,
1140,
1145,
1146,
1151,
1152,
1157,
1158,
1163,
1164,
1169,
1170,
1175,
1176,
1181,
1182,
1187,
1188,
1193,
1194,
1199,
1200,
1205,
1206,
1211,
1212,
1237,
1238,
1481,
1482,
1542,
1560,
1561,
1576,
1577,
1582,
1583,
1601,
1602,
1607,
1608,
1626,
1627,
1632,
1633,
1642,
1643,
1649,
1650,
1658,
1659,
1665,
1666,
1684,
1685,
1690,
1691,
1712,
1713,
1718,
1719,
1730,
1731,
1737,
1738,
1896,
1897,
1922,
1923,
1980,
1981,
1999,
2000,
2016,
2017,
2022,
2023,
2045,
2046,
2051,
2052,
2071,
2072,
2077,
2078,
2094,
2095,
2100,
2101,
2345,
2346,
2394,
2395,
2424,
2425,
2485,
2486,
2584,
2585,
2637,
2638,
2692,
2693,
2762,
2763,
2793,
2794
],
"line_end_idx": [
18,
19,
125,
126,
499,
500,
665,
666,
695,
696,
793,
794,
837,
870,
871,
877,
878,
884,
885,
891,
892,
898,
899,
905,
906,
911,
912,
918,
919,
924,
925,
931,
932,
937,
938,
943,
944,
949,
950,
956,
957,
962,
963,
969,
970,
975,
976,
981,
982,
987,
988,
993,
994,
1000,
1001,
1007,
1008,
1013,
1014,
1019,
1020,
1026,
1027,
1032,
1033,
1038,
1039,
1044,
1045,
1050,
1051,
1056,
1057,
1063,
1064,
1069,
1070,
1075,
1076,
1081,
1082,
1087,
1088,
1094,
1095,
1101,
1102,
1107,
1108,
1114,
1115,
1121,
1122,
1127,
1128,
1133,
1134,
1139,
1140,
1145,
1146,
1151,
1152,
1157,
1158,
1163,
1164,
1169,
1170,
1175,
1176,
1181,
1182,
1187,
1188,
1193,
1194,
1199,
1200,
1205,
1206,
1211,
1212,
1237,
1238,
1481,
1482,
1542,
1560,
1561,
1576,
1577,
1582,
1583,
1601,
1602,
1607,
1608,
1626,
1627,
1632,
1633,
1642,
1643,
1649,
1650,
1658,
1659,
1665,
1666,
1684,
1685,
1690,
1691,
1712,
1713,
1718,
1719,
1730,
1731,
1737,
1738,
1896,
1897,
1922,
1923,
1980,
1981,
1999,
2000,
2016,
2017,
2022,
2023,
2045,
2046,
2051,
2052,
2071,
2072,
2077,
2078,
2094,
2095,
2100,
2101,
2345,
2346,
2394,
2395,
2424,
2425,
2485,
2486,
2584,
2585,
2637,
2638,
2692,
2693,
2762,
2763,
2793,
2794,
2973
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2973,
"ccnet_original_nlines": 204,
"rps_doc_curly_bracket": 0.0006727200234308839,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2746913731098175,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04629629850387573,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25925925374031067,
"rps_doc_frac_unique_words": 0.3280318081378937,
"rps_doc_mean_word_length": 4.365805149078369,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.293697357177734,
"rps_doc_word_count": 503,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05737705156207085,
"rps_doc_frac_chars_dupe_6grams": 0.04644808918237686,
"rps_doc_frac_chars_dupe_7grams": 0.04644808918237686,
"rps_doc_frac_chars_dupe_8grams": 0.018214939162135124,
"rps_doc_frac_chars_dupe_9grams": 0.018214939162135124,
"rps_doc_frac_chars_top_2gram": 0.054644808173179626,
"rps_doc_frac_chars_top_3gram": 0.04371584951877594,
"rps_doc_frac_chars_top_4gram": 0.05100182071328163,
"rps_doc_books_importance": -289.7686767578125,
"rps_doc_books_importance_length_correction": -289.7686767578125,
"rps_doc_openwebtext_importance": -194.44512939453125,
"rps_doc_openwebtext_importance_length_correction": -194.44512939453125,
"rps_doc_wikipedia_importance": -175.0240478515625,
"rps_doc_wikipedia_importance_length_correction": -175.0240478515625
},
"fasttext": {
"dclm": 0.3578644394874573,
"english": 0.7317271828651428,
"fineweb_edu_approx": 1.3843051195144653,
"eai_general_math": 0.6433152556419373,
"eai_open_web_math": 0.12945735454559326,
"eai_web_code": 0.946158766746521
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.758",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
2,701,731,031,017,253,400 |
Scroll to navigation
B::Op_private(3perl) Perl Programmers Reference Guide B::Op_private(3perl)
NAME
B::Op_private - OP op_private flag definitions
SYNOPSIS
use B::Op_private;
# flag details for bit 7 of OP_AELEM's op_private:
my $name = $B::Op_private::bits{aelem}{7}; # OPpLVAL_INTRO
my $value = $B::Op_private::defines{$name}; # 128
my $label = $B::Op_private::labels{$name}; # LVINTRO
# the bit field at bits 5..6 of OP_AELEM's op_private:
my $bf = $B::Op_private::bits{aelem}{6};
my $mask = $bf->{bitmask}; # etc
DESCRIPTION
This module provides four global hashes:
%B::Op_private::bits
%B::Op_private::defines
%B::Op_private::labels
%B::Op_private::ops_using
which contain information about the per-op meanings of the bits in the op_private field.
%bits
This is indexed by op name and then bit number (0..7). For single bit flags, it returns the name of the define (if any) for that bit:
$B::Op_private::bits{aelem}{7} eq 'OPpLVAL_INTRO';
For bit fields, it returns a hash ref containing details about the field. The same reference will be returned for all bit positions that make up the bit field; so for example these both return the same hash ref:
$bitfield = $B::Op_private::bits{aelem}{5};
$bitfield = $B::Op_private::bits{aelem}{6};
The general format of this hash ref is
{
# The bit range and mask; these are always present.
bitmin => 5,
bitmax => 6,
bitmask => 0x60,
# (The remaining keys are optional)
# The names of any defines that were requested:
mask_def => 'OPpFOO_MASK',
baseshift_def => 'OPpFOO_SHIFT',
bitcount_def => 'OPpFOO_BITS',
# If present, Concise etc will display the value with a 'FOO='
# prefix. If it equals '-', then Concise will treat the bit
# field as raw bits and not try to interpret it.
label => 'FOO',
# If present, specifies the names of some defines and the
# display labels that are used to assign meaning to particu-
# lar integer values within the bit field; e.g. 3 is dis-
# played as 'C'.
enum => [ qw(
1 OPpFOO_A A
2 OPpFOO_B B
3 OPpFOO_C C
)],
};
%defines
This gives the value of every "OPp" define, e.g.
$B::Op_private::defines{OPpLVAL_INTRO} == 128;
%labels
This gives the short display label for each define, as used by "B::Concise" and "perl -Dx", e.g.
$B::Op_private::labels{OPpLVAL_INTRO} eq 'LVINTRO';
If the label equals '-', then Concise will treat the bit as a raw bit and not try to display it symbolically.
%ops_using
For each define, this gives a reference to an array of op names that use the flag.
@ops_using_lvintro = @{ $B::Op_private::ops_using{OPp_LVAL_INTRO} };
2023-01-08 perl v5.36.0
|
{
"url": "https://manpages.debian.org/bookworm/perl-doc/B::Op_private.3perl.en.html",
"source_domain": "manpages.debian.org",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "21062",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VBFU3RWPYFCAJNFX7B2SDCFSUKYSXMG2",
"WARC-Concurrent-To": "<urn:uuid:0ba5cb48-aa28-4170-acb5-e01ab0349ee5>",
"WARC-Date": "2024-02-27T13:31:54Z",
"WARC-IP-Address": "128.31.0.62",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2KCLAAKDIBCDRDOXR5CATNMHKSZL66BJ",
"WARC-Record-ID": "<urn:uuid:5c41a3c6-b377-4d04-9e16-72c5e4bf571a>",
"WARC-Target-URI": "https://manpages.debian.org/bookworm/perl-doc/B::Op_private.3perl.en.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e3387fba-e3ca-459b-964b-9afe0e776433>"
},
"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-78\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
21,
22,
97,
98,
103,
104,
151,
152,
161,
162,
185,
240,
304,
358,
416,
475,
521,
558,
559,
571,
572,
613,
614,
639,
667,
694,
724,
725,
814,
815,
821,
822,
956,
957,
1011,
1012,
1224,
1225,
1273,
1321,
1322,
1361,
1362,
1368,
1428,
1456,
1484,
1515,
1559,
1615,
1655,
1696,
1736,
1807,
1875,
1932,
1964,
2030,
2099,
2165,
2190,
2221,
2266,
2311,
2356,
2385,
2392,
2393,
2402,
2403,
2452,
2453,
2504,
2505,
2513,
2514,
2611,
2612,
2668,
2669,
2779,
2780,
2791,
2792,
2875,
2876,
2949
],
"line_end_idx": [
21,
22,
97,
98,
103,
104,
151,
152,
161,
162,
185,
240,
304,
358,
416,
475,
521,
558,
559,
571,
572,
613,
614,
639,
667,
694,
724,
725,
814,
815,
821,
822,
956,
957,
1011,
1012,
1224,
1225,
1273,
1321,
1322,
1361,
1362,
1368,
1428,
1456,
1484,
1515,
1559,
1615,
1655,
1696,
1736,
1807,
1875,
1932,
1964,
2030,
2099,
2165,
2190,
2221,
2266,
2311,
2356,
2385,
2392,
2393,
2402,
2403,
2452,
2453,
2504,
2505,
2513,
2514,
2611,
2612,
2668,
2669,
2779,
2780,
2791,
2792,
2875,
2876,
2949,
2972
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2972,
"ccnet_original_nlines": 87,
"rps_doc_curly_bracket": 0.012113059870898724,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23510466516017914,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.053140100091695786,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3719806671142578,
"rps_doc_frac_unique_words": 0.4942857027053833,
"rps_doc_mean_word_length": 5.234285831451416,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0.02576489932835102,
"rps_doc_unigram_entropy": 4.80268669128418,
"rps_doc_word_count": 350,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.034934498369693756,
"rps_doc_frac_chars_dupe_6grams": 0.034934498369693756,
"rps_doc_frac_chars_dupe_7grams": 0.034934498369693756,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.019650660455226898,
"rps_doc_frac_chars_top_3gram": 0.024017469957470894,
"rps_doc_frac_chars_top_4gram": 0.022925760596990585,
"rps_doc_books_importance": -292.1290588378906,
"rps_doc_books_importance_length_correction": -292.1290588378906,
"rps_doc_openwebtext_importance": -156.80715942382812,
"rps_doc_openwebtext_importance_length_correction": -156.80715942382812,
"rps_doc_wikipedia_importance": -113.12745666503906,
"rps_doc_wikipedia_importance_length_correction": -113.12745666503906
},
"fasttext": {
"dclm": 0.6453205943107605,
"english": 0.7198676466941833,
"fineweb_edu_approx": 2.573117733001709,
"eai_general_math": 0.9902042746543884,
"eai_open_web_math": 0.4577098488807678,
"eai_web_code": 0.9833917617797852
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-6,871,387,524,075,670,000 |
7
How can I reset the open file window in Google Chrome back to it's default size?
My wife resized it when uploading photo's to a website and I would like to reset it
I have deleted the BagMRU & Bags registry keys, but they do not appear to affect Chrome
I have also deleted my user profile and started Chrome from scratch but that does not make any difference either
Thank you
• If you re-size the window and click the red x button instead of opening a file it should save it's state. – Justin Pearce May 24 '11 at 19:08
• Too late for that I'm afraid :( – vassie May 24 '11 at 22:06
• @Ben, Justin was actually talking about the close-button of Chrome, which wouldn’t affect the File Dialog anyway. – Synetech May 25 '11 at 17:45
• Where were the Bag keys you deleted (which key)? – Synetech May 25 '11 at 17:57
• I followed this superuser.com/questions/3347/… – vassie May 25 '11 at 19:53
3
First make sure you close the Chrome application (since it still running and writing- and overwriting your changes- to the "Local State" file even though you can't see the maximized Chrome window).
Next, find the file c:\Users{UserNameHere}\AppData\Local\Google\Chrome\User Data\Local State and delete (or rename) the whole the file and restart Chrome.
All your previously opened tabs will be present and the default page position/size will be restored.
| improve this answer | |
• Generic alternative to path provided: %localappdata%\Google\Chrome\User Data\Local State – Tim Friesen Mar 21 '19 at 12:20
2
No, Chrome isn’t a normal window, so ShellBags has no effect on it. Instead, Chrome handles its own window-positioning (well, normally, when it works; sometimes it gets stuck or reset/forgets).
First, close all Chrome windows (and make sure that there are no CHROME.EXE instances running in Task Manager). Open your Chrome profile (the User Data folder) and look for the Local State file. Open it in a text-editor and look for the window_placement section inside the browser section and delete that—this is a structured file, so make sure to get the quotes and braces correctly. (There are other window_placement sections for other things like the Options dialog, Task Manager, etc.) Finally, save and open Chrome; it should open at a “default” location, but should remember where you set it when you subsequently close it.
| improve this answer | |
• I have closed Chrome and looked in the Local State file, but there is no mention of window_placement at all – vassie May 24 '11 at 21:48
• That’s strange. Is there a line as follows? "browser": { Try searching for work_area_bottom (though there could be several of these). – Synetech May 24 '11 at 21:55
• All I have in the browser section is: { "browser": { "hung_plugin_detect_freq": 2000, "last_known_google_url": "http://www.google.co.uk/", "last_prompted_google_url": "http://www.google.co.uk/", "last_redirect_origin": "", "plugin_message_response_timeout": 30000 }, – vassie May 24 '11 at 22:00
• 1
I found them under AppData\Local\Google\Chrome\User Data\Default\Preferences removing them resets the Chrome window size and location, however I want to reset the open file dialogue window, ie Ctrl+O, also the same window when you browse for a file you wish to attach to an email in Gmail – vassie May 24 '11 at 22:04
• 1
Only Chrome, everything else is fine – vassie May 25 '11 at 19:53
1
I couldn't figure this out either, but somewhere I had messed up a setting. Performing a system restore seemed to solve the problem.
| improve this answer | |
1
To permanently set the Chrome window size and position add the following switches to the shortcut that opens Chrome. You can adjust the path and numbers to suit your own situation.
"C:\Program Files\Google\Chrome\Application\chrome.exe" --window-position=200,50 --window-size=1400,900
To apply these switches, right click the Chrome shortcut and choose "properties". Add the switches to the target textbox. Start each switch with a space followed by -- and then the a switch as shown above. A second switch can be added by leaving a space and then writing the next one. The switches used here are
--window-position=200,50
--window-size=1400,900
Don't leave any spaces within the switch. Always start a switch with a space and then -- Place the switches outside the path quotes ("").
| improve this answer | |
• Sorry I can't vote twice : ) – Nime Cloud Nov 23 '16 at 12:28
0
Default window opening size is a widows thing. Just need to set the size you would like it to open, hold down Ctl and close the window, next time you open it, it will be that size and position.
| improve this answer | |
-1
What worked super simple for me. I just right clicked on the close red X and then hit restore. And that worked.
| improve this answer | |
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://superuser.com/questions/288046/reset-the-open-file-window-size-in-google-chrome",
"source_domain": "superuser.com",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "189786",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GWNKLSPESUR6O5N4OMXC6PQV52BXEN2J",
"WARC-Concurrent-To": "<urn:uuid:f8f26549-62bf-496a-85f7-b65ddaca5ba6>",
"WARC-Date": "2020-07-13T12:50:31Z",
"WARC-IP-Address": "151.101.65.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QTT5HJ6ZNXLW3XBCNY6BI5GUDKDQ2YZU",
"WARC-Record-ID": "<urn:uuid:2066ba47-2401-4d21-8b6c-3b431ee0f5bd>",
"WARC-Target-URI": "https://superuser.com/questions/288046/reset-the-open-file-window-size-in-google-chrome",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:527bdf8b-86be-4c40-ae55-970adf09225f>"
},
"warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-219.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
84,
85,
169,
170,
258,
259,
372,
373,
383,
384,
530,
595,
744,
828,
908,
910,
911,
1109,
1110,
1265,
1266,
1367,
1368,
1394,
1521,
1523,
1524,
1718,
1719,
2349,
2350,
2376,
2517,
2686,
2986,
2992,
3314,
3320,
3390,
3392,
3393,
3526,
3527,
3553,
3555,
3556,
3737,
3738,
3842,
3843,
4155,
4180,
4203,
4204,
4342,
4343,
4369,
4435,
4437,
4438,
4632,
4633,
4659,
4662,
4663,
4775,
4776,
4802,
4803,
4815,
4816,
4916,
4917
],
"line_end_idx": [
2,
3,
84,
85,
169,
170,
258,
259,
372,
373,
383,
384,
530,
595,
744,
828,
908,
910,
911,
1109,
1110,
1265,
1266,
1367,
1368,
1394,
1521,
1523,
1524,
1718,
1719,
2349,
2350,
2376,
2517,
2686,
2986,
2992,
3314,
3320,
3390,
3392,
3393,
3526,
3527,
3553,
3555,
3556,
3737,
3738,
3842,
3843,
4155,
4180,
4203,
4204,
4342,
4343,
4369,
4435,
4437,
4438,
4632,
4633,
4659,
4662,
4663,
4775,
4776,
4802,
4803,
4815,
4816,
4916,
4917,
5007
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5007,
"ccnet_original_nlines": 75,
"rps_doc_curly_bracket": 0.0011983199510723352,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32384341955184937,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01779359020292759,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.28914591670036316,
"rps_doc_frac_unique_words": 0.43773120641708374,
"rps_doc_mean_word_length": 4.71393346786499,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.0008896799990907311,
"rps_doc_unigram_entropy": 5.31068754196167,
"rps_doc_word_count": 811,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.048129741102457047,
"rps_doc_frac_chars_dupe_6grams": 0.03662046045064926,
"rps_doc_frac_chars_dupe_7grams": 0.010462990030646324,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.010462990030646324,
"rps_doc_frac_chars_top_3gram": 0.010986139997839928,
"rps_doc_frac_chars_top_4gram": 0.014125029556453228,
"rps_doc_books_importance": -498.5267639160156,
"rps_doc_books_importance_length_correction": -498.5267639160156,
"rps_doc_openwebtext_importance": -358.0943298339844,
"rps_doc_openwebtext_importance_length_correction": -358.0943298339844,
"rps_doc_wikipedia_importance": -238.13690185546875,
"rps_doc_wikipedia_importance_length_correction": -238.13690185546875
},
"fasttext": {
"dclm": 0.03722811117768288,
"english": 0.9007737040519714,
"fineweb_edu_approx": 1.2344290018081665,
"eai_general_math": 0.07366299629211426,
"eai_open_web_math": 0.24892807006835938,
"eai_web_code": 0.0034381200093775988
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.436",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-6,544,150,328,417,757,000 |
Skip to main content
How Does Ellipal Wallet Update It Once It Purchased
The cryptocurrency market has witnessed a significant rise in the number of wallets that are hardware in recent years, all promising that digital assets will be safe and secure. Ellipal is one of them. Ellipal wallet is the latest entry into the market and is aiming to differentiate itself from the crowd by providing a completely isolated solution. As cryptocurrency usage is becoming more widespread and more commonplace, the need for secure the storage and protection of assets becomes more important. The Ellipal wallet is a gadget which keeps the private keys to digital assets off-line and prevents hackers from taking their assets remotely.
Ellipal the company that developed the wallet’s hardware is a relatively young competitor in the market. It raised $55K through an Indiegogo campaign to fund research and development for their products. The company’s website as well as online reviews claim that their hardware wallet is completely safe, however it is important to remember that hardware wallets of rival companies such as TREZOR as well as Ledger are made in a way that no attacker from outside is able to see your private keys. For example, even if it is possible to connect your TREZOR with a compromised system that has been infected with viruses, your private keys will remain secure and safe.
The Ellipal wallet is distinctive in its design, it is completely isolated from any computer or network, meaning it has no wired or wireless connectivity. Instead, it communicates via QR codes using a camera on the back of the. This makes it a highly secure option as it eliminates the possibility of hackers having gain access to private information via a network connection. However, it’s worth noting that this means the Ellipal wallet isn’t so user-friendly like other wallets on hardware, which can be connected to a computer for easy transactions.
The Ellipal wallet costs $149 and is relatively brand new in the marketplace, which implies that it isn’t tested in battle yet. This is something potential buyers should take into consideration when purchasing this Ellipal wallet. As a comparison, both the top hardware wallet manufacturers today (TREZOR and Ledger) have been on the market for longer and have an established track record of security.
In terms of support for coin In terms of support for coins, Ellipal wallet supports a limited number of coins. Ellipal wallet currently supports the following coins: a few that are supported, such as Bitcoin, Ethereum, Litecoin, as well as ERC20 tokens. This is less than the amount of coins that are supported by its rivals, TREZOR and Ledger, which might be a worry for some users. But, the company is working to add the support of more coins in the future.
In conclusion, Ellipal wallet is a good choice. Ellipal device is an new player in the market of hardware wallets that claims that it is 100% safe due to its total inaccessibility to any computer or network. The company behind it is relatively new, and the product hasn’t been tested in battle yet. The Ellipal wallet supports only a few coins and its price of $149 is on par with other wallets. Although the concept of a fully exclusive hardware wallet is appealing but it’s crucial to look at the track record and security measures of other hardware wallet options before making a choice. Ultimately, the decision of whether or not the Ellipal device is well worth the price is up to the individual. It’s a safe option with a unique design however, it’s not as user-friendly in use as the other wallets, and it’s an extremely new product that’s available.
|
{
"url": "https://www.backdoorvac.com/how-does-ellipal-wallet-update-it-once-it-purchased/",
"source_domain": "www.backdoorvac.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "52405",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2CD2OLWOX5W4NRVFL2NYXXU4TF4UH74H",
"WARC-Concurrent-To": "<urn:uuid:c85b06e4-177b-4e7b-bf54-af9bf3168043>",
"WARC-Date": "2023-06-05T20:13:12Z",
"WARC-IP-Address": "194.1.147.50",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7MWBL53XLIZHAH2V67LU5GPKG6YVMAUK",
"WARC-Record-ID": "<urn:uuid:9e6b7b19-affe-45b9-8a1f-f8a621a8eb6a>",
"WARC-Target-URI": "https://www.backdoorvac.com/how-does-ellipal-wallet-update-it-once-it-purchased/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6ac753bc-83c9-4e4b-93a9-8e4b91b8efdb>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-12\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,
21,
22,
74,
75,
724,
725,
1390,
1391,
1945,
1946,
2348,
2349,
2809,
2810
],
"line_end_idx": [
21,
22,
74,
75,
724,
725,
1390,
1391,
1945,
1946,
2348,
2349,
2809,
2810,
3667
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3667,
"ccnet_original_nlines": 14,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.46164771914482117,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009943179786205292,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10795454680919647,
"rps_doc_frac_unique_words": 0.4278768301010132,
"rps_doc_mean_word_length": 4.833063125610352,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.974057197570801,
"rps_doc_word_count": 617,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.012743130326271057,
"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.047954391688108444,
"rps_doc_frac_chars_top_3gram": 0.026827629655599594,
"rps_doc_frac_chars_top_4gram": 0.012072429992258549,
"rps_doc_books_importance": -320.09271240234375,
"rps_doc_books_importance_length_correction": -320.09271240234375,
"rps_doc_openwebtext_importance": -164.82467651367188,
"rps_doc_openwebtext_importance_length_correction": -164.82467651367188,
"rps_doc_wikipedia_importance": -109.46539306640625,
"rps_doc_wikipedia_importance_length_correction": -109.46539306640625
},
"fasttext": {
"dclm": 0.08935689926147461,
"english": 0.9693038463592529,
"fineweb_edu_approx": 1.2716898918151855,
"eai_general_math": 0.07762277126312256,
"eai_open_web_math": 0.08635658025741577,
"eai_web_code": 0.018231630325317383
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "332.8",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "14",
"label": "Reviews/Critiques"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-5,866,924,617,748,457,000 |
37659: Acronis Linux Products: Collecting Strace Output of Acronis Services in Linux
This article describes how to get strace output of Acronis services in Linux
Introduction
Strace should be collected when application exits abnormally or causes the application to hang.
If system is alive but our software does nothing/hangs, strace can be useful.
If application crashes, a strace is needed in rarely occasions. In this case, core dumps are required in the first place. See Acronis Linux Products: Collecting Core Dumps of Acronis Services in Linux.
If system "freezes" this must be a kernel crash, the dumps are also required.
Solution
Strace
Strace output file consists of operations list made by an executable.
Here is a description of how to strace some of Acronis services. To collect strace, one should have strace package installed in the system, in most cases it is preinstalled. If it is not installed, you can install it in the following way (unser root):
Acronis Managed Machine Service
First of all you should export library pathes as MMS uses shared libraries that cannot be found in the standard OS %PATH%.
To do this you have to perform these actions:
#cat /usr/sbin/acronis_mms | grep export
This command will give you the content of Acronis script. Inside the script you will find a ready to use export command, for example:
export LD_LIBRARY_PATH=/usr/lib/Acronis/BackupAndRecovery/system_libs:/usr/lib/Acronis/BackupAndRecovery/Common:/usr/lib/Acronis/Common
or
export LD_LIBRARY_PATH=$LD_LIBRARY_PATH:/usr/lib/Acronis/system_libs:/usr/lib/Acronis/Common64:/usr/lib/Acronis/BackupAndRecovery/Common64
if you are using 64bit OS.
2. Run the command received in step 1 before starting strace.
3. Now you can strace MMS binary directly by issuing the following command:
#cat /usr/sbin/acronis_mms | grep exec | tail -n 1 | awk '{print $3}'
Example output:
/usr/lib/Acronis/BackupAndRecovery/mms
4. Start strace with the following command:
#strace -o /tmp/mms.strace -fF /usr/sbin/acronis_mms
It will create an output file mms.strace from the MMS binary.
5. Collect mms.strace from the desctination specified in step 4 (e.g. /tmp)
(!) Strace output can be huge in size, please use destination of appropriate size.
Acronis Management Console
Process of stracing is the same as for acronis_mms, the difference is in libraries and binary pathes, you can get it from
#cat /usr/sbin/acronis_console | grep export
You should run its output in terminal before starting strace.
(!) Pathes for 32bit and 64bit OS are different!
Now you can strace the MMS binary directly, the path to it is also in the acronis_console script:
#cat /usr/sbin/acronis_console | grep exec | tail -n 1 | awk '{print $3}'
Example output:
/usr/lib/Acronis/BackupAndRecoveryConsole/ManagementConsole
Now you can strace MMS binary directly by issuing the following command:
#strace -o /tmp/console.strace -fF /usr/lib/Acronis/BackupAndRecoveryConsole/ManagementConsole
Service Process
Open /lib/Acronis/BackupAndRecovery/service_process for editing and change this block:
else
export LD_LIBRARY_PATH
exec $WRAPPER /usr/lib/Acronis/BackupAndRecovery/service_process-bin "$@"
fi
to
else
export LD_LIBRARY_PATH
exec $WRAPPER strace -o /tmp/service_process.$$.strace -fF /usr/lib/Acronis/BackupAndRecovery/service_process-bin "$@" > /tmp/service_process.$$ 2>&1
fi
It will create a strace log in the /tmp/service_process/* directory.
Start a backup and when the issue reproduces, send the resulting file to the Development Team.
Revert all changes after collecting strace log files.
Acronis Bootable Media (Linux based)
First of all you should boot in media in command-line without starting an Acronis product. To do this on Acronis boot selection press F11 and delete the word quite.
Start booting, the media will bring you to command-line.
Attach USB flash drive or network share as media runs in RAM.
Mount them locally, for example for USB flash drive:
#fdisk -l
Device Boot Start End Blocks Id System
/dev/sdb1 1 64 480000000 83 Linux
#mkdir /tmp/dongle
#mount -t auto /dev/sdb1 /tmp/dongle
Now you can strace the product and forward its output to the mountpoint we created. Also remember that the FAT32 file size limit is 4 GB. If it is possible, you can format your USB drive in ext4 FS for example.
#strace -o /tmp/dongle/mms.strace -fF /bin/product
Do not remove the USB drive until you shut down or reboot machine or until you unmount drive with the following command:
#umount /tmp/dongle
As it can cause complete data loss and the USB drive's FS corruption.
More information
See also:
Tags:
|
{
"url": "https://kb.acronis.com/content/37659",
"source_domain": "kb.acronis.com",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "39235",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HQ7FPJE4H5M5RZIJGIZW65AKF2CXBVBV",
"WARC-Concurrent-To": "<urn:uuid:ba69936c-03c9-4088-b182-93ec45d9df90>",
"WARC-Date": "2020-07-15T05:59:04Z",
"WARC-IP-Address": "69.20.59.73",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:W6MLE7JDAOXZWSOVJYCTE2FVD2PIFUN2",
"WARC-Record-ID": "<urn:uuid:3c433337-bd96-401d-badd-cc106caf7deb>",
"WARC-Target-URI": "https://kb.acronis.com/content/37659",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7311b6da-0061-4f09-9422-d9544ab77002>"
},
"warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-52.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
85,
86,
167,
168,
185,
186,
287,
288,
370,
371,
577,
578,
661,
662,
675,
676,
687,
688,
762,
763,
1019,
1020,
1056,
1057,
1184,
1234,
1235,
1280,
1281,
1419,
1420,
1560,
1561,
1568,
1569,
1712,
1713,
1744,
1745,
1811,
1812,
1892,
1893,
1967,
1968,
1988,
1989,
2032,
2033,
2081,
2082,
2139,
2140,
2206,
2207,
2287,
2288,
2375,
2376,
2382,
2383,
2414,
2415,
2541,
2542,
2591,
2592,
2658,
2711,
2712,
2814,
2815,
2893,
2894,
2914,
2915,
2979,
2980,
3057,
3058,
3157,
3158,
3164,
3165,
3185,
3186,
3277,
3278,
3287,
3316,
3396,
3403,
3404,
3411,
3412,
3421,
3450,
3606,
3613,
3614,
3687,
3688,
3787,
3788,
3846,
3847,
3888,
3889,
4058,
4119,
4185,
4242,
4243,
4257,
4258,
4301,
4339,
4340,
4363,
4364,
4405,
4406,
4621,
4622,
4677,
4678,
4803,
4804,
4828,
4829,
4903,
4904,
4925,
4926,
4940,
4941
],
"line_end_idx": [
85,
86,
167,
168,
185,
186,
287,
288,
370,
371,
577,
578,
661,
662,
675,
676,
687,
688,
762,
763,
1019,
1020,
1056,
1057,
1184,
1234,
1235,
1280,
1281,
1419,
1420,
1560,
1561,
1568,
1569,
1712,
1713,
1744,
1745,
1811,
1812,
1892,
1893,
1967,
1968,
1988,
1989,
2032,
2033,
2081,
2082,
2139,
2140,
2206,
2207,
2287,
2288,
2375,
2376,
2382,
2383,
2414,
2415,
2541,
2542,
2591,
2592,
2658,
2711,
2712,
2814,
2815,
2893,
2894,
2914,
2915,
2979,
2980,
3057,
3058,
3157,
3158,
3164,
3165,
3185,
3186,
3277,
3278,
3287,
3316,
3396,
3403,
3404,
3411,
3412,
3421,
3450,
3606,
3613,
3614,
3687,
3688,
3787,
3788,
3846,
3847,
3888,
3889,
4058,
4119,
4185,
4242,
4243,
4257,
4258,
4301,
4339,
4340,
4363,
4364,
4405,
4406,
4621,
4622,
4677,
4678,
4803,
4804,
4828,
4829,
4903,
4904,
4925,
4926,
4940,
4941,
4951
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4951,
"ccnet_original_nlines": 136,
"rps_doc_curly_bracket": 0.0008079200051724911,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26776519417762756,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027806390076875687,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25746652483940125,
"rps_doc_frac_unique_words": 0.42396312952041626,
"rps_doc_mean_word_length": 5.572964668273926,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.011328529566526413,
"rps_doc_unigram_entropy": 5.140669345855713,
"rps_doc_word_count": 651,
"rps_doc_frac_chars_dupe_10grams": 0.05292171984910965,
"rps_doc_frac_chars_dupe_5grams": 0.12761852145195007,
"rps_doc_frac_chars_dupe_6grams": 0.07276736199855804,
"rps_doc_frac_chars_dupe_7grams": 0.07276736199855804,
"rps_doc_frac_chars_dupe_8grams": 0.05292171984910965,
"rps_doc_frac_chars_dupe_9grams": 0.05292171984910965,
"rps_doc_frac_chars_top_2gram": 0.011576630175113678,
"rps_doc_frac_chars_top_3gram": 0.018743110820651054,
"rps_doc_frac_chars_top_4gram": 0.016538040712475777,
"rps_doc_books_importance": -414.423583984375,
"rps_doc_books_importance_length_correction": -414.423583984375,
"rps_doc_openwebtext_importance": -193.66075134277344,
"rps_doc_openwebtext_importance_length_correction": -193.66075134277344,
"rps_doc_wikipedia_importance": -91.18547821044922,
"rps_doc_wikipedia_importance_length_correction": -91.18547821044922
},
"fasttext": {
"dclm": 0.09190958738327026,
"english": 0.7738364338874817,
"fineweb_edu_approx": 2.2625749111175537,
"eai_general_math": 0.5115895867347717,
"eai_open_web_math": 0.11586815118789673,
"eai_web_code": 0.4768604040145874
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-6,317,699,897,864,668,000 |
DRM
If you are purchasing DRMed music you better be burning it to CD. Otherwise, you run the risk of being screwed. I was not stupid enough to sign up for Microsquish or Yahoo, but I have bought more than my fair share from Apple. BUT I ALWAYS immediately burn the DRMed tracks to CD, re-rip the CD to MP3s and then file the CD and the DRMed tracks away for posterity. Its a pain in the ass, but it keeps me from being burned when the holder of the DRM keys decides the party is over.
Advertisements
~ by Genevieve on 2008.07.26.
Leave a Reply
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Google photo
You are commenting using your Google account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
Connecting to %s
%d bloggers like this:
|
{
"url": "https://thatsthisworldover.wordpress.com/2008/07/26/drm/",
"source_domain": "thatsthisworldover.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2019-18",
"warc_metadata": {
"Content-Length": "49474",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XTBFYAKOOYSEK534ERZTF7MBD7SSZU73",
"WARC-Concurrent-To": "<urn:uuid:fd085179-e482-4b49-83b2-32bff48924b0>",
"WARC-Date": "2019-04-21T06:25:53Z",
"WARC-IP-Address": "192.0.78.13",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:L7LD7AQR7MHQYS7SLHBRTOVW3MUOEIDB",
"WARC-Record-ID": "<urn:uuid:b11e6652-2bd3-4e6f-ba98-8f1909baa99b>",
"WARC-Target-URI": "https://thatsthisworldover.wordpress.com/2008/07/26/drm/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:35f1416a-f30b-46e9-9921-0de153f427b1>"
},
"warc_info": "isPartOf: CC-MAIN-2019-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-150-136-47.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
4,
5,
9,
10,
494,
495,
510,
511,
541,
542,
556,
557,
612,
613,
632,
633,
706,
707,
720,
721,
787,
788,
804,
805,
872,
873,
888,
889,
957,
958,
975,
976,
978
],
"line_end_idx": [
2,
4,
5,
9,
10,
494,
495,
510,
511,
541,
542,
556,
557,
612,
613,
632,
633,
706,
707,
720,
721,
787,
788,
804,
805,
872,
873,
888,
889,
957,
958,
975,
976,
978,
1000
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1000,
"ccnet_original_nlines": 34,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38755980134010315,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05263157933950424,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16746410727500916,
"rps_doc_frac_unique_words": 0.5813953280448914,
"rps_doc_mean_word_length": 4.412790775299072,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.3594865798950195,
"rps_doc_word_count": 172,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.14492754638195038,
"rps_doc_frac_chars_dupe_6grams": 0.07905138283967972,
"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.03952569141983986,
"rps_doc_frac_chars_top_3gram": 0.08432147651910782,
"rps_doc_frac_chars_top_4gram": 0.11067193746566772,
"rps_doc_books_importance": -108.0295181274414,
"rps_doc_books_importance_length_correction": -108.0295181274414,
"rps_doc_openwebtext_importance": -53.20635986328125,
"rps_doc_openwebtext_importance_length_correction": -39.163917541503906,
"rps_doc_wikipedia_importance": -37.135650634765625,
"rps_doc_wikipedia_importance_length_correction": -37.135650634765625
},
"fasttext": {
"dclm": 0.23452794551849365,
"english": 0.8679231405258179,
"fineweb_edu_approx": 1.4534554481506348,
"eai_general_math": -0.000010009999641624745,
"eai_open_web_math": 0.010188399814069271,
"eai_web_code": -0.000010009999641624745
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "780.285",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
5,199,776,427,966,816,000 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
PerlMonks
Re^4: Calling functions in middle of CGI HTML declarations
by Don Coyote (Monk)
on Aug 27, 2012 at 09:14 UTC ( #989944=note: print w/ replies, xml ) Need Help??
in reply to Re^3: Calling functions in middle of CGI HTML declarations
in thread Calling functions in middle of CGI HTML declarations
YM, no, no silent update. I kind of felt like mentioning that using the backslash ref notation as in your example is most likely a better way to use a ref overall. Though without proper tests I cannot really tell as I do not know.
I replied also to make the point the method is looking for a ref to produce the op requirements, whether a ref to an anonymous array or an actual array ref. And is also why I replied to your thread rather than again to the ot
hope this clears up what I was blabbering on about
Comment on Re^4: Calling functions in middle of CGI HTML declarations
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://989944]
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (7)
As of 2014-07-30 00:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
My favorite superfluous repetitious redundant duplicative phrase is:
Results (229 votes), past polls
|
{
"url": "http://www.perlmonks.org/index.pl?node_id=989944",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "17568",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UJPVGDYV2AVZDXAHUVLHLLDQXA7JBX3P",
"WARC-Concurrent-To": "<urn:uuid:caa3ce3e-a535-4e2d-a8c5-80a736116427>",
"WARC-Date": "2014-07-30T00:37:25Z",
"WARC-IP-Address": "216.92.34.251",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:3T4C63RVWGJGFG52G75UZWFCCVP5SA2I",
"WARC-Record-ID": "<urn:uuid:03096f36-df2a-4534-9765-3008ff06c26e>",
"WARC-Target-URI": "http://www.perlmonks.org/index.pl?node_id=989944",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a4549038-ee48-49e5-8be8-045edeebeba3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-146-231-18.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-23\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for July 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
63,
90,
92,
104,
105,
164,
165,
186,
267,
268,
269,
340,
403,
404,
635,
636,
862,
863,
914,
915,
916,
986,
987,
995,
1005,
1015,
1016,
1036,
1054,
1067,
1080,
1110,
1115,
1127,
1164,
1165,
1203,
1216,
1252,
1279,
1289,
1302,
1314,
1325,
1343,
1344,
1417,
1418,
1419,
1420,
1421,
1422,
1423,
1424,
1425,
1426
],
"line_end_idx": [
63,
90,
92,
104,
105,
164,
165,
186,
267,
268,
269,
340,
403,
404,
635,
636,
862,
863,
914,
915,
916,
986,
987,
995,
1005,
1015,
1016,
1036,
1054,
1067,
1080,
1110,
1115,
1127,
1164,
1165,
1203,
1216,
1252,
1279,
1289,
1302,
1314,
1325,
1343,
1344,
1417,
1418,
1419,
1420,
1421,
1422,
1423,
1424,
1425,
1426,
1461
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1461,
"ccnet_original_nlines": 56,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3006535768508911,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06535948067903519,
"rps_doc_frac_lines_end_with_ellipsis": 0.017543859779834747,
"rps_doc_frac_no_alph_words": 0.22875817120075226,
"rps_doc_frac_unique_words": 0.6528925895690918,
"rps_doc_mean_word_length": 4.623967170715332,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0.006535950116813183,
"rps_doc_unigram_entropy": 4.828147888183594,
"rps_doc_word_count": 242,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.16621984541416168,
"rps_doc_frac_chars_dupe_6grams": 0.16621984541416168,
"rps_doc_frac_chars_dupe_7grams": 0.16621984541416168,
"rps_doc_frac_chars_dupe_8grams": 0.16621984541416168,
"rps_doc_frac_chars_dupe_9grams": 0.08579088002443314,
"rps_doc_frac_chars_top_2gram": 0.05719392001628876,
"rps_doc_frac_chars_top_3gram": 0.06434316188097,
"rps_doc_frac_chars_top_4gram": 0.08579088002443314,
"rps_doc_books_importance": -150.08175659179688,
"rps_doc_books_importance_length_correction": -144.74754333496094,
"rps_doc_openwebtext_importance": -85.91517639160156,
"rps_doc_openwebtext_importance_length_correction": -85.91517639160156,
"rps_doc_wikipedia_importance": -55.51472091674805,
"rps_doc_wikipedia_importance_length_correction": -46.13947677612305
},
"fasttext": {
"dclm": 0.032978419214487076,
"english": 0.8851117491722107,
"fineweb_edu_approx": 1.6716794967651367,
"eai_general_math": 0.007156489882618189,
"eai_open_web_math": 0.19662374258041382,
"eai_web_code": 0.000032899999496294186
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
2,833,697,235,259,800,600 |
Tell me more ×
Database Administrators Stack Exchange is a question and answer site for database professionals who wish to improve their database skills and learn from others in the community. It's 100% free, no registration required.
I do not know whether this is a mysql(version 5.6.11) bug, the case is as following. today when i update mysql conf and kill -9 and restart mysqld, i find that it can't restart anymore. after having a look at the error log, i find the following:
2013-07-09 17:04:21 7872 [ERROR] InnoDB: Tried to read 1048576 bytes at offset 2097152. Was only able to read 917504.
then i make a strace to trace which file has the problem. the result is ibdata1.
-rw-rw----. 1 mysql mysql 79691776 7月 9 16:51 ibdata1
well, for performance i change log commit as following.
innodb_flush_log_at_trx_commit = 2
but i do not think this can cause data lost since OS does not reboot during mysql restart. so can anybody help me out on what's the reason(maybe the kill -9?) that makes data corrupt and how to restore the data, thank you very much.
share|improve this question
Do you have backup ? – Manaf Jul 9 at 10:35
yes, i make that operation on slave. so it does not affect much. but what confuses me is why that would happen. and what to do to make progress on that so that it would not happen again:) – user2431104 Jul 9 at 11:15
add comment
1 Answer
up vote 1 down vote accepted
If you don't have backup.
I think the recommended way to recover that databases is start MySQL with innodb_force_recovery = 4 (or higher values) and dump the databases to a SQL.Then drop it and recover from backup. Instead of dropping the original database I prefer to create the new databases with another name or in another server and check the content first.
STEPS TO BE FOLLOWED
1. In mysqld section of my.cnf add a line innodb_force_recovery = 4 and then restart MySQL server using /etc/init.d/mysql restart.
2. Take backup.
3. Restore it on other server and verify the contents.
Please also have a look at Forcing InnoDB Recovery.
UPDATE : For your comment how to progress on that so that it would not happen again
You should not kill MySQL it is not a good practice that may cause MySQL server to crash,whenever you make any configuration changes you should proceed as follows.
1. Safely stop MySQL Server using /etc/init.d/mysql stop
2. Make changes
3. Restart MySQL Server
share|improve this answer
thank you very much for your great help:) – user2431104 Jul 9 at 11:16
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://dba.stackexchange.com/questions/45991/mysql-ibdata1-corrupt",
"source_domain": "dba.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "48433",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:22DYS5CF6PW3UWZB4UFYINCNAUZDYHTL",
"WARC-Concurrent-To": "<urn:uuid:d958edee-33ca-4c5c-b4fc-8e9551bb9219>",
"WARC-Date": "2013-12-09T22:12:52Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:VBY6HVX6HJII6U4F4RDLICBPWJVVFJF6",
"WARC-Record-ID": "<urn:uuid:4fa587d8-ebdb-48e4-b4f4-5ee3cf814038>",
"WARC-Target-URI": "http://dba.stackexchange.com/questions/45991/mysql-ibdata1-corrupt",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1dea261f-a22e-4b25-8d49-47396d8ea007>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
15,
235,
236,
482,
483,
601,
602,
683,
684,
742,
743,
799,
800,
835,
836,
1069,
1070,
1098,
1100,
1145,
1147,
1365,
1377,
1378,
1387,
1388,
1417,
1418,
1444,
1445,
1781,
1782,
1803,
1804,
1937,
1938,
1956,
1957,
2014,
2015,
2067,
2068,
2152,
2153,
2317,
2318,
2377,
2395,
2421,
2447,
2449,
2521,
2533,
2534,
2546,
2547,
2549,
2557,
2558,
2636,
2637
],
"line_end_idx": [
15,
235,
236,
482,
483,
601,
602,
683,
684,
742,
743,
799,
800,
835,
836,
1069,
1070,
1098,
1100,
1145,
1147,
1365,
1377,
1378,
1387,
1388,
1417,
1418,
1444,
1445,
1781,
1782,
1803,
1804,
1937,
1938,
1956,
1957,
2014,
2015,
2067,
2068,
2152,
2153,
2317,
2318,
2377,
2395,
2421,
2447,
2449,
2521,
2533,
2534,
2546,
2547,
2549,
2557,
2558,
2636,
2637,
2727
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2727,
"ccnet_original_nlines": 61,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41296929121017456,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018771329894661903,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23208190500736237,
"rps_doc_frac_unique_words": 0.4903640151023865,
"rps_doc_mean_word_length": 4.4946465492248535,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.069888591766357,
"rps_doc_word_count": 467,
"rps_doc_frac_chars_dupe_10grams": 0.03906622156500816,
"rps_doc_frac_chars_dupe_5grams": 0.0562172494828701,
"rps_doc_frac_chars_dupe_6grams": 0.03906622156500816,
"rps_doc_frac_chars_dupe_7grams": 0.03906622156500816,
"rps_doc_frac_chars_dupe_8grams": 0.03906622156500816,
"rps_doc_frac_chars_dupe_9grams": 0.03906622156500816,
"rps_doc_frac_chars_top_2gram": 0.020962359383702278,
"rps_doc_frac_chars_top_3gram": 0.00857551023364067,
"rps_doc_frac_chars_top_4gram": 0.015245350077748299,
"rps_doc_books_importance": -229.372802734375,
"rps_doc_books_importance_length_correction": -229.372802734375,
"rps_doc_openwebtext_importance": -142.54763793945312,
"rps_doc_openwebtext_importance_length_correction": -142.54763793945312,
"rps_doc_wikipedia_importance": -109.33296966552734,
"rps_doc_wikipedia_importance_length_correction": -109.33296966552734
},
"fasttext": {
"dclm": 0.06490408629179001,
"english": 0.8967089056968689,
"fineweb_edu_approx": 1.4241441488265991,
"eai_general_math": 0.0026342899072915316,
"eai_open_web_math": 0.13377785682678223,
"eai_web_code": 0.00015724000695627183
}
}
|
{
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-7,316,952,196,844,193,000 |
Complemento Maven del paquete de contenido de Adobe
Utilice el complemento Maven del paquete de contenido de Adobe para integrar las tareas de implementación y administración de paquetes en sus proyectos de Maven.
La implementación de los paquetes construidos en AEM se realiza mediante el complemento Maven del paquete de contenido de Adobe y permite la automatización de las tareas que normalmente se realizan mediante AEM Administrador de paquetes:
• Cree nuevos paquetes a partir de archivos en el sistema de archivos.
• Instale y desinstale paquetes en AEM.
• Generar paquetes que ya están definidos en AEM.
• Obtenga una lista de paquetes instalados en AEM.
• Elimine un paquete de AEM.
Este documento detalla cómo utilizar Maven para administrar estas tareas. Sin embargo, también es importante comprender cómo se estructuran AEM proyectos y sus paquetes.
NOTA
La creación de paquetes ahora es propiedad del plugin Apache Jackrabbit FileVault Package Maven. La implementación de los paquetes construidos en AEM es realizada por el complemento Maven del paquete de contenido de Adobe como se describe aquí.
Paquetes y la estructura del proyecto AEM
AEM como Cloud Service se adhiere a las prácticas recomendadas más recientes para la administración de paquetes y la estructura de proyectos implementadas por el último tipo de archivo del proyecto AEM.
SUGERENCIA
Para obtener más información, consulte el artículo AEM Project Structure en la documentación de AEM como Cloud Service, así como la documentación de AEM Project Archetype. Ambos son totalmente compatibles con la versión AEM 6.5.
Obtención del complemento Maven del paquete de contenido
El complemento está disponible en el Repositorio Central de Maven.
Parámetros y objetivos del complemento Maven del paquete de contenido
Para utilizar el complemento Maven del paquete de contenido, agregue el siguiente elemento de complemento dentro del elemento de compilación del archivo POM:
<plugin>
<groupId>com.day.jcr.vault</groupId>
<artifactId>content-package-maven-plugin</artifactId>
<version>0.0.24</version>
<configuration>
<!-- parameters and values common to all goals, as required -->
</configuration>
</plugin>
Para permitir que Maven descargue el complemento, utilice el perfil proporcionado en la sección Obtención del complemento Maven del paquete de contenido de esta página.
Objetivos del complemento Maven del paquete de contenido
Los objetivos y parámetros de objetivo que proporciona el complemento Paquete de contenido se describen en las secciones siguientes. Los parámetros que se describen en la sección Parámetros comunes se pueden utilizar para la mayoría de los objetivos. Los parámetros que se aplican a un objetivo se describen en la sección para ese objetivo.
Prefijo de complemento
El prefijo del complemento es content-package. Utilice este prefijo para ejecutar un objetivo desde la línea de comandos, como en el siguiente ejemplo:
mvn content-package:build
Prefijo de parámetro
A menos que se indique lo contrario, los objetivos y parámetros del complemento utilizan el prefijo vault , como en el siguiente ejemplo:
mvn content-package:install -Dvault.targetURL="https://192.168.1.100:4502/crx/packmgr/service.jsp"
Proxies
Los objetivos que utilizan proxies para AEM utilizan la primera configuración de proxy válida que se encuentra en la configuración de Maven. Si no se encuentra ninguna configuración de proxy, no se utiliza ningún proxy. Consulte el parámetro useProxy en la sección Parámetros comunes.
Parámetros comunes
Los parámetros de la tabla siguiente son comunes para todos los objetivos excepto cuando se indican en la columna Objetivos.
Nombre Tipo Requerido Valor predeterminado Descripción Objetivos
failOnError boolean No false Un valor de true hace que la compilación falle cuando se produce un error. Un valor de false hace que la compilación ignore el error. Todos los objetivos excepto package
name String build: Sí, install: No, rm: Sí build: Sin valor predeterminado, install: El valor de la artifactId propiedad del proyecto Maven El nombre del paquete en el que debe actuar Todos los objetivos excepto ls
password String admin La contraseña utilizada para la autenticación con AEM Todos los objetivos excepto package
serverId String No El ID de servidor desde el que se recuperarán el nombre de usuario y la contraseña para la autenticación Todos los objetivos excepto package
targetURL String http://localhost:4502/crx/packmgr/service.jsp La URL de la API de servicio HTTP del administrador de paquetes AEM Todos los objetivos excepto package
timeout int No 5 Tiempo de espera de conexión para comunicarse con el servicio del administrador de paquetes, en segundos Todos los objetivos excepto package
useProxy boolean No true Un valor de true hace que Maven utilice la primera configuración de proxy activa que se encuentra para las solicitudes de proxy al Administrador de paquetes. Todos los objetivos excepto package
userId String admin El nombre de usuario que se va a autenticar con AEM Todos los objetivos excepto package
verbose boolean No false Habilita o deshabilita el registro detallado Todos los objetivos excepto package
versión
Crea un paquete de contenido que ya está definido en una instancia de AEM.
NOTA
No es necesario ejecutar este objetivo dentro de un proyecto de Maven.
Parámetros
Todos los parámetros para el objetivo de compilación se describen en la sección Parámetros comunes.
instalar
Instala un paquete en el repositorio. La ejecución de este objetivo no requiere un proyecto Maven. El objetivo está enlazado a la fase install del ciclo vital de la compilación de Maven.
Parámetros
Además de los siguientes parámetros, consulte las descripciones en la sección Parámetros comunes.
| Nombre | Tipo | Requerido | Valor predeterminado | Descripción |
|—|—|—|—|—|—|
| artifact | String | No | El valor de la propiedad artifactId del proyecto Maven | Una cadena del formulario groupId:artifactId:version[:packaging] |
| artifactId | String | No | Ninguna | El ID del artefacto que se va a instalar |
| groupId | String | No | Ninguna | El groupId del artefacto que se va a instalar |
| install | boolean | No | true | Determina si se desempaqueta automáticamente el paquete cuando se carga |
| localRepository | org.apache.maven.artifact.repository.ArtifactRepository | No | El valor de la variable del sistema localRepository | El repositorio local de Maven que no se puede configurar usando la configuración del complemento como propiedad del sistema siempre se utiliza |
| packageFile | java.io.File | No | El artefacto principal definido para el proyecto Maven | El nombre del archivo del paquete que se va a instalar |
| packaging | String | No | zip | El tipo de embalaje del artefacto que se va a instalar |
| pomRemoteRepositories | java.util.List | Sí | El valor de la propiedad remoteArtifactRepositories que se define para el proyecto Maven | Este valor no se puede configurar con la configuración del complemento y debe especificarse en el proyecto. |
| project | org.apache.maven.project.MavenProject | Sí | El proyecto para el que está configurado el complemento | El proyecto Maven que está implícito porque el proyecto contiene la configuración del complemento |
| repositoryId (POM), repoID (línea de comandos) | String | No | temp | ID del repositorio desde el que se recupera el artefacto |
| repositoryUrl (POM), repoURL (línea de comandos) | String | No | Ninguna | La dirección URL del repositorio desde el que se recupera el artefacto |
| version | Cadena | No | Ninguna | Versión del artefacto que se va a instalar |
ls
Enumera los paquetes que se implementan en el Administrador de paquetes.
Parámetros
Todos los parámetros del objetivo ls se describen en la sección Parámetros comunes.
rm
Elimina un paquete del Administrador de paquetes.
Parámetros
Todos los parámetros del objetivo rm se describen en la sección Parámetros comunes.
desinstalar
Desinstala un paquete. El paquete permanece en el servidor en estado desinstalado.
Parámetros
Todos los parámetros del objetivo de desinstalación se describen en la sección Parámetros comunes.
paquete
Crea un paquete de contenido. La configuración predeterminada del objetivo del paquete incluye el contenido del directorio donde se guardan los archivos compilados. La ejecución del objetivo del paquete requiere que la fase de compilación se haya completado. El objetivo del paquete está enlazado a la fase del paquete del ciclo vital de la compilación de Maven.
Parámetros
Además de los siguientes parámetros, consulte la descripción del parámetro name en la sección Parámetros comunes.
Nombre Tipo Requerido Valor predeterminado Descripción
archive org.apache.maven.archiver.MavenArchiveConfiguration No Ninguna La configuración del archivo que se va a utilizar
builtContentDirectory java.io.File El valor del directorio de salida de la compilación de Maven El directorio que contiene el contenido que se va a incluir en el paquete
dependencies java.util.List No Ninguna
embeddedTarget java.lang.String No Ninguna
embeddeds java.util.List No Ninguna
failOnMissingEmbed boolean false Un valor de true hace que la compilación falle cuando no se encuentra un artefacto incrustado en las dependencias del proyecto. Un valor de false hace que la compilación ignore estos errores.
filterSource java.io.File No Ninguna Este parámetro define un archivo que especifica el origen del filtro de espacio de trabajo. Los filtros especificados en la configuración e insertados mediante emebed o subpackages se combinan con el contenido del archivo.
filters com.day.jcr.vault.maven.pack.impl.DefaultWorkspaceFilter No Ninguna Este parámetro contiene elementos de filtro que definen el contenido del paquete. Cuando se ejecuta, los filtros se incluyen en el archivo filter.xml. Consulte la sección Uso de filtros a continuación.
finalName java.lang.String El finalName definido en el proyecto Maven (fase de compilación) El nombre del archivo ZIP del paquete generado, sin la extensión de archivo .zip
group java.lang.String El groupID definido en el proyecto Maven El groupId del paquete de contenido generado que forma parte de la ruta de instalación de destino para el paquete de contenido
outputDirectory java.io.File El directorio de compilación definido en el proyecto Maven El directorio local donde se guarda el paquete de contenido
prefix java.lang.String No Ninguna
project org.apache.maven.project.MavenProject Ninguna El proyecto Maven
properties java.util.Map No Ninguna Estos parámetros definen propiedades adicionales que se pueden establecer en el archivo properties.xml. Estas propiedades no pueden sobrescribir las siguientes propiedades predefinidas: group (utilice el parámetro group para establecer), name (utilice el parámetro name para configurar), version (utilice el parámetro version para configurar), description (establecido a partir de la descripción del proyecto), groupId (groupId del descriptor del proyecto Maven), artifactId (artifactId) Descriptor de proyecto de Maven), dependencies (utilice el parámetro dependencies para establecer), createdBy (el valor de la propiedad del sistema user.name), created (la hora del sistema actual), requiresRoot (use el parámetro requiresRoot para establecer), packagePath> (generado automáticamente a partir del grupo y el nombre del paquete)
requiresRoot boolean false Define si el paquete requiere root. Esto se convertirá en la propiedad requiresRoot del archivo properties.xml.
subPackages java.util.List No Ninguna
version java.lang.String La versión definida en el proyecto Maven La versión del paquete de contenido
workDirectory java.io.File El directorio definido en el proyecto Maven (fase de compilación) El directorio que contiene el contenido que se va a incluir en el paquete
Uso de filtros
Utilice el elemento filters para definir el contenido del paquete. Los filtros se añaden al elemento workspaceFilter en el archivo META-INF/vault/filter.xml del paquete.
El siguiente ejemplo de filtro muestra la estructura XML que se va a utilizar:
<filter>
<root>/apps/myapp</root>
<mode>merge</mode>
<includes>
<include>/apps/myapp/install/</include>
<include>/apps/myapp/components</include>
</includes>
<excludes>
<exclude>/apps/myapp/config/*</exclude>
</excludes>
</filter>
Modo de importación
El elemento mode define cómo se ve afectado el contenido del repositorio cuando se importa el paquete. Se pueden utilizar los siguientes valores:
• Combinar: se añade el contenido del paquete que no está ya en el repositorio. El contenido que se encuentra tanto en el paquete como en el repositorio no cambia. No se elimina ningún contenido del repositorio.
• Reemplazar: el contenido del paquete que no está en el repositorio se agrega al repositorio. El contenido del repositorio se reemplaza por contenido coincidente en el paquete. El contenido se elimina del repositorio cuando no existe en el paquete.
• Actualización: El contenido del paquete que no está en el repositorio se agrega al repositorio. El contenido del repositorio se reemplaza por contenido coincidente en el paquete. El contenido existente se elimina del repositorio.
Cuando el filtro no contiene ningún elemento mode, se utiliza el valor predeterminado de replace.
ayuda
Parámetros
Nombre Tipo Requerido Valor predeterminado Descripción
detail boolean No false Determina si se mostrarán todas las propiedades configurables para cada objetivo
goal String No Ninguna Estos parámetros definen el nombre del objetivo para el que mostrar la ayuda. Si no se especifica ningún valor, se muestra ayuda para todos los objetivos.
indentSize int No 2 El número de espacios que se deben utilizar para la sangría de cada nivel (debe ser positivo si se define)
lineLength int No 80 La longitud máxima de una línea de visualización (debe ser positiva si se define)
Inclusión de una imagen en miniatura o un archivo de propiedades en el paquete
Reemplace los archivos de configuración de paquetes predeterminados para personalizar las propiedades del paquete. Por ejemplo, incluya una imagen en miniatura para distinguir el paquete en el Administrador de paquetes y Uso compartido de paquetes.
Los archivos de origen se pueden ubicar en cualquier lugar del sistema de archivos. En el archivo POM, defina los recursos de compilación para copiar los archivos de origen en target/vault-work/META-INF para incluirlos en el paquete.
El siguiente código POM añade los archivos de la carpeta META-INF del origen del proyecto al paquete:
<build>
<resources>
<!-- vault META-INF resources (thumbnail etc.) -->
<resource>
<directory>${basedir}/src/main/content/META-INF</directory>
<targetPath>../vault-work/META-INF</targetPath>
</resource>
</resources>
</build>
El siguiente código POM añade solo una imagen en miniatura al paquete. La imagen en miniatura debe tener el nombre thumbnail.png y debe estar ubicada en la carpeta META-INF/vault/definition del paquete. En este ejemplo, el archivo de origen se encuentra en la carpeta /src/main/content/META-INF/vault/definition del proyecto:
<build>
<resources>
<!-- thumbnail only -->
<resource>
<directory>${basedir}/src/main/content/META-INF/vault/definition</directory>
<targetPath>../vault-work/META-INF/vault/definition</targetPath>
</resource>
</resources>
</build>
Uso del tipo de archivo del proyecto AEM para generar proyectos de AEM
El último tipo de archivo del proyecto de AEM implementa la estructura de paquetes de prácticas recomendadas tanto para implementaciones locales como de AMS y se recomienda para todos los proyectos de AEM.
SUGERENCIA
Para obtener más información, consulte el artículo AEM Project Structure en la documentación de AEM como Cloud Service, así como la documentación de AEM Project Archetype. Ambos son totalmente compatibles con la versión AEM 6.5.
En esta página
|
{
"url": "https://experienceleague.adobe.com/docs/experience-manager-cloud-service/implementing/developer-tools/maven-plugin.html?lang=es",
"source_domain": "experienceleague.adobe.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "129182",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VII4QAYCGGFTBHW574PYWFQWF5JWJVTH",
"WARC-Concurrent-To": "<urn:uuid:95139ce8-effa-4110-a3ea-84c1029cdceb>",
"WARC-Date": "2021-09-25T01:51:56Z",
"WARC-IP-Address": "52.167.10.121",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JHXIZWMVTI6XDSB5OKUV2GKIWAA3BSAS",
"WARC-Record-ID": "<urn:uuid:afe028ad-f34d-411b-9acc-fff4737d17aa>",
"WARC-Target-URI": "https://experienceleague.adobe.com/docs/experience-manager-cloud-service/implementing/developer-tools/maven-plugin.html?lang=es",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:807c3728-1820-4dc3-8bad-3f7ffa3c3fc7>"
},
"warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-43\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,
52,
53,
215,
216,
454,
455,
528,
570,
622,
675,
706,
707,
877,
878,
883,
884,
1129,
1130,
1172,
1173,
1376,
1377,
1388,
1389,
1618,
1619,
1676,
1677,
1744,
1745,
1815,
1816,
1974,
1975,
1984,
2022,
2077,
2104,
2121,
2192,
2210,
2220,
2221,
2390,
2391,
2448,
2449,
2790,
2791,
2814,
2815,
2967,
2968,
2994,
2995,
3016,
3017,
3155,
3156,
3255,
3256,
3264,
3265,
3550,
3551,
3570,
3571,
3696,
3697,
3762,
3961,
4176,
4288,
4448,
4615,
4773,
4992,
5100,
5206,
5207,
5215,
5216,
5291,
5292,
5297,
5298,
5369,
5370,
5381,
5382,
5482,
5483,
5492,
5493,
5680,
5681,
5692,
5693,
5791,
5792,
5859,
5873,
6024,
6106,
6190,
6298,
6580,
6730,
6821,
7070,
7285,
7416,
7566,
7647,
7648,
7651,
7652,
7725,
7726,
7737,
7738,
7822,
7823,
7826,
7827,
7877,
7878,
7889,
7890,
7974,
7975,
7987,
7988,
8071,
8072,
8083,
8084,
8183,
8184,
8192,
8193,
8556,
8557,
8568,
8569,
8683,
8684,
8739,
8860,
9030,
9069,
9112,
9148,
9373,
9633,
9911,
10084,
10275,
10423,
10458,
10530,
11397,
11536,
11574,
11676,
11843,
11844,
11859,
11860,
12030,
12031,
12110,
12111,
12120,
12148,
12170,
12188,
12242,
12298,
12317,
12335,
12389,
12408,
12418,
12438,
12439,
12585,
12586,
12800,
13052,
13286,
13287,
13385,
13386,
13392,
13393,
13404,
13405,
13460,
13565,
13743,
13870,
13973,
13974,
14053,
14054,
14303,
14304,
14538,
14539,
14641,
14642,
14650,
14666,
14725,
14744,
14816,
14876,
14896,
14913,
14922,
14923,
15249,
15250,
15258,
15274,
15306,
15325,
15414,
15491,
15511,
15528,
15537,
15538,
15609,
15610,
15816,
15817,
15828,
15829,
16058,
16059
],
"line_end_idx": [
52,
53,
215,
216,
454,
455,
528,
570,
622,
675,
706,
707,
877,
878,
883,
884,
1129,
1130,
1172,
1173,
1376,
1377,
1388,
1389,
1618,
1619,
1676,
1677,
1744,
1745,
1815,
1816,
1974,
1975,
1984,
2022,
2077,
2104,
2121,
2192,
2210,
2220,
2221,
2390,
2391,
2448,
2449,
2790,
2791,
2814,
2815,
2967,
2968,
2994,
2995,
3016,
3017,
3155,
3156,
3255,
3256,
3264,
3265,
3550,
3551,
3570,
3571,
3696,
3697,
3762,
3961,
4176,
4288,
4448,
4615,
4773,
4992,
5100,
5206,
5207,
5215,
5216,
5291,
5292,
5297,
5298,
5369,
5370,
5381,
5382,
5482,
5483,
5492,
5493,
5680,
5681,
5692,
5693,
5791,
5792,
5859,
5873,
6024,
6106,
6190,
6298,
6580,
6730,
6821,
7070,
7285,
7416,
7566,
7647,
7648,
7651,
7652,
7725,
7726,
7737,
7738,
7822,
7823,
7826,
7827,
7877,
7878,
7889,
7890,
7974,
7975,
7987,
7988,
8071,
8072,
8083,
8084,
8183,
8184,
8192,
8193,
8556,
8557,
8568,
8569,
8683,
8684,
8739,
8860,
9030,
9069,
9112,
9148,
9373,
9633,
9911,
10084,
10275,
10423,
10458,
10530,
11397,
11536,
11574,
11676,
11843,
11844,
11859,
11860,
12030,
12031,
12110,
12111,
12120,
12148,
12170,
12188,
12242,
12298,
12317,
12335,
12389,
12408,
12418,
12438,
12439,
12585,
12586,
12800,
13052,
13286,
13287,
13385,
13386,
13392,
13393,
13404,
13405,
13460,
13565,
13743,
13870,
13973,
13974,
14053,
14054,
14303,
14304,
14538,
14539,
14641,
14642,
14650,
14666,
14725,
14744,
14816,
14876,
14896,
14913,
14922,
14923,
15249,
15250,
15258,
15274,
15306,
15325,
15414,
15491,
15511,
15528,
15537,
15538,
15609,
15610,
15816,
15817,
15828,
15829,
16058,
16059,
16073
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 16073,
"ccnet_original_nlines": 242,
"rps_doc_curly_bracket": 0.0002488599857315421,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04405134171247482,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023933399468660355,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17689906060695648,
"rps_doc_frac_unique_words": 0.2206803858280182,
"rps_doc_mean_word_length": 5.850492477416992,
"rps_doc_num_sentences": 161,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.063790321350098,
"rps_doc_word_count": 2234,
"rps_doc_frac_chars_dupe_10grams": 0.09716908633708954,
"rps_doc_frac_chars_dupe_5grams": 0.29104819893836975,
"rps_doc_frac_chars_dupe_6grams": 0.22945676743984222,
"rps_doc_frac_chars_dupe_7grams": 0.204208105802536,
"rps_doc_frac_chars_dupe_8grams": 0.16373373568058014,
"rps_doc_frac_chars_dupe_9grams": 0.14521805942058563,
"rps_doc_frac_chars_top_2gram": 0.009487380273640156,
"rps_doc_frac_chars_top_3gram": 0.022035200148820877,
"rps_doc_frac_chars_top_4gram": 0.01767406053841114,
"rps_doc_books_importance": -1476.14501953125,
"rps_doc_books_importance_length_correction": -1476.14501953125,
"rps_doc_openwebtext_importance": -912.2020874023438,
"rps_doc_openwebtext_importance_length_correction": -912.2020874023438,
"rps_doc_wikipedia_importance": -575.4745483398438,
"rps_doc_wikipedia_importance_length_correction": -575.4745483398438
},
"fasttext": {
"dclm": 0.7814542055130005,
"english": 0.002227779943495989,
"fineweb_edu_approx": 0.9944574236869812,
"eai_general_math": 0.000007269999969139462,
"eai_open_web_math": 0.5271837711334229,
"eai_web_code": 0.6546127200126648
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
1,044,714,707,670,386,200 |
Figma Support Forum
What is happening exactly with this specific icon?
Is this problem with icon or with figma?
I have some examples of similar things in my figma.wtf gallery of glitches. This happens when the vector extends to a very large amount of pixels, in this case it’s probably a glitch in import or something. Check the vector or simply get another one somewhere else.
This topic was automatically closed 30 days after the last reply. New replies are no longer allowed.
|
{
"url": "https://forum.figma.com/t/what-is-happening-exactly-with-this-specific-icon/5512",
"source_domain": "forum.figma.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "72248",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GNNTWJN2NXZXGUVWRUUINXNMSQ6NAQD5",
"WARC-Concurrent-To": "<urn:uuid:19fce424-4787-4288-95e1-76db52055613>",
"WARC-Date": "2021-10-17T01:10:00Z",
"WARC-IP-Address": "184.105.176.45",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IKTYTJ6NXGG5N3IVO6PDY4TSKVBR3LAN",
"WARC-Record-ID": "<urn:uuid:d3867056-b40d-4be5-a99a-7a46227937e0>",
"WARC-Target-URI": "https://forum.figma.com/t/what-is-happening-exactly-with-this-specific-icon/5512",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5a601e05-fde1-4e5b-a72c-189f762f6a93>"
},
"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-112\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
20,
21,
72,
73,
114,
115,
116,
382,
383
],
"line_end_idx": [
20,
21,
72,
73,
114,
115,
116,
382,
383,
483
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 483,
"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.4526315927505493,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010526319965720177,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11578947305679321,
"rps_doc_frac_unique_words": 0.7710843682289124,
"rps_doc_mean_word_length": 4.6626505851745605,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.039830207824707,
"rps_doc_word_count": 83,
"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.046511631458997726,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -51.14486312866211,
"rps_doc_books_importance_length_correction": -57.788387298583984,
"rps_doc_openwebtext_importance": -32.388084411621094,
"rps_doc_openwebtext_importance_length_correction": -39.03160858154297,
"rps_doc_wikipedia_importance": -22.936147689819336,
"rps_doc_wikipedia_importance_length_correction": -29.579669952392578
},
"fasttext": {
"dclm": 0.04208958148956299,
"english": 0.9558940529823303,
"fineweb_edu_approx": 1.7589104175567627,
"eai_general_math": 0.29412972927093506,
"eai_open_web_math": 0.10028868913650513,
"eai_web_code": 0.00004065000030095689
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "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": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-3,468,049,600,437,089,300 |
reddit is a website about everything
powered by community, democracy, and you.
learn more ›
Show Box for Android (not available in Play Store) similar to PopcornTime by postdarwinin PopCornTime
[–]postdarwin[S] 0 points1 point ago
I've been using this for a while and it seems to work really well, especially for TV shows -- constant updates.
It doesn't appear to be malware or spyware, I've run a few checks. It's ad supported.
Other opinions welcome.
Should humour have boundaries? by PoweredByPotatoin TrueAskReddit
[–]postdarwin 0 points1 point ago
Kramer's racist rant was intended to be funny, but it didn't work. That's an example of the outcome being more important than the intention.
A girl jumping rope on youtube. I took out all the frames except the peak of each jump. by 00spoolin mildlyinteresting
[–]postdarwin 46 points47 points ago
She looks like she's saying Help, help me.
What is Stephen Colbert like out of character? by I_WILL_BOLD_COMMENTSin entertainment
[–]postdarwin 0 points1 point ago
O'Reilly made fun of him for being French, but Stephen is actually proud of his Irish roots. The railway station in my town is named after Con Colbert a hero of the 1916 rising.
1* movie reviews from Amazon placed onto their movie posters by bolchin movies
[–]postdarwin 0 points1 point ago
I was thinking, yeah it is but WITHOUT RICHARD PRYOR TOO.
The limits of low budget films. Why they look low budget. by NoeticIntelligencein TrueFilm
[–]postdarwin 0 points1 point ago
I forget who said it (Scorcese?): it costs the same to make a good movie or a bad movie.
Microtonal Guitar: Dave Fuze Fiuczynski - Guitarkadia Sessions by itahin jazzguitar
[–]postdarwin 2 points3 points ago
Sounds exactly like my first electric, a no-name Japanese tele copy from the 70s.
Basic question about jazz chords by Beanb0yin jazzguitar
[–]postdarwin 5 points6 points ago
This is the correct answer. And this is a superfluous comment.
Make-your-own authentic sheriff/police/FBI badge by postdarwinin shutupandtakemymoney
[–]postdarwin[S] -1 points0 points ago
You're deciding on the definition of 'authentic' as a word. It's purely semantics.
I mean 'authentic' in the same way as period orchestras use authentic instruments, i.e. built with the same materials and played in the same style as, say, a baroque orchestra would have -- but this is not to say that they are literally a seventeenth century orchestra.
*Also, it's 'counterfeiting' (unless you're fitting counters).
Make-your-own authentic sheriff/police/FBI badge by postdarwinin shutupandtakemymoney
[–]postdarwin[S] -7 points-6 points ago
I mean they appear to use the same quality materials and accessories as law enforcement agencies.
As opposed to these.
Any ways to improve sightreading? by lameo39in piano
[–]postdarwin 0 points1 point ago
That's why exercises like Czerny are a little confusing for me. I suppose I should stick to pieces.
The less Americans know about Ukraine’s location, the more they want U.S. to intervene by HomelySapienin Foodforthought
[–]postdarwin 0 points1 point ago
I know you meant that to sound absurd but it's not a particularly arresting statement, since there are plenty of Ukrainians here -- or people who live nearby.
The purpose of horror films in contemporary cinema? by milewskia2in TrueFilm
[–]postdarwin 1 point2 points ago
To be a little flippant in response to your title, the purpose of modern horror, more than perhaps any other genre, is to make quick cash. It is consistently the cheapest to produce and most popular impulsive movie-going decision.
As to the semantics of what constitutes specific 'horror' genres, I think it's about as complex as you decide to make it. Pretty similar to exploring the morass of metal subgenres, where you eventually discover a label with only one band as the exemplar.
Any ways to improve sightreading? by lameo39in piano
[–]postdarwin 1 point2 points ago
I'm self-taught and I'm trying to improve my sight reading too. Playing without knowing whether I'm hitting all the right notes is a strange sensation. I suppose I just keep plugging away, right.
|
{
"url": "http://www.reddit.com/user/postdarwin",
"source_domain": "www.reddit.com",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "116975",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4OUBWYLNPPB2XVHAXLP7V3T4OJX6ZTEN",
"WARC-Concurrent-To": "<urn:uuid:eb2718dd-40f9-43d7-8f40-37857d77a3ee>",
"WARC-Date": "2014-04-17T05:10:12Z",
"WARC-IP-Address": "23.0.160.8",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:N7PVFIU3HFDW7A3GJ7O67COKN6H5VFYH",
"WARC-Record-ID": "<urn:uuid:73bfa711-bd3e-4e04-a68f-670ac8f1f4dc>",
"WARC-Target-URI": "http://www.reddit.com/user/postdarwin",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:452298ec-07a9-4515-8a46-43c94e0c4447>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-147-4-33.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-15\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for April 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
37,
38,
80,
81,
94,
95,
197,
198,
235,
236,
348,
349,
435,
436,
460,
461,
527,
528,
562,
563,
704,
705,
824,
825,
862,
863,
906,
907,
994,
995,
1029,
1030,
1208,
1209,
1288,
1289,
1323,
1324,
1382,
1383,
1474,
1475,
1509,
1510,
1599,
1600,
1684,
1685,
1720,
1721,
1803,
1804,
1861,
1862,
1897,
1898,
1961,
1962,
2048,
2049,
2088,
2089,
2172,
2173,
2443,
2444,
2507,
2508,
2594,
2595,
2635,
2636,
2734,
2735,
2756,
2757,
2810,
2811,
2845,
2846,
2946,
2947,
3067,
3068,
3102,
3103,
3262,
3263,
3340,
3341,
3375,
3376,
3607,
3608,
3863,
3864,
3917,
3918,
3952,
3953
],
"line_end_idx": [
37,
38,
80,
81,
94,
95,
197,
198,
235,
236,
348,
349,
435,
436,
460,
461,
527,
528,
562,
563,
704,
705,
824,
825,
862,
863,
906,
907,
994,
995,
1029,
1030,
1208,
1209,
1288,
1289,
1323,
1324,
1382,
1383,
1474,
1475,
1509,
1510,
1599,
1600,
1684,
1685,
1720,
1721,
1803,
1804,
1861,
1862,
1897,
1898,
1961,
1962,
2048,
2049,
2088,
2089,
2172,
2173,
2443,
2444,
2507,
2508,
2594,
2595,
2635,
2636,
2734,
2735,
2756,
2757,
2810,
2811,
2845,
2846,
2946,
2947,
3067,
3068,
3102,
3103,
3262,
3263,
3340,
3341,
3375,
3376,
3607,
3608,
3863,
3864,
3917,
3918,
3952,
3953,
4148
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4148,
"ccnet_original_nlines": 100,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36606061458587646,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0363636389374733,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1903030276298523,
"rps_doc_frac_unique_words": 0.5377503633499146,
"rps_doc_mean_word_length": 5.061633110046387,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.4081130027771,
"rps_doc_word_count": 649,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.14642314612865448,
"rps_doc_frac_chars_dupe_6grams": 0.11202435195446014,
"rps_doc_frac_chars_dupe_7grams": 0.08645357936620712,
"rps_doc_frac_chars_dupe_8grams": 0.08645357936620712,
"rps_doc_frac_chars_dupe_9grams": 0.0334855392575264,
"rps_doc_frac_chars_top_2gram": 0.017047179862856865,
"rps_doc_frac_chars_top_3gram": 0.027701670303940773,
"rps_doc_frac_chars_top_4gram": 0.034094370901584625,
"rps_doc_books_importance": -393.97650146484375,
"rps_doc_books_importance_length_correction": -393.97650146484375,
"rps_doc_openwebtext_importance": -223.17860412597656,
"rps_doc_openwebtext_importance_length_correction": -223.17860412597656,
"rps_doc_wikipedia_importance": -162.19692993164062,
"rps_doc_wikipedia_importance_length_correction": -162.19692993164062
},
"fasttext": {
"dclm": 0.20414596796035767,
"english": 0.9445464015007019,
"fineweb_edu_approx": 1.4799256324768066,
"eai_general_math": 0.17453163862228394,
"eai_open_web_math": 0.21978121995925903,
"eai_web_code": 0.004065279848873615
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "791.4372",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
5,200,169,677,941,122,000 |
View Single Post
#3
Old 2013-10-22, 12:52 PM
Needledick
Re: Pulled Torrents - Unfair
The other two shows are no different from the Paramount show. PARTS have been officially released. These are the uncut shows. The official release of the full Paramount show is a completely different mix. Aren't different mixes of official releases allowed? Based on the way this tracker runs, it shouldn't have been pulled.
This show http://www.thetradersden.org/forums/...ad.php?t=67299 was officially released. But apparently it's allowed because it's a different mix. How is the Nirvana Pararmount show any different?
Here's another show that was officially released, but is allowed because it's a different mix http://www.thetradersden.org/forums/...d.php?t=106979, again, no different from the Nirvana Paramount show.
Unless there is something YOU don't understand?
Last edited by Needledick; 2013-10-22 at 12:59 PM.
Reply With Quote Reply with Nested Quotes
|
{
"url": "http://www.thetradersden.org/forums/showpost.php?p=1945981&postcount=3",
"source_domain": "www.thetradersden.org",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "8165",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HTN5VA2GNKBFSQ2GSF2R4HL746WRWUGM",
"WARC-Concurrent-To": "<urn:uuid:d1da1fde-6c32-450a-b5a9-7360207afe4d>",
"WARC-Date": "2019-10-18T15:49:08Z",
"WARC-IP-Address": "199.101.99.188",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:2V4OKZZSFQEXPCRL5YKOWK3IUBM566QC",
"WARC-Record-ID": "<urn:uuid:685f6b75-e3bd-4018-b84d-8237ba85e477>",
"WARC-Target-URI": "http://www.thetradersden.org/forums/showpost.php?p=1945981&postcount=3",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:57b73ebf-71ce-4357-bb7b-1dd0abccb894>"
},
"warc_info": "isPartOf: CC-MAIN-2019-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-214.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,
17,
24,
49,
60,
62,
91,
92,
417,
418,
615,
616,
818,
819,
867,
868,
919,
961
],
"line_end_idx": [
17,
24,
49,
60,
62,
91,
92,
417,
418,
615,
616,
818,
819,
867,
868,
919,
961,
962
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 962,
"ccnet_original_nlines": 17,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3037383258342743,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018691590055823326,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.29439252614974976,
"rps_doc_frac_unique_words": 0.6000000238418579,
"rps_doc_mean_word_length": 5.5851850509643555,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0.014018690213561058,
"rps_doc_unigram_entropy": 4.194437026977539,
"rps_doc_word_count": 135,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07957559823989868,
"rps_doc_frac_chars_dupe_6grams": 0.07957559823989868,
"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.0517241396009922,
"rps_doc_frac_chars_top_3gram": 0.03978779911994934,
"rps_doc_frac_chars_top_4gram": 0.04774535819888115,
"rps_doc_books_importance": -120.5008773803711,
"rps_doc_books_importance_length_correction": -120.5008773803711,
"rps_doc_openwebtext_importance": -72.001953125,
"rps_doc_openwebtext_importance_length_correction": -58.547203063964844,
"rps_doc_wikipedia_importance": -53.21815872192383,
"rps_doc_wikipedia_importance_length_correction": -53.21815872192383
},
"fasttext": {
"dclm": 0.04996126890182495,
"english": 0.951394259929657,
"fineweb_edu_approx": 1.1030428409576416,
"eai_general_math": 0.0020368099212646484,
"eai_open_web_math": 0.58283531665802,
"eai_web_code": -0.000008940000043367036
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "343.73",
"labels": {
"level_1": "Social sciences",
"level_2": "Law",
"level_3": "Criminal law"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
5,697,433,673,620,267,000 |
Woocomerce customization
Hello!
I’ve been using Sydney theme (thank you for making it so nice!) for my business - www.freshmorrow.com
Woocommerce plugin is not really allowing me to customize any pagers (Shop, Product, Chart, Checkout), change font, colors, forms. Is there anyway to do this?
If not, could you please help me with this one issue. I have a problem with a quantity box of products (it is too small, that you can’t see how much you’re buying)
When one wants to purchase the product it takes them to the product page. There is no way someone can see or change the quantity so no way to know how many they already put in the chart. Same thing on the checkout page
Thank you,
Anja
Hello Anja,
1. Please check this WooCommerce documentation page:
https://docs.woocommerce.com/document/template-structure/
2. Please note that Sydney Pro theme provides WooCommerce integration.
You can try the solution that I mentioned in this topic:
Please feel free to ask any other questions that you might have.
Kind Regards, Roman.
|
{
"url": "https://forums.athemes.com/t/woocomerce-customization/14567",
"source_domain": "forums.athemes.com",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "16296",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RISES2WLBPNGACWIXHD5AYOQI5SNTCEV",
"WARC-Concurrent-To": "<urn:uuid:75e66e15-cdf1-4139-a45c-b67dc78a5a3c>",
"WARC-Date": "2020-10-01T13:13:48Z",
"WARC-IP-Address": "45.55.62.41",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ESI33K4PSWK7ROHIH2S64ZR6UOWJHP57",
"WARC-Record-ID": "<urn:uuid:66589d43-37a4-4042-b4b4-9641d5fb3d18>",
"WARC-Target-URI": "https://forums.athemes.com/t/woocomerce-customization/14567",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d881b6cf-fd7d-4cc0-938f-fa68522d5d63>"
},
"warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-103.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
25,
26,
33,
34,
136,
295,
296,
460,
679,
690,
695,
696,
708,
709,
764,
826,
827,
900,
901,
958,
959,
1024,
1025
],
"line_end_idx": [
25,
26,
33,
34,
136,
295,
296,
460,
679,
690,
695,
696,
708,
709,
764,
826,
827,
900,
901,
958,
959,
1024,
1025,
1045
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1045,
"ccnet_original_nlines": 23,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4260089695453644,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013452909886837006,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19730941951274872,
"rps_doc_frac_unique_words": 0.6411764621734619,
"rps_doc_mean_word_length": 4.794117450714111,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.526037216186523,
"rps_doc_word_count": 170,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.019631899893283844,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -105.90177154541016,
"rps_doc_books_importance_length_correction": -105.90177154541016,
"rps_doc_openwebtext_importance": -45.19804763793945,
"rps_doc_openwebtext_importance_length_correction": -32.322410583496094,
"rps_doc_wikipedia_importance": -38.194297790527344,
"rps_doc_wikipedia_importance_length_correction": -38.194297790527344
},
"fasttext": {
"dclm": 0.13552474975585938,
"english": 0.8967161178588867,
"fineweb_edu_approx": 0.6672486662864685,
"eai_general_math": 0.1305680274963379,
"eai_open_web_math": 0.15954804420471191,
"eai_web_code": 0.009410560131072998
}
}
|
{
"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.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-7,483,425,521,180,574,000 |
Stack Overflow is a community of 4.7 million programmers, just like you, helping each other.
Join them; it only takes a minute:
Sign up
Join the Stack Overflow community to:
1. Ask programming questions
2. Answer and help your peers
3. Get recognized for your expertise
I'm using Jsoup for sanitizing user input from a form. The form in question contains a <textarea> that expects plain text. When the form is submitted, I clean the input with Jsoup.clean(textareaContents); however, since html ignores extra whitespace, Jsoup.clean() will remove valuable whitespace characters from the input.
For example, if someone entered some lines of text in the textarea:
hello
test
after Jsoup.clean(), you will have:
hello test
How can you make Jsoup.clean() preserve whitespace? I know it's designed for parsing html and this isn't html, so is there a better alternative?
share|improve this question
up vote 4 down vote accepted
If your textarea just expects plain text, then I think you'd be better off just HTML escaping the plain text. I.e. convert user's input < and > tags to < and > respectively. Either on input our output (input might be safer so you only need to think about it once).
The jsoup HTML cleaner is, as you say, designed to parse untrusted input HTML and outuput trusted HTML, where formatting is done with elements.
share|improve this answer
For future generations, if you still need to get access to original text with whitespace, you can use TextNode.getWholeText() method.
Sample code:
/**
* @param cell element that contains whitespace formatting
* @return
*/
public static String getText(Element cell) {
String text = null;
List<Node> childNodes = cell.childNodes();
if (childNodes.size() > 0) {
Node childNode = childNodes.get(0);
if (childNode instanceof TextNode) {
text = ((TextNode)childNode).getWholeText();
}
}
if (text == null) {
text = cell.text();
}
return text;
}
In the code above, we assume that the passed in element contains text content directly inside element body (we take the first node). If that is not so, it will fall back to regular Element.text() method.
share|improve this answer
Neeme Praks' answer was very good and preserved whitespace correctly. However, inline HTML really messes it up.
<span>This is<br />some text. Cool story.</span>
Results in
"This is"
Or if you pass in an element that doesn't have its own text, it returns null.
So I had to rework the method a little for my purposes. This might help some folks so I'm posting it here. The basic idea is to iterate the children instead of just taking the first one. This also includes a case to grab the HTML for any elements without children.
This way the original snippet returns:
This is<br />some text. Cool story.
public static String getText(Element cell) {
StringBuilder textBuilder = new StringBuilder();
for (Node node : cell.childNodes()) {
if (node instanceof TextNode) {
textBuilder.append(((TextNode)node).getWholeText());
}
else {
for (Node childNode : node.childNodes()) {
textBuilder.append(getText((Element)childNode));
}
textBuilder.append(node.outerHtml());
}
}
if (cell.childNodes().isEmpty()) {
textBuilder.append(cell.outerHtml());
}
return textBuilder.toString();
}
share|improve this answer
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/5454172/prevent-jsoup-from-discarding-extra-whitespace",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "86514",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZOJGIBPWPUMYQRTQCFW2D2TZGJDGTNPE",
"WARC-Concurrent-To": "<urn:uuid:4e0f2b23-bc41-4df3-9c58-6e6f68926539>",
"WARC-Date": "2016-05-06T22:51:54Z",
"WARC-IP-Address": "104.16.37.249",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:AFXXSU6K5U3475BP7AK5IKTMDYSNLYCW",
"WARC-Record-ID": "<urn:uuid:8895b6b8-eb33-40a2-8c34-c474dc98de1c>",
"WARC-Target-URI": "http://stackoverflow.com/questions/5454172/prevent-jsoup-from-discarding-extra-whitespace",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b3c05280-d8bd-49d6-8bdd-98b5b79c0f58>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-239-7-51.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
93,
94,
129,
130,
138,
176,
207,
239,
278,
279,
603,
604,
672,
673,
679,
680,
685,
686,
722,
723,
734,
735,
880,
881,
909,
938,
939,
1210,
1211,
1355,
1356,
1382,
1383,
1517,
1518,
1531,
1532,
1536,
1595,
1606,
1610,
1655,
1679,
1726,
1759,
1803,
1848,
1905,
1915,
1921,
1945,
1973,
1979,
1996,
1998,
1999,
2203,
2204,
2230,
2231,
2343,
2344,
2394,
2395,
2406,
2407,
2417,
2418,
2496,
2497,
2762,
2763,
2802,
2803,
2840,
2841,
2886,
2939,
2981,
3021,
3086,
3096,
3111,
3166,
3231,
3245,
3295,
3305,
3311,
3350,
3396,
3402,
3437,
3439,
3465,
3466,
3478,
3479,
3481,
3489,
3490,
3568,
3569
],
"line_end_idx": [
93,
94,
129,
130,
138,
176,
207,
239,
278,
279,
603,
604,
672,
673,
679,
680,
685,
686,
722,
723,
734,
735,
880,
881,
909,
938,
939,
1210,
1211,
1355,
1356,
1382,
1383,
1517,
1518,
1531,
1532,
1536,
1595,
1606,
1610,
1655,
1679,
1726,
1759,
1803,
1848,
1905,
1915,
1921,
1945,
1973,
1979,
1996,
1998,
1999,
2203,
2204,
2230,
2231,
2343,
2344,
2394,
2395,
2406,
2407,
2417,
2418,
2496,
2497,
2762,
2763,
2802,
2803,
2840,
2841,
2886,
2939,
2981,
3021,
3086,
3096,
3111,
3166,
3231,
3245,
3295,
3305,
3311,
3350,
3396,
3402,
3437,
3439,
3465,
3466,
3478,
3479,
3481,
3489,
3490,
3568,
3569,
3659
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3659,
"ccnet_original_nlines": 103,
"rps_doc_curly_bracket": 0.005465969908982515,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.297587126493454,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017426269128918648,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.277479887008667,
"rps_doc_frac_unique_words": 0.5030425786972046,
"rps_doc_mean_word_length": 5.342799186706543,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.143453121185303,
"rps_doc_word_count": 493,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.027334850281476974,
"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.024297650903463364,
"rps_doc_frac_chars_top_3gram": 0.025056950747966766,
"rps_doc_frac_chars_top_4gram": 0.024297650903463364,
"rps_doc_books_importance": -274.520263671875,
"rps_doc_books_importance_length_correction": -274.520263671875,
"rps_doc_openwebtext_importance": -139.8436737060547,
"rps_doc_openwebtext_importance_length_correction": -139.8436737060547,
"rps_doc_wikipedia_importance": -101.89966583251953,
"rps_doc_wikipedia_importance_length_correction": -101.89966583251953
},
"fasttext": {
"dclm": 0.9691107869148254,
"english": 0.7526149153709412,
"fineweb_edu_approx": 2.623195171356201,
"eai_general_math": 0.030858520418405533,
"eai_open_web_math": 0.28792184591293335,
"eai_web_code": 0.007786749862134457
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-4,600,919,936,798,878,000 |
8
I recently upgraded to Entity Framework 6 and installed the MySql 6.8.2 RC Connector as it stated there was support for EF6 Code First now.
Keep in mind, prior to the upgrade my project was functioning fine running in connector 6.7.4 and EF 5.
I made the following changes to my web.config
<defaultConnectionFactory type="MySql.Data.Entity.MySqlConnectionFactory, MySql.Data.Entity.EF6" />
<providers>
<provider invariantName="MySql.Data.MySqlClient" type="MySql.Data.MySqlClient.MySqlProviderServices, MySql.Data.Entity.EF6, Version=6.8.2.0, Culture=neutral, PublicKeyToken=c5687fc88969c44d"></provider>
<provider invariantName="System.Data.SqlClient" type="System.Data.Entity.SqlServer.SqlProviderServices, EntityFramework.SqlServer" />
</providers>
<connectionStrings>
<add providerName="MySql.Data.MySqlClient" name="dbcontext" connectionString="Server=localhost; Database=db; Uid=un; Pwd=pw;Convert Zero Datetime=True" />
</connectionStrings>
I also added the following references (.net 4.5 versions)
1. MySql.Data
2. MySql.Data.Entity.EF6
3. MySql.Web
The problem is - the moment the code calls the DBContext i receive:
Object reference not set to an instance of an object.
Again - keep in mind that everything worked prior to the upgrade, so I know its not a code issue, however, maybe I didn't setup the web.config properly?
Also - you may ask, if it worked great prior to the upgrade, why upgrade? Well, supposedly EF6 and the new MySql connector solves some bugs I was running into - so I was hoping to implement it now, while its in development and by the time it moves to production (months from now) I should be able to load in the production version of the 6.8.x connector.
Here is the stack trace in case it helps
[NullReferenceException: Object reference not set to an instance of an object.]
MySql.Data.MySqlClient.MySqlProviderServices.GetDbProviderManifestToken(DbConnection connection) +85
System.Data.Entity.Core.Common.DbProviderServices.GetProviderManifestToken(DbConnection connection) +332
System.Data.Entity.Utilities.DbProviderServicesExtensions.GetProviderManifestTokenChecked(DbProviderServices providerServices, DbConnection connection) +67
System.Data.Entity.Infrastructure.<>c__DisplayClass1.<ResolveManifestToken>b__0(Tuple`3 k) +63
System.Collections.Concurrent.ConcurrentDictionary`2.GetOrAdd(TKey key, Func`2 valueFactory) +72
System.Data.Entity.Infrastructure.DefaultManifestTokenResolver.ResolveManifestToken(DbConnection connection) +260
System.Data.Entity.Utilities.DbConnectionExtensions.GetProviderInfo(DbConnection connection, DbProviderManifest& providerManifest) +89
System.Data.Entity.DbModelBuilder.Build(DbConnection providerConnection) +79
System.Data.Entity.Internal.LazyInternalContext.CreateModel(LazyInternalContext internalContext) +143
System.Data.Entity.Internal.RetryLazy`2.GetValue(TInput input) +171
System.Data.Entity.Internal.LazyInternalContext.InitializeContext() +594
System.Data.Entity.Internal.InternalContext.Initialize() +31
System.Data.Entity.Internal.InternalContext.GetEntitySetAndBaseTypeForType(Type entityType) +39
System.Data.Entity.Internal.Linq.InternalSet`1.Initialize() +138
System.Data.Entity.Internal.Linq.InternalSet`1.Include(String path) +41
System.Data.Entity.Infrastructure.DbQuery`1.Include(String path) +142
[edited].Global.Application_BeginRequest(Object sender, EventArgs e) in c:\edited\Global.asax.cs:47
System.Web.SyncEventExecutionStep.System.Web.HttpApplication.IExecutionStep.Execute() +136
System.Web.HttpApplication.ExecuteStep(IExecutionStep step, Boolean& completedSynchronously) +69
| |
• aren't you suppose to report this as issue/bug at the project support site? since it's a RC, it's a beta. – Kelmen Dec 16 '13 at 3:34
• I'm not sure if this is a bug or if there is a new/diff way to set it up - i did however post this on the mysql forums as well. So if i get an answer there i'll update it here as well – 99823 Dec 16 '13 at 3:35
• What about a link to the question in the mysql forum? – MacX Jan 3 '14 at 7:23
• @99823 Did you find out what was causing this issue for you? – Sharique Abdullah May 25 '15 at 14:29
• I set web project as startup project, then it worked. – Jia Yang Jun 8 '16 at 6:14
27
I had MySQL EF6 and Migrations up and working when everything was in one MVC project. I split it out into layers (Core[Interfaces/Entitites], Data, Services, and Web) and started getting the same error Loren mentioned.
Figured out that it wasn't picking up the connection string from the MVC app. Turns out that all I had to do was re-create the connection string within the App.config in my Data project (where the DbContext and mappings reside).
These are the steps I took to get everything working:
Step 1) Use NuGet to import MySql.Data.Entities (current version as of this post is 6.8.3.0)
Step 2) Add the following to App.config and/or Web.config:
<connectionStrings>
<add name="MyDB" providerName="MySql.Data.MySqlClient" connectionString="Data Source=localhost; port=3306; Initial Catalog=mydb; uid=myuser; pwd=mypass;" />
</connectionStrings>
<entityFramework>
<defaultConnectionFactory type="System.Data.Entity.Infrastructure.SqlConnectionFactory, EntityFramework" />
<providers>
<provider invariantName="System.Data.SqlClient" type="System.Data.Entity.SqlServer.SqlProviderServices, EntityFramework.SqlServer" />
<provider invariantName="MySql.Data.MySqlClient" type="MySql.Data.MySqlClient.MySqlProviderServices, MySql.Data.Entity.EF6, Version=6.8.3.0, Culture=neutral, PublicKeyToken=c5687fc88969c44d"></provider>
</providers>
</entityFramework>
Step 3) Set up your DbContext to use MySql:
using MyApp.Core.Entities.Directory;
using MyApp.Data.Mapping;
using System.Data.Entity;
namespace MyApp.Data
{
[DbConfigurationType(typeof(MySql.Data.Entity.MySqlEFConfiguration))]
public class MyContext : DbContext
{
public MyContext() : this("MyDB") { }
public MyContext(string connStringName) : base(connStringName) {}
static MyContext ()
{
// static constructors are guaranteed to only fire once per application.
// I do this here instead of App_Start so I can avoid including EF
// in my MVC project (I use UnitOfWork/Repository pattern instead)
DbConfiguration.SetConfiguration(new MySql.Data.Entity.MySqlEFConfiguration());
}
public DbSet<Country> Countries { get; set; }
protected override void OnModelCreating(DbModelBuilder modelBuilder)
{
// I have an abstract base EntityMap class that maps Ids for my entities.
// It is used as the base for all my class mappings
modelBuilder.Configurations.AddFromAssembly(typeof(EntityMap<>).Assembly);
base.OnModelCreating(modelBuilder);
}
}
}
Step 4) Set the Default Project to your Data project in the Package Manager Console
Step 5) Use enable-migrations, add-migration, update-database like you normally would
| |
• I had a similar problem. When splitting things up I had to add my connectionStrings to both the app.config (Data project) and the web.config. The packagemanager console uses the app.config one and the mvc website uses the web.config – Hugo Delsing Apr 10 '14 at 8:31
• that is you can't use same code for Sql and Mysql: you have to tag your DbContext class ??? – tschmit007 Jun 25 '14 at 10:14
• 2
in fact you can by using <entityFramework codeConfigurationType="MySql.Data.Entity.MySqlEFConfiguration, mysql.data.entity.EF6">...</entityFramework> in app.config instead of the class attribute. – tschmit007 Jun 25 '14 at 10:25
5
ContosoUniversity MVC5 + EF6 code first approach using MySQL example download: http://www.nzmk.com/Blogs/BlogsView/tabid/83/EntryId/8/MVC5-EF6-ContosoUniversity-code-first-approach-using-MySQL.aspx
To start using Entity Framework 6 and Visual Studio 2013 it is necessary to install MySQL for Visual Studio 1.1.1 MySQL Connector/Net 6.8.3 GA
MySQL for Visual Studio 1.1.1 Beta can be downloaded with the following link: cdn.mysql.com/Downloads/MySQLInstaller/mysql-visualstudio-plugin-1.1.1.msi
MySQL Connector/Net 6.8.3 GA dev.mysql.com/downloads/connector/net/
To start working with VS 2013 and EF 6
1. Uninstall old versions of MySQL for Visual Studio and Connector/Net
2. Install MySQL for Visual Studio 1.1.1
3. Install Connector/Net 6.8.3
4. Add the reference for MySql.Data, MySql.Data.Entity.EF6, MySql.Web (Version 6.8.3.0) assemblies into the project. Depending on the .NET Framework used, the assembly is to be taken from either the v4.0 or the v4.5 folder).
5. Edit web.config or app.config
<connectionStrings>
<add name='SchoolContext' connectionString='Data Source=xxxxx;port=3306;Initial Catalog=ContosoUniversity;user id=root;password=xxxxxxxxx;' providerName='MySql.Data.MySqlClient'/>
</connectionStrings>
<entityFramework codeConfigurationType='MySql.Data.Entity.MySqlEFConfiguration, MySql.Data.Entity.EF6'>
<defaultConnectionFactory type='System.Data.Entity.Infrastructure.SqlConnectionFactory, EntityFramework'/>
<providers>
<provider invariantName='MySql.Data.MySqlClient' type='MySql.Data.MySqlClient.MySqlProviderServices,
MySql.Data.Entity.EF6' />
6. Edit SchoolContext.cs
.... using MySql.Data.Entity;
namespace ContosoUniversity.DAL
{
[DbConfigurationType(typeof(MySqlEFConfiguration))]
public class SchoolContext : DbContext
{
....
}
}
7. Edit Global.asax.cs
...... using MySql.Data.Entity;
namespace ContosoUniversity
{
public class MvcApplication : System.Web.HttpApplication
{
protected void Application_Start()
{
AreaRegistration.RegisterAllAreas();
FilterConfig.RegisterGlobalFilters(GlobalFilters.Filters);
RouteConfig.RegisterRoutes(RouteTable.Routes);
BundleConfig.RegisterBundles(BundleTable.Bundles);
DbConfiguration.SetConfiguration(new MySqlEFConfiguration());
}
}
}
| |
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://stackoverflow.com/questions/20602114/mysql-connector-6-8-2-rc-entity-framework-6-and-code-first",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "174729",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZKFSK7JOG3FODQDSL6W7SOAWI2JZFKIW",
"WARC-Concurrent-To": "<urn:uuid:4c5b133b-6ebf-42de-aefe-8c9df892dbfa>",
"WARC-Date": "2020-12-03T05:17:14Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:A5ER6TOO5E6BYLHY6R7K2FYPLG2UWCO7",
"WARC-Record-ID": "<urn:uuid:90896b52-78ca-431c-ae1b-4f960beff8ed>",
"WARC-Target-URI": "https://stackoverflow.com/questions/20602114/mysql-connector-6-8-2-rc-entity-framework-6-and-code-first",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6270d8ba-173c-4960-9295-35b8eb75909c>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-96.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
143,
144,
248,
249,
295,
296,
396,
408,
613,
749,
762,
763,
783,
938,
959,
960,
1018,
1019,
1035,
1062,
1077,
1078,
1146,
1147,
1201,
1202,
1355,
1356,
1711,
1712,
1753,
1754,
1834,
1935,
2040,
2196,
2291,
2388,
2502,
2637,
2714,
2816,
2884,
2957,
3018,
3114,
3179,
3251,
3321,
3421,
3512,
3609,
3613,
3751,
3966,
4049,
4154,
4241,
4244,
4245,
4464,
4465,
4694,
4695,
4749,
4750,
4843,
4844,
4903,
4904,
4924,
5085,
5108,
5128,
5240,
5256,
5396,
5605,
5622,
5643,
5644,
5688,
5689,
5726,
5752,
5778,
5779,
5800,
5802,
5876,
5915,
5921,
5967,
6041,
6069,
6079,
6164,
6243,
6322,
6414,
6424,
6425,
6479,
6480,
6557,
6567,
6653,
6717,
6804,
6852,
6862,
6868,
6870,
6871,
6955,
6956,
7042,
7043,
7047,
7318,
7447,
7453,
7686,
7688,
7689,
7887,
7888,
8031,
8032,
8185,
8186,
8254,
8255,
8294,
8295,
8368,
8411,
8444,
8671,
8706,
8707,
8731,
8919,
8945,
9054,
9169,
9189,
9300,
9305,
9306,
9336,
9337,
9364,
9365,
9399,
9400,
9436,
9442,
9500,
9545,
9553,
9564,
9572,
9578,
9583,
9608,
9609,
9645,
9646,
9678,
9684,
9749,
9759,
9806,
9820,
9873,
9948,
10011,
10078,
10083,
10161,
10175,
10185,
10191,
10196,
10200,
10201,
10213,
10214,
10314,
10315
],
"line_end_idx": [
2,
3,
143,
144,
248,
249,
295,
296,
396,
408,
613,
749,
762,
763,
783,
938,
959,
960,
1018,
1019,
1035,
1062,
1077,
1078,
1146,
1147,
1201,
1202,
1355,
1356,
1711,
1712,
1753,
1754,
1834,
1935,
2040,
2196,
2291,
2388,
2502,
2637,
2714,
2816,
2884,
2957,
3018,
3114,
3179,
3251,
3321,
3421,
3512,
3609,
3613,
3751,
3966,
4049,
4154,
4241,
4244,
4245,
4464,
4465,
4694,
4695,
4749,
4750,
4843,
4844,
4903,
4904,
4924,
5085,
5108,
5128,
5240,
5256,
5396,
5605,
5622,
5643,
5644,
5688,
5689,
5726,
5752,
5778,
5779,
5800,
5802,
5876,
5915,
5921,
5967,
6041,
6069,
6079,
6164,
6243,
6322,
6414,
6424,
6425,
6479,
6480,
6557,
6567,
6653,
6717,
6804,
6852,
6862,
6868,
6870,
6871,
6955,
6956,
7042,
7043,
7047,
7318,
7447,
7453,
7686,
7688,
7689,
7887,
7888,
8031,
8032,
8185,
8186,
8254,
8255,
8294,
8295,
8368,
8411,
8444,
8671,
8706,
8707,
8731,
8919,
8945,
9054,
9169,
9189,
9300,
9305,
9306,
9336,
9337,
9364,
9365,
9399,
9400,
9436,
9442,
9500,
9545,
9553,
9564,
9572,
9578,
9583,
9608,
9609,
9645,
9646,
9678,
9684,
9749,
9759,
9806,
9820,
9873,
9948,
10011,
10078,
10083,
10161,
10175,
10185,
10191,
10196,
10200,
10201,
10213,
10214,
10314,
10315,
10405
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10405,
"ccnet_original_nlines": 193,
"rps_doc_curly_bracket": 0.002306580077856779,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1785714328289032,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022263450548052788,
"rps_doc_frac_lines_end_with_ellipsis": 0.005154639948159456,
"rps_doc_frac_no_alph_words": 0.41001856327056885,
"rps_doc_frac_unique_words": 0.4548162817955017,
"rps_doc_mean_word_length": 7.856008052825928,
"rps_doc_num_sentences": 311,
"rps_doc_symbol_to_word_ratio": 0.0023191100917756557,
"rps_doc_unigram_entropy": 5.646669387817383,
"rps_doc_word_count": 1007,
"rps_doc_frac_chars_dupe_10grams": 0.010870940051972866,
"rps_doc_frac_chars_dupe_5grams": 0.08064720034599304,
"rps_doc_frac_chars_dupe_6grams": 0.023511569947004318,
"rps_doc_frac_chars_dupe_7grams": 0.010870940051972866,
"rps_doc_frac_chars_dupe_8grams": 0.010870940051972866,
"rps_doc_frac_chars_dupe_9grams": 0.010870940051972866,
"rps_doc_frac_chars_top_2gram": 0.0075843799859285355,
"rps_doc_frac_chars_top_3gram": 0.007078750059008598,
"rps_doc_frac_chars_top_4gram": 0.010112499818205833,
"rps_doc_books_importance": -978.9115600585938,
"rps_doc_books_importance_length_correction": -978.9115600585938,
"rps_doc_openwebtext_importance": -522.3003540039062,
"rps_doc_openwebtext_importance_length_correction": -522.3003540039062,
"rps_doc_wikipedia_importance": -340.97381591796875,
"rps_doc_wikipedia_importance_length_correction": -340.97381591796875
},
"fasttext": {
"dclm": 0.1099855899810791,
"english": 0.61147141456604,
"fineweb_edu_approx": 1.4355510473251343,
"eai_general_math": 0.1091354489326477,
"eai_open_web_math": 0.20181649923324585,
"eai_web_code": 0.06408023834228516
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-7,352,038,234,590,817,000 |
May 15
It makes me WannaCry….
You don’t know how to ease my pain
You don’t know…
You don’t know how to ease my pain
Don’t you hear any voices cryin’?
You don’t know how to play the game
You cheat…
You lie…
You don’t even know how to say goodbye…
You make me want to cry….
It’s rare that the world of IT impinges on my friends day-to-day lives in the scale it has in recent days, and rarer still that I feel compelled to address political issues on my tech based blog. That’s mainly because I think people visit michellelaverick.com to learn something new about tech or to read one of my blogposts where I got something to work, and they are looking to find out how to do the same. I do have a political blog called “The Age of Rage” and I offload my venom there – I only wish more people did this instead of filling Linkedin, Twitter and Facebook with political opinions they think everyone else will agree with – only to be upset, offended or abusive when they are shocked to discover the world doesn’t uniformly agree with them. However, the outbreak of the “WannaCry” ransomware represents for me unique situation where these worlds do collide. However, I want to talk about these issues in a non-partisan, non-party political way, because frankly there’s enough of that guff around already from our policial class.
Before I “go positive” and speak about the positive steps that can be taken by all stakeholders (users, vendors, governments, agencies of the state). I feel compelled to draw your attention to some artful media management and outright charlatanism that typifies how this adverted crisis is playing out in the media, especially here in the UK. It’s from this I hope to outline how we can collectively take responsibility, but that some organisations have more responsibility than others because of the power and/or financial muscle.
The Government(s)
Right now the UK is in the midst of one of the dullest general elections in living memory, and a piece of one soul quitely dies as the party slogans are repeated ad nauseum. Our current PM reassured the country that the attack was NOT a threat to National Security because it hadn’t been carried out by “State Actors”. She seems to fail to understand that anything the substantially degrades the normal operation of everyday life in this country is a threat to national security. Had WannaDie shutdown our power stations it would have been different matter. Social order would have broken down, and we would have riots on the cities in hours. It doesn’t matter WHERE the attack comes from, its the impact that matters. The government has gone into overdrive to deflect criticism because they are fearful that this “May Suprise” might unhinge their assured majority. As MacMillian put it “Events, dear boy, events…”
The view seems to be that as everyone was globally shafted, then its not really our fault – because were are all going to hell in a hand cart. So that’s alright then. The government is trying to demonstrate that it knew about the threat and did something – and is using the devolved structure of the NHS to, in a Pontius Pilate way, to wash its hands of the responsiblity. Politicans tend to be of a type – they want to take all the credit for any success, and none of the blame when things go wrong. The economy is a classic example. The economy grows, that’s their magic touch, when it crashes that’s the “global economic systems” fault – over which they have no control. Kinda of handy that, isn’t?
The Opposition
Relativity muted, but a couple of spokespeople and Corbyn are starting to make noises. To extend the medical analogy, there’s a danger of looking like opportunist ambulance chasers. Best to keep above the fray and let the media do the damage. If the government wiggles of the hook for this one – by blaming the NHS tTusts – it at least takes the emphasis away from the ‘leadership’ issue, and puts the media emphasis on the underfunding at the heart of the service, that results in people in trolleys in corridoors at A&E.
The NSA and GCHQ.
Silence. Followed by tumbled weed. But it is the source of WonderWhy.
Microsoft (and the Software Industry Generally)
A press release was issued by the companies legal counsel. That to me is significant because somebody somewhere at Microsoft is wondering what their legal position could be, and whether they will find themselves in court – by either government or by class action. This press statement squarelly lays ‘the blame’ at the foot of the customer for not keeping up to date. Despite the fact the main culprit for spreading WannaFly was unpatched WindowXP instances that are no longer blessed by critical security patches.
Meanwhile another set of ambulance chasers feel its ethical and moral to use this situation in order to shift more stuff. One mans pain, is another mans fortune. So I’ve seen people trying to flog software to pre-encrypt data before its ransomware’d, and fatuous suggestions that somehow “virtual desktops” would protect customers – without giving a thought to persistent desktops that could be just as poorly patch managed as physical. Our industry desperately needs an ounce of prevention, rather than a pound of cure. We need to solve the problem at source – not bolt the gate after the horse has disappeared over the horizon.
Our Poor beleaguered NHS
As with the govenment the NHS has gone into damaged limitation mode. There will always be funding priorities in the NHS, and anyone who knows the history – will know the NHS felt its first funding crisis in its first year. Bevan had to ‘stuff their mouths with gold” in order to get private GPs to join. At the moment the line is that no patient data has been compromised and no-one died. This is a line they can stick to because its really difficult to prove other wise, except as ancedotal evidence drifts out. In fairness loads of other organisation were effected, but nothing precious as once fragile health.
Assessment:
Everyone is very skillfully blaming everyone else, in the hope that no-one (that’s me and you by the way) notices their cupability.
Remediation:
Everyone needs to stop using cleverly crafted PR to deflect responsibilty to others. Everyone needs to start taking responsibility for their actions. This is a really difficult thing to say and do, in a climate where blaming someone else for all your woes is the philosophy of the hour.
The Government:
Needs acknowledge it was caught with its pants down. And acknowledge that when it comes to government bodies, and structures that allow them function, are part of our national security. Devolved powers are great for democracy, but fundmentally the buck stops with our elected officials. Other wise no one is accountable to the electorate.
The Opposition:
Needs to acknowledge that it probably would have been no better prepared.
The NSA and GCHQ (and Mossad)
Needs to acknowledge they are the source of the hack, and were themselves hacked – and that keeping open backdoors so they can do their own snooping or attacks (like the Stuxnet attack on Iranian centrifuges) is as morally bankrupt as the black hackers. We have laws that strictly control the creation of, and development of biological virus’s such as anthrax. The creation of tools that either make or exploit security breaches need to be regulated with the same vigour. We as citizens need to ask ourselves whether the security services should be given regulated backdoors as part as anti-terrorist or anti-organised crime efforts. The alternative is that the temptation to keep undiscovered backdoors open will always be present. Practically anything can be used to justify actions in the name of some vague “national security” – in recent times this has extended to torture of your own citzens and the citizens of your allies. The bottomline is the bad guys are moving off the regular software packages anyway, that me and you use to communicate with. They are evolving and so does the counter cyber-intelligence.
Microsoft and Other Software Vendors
We desperately need “herd immunity” to stop the catasrophic spread of dangerous software. WannaCry should signal the end of the corporate policies that lead to the withdrawal of Security Updates. Numbers vary and are often %, but some research indicates that globally some 8.45% of the worlds computing population are still using Windows XP.
This is how many people are still using Windows XP
And people have been talking for years about how unpatched operating systems represent a global threat to the very users and organizations who are patched and up to date. I propose that ALL vendors (not just Microsoft) are compelled to supply security update for free, and impertuity until the % global usage of that system is less than 1%. Within hours of WannaCry being release, Microsoft released a patch for WindowsXP users – imagine the damage that could have been avoided if this patch had been freely available before hand. Additionally, software updates that are security critical must be mandatory for ALL users. It is simply too easy for retail end-users to ignore or switch off such updates. However, given the size and scope of these large software vendors they could easily absorb these costs and defaults. The reputational cost alone justifies this expense.
To vendors who circle like vultures hoping to make a fast buck from other people misfortune. You have just revealed yourself to be the snake-oil salespeople we always knew you were….
The NHS
It’s time to accept that computers can and do save lives. And I don’t just mean scanners that find your innards a rotting away. The choice is really how are people going to die. Will they die by less operations being done per quarter, or by the fact that through a computer virus (the irony is bitter sweet) people have died or had the health impacted. Just because we can’t see it or measure it doesn’t mean it isn’t happening. The critical thing is even if the NHS had the best patch-management system in the world – you can’t patch the unpatchable. Had Microsoft’s policy been different on WindowsXP, the poor unsung heros of the NHS IT System would have least had a sporting chance against the evil hackers (who didn’t have the bravery to admit what they had done, but released some gutless statement about it being a protested against Donald Trump).
The Accidental Hero…
And finally… to the accidental hero of the hour. We owe this man the same debt of honour as we might to someone who stopped the spread of Ebola. Okay, I’m exaggerating with hyperbole for the purposes of rhetoric. I, for one admire the fact that this chap has been modest and self-effacing. But strikes me odd that further damage was averted by private citzen (albeit working for, and with interest in anti-malware) for the cost of a £8 DNS domain name registeration. Whilst large and powerful organizations are bizzy making themselves slippery with PR, this unassuming individual acted in the public interest. It’s a evidence to the fact that humanity is not completely beyond redemption. And these large and powerful instuition could do with taking a leaf out of his book.
Copyright 2022. All rights reserved.
Posted May 15, 2017 by Michelle Laverick in category "ThinkPiece
|
{
"url": "https://www.michellelaverick.com/2017/05/your-make-wannacry/",
"source_domain": "www.michellelaverick.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "53220",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y2PCFC72SNG3ELIQQ4YGJVFQQSSF46XW",
"WARC-Concurrent-To": "<urn:uuid:311691f0-38d0-4825-b948-335addf7849a>",
"WARC-Date": "2022-12-03T15:24:54Z",
"WARC-IP-Address": "208.113.228.18",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3HO3IT6U3CURLXQEUIKTYZN4MYFNQ4UG",
"WARC-Record-ID": "<urn:uuid:7c2bce34-057a-4db4-a721-046394a950a8>",
"WARC-Target-URI": "https://www.michellelaverick.com/2017/05/your-make-wannacry/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:74f808b8-555f-4263-883f-de3673bc7c79>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-193\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
7,
8,
31,
32,
67,
83,
118,
152,
188,
199,
208,
248,
274,
275,
1323,
1324,
1856,
1857,
1875,
1876,
2791,
2792,
3494,
3495,
3510,
3511,
4034,
4035,
4053,
4054,
4124,
4125,
4173,
4174,
4689,
4690,
5320,
5321,
5346,
5347,
5961,
5962,
5974,
5975,
6107,
6108,
6121,
6122,
6409,
6410,
6426,
6427,
6766,
6767,
6783,
6784,
6858,
6859,
6889,
6890,
8008,
8009,
8046,
8047,
8389,
8390,
8441,
8442,
9314,
9315,
9498,
9499,
9507,
9508,
10363,
10364,
10385,
10386,
11161,
11162,
11163,
11200,
11201
],
"line_end_idx": [
7,
8,
31,
32,
67,
83,
118,
152,
188,
199,
208,
248,
274,
275,
1323,
1324,
1856,
1857,
1875,
1876,
2791,
2792,
3494,
3495,
3510,
3511,
4034,
4035,
4053,
4054,
4124,
4125,
4173,
4174,
4689,
4690,
5320,
5321,
5346,
5347,
5961,
5962,
5974,
5975,
6107,
6108,
6121,
6122,
6409,
6410,
6426,
6427,
6766,
6767,
6783,
6784,
6858,
6859,
6889,
6890,
8008,
8009,
8046,
8047,
8389,
8390,
8441,
8442,
9314,
9315,
9498,
9499,
9507,
9508,
10363,
10364,
10385,
10386,
11161,
11162,
11163,
11200,
11201,
11265
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11265,
"ccnet_original_nlines": 83,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4609515368938446,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020197490230202675,
"rps_doc_frac_lines_end_with_ellipsis": 0.0595238097012043,
"rps_doc_frac_no_alph_words": 0.1270197480916977,
"rps_doc_frac_unique_words": 0.4220135509967804,
"rps_doc_mean_word_length": 4.750651836395264,
"rps_doc_num_sentences": 97,
"rps_doc_symbol_to_word_ratio": 0.004488329868763685,
"rps_doc_unigram_entropy": 5.853114128112793,
"rps_doc_word_count": 1917,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.018117930740118027,
"rps_doc_frac_chars_dupe_6grams": 0.005929499864578247,
"rps_doc_frac_chars_dupe_7grams": 0.005929499864578247,
"rps_doc_frac_chars_dupe_8grams": 0.005929499864578247,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.00878444965928793,
"rps_doc_frac_chars_top_3gram": 0.0039530000649392605,
"rps_doc_frac_chars_top_4gram": 0.004941250197589397,
"rps_doc_books_importance": -868.150390625,
"rps_doc_books_importance_length_correction": -868.150390625,
"rps_doc_openwebtext_importance": -573.3674926757812,
"rps_doc_openwebtext_importance_length_correction": -573.3674926757812,
"rps_doc_wikipedia_importance": -413.81256103515625,
"rps_doc_wikipedia_importance_length_correction": -413.81256103515625
},
"fasttext": {
"dclm": 0.019299030303955078,
"english": 0.9633165001869202,
"fineweb_edu_approx": 1.7366560697555542,
"eai_general_math": 0.1552104353904724,
"eai_open_web_math": 0.21288609504699707,
"eai_web_code": 0.03302543982863426
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "320.0285",
"labels": {
"level_1": "Social sciences",
"level_2": "Political science",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-5,253,450,117,019,965,000 |
Connect class work to the CS industry by incorporating these five big picture professional skills in your class objectives.
• Important big picture professionals skills include:
1. Project Management & General Engineering Practice,
2. Professional Behavior,
3. Computational (Algorithmic) Thinking,
4. Problem Solving, and
5. Role of Computers in Society
• Example of a big picture professional skill, Computational (Algorithmic) Thinking, lesson from the Academy for Software Engineering in New York:
• The following is a decomposition of conditionals (if statements) into three distinct learning objectives.
• Each of the three outcomes below are measured separately by assessments (both formative and summative), and help teachers identify specific weaknesses in a student’s thinking and habits in order to provide ongoing individualized support.
1. Predict the output of a program by tracing through non-nested (and possibly single nested) conditionals.
2. Identify the conditionals necessary to implement a program (in natural language).
3. Provide the conditionals (in natural language) necessary to implement a program, construct the code to implement the program.
• This careful decomposition of objectives is an important part of addressing Computer Science as it applies to all students in the NY Academy for Software Engineering.
|
{
"url": "https://www.csteachingtips.org/tip/connect-class-work-cs-industry-incorporating-these-five-big-picture-professional-skills-your",
"source_domain": "www.csteachingtips.org",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "37921",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:III4AFIPUV62XOZZXX2SRZIJWGRGG2EL",
"WARC-Concurrent-To": "<urn:uuid:3244a52f-34ea-43fd-85cf-2239683448e4>",
"WARC-Date": "2021-12-07T05:29:00Z",
"WARC-IP-Address": "34.226.46.235",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2LJ67VM4F3TSTCGBDXP2C7YEALRMEAOX",
"WARC-Record-ID": "<urn:uuid:710a8293-27e0-4154-b8b3-618f239ff7eb>",
"WARC-Target-URI": "https://www.csteachingtips.org/tip/connect-class-work-cs-industry-incorporating-these-five-big-picture-professional-skills-your",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:34056ed8-3706-4142-8faf-681d8a662d02>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-95\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,
124,
125,
181,
239,
269,
314,
342,
378,
527,
637,
881,
995,
1086,
1221
],
"line_end_idx": [
124,
125,
181,
239,
269,
314,
342,
378,
527,
637,
881,
995,
1086,
1221,
1391
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1391,
"ccnet_original_nlines": 14,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.29661017656326294,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008474580012261868,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22457626461982727,
"rps_doc_frac_unique_words": 0.5824742317199707,
"rps_doc_mean_word_length": 5.695876121520996,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.470564842224121,
"rps_doc_word_count": 194,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05067873001098633,
"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.027149319648742676,
"rps_doc_frac_chars_top_3gram": 0.03981899842619896,
"rps_doc_frac_chars_top_4gram": 0.05248868837952614,
"rps_doc_books_importance": -111.58810424804688,
"rps_doc_books_importance_length_correction": -111.56554412841797,
"rps_doc_openwebtext_importance": -59.046627044677734,
"rps_doc_openwebtext_importance_length_correction": -59.046627044677734,
"rps_doc_wikipedia_importance": -55.308746337890625,
"rps_doc_wikipedia_importance_length_correction": -52.92930221557617
},
"fasttext": {
"dclm": 0.27591389417648315,
"english": 0.904452383518219,
"fineweb_edu_approx": 2.8226428031921387,
"eai_general_math": 0.3938579559326172,
"eai_open_web_math": 0.09371954202651978,
"eai_web_code": 0.0069975899532437325
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0195",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "371.3922",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Teachers, Teaching, and School management and organization"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-7,702,084,653,969,292,000 |
answersLogoWhite
0
Best Answer
There is no smallest number since if any number is divisible by 8, then 8 less than that number is also divisible by 8 - and that argument continues all the way to minus infinity!
The smallest positive number divisible by 8 is 8, itself.
User Avatar
Wiki User
9y ago
This answer is:
User Avatar
Add your answer:
Earn +20 pts
Q: What is the smallest number divisible by 8?
Write your answer...
Submit
Still have questions?
magnify glass
imp
|
{
"url": "https://math.answers.com/Q/What_is_the_smallest_number_divisible_by_8",
"source_domain": "math.answers.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "174523",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FLL2JB2DJH66S5M7YNKZKOG73QW7YYUS",
"WARC-Concurrent-To": "<urn:uuid:a6f2a66d-40ac-47db-872a-aa6adae4f7fa>",
"WARC-Date": "2024-04-22T13:09:34Z",
"WARC-IP-Address": "146.75.36.203",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QFCMS5WS7PAU6R7GOMASAIYTUBJZVQMD",
"WARC-Record-ID": "<urn:uuid:0acdb9d4-7408-4ab4-a2b2-281bea4163e5>",
"WARC-Target-URI": "https://math.answers.com/Q/What_is_the_smallest_number_divisible_by_8",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f9e92cd6-f3f4-4685-8749-0f4bae7f3d58>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-116\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
17,
18,
20,
21,
22,
34,
35,
215,
216,
274,
275,
287,
288,
298,
299,
306,
322,
334,
335,
352,
353,
366,
413,
434,
441,
463,
477
],
"line_end_idx": [
17,
18,
20,
21,
22,
34,
35,
215,
216,
274,
275,
287,
288,
298,
299,
306,
322,
334,
335,
352,
353,
366,
413,
434,
441,
463,
477,
480
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 480,
"ccnet_original_nlines": 27,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3125,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010416669771075249,
"rps_doc_frac_lines_end_with_ellipsis": 0.035714291036129,
"rps_doc_frac_no_alph_words": 0.2083333283662796,
"rps_doc_frac_unique_words": 0.6190476417541504,
"rps_doc_mean_word_length": 4.4285712242126465,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0.010416669771075249,
"rps_doc_unigram_entropy": 3.71379017829895,
"rps_doc_word_count": 84,
"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.11827956885099411,
"rps_doc_frac_chars_top_3gram": 0.12903225421905518,
"rps_doc_frac_chars_top_4gram": 0.09677419066429138,
"rps_doc_books_importance": -50.004966735839844,
"rps_doc_books_importance_length_correction": -56.12070083618164,
"rps_doc_openwebtext_importance": -31.920503616333008,
"rps_doc_openwebtext_importance_length_correction": -38.03623580932617,
"rps_doc_wikipedia_importance": -25.109580993652344,
"rps_doc_wikipedia_importance_length_correction": -31.22531509399414
},
"fasttext": {
"dclm": 0.9999737739562988,
"english": 0.9176957607269287,
"fineweb_edu_approx": 2.135281562805176,
"eai_general_math": 0.007417620159685612,
"eai_open_web_math": 0.5097641348838806,
"eai_web_code": -0.000006199999916134402
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "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
|
556,956,871,097,984,000 |
Matlab Misunderstanding
1. I'm current learning MatLab before i start my second year of engineering and i don't really understand a fundamental aspect of it. My problem is the use of the period "." and when it is deemed to be necessary.
I've looked up what this operator does and found definitions such as Element by element, Point-wise, ect. My problem is these don't mean much to me, I've done work on vectors and matrices, however matrices work consisted of mostly doing practice problems so maybe i don't full understand the fundamentals of matrices. Is there anyway somebody could explain to me what the period operator actually does.
For example why are these two different
y = sqrt(t).*sin(2t);
y = sqrt(t)*sin(2t);
And
y=(3.^x)./(1+3.^x)
y=(3^x )/ (1+3^x)
Any clarification would be much appreciated, thank you.
P.S I hope this is in the right board
2. jcsd
3. Dot multiplication .* is used to perform element-by-element array multiplication. An array is either a single row (row vector) or single column (column vector) of some values. For array-array multiplication to work, the arrays must be the same length.
Suppose, you have an array A=[3; 2; 5] which is a 3x1 array and want to multiply it by B=[6; 9; 2] which is another 3x1 array (same lengths), you tell MATLAB to do the following;
Ans=A.*B which multiplies the 2 arrays on an element-by-element basis. This means it multiplies 3x6, 2x9 and 5x2 giving a resultant arry of [18; 18; 10]
Leaving out the dot operator is for matrix multiplication which is differenet.
The 2 examples you provided dont really help to explain the purpose of the dot operator as they are just scalar x scalar examples.
Know someone interested in this topic? Share a link to this question via email, Google+, Twitter, or Facebook
Similar discussions for: Matlab Misunderstanding
Loading...
|
{
"url": "https://www.physicsforums.com/threads/matlab-misunderstanding.707256/",
"source_domain": "www.physicsforums.com",
"snapshot_id": "crawl=CC-MAIN-2015-11",
"warc_metadata": {
"Content-Length": "41720",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CHS2IGPUDDEPNT4GU7HK3H3C4JUMSSEO",
"WARC-Concurrent-To": "<urn:uuid:95b31e8f-0343-440d-a8e8-4a42b3505bc1>",
"WARC-Date": "2015-02-27T07:43:58Z",
"WARC-IP-Address": "74.86.200.109",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7YOO7Z2QAVKTZTQYYHOWQD7QQPSNCPDG",
"WARC-Record-ID": "<urn:uuid:decf1eb4-c3c7-4fd2-9143-906c3323d981>",
"WARC-Target-URI": "https://www.physicsforums.com/threads/matlab-misunderstanding.707256/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eceff7d9-70d3-4e0c-9693-9d0b9db933d3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-28-5-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-11\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for February 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
24,
25,
240,
241,
648,
649,
693,
719,
744,
745,
753,
776,
798,
799,
859,
860,
902,
908,
918,
1175,
1176,
1359,
1516,
1517,
1600,
1735,
1741,
1851,
1900
],
"line_end_idx": [
24,
25,
240,
241,
648,
649,
693,
719,
744,
745,
753,
776,
798,
799,
859,
860,
902,
908,
918,
1175,
1176,
1359,
1516,
1517,
1600,
1735,
1741,
1851,
1900,
1910
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1910,
"ccnet_original_nlines": 29,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3838862478733063,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02606634981930256,
"rps_doc_frac_lines_end_with_ellipsis": 0.03333333134651184,
"rps_doc_frac_no_alph_words": 0.25592416524887085,
"rps_doc_frac_unique_words": 0.5662251710891724,
"rps_doc_mean_word_length": 4.685430526733398,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0.0023696699645370245,
"rps_doc_unigram_entropy": 4.858204364776611,
"rps_doc_word_count": 302,
"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.0148409903049469,
"rps_doc_frac_chars_top_3gram": 0.015547700226306915,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -140.9268798828125,
"rps_doc_books_importance_length_correction": -140.9268341064453,
"rps_doc_openwebtext_importance": -89.52352905273438,
"rps_doc_openwebtext_importance_length_correction": -89.52352905273438,
"rps_doc_wikipedia_importance": -59.29197692871094,
"rps_doc_wikipedia_importance_length_correction": -59.29197692871094
},
"fasttext": {
"dclm": 0.8471231460571289,
"english": 0.9320257306098938,
"fineweb_edu_approx": 2.2421326637268066,
"eai_general_math": 0.9355270266532898,
"eai_open_web_math": 0.578525960445404,
"eai_web_code": 0.6742470860481262
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
1,433,721,890,411,591,400 |
Become a fan of Slashdot on Facebook
Forgot your password?
typodupeerror
Trust the World's Fastest VPN with Your Internet Security & Freedom - A Lifetime Subscription of PureVPN at 88% off. Also, Slashdot's Facebook page has a chat bot now. Message it for stories and more. ×
Comment Re:Revolt (Score 1) 418
Withdraw services such as "Diffie–Hellman key exchange" from products such as Chrome, Internet Explorer, and Safari? I don't call myself a security person, never mind expert, so I don't know: could MS/Google/Apple retroactively decrypt HTTPS connections made by the web browsers they supply?
Comment Re:No way. (Score 1) 979
Haha... wait, you're serious?
On that last point... yes, my business model does include developing AI to the point that it's not necessary to employ other people. I doubt very much that I'll be the first to get there (especially as I have to do a lot of other stuff to keep the money coming in and only write the AIs as needed), but I'm sure going that way.
Comment Wouldn't be the first (Score 1) 497
Ubisoft are not the first company to do this. My previous employers, Jagex, launched a games portal about two years ago where all the games required a continuous internet connection... including the single player games.
I'm not going to compare and contrast the technical details, as I don't know Ubisoft's secrets and I'm still bound by a confidentiality clause from Jagex. The social effects, however, are discoverable from publicly available information from multiple online game providers, not just Jagex, and are therefore not something I have to keep silent about :)
• If you game to kill time while travelling, this product is a couple of years ahead of it's time (Free WiFi is rare in the UK, mobile broadband is spotty and can be expensive).
• Online saved games are good, provided they are not destroyed if your client crashes (happened to a friend with Braid).
• Free demos that ask you to create a free account in order to save your progress are a bad idea (my girlfriend saw this and assumed they wanted money, so went to a different game site).
• Cheating and hacking is still implementation specific, so piracy is probably still possible (I've seen YouTube videos of someone cheating so insanely that their score wrapped around the 2^31 mark and almost made it back to zero).
Comment Re:Good thing they took your guns away. (Score 1) 390
I can believe it. My dad has an anecdote from a friend (yes, it's that tenuous, I don't know any Americans :)) who was given a free ride in a helicopter in the US. He kept hearing this irregular 'ping', and commented that it was a strange noise for a navigation system, only to be told that was the sound of bullets ricocheting off the bottom of the helicopter. Now, I don't know when this was, so I can readily believe it's been stopped for all the technical reasons you just gave.
Comment Jaywalking? (Score 4, Insightful) 390
Lots of people are using jaywalking as an example non-crime in these comments. Just so you all know, jaywalking is not generally against UK law; the only places you can't do it are motorways (where anyone going less than 50mph will cause problems), railway crossings while the barrier is down, and small patches of road next to lit pedestrian crossings. Everywhere else, it's your judgement.
Now, for the technology itself, I think it will help catch a lot of minor criminals, rural fly-tippers, and an unexpectedly large number of farm-animal-fancying zoophiles, but it will have very little effect on organised crime. Why? Dazzle from small lasers. What's the cost of a CD/DVD burner?
I don't like perfect surveillance - this country has too many laws for any one person to know, so I have no idea if I'm breaking any or not.
Comment Re:Even the 'best' of the big are not good (Score 1) 633
Oops, I didn't mean to post that anonymously... brief summary: all big games companies seem to have this problem, even those that try very hard to avoid it. I blame the middle managers. I left Jagex because of a middle manager being extremely unpleasant, despite the considerable efforts of the senior management to make the company an awesome one to work in.
Comment Re:And this is news... how? (Score 1) 116
What makes a contractor any better or worse at managing information than the government itself?
In principle? The bottom line of government is the best interest of the nation, the bottom line of bussinesss is profit. In practice, of course, a democratic (small 'd') government cares about being popular, so it has to keep taxes low and employment high (i.e. buy from the lowest bidder based in their own country).
Comment Flawed logic (Score 1) 198
Unfortunately, 95% delivery failure does not mean 95% spam. Some spam gets delivered to my inbox, and I'm certain that some legitimate email gets blocked. Unfortunately, the businesmen who like to use "email marketing" have no idea how much of a problem it is, and the technical people doing the filtering refuse to bounce (instead of black hole) suspected spam as doing so would work as a DoS amplifier.
Comment Re:If this remains the case (Score 1) 203
It's not a question of cryptography, it's a question of accounting. Consider:
1. Alice creates a character in "Second World of Runes Online".
2. Alice starts of with 10 gold pieces.
3. Alice has a memory poking tool, and uses it to change that 10gp into (1<<31)gp.
If the game is written badly, it will let Alice get away with this. If the game is written properly, the server isn't listening to her client, and will only let her spend 10gp no matter what her client claims to have. For reasons of supply and demand, I am sure that every MMOG that has ever suffered from gold farmers is written properly in this regard.
Slashdot Top Deals
"It might help if we ran the MBA's out of Washington." -- Admiral Grace Hopper
Working...
|
{
"url": "https://slashdot.org/~KitsuneSoftware",
"source_domain": "slashdot.org",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "106912",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VZ45RNVAIBK4N44JMC74OXBSNESAWS2N",
"WARC-Concurrent-To": "<urn:uuid:78c5e21e-39bc-446b-bc0f-b664fe1a0e52>",
"WARC-Date": "2017-02-22T03:07:32Z",
"WARC-IP-Address": "216.34.181.45",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BMDVI542QBTFY7C7GCK5OACP3ECCVWFE",
"WARC-Record-ID": "<urn:uuid:6a5762d2-d673-40f9-bbd4-1dc80725ee47>",
"WARC-Target-URI": "https://slashdot.org/~KitsuneSoftware",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c4eb18a0-3456-44d7-bdf9-fcb40d9a4f98>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-09\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
37,
38,
40,
41,
42,
43,
65,
79,
282,
283,
315,
316,
608,
609,
642,
643,
673,
674,
1002,
1003,
1047,
1048,
1268,
1269,
1622,
1623,
1803,
1926,
2115,
2349,
2350,
2412,
2413,
2896,
2897,
2943,
2944,
3336,
3337,
3632,
3633,
3774,
3775,
3840,
3841,
4201,
4202,
4252,
4253,
4349,
4350,
4668,
4669,
4704,
4705,
5110,
5111,
5161,
5162,
5240,
5241,
5307,
5349,
5434,
5435,
5790,
5791,
5810,
5811,
5890,
5891
],
"line_end_idx": [
37,
38,
40,
41,
42,
43,
65,
79,
282,
283,
315,
316,
608,
609,
642,
643,
673,
674,
1002,
1003,
1047,
1048,
1268,
1269,
1622,
1623,
1803,
1926,
2115,
2349,
2350,
2412,
2413,
2896,
2897,
2943,
2944,
3336,
3337,
3632,
3633,
3774,
3775,
3840,
3841,
4201,
4202,
4252,
4253,
4349,
4350,
4668,
4669,
4704,
4705,
5110,
5111,
5161,
5162,
5240,
5241,
5307,
5349,
5434,
5435,
5790,
5791,
5810,
5811,
5890,
5891,
5901
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5901,
"ccnet_original_nlines": 71,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41718751192092896,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02812499925494194,
"rps_doc_frac_lines_end_with_ellipsis": 0.01388888992369175,
"rps_doc_frac_no_alph_words": 0.1953125,
"rps_doc_frac_unique_words": 0.5049212574958801,
"rps_doc_mean_word_length": 4.515748023986816,
"rps_doc_num_sentences": 61,
"rps_doc_symbol_to_word_ratio": 0.004687500186264515,
"rps_doc_unigram_entropy": 5.6783766746521,
"rps_doc_word_count": 1016,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.007846560329198837,
"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.010462069883942604,
"rps_doc_frac_chars_top_3gram": 0.007846560329198837,
"rps_doc_frac_chars_top_4gram": 0.006538799963891506,
"rps_doc_books_importance": -472.6756286621094,
"rps_doc_books_importance_length_correction": -472.6756286621094,
"rps_doc_openwebtext_importance": -309.48443603515625,
"rps_doc_openwebtext_importance_length_correction": -309.48443603515625,
"rps_doc_wikipedia_importance": -206.2943572998047,
"rps_doc_wikipedia_importance_length_correction": -206.2943572998047
},
"fasttext": {
"dclm": 0.3442721962928772,
"english": 0.9590409994125366,
"fineweb_edu_approx": 1.2112780809402466,
"eai_general_math": 0.06352806091308594,
"eai_open_web_math": 0.16121935844421387,
"eai_web_code": 0.02177298069000244
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-5,311,702,782,977,121,000 |
Games
Problems
Go Pro!
Do you have a question you would like to ask Professor Puzzler? Click here to ask your question!
I don't really understand what to do with my description and keywords meta tags. Where do they go in my web page, and what should I put in them? Are they necessary? No one sees them, right?
You are correct. They are not necessary, and no one sees them. No one, that is, except search engines. And some search engines very carefully consider the description and keywords when evaluating where to place your page in search engine results. So let's talk about them. First, your metatags go in the 'head' of the page, which means you should put them somewhere between the
and
lines. The two tags should look something like this:
Description
Search engines use description meta tags in two ways, too varying degrees:
1. Occasionally search engines will use your description tag in their display of information about the page, when your page comes up in a search result. This is the only time an actual human reader is likely to see your description. Thus, it ought to be something that is human readable and comprehendable, and - if possible - enticing to the reader to click the link. For example, if you go to Google and search on the phrase "secret word" one of the highest ranking web pages is our Secret Word Game. The description under the link on Google's search results is "Secret Word - Guess letters from the alphabet and determine the computer's secret word." Where do you suppose Google got that text? That's right - it's the meta description tag on our game's web page.
2. Search engines look at the description tag and take not of any important words that show up there; they may help the search engine determine what your page is about, and therefore how to rank it for various search queries. Thus, it's important that your description meta tag contain key information related to the page's topic.
Keywords
The name 'keywords' is deceptive, because keywords are not nearly as helpful as key phrases. Fill your keywords metatag with phrases you think people might use when searching. having "webpage design" as a keyword is much better than having "webpage" and "design" as two separate keywords.
Be careful not to repeat words or phrases too much, however, as some search engines will penalize you if they find the same word more than three times in your list.
2016 Update: It appears that search engines are relying on Keywords less and less when it comes to ranking search results. There's a very good reason for this. Unlike the page title, which appears both in the browser title bar, and the search engine links, and unlike the page description, which also appears in search engine results, the keywords don't appear in a human-readable place at all. This means that dishonest web developers felt comfortable using the keywords as a place to try tricky methods to make their web pages rank higher. Since they're easily spammable, search engines are relying on them less and less. I usually tell my clients to put in a few keywords and phrases that pop quickly to mind, but don't spend too much time sweating over it. Craft good content, and let it speak for itself!
One Last Piece of Advice
Make sure that the key words and prhases you use in your metatags also show up in the text of your page. No search engine is going to be impressed if your page title, description, and keywords all have the phrase astronaut training program, but that phrase doesn't show up once in your page content. When it comes down to it, though the metatags are important, what's actually on the page is the most important of all.
Ask Professor Puzzler
Do you have a question you would like to ask Professor Puzzler? Click here to ask your question!
Over 3,000 Pages of Free Content
We've been providing free educational games and resources since 2002.
Would you consider a donation of any size to help us continue providing great content for students of all ages?
Like us on Facebook to get updates about new resources
Home
Pro Membership
About
Privacy
|
{
"url": "https://www.theproblemsite.com/ask/2007/08/meta-tags-description-keywords",
"source_domain": "www.theproblemsite.com",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "20878",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GMYRANUE3VLMJZKNS7XRE72EXBXRJZMG",
"WARC-Concurrent-To": "<urn:uuid:ad5f0b6c-3ee9-4a9a-906b-d225d22b5236>",
"WARC-Date": "2017-03-24T21:52:07Z",
"WARC-IP-Address": "192.138.17.145",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ZJVHG6MFXEIH5HG563AJZ5LLTCSOSEK4",
"WARC-Record-ID": "<urn:uuid:8289be33-d533-4cc6-81d4-5361dd6037a7>",
"WARC-Target-URI": "https://www.theproblemsite.com/ask/2007/08/meta-tags-description-keywords",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2e64faca-f189-497b-9913-84803833373c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
6,
15,
23,
24,
25,
122,
123,
313,
314,
315,
694,
695,
699,
700,
754,
755,
756,
760,
761,
765,
766,
778,
779,
854,
855,
1623,
1956,
1957,
1966,
1967,
2258,
2259,
2426,
2427,
3238,
3239,
3264,
3265,
3686,
3687,
3709,
3710,
3807,
3840,
3910,
3911,
4023,
4024,
4079,
4084,
4099,
4105
],
"line_end_idx": [
6,
15,
23,
24,
25,
122,
123,
313,
314,
315,
694,
695,
699,
700,
754,
755,
756,
760,
761,
765,
766,
778,
779,
854,
855,
1623,
1956,
1957,
1966,
1967,
2258,
2259,
2426,
2427,
3238,
3239,
3264,
3265,
3686,
3687,
3709,
3710,
3807,
3840,
3910,
3911,
4023,
4024,
4079,
4084,
4099,
4105,
4112
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4112,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4672228693962097,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0035756900906562805,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13945172727108002,
"rps_doc_frac_unique_words": 0.38591548800468445,
"rps_doc_mean_word_length": 4.567605495452881,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.117835521697998,
"rps_doc_word_count": 710,
"rps_doc_frac_chars_dupe_10grams": 0.047486890107393265,
"rps_doc_frac_chars_dupe_5grams": 0.0629047229886055,
"rps_doc_frac_chars_dupe_6grams": 0.047486890107393265,
"rps_doc_frac_chars_dupe_7grams": 0.047486890107393265,
"rps_doc_frac_chars_dupe_8grams": 0.047486890107393265,
"rps_doc_frac_chars_dupe_9grams": 0.047486890107393265,
"rps_doc_frac_chars_top_2gram": 0.032069068402051926,
"rps_doc_frac_chars_top_3gram": 0.017576320096850395,
"rps_doc_frac_chars_top_4gram": 0.006167130079120398,
"rps_doc_books_importance": -339.16845703125,
"rps_doc_books_importance_length_correction": -339.16845703125,
"rps_doc_openwebtext_importance": -220.91722106933594,
"rps_doc_openwebtext_importance_length_correction": -220.91722106933594,
"rps_doc_wikipedia_importance": -181.48373413085938,
"rps_doc_wikipedia_importance_length_correction": -181.48373413085938
},
"fasttext": {
"dclm": 0.04809701070189476,
"english": 0.937987208366394,
"fineweb_edu_approx": 2.156656503677368,
"eai_general_math": 0.04070878028869629,
"eai_open_web_math": 0.324573814868927,
"eai_web_code": 0.04206132888793945
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-8,646,305,001,132,294,000 |
Penetration Testing Guidelines
Summary
Penetration tests requested by Google must fulfill the requirements listed below. Note that requirements may differ between vendors due to special agreements.
1. Penetration Test and Report Requirements – Report the result of the penetration test in writing and include:
• Appropriate contextual information
• The findings and their risk severity
2. Assessment Duration and Dates – Plan an appropriate total testing effort (in person days) according to the number and scale of systems in scope. Penetration tests of a small scope can take only a few days, while a large scope can require multiple weeks. The penetration test must have been performed in the past 12 months.
3. Scope of the Assessment – Scope the penetration test to include all infrastructure used to provide services to Google. If there is a security dependency (i.e. the infrastructure used to provide services to Google depends on other systems for its security), those systems need to be included in the scope of testing.
4. Attribution Information – Entrust an appropriately qualified third-party provider with the penetration test. The quality between providers can vary significantly. Google recommends carefully comparing providers. Upon request, Google can share a list of providers whose reports have met our quality expectations in the past.
5. Assessment Methodology – Employ manual methods for identifying security vulnerabilities when penetration testing. Manually verifying automated results is not sufficient. Additionally, perform penetration tests using both unauthenticated and authenticated (i.e. the testers must be provided with credentials to the application, if an authentication exists) methodologies.
6. Documentation of Findings – When reporting findings, assign a risk severity and include technical details to allow Google to independently assess the risk and impact of the finding.
7. Remediation Planning / Confirmation – Remediate findings with a critical or high risk severity, these should not be risk-accept. In addition to the penetration test report, also share a remediation plan. For findings that have already been addressed, include a remediation confirmation.
Adherence to a security standard, automated vulnerability scanning/testing, and Bug Bounty and Vulnerability Rewards Programs are not sufficient replacements for penetration test reports.
Google’s Requirements for Penetration Testing and Reporting
The following subsections describe the requirements set out by Google for penetration testing and the penetration testing report that you will submit to Google during the VSA process.
Some resources providing background information:
Penetration Test and Report Requirements
Ensure that the penetration test report is complete. If the information you share leaves some points unanswered, there may be gaps in the quality of testing that was performed that will need to be clarified. This can result in delays to the approval process.
To ensure your report is complete, verify that it answers these key questions clearly before submitting it to Google:
1. Was the penetration test performed within the past 12 months?
2. Was the total testing effort in line with the number of systems which were tested?
3. Was the penetration test scoped to include all systems used to provide services to Google?
4. Was the penetration test performed by a third-party provider?
5. Did the penetration test include manual methods of analysis for identifying security vulnerabilities?
6. Was the penetration test performed using suitable authenticated test accounts?
7. Have findings with high and critical risk severity been addressed (not risk-accepted)?
• Where the report doesn't cover remediation, provide a separate remediation plan / confirmation document.
If the penetration testing report does not cover ALL of these points, please provide an attestation letter from the penetration testing provider that clearly responds to these questions in full.
Assessment Duration and Dates
Capture the dates on which the assessment was conducted, as well as the testing effort (in person days).
If the penetration test is part of a periodic assessment, include the dates of the previous and upcoming assessments. This information enables Google to understand how recently the penetration test was conducted as well as the regularity of testing.
Requirements Covered
[1] Was the penetration test performed within the past 12 months?
[2] Was the total testing effort in line with the number of systems which were tested?
Scope of the Assessment
A well-defined scope must include application-level testing of any application related to the processing or storage of data in the service provided to Google.
As a consequence, a good penetration test report should include the following elements when describing the scope:
• A well-defined scope definition that demonstrates sufficient coverage of the various threat models the application is subjected to.
• If there were areas that could not be assessed for whatever reason, mention this in the scope definition as well.
• If the penetration test consists of multiple areas, indicate the testing duration devoted to each area.
• For areas where active penetration testing is explicitly not permitted (i.e. select third-party SaaS services), include a configuration review.
Following these points helps to reduce any ambiguity on whether a particular area was sufficiently covered during the assessment. It also helps Google identify any residual risks that need a closer examination after a penetration test.
Requirements Covered
[3] Was the penetration test scoped to include all systems used to provide services to Google?
Attribution Information
The report must include the name of the security company involved in the assessment as well as the names and titles of the testers.
If you need support in picking a qualified penetration testing provider, see Penetration Testing Provider Selection.
Requirements Covered
[4] Was the penetration test performed by a third-party provider?
Assessment Methodology
Google requires that penetration testers use an assessment methodology with the following characteristics:
• Covers both authenticated and unauthenticated testing if the asset has an authenticated section. A comparison of the two approaches can be found at Unauthenticated vs. Authenticated Testing.
• Enforces that the majority of the work is performed manually. Automated testing or manual verification of automated testing does not meet this requirement. For more information read Manual vs Automated Testing.
A good penetration test report should clearly outline the assessment methodology followed during the assessment and call out if the assessment was performed authenticated and manually. Ideally, the penetration testers follow an industry-recognized standard that is relevant to the environment (i.e. OWASP, PTES, or OSSTMM). Finally, the report should also include a section outlining the tools used during the assessment.
Requirements Covered
[5] Did the penetration test include manual methods of analysis for identifying security vulnerabilities?
[6] Was the penetration test performed using suitable authenticated test accounts?
Documentation of Findings
The section on findings is the core of a penetration test report. Unfortunately, the structure and information provided in this section may vary greatly between different penetration test providers.
Make sure your penetration testing provider includes the following information in this section:
• An overview table of all findings, listed by title and indicating the risk severity
• For each finding, detailed documentation covering:
• Risk severity of the finding.
• The finding’s impact from a business and technical perspective.
• Clear, concise steps on how to reproduce the finding.
• Screenshots or other form of evidence confirming the finding (if applicable).
• Recommendations on how to resolve the finding. These recommendations should be tailored to the application and environment, avoid generic recommendations.
If this is part of a retest, the report should provide a history of findings which persisted from previous assessments. Please include information about why remediation efforts were not effective. If remediation was not carried out, business owners should provide supporting information behind that decision.
Requirements Covered
[5] Did the penetration test include manual methods of analysis for identifying security vulnerabilities?
[7] Have findings with high and critical risk severity been addressed (not risk-accepted)?
Remediation Planning / Confirmation
Your penetration test should always conclude with a remediation plan. This is not something that your penetration test provider creates, but is instead part of your action plan regarding the identified findings.
For findings with critical and high severity that have not been mitigated at the time of sharing your penetration test report, create a remediation plan that outlines:
• The expected remediation date.
• The planned remediation action and how to prevent future regression of identified findings.
• Considered residual risk of findings that could only be partially remediated.
For findings with critical and high severity that have been mitigated at the time of sharing your penetration test report, create a remediation confirmation statement containing:
• Confirmation that all findings with critical and high severity have been remediated (as opposed to being risk-accepted).
• Information about residual risk for findings that could only be partially remediated.
• Supporting information from business owners on how they intend to prevent regressions of identified findings (e.g. unit test, SDLC, and so on).
Requirements Covered
[7] Have findings with high and critical risk severity been addressed (not risk-accepted)?
Annex
The topics here are supplements to the information provided above, and are linked to from the appropriate locations.
Bug Bounty and Vulnerability Reward Programs
Bug bounty programs can provide useful input into a mature security program as long as they are properly scoped and managed. Many companies choose to run security programs that offer rewards for reported bugs or security issues, including the Google Vulnerability Reward Program.
The quality of these programs varies based on a number of factors, including scope, exclusions, repeatability, reward, interest, program visibility, etc. As such, it is very hard to measure their overall quality and coverage, which are key indicators of a high quality penetration test. Based on these considerations, Google is not able to accept reports from bug bounty programs or providers as a replacement for a third-party penetration test.
Different Types of Security Tests
The below table describes the most common types of security testing that may be required from partners working with Google.
Vulnerability Scan Static Source Code Analysis Penetration Test Source Code Audit
Method Automated Automated Manual1 Manual
Purpose Identify known vulnerabilities based on pre-configured signatures. Identify a specific set of vulnerabilities in source code. In-depth, manual security assessment of a defined scope. Very in-depth review of a single application/product.
Benefits Fast way to identify misconfigurations and missing security updates. Since these scans are automated, they can be run frequently and complement the vulnerability management process very well. Fast way to identify vulnerabilities newly introduced into code. Can identify previously unknown vulnerabilities. Very low false positive rate. Can find subtle logic errors that lead to security issues. Can follow vulnerability chains (exploiting vulnerabilities to identify further issues). Humans are still best at assessing risks. Can identify pretty much all types of vulnerabilities and security weaknesses in an application's code. Also able to identify design issues and recommend improvements.
Limitations Vulnerabilities in custom or uncommon software cannot be identified. Only finds vulnerabilities a signature has been created for. False positive rate is often very high. Still in its infancy. Usually reports a very high number of false positives, making it hard to identify real findings. Limited support for discovery of logic errors (which includes entire classes of vulnerabilities, such as authentication bypass, some types of privilege escalation, etc.) Time-intensive and expensive. Quality highly dependent on the provider. Scoping often dictates the quality of the test. Very time-intensive and expensive.
VSA/IPA Requirements2 Attestation of Quarterly scanning N/A Annual third-party penetration test report N/A
Example Providers3 Nessus, Nexpose, Qualys, Trustwave App Scanner, … Fortify, Veracode, CheckMarx, Whitehat, … NCC Group, Bishop Fox, Leviathan Security, …
1 Penetration testing that is marketed as Automated penetration testing or as validated scans (e.g. Whitehat Business Logic Assessments) do not meet the threshold to be accepted as manual penetration testing under this definition.
2 Please check your Information Protection Addendum (IPA) for further guidance on these requirements for your specific project. Where additional types of testing are required, these will be clearly requested as part of the IPA and VSA process.
3 This list includes security companies that are known to provide these services, and does not constitute a recommendation on the quality or coverage provided.
The Importance of Third-Party Testing
Although many companies have internal teams capable of performing detailed penetration testing, it is important to include third-party testing as part of your testing program.
Third parties often approach testing with a different mindset than an internal team, and as a result are more likely to examine processes and functions without being prejudiced by previous uses of the application. In some cases, internal testers can be quick to discount the presence of certain bug classes due to familiarity with the product, deployment style, or existing security mechanisms that should be in place to protect against such attacks.
In contrast, a third-party penetration tester can provide an unbiased and honest look at an application, something that is often lacking with internal teams. This is equally important when performing annual penetration testing, and it is a best practice to rotate testing teams or third-party providers every 2-3 years to ensure a fresh view on the application.
Compliance and Penetration Testing
Compliance with common security standards (e.g. ISO 27001, NIST, PCI-DSS) may require you to perform specific types of security scanning and testing on a regular basis. Although these types of testing are an important part of a well-managed and mature security and privacy program, they may not in themselves meet Google's requirements.
A common example is PCI-DSS, which requires penetration testing to be performed as part of the compliance requirements. Simply having PCI Compliance does not however mean that the penetration testing that was performed to obtain that compliance meets Google's standards. Specifically, the requirements regarding the scope of systems to test will likely differ between the two approaches. Google also specifically calls out validity periods (12 months) for penetration testing, and calls for testing to be performed in an authenticated and manual fashion.
As you fill the Vendor Questionnaire, please indicate any valid certifications received such as ISO 27001, SOC2 etc. A Google Security Engineer will advise whether they can be accepted as alternatives, which will require you to provide a link or artifact for our compliance records.
Penetration Testing Provider Selection
Not every company offering penetration testing services automatically provides high-quality results. This poses a challenge if you have no expertise internally to select a suitable service provider.
Here are a few tips and recommendations on how to find a good penetration testing provider:
• Companies that specialize in security services often provide better penetration tests than companies that "also" do pentests in addition to entirely unrelated services.
• Sometimes even security companies use penetration tests to pitch their "main" product. Picking a company where the main products are related to security consulting (including pentesting) is often a safer bet.
• Most highly qualified penetration testing providers run a blog where they provide technical details of security vulnerabilities and research they have recently conducted. It also helps to look for "CVEs", that is, vulnerabilities, in standard software that the company identified in the course of their work.
• Presentations at industry conferences such as BlackHat, DEF CON, Hack-in-the-Box, CanSec West, etc. are usually a good indicator that the company has the required expertise and experience.
• Even within qualified companies, expertise between individual people can vary significantly. To get the most out of a penetration test, request senior security consultants, ideally folks credited with having found security vulnerabilities (CVEs), or who have presented at industry conferences.
Unauthenticated vs. Authenticated Testing
Google testing requirements mandate third-party penetration testing that includes authenticated tests. This ensures that all areas of the application are tested equally to discover issues that may otherwise not be easily identified without full access to the application.
Unauthenticated Testing Authenticated Testing
Definition Testers have no knowledge of the environment under test. No credentials are provided to the testers. Testers have full access to information about the platform being tested. This often includes accounts (including administrative users), and access to discuss functionality with developers during the testing process.
Level of detail Low Medium/High
Benefits Simulates casual attackers and automated attacks on the first line of defense within an application. Does not require a high level of expertise to perform, no knowledge of the business logic is required.
Detail-orientated testing, including business-logic-related issues. More likely to find issues that would otherwise not be discovered during code audit, unauthenticated testing, or automated scanning alone.
Can be useful in testing monitoring and alerting capabilities when used in coordination with an internal IR/Monitoring team exercise.
Limitations Often misses issues that require knowledge of the application or infrastructure, or require a minimum level of access as a user. Can take additional resources from the development team, as well as testers. Often requires more experienced testers due to the increased complexity and type of issues.
VSA/IPA Requirements Not accepted Annually
Limiting the scope of a penetration test to unauthenticated users may result in only a small subset of issues being discovered, compared to a more comprehensive test where testers have credentials to access the application itself. A limited test can find issues that a casual external attacker would discover, but this kind of test often overlooks more detailed attacks and functionality that can be abused by existing users of the system.
Specifically, an authenticated user might be able to access information that should not be user-accessible, or have the ability to perform actions that should be restricted to administrative users. With the increase of multi-tenant systems, attacks from legitimate users of the system, either directly, or due to hijacked accounts (via weak passwords, phishing, malware, etc…), are seen as a threat that is often overlooked when planning the scope and methodology of a penetration test.
Manual vs Automated Testing
Google testing requirements mandate manual discovery of security relevant issues as part of an authenticated penetration test. This ensures that complex logic errors and unknown vulnerabilities are discovered by experienced penetration testers.
Manual Testing Automated Testing
Definition Penetration testers perform manual checks of the security controls in place and attempt to bypass or circumvent them in the process of identifying vulnerabilities. Security scanner software is launched against the asset in scope. The scanner works through a predefined set of known vulnerabilities or malicious payloads to test if the asset is vulnerable.
Level of detail Medium/High Low
Benefits Very low false positive rate. Allows for identification of previously unknown vulnerabilities and logic errors that lead to security issues. Testers can exploit vulnerabilities in a chain to identify further issues. Fast way to identify misconfigurations and missing security updates, as well as known vulnerabilities. Can be used to complement a vulnerability management program.
Limitations The quality of the testing depends on the service provider and the skills of the individual penetration testers. Manual testing is also time-intensive and expensive. Defining the right scope is crucial. Vulnerabilities in custom software cannot be identified at all or only in generic cases. The false positive rate is often very high.
VSA/IPA Requirements Annual third-party penetration test report Attestation of Quarterly scanning
Regular automated vulnerability scans of your network, servers, and workstations are a valuable part of a mature security program. The results help your security team identify areas where patching against known vulnerabilities and misconfigurations has not occurred.
However, automated vulnerability scans alone do not meet Google’s requirements as they are automated, commonly unauthenticated, and focus on known security misconfiguration and vulnerabilities in common software, instead of being tailored to the needs of your organization.
Validated Automated Security Scans
It is often argued that this type of scan is a combination of the manual and automated methodologies. However, the operation model often consists of automated discovery and manual validation. This improves the false-positive rate, but apart from that this approach still shares the same limitations as automated security scanning and doesn’t bring any of the benefits of manual testing. As such, validated automated scans are not considered a sufficient replacement for manual testing
Was this helpful?
How can we improve it?
Need more help?
Try these next steps:
Search
Clear search
Close search
Google apps
Main menu
|
{
"url": "https://support.google.com/corporate-suppliers/answer/14435909?hl=en&ref_topic=14294369&visit_id=638548321536305682-1125778510&rd=1",
"source_domain": "support.google.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "1050350",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:L5ASNDSMHQHTNZGU5IFE5Q4H6ALBVPW3",
"WARC-Concurrent-To": "<urn:uuid:500b7dc2-8f7d-4f9b-ba95-ea71b60b80e5>",
"WARC-Date": "2024-06-24T13:22:34Z",
"WARC-IP-Address": "142.251.167.113",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PCIANOU3LFRRIPTTNSYSAEMXILLVQWQJ",
"WARC-Record-ID": "<urn:uuid:5efe8f75-8e77-4cbe-8f67-c6a7a35cde91>",
"WARC-Target-URI": "https://support.google.com/corporate-suppliers/answer/14435909?hl=en&ref_topic=14294369&visit_id=638548321536305682-1125778510&rd=1",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5db9862e-b197-4083-8b80-df380b0c7c24>"
},
"warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-185\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,
31,
32,
40,
41,
200,
201,
315,
356,
399,
727,
1048,
1377,
1753,
1940,
2232,
2420,
2421,
2481,
2482,
2666,
2667,
2716,
2717,
2758,
2759,
3018,
3019,
3137,
3138,
3205,
3293,
3389,
3456,
3563,
3647,
3739,
3850,
3851,
3852,
4047,
4048,
4078,
4079,
4184,
4185,
4435,
4436,
4457,
4458,
4524,
4525,
4612,
4613,
4637,
4638,
4797,
4798,
4912,
4913,
5049,
5167,
5275,
5423,
5424,
5660,
5661,
5682,
5683,
5778,
5779,
5803,
5804,
5936,
5937,
6054,
6055,
6076,
6077,
6143,
6144,
6167,
6168,
6275,
6276,
6471,
6686,
6687,
7109,
7110,
7131,
7132,
7238,
7321,
7322,
7348,
7349,
7548,
7549,
7645,
7646,
7734,
7789,
7825,
7895,
7955,
8039,
8200,
8201,
8202,
8511,
8512,
8533,
8534,
8640,
8731,
8732,
8768,
8769,
8981,
8982,
9150,
9151,
9186,
9282,
9364,
9365,
9544,
9545,
9670,
9760,
9908,
9909,
9930,
9931,
10022,
10023,
10024,
10030,
10031,
10149,
10150,
10195,
10197,
10198,
10478,
10479,
10925,
10926,
10960,
10961,
11085,
11086,
11088,
11089,
11173,
11215,
11472,
11474,
12185,
12187,
12825,
12827,
12934,
13097,
13098,
13100,
13101,
13332,
13333,
13577,
13578,
13738,
13739,
13777,
13778,
13779,
13955,
13956,
14407,
14408,
14770,
14771,
14806,
14807,
14808,
15145,
15146,
15701,
15702,
15985,
15986,
16025,
16026,
16027,
16226,
16227,
16319,
16320,
16493,
16706,
17019,
17212,
17510,
17552,
17553,
17825,
17826,
17828,
17829,
17881,
18209,
18241,
18243,
18456,
18457,
18664,
18665,
18666,
18800,
18801,
19111,
19154,
19155,
19157,
19158,
19598,
19599,
20086,
20087,
20115,
20116,
20361,
20362,
20364,
20365,
20404,
20771,
20803,
20805,
21195,
21543,
21641,
21642,
21644,
21645,
21912,
21913,
22187,
22188,
22223,
22224,
22709,
22710,
22728,
22729,
22752,
22753,
22769,
22770,
22792,
22793,
22800,
22813,
22826,
22838
],
"line_end_idx": [
31,
32,
40,
41,
200,
201,
315,
356,
399,
727,
1048,
1377,
1753,
1940,
2232,
2420,
2421,
2481,
2482,
2666,
2667,
2716,
2717,
2758,
2759,
3018,
3019,
3137,
3138,
3205,
3293,
3389,
3456,
3563,
3647,
3739,
3850,
3851,
3852,
4047,
4048,
4078,
4079,
4184,
4185,
4435,
4436,
4457,
4458,
4524,
4525,
4612,
4613,
4637,
4638,
4797,
4798,
4912,
4913,
5049,
5167,
5275,
5423,
5424,
5660,
5661,
5682,
5683,
5778,
5779,
5803,
5804,
5936,
5937,
6054,
6055,
6076,
6077,
6143,
6144,
6167,
6168,
6275,
6276,
6471,
6686,
6687,
7109,
7110,
7131,
7132,
7238,
7321,
7322,
7348,
7349,
7548,
7549,
7645,
7646,
7734,
7789,
7825,
7895,
7955,
8039,
8200,
8201,
8202,
8511,
8512,
8533,
8534,
8640,
8731,
8732,
8768,
8769,
8981,
8982,
9150,
9151,
9186,
9282,
9364,
9365,
9544,
9545,
9670,
9760,
9908,
9909,
9930,
9931,
10022,
10023,
10024,
10030,
10031,
10149,
10150,
10195,
10197,
10198,
10478,
10479,
10925,
10926,
10960,
10961,
11085,
11086,
11088,
11089,
11173,
11215,
11472,
11474,
12185,
12187,
12825,
12827,
12934,
13097,
13098,
13100,
13101,
13332,
13333,
13577,
13578,
13738,
13739,
13777,
13778,
13779,
13955,
13956,
14407,
14408,
14770,
14771,
14806,
14807,
14808,
15145,
15146,
15701,
15702,
15985,
15986,
16025,
16026,
16027,
16226,
16227,
16319,
16320,
16493,
16706,
17019,
17212,
17510,
17552,
17553,
17825,
17826,
17828,
17829,
17881,
18209,
18241,
18243,
18456,
18457,
18664,
18665,
18666,
18800,
18801,
19111,
19154,
19155,
19157,
19158,
19598,
19599,
20086,
20087,
20115,
20116,
20361,
20362,
20364,
20365,
20404,
20771,
20803,
20805,
21195,
21543,
21641,
21642,
21644,
21645,
21912,
21913,
22187,
22188,
22223,
22224,
22709,
22710,
22728,
22729,
22752,
22753,
22769,
22770,
22792,
22793,
22800,
22813,
22826,
22838,
22847
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 22847,
"ccnet_original_nlines": 265,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35177966952323914,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0101324999704957,
"rps_doc_frac_lines_end_with_ellipsis": 0.003759399987757206,
"rps_doc_frac_no_alph_words": 0.1382177174091339,
"rps_doc_frac_unique_words": 0.2573750913143158,
"rps_doc_mean_word_length": 5.649909496307373,
"rps_doc_num_sentences": 212,
"rps_doc_symbol_to_word_ratio": 0.0010392300318926573,
"rps_doc_unigram_entropy": 5.749596118927002,
"rps_doc_word_count": 3322,
"rps_doc_frac_chars_dupe_10grams": 0.06942298263311386,
"rps_doc_frac_chars_dupe_5grams": 0.12169001996517181,
"rps_doc_frac_chars_dupe_6grams": 0.10453406721353531,
"rps_doc_frac_chars_dupe_7grams": 0.09680856764316559,
"rps_doc_frac_chars_dupe_8grams": 0.08061165362596512,
"rps_doc_frac_chars_dupe_9grams": 0.08061165362596512,
"rps_doc_frac_chars_top_2gram": 0.03276680037379265,
"rps_doc_frac_chars_top_3gram": 0.01918056048452854,
"rps_doc_frac_chars_top_4gram": 0.008950930088758469,
"rps_doc_books_importance": -1628.3985595703125,
"rps_doc_books_importance_length_correction": -1628.3985595703125,
"rps_doc_openwebtext_importance": -882.9576416015625,
"rps_doc_openwebtext_importance_length_correction": -882.9576416015625,
"rps_doc_wikipedia_importance": -585.4953002929688,
"rps_doc_wikipedia_importance_length_correction": -585.4953002929688
},
"fasttext": {
"dclm": 0.03565013036131859,
"english": 0.9344727396965027,
"fineweb_edu_approx": 2.1577348709106445,
"eai_general_math": 0.15953469276428223,
"eai_open_web_math": 0.2710784673690796,
"eai_web_code": 0.066647469997406
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-4,070,592,588,210,087,400 |
Confluence Man with Machine by Tery Spataro 07132013 for IEET
2,700 views
2,603 views
Published on
This exploration is a continuation of the Confluence of Humans with Technology and the Environment, here I am exploring the robots and robotics and the impact these applications have on our humanness and the environment. This presentation is created for the Institute of Ethics & Emerging Technologies http://ieet.org/index.php/IEET/more/spataro20130724
Published in: Technology, Business
0 Comments
0 Likes
Statistics
Notes
• Be the first to comment
• Be the first to like this
No Downloads
Views
Total views
2,700
On SlideShare
0
From Embeds
0
Number of Embeds
1,256
Actions
Shares
0
Downloads
17
Comments
0
Likes
0
Embeds 0
No embeds
No notes for slide
Confluence Man with Machine by Tery Spataro 07132013 for IEET
1. 1. Confluence of Man with Machine by Tery Spataro Hi-Ho! Hi-Ho Off to Work Robbie Goes
2. 2. I find technology exciting and inspiring, especially when technologies have a deeper purpose such as providing a better quality of life, expanding our preservation, and/or keeping the planet healthy; these are good uses of technologies. Though in our quest for creating technologies we seem to be overlooking the impact these technology is having on us and we seem to be creating a path in which we are appending or diminishing our own humanness and hastening the demise of the environment. In this exploration, I look at the use of robotics and robots and ask: Why not have a deeper consideration of the consequences these applications are having on humanity and the environment. “There is nothing we as humans can‟t create!“ Photograph: U. Bellhsuser/Getty Images/ScienceFoto RM
3. 3. We Play God Our preoccupation with the recreation and simulation of the human form has always been alluring. We can’t seem to overcome our need to recreate our humanism.
4. 4. Take-On Different Forms
5. 5. Embrace the Exoskeleton Medical benefits of fusing robotics parts to replace damaged or lost limbs, eyes, ears and even our heart.
6. 6. “About half of the U.S. population has some form of cognitive, emotional or physical condition. We're talking about a lot of people who could be repaired. . . . A person with paralysis wants to walk. A person who cannot see wants to see. It should be the right of every human being to move freely, to touch, to feel, to live life without profound depression, or profound delusion.” - Dr. Hugh Herr. Photograph: Sports Illustrated | Getty Images Source: Wall Street Journal
7. 7. Jan Scheuermann is a remarkable woman, paralyzed from the neck down, she able to control her robotic arm with her mind. Source: KurzweilAINetwork
8. 8. Cochlear implant allows this child the ability to hear. Source: TechFam
9. 9. Henry Evans has been a quadriplegic for over 10 years, and for the first time scratches an itch. Source: IEEE Spectrum
10. 10. “If successful, the bionic eye has the potential to help over 85 percent of those people classified as legally blind.” – Professor Mark Armstrong Source: ABC News AU Photograph: Yahoo 7
11. 11. Not forgetting our insides, Carmat Artificial Heart will give new life. Photograph: Carmat Source: Yahoo News AU
12. 12. Defending Humanism Our preoccupation to assimilate ourselves goes from utilitarian needs to self-glorification.
13. 13. Francine Hardaway models and uses Google Glass. But our emergence with tech didn’t start with Google Glass. Source: Francine Hardaway Photograph: Francine Hardaway
14. 14. “Technology is evolving us, as we become a screen-staring, button- clicking new version of homo sapiens. We now rely on "external brains" (cell phones and computers) to communicate, remember, even live out secondary lives. But will these machines ultimately connect or conquer us?” – Amber Case Photograph: Core 77
15. 15. Biohacking is in an “art-form” stage; clearly red flags should be raised. Photograph: Quinn Norton
16. 16. The beauty of the fusion of man with machine. An impressive aesthetic vision by The Input Devices and Music Interaction Laboratory. Source and Photograph: The Creator Project
17. 17. “As man merges with machine, we're dealing fundamentally with an ontological shift, a shift in the ground of being.“ - Eric Kingsbury Photograph: The Verge
18. 18. Recreation of Us With creation of robots, no difference. Here we are melding our humanness with materials to transform utilitarian needs. Source: Rethink Robotics
19. 19. The beginning of our merging with machines. Survival & Sustenance Transportation Communication As our population grows so do our demands. Need for automation takes over. The need for human involvement becomes less important. Our existence is challenged.Manufacturing Nick Bostrom, „Are we nothing more than a computer simulation?‟ Source: Rethink Robotics Photograph: StarTrek Source: Tweaktown Baxter created to compete with China. Symbiotic relationship of man with machine.
20. 20. Robots in retail help keep shelves stocked and note shopping obstacles.
21. 21. Lettuce bots do the work for 2 dozen workers "The fundamental question for consumers is who and, now, what do you want picking your food; a machine or a human, who with the proper training and support, can" Erik Nicholson, national vice president of the United Farm Workers of America. (USAToday. 2013) Photograph: Marcio Jose Sanchez, AP Source: USAToday
22. 22. “I teach innovation and creativity in business; Foxconn, the Chinese electronics manufacturer, was in the news last year because of worker suicides. Last December, Foxconn broke ground on a fully automated “robot” factory that, they said at the time, would eliminate up to 500,000 jobs. My students are often shocked by the human implications of such an automated factory. A half a million jobs lost is a stunning...” - Eric Kingsbury Source: Kiteba Source: SingularityHub “Foxconn aims to replace 1 million Foxconn workers with Robots within 3 years.” - Terry Tai-Ming Gou, Founder/Chainman of Foxconn
23. 23. Source: Space.com The United States military has been envisioning a future in which robots could replace humans as responders in disaster zones. (Space.com.2013)
24. 24. Job Creation - 200,000,000 400,000,000 600,000,000 800,000,000 1,000,000,000 1,200,000,000 1,400,000,000 1,600,000,000 World Population 7,099,445,570 As of 07202013 14:20 AZMST Robots/RoboticsHumans 70% of the total industrial robot sales in 2012 went to Japan, China, United Sates, South Korea and Germany. Japan and Germany have declining populations. Manufacturing accounts for only 11% of employment in US. 2013 Unemployment % Spain 27.20 Italy 12.20 Finland 10.80 Belgium 8.60 Sweden 8.20 United States 7.60 Germany 5.30 China 4.10 Japan 4.10 South Korea 3.20 Singapore 1.90 Source: Trading Economics, Everything Robotics, World Robotics, Metra Martech Photograph: Fanbox 0 50 100 150 200 250 300 350 Top Countries by Robot Density 2008 Most Populous Countries
25. 25. Strengths Weaknesses We need so much food, clothing, shelter, comfort, sleep. We need money. We make mistakes. They need so very little, are tireless, never asking for a raise. Performing the same task over and over again without flaw.
26. 26. Download Your Conscience 2045 Project says we’ll be able to download/upload our minds – perhaps into toasters.
27. 27. Are We Selfish Creators?
28. 28. At What Cost While we are in our creative innovative acts, what thought have we given to the purpose and usage of robots; how will they effect us and our humanity, our environment?
29. 29. Industry has severely polluted Shanghai [Disney resort], which cripples our natural supply of oxygen. Does our focus on our mechanical selves diminish our need to focus on the rapidly changing environment, making us less likely to be concerned?
30. 30. Robo-bees solve the pollination problem, what does this mean for dying bee population or the animals that eat bees? How does this play into the use of GMOs?
31. 31. “Robots Will Steal Your Job, but That's OK” - Federico Pistono A sweet positive outlook on the future indicative of millennials.
32. 32. On-the-one-hand
33. 33. Photograph: How To Create A Mind Photograph: NYTimes “I have no doubt we can build brain-like systems that are larger and faster than human brains. This doesn’t imply we will have humanlike robots like you see in popular fiction. I don’t think that’s likely. Instead, intelligent systems will no longer just help us manage our everyday world." Jeff Hawkins “We‟re going to become increasingly non- biological to the point where the non- biological part dominates and the biological part is not important any more. In fact the non-biological part – the machine part – will be so powerful it can completely model and understand the biological part. So even if that biological part went away it wouldn‟t make any difference.” Ray Kurzweil “A second dream of robotics is that we will gradually replace ourselves with our robotic technology, achieving near immortality by downloading our consciousnesses. We are beginning to see intimations of this in the implantation of computer devices into the human body. But if we are downloaded into our technologies, what are the chances that we will thereafter be ourselves or even human?” Bill Joy Kurzweil vs Hawkins vs Joy Photograph: Singularity Blog
34. 34. Do you believe the more humans merge with machines the more we lose sight of the natural environment we live in? Yes No 25% 75% “From the perspective of a robot, or any other autonomous technological artifact, the wired ecosystem is likely to have the most "biological" and "psycho-emotional" meaning, not the plants and animals. So the question might be one of degrees or of fusion: to what extent does the human consciousness need the old ecology, and to what extent that old ecology can be married to the new techno-ecology. Is there a possible balance, does that have value, how can it be done?” – Eric Kingsbury
35. 35. Our narcissistic tendencies may destroy our humanness, therefore we need custodians who will preserve the planet and its creatures – perhaps this is the good that will come out of our transhuman selves.
36. 36. Nostalgia vs Evolution
37. 37. Nostalgia vs Evolution What do you think?
38. 38. Tery Spataro is widely known for helping brands understand the role technology plays in marketing, innovation and retail environment. Wielding over two decades of experiences in marketing, as a digital strategist, Tery takes a deep look into understanding why, what and who. Industry agnostic, she’s created strategies for Automotive, Beverage and Food, Consumer Package Goods [CPG], Education, Energy, Entertainment, Healthcare, Insurance, Pha rmaceutical, Non-Profit and Retail brands. Tery’s bringing digital to life in physical space, having worked with Bloomingdales, Michael’s craft store, Sally Hansen, Novartis, Whole Foods and Nine West. She helps clients by identifying problems with marketing, communication, branding and retail space. She provides research, strategy, and creative ideas with a clear direction on how to proceed. Tery held executive roles with top agencies and served as senior strategist for several consulting firms. No stranger to entrepreneurial life, Tery founded/co-founded, self-funded, and operated 7 startups. Throughout the years she lectured at universities and international conferences providing valuable thought leadership and is quoted in books and articles about business and marketing. Tery has MBA in marketing from Regis University. Wrote and illustrated a book about quantum perceptions called “The Other Side of the Box”. Bio || Glossi || Twitter || LinkedIn || The Book || Pinterest || Slideshare Special thanks to Rick Colby for editing.
39. 39. Stuff I Did The Future is Now – A look at the confluence of Us, with technology and the environment. Digital Experiences & Shopping – cheeky overview of the buyer’s decision making process using digital, the future of in-store retail and use of digital experiences. Digital Strategy – a look at digital strategy a usages for innovation, communication and promotion. Fashion Intelligentsia - research report I did to provide insights into how fashion minded women acquire information for shopping. This report was voted the best of Slideshare. The Changing World of Digital - looks at digital communication from a historical perspective and identifies the way the consumer changes from passive involvement to participant. Healthy Digital - explores who the natural and organic consumer is and identifies their digital behavior. Community During Crisis – what Governments can learn from the Boulder Community’s usage of Social Media during the Boulder Fire. Digital Marketing Strategy vs Tactics – Asking strategic questions, forming ideas and identifying tactics. The Other Side of the Box - the story about a cat, box and perception. “The Other Side of the Box” a book about perception, a cat and quantum thoughts.
40. 40. A curious book about a cat and box available at Lulu.com Share & Like on Facebook http://www.slideshare.net/TeryS/about-the-box-the- cat-the-story-by-tery-spataro
×
|
{
"url": "http://www.slideshare.net/TeryS/confluence-man-with-machine-by-tery-spataro-07132013-for-ieet",
"source_domain": "www.slideshare.net",
"snapshot_id": "crawl=CC-MAIN-2016-26",
"warc_metadata": {
"Content-Length": "168914",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CXASP3QF5RX6YG5C3LDA7A53WRBC2AY3",
"WARC-Concurrent-To": "<urn:uuid:0b60580d-f355-408a-a59c-726c2b218b9a>",
"WARC-Date": "2016-06-28T18:41:49Z",
"WARC-IP-Address": "108.174.10.19",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:MC5ILBLQHEVMS6JVQQIBYYFWPX474BQ4",
"WARC-Record-ID": "<urn:uuid:713ba3cc-560f-41ed-a04f-1f6df937a744>",
"WARC-Target-URI": "http://www.slideshare.net/TeryS/confluence-man-with-machine-by-tery-spataro-07132013-for-ieet",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1ebe7ee2-59d6-4b3b-ae9a-0502cc41f90d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-164-35-72.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-26\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
62,
63,
75,
87,
88,
101,
102,
456,
457,
492,
503,
511,
522,
528,
556,
557,
587,
588,
601,
607,
619,
625,
639,
641,
653,
655,
672,
678,
686,
693,
695,
705,
708,
717,
719,
725,
727,
736,
746,
747,
766,
767,
829,
830,
922,
1711,
1889,
1921,
2060,
2541,
2695,
2775,
2902,
3098,
3221,
3343,
3517,
3842,
3951,
4136,
4302,
4475,
4962,
5044,
5410,
6023,
6195,
6971,
7217,
7338,
7373,
7564,
7819,
7986,
8125,
8151,
9353,
9980,
10193,
10226,
10278,
11777,
13020,
13193,
13194
],
"line_end_idx": [
62,
63,
75,
87,
88,
101,
102,
456,
457,
492,
503,
511,
522,
528,
556,
557,
587,
588,
601,
607,
619,
625,
639,
641,
653,
655,
672,
678,
686,
693,
695,
705,
708,
717,
719,
725,
727,
736,
746,
747,
766,
767,
829,
830,
922,
1711,
1889,
1921,
2060,
2541,
2695,
2775,
2902,
3098,
3221,
3343,
3517,
3842,
3951,
4136,
4302,
4475,
4962,
5044,
5410,
6023,
6195,
6971,
7217,
7338,
7373,
7564,
7819,
7986,
8125,
8151,
9353,
9980,
10193,
10226,
10278,
11777,
13020,
13193,
13194,
13195
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13195,
"ccnet_original_nlines": 85,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30766355991363525,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012336449697613716,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26504671573638916,
"rps_doc_frac_unique_words": 0.4595641493797302,
"rps_doc_mean_word_length": 5.099757671356201,
"rps_doc_num_sentences": 208,
"rps_doc_symbol_to_word_ratio": 0.00037383000017143786,
"rps_doc_unigram_entropy": 6.163053035736084,
"rps_doc_word_count": 2065,
"rps_doc_frac_chars_dupe_10grams": 0.009875609539449215,
"rps_doc_frac_chars_dupe_5grams": 0.02497388981282711,
"rps_doc_frac_chars_dupe_6grams": 0.016617609187960625,
"rps_doc_frac_chars_dupe_7grams": 0.009875609539449215,
"rps_doc_frac_chars_dupe_8grams": 0.009875609539449215,
"rps_doc_frac_chars_dupe_9grams": 0.009875609539449215,
"rps_doc_frac_chars_top_2gram": 0.006172250024974346,
"rps_doc_frac_chars_top_3gram": 0.006647040136158466,
"rps_doc_frac_chars_top_4gram": 0.004557969979941845,
"rps_doc_books_importance": -1389.291015625,
"rps_doc_books_importance_length_correction": -1389.291015625,
"rps_doc_openwebtext_importance": -671.2220458984375,
"rps_doc_openwebtext_importance_length_correction": -671.2220458984375,
"rps_doc_wikipedia_importance": -576.0128784179688,
"rps_doc_wikipedia_importance_length_correction": -576.0128784179688
},
"fasttext": {
"dclm": 0.02238279953598976,
"english": 0.9022423624992371,
"fineweb_edu_approx": 2.1726934909820557,
"eai_general_math": 0.008233670145273209,
"eai_open_web_math": 0.17021536827087402,
"eai_web_code": 0.0012841200223192573
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "303.483",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social sciences — Dictionaries"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
3,863,260,727,161,231,000 |
Подключение оплаты YooMoney
Подключение оплаты к форме
В настройках формы нужно указать действие “Вставка HTML кода”, или другое подобное.
В поле “Код для вставки” нужно вставить код:
<form id="form<%= order_id %>" method="POST" action="https://yoomoney.ru/quickpay/confirm.xml">
<input type="hidden" name="receiver" value="41000000000000">
<input type="hidden" name="quickpay-form" value="shop">
<input type="hidden" name="targets" value="Доступ к контактам <%= member_id %>">
<input type="hidden" name="paymentType" value="AC">
<input type="hidden" name="sum" value="3" data-type="number">
<input type="hidden" name="label" value="Оплата доступа:<%= member_id %>:Подписка на 3 месяца">
<input type="hidden" name="formcomment" value="Creatium Demo: оплата доступа к контактам на 3 месяца">
<input type="hidden" name="short-dest" value="Creatium Demo: оплата доступа к контактам на 3 месяца">
<input type="hidden" name="successURL" value="https://mysite.ru/catalog?success-payment=<%= order_id %>">
<input type="submit" value="Перевести">
</form>
<script>
document.getElementById("form<%= order_id %>").submit();
</script>
В коде нужно заменить несколько частей:
• 41000000000000 на номер кошелька YooMoney
• Доступ к контактам <%= member_id %> на назначение платежа (рекомендуем на всякий случай в назначении указывать или номер пользователя <%= member_id %> или номер заявки <%= order_id %>)
• Оплата доступа:<%= member_id %>:Подписка на 3 месяца это данные платежа, которые затем придут в вебхук, тут через двоеточие нужно указать все данные, необходимые для того, чтобы с этим платежом работать дальше в интегромате. Можно не менять формат, а так и оставить 3 значения через двоеточие.
• Creatium Demo: оплата доступа к контактам на 3 месяца описание платеж, которое будет видеть покупатель
• https://mysite.ru/catalog?success-payment=<%= order_id %> ссылка, куда будет перенаправлен покупатель после успешной оплаты
Еще один пример кода
<form id="form<%= order_id %>" method="POST" action="https://yoomoney.ru/quickpay/confirm.xml">
<input type="hidden" name="receiver" value="41000000000000">
<input type="hidden" name="quickpay-form" value="shop">
<input type="hidden" name="targets" value="Размещение объявления <%= order_id %>">
<input type="hidden" name="paymentType" value="AC">
<input type="hidden" name="sum" value="2" data-type="number">
<input type="hidden" name="label" value="Оплата объявления:<%= order_id %>:Единый тариф">
<input type="hidden" name="formcomment" value="Creatium Demo: платное размещение объявления">
<input type="hidden" name="short-dest" value="Creatium Demo: платное размещение объявления">
<input type="hidden" name="successURL" value="https://mysite.ru/cabinet?success-payment=<%= order_id %>">
<input type="submit" value="Перевести">
</form>
<script>
document.getElementById("form<%= order_id %>").submit();
</script>
Обработка вебхука
В настройках YooMoney есть возможность указать адрес вебхука, куда будут приходить сведения об успешных платежах. Нужно указать вебхук интегромата.
Данные в вебхук приходят так:
Из всего этого нам полезно поле label, которое содержит информацию о платеже.
Сразу после приема вебхука нужно добавить действие “Match pattern”:
В этом действии настроить обработку поля label по следующему шаблону: (?<Назначение>.+)\:(?<Номер>.+)\:(?<Тариф>.+).
В результате этот модуль будет возвращать 3 поля: Назначение, Номер и Тариф, которые затем можно использовать в сценарии.
ТЕХНИЧЕСКАЯ ПОДДЕРЖКА
Не можете найти то, что ищете?
Напишите нам. на связи 24/7. Среднее время ожидания ответа: 10-15 минут. Также вы можете вступить в наш Телеграм-чат, где собралось много специалистов и пользователей.
Поддержка Creatium
Агенты ответят через 10 минут
Агенты ответят
Блог, курсы и полезные материалы
Платформа сайтов любой сложности
|
{
"url": "https://creatium.academy/help/yoomoney-payment-connection",
"source_domain": "creatium.academy",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "140837",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4U3ZKBTJB7ZYORAZA7W2ESYCQNXOYWGL",
"WARC-Concurrent-To": "<urn:uuid:b85ed0a2-4957-46f4-a716-91a92b613da2>",
"WARC-Date": "2024-09-07T16:43:14Z",
"WARC-IP-Address": "185.149.120.127",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7VZBTBWZHFESKT6P2JLIAYB6TS4M6YVO",
"WARC-Record-ID": "<urn:uuid:bedb2207-0b31-48bc-b8f0-859565544070>",
"WARC-Target-URI": "https://creatium.academy/help/yoomoney-payment-connection",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d894913f-a707-4ea9-9c4e-97939070ce3e>"
},
"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-154\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,
28,
29,
56,
57,
141,
142,
187,
188,
284,
347,
405,
488,
542,
606,
704,
809,
913,
1021,
1063,
1071,
1072,
1081,
1140,
1150,
1151,
1191,
1192,
1238,
1427,
1725,
1832,
1960,
1981,
2077,
2140,
2198,
2283,
2337,
2401,
2493,
2589,
2684,
2792,
2834,
2842,
2843,
2852,
2911,
2923,
2924,
2942,
2943,
3091,
3092,
3122,
3123,
3201,
3202,
3270,
3271,
3388,
3389,
3511,
3512,
3534,
3535,
3566,
3567,
3735,
3736,
3755,
3756,
3786,
3787,
3802,
3803,
3837,
3838
],
"line_end_idx": [
28,
29,
56,
57,
141,
142,
187,
188,
284,
347,
405,
488,
542,
606,
704,
809,
913,
1021,
1063,
1071,
1072,
1081,
1140,
1150,
1151,
1191,
1192,
1238,
1427,
1725,
1832,
1960,
1981,
2077,
2140,
2198,
2283,
2337,
2401,
2493,
2589,
2684,
2792,
2834,
2842,
2843,
2852,
2911,
2923,
2924,
2942,
2943,
3091,
3092,
3122,
3123,
3201,
3202,
3270,
3271,
3388,
3389,
3511,
3512,
3534,
3535,
3566,
3567,
3735,
3736,
3755,
3756,
3786,
3787,
3802,
3803,
3837,
3838,
3870
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3870,
"ccnet_original_nlines": 78,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.047979798167943954,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016414139419794083,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7222222089767456,
"rps_doc_frac_unique_words": 0.5220588445663452,
"rps_doc_mean_word_length": 7.098039150238037,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.007845878601074,
"rps_doc_word_count": 408,
"rps_doc_frac_chars_dupe_10grams": 0.22997237741947174,
"rps_doc_frac_chars_dupe_5grams": 0.4095304012298584,
"rps_doc_frac_chars_dupe_6grams": 0.3459944725036621,
"rps_doc_frac_chars_dupe_7grams": 0.32389503717422485,
"rps_doc_frac_chars_dupe_8grams": 0.2424033135175705,
"rps_doc_frac_chars_dupe_9grams": 0.22997237741947174,
"rps_doc_frac_chars_top_2gram": 0.09323204308748245,
"rps_doc_frac_chars_top_3gram": 0.015538670122623444,
"rps_doc_frac_chars_top_4gram": 0.014502760022878647,
"rps_doc_books_importance": -181.08004760742188,
"rps_doc_books_importance_length_correction": -181.08004760742188,
"rps_doc_openwebtext_importance": -146.78317260742188,
"rps_doc_openwebtext_importance_length_correction": -146.78317260742188,
"rps_doc_wikipedia_importance": -125.54071044921875,
"rps_doc_wikipedia_importance_length_correction": -125.54071044921875
},
"fasttext": {
"dclm": 0.8341689705848694,
"english": 0.0013315200340002775,
"fineweb_edu_approx": 1.8993397951126099,
"eai_general_math": 0.0000021500000002561137,
"eai_open_web_math": 0.07171893119812012,
"eai_web_code": 0.42163020372390747
}
}
|
{
"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.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
8,291,598,456,308,981,000 |
示例#1
0
/// <summary>
/// Speichern.
/// </summary>
/// <param name="param">Der Parameter.</param>
/// <returns>"LieferRhythmusOrgEinheitenEntityA"</returns>
LieferRhythmusOrgEinheitenEntityA IServiceLieferRhythmusOrgEinheitenEntity.Speichern(LieferRhythmusOrgEinheitenEntityF param)
{
#region ------------------------------ Initialisierung ------------------------------
LieferRhythmusOrgEinheitenEntityA ret = new LieferRhythmusOrgEinheitenEntityA();
ret.HatFehler = true;
// für ado.net
SqlConnection sqlConnection = null;
SqlCommand sqlCommand1 = null;
SqlCommand sqlCommand2 = null;
#endregion --------------------------- Initialisierung Ende -------------------------
#region ------------------------------ Implementierung ------------------------------
using (TransactionScope scope = new TransactionScope(TransactionScopeOption.Required))
{
try
{
// was ist mit ... new DebuggerWriter(); // writing to the debugger log window
Speichern_VorImpl(param);
sqlConnection = new SqlConnection(VerbindungsEinstellung.ConnectionString);
sqlConnection.Open();
// speichern des eigentlichen Satzes mit sp_Table_Update
sqlCommand1 = new SqlCommand("Controlling.sp_LieferRhythmusOrgEinheiten_UpdateCols", sqlConnection);
sqlCommand1.CommandTimeout = 300;
AddParameterDef4Update(sqlCommand1);
sqlCommand1.CommandType = System.Data.CommandType.StoredProcedure;
for (int i = 0; i < param.LieferRhythmusOrgEinheitenEntity.Count; i++)
{
//if (param.LieferRhythmusOrgEinheitenEntity[i].Timestamp != null) // update nicht mehr über timestamp
//{
System.Collections.Generic.List<string> changedColumns = param.LieferRhythmusOrgEinheitenEntity[i].GetUpdatedColumns();
sqlCommand1.Parameters["@rowid"].Value = (Guid)param.LieferRhythmusOrgEinheitenEntity[i].Rowid;
sqlCommand1.Parameters["@timestamp"].Value = param.LieferRhythmusOrgEinheitenEntity[i].Timestamp;
sqlCommand1.Parameters["@mandant"].Value = (Guid)param.MandantenID;
sqlCommand1.Parameters["@geaendertvon"].Value = (string)param.UserName;
if (changedColumns.Contains("OrganisationsEinheit")) // && (param.LieferRhythmusOrgEinheitenEntity[i].OrganisationsEinheit != Guid.Empty))
{
sqlCommand1.Parameters["@organisationseinheit"].Value = (Guid)param.LieferRhythmusOrgEinheitenEntity[i].OrganisationsEinheit;
}
else
{
sqlCommand1.Parameters["@organisationseinheit"].Value = DBNull.Value;
}
if (changedColumns.Contains("LieferRhythmus")) // && (param.LieferRhythmusOrgEinheitenEntity[i].LieferRhythmus != Guid.Empty))
{
sqlCommand1.Parameters["@lieferrhythmus"].Value = (Guid)param.LieferRhythmusOrgEinheitenEntity[i].LieferRhythmus;
}
else
{
sqlCommand1.Parameters["@lieferrhythmus"].Value = DBNull.Value;
}
SqlDataReader sqlReader = sqlCommand1.ExecuteReader();
int timestampOid = sqlReader.GetOrdinal("timestamp");
int geaendertamOid = sqlReader.GetOrdinal("geaendertam");
int geaendertvonOid = sqlReader.GetOrdinal("geaendertvon");
int organisationseinheitOid = sqlReader.GetOrdinal("organisationseinheit");
int lieferrhythmusOid = sqlReader.GetOrdinal("lieferrhythmus");
if (sqlReader.Read())
{
LieferRhythmusOrgEinheitenEntityDM rs = new LieferRhythmusOrgEinheitenEntityDM();
rs.DisableUpdateMask = true;
rs.Rowid = param.LieferRhythmusOrgEinheitenEntity[i].Rowid;
if (!sqlReader.IsDBNull(timestampOid))
{
byte[] tbyte = new byte[sqlReader.GetBytes(timestampOid, 0, null, 0, int.MaxValue)]; // länge ermitteln
sqlReader.GetBytes(timestampOid, 0, tbyte, 0, int.MaxValue); // timestamp in buffer einlesen
rs.Timestamp = tbyte;
}
rs.Mandant = param.MandantenID;
rs.ErstelltVon = param.LieferRhythmusOrgEinheitenEntity[i].ErstelltVon;
rs.ErstelltAm = param.LieferRhythmusOrgEinheitenEntity[i].ErstelltAm;
rs.GeaendertVon = sqlReader.IsDBNull(geaendertvonOid) ? string.Empty : sqlReader.GetString(geaendertvonOid);
rs.GeaendertAm = sqlReader.IsDBNull(geaendertamOid) ? DateTime.MinValue : sqlReader.GetDateTime(geaendertamOid);
rs.OrganisationsEinheit = sqlReader.IsDBNull(organisationseinheitOid) ? Guid.Empty : sqlReader.GetGuid(organisationseinheitOid);
rs.LieferRhythmus = sqlReader.IsDBNull(lieferrhythmusOid) ? Guid.Empty : sqlReader.GetGuid(lieferrhythmusOid);
rs.DisableUpdateMask = false;
ret.LieferRhythmusOrgEinheitenEntity.Add(rs);
}
else
{
ret.FehlerText = "Der Datensatz konnte nicht gespeichert werden!";
ret.HatFehler = true;
return ret;
}
sqlReader.Close();
//}
}
Speichern_NachImpl(param, ret);
scope.Complete();
}
catch (SqlException ex)
{
// logging des fehlers noch implementieren
ret = new LieferRhythmusOrgEinheitenEntityA();
ret.HatFehler = true;
ret.FehlerText = "Sql-Fehler: " + ex.Number.ToString() + " " + ex.Message;
return ret;
}
catch (Exception e)
{
// logging des fehlers noch implementieren
ret = new LieferRhythmusOrgEinheitenEntityA();
ret.HatFehler = true;
ret.FehlerText = e.Message;
return ret;
}
finally
{
if (sqlCommand1 != null)
sqlCommand1.Dispose();
if (sqlCommand2 != null)
sqlCommand2.Dispose();
if (sqlConnection != null)
sqlConnection.Close();
}
}
#endregion --------------------------- Implementierung Ende -------------------------
#region ------------------------------ Rueckgabe ------------------------------
ret.HatFehler = false;
return ret;
#endregion --------------------------- Rueckgabe Ende -------------------------
}
示例#2
0
/// <summary>
/// Lesen.
/// </summary>
/// <param name="param">Der Parameter.</param>
/// <returns>"LieferRhythmusOrgEinheitenEntityA"</returns>
LieferRhythmusOrgEinheitenEntityA IServiceLieferRhythmusOrgEinheitenEntity.Lesen(LieferRhythmusOrgEinheitenEntityF param)
{
#region ------------------------------ Initialisierung ------------------------------
LieferRhythmusOrgEinheitenEntityA ret = new LieferRhythmusOrgEinheitenEntityA();
ret.HatFehler = true;
PagingA paging = Paging.CheckPaging(param);
// für ado.net
SqlConnection sqlConnection = null;
SqlCommand sqlCommand1 = null;
SqlCommand sqlCommand2 = null;
SqlDataReader sqlReader = null;
StringBuilder strFilter = new StringBuilder();
StringBuilder strSortierung = new StringBuilder();
// queryfilter aufbereiten
strFilter.Append(" LieferRhythmusOrgEinheiten.mandant='");
strFilter.Append(param.MandantenID.ToString());
strFilter.Append("' ");
if ((Guid)param.Filter.Rowid != Guid.Empty)
{
strFilter.Append(" AND LieferRhythmusOrgEinheiten.rowid='");
strFilter.Append(param.Filter.Rowid.ToString());
strFilter.Append("' ");
}
if (param.Filter.ErstelltVon.ToString().Length > 0)
{
strFilter.Append(" AND lower(LieferRhythmusOrgEinheiten.ERSTELLTVON) LIKE '%");
strFilter.Append(param.Filter.ErstelltVon.ToString().ToLower());
strFilter.Append("%'");
}
if (param.Filter.ErstelltAm != DateTime.MinValue)
{
strFilter.Append(" AND CAST(FLOOR(CAST(LieferRhythmusOrgEinheiten.ERSTELLTAM AS float)) AS datetime)='");
strFilter.Append(param.Filter.ErstelltAm.ToSqlDateFormat());
strFilter.Append("'");
}
if (param.Filter.GeaendertVon.ToString().Length > 0)
{
strFilter.Append(" AND lower(LieferRhythmusOrgEinheiten.GEAENDERTVON) LIKE '%");
strFilter.Append(param.Filter.GeaendertVon.ToString().ToLower());
strFilter.Append("%'");
}
if (param.Filter.GeaendertAm != DateTime.MinValue)
{
strFilter.Append(" AND CAST(FLOOR(CAST(LieferRhythmusOrgEinheiten.GEAENDERTAM AS float)) AS datetime)='");
strFilter.Append(param.Filter.GeaendertAm.ToSqlDateFormat());
strFilter.Append("'");
}
if ((Guid)param.Filter.OrganisationsEinheit != Guid.Empty)
{
strFilter.Append(" AND LieferRhythmusOrgEinheiten.organisationseinheit='");
strFilter.Append(param.Filter.OrganisationsEinheit.ToString());
strFilter.Append("' ");
}
if ((Guid)param.Filter.LieferRhythmus != Guid.Empty)
{
strFilter.Append(" AND LieferRhythmusOrgEinheiten.lieferrhythmus='");
strFilter.Append(param.Filter.LieferRhythmus.ToString());
strFilter.Append("' ");
}
// erweiterte Sql Bedingung aus Basisobjekt
if (!string.IsNullOrEmpty(param.ExtSqlRestriction))
{
strFilter.Append(" AND ");
strFilter.Append(param.ExtSqlRestriction);
}
// sortierung
#endregion --------------------------- Initialisierung Ende -------------------------
#region ------------------------------ Implementierung ------------------------------
using (TransactionScope scope = new TransactionScope(TransactionScopeOption.Required))
{
try
{
// was ist mit ... new DebuggerWriter(); // writing to the debugger log window
Lesen_VorImpl(param);
sqlConnection = new SqlConnection(VerbindungsEinstellung.ConnectionString);
sqlConnection.Open();
sqlCommand1 = new SqlCommand("sp_SelectRecords", sqlConnection);
sqlCommand1.CommandTimeout = 300;
sqlCommand1.CommandType = System.Data.CommandType.StoredProcedure;
sqlCommand1.Parameters.AddWithValue("@tablename", "Controlling.LieferRhythmusOrgEinheiten");
sqlCommand1.Parameters.AddWithValue("@queryfilter", strFilter.ToString());
sqlCommand1.Parameters.AddWithValue("@sortfield", strSortierung.ToString());
sqlCommand1.Parameters.AddWithValue("@userid", param.UserId);
if (!string.IsNullOrEmpty(param.TableSortRefTable))
sqlCommand1.Parameters.AddWithValue("@tablesortreftable", param.TableSortRefTable.ToString());
if (!string.IsNullOrEmpty(param.TableSortColumn))
sqlCommand1.Parameters.AddWithValue("@tablesortcolumn", param.TableSortColumn.ToString());
//sqlCommand1.Parameters.AddWithValue("@pagesize", 500);
//sqlCommand1.Parameters.AddWithValue("@pageindex", 1);
sqlReader = sqlCommand1.ExecuteReader();
int rowidOid = sqlReader.GetOrdinal("rowid");
int mandantOid = sqlReader.GetOrdinal("mandant");
int timestampOid = sqlReader.GetOrdinal("timestamp");
int erstelltamOid = sqlReader.GetOrdinal("erstelltam");
int erstelltvonOid = sqlReader.GetOrdinal("erstelltvon");
int geaendertamOid = sqlReader.GetOrdinal("geaendertam");
int geaendertvonOid = sqlReader.GetOrdinal("geaendertvon");
int organisationseinheitOid = sqlReader.GetOrdinal("organisationseinheit");
int lieferrhythmusOid = sqlReader.GetOrdinal("lieferrhythmus");
while (sqlReader.Read())
{
LieferRhythmusOrgEinheitenEntityDM rs = new LieferRhythmusOrgEinheitenEntityDM();
rs.DisableUpdateMask = true;
rs.Rowid = sqlReader.IsDBNull(rowidOid) ? Guid.Empty : sqlReader.GetGuid(rowidOid);
if (!sqlReader.IsDBNull(timestampOid))
{
byte[] tbyte = new byte[sqlReader.GetBytes(timestampOid, 0, null, 0, int.MaxValue)]; // länge ermitteln
sqlReader.GetBytes(timestampOid, 0, tbyte, 0, int.MaxValue); // timestamp in buffer einlesen
rs.Timestamp = tbyte;
}
rs.Mandant = sqlReader.IsDBNull(mandantOid) ? Guid.Empty : sqlReader.GetGuid(mandantOid);
rs.ErstelltVon = sqlReader.IsDBNull(erstelltvonOid) ? string.Empty : sqlReader.GetString(erstelltvonOid);
rs.ErstelltAm = sqlReader.IsDBNull(erstelltamOid) ? DateTime.MinValue : sqlReader.GetDateTime(erstelltamOid);
rs.GeaendertVon = sqlReader.IsDBNull(geaendertvonOid) ? string.Empty : sqlReader.GetString(geaendertvonOid);
rs.GeaendertAm = sqlReader.IsDBNull(geaendertamOid) ? DateTime.MinValue : sqlReader.GetDateTime(geaendertamOid);
rs.OrganisationsEinheit = sqlReader.IsDBNull(organisationseinheitOid) ? Guid.Empty : sqlReader.GetGuid(organisationseinheitOid);
rs.LieferRhythmus = sqlReader.IsDBNull(lieferrhythmusOid) ? Guid.Empty : sqlReader.GetGuid(lieferrhythmusOid);
rs.DisableUpdateMask = false;
ret.LieferRhythmusOrgEinheitenEntity.Add(rs);
}
// sind dem benutzer alle orgeinheiten zugewiesen?
if ((param.BenuterHatAlleMasterOrgEinheitenHolen) && (param.Filter.Rowid != Guid.Empty))
{
sqlCommand2 = new SqlCommand("sp_SelectHatAlleOrgEinheiten", sqlConnection);
sqlCommand2.CommandTimeout = 300;
sqlCommand2.CommandType = System.Data.CommandType.StoredProcedure;
sqlCommand2.Parameters.Add("@tablename", System.Data.SqlDbType.VarChar);
sqlCommand2.Parameters["@tablename"].DbType = System.Data.DbType.String;
sqlCommand2.Parameters["@tablename"].Direction = System.Data.ParameterDirection.Input;
sqlCommand2.Parameters["@tablename"].Value = "LieferRhythmusOrgEinheiten";
sqlCommand2.Parameters.Add("@rowid2query", System.Data.SqlDbType.UniqueIdentifier);
sqlCommand2.Parameters["@rowid2query"].DbType = System.Data.DbType.Guid;
sqlCommand2.Parameters["@rowid2query"].Direction = System.Data.ParameterDirection.Input;
sqlCommand2.Parameters["@rowid2query"].Value = (Guid)param.Filter.Rowid;
sqlCommand2.Parameters.Add("@userid", System.Data.SqlDbType.UniqueIdentifier);
sqlCommand2.Parameters["@userid"].DbType = System.Data.DbType.Guid;
sqlCommand2.Parameters["@userid"].Direction = System.Data.ParameterDirection.Input;
sqlCommand2.Parameters["@userid"].Value = (Guid)param.UserId;
sqlCommand2.Parameters.Add("@hatalleorgeinheiten", System.Data.SqlDbType.Bit);
sqlCommand2.Parameters["@hatalleorgeinheiten"].DbType = System.Data.DbType.Boolean;
sqlCommand2.Parameters["@hatalleorgeinheiten"].Direction = System.Data.ParameterDirection.InputOutput;
sqlCommand2.Parameters["@hatalleorgeinheiten"].Value = false;
sqlReader.Close();
sqlReader = sqlCommand2.ExecuteReader();
ret.BenutzerHatAlleMasterOrgEinheiten = (bool)sqlCommand2.Parameters["@hatalleorgeinheiten"].Value;
}
Lesen_NachImpl(param, ret);
scope.Complete();
}
catch (SqlException ex)
{
// logging des fehlers noch implementieren
ret = new LieferRhythmusOrgEinheitenEntityA();
ret.HatFehler = true;
ret.FehlerText = "Sql-Fehler: " + ex.Number.ToString() + " " + ex.Message;
return ret;
}
catch (Exception e)
{
// logging des fehlers noch implementieren
ret = new LieferRhythmusOrgEinheitenEntityA();
ret.HatFehler = true;
ret.FehlerText = e.Message;
return ret;
}
finally
{
if (sqlReader != null)
sqlReader.Close();
if (sqlCommand1 != null)
sqlCommand1.Dispose();
if (sqlCommand2 != null)
sqlCommand2.Dispose();
if (sqlConnection != null)
sqlConnection.Close();
}
}
#endregion --------------------------- Implementierung Ende -------------------------
#region ------------------------------ Rueckgabe ------------------------------
ret.HatFehler = false;
return ret;
#endregion --------------------------- Rueckgabe Ende -------------------------
}
示例#3
0
/// <summary>
/// Loeschen.
/// </summary>
/// <param name="param">Der Parameter.</param>
/// <returns>"LieferRhythmusOrgEinheitenEntityA"</returns>
LieferRhythmusOrgEinheitenEntityA IServiceLieferRhythmusOrgEinheitenEntity.Loeschen(LieferRhythmusOrgEinheitenEntityF param)
{
#region ------------------------------ Initialisierung ------------------------------
LieferRhythmusOrgEinheitenEntityA ret = new LieferRhythmusOrgEinheitenEntityA();
ret.HatFehler = true;
// für ado.net
SqlConnection sqlConnection = null;
SqlCommand sqlCommand1 = null;
SqlCommand sqlCommand2 = null;
#endregion --------------------------- Initialisierung Ende -------------------------
#region ------------------------------ Implementierung ------------------------------
using (TransactionScope scope = new TransactionScope(TransactionScopeOption.Required))
{
try
{
// was ist mit ... new DebuggerWriter(); // writing to the debugger log window
Loeschen_VorImpl(param);
sqlConnection = new SqlConnection(VerbindungsEinstellung.ConnectionString);
sqlConnection.Open();
// löschen aller abhängigen datensätze mit sp_DeleteRelationships
sqlCommand1 = new SqlCommand("dbo.sp_DeleteRelationships", sqlConnection);
sqlCommand1.CommandTimeout = 300;
sqlCommand1.CommandType = System.Data.CommandType.StoredProcedure;
AddParameterDef4DeleteRelationships(sqlCommand1);
// löschen des eigentlichen Satzes mit sp_Table_Delete
sqlCommand2 = new SqlCommand("Controlling.sp_LieferRhythmusOrgEinheiten_Delete", sqlConnection);
sqlCommand2.CommandTimeout = 300;
sqlCommand2.CommandType = System.Data.CommandType.StoredProcedure;
AddParameterDef4Delete(sqlCommand2);
sqlCommand1.Parameters["@tablename"].Value = (string)"LieferRhythmusOrgEinheiten";
sqlCommand1.Parameters["@geaendertvon"].Value = param.UserName;
sqlCommand2.Parameters["@mandant"].Value = param.MandantenID;
sqlCommand2.Parameters["@geaendertvon"].Value = param.UserName;
for (int i = 0; i < param.LieferRhythmusOrgEinheitenEntity.Count; i++)
{
if (param.LieferRhythmusOrgEinheitenEntity[i].Timestamp != null)
{
sqlCommand1.Parameters["@uirowid"].Value = (Guid)param.LieferRhythmusOrgEinheitenEntity[i].Rowid;
sqlCommand1.ExecuteScalar();
int iReturnValue = (int)sqlCommand1.Parameters["@errorvalue"].Value;
if (iReturnValue == 1)
{
String sFKInfo = (string)sqlCommand1.Parameters["@fkdelinfo"].Value.ToString().Replace(",", "\n");
if (String.IsNullOrEmpty(sFKInfo))
ret.FehlerText = "Es bestehen noch abhängige Daten.\nDer Datensatz kann nicht gelöscht werden!";
else
ret.FehlerText = "Es bestehen noch abhängige Daten:\n" + sFKInfo + "\n\nDer Datensatz kann nicht gelöscht werden!";
ret.HatFehler = true;
return ret;
}
sqlCommand2.Parameters["@rowid"].Value = (Guid)param.LieferRhythmusOrgEinheitenEntity[i].Rowid;
sqlCommand2.Parameters["@timestamp"].Value = param.LieferRhythmusOrgEinheitenEntity[i].Timestamp;
iReturnValue = sqlCommand2.ExecuteNonQuery();
if (iReturnValue == 0)
{
ret.FehlerText = "Der Datensatz konnte nicht gelöscht werden!";
ret.HatFehler = true;
return ret;
}
}
}
Loeschen_NachImpl(param, ret);
scope.Complete();
}
catch (SqlException ex)
{
// logging des fehlers noch implementieren
ret = new LieferRhythmusOrgEinheitenEntityA();
ret.HatFehler = true;
ret.FehlerText = "Sql-Fehler: " + ex.Number.ToString() + " " + ex.Message;
return ret;
}
catch (Exception e)
{
// logging des fehlers noch implementieren
ret = new LieferRhythmusOrgEinheitenEntityA();
ret.HatFehler = true;
ret.FehlerText = e.Message;
return ret;
}
finally
{
if (sqlCommand1 != null)
sqlCommand1.Dispose();
if (sqlCommand2 != null)
sqlCommand2.Dispose();
if (sqlConnection != null)
sqlConnection.Close();
}
}
#endregion --------------------------- Implementierung Ende -------------------------
#region ------------------------------ Rueckgabe ------------------------------
ret.HatFehler = false;
return ret;
#endregion --------------------------- Rueckgabe Ende -------------------------
}
示例#4
0
partial void Speichern_NachImpl(LieferRhythmusOrgEinheitenEntityF paramF, LieferRhythmusOrgEinheitenEntityA paramA);
示例#5
0
partial void Speichern_VorImpl(LieferRhythmusOrgEinheitenEntityF param);
示例#6
0
partial void Neu_VorImpl(LieferRhythmusOrgEinheitenEntityF paramF);
示例#7
0
partial void Loeschen_NachImpl(LieferRhythmusOrgEinheitenEntityF paramF, LieferRhythmusOrgEinheitenEntityA paramA);
示例#8
0
partial void Loeschen_VorImpl(LieferRhythmusOrgEinheitenEntityF param);
|
{
"url": "https://csharp.hotexamples.com/zh/examples/-/LieferRhythmusOrgEinheitenEntityF/-/php-lieferrhythmusorgeinheitenentityf-class-examples.html",
"source_domain": "csharp.hotexamples.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "95347",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z6QA6QPAV4PQMZ4J4WGEVPPSV2UGYJVO",
"WARC-Concurrent-To": "<urn:uuid:3ebc37e2-7099-4e35-bf52-0027bdf8b54b>",
"WARC-Date": "2023-01-31T06:33:42Z",
"WARC-IP-Address": "104.21.53.239",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WWHH6OSUIRX5A5AVAM7KNDQ74KQA2WAE",
"WARC-Record-ID": "<urn:uuid:b0d5eb1f-3de2-44cb-b2ba-fe98959e9871>",
"WARC-Target-URI": "https://csharp.hotexamples.com/zh/examples/-/LieferRhythmusOrgEinheitenEntityF/-/php-lieferrhythmusorgeinheitenentityf-class-examples.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4baebbe6-6b12-40a0-b09f-2bde6178513f>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-78\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,
5,
7,
29,
52,
75,
130,
197,
331,
341,
439,
440,
533,
567,
568,
595,
643,
686,
729,
730,
731,
829,
830,
831,
929,
930,
1029,
1043,
1063,
1081,
1181,
1182,
1228,
1324,
1366,
1367,
1444,
1565,
1619,
1676,
1763,
1764,
1855,
1877,
2004,
2032,
2176,
2177,
2297,
2419,
2511,
2607,
2770,
2796,
2950,
2976,
3005,
3031,
3129,
3155,
3306,
3332,
3474,
3500,
3529,
3555,
3647,
3673,
3674,
3753,
3754,
3832,
3914,
3998,
4098,
4186,
4187,
4188,
4234,
4260,
4370,
4427,
4428,
4516,
4583,
4613,
4749,
4874,
4928,
4958,
5018,
5118,
5216,
5353,
5494,
5651,
5790,
5791,
5849,
5923,
5949,
5978,
6004,
6099,
6149,
6189,
6215,
6216,
6259,
6287,
6309,
6361,
6399,
6417,
6457,
6475,
6538,
6605,
6647,
6742,
6743,
6775,
6793,
6829,
6847,
6910,
6977,
7019,
7067,
7099,
7117,
7141,
7159,
7204,
7251,
7296,
7343,
7390,
7437,
7455,
7469,
7470,
7568,
7569,
7570,
7662,
7663,
7698,
7722,
7723,
7815,
7825,
7830,
7832,
7854,
7873,
7896,
7951,
8018,
8148,
8158,
8256,
8257,
8350,
8384,
8440,
8441,
8468,
8516,
8559,
8602,
8646,
8647,
8706,
8769,
8770,
8809,
8880,
8940,
8976,
9032,
9046,
9123,
9188,
9228,
9242,
9306,
9320,
9416,
9497,
9537,
9551,
9613,
9627,
9749,
9826,
9865,
9879,
9944,
9958,
10055,
10137,
10177,
10191,
10254,
10268,
10391,
10469,
10508,
10522,
10593,
10607,
10699,
10779,
10819,
10833,
10898,
10912,
10998,
11072,
11112,
11126,
11127,
11183,
11247,
11261,
11304,
11363,
11377,
11378,
11404,
11405,
11503,
11504,
11505,
11603,
11604,
11703,
11717,
11737,
11755,
11855,
11856,
11898,
11994,
12036,
12037,
12122,
12176,
12263,
12376,
12471,
12568,
12650,
12722,
12841,
12911,
13026,
13103,
13179,
13180,
13241,
13307,
13377,
13451,
13527,
13605,
13683,
13763,
13859,
13943,
13944,
13989,
14011,
14117,
14170,
14171,
14279,
14342,
14368,
14500,
14621,
14671,
14697,
14811,
14941,
15075,
15208,
15345,
15498,
15633,
15634,
15688,
15758,
15780,
15852,
15961,
15983,
16084,
16142,
16233,
16330,
16427,
16538,
16637,
16745,
16842,
16955,
17052,
17155,
17247,
17355,
17441,
17544,
17652,
17779,
17865,
17866,
17909,
17974,
18098,
18120,
18168,
18206,
18224,
18264,
18282,
18345,
18412,
18454,
18549,
18550,
18582,
18600,
18636,
18654,
18717,
18784,
18826,
18874,
18906,
18924,
18948,
18966,
19009,
19052,
19097,
19144,
19189,
19236,
19283,
19330,
19348,
19362,
19363,
19461,
19462,
19463,
19555,
19556,
19591,
19615,
19616,
19708,
19718,
19723,
19725,
19747,
19769,
19792,
19847,
19914,
20047,
20057,
20155,
20156,
20249,
20283,
20284,
20311,
20359,
20402,
20445,
20446,
20447,
20545,
20546,
20547,
20645,
20646,
20745,
20759,
20779,
20797,
20897,
20898,
20943,
21039,
21081,
21082,
21168,
21263,
21317,
21404,
21474,
21475,
21550,
21667,
21721,
21808,
21865,
21866,
21969,
22053,
22135,
22219,
22220,
22311,
22333,
22422,
22448,
22574,
22631,
22632,
22729,
22780,
22810,
22941,
23008,
23141,
23178,
23330,
23384,
23428,
23458,
23459,
23583,
23709,
23710,
23784,
23835,
23865,
23961,
24015,
24059,
24089,
24115,
24137,
24188,
24226,
24244,
24284,
24302,
24365,
24432,
24474,
24569,
24570,
24602,
24620,
24656,
24674,
24737,
24804,
24846,
24894,
24926,
24944,
24968,
24986,
25031,
25078,
25123,
25170,
25217,
25264,
25282,
25296,
25297,
25395,
25396,
25397,
25489,
25490,
25525,
25549,
25550,
25642,
25652,
25657,
25659,
25777,
25782,
25784,
25858,
25863,
25865,
25934,
25939,
25941,
26058,
26063,
26065
],
"line_end_idx": [
5,
7,
29,
52,
75,
130,
197,
331,
341,
439,
440,
533,
567,
568,
595,
643,
686,
729,
730,
731,
829,
830,
831,
929,
930,
1029,
1043,
1063,
1081,
1181,
1182,
1228,
1324,
1366,
1367,
1444,
1565,
1619,
1676,
1763,
1764,
1855,
1877,
2004,
2032,
2176,
2177,
2297,
2419,
2511,
2607,
2770,
2796,
2950,
2976,
3005,
3031,
3129,
3155,
3306,
3332,
3474,
3500,
3529,
3555,
3647,
3673,
3674,
3753,
3754,
3832,
3914,
3998,
4098,
4186,
4187,
4188,
4234,
4260,
4370,
4427,
4428,
4516,
4583,
4613,
4749,
4874,
4928,
4958,
5018,
5118,
5216,
5353,
5494,
5651,
5790,
5791,
5849,
5923,
5949,
5978,
6004,
6099,
6149,
6189,
6215,
6216,
6259,
6287,
6309,
6361,
6399,
6417,
6457,
6475,
6538,
6605,
6647,
6742,
6743,
6775,
6793,
6829,
6847,
6910,
6977,
7019,
7067,
7099,
7117,
7141,
7159,
7204,
7251,
7296,
7343,
7390,
7437,
7455,
7469,
7470,
7568,
7569,
7570,
7662,
7663,
7698,
7722,
7723,
7815,
7825,
7830,
7832,
7854,
7873,
7896,
7951,
8018,
8148,
8158,
8256,
8257,
8350,
8384,
8440,
8441,
8468,
8516,
8559,
8602,
8646,
8647,
8706,
8769,
8770,
8809,
8880,
8940,
8976,
9032,
9046,
9123,
9188,
9228,
9242,
9306,
9320,
9416,
9497,
9537,
9551,
9613,
9627,
9749,
9826,
9865,
9879,
9944,
9958,
10055,
10137,
10177,
10191,
10254,
10268,
10391,
10469,
10508,
10522,
10593,
10607,
10699,
10779,
10819,
10833,
10898,
10912,
10998,
11072,
11112,
11126,
11127,
11183,
11247,
11261,
11304,
11363,
11377,
11378,
11404,
11405,
11503,
11504,
11505,
11603,
11604,
11703,
11717,
11737,
11755,
11855,
11856,
11898,
11994,
12036,
12037,
12122,
12176,
12263,
12376,
12471,
12568,
12650,
12722,
12841,
12911,
13026,
13103,
13179,
13180,
13241,
13307,
13377,
13451,
13527,
13605,
13683,
13763,
13859,
13943,
13944,
13989,
14011,
14117,
14170,
14171,
14279,
14342,
14368,
14500,
14621,
14671,
14697,
14811,
14941,
15075,
15208,
15345,
15498,
15633,
15634,
15688,
15758,
15780,
15852,
15961,
15983,
16084,
16142,
16233,
16330,
16427,
16538,
16637,
16745,
16842,
16955,
17052,
17155,
17247,
17355,
17441,
17544,
17652,
17779,
17865,
17866,
17909,
17974,
18098,
18120,
18168,
18206,
18224,
18264,
18282,
18345,
18412,
18454,
18549,
18550,
18582,
18600,
18636,
18654,
18717,
18784,
18826,
18874,
18906,
18924,
18948,
18966,
19009,
19052,
19097,
19144,
19189,
19236,
19283,
19330,
19348,
19362,
19363,
19461,
19462,
19463,
19555,
19556,
19591,
19615,
19616,
19708,
19718,
19723,
19725,
19747,
19769,
19792,
19847,
19914,
20047,
20057,
20155,
20156,
20249,
20283,
20284,
20311,
20359,
20402,
20445,
20446,
20447,
20545,
20546,
20547,
20645,
20646,
20745,
20759,
20779,
20797,
20897,
20898,
20943,
21039,
21081,
21082,
21168,
21263,
21317,
21404,
21474,
21475,
21550,
21667,
21721,
21808,
21865,
21866,
21969,
22053,
22135,
22219,
22220,
22311,
22333,
22422,
22448,
22574,
22631,
22632,
22729,
22780,
22810,
22941,
23008,
23141,
23178,
23330,
23384,
23428,
23458,
23459,
23583,
23709,
23710,
23784,
23835,
23865,
23961,
24015,
24059,
24089,
24115,
24137,
24188,
24226,
24244,
24284,
24302,
24365,
24432,
24474,
24569,
24570,
24602,
24620,
24656,
24674,
24737,
24804,
24846,
24894,
24926,
24944,
24968,
24986,
25031,
25078,
25123,
25170,
25217,
25264,
25282,
25296,
25297,
25395,
25396,
25397,
25489,
25490,
25525,
25549,
25550,
25642,
25652,
25657,
25659,
25777,
25782,
25784,
25858,
25863,
25865,
25934,
25939,
25941,
26058,
26063,
26065,
26137
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 26137,
"ccnet_original_nlines": 502,
"rps_doc_curly_bracket": 0.0032138300593942404,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04010184854269028,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007638449780642986,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5025461316108704,
"rps_doc_frac_unique_words": 0.36954206228256226,
"rps_doc_mean_word_length": 14.55910587310791,
"rps_doc_num_sentences": 519,
"rps_doc_symbol_to_word_ratio": 0.009229790419340134,
"rps_doc_unigram_entropy": 5.326119899749756,
"rps_doc_word_count": 939,
"rps_doc_frac_chars_dupe_10grams": 0.3333333432674408,
"rps_doc_frac_chars_dupe_5grams": 0.4360324740409851,
"rps_doc_frac_chars_dupe_6grams": 0.39111989736557007,
"rps_doc_frac_chars_dupe_7grams": 0.3652256727218628,
"rps_doc_frac_chars_dupe_8grams": 0.3586423695087433,
"rps_doc_frac_chars_dupe_9grams": 0.3416721522808075,
"rps_doc_frac_chars_top_2gram": 0.014044330455362797,
"rps_doc_frac_chars_top_3gram": 0.025674790143966675,
"rps_doc_frac_chars_top_4gram": 0.03357471898198128,
"rps_doc_books_importance": -1272.2520751953125,
"rps_doc_books_importance_length_correction": -1272.2520751953125,
"rps_doc_openwebtext_importance": -771.5435180664062,
"rps_doc_openwebtext_importance_length_correction": -771.5435180664062,
"rps_doc_wikipedia_importance": -716.7265014648438,
"rps_doc_wikipedia_importance_length_correction": -716.7265014648438
},
"fasttext": {
"dclm": 0.9964418411254883,
"english": 0.11984757333993912,
"fineweb_edu_approx": 3.54742693901062,
"eai_general_math": 0.41802966594696045,
"eai_open_web_math": 0.06261187791824341,
"eai_web_code": 0.7344911694526672
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.758",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
6,092,570,450,150,149,000 |
Dibaca: 556
Fungsi JavaScript
Sebuah fungsi adalah sebuah blok kode yang dibuat untuk melakukan suatu tugas tertentu. Sebuah fungsi dijalankan pada saat fungsi itu dipanggil.
Sebuah fungsi dalam bahasa pemrograman adalah sebuah prosedur atau sub rutin yang bisa mengembalikan sebuah nilai atau tidak mengembalikan nilai.
Fungsi digunakan untuk mengurasi penulisan proses yang sering dipakai sehingga cukup ditulis satu kali dan efisiensi dalam penulisan script.
Sintak Fungsi JavaScript
Fungsi JavaScript didefinisikan dengan kata kunci function yang diikuti dengan sebuah nama, kemudian diikuti dengan kurung kurawal ().
Sedangkan kode JavaScript yang akan dieksekusi ditempatkan dalam tanda kurung keriting {}.
Aturan penamaan fungsi adalah sama dengan variabel yaitu berisi huruf, angka, dan garis bawah.
Dalam tanda kurug kurawal () adalah tempat untuk parameter yang dipisahkan dengan koma.
Parameter dalam fungsi ini berfungsi sebagai variabel local pada fungsi.
function nama_fungsi(parameter1, parameter2, parameter3) {
//berisi kode atau script yang akan dijalankan
}
Pemanggilan Fungsi
Seperti disebutkan di atas bahwa sebuah fungsi akan dijalankan atau dieksekusi pada saat fungsi itu dipanggil. Fungsi biasanya dipanggil saat sebuah event terjadi seperti event sebuah tombol diklik atau dipanggil dalam script.
Pengembalian Nilai
Pada fungsi JavaScript, begitu menemukan kata return maka eksekusi fungsi akan berhenti dan kembali ke script pemanggil dan nilai hasil perhitungan atau pemrosesan akan dikembalikan ke pemanggil.
var z = hitungKali(56); //fungsi dipanggil dan hasil dari fungsi disimpan pada var z
function hitungKali(a, b) {
return
a * b; //fungsi mengembalikan nilai hasil perkalian var a dan b = 30
}
|
{
"url": "https://rajatutor.com/content.php?content_url=fungsi-javascript",
"source_domain": "rajatutor.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "8878",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TMJQF6IPHBYLHHJV375V7U3LIVKLPOG6",
"WARC-Concurrent-To": "<urn:uuid:36158743-39e0-45af-9cf8-282eb2635a05>",
"WARC-Date": "2022-10-05T01:28:26Z",
"WARC-IP-Address": "103.7.226.171",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2X5X6H4RU2HPE4TZTVCF3MFHCHT552YF",
"WARC-Record-ID": "<urn:uuid:568fe0e1-f487-4513-9882-4484c8a463e1>",
"WARC-Target-URI": "https://rajatutor.com/content.php?content_url=fungsi-javascript",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3dea6b11-566a-45fc-b444-d4061864e571>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-116\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
12,
13,
31,
32,
177,
178,
324,
325,
466,
467,
469,
470,
495,
496,
631,
632,
723,
724,
819,
820,
908,
981,
982,
1041,
1089,
1091,
1092,
1111,
1112,
1339,
1340,
1359,
1360,
1556,
1557,
1644,
1672,
1679,
1761
],
"line_end_idx": [
12,
13,
31,
32,
177,
178,
324,
325,
466,
467,
469,
470,
495,
496,
631,
632,
723,
724,
819,
820,
908,
981,
982,
1041,
1089,
1091,
1092,
1111,
1112,
1339,
1340,
1359,
1360,
1556,
1557,
1644,
1672,
1679,
1761,
1762
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1762,
"ccnet_original_nlines": 39,
"rps_doc_curly_bracket": 0.0034052201081067324,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.03272727131843567,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14909091591835022,
"rps_doc_frac_unique_words": 0.5085470080375671,
"rps_doc_mean_word_length": 6.141025543212891,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.4177021980285645,
"rps_doc_word_count": 234,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03618650138378143,
"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.04453723132610321,
"rps_doc_frac_chars_top_3gram": 0.01948503963649273,
"rps_doc_frac_chars_top_4gram": 0.02366040088236332,
"rps_doc_books_importance": -115.98770904541016,
"rps_doc_books_importance_length_correction": -107.87577819824219,
"rps_doc_openwebtext_importance": -73.64012145996094,
"rps_doc_openwebtext_importance_length_correction": -73.64012145996094,
"rps_doc_wikipedia_importance": -51.75828552246094,
"rps_doc_wikipedia_importance_length_correction": -48.2430534362793
},
"fasttext": {
"dclm": 0.8659123182296753,
"english": 0.0016893900465220213,
"fineweb_edu_approx": 1.6390999555587769,
"eai_general_math": 0.000023599999622092582,
"eai_open_web_math": 0.8393756747245789,
"eai_web_code": 0.735531747341156
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
6,331,972,908,625,825,000 |
summaryrefslogtreecommitdiff
path: root/bean
diff options
context:
space:
mode:
authorDavid Tardon <[email protected]>2015-02-09 23:50:03 +0100
committerMichael Stahl <[email protected]>2015-02-11 15:12:22 +0000
commit1714d4ce2cc3b1b1d88a4b30ce0abdb7669ecad8 (patch)
tree26bf75cc50625a26e5ebe6ddf8908c8dde6442a9 /bean
parent3e44fcca87fc8e1354d1d735f3a10e388f2f1d0b (diff)
fix liborcus build with gcc 5
(cherry picked from commit 8b68841c1482d98bee98de0a60910b93feb8f8b6) How is that supposed to ever work? (cherry picked from commit a5ec343f6cb522f4d41e097eda48042bf85c4578) ...next attempt at getting this through both GCC 5 and MSVC (cherry picked from commit cdd8ab7e0caa5b6845581afd5fc69bc69b5589df) Change-Id: I38b2ecf86d4334d0179362079a216df4301bf184 Reviewed-on: https://gerrit.libreoffice.org/14416 Tested-by: Michael Stahl <[email protected]> Reviewed-by: Michael Stahl <[email protected]>
Diffstat (limited to 'bean')
0 files changed, 0 insertions, 0 deletions
|
{
"url": "https://cgit.freedesktop.org/libreoffice/core/commit/bean?id=1714d4ce2cc3b1b1d88a4b30ce0abdb7669ecad8",
"source_domain": "cgit.freedesktop.org",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "45013",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BTCEBN644H3GFHKPN6NL5YYVRJP2R4G4",
"WARC-Concurrent-To": "<urn:uuid:9b242736-a498-4fcb-962b-27d9a19557c2>",
"WARC-Date": "2020-09-27T12:23:33Z",
"WARC-IP-Address": "131.252.210.161",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MLZ3KVCDKRVQCDEYN7C4EYBLZRU2PQUM",
"WARC-Record-ID": "<urn:uuid:b52ecf4f-cad5-4878-b583-9bb0b9861f97>",
"WARC-Target-URI": "https://cgit.freedesktop.org/libreoffice/core/commit/bean?id=1714d4ce2cc3b1b1d88a4b30ce0abdb7669ecad8",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ff97e088-df11-47bc-a40d-65f1d1deaea3>"
},
"warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-73.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
29,
45,
58,
67,
74,
80,
145,
213,
268,
319,
373,
403,
900,
929
],
"line_end_idx": [
29,
45,
58,
67,
74,
80,
145,
213,
268,
319,
373,
403,
900,
929,
971
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 971,
"ccnet_original_nlines": 14,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.13218390941619873,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011494250036776066,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4655172526836395,
"rps_doc_frac_unique_words": 0.7790697813034058,
"rps_doc_mean_word_length": 9.534883499145508,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0.005747130140662193,
"rps_doc_unigram_entropy": 4.111567497253418,
"rps_doc_word_count": 86,
"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.0439024418592453,
"rps_doc_frac_chars_top_3gram": 0.0585365891456604,
"rps_doc_frac_chars_top_4gram": 0.08048780262470245,
"rps_doc_books_importance": -91.88986206054688,
"rps_doc_books_importance_length_correction": -91.88986206054688,
"rps_doc_openwebtext_importance": -36.59215545654297,
"rps_doc_openwebtext_importance_length_correction": -22.864791870117188,
"rps_doc_wikipedia_importance": -39.17620849609375,
"rps_doc_wikipedia_importance_length_correction": -39.17620849609375
},
"fasttext": {
"dclm": 0.9502677321434021,
"english": 0.6317043900489807,
"fineweb_edu_approx": 1.0584148168563843,
"eai_general_math": 0.00046539001050405204,
"eai_open_web_math": 0.5704275965690613,
"eai_web_code": 0.00003183000080753118
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "22",
"label": "Truncated"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-1,922,708,452,097,987,800 |
What Is an ADTS File?
How to Open, Edit, & Convert ADTS Files
A file with the ADTS file extension is an Audio Data Transport Stream file. This file format stores sections of an audio file in various frames, each of which include the audio data and header information. AAC files streamed online are often transferred in the ADTS format.
Some ADTS files may be text files from Autodesk's AutoCAD software.
ADTS files in Windows 10 that open with Windows Media Player
Some ADTS files may use the .ADT file extension. However, ADT is also the file extension used for ACT! Document Template files and World of Warcraft Map files.
How to Open an ADTS File
You can play ADTS audio files with Windows Media Player, VLC player, and probably also some other popular media player applications.
Autodesk's AutoCAD software can create ADTS files from an AUDIT command for troubleshooting purposes. These are text-only files that can be opened with a text editor.
Do you have an ADT file? If it's not an audio file, it may be an ACT! Document Template file used with the Swiftpage Act! software. Another possibility is that the ADT file is used with the World of Warcraft game as a format for storing information on objects and maps.
If you find that an application on your PC does try to open the ADTS file but it's the wrong application or if you would rather have another installed program open ADTS files, see our How to Change the Default Program for a Specific File Extension guide for making that change in Windows.
How to Convert an ADTS File
A free file converter like Freemake Video Converter (which supports video and audio formats) can convert an ADTS file to another audio format like MP3, WAV, etc.
AutoCAD ADTS files can be saved to a different text format with a text editor/viewer like Notepad in Windows. If you want an advanced text editor or need to open the ADTS file on a Mac, see our Best Free Text Editors list.
Still Can't Open the File?
If you can't get your file to open with the programs mentioned above, there's a good chance that your file isn't in any of those formats. Instead, what might be happening is that you're confusing a different file for one that ends with .ADTS, which can happen fairly easily if the two share some of the same file extension letters.
For example, ADS files are Ada Specification files that can't open with a music player like Audio Data Transport Stream files. They share some of the same file extension letters as ADTS files but aren't related to any type of audio format.
The same can be said for ATS, TS, TDS, and others that look similar.
If you don't really have an ADTS file, research the file extension that appears after the filename to learn more about the format and which programs are able to open or convert it.
Was this page helpful?
|
{
"url": "https://www.lifewire.com/adts-file-2619508",
"source_domain": "www.lifewire.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "148655",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XQKYHAWLZPIY2X23APXPSJDVPX7E2PGC",
"WARC-Concurrent-To": "<urn:uuid:9ca40189-b190-4e09-aabb-638b10ca4a06>",
"WARC-Date": "2021-09-28T10:34:29Z",
"WARC-IP-Address": "199.232.130.137",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JQDQAYHVH6GPOPR2QLPDWZ44NW6LDLDS",
"WARC-Record-ID": "<urn:uuid:13055696-eb0d-4797-82bd-2688089b8c9f>",
"WARC-Target-URI": "https://www.lifewire.com/adts-file-2619508",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3a3def14-2834-4822-9ca6-ee11c46b149d>"
},
"warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-93\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
22,
23,
63,
64,
338,
339,
407,
408,
469,
470,
630,
631,
656,
657,
790,
791,
958,
959,
1229,
1230,
1519,
1520,
1548,
1549,
1711,
1712,
1935,
1936,
1963,
1964,
2296,
2297,
2537,
2538,
2607,
2608,
2789,
2790
],
"line_end_idx": [
22,
23,
63,
64,
338,
339,
407,
408,
469,
470,
630,
631,
656,
657,
790,
791,
958,
959,
1229,
1230,
1519,
1520,
1548,
1549,
1711,
1712,
1935,
1936,
1963,
1964,
2296,
2297,
2537,
2538,
2607,
2608,
2789,
2790,
2812
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2812,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4051724076271057,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06379310041666031,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11551723629236221,
"rps_doc_frac_unique_words": 0.3840000033378601,
"rps_doc_mean_word_length": 4.453999996185303,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.727995872497559,
"rps_doc_word_count": 500,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.049393799155950546,
"rps_doc_frac_chars_dupe_6grams": 0.03412662819027901,
"rps_doc_frac_chars_dupe_7grams": 0.03412662819027901,
"rps_doc_frac_chars_dupe_8grams": 0.03412662819027901,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02873820997774601,
"rps_doc_frac_chars_top_3gram": 0.02245173044502735,
"rps_doc_frac_chars_top_4gram": 0.021553659811615944,
"rps_doc_books_importance": -226.2763671875,
"rps_doc_books_importance_length_correction": -226.2763671875,
"rps_doc_openwebtext_importance": -163.4498291015625,
"rps_doc_openwebtext_importance_length_correction": -163.4498291015625,
"rps_doc_wikipedia_importance": -92.5333251953125,
"rps_doc_wikipedia_importance_length_correction": -92.5333251953125
},
"fasttext": {
"dclm": 0.16693919897079468,
"english": 0.929501473903656,
"fineweb_edu_approx": 2.605987787246704,
"eai_general_math": 0.47123974561691284,
"eai_open_web_math": 0.2538067698478699,
"eai_web_code": 0.16667509078979492
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "006.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-4,621,038,644,207,443,000 |
VB.NET•Display From Multiple TerraService Tiles
Listing 2. Code for generating display images stitches together adjacent tiles cropped to XOffset and YOffset coordinates into bitmaps of the desired size. You need 12 to 20 invocations of the TerraService's GetTile Web method to complete a 640-by-480-pixel image. The GetTileImage function's code shown doesn't include the instructions that return image properties for display in the ImageData dialog.
Private Function GetTileImage( _
ByVal TS As TS.TerraService, _
ByVal ptCity As TS.LonLatPt, _
ByVal intWidth As Integer, _
ByVal intHeight As Integer) As Bitmap
'Return an AreaBoundingBox by invoking the
'GetAreaFromPt Web method.
'Retrieve the required tiles and draw the image
Try
Dim abbImage As New TS.AreaBoundingBox
If blnIsTopoMap Then
abbImage = TS.GetAreaFromPt( _
ptCity, _tsTheme.Topo, _
_tsScale, intWidth, intHeight)
Else
abbImage = TS.GetAreaFromPt( _
ptCity, tsTheme.Photo, _
tsScale, intWidth, intHeight)
End If
dblLatPoint = ptCity.Lat
dblLonPoint = ptCity.Lon
intOffsetX = _
abbImage.NorthWest.Offset.XOffset
intOffsetY = _
abbImage.NorthWest.Offset.YOffset
'Generate an image that fits the display
'region (640 x 480)
Dim bmpTiles As New Bitmap(intWidth, _
intHeight, pixFormat)
Dim grfImage As Graphics = _
Graphics.FromImage(bmpTiles)
'Get the range of Tile X eastings and Y northings
Dim x1 As Integer = _
abbImage.NorthWest.TileMeta.Id.X
Dim y1 As Integer = _
abbImage.NorthWest.TileMeta.Id.Y
Dim x2 As Integer = _
abbImage.NorthEast.TileMeta.Id.X
Dim y2 As Integer = _
abbImage.SouthWest.TileMeta.Id.Y
Dim x As Integer
For x = x1 To x2
'Loop west to east
Dim y As Integer
intHor = 0
For y = y1 To y2 Step -1
'Loop north to south
Dim tilID As TS.TileId = abbImage.NorthWest. _
TileMeta.Id
tilID.X = x
tilID.Y = y
Dim tilImage As Image = Image.FromStream(New _
MemoryStream( _
TS.GetTile(tilID)))
'Get the image by retrieving
'all tiles specified and
'applying X and Y offsets to the tiled image
grfImage.DrawImage(tilImage, (x - x1) * _
tilImage.Width - abbImage.NorthWest. _
Offset.XOffset, (y1 - y) * tilImage.Height _
- abbImage.NorthWest. _
Offset.YOffset, tilImage.Width, _
tilImage.Height)
tilImage.Dispose()
Next y
Next x
Return bmpTiles
Catch exc As Exception
MessageBox.Show(exc.Message + exc.StackTrace, _
"Error in GetTileImage Function")
End Try
End Function
|
{
"url": "http://archive.visualstudiomagazine.com/2004_08/magazine/features/rjennings/Listing2.aspx",
"source_domain": "archive.visualstudiomagazine.com",
"snapshot_id": "crawl=CC-MAIN-2015-32",
"warc_metadata": {
"Content-Length": "6002",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PG3BDVEBSYLCI36HNSJUPSGXRC2SFSOE",
"WARC-Concurrent-To": "<urn:uuid:aad263a0-17cb-4ba5-9b40-c54b00be1aaa>",
"WARC-Date": "2015-08-01T11:45:57Z",
"WARC-IP-Address": "66.77.93.33",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:6T2QPKGVA23SGCTQJPMBGACVTQQO3HDC",
"WARC-Record-ID": "<urn:uuid:43e2e069-fa51-438f-b0ed-95ddc2156fef>",
"WARC-Target-URI": "http://archive.visualstudiomagazine.com/2004_08/magazine/features/rjennings/Listing2.aspx",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b0aab703-29f5-4d0b-8a40-cc202fccebf9>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-191-2.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-32\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
1,
49,
50,
453,
454,
487,
521,
555,
587,
628,
675,
705,
756,
763,
808,
835,
875,
912,
955,
966,
1006,
1043,
1085,
1098,
1129,
1160,
1181,
1224,
1245,
1288,
1336,
1362,
1407,
1438,
1473,
1511,
1512,
1568,
1596,
1638,
1666,
1708,
1736,
1778,
1806,
1848,
1849,
1872,
1895,
1923,
1949,
1969,
2003,
2036,
2095,
2122,
2146,
2170,
2229,
2260,
2295,
2337,
2375,
2432,
2486,
2540,
2600,
2639,
2688,
2720,
2751,
2767,
2780,
2802,
2828,
2882,
2925,
2936
],
"line_end_idx": [
1,
49,
50,
453,
454,
487,
521,
555,
587,
628,
675,
705,
756,
763,
808,
835,
875,
912,
955,
966,
1006,
1043,
1085,
1098,
1129,
1160,
1181,
1224,
1245,
1288,
1336,
1362,
1407,
1438,
1473,
1511,
1512,
1568,
1596,
1638,
1666,
1708,
1736,
1778,
1806,
1848,
1849,
1872,
1895,
1923,
1949,
1969,
2003,
2036,
2095,
2122,
2146,
2170,
2229,
2260,
2295,
2337,
2375,
2432,
2486,
2540,
2600,
2639,
2688,
2720,
2751,
2767,
2780,
2802,
2828,
2882,
2925,
2936,
2948
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2948,
"ccnet_original_nlines": 78,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10606060922145844,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03787878900766373,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.34659090638160706,
"rps_doc_frac_unique_words": 0.5486111044883728,
"rps_doc_mean_word_length": 6.35069465637207,
"rps_doc_num_sentences": 62,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.6941633224487305,
"rps_doc_word_count": 288,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03936576843261719,
"rps_doc_frac_chars_top_3gram": 0.03171132132411003,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -190.80918884277344,
"rps_doc_books_importance_length_correction": -190.80918884277344,
"rps_doc_openwebtext_importance": -136.7624053955078,
"rps_doc_openwebtext_importance_length_correction": -136.7624053955078,
"rps_doc_wikipedia_importance": -80.76163482666016,
"rps_doc_wikipedia_importance_length_correction": -80.76163482666016
},
"fasttext": {
"dclm": 0.9996294975280762,
"english": 0.5162711143493652,
"fineweb_edu_approx": 3.206998109817505,
"eai_general_math": 0.8612979054450989,
"eai_open_web_math": 0.1945115327835083,
"eai_web_code": 0.8646121025085449
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "910.28",
"labels": {
"level_1": "History and Geography",
"level_2": "Geography and Voyages and travels",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-8,834,542,815,886,006,000 |
Click here to Skip to main content
12,947,539 members (56,490 online)
Click here to Skip to main content
Add your own
alternative version
Stats
172.1K views
620 downloads
82 bookmarked
Posted 8 Jan 2001
Bridge Pattern - Bridging the gap between Interface and Implementation
, 8 Jan 2001
Rate this:
Please Sign up or sign in to vote.
This article discusses the Bridge Pattern, what it is, why and when it is needed.
Introduction
Development, Marketing and Technical Support teams play a vital role in the success of a software product. Development team is of course the backbone of the product, Marketing team plays a key role in selling the product and Technical support team provides after sales support to the customers. Often, I use to think why development team could not provide support. I found the answer only after a very long time. Technical support team should interact with both customers and computers, whereas the development team spends most of their time in hacking computers. So, the members working in both teams should have different mind set and have totally different roles to play. On top of this, the nature of operation in both the teams is mutually exclusive. For example, we can see products having 24 x 7 technical support, whereas the development team hardly works round the clock. The change in the operational strategy in one of the team will not have a direct impact on the other. In short, the technical support team acts as an interface to the product whereas the development team implements the product.
When I was reading the book Design Patterns: Elements of Reusable Object-Oriented Software by Erich Gamma et al. (Addison-Wesley, 1995) written by 'Gang of Four (GoF)', I could relate the above-mentioned scenario with the Bridge Pattern. Separating the technical support team from the development team is similar to isolating the abstraction from implementation. That's what the Bridge Pattern is intended to do. In this article, I will be talking about the Bridge Pattern, what, why and when it is needed. Benefits and drawbacks in using the Bridge Pattern are also presented. The discussion will not be complete without mentioning about the variants and known uses of the Bridge Pattern in popular libraries. Let me start the discussion with a simple programming example.
An Example
Internet is a very good example for proving the fact, "A picture is better than thousand words". When it all started, HTML was just a text based markup language, concentrating mainly on the structure of the document but not its presentation. However, HTML has gone through various revisions to include graphics and images. Now, thousands of web sites, spread all over the Internet, contains GIF and JPEG images. Though GIF and JPEG are popular image formats used on the web, there are hundreds of other image formats such as BMP, PCX, TIFF, TARGA etc., which serve very different purposes and are popular in different operating systems. For example, BMP image format is widely used on Windows operating systems, however its existence is also there on OS/2, Macintosh and UNIX operating systems.
The structure and the representation are two important aspects of an image format. The structure defines the way in which the image is stored and the representation deals with the display of the image. For a given format, the structure remains the same across operating systems, whereas the representation or the way in which the image is displayed may vary between operating systems. For example, the structure of a Windows BMP file remains unchanged in all operating systems, but the mechanism used by the Windows operating system to display a BMP file is different from the one used by Macintosh or OS/2 operating systems to display the same file. On the other hand, for a given operating system, the representation can remain unchanged across different image formats. For example, Windows can display an image represented as a Bitmap object, without having to know about its source format which can be a BMP, a JPEG or a PCX. In short, the representation and the structure of an image format are two different aspects and they should be allowed to vary independently based on the other factors like operating system, hardware etc.
Bridge Pattern classified under the Structural pattern by 'Gang of Four (GoF)' can be used to abstract and model these variations. According to GoF, the Bridge Pattern is intended to "Decouple an abstraction from its implementation so that the two can vary independently". In this article, I will be using the terms used by GoF to explain the Bridge Pattern.
This article uses an Image viewer application to explain the concept behind the Bridge Pattern. This sample application is designed to view BMP files on Windows operating systems. However, it can easily be extended to view other image formats like JPEG on Windows or view BMP images on other operating systems like OS/2.
This example uses two-class hierarchies viz., CImage and CImageImp (see diagram). CImage class hierarchy defines the abstraction for the clients and CImageImp class hierarchy provides implementation for the specified abstraction. CImage and its derived classes are responsible for handling different image formats such as BMP, JPEG, PCX etc., and CImageImp classes are responsible for the representation of the images on different operating systems like Windows, OS/2. The CImage object provides basic services for loading and showing images and it is configured with a CImageImp object. Services that are dependent on a particular implementation (like show) are forwarded to CImageImp class (say to PaintImage). In this way, new image formats can be added to the CImage class hierarchy without affecting the CImageImp and CImageImp can be extended to provide implementation for a new operating system without affecting CImage. In short, the goal of the Bridge Pattern is achieved, that is, to vary abstraction and implementation independently.
Bridge Pattern has four participants that include Abstraction, Refined Abstraction, Implementor and Concrete Implementor. In this example, the abstract image class CImage, is referred as the Abstraction, the concrete image class CBmpImage (for handling Windows Bitmaps) is referred as Refined Abstraction, the abstract image implementation class CImageImp is referred as Implementor and the concrete class CWinImp that implements the interfaces of the Implementor is referred as the Concrete Implementor. The application using the CImage Abstraction is the client. Depending on the operating system, the client can configure the CImage subclass (Refined Abstraction) with a concrete CImageImp class object (Concrete Implementor).
CImage maintains a reference to the CImageImp object. When the client calls Load or Show method in CImage, it does some preprocessing and forwards the request to CImageImp object by calling InitImageInfo or PaintImage method that provides the actual implementation. Isolating the image and image implementation in separate class hierarchies entitles them to vary independently. UML diagram showing the relationship between the participants of the Bridge Pattern is presented below. Listing 1 contains the class declarations and Listing 2 contains sample method implementations.
Benefits in using Bridge Pattern
1. Decoupling abstraction from implementation - Inheritance tightly couples an abstraction with an implementation at compile time. Bridge pattern can be used to avoid the binding between abstraction and implementation and to select the implementation at run time.
2. Reduction in the number of sub classes - Sometimes, using pure inheritance will increase the number of sub classes. Let us assume that the full-blown version of our Image Viewer supports 6 image formats in 3 different operating systems. Pure inheritance would have resulted in 18 sub classes whereas applying Bridge Pattern reduces the sub class requirement only to 9.
3. Cleaner code and Reduction in executable size - In the above example, operating system specific code is encapsulated in CImageImp sub classes. This results in a cleaner code without much preprocessor statements like #ifdefs, #ifndefs. Also, it is easy to conditionally compile CImageImp sub classes for a given operating system to reduce the size of the executable.
4. Interface and implementation can be varied independently - Maintaining two different class hierarchies for interface and implementation entitles to vary one independent of the other.
5. Improved Extensibility - Abstraction and implementation can be extended independently. As mentioned earlier, the above example can easily be extended to view other image formats on Windows or view BMP images on other operating systems.
6. Loosely coupled client code - Abstraction separates the client code from the implementation. So, the implementation can be changed without affecting the client code and the client code need not be compiled when the implementation changes. (NOTE : In the above mentioned example, for the sake of simplicity, the application configures the CImage object with the right CImageImp object. However, alternate methods like Abstract Factory can be adopted to choose the CImageImp object.)
Drawbacks in using Bridge Pattern
1. Double indirection - In the above example, operating system specific methods are implemented by subclasses of CImageImp class. CImage class must delegate the message to a CImageImp subclass which implements the appropriate method. This will have a slight impact on performance.
Variants
Handle/Body
Reference counting is a technique to allow multiple objects with the same value to share a single representation of that value. The advantage of sharing representation reduces the memory overhead in case of large objects. A simple example is a String class, in which multiple objects can share the same String representation. String class is referred to as a Handle class and String representation is referred to as a Body class. Handle class specifies the interface and the Body class maintains a reference count and implements the actual representation. Clients interact with the Body class through the interface specified by the Handle class. Handle/Body separation abstracts the client from implementation changes. This structure is very similar to the Bridge Pattern, however the intent is different.
Degenerate Bridge
Sometimes, there may be only one Implementor class for a given Abstraction. Therefore, an Abstract Implementor class is not needed. This leads to a one to one relationship between Abstraction and Implementor classes. The separation may still be useful to change the Implementor without affecting any of its clients. GoF refers this as Degenerate Bridge Pattern, where there is a one-to-one relationship between Abstraction and Implementor. GoF explains Degenerate Bridge with an example from libg++. Libg++ defines classes that implement common data structures, such as Set, LinkedSet, HashSet, LinkedList, and HashTable. Set is an abstract class that defines a set abstraction, while LinkedList and HashTable are concrete implementors for a linked list and a hash table, respectively. LinkedSet and HashSet are Set implementors that bridge between Set and their concrete counterparts LinkedList and HashTable.
Known Uses
This section presents known uses of Bridge Pattern. Some of the known uses presented in this section are taken from the GoF book on Design Patterns.
MFC and Bridge Pattern
In MFC, the process of storing/retrieving an object to/from a persistence mechanism (like a file) is called Serialization. MFC uses the Bridge Pattern to implement Serialization. CArchive and CFile classes implement object Serialization. CArchive class provides the interface for writing/reading an object to/from a persistence mechanism whereas the CFile and its sub classes provides implementation for different persistence mechanisms such as memory, disk file, sockets etc.
A CArchive object is configured with an object of class CFile (or a derived class) during its construction, from which it obtains the necessary information for serialization, including the filename and type of the requested operation (a read or write). Client performing the Serialization operation can use CArchive object without regarding the persistence mechanism implemented by CFile classes.
Java and Bridge Pattern
Java uses the Bridge Pattern to separate Components and Component Peers. Java applications can run on different platforms, so the client code should be able to create a Component without committing to a concrete implementation. The Components and Component Peers are represented as two different class/interface hierarchies. Every AWT Component sub class has a corresponding Component Peer sub interface with which it can communicate. Platform specific classes implement these Component Peer interfaces.
Other known uses (from GoF book on Design Patterns)
The ET++ Window/WindowPort design extends the Bridge Pattern in that the WindowPort also keeps a reference back to the Window. The WindowPort implementor class uses this reference to notify Window about WindowPort-specific events : the arrival of input events, window resizes, etc.
NeXT's AppKit uses the Bridge Pattern in the implementation and display of graphic images.
Bridge and Strategy
Often, the Strategy Pattern is confused with the Bridge Pattern. Even though, these two patterns are similar in structure, they are trying to solve two different design problems. Strategy is mainly concerned in encapsulating algorithms, whereas Bridge decouples the abstraction from the implementation, to provide different implementation for the same abstraction.
The article Applying Strategy Pattern in C++ Applications talks about the Strategy Pattern in detail.
Bridge and Adapter
The structure of the Adapter Pattern (object adapter) may look similar to the Bridge Pattern. However, the adapter is meant to change the interface of an existing object and is mainly intended to make unrelated classes work together.
Summary
This article not only presented what a Bridge Pattern is but also went into why and when it is really needed. To summarize, pure inheritance hardwires the abstraction and the implementation. Bridge Pattern can be used when an abstraction can have different implementations and when both of them can vary independently.
Acknowledgments
Special thanks to my friend Sree Meenakshi for her helpful suggestions in improving the clarity and presentation of this article.
Listing 1 - CImage and CImageImp class declarations containing important class members
class CImage
{
// Method declarations
public :
virtual INT Load( LPCSTR, CRuntimeClass * ) = 0;
virtual INT Show( CWnd *, WPARAM );
// Data members
protected :
CImageImp * m_pImageImp;
};
class CBmpImage : public CImage
{
// Method declarations
public :
virtual INT Load( LPCSTR, CRuntimeClass * );
};
class CImageImp : public CObject
{
// Method declarations
public :
virtual INT InitImageInfo( LPSTR ) = 0;
virtual BOOL PaintImage( CWnd *, CRect * ) = 0;
// Attributes
public :
LPBYTE m_pImage;
LONG m_lNormalWidth;
LONG m_lNormalHeight;
};
class CWinImp : public CImageImp
{
// Method declarations
public :
INT InitImageInfo( LPSTR );
BOOL PaintImage( CWnd *, CRect * );
// Attributes
protected :
BYTE * m_pBmi;
CPalette * m_pPalette;
};
Listing 2 - Implementation of Show and Load methods of CImage and CBmpImage classes
INT CImage::Show( CWnd * pWnd, WPARAM wParam )
{
// Step 1 - Check and delegate this method to m_pImageImp
ASSERT( m_pImageImp != NULL );
return m_pImageImp->PaintImage( pWnd, ( CRect * ) wParam );
}
INT CBmpImage::Load( LPCSTR lpszFileName, CRuntimeClass * pRuntimeClass )
{
// Some initialization code before creating image implementation object
…
…
// Initialize image information, after creating image implementation object
m_pImageImp = ( CImageImp * ) pRuntimeClass->CreateObject();
if( m_pImageImp == NULL )
{
…
…
return FAILURE;
}
m_pImageImp->InitImageInfo(..);
…
…
return SUCCESS;
}
License
This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.
A list of licenses authors might use can be found here
Share
About the Author
T. Kulathu Sarma
Switzerland Switzerland
Kulathu Sarma is working as a Technology Manager for GoldAvenue, a company based in Geneva, Switzerland and responsible for supporting e-business initiatives of GoldAvenue in B2B and B2C Sectors. He has been programming in C/C++ for 9 years and actively working on Patterns for the past 5 years.
You may also be interested in...
Comments and Discussions
GeneralMy vote of 5 Pin
RDS Chauhan24-Dec-11 6:59
memberRDS Chauhan24-Dec-11 6:59
GeneralMy vote of 5 Pin
zzfima27-Mar-11 2:15
memberzzfima27-Mar-11 2:15
GeneralVisual Studio 2010 ... minor alteration et voila, compiles! Pin
RedDK31-Dec-10 8:56
memberRedDK31-Dec-10 8:56
GeneralMy vote of 2 Pin
400mike28-Nov-09 10:54
member400mike28-Nov-09 10:54
GeneralAbout the benefits Pin
Refky Wahib5-May-07 1:03
memberRefky Wahib5-May-07 1:03
GeneralAn example of communication between specific subclasses. Pin
WREY20-Feb-04 12:50
memberWREY20-Feb-04 12:50
GeneralExtended Bridge to implement reference counting Pin
Jonathan Gilligan10-Jan-01 8:47
memberJonathan Gilligan10-Jan-01 8:47
I use an extended Bridge pattern frequently to implement reference-counted objects (in the context of Coplein's reference-counted idiom). Let's say I have a really heavyweight class (it contains a 100K BLOB) which I want to pass all around in my code. I don't want to make redundant copies but neither do I want to have lots of memory leaks or null pointer references. Moreover, I want to be polymorphic. I want to be able to pass lots of different kinds of objects around like this (details: one such object might a time-series, another might be a spectrogram, etc.) and have them handled appropriately.
I use Bridge to divide the problem into two types of classes:
<pre><br />
class AbstractDataItem;<br />
<br />
class AbstractDataItemImp<br />
{<br />
friend class AbstractDataItem;<br />
<br />
public:<br />
~AbstractDataItemImp() = 0;<br />
unsigned int GetRefCount() const;<br />
protected:<br />
AddRef();<br />
Release();<br />
private:<br />
AbstractDataItemImp();<br />
unsigned int m_uRefCount<br />
};<br />
<br />
class AbstractDataItem<br />
{<br />
public:<br />
AbstractDataItem();<br />
~AbstractDataItem() = 0;<br />
private:<br />
};<br />
<br />
class TimeSeriesDataItem : public AbstractDataItem;<br />
<br />
class TimeSeriesDataItemImp : public AbstractDataItemImp<br />
{<br />
friend class TimeSeriesDataItem;<br />
...<br />
};<br />
<br />
class TimeSeriesDataItem : public AbstractDataItem<br />
{<br />
private:<br />
TimeSeriesDataItem * m_pImp;<br />
public:<br />
TimeSeriesDataItem();<br />
TimeSeriesDataItem(const TimeSeriesDataItem& rhs_);<br />
const TimeSeriesDataItem& operator=(const TimeSeriesDataItem& rhs_);<br />
...<br />
};<br />
<br />
TimeSeriesDataItem::TimeSeriesDataItem()<br />
{<br />
m_pImp = new TimeSeriesDataItemImp;<br />
if (!m_pImp)<br />
HandleMemoryAllocationFailure(__FILE__, __LINE__);<br />
m_pImp.AddRef();<br />
}<br />
<br />
TimeSeriesDataItem::TimeSeriesDataItem(const TimeSeriesDataItem& rhs_)<br />
{<br />
ASSERT(rhs_.m_pImp)<br />
m_pImp = rhs_.m_pImp;<br />
m_pImp.AddRef();<br />
}<br />
<br />
TimeSeriesDataItem::~TimeSeriesDataItem()<br />
{<br />
ASSERT(m_pImp);<br />
m_pImp.Release();<br />
if (m_pImp.GetRefCount() == 0)<br />
delete m_pImp;<br />
}<br />
</pre>
As illustrated above, I derive my concrete data item classes from these two abstract classes, making each DataItem interface class a friend of its DataItemImp implementation class. The constructor of the implementation classes is private (an idea stolen from the GoF Singleton pattern) so only a friend (the interface class) can construct one.
Now I can make lots of lightweight objects that reference the heavyweight object and not worry about memory leaks or null pointer references. The idea here is a bit like that of auto_ptr, but it does reference counting rather than giving up ownership upon assignment. Unlike COM, I don't need to manually AddRef() and Release() when I make copies---the interface class handles that for me.
Key to the bridge concept, I never expose the underlying Imp class, but clone all its methods in the interface class. By building reference counting into the bridge pattern, I can derive many classes from my abstract base classes and pass them around in my code to achieve polymorphism, while keeping the memory load down and relieving myself of worrying about leaks.
One caveat here is that this extension of the Bridge pattern aliases the underlying data and is subject to all the usual concerns about aliasing, so you must carefully think through what you're doing with the data.
GeneralRe: Extended Bridge to implement reference counting Pin
Anonymous18-Jul-02 21:37
memberAnonymous18-Jul-02 21:37
General General News News Suggestion Suggestion Question Question Bug Bug Answer Answer Joke Joke Praise Praise Rant Rant Admin Admin
Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.
Permalink | Advertise | Privacy | Terms of Use | Mobile
Web01 | 2.8.170518.1 | Last Updated 9 Jan 2001
Article Copyright 2001 by T. Kulathu Sarma
Everything else Copyright © CodeProject, 1999-2017
Layout: fixed | fluid
|
{
"url": "https://www.codeproject.com/Articles/890/Bridge-Pattern-Bridging-the-gap-between-Interface?msg=16326&PageFlow=FixedWidth",
"source_domain": "www.codeproject.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "126634",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WVH2S4X5TPO2XDUPG742G2NRD3U3L6KB",
"WARC-Concurrent-To": "<urn:uuid:decc25da-06d9-4ed6-a875-1b0c9b19363c>",
"WARC-Date": "2017-05-24T16:31:44Z",
"WARC-IP-Address": "76.74.234.210",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MIHQG6APJYCCXYLCI2FMQG5CBPA4XCTX",
"WARC-Record-ID": "<urn:uuid:2e4b30b6-7f95-4ba1-8541-0bfb78085a96>",
"WARC-Target-URI": "https://www.codeproject.com/Articles/890/Bridge-Pattern-Bridging-the-gap-between-Interface?msg=16326&PageFlow=FixedWidth",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bbb5f5ed-f203-4ff5-bea4-33c911fecca9>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-224-210.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
35,
70,
105,
118,
138,
139,
145,
146,
159,
173,
187,
205,
206,
277,
278,
291,
302,
337,
419,
420,
433,
434,
1543,
1544,
2318,
2319,
2330,
2331,
3126,
3127,
4262,
4263,
4622,
4623,
4944,
4945,
5990,
5991,
6721,
6722,
7300,
7301,
7334,
7335,
7601,
7602,
7976,
7977,
8348,
8349,
8537,
8538,
8779,
8780,
9267,
9268,
9302,
9303,
9584,
9585,
9594,
9595,
9607,
9608,
10414,
10415,
10433,
10434,
11345,
11346,
11357,
11358,
11507,
11508,
11531,
11532,
12009,
12010,
12407,
12408,
12432,
12433,
12937,
12938,
12990,
12991,
13273,
13274,
13365,
13366,
13386,
13387,
13752,
13753,
13855,
13856,
13875,
13876,
14110,
14111,
14119,
14120,
14439,
14440,
14456,
14457,
14587,
14588,
14675,
14676,
14689,
14691,
14718,
14731,
14791,
14835,
14836,
14856,
14872,
14908,
14911,
14912,
14944,
14946,
14973,
14986,
15039,
15042,
15043,
15076,
15078,
15105,
15118,
15179,
15240,
15241,
15259,
15272,
15302,
15338,
15375,
15378,
15379,
15412,
15414,
15441,
15454,
15497,
15547,
15548,
15566,
15582,
15612,
15646,
15649,
15650,
15734,
15735,
15782,
15784,
15846,
15881,
15945,
15947,
15948,
16022,
16024,
16100,
16106,
16112,
16193,
16258,
16288,
16294,
16304,
16314,
16338,
16344,
16380,
16386,
16392,
16412,
16414,
16415,
16423,
16424,
16628,
16629,
16684,
16685,
16691,
16692,
16709,
16710,
16727,
16751,
17047,
17048,
17081,
17082,
17107,
17108,
17110,
17134,
17160,
17193,
17217,
17238,
17266,
17337,
17357,
17384,
17408,
17431,
17461,
17491,
17516,
17548,
17616,
17636,
17663,
17722,
17754,
17793,
18398,
18399,
18461,
18473,
18503,
18513,
18545,
18553,
18590,
18599,
18613,
18651,
18695,
18712,
18732,
18753,
18768,
18801,
18836,
18845,
18854,
18883,
18891,
18905,
18935,
18970,
18985,
18994,
19003,
19061,
19071,
19134,
19142,
19181,
19191,
19200,
19209,
19266,
19274,
19289,
19328,
19342,
19374,
19436,
19515,
19525,
19534,
19544,
19591,
19599,
19645,
19668,
19733,
19760,
19768,
19778,
19855,
19863,
19893,
19925,
19952,
19960,
19970,
20018,
20026,
20052,
20080,
20121,
20150,
20158,
20165,
20166,
20510,
20511,
20901,
20902,
21270,
21271,
21486,
21549,
21574,
21606,
21607,
21771,
21772,
21883,
21884,
21940,
21987,
22030,
22081
],
"line_end_idx": [
35,
70,
105,
118,
138,
139,
145,
146,
159,
173,
187,
205,
206,
277,
278,
291,
302,
337,
419,
420,
433,
434,
1543,
1544,
2318,
2319,
2330,
2331,
3126,
3127,
4262,
4263,
4622,
4623,
4944,
4945,
5990,
5991,
6721,
6722,
7300,
7301,
7334,
7335,
7601,
7602,
7976,
7977,
8348,
8349,
8537,
8538,
8779,
8780,
9267,
9268,
9302,
9303,
9584,
9585,
9594,
9595,
9607,
9608,
10414,
10415,
10433,
10434,
11345,
11346,
11357,
11358,
11507,
11508,
11531,
11532,
12009,
12010,
12407,
12408,
12432,
12433,
12937,
12938,
12990,
12991,
13273,
13274,
13365,
13366,
13386,
13387,
13752,
13753,
13855,
13856,
13875,
13876,
14110,
14111,
14119,
14120,
14439,
14440,
14456,
14457,
14587,
14588,
14675,
14676,
14689,
14691,
14718,
14731,
14791,
14835,
14836,
14856,
14872,
14908,
14911,
14912,
14944,
14946,
14973,
14986,
15039,
15042,
15043,
15076,
15078,
15105,
15118,
15179,
15240,
15241,
15259,
15272,
15302,
15338,
15375,
15378,
15379,
15412,
15414,
15441,
15454,
15497,
15547,
15548,
15566,
15582,
15612,
15646,
15649,
15650,
15734,
15735,
15782,
15784,
15846,
15881,
15945,
15947,
15948,
16022,
16024,
16100,
16106,
16112,
16193,
16258,
16288,
16294,
16304,
16314,
16338,
16344,
16380,
16386,
16392,
16412,
16414,
16415,
16423,
16424,
16628,
16629,
16684,
16685,
16691,
16692,
16709,
16710,
16727,
16751,
17047,
17048,
17081,
17082,
17107,
17108,
17110,
17134,
17160,
17193,
17217,
17238,
17266,
17337,
17357,
17384,
17408,
17431,
17461,
17491,
17516,
17548,
17616,
17636,
17663,
17722,
17754,
17793,
18398,
18399,
18461,
18473,
18503,
18513,
18545,
18553,
18590,
18599,
18613,
18651,
18695,
18712,
18732,
18753,
18768,
18801,
18836,
18845,
18854,
18883,
18891,
18905,
18935,
18970,
18985,
18994,
19003,
19061,
19071,
19134,
19142,
19181,
19191,
19200,
19209,
19266,
19274,
19289,
19328,
19342,
19374,
19436,
19515,
19525,
19534,
19544,
19591,
19599,
19645,
19668,
19733,
19760,
19768,
19778,
19855,
19863,
19893,
19925,
19952,
19960,
19970,
20018,
20026,
20052,
20080,
20121,
20150,
20158,
20165,
20166,
20510,
20511,
20901,
20902,
21270,
21271,
21486,
21549,
21574,
21606,
21607,
21771,
21772,
21883,
21884,
21940,
21987,
22030,
22081,
22102
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 22102,
"ccnet_original_nlines": 315,
"rps_doc_curly_bracket": 0.0012668500421568751,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32168006896972656,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025402409955859184,
"rps_doc_frac_lines_end_with_ellipsis": 0.022151900455355644,
"rps_doc_frac_no_alph_words": 0.20749497413635254,
"rps_doc_frac_unique_words": 0.2876932919025421,
"rps_doc_mean_word_length": 5.569909572601318,
"rps_doc_num_sentences": 167,
"rps_doc_symbol_to_word_ratio": 0.0030181100592017174,
"rps_doc_unigram_entropy": 5.835057258605957,
"rps_doc_word_count": 3104,
"rps_doc_frac_chars_dupe_10grams": 0.005436980165541172,
"rps_doc_frac_chars_dupe_5grams": 0.09578344970941544,
"rps_doc_frac_chars_dupe_6grams": 0.058418650180101395,
"rps_doc_frac_chars_dupe_7grams": 0.03829023987054825,
"rps_doc_frac_chars_dupe_8grams": 0.01758342981338501,
"rps_doc_frac_chars_dupe_9grams": 0.01758342981338501,
"rps_doc_frac_chars_top_2gram": 0.025565389543771744,
"rps_doc_frac_chars_top_3gram": 0.018508879467844963,
"rps_doc_frac_chars_top_4gram": 0.0041645001620054245,
"rps_doc_books_importance": -2220.751220703125,
"rps_doc_books_importance_length_correction": -2220.751220703125,
"rps_doc_openwebtext_importance": -996.9566040039062,
"rps_doc_openwebtext_importance_length_correction": -996.9566040039062,
"rps_doc_wikipedia_importance": -967.67431640625,
"rps_doc_wikipedia_importance_length_correction": -967.67431640625
},
"fasttext": {
"dclm": 0.1711379885673523,
"english": 0.8570989966392517,
"fineweb_edu_approx": 2.8063058853149414,
"eai_general_math": 0.2880379557609558,
"eai_open_web_math": 0.1248326301574707,
"eai_web_code": 0.2439168095588684
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-1,840,013,234,332,334,300 |
linux/arch/metag/kernel/irq.c
<<
>>
Prefs
1/*
2 * Linux/Meta general interrupt handling code
3 *
4 */
5
6#include <linux/kernel.h>
7#include <linux/interrupt.h>
8#include <linux/init.h>
9#include <linux/irqchip/metag-ext.h>
10#include <linux/irqchip/metag.h>
11#include <linux/irqdomain.h>
12#include <linux/ratelimit.h>
13
14#include <asm/core_reg.h>
15#include <asm/mach/arch.h>
16#include <asm/uaccess.h>
17
18#ifdef CONFIG_4KSTACKS
19union irq_ctx {
20 struct thread_info tinfo;
21 u32 stack[THREAD_SIZE/sizeof(u32)];
22};
23
24static union irq_ctx *hardirq_ctx[NR_CPUS] __read_mostly;
25static union irq_ctx *softirq_ctx[NR_CPUS] __read_mostly;
26#endif
27
28static struct irq_domain *root_domain;
29
30static unsigned int startup_meta_irq(struct irq_data *data)
31{
32 tbi_startup_interrupt(data->hwirq);
33 return 0;
34}
35
36static void shutdown_meta_irq(struct irq_data *data)
37{
38 tbi_shutdown_interrupt(data->hwirq);
39}
40
41void do_IRQ(int irq, struct pt_regs *regs)
42{
43 struct pt_regs *old_regs = set_irq_regs(regs);
44#ifdef CONFIG_4KSTACKS
45 struct irq_desc *desc;
46 union irq_ctx *curctx, *irqctx;
47 u32 *isp;
48#endif
49
50 irq_enter();
51
52 irq = irq_linear_revmap(root_domain, irq);
53
54#ifdef CONFIG_DEBUG_STACKOVERFLOW
55 /* Debugging check for stack overflow: is there less than 1KB free? */
56 {
57 unsigned long sp;
58
59 sp = __core_reg_get(A0StP);
60 sp &= THREAD_SIZE - 1;
61
62 if (unlikely(sp > (THREAD_SIZE - 1024)))
63 pr_err("Stack overflow in do_IRQ: %ld\n", sp);
64 }
65#endif
66
67
68#ifdef CONFIG_4KSTACKS
69 curctx = (union irq_ctx *) current_thread_info();
70 irqctx = hardirq_ctx[smp_processor_id()];
71
72 /*
73 * this is where we switch to the IRQ stack. However, if we are
74 * already using the IRQ stack (because we interrupted a hardirq
75 * handler) we can't do that and just have to keep using the
76 * current stack (which is the irq stack already after all)
77 */
78 if (curctx != irqctx) {
79 /* build the stack frame on the IRQ stack */
80 isp = (u32 *) ((char *)irqctx + sizeof(struct thread_info));
81 irqctx->tinfo.task = curctx->tinfo.task;
82
83 /*
84 * Copy the softirq bits in preempt_count so that the
85 * softirq checks work in the hardirq context.
86 */
87 irqctx->tinfo.preempt_count =
88 (irqctx->tinfo.preempt_count & ~SOFTIRQ_MASK) |
89 (curctx->tinfo.preempt_count & SOFTIRQ_MASK);
90
91 desc = irq_to_desc(irq);
92
93 asm volatile (
94 "MOV D0.5,%0\n"
95 "MOV D1Ar1,%1\n"
96 "MOV D1RtP,%2\n"
97 "MOV D0Ar2,%3\n"
98 "SWAP A0StP,D0.5\n"
99 "SWAP PC,D1RtP\n"
100 "MOV A0StP,D0.5\n"
101 :
102 : "r" (isp), "r" (irq), "r" (desc->handle_irq),
103 "r" (desc)
104 : "memory", "cc", "D1Ar1", "D0Ar2", "D1Ar3", "D0Ar4",
105 "D1Ar5", "D0Ar6", "D0Re0", "D1Re0", "D0.4", "D1RtP",
106 "D0.5"
107 );
108 } else
109#endif
110 generic_handle_irq(irq);
111
112 irq_exit();
113
114 set_irq_regs(old_regs);
115}
116
117#ifdef CONFIG_4KSTACKS
118
119static char softirq_stack[NR_CPUS * THREAD_SIZE] __page_aligned_bss;
120
121static char hardirq_stack[NR_CPUS * THREAD_SIZE] __page_aligned_bss;
122
123/*
124 * allocate per-cpu stacks for hardirq and for softirq processing
125 */
126void irq_ctx_init(int cpu)
127{
128 union irq_ctx *irqctx;
129
130 if (hardirq_ctx[cpu])
131 return;
132
133 irqctx = (union irq_ctx *) &hardirq_stack[cpu * THREAD_SIZE];
134 irqctx->tinfo.task = NULL;
135 irqctx->tinfo.exec_domain = NULL;
136 irqctx->tinfo.cpu = cpu;
137 irqctx->tinfo.preempt_count = HARDIRQ_OFFSET;
138 irqctx->tinfo.addr_limit = MAKE_MM_SEG(0);
139
140 hardirq_ctx[cpu] = irqctx;
141
142 irqctx = (union irq_ctx *) &softirq_stack[cpu * THREAD_SIZE];
143 irqctx->tinfo.task = NULL;
144 irqctx->tinfo.exec_domain = NULL;
145 irqctx->tinfo.cpu = cpu;
146 irqctx->tinfo.preempt_count = 0;
147 irqctx->tinfo.addr_limit = MAKE_MM_SEG(0);
148
149 softirq_ctx[cpu] = irqctx;
150
151 pr_info("CPU %u irqstacks, hard=%p soft=%p\n",
152 cpu, hardirq_ctx[cpu], softirq_ctx[cpu]);
153}
154
155void irq_ctx_exit(int cpu)
156{
157 hardirq_ctx[smp_processor_id()] = NULL;
158}
159
160extern asmlinkage void __do_softirq(void);
161
162asmlinkage void do_softirq(void)
163{
164 unsigned long flags;
165 struct thread_info *curctx;
166 union irq_ctx *irqctx;
167 u32 *isp;
168
169 if (in_interrupt())
170 return;
171
172 local_irq_save(flags);
173
174 if (local_softirq_pending()) {
175 curctx = current_thread_info();
176 irqctx = softirq_ctx[smp_processor_id()];
177 irqctx->tinfo.task = curctx->task;
178
179 /* build the stack frame on the softirq stack */
180 isp = (u32 *) ((char *)irqctx + sizeof(struct thread_info));
181
182 asm volatile (
183 "MOV D0.5,%0\n"
184 "SWAP A0StP,D0.5\n"
185 "CALLR D1RtP,___do_softirq\n"
186 "MOV A0StP,D0.5\n"
187 :
188 : "r" (isp)
189 : "memory", "cc", "D1Ar1", "D0Ar2", "D1Ar3", "D0Ar4",
190 "D1Ar5", "D0Ar6", "D0Re0", "D1Re0", "D0.4", "D1RtP",
191 "D0.5"
192 );
193 /*
194 * Shouldn't happen, we returned above if in_interrupt():
195 */
196 WARN_ON_ONCE(softirq_count());
197 }
198
199 local_irq_restore(flags);
200}
201#endif
202
203static struct irq_chip meta_irq_type = {
204 .name = "META-IRQ",
205 .irq_startup = startup_meta_irq,
206 .irq_shutdown = shutdown_meta_irq,
207};
208
209/**
210 * tbisig_map() - Map a TBI signal number to a virtual IRQ number.
211 * @hw: Number of the TBI signal. Must be in range.
212 *
213 * Returns: The virtual IRQ number of the TBI signal number IRQ specified by
214 * @hw.
215 */
216int tbisig_map(unsigned int hw)
217{
218 return irq_create_mapping(root_domain, hw);
219}
220
221/**
222 * metag_tbisig_map() - map a tbi signal to a Linux virtual IRQ number
223 * @d: root irq domain
224 * @irq: virtual irq number
225 * @hw: hardware irq number (TBI signal number)
226 *
227 * This sets up a virtual irq for a specified TBI signal number.
228 */
229static int metag_tbisig_map(struct irq_domain *d, unsigned int irq,
230 irq_hw_number_t hw)
231{
232#ifdef CONFIG_SMP
233 irq_set_chip_and_handler(irq, &meta_irq_type, handle_percpu_irq);
234#else
235 irq_set_chip_and_handler(irq, &meta_irq_type, handle_simple_irq);
236#endif
237 return 0;
238}
239
240static const struct irq_domain_ops metag_tbisig_domain_ops = {
241 .map = metag_tbisig_map,
242};
243
244/*
245 * void init_IRQ(void)
246 *
247 * Parameters: None
248 *
249 * Returns: Nothing
250 *
251 * This function should be called during kernel startup to initialize
252 * the IRQ handling routines.
253 */
254void __init init_IRQ(void)
255{
256 root_domain = irq_domain_add_linear(NULL, 32,
257 &metag_tbisig_domain_ops, NULL);
258 if (unlikely(!root_domain))
259 panic("init_IRQ: cannot add root IRQ domain");
260
261 irq_ctx_init(smp_processor_id());
262
263 init_internal_IRQ();
264 init_external_IRQ();
265
266 if (machine_desc->init_irq)
267 machine_desc->init_irq();
268}
269
270int __init arch_probe_nr_irqs(void)
271{
272 if (machine_desc->nr_irqs)
273 nr_irqs = machine_desc->nr_irqs;
274 return 0;
275}
276
277#ifdef CONFIG_HOTPLUG_CPU
278static void route_irq(struct irq_data *data, unsigned int irq, unsigned int cpu)
279{
280 struct irq_desc *desc = irq_to_desc(irq);
281 struct irq_chip *chip = irq_data_get_irq_chip(data);
282 unsigned long flags;
283
284 raw_spin_lock_irqsave(&desc->lock, flags);
285 if (chip->irq_set_affinity)
286 chip->irq_set_affinity(data, cpumask_of(cpu), false);
287 raw_spin_unlock_irqrestore(&desc->lock, flags);
288}
289
290/*
291 * The CPU has been marked offline. Migrate IRQs off this CPU. If
292 * the affinity settings do not allow other CPUs, force them onto any
293 * available CPU.
294 */
295void migrate_irqs(void)
296{
297 unsigned int i, cpu = smp_processor_id();
298 struct irq_desc *desc;
299
300 for_each_irq_desc(i, desc) {
301 struct irq_data *data = irq_desc_get_irq_data(desc);
302 unsigned int newcpu;
303
304 if (irqd_is_per_cpu(data))
305 continue;
306
307 if (!cpumask_test_cpu(cpu, data->affinity))
308 continue;
309
310 newcpu = cpumask_any_and(data->affinity, cpu_online_mask);
311
312 if (newcpu >= nr_cpu_ids) {
313 pr_info_ratelimited("IRQ%u no longer affine to CPU%u\n",
314 i, cpu);
315
316 cpumask_setall(data->affinity);
317 newcpu = cpumask_any_and(data->affinity,
318 cpu_online_mask);
319 }
320
321 route_irq(data, i, newcpu);
322 }
323}
324#endif /* CONFIG_HOTPLUG_CPU */
325
|
{
"url": "https://lxr.linux.no/linux+v3.11.8/arch/metag/kernel/irq.c",
"source_domain": "lxr.linux.no",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "289526",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YXR6HPDANMJC4RJJCR52YXXFG3CMFWRU",
"WARC-Concurrent-To": "<urn:uuid:0decdb2e-eabf-44c8-85fe-09c51cf3730b>",
"WARC-Date": "2024-06-25T22:12:47Z",
"WARC-IP-Address": "88.99.250.55",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QWJPWAYGIPJHEEJHI5MY3YBR5AQZYIQ5",
"WARC-Record-ID": "<urn:uuid:46a659b7-c11d-4e70-a508-46fd3731f846>",
"WARC-Target-URI": "https://lxr.linux.no/linux+v3.11.8/arch/metag/kernel/irq.c",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9f5242a5-6167-4d54-9720-85229d2f1637>"
},
"warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-32\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,
30,
33,
36,
42,
49,
99,
106,
114,
119,
149,
182,
210,
251,
288,
321,
354,
359,
389,
420,
449,
454,
481,
501,
544,
612,
619,
624,
686,
748,
759,
764,
807,
812,
876,
882,
930,
952,
958,
963,
1020,
1026,
1075,
1081,
1086,
1133,
1139,
1198,
1225,
1260,
1304,
1326,
1337,
1342,
1367,
1372,
1427,
1432,
1470,
1553,
1567,
1605,
1610,
1658,
1701,
1706,
1767,
1842,
1856,
1867,
1872,
1877,
1904,
1966,
2020,
2025,
2040,
2116,
2193,
2266,
2338,
2354,
2390,
2455,
2536,
2597,
2602,
2625,
2699,
2766,
2790,
2840,
2916,
2990,
2995,
3040,
3045,
3080,
3126,
3173,
3220,
3267,
3316,
3363,
3412,
3442,
3518,
3559,
3641,
3724,
3761,
3792,
3811,
3822,
3867,
3872,
3896,
3901,
3937,
3943,
3948,
3975,
3980,
4053,
4058,
4131,
4136,
4143,
4213,
4221,
4252,
4258,
4293,
4298,
4332,
4360,
4365,
4439,
4491,
4543,
4594,
4656,
4718,
4723,
4762,
4767,
4841,
4893,
4945,
4996,
5045,
5107,
5112,
5151,
5156,
5215,
5277,
5283,
5288,
5319,
5325,
5377,
5383,
5388,
5435,
5440,
5477,
5483,
5516,
5556,
5591,
5613,
5618,
5650,
5678,
5683,
5718,
5723,
5766,
5818,
5880,
5935,
5940,
6009,
6090,
6095,
6130,
6176,
6225,
6283,
6332,
6362,
6402,
6484,
6567,
6604,
6635,
6658,
6736,
6760,
6811,
6825,
6830,
6868,
6874,
6885,
6890,
6935,
6967,
7012,
7059,
7066,
7071,
7079,
7150,
7214,
7221,
7306,
7331,
7339,
7375,
7381,
7437,
7443,
7448,
7456,
7531,
7567,
7606,
7666,
7673,
7742,
7750,
7822,
7874,
7880,
7902,
7980,
7990,
8068,
8079,
8101,
8107,
8112,
8179,
8216,
8223,
8228,
8235,
8262,
8269,
8294,
8301,
8329,
8336,
8410,
8444,
8452,
8483,
8489,
8547,
8628,
8668,
8735,
8740,
8786,
8791,
8824,
8857,
8862,
8902,
8948,
8954,
8959,
8999,
9005,
9044,
9097,
9119,
9125,
9130,
9160,
9245,
9251,
9305,
9370,
9403,
9408,
9463,
9503,
9577,
9637,
9643,
9648,
9655,
9727,
9801,
9823,
9831,
9859,
9865,
9919,
9954,
9959,
10000,
10073,
10114,
10119,
10166,
10204,
10209,
10273,
10311,
10316,
10395,
10400,
10448,
10533,
10590,
10595,
10655,
10724,
10795,
10817,
10822,
10870,
10884,
10890,
10926
],
"line_end_idx": [
30,
33,
36,
42,
49,
99,
106,
114,
119,
149,
182,
210,
251,
288,
321,
354,
359,
389,
420,
449,
454,
481,
501,
544,
612,
619,
624,
686,
748,
759,
764,
807,
812,
876,
882,
930,
952,
958,
963,
1020,
1026,
1075,
1081,
1086,
1133,
1139,
1198,
1225,
1260,
1304,
1326,
1337,
1342,
1367,
1372,
1427,
1432,
1470,
1553,
1567,
1605,
1610,
1658,
1701,
1706,
1767,
1842,
1856,
1867,
1872,
1877,
1904,
1966,
2020,
2025,
2040,
2116,
2193,
2266,
2338,
2354,
2390,
2455,
2536,
2597,
2602,
2625,
2699,
2766,
2790,
2840,
2916,
2990,
2995,
3040,
3045,
3080,
3126,
3173,
3220,
3267,
3316,
3363,
3412,
3442,
3518,
3559,
3641,
3724,
3761,
3792,
3811,
3822,
3867,
3872,
3896,
3901,
3937,
3943,
3948,
3975,
3980,
4053,
4058,
4131,
4136,
4143,
4213,
4221,
4252,
4258,
4293,
4298,
4332,
4360,
4365,
4439,
4491,
4543,
4594,
4656,
4718,
4723,
4762,
4767,
4841,
4893,
4945,
4996,
5045,
5107,
5112,
5151,
5156,
5215,
5277,
5283,
5288,
5319,
5325,
5377,
5383,
5388,
5435,
5440,
5477,
5483,
5516,
5556,
5591,
5613,
5618,
5650,
5678,
5683,
5718,
5723,
5766,
5818,
5880,
5935,
5940,
6009,
6090,
6095,
6130,
6176,
6225,
6283,
6332,
6362,
6402,
6484,
6567,
6604,
6635,
6658,
6736,
6760,
6811,
6825,
6830,
6868,
6874,
6885,
6890,
6935,
6967,
7012,
7059,
7066,
7071,
7079,
7150,
7214,
7221,
7306,
7331,
7339,
7375,
7381,
7437,
7443,
7448,
7456,
7531,
7567,
7606,
7666,
7673,
7742,
7750,
7822,
7874,
7880,
7902,
7980,
7990,
8068,
8079,
8101,
8107,
8112,
8179,
8216,
8223,
8228,
8235,
8262,
8269,
8294,
8301,
8329,
8336,
8410,
8444,
8452,
8483,
8489,
8547,
8628,
8668,
8735,
8740,
8786,
8791,
8824,
8857,
8862,
8902,
8948,
8954,
8959,
8999,
9005,
9044,
9097,
9119,
9125,
9130,
9160,
9245,
9251,
9305,
9370,
9403,
9408,
9463,
9503,
9577,
9637,
9643,
9648,
9655,
9727,
9801,
9823,
9831,
9859,
9865,
9919,
9954,
9959,
10000,
10073,
10114,
10119,
10166,
10204,
10209,
10273,
10311,
10316,
10395,
10400,
10448,
10533,
10590,
10595,
10655,
10724,
10795,
10817,
10822,
10870,
10884,
10890,
10926,
10930
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10930,
"ccnet_original_nlines": 328,
"rps_doc_curly_bracket": 0.003659649984911084,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08090118318796158,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.039426520466804504,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5581157207489014,
"rps_doc_frac_unique_words": 0.6488706469535828,
"rps_doc_mean_word_length": 6.023613929748535,
"rps_doc_num_sentences": 57,
"rps_doc_symbol_to_word_ratio": 0.012800820171833038,
"rps_doc_unigram_entropy": 6.110785961151123,
"rps_doc_word_count": 974,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04670188948512077,
"rps_doc_frac_chars_dupe_6grams": 0.03988410159945488,
"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.014999150298535824,
"rps_doc_frac_chars_top_3gram": 0.0074995700269937515,
"rps_doc_frac_chars_top_4gram": 0.006136009935289621,
"rps_doc_books_importance": -877.3192138671875,
"rps_doc_books_importance_length_correction": -877.3192138671875,
"rps_doc_openwebtext_importance": -510.1268310546875,
"rps_doc_openwebtext_importance_length_correction": -510.1268310546875,
"rps_doc_wikipedia_importance": -410.1522521972656,
"rps_doc_wikipedia_importance_length_correction": -410.1522521972656
},
"fasttext": {
"dclm": 0.9552763104438782,
"english": 0.279161274433136,
"fineweb_edu_approx": 2.9617114067077637,
"eai_general_math": 0.48647403717041016,
"eai_open_web_math": 0.1909201741218567,
"eai_web_code": 0.8737758994102478
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.229",
"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
|
-8,274,488,110,393,780,000 |
#! /usr/bin/env bash # Bootstrap build2 Build OS. # # Assumptions/expectations: # # - host debootstrap/debian-archive-keyring matching release # # - /btrfs/ is a btrfs directory where the current user can create # snapshots # # - sudo is passwordless (used to run debootstrap, systemd-nspawn, etc) # # Options: # # --stage # Jump straigh to stage by clonning the previous stage snapshot. # Stages are: # # 1 - bootstrap phase 1 # 2 - bootstrap phase 2 # 3 - kernel build # 4 - setup # 5 - create footfs # 6 - create kernel image and initrd # usage="usage: $0" macaddr="de:ad:be:ef:b8:da" # @@ TMP mac address for testing. id="$(id -un)" btrfs=/btrfs root="$btrfs/$id/buildos" # Source distribution and packages. Base packages are installed on stage 1 via # debootstrap. Extra packages are added on stage 4 via apt-get install. The # idea is to be able to add extra packages without upgrading the base system. # When we do upgrade the base system we normally move the extras to base. # # Notes: # # - some packages (such as CPU microcode updates) are in non-free. # - systemd-container seems to be required by host systemd-nspawn. # - not installing linux-image-amd64 since building custom below # release="testing" components="main,contrib,non-free" mirror="http://deb.debian.org/debian/" #mirror="https://deb.debian.org/debian/" base_pkgs="locales,klibc-utils,sudo,systemd-container,udev" base_pkgs+=",kmod,linux-base,firmware-linux-free,irqbalance" base_pkgs+=",intel-microcode,amd64-microcode" base_pkgs+=",pciutils,usbutils,dmidecode,cpuid" base_pkgs+=",hdparm,btrfs-progs" base_pkgs+=",lm-sensors,smartmontools" base_pkgs+=",psmisc" base_pkgs+=",net-tools,iproute2,iptables,isc-dhcp-client" base_pkgs+=",ifupdown,bridge-utils,dnsmasq,ntp,postfix" base_pkgs+=",iputils-ping,wget,curl,ca-certificates" base_pkgs+=",openssh-client,openssh-server" base_pkgs+=",tftp-hpa,tftpd-hpa" base_pkgs+=",bzip2,xz-utils" base_pkgs+=",less,nano,time" base_pkgs+=",qemu-kvm,qemu-utils,socat" base_pkgs+=",g++,make,pkg-config" extra_pkgs="linux-cpupower" owd="$(pwd)" trap "{ cd '$owd'; exit 1; }" ERR set -o errtrace # Trap in functions. function info () { echo "$*" 1>&2; } function error () { info "$*"; exit 1; } stage="1" stage_max="6" while [ "$#" -gt 0 ]; do case "$1" in --stage) shift stage="$1" shift ;; -*) error "unknown option: $1" ;; *) break ;; esac done if [ "$stage" -lt "1" -o "$stage" -gt "$stage_max" ]; then error "invalid stage number $stage" fi # Extract version. # version="$(sed -n -re 's/^version: ([0-9]+\.[0-9]+\.[0-9]+).*$/\1/p' ./manifest)" version_id="$(sed -n -re 's/^([0-9]+\.[0-9]+)\.[0-9]+$/\1/p' <<<"$version")" if [ -z "$version" -o -z "$version_id" ]; then error "unable to extract version from manifest" fi # Btrfs subvolume manipulation. # function subvol_delete () # { # The subvol show (just as list) needs root. # if sudo btrfs subvol show "$1" 1>/dev/null 2>&1; then btrfs property set -ts "$1" ro false btrfs subvol delete "$1" fi } function subvol_create () # { btrfs subvol create "$@" } function subvol_snapshot () # [-r] { btrfs subvol snapshot "$@" } # Clean up the working subvolume and all the snapshots starting from the # requested stage. Also, if stage is not 1, then restore the working subvolume # from the previous stage snapshot. # subvol_delete "$root" for i in $(seq "$stage" "$stage_max"); do subvol_delete "$root-$i" done if [ "$stage" -gt "1" ]; then i="$(($stage - 1))" info "restoring working subvolume from stage $i snapshot" subvol_snapshot "$root-$i" "$root" fi # Spawn a systemd namespace container (systemd-nspawn) # function nspawn () # { local r="$1" shift sudo systemd-nspawn --register=no -D "$r" "$@" # systemd-nspawn may create the /var/lib/machines subvolume which prevents # the deletion of the containing submodule. So we clean it up. # if sudo btrfs subvol show "$r/var/lib/machines" 1>/dev/null 2>&1; then sudo btrfs subvol delete "$r/var/lib/machines" fi } # (Over)write or append to a file in the installation root, for example: # # write <<<'localhost' /etc/hostname # function write () # [] { local r="$2" if [ -z "$r" ]; then r="$root" fi sudo tee "$r$1" >/dev/null } function append () # [] { local r="$2" if [ -z "$r" ]; then r="$root" fi sudo tee -a "$r$1" >/dev/null } # Stage 1: debootstrap, phase 1. # if [ "$stage" -eq "1" ]; then subvol_create "$root" sudo debootstrap \ --foreign \ --arch=amd64 \ --merged-usr \ --variant=minbase \ --components="$components" \ --include="$base_pkgs" \ "$release" "$root" "$mirror" # Post-phase 1 fixups. # # Set the initial hostname to 'localhost'. This value is detected and # overriden by /sbin/dhclient-script if the DHCP server sends host-name. # write <<<'localhost' /etc/hostname # Set timezone to UTC (picked up by tzdata package during stage 2). # write <<<'Etc/UTC' /etc/timezone subvol_snapshot -r "$root" "$root-1" fi # Stage 2: debootstrap, phase 2. # if [ "$stage" -le "2" ]; then # Create a bootstrap script that will finish the bootstrap from within the # installation via systemd-nspawn. # sudo mkdir "$root/bootstrap" write <&2 bash exit 1 fi rm -f /etc/localtime cp /usr/share/zoneinfo/UTC /etc/localtime chattr +i /etc/localtime # Change /etc/os-release, /etc/issue, /etc/motd. # cat </etc/os-release NAME="Build OS" VERSION="$version" ID=buildos ID_LIKE=debian PRETTY_NAME="Build OS $version (Based on Debian)" VERSION_ID="$version_id" HOME_URL="https://build2.org/" SUPPORT_URL="https://lists.build2.org/" BUG_REPORT_URL="https://lists.build2.org/" EOF1 cat </etc/issue Build OS $version (Based on Debian) \n \l EOF1 cat </etc/motd Welcome to Build OS $version (https://build2.org)! EOF1 # Make root login passwordless (we disable SSH root login in init). # passwd -d root # Enable IPv4 forwarding (used for private bridge NAT). # sed -i -e 's/^# *\(net.ipv4.ip_forward\).*/\1=1/' /etc/sysctl.conf # Setup locale. We only support en_US.UTF-8. # sed -i -e 's/^# *\(en_US.UTF-8\)/\1/' /etc/locale.gen locale-gen --purge cat </etc/default/locale LANG="en_US.UTF-8" LANGUAGE="en_US:en" EOF1 EOF sudo chmod u+x "$root/bootstrap/bootstrap" # Notes: # # - Failed to create directory .../sys/fs/selinux: Read-only file system is # harmless and fixed upstream (systemd issue#3748). # nspawn "$root" /bootstrap/bootstrap subvol_snapshot -r "$root" "$root-2" fi # Stage 3: kernel build. # if [ "$stage" -le "3" ]; then # Create the setup service that will be used by both this stage and the # setup stage below. Note that we will do actual building (which requires # installing extra packages) in a snapshot on the side. # sudo mkdir -p "$root/bootstrap" # Note that when started via systemd-nspawn, we get /dev/console, not # /dev/tty0. # write </dev/console 1>&0 2>&1" # subvol_delete "$root-3-kernel" subvol_snapshot "$root" "$root-3-kernel" write <linux/.config cd linux # Adjust configuration. # echo 'CONFIG_SYSTEM_TRUSTED_KEYS=""' >>.config echo 'CONFIG_BUILD_SALT=""' >>.config echo 'CONFIG_MODULE_SIG=n' >>.config # Adjust kernel command line size limit. # sed -i -re 's/^(#define COMMAND_LINE_SIZE ).+\$/\1 4096/' arch/x86/include/asm/setup.h make oldconfig scripts/config --disable DEBUG_INFO make clean make deb-pkg LOCALVERSION=-buildos KDEB_PKGVERSION=1 -j 8 # Clean up and shutdown. # rm /bootstrap/setup systemctl poweroff EOF sudo chmod u+x "$root-3-kernel/bootstrap/setup" nspawn "$root-3-kernel" --boot # Copy the kernel over and install it. # sudo cp "$root-3-kernel/usr/src/linux-image-"*.deb "$root/usr/src/" write </etc/sudoers.d/build echo "Defaults:build !syslog" >>/etc/sudoers.d/build chmod 0440 /etc/sudoers.d/build # Clean up package cache. # apt-get clean # Clean up /bootstrap. # rm /etc/systemd/system/multi-user.target.wants/buildos-setup.service rm /usr/lib/systemd/system/buildos-setup.service rm -r /bootstrap # Shutdown. # systemctl poweroff EOF sudo chmod u+x "$root/bootstrap/setup" nspawn "$root" --boot subvol_snapshot -r "$root" "$root-4" fi # Stage 5: generate rootfs. # if [ "$stage" -le "5" ]; then # Note that there is also initramfs image that is embedded into kernel. In # Debian it contains just /dev/console and /root/. # # Quite a few files/directories are only accessible by root (e.g., /root) so # we run under sudo. # root_dirs="build dev etc mnt root usr var" root_links="bin sbin lib lib32 lib64" info "generating buildos-rootfs.cpio.gz..." cd "$root" sudo find $root_dirs $root_links -print0 | \ sudo cpio --null -o -H newc | \ gzip -9 > "$owd/buildos-rootfs.cpio.gz" cd "$owd" subvol_snapshot -r "$root" "$root-5" fi # Stage 6: generate initrd. # if [ "$stage" -le "6" ]; then # Generate buildid and store it in /etc/os-release and in buildos-buildid. # These are used by the monitor to detect when it's time to reboot. # # Note that /etc/os-release is a symlink to /usr/lib/os-release. # buildid="$(uuidgen)" sudo tee -a "$root/etc/os-release" >/dev/null <<<"BUILD_ID=\"$buildid\"" # Install init and buildos monitor. # sudo install -m 755 ./init "$root/" sudo install -m 755 ./buildos "$root/usr/sbin/" sudo install -m 644 ./buildos.service "$root/usr/lib/systemd/system/" sudo ln -sf "$root/usr/lib/systemd/system/buildos.service" \ "$root/etc/systemd/system/multi-user.target.wants/buildos.service" info "generating buildos-init.cpio.gz..." cd "$root" sudo cpio -o -H newc < "$owd/buildos-init.cpio.gz" usr/lib/os-release init usr/sbin/buildos usr/lib/systemd/system/buildos.service etc/systemd/system/multi-user.target.wants/buildos.service EOF cd "$owd" cat buildos-rootfs.cpio.gz buildos-init.cpio.gz >buildos-initrd # Copy the kernel image next to the initramfs for convenience. # cp "$root/vmlinuz" buildos-image echo "$buildid" >buildos-buildid subvol_snapshot -r "$root" "$root-6" fi exit 0 # Test. # if [ ! -e /tmp/buildos-state ]; then qemu-img create -f raw /tmp/buildos-state 20M fi if [ ! -e /tmp/buildos-machines ]; then qemu-img create -f raw /tmp/buildos-machines 100M fi # To test PXE boot, replace -kernel/-initrd/-append with '-boot n'. # sudo kvm \ -m 16G \ -cpu host -smp "sockets=1,cores=4,threads=2" \ -device "e1000,netdev=net0,mac=$macaddr" \ -netdev "tap,id=net0,script=./qemu-ifup" \ -device "virtio-scsi-pci,id=scsi" \ -device "scsi-hd,drive=disk1" \ -drive "if=none,id=disk1,file=/tmp/buildos-state,format=raw" \ -device "scsi-hd,drive=disk2" \ -drive "if=none,id=disk2,file=/tmp/buildos-machines,format=raw" \ -boot n # -kernel buildos-image -initrd buildos-initrd \ # -append "buildos.smtp_relay=build2.org [email protected]"
|
{
"url": "https://cgit.build2.org/cgit/buildos/plain/bootstrap",
"source_domain": "cgit.build2.org",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "14676",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VK3MS6U7CTGZ2N7YNNVPIYEBLGDTPZKZ",
"WARC-Concurrent-To": "<urn:uuid:1fd73dfe-37d0-4629-a683-b13bf2b55404>",
"WARC-Date": "2020-07-10T02:52:41Z",
"WARC-IP-Address": "158.69.207.180",
"WARC-Identified-Payload-Type": "text/plain",
"WARC-Payload-Digest": "sha1:N7C27RRW3XDG4WMKSZY63BQNPP7IALB7",
"WARC-Record-ID": "<urn:uuid:0e10a3c0-3962-4c36-bcd8-f43ca47436ee>",
"WARC-Target-URI": "https://cgit.build2.org/cgit/buildos/plain/bootstrap",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:81369f6f-7b5e-4961-8e56-3d59457b70d6>"
},
"warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-116.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
10463
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10463,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.0017203500028699636,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12508760392665863,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01786966063082218,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4740714728832245,
"rps_doc_frac_unique_words": 0.4407374858856201,
"rps_doc_mean_word_length": 6.435469627380371,
"rps_doc_num_sentences": 131,
"rps_doc_symbol_to_word_ratio": 0.05185703933238983,
"rps_doc_unigram_entropy": 5.743093013763428,
"rps_doc_word_count": 1139,
"rps_doc_frac_chars_dupe_10grams": 0.007912689819931984,
"rps_doc_frac_chars_dupe_5grams": 0.03383355960249901,
"rps_doc_frac_chars_dupe_6grams": 0.01637108065187931,
"rps_doc_frac_chars_dupe_7grams": 0.007912689819931984,
"rps_doc_frac_chars_dupe_8grams": 0.007912689819931984,
"rps_doc_frac_chars_dupe_9grams": 0.007912689819931984,
"rps_doc_frac_chars_top_2gram": 0.0076398397795856,
"rps_doc_frac_chars_top_3gram": 0.012960439547896385,
"rps_doc_frac_chars_top_4gram": 0.005729880183935165,
"rps_doc_books_importance": -906.8421630859375,
"rps_doc_books_importance_length_correction": -906.8421630859375,
"rps_doc_openwebtext_importance": -690.505615234375,
"rps_doc_openwebtext_importance_length_correction": -690.505615234375,
"rps_doc_wikipedia_importance": -411.7563171386719,
"rps_doc_wikipedia_importance_length_correction": -411.7563171386719
},
"fasttext": {
"dclm": 0.5226017832756042,
"english": 0.4820193648338318,
"fineweb_edu_approx": 2.1865479946136475,
"eai_general_math": 0.9359241724014282,
"eai_open_web_math": 0.16866183280944824,
"eai_web_code": 0.9278184175491333
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
2,484,080,461,117,970,400 |
cancel
Showing results for
Search instead for
Did you mean:
vdx-6740 ports respond differently to the same cable(transceiver)
vdx-6740 ports respond differently to the same cable(transceiver)
Pawel_Eljasz
New Contributor II
hi everyone
I have SFP+ cables which seems to work fine but on one(maybe more?) port(Te 2/0/27) I see "unqualified transceiver" and port gets put down administratively.
Now, next door ports, eg 25 or 29 do not do that, I think I got "unqualified" transceiver but port stay up/online.
Is this not weird? Why switch would be doing this?
nos 7.2.0a1
many thanks, L.
3 REPLIES 3
Pawel_Eljasz
New Contributor II
I think it might have had something to do with a node used "broadcast" instead of LACP.
I think that because whichever switch ports I connected the node to those ports would go adminDown after a short wile.
I'll take more time to find if that was the root cause.
(node being Centos with net team device spanning two SPF+ ports(dual port NIC))
Would/should switch behave this way is such a situation?
Deep_Bakul_Bhoj
Extreme Employee
Can you post the show media int te when the sfp is plugged in the vdx?
Yulia_Abitbul
Extreme Employee
HI L,
If its unsupported transceiver, then it wasn't tested by Extreme, behavior might be unpredictable.
Best Regards,
Yulia
GTM-P2G8KFN
|
{
"url": "https://community.extremenetworks.com/t5/data-center-vdx/vdx-6740-ports-respond-differently-to-the-same-cable-transceiver/td-p/6221",
"source_domain": "community.extremenetworks.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "221611",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IQIYKCP5XOJ44RDYPG2A52Z7DPTN3W4R",
"WARC-Concurrent-To": "<urn:uuid:3e0db35f-dc96-4daa-ba9d-067d437bc977>",
"WARC-Date": "2023-10-02T04:08:37Z",
"WARC-IP-Address": "18.160.18.73",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:57HR5UEJQK2QU343D2XH2M3S7J2AEUDR",
"WARC-Record-ID": "<urn:uuid:c96444a8-0859-4584-9d4a-f0c3f0ef56ec>",
"WARC-Target-URI": "https://community.extremenetworks.com/t5/data-center-vdx/vdx-6740-ports-respond-differently-to-the-same-cable-transceiver/td-p/6221",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:df936a29-8a90-48df-bca8-dc821be5ac67>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-97\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
7,
28,
48,
63,
64,
130,
131,
197,
198,
211,
230,
242,
243,
400,
515,
516,
567,
568,
580,
581,
597,
609,
610,
623,
642,
730,
849,
850,
906,
907,
987,
988,
1045,
1046,
1062,
1079,
1080,
1151,
1152,
1166,
1183,
1189,
1190,
1289,
1290,
1304,
1310
],
"line_end_idx": [
7,
28,
48,
63,
64,
130,
131,
197,
198,
211,
230,
242,
243,
400,
515,
516,
567,
568,
580,
581,
597,
609,
610,
623,
642,
730,
849,
850,
906,
907,
987,
988,
1045,
1046,
1062,
1079,
1080,
1151,
1152,
1166,
1183,
1189,
1190,
1289,
1290,
1304,
1310,
1321
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1321,
"ccnet_original_nlines": 47,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35231316089630127,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07117438316345215,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21708184480667114,
"rps_doc_frac_unique_words": 0.669767439365387,
"rps_doc_mean_word_length": 4.795348644256592,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.807331562042236,
"rps_doc_word_count": 215,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10669253021478653,
"rps_doc_frac_chars_dupe_6grams": 0.10669253021478653,
"rps_doc_frac_chars_dupe_7grams": 0.10669253021478653,
"rps_doc_frac_chars_dupe_8grams": 0.10669253021478653,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.017458779737353325,
"rps_doc_frac_chars_top_3gram": 0.03685741871595383,
"rps_doc_frac_chars_top_4gram": 0.05819592997431755,
"rps_doc_books_importance": -108.92057037353516,
"rps_doc_books_importance_length_correction": -108.92057037353516,
"rps_doc_openwebtext_importance": -64.9094467163086,
"rps_doc_openwebtext_importance_length_correction": -64.9094467163086,
"rps_doc_wikipedia_importance": -47.75986099243164,
"rps_doc_wikipedia_importance_length_correction": -47.759620666503906
},
"fasttext": {
"dclm": 0.17299211025238037,
"english": 0.9327225089073181,
"fineweb_edu_approx": 1.1526163816452026,
"eai_general_math": 0.1701372265815735,
"eai_open_web_math": 0.43652498722076416,
"eai_web_code": 0.023299749940633774
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
2,555,511,180,119,231,500 |
May 23, 2016
RSSRSS feed
How to Not be a Shamefully Bad Time Server Abuser
Time Server Abuse is Silly and Unnecessary
• November 10, 2008
• By Carla Schroder
Carla Schroder
Today's network administration tip tells how to not be a shamefully bad time server abuser, but rather a good responsible netizen, and keep the correct time as well.
Shameful Acts of Time Server Abuse
Time server abuse is not the problem it once was, thanks to the good folks who set up the NTP (Network Time Protocol) pool. But it still happens, and it's silly, because it's so easy to do it the right way.
Time server abuse is any act that violates the access rules of an NTP server, or damages it. Most public NTP servers are set up as an act of generosity; nobody makes money from them. The worst form of time server abuse is pummeling the poor thing until the person running it gets surprised by a giant bandwidth bill, or it crashes, or performance degrades but it keeps limping along. Most abuse is not malicious, but clueless; either way the damage is done. The most common form of abuse is violating the server's access policies. These are not deep dark secrets, and never have been.
Time server abuse is not perpetrated just by inexperienced network administrators — the worst cases are from vendors of networking devices. One might think that big companies all full of engineers and other paid brainiacs would not commit such acts of stupidity. But it has happened a number of times. Netgear was the first famous NTP server abuser. In 2003 it released four routers that were hard-coded to use the University of Wisconsin's NTP server. The result was a distributed denial-of-service attack that continued to escalate, at one point reaching nearly 150 megabits per second.
Netgear released firmware updates and gave a big bag of money to the University of Wisconsin, but the problem persists to this day because most of the people who own the defective routers will never patch them.
SMC and D-Link committed the same blunder. D-Link's case was more noteworthy because when the problem was first brought to their attention, they responded with attack lawyers. As the story unfolded, it turned out that D-Link was violating the access policies of nearly 50 Stratum 1 servers. That's an impressive achievement.
So the very least that clueful network administrators who care more about being responsible netizens than unleashing attack lawyers can do is to configure their own NTP clients sanely. It's very easy. First install the ntp program, which includes ntpd, the NTP daemon. This runs all the time keeping the correct time on your computer. You don't need to touch a thing; it takes care of itself. Then make these entries in /etc/ntp.conf:
driftfile /var/lib/ntp/ntp.drift
server 0.north-america.pool.ntp.org
server 1.north-america.pool.ntp.org
server 2.north-america.pool.ntp.org
Residents of regions other than North America can find their appropriate NTP pools at www.pool.ntp.org.
Most of the major Linux distributions configure ntpdate to run when a network interface comes up, and are sensibly configured to use either the distribution's own NTP servers or the NTP pool. For example, Fedora uses clock.redhat.com, and Ubuntu uses ntp.ubuntu.com. ntpdate does not run as a daemon. It is good for making instant time corrections, and corrections larger than 20 minutes. ntp will eventually correct a system that is far out of sync, but it will take hours or even days.
What if you are using a commercial router? First find out if it is one of the nasty offenders. Then fix it, or change it to use the NTP pool. If this is not configurable, replace with a good router.
Carla Schroder is the author of the Linux Cookbook and the Linux Networking Cookbook.
Article courtesy of Enterprise Networking Planet, originally published June 25, 2007
Sitemap | Contact Us
|
{
"url": "http://www.linuxplanet.com/linuxplanet/tips/6578/1",
"source_domain": "www.linuxplanet.com",
"snapshot_id": "crawl=CC-MAIN-2016-22",
"warc_metadata": {
"Content-Length": "36620",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7F5PSDDMJJB4P2C4XYUGRKQSV7CSSWK7",
"WARC-Concurrent-To": "<urn:uuid:c60aadbf-b051-46e7-9163-b719f58c9d9d>",
"WARC-Date": "2016-05-24T06:04:21Z",
"WARC-IP-Address": "23.15.9.179",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7T2INTM7Q5DQ65KIAUZEIXO53RCO27MN",
"WARC-Record-ID": "<urn:uuid:006ab47c-c4bd-4b87-a45f-7034eba1487b>",
"WARC-Target-URI": "http://www.linuxplanet.com/linuxplanet/tips/6578/1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9c71e105-4b54-46ba-9e40-f213d0639f42>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-217-139.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
13,
15,
17,
29,
30,
80,
81,
124,
125,
147,
169,
184,
185,
351,
352,
387,
388,
595,
596,
1181,
1182,
1771,
1772,
1983,
1984,
2309,
2310,
2745,
2746,
2779,
2815,
2851,
2887,
2888,
2992,
2993,
3481,
3482,
3681,
3682,
3768,
3769,
3854,
3855
],
"line_end_idx": [
13,
15,
17,
29,
30,
80,
81,
124,
125,
147,
169,
184,
185,
351,
352,
387,
388,
595,
596,
1181,
1182,
1771,
1772,
1983,
1984,
2309,
2310,
2745,
2746,
2779,
2815,
2851,
2887,
2888,
2992,
2993,
3481,
3482,
3681,
3682,
3768,
3769,
3854,
3855,
3875
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3875,
"ccnet_original_nlines": 44,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38077402114868164,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019975030794739723,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16604244709014893,
"rps_doc_frac_unique_words": 0.4945397675037384,
"rps_doc_mean_word_length": 4.8237128257751465,
"rps_doc_num_sentences": 58,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.258595943450928,
"rps_doc_word_count": 641,
"rps_doc_frac_chars_dupe_10grams": 0.025873219594359398,
"rps_doc_frac_chars_dupe_5grams": 0.03880982846021652,
"rps_doc_frac_chars_dupe_6grams": 0.025873219594359398,
"rps_doc_frac_chars_dupe_7grams": 0.025873219594359398,
"rps_doc_frac_chars_dupe_8grams": 0.025873219594359398,
"rps_doc_frac_chars_dupe_9grams": 0.025873219594359398,
"rps_doc_frac_chars_top_2gram": 0.025873219594359398,
"rps_doc_frac_chars_top_3gram": 0.029107369482517242,
"rps_doc_frac_chars_top_4gram": 0.027490299195051193,
"rps_doc_books_importance": -359.65594482421875,
"rps_doc_books_importance_length_correction": -359.65594482421875,
"rps_doc_openwebtext_importance": -209.9543914794922,
"rps_doc_openwebtext_importance_length_correction": -209.9543914794922,
"rps_doc_wikipedia_importance": -150.95135498046875,
"rps_doc_wikipedia_importance_length_correction": -150.95135498046875
},
"fasttext": {
"dclm": 0.03376388922333717,
"english": 0.9352145791053772,
"fineweb_edu_approx": 2.944491147994995,
"eai_general_math": 0.1584388017654419,
"eai_open_web_math": 0.29305773973464966,
"eai_web_code": 0.09198504686355591
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.677",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
77,280,523,401,681,000 |
[email protected]
Expanded Form Of Numbers Game 2nd Grade
full screen icon
Expanded Form of Numbers Game grade 2| what are expanded form of numbers ? | write numbers in expanded form | expanded versus standard form of numbers. This game page deals with numbers writen in their expanded form up one thousand, and the game questions would be related to selecting the standard form of that particular number among the suggested multiple choice answers.
Expanded form is a way of writing numbers that shows the place value of each digit. It is a useful tool for understanding the value of numbers and for doing math operations such as addition and subtraction. To write a number in expanded form, you start by writing the number as a sum of its digits, each one multiplied by its place value. For example, the number 356 can be written in expanded form as 300 + 50 + 6.
The digit 3 stands for 3 hundreds, the digit 5 stands for 50, and the digit 6 stands for 6 ones. Here are some more examples of numbers written in expanded form: 42,000 = 40,000 + 2,000 1,234 = 1,000 + 200 + 30 + 4 9,876 = 9,000 + 800 + 70 + 6 Expanded form can also be used with decimals. For example, the number 0.8 can be written in expanded form as 0.8 = 8 x 0.1. The digit 8 stands for 8 tenths, or 0.8.
Using expanded form can be helpful when doing math operations because it shows the value of each digit in the number. For example, to add the numbers 123 and 456 in expanded form, you can write them as 100 + 20 + 3 and 400 + 50 + 6 and then add them: (100 + 20 + 3) + (400 + 50 + 6) = 500 + 70 + 9 = 579 In this way, expanded form can help you understand the value of numbers and perform math operations more easily. You can also use expanded form as the basis for a math game. One idea is to give students a number and have them write it in expanded form. They can then compare their expanded form to a partner's or to the answer key to see if they got it correct.
You can also have students create their own numbers and write them in expanded form for their partners to solve. Another idea is to use expanded form to play a place value game. Give students a number and have them identify the place value of each digit. For example, in the number 1,234, the digit 1 stands for 1 thousand, the digit 2 stands for 200, the digit 3 stands for 30, and the digit 4 stands for 4 ones. Students can then use this knowledge to solve place value problems or to compare numbers based on their place value. Expanded form can also be used to teach students about rounding numbers.
For example, you can give students a number in expanded form and have them round it to the nearest ten, hundred, or thousand. For example, if the number is 1,234 in expanded form, students could round it to 1,000 or 1,300 depending on the rounding rules. Overall, expanded form is a useful tool for understanding numbers and for doing math operations. By using it as the basis for a math game, you can help students improve their understanding of place value and rounding, and have fun at the same time.
Addition, Subtraction, Division and Multiplications
|
{
"url": "https://mathplay4kids.com/games/grade2/expanded-form-of-numbers-game-2nd-grade.html",
"source_domain": "mathplay4kids.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "14026",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WSPVITRZ4MCPZUNQRU43HXHTVZ2APCKA",
"WARC-Concurrent-To": "<urn:uuid:3ccd90fb-8824-41a2-aa41-862be5d098ea>",
"WARC-Date": "2023-12-01T12:28:08Z",
"WARC-IP-Address": "35.212.75.202",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:56EHWGTAHTHUYXUM6VOYV3JNSPDL66VV",
"WARC-Record-ID": "<urn:uuid:28ecfeb1-a645-46da-a863-be8745eba165>",
"WARC-Target-URI": "https://mathplay4kids.com/games/grade2/expanded-form-of-numbers-game-2nd-grade.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5ae48bf5-6162-42e1-86db-cd78f1a6e5ff>"
},
"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-156\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
23,
24,
64,
65,
66,
83,
84,
459,
460,
462,
463,
879,
880,
882,
883,
1294,
1295,
1297,
1298,
1966,
1967,
1969,
1970,
2575,
2576,
2578,
2579,
3083,
3084,
3086,
3087
],
"line_end_idx": [
23,
24,
64,
65,
66,
83,
84,
459,
460,
462,
463,
879,
880,
882,
883,
1294,
1295,
1297,
1298,
1966,
1967,
1969,
1970,
2575,
2576,
2578,
2579,
3083,
3084,
3086,
3087,
3138
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3138,
"ccnet_original_nlines": 31,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3790087401866913,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2638483941555023,
"rps_doc_frac_unique_words": 0.30550622940063477,
"rps_doc_mean_word_length": 4.278863430023193,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.570746898651123,
"rps_doc_word_count": 563,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.22332918643951416,
"rps_doc_frac_chars_dupe_6grams": 0.15774179995059967,
"rps_doc_frac_chars_dupe_7grams": 0.06641759723424911,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.11457035690546036,
"rps_doc_frac_chars_top_3gram": 0.0581154003739357,
"rps_doc_frac_chars_top_4gram": 0.026151930913329124,
"rps_doc_books_importance": -295.8900451660156,
"rps_doc_books_importance_length_correction": -295.8900451660156,
"rps_doc_openwebtext_importance": -168.79095458984375,
"rps_doc_openwebtext_importance_length_correction": -168.79095458984375,
"rps_doc_wikipedia_importance": -125.1523666381836,
"rps_doc_wikipedia_importance_length_correction": -125.1523666381836
},
"fasttext": {
"dclm": 0.9361436367034912,
"english": 0.9216452836990356,
"fineweb_edu_approx": 3.5746138095855713,
"eai_general_math": 0.9914240837097168,
"eai_open_web_math": 0.6965628266334534,
"eai_web_code": 0.05335522070527077
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"secondary": {
"code": "372.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Elementary and Kindergarten"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-3,487,811,650,913,728,500 |
Tom’s Tutorials For Excel: Name your sheet tab same as cell value.
Name your sheet tab same as cell value.
You can rename a worksheet in real time the moment you change a cell’s value.
A Worksheet_Change event can look at the entry, evaluate it for worthiness, and immediately rename the worksheet tab to be the same as what you entered in the cell.
There are 3 important considerations:
(1) The proposed name cannot be longer than the 31-character limit for sheet tab names.
(2) There cannot be any characters that violate sheet tab naming rules.
(3) The proposed worksheet name cannot be the same as an existing worksheet in that workbook because duplicate sheet names are not allowed.
For example, you want a sheet tab to be named the same as what you enter into cell A1.
To establish a Worksheet_Change event for the worksheet where you want this to happen, right-click that sheet tab, left-click to select View Code, and paste the following procedure into the large white area that is the worksheet module. Press Alt+Q to return to the worksheet.
Private Sub Worksheet_Change(ByVal Target As Range)
'Specify the target cell whose entry shall be the sheet tab name.
If Target.Address <> "$A$1" Then Exit Sub
'If the target cell is empty (contents cleared) do not change the sheet name.
If IsEmpty(Target) Then Exit Sub
'Disallow the entry if it is greater than 31 characters.
If Len(Target.Value) > 31 Then
MsgBox "Worksheet names cannot be more than 31 characters." & vbCrLf & _
Target.Value & " has " & Len(Target.Value) & " characters.", _
48, "Keep it under 31 characters."
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
'Sheet tab names cannot contain the characters /, \, [, ], *, ?, or :.
'Verify that none of these characters are present in the cell's entry.
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = "/"
IllegalCharacter(2) = "\"
IllegalCharacter(3) = "["
IllegalCharacter(4) = "]"
IllegalCharacter(5) = "*"
IllegalCharacter(6) = "?"
IllegalCharacter(7) = ":"
For i = 1 To 7
If InStr(Target.Value, (IllegalCharacter(i))) > 0 Then
MsgBox "You used a character that violates sheet naming rules." & vbCrLf & _
"Enter a name without the ''" & IllegalCharacter(i) & "'' character.", _
48, "Not a possible sheet name !!"
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
Next i
'Verify that the proposed sheet name does not already exist in the workbook.
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = Trim(Target.Value)
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
'If the worksheet name does not already exist, name the sheet as cell value.
'Otherwise, advise the user that duplicate sheet names are not allowed.
If bln = False Then
ActiveSheet.Name = strSheetName
Else
MsgBox "There is already a sheet named " & strSheetName & "." & vbCrLf & _
"Please enter a unique name for this sheet."
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
End If
End Sub
Share Button
Posted in Tom's Tutorials for Excel
Tags: , , , , , , , , , , , ,
213 comments on “Tom’s Tutorials For Excel: Name your sheet tab same as cell value.
1. Biray Kocak says:
Hi,
Congratulations about above code. it’s very useful.
with a small addition, (adding “&” after MsgBox “You used a character that violates sheet naming rules.” ) i could run it.
But, i have a bug when i want to use it with a formula in a cell. two things:
1) when you put a formula in cell a1, if the value changes, sheet name does not change automatically. is this due to vba running method?
2) when you put a formula in cell a1, you can change sheet name by correcting cell by F2 and enter it. but, if value would not be changed as a result, excel generates this error (there is already a sheet named. please enter a unique name for this sheet). then excel deletes formula in this cell.
• TomU says:
Thank you for pointing out that an ampersand “&” was missing, which I have corrected.
To answer your first question, because the event I posted is a Change event, a formula usually would not be the trigger for changing the sheet tab name. However, you could use a Calculation event that captures the change in a cell’s value that is returned by a formula.
I say “usually” because with the Change event as I posted it, entering the formula =Hello changes the sheet tab name to Hello. But I am sure you are asking about a different scenario whereby the formula in (for example) cell A1 is conditional or relies on precedent cells.
To answer your second question, you could establish a Calulation event that is triggered by the calculation of the cell of interest, without deleting the formula in cell A1.
Private Sub Worksheet_Calculate()
With Range("A1")
If Len(.Value) = 0 Or Len(.Value) > 31 Then Exit Sub
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = "/"
IllegalCharacter(2) = "\"
IllegalCharacter(3) = "["
IllegalCharacter(4) = "]"
IllegalCharacter(5) = "*"
IllegalCharacter(6) = "?"
IllegalCharacter(7) = ":"
For i = 1 To 7
If InStr(.Text, (IllegalCharacter(i))) > 0 Then
MsgBox "The formula in cell A1 returns a value containing a character that violates sheet naming rules." & vbCrLf & _
"Recalculate the formula without the ''" & IllegalCharacter(i) & "'' character.", _
48, "Not a possible sheet name !!"
Exit Sub
End If
Next i
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = (.Text)
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
If bln = False Then
ActiveSheet.Name = strSheetName
ElseIf ActiveSheet.Name < > .Text Then
MsgBox "There is already a sheet named " & strSheetName & "." & vbCrLf & _
"Recalculate the formula in cell A1 to return a unique name."
End If
End With
End Sub
• Des K says:
Hi Tom,
Thanks for the updated Worksheet_Calculate code. It almost works for me, but not quite – the sheet tab names I want changed (‘target’ sheets) depend on a selection in a ‘main’ sheet. So, after putting the above code in a target sheet whose tab name I need changed, I go to the ‘main’ sheet to a drop down list to choose the required selection, which then automatically makes a change in cell A1 of the target sheets – as the above code you wrote works on the ActiveSheet, the code changes the tab name of my main sheet (as this is where I go to make my selection which activates the change in A1 of the target sheet based on a formula), rather than my target sheet. Is there any way you can amend the above code so that my target sheet tab name changes rather than my main sheet tab name? I’m very new with VBA, so if you could list out the exact changes that I would need to make, that would be greatly appreciated! Thank you.
• Nick says:
I am having exactly this problem. I cant find a suggested solution to it in this discussion.
Have you found a solution to it? Many thanks
• Jim P says:
When I copy this code into a module it doesn’t show up in my macro list. Thoughts?
• Tom Urtis says:
My first thought is that you might have copied the code into a standard module. It is supposed to go into the worksheet module.
Take another look at what I wrote in my tutorial, in the paragraph immediately preceding the code:
“To establish a Worksheet_Change event for the worksheet where you want this to happen, right-click that sheet tab, left-click to select View Code, and paste the following procedure into the large white area that is the worksheet module. Press Alt+Q to return to the worksheet.”
This code is a procedure event. It is not supposed to show up in your macro list.
• Ron Boezwinkle says:
Thank you for your code to automate the renaming of the tabs when they are referencing a cell that is based on a formula! It works well….mostly.
I’m having one problem:
The formula I’m using to base the name of the sheets in the workbook (B) on is referencing a cell in another workbook (A). The cell I’m referencing obtains the naming information from two columns in that workbook(A); one that contains a name of a facility, and another that automatically provides a sequential number based on whether there is text in the facility name column or not. This then reports the information below to at tab in Workbook (B) which is referenced in each of the sheets in the workbook (B).
Format would typically appear as follows:
# Facility Name Page 4 Tab Name Page 5 Tab Name
1 Facility A PG 4 – Facility A ProjSheet PG – 5 Facility A BldUtil
2 Facility B PG 4 – Facility B ProjSheet PG – 5 Facility B BldUtil
3 Facility C PG 4 – Facility C ProjSheet PG – 5 Facility C BldUtil
4 Facility D PG 4 – Facility D ProjSheet PG – 5 Facility E BldUtil
If I Identify that a facility needs to be added between A and B, and add it in the source sheet, an error is generated because B, C and D already exist in the existing tab names.
I’m wondering if there is a way to first restore any tabs with “ProjSheet” and “BldUtil”in their name to their original name (Codename?) and then run the renaming macro on the individual sheets so that there isn’t the conflict? FYI: My workbook has 78 sheets, 30 of which have “ProjSheet” and 30 which have “BldgUtil” in their names.
• Tom Urtis says:
Wow. I am reading this a few times to follow all the factors you explained about, trying to understand how all the dots connect. This is not a criticism of you at all Ron, but it seems that this arrangement is more complicated than it needs to be. I started getting lost at “This then reports the information below to at tab in Workbook (B) which is referenced in each of the sheets in the workbook (B).”
What caught my attention in a good way is this:
“…and another that automatically provides a sequential number”
To me, sequential means unique — a non-repeated number in a (supposedly) increasing sequential progression. If that is the case, the unique nature of the sheet name should be resolved. But obviously it is not resolved, so something else is intruding on that process.
Based on your last paragraph with the questions, it sounds like you want to programmatically start from scratch name-wise and then rename the sheets based on their project CodeName (not their tab name), which I always highly recommend. A CodeName never changes but it always refers to the same worksheet object regardless of the tab name.
Not being familiar with your workbook, generically speaking, if it were me, I would create a list of the 78 sheets’ CodeNames, which are unique, and run a macro that looks up the Facility Format combination that matches the CodeName’s sheet whose tab you want to rename. This way, you would not need to temporarily rename the tab names with some interim boilerplate syntax.
That is my best shot at a first reply. If you get stuck on anything specific, please feel free to post back.
• Ron Boezwinkle says:
Thanks for the reply! You are absolutely correct and I was overcomplicating the issues.
I’ve combined the two workbooks to minimize the complexity. I have the following formula in the cell I’m referencing to obtain the sheet name:
=”PG 4 – “&XLOOKUP(A3,’Property Listing’!B11:B54,’Property Listing’!A11:A54)&” “&XLOOKUP(A3,’Property Listing’!B11:B54,’Property Listing’!C11:C54)&” ProjSht”
That looks for the property name selected from a drop-down list in cell A:1. It looks for that name in column B in the property listing sheet and returns both a unique property number, and an abbreviated property code which looks like this and is located in cell C3:
PG 4 – 6 DDE ProjSht
That part works perfectly and changes automatically based on the selection from the drop-down.
The code below has been pasted into the individual sheets I want to automatically name based on the contents of cell C3:
‘The following code changes the name of the worksheet to the input found in cell C3
‘This code came from https://www.atlaspm.com/toms-tutorials-for-excel/toms-tutorials-for-excel-name-your-sheet-tab-same-as-cell-value/
Private Sub Worksheet_Calculate()
‘Specify the target cell whose entry shall be the sheet tab name.
With Range(“C3”)
If Len(.Value) = 0 Or Len(.Value) > 31 Then Exit Sub
‘Sheet tab names cannot contain the characters /, \, [, ], *, ?, or :.
‘Verify that none of these characters are present in the cell’s entry.
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = “/”
IllegalCharacter(2) = “\”
IllegalCharacter(3) = “[”
IllegalCharacter(4) = “]”
IllegalCharacter(5) = “*”
IllegalCharacter(6) = “?”
IllegalCharacter(7) = “:”
For i = 1 To 7
If InStr(.Text, (IllegalCharacter(i))) > 0 Then
MsgBox “The formula in cell C3 returns a value containing a character that violates sheet naming rules.” & vbCrLf & _
“Recalculate the formula without the ”” & IllegalCharacter(i) & “” character.”, _
48, “Not a possible sheet name !!”
Exit Sub
End If
Next i
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = (.Text)
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
If bln = False Then
ActiveSheet.Name = strSheetName
ElseIf ActiveSheet.Name .Text Then
MsgBox “There is already a sheet named ” & strSheetName & “.” & vbCrLf & _
“Recalculate the formula in cell C3 to return a unique name.”
End If
End With
End Sub
The code is trying to update the tab names, but two things are happening:
1.) The sheet name for my ‘Property Listing’ tab is changing to the value of the first tab that needs to be renamed.
2.) I’m receiving the following error box(es): “There is already a sheet named xxxx. Recalculate the formula in cell C3 to return a unique name.”
If I rename the “Property Listing” tab and then go to C3, if I hit F2 + enter, it updates the tab name correctly.
Any ideas as to how to prevent this? I’ve checked and there is no VBA code in the ‘Property Listing’ sheet.
• Raqune says:
Wow, this subject has generated years of posts. Reading through the ongoing discussion and trying to wrap my head around all the permutations of how this tool can be used is mind blowing. Kudo’s TomU for all your patient help & creative thinking!
I utilized the “Private Sub Worksheet_Calculate()” procedure code you posted November 23, 2011. Even though I barely understand how it all works…after a few false starts it WORKED! However, I’ve run into a snag.
BACKGROUND
I’m using your code on an invoice spreadsheet for my wife to track billing for consultation calls. Previously I kept one tab named “Blank Invoice” for her to copy & paste into a new worksheet for each client / month (when copied they are automatically named “Sheet 1, Sheet 2, Sheet 3, etc.”). She would rename each tab with “yr.d-Client Initials”; e.g. “21.4-BS”. I automated invoice to auto-fill Client Name & new Invoice # (using =IF, LOOKUP & “filename”) to interpret Sheet Name once the date was entered. This proved too confusing – big challenge was that tab name must be manually formatted correctly for formulas to work.
I wanted to try a different approach using your code to update Sheet Name by using “Calculate()” code triggered by calculation in “Invoice#” cell.
– Invoice # calculates using ClientName&TodaysDate&TotalClientInvoices (e.g. 21.4-BS 16)
– Client Name input is controlled by Data Validation to select client name from list
– Client Name list pulled from “Totals” worksheet (tracks client hours & income).
– Selecting Client Name triggers =NOW() in the “Date” field & an Invoice# calculation
This all worked EXCEPT…when I copy “Blank Invoice” to a new sheet it automatically names the new sheet with same Sheet Name which causes an error because you can’t have 2 worksheets with same name.
Is there a way to write the code to NOT rename new sheet tab, but leave as default (e.g. “Sheet 1, 2, 3…”) as long as trigger cell calculates to “ “ (blank)? But rename sheet tab to desired value once Client Name is entered (which would trigger Date & Invoice # cells to calculate results needed to create worksheet tab name).
• Tom Urtis says:
Thanks for your compliment.
There are a lot of moving parts in your description. Without seeing your workbook and so not knowing what cell addresses belong to the Invoice# cell or the Client Name cell or the NOW cells, it looks to me after reading your message a few times that maybe a quick fix would be to devise a way to uniquely name a worksheet tab sans Client Name.
So when your Client Name cell is empty (again, if I understand the mechanics of your workbook), one way to ensure a unique name could be to:
(1) Decide upon a dedicated cell on some worksheet as a unique name helper cell. Let’s say it is your Totals sheet, cell Z1.
(2) Manually enter the number 100 in cell Z1 of the Totals sheet. It would be the only manual entry in that cell you would make.
(3) During the course of your Calculate event’s execution, when the condition of the Client Name is deemed to be a null string (meaning the cell is empty or has no value in it), a code snippet can be:
Dim lngNextNumber As Long
lngNextNumber = Worksheets("Totals").Range("Z1").Value + 1
ActiveSheet.Name = "Sheet" & lngNextNumber
Worksheets("Totals").Range("Z1").Value = lngNextNumber
• Raqune says:
How do I provide a sample workbook? Don’t see a way to send attachment to reply.
I was hoping my description would be more clear to a reader than it was, but no matter how I wrote it out it still looked more complex than it should.
Thank you for taking the time to look over my question! Either I did not ask it clearly or I do not understand your suggestion. Either way I will try to restate my goal more clearly and give more specific cell info.
BASICALLY
I want a “Master Invoice” sheet that can easily be copy & pasted into new worksheet to create a new unique invoice. Each invoice sheet tab name (which I hope to automate) must contain client initials & yr.mo because each invoice has client notes that must be quickly accessed & referred to, sometimes months later.
The 2 challenges at this point are:
1. If “Master Invoice” is renamed before copying to a new worksheet, the copy immediately becomes renamed with whatever name my “Master” Invoice had, which Excel does not allow. However, it appears that “Calculate()” code does nothing if reference cell calculates to “” so it leaves tab name as whatever last named; so as long as I leave cells blank BEFORE I copy & paste sheet it does not try to create two sheets with same name. But if I wait to rename after I copy sheet I run into challenge #2…
2. The “Calculate()” code worked with the “Master” invoice, but code appears to be only associated with “Master” sheet and does not work once copied to another sheet so I probably entered it in the wrong place. Can code be entered to apply to any new sheet created in that workbook?
The 4 parts of the puzzle are:
Assuming Client is Bob Smith and Bob’s 16th invoice was created in April 2021…
C7 = Client Name (triggers calculation in G5 & G4, results used in Tab Name)
G5 = Today’s Date (enters today’s date & provides yr.mo for Tab Name)
G4 = Invoice# (concatenates yr.mo, client initials & invoice# – e.g. 21.4-BS 16)
Sheet Tab = ideally the 1st part of Invoice# – e.g. 21.4-BS
FORMULAS FOR G5 “DATE” & G4 “INVOICE#”
“Date” entry in cell G5 automated with:
=IF(C7=””,””,NOW())
How it works: Cell C7 is “Client Name” entry cell. G5 remains blank until client name is entered. Once client name is entered it triggers =NOW() calculation to enter today’s date.
“Invoice#” in cell G4 automated with:
=IF($C$7=””,””,RIGHT(YEAR($G$5),2)&”.”&LEFT(MONTH($G$5),2)&”-“&LEFT($C$7)&MID($C$7,FIND(” “,$C$7&” “)+1,1)&MID($C$7,FIND(” “,$C$7&” “,FIND(” “,$C$7&” “)+1)+1,1)&” “&DATEDIF(“12/1/2019″,$G$5,”m”))
How it works: If cell C7 (Client Name) is blank, Invoice# G4 remains blank. If C7 contains a Client name the Invoice# is generated in G4 using yr.mo from G5 (Date Field), then “-“, then 1st & last initials of Client Name from C7, then a space, then counts months from client start date. Client Start Date currently written into formula (i.e. “12/1/2019”) but eventually will pull “Start Date” from client data on “Totals” sheet) to assign number of invoices for that client. e.g. “xx.xx-xx 16”
Hope I haven’t muddied the water further…:)
2. Troy says:
Is it possible to do this with the cell reference (ie. $A$1) being on a different worksheet? I’ve tried referencing the usual way but it doesn’t work.
• Tom Urtis says:
Supposing for example you want to change the name of the Sheet1 tab to some other name, and your A1 target cell is in, say, Sheet3 , place the code I posted into the Sheet3 module (or whatever sheet you are working on). Then, simply change this line
ActiveSheet.Name = strSheetName
to this
Worksheets(“Sheet1”).Name = strSheetName
My only caveat would be to not code for the existing and soon-to-be-renamed tab name but the sheet’s VBA object name, example
Sheet1.Name = strSheetName
• Christian says:
Greetings, and thank you for your clear explanations and useful code examples. I’m having trouble where the above routine (November 23, 2011 at 1:44 am) successfully renames the target sheet, but then continues to run, causing the sheet to recalculate until I get a “stack overflow” and the code stops.
I would like to re-name Sheet1 to match Sheet2!B2, where
Sheet2!B2 = Concatenate(“Tab “, Sheet2!B3)
I’ve tried commenting out the portions of the code that check for name length (< 31 char), illegal characters, and other sheets with the same name.
My Excel is set to "Automatic" calculation of sheets.
Please let me know if you have any ideas for me to try.
Many thanks,
Christian Crowley
Washington, DC
3. jeffC says:
Tom
how can this code be modified to cover any changes of name in any worksheet in a workbook?
• Tom Urtis says:
You’d place the procedure in the workbook module for a workbook-level sheetchange event. Example, substitute the procedure name
Private Sub Worksheet_Change(ByVal Target As Range)
with
Private Sub Workbook_SheetChange(ByVal Sh As Object, ByVal Target As Range)
To easily access your workbook module, in Excel version 2003 or before, find the little Excel workbook icon near the upper left corner of your workbook window, usually just to the immediate left of the File menu option. Right-click on that icon, and left-click to select View Code. In Excel versions 2007 or after, from your worksheet press Alt+F11, then press Ctrl+R, find your workbook name in the “Project – VBAProject” left vertical pane, expand the Microsoft Excel Object folder for your workbook, right click on ThisWorkbook and left-click to select View Code. Paste the procedure into the large white area that is the workbook module, then press Alt+Q to return to the worksheet.
4. Rossei says:
Hello,
This code is exactly what I was looking for. Thanks.
But if I the user leaves the target cell empty or delete the entry, I want a msgbox to pop-up and ws name to go back to its original code name or something specific.
Your code:
‘If the target cell is empty (contents cleared) do not change the sheet name.
If IsEmpty(Target) Then Exit Sub
I tried this instead:
‘If the target cell is empty, show this msg
If IsEmpty(Target) Then
ActiveSheet.Name = “Sheet1”
MsgBox “Sheet name will presume.”
Exit Sub
End If
doesn’t work, it still keeps whatever was input before.
• Tom Urtis says:
Thanks for following my page. You said in your comment that your amended code does not work for you, but I tested your sample code modification and it works for me. Maybe you are testing it in a module for a worksheet other than an existing worksheet whose tab is already named Sheet1. At the point of your modified code insertion, there are no safeguards yet on place for duplicate sheet names, so maybe you are hard-coding the default name of Sheet1 when another actual Sheet1 worksheet exists. In any case, based on your question and attempted workaround, I cannot repeat your error because your code works in the context you described.
• Rossei says:
Hey Tom,
Thanks for your prompt reply. Mine wasn’t working because I was deleting the cell entry. If the entry is backspaced, then it changes the tab name whatever I want.
My Code:
‘If the target cell is empty, sheet name will remain same.
If IsEmpty(Target) Then
ActiveSheet.Name = ActiveSheet.CodeName
MsgBox “Sheet name will presume.”
Exit Sub
End If
Now, I want to add another function for ‘deletion’. Like IsEmpty. So, if the user hits ‘Delete’ from keyboard for the target cell, active sheet would presume codename.
I appreciate your help.
5. Tom Urtis says:
On your main sheet, what exactly is the drop down list? Is it data validation? A combobox from the Forms toolbar? A combobox from the activex Toolbox? Is it entered into a cell? If so, what is the cell address? Whatever the case, I would tie the code as a macro to the drop-down selection of the sheet name, with an inputbox that pops up to ask for the new name of the sheet you selected in the drop down. Please provide a few specific details such as I asked for, and I’m sure a solution is possible.
6. Carl Witthoft says:
Hi – strange problem: Whether I load the code into a workbook Module or into the Worksheet Code, I cannot convince Excel 2010 that the macro exists. It doesn’t show up in the list of macros to run, and in the VB editor window, hitting “Run” or”Debug” does nothing at all. All other macros I have are working.
• Tom Urtis says:
Thanks for following my Excel page.
What I posted is an example of a Worksheet level event procedure. These kinds of procedures are not macros per se, and they would never show up in the Macro dialog as a list of macros to run. That is because, being an event procedure, they are triggered by an event of some kind. In this case, the event is a Change event. A Change event happens when a change to a cell is made, typically when you enter a value into a cell, or you delete the contents of the cell, or basically when you change the data (that is, type something new, edit something existing, or delete what is in) a cell. Further, the change event in my example is only (as you can see by the first line of code in the procedure) limited to cell A1. It is cell A1 that is being monitored for a change on that particular worksheet, and no other cell. So, type some text into cell A1, such as Hello and (unless there is another sheet tab in that workbook coincidentally also named Hello), your sheet tab for that sheet will be automatically named Hello. Also, be sure you followed my direction in the example. I never said to put he procedure I posted into the Workbook module. It goes into the Worksheet module as I wrote in my paragraph immediately above the procedure code.
7. Carl Witthoft says:
Never mind — I missed the point that this sheet code autoruns when the cell is edited.
8. Andy says:
I am very new to VBA and I am trying to build a a multitab template that has two pre-existing Tabs called Cover and List. The following Tabs (5 or 6, pre-existing, with some calculations in it) are to be named from the Tab Cover (whose Tab name is automatically taken from it’s cell A1 using your original code above) but from different cells (i.e. B16, B18, B20….etc). These other Tabs are called Sheet3, Sheet4 etc. Is there any way to modify your code to do this?
I tried to copy B16 into Sheet3!A1 and put the original code again in its code but it seems to react only to changes that are not fed by a formula leading to another tab. Since, as you explained, this is not a real macro, I am not even able to run it manually or assign it to a button.
I looked at the other events that can be used as triggers (rather than Change) but none seems to be good for this use (I tried to fiddle with FollowHyperlink but I think I need a little bit more studying VBA before I can test at random 🙁 ).
Would really appreciate your help. I learned a lot already by observing the logic you used to produce the original routine. I found others in internet but none was as cleaver and complete as yours.
Thanks
Andy
.
• Tom Urtis says:
Thanks for following my Excel page.
I will assume you are wanting changes made to certain cells on the Cover sheet, and only on the Cover sheet, to be what causes other sheets to have their tab names changed.
I further assume your sheet named Cover is VBA sheet code name of Sheet1, and that the List sheet’s code name is Sheet2. And I’ll assume that a change to cell A1 in the Cover sheet will change that sheet name, and changes to cells B16, B18, B20, and B22 on the Cover sheet will change the tab names for sheet code names Sheet3, Sheet4, Sheet5, and Sheet6 respectively.
If by chance you do not know what I mean by “sheet code name”, go into the VBE and hit Ctrl+R. Find the name of your workbook in the Project – VBAProject window. your workbook name will be in bold and look like VBAProject (YourWorkbookName). Expand the yellow folder named Microsoft Excel Objects. You will see that each worksheet has two names. One is the code name, and the other is the name you would see on the tab of the sheet. For example, one sheet (I am assuming) will be named Sheet1 (Cover). So, modify the belwo code in the Select Case block for the proper sheet code names of the worksheets you want to change the names of.
This worked when I tested it, given the aforementioned assumptions. It goes in the module of the Cover sheet **in place of** (that is, substitute this code with) the previous original code you pasted in from my posted example.
Private Sub Worksheet_Change(ByVal Target As Range)
‘Specify the target cell whose entry shall be the sheet tab name.
If Intersect(Target, Range(“A1,B16,B18,B20,B22”)) Is Nothing Or Target.Cells.Count > 1 Then Exit Sub
‘If the target cell is empty (contents cleared) do not change the sheet name.
If IsEmpty(Target) Then Exit Sub
‘Disallow the entry if it is greater than 31 characters.
If Len(Target.Value) > 31 Then
MsgBox “Worksheet names cannot be more than 31 characters.” & vbCrLf & _
Target.Value & ” has ” & Len(Target.Value) & ” characters.”, _
48, “Keep it under 31 characters.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
‘Sheet tab names cannot contain the characters /, \, [, ], *, ?, or :.
‘Verify that none of these characters are present in the cell’s entry.
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = “/”
IllegalCharacter(2) = “\”
IllegalCharacter(3) = “[”
IllegalCharacter(4) = “]”
IllegalCharacter(5) = “*”
IllegalCharacter(6) = “?”
IllegalCharacter(7) = “:”
For i = 1 To 7
If InStr(Target.Value, (IllegalCharacter(i))) > 0 Then
MsgBox “You used a character that violates sheet naming rules.” & vbCrLf & _
“Enter a name without the ”” & IllegalCharacter(i) & “” character.”, _
48, “Not a possible sheet name !!”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
Next i
‘Verify that the proposed sheet name does not already exist in the workbook.
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = Trim(Target.Value)
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
‘If the worksheet name does not already exist, name the sheet as cell value.
‘Otherwise, advise the user that duplicate sheet names are not allowed.
If bln = False Then
Select Case Target.Address
Case “$A$1”: Sheet1.Name = strSheetName
Case “$B$16”: Sheet3.Name = strSheetName
Case “$B$18”: Sheet4.Name = strSheetName
Case “$B$20”: Sheet5.Name = strSheetName
Case “$B$22”: Sheet6.Name = strSheetName
End Select
Else
MsgBox “There is already a sheet named ” & strSheetName & “.” & vbCrLf & _
“Please enter a unique name for this sheet.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
End If
End Sub
• Allister says:
HI
I am trying to use your macro
I have a cell that holds a value which is two cells concatenated together.
When I changed one of teh values a new result of teh concatenation appears and teh macro should change teh Shhet name to match.
However I am getting teh errr saying that there is already a sheet with that name. The problem is that the sheet name in teh message is one of teh existing sheetnames but not a duplicate of teh value on teh current sheet.
• Tom Urtis says:
I don’t understand how what you describe is possible, but I do not doubt that you are seeing what you are saying. Still, I cannot duplicate what you describe. By any chance are merged cells involved with any of this.
9. Mark Gosnell says:
I am using the INDIRECT command to access the material data I need on another worksheet in my workbook. The problem I am having is if I have a space in the worksheet name AL 7050 T7451 425 Plate the INDIRECT command returns #REF!.
10. T. Reed says:
Hi Tom
I just copied and paste your code to VBS module and it works. Thank you very much. However, it only works for 61 sheets and not the rest (there are 178 sheets in my workbook).
Thanks very much in advance.
• Tom Urtis says:
Hi and thanks for your message. I cannot understand how the code does not look at every worksheet in your workbook for a duplicate sheet tab name. It works fine when I tested it. Some numbers are significant to Excel and to computers, especially those with a factor of a power of 2 such as 8^2 and so on. The number 178 is not such a significant number and that many worksheets in a workbook is not excessive. Can you try the code again, maybe on some other sheet like the 137th and see what happens.
11. Saleh says:
Hi Tom,
I know it long time passed from this topic but I used this macro and my problem is: I should only write in A1 cell to change the sheet name. I mean when I copy & paste data from another sheet to A1 cell it is not work! how can I fix the problem because most of the time data need to be pasted on the exact sheet.
Best regards
Saleh
12. Mark Gosnell says:
I am trying to get VBA to write the following formula to an Excel 2007 Worksheet cell:
ActiveCell.FormulaR1C1 = “= Concatenate(“Pg. “,’Worksheet1′!$I$2)”
not sure how to get around the “Pg. ” issue? Any help would be appreciated.
13. Ali Dean says:
Hi Tom,
I realise it’s been a long time since this was posted so sorry about that!
Is there a way to do with if the value of the cell in question is found using a formula?
E.g. My cell takes it value from another worksheet in the workbook but it won’t update the sheet name when I update the other worksheet.
Do you have any way around this?
Cheers
Ali Dean
• Tom Urtis says:
Use the Calculate event in your worksheet module for that.
Suppose the worksheet whose tab you want to change is codename Sheet1. NOTE: Codename is NOT necessarily the same as tab name. Take a look at this link to see what a codename is if you are not sure.
http://www.atlaspm.com/toms-tutorials-for-excel/toms-tutorials-for-excel-vba-help-usually-right-sometimes-wrong/
Now then, let’s further say on your Sheet1 codename worksheet, that cell A1 contains the formula which, when it changes, causes the Sheet1 codename to have a new tab name, of, say My Budget or whatever is entered in that other source sheet which the formula in cell A1 depends on.
In your worksheet module, in its simplest form, this would do what you want:
Private Sub Worksheet_Calculate()
Sheet1.Name = Range(“A1”).Value
End Sub
14. AJH says:
From your original post. Is there a way to change your target cell to take say (3) cells and combine them to name a new tab. For example: A1: type1, A2: type2, A3: type3 and format them to show in the tab with spaces and punctuation?
15. miscurrie says:
Hi There
I have found this, so sorry I know that it is quite an old post. I am trying to get worksheets to be named from a list. The list is a list of student names that will change from term to term etc. So when I change the student name I would like the sheet name to change. Currently I just have student 1, student 2, etc in individual cells. So there could be up to 25 or 30 students and therefore worksheets…
• Tom Urtis says:
A few considerations:
Do you want a new worksheet to be created as the names are looped through, or do the sheets already exist.
If a sheet for a name on the list already exists, should it be re-created or kept and appended.
Where is this list of names (sheet and range)
Any duplicate names, if so what to do about that, as 2 worksheets with the same names cannot reside in the same workbook.
• Miscurrie says:
Hi there
I am not sure if my original reply went through, however it is not up here anymore so I will try again.
I don’t want new worksheets created, they will be existing. I am creating a reading log for data entry, and will just have a template on each worksheet ready to go.
The list of names is in a separate worksheet called “Class List” which I would like to remain called ‘Class List”. The list is student names and are individual cells and I have allowed for up to 30 students in the list. There should be no duplicate names as I will use a number or something to that effect as I need to know which student is which.
Thanks for you help it is much appreciated.
Kind Regards
• Tom Urtis says:
I asked you for the range where the list of names is, but you still have not answered.
Also, if there are more sheets in the workbook besides Class List, how would the code know to not name those sheet tabs.
Have you checked to make sure that the mystery range of 30 cells on the Class List sheet do not contain student names that are longer than 31 characters. You can use data validation for those cells.
16. miscurrie says:
Hi there
Thank you for your response!
The worksheets will be existing (as they are logs for recording data. I thought it would be best to have the template there rather than creating a worksheet every time and try and put the template in).
The students names are currently on one worksheet called “Class List” in the same workbook, (which I would like to remain “Class List”) and I have allowed for up to 30 students in my list.
Currently I have the list as “Student 1” to “Student 30”, in individual cells. So when we input the students name, I will just put in “Jane Smith” (for e.g.) in place of “Student 1” for example. There should be no double up’s with names as if there ever are two kids with the same name we usually put a 1 or 2 or whatever on the end to distinguish.
I hope I have explained that ok. As you can no doubt tell, I am not a tech person.
Thanks again for your help. Appreciated.
Cheers
17. Tina says:
Hello,
thank you for your information.
I am just wondering whether I can name a sheet tab name as a cell value in a different sheet?
Cheers.
Tina
• Tom Urtis says:
Hello Tina, yes this can be done. Hit Alt+F11 to get into the VBE. From there. hit Ctrl+R to show the Project window, where you’ll see the name of your open workbook(s) in bold, such as VBAProject(“YourWorkbookName”). Expand that workbook object and you see a yellow folder named Microsoft Excel Objects. Expand that folder and you see the worksheet object names and the ThisWorkbook module. For example, suppose you have two worksheets in your workbook, where one worksheet has the tab name of Budget and the other has the tab name of Expenses. Suppose you want the worksheet named Budget to change to whatever is in cell A1 of the Expenses worksheet. In the VBE, pay particular attention to the object name of the worksheet that you want to change the tab name for. You know its tab name is Budget at the moment. However, suppose its object name is Sheet1, which you would see in the Project window as Sheet1(Budget). Maybe in your workbook the recipient worksheet (whose tab you want to change) is the sheet object named Sheet5(Budget) or Sheet23(Budget). Whatever it is, make a note of the object name of that sheet. Let’s say its object name is Sheet1. Now, in the Project window, double-click on the sheet name that holds the value in its cell A1 that, when it changes, you want the Budget tab to be changed to. As I said, maybe that worksheet is named Expenses, but whatever it is named, in the worksheet module of that sheet, put in this Change event code:
Private Sub Worksheet_Change(ByVal Target As Range)
If Target.Address = “$A$1” Then Sheet1.Name = Range(“A1”).Value
End Sub
If cell A1 gets its value changed as the result of a formula, you’d use the Calculate event:
Private Sub Worksheet_Calculate()
Sheet1.Name = Range(“A1”).Value
End Sub
Of course, there are additional monitors for length (31 characters or less) and illegal sheet naming characters as I posted in my example, but this is the general approach for how a Change event on one worksheet can affect another worksheet.
• Tina says:
Thank you, Tom.
In my case, I want to automatically change the name of Sheet 2 to a child ID inputted in Sheet 1 (say, B2).
Do I open the VBE and select Sheet 1 and then put in the Change Event code? Like:
Private Sub Worksheet_Change(ByVal Target As Range)
If Target.Address = “$B$2” Then Sheet2.Name = Range(“B2”).Value
End Sub
When I did so, it does not seem to change anything. Excel said ‘ambiguous title’ or something, but the warning does not show up anymore.
I need to protect sheet 2. Does it affect anything?
I am such a VBA beginner. Thanks for your help.
Tina
• Tom Urtis says:
Given the scenario you outline, the code would go into the Sheet1 module because it is cell B2 on Sheet1 that is being inputted and hence changed.
The code would be (assuming the VBA object code name for the worksheet whose tab name is currently Sheet2 but which you want to change), then in the Sheet1 module goes this:
Private Sub Worksheet_Change(ByVal Target As Range)
If Target.Address = “$B$2” Then Sheet2.Name = Target.Value
End Sub
• Tina says:
I did what you said but the Excel says ‘Compile error: Ambiguous name detected: Worksheet_Change.’
It is probably because I have other code above starting with the same first line
Private Sub Worksheet_Change(ByVal Target As Range).
How do I solve that?
Even though I deleted my previous codes and typed in your codes, the Excel says ‘syntax error.’
Heaps of thanks
• Tina says:
Or Is there any way to change tab name to a cell value on a protected sheet?
In my case, people input a child ID in Sheet 1 (say B2), and this Child ID will be linked to a cell in sheet 2 (say A2). The second sheet is protected. I want the name of Sheet 2 to change with the Child ID.
How do I solve this issue?
Sorry for so many questions.
Thanks in advance
• Tom Urtis says:
Everything you want to do is doable. The compile error is due to the same event being coded more than once in the same module, violating VBA’s rule about that. Post all your sheet module code so I can see what the other error is. Regarding sheet protection, that is irrelevant for what you are doing with sheet tabs. I already gave you the answer about how to change the tab name of one sheet when another sheet’s cell is changed. If “linked to a cell in Sheet2” means the cell in Sheet2 gets its value from a formula in that cell, then you can alternatively use the Worksheet Calculate event in the Sheet2 module to monitor and change the Sheet2 tab name when that cell’s value gets recalculated.
18. Bruno says:
Hi Tom. I wonder if you could help. The code works great, but the cell I want to “name” the tab is on another tab called data. Cell A6 to be exact. How can I change the code in a way it will search for that specific cell. Thank you
• Tom Urtis says:
Paste the code I posted into your data worksheet module. Change the target cell references (there are a couple of them) from A1 to A6 in the code.
Next, you need to reference the worksheet whose tab name you want to change. To do that, in the VBE hit CTRL+R to show the Project window. Expand the name of your workbook and then expand the Objects folder. Worksheets are objects that have 2 name properties. One name property is is CodeName which never changes. The other name property is its Name which is what you see on its tab. For example, maybe the data sheet is named data on its tab, but Excel regards that sheet object as Sheet2. You would know that by looking at the list of objects and see (for example)
Sheet2(data)
Find the worksheet in the object list that is the worksheet whose tab you want to change when cell A6 is changed on the data sheet. Maybe the worksheet’s CodeName is Sheet5. In my code change this line
ActiveSheet.Name = strSheetName
to this
Sheet5.Name = strSheetName
• Bruno says:
Genius! Works great. But I need this to happen with 5 more sheets (6 in total).
The values in cells A6:A11 should define the names of sheets 1 to 6.
Should I just had the code you gave for each of the sheets or is there a way to keep the code small and just insert the missing parts?
Anyway, I am really amazed with your work. Thank you
• Tom Urtis says:
Replace the code you have with this, that goes into the module of the worksheet where you are changing the values in cells A6:A11. Works when I tested it.
Private Sub Worksheet_Change(ByVal Target As Range)
‘Specify the target cell whose entry shall be the sheet tab name.
If Intersect(Target, Range(“A6:A11”)) Is Nothing Or Target.Cells.Count > 1 Then Exit Sub
‘If the target cell is empty (contents cleared) do not change the sheet name.
If IsEmpty(Target) Then Exit Sub
‘Disallow the entry if it is greater than 31 characters.
If Len(Target.Value) > 31 Then
MsgBox “Worksheet names cannot be more than 31 characters.” & vbCrLf & _
Target.Value & ” has ” & Len(Target.Value) & ” characters.”, _
48, “Keep it under 31 characters.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
‘Sheet tab names cannot contain the characters /, \, [, ], *, ?, or :.
‘Verify that none of these characters are present in the cell’s entry.
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = ” / ”
IllegalCharacter(2) = ” \ ”
IllegalCharacter(3) = “[”
IllegalCharacter(4) = “]”
IllegalCharacter(5) = ” * ”
IllegalCharacter(6) = “?”
IllegalCharacter(7) = “: ”
For i = 1 To 7
If InStr(Target.Value, (IllegalCharacter(i))) > 0 Then
MsgBox “You used a character that violates sheet naming rules.” & vbCrLf & _
“Enter a name without the ” & IllegalCharacter(i) & ” character.”, _
48, “Not a possible sheet name !”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
Next i
‘Verify that the proposed sheet name does not already exist in the workbook.
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = Trim(Target.Value)
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
‘If the worksheet name does not already exist, name the sheet as cell value.
‘Otherwise, advise the user that duplicate sheet names are not allowed.
If bln = False Then
Dim ws As Worksheet, cn As Integer, tRow As Long
tRow = Target.Row – 5
For Each ws In Worksheets
cn = Val(Right(ws.CodeName, Len(ws.CodeName) – 5))
If cn = tRow Then
ws.Name = Target.Text
Exit For
End If
Next ws
Else
MsgBox “There is already a sheet named ” & strSheetName & “.” & vbCrLf & _
“Please enter a unique name for this sheet.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
End If
End Sub
19. Bruno says:
And that does it! Thank you for your help. Greatly appreciated!
20. Ryan B. says:
Hi Tom, I used your formula, but when I close the Excel file and open it again the code disappears, what should I do?
21. Brandon R. says:
I seem to be having trouble finding a solution to this, hopefully you can help.
I need to rename existing worksheets 4 though 10 to the contents of cells B14, B29, B44, B59, B74, B89, and B104 from worksheet 2. Sheet4 would be the contents from B14, sheet5 would be B29, etc. I also need the macro to run anytime those cells are modified.
22. Jamie G says:
Hi Tom,
Can you simplify this code for me? I have a macro that duplicates a template that I have created and then renames the tab based on a list. What I need is this:
I could like to put in a macro that does not allow the user to enter any names into the list that violate the rules of naming a worksheet. I know that it already exists in the code that you have provided, I just don’t know VBA well enough to pull out what I need. My list is in column A in a worksheet called “opportunity pipeline”. Can you give me a modified code to accomplish this?
Thank you!
• Tom Urtis says:
If I understand your set-up correctly, you want to monitor a list of allowable worksheet names that are listed in column A. In that worksheet’s module, with the code I posted, it might be as simple as changing this line:
If Target.Address <> “$A$1” Then Exit Sub
to this:
If Target.Column <> 1 Then Exit Sub
If there’s more to what you need for this to work with your sutuation, please post back.
23. Jamie G says:
Ok, so the code below is what I used. Its not working. I already have a macro that duplicates a tab and renames the worksheet, so I do not need this macro to do that. I simply want this macro to let the user know that they cant use certain characters in the cell and it must be under 31 characters. So what is wrong with this?
[code]
Private Sub Worksheet_Change(ByVal Target As Range)
‘Specify the target cell whose entry shall be the sheet tab name.
If Target.Column A Then Exit Sub
‘Disallow the entry if it is greater than 31 characters.
If Len(Target.Value) > 31 Then
MsgBox “Worksheet names cannot be more than 31 characters.” & vbCrLf & _
Target.Value & ” has ” & Len(Target.Value) & ” characters.”, _
48, “Keep it under 31 characters.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
‘Sheet tab names cannot contain the characters /, \, [, ], *, ?, or :.
‘Verify that none of these characters are present in the cell’s entry.
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = “/”
IllegalCharacter(2) = “\”
IllegalCharacter(3) = “[”
IllegalCharacter(4) = “]”
IllegalCharacter(5) = “*”
IllegalCharacter(6) = “?”
IllegalCharacter(7) = “:”
For i = 1 To 7
If InStr(Target.Value, (IllegalCharacter(i))) > 0 Then
MsgBox “You used a character that violates sheet naming rules.” & vbCrLf & _
“Enter a name without the ”” & IllegalCharacter(i) & “” character.”, _
48, “Not a possible sheet name !!”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
Next i
‘Verify that the proposed sheet name does not already exist in the workbook.
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = Trim(Target.Value)
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
End Sub
[/code]
24. Jamie G says:
Oh also, I tried it with Target.Column 1 like you originally said, but that didn’t work so I was experimenting with “A”. Thank you!
• Tom Urtis says:
This code does exactly what you say you want. I just tested it and it works without any problem. Keep in mind this is technically not a macro but a procedure, specifically a Change event in the worksheet module, and only one Change event is allowed in a module. If you already have a Change event in your sheet module, you need to combine that one and this one into a single Change event procedure.
[code]
Private Sub Worksheet_Change(ByVal Target As Range)
If Target.Column <> 1 Then Exit Sub
‘Disallow the entry if it is greater than 31 characters.
If Len(Target.Value) > 31 Then
MsgBox “Worksheet names cannot be more than 31 characters.” & vbCrLf & _
Target.Value & ” has ” & Len(Target.Value) & ” characters.”, _
48, “Keep it under 31 characters.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
‘Sheet tab names cannot contain the characters /, \, [, ], *, ?, or :.
‘Verify that none of these characters are present in the cell’s entry.
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = “/”
IllegalCharacter(2) = “\”
IllegalCharacter(3) = “[”
IllegalCharacter(4) = “]”
IllegalCharacter(5) = “*”
IllegalCharacter(6) = “?”
IllegalCharacter(7) = “:”
For i = 1 To 7
If InStr(Target.Value, (IllegalCharacter(i))) > 0 Then
MsgBox “You used a character that violates sheet naming rules.” & vbCrLf & _
“Enter a name without the ”” & IllegalCharacter(i) & “” character.”, _
48, “Not a possible sheet name !!”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
Next i
End Sub
[/code]
25. Vincent says:
Thank you very much for your code!
26. dennis f says:
Tom, I just have to say thanks. I’ve been scouring around trying to find something to function exactly as this does, but only yours is turning out right. This has put a really nice touch on my final product.
• Tom Urtis says:
Thanks for the nice message, Dennis! It’s always great to hear from visitors about my material that works for them, so I can continue to improve my website. More content coming in 2017. Happy New Year!
27. Piyush Sharma says:
Hi All,
I went through all the codes above and still cant get any of them working in my file. My file contains 10 tabs in total. The first tab name is “Cover” (sheetcode name Sheet1), 2nd tab name is “Lookup” (sheetcode name Sheet2), the rest of the sheet names have same tab names & sheet code names (viz. Sheet3, Sheet4, Sheet5…Sheet10). In the “cover” tab, I select the region name in cell “C2” basis which the market data validation list in cells “B5:B12” is updated (I am using indirect formula in data validation to return only those markets in drop down list that belong to that region – so if I selected region “Europe” then the drop down list (indirect data validation) in cells B5:B12 (of cover tab) would now show me a list of only European markets. The user can then select the right market (from drop down list) in cells B5:B12. Lets say user upon selecting the region “Europe” in cell C5 (from drop down list) then selects “UK” from the dynamic drop down list in cell B5, selects “France” in cell B6, selects “Italy” in cell B7 and that is it. In such case the tab names of Sheet3, Sheet4 & Sheet5 should automatically change to “UK”, “France” and “Italy” while the remaining tab names would remain as “Sheet6″,”Sheet7″,”Sheet8″,”Sheet9” & “Sheet10” since the user only defined/selected 3 markets (out of 8) in cells B5:B12 (of cover/sheet1 tab).
If a different user changes the region to Latin America (in drop down in cell C5 of cover tab) and then selects the appropriate markets like “Argentina” (from dynamic drop down list) in cell B5 (of cover tab), “Brazil” in cell B6, “Colombia” in cell B7 and “Mexico” in cell B8 then the previous tab names (Sheet3 showing as UK, Sheet4 showing as France & Sheet5 showing as Italy) should now be renamed once again to Argentina (for sheet3 from UK), Brazil (for sheet4 from France), Colombia (for sheet5 from Italy) and Mexico (for sheet6 where sheetcode & tabname was same earlier) while the rest of the sheetcode & tabnames remain same (i.e. sheet7, sheet8, sheet9 & sheet10).
If a user selecting the “Asia Pacific” region from drop down (in cell C5 of cover tab) ends up selecting 8 markets in cells B5:B12 (via dynamic data validation returning APAC markets) then all sheet names (from sheetcode names 3-10) should now reflect the new names i.e. Argentina (tab name for sheetcode “Sheet3”) now becomes lets say “Japan” (new value in cell B5 of cover tab); Brazil (tab name for sheetcode “Sheet4”) now becomes lets say “Australia” (new value in cell B6 of cover tab); Colombia (tab name for sheetcode “Sheet5”) now becomes lets say “Hong Kong” (new value in cell B7 of cover tab); Mexico (tab name for sheetcode “Sheet6”) now becomes lets say “Singapore” (new value in cell B8 of cover tab); Sheet7 (tab name for sheetcode “Sheet7”) now becomes lets say “Taiwan” (new value in cell B9 of cover tab); Sheet8 (tab name for sheetcode “Sheet8”) now becomes lets say “Thailand” (new value in cell B10 of cover tab); Sheet9 (tab name for sheetcode “Sheet9”) now becomes lets say “Phillipines” (new value in cell B11 of cover tab); Sheet10 (tab name for sheetcode “Sheet10”) now becomes lets say “India” (new value in cell B12 of cover tab); so basically the previous 4 market names (& remaining similar tab/sheetcode name) now get renamed with 8 market names (for all sheetcodes “Sheet3” to “Sheet10”).
Finally, if the same user, now selects “North America” region (from drop down list in cell C5 of cover tab) and then uses the dynamic drop down list in cells B5-B12 to just select 2 markets (“US” in cell B5 and “Canada” in cell B6) then all the sheetcodes from “sheet3” to “sheet10” (who have the Asia Pacific market names viz. Japan, Australia, Hong Kong, Singapore, Taiwan, Thailand, Phillipines & India) now get renamed to (US, Canada, Sheet5,Sheet6,Sheet7,Sheet8,Sheet9 & Sheet10).
Hope that requirement made sense. It is a total dynamic tab name renaming dependent on market name selection by the user (via a dynamic drop down list in cells B5:B12 of cover tab). The dynamic drop down list existing in cells B5:B12 is dependent upon the “Region” selection by the user in cells “C5” of the cover tab. I really liked the vba codes on this page and they helped me with previous exercise but I just hit the wall with what I am trying to do now. Any help would be really appreciated 🙂
• Piyush Sharma says:
Just a small correction.. Region name selection is in cell “C2” of cover tab. I may have incorrectly mentioned cell C5 but cell “C2” in cover tab has the drop down list showing region names and when the user selects the region then the 2nd drop down list (in cells B5:B12 containing market list for that region) gets updated based on indirect data validation list).
• Tom Urtis says:
Thanks for following my blog. This is quite a detailed explanation for your question, which I appreciate but which I won’t have the opportunity to digest and answer.
May I suggest you post your question on this forum…
http://www.mrexcel.com/forum/excel-questions/
…which has many Excel experts around the clock available to help provide an answer, sooner than I would be able to in this case. The website is free, and it’s easy to register if you haven’t done so already.
28. Jason Myrick says:
So I used part of your code along with some other code I had and am running into the following issue. The tab name is in cell C4. If I delete that value the name stays but if I then change something else on the worksheet the VBA craps out. If there is a value in C$ everything works fine.
the first part of my code is hiding columns based on a cell and then that is followed by the tab name with your empty cell coding added to the top of that.
I’m pretty new at this VBA thing so I’m sure something is out of whack but cannot pinpoint it. Any help would be greatly appreciated.
Private Sub Worksheet_SelectionChange(ByVal Target As Range)
Dim celltxt As String
celltxt = ActiveSheet.Range(“C2”).Text
If InStr(1, celltxt, “Central New Story”) Or InStr(1, celltxt, “Green”) Or InStr(1, celltxt, “West New Story”) Or InStr(1, celltxt, “Northeast New Story”) Or InStr(1, celltxt, “Southeast New Story”) Then
Columns(“h:i”).EntireColumn.Hidden = False
Else
Columns(“h:i”).EntireColumn.Hidden = True
End If
End Sub
Private Sub Worksheet_Change(ByVal Target As Range)
‘If the target cell is empty (contents cleared) do not change the sheet name.
If IsEmpty(Target) Then Exit Sub
d = ActiveWorkbook.ActiveSheet.Name
Sheets(d).Name = Range(“C4”).Value
End Sub
• Tom Urtis says:
At first glance, the reason why your Change event “craps out” is that you do not have a designated target cell. In my example, I have this as the first line of code (preceded by the comment line):
‘Specify the target cell whose entry shall be the sheet tab name.
If Target.Address <> “$A$1” Then Exit Sub
So in your case you’d presumably want to have (which you currently don’t have)
‘Specify the target cell whose entry shall be the sheet tab name.
If Target.Address <> “$C$4” Then Exit Sub
Otherwise, if you can clue me in to the line of code that errors (it would be highlighted in yellow when you click the Debug button), it will help understand where the error exists.
I did not test all your code, as I say this is my first impression of what is missing in your code as compared to what’s needed that I posted in my code.
• Jason Myrick says:
Thank you for the quick response. I had found an workaround plus another issue I had to resolve about ignoring other sheets so I used this code and it all seems to work. Is there a way to name a sheet something if “C4” is blank instead of just leaving what it was named?
Private Sub Worksheet_Change(ByVal Target As Excel.Range)
If ActiveSheet.Name “Program List” And ActiveSheet.Name “PR DATA” And ActiveSheet.Name “Lists” Then
On Error GoTo Out
If Target = Range(“C4”) Then ActiveSheet.Name = Range(“C4”).Value
Out:
End If
End Sub
29. Julius Grandea says:
Hello. Thanks for sharing your VBA knowledge. I was able to successfully implement your code by placing it in the Workbook module. However, the changes happen only when I type something, or retype the formula which references the name of the tab of the active worksheet from another worksheet. Could you help me with a workaround? The main worksheet is named CP. In CP I have a list of the different worksheet names in one column opposite of which I place a value of 1 or 0 if I want to hide or unhide the worksheet (I have a separate macro for this). But to do this I used generic names for tabs which my users find difficult to remember. Now the same macro still works if I dynamically change the tab name. Problem is the other tab names don’t update automatically even when the formula is in place =CP!Ab5. As I said, I need to either retype formula or just type something. Is there any other trigger I can use to do this automatically? Please help. Thanks.
• Tom Urtis says:
Your question is similar to several other comments on this post regarding the use of a formula instead of a manual change to a cell. It sounds like you need to have a Calculate event instead of a Change event. My question is, where should the code go, and that depends on how your workbook is designed. On your main CP worksheet you have a 2-column list of worksheet names and either a 1 or a 0 next to each name.
Are there worksheets in your workbook OTHER THAN CP that do NOT need to have their names changed, if so, what are their names?
What range on your CP sheet is this 2-column list?
Explain how cell AB5 on the CP sheet has its value changed.
What you want to accomplish is do-able but a more thorough explanation of your workbook’s design is needed in order to suggest the code you’d need.
30. Julius Grandea says:
There are other worksheets that do not require their names changed. In any case, what I do is lock the cells so that they do not become edited, then protect the sheets. In AB5, I use concatenate to combine the values of two different cells from two different worksheets in order to create a unique worksheet name (e.g. G1 for 1st Grading Period plus the section thus the name G1-Section 1) Then I reference the name G1-Section in cell A3 of all worksheets using the formula =CP!Ab5. When teachers create their student list of all their classes in one worksheet, AB5 of worksheet CP is automatically updated, including cell A3 of the other worksheets, but the tab names of said worksheets remain the same not unless I retype the formula =CP!Ab5 or type directly the section. For the other worksheets that do not need renaming, I leave the pertinent cell empty so they are not affected. I got it that some of the answers are found in previous post but could not make heads or tails anymore of the answers because of the varying queries. Thanks in advance for your help. I am an elem teacher by the way.
31. Julius Grandea says:
PS. The worksheet names are contained only in column AB (AB5, etc). Opposite that, in column AC is where I put the value 1 or 0 to hide or unhide each worksheet using a macro I placed in worksheet CP. I tested it already. So long as the names in column AB correspond to the tab names, the macro for hiding/unhiding sheets works perfectly. The problem is how to automatically rename the tabs each time the value of column AB changes which is referenced in cell A3 of the other worksheets. Thanks again.
32. Julius Grandea says:
P.S. The range of the worksheet names in CP is AB5:AB65. Each one is referenced in different sheets: =CP!Ab5, =CP!Ab65 etc. The other worksheets that do not need renaming are either found before AB5 or after AB65. What teachers can do is just change the section in the list found in another worksheet which is referenced in column AB of sheet CP. Thanks again. Hope my explanation is clear enough.
• Tom Urtis says:
So you are saying that on 61 different worksheets (61, because the range of AB5:AB65 comprises 61 cells), on each of those 61 worksheets is cell A3 which also contains the name of the worksheet From the outside looking in based on your explanations, the way the dots connect for G1, C3, and AB whatever is not clear. If you want, which I don’t normally offer, you can send me a replica of your workbook so I can see what is going on in there and how this process works. You might be going about it the best way or there might be a better way, but in any case the problem is definitely solve-able.
33. Tim says:
Hello,
I have a similar question to the last post. I have a workbook that uses a list of Names (on Sheet1) that change each day depending on who is working and who is not. Some days will have 10 people working and others will have 30 so all 30 tabs will not be always be used. I would like to have the tab names change when the workers are listed on Sheet1 A2:A31. I’ve tried some of your formulas above and haven’t had complete success because each tab references A1 which has a formula tied to the list on Sheet1. I think i need the calculate event that you listed but don’t know how to add it into your existing formula. Is there a way to do this?
34. Tim says:
I added a drop down list from a master list of names using data validation.
• Tom Urtis says:
So how do you know which worksheet should respond to a change in which cell? For example, if you change the name in cell A8, how is Excel to know that a particular sheet that you have in mind is the one that should now have its tab be the same name?
35. Tim says:
I can get rid of the list if that helps and simply type the employee name into the cell each day as needed.
36. Tim says:
Each tab has a formula in cell A1 that is tied to A2-A32 on Sheet1. A2-A32 on Sheet1 are where the names will be selected each day as the employees are scheduled. The names will vary day by day which is why I want the sheet names to change each day depending on who we have working.
• Tom Urtis says:
Right-click on your Sheet1 worksheet tab, and left-click to select View Code. Paste the following procedure into the large white area that is the worksheet module. Press Alt+Q to return to the worksheet.
Be aware that there is no error checking in this code to monitor duplicate named in A2:A32 of Sheet1. That means you will get a run time error if there are duplicates in that range. That of course can be included but this is the general idea based on what you said you want to do. Or, you can play it safe and delete whatever is in cells A2:A32 before you enter updated names.
Private Sub Worksheet_Change(ByVal Target As Range)
Dim intRow%
For intRow = 2 To 32
With Cells(intRow, 1)
If Len(.Value) > 1 Then Sheets(intRow).Name = .Value
End With
Next intRow
End Sub
37. Tim says:
This worked perfectly. Thanks so much for the help!! Is it possible to make the sheet name revert back to the default Sheet3, Sheet4, Sheet5 ect, if the cell is blank? I’ve noticed that once I assign the names, the sheets keep that name even if the cell contents are cleared. I don’t understand how writing macros works so if this can’t be done I can work around it. I can also add a list of default names in Column M next to my master list of employee names if the formula can reference that column when the cell is blank. Hope this makes sense.
• Tom Urtis says:
Replace the original code with this revision:
Private Sub Worksheet_Change(ByVal Target As Range)
Dim intRow%
For intRow = 2 To 32
With Cells(intRow, 1)
Select Case Len(.Value)
Case Is > 1: Sheets(intRow).Name = .Value
Case 0: Sheets(intRow).Name = "Sheet" & intRow
End Select
End With
Next intRow
End Sub
38. Tim says:
Ok, it seems to work but every time I select a name a run time error pops up saying Script out of range. I click end and everything seems to be ok. I clear the contents and the sheets default back to the original sheet name but I keep getting the same run time error ‘9’: Script out of range.
39. Tim says:
Disregard the last post. I rebuilt the workbook from scratch and added your code to that and everything seems to be working great now. I’m not sure how I got the other version screwed up but either way, it’s working now. Thanks for all of the help!!!
40. Jesper says:
I have a simple excel document named report.xls. I could really use a vbscript that retrives the cell value on the last row of the sheet in colomn B. The content is always date and time in this format: “17-01-2018 08:02:59”.
I need to rename the excel document with the date information like so: “17012018.xls”
Anyone that could help me ?
Thanks in advance.
41. dale says:
Hi, I need your help. I want to name the sheet2 to be equal to the cell(A2) on sheet1, and sheet3 to be equal to cell(A3) on sheet 1, and so on. How can I do this??
• Tom Urtis says:
Hello Dale – –
Assuming your range of A2:A whatever is populated with as many worksheets as you want to rename, and those worksheets’ tabs are already named with the default “Sheet” prefix, this will do what you want, which I just tested and know works:
Sub NameSheetz()
Dim cell As Range, LastCell As Long, xNumber As Long
With Sheets("Sheet1")
LastCell = .Cells(.Rows.Count, 1).End(xlUp).Row
For Each cell In .Range("A2:A" & LastCell)
xNumber = cell.Row
Worksheets("Sheet" & xNumber).Name = cell.Value
Next cell
End With
End Sub
I recommend you identify the worksheets using the Sheet object name instead of the tab name in case you want to rename already-renamed sheets, but this macro does what you asked for.
• dale says:
Thanks Tom, It worked and this is very helpful, however I can only run it once. If I change the value and try to run the code again, I get an error, “Run-time error “9”: Subscript out of range”
• Tom Urtis says:
That is exactly why I suggested in my reply that you consider using the worksheet codename instead of the tab name. Of course, the macro can only be run once because it expects the tab names to start with “Sheet”, and the tab names will be different as soon as the macro runs the first time. Check to be sure that your worksheet codenames (not tab names, but codenames) are Sheet2 for the sheet that is or was of the tab name Sheet2, that the Sheet3 codename worksheet is or was the same as the Sheet3 tab name, and so on. Then post back if you have verified that.
See this link on my Twitter page for Excel, and then click the image itself to see it more clearly, for the difference between the two naming properties if you are unsure of what I am talking about. Codenames never change so they are more reliable in your case because they will always refer to the worksheet object no matter what that worksheet’s tab name gets changed to.
https://twitter.com/TomUrtis/status/994307204617388032
42. Tammy says:
This is great.
Pivot extract’s sheet naming question…
I have data I drop into a workbook, refresh the pivot, then double click on each period’s result count line to build a separate sheet per period. When that new sheet is generated I would like to reference the new cell on the newly created sheet that holds that sheet’s period name as the sheets name.
I was hoping I could pick say in the pivoted sheet cell D1 (Identify the naming reference cell such as cell AA2) that would contain the new tab’s name for each new sheet as it is created. Maybe have a macro button to perform the double click action on each row result on the pivot and auto name each new sheets with whatever exists in their sheets AA2 cell. Is this possible?
43. Tracy Henderson says:
Hi, I’m really new to all this and I’ve tried reading through all your previous posts but I’m very confused. I have a ‘master’ worksheet that contains names and results, these results are updated monthly from a downloaded document (copy and paste). I have then created separate worksheets within the same workbook for each name which imports their results from the main sheet. So far so good. However the names can change from month to month. I created a concatenate formula which gives me Surname, Forename and a ‘date’ created from text which I use with a small macro to make the tab name.
Private Sub Worksheet_SelectionChange(ByVal Target As Range)
Set Target = Range(“B17”)
If Target = “” Then Exit Sub
Application.ActiveSheet.Name = VBA.Left(Target, 31)
Exit Sub
End Sub
I have a few problems, the first is that if a name disappears from one month to the next it can’t seem to cope and leaves the name in place putting all the results under the wrong tab names. The second is that when I add the new data to the master (with a new ‘date’ to make a unique name) it doesn’t change the tab and then issues errors. When the code highlights an error, it usually highlights the Application line. Finally, if a new name appears it moves the names along, and the end ones don’t have a worksheet to go to, I can’t seem to figure a way to solve these issues. Is there anything that I can do, or am I asking too much?
I would be very grateful for any advice you could give.
Many thanks
• Tom Urtis says:
Wow, a lot going on there. From the sounds of it without seeing your workbook…
• I don’t think the SelectionChange event is what you should be using. If this is a monthly action based on imported data, then running a macro on that data would be better.
• Without references from you about what is where, I can only guess and would probably be wrong as to how your master worksheet is arranged. Maybe names are in column A and results are in column B but without knowing for sure, too hard to say.
• I don’t get what one of your core problems actually stems from. It ***sounds like*** a core problem is naming a worksheet tab based on either a person’s name change or a date change. And I’m not sure what you do when 2 different people name John Smith are listed in your downloads. It’s also unclear if data on existing worksheets is to be appended or deleted and refreshed with new data.
Basically, more info from you would help about what you are working with and where it is located on this or that worksheet.
What you are trying to do is do-able, but how to go about it depends on several factors.
You might want to post your question on a popular Excel forum to which I sometimes contribute, but which has many Excel experts visiting around the clock so you will have access to a wider audience who can also help. That link is https://www.mrexcel.com/forum/excel-questions/ which is free and easy to register.
Tom
44. Katie says:
Hi Tom,
Thanks for the code, it works perfectly. The only issue I have is, my excel tab name is coming from a cell (E3) that is a drop-down box and every time I select a different name it comes up with the message:
‘There is already a sheet named ‘XX’.
Recalculate the formula in cell A1 to return a unique name.’
This happens even if I do not have another tab with that name selected. Do you know how I may be able to adapt the formula to avoid this message every time?
Thanks again for the code, it has been very usegul!
• Tom Urtis says:
Well, let’s see if I understand what you are saying.
If you are on some sheet and you have a drop down box (I assume that means you have data validation) in cell E3, first, what is actually being data validated? Presumably the drop down you speak of is a list of values, and if those values are proposed sheet names and another sheet in that workbook is named the same as an item in that drop down list that you select, then yes, the code is doing its job properly. The issue, speaking to your comment “This happens even if I do not have another tab with that name selected” is not that a particular sheet need be selected, but that any sheet in the workbook, whether selected or not, is already named whatever is selected in the drop down list.
But maybe I am totally misinterpreting your question. If so, please post back with a further explanation of what you are doing. There should be a solution to whatever it is.
45. Alexander says:
Hey Tom I need a simple code for naming a tab on sheet 2, from a cell A13 on sheet 1.
is there one.
• Tom Urtis says:
No problem, but can you please confirm:
• what is the codename of the worksheet whose tab name is Sheet 2.
• how does the entry in cell A13 on Sheet 1 get there — with a formula in cell A13, or is it manually entered, or is it copied and pasted, or some other way.
46. Alexander says:
Wow Thanks for the quick response. Its so wonderful to be able communicate with someone so knowledgeable. Ok, I’m creating a Tie Point list. Sheet 1 will contain all the information for sheet 2 and so on. Sheet 2 codename is TP-XXX.
The information for lets say Tie point 101(TP-101) is manually entered into sheet 1 cell A13, and so on for Tie point 102 (TP-102), sheet 1 cell A14. I simply copy and paste the information from cell A13, to sheet 2 cells D4, to get formulas like (=’TIE IN LIST’!$A$13).
The problem is when I use your 1st code from above it wont transfer info to taps. it doesn’t like the formula in sheet 2 cell D4. each Tap should read TP-101, TP-102 and so on. it works fine without the formula in the cell D4.
Thank you so much for your help Tom.
• Tom Urtis says:
The codename for your sheet 2 could not be TP-XXX. It must be some other codename. Hit Alt+F11 and press Ctrl+R. There in the Project-VBAProject window, find the name of your workbook. Expand the Microsoft Excel Objects folder. In that folder you will see your worksheet names. My guess is that you will see 2 names per worksheet. For example, if you named the worksheet whose tab originally was Sheet1 as TP-101, you might see
Sheet1(TP-101)
and for the worksheet whose tab was originally named Sheet2 you might see
Sheet2(TP-XXX)
What I want to know for sure is what the codenames of those worksheets are.
In my above examples, the two codenames are Sheet1 and Sheet2 but the respective tab names are TP-101 and TP-XXX.
I care about the codenames and which sheet tab names they correspond to.
47. Alexander says:
Ok, yes I see two names, The name for sheet 1 is: sheet1(TIE IN LIST)
the name for sheet 2 is: sheet2(TP-xxx)
sheet 3 name is: sheet3(TP-xxx(2))
and so on.
The tap names currently are, Tab 1: TIE IN LIST
Tab 2: TP-XXX
Tab 3: TP-XXX(2)
and so on.
• Tom Urtis says:
All you need to do is make two small changes to the original procedure I posted for this tutorial.
Small change #1:
The actual first line of code is
If Target.Address <> "$A$1" Then Exit Sub
Change that to
If Target.Address <> "$A$13" Then Exit Sub
Small change #2:
The eighth line of code above the End Sub line is
ActiveSheet.Name = strSheetName
Change that to
Sheet2.Name = strSheetName
That revised code then goes into the Sheet1 (tab name TIE IN LIST) worksheet module.
48. Alexander says:
Tom it works perfectly!
I have now been trying to add tabs (“$A$13″,”A$14”) and so on, to the code, but I can’t seam to get it to work.
How would I add additional Tabs to the Coad so, Sheet3(TP-XXX(2)), Sheet4(TP-XX(3)) etc. will also be linked to sheet1.
49. James says:
Hi Tom!
Thank you for all of your assistance on this board. I read through all of the Q&As here, I have tried combining some of the code you provided and its not working. (I am very green with VBA). What I need to do is change the tab names of 17 different tabs based on 17 different dynamic cells on one tab (data changes based on a drop down). I see how you have instructed others to use the Change function, but I need the formula based on Calculate so that all tabs update automatically (the formula for 1 tab worked perfectly btw…) Thank you again!
• Tom Urtis says:
Thanks for your comment.
It sounds like you can use the worksheet level Calculate event.
Without knowing the particulars of your workbook, the procedure in your worksheet module where the formulas are would be:
Private Sub Worksheet_Calculate()
'your code, depending on which 17 sheets whose tab names you are changing
'would get which value from the 17 dynamic cells being recalculated.
End Sub
50. Alexander says:
James and I seam to have a similar problem. the code works fine for one tab, how do we add additional tabs. in my case, I’m just going down the line A13, A14 and so on.
51. Lee Stang says:
Tom,
As James said, many thanks for this excellent tutotial. I’ve tried many of the VBA scripts You’ve provided on this page and learned so much! But I still can’t get quite the right combination pieced together to do what I want.
In simple terms, I would like my first worksheet (named “index”) to contain the months of the year in A1:A12. These will be typed in depending on how a fiscal year runs – it may be Jan-Dec or it may be Jun-May. The next 24 worksheets will be named with those names plus some fixed text so it will look something like this: Jan GL – Jan P&L – Feb GL – Feb P&L – Mar GL – Mar P&L etc.
This code you wrote comes close to doing what I want but has none of the clever error correction your other code has:
Private Sub Worksheet_Change(ByVal Target As Range)
Dim intRow%
For intRow = 2 To 32
With Cells(intRow, 1)
If Len(.Value) > 1 Then Sheets(intRow).Name = .Value
End With
Next intRow
End Sub
I would also need to reference cells on those worksheets in other formulas. Can I use the CodeName of the worksheet (Sheet1, Sheet2, etc) in my formulas?
Thanks!
Lee
• Tom Urtis says:
Taking that last question first, if your formulas are native Excel worksheet formulas, the answer is no, you cannot use the SheetName project name, but you could if your formulas were UDFs.
The codes I posted in this tutorial were all driven by Change events. In your case, this is not very practical because you can have (for example) a sheet tab named May P&L when the month of May is in cell A5 of your Index sheet today, but you will want that same name in a differently indexed worksheet if May is in cell A9 of the Index sheet. It seems to me that what you could do is to have those 24 sheets created and named first, because month names will always stay the same. Then, the Index position of the sheets can change as you change their order in A1:A12 on the Index sheet. But even then if it were me, I’d do the reordering on the Index sheet and instead of a Change event, I’d have a macro do the sheet-shuffling to correspond their index placement to the order you entered them on the Index sheet. This way you can have (using the May example again) May in cell A7 but you type May into cell A5 which at the moment (a temporary moment) there are two May’s (one in A5 and the other in A7) but a moment later you enter June in cell A6 and July in cell A7. In other words, when the month names are uniquely entered, the macro can then do the shuffling job to put the sheets in the order they show up on the Index sheet.
• Lee Stang says:
If I am understanding what you are saying, renaming of the worksheet tabs would then be unnecessary. I will always have a Jan-Dec set of worksheets but their order would change depending on where a fiscal year would start and end. The only thing that would need to be dynamic would be quarterly report worksheets which would have to link to the correct monthly sheets based on how the fiscal year would run – and that could be set from the index page. This might be an easier solution than the way I was thinking about it. Thanks Tom!
• Tom Urtis says:
Hi Lee, you’re welcome. I am not the biggest fan of index sheet reliance, although as you describe the arrangement would work IF no one moves the sheets around. But I am a big fan of the SheetName property which is VBA-driven and which always refers to a sheet tab name no matter where the sheet is indexed. If you have what you need using the Index route, so much the better, just saying that using the SheetName identifier is also a possibility. Thanks for following my blog!
52. Kashif Uddin Shamsi says:
Thanks dear. It’s awesome.
53. Eric Lee Fleming says:
Tom Urtis, You are an awesome man. thank you so much for this assistance. i got my sheet to work using this code. I want to learn VBA so i can write my own but for now, i follow you. LOL thank you again
54. Allan says:
Hi Tom,
I have A column B15 to B34 in Sheet1
I would like to name my 20 sheets in same workbook based on this column (B15:B34). How can I do it automatically?
Thanks
• Tom Urtis says:
Hello Allan – –
Assuming your sheet with the 20 cells from B15 to B34 is the active sheet
and
you already have 20 worksheets in your workbook
then this will do what you ask:
Sub NaymeSheetz()
Dim i%
For i = 15 To 34
Sheets(i - 14).Name = Cells(i, 2).Value
Next i
End Sub
If there is another aspect to your question that is contrary to my above assumptions, please post back with more detail about what your situation is.
• Allan says:
I replayed to your email but I couldn’t see it now. I will wait may will appear later.
• Tom Urtis says:
Seems that this should work as a macro instead of as a selection change event that you posted, assuming this is a one-time thing on your first sheet that has the list of sheet names in B15:B34.
You did not say what your sheet tab name is that is the first sheet, so I will assume it is Sheet1. Delete that other Selection event code in your workbook in try this:
Sub NaymeSheetz()
Dim i%
For i = 15 To 34
Sheets(i – 13).Name = Worksheets(“Sheet1”).Cells(i, 2).Value
Next i
End Sub
• Allan says:
Thanks Tom.
How to delete other Selection event code in my workbook.
what is the wrong with this?
Private Sub Worksheet_SelectionChange(ByVal Target As Range)
Sheet2.Name = Sheet1.Range(“B15”)
Sheet3.Name = Sheet1.Range(“B16”)
Sheet4.Name = Sheet1.Range(“B17”)
Sheet5.Name = Sheet1.Range(“B18”)
Sheet6.Name = Sheet1.Range(“B19”)
Sheet7.Name = Sheet1.Range(“B20”)
Sheet8.Name = Sheet1.Range(“B21”)
Sheet9.Name = Sheet1.Range(“B22”)
Sheet10.Name = Sheet1.Range(“B23”)
Sheet11.Name = Sheet1.Range(“B24”)
Sheet12.Name = Sheet1.Range(“B25”)
Sheet14.Name = Sheet1.Range(“B27”)
Sheet15.Name = Sheet1.Range(“B28”)
Sheet16.Name = Sheet1.Range(“B29”)
Sheet17.Name = Sheet1.Range(“B30”)
Sheet18.Name = Sheet1.Range(“B31”)
Sheet19.Name = Sheet1.Range(“B32”)
Sheet20.Name = Sheet1.Range(“B33”)
Sheet21.Name = Sheet1.Range(“B34”)
End Sub
• Allan says:
I tried your code but didn’t work
• Tom Urtis says:
“it didn’t work” tells me nothing without more details. It worked for me. I assume you put the macro in a standard module and not in the worksheet module where your Selection event was that you posted earlier.
55. Allan says:
Thanks Tom,
I have a workbook with 20 sheet + first sheet; so the first sheet is the entry sheet. I usually enter lab numbers in the entry sheet (Sheet1); however,that sheet has a column from (B15:B34); each cell of that column (B15:B34) represent a name of one sheet. for example, if I want to give first sheet an name i will enter that lab number in cell (B15),and if the second sheet I have to put the lab number in cell (B16) ans so on .
I used this method be unfortunately , giving me sometimes define error when I click on any cell on the sheet.
Private Sub Worksheet_SelectionChange(ByVal Target As Range)
Sheet2.Name = Sheet1.Range(“B15”)
Sheet3.Name = Sheet1.Range(“B16”)
Sheet4.Name = Sheet1.Range(“B17”)
Sheet5.Name = Sheet1.Range(“B18”)
Sheet6.Name = Sheet1.Range(“B19”)
Sheet7.Name = Sheet1.Range(“B20”)
Sheet8.Name = Sheet1.Range(“B21”)
Sheet9.Name = Sheet1.Range(“B22”)
Sheet10.Name = Sheet1.Range(“B23”)
Sheet11.Name = Sheet1.Range(“B24”)
Sheet12.Name = Sheet1.Range(“B25”)
Sheet14.Name = Sheet1.Range(“B27”)
Sheet15.Name = Sheet1.Range(“B28”)
Sheet16.Name = Sheet1.Range(“B29”)
Sheet17.Name = Sheet1.Range(“B30”)
Sheet18.Name = Sheet1.Range(“B31”)
Sheet19.Name = Sheet1.Range(“B32”)
Sheet20.Name = Sheet1.Range(“B33”)
Sheet21.Name = Sheet1.Range(“B34”)
End Sub
56. Allan says:
Thanks Tom,
Was my mistake, I put it the stand. module.
57. Florian says:
Hello,
I don’t know if my previous message was sent but it work right after i sent it… Although i have another question :
How could you make the script so that it would cut the name if it is more than 31 characters and it would replace any illegal character by a dash (-) ?
Thanks a lot
• Tom Urtis says:
A couple things…
The code is already there to allow only 31 characters. I would keep it like that.
As to replacing the illegal characters with a dash, you can do a replace in the code or beforehand but I would not do that either. Capture the illegal characters either in the code as I have posted the code, or use data validation to disallow those illegal character entries in the first place.
58. Mark says:
Tom,
You seem to be the guru for this, and I think I have a relatively easy question, but can’t work it out.
I have a mastersheet and would like to name new sheets based on C1, Z1, AR1, etc. You’ll notice that each cell is 16 cells to the right (always in row 1). The other thing that makes this possibly complicated is that C1 is merged to X1 likewise Z1 is merged to AP1 which seems to be adding spaces to my sheet names (which makes no sense to me). I would prefer this doesn’t run automatically, because the sheet names may change order.
• Tom Urtis says:
Hello Mark, a couple things – –
(1)
You wrote:
“You’ll notice that each cell is 16 cells to the right…”
Actually, from C to Z is 24 cells to the right and from Z to AR is 19 cells to the right. Different distances and both are different than your stated 16 number.
(2)
Merged cells are a pain and should be avoided at all costs because they are nothing but trouble. My suggestion would be to use Center Across Selection instead of merging cells. Please explain why you are using merged cells instead of Center Across Selection. If there is an unusually compelling reason why merged cells are required, they can still be worked with but they cause many programming issues.
59. Nikou says:
Hi TOM,
thank you for all these information. I was able to use your code and get it working, however i have one minor issue.
I have a master worksheet named “POs” with a list of PO# in cells A1:A20. I have added your code in the “POs” worksheet. The code then renames my other 20 worksheet with the PO#s listed. However the only way to get this to work is that I have to update each PO# separately(lines A1:A20) . If i do a mass update (by copy pasting the 20 PO# into my “POs” worksheet then the other worksheets don’t get renamed.
is there a way around this. I need the code to support mass update of the referenced cell range
• Tom Urtis says:
You can do this with a macro to loop through all the cells in A1:A20 instead of the Change event in my example. Post back if you need help with that.
60. Nikou says:
if you can please help me with the code it would be great. I am very new to VB scripting
Here is my code (really your code :))
—————————-
Private Sub Worksheet_Change(ByVal Target As Range)
‘Specify the target cell whose entry shall be the sheet tab name.
If Intersect(Target, Range(“A2:A20”)) Is Nothing Or Target.Cells.Count > 1 Then Exit Sub
‘If the target cell is empty (contents cleared) do not change the sheet name.
If IsEmpty(Target) Then Exit Sub
‘Disallow the entry if it is greater than 31 characters.
If Len(Target.Value) > 31 Then
MsgBox “Worksheet names cannot be more than 31 characters.” & vbCrLf & _
Target.Value & ” has ” & Len(Target.Value) & ” characters.”, _
48, “Keep it under 31 characters.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
‘Sheet tab names cannot contain the characters /, \, [, ], *, ?, or :.
‘Verify that none of these characters are present in the cell’s entry.
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = ” / ”
IllegalCharacter(2) = ” \ ”
IllegalCharacter(3) = “[”
IllegalCharacter(4) = “]”
IllegalCharacter(5) = ” * ”
IllegalCharacter(6) = “?”
IllegalCharacter(7) = “: ”
For i = 1 To 7
If InStr(Target.Value, (IllegalCharacter(i))) > 0 Then
MsgBox “You used a character that violates sheet naming rules.” & vbCrLf & _
“Enter a name without the ”” & IllegalCharacter(i) & “” character.”, _
48, “Not a possible sheet name !!””
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
Next i
‘Verify that the proposed sheet name does not already exist in the workbook.
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = Trim(Target.Value)
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
‘If the worksheet name does not already exist, name the sheet as cell value.
‘Otherwise, advise the user that duplicate sheet names are not allowed.
If bln = False Then
Select Case Target.Address
Case “$A$2”: Sheet1.Name = strSheetName
Case “$A$3”: Sheet3.Name = strSheetName
Case “$A$4”: Sheet4.Name = strSheetName
Case “$A$5”: Sheet5.Name = strSheetName
Case “$A$6”: Sheet6.Name = strSheetName
Case “$A$7”: Sheet7.Name = strSheetName
Case “$A$8”: Sheet8.Name = strSheetName
Case “$A$9”: Sheet9.Name = strSheetName
Case “$A$10”: Sheet10.Name = strSheetName
Case “$A$11”: Sheet11.Name = strSheetName
Case “$A$12”: Sheet12.Name = strSheetName
Case “$A$13”: Sheet13.Name = strSheetName
Case “$A$14”: Sheet14.Name = strSheetName
Case “$A$15”: Sheet15.Name = strSheetName
Case “$A$16”: Sheet16.Name = strSheetName
Case “$A$17”: Sheet17.Name = strSheetName
Case “$A$18”: Sheet18.Name = strSheetName
Case “$A$19”: Sheet19.Name = strSheetName
Case “$A$20”: Sheet20.Name = strSheetName
End Select
Else
MsgBox “There is already a sheet named ” & strSheetName & “.” & vbCrLf & _
“Please enter a unique name for this sheet.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
End If
End Sub
• Tom Urtis says:
Your messages are inconsistent. First you said you had “other 20 worksheets” for names in (presumably because of your word “other”) a 21st sheet in cells A1:A20. Your code shows only 19 sheets to be named and it’s not clear if the sheet on which the cells from A1:A (either 19 or 20) should be renamed too. Please clarify exactly what you are doing and what sheet holds the 19 or 20 names and if that sheet is one of the 19 or 20 to be renamed.
61. Nikou says:
hi sorry for the confusion.
There are 20 worksheets in total. one of the worksheets is named POs (which is sheet 2). This sheet contains 19 PO Numbers. The PO numbers are in cells A2:A20 of the PO worksheet (or sheet2).
I don’t need sheet2 to be renamed. I need the other 19 worksheets ,sheets1 and sheet3 through 20 to be renamed based on Sheet2 A2:A20 cells. The code works only if I enter cells A2 through A20 one by one. But if I do a mass update the worksheets dont get renamed
I hope this is more clear
thank you
• Tom Urtis says:
Still not clear.
You write, “one of the worksheets is named POs (which is sheet 2).”
And then you write “…of the PO worksheet (or sheet2).”
What does that mean?
• Is tab of the worksheet containing the 19 PO numbers named POs?
• Is tab of the worksheet containing the 19 PO numbers named PO?
• Is tab of the worksheet containing the 19 PO numbers named Sheet 2?
• Is tab of the worksheet containing the 19 PO numbers named Sheet2?
• Is tab of the worksheet containing the 19 PO numbers named whatever it is named and the worksheet object codename is POs?
• Is tab of the worksheet containing the 19 PO numbers named whatever it is named and the worksheet object codename is PO?
• Is tab of the worksheet containing the 19 PO numbers named whatever it is named and the worksheet object codename is Sheet2?
• Is tab of the worksheet containing the 19 PO numbers named whatever it is named and its index number is 2?
It is also a question as to why a sheet 2 (either by tab name, codename, or index number) would be the second sheet and the name of a first sheet of some kind needs to be changed and skip the second sheet of some kind and resume with a third sheet. That sounds like an index issue (how the sheet tabs are arranged from left to right) which is the least reliable way to be sure about which worksheet is properly receiving the name it should.
And is that name a tab name or a codename.
At this point, I respectfully suggest that you clarify what you are working with, and post your question at the MrExcel’s questions forum. I contribute to that forum too, but you you will find a wider and more available collection of Excel experts who can assist you further.
62. Nikou says:
Ok thanks you ill post there. I think Ill do some cleanup based on your comments and re-post there
thanks again
63. Cath says:
Hi Tom,
We used your original post to rename our worksheets and it worked wonderfully.
We have a similar setup to Allen in that the “Summary” page is where the text is entered and transferred through your code to rename the 30 following tabs.
Hoping you can help, we expect users will delete text in the rows not required on the summary page and setoff the unique name error. Is there something we can put in place such as an auto-entry to prevent this?
Thanks
Private Sub Worksheet_Calculate()
With Range(“C13”)
If Len(.Value) = 0 Or Len(.Value) > 31 Then Exit Sub
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = “/”
IllegalCharacter(2) = “\”
IllegalCharacter(3) = “[”
IllegalCharacter(4) = “]”
IllegalCharacter(5) = “*”
IllegalCharacter(6) = “?”
IllegalCharacter(7) = “:”
For i = 1 To 7
If InStr(.Text, (IllegalCharacter(i))) > 0 Then
MsgBox “The trade name contains a character that violates sheet naming rules.” & vbCrLf & _
“Reenter the name without the ”” & IllegalCharacter(i) & “” character.”, _
48, “Not a possible sheet name !!”
Exit Sub
End If
Next i
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = (.Text)
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
If bln = False Then
Sheet3.Name = strSheetName
ElseIf Sheet3.Name .Text Then
MsgBox “There is already a trade named ” & strSheetName & “.” & vbCrLf & _
“Change the name to a unique name.”
End If
End With
End Sub
64. Cath says:
So sorry, answered my own silly question…
ElseIf IsEmpty(Target) Then Exit Sub
65. Heather says:
Hi,
I am hoping you will be able to help me 🙂 I’m brand new to VBA and have taught myself the little pieces I do know. I recently built the following Macro, that duplicates a “master” tab when a specific cell is populated with specific text:
Private Sub Worksheet_Change(ByVal Target As Range)
If Not Intersect(Target, Range(“A5:A200”)) Is Nothing Then
Select Case Range(“A5”)
Case “ACUM”: CopyRename
Case “AFTR”: CopyRename
Case “ALG”: CopyRename
Case “ALGT”: CopyRename
Case “ALMT”: CopyRename
Case “AMB”: CopyRename
Case “AUTB”: CopyRename
Case “BASE”: CopyRename
Case “BLD”: CopyRename
Case “CDIP”: CopyRename
Case “CDOP”: CopyRename
Case “CDO1”: CopyRename
Case “CDRR”: CopyRename
Case “CHIR”: CopyRename
Case “CMPL”: CopyRename
Case “COIN”: CopyRename
Case “CRCS”: CopyRename
Case “DED”: CopyRename
Case “DED1”: CopyRename
Case “DED2”: CopyRename
Case “DED3”: CopyRename
Case “DED4”: CopyRename
Case “DED5”: CopyRename
Case “DEN”: CopyRename
Case “DMEB”: CopyRename
Case “DMES”: CopyRename
Case “DPP”: CopyRename
Case “DUMY”: CopyRename
Case “EMER”: CopyRename
Case “EMPH”: CopyRename
Case “EPOT”: CopyRename
Case “EXAB”: CopyRename
Case “FAM”: CopyRename
Case “GRP”: CopyRename
Case “GYN”: CopyRename
Case “HC”: CopyRename
Case “HCSS”: CopyRename
Case “HEAR”: CopyRename
Case “HH”: CopyRename
Case “HLTH”: CopyRename
Case “HOOP”: CopyRename
Case “HOS2”: CopyRename
Case “HOSP”: CopyRename
Case “HRA”: CopyRename
Case “HRA2”: CopyRename
Case “INFT”: CopyRename
Case “LAB”: CopyRename
Case “LTM”: CopyRename
Case “MHBI”: CopyRename
Case “MHBO”: CopyRename
Case “MHIP”: CopyRename
Case “MHOP”: CopyRename
Case “OPM”: CopyRename
Case “OPM1”: CopyRename
Case “OPM2”: CopyRename
Case “OPM3”: CopyRename
Case “OPM4”: CopyRename
Case “OPM5”: CopyRename
Case “OPM6”: CopyRename
Case “OPT”: CopyRename
Case “OVC”: CopyRename
Case “OVC2”: CopyRename
Case “OVC3”: CopyRename
Case “OVC4”: CopyRename
Case “OVC5”: CopyRename
Case “OVC6”: CopyRename
Case “OVC7”: CopyRename
Case “OVC8”: CopyRename
Case “OXYG”: CopyRename
Case “PP”: CopyRename
Case “PNMT”: CopyRename
Case “ORTH”: CopyRename
Case “PV”: CopyRename
Case “REHB”: CopyRename
Case “REOP”: CopyRename
Case “RX01”: CopyRename
Case “RX02”: CopyRename
Case “RX03”: CopyRename
Case “RX04”: CopyRename
Case “RX05”: CopyRename
Case “RX06”: CopyRename
Case “SGOP”: CopyRename
Case “SNF”: CopyRename
Case “SNKR”: CopyRename
Case “SPVC”: CopyRename
Case “STU”: CopyRename
Case “TABS”: CopyRename
Case “TRAN”: CopyRename
Case “TRGN”: CopyRename
Case “TRVL”: CopyRename
Case “WLCH”: CopyRename
Case “XPRO”: CopyRename
Case “XRAY”: CopyRename
Case “VADD”: CopyRename
Case “DIAL”: CopyRename
Case “EFED”: CopyRename
Case “EP2R”: CopyRename
Case “EPO”: CopyRename
Case “FRST”: CopyRename
Case “GYN1”: CopyRename
Case “HEA1”: CopyRename
Case “KPCV”: CopyRename
Case “MDCV”: CopyRename
Case “MDEX”: CopyRename
Case “MHO1”: CopyRename
Case “REO1”: CopyRename
Case “REXC”: CopyRename
Case “RHLF”: CopyRename
Case “RHLP”: CopyRename
Case “RHPQ”: CopyRename
Case “RHSC”: CopyRename
Case “RKPO”: CopyRename
Case “RTHA”: CopyRename
Case “RX”: CopyRename
Case “SPV1”: CopyRename
End Select
End If
If Not Intersect(Target, Range(“J5:J200”)) Is Nothing Then
Select Case Range(“J5”)
Case “ACUM”: CopyRename
Case “AFTR”: CopyRename
Case “ALG”: CopyRename
Case “ALGT”: CopyRename
Case “ALMT”: CopyRename
Case “AMB”: CopyRename
Case “AUTB”: CopyRename
Case “BASE”: CopyRename
Case “BLD”: CopyRename
Case “CDIP”: CopyRename
Case “CDOP”: CopyRename
Case “CDO1”: CopyRename
Case “CDRR”: CopyRename
Case “CHIR”: CopyRename
Case “CMPL”: CopyRename
Case “COIN”: CopyRename
Case “CRCS”: CopyRename
Case “DED”: CopyRename
Case “DED1”: CopyRename
Case “DED2”: CopyRename
Case “DED3”: CopyRename
Case “DED4”: CopyRename
Case “DED5”: CopyRename
Case “DEN”: CopyRename
Case “DMEB”: CopyRename
Case “DMES”: CopyRename
Case “DPP”: CopyRename
Case “DUMY”: CopyRename
Case “EMER”: CopyRename
Case “EMPH”: CopyRename
Case “EPOT”: CopyRename
Case “EXAB”: CopyRename
Case “FAM”: CopyRename
Case “GRP”: CopyRename
Case “GYN”: CopyRename
Case “HC”: CopyRename
Case “HCSS”: CopyRename
Case “HEAR”: CopyRename
Case “HH”: CopyRename
Case “HLTH”: CopyRename
Case “HOOP”: CopyRename
Case “HOS2”: CopyRename
Case “HOSP”: CopyRename
Case “HRA”: CopyRename
Case “HRA2”: CopyRename
Case “INFT”: CopyRename
Case “LAB”: CopyRename
Case “LTM”: CopyRename
Case “MHBI”: CopyRename
Case “MHBO”: CopyRename
Case “MHIP”: CopyRename
Case “MHOP”: CopyRename
Case “OPM”: CopyRename
Case “OPM1”: CopyRename
Case “OPM2”: CopyRename
Case “OPM3”: CopyRename
Case “OPM4”: CopyRename
Case “OPM5”: CopyRename
Case “OPM6”: CopyRename
Case “OPT”: CopyRename
Case “OVC”: CopyRename
Case “OVC2”: CopyRename
Case “OVC3”: CopyRename
Case “OVC4”: CopyRename
Case “OVC5”: CopyRename
Case “OVC6”: CopyRename
Case “OVC7”: CopyRename
Case “OVC8”: CopyRename
Case “OXYG”: CopyRename
Case “PP”: CopyRename
Case “PNMT”: CopyRename
Case “ORTH”: CopyRename
Case “PV”: CopyRename
Case “REHB”: CopyRename
Case “REOP”: CopyRename
Case “RX01”: CopyRename
Case “RX02”: CopyRename
Case “RX03”: CopyRename
Case “RX04”: CopyRename
Case “RX05”: CopyRename
Case “RX06”: CopyRename
Case “SGOP”: CopyRename
Case “SNF”: CopyRename
Case “SNKR”: CopyRename
Case “SPVC”: CopyRename
Case “STU”: CopyRename
Case “TABS”: CopyRename
Case “TRAN”: CopyRename
Case “TRGN”: CopyRename
Case “TRVL”: CopyRename
Case “WLCH”: CopyRename
Case “XPRO”: CopyRename
Case “XRAY”: CopyRename
Case “VADD”: CopyRename
Case “DIAL”: CopyRename
Case “EFED”: CopyRename
Case “EP2R”: CopyRename
Case “EPO”: CopyRename
Case “FRST”: CopyRename
Case “GYN1”: CopyRename
Case “HEA1”: CopyRename
Case “KPCV”: CopyRename
Case “MDCV”: CopyRename
Case “MDEX”: CopyRename
Case “MHO1”: CopyRename
Case “REO1”: CopyRename
Case “REXC”: CopyRename
Case “RHLF”: CopyRename
Case “RHLP”: CopyRename
Case “RHPQ”: CopyRename
Case “RHSC”: CopyRename
Case “RKPO”: CopyRename
Case “RTHA”: CopyRename
Case “RX”: CopyRename
Case “SPV1”: CopyRename
End Select
End If
End Sub
it works phenomenally! However, I am now trying to build a macro (similar to yours above I believe) that will auto-name the new tabs with the values that are concatenated with the current macro. (ie: Cell A5:A200 is what triggers the current macro, there are also values in B5:B200 and the values in A5:A200 are concatenated together in C5:C200) I want the new macro to use the values that are loaded in C5:C200 to be the names of the new tabs created when a value is populated in A5:A200.
Is there any way to do this?
Thank You,
Heather
• Heather says:
An Example of the Concatenate Cells is: ALMT – B5
I have it set up to include a space in-between each value and includes a -. ALMT is what is in cell A5 and B5 is what is in cell C5.
I also forgot to mention that all of cells A5:A200 are values that are compiled via a drop down list to trigger the current macro.
Thank You So Much in advance for your help!
• Tom Urtis says:
A lot of cases there. A few questions:
(1)
Why monitor changes to all cells in A5:A200 if you only care about cells A5 and J5 per your two Select Case lines.
(2)
What exactly is “CopyRename”?
(3)
This drop down list that you mentioned, first, I assume it is data validation, but can you confirm that.
(4)
More importantly, are those items such as ACUM, AFTR and so on the ***ONLY*** values allowed in the cells.
(5)
Are there worksheets whose tab names are those drop down items? I’m not clear on what you are doing and what all these cases are for and why only 2 cells (A5 and J5) are monitored for changes.
• Heather says:
Hi Tom, Thank you for the quick response!
(1)
Why monitor changes to all cells in A5:A200 if you only care about cells A5 and J5 per your two Select Case lines.—I care about all values in all cells from A5-A200 and J5-J200. The only way I could get the case to work was by entering in A5 and J5 in the second lines of the macro…..it currently works, however I could have done something wrong, this is the first time I’ve ever created anything like this before.
(2)
What exactly is “CopyRename”?
CopyRename is the Macro that I created that copies the master tab. So when A5-A200 or J5-J200 is populated with one of the above terms, it triggers the macro “CopyRename” and duplicates the tab requesting a name be entered.
(3)
This drop down list that you mentioned, first, I assume it is data validation, but can you confirm that.
The drop down list I created includes all of the values listed above in the macro. I build insurance codes for an insurance company and these are all of our available benefits to be built onto an insurance plan.
(4)
More importantly, are those items such as ACUM, AFTR and so on the ***ONLY*** values allowed in the cells.
You can type other values in the cells, however, it will not trigger the macro to build a new “master” tab and rename it. It’s only when these values are entered that the macro is triggered.
(5)
Are there worksheets whose tab names are those drop down items? I’m not clear on what you are doing and what all these cases are for and why only 2 cells (A5 and J5) are monitored for changes.
Basically, for every code my team creates, I need a new auditing tab (MASTER) tab to be created for that code. I’m trying to get it to automatically name the tab to match the values listed in A5 and B6 or A200 and B200.
Is there a way that I can attach the file? I truly appreciate your help!
• Tom Urtis says:
So you are saying that you want to have select cases for every individual cell in A5:A200 like you do for A5 and J5? I don’t understand how J5 (or column J for that matter) figures into anything Change-wise if you only care about monitoring A5:A200. And I don’t understand what a “new master tab” is and what it would look like when it gets created as the result of a change to a cell. This is more of a project to show an Excel developer and maybe have them show you how to do it or have them do it, depending on its complexity that I don’t fully comprehend.
• Tom Urtis says:
See my reply to your follow-up comment.
66. Jason says:
Hi Tom
Thank you for your code, I’m using the below as the starting point of what I am trying to achieve;
Private Sub Worksheet_Change(ByVal Target As Range)
‘Specify the target cell whose entry shall be the sheet tab name.
If Intersect(Target, Range(“A6:A11”)) Is Nothing Or Target.Cells.Count > 1 Then Exit Sub
‘If the target cell is empty (contents cleared) do not change the sheet name.
If IsEmpty(Target) Then Exit Sub
‘Disallow the entry if it is greater than 31 characters.
If Len(Target.Value) > 31 Then
MsgBox “Worksheet names cannot be more than 31 characters.” & vbCrLf & _
Target.Value & ” has ” & Len(Target.Value) & ” characters.”, _
48, “Keep it under 31 characters.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
‘Sheet tab names cannot contain the characters /, \, [, ], *, ?, or :.
‘Verify that none of these characters are present in the cell’s entry.
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = ” / ”
IllegalCharacter(2) = ” \ ”
IllegalCharacter(3) = “[”
IllegalCharacter(4) = “]”
IllegalCharacter(5) = ” * ”
IllegalCharacter(6) = “?”
IllegalCharacter(7) = “: ”
For i = 1 To 7
If InStr(Target.Value, (IllegalCharacter(i))) > 0 Then
MsgBox “You used a character that violates sheet naming rules.” & vbCrLf & _
“Enter a name without the ” & IllegalCharacter(i) & ” character.”, _
48, “Not a possible sheet name !”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
Next i
‘Verify that the proposed sheet name does not already exist in the workbook.
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = Trim(Target.Value)
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
‘If the worksheet name does not already exist, name the sheet as cell value.
‘Otherwise, advise the user that duplicate sheet names are not allowed.
If bln = False Then
Dim ws As Worksheet, cn As Integer, tRow As Long
tRow = Target.Row – 5
For Each ws In Worksheets
cn = Val(Right(ws.CodeName, Len(ws.CodeName) – 5))
If cn = tRow Then
ws.Name = Target.Text
Exit For
End If
Next ws
Else
MsgBox “There is already a sheet named ” & strSheetName & “.” & vbCrLf & _
“Please enter a unique name for this sheet.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
End If
End Sub
I want to edit this so that a range of predefined sheet names are changed based on a range of cells (not necessarily sheets 1 to 6). Changing the range of cells is straightforward but can you provide some guidance on what I would need to change in the above code if say I wanted to rename sheets 5 to 10?
Thanks
• Tom Urtis says:
There are a few ways to interpret your question so can you please describe a different way what you mean.
For example, my code does reference a range of cells but you wrote “I want to edit this so that a range of predefined sheet names are changed based on a range of cells”.
Another example, what does “rename sheets 5 to 10” mean? Sheet tabs are named Sheet5, Sheet6, and so on up to a tab named Sheet10? Or do you mean the index of sheets (their positional sequence from left to right in the workbook from the fifth to the tenth), Or do you mean range A5:A10 because you said what I quoted in my first example. Or do you mean VBA sheet codename Sheet5 to Sheet10.
• Jason says:
Thanks for your quick reply in answer to your questions:
1) I’m happy with the first edit for the range of cells – so no input from you required here I just included for reference.
2) I was referring to sheet tabs “sheet5, Sheet6, Sheet7, … etc the exact sheet number range I am comfortable I can edit it, is how to bring a range of sheets into your code that I was struggling with.
3) I’m new to VBA but I assume it is possible to assign a VBA constant to a particular sheet number, so that it can be referenced by this, although this would be useful probably isn’t necessary to achieve the above but I’m happy to define the sheet names with a constant in VBA if that makes the solution easier/more efficient but I would need to know the syntax to achieve this.
Below is the code I’m currently using which does achieve the desired effect but
1 its a bit clunky (I assume a loop could be used),
2 it requires an action to activate (macro button or similar which I have incorporated as a temporary fix) and
3 it doesn’t have any of the check functions your code has.
Sub RenameSheet()
Sheet10.Name = Sheet10.Range(“A1”)
Sheet12.Name = Sheet12.Range(“A1”)
Sheet13.Name = Sheet13.Range(“A1”)
Sheet14.Name = Sheet14.Range(“A1”)
Sheet15.Name = Sheet15.Range(“A1”)
Sheet16.Name = Sheet16.Range(“A1”)
Sheet17.Name = Sheet17.Range(“A1”)
Sheet18.Name = Sheet18.Range(“A1”)
Sheet19.Name = Sheet19.Range(“A1”)
Sheet20.Name = Sheet20.Range(“A1”)
Sheet21.Name = Sheet21.Range(“A1”)
Sheet22.Name = Sheet22.Range(“A1”)
Sheet23.Name = Sheet23.Range(“A1”)
Sheet24.Name = Sheet24.Range(“A1”)
Sheet25.Name = Sheet25.Range(“A1”)
Sheet26.Name = Sheet26.Range(“A1”)
Sheet27.Name = Sheet27.Range(“A1”)
Sheet28.Name = Sheet28.Range(“A1”)
Sheet29.Name = Sheet29.Range(“A1”)
Sheet30.Name = Sheet30.Range(“A1”)
End Sub
• Tom Urtis says:
There is a loop recommendation I can make, but before that, is there a reason why you skip Sheet11 although there seems to be a space for it in your code. What is so special about Sheet11.
• Jason says:
Sheet 11 was a master sheet that I created but its not a problem if the sheets need to be sequential I can move the data around if necessary.
Thanks
• Tom Urtis says:
Keep it simple and use Sheet11 as you have Sheet10 and Sheets 12 to 30.
This should do what you want.
Sub ChangeSheetNames()
Dim xCounter As Integer, strNewName As String
For xCounter = 10 To 30
With Sheets("Sheet" & xCounter)
strNewName = .Range("A1").Value
'Disallow if it is greater than 31 characters.
If Len(strNewName) > 31 Then
MsgBox "Worksheet names cannot be more than 31 characters." & vbCrLf & _
strNewName & " has " & Len(strNewName) & " characters.", _
48, "Keep it under 31 characters."
Exit Sub
End If
'Sheet tab names cannot contain the characters /, \, [, ], *, ?, or :.
'Verify that none of these characters are present in the cell's entry.
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = "/"
IllegalCharacter(2) = "\"
IllegalCharacter(3) = "["
IllegalCharacter(4) = "]"
IllegalCharacter(5) = "*"
IllegalCharacter(6) = "?"
IllegalCharacter(7) = ":"
For i = 1 To 7
If InStr(strNewName, (IllegalCharacter(i))) > 0 Then
MsgBox "You used a character that violates sheet naming rules." & vbCrLf & _
"Enter a name without the ''" & IllegalCharacter(i) & "'' character.", _
48, "Not a possible sheet name !!"
Exit Sub
End If
Next i
'Verify that the proposed sheet name does not already exist in the workbook.
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = strNewName
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
'If the worksheet name does not already exist, name the sheet as cell value.
'Otherwise, advise the user that duplicate sheet names are not allowed.
If bln = False Then
Sheets("Sheet" & xCounter).Name = strNewName
Else
MsgBox "There is already a sheet named " & Sheets("Sheet" & xCounter) & "." & vbCrLf & _
"Please enter a unique name for this sheet."
End If
End With
Next xCounter
End Sub
67. Jason says:
Hi I must be missing something I’ve entered the below on the cover sheet I am using to populate the names of the other sheets. Do you think it’s an issue with “strNewName = .Range(“G15:G35″).Value”
Sub ChangeSheetNames()
Dim xCounter As Integer, strNewName As String
For xCounter = 10 To 30
With Sheets(“Sheet” & xCounter)
strNewName = .Range(“G15:G35”).Value
‘Disallow if it is greater than 31 characters.
If Len(strNewName) > 31 Then
MsgBox “Worksheet names cannot be more than 31 characters.” & vbCrLf & _
strNewName & ” has ” & Len(strNewName) & ” characters.”, _
48, “Keep it under 31 characters.”
Exit Sub
End If
‘Sheet tab names cannot contain the characters /, \, [, ], *, ?, or :.
‘Verify that none of these characters are present in the cell’s entry.
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = “/”
IllegalCharacter(2) = “\”
IllegalCharacter(3) = “[”
IllegalCharacter(4) = “]”
IllegalCharacter(5) = “*”
IllegalCharacter(6) = “?”
IllegalCharacter(7) = “:”
For i = 1 To 7
If InStr(strNewName, (IllegalCharacter(i))) > 0 Then
MsgBox “You used a character that violates sheet naming rules.” & vbCrLf & _
“Enter a name without the ”” & IllegalCharacter(i) & “” character.”, _
48, “Not a possible sheet name !!”
Exit Sub
End If
Next i
‘Verify that the proposed sheet name does not already exist in the workbook.
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = strNewName
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
‘If the worksheet name does not already exist, name the sheet as cell value.
‘Otherwise, advise the user that duplicate sheet names are not allowed.
If bln = False Then
Sheets(“Sheet” & xCounter).Name = strNewName
Else
MsgBox “There is already a sheet named ” & Sheets(“Sheet” & xCounter) & “.” & vbCrLf & _
“Please enter a unique name for this sheet.”
End If
End With
Next xCounter
End Sub
Thanks again
Jason
• Tom Urtis says:
Change this
strNewName = .Range(“G15:G35”).Value
to this
strNewName = .Cells(xCounter + 5, 7).Value
• Jason says:
Thanks Tom I get a run-time error 9 Subscript out of range. I think there’s also a problem with this line
With Sheets(“Sheet” & xCounter) I think “sheet” is referencing a sheet named “sheet” rather than the VB sheet number. I have tried removing the “” to no avail any thoughts?
Ta
• Tom Urtis says:
I assumed that you were relying in the worksheets’ default names (and not index numbers) starting with the sheets you care about as the default Sheet10, Sheet11, and so on up to Sheet30.
Guessing without seeing your workbook, but maybe all that needs to be done now is to change this
With Sheets(“Sheet” & xCounter)
to this
With Sheets(xCounter)
which will deal with those worksheets in their indexed position of tenth through and including thirtieth.
• Jason says:
Thanks I cannot get my head around this sorry to keep bothering you, the below code now only works bizarrely for sheet 33 but no other sheets. It also only runs when I click the play button in the VB application so it looks like I need a trigger event of some sort. Any idea
Sub ChangeSheetNames()
Dim xCounter As Integer, strNewName As String
For xCounter = 10 To 30
With Sheets(xCounter)
strNewName = .Range(“A1”).Value
‘Disallow if it is greater than 31 characters.
If Len(strNewName) > 31 Then
MsgBox “Worksheet names cannot be more than 31 characters.” & vbCrLf & _
strNewName & ” has ” & Len(strNewName) & ” characters.”, _
48, “Keep it under 31 characters.”
Exit Sub
End If
‘Sheet tab names cannot contain the characters /, \, [, ], *, ?, or :.
‘Verify that none of these characters are present in the cell’s entry.
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = “/”
IllegalCharacter(2) = “\”
IllegalCharacter(3) = “[”
IllegalCharacter(4) = “]”
IllegalCharacter(5) = “*”
IllegalCharacter(6) = “?”
IllegalCharacter(7) = “:”
For i = 1 To 7
If InStr(strNewName, (IllegalCharacter(i))) > 0 Then
MsgBox “You used a character that violates sheet naming rules.” & vbCrLf & _
“Enter a name without the ”” & IllegalCharacter(i) & “” character.”, _
48, “Not a possible sheet name !!”
Exit Sub
End If
Next i
‘Verify that the proposed sheet name does not already exist in the workbook.
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = strNewName
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
‘If the worksheet name does not already exist, name the sheet as cell value.
‘Otherwise, advise the user that duplicate sheet names are not allowed.
If bln = False Then
Sheets(xCounter).Name = strNewName
Else
MsgBox “There is already a sheet named ” & Sheets(xCounter) & “.” & vbCrLf & _
“Please enter a unique name for this sheet.”
End If
End With
Next xCounter
End Sub
• Jason says:
Having had a bit more of a play with it the later tabs will only rename if the tab before has also been altered I guess its an issue with the duplication check.
‘Verify that the proposed sheet name does not already exist in the workbook.
I also think there is an issue with the value of xcounter not resetting once the loop is completed I’ve tried defining a value before the loop starts for xcounter with varying success.
Thinking a bit more logically an easier solution may be just to make every tab rename to a fixed cell. i.e. every tab has the desired name included in cell A1, I can then vary the value of cell A1 from a control sheet. The issue I foresee with this is I would need some kind of trigger event to update all of the sheet names?
Would this be easier to achieve?
• Tom Urtis says:
That’s what I thought you had… The desired new tab name in cell A1 of those 21 worksheets. I’m tied up today and tomorrow but if you’re still stuck on Friday, send me the workbook on Friday and I can take a look at it then.
68. Esther says:
Hi, Tom! Thanks for the excellent tutorial! I’ve read through all your replies, but am not quite finding the answer to what I’m trying to do. Feel like I’m missing something simple, but not sure what it is.
Let me start off by saying, I am totally new to VB, so go easy on me. 🙂 What I’m trying to do is build a backup time card tracking spreadsheet for myself and my team. There will be 26 tabs, each covering two weeks’ worth of time. The start date for the two weeks will be in C2 and the end date in Q2 on each sheet. I only enter the date on the first tab at the beginning of the year. The format is yyyy-mm-dd, though when I click on the cell, it keeps showing as m/d/yyyy, no matter what I type, so was expecting it to give me errors on the first tab. All the other dates in the workbook are calculated as the previous day + 1, including C2 on the other tabs. I do not have a tab with a list of dates, though if necessary, I guess I could add it. (That was going to be my next attempt, since you have so many more examples of that above.)
Ideally, what I’d like is for the tabs to be named “[Start Date} to {End Date]”, but I’d settle for getting either Start or End to work! I put your original procedure against ThisWorkbook as described above. All the tabs currently have their original names, i.e. Sheet1 (Sheet1). The only thing I changed in your code was to change
If Target.Address “$A$1” Then Exit Sub
to
If Target.Address “$C$2” Then Exit Sub
Compiles with no errors, but doesn’t change any tab names. I’ve tried removing the date to see if it’d at least give me an error. That didn’t do anything either. I am working in Excel O365, if that makes a difference.
I’d appreciate any insights you are willing to offer!
• Tom Urtis says:
Hello, Esther – –
I read your message a couple times, and I’m not clear on a few points if you can help me understand.
(1)
You say there are 26 tabs in your workbook. Does that really mean 26 worksheets or are there any other worksheets in the workbook besides the 26.
(2)
You say each tab covers two weeks of time, and the start date is in cell C2 and the end date is in cell Q2. Two weeks equals 14 days but C2:Q2 is 15 cells, not 14, so what is the reason for that.
(3)
Upon what action exactly is it, and where would that action be (such as cell address and sheet name), which would trigger the result you want to achieve.
(4)
A basic point here that I should have put as #1, are you sure that your macro settings are set to allow you to run VBA code in your workbook.
The formatting issue won’t be a problem, but (and I’m going easy on you as you requested, which I would have done anyway) I first would want to get a handle on exactly what the workbook design is from a sheet count standpoint, and a cell range standpoint, and a security settings standpoint. If you don’t know how to verify your macro settings, don’t worry about not knowing, just come back here and say so if that’s the case and I will show you how. I never know how basic or un-basic to get with replies to someone totally new to VBA as you said you are, which I mention because on the face of your description as I read it, it sounds like you did things correctly, but maybe you are missing a loop to nail all the sheets.
In any case, post your code if you need to, and let me know about those 4 items. I’ll be offline until tomorrow but will check my blog comments tomorrow if you get back to me between now and then.
• Esther says:
1/ I have a total of 26 worksheets in the workbook.
2/ I have a sub-total column in between the two weeks, therefore an extra column.
3/ At the beginning of the calendar year, I want to put a date in Sheet1:C2. The dates on Sheet2:C2-Sheet26:C2 are calculated based on the previous day +1. Once that date is saved the first time, it shouldn’t get updated again until the following year. (Just so you know, we’ve been using a version of this workbook for four years as a way to easily keep track of your time during the week, to enter into the actual time card system on Fridays. It’s just been that for the last four years, I’ve gone through and manually updated the dates every year. Was trying to simplify.)
4/ I think so. Have saved as an .xlsm and on my Macro Security Settings, I have enabled “Trust access to the VBA project object Model.” I do have “Disable all macros with notification” enabled, but you said this is a process, not a macro, so thought that would be OK.
• Esther says:
Oh, forgot to mention, I copied your original code above and only changed the on $A$1 reference to $C$2. Everything else is the same.
• Tom Urtis says:
Whether it is a macro or a procedure, as far as Excel is concerned, the fact remains that programming code is somehow involved.
Change your macro setting to “Enable all macros (not recommended; potentially dangerous code can run”) and try running the code again. If that works, then decide if you want to keep that setting, or the setting above it (Disable all macros except digitally signed macros).
• Esther says:
I rebooted this morning. When I opened the spreadsheet, it told me that macros were disabled, so I enabled them. Changed the data in Sheet1!C2. No change. I went into Macro Security and enabled all macros. No change. Tried it with the option for digitally signed, too. No change. Maybe I just don’t know how to run the process? In the VB Console, when I try to Run, it asks me to create a macro, but you said this isn’t one. In reading above, it looks like the trigger is changing the value in the cell. Is that not correct?
The first sub-routine is:
Private Sub Worksheet_Change(ByVal Target As Range)
‘Specify the target cell whose entry shall be the sheet tab name.
If Target.Address “$C$2” Then Exit Sub
‘If the target cell is empty (contents cleared) do not change the sheet name.
If IsEmpty(Target) Then Exit Sub
• Tom Urtis says:
This is not a macro, it is an event procedure. It gets triggered when, on the worksheet whose module it is in, cell C2 is changed.
So, for the worksheet where you want to enter something into cell C2, if you right click onto that sheet tab, and you select View Code, you would see that Worksheet_Change event. If you do not see that procedure there in the worksheet module where it should be, that means you have it in a different worksheet module, or more likely, you have it in a standard module such as where macros go. Maybe a module named Module1 or whatever. But in any case, if you do have it in a standard module, then you have the code in the wrong place. Event procedure codes must be housed in the worksheet or ThisWorkbook module depending on it it is an worksheet level event (as this one is) or a workbook level event.
69. Esther says:
Tom, when I View Source from Sheet1, I do not see the Worksheet_Change code. I put the code on the This Workbook item in the VBA Console. Sheet1 is blank, as are the other sheets.
• Tom Urtis says:
Take the code out of the ThisWorkbook module and put it in the worksheet module. Also, maybe you are working on a totally different Excel version or maybe a Mac. What you should be seeing as a popup menu item when you right click a sheet tab is View Code as I said, not View Source as you said.
• Esther says:
So, I need to copy it to all 26 worksheets? I want all the worksheets to update when I change the date on the first worksheet.
Sorry, it does say View Code. My mistake.
• Tom Urtis says:
In a previous message you wrote:
“At the beginning of the calendar year, I want to put a date in Sheet1:C2. The dates on Sheet2:C2-Sheet26:C2 are calculated based on the previous day +1. Once that date is saved the first time, it shouldn’t get updated again until the following year.”
To me, that means you enter one date one time once a year. That one date one time once a year date is entered into cell C2 of the first worksheet.
That further means, for example, the formula in cell C2 of the second sheet would resemble =Sheet1!C2+15 and so on for the other 24 sheets.
That further means, once you enter that one date in cell C2 on the first sheet, all the dates on all the worksheets cover all 2-week periods of the year.
That further means, the Change event code (in your worksheet module of the first worksheet where it belongs) would, upon the manual entry of that one date in cell C2 of that first worksheet, handle the naming of each tab in a loop that is part of the Change event code to handle each worksheet’s tab name change. Programming code from one sheet can do things to hundreds of other sheets in the same workbook, so no, I do not mean and never said that the code should go into each of the 26 sheets.
• Esther says:
Moving it made it do something! Now, I’m getting “You used a character that violates sheet naming rules. Enter a name without the “/” character.” I’m typing my date as 2020-03-21, but if you recall, I said that when I click on the cell, it shows as 3/21/2020. It switches to that no matter what format I put it in.
That said, I put something that wasn’t a date into the cell, I got the same error, but it updated it to what I entered, but only updated that worksheet. And the cell blanked out due to the line in the code for error handling.
If this can’t be automated, I can just go back to doing it manually, since it’s only once a year. I appreciate the time you’ve spent trying to get this working. I’ll wait to hear if you think you know a way around the /, and if not I’m going to give up this time around. Thanks for your help!
• Tom Urtis says:
Format your C2 cell as Text. Then enter in a date with characters that do not violate sheet naming rules. All those characters, including the forward slash, are included in my code.
70. Esther says:
That got it to work on the first tab! All the dates updated, but the other workbook names didn’t update. Going to the C2 cells on the other pages and “editing” them by double-clicking and then entering didn’t change anything either.
I think I’ve taken up enough of your time. Am going to try adding a new worksheet that has the dates listed explicitly and doing a lookup to that page as you described above. If it doesn’t work, I’ll to back to updating by hand. Have a great weekend!
71. Ahrem says:
I encounter Run time error 424 Object required with the first code.
If Target.Address “$b$4” Then
72. Mitchell says:
I’m trying to use this code to change the tabs on sheets 6-20 automatically to match cells on their respective sheets. However these cells on sheets 6-20 are themselves referencing cells on sheet 1 (ie =’sheet1′!e13). This code doesn’t appear to recognize changes to the cells on sheet 1 because they’re looking for changes in the cell in their respective sheets, which will always remain =’sheet1′!E13.
Is it possible to reference sheet 1 for the tabs names of sheets 6-20?
• Tom Urtis says:
The short answer is yes.
The longer answer is, you can use the Workbook level Calculate event (so you don’t need to install 15 separate event codes into sheets 6-20’s worksheet modules) for sheets 6-20 to monitor whichever cell address that holds the changing sheet name. You did not say what the cell address is, or what they are if each sheet 6-20 has a different cell referring to Sheet1. Or, you can monitor the range in Sheet1 where (presumably) you have listed 15 cells that each contain names corresponding to sheets 6-20, with a Change event that changes the sheet tab names for those respective cells. The only issue with that is that the worksheet object codename would be needed to associate which cell in Sheet1 (you also did not say what range location is in Sheet1 except for cell E13) corresponds to which sheet tab.
What you want to do is do-able, it just depends on which method or tactic you want to use to go about it.
• Mitchell says:
Thanks Tom! Sorry for the vague nature of my question. I just started learning all of this, so I’m not very well versed in the language and necessary details to convey the full scope of my inquiry. I’ve changed the references a little bit below to match the changes i’ve made to my workbook. Hopefully this is more clear.
What I want is for whatever is typed into cells B12:B41 in sheet1 to change the names of worksheet 6-35 respectively. So each worksheet would have a different name corresponding to one of the cells in that range. I think this matches your second method. Can I just use your above code and change the target cell to one on sheet 1? What’s the syntax change involved? Or is there a better way to do that?
• Tom Urtis says:
No worries – – everyone was a beginner once.
OK, so it is not 15 sheets, it is 30 sheets. That in and of itself is no problem.
To me, the second method, which is the direction you are thinking of, would be the better of the two, IF (notice the caps for emphasis) you can do a once-only bit of housekeeping, UNLESS there will NEVER be a case where the order (in VBA speak, the Index number) of the worksheets changes. So you need to tell me if it is IMPOSSIBLE that the sheet tabs’ order from left to right will NEVER change. The chances of that being the case are the same as a vaccine ready to cure Covid by midnight tonight. Probably won’t happen. But I am asking anyway, so is it yes (not likely) that the order of the sheet tabs will always and forever remain constant, or no, that a possibility exists that the worksheets as they are sequenced now will change their order sooner or later.
• Mitchell says:
The intent is that they will remain the same always. Only thing that should change is the content of the reference cell
• Tom Urtis says:
This will do what you want.
Copy it to your clipboard.
Right-click onto your Sheet1 tab.
Left click onto View Code.
Paste the code into the large white area that is Sheet1’s worksheet module.
Press Alt+Q to close the Visual Basic Editor.
Works when I tested it.
Private Sub Worksheet_Change(ByVal Target As Range)
If Intersect(Target, Range("B12:B41")) Is Nothing Or Target.Cells.Count > 1 Then Exit Sub
If IsEmpty(Target) Then
Application.EnableEvents = False
Application.Undo
Application.EnableEvents = True
MsgBox "You cannot clear the contents or a cell." & vbCrLf & "You can only edit the contents.", 16, "Can't do that."
Exit Sub
End If
If Len(Target.Value) > 31 Then
MsgBox "Worksheet names cannot be more than 31 characters." & vbCrLf & _
Target.Value & " has " & Len(Target.Value) & " characters.", _
48, "Keep it under 31 characters."
Application.EnableEvents = False
Target.Value = "XXXXX"
Application.EnableEvents = True
Exit Sub
End If
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = "/"
IllegalCharacter(2) = "\"
IllegalCharacter(3) = "["
IllegalCharacter(4) = "]"
IllegalCharacter(5) = "*"
IllegalCharacter(6) = "?"
IllegalCharacter(7) = ":"
For i = 1 To 7
If InStr(Target.Value, (IllegalCharacter(i))) > 0 Then
MsgBox "You used a character that violates sheet naming rules." & vbCrLf & _
"Enter a name without the " & IllegalCharacter(i) & " character.", _
48, "Not a possible sheet name !"
Application.EnableEvents = False
Target.Value = "XXXXXX"
Application.EnableEvents = True
Exit Sub
End If
Next i
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = Trim(Target.Value)
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
If bln = False Then
Dim xRow&
xRow = Target.Row
Sheets(xRow - 6).Name = Target.Value
Else
MsgBox "You already named a sheet " & strSheetName & "." & vbCrLf & _
"Enter a unique name for this sheet."
Application.EnableEvents = False
Target.Value = "XXXXXXX"
Application.EnableEvents = True
End If
End Sub
73. Mitchell says:
That was perfect. Appreciate the help!
74. Neil says:
Hi Tom,
Hope you are well.
I have used the code in the post from October 23, 2013 for changes to multiple sheets names from a single sheet. This works well. However is there a way to make it so the reference cells on sheet 1 can move.
they are currently A22 to A27 inclusive and i would like to be able to move some of the cells to M22 to M27 incluive for example.
Please see my code below for reference:
Private Sub Worksheet_Change(ByVal Target As Range)
‘Specify the target cell whose entry shall be the sheet tab name..
If Intersect(Target, Range(“A22,A23,A24,A25,A26,A27”)) Is Nothing Or Target.Cells.Count > 1 Then Exit Sub
‘If the target cell is empty (contents cleared) do not change the sheet name.
If IsEmpty(Target) Then Exit Sub
‘Disallow the entry if it is greater than 31 characters.
If Len(Target.Value) > 31 Then
MsgBox “Worksheet names cannot be more than 31 characters.” & vbCrLf & _
Target.Value & ” has ” & Len(Target.Value) & ” characters.”, _
48, “Keep it under 31 characters.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
‘Sheet tab names cannot contain the characters /, \, [, ], *, ?, or :.
‘Verify that none of these characters are present in the cell’s entry.
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = “ / ”
IllegalCharacter(2) = “ \ ”
IllegalCharacter(3) = “[”
IllegalCharacter(4) = “]”
IllegalCharacter(5) = “ * ”
IllegalCharacter(6) = “?”
IllegalCharacter(7) = “: ”
For i = 1 To 7
If InStr(Target.Value, (IllegalCharacter(i))) > 0 Then
MsgBox “You used a character that violates sheet naming rules.” & vbCrLf & _
“Enter a name without the ”” & IllegalCharacter(i) & “” character.”, _
48, “Not a possible sheet name !!”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
Next i
‘Verify that the proposed sheet name does not already exist in the workbook.
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = Trim(Target.Value)
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
‘If the worksheet name does not already exist, name the sheet as cell value.
‘Otherwise, advise the user that duplicate sheet names are not allowed.
If bln = False Then
Select Case Target.Address
Case “$A$22”: Sheet2.Name = strSheetName
Case “$A$23”: Sheet3.Name = strSheetName
Case “$A$24”: Sheet4.Name = strSheetName
Case “$A$25”: Sheet5.Name = strSheetName
Case “$A$26”: Sheet6.Name = strSheetName
Case “$A$27”: Sheet7.Name = strSheetName
End Select
Else
MsgBox “There is already a sheet named ” & strSheetName & “.” & vbCrLf & _
“Please enter a unique name for this sheet.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
End If
End Sub
Many thanks in advance
Very best regards
Neil
• Tom Urtis says:
Hello, Neil – –
Taking your question literally, yes you can move your target cells on Sheet1 from A22:A27 to M22:M27 with these quick changes to the code:
Change this line:
If Intersect(Target, Range("A22,A23,A24,A25,A26,A27")) Is Nothing Or Target.Cells.Count > 1 Then Exit Sub
to this:
If Intersect(Target, Range("M22:M27")) Is Nothing Or Target.Cells.Count > 1 Then Exit Sub
and change your Case addresses from this:
Select Case Target.Address
Case "$A$22": Sheet2.Name = strSheetName
Case "$A$23": Sheet3.Name = strSheetName
Case "$A$24": Sheet4.Name = strSheetName
Case "$A$25": Sheet5.Name = strSheetName
Case "$A$26": Sheet6.Name = strSheetName
Case "$A$27": Sheet7.Name = strSheetName
End Select
to this:
Select Case Target.Address
Case "$M$22": Sheet2.Name = strSheetName
Case "$M$23": Sheet3.Name = strSheetName
Case "$M$24": Sheet4.Name = strSheetName
Case "$M$25": Sheet5.Name = strSheetName
Case "$M$26": Sheet6.Name = strSheetName
Case "$M$27": Sheet7.Name = strSheetName
End Select
Assuming your associated sheet object codenames are the same, this should do what you want.
• Neil says:
Hi Tom,
Many thanks for your help.
It is greatly appreciated.
Looking at the way I want this to work is the contents of A22 will remain in the same place, but i may want to move the contents of the A23 to M22, this way i can do a comparison of costs between A22 and M22.
I have actually used code so i can paste the contents of the cell from A23 in to M22, A24 in to M23 and so on using the following.
Case “$A$22”: Sheet2.Name = strSheetName
Case “$A$23”: Sheet3.Name = strSheetName
Case “$A$24”: Sheet4.Name = strSheetName
Case “$A$25”: Sheet5.Name = strSheetName
Case “$A$26”: Sheet6.Name = strSheetName
Case “$A$27”: Sheet7.Name = strSheetName
Case “$M$22”: Sheet3.Name = strSheetName
Case “$M$23”: Sheet4.Name = strSheetName
Case “$M$24”: Sheet5.Name = strSheetName
Case “$M$25”: Sheet6.Name = strSheetName
Case “$M$26”: Sheet7.Name = strSheetName
Thanks again for your help.
Very best regards
• Tom Urtis says:
You lost me.
Bottom line:
What cells do you care about entering something in, and having a sheet tab name change to what you entered into that cell.
75. Juan Aragon says:
Hello Tom,
How can I use your formula and display a prompt vice existing the macro when characters are 0 or greater than 31?
If greater than 31, can you make it that it only renames with the first 25 characters of the cell?
Also, to avoid duplicate name errors, how can you the sheet be renamed using two cells, vice just one.
Here is what I have, and is not working.
Private Sub Worksheet_Calculate()
With Range(“B3”)
If Len(.Value) = 0 Then
MsgBox “Worksheet names cannot be 0 characters.” & vbCrLf & _
Target.Value & ” has ” & Len(Target.Value) & ” characters.”, _
48, “Rename manually.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
‘Disallow the entry if it is greater than 31 characters.
If Len(Target.Value) > 31 Then
MsgBox “Worksheet names cannot be more than 31 characters.” & vbCrLf & _
Target.Value & ” has ” & Len(Target.Value) & ” characters.”, _
48, “Keep it under 31 characters.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
76. Kirk Brinkerhoff says:
Thanks, Tom for getting me here to this page. My issue is that I want to name the pages on the bottom of my spreadsheet to reflect the names of the students that are in my class. I have a list of up to 30 students and each student is given their very own excel page where I keep notes and observations of that student throughout the entire training period. I do not know how to rename the page tabs at the bottom of the spreadsheet to reflect the names of each student. I sent you some screenshots of the worksheet. part of my problem is that this spreadsheet is kind of a house that jack built and too many people have added to it over the years and they won’t let me make a new one, so ‘i am trying to doctor it up. Can you please help. Thank you so much!
• Tom Urtis says:
In a previous email I asked you for the range of cells on the landing page where each of the 3 columns are. I am still waiting for you to tell me that.
What range is the list of 30 Specialist numbers.
What range is the list of 30 peoples names.
What range is the list of 30 sheet codenames that correspond to the list of 30 Specialist names.
77. Niels Knudsen says:
Hi Tom,
What do i need to change in the code, if I want to place it as a sub in one of the modules?
I’ve another sub that is called/executed before this one, that changes the values of the target cells – ie “A1” in the first example.
I’ve got the first sub running and working, but when it calls this code it errors with “Runtime error 424” and in debugging it highlights this line:
“If Intersect(Target, Range(“Timer!C2:I2,Timer!C21:I21″)) Is Nothing Or Target.Cells.Count > 1 Then”
Thank you for time and effort.
Copy of the complete code:
Sub arknavneskift()
‘Ændrer arknavnene til de valgte datoer
‘Specify the target cell whose entry shall be the sheet tab name.
If Intersect(Target, Range(“Timer!C2:I2,Timer!C21:I21”)) Is Nothing Or Target.Cells.Count > 1 Then Exit Sub
‘If the target cell is empty (contents cleared) do not change the sheet name.
If IsEmpty(Target) Then Exit Sub
‘Disallow the entry if it is greater than 31 characters.
If Len(Target.Value) > 31 Then
MsgBox “Arknavne kan ikke være længere end 31 tegn.” & vbCrLf & _
Target.Value & ” er ” & Len(Target.Value) & ” tegn.”, _
48, “Hold det under 32 tegn, kontroller datoerne i kalender arket.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
‘Sheet tab names cannot contain the characters /, \, [, ], *, ?, or :.
‘Verify that none of these characters are present in the cell’s entry.
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = “/”
IllegalCharacter(2) = “\”
IllegalCharacter(3) = “[”
IllegalCharacter(4) = “]”
IllegalCharacter(5) = “*”
IllegalCharacter(6) = “?”
IllegalCharacter(7) = “:”
For i = 1 To 7
If InStr(Target.Value, (IllegalCharacter(i))) > 0 Then
MsgBox “Du har brugt et tegn, som excel ikke vil acceptere i arknavne.” & vbCrLf & _
“Vælg et navn uden ”” & IllegalCharacter(i) & “” tegnet.”, _
48, “Dette er ikke et gyldigt ark navn!”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
Next i
‘Verify that the proposed sheet name does not already exist in the workbook.
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = Format(Date, “dd-mm”)
‘strSheetName = Trim(Target.Value)
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
‘If the worksheet name does not already exist, name the sheet as cell value.
‘Otherwise, advise the user that duplicate sheet names are not allowed.
If bln = False Then
Select Case Target.Address
Case “Timer!$C$2”: Ark4.Name = strSheetName
Case “Timer!$D$2”: Ark5.Name = strSheetName
Case “Timer!$E$2”: Ark6.Name = strSheetName
Case “Timer!$F$2”: Ark7.Name = strSheetName
Case “Timer!$G$2”: Ark8.Name = strSheetName
Case “Timer!$H$2”: Ark9.Name = strSheetName
Case “Timer!$I$2”: Ark10.Name = strSheetName
Case “Timer!$C$21”: Ark11.Name = strSheetName
Case “Timer!$D$21”: Ark12.Name = strSheetName
Case “Timer!$E$21”: Ark13.Name = strSheetName
Case “Timer!$F$21”: Ark14.Name = strSheetName
Case “Timer!$G$21”: Ark15.Name = strSheetName
Case “Timer!$H$21”: Ark16.Name = strSheetName
Case “Timer!$I$21”: Ark17.Name = strSheetName
End Select
Else
MsgBox “Der er allerede et ark med navnet ” & strSheetName & “.” & vbCrLf & _
“Vælg et unikt navn til dette ark.”
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
End If
‘https://www.atlaspm.com/toms-tutorials-for-excel/toms-tutorials-for-excel-name-your-sheet-tab-same-as-cell-value/
End Sub
78. Jakob Kruse Enemaerke says:
Hey Tom
I’ve read this post and I’m trying to get your code work to my needs.
I have a workbook with sheets that has fixed names and a number of sheets which should be able to change sheetname based on a cellreference in the sheet named “Employees” (Sheet5). This sheet name is fixed. The range of sheetnames are in AT5:AT47 and will stay there. They are based on concatenated cellreferences in AR5:AR47 (formula). All sheetnames has the syntax “Number – Name” eg. “1 – James”. When a change is made, in essences, only the name of the employer will change eg. “1 – Peter”. From the beginning alle sheets will have a name, some though without a name since there is no employer at this point (tab name eg. “5 – “). Also the sheets that should be able to change names will be protected with password (same on all sheets):
But the sheet codename is not subsequent in the workbook, as you can see in the code below due to the fact, that some sheets not was there from the start of the workbook.
The situation now is that if a change a employer name on the sheet “Employees”, the concatenated value in AR** is changing as well the value in the range AT5:AT47, but the tab name isn’t changing.
Can you help me with this issue.
Thx in advance for your help.
Private Sub Worksheet_Calculate(ByVal Target As Range)
‘Specify the target cell whose entry shall be the sheet tab name.
If (Target.Range(“AT4:AT47”)) Is Nothing Or Target.Cells.Count > 1 Then
Exit Sub
‘If the target cell is empty (contents cleared) do not change the sheet name.
If IsEmpty(Target) Then Exit Sub
‘Disallow the entry if it is greater than 31 characters.
If Len(Target.Value) > 31 Then
MsgBox “Worksheet names cannot be more than 31 characters.” & vbCrLf & _
Target.Value & ” has ” & Len(Target.Value) & ” characters.”, _
48, “Keep it under 31 characters.”””
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
‘Sheet tab names cannot contain the characters /, \, [, ], *, ?, or :.
‘Verify that none of these characters are present in the cell’s entry.
Dim IllegalCharacter(1 To 7) As String, i As Integer
IllegalCharacter(1) = ” / “””
IllegalCharacter(2) = ” \ “””
IllegalCharacter(3) = “[“””
IllegalCharacter(4) = “]”””
IllegalCharacter(5) = ” * “””
IllegalCharacter(6) = “?”””
IllegalCharacter(7) = “: “””
For i = 1 To 7
If InStr(Target.Value, (IllegalCharacter(i))) > 0 Then
MsgBox “You used a character that violates sheet naming rules.” & vbCrLf & _
“Enter a name without the “” & IllegalCharacter(i) & “” character.”, _
48, “Not a possible sheet name !!”””
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
Exit Sub
End If
Next i
‘Verify that the proposed sheet name does not already exist in the workbook.
Dim strSheetName As String, wks As Worksheet, bln As Boolean
strSheetName = Trim(Target.Value)
On Error Resume Next
Set wks = ActiveWorkbook.Worksheets(strSheetName)
On Error Resume Next
If Not wks Is Nothing Then
bln = True
Else
bln = False
Err.Clear
End If
‘If the worksheet name does not already exist, name the sheet as cell value.
‘Otherwise, advise the user that duplicate sheet names are not allowed.
If bln = False Then
Select Case Target.Address
Case “$AT$5”: Ark27.Name = strSheetName
Case “$AT$6”: Ark28.Name = strSheetName
Case “$AT$7”: Ark29.Name = strSheetName
Case “$AT$8”: Ark30.Name = strSheetName
Case “$AT$9”: Ark31.Name = strSheetName
Case “$AT$10”: Ark32.Name = strSheetName
Case “$AT$11”: Ark33.Name = strSheetName
Case “$AT$12”: Ark34.Name = strSheetName
Case “$AT$13”: Ark35.Name = strSheetName
Case “$AT$14”: Ark36.Name = strSheetName
Case “$AT$15”: Ark9.Name = strSheetName
Case “$AT$16”: Ark10.Name = strSheetName
Case “$AT$17”: Ark11.Name = strSheetName
Case “$AT$18”: Ark12.Name = strSheetName
Case “$AT$19”: Ark13.Name = strSheetName
Case “$AT$20”: Ark14.Name = strSheetName
Case “$AT$21”: Ark15.Name = strSheetName
Case “$AT$22”: Ark16.Name = strSheetName
Case “$AT$23”: Ark17.Name = strSheetName
Case “$AT$24”: Ark18.Name = strSheetName
Case “$AT$25”: Ark19.Name = strSheetName
Case “$AT$26”: Ark20.Name = strSheetName
Case “$AT$27”: Ark21.Name = strSheetName
Case “$AT$28”: Ark22.Name = strSheetName
Case “$AT$29”: Ark23.Name = strSheetName
Case “$AT$30”: Ark44.Name = strSheetName
Case “$AT$31”: Ark24.Name = strSheetName
Case “$AT$32”: Ark25.Name = strSheetName
Case “$AT$33”: Ark37.Name = strSheetName
Case “$AT$34”: Ark38.Name = strSheetName
Case “$AT$35”: Ark45.Name = strSheetName
Case “$AT$36”: Ark46.Name = strSheetName
Case “$AT$37”: Ark47.Name = strSheetName
Case “$AT$38”: Ark48.Name = strSheetName
Case “$AT$39”: Ark49.Name = strSheetName
Case “$AT$40”: Ark50.Name = strSheetName
Case “$AT$41”: Ark51.Name = strSheetName
Case “$AT$42”: Ark52.Name = strSheetName
Case “$AT$43”: Ark53.Name = strSheetName
Case “$AT$44”: Ark54.Name = strSheetName
Case “$AT$45”: Ark40.Name = strSheetName
Case “$AT$46”: Ark41.Name = strSheetName
Case “$AT$47”: Ark42.Name = strSheetName
End Select
Else
MsgBox “There is already a sheet named ” & strSheetName & “.” & vbCrLf & _
“Please enter a unique name for this sheet.”””
Application.EnableEvents = False
Target.ClearContents
Application.EnableEvents = True
End If
End Sub
• Tom Urtis says:
Are Ark##’s sheet CodeNames or are they the concatenations. On a previous comment from another visitor, I gave an example of how to use the CodName property for situations like this. I understand the CodeNames are not in sequence but that does not matter. What does matter is unambiguously identifying each worksheet which the CodeName can do but the worksheet tabs cannot. It looks to me that if Ark## is not the CodeName, then the sheet tabs are not changing because you are not referencing them properly. My suggestion would be to add a column where the CodeNames for each sheet correspond to their worksheet tab counterparts in AT5:AT47. then you can refer to the CodeName in your code to change that respective worksheet tab name accordingly.
79. Jakob Kruse Enemaerke says:
Hey Tom
Thanks for your answer. Ark## sholud be the codenames . When i look into “Microsoft Excel Objects” in the VBA editor, it’s listed like this:
Ark1 (Grundskema)
Ark10 (102 – 0)
Ark11(103 – Gitte E)
and so on
I already made the column you suggest prior to my post to check, that i referered correctly. I’m not sure i know have to implement your solution to the suggest.
/Jakob
• Tom Urtis says:
I don’t want this to fall through the cracks because I have so much going on this week. I cannot totally wrap my arms around everything going on. Can you expound a bit to say:
• Which sheet has formulas in them that are changing?
• When one cell somewhere changes, I assume that means a different name will be applied to the respective worksheet tab.
• But is it always (always means always) that only one worksheet tab (meaning one worksheet cell) will change at a time, or can 2 or 5 or 30 cells change at once if for example you are copying and pasting many cells at the same time.
This is not a dig at you whatsoever, but something about this set-up just seems to be more complicated than it needs to be. But because I don’t have the workbook in front of me, I cannot know the entire situation and hence suspect that something more is going on or needs to be understood.
80. Jakob Kruse Enemaerke says:
The formulas is on the sheet “Employees” (Sheet 5). When a name of an employee changes, yes the new name should be applied to the respective worksheet tab. There will be no copy/paste, so there will be only one change at the time. Although there can be some consecutive changing, if there is one or more new employees or old ones leaving, but the end user of this workbook will only change on cell at the time.
81. JetFusion says:
Hi Tom
Thank you for this, only thing is how would I adjust the code to include Sheet 1 where all the data will from different cells be used to create the sheet tabs?
Thank you
JetFusion
• Tom Urtis says:
I read your question a few times but don’t understand.
You wrote:
where all the data will from different cells be used to create the sheet tabs
What are you saying? On Sheet1 you have something in cell A1, something in cell B1, and something in cell C1, and in cell D1 is a concatenation formula that is what a sheet tab name should be?
Think about how no one except you has seen your workbook, so a complete explanation is needed of what you are working with and what you want to achieve, so your situation can be understood.
82. Cameron says:
Impressive stuff. Thanks for your work on it. This code is pretty much exactly what I’m attempting to do with a couple of exceptions.
1. If I clear the cell I’m looking at, AJ12, which we’ll call “Year”, I want it to rename the sheet to “YYYY Leave Calendar” and perform checks on that name. If there is already one of those then I want to add (i) to it where i is the next number available.
2. I’m not that great at VBA so I’m not sure, but it looks like it should clear the “Year” cell on checks that find one of the errors. It’s not doing that.
3. I’m also interested in not getting a messsage box for a rename attempt if the new value in “Year” is the same as it was. Say someone puts 2022 in and it renames the sheet “2022 Leave Calendar” and for some reason they edit the cell again but decide to put in the same year.
I’ve tried a few things but I can’t even make it do the “YYYY Leave Calendar” when I clear the cell for some reason. I have that working in another block of code that I commented out to try this fancy stuff.
Thanks for any help you can give!
• Tom Urtis says:
Thanks. Not sure I follow everything you are saying.
When you say…
“I want it to rename the sheet to “YYYY Leave Calendar””
…do you literally means
“YYYY Leave Calendar”
…or do you mean for example
“2021 Leave Calendar”.
No idea what this means:
“If there is already one of those then I want to add (i) to it where i is the next number available.”
What are the “those” you refer to,
and
how do you add a letter character “i” to a number.
No idea what you mean by…
“I’m not that great at VBA so I’m not sure, but it looks like it should clear the “Year” cell on checks that find one of the errors. It’s not doing that.”
What is the Year cell,
and
what is an error you see
and
how is the error evidenced.
I won’t quote all of your number 3 but I don’t get the scenario you refer to.
83. Cameron says:
I guess I didn’t explain as well as I thought. Things are always more clear when you’re writing and know what you are thinking than when you’re reading and trying to troubleshoot. My bad.
Yes if AJ12 is cleared I want it to rename the sheet “YYYY Leave Calendar” not insert a year as the year in AJ12 is now gone. Or just “Leave Calendar”. That’s easily changed if I want to have one or the other.
“Those” is a sheet with the name “YYYY Leave Calendar”. So if you have a sheet with an empty AJ12 so it’s named “YYYY Leave Calendar” already and you delete the year from AJ12 in another sheet it will try to rename the sheet to “YYYY Leave Calendar” and yell at you for having a duplicate like any other duplicate does with this code.
I think the (i) piece may be unnecessary but it would have been “YYYY Leave Calendar (1)”, “YYYY Leave Calendar (2)”… increasing each time you had a new sheet where you cleared AJ12. It was a concern I had about the Target.ClearContents which is one of the other questions you had that I talk about below. Basically I thought it might loop if I didn’t force a sequential rename on this empty AJ12 based sheet name.
The “Year” cell is AJ12 per 1.
Error was referring to the invalid sheet names and resulting message box that goes with it. I assume the “Target.ClearContents” line is supposed to clear the target cell after the invalid input is detected. It’s not clearing that cell. If it’s not doing that then nevermind on this one. It just seems like that’s what it was supposed to be doing. Again, not great at VBA so I wasn’t sure.
The message box that tells you there is a sheet with that name already. If I’m in a sheet and AJ12 is 2021 so its name is “2021 Leave Calendar” and I edit AJ12 but enter 2021 into it again I am informed that there is already a sheet with that name even though it’s the sheet I’m in and there is no conflict or issue with giving it that name again. That shouldn’t give me a message about a duplicate.
I tried to be more clear and less pronouny this time.
84. BigAggieMike says:
I’m trying to generate tab names from dates in the following format mm-dd-yyyy. All of the dates are seven days apart and in column B6:B15 of sheet1. There are going to be anywhere from 2 to 10+ dates (tab names) in that column. The formula to generate dates 2 to 10 is simply =B6+7, then =B7+7, then =B8+7 and so on. I have tried to modify your calculate code at the top of the page to work for my situation and I can’t get it to do anything. I have done just enough VBA coding to not know what I’m doing.
I did see the one post where you suggested to Tim the following for tab names based on sheet1 but all of the tab names were in column A. I don’t know how to modify it to work with column B.
Private Sub Worksheet_Change(ByVal Target As Range)
Dim intRow%
For intRow = 2 To 32
With Cells(intRow, 1)
If Len(.Value) > 1 Then Sheets(intRow).Name = .Value
End With
Next intRow
End Sub
Any help would be greatly appreciated.
• Tom Urtis says:
I follow the crux of your question but you say some things that should not matter, which makes me wonder if they do matter.
For example, the formulas are irrelevant because they return dates. Maybe you want to change the sheet tabs each time you change a date. But if several dates are calculated at the same time you would not want the code to execute superfluously, so maybe you just need some other trigger.
And seeing that you used the Change event where formulas are concerned, maybe instead you should use the Calculate event. But that still leads to my previous comment about when and why your dates change.
Why do you have a + after 10 when you wrote
“There are going to be anywhere from 2 to 10+ dates”.
That could mean 2 to 350. is the range B6:B15 or B6 to something else.
How do you unambiguously determine which worksheets shall be named by the cell values.
Could it be that cell B6 contains a date but B7 does not and B8 does. How shall date-less cells in range B6:B15 be handled.
Probably other wonderings to also get cleared up but these are my first questions.
Leave a Reply
Your email address will not be published.
*
|
{
"url": "https://www.atlaspm.com/toms-tutorials-for-excel/toms-tutorials-for-excel-name-your-sheet-tab-same-as-cell-value/",
"source_domain": "www.atlaspm.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "514179",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UWEJHCSRJQU5QJLODNUUDLAXYPJSUEST",
"WARC-Concurrent-To": "<urn:uuid:26e5c0eb-159d-4502-b592-9dd830848590>",
"WARC-Date": "2022-05-19T19:08:45Z",
"WARC-IP-Address": "35.209.7.206",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:A5NGKJGRUDQZUKUWI6HTE6E6IIRRJPMK",
"WARC-Record-ID": "<urn:uuid:c9e53dc2-6f78-43c3-afd1-c95b6d6e9662>",
"WARC-Target-URI": "https://www.atlaspm.com/toms-tutorials-for-excel/toms-tutorials-for-excel-name-your-sheet-tab-same-as-cell-value/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9610c3ea-efc8-456e-a016-47b9bb210707>"
},
"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-243\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
67,
68,
108,
109,
187,
188,
353,
354,
392,
480,
552,
692,
693,
780,
781,
1058,
1059,
1111,
1177,
1219,
1297,
1330,
1331,
1388,
1419,
1492,
1555,
1590,
1623,
1644,
1676,
1685,
1692,
1693,
1764,
1835,
1888,
1914,
1940,
1966,
1992,
2018,
2044,
2070,
2085,
2140,
2217,
2290,
2325,
2358,
2379,
2411,
2420,
2427,
2434,
2435,
2512,
2573,
2607,
2628,
2678,
2699,
2726,
2737,
2742,
2754,
2764,
2771,
2772,
2849,
2921,
2941,
2973,
2978,
3053,
3098,
3131,
3152,
3184,
3191,
3192,
3200,
3201,
3214,
3250,
3280,
3364,
3387,
3388,
3396,
3452,
3453,
3580,
3581,
3663,
3664,
3805,
3806,
4106,
4107,
4124,
4125,
4217,
4218,
4494,
4495,
4774,
4775,
4955,
4956,
4996,
5019,
5078,
5085,
5144,
5176,
5208,
5240,
5272,
5304,
5336,
5368,
5389,
5443,
5567,
5657,
5698,
5713,
5726,
5739,
5746,
5813,
5842,
5869,
5925,
5952,
5985,
6002,
6013,
6031,
6047,
6060,
6067,
6093,
6131,
6177,
6258,
6326,
6339,
6346,
6361,
6375,
6395,
6396,
6412,
6413,
7349,
7350,
7371,
7372,
7475,
7530,
7531,
7551,
7552,
7643,
7644,
7670,
7671,
7809,
7810,
7919,
7920,
8209,
8210,
8302,
8303,
8332,
8333,
8486,
8487,
8519,
9040,
9041,
9091,
9092,
9148,
9223,
9298,
9373,
9448,
9449,
9636,
9637,
9979,
9980,
10006,
10007,
10422,
10423,
10481,
10554,
10831,
10832,
11181,
11182,
11566,
11567,
11686,
11687,
11720,
11721,
11821,
11822,
11977,
11978,
12148,
12149,
12428,
12429,
12462,
12463,
12570,
12571,
12704,
12705,
12801,
12948,
12994,
13072,
13101,
13166,
13167,
13250,
13333,
13398,
13436,
13474,
13512,
13550,
13588,
13626,
13664,
13691,
13751,
13881,
13975,
14022,
14043,
14062,
14081,
14082,
14155,
14190,
14223,
14285,
14318,
14357,
14380,
14397,
14421,
14443,
14462,
14463,
14495,
14539,
14586,
14673,
14747,
14766,
14767,
14788,
14808,
14809,
14895,
14896,
15025,
15183,
15184,
15310,
15311,
15431,
15432,
15453,
15454,
15709,
15710,
15930,
15931,
15950,
16587,
16588,
16743,
16840,
16933,
17023,
17117,
17118,
17324,
17325,
17660,
17661,
17687,
17688,
17726,
17727,
18081,
18082,
18233,
18368,
18507,
18718,
18719,
18755,
18824,
18877,
18942,
18943,
18968,
18969,
19062,
19063,
19226,
19227,
19455,
19456,
19478,
19805,
19806,
19854,
19855,
20366,
20367,
20662,
20663,
20706,
20797,
20886,
20968,
21061,
21133,
21134,
21185,
21186,
21238,
21239,
21271,
21272,
21464,
21465,
21515,
21516,
21724,
21725,
22231,
22232,
22288,
22289,
22305,
22306,
22461,
22462,
22484,
22485,
22741,
22779,
22793,
22840,
22841,
22973,
23006,
23007,
23031,
23032,
23343,
23344,
23409,
23460,
23461,
23617,
23618,
23680,
23681,
23745,
23746,
23767,
23793,
23816,
23817,
23834,
23835,
23843,
23938,
23939,
23961,
23962,
24096,
24154,
24155,
24166,
24248,
24249,
24942,
24943,
24961,
24962,
24973,
24974,
25031,
25032,
25202,
25203,
25218,
25300,
25337,
25338,
25364,
25412,
25440,
25472,
25510,
25523,
25534,
25535,
25595,
25596,
25618,
25619,
26265,
26266,
26287,
26288,
26305,
26306,
26477,
26478,
26495,
26562,
26594,
26642,
26684,
26701,
26716,
26717,
26893,
26894,
26926,
26927,
26948,
26949,
27455,
27456,
27481,
27482,
27795,
27796,
27818,
27819,
27861,
27862,
29109,
29110,
29135,
29136,
29227,
29228,
29244,
29245,
29716,
29717,
30007,
30008,
30253,
30254,
30456,
30457,
30468,
30477,
30478,
30484,
30485,
30507,
30508,
30550,
30551,
30730,
30731,
31106,
31107,
31749,
31750,
31983,
31984,
32042,
32114,
32221,
32305,
32344,
32345,
32408,
32445,
32524,
32593,
32634,
32673,
32700,
32738,
32753,
32766,
32767,
32844,
32921,
32980,
33012,
33044,
33076,
33108,
33140,
33172,
33204,
33225,
33286,
33369,
33446,
33487,
33526,
33553,
33591,
33606,
33619,
33632,
33633,
33716,
33783,
33823,
33850,
33906,
33933,
33966,
33983,
33994,
34012,
34028,
34041,
34042,
34125,
34203,
34229,
34262,
34308,
34355,
34402,
34449,
34496,
34513,
34524,
34605,
34656,
34695,
34722,
34760,
34773,
34774,
34788,
34789,
34812,
34813,
34824,
34825,
34863,
34864,
34947,
34948,
35084,
35085,
35315,
35316,
35342,
35343,
35570,
35571,
35595,
35596,
35831,
35832,
35852,
35853,
35864,
35865,
36045,
36046,
36079,
36080,
36102,
36103,
36610,
36611,
36629,
36630,
36642,
36643,
36960,
36961,
36978,
36988,
36989,
37014,
37015,
37106,
37107,
37178,
37179,
37259,
37260,
37281,
37282,
37294,
37295,
37374,
37375,
37468,
37469,
37610,
37611,
37648,
37649,
37660,
37661,
37674,
37675,
37697,
37698,
37763,
37764,
37969,
37970,
38089,
38090,
38377,
38378,
38461,
38462,
38502,
38540,
38554,
38555,
38571,
38572,
38810,
38811,
38833,
38834,
38847,
38848,
39258,
39259,
39281,
39282,
39310,
39423,
39525,
39577,
39705,
39706,
39730,
39731,
39748,
39749,
39861,
39862,
40035,
40036,
40392,
40393,
40445,
40446,
40467,
40468,
40494,
40495,
40592,
40593,
40724,
40725,
40934,
40935,
40957,
40958,
40971,
40972,
41005,
41006,
41212,
41213,
41406,
41407,
41760,
41761,
41848,
41849,
41894,
41895,
41906,
41907,
41924,
41925,
41936,
41972,
42070,
42071,
42083,
42092,
42093,
42115,
42116,
43587,
43588,
43646,
43716,
43730,
43731,
43830,
43831,
43871,
43909,
43923,
43924,
44172,
44173,
44192,
44193,
44217,
44218,
44334,
44335,
44425,
44426,
44486,
44558,
44574,
44575,
44720,
44721,
44781,
44782,
44838,
44839,
44852,
44853,
44879,
44880,
45037,
45038,
45222,
45223,
45285,
45354,
45372,
45373,
45396,
45397,
45508,
45509,
45602,
45667,
45668,
45701,
45702,
45810,
45811,
45839,
45840,
45863,
45864,
45953,
45954,
46174,
46175,
46214,
46215,
46256,
46286,
46287,
46317,
46318,
47030,
47031,
47049,
47050,
47286,
47287,
47309,
47310,
47463,
47464,
48037,
48056,
48264,
48302,
48316,
48349,
48350,
48370,
48371,
48459,
48536,
48679,
48740,
48741,
48767,
48768,
48933,
48934,
48996,
49072,
49171,
49259,
49302,
49369,
49410,
49493,
49566,
49611,
49654,
49685,
49727,
49746,
49763,
49844,
49925,
49988,
50026,
50064,
50100,
50136,
50174,
50210,
50247,
50272,
50337,
50424,
50503,
50547,
50590,
50621,
50663,
50682,
50699,
50716,
50803,
50874,
50918,
50949,
51009,
51040,
51077,
51098,
51113,
51135,
51155,
51172,
51259,
51341,
51371,
51372,
51431,
51463,
51499,
51560,
51588,
51620,
51639,
51656,
51674,
51675,
51690,
51775,
51830,
51873,
51904,
51946,
51963,
51981,
51982,
52000,
52001,
52069,
52070,
52090,
52091,
52213,
52214,
52237,
52238,
52322,
52585,
52586,
52606,
52607,
52619,
52620,
52784,
52785,
53174,
53175,
53190,
53191,
53213,
53214,
53441,
53442,
53490,
53491,
53506,
53507,
53549,
53550,
53645,
53646,
53666,
53667,
53998,
53999,
54010,
54066,
54136,
54173,
54174,
54235,
54270,
54347,
54414,
54453,
54490,
54515,
54551,
54564,
54575,
54576,
54651,
54726,
54783,
54813,
54843,
54873,
54903,
54933,
54963,
54993,
55012,
55071,
55152,
55227,
55266,
55303,
55328,
55364,
55377,
55388,
55399,
55400,
55481,
55546,
55584,
55609,
55663,
55688,
55719,
55734,
55743,
55759,
55773,
55784,
55785,
55797,
55809,
55810,
55830,
55831,
55967,
55968,
55990,
55991,
56396,
56397,
56410,
56411,
56469,
56511,
56512,
56575,
56612,
56691,
56760,
56801,
56840,
56867,
56905,
56920,
56933,
56934,
57011,
57088,
57147,
57179,
57211,
57243,
57275,
57307,
57339,
57371,
57392,
57453,
57536,
57613,
57654,
57693,
57720,
57758,
57773,
57786,
57799,
57800,
57814,
57815,
57829,
57830,
57850,
57851,
57890,
57891,
57912,
57913,
58125,
58126,
58148,
58149,
58357,
58358,
58384,
58385,
58397,
58398,
59755,
59756,
60437,
60438,
61763,
61764,
62254,
62255,
62758,
62759,
62785,
62786,
63158,
63159,
63183,
63184,
63358,
63359,
63419,
63473,
63689,
63690,
63715,
63716,
64009,
64010,
64170,
64171,
64309,
64310,
64375,
64376,
64402,
64445,
64653,
64700,
64709,
64755,
64756,
64767,
64768,
64780,
64781,
64837,
64919,
64956,
64996,
65035,
65036,
65048,
65049,
65071,
65072,
65275,
65347,
65395,
65396,
65481,
65553,
65601,
65602,
65790,
65791,
65951,
65952,
65979,
65980,
66259,
66260,
66326,
66434,
66460,
66534,
66547,
66562,
66578,
66579,
66606,
66607,
67572,
67573,
67595,
67596,
68016,
68017,
68150,
68207,
68273,
68274,
68428,
68429,
68456,
68457,
69562,
69563,
69590,
69591,
70097,
70098,
70125,
70126,
70528,
70529,
70551,
70552,
71155,
71156,
71172,
71173,
71184,
71185,
71833,
71834,
71850,
71851,
71931,
71932,
71954,
71955,
72211,
72212,
72228,
72229,
72341,
72342,
72358,
72359,
72646,
72647,
72669,
72670,
72880,
72881,
73264,
73265,
73323,
73341,
73368,
73396,
73455,
73470,
73488,
73502,
73503,
73519,
73520,
74071,
74072,
74094,
74095,
74147,
74148,
74149,
74207,
74225,
74252,
74280,
74310,
74358,
74411,
74428,
74443,
74461,
74475,
74476,
74492,
74493,
74790,
74791,
74807,
74808,
75063,
75064,
75083,
75084,
75313,
75403,
75404,
75436,
75459,
75460,
75477,
75478,
75647,
75648,
75670,
75671,
75692,
75693,
75938,
75939,
75962,
76021,
76049,
76103,
76152,
76177,
76231,
76247,
76262,
76276,
76277,
76466,
76467,
76486,
76487,
76689,
76690,
76716,
76717,
77292,
77293,
77677,
77742,
77743,
77761,
77762,
77781,
77824,
77825,
78130,
78131,
78511,
78512,
78540,
78541,
79137,
79138,
79203,
79233,
79266,
79322,
79335,
79347,
79348,
79988,
79989,
80049,
80050,
80066,
80067,
80089,
80090,
80175,
80176,
80356,
80357,
80607,
80608,
81005,
81006,
81136,
81137,
81232,
81233,
81552,
81553,
81563,
81564,
81582,
81583,
81595,
81596,
81807,
81808,
81850,
81915,
81916,
82077,
82078,
82134,
82135,
82157,
82158,
82217,
82218,
82917,
82918,
83098,
83099,
83121,
83122,
83212,
83230,
83231,
83253,
83254,
83300,
83373,
83537,
83538,
83560,
83561,
83798,
83799,
84074,
84075,
84306,
84347,
84348,
84370,
84371,
84805,
84826,
84906,
84927,
84928,
85010,
85130,
85209,
85210,
85232,
85233,
85307,
85351,
85390,
85405,
85457,
85475,
85496,
85511,
85512,
85534,
85535,
85640,
85641,
85664,
85703,
85751,
85772,
85821,
85822,
85845,
85901,
85939,
85960,
85993,
85994,
86085,
86086,
86108,
86109,
86137,
86253,
86377,
86378,
86396,
86397,
86409,
86410,
86960,
86961,
86983,
86984,
87015,
87085,
87213,
87214,
87254,
87334,
87409,
87423,
87424,
87446,
87447,
87620,
87621,
87643,
87644,
87653,
87654,
87884,
87885,
88272,
88273,
88395,
88396,
88452,
88468,
88493,
88519,
88576,
88589,
88605,
88617,
88618,
88776,
88777,
88789,
88797,
88798,
88820,
88821,
89017,
89018,
90257,
90258,
90282,
90283,
90826,
90827,
90853,
90854,
91342,
91343,
91375,
91376,
91407,
91408,
91437,
91438,
91645,
91646,
91664,
91665,
91677,
91718,
91836,
91837,
91848,
91849,
91871,
91872,
91894,
91895,
91975,
91985,
92039,
92077,
92078,
92102,
92115,
92138,
92184,
92197,
92211,
92212,
92368,
92369,
92389,
92390,
92485,
92486,
92512,
92513,
92717,
92718,
92897,
92898,
92926,
92943,
92970,
93041,
93058,
93076,
93077,
93101,
93102,
93126,
93195,
93196,
93237,
93238,
93311,
93312,
93358,
93404,
93450,
93496,
93542,
93588,
93634,
93680,
93727,
93774,
93821,
93868,
93915,
93962,
94009,
94056,
94103,
94150,
94197,
94198,
94218,
94219,
94243,
94244,
94290,
94291,
94321,
94322,
94546,
94547,
94565,
94566,
94582,
95016,
95130,
95131,
95196,
95197,
95235,
95273,
95311,
95349,
95387,
95425,
95463,
95501,
95540,
95579,
95618,
95657,
95696,
95735,
95774,
95813,
95852,
95891,
95930,
95931,
95943,
95944,
95962,
95963,
95979,
96027,
96028,
96048,
96049,
96060,
96061,
96180,
96181,
96337,
96338,
96355,
96356,
96378,
96379,
96402,
96403,
96491,
96492,
96793,
96794,
96811,
96812,
96821,
96929,
97366,
97367,
97389,
97390,
97428,
97429,
97439,
97456,
97519,
97686,
97687,
97697,
98106,
98107,
98125,
98126,
98138,
98259,
98671,
98771,
98772,
98794,
98795,
98951,
98952,
98970,
98971,
99064,
99106,
99107,
99122,
99123,
99179,
99249,
99250,
99343,
99344,
99426,
99463,
99464,
99525,
99560,
99637,
99704,
99743,
99780,
99805,
99841,
99854,
99865,
99866,
99941,
100016,
100073,
100105,
100137,
100167,
100197,
100229,
100259,
100290,
100309,
100368,
100449,
100524,
100564,
100601,
100626,
100662,
100675,
100686,
100697,
100778,
100843,
100881,
100906,
100960,
100985,
101016,
101031,
101040,
101056,
101070,
101081,
101082,
101163,
101239,
101263,
101294,
101338,
101382,
101426,
101470,
101514,
101558,
101602,
101646,
101692,
101738,
101784,
101830,
101876,
101922,
101968,
102014,
102060,
102106,
102152,
102153,
102168,
102177,
102256,
102305,
102342,
102367,
102403,
102414,
102415,
102427,
102428,
102450,
102451,
102902,
102903,
102921,
102922,
102954,
103150,
103417,
103418,
103448,
103462,
103463,
103485,
103486,
103509,
103583,
103644,
103645,
103672,
103744,
103815,
103891,
103966,
104096,
104225,
104358,
104473,
104474,
104921,
104922,
104971,
104972,
105254,
105255,
105273,
105274,
105377,
105394,
105395,
105412,
105413,
105425,
105426,
105509,
105510,
105670,
105671,
105886,
105887,
105898,
105899,
105937,
105959,
106016,
106017,
106074,
106104,
106134,
106164,
106194,
106224,
106254,
106284,
106303,
106355,
106451,
106530,
106569,
106582,
106593,
106604,
106605,
106670,
106697,
106722,
106776,
106801,
106832,
106847,
106856,
106872,
106886,
106897,
106898,
106922,
106953,
106987,
107066,
107106,
107117,
107118,
107131,
107143,
107144,
107161,
107162,
107208,
107209,
107250,
107251,
107271,
107272,
107280,
107522,
107578,
107641,
107669,
107697,
107725,
107752,
107780,
107808,
107835,
107863,
107891,
107918,
107946,
107974,
108002,
108030,
108058,
108086,
108114,
108142,
108169,
108197,
108225,
108253,
108281,
108309,
108336,
108364,
108392,
108419,
108447,
108475,
108503,
108531,
108559,
108586,
108613,
108640,
108666,
108694,
108722,
108748,
108776,
108804,
108832,
108860,
108887,
108915,
108943,
108970,
108997,
109025,
109053,
109081,
109109,
109136,
109164,
109192,
109220,
109248,
109276,
109304,
109331,
109358,
109386,
109414,
109442,
109470,
109498,
109526,
109554,
109582,
109608,
109636,
109664,
109690,
109718,
109746,
109774,
109802,
109830,
109858,
109886,
109914,
109942,
109969,
109997,
110025,
110052,
110080,
110108,
110136,
110164,
110192,
110220,
110248,
110276,
110304,
110332,
110360,
110387,
110415,
110443,
110471,
110499,
110527,
110555,
110583,
110611,
110639,
110667,
110695,
110723,
110751,
110779,
110807,
110833,
110861,
110876,
110887,
110950,
110978,
111006,
111034,
111061,
111089,
111117,
111144,
111172,
111200,
111227,
111255,
111283,
111311,
111339,
111367,
111395,
111423,
111451,
111478,
111506,
111534,
111562,
111590,
111618,
111645,
111673,
111701,
111728,
111756,
111784,
111812,
111840,
111868,
111895,
111922,
111949,
111975,
112003,
112031,
112057,
112085,
112113,
112141,
112169,
112196,
112224,
112252,
112279,
112306,
112334,
112362,
112390,
112418,
112445,
112473,
112501,
112529,
112557,
112585,
112613,
112640,
112667,
112695,
112723,
112751,
112779,
112807,
112835,
112863,
112891,
112917,
112945,
112973,
112999,
113027,
113055,
113083,
113111,
113139,
113167,
113195,
113223,
113251,
113278,
113306,
113334,
113361,
113389,
113417,
113445,
113473,
113501,
113529,
113557,
113585,
113613,
113641,
113669,
113696,
113724,
113752,
113780,
113808,
113836,
113864,
113892,
113920,
113948,
113976,
114004,
114032,
114060,
114088,
114116,
114142,
114170,
114185,
114196,
114208,
114702,
114735,
114750,
114762,
114763,
114783,
114784,
114840,
114979,
114980,
115117,
115118,
115168,
115169,
115193,
115194,
115241,
115242,
115254,
115377,
115378,
115390,
115428,
115429,
115441,
115554,
115555,
115567,
115682,
115683,
115695,
115896,
115897,
115921,
115922,
115974,
115975,
115989,
116414,
116415,
116429,
116469,
116703,
116704,
116718,
116833,
117055,
117056,
117070,
117187,
117388,
117389,
117403,
117606,
117836,
117837,
117920,
117921,
117949,
117950,
118522,
118523,
118545,
118546,
118592,
118593,
118611,
118612,
118623,
118624,
118727,
118728,
118784,
118854,
118947,
119029,
119066,
119127,
119162,
119239,
119306,
119345,
119382,
119407,
119443,
119456,
119467,
119542,
119617,
119674,
119706,
119738,
119768,
119798,
119830,
119860,
119891,
119910,
119969,
120050,
120123,
120161,
120198,
120223,
120259,
120272,
120283,
120294,
120375,
120440,
120478,
120503,
120557,
120582,
120613,
120628,
120637,
120653,
120667,
120678,
120759,
120835,
120859,
120912,
120938,
120968,
121023,
121045,
121071,
121084,
121095,
121107,
121116,
121195,
121244,
121281,
121306,
121342,
121353,
121365,
121366,
121675,
121676,
121687,
121688,
121710,
121711,
121823,
121824,
122000,
122001,
122398,
122399,
122419,
122420,
122485,
122486,
122618,
122828,
123216,
123217,
123305,
123306,
123366,
123367,
123486,
123487,
123555,
123556,
123582,
123583,
123626,
123627,
123670,
123713,
123756,
123799,
123842,
123885,
123928,
123971,
124014,
124057,
124100,
124143,
124186,
124229,
124272,
124315,
124358,
124401,
124444,
124445,
124461,
124462,
124488,
124489,
124688,
124689,
124713,
124714,
124868,
124869,
124888,
124889,
124919,
124920,
125006,
125007,
125051,
125052,
125089,
125149,
125150,
125188,
125234,
125280,
125281,
125342,
125385,
125472,
125545,
125594,
125617,
125638,
125639,
125724,
125809,
125876,
125916,
125956,
125996,
126036,
126076,
126116,
126156,
126185,
126252,
126343,
126430,
126479,
126502,
126523,
126544,
126545,
126636,
126711,
126751,
126786,
126850,
126885,
126926,
126951,
126970,
126996,
127020,
127041,
127042,
127133,
127219,
127253,
127312,
127331,
127434,
127493,
127514,
127515,
127538,
127566,
127567,
127589,
127590,
127608,
127609,
127811,
127812,
127839,
127889,
127890,
127918,
127954,
127995,
127996,
128047,
128080,
128157,
128220,
128259,
128272,
128283,
128284,
128359,
128434,
128491,
128521,
128551,
128581,
128611,
128641,
128671,
128701,
128720,
128777,
128858,
128933,
128972,
128985,
128996,
129007,
129008,
129089,
129154,
129184,
129209,
129263,
129288,
129319,
129334,
129343,
129359,
129373,
129384,
129385,
129466,
129542,
129566,
129615,
129624,
129717,
129766,
129777,
129778,
129791,
129809,
129810,
129822,
129823,
129840,
129841,
129851,
129852,
129874,
129875,
129893,
129936,
129937,
129951,
130000,
130001,
130021,
130022,
130136,
130137,
130318,
130319,
130330,
130331,
130357,
130358,
130555,
130556,
130663,
130705,
130723,
130755,
130756,
130872,
130873,
130897,
130898,
131185,
131186,
131221,
131279,
131280,
131316,
131350,
131394,
131395,
131454,
131495,
131580,
131651,
131698,
131719,
131738,
131739,
131822,
131905,
131970,
132008,
132046,
132084,
132122,
132160,
132198,
132236,
132263,
132328,
132417,
132500,
132547,
132568,
132587,
132606,
132607,
132696,
132769,
132807,
132840,
132902,
132935,
132974,
132997,
133014,
133038,
133060,
133079,
133080,
133169,
133253,
133285,
133332,
133349,
133440,
133497,
133516,
133517,
133538,
133564,
133565,
133585,
133586,
133610,
133611,
133784,
133785,
133874,
133875,
134072,
134073,
134411,
134412,
134457,
134458,
134488,
134489,
134727,
134728,
134747,
134748,
134959,
134960,
135803,
135804,
136140,
136183,
136190,
136233,
136234,
136456,
136457,
136515,
136516,
136538,
136539,
136563,
136564,
136671,
136672,
136682,
136834,
136835,
136845,
137047,
137048,
137058,
137218,
137219,
137229,
137377,
137378,
138109,
138110,
138313,
138314,
138335,
138336,
138396,
138486,
139070,
139346,
139347,
139370,
139371,
139515,
139516,
139542,
139543,
139681,
139682,
139965,
139966,
139991,
139992,
140529,
140530,
140568,
140569,
140633,
140711,
140762,
140852,
140897,
140898,
140928,
140929,
141074,
141075,
141791,
141792,
141811,
141812,
141996,
141997,
142019,
142020,
142321,
142322,
142343,
142344,
142479,
142480,
142530,
142531,
142557,
142558,
142601,
142863,
142864,
143021,
143022,
143172,
143173,
143337,
143338,
143845,
143846,
143871,
143872,
144199,
144200,
144438,
144439,
144744,
144745,
144775,
144776,
144972,
144973,
144992,
144993,
145230,
145231,
145486,
145487,
145505,
145506,
145578,
145579,
145613,
145614,
145635,
145636,
146044,
146045,
146120,
146121,
146143,
146144,
146175,
146176,
146989,
146990,
147102,
147103,
147126,
147127,
147457,
147458,
147869,
147870,
147896,
147897,
147952,
147953,
148045,
148046,
148823,
148824,
148851,
148852,
148984,
148985,
149015,
149016,
149058,
149099,
149147,
149188,
149278,
149338,
149376,
149377,
149378,
149444,
149548,
149586,
149633,
149664,
149710,
149841,
149864,
149885,
149930,
150017,
150094,
150143,
150190,
150227,
150273,
150296,
150317,
150384,
150424,
150464,
150504,
150544,
150584,
150624,
150664,
150693,
150762,
150853,
150936,
150984,
151031,
151069,
151115,
151138,
151159,
151180,
151255,
151303,
151338,
151402,
151437,
151478,
151503,
151522,
151548,
151572,
151593,
151627,
151651,
151683,
151734,
151753,
151837,
151889,
151936,
151975,
152021,
152042,
152064,
152065,
152086,
152087,
152130,
152131,
152148,
152149,
152161,
152184,
152396,
152530,
152574,
152575,
152631,
152702,
152812,
152894,
152931,
152932,
152993,
153028,
153105,
153172,
153211,
153248,
153273,
153309,
153322,
153333,
153334,
153409,
153484,
153541,
153573,
153605,
153635,
153665,
153697,
153727,
153758,
153777,
153836,
153917,
153992,
154031,
154068,
154093,
154129,
154142,
154153,
154164,
154165,
154246,
154311,
154349,
154374,
154428,
154453,
154484,
154499,
154508,
154524,
154538,
154549,
154550,
154631,
154707,
154731,
154762,
154807,
154852,
154897,
154942,
154987,
155032,
155047,
155056,
155135,
155184,
155221,
155246,
155282,
155293,
155294,
155306,
155307,
155334,
155356,
155365,
155366,
155388,
155389,
155411,
155412,
155557,
155558,
155582,
155694,
155709,
155805,
155806,
155854,
155855,
155888,
155935,
155982,
156029,
156076,
156123,
156170,
156187,
156188,
156203,
156204,
156237,
156284,
156331,
156378,
156425,
156472,
156519,
156536,
156537,
156635,
156636,
156655,
156656,
156672,
156707,
156742,
156743,
156960,
156961,
157100,
157101,
157150,
157199,
157248,
157297,
157346,
157395,
157444,
157493,
157542,
157591,
157640,
157641,
157677,
157703,
157704,
157730,
157731,
157754,
157777,
157910,
157911,
157935,
157936,
157951,
157952,
158070,
158071,
158174,
158175,
158282,
158283,
158328,
158329,
158367,
158388,
158416,
158482,
158549,
158576,
158613,
158638,
158674,
158687,
158698,
158759,
158794,
158871,
158938,
158977,
159014,
159039,
159075,
159088,
159099,
159100,
159129,
159130,
159892,
159893,
159915,
159916,
160074,
160129,
160179,
160282,
160283,
160309,
160310,
160322,
160323,
160419,
160557,
160558,
160711,
160712,
160817,
160818,
160853,
160854,
160885,
160886,
160910,
160911,
160955,
160956,
161026,
161138,
161220,
161257,
161258,
161319,
161354,
161424,
161484,
161556,
161593,
161618,
161654,
161667,
161678,
161679,
161754,
161829,
161886,
161916,
161946,
161976,
162006,
162036,
162066,
162096,
162115,
162174,
162263,
162328,
162373,
162410,
162435,
162471,
162484,
162495,
162506,
162507,
162588,
162653,
162694,
162733,
162758,
162812,
162837,
162868,
162883,
162892,
162908,
162922,
162933,
162934,
163015,
163091,
163115,
163146,
163194,
163242,
163290,
163338,
163386,
163434,
163483,
163533,
163583,
163633,
163683,
163733,
163783,
163833,
163848,
163857,
163939,
163979,
164016,
164041,
164077,
164088,
164089,
164208,
164209,
164221,
164222,
164256,
164257,
164269,
164343,
165088,
165263,
165464,
165501,
165535,
165536,
165595,
165665,
165666,
165742,
165755,
165837,
165874,
165875,
165936,
165971,
166048,
166115,
166156,
166193,
166218,
166254,
166267,
166278,
166279,
166354,
166429,
166486,
166520,
166554,
166586,
166618,
166652,
166684,
166717,
166736,
166795,
166876,
166951,
166992,
167029,
167054,
167090,
167103,
167114,
167125,
167126,
167207,
167272,
167310,
167335,
167389,
167414,
167445,
167460,
167469,
167485,
167499,
167510,
167511,
167592,
167668,
167692,
167723,
167767,
167811,
167855,
167899,
167943,
167988,
168033,
168078,
168123,
168168,
168212,
168257,
168302,
168347,
168392,
168437,
168482,
168527,
168572,
168617,
168662,
168707,
168752,
168797,
168842,
168887,
168932,
168977,
169022,
169067,
169112,
169157,
169202,
169247,
169292,
169337,
169382,
169427,
169472,
169517,
169562,
169607,
169652,
169667,
169676,
169755,
169806,
169843,
169868,
169904,
169915,
169916,
169928,
169929,
169951,
169952,
170706,
170707,
170741,
170742,
170754,
170899,
170921,
170941,
170966,
170980,
171145,
171156,
171157,
171179,
171180,
171362,
171422,
171549,
171789,
171790,
172086,
172087,
172121,
172122,
172537,
172538,
172560,
172561,
172572,
172573,
172737,
172738,
172752,
172766,
172767,
172789,
172790,
172851,
172852,
172869,
172953,
172954,
173153,
173154,
173350,
173351,
173371,
173372,
173510,
173511,
173773,
173774,
173934,
173935,
174216,
174217,
174429,
174430,
174468,
174469,
174491,
174492,
174551,
174552,
174572,
174635,
174665,
174693,
174727,
174756,
174757,
174788,
174896,
174937,
174947,
175004,
175005,
175037,
175198,
175227,
175237,
175268,
175278,
175312,
175313,
175397,
175398,
175418,
175419,
175611,
175612,
175826,
175827,
176166,
176167,
176586,
176587,
176622,
176623,
177016,
177017,
177421,
177422,
177480,
177481,
177506,
177507,
178018,
178212,
178213,
178269,
178285,
178310,
178336,
178393,
178406,
178422,
178434,
178435,
178478,
178479,
178501,
178502,
178632,
178633,
178926,
178927,
179137,
179138,
179188,
179248,
179325,
179326,
179419,
179420,
179550,
179551,
179640,
179641,
179655,
179656,
179698,
179699
],
"line_end_idx": [
67,
68,
108,
109,
187,
188,
353,
354,
392,
480,
552,
692,
693,
780,
781,
1058,
1059,
1111,
1177,
1219,
1297,
1330,
1331,
1388,
1419,
1492,
1555,
1590,
1623,
1644,
1676,
1685,
1692,
1693,
1764,
1835,
1888,
1914,
1940,
1966,
1992,
2018,
2044,
2070,
2085,
2140,
2217,
2290,
2325,
2358,
2379,
2411,
2420,
2427,
2434,
2435,
2512,
2573,
2607,
2628,
2678,
2699,
2726,
2737,
2742,
2754,
2764,
2771,
2772,
2849,
2921,
2941,
2973,
2978,
3053,
3098,
3131,
3152,
3184,
3191,
3192,
3200,
3201,
3214,
3250,
3280,
3364,
3387,
3388,
3396,
3452,
3453,
3580,
3581,
3663,
3664,
3805,
3806,
4106,
4107,
4124,
4125,
4217,
4218,
4494,
4495,
4774,
4775,
4955,
4956,
4996,
5019,
5078,
5085,
5144,
5176,
5208,
5240,
5272,
5304,
5336,
5368,
5389,
5443,
5567,
5657,
5698,
5713,
5726,
5739,
5746,
5813,
5842,
5869,
5925,
5952,
5985,
6002,
6013,
6031,
6047,
6060,
6067,
6093,
6131,
6177,
6258,
6326,
6339,
6346,
6361,
6375,
6395,
6396,
6412,
6413,
7349,
7350,
7371,
7372,
7475,
7530,
7531,
7551,
7552,
7643,
7644,
7670,
7671,
7809,
7810,
7919,
7920,
8209,
8210,
8302,
8303,
8332,
8333,
8486,
8487,
8519,
9040,
9041,
9091,
9092,
9148,
9223,
9298,
9373,
9448,
9449,
9636,
9637,
9979,
9980,
10006,
10007,
10422,
10423,
10481,
10554,
10831,
10832,
11181,
11182,
11566,
11567,
11686,
11687,
11720,
11721,
11821,
11822,
11977,
11978,
12148,
12149,
12428,
12429,
12462,
12463,
12570,
12571,
12704,
12705,
12801,
12948,
12994,
13072,
13101,
13166,
13167,
13250,
13333,
13398,
13436,
13474,
13512,
13550,
13588,
13626,
13664,
13691,
13751,
13881,
13975,
14022,
14043,
14062,
14081,
14082,
14155,
14190,
14223,
14285,
14318,
14357,
14380,
14397,
14421,
14443,
14462,
14463,
14495,
14539,
14586,
14673,
14747,
14766,
14767,
14788,
14808,
14809,
14895,
14896,
15025,
15183,
15184,
15310,
15311,
15431,
15432,
15453,
15454,
15709,
15710,
15930,
15931,
15950,
16587,
16588,
16743,
16840,
16933,
17023,
17117,
17118,
17324,
17325,
17660,
17661,
17687,
17688,
17726,
17727,
18081,
18082,
18233,
18368,
18507,
18718,
18719,
18755,
18824,
18877,
18942,
18943,
18968,
18969,
19062,
19063,
19226,
19227,
19455,
19456,
19478,
19805,
19806,
19854,
19855,
20366,
20367,
20662,
20663,
20706,
20797,
20886,
20968,
21061,
21133,
21134,
21185,
21186,
21238,
21239,
21271,
21272,
21464,
21465,
21515,
21516,
21724,
21725,
22231,
22232,
22288,
22289,
22305,
22306,
22461,
22462,
22484,
22485,
22741,
22779,
22793,
22840,
22841,
22973,
23006,
23007,
23031,
23032,
23343,
23344,
23409,
23460,
23461,
23617,
23618,
23680,
23681,
23745,
23746,
23767,
23793,
23816,
23817,
23834,
23835,
23843,
23938,
23939,
23961,
23962,
24096,
24154,
24155,
24166,
24248,
24249,
24942,
24943,
24961,
24962,
24973,
24974,
25031,
25032,
25202,
25203,
25218,
25300,
25337,
25338,
25364,
25412,
25440,
25472,
25510,
25523,
25534,
25535,
25595,
25596,
25618,
25619,
26265,
26266,
26287,
26288,
26305,
26306,
26477,
26478,
26495,
26562,
26594,
26642,
26684,
26701,
26716,
26717,
26893,
26894,
26926,
26927,
26948,
26949,
27455,
27456,
27481,
27482,
27795,
27796,
27818,
27819,
27861,
27862,
29109,
29110,
29135,
29136,
29227,
29228,
29244,
29245,
29716,
29717,
30007,
30008,
30253,
30254,
30456,
30457,
30468,
30477,
30478,
30484,
30485,
30507,
30508,
30550,
30551,
30730,
30731,
31106,
31107,
31749,
31750,
31983,
31984,
32042,
32114,
32221,
32305,
32344,
32345,
32408,
32445,
32524,
32593,
32634,
32673,
32700,
32738,
32753,
32766,
32767,
32844,
32921,
32980,
33012,
33044,
33076,
33108,
33140,
33172,
33204,
33225,
33286,
33369,
33446,
33487,
33526,
33553,
33591,
33606,
33619,
33632,
33633,
33716,
33783,
33823,
33850,
33906,
33933,
33966,
33983,
33994,
34012,
34028,
34041,
34042,
34125,
34203,
34229,
34262,
34308,
34355,
34402,
34449,
34496,
34513,
34524,
34605,
34656,
34695,
34722,
34760,
34773,
34774,
34788,
34789,
34812,
34813,
34824,
34825,
34863,
34864,
34947,
34948,
35084,
35085,
35315,
35316,
35342,
35343,
35570,
35571,
35595,
35596,
35831,
35832,
35852,
35853,
35864,
35865,
36045,
36046,
36079,
36080,
36102,
36103,
36610,
36611,
36629,
36630,
36642,
36643,
36960,
36961,
36978,
36988,
36989,
37014,
37015,
37106,
37107,
37178,
37179,
37259,
37260,
37281,
37282,
37294,
37295,
37374,
37375,
37468,
37469,
37610,
37611,
37648,
37649,
37660,
37661,
37674,
37675,
37697,
37698,
37763,
37764,
37969,
37970,
38089,
38090,
38377,
38378,
38461,
38462,
38502,
38540,
38554,
38555,
38571,
38572,
38810,
38811,
38833,
38834,
38847,
38848,
39258,
39259,
39281,
39282,
39310,
39423,
39525,
39577,
39705,
39706,
39730,
39731,
39748,
39749,
39861,
39862,
40035,
40036,
40392,
40393,
40445,
40446,
40467,
40468,
40494,
40495,
40592,
40593,
40724,
40725,
40934,
40935,
40957,
40958,
40971,
40972,
41005,
41006,
41212,
41213,
41406,
41407,
41760,
41761,
41848,
41849,
41894,
41895,
41906,
41907,
41924,
41925,
41936,
41972,
42070,
42071,
42083,
42092,
42093,
42115,
42116,
43587,
43588,
43646,
43716,
43730,
43731,
43830,
43831,
43871,
43909,
43923,
43924,
44172,
44173,
44192,
44193,
44217,
44218,
44334,
44335,
44425,
44426,
44486,
44558,
44574,
44575,
44720,
44721,
44781,
44782,
44838,
44839,
44852,
44853,
44879,
44880,
45037,
45038,
45222,
45223,
45285,
45354,
45372,
45373,
45396,
45397,
45508,
45509,
45602,
45667,
45668,
45701,
45702,
45810,
45811,
45839,
45840,
45863,
45864,
45953,
45954,
46174,
46175,
46214,
46215,
46256,
46286,
46287,
46317,
46318,
47030,
47031,
47049,
47050,
47286,
47287,
47309,
47310,
47463,
47464,
48037,
48056,
48264,
48302,
48316,
48349,
48350,
48370,
48371,
48459,
48536,
48679,
48740,
48741,
48767,
48768,
48933,
48934,
48996,
49072,
49171,
49259,
49302,
49369,
49410,
49493,
49566,
49611,
49654,
49685,
49727,
49746,
49763,
49844,
49925,
49988,
50026,
50064,
50100,
50136,
50174,
50210,
50247,
50272,
50337,
50424,
50503,
50547,
50590,
50621,
50663,
50682,
50699,
50716,
50803,
50874,
50918,
50949,
51009,
51040,
51077,
51098,
51113,
51135,
51155,
51172,
51259,
51341,
51371,
51372,
51431,
51463,
51499,
51560,
51588,
51620,
51639,
51656,
51674,
51675,
51690,
51775,
51830,
51873,
51904,
51946,
51963,
51981,
51982,
52000,
52001,
52069,
52070,
52090,
52091,
52213,
52214,
52237,
52238,
52322,
52585,
52586,
52606,
52607,
52619,
52620,
52784,
52785,
53174,
53175,
53190,
53191,
53213,
53214,
53441,
53442,
53490,
53491,
53506,
53507,
53549,
53550,
53645,
53646,
53666,
53667,
53998,
53999,
54010,
54066,
54136,
54173,
54174,
54235,
54270,
54347,
54414,
54453,
54490,
54515,
54551,
54564,
54575,
54576,
54651,
54726,
54783,
54813,
54843,
54873,
54903,
54933,
54963,
54993,
55012,
55071,
55152,
55227,
55266,
55303,
55328,
55364,
55377,
55388,
55399,
55400,
55481,
55546,
55584,
55609,
55663,
55688,
55719,
55734,
55743,
55759,
55773,
55784,
55785,
55797,
55809,
55810,
55830,
55831,
55967,
55968,
55990,
55991,
56396,
56397,
56410,
56411,
56469,
56511,
56512,
56575,
56612,
56691,
56760,
56801,
56840,
56867,
56905,
56920,
56933,
56934,
57011,
57088,
57147,
57179,
57211,
57243,
57275,
57307,
57339,
57371,
57392,
57453,
57536,
57613,
57654,
57693,
57720,
57758,
57773,
57786,
57799,
57800,
57814,
57815,
57829,
57830,
57850,
57851,
57890,
57891,
57912,
57913,
58125,
58126,
58148,
58149,
58357,
58358,
58384,
58385,
58397,
58398,
59755,
59756,
60437,
60438,
61763,
61764,
62254,
62255,
62758,
62759,
62785,
62786,
63158,
63159,
63183,
63184,
63358,
63359,
63419,
63473,
63689,
63690,
63715,
63716,
64009,
64010,
64170,
64171,
64309,
64310,
64375,
64376,
64402,
64445,
64653,
64700,
64709,
64755,
64756,
64767,
64768,
64780,
64781,
64837,
64919,
64956,
64996,
65035,
65036,
65048,
65049,
65071,
65072,
65275,
65347,
65395,
65396,
65481,
65553,
65601,
65602,
65790,
65791,
65951,
65952,
65979,
65980,
66259,
66260,
66326,
66434,
66460,
66534,
66547,
66562,
66578,
66579,
66606,
66607,
67572,
67573,
67595,
67596,
68016,
68017,
68150,
68207,
68273,
68274,
68428,
68429,
68456,
68457,
69562,
69563,
69590,
69591,
70097,
70098,
70125,
70126,
70528,
70529,
70551,
70552,
71155,
71156,
71172,
71173,
71184,
71185,
71833,
71834,
71850,
71851,
71931,
71932,
71954,
71955,
72211,
72212,
72228,
72229,
72341,
72342,
72358,
72359,
72646,
72647,
72669,
72670,
72880,
72881,
73264,
73265,
73323,
73341,
73368,
73396,
73455,
73470,
73488,
73502,
73503,
73519,
73520,
74071,
74072,
74094,
74095,
74147,
74148,
74149,
74207,
74225,
74252,
74280,
74310,
74358,
74411,
74428,
74443,
74461,
74475,
74476,
74492,
74493,
74790,
74791,
74807,
74808,
75063,
75064,
75083,
75084,
75313,
75403,
75404,
75436,
75459,
75460,
75477,
75478,
75647,
75648,
75670,
75671,
75692,
75693,
75938,
75939,
75962,
76021,
76049,
76103,
76152,
76177,
76231,
76247,
76262,
76276,
76277,
76466,
76467,
76486,
76487,
76689,
76690,
76716,
76717,
77292,
77293,
77677,
77742,
77743,
77761,
77762,
77781,
77824,
77825,
78130,
78131,
78511,
78512,
78540,
78541,
79137,
79138,
79203,
79233,
79266,
79322,
79335,
79347,
79348,
79988,
79989,
80049,
80050,
80066,
80067,
80089,
80090,
80175,
80176,
80356,
80357,
80607,
80608,
81005,
81006,
81136,
81137,
81232,
81233,
81552,
81553,
81563,
81564,
81582,
81583,
81595,
81596,
81807,
81808,
81850,
81915,
81916,
82077,
82078,
82134,
82135,
82157,
82158,
82217,
82218,
82917,
82918,
83098,
83099,
83121,
83122,
83212,
83230,
83231,
83253,
83254,
83300,
83373,
83537,
83538,
83560,
83561,
83798,
83799,
84074,
84075,
84306,
84347,
84348,
84370,
84371,
84805,
84826,
84906,
84927,
84928,
85010,
85130,
85209,
85210,
85232,
85233,
85307,
85351,
85390,
85405,
85457,
85475,
85496,
85511,
85512,
85534,
85535,
85640,
85641,
85664,
85703,
85751,
85772,
85821,
85822,
85845,
85901,
85939,
85960,
85993,
85994,
86085,
86086,
86108,
86109,
86137,
86253,
86377,
86378,
86396,
86397,
86409,
86410,
86960,
86961,
86983,
86984,
87015,
87085,
87213,
87214,
87254,
87334,
87409,
87423,
87424,
87446,
87447,
87620,
87621,
87643,
87644,
87653,
87654,
87884,
87885,
88272,
88273,
88395,
88396,
88452,
88468,
88493,
88519,
88576,
88589,
88605,
88617,
88618,
88776,
88777,
88789,
88797,
88798,
88820,
88821,
89017,
89018,
90257,
90258,
90282,
90283,
90826,
90827,
90853,
90854,
91342,
91343,
91375,
91376,
91407,
91408,
91437,
91438,
91645,
91646,
91664,
91665,
91677,
91718,
91836,
91837,
91848,
91849,
91871,
91872,
91894,
91895,
91975,
91985,
92039,
92077,
92078,
92102,
92115,
92138,
92184,
92197,
92211,
92212,
92368,
92369,
92389,
92390,
92485,
92486,
92512,
92513,
92717,
92718,
92897,
92898,
92926,
92943,
92970,
93041,
93058,
93076,
93077,
93101,
93102,
93126,
93195,
93196,
93237,
93238,
93311,
93312,
93358,
93404,
93450,
93496,
93542,
93588,
93634,
93680,
93727,
93774,
93821,
93868,
93915,
93962,
94009,
94056,
94103,
94150,
94197,
94198,
94218,
94219,
94243,
94244,
94290,
94291,
94321,
94322,
94546,
94547,
94565,
94566,
94582,
95016,
95130,
95131,
95196,
95197,
95235,
95273,
95311,
95349,
95387,
95425,
95463,
95501,
95540,
95579,
95618,
95657,
95696,
95735,
95774,
95813,
95852,
95891,
95930,
95931,
95943,
95944,
95962,
95963,
95979,
96027,
96028,
96048,
96049,
96060,
96061,
96180,
96181,
96337,
96338,
96355,
96356,
96378,
96379,
96402,
96403,
96491,
96492,
96793,
96794,
96811,
96812,
96821,
96929,
97366,
97367,
97389,
97390,
97428,
97429,
97439,
97456,
97519,
97686,
97687,
97697,
98106,
98107,
98125,
98126,
98138,
98259,
98671,
98771,
98772,
98794,
98795,
98951,
98952,
98970,
98971,
99064,
99106,
99107,
99122,
99123,
99179,
99249,
99250,
99343,
99344,
99426,
99463,
99464,
99525,
99560,
99637,
99704,
99743,
99780,
99805,
99841,
99854,
99865,
99866,
99941,
100016,
100073,
100105,
100137,
100167,
100197,
100229,
100259,
100290,
100309,
100368,
100449,
100524,
100564,
100601,
100626,
100662,
100675,
100686,
100697,
100778,
100843,
100881,
100906,
100960,
100985,
101016,
101031,
101040,
101056,
101070,
101081,
101082,
101163,
101239,
101263,
101294,
101338,
101382,
101426,
101470,
101514,
101558,
101602,
101646,
101692,
101738,
101784,
101830,
101876,
101922,
101968,
102014,
102060,
102106,
102152,
102153,
102168,
102177,
102256,
102305,
102342,
102367,
102403,
102414,
102415,
102427,
102428,
102450,
102451,
102902,
102903,
102921,
102922,
102954,
103150,
103417,
103418,
103448,
103462,
103463,
103485,
103486,
103509,
103583,
103644,
103645,
103672,
103744,
103815,
103891,
103966,
104096,
104225,
104358,
104473,
104474,
104921,
104922,
104971,
104972,
105254,
105255,
105273,
105274,
105377,
105394,
105395,
105412,
105413,
105425,
105426,
105509,
105510,
105670,
105671,
105886,
105887,
105898,
105899,
105937,
105959,
106016,
106017,
106074,
106104,
106134,
106164,
106194,
106224,
106254,
106284,
106303,
106355,
106451,
106530,
106569,
106582,
106593,
106604,
106605,
106670,
106697,
106722,
106776,
106801,
106832,
106847,
106856,
106872,
106886,
106897,
106898,
106922,
106953,
106987,
107066,
107106,
107117,
107118,
107131,
107143,
107144,
107161,
107162,
107208,
107209,
107250,
107251,
107271,
107272,
107280,
107522,
107578,
107641,
107669,
107697,
107725,
107752,
107780,
107808,
107835,
107863,
107891,
107918,
107946,
107974,
108002,
108030,
108058,
108086,
108114,
108142,
108169,
108197,
108225,
108253,
108281,
108309,
108336,
108364,
108392,
108419,
108447,
108475,
108503,
108531,
108559,
108586,
108613,
108640,
108666,
108694,
108722,
108748,
108776,
108804,
108832,
108860,
108887,
108915,
108943,
108970,
108997,
109025,
109053,
109081,
109109,
109136,
109164,
109192,
109220,
109248,
109276,
109304,
109331,
109358,
109386,
109414,
109442,
109470,
109498,
109526,
109554,
109582,
109608,
109636,
109664,
109690,
109718,
109746,
109774,
109802,
109830,
109858,
109886,
109914,
109942,
109969,
109997,
110025,
110052,
110080,
110108,
110136,
110164,
110192,
110220,
110248,
110276,
110304,
110332,
110360,
110387,
110415,
110443,
110471,
110499,
110527,
110555,
110583,
110611,
110639,
110667,
110695,
110723,
110751,
110779,
110807,
110833,
110861,
110876,
110887,
110950,
110978,
111006,
111034,
111061,
111089,
111117,
111144,
111172,
111200,
111227,
111255,
111283,
111311,
111339,
111367,
111395,
111423,
111451,
111478,
111506,
111534,
111562,
111590,
111618,
111645,
111673,
111701,
111728,
111756,
111784,
111812,
111840,
111868,
111895,
111922,
111949,
111975,
112003,
112031,
112057,
112085,
112113,
112141,
112169,
112196,
112224,
112252,
112279,
112306,
112334,
112362,
112390,
112418,
112445,
112473,
112501,
112529,
112557,
112585,
112613,
112640,
112667,
112695,
112723,
112751,
112779,
112807,
112835,
112863,
112891,
112917,
112945,
112973,
112999,
113027,
113055,
113083,
113111,
113139,
113167,
113195,
113223,
113251,
113278,
113306,
113334,
113361,
113389,
113417,
113445,
113473,
113501,
113529,
113557,
113585,
113613,
113641,
113669,
113696,
113724,
113752,
113780,
113808,
113836,
113864,
113892,
113920,
113948,
113976,
114004,
114032,
114060,
114088,
114116,
114142,
114170,
114185,
114196,
114208,
114702,
114735,
114750,
114762,
114763,
114783,
114784,
114840,
114979,
114980,
115117,
115118,
115168,
115169,
115193,
115194,
115241,
115242,
115254,
115377,
115378,
115390,
115428,
115429,
115441,
115554,
115555,
115567,
115682,
115683,
115695,
115896,
115897,
115921,
115922,
115974,
115975,
115989,
116414,
116415,
116429,
116469,
116703,
116704,
116718,
116833,
117055,
117056,
117070,
117187,
117388,
117389,
117403,
117606,
117836,
117837,
117920,
117921,
117949,
117950,
118522,
118523,
118545,
118546,
118592,
118593,
118611,
118612,
118623,
118624,
118727,
118728,
118784,
118854,
118947,
119029,
119066,
119127,
119162,
119239,
119306,
119345,
119382,
119407,
119443,
119456,
119467,
119542,
119617,
119674,
119706,
119738,
119768,
119798,
119830,
119860,
119891,
119910,
119969,
120050,
120123,
120161,
120198,
120223,
120259,
120272,
120283,
120294,
120375,
120440,
120478,
120503,
120557,
120582,
120613,
120628,
120637,
120653,
120667,
120678,
120759,
120835,
120859,
120912,
120938,
120968,
121023,
121045,
121071,
121084,
121095,
121107,
121116,
121195,
121244,
121281,
121306,
121342,
121353,
121365,
121366,
121675,
121676,
121687,
121688,
121710,
121711,
121823,
121824,
122000,
122001,
122398,
122399,
122419,
122420,
122485,
122486,
122618,
122828,
123216,
123217,
123305,
123306,
123366,
123367,
123486,
123487,
123555,
123556,
123582,
123583,
123626,
123627,
123670,
123713,
123756,
123799,
123842,
123885,
123928,
123971,
124014,
124057,
124100,
124143,
124186,
124229,
124272,
124315,
124358,
124401,
124444,
124445,
124461,
124462,
124488,
124489,
124688,
124689,
124713,
124714,
124868,
124869,
124888,
124889,
124919,
124920,
125006,
125007,
125051,
125052,
125089,
125149,
125150,
125188,
125234,
125280,
125281,
125342,
125385,
125472,
125545,
125594,
125617,
125638,
125639,
125724,
125809,
125876,
125916,
125956,
125996,
126036,
126076,
126116,
126156,
126185,
126252,
126343,
126430,
126479,
126502,
126523,
126544,
126545,
126636,
126711,
126751,
126786,
126850,
126885,
126926,
126951,
126970,
126996,
127020,
127041,
127042,
127133,
127219,
127253,
127312,
127331,
127434,
127493,
127514,
127515,
127538,
127566,
127567,
127589,
127590,
127608,
127609,
127811,
127812,
127839,
127889,
127890,
127918,
127954,
127995,
127996,
128047,
128080,
128157,
128220,
128259,
128272,
128283,
128284,
128359,
128434,
128491,
128521,
128551,
128581,
128611,
128641,
128671,
128701,
128720,
128777,
128858,
128933,
128972,
128985,
128996,
129007,
129008,
129089,
129154,
129184,
129209,
129263,
129288,
129319,
129334,
129343,
129359,
129373,
129384,
129385,
129466,
129542,
129566,
129615,
129624,
129717,
129766,
129777,
129778,
129791,
129809,
129810,
129822,
129823,
129840,
129841,
129851,
129852,
129874,
129875,
129893,
129936,
129937,
129951,
130000,
130001,
130021,
130022,
130136,
130137,
130318,
130319,
130330,
130331,
130357,
130358,
130555,
130556,
130663,
130705,
130723,
130755,
130756,
130872,
130873,
130897,
130898,
131185,
131186,
131221,
131279,
131280,
131316,
131350,
131394,
131395,
131454,
131495,
131580,
131651,
131698,
131719,
131738,
131739,
131822,
131905,
131970,
132008,
132046,
132084,
132122,
132160,
132198,
132236,
132263,
132328,
132417,
132500,
132547,
132568,
132587,
132606,
132607,
132696,
132769,
132807,
132840,
132902,
132935,
132974,
132997,
133014,
133038,
133060,
133079,
133080,
133169,
133253,
133285,
133332,
133349,
133440,
133497,
133516,
133517,
133538,
133564,
133565,
133585,
133586,
133610,
133611,
133784,
133785,
133874,
133875,
134072,
134073,
134411,
134412,
134457,
134458,
134488,
134489,
134727,
134728,
134747,
134748,
134959,
134960,
135803,
135804,
136140,
136183,
136190,
136233,
136234,
136456,
136457,
136515,
136516,
136538,
136539,
136563,
136564,
136671,
136672,
136682,
136834,
136835,
136845,
137047,
137048,
137058,
137218,
137219,
137229,
137377,
137378,
138109,
138110,
138313,
138314,
138335,
138336,
138396,
138486,
139070,
139346,
139347,
139370,
139371,
139515,
139516,
139542,
139543,
139681,
139682,
139965,
139966,
139991,
139992,
140529,
140530,
140568,
140569,
140633,
140711,
140762,
140852,
140897,
140898,
140928,
140929,
141074,
141075,
141791,
141792,
141811,
141812,
141996,
141997,
142019,
142020,
142321,
142322,
142343,
142344,
142479,
142480,
142530,
142531,
142557,
142558,
142601,
142863,
142864,
143021,
143022,
143172,
143173,
143337,
143338,
143845,
143846,
143871,
143872,
144199,
144200,
144438,
144439,
144744,
144745,
144775,
144776,
144972,
144973,
144992,
144993,
145230,
145231,
145486,
145487,
145505,
145506,
145578,
145579,
145613,
145614,
145635,
145636,
146044,
146045,
146120,
146121,
146143,
146144,
146175,
146176,
146989,
146990,
147102,
147103,
147126,
147127,
147457,
147458,
147869,
147870,
147896,
147897,
147952,
147953,
148045,
148046,
148823,
148824,
148851,
148852,
148984,
148985,
149015,
149016,
149058,
149099,
149147,
149188,
149278,
149338,
149376,
149377,
149378,
149444,
149548,
149586,
149633,
149664,
149710,
149841,
149864,
149885,
149930,
150017,
150094,
150143,
150190,
150227,
150273,
150296,
150317,
150384,
150424,
150464,
150504,
150544,
150584,
150624,
150664,
150693,
150762,
150853,
150936,
150984,
151031,
151069,
151115,
151138,
151159,
151180,
151255,
151303,
151338,
151402,
151437,
151478,
151503,
151522,
151548,
151572,
151593,
151627,
151651,
151683,
151734,
151753,
151837,
151889,
151936,
151975,
152021,
152042,
152064,
152065,
152086,
152087,
152130,
152131,
152148,
152149,
152161,
152184,
152396,
152530,
152574,
152575,
152631,
152702,
152812,
152894,
152931,
152932,
152993,
153028,
153105,
153172,
153211,
153248,
153273,
153309,
153322,
153333,
153334,
153409,
153484,
153541,
153573,
153605,
153635,
153665,
153697,
153727,
153758,
153777,
153836,
153917,
153992,
154031,
154068,
154093,
154129,
154142,
154153,
154164,
154165,
154246,
154311,
154349,
154374,
154428,
154453,
154484,
154499,
154508,
154524,
154538,
154549,
154550,
154631,
154707,
154731,
154762,
154807,
154852,
154897,
154942,
154987,
155032,
155047,
155056,
155135,
155184,
155221,
155246,
155282,
155293,
155294,
155306,
155307,
155334,
155356,
155365,
155366,
155388,
155389,
155411,
155412,
155557,
155558,
155582,
155694,
155709,
155805,
155806,
155854,
155855,
155888,
155935,
155982,
156029,
156076,
156123,
156170,
156187,
156188,
156203,
156204,
156237,
156284,
156331,
156378,
156425,
156472,
156519,
156536,
156537,
156635,
156636,
156655,
156656,
156672,
156707,
156742,
156743,
156960,
156961,
157100,
157101,
157150,
157199,
157248,
157297,
157346,
157395,
157444,
157493,
157542,
157591,
157640,
157641,
157677,
157703,
157704,
157730,
157731,
157754,
157777,
157910,
157911,
157935,
157936,
157951,
157952,
158070,
158071,
158174,
158175,
158282,
158283,
158328,
158329,
158367,
158388,
158416,
158482,
158549,
158576,
158613,
158638,
158674,
158687,
158698,
158759,
158794,
158871,
158938,
158977,
159014,
159039,
159075,
159088,
159099,
159100,
159129,
159130,
159892,
159893,
159915,
159916,
160074,
160129,
160179,
160282,
160283,
160309,
160310,
160322,
160323,
160419,
160557,
160558,
160711,
160712,
160817,
160818,
160853,
160854,
160885,
160886,
160910,
160911,
160955,
160956,
161026,
161138,
161220,
161257,
161258,
161319,
161354,
161424,
161484,
161556,
161593,
161618,
161654,
161667,
161678,
161679,
161754,
161829,
161886,
161916,
161946,
161976,
162006,
162036,
162066,
162096,
162115,
162174,
162263,
162328,
162373,
162410,
162435,
162471,
162484,
162495,
162506,
162507,
162588,
162653,
162694,
162733,
162758,
162812,
162837,
162868,
162883,
162892,
162908,
162922,
162933,
162934,
163015,
163091,
163115,
163146,
163194,
163242,
163290,
163338,
163386,
163434,
163483,
163533,
163583,
163633,
163683,
163733,
163783,
163833,
163848,
163857,
163939,
163979,
164016,
164041,
164077,
164088,
164089,
164208,
164209,
164221,
164222,
164256,
164257,
164269,
164343,
165088,
165263,
165464,
165501,
165535,
165536,
165595,
165665,
165666,
165742,
165755,
165837,
165874,
165875,
165936,
165971,
166048,
166115,
166156,
166193,
166218,
166254,
166267,
166278,
166279,
166354,
166429,
166486,
166520,
166554,
166586,
166618,
166652,
166684,
166717,
166736,
166795,
166876,
166951,
166992,
167029,
167054,
167090,
167103,
167114,
167125,
167126,
167207,
167272,
167310,
167335,
167389,
167414,
167445,
167460,
167469,
167485,
167499,
167510,
167511,
167592,
167668,
167692,
167723,
167767,
167811,
167855,
167899,
167943,
167988,
168033,
168078,
168123,
168168,
168212,
168257,
168302,
168347,
168392,
168437,
168482,
168527,
168572,
168617,
168662,
168707,
168752,
168797,
168842,
168887,
168932,
168977,
169022,
169067,
169112,
169157,
169202,
169247,
169292,
169337,
169382,
169427,
169472,
169517,
169562,
169607,
169652,
169667,
169676,
169755,
169806,
169843,
169868,
169904,
169915,
169916,
169928,
169929,
169951,
169952,
170706,
170707,
170741,
170742,
170754,
170899,
170921,
170941,
170966,
170980,
171145,
171156,
171157,
171179,
171180,
171362,
171422,
171549,
171789,
171790,
172086,
172087,
172121,
172122,
172537,
172538,
172560,
172561,
172572,
172573,
172737,
172738,
172752,
172766,
172767,
172789,
172790,
172851,
172852,
172869,
172953,
172954,
173153,
173154,
173350,
173351,
173371,
173372,
173510,
173511,
173773,
173774,
173934,
173935,
174216,
174217,
174429,
174430,
174468,
174469,
174491,
174492,
174551,
174552,
174572,
174635,
174665,
174693,
174727,
174756,
174757,
174788,
174896,
174937,
174947,
175004,
175005,
175037,
175198,
175227,
175237,
175268,
175278,
175312,
175313,
175397,
175398,
175418,
175419,
175611,
175612,
175826,
175827,
176166,
176167,
176586,
176587,
176622,
176623,
177016,
177017,
177421,
177422,
177480,
177481,
177506,
177507,
178018,
178212,
178213,
178269,
178285,
178310,
178336,
178393,
178406,
178422,
178434,
178435,
178478,
178479,
178501,
178502,
178632,
178633,
178926,
178927,
179137,
179138,
179188,
179248,
179325,
179326,
179419,
179420,
179550,
179551,
179640,
179641,
179655,
179656,
179698,
179699,
179700
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 179700,
"ccnet_original_nlines": 3305,
"rps_doc_curly_bracket": 0.000011129999620607123,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34395909309387207,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.048177290707826614,
"rps_doc_frac_lines_end_with_ellipsis": 0.003024799982085824,
"rps_doc_frac_no_alph_words": 0.24626626074314117,
"rps_doc_frac_unique_words": 0.10660210251808167,
"rps_doc_mean_word_length": 4.615834712982178,
"rps_doc_num_sentences": 2119,
"rps_doc_symbol_to_word_ratio": 0.001552380039356649,
"rps_doc_unigram_entropy": 6.115962028503418,
"rps_doc_word_count": 27673,
"rps_doc_frac_chars_dupe_10grams": 0.2540435492992401,
"rps_doc_frac_chars_dupe_5grams": 0.3293406665325165,
"rps_doc_frac_chars_dupe_6grams": 0.30064040422439575,
"rps_doc_frac_chars_dupe_7grams": 0.2803482115268707,
"rps_doc_frac_chars_dupe_8grams": 0.2704526484012604,
"rps_doc_frac_chars_dupe_9grams": 0.26299184560775757,
"rps_doc_frac_chars_top_2gram": 0.024989429861307144,
"rps_doc_frac_chars_top_3gram": 0.006858000066131353,
"rps_doc_frac_chars_top_4gram": 0.0073277298361063,
"rps_doc_books_importance": -15593.50390625,
"rps_doc_books_importance_length_correction": -15593.50390625,
"rps_doc_openwebtext_importance": -8780.46484375,
"rps_doc_openwebtext_importance_length_correction": -8780.46484375,
"rps_doc_wikipedia_importance": -6773.2509765625,
"rps_doc_wikipedia_importance_length_correction": -6773.2509765625
},
"fasttext": {
"dclm": 0.03075755015015602,
"english": 0.8949764966964722,
"fineweb_edu_approx": 1.8238184452056885,
"eai_general_math": 0.8251462578773499,
"eai_open_web_math": 0.23774534463882446,
"eai_web_code": 0.612643301486969
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.87",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
3,042,845,514,593,140,700 |
fastspin compiler for P2: Assembly, Spin, BASIC, and C in one compiler
1181921232439
Comments
• I am using a slightly older version, so this might be fixed already, but
case 1..9
just does 1..8
and CASE "A".."Z"
does not work at all.
Mike
• JRoarkJRoark Posts: 334
edited 2019-09-10 - 20:20:04
Another day, another opportunity to make some more compiler mischief for @ERSmith to noodle on!
I'm working with a stock FLIP module, a Dell laptop running Win10, and Fastspin Version 3.9.29
Access to the BASIC getcnt() function isn't being allowed by the compiler even though getcnt() appears in the docs as a supported feature (and is used in several examples).
x = getcnt() '<-- compiler doesn't like this
The error thown is "error: Symbol getcnt is of a type not handled by PASM output yet". There is a second part of this bug too. The above warning message is issued without a line number.
Edit #1
A "phantom" variable named cnt is apparently already defined somewhere. In other words, there is no need to define it before you use it. This even occurs with OPTION EXPLICIT enabled. The variable seems to be global in scope, and references to this variable can be made anywhere (main body, functions, subs, etc). That being said, you can explicitly define it and the compiler seems fine with it. None of these DIMs cause any problem even though it seems "pre-defined as a phantom" somewhere else:
dim cnt as integer <-- no problem
dim cnt as long <-- no problem
dim cnt as string <-- no problem
Edit #2
This isn't a bug, but it was interesting so I'm posting it. If you are trying to toggle pins, there is a huge speed difference depending on the methodology. The PINTOGGLE() function is *really* slow compared to direct programmatic manipulation of the pin. Check this out:
const pin = 17
direction(pin) = output
do
pintoggle(pin) '<--- 192.310 Khz
loop
The code above results in a toggle speed of 192.310 Khz on the scope. The code below results in a 5 Mhz toggle speed, ie, a 26x speed improvement.
const pin = 17
direction(pin) = output
do
output(pin) = not output(pin) '<-- 5.000 Mhz
loop
Edit #3
There seems to be some mischief happening with versioning. I thought I was using the most recent version of Fastspin (3.9.30), but the editor (Help -> About) says I'm actually using 3.9.29. When I downloaded this from ERSmith's Patreon page (https://www.patreon.com/totalspectrum) a couple of days ago, the download link said "3.9.30" with a release date of Sept 6, but it seems like it is the 3.9.29 code. To eliminate any DFO error, I just went to Github and downloaded it from there, but the editor (Help -> About) still shows it as version 3.9.29.
UPDATE: The compiler reports its version as 3.9.30, but the editor (Help -> About) reports 3.9.29. Looks like the (Help -> About) text just needs to be changed.
Edit #4
String handling definitely has some monkey-business happening. In addition to the failure mode that @Whicker posted on the previous page, this code below fails after the 6th iteration of the loop:
for a = 1 to 10
print "This is line " + str$(a)
pausems(500)
next a
Here is the output on the serial terminal:
[ Entering terminal mode. Type ESC or Control-C to exit. ]
This is line 1
This is line 2
This is line 3
This is line 4
This is line 5
This is line 6
!!! out of memory !!! !!! out of memory !!!
!!! out of memory !!! !!! out of memory !!! !!! out of memory !!! !!! out of memory !!!
The failure happens at the same point regardless of the value of the HEAPSIZE constant. BTW: I put the 500 mS delay in there because I wondered if this was a garbage collection timing issue. No such luck. The timing seems to have nothing to do with the "out of memory" error.
• whicker wrote: »
okay, so I tried the HEAPSIZE suggestion:
const HEAPSIZE = 8192
dim R$ as string
dim A as integer
print "Hi"
HERE:
INPUT "Enter a string"; R$
PRINT "You typed:"; R$
GOTO HERE
That's 240 A's. It only takes 2 of these to cause the weirdness (printing only the 1st character).
At the bottom, it's only printing "Y" instead of "You typed:", and only "A" instead of the 240 A's, and then "E" instead of "Enter a string".
Hmmm, I'm not seeing that. I can force an "!!! out of memory !!!" message if I type enough characters, but I don't see the printing of just the first character of the prompts. Do you get "!!! out of memory !!!" after a while? If not, then probably you have an older version of fastspin -- versions before 3.9.30 have some very nasty memory management bugs which could definitely produce weird errors like this.
Thanks for testing this!
Eric
• JRoark wrote: »
One other thing, and I think it was previously reported and you fixed it, but it seems to be back: in an IF THEN ELSE construct, if all you have is a comment between the IF and ELSE, the compiler it throws an error. I’ll post sample code and the actual error when I get home tonight.
Actually it used to be the other way around, I think -- it would sometimes lose track of the first statement after the IF THEN. But trying to fix that I seem to have introduced another bug :(. Ugh. Anyway, thanks for the bug report, I'll look into it.
EDIT #4:
There is an odd bug in the "Commodore C64 Compatibility Feature". :smile: (ducking!)
dim a$ as string '<-- works fine
dim b% as integer '<-- works fine
dim c! as single '<-- throws "error: syntax error, unexpected !, expecting $end or end of line or end or ':'"
[/quote]
The character for a float is "#" rather than "!"; "!" isn't recognized at all. Is that a QBasic thing? I could probably make it a synonym for "#".
• ersmith wrote: »
The character for a float is "#" rather than "!"; "!" isn't recognized at all. Is that a QBasic thing? I could probably make it a synonym for "#".
IIRC "#" was double and "!" single...
• msrobots wrote: »
I am using a slightly older version, so this might be fixed already, but
case 1..9
just does 1..8
and CASE "A".."Z"
does not work at all.
The CASE "A" TO "Z" issue was fixed a while back (you are referring to BASIC, aren't you?). There does seem to still be an off-by-one bug in the case ranges, though... thanks for reporting this!
• JRoark wrote: »
Access to the BASIC getcnt() function isn't being allowed by the compiler even though getcnt() appears in the docs as a supported feature (and is used in several examples).
Yes, that accidentally got broken in the last release. It should be fixed in github now. In the meantime you can use _getcnt() instead.
UPDATE: The compiler reports its version as 3.9.30, but the editor (Help -> About) reports 3.9.29. Looks like the (Help -> About) text just needs to be changed.
Yes, this is exactly it. Conceptually spin2gui and fastspin could have independent version numbers, but I try to keep them in sync. I failed this time :(.
Edit #4
String handling definitely has some monkey-business happening. In addition to the failure mode that @Whicker posted on the previous page, this code below fails after the 6th iteration of the loop:
for a = 1 to 10
print "This is line " + str$(a)
pausems(500)
next a
Here is the output on the serial terminal:
[ Entering terminal mode. Type ESC or Control-C to exit. ]
This is line 1
This is line 2
This is line 3
This is line 4
This is line 5
This is line 6
!!! out of memory !!! !!! out of memory !!!
!!! out of memory !!! !!! out of memory !!! !!! out of memory !!! !!! out of memory !!!
The failure happens at the same point regardless of the value of the HEAPSIZE constant. BTW: I put the 500 mS delay in there because I wondered if this was a garbage collection timing issue. No such luck. The timing seems to have nothing to do with the "out of memory" error.
I can't reproduce this -- with the default HEAPSIZE I get out of memory after two iterations, with "const HEAPSIZE=8192" all 10 iterations work fine. Are you sure it was recompiled correctly with the HEAPSIZE change?
Thanks for your bug reports and suggestions!
Eric
• @ersmith When you attempt to replicate these is the compiler set for Propeller 2 code output? (I’m goofing with a FLIP).
• JRoark wrote: »
@ersmith When you attempt to replicate these is the compiler set for Propeller 2 code output? (I’m goofing with a FLIP).
No, I was building for Propeller 1.
• Ok. We’re on the same page. :)
• @JRoark: If you're feeling adventurous I've attached an updated GUI for spin2gui. To use it just replace the src/gui.tcl file in your spin2gui folder with this one. It's got a right click menu, adjustable command output window size, and improved font selector.
• ersmith wrote: »
@JRoark: If you're feeling adventurous I've attached an updated GUI for spin2gui. To use it just replace the src/gui.tcl file in your spin2gui folder with this one. It's got a right click menu, adjustable command output window size, and improved font selector.
Sweet!!! I’ll tee this up just as soon as I can get rid of a couple of clients. Thanks!
• JRoarkJRoark Posts: 334
edited 2019-09-11 - 17:49:14
@ersmith Boy... those editor changes make all the difference in the world. Very nice! And you wedged the compile date/time/machine id in the compiler output too.
Was the bottom pane (compiler msg output) supposed to be adjustable vertically? If so, it seems stuck on my machine... or I’m being obtuse. I’ll put odds on the latter. Lol.
BTW: ALL of the font dialogue box issues are now resolved.
Good stuff!!!
• JRoarkJRoark Posts: 334
edited 2019-09-11 - 20:02:52
Here I go again making mischief with the new & improved FastSpin. Same dev environment except for the new gui.tcl file that Eric posted on this thread a couple of post ago. The target language is BASIC.
MID$
This function is present and works just fine, but it isnt listed in the doc. (I found this out by accident when I went to write my own MID$ function and the compiler got grumpy at me).
PRAGMA
It appears that the preprocessor directive PRAGMA is supported, but it isn't listed in the doc.
TRUE and FALSE
It appears the predefined constants TRUE and FALSE are present, but they are not listed in the doc. You can use TRUE and FALSE in statements without defining them, but at the same time if you want to explicitly define TRUE and/or FALSE to any legal value, the compiler seems fine with that.
• JRoark wrote: »
Was the bottom pane (compiler msg output) supposed to be adjustable vertically? If so, it seems stuck on my machine... or I’m being obtuse. I’ll put odds on the latter. Lol.
Just above the grey "Compiler Output" bar there's a slightly darker line. The cursor should change when you mouse over that (at least it does on my machine) and you can drag to resize.
• JRoark wrote: »
MID$
This function is present and works just fine, but it isnt listed in the doc. (I found this out by accident when I went to write my own MID$ function and the compiler got grumpy at me).
Whoops, missed that one. Thanks.
PRAGMA
It appears that the preprocessor directive PRAGMA is supported, but it isn't listed in the doc.
PRAGMA doesn't do anything yet, it's just ignored.
TRUE and FALSE
It appears the predefined constants TRUE and FALSE are present, but they are not listed in the doc. You can use TRUE and FALSE in statements without defining them, but at the same time if you want to explicitly define TRUE and/or FALSE to any legal value, the compiler seems fine with that.
Hmmm, yes, I forgot to document those. For many of the built in variables (like these and CNT) it's OK to redefine them if you want, since they're just ordinary variables. But it's probably not always a good idea -- it'll be confusing to the reader.
• ersmith wrote: »
JRoark wrote: »
Was the bottom pane (compiler msg output) supposed to be adjustable vertically? If so, it seems stuck on my machine... or I’m being obtuse. I’ll put odds on the latter. Lol.
Just above the grey "Compiler Output" bar there's a slightly darker line. The cursor should change when you mouse over that (at least it does on my machine) and you can drag to resize.
Laptops with small, high resolution screens, when combined with tri-focals, truly are the "Instant Breakfast" of self-humiliation.
It works flawlessly. :)
• JRoarkJRoark Posts: 334
edited 2019-09-11 - 23:01:16
DIM
The process of creating a variable with DIM and attempting to simultaneously cast it as a type and assigning a value seems to be a bit wonky. If you use DIM with the SHARED attribute, it works fine as shown in the first two lines. But if you don't want a SHARED variable, you're out of luck.
dim shared as integer r(5) = { 1, 2, 3, 4, 5 } '<-- works fine
dim shared as integer r = 100 '<-- works fine
dim as integer r = 100 '<-- "error: initialization is not supported for member variable r"
dim as integer ptr r = __builtin_alloca(256) '<-- "error: initialization is not supported for member variable r"
That last line is a cut-and-copy from the manual, so I suspect this used to work and got bumped somewhere along the way.
CONST
Apparently declaring a CONST within a SUB or FUNCTION isn't supported.
FUNCTION DoStuff(x as integer) as integer
const outPin = 17 '<-- "error: syntax error, unexpected identifier `outPin'"
return x
END FUNCTION
It would be really handy to be able to define a CONST from within a SUB or FUNCTION that has scope that is local to the SUB or FUNCTION in which it is defined.
SUB and FUNCTION
Apparently, creating a SUB or FUNCTION without any code in it isn't supported.
FUNCTION DoStuff(x as integer) as integer
' I will put something here in the future. '<-- "error: syntax error, unexpected end"
END FUNCTION
Allowing empty SUBs and FUNCTIONs would be handy. I tend to map-out my code by initially defining "stubs" for SUBs and FUNCTIONs, and then I go back and fill-in the blanks with code to flesh it out. This keeps the program structured and keeps me on task. I also recommend this approach to students.
• yetiyeti Posts: 633
edited 2019-09-11 - 22:56:45
$ cat asdds.bas
dim shared as integer r = 100
dim shared as integer ptr p = __builtin_alloca(256)
sub notMainProgram
dim as integer rr = 100
dim as integer ptr pp = __builtin_alloca(256)
end sub
notMainProgram
$ fastspin asdds.bas
Propeller Spin/PASM Compiler 'FastSpin' (c) 2011-2019 Total Spectrum Software Inc.
Version 3.9.31-beta-362be4d7 Compiled on: Sep 11 2019
asdds.bas
asdds.pasm
Done.
Program size is 576 bytes
Probably this still applies:
—▷ https://forums.parallax.com/discussion/comment/1457711/#Comment_1457711
ersmith wrote: »
The reason is a little obscure: an ordinary "dim" declares a member variable, which will be different in each instance of a class (even the top level program is really embedded in a class). These cannot be initialized because they're not in a fixed place in memory and there are many copies. "shared" variables though *can* be initialized because there is only one copy.
• @yeti Thanks! That makes more sense now. It's seems a little odd to me as I'm coming at this from MS BASICs, (VB6, PDS, QB, etc), but hey... live and learn! Thanks for catching that.
• RaymanRayman Posts: 10,218
edited 2019-09-11 - 23:28:43
Trying to figure out how to convert a pure ASM spin2 file into a Spin2+ASM spin2 file...
See attached for a simple VGA example program that works without any Spin, but doesn't work when a Spin method is added to start the ASM.
What am I doing wrong?
Oops... I swear the pure ASM version was working... But, now it's not...
• RaymanRayman Posts: 10,218
edited 2019-09-11 - 23:58:56
Ok, I think I see it now... Appears the bitmap has to be located above some address...
When I add in some dummy bytes, it works:
dat
byte 0[2000]
dat
' Bitmap
The attached works with or without the Spin part
• @Rayman: I think you're running into the problem we saw before, that the "x" and "y" variables (declared with "res 1") are uninitialized but the code expects them to start with 0 in them. That's a bug in the assembly code. If you change them both to "long 0" then I don't think you'll need to insert the dummy bytes.
• Doesn’t that make res worthless?
Doesn’t the booter clear ram?
• Rayman wrote: »
Doesn’t that make res worthless?
Doesn’t the booter clear ram?
res has always just reserved space for variables, it's never put an initial value in them. So if you do:
org 0
...
x res 1
long $deadbeef
then x will start with $deadbeef in it. Similarly if you do
x res 1
file "bitmap.bmp"
then x will start with the first 4 bytes of the bitmap.bmp file in it.
Clearing the boot RAM is irrelevant in both of the above situations, because the x is explicitly followed by real data that the booter cannot possibly clear.
Basically one should only ever use "res" for variables where the initial value doesn't matter -- values that get calculated, read from outside, or are otherwise explicitly initialized by the program. In those cases it's quite useful, because it lets you declare COG space that doesn't require any HUB space.
In the VGA program, unfortunately, the initial value of some of those "res" values does matter (if you look it's assumed to be 0). It was a harmless error in the original demo, since the res was followed by an orgh which inserted 0 padding so the values did end up 0, but if the data is moved around that may no longer be the case.
• You, also, should never have any non-res data after the res entries, unless you know what you are doing (and comment the crap out of it, since it will look like a bug).
This is the same as it's always been for P1... no different for P2.
• Another way to fix the VGA problem is to look at the beginning of the PASM code, which looks like:
rdfast #0,##@BitmapFile-$400+$436'##$1000-$400 'load .bmp palette into lut
rep @.end,#$100
rflong y
shl y,#8
wrlut y,x
add x,#1
.end
The variable x is being used as an index into the LUT, but it is never initialized. If you put a
mov x, #0
somewhere before there it will fix the problem.
(As an aside, this code could use an alternative method of setq2 + rdlong to read the data directly into LUT without needing to do the rep loop at all. That would be both faster and smaller, and not require the use of x and y.)
• ersmith wrote: »
Rayman wrote: »
Doesn’t that make res worthless?
Doesn’t the booter clear ram?
res has always just reserved space for variables, it's never put an initial value in them. So if you do:
org 0
...
x res 1
long $deadbeef
then x will start with $deadbeef in it. Similarly if you do
x res 1
file "bitmap.bmp"
then x will start with the first 4 bytes of the bitmap.bmp file in it.
Clearing the boot RAM is irrelevant in both of the above situations, because the x is explicitly followed by real data that the booter cannot possibly clear.
Basically one should only ever use "res" for variables where the initial value doesn't matter -- values that get calculated, read from outside, or are otherwise explicitly initialized by the program. In those cases it's quite useful, because it lets you declare COG space that doesn't require any HUB space.
In the VGA program, unfortunately, the initial value of some of those "res" values does matter (if you look it's assumed to be 0). It was a harmless error in the original demo, since the res was followed by an orgh which inserted 0 padding so the values did end up 0, but if the data is moved around that may no longer be the case.
Huh? In what sense is res *reserving* space for x if $deadbeef ends up being stored at that location. Isn't that a bug?
• No it's the way it works.
You are supposed to put your RES stuff last normally, but you could also use RES lines to "define" a header, then specify a file after them, and use the res labels to access the beginning of the file data.
Regular DAT data takes up space in HUB as well as in COG, but RES doesn't consume HUB space, so it's handy for setting up buffers and temp vars and whatnot for use only in COG memory, but you need to make sure it's initialized properly yourself.
Also Spin code can access the regular DAT data in HUB space, which is handy for setting things before starting the COG.
This is how it has worked on P1 forever.
Sign In or Register to comment.
|
{
"url": "http://forums.parallax.com/discussion/164187/fastspin-compiler-for-p2-assembly-spin-basic-and-c-in-one-compiler/p21",
"source_domain": "forums.parallax.com",
"snapshot_id": "crawl=CC-MAIN-2020-10",
"warc_metadata": {
"Content-Length": "101736",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DDK4TQNEZKEHBLZCS6EKT3YSMRK63UHC",
"WARC-Concurrent-To": "<urn:uuid:74f91d88-6434-4cdc-8210-94158e6d9f49>",
"WARC-Date": "2020-02-20T21:17:34Z",
"WARC-IP-Address": "18.224.130.182",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IXKSOZI42K5CDBU33DSMDB3IZ6YZP24J",
"WARC-Record-ID": "<urn:uuid:f6090424-694e-4ed7-b655-bb713ba14371>",
"WARC-Target-URI": "http://forums.parallax.com/discussion/164187/fastspin-compiler-for-p2-assembly-spin-basic-and-c-in-one-compiler/p21",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:19f470d4-ef9a-4cc7-a833-b89f5b136a6b>"
},
"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-151.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,
71,
72,
86,
87,
96,
97,
174,
175,
189,
190,
209,
210,
232,
233,
259,
260,
269,
297,
330,
430,
431,
530,
531,
708,
759,
764,
954,
955,
967,
1469,
1508,
1547,
1586,
1591,
1592,
1604,
1880,
1899,
1927,
1934,
1976,
1985,
1990,
2141,
2160,
2188,
2195,
2249,
2258,
2263,
2264,
2276,
2832,
2997,
2998,
3010,
3211,
3231,
3270,
3290,
3301,
3306,
3353,
3416,
3435,
3454,
3473,
3492,
3511,
3530,
3580,
3676,
3681,
3961,
3962,
3983,
4029,
4055,
4076,
4097,
4102,
4117,
4122,
4132,
4163,
4190,
4204,
4209,
4210,
4211,
4314,
4460,
4461,
4876,
4877,
4906,
4915,
4935,
5223,
5479,
5480,
5481,
5494,
5583,
5622,
5661,
5777,
5782,
5795,
5796,
5947,
5968,
6119,
6161,
6183,
6260,
6261,
6275,
6276,
6295,
6296,
6318,
6319,
6345,
6346,
6545,
6546,
6566,
6743,
6883,
7048,
7207,
7219,
7420,
7440,
7479,
7499,
7510,
7515,
7562,
7625,
7644,
7663,
7682,
7701,
7720,
7739,
7789,
7885,
7890,
8170,
8171,
8392,
8393,
8442,
8443,
8452,
8577,
8597,
8722,
8723,
8763,
8798,
9063,
9084,
9349,
9350,
9442,
9470,
9503,
9669,
9670,
9848,
9849,
9912,
9913,
9931,
9959,
9992,
10199,
10200,
10209,
10398,
10399,
10410,
10510,
10511,
10530,
10825,
10845,
11023,
11212,
11213,
11233,
11242,
11431,
11432,
11469,
11480,
11580,
11635,
11654,
11949,
11950,
12204,
12225,
12245,
12423,
12612,
12613,
12748,
12749,
12777,
12778,
12806,
12839,
12847,
13143,
13213,
13283,
13405,
13527,
13532,
13657,
13658,
13668,
13743,
13789,
13876,
13892,
13909,
13914,
14078,
14079,
14100,
14183,
14229,
14326,
14343,
14348,
14651,
14675,
14708,
14729,
14763,
14819,
14824,
14847,
14877,
14929,
14941,
14946,
14965,
14970,
14996,
15083,
15141,
15155,
15170,
15180,
15210,
15215,
15216,
15249,
15328,
15349,
15724,
15725,
15912,
15943,
15976,
16069,
16070,
16212,
16239,
16240,
16317,
16348,
16381,
16472,
16518,
16527,
16548,
16553,
16558,
16566,
16579,
16584,
16585,
16638,
16959,
16996,
17030,
17050,
17087,
17121,
17122,
17231,
17244,
17255,
17268,
17290,
17295,
17359,
17372,
17397,
17402,
17477,
17478,
17640,
17641,
17953,
17954,
18290,
18463,
18464,
18536,
18639,
18731,
18759,
18781,
18802,
18826,
18847,
18856,
18861,
18962,
18984,
18989,
19041,
19042,
19274,
19275,
19276,
19297,
19317,
19354,
19388,
19389,
19498,
19511,
19522,
19535,
19557,
19562,
19626,
19639,
19664,
19669,
19744,
19745,
19907,
19908,
20220,
20221,
20557,
20681,
20682,
20712,
20922,
21172,
21296,
21297,
21342
],
"line_end_idx": [
71,
72,
86,
87,
96,
97,
174,
175,
189,
190,
209,
210,
232,
233,
259,
260,
269,
297,
330,
430,
431,
530,
531,
708,
759,
764,
954,
955,
967,
1469,
1508,
1547,
1586,
1591,
1592,
1604,
1880,
1899,
1927,
1934,
1976,
1985,
1990,
2141,
2160,
2188,
2195,
2249,
2258,
2263,
2264,
2276,
2832,
2997,
2998,
3010,
3211,
3231,
3270,
3290,
3301,
3306,
3353,
3416,
3435,
3454,
3473,
3492,
3511,
3530,
3580,
3676,
3681,
3961,
3962,
3983,
4029,
4055,
4076,
4097,
4102,
4117,
4122,
4132,
4163,
4190,
4204,
4209,
4210,
4211,
4314,
4460,
4461,
4876,
4877,
4906,
4915,
4935,
5223,
5479,
5480,
5481,
5494,
5583,
5622,
5661,
5777,
5782,
5795,
5796,
5947,
5968,
6119,
6161,
6183,
6260,
6261,
6275,
6276,
6295,
6296,
6318,
6319,
6345,
6346,
6545,
6546,
6566,
6743,
6883,
7048,
7207,
7219,
7420,
7440,
7479,
7499,
7510,
7515,
7562,
7625,
7644,
7663,
7682,
7701,
7720,
7739,
7789,
7885,
7890,
8170,
8171,
8392,
8393,
8442,
8443,
8452,
8577,
8597,
8722,
8723,
8763,
8798,
9063,
9084,
9349,
9350,
9442,
9470,
9503,
9669,
9670,
9848,
9849,
9912,
9913,
9931,
9959,
9992,
10199,
10200,
10209,
10398,
10399,
10410,
10510,
10511,
10530,
10825,
10845,
11023,
11212,
11213,
11233,
11242,
11431,
11432,
11469,
11480,
11580,
11635,
11654,
11949,
11950,
12204,
12225,
12245,
12423,
12612,
12613,
12748,
12749,
12777,
12778,
12806,
12839,
12847,
13143,
13213,
13283,
13405,
13527,
13532,
13657,
13658,
13668,
13743,
13789,
13876,
13892,
13909,
13914,
14078,
14079,
14100,
14183,
14229,
14326,
14343,
14348,
14651,
14675,
14708,
14729,
14763,
14819,
14824,
14847,
14877,
14929,
14941,
14946,
14965,
14970,
14996,
15083,
15141,
15155,
15170,
15180,
15210,
15215,
15216,
15249,
15328,
15349,
15724,
15725,
15912,
15943,
15976,
16069,
16070,
16212,
16239,
16240,
16317,
16348,
16381,
16472,
16518,
16527,
16548,
16553,
16558,
16566,
16579,
16584,
16585,
16638,
16959,
16996,
17030,
17050,
17087,
17121,
17122,
17231,
17244,
17255,
17268,
17290,
17295,
17359,
17372,
17397,
17402,
17477,
17478,
17640,
17641,
17953,
17954,
18290,
18463,
18464,
18536,
18639,
18731,
18759,
18781,
18802,
18826,
18847,
18856,
18861,
18962,
18984,
18989,
19041,
19042,
19274,
19275,
19276,
19297,
19317,
19354,
19388,
19389,
19498,
19511,
19522,
19535,
19557,
19562,
19626,
19639,
19664,
19669,
19744,
19745,
19907,
19908,
20220,
20221,
20557,
20681,
20682,
20712,
20922,
21172,
21296,
21297,
21342,
21373
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 21373,
"ccnet_original_nlines": 364,
"rps_doc_curly_bracket": 0.00009357999806525186,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3788659870624542,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04682131111621857,
"rps_doc_frac_lines_end_with_ellipsis": 0.016438359394669533,
"rps_doc_frac_no_alph_words": 0.248281791806221,
"rps_doc_frac_unique_words": 0.2365652471780777,
"rps_doc_mean_word_length": 4.303952217102051,
"rps_doc_num_sentences": 284,
"rps_doc_symbol_to_word_ratio": 0.0079467399045825,
"rps_doc_unigram_entropy": 5.84110689163208,
"rps_doc_word_count": 3517,
"rps_doc_frac_chars_dupe_10grams": 0.41685935854911804,
"rps_doc_frac_chars_dupe_5grams": 0.464160680770874,
"rps_doc_frac_chars_dupe_6grams": 0.45015525817871094,
"rps_doc_frac_chars_dupe_7grams": 0.42980775237083435,
"rps_doc_frac_chars_dupe_8grams": 0.42980775237083435,
"rps_doc_frac_chars_dupe_9grams": 0.4235978126525879,
"rps_doc_frac_chars_top_2gram": 0.006936649791896343,
"rps_doc_frac_chars_top_3gram": 0.01235383003950119,
"rps_doc_frac_chars_top_4gram": 0.00924886018037796,
"rps_doc_books_importance": -2262.148681640625,
"rps_doc_books_importance_length_correction": -2262.148681640625,
"rps_doc_openwebtext_importance": -1342.5372314453125,
"rps_doc_openwebtext_importance_length_correction": -1342.5372314453125,
"rps_doc_wikipedia_importance": -996.1781005859375,
"rps_doc_wikipedia_importance_length_correction": -996.1781005859375
},
"fasttext": {
"dclm": 0.08066487312316895,
"english": 0.9271929860115051,
"fineweb_edu_approx": 1.4781415462493896,
"eai_general_math": 0.9298551082611084,
"eai_open_web_math": 0.2704044580459595,
"eai_web_code": 0.5204717516899109
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-4,315,341,851,143,029,000 |
Want to read Slashdot from your mobile device? Point it at m.slashdot.org and keep reading!
Forgot your password?
typodupeerror
Compare cell phone plans using Wirefly's innovative plan comparison tool ×
Comment Thrift store videophone to video game hack (Score 2, Interesting) 210
This one was kind of fun:
http://cassettepunk.com/large-projects/phonetendo/
It's a crappy video phone that was "given away" with a contract, and I got it from a thrift store for $8 or so. Turns out it's got a Linux SBC in it, so between some of my own hacking and others who had reverse-engineered it, I turned it into a video game of sorts.
Comment Art vs. Hacking (Score 1) 31
Jonty, I'm mixing hacking and art and becoming increasingly aware of the self-segragation of creative work into either "art" or "hacking". Here in Vancouver, for example, we have "art" events (art crawls, galleries, etc.) and "maker" culture (maker faires, hackspaces, etc.) with almost zero crossover. The presumption is that art will be expressive, shown in public, and saleable, and hacking will be insular, self-funded, and have limited appeal outside other hackers.
I've exhibited technological work on a small scale to an art crowd and gotten a positive response, but I worry that going further on that side of things will be an uphill battle. The knee-jerk response may be "that doesn't belong here".
Have you encountered this kind of pigeonholing? If so, how have you approached it?
Comment Re:interestingly, has always been open source (Score 3, Informative) 43
OpenX has been through many twists and turns. I started using it with my employer when it was called phpAdsNew; it then became OpenAds; then OpenX.
It gradually went from a passably supported and FOSS-minded project to a hybrid model, with the FOSS part atrophying very quickly. It became clear to us that this was a liability and we stopped using it. We're now actively avoiding hybrid models like this.
Finding a 7-month-old backdoor vindicates our suspicions.
Comment If only there was some kind of standard... (Score 1) 332
Ever tried to use an iPhone with Linux? If you can't run iTunes you can't do *anything*.
iTunes is a tool Apple uses to avoid using standards and thereby maintain full control over the user's experience. They're tying themselves in knots trying to do it all within a single app, but the alternative -- things like allowing the phone to be used as a USB storage device, as pretty much every other vendor does -- is un-Apple. It's a wonder they even support PTP for photos.
I've happily gone over to Android, which does have its own quirks, but at least my Samsung phone hasn't been crippled by the vendor.
Comment Journal management software (Score 1) 103
Hi Bruce!
Obviously I'm biased, since I work on the project -- but have you seen Public Knowledge Project's "Open Journal Systems"? It's FOSS and its goal is to automate the management and workflow for publishing an academic-style journal. It wouldn't do your layout etc. for you, but it would help with submission management, peer review, and a lot of the associated stuff that needs doing. See http://pkp.sfu.ca/ojs for the details.
Cheers,
Alec Smecher
Public Knowledge Project Team
Slashdot Top Deals
Introducing, the 1010, a one-bit processor. 0 NOP No Operation 1 JMP Jump (address specified by next 2 bits)
Working...
|
{
"url": "https://slashdot.org/~pHalec",
"source_domain": "slashdot.org",
"snapshot_id": "crawl=CC-MAIN-2016-36",
"warc_metadata": {
"Content-Length": "70861",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:J73N4OMIENJZ2TZHOWBBIJGILGWXEF22",
"WARC-Concurrent-To": "<urn:uuid:16e6d4c2-c572-4bd2-a60b-b8fc5714224a>",
"WARC-Date": "2016-08-25T21:01:23Z",
"WARC-IP-Address": "216.34.181.45",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:2FKDEERR42U6PVMRIQXNXDCDT3O2HBTH",
"WARC-Record-ID": "<urn:uuid:e4c8b982-f115-4621-9ec3-70f1c8cc6ca0>",
"WARC-Target-URI": "https://slashdot.org/~pHalec",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3086b55e-e2af-47f5-bb69-73a597d59007>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-153-172-175.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-36\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
92,
93,
95,
96,
97,
98,
120,
134,
209,
210,
288,
289,
315,
316,
367,
368,
634,
635,
672,
673,
1144,
1145,
1382,
1383,
1466,
1467,
1547,
1548,
1696,
1697,
1954,
1955,
2013,
2014,
2079,
2080,
2169,
2170,
2553,
2554,
2687,
2688,
2738,
2739,
2749,
2750,
3175,
3176,
3184,
3197,
3227,
3228,
3247,
3248,
3357,
3358
],
"line_end_idx": [
92,
93,
95,
96,
97,
98,
120,
134,
209,
210,
288,
289,
315,
316,
367,
368,
634,
635,
672,
673,
1144,
1145,
1382,
1383,
1466,
1467,
1547,
1548,
1696,
1697,
1954,
1955,
2013,
2014,
2079,
2080,
2169,
2170,
2553,
2554,
2687,
2688,
2738,
2739,
2749,
2750,
3175,
3176,
3184,
3197,
3227,
3228,
3247,
3248,
3357,
3358,
3368
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3368,
"ccnet_original_nlines": 56,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3918367326259613,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02312925085425377,
"rps_doc_frac_lines_end_with_ellipsis": 0.017543859779834747,
"rps_doc_frac_no_alph_words": 0.2163265347480774,
"rps_doc_frac_unique_words": 0.5750452280044556,
"rps_doc_mean_word_length": 4.746835231781006,
"rps_doc_num_sentences": 41,
"rps_doc_symbol_to_word_ratio": 0.0027210901025682688,
"rps_doc_unigram_entropy": 5.406347274780273,
"rps_doc_word_count": 553,
"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.006857139989733696,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -251.3869171142578,
"rps_doc_books_importance_length_correction": -251.3869171142578,
"rps_doc_openwebtext_importance": -148.19662475585938,
"rps_doc_openwebtext_importance_length_correction": -148.19662475585938,
"rps_doc_wikipedia_importance": -85.65107727050781,
"rps_doc_wikipedia_importance_length_correction": -85.65107727050781
},
"fasttext": {
"dclm": 0.20330816507339478,
"english": 0.9560884237289429,
"fineweb_edu_approx": 1.327303171157837,
"eai_general_math": 0.05822610855102539,
"eai_open_web_math": 0.16449862718582153,
"eai_web_code": 0.033763110637664795
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-7,855,797,742,608,723,000 |
YouTube channelI have been working with clients lately to Google Plus their business and part of the process involves linking up to YouTube.
The initial process of linking a Google+ account and a YouTube account is very simple indeed. There are, however, quite a few things I have learned along the way. If you are a business looking to make the most of your Google+ experience, an individual looking to get all your ‘ducks in a row and ready to quack’, or a consultant who wants to guide people on their way, then this is for you!
Introduction and overview
The relationship between Google+ and YouTube
It is worth pointing out that YouTube is owned by Google. Yes, you may well have known this but the seamless integration of Google+ principles throughout all of Google’s products and services is something that can take a while to get your head past.
When it comes to YouTube, the video content that you share can be shared to specific individuals, groups (circles/communities), anyone who has the link, or ‘public’. Also, when the YouTube linked to a Google+ account that has ‘Google Authorship’ there could well be a lot more juice for search engine results. If you have a clear head shot on your Google+ account then you will be eligible for authorship and don’t need to do anything. Note: you can also get authorship when you link your account to your website, and any websites to which you contribute content, as well.
Here is the Ultimate YouTube overview video:
Ok, so now you are sold on linking your Google+ account to YouTube, but there are some really neat opportunities along the way. So, simply follow this step-by-step guide…
YouTube_logo_standard_white
Getting your account set up to meet your needs
There are a few options you have here (see below) and as such you will want to think about your YouTube channel name. Once you have read step 1-3, simply choose the option that will work best for you.
Step 1 Get ready to link your Google+ account to your Youtube channel (you have 3 options)
You do this by logging into YouTube with your Google+ credentials.
BUT do not click anything else YET! Read on…
Step 2 Secure the name of your company/page, if you don’t want it in a person’s name
Come to the upper right of the screen, click on your name and then, below it, click on ‘Channel’
Once you have pressed ‘channel’ DO NOT continue, you need to click the tab that says ‘change the name’ – then change it to your brand (assuming you logged in under your name).
This enables you to have a branded channel.
Step 3 Choose the best name you can if your ideal name has gone
You may well find that many names have gone and if you wanted ‘Zippitydooda’ you may find you get offered ‘Zippitydooda123’ etc. instead. Have a think whether this is the ideal name for your channel, and know that as soon as you get on that hasn’t gone it will be chosen.
So note: you don’t get a second chance so be careful what you choose!
Note: read below in concern of making sure your name is secured for your YouTube channel as well.
Option A – without having your Google+ Profile linked
Option B – with your Google+ Profile linked
Option C – with a Google+ Page linked to YouTube
Ok, this is just being rolled out as an option.
Firstly, you will need the account you are logging from to be a manager on the Google+ Page.
Then you need to click this link when logged into that account.
http://www.youtube.com/account_advanced
Does it say ‘Beta’ and a blue button saying you can connect? Well, you can connect and choose the Google+ Page name. If not, you have to wait!
For more information Youtube Blogspot here.
And Google+ Page and Profile Names general advice HERE.
PLEASE NOTE: the process is constantly changing and I’ve just learned that even when you name the account you may not have secured the channel name! As such you will also may well need to go to ‘YouTube settings’ then look at ‘Advanced settings’ and choose ‘custom URL’ – this is the name of you YouTube channel. Simply change it from the string of numbers/letters to what you want to see.
Next is Step 4:
Get your YouTube channel looking right
Add in an image, add in external links to the channel e.g. twitter, Linkedin, etc
Step 5 Link a website to your channel
This is a key step. Go to: http://www.youtube.com/account_features, then select ‘associated website’. Press ‘link’. Then you will be prompted to verify your own the website.
Step 6 Enable ‘monetization’ (important!)
You may never want to actually monetize the videos, but doing this step gives you more right in general, including: a) uploading customizable thumbnails and, b) ability to link a website to video channel – enabling you to drive traffic to your website using annotations
Do this by going to http://www.youtube.com/account_monetization under the ‘YouTube settings’ tab.
Step 7 Associate your YouTube channel with an external website
This enables you to drive traffic to your website through annotations. Very handy to do this straight away, so choose the ‘annotations’ tab and then you can ‘enable your account for external annotation links’. Next click on ‘enable’
Here is the direct link as well: http://www.youtube.com/account_associated_website
If there is an issue, return to ‘associated website’ step above and ‘refresh’ until you get the green button.
Note: when doing the annotations you may need to add in http:// before the web address.
Once you have done this, you can use annotations to encourage people to visit your site, or even land on a page set up for purchase.
From there you can ‘upload’ your videos and refine how they are displayed, including adding in advertising of other videos during playlist. Also, another tip that that could help give you more ‘sales power’ during the videos is showing another video during sections of all of them (they appear as a transparent icon on the screen). To set them up, go to ‘YouTube settings’ and click on ‘InVideo Programming’ and you’ll be guided from there.
Also, if you use Google Adwords, you can a) advertise the videos by clicking on the ‘All video campaigns’ tab in the lower left and then b) link the YouTube channel with your Adwords account.
So…
I suspect that search results of videos will more and more be based on your Google+ activity and as such, getting your ducks, as a person or a business, nicely in a row generally will mean you are ready for the opportunity.
How to upload a video:
How to embed videos into your website:
This is how you too can embed videos into your website (just like you are seeing now), using Worpress as the example:
How to create a hangout-on-air, integrate with a Google+ event and set it up on YouTube
This will be especially useful if you have already started to use your YouTube channel for broadcasting…
How to take a Google hangout, download an MP4 and use GarageBand to convert to an MP3
Once you have broadcast a hangout, or have another video on YouTube, you may like to strip out the audio and send it to people. I use this method to give me the MP3 file I need to upload as a Podcast. Even if you don’t use GarageBand, you will still see the process you can follow.
YouTube channel hints and tips from Ronnie Bincer, interview by Martin Shervington
Next, here you have a load of YouTube hints and tips for Google Plussers, with Ronnie Bincer
This is well worth the hour. Trust me!
New: Listen to the podcast…
[powerpress url=”http://traffic.libsyn.com/martinshervington/Ronnie_Bincer_MP3.mp3″]
Download Podcast
Website for Ronnie’s services: www.TheHangoutHelper.com/Services
Google Keyword Tool – Adwords
Site Ronnie uses for creating Video Transcripts: www.Speechpad.com
Ronnie’s YouTube Channel: www.youtube.com/videoleadsonline
Google Plus Community called GooTubePlus
Transcript with YouTube channel hints and tips, with Ronnie Bincer
Martin: Hi. This is Martin Shervington and today we are with Ronnie Bincer. And he’s going to give a load of YouTube tips, particularly for people who are already on Google+. And before we get to Ronnie, I’d just like to say hello to everyone in the room. George Cohen, how are you doing?
GC: I’m doing well. How are you?
Martin: Very good indeed. Now you are in the video world, so this will be interesting to hear your thoughts after the event as well. And then next to you we have George Seppich.
GS: Great to be here, Martin. Ronnie, and the rest of you.
Martin: Yes. And then Linda Dee. How are you doing, Linda?
Linda: Hi. It’s a pleasure. Thanks for having me.
Martin: Well, thank you for coming along. And Marilyn, how are you?
Marilyn: Good morning. Great.
Martin: Great. That’s very good. Sunny Californian morning by the sounds of it.
Marilyn: Absolutely.
Martin: Yes. And then we have Nazim. How are you doing, Nazim?
Nazim: Great. Honored to be here.
Martin: How is Milan today?
Nazim: Great, but.
[inaudible]
Martin: Still Milan. Let’s not complain. And then there’s – put Ronnie on center stage. Ronnie, welcome. And thanks for saying you would do this session with us. Are you ready to be grilled? Are you ready to have how many years’ experience – 7, 8 years of YouTube experience – pulled out of you in this next however many minutes?
Ronnie: Yes, we are going to try to pull out all 7 years. YouTube’s only been around for 8. I’ve been around on it for about 7.
Martin: Well, that is. It’s going to be great, Ronnie. I am, you know, I’m excited about this, because there are a lot of questions that – I’ve put the event on for me so I can ask you loads of questions, and how I could do better on YouTube. But I know that many people are going to really benefit. So it’s appreciated.
So kick off, do you want to give a little bit of background about what you’ve been doing over those 7 years on YouTube?
Ronnie: Sure. That’d be helpful I think. I started my journey on YouTube as a Video SEO guy, which means Video Search Engine Optimization. And I did that for different companies that I worked for, and eventually did it for myself as a consultant.
And so I looked at YouTube in the marketing perspective as to what can I use the videos for to get a message across to help people learn what I needed them to learn. Or asked them for certain call to action – those kind of things. And I wanted to make sure that my videos showed up high on the search results for my clients or for the company that I was working for. So that’s really how I first started with it.
Then I kind of grew into the realm. And before that, just to back up because this will be (I think) pertinent. Before that, I had spent quite a bit of time in my life training people how to use graphics programs. That was a travelling trainer. I went all over the world and I trained people how to use Photoshop and things like that. So I developed this skill of explaining technology. And that’s been helpful, especially for me here on Google+. So now we fast forward.
We are in video SEO world. And then Google+ comes out. So when Google+ first came out, I looked at it from an SEO perspective. Search Engine Optimization. If I do work on Google+ will it be affecting my search results. And I saw within 2 weeks that yes it did. And it did an amazingly fast fashion. In other words, something that might take a year I could do in 2 weeks. So I was just, ok, here I am.
So Google+ and me got along really fast. And I came at it from the background with video. And then they came out with Hangout Tool. And I call myself the Hangout Helper, because that was the perfect place for me to go.
I think it’s one of the best tools that Google+ has. We’re in a hangout. We are doing collaboration. We are doing all kinds of neat stuff inside video, and so we are video and search and social, all meet is in Hangout. So that’s why I gravitated towards that.
Martin: Fantastic. Thanks Ronnie. I mean you started to talk about Google+, and we’ve got YouTube. Whereas you and I, probably in our heads, the 2 are so closely linked now. Would you like to give a little bit around what’s been happening? And how that integration is occurring more and more, day by day?
Ronnie: Sure. I actually gave it, claimed a phrase, or at least I came up with it in my own head. It’s GooTube+ (which is Google, YouTube and Google+ all smushed together). This integration I’ve been watching and encouraging for quite some time, since it started, where you can do work in one place, it will show up in the other.
And the integration. For example, the simple integration, even though it’s not so simple technically, is I could point somewhere and do a thing called an annotation (which is something we will talk about maybe later) where people can click on a video in YouTube, and bam end up inside my Google+ place.
So that ability to go back and forth between those 2. Because, by the way in case you are not sure, YouTube is owned by Google. And Google+ is owned by Google. And so it’s clear that they are trying to bring the connection, because video is an emotional way to communicate a message. And that’s just one of the major tools in the Tools Set that Google has, if you look at the big picture, on how to communicate.
Martin: Fantastic. Thanks, Ronnie. I mean for those that are watching, just (you know) where the plan is to pick Ronnie’s brains in the nicest way. But we are going to look at annotations. We are going to look at captions. We are going to look at how to use Google+ for personal and for business. And that’s going to tie in to the SEO side of it as well for the Search Engine Optimization, both for YouTube and also talking about the bigger picture on Google Search. So let’s now kick of then.
If people haven’t really begun much with YouTube, how do they get started? What’s the easiest way?
Ronnie: If you are a Google+ person, well the easiest way is to make yourself a Hangout on inter, because if you are in a Hangout on inter (like we are right now), we are automatically streaming live, but then when we’re done YouTube graciously makes a video for us. So a video of our efforts inside Hangout on Inter is probably the simplest, cheapest, easiest way to just make yourself a video.
That would be how I would start if you are new to video. And if you have been around video a little bit, you probably have a few that you might have been playing with. I would say just make more and make more.
And just get used to being in front of a camera. For me, that’s what this Hangout Tool is phenomenal for. People could get used to being in front of a camera. And I can be in Martin’s Hangout, and not necessarily worry about.
And just see what I look like. And then eventually, I can start making my own with a Hangout on Inter. That would be my guess, or my suggestion.
Martin: So fantastic. So just to explain to everybody who are watching this after the live event, if you click on the caption. Sorry, the annotation. The top of the screen. There’s going to be more resources, and we are going to have some of the links from Ronnie as well that he will be mentioning throughout. And you will be able to click that and they are going to give you a lot more videos and processes that you can use as well.
Because just to explain, when Ronnie is talking about a Hangout on the easiest way to start, which is content creation, getting going on YouTube. Your YouTube channel, when you get it set up, will link to – or rather your Google+ Account will link to your YouTube channel, either under your name or you can change the name. And I’ve got a video on that, which I will explain in it’s how to do it.
But this way, it means that you are live streaming the content onto YouTube whilst it is happening in the Hangout on air. That’s right, isn’t it, Ronnie?
Ronnie: Correct, yes. And there’s some neat things coming out. This is right now we are recording this on April 1st. Happy April Fool’s Day. In 2013. And this sort of time stamping that, for reference point, there’s something that had been announced.
It isn’t quite out yet, but it’s coming soon, is the ability for a Google+ page to have its own YouTube channel. And that’s some really, really cool stuff coming up. But we are trying to talk about YouTube so much, I’m going to back off a little on some of those things.
Martin: That was great.
Ronnie: This is just an example of the integration.
Martin: Yes.
Ronnie: Because they are giving us, just giving us another tool that we can add to our Toolbox, that should be coming hopefully soon.
Martin: Ok. Fantastic. So let’s now say that people have gotten used to going to their YouTube Channel, they are creating content, they could be Hangouts, or they could be doing the Webcam Tool which is on there.
So they could be doing little video logs. Or they could be uploading Screencasts that are instructional, or they could be loading any of their MP4s and so on. So they have got content on their Channel. What advice would you give for people, in relation to (I don’t know) maybe the thumbnails, and making the things look right to start with.
Ronnie: Sure. Thumbnails is actually an area that was extremely interesting to me for about 5 years. Maybe 6 years, out of those 7. I wanted to become a partner. In the past, you had to become a partner in order to be able to choose your own thumbnail in video or image.
When you upload a video to YouTube, it gives you 3 choices. You have sort of the beginning, middle and end thumbnail-is. And they would never be exactly the right spot. Or when they were, they changed the rules. So basically, there was this cat and mouse thing. It was how do you figure out how to make your own Thumbnail work. There was people gaming the system. It got crazy for a while.
Eventually, I came up with a phenomenal trick, and then they shut it down. You know, all these things would go back and forth for years. And nowadays though, all you have to do is monetize one video, which means put an Ad against one of your videos and then they give you this button that says Custom Thumbnail. You click on it, and now you can upload your own image.
Whatever you want it to look like. It should be relevant to the video, right? You don’t want to have it totally unrelated, because that could get you in trouble. But you can make a nice image of what you want people to see when they are scrolling around looking for search results. Because it’s just like a magazine cover. You decide whether you want to open it up and look based on the cover.
So the thumbnail is one of the most important things you can do, is get a nice looking, quality thumbnail. Add that to your video with the Custom Thumbnail button. And you get that button by adding in 1, just 1. But you can do more, Ads onto any of your videos. And they gave you that option.
And then all of a sudden you are a partner. So it’s a lot easier nowadays to become a partner than it used to be. In the past, I promise, it was really hard. I became a partner on one of my channels, and one of my other ones I never could become a partner. And then, bam. It’s available for free for everybody.
Martin: Fantastic. I’ll have that in the – if you click the annotation, there will be some instructions on how to do that process in the videos. Now you mentioned that monetizing and you could have one next to 1 video.
From my understanding, if you then decide not to monetize a video, the right to still upload that thumbnail is still there. So you’ve activated it, you are rolling then. Is that right?
Ronnie: Right. And there’s nothing wrong with monetizing other, which is you can put Ads on your video so that you could potentially make some income from it. So I’m just pointing out that you don’t have to put ads on every single video in order to get this function.
You technically need to have it on 1, and then that function for the custom thumbnail is available for all of your videos.
Martin: This is the great thing, isn’t it. So it gives you the flexibility by saying yes I’d like to monetize, even if you never monetize everything.
Ronnie: Right.
Martin: Fantastic. We are going to come on to monetization in a little while, but I want to just start picking your brains on a few other things. Annotations, right? Do you want to explain what an annotation is?
Ronnie: Sure.
Martin: If I say an annotation too many times, and I’ll tell you it comes out really strangely.
Ronnie: Ana, ana, ana. No, it’s called an Annotation, and basically if you think of when somebody has a picture and they were to add a little bit of a thought bubble with say hmm in the thought bubble. And it’s sort of pointed towards their head, that is the initial use of what an annotated picture looks like.
Well, the idea is I can have a video and I can put a little thought bubble to the side of my head, and if I said something wrong – like I said ana, ana, ana, annotation – I could say it’s really annotation. Have text so how it’s supposed to be spelled. And it’s said once. And just sit there alongside me.
That was the beginning of annotations. Just adding – if you made a mistake, instead of having to upload the video all over again and make an edit and all that, you could just basically add a button that had text on it, that you could correct yourself.
Then it got even better, because they added the ability for these annotations to be clickable. And clickable meant I could click on that button and have it jump over to another video. So I could say, you know if you want more details go ahead and click here. And I just point in the air.
And then later on I go back to my video and I add (inside YouTube) one of these little buttons called Annotations. Make it clickable, and then when someone sees it, they can click on it. And then it takes them right off to another video where they can watch some other content. Or, like I mentioned a little earlier, they could jump right from there to jump over to your YouTube – I’m sorry, to your Google+ profile, or eventually page and things like that.
Martin: Ok. Fantastic. So we’ve got your summary. So it’s just the first one is you can to another YouTube video. The next one that you mentioned is the Google+. And then we’ve got a third one as well, which we are going to come onto. How do we get to go to a Google+ profile?
Ronnie: Was the third one something starting with the letter S? I want to make sure we cover that later.
Martin: No, it was something else. So maybe a fourth one. The third one was website.
Ronnie: Ok. That one. That’s actually quite a surprise. But one that is really important for YouTubers, which I do know I think you wanted to cover later, is talking about subscribers.
You can get people to subscribe to your channel via an annotation click, right? So, but the idea was in order to do it so they can go to Google+, you need to make your channels what are called connected. And when you connect your Channel, you basically have to share the same name that you have inside Google+ as your Channel name on YouTube, and then it sort of makes this connection.
And that allows you to, in one of your annotation choices, to say I want my annotation to be clickable and have it jump the person that’s clicking on it over to my Google+ profile. It’s a great, great, great opportunity.
However, one big deal. If you are pointing in the air, it’s saying click here. Unless the viewer themselves clicks the little button at some point to turn on annotations they are just going to see you point in the air, because they don’t see the little button. So the button’s not visible to everybody.
And then one big caveat is that it doesn’t work. Sorry. It doesn’t work in mobile. When you are on mobile, you can see those annotations, but you can’t click on them. At least not yet. Hopefully soon, but it’s a big deal because 50% of the traffic that YouTube is now getting is based on mobile viewers. So that’s really
Martin: That’s really useful to know. No, that’s great. Ok. So we’ve got 3 things – oh, we’ve got 4. We are going to do the 4. So we have the first one is the use of annotations is YouTube. The second one is to a Google+ profile, the third one we are going for is Website.
Ronnie: Right. Website. This is something that I was totally shocked when they came up with it, because I thought they would never, ever, ever, ever let a YouTube viewer leave YouTube to go to my website. That just seemed just incredible that they would let them – let me do that – and now you can.
There’s a thing called an external website. Or external website link I think is the technical name. And when you sign up for it, basically you ask for permission. Can you get this. And they verify that you own the website by having you put some nerdy code in the site. There’s basically little rules you have to do to follow. But once you get it, you can actually say go to my website, click right here, and you can sign up for my newsletter. That is incredibly powerful.
The ability for you to do that. And not only can you go to your homepage on your website, you can go to any page on your website. But let’s play by the rules here so you don’t get it shut down.
You want them to stay on your website. You don’t need or should – you should not have that become what’s called a redirect where you sort of falsify and say they are going to go one place, and bam they end up somewhere else. You do that for very long, YouTube will shut that off. In fact you might get shut down.
Martin: Fantastic. Just to say I’m going to have instructions on how to get that set up. The fundamentals in the link. If you click the annotation above Ronnie’s head – most probably there. Putting the other side, actually Ronnie. But it’s alright. We won’t worry about it.
Ronnie: Oh, over there.
Martin: I might swap it round.
Ronnie: It’s right up there.
Martin: It’s somewhere. Exactly. Let’s go for number 4. First of all, what is a subscriber?
Ronnie: A subscriber. Let’s back up to the idea we are going to channel this. If you would think on your television set. I think over in the UK, you call them tellies? Isn’t that right?
Martin: Yes.
Ronnie: On the telly? Ok. Your television – you can. In the past – this is way back. There was a little round nob, you would turn it. Click, click, click. From one to the other.
Martin: I remember that.
Ronnie: Yes. Now you have this little thing called a remote control, where you press buttons and it moves from channel to channel to channel. So you might have 10, 20, 6K channels to go through. And the idea was when YouTube came out you would have your own broadcast channel, where you could tell people this is my story.
You could put your videos on your own channel. So that’s basically why they came up with the name Channel. Most people don’t get that at first. But you have your own channel amongst the YouTube network. So a channel is where you show your stuff. And the people that are able to access your channel is everybody. Anybody can find it.
But those that have said I really like this channel, and I want to see what’s on it on a regular basis, are what are called subscribers. So when you get people to subscribe to your channel, there’s more – there’s a higher likelihood they will see your videos because you are sort of on their list of my favorite channels to go look at.
Martin: Ok. And how do we use an Annotation? To get people to subscribe? To give them the option anyway?
Ronnie: Subscribe to your channel is one of the techniques that you would say click right here to subscribe to my channel. And you stick a little annotation button there, and then when you go to edit your annotations you would have 1 of your choices to make it a subscription link. And then you type in the name of your channel, and it will go there.
Because literally you could say, you know, go subscribe to Martin’s Channel. I could tell people on this annotation to subscribe to anybody’s channel. Or watch anybody’s video. So it doesn’t have to be just your stuff. You can collaborate within your annotations, and go from place to place. It’s pretty cool.
Martin: Fantastic. So that’s the thing. The option is there in that drop down, and you can choose subscription. You are making it a subscription annotation. That’s it. That’s a great tip.
Ronnie: Yes.
Martin: What about the kind of fonts, and the color and all the crazy options we have with annotations themselves. What’s your view?
Ronnie: That’s a good question. The annotation tool adds things. They take away things. Depending on, you know, the weather. It seems to change off and on. There’s things in there that I don’t necessarily suggest you use unless your style calls for it. For example if I’m going to put annotations all over the place, it gets to be distracting from the main message, unless that’s sort of my style. I’ve seen people do that as a style thing. Say click here for this, click here for that, and go over here.
And you’ve got annotations all over the place popping up on top of your face. It’s just fun, sometimes. Or it might be distracting. So think of that as well when you are trying to talk about the font size, as well as the colors of the buttons. Do you want them to really, really grab attention? Or do you want them to sort of be there as an additional option? Depending on the style.
Now when I’m near the end of a video, that’s when I really push the annotations because if someone’s made it that far (meaning they’ve watched enough of the content that they’ve taken it to the very end), then they are probably more interested than someone else. And so then I want to encourage them.
Here’s the next thing I’d like you to watch, or the next thing I’d like you to do. And so I will tend to have more annotations visible at the very end of my video than the beginning. But some people, you know, they stick them right there from the beginning, right all the way through.
And by the way, if you’ve made a video and things have changed drastically since that time, instead of just taking that video down another idea with the annotations is stick up when they are saying this has been updated click here. And you can let it stay there the whole time while you are talking the first video. And then there’s a good change someone at some point will click there and then they will see the new content.
Martin: Fantastic. Ok. Next one then, Ronnie. What about captions? Do you think they are something that’s worthwhile looking at?
Ronnie: Oh, for sure. For sure. Captions is another name called Closed Captioning. And initially the idea was for speech, or for hearing impaired, people that couldn’t hear what you were saying, you have the ability to type text and add it to your video.
So it would basically say the words you were saying in text, so that those that couldn’t hear, or with hearing difficulties could read the captions. But it turns out a little bit later on for the nerd in me, I did some experimenting. This was quite a while back. And I found out that if I were to type in those words, my video would rank better in search results because now Google could actually read the words that I was saying better than it could try to figure it out on its own.
And still, to this day, is something that I do for all the videos that I really want to show up in search I will add a closed captioning transcript to the video. So that hearing impaired can see it as well as Google can see it, and what’s also neat right now is it’s also a lot easier for it to get translated into multiple languages.
So even though I’m speaking in English, someone that’s reading French could see the words show up in French.
Martin: Ok. I’ve got several questions there, Ronnie. Right. So the first one. I’ve got to hold on to where we started. There’s lots to this captioning. So the first one is – is there something which is a transcript? As well as a captions? Is there the 2 options that people can do?
Ronnie: There are some technical differences between the words that you are using. A caption is what we end up seeing. The transcript is what you actually upload into the tools so that it can become a caption.
Martin: Ok. And these – the captions – are time coded, aren’t they? So they appear at the time that the words are spoken on the screen. So, what are the automatic captions like? At the moment? And should people use those, or should they consider using a service?
Ronnie: Good question. Automatic captions, which are called machine transcripts (I think is what they call them), or machine generated is YouTube’s effort to understand the words I’m saying and turn it into text.
And that sort of happens behind the scenes. And 95% of it is probably pretty good. But that other 5% is somewhat laughable. In fact a lot of people make fun of these captions that are automatically generated, because they come up with the wrong words.
Now YouTube recently – I’d say within the last year – has made it a lot easier and a lot better so that you can go in and just edit those weird words that get done by accident. And so you can go in and edit. Fix those things. And you are good to go. What I tend to do is I don’t mess with the automatic captions. I just send it off to a service. There’s one I use. I’ll just say which one it is.
Martin: Yes, that’s all right.
Ronnie: Ok. The one – my preference right now – is called SpeechPad.Com. Speech Pad Dot Com. And Martin will put a link in the thing somewhere for you. And then. It’s about the – if you are willing to wait about a week, you can pay about $1 a minute. If you need to get it faster, then it costs more. Like up to $1.50 or $2 per minute. I forget what their rates are exactly. But they do a really good job of using machine as well as people to edit, and make sure that the words are said properly. Or written properly. And so I just tend to use that. It’s better for me.
But if it’s just a simple video and not saying a lot, I’ll let the automatic captioning do it. And then I’ll go in and edit and make sure that the words I am saying are actually what’s being typed. But just let me give you a tip. This is not a place to game the system. You do not want to start putting in words in the text that you are not actually saying. Within reason. I mean if I say the – if I use conjunctions, like I can’t do this I can type in the words I cannot do that. And that is acceptable versus can’t.
But you don’t want to go so far aside that you are sticking in Keywords that aren’t really spoken in the video.
Martin: Ok. What about captions on hangouts on air?
Ronnie: Do you mean live ones? Or do you mean after the fact?
Martin: After the event.
Ronnie: After the event. Yes. That’s a good one, except that I tend to not do that because these things get a little long and that’s $60 every single time I want to do it.
Martin: Expensive. But people can do it if they want to. If the content is there.
Ronnie: Oh, certainly.
Martin: So in exactly the same way.
Ronnie: Yes. If you are doing – and I would base it just on the value of the event. If this event is so valuable that I want to really rank for it, then I probably should (you know) pay for the captioning or do the captioning and get it done.
So – and one thing that’s helpful along with the captioning is if you have a team. If you have people that are willing to help you, they can go in and edit part of the video. And then you can share the result, or share the workload with other people to help you, especially if you do a lot of these hangouts.
Martin: Absolutely. Well you mentioned team, which leads me on to the next bit. Which is still with captions. Who would have thought there’s so much on captions! Still with captions. Translations. And you touched on it. What are your thoughts on – I mean are translations automatic?
Ronnie: Yes. The automated – let’s go back to – let’s just start with English. We are going to start speaking with English, and then we are going to translate to other languages. So if I started in English and the Google, YouTube, whatever you want to call it.
The YouTube tool that’s doing the translation is 95% accurate. There’s probably a good chance that when it translates from that, 95% accuracy, over to 6, 10 other languages, that it might get a little worse as it goes, right? Because it’s translating which in and of itself is tricky. And it’s translating sometimes not the exact words in the right order, and whatever.
So I would encourage people, if they are really interested in specific language, and say Spanish for example, that that might be something to hire someone to verify that it got done well in Spanish. And then have them fix that.
Depending on your target language group. I mean I’d make sure that you adjust the automated captioning. And there’s a tool now – I forget now – 4 or 5 months ago, maybe it was only 3 months ago. I don’t know when it came out.
Recently, where you can share the load. And you can say, hey anybody over there in Poland want to translate this for me into Polish? And it gives them the authority to come in and do the translation for you. You can approve it. Of course I wouldn’t know, you know. That’s me saying I don’t speak Polish in Polish. So there’s different ways you can do this, where you can share the load. And I think that’s pretty cool that they’ve done that.
Martin: And just to explain, so that’s when you go into the captions area within the Infer amations bit inference settings. And then into the captions area. It says request a translation. And you look then to invite people to translate, and you put in their email addresses, I believe, and that will then send them an invite. You can give them a little message as well which then enables them to do that work within the YouTube system.
Ronnie: Exactly, yes. You don’t want just anybody translating because that might not be the best result. But so, if you basically try to build a relationship. And that’s one of the beauties of Google+. It’s global. Right? So I can build a relationship with people all over the world. And if they really like my stuff, I can ask them would you do me a favor and help me translate this video’s captions?
Martin: Fantastic. Ok, right. Thank you. Let’s now have a look at promotion of the video. So we’ve got the videos up. We’ve got annotations. We’ve got the captions. We are all ready to go. We haven’t talked about the title. We haven’t talked about the description. We haven’t talked about the Hash Tags. So maybe if we could start there.
Ronnie: Sure. Those are great places to start. Again, scrolling back, realigning back to the very beginning of the Hangout, we talked about I came to this world of video from a video search engine optimization angle. And so those were very important pieces, meaning what’s the most important part in order.
So one. Here’s my list. And this really hasn’t change in my mind over the last 7 years. The most important part – Thumbnail. Ok?
Even though it’s not showing up in search results necessarily – or actually let’s forget all the caveats.
Thumbnail. Get a good Thumbnail.
Second, good title. Your title and your thumbnail are very, very important because those are the things that people see and decide am I going to watch this video or not? Am I going to invest my life? This period of time in my life to click the button? And if you have a nice compelling picture and a compelling title, that’s going to work for you.
Third is behind the scenes. This is my perspective, ok? Behind the scenes there are things called tags. And in the technical world, they call them meta-data. This is the things that are not necessarily seen by people but it is seen by the computer. So you have tags which are key words.
Everywhere else in the world calls them keywords. Inside YouTube they are called tags. So I go for the thumbnail, I go for the title, and I make sure my tags have the proper keywords in there that I’m thinking people are going to search for to find my video.
And then I would go up to my description text, which is what something that’s readable by people. And I would also include the title information, or the proper keywords. So here’s Ronnie as the nerd talking about how – what’s a good way to make your videos work well and get found in search. Is way before you even start your video you think about what are the proper keywords that people are going to search for to find my content.
Second step – you build yourself a script to make sure you say those keywords in appropriate places. And I’m not talking about stuffing it with keywords that are inappropriate. I’m saying build your content around those words that you are expecting people to search for. And then you record your video.
So it’s backwards from most people. Most people will say I’m going to make my video and then later I’m going to figure out what keywords to promote that are in the video. Well that’s wrong. I was going to say a bad word, but it’s just wrong. You are better off starting out thinking through the process, how are people going to discover my video. Build the content around those words, and then make your content. That way it’s going to be a much more natural flow. You are not going to be trying to stick keywords that aren’t really part of the video.
Martin: Ok. Fantastic, Ronnie. I’m going to jump back to – we’ve got the thumbnail, and then you’ve got the title, and then you’ve got the description. Now if we share a post
Ronnie: And the tags.
Martin: No. I’m – yes, ok. We’ll leave the tags for a second. I’m just sticking
Ronnie: Ok.
Martin: So if we’ve got that, which is – what is shown. So if I take a YouTube link, and I share it as a Google+ post for instance. And I can share it from YouTube directly, or I could share it within Google+ itself. It’s all Google+. But I can share it within – how do we say this? It’s all Google+. But then I share a post.
Ronnie: Google+. We share it.
Martin: Right. And what I see is the thumbnail appear, and I see on top of that thumbnail, overlaid, is the title of the video. And underneath that, or next to it actually, is it? Is the description. But basically you see part of the description appear. Depends on the length of the title, I guess. Have you got any – do you have a little tactic or technique for dealing with that? Because sometimes it looks prettier than others, or?
Ronnie: Yes. There is so much stuff to cover. So here we go.
There’s a quick overview. When you are in YouTube nowadays, and you try to share your video, there’s a button that says share. Or if you go into YouTube somewhere and you click share, or whatever. You are trying to find the link, the URL, for the video. There’s a shortened version and then there’s a longer version which is called the full link. You’re best off grabbing the full link, wherever you can get that, and that’s what you use to share it because if you do the shortened link inside Google+ you get this HYPERLINK “http://www.youtube” www.youtube, or you – it’s just shorted.
And you see all this nerdy text. It’s a link people click on it. If you do the long link, instead of showing the nerd words, or the nerd letters, that actually shows the title. It automatically transposes or translates the text of a URL into a blue clickable link that says the words.
And some of you have seen all, like I say, High5 or Attaboy or good job. I’ve made a bunch of little videos when I discovered that. I call them YouTube Attaboys. Or Blue Link Videos. Because they are clickable, but they add blue text into the midst of your post, which is incredibly valuable when you are trying to get attention out of everybody’s posts running by.
Mine stand out a little bit, because I’ve added some YouTube links. But they only work if you use the full YouTube link. Now that wasn’t even what you were asking about. But –
Martin: It wasn’t what I was asking. It wasn’t. That was another thing. So this – we will just finish off from the first one. So the first one – well, no. Let’s stick with it. So that way, that’s not when you are sharing that link into, so that the video appears as a Google+ post. That is when you are sharing a link as text, in essence, within the body text of a Google+ post. So you could still then add an image to it. Or you could put a video, and so on.
So you were actually right. It wasn’t what I asked, but it’s great. It’s a really good tip. So that way, just to recap, you are able to grab peoples’ attention, and they straightaway can tell what the content is of that link they are about to click. Whereas the shortened version, they wouldn’t have a clue.
Ronnie: Right.
Martin: So, let’s go –
Ronnie: But you were –
Martin: The original.
Ronnie: The initial question was ok, I’m in Google+, and I’m going to post a video so that people can watch the video. They can see it. They can comment on it. All that stuff inside Google+.
Martin: Yes.
Ronnie: So I’ve started a post in Google+. I can use the add YouTube Video link button. Or I can just paste it in there – the link, whether it’s shortened or long doesn’t matter at this point. And it automatically opens up at the bottom and shows me the thumbnail of the video. And that’s what’s going to be there as a clickable, playable link or video, right there inside Google+.
And so your question was where does the title show up? And what does the description text? Well, there is a little overlay on the bottom, which I don’t particularly like. But that’s there anyways. That shows the words of the title, and it also shows sort of the very first line of your description text. Most of the time. And so that’s there automatically. And your question was, I think, tactics meaning what should I do there?
Martin: Yes.
Ronnie: In the past, people that were really big on YouTube would say make sure you put a link to your website as the very first line, and that was one of the techniques people have said I have never subscribed to it being the very, very first thing. But I do subscribe to the idea that being within the first 3 lines or the first 2 lines of text of the description.
Because you want to make sure when you are looking at YouTube you don’t have to encourage or force the viewer to click the more info, so that they have to open it up. You just want it to be as easy as possible to get to your website by clicking something that’s visible. And here I am – I’m off to another rabbit trail. Sorry. So back to your question.
Martin: Well, let’s just go down that rabbit trail just for a second then.
Ronnie: Ok.
Martin: So you think then – so we’ve got below the fold. That click. Do you put content below that fold?
Ronnie: Oh, yes.
Martin: You do?
Ronnie: Yes. That content below the fold helps it show up in search results. It’s good to put lots and lots and lots of text in your description text that is helpful for people that might be looking for the video and want to learn about the video. Because people learn in many ways.
They might visually watch and scan through the text while you are saying your stuff in the video. Or they might just read that text and never watch the video. Or they might do just watch the video. You know, so there’s reasons why you want to have lots of text in there. It will help your search results.
Martin: Ok. Fantastic. Let’s now have a look at monetization of videos. So do you want to explain how that works on YouTube?
Ronnie: Yes. You take a box, that says monetize my video. There you go. That’s all I’ll say.
Martin: Does that link to Google AdSense?
Ronnie: One of the things you can do inside of YouTube as a partner, and you are a partner now when you check the box and said I’d like to monetize my video. At first it will let you just go for it. You are running up.
But once you get up to $100, I think, is the threshold, it then asks you to connect it to your AdSense Account so they can figure out how to pay you. Otherwise, you know, they’ll you start accumulating funds until you get to a certain point where they need to pay you. Then you need to connect it to your AdSense Account.
Martin: Ok. And just to say then, so Google AdSense is a way for publishes (and you are a publisher on the channel by having your content on there) to add Ads or to have the right for Ads to be added to that particular content. Is that a reasonable way of describing AdSense?
Ronnie: It is. Let’s explain a little – let me make one clarification. When I put up a video, it’s Ronnie’s Video talking about Hangouts. There might be a Ford or Chevvy truck wanting to stick an ad, what I call, against my videos.
So I’m not choosing who advertises. I’m saying my video’s available to be monetized, so that all you advertisers out there. My video is popular enough and a lot of eyeballs looking at it. Go ahead and stick your Ad on here, and there’s lots of different formats for that Ad to take place. Can I go into that, Martin, now?
Martin: Yes, that would be great. Just the bullet points.
Ronnie: The overviews. Yes.
The thing that’s been around for the longest is called an Overlay. There’s an Ad Overlay that sort of shows up, that link of like this lower third does right here. It’s there all along while the video is playing, and it sort of changes sometimes. 1, 2, or 3 different Ads can show up there. And people, while they are watching the video, might click on it. And then they go over to some other website, and then get (you know) encouraged to buy something or do something. That’s called the overlay.
There’s another type of Ad that’s relatively recent, which is called True View. And True View was added as the ability for, instead of Ronnie’s Video playing right away, it would actually play potentially another video before mine even started. So the Truck commercial would come there for 10, 15, 20 seconds, and then it would jump over to Ronnie’s Video and keep going. So that’s one way – it’s called a pre-roll ad. Because True View has 3 formats.
There’s pre-roll, mid-roll and you might guess where that shows. And then post-roll. And when I say mid-roll, It’s not actually. It’s wherever you tell it. You tell it at a certain position within your video timeframe – I would like to have my mid-roll ad show up somewhere.
Martin: I’m going to interrupt you now. Because you told me something that I just thought was a fantastic application. Do you want to explain the potential, if somebody had a show, of how they could use that mid-roll ad?
Ronnie: Hello? Just kidding. Yes. If you have a show and you know. Let’s say your show is going to be – I’m going, so 15 minutes long. A 15 minutes show. And you know after 5 minutes you would like to insert an ad.
You can basically time your stopwatch, you know get going. And then at about 5 minutes, you say we are going to pause here for a word from our sponsors. And then just sort of – And then come back and say here we are.
So then you could later on, and when you’ve uploaded your video you can say I want this True View Ad to show up at 5 minutes and 2 seconds into the video, and then when people are watching the show it gets to 5 minutes 2 seconds. Boom. An ad shows up for this undetermined period of time, because it’s going to be based on the ad’s length, and then you are right back to your show.
Martin: But it is amazing, isn’t it? Really? I mean that’s a brilliant application. So thanks for giving us that one. I know that people are going to want some more tips. And if they’ve watched this far, well done for sticking with it.
Because we are going to go back to a little bit of a search engine stuff now. But this time, unless you’ve got any more tips on search. Oh yes, let’s look at that. What about thumbs up? Ronnie? What’s the role of the Thumbs Up?
Ronnie: Thumbs Up is like a like in Facebook. It’s like a +1 in Google+. It’s your – you are asking people to vote on whether they liked the content or not.
And so thumbs up, the more thumbs up you get, the more viral your video could become because people are looking at how many people like this video when they watched it. So
if you get 10 thumbs up, that’s fine. But if you have 1K thumbs up that’s even better. So one of the things people will do at the end, or in the middle of their videos. So if you like my content, give it a thumbs up.
You tell people what you want them to do. It’s real basic marketing. But it’s a good idea to remember. Ask them. If you like the video, please thumbs up and share it with your friends.
Martin: And then it’s the same sort of principle as asking people to subscribe, just during there so please to be and have an annotation there available.
Ronnie: So we’ve got thumbs up, subscribe, comment and share it with your friends. These are all things – actions – that you can ask people to do. And those are all valuable to give your video a better chance to show higher in search results because just like Google, the more interaction you have with something, the more attention it gets with comments, and basically interaction, the more possibility there is for it to show up higher in the search results.
And you’ve got a lot of videos – let’s throw out the number to scare people a little here – there’s 72 hours of video uploaded every minute of every day of the year. 72 hours of video for every minute, so there’s a lot of competition out there. You need to get yours to stand out somehow, and so if you can get a tribe or a group of people, your subscriber base and their friends, to give it some love, give it a thumbs up, comment, share, it’s going to help it stand out.
You have good quality titles. Good quality thumbnails, pictures. Then you are going to have a better chance of getting found.
Martin: Ok. You’ve just led onto another thought. When that – I upload a video, and I’ve got different settings. I’ve got public, I’ve got unlisted, and I’ve got private. We won’t go into all the nuances of it. Do you want to give a quick overview of what they are?
Ronnie: Sure. Public – these are formats basically you can say who can see my video. So when you upload it to YouTube you can say I want to make this video public, which means that everybody in the world can see it.
I want to make it what’s called unlisted, which means everybody in the world can see it IF and only if they have the link to it.
And then I can do private. Anybody – nobody in the world can see it except these people.
And you give a list inside YouTube and say these are the people that are allowed to see it. And even if those people share it with one of their friends, it won’t work because they can see the box. But when they click to play it, it will say sorry this video is private. Because if they weren’t on the invite list to view it, they won’t be able to see it. So those are the 3 categories.
Martin: And if a person’s linked their Google+ profile to their YouTube Account and they’ve uploaded a video, they can choose to share that video. And the private setting to circles. Extend the circles, as well as the email addresses and so on. Is that right?
Ronnie: Yes. I’ve never tried extended circles.
Martin: You can, I think.
Ronnie: I’ve never tried it. No. I don’t – I do believe it. I was going to say I don’t not believe it, but. So yes, this is one of the valuable things that YouTube and Google and Google+ are giving us with this GooToo+ thing. It’s incredibly valuable.
The ability to curate a circle. I mean gather people into a circle that you know are kind of interested in a certain topic or have paid you as a client to get this valuable premium content.
And then you can make that private video sharable or viewable to everybody in that circle. And all you have to do is add the circle. You don’t have to add all these lists of long lists of people. And in the past you were limited to 50 people within this private sharing environment. Now with the Google+ circle capability, we are I think limited to 5K, or something like that.
Martin: Ok. So just to explain for people. We are talking 2 slightly different things. The first one is when you upload the video to your content and you can choose who has the access to it. And then earlier on we were talking about who you share a video to.
Now the assumption on that was that it was public, and that’s just sharing as you normally would within Google+, but when you own the video you get to decide who’s going to be able to see it anyway.
Ronnie: Right.
Martin: So where I was going was so I upload a video. I do the title, I do the description. I do the tags. And I have it at that time that it’s not available for anyone to see. Just in that moment. Then I can choose – there’s a box that says subscribers. Sorry, message to subscribers. If I switch it to public, that I can send a message to my subscribers.
Ronnie: Yes.
Martin: Yes? What advice would you give to people when they have that choice? Because it only happens once on a video, doesn’t it? Once you’ve done that move, you moved it from private, or well even. No, so we’ve moved it from unlisted to public, you’ve lost the chance unless you send them a message at that time.
Ronnie: Yes. There’s a messaging option that’s been added within the last couple of months for YouTube to send a message out to people that are connected to you on Facebook, I believe – I don’t use it, honestly. But Facebook, Google+ and I think Twitter, but I’m not positive whether Twitter gets that or not.
But basically it’s a way to say, hey I got a new video. Here’s what it is. And it gives you a little bit of an area for you to type text.
The reason why I don’t use it is because I have no control over it. I prefer to publish it on Google+ with the level of control that I’ve got. Because I’ve got certain people in certain circles that have said Ronnie, whenever you publish I want to be alerted to your content. And so I’ll add that circle, and I’ll check the little box, or tick the box that says Also Email which then sends a notification.
That to me is a better way to send my video out than this almost automated message, which is done from within YouTube, because I don’t have that control that I need inside the YouTube area.
But if you’re not interested in this level of control, you can do what Martin’s mentioning. Is you can add a message to your people and then when you make it public it sends out that message to everybody.
Martin: I think that’s a really good thing, Ronnie, is that you were looking here on YouTube and the relationship with Google+ and the flexibility that you have. And it really depends on the numbers of people that you have in those circles, and looking at making the most of what you’ve got.
Ronnie: Yes.
Martin: Yes, I’ve got the dog woofing in the background. I’m going to leave him woof. Ok. Let’s now look at – so we’ve talked about. So there’s so much to this one, Ronnie. It’s wonderful. So thank you for letting me pick your brains. We’ve been talking about.
Ronnie: We know we are just scratching the surface here.
Martin: I know. But it’s still great content. We were talking about Search Engine Optimization within YouTube. But what about looking at listings within Google Search itself?
Ronnie: Right.
Martin: What are the ways to get better listings? I mean do videos show up?
Ronnie: Yes. Let’s back up for a second. There are things called search engines. And most of you probably know this, so I’m just going to make mention of it.
Where you can type in something you are looking for, you are searching the internet, and it gives you a page full of results. And then there’s 10, 20, 30, 40, 50 pages full of stuff. And then you get to decide out of the results that you see which is the most important to you.
So the goal of a good optimized piece of content, like a video, is to show up near the very top of the very first page. So, like, you’d usually 1, 2 or 3. The first 3 spots are sort of the goal. Number 1, of course, is the biggest goal. But – so there’s 2 big search engines that we really need to talk about.
One is called Google.com. That’s the biggest search engine in the world – most of you know that.
The second one, which many people don’t realize, is called YouTube.com. That is the second largest search engine in the world. Which just happens to be owned by Google. So they’ve kind of got things wrapped up, just from the search engine perspective. So the question Martin was asking is do my videos have a chance of showing up inside Google.com search. And the answer is yes.
For many years they’ve had a thing called Universal Search, where they deliver search results not just from webpages, but also from YouTube, and from news sites and from shopping areas. And just all kinds of different things which they call Universal Search. That they bring in the universal results of the web. And they’ve started mixing them up.
So you have pictures, you have videos, you have text. All that gets mushed together near the beginning of the first page. So your goal would be to get your video not only to show up inside YouTube, which is a great place for it to show, but also inside Google.com.
Martin: Ok. Fantastic, Ronnie. Which leads me on to – so when you are creating videos, or when you are working with clients who want videos, do you use any tools to try and find out if there is an audience searching for those particular keywords prior to you creating that video?
Ronnie: Right. Without going into a whole lesson on video or search engine optimization, let’s say yes. There’s the most common tool I use is – is a free one from Google – which is the Keyword AdWord Tool. And it allows us now to jump over into another thing, which is brand new – just came out maybe a week ago – called Trends.
And it’s not that trends is new. But the fact that data from YouTube is coming into the trends tool is very new. And it’s phenomenal because trends allows you to see the trend of a keyword as whether it’s gaining momentum or its losing momentum.
And you can get not only results from people searching within Google.com, but you can also filter it to just show you the results of people searching within YouTube.com.
Martin: Fantastic. I mean all of these will be added to the list, when you click the annotation. If you want a point, Ronnie, whichever way it is. It’s up there somewhere. It’s up there. I’ll add it all together. And I’ll just explain.
Because I use Google Keyword Tool a lot. What it allows you to do is to see how many people are searching for a specific keyword, or key phrase over a period of time (which is a month) on a local or on a global basis. And that will tell you. Give you a number. And you can then decide is there already a market, a bunch of people who are typing that into a search engine. That’s right, Ronnie?
Ronnie: Right. And we want to, like I’ve mentioned before, you want to do that search first. Decide how’s the proper way to say these 6 words or 5 words in a row, so that when you are doing your video it’s matching the same order that people are normally typing.
Martin: Absolutely, yes.
Ronnie: Yes. Because I’m an SEO guy, I’m ready to tell you all kinds of other things but I can’t. So move on.
Martin: That’s all right. But we are getting a lot here. It’s just great, Ronnie. So thank you. The next thing I want to have a look at is Analytics, or analysis or the YouTube videos themselves, because the tools in YouTube are – they are getting better and better all of the time. So I wondered do you have an approach? What do you look for? What’s important to you when you are analyzing?
Ronnie: Certainly. In the past the number of views was the most important thing, meaning did I get a lot of views on this video versus that video. And it’s still an important factor.
However, they’ve changed the way that they rank or pay attention – they meaning the search engines – don’t pay as much attention to just the number of views anymore. But they are more interested in how long did people spend watching a video because there’s too many people gaming the system. So as a result they’ve focused more on attention. How long have you paid attention to this video?
So they’ve also added the tool for us called YouTube Analytics, and it’s part of your toolbox within the YouTube place. And you click to go there. And you can see how long people are paying attention to your video. So that’s a very, very important factor. It’s called the engagement type factor.
You can also see which countries are viewing my video for longer than others. Or you know which ones are watching it more, so that you can know if you need to start targeting a specific country, or portion of the world. You can also see the demographics, meaning how old are the people that are watching the video. Are you hitting the right target market? And you can adjust your content, then go back and look at it.
And just so you know, your video needs at least 300 views before these things really kick in. So if you have a brand new video and it’s been up a day, and it’s only got 20 views or something, then give it time.
You’ve got to wait until there’s enough time and views added to that video before they are going to start measuring and show you the data on that. But you can go back and look at periods of time and say, you know, over this period of time I made a change, with a different kind of videos. And it gives you a total, you know, sort of a – what’s the right word. I’m losing it – the cumulative effect of your entire channel for that month.
So you can see whether you are going – you are getting better or worse as far as all these different metrics that you are looking at. All within YouTube Analytics area.
Martin: And if you’ve got a lot of views, and you’ve got the monetization on, you can see how much each video has earned you. And how much of that comes to you cumulatively as well in the same dashboard.
Ronnie: That is correct.
Martin: Let’s say that you are a business and that you are not getting many views. I mean have you used Google AdWords integration with YouTube videos?
Ronnie: Yes. And so this is another way to help bolster the view count, is by turning on Ads that you – it gets tricky. It’s a little bit. Because when you make your own video, and you allow others to monetize with it, then you get paid. But if you can make your videos as an ad for someone else’s’ video. So you can upload your own video as an advertisement that others might use.
And so it’s a bit of a struggle to understand quickly in the 2, 3 minutes we’ve got left to try to talk about that. But there are ways you can pay to have your video used as an ad, but you can also pay to have your video show up higher in the area where they put in the sponsored videos. So I think that was probably what you were alluding to.
Martin: That’s perfect. So let’s just differentiate the 2. So with Google AdSense, you are essentially allowing people to put Ads (if you switch it on) onto your content. You are a publisher and you get paid for that.
If you use Google AdWords, you are looking to pay per click of – or potentially, yes. Let’s go for paid per click – of a video. Because actually pay per view as well with. But you are paying for the right of your video appearing alongside within other peoples’ videos.
Ronnie: Right. No, but I mean one of the things that’s important to realize – and I know we are running out of time – but if we put an ad against our video, you know you check the box, said I’d like my video to be monetized. It will automatically show up higher because it’s to YouTube’s benefit to let your video be chosen over someone else’s whose is not monetized. Because when they click to watch your video, they don’t see your video right away. They might see that Ford or Chevvy truck commercial first.
And then it goes to your video. So they are going to promote your stuff, even without you paying at first. And then if you really need a bigger boost, you can pay and say I want better placement in the YouTube page so that my video shows up higher.
And then you don’t have to have someone else’s Ad against yours. You are just paying to let yours be promoted higher up, so that people are more likely to click on it.
Martin: Absolutely. And as we are reaching the end. I mean if you want to know more on that – myself and Ronnie do that work with people. There is a lot to this area. But we’ve mentioned it, Ronnie, and we’ve done incredibly well. Look at that. We’re at 58 minutes.
The last couple of minutes I’d like you to let people know how they can contact you. What sort of things you do for people.
Ronnie: Sure. I am, you know, The Hangout Helper. So if you go to TheHangoutHelper.com – normally on my video I’d click a link there, but anyways. There it is. TheHangoutHelper.com. I help people learn how to use the Hangout Tool and then magically it turns into video work after the fact, because when people are starting to use the Hangout Tool they eventually do a good job with it.
They make Hangout on their videos. Now we want to figure out what we do those videos, and Martin, if I’ve got 1 second let me give you the biggest tip of this entire thing. If you are using Hangouts and YouTube. Here it is. Are you ready for the golden nugget to end?
Martin: Yes. It’s just perfect for people if they’ve watched it all the way through.
Ronnie: Yes.
Martin: Great.
Ronnie: Here’s the golden nugget. When you are inside of a Hangout, sometimes people say things that are brilliant. Sometimes. Not all of the time. But sometimes. When that’s the case, if you are the host. Here’s a phenomenal tip.
Please ask that person would you say that again? And you summarize it. And they say what they just did, what might have taken 15 minutes to get to them to say, now they can say it in 2 minutes or less.
Now you have a snippet of knowledge that is phenomenal, and you can take that from your entire long HOA (Hangout On Air) and copy it, or trim it down with your video editing program, and then send that out there as a teaser to the entire Hangout On Air, and say look at the good stuff we just covered. And they can watch a 2 minute video and not get all freaked out by the fact that they have to watch an hour long video to get the data. So it’s a great way to summarize what we are doing, put it into a short video, and then that’ll help you promote your long video later.
Martin: So that’s a great tip. I’m going to ask you to plug yourself again, because I just want to add an extra bit on. So for those that don’t know, within YouTube if you’ve got a Hangout or any video content that you own, you can click on Infer in settings, scroll down, and it will got to download MP4, which allows you to take it and you can then edit that video as you’d like in your own editing software. And that’s where you can just take that 2 minutes. So it’s really good – that’s great tip, Ronnie. So thank you. So give us your website. Give us your YouTube details, your Google+ details.
Ronnie: Yes, if you look for Ronnie Bincer – the name right here on Google+ you will find me. Or just search it on Google, you’ll find me.
You can also do that search inside YouTube, however the name of the YouTube channel is different. It’s Video Leads Online. But you can just search for my name and you’ll probably find it.
The other ones if you are looking at it for any help from me, one on one, or with your group, you can go to TheHangoutHelper.Com, and you’ll find all the good stuff that you need to do.
Martin: There you go. Fantastic. Ronnie, that has been an awesome hour. Thank you for your time. Thanks to everybody in the room. Hopefully, I’m going to get a transcript done now, Ronnie, because it was so good.
Ronnie: Great. Thanks for the opportunity, Martin.
Martin: Thanks everybody. And thanks a lot for watching.
FS: Thanks, yes.
Ronnie: All right.
Martin: I hope you enjoyed that as much as we did. Take care. Bye.
[end of transcript]
Share This
|
{
"url": "https://martinshervington.com/complete-user-guide-to-your-youtube-channel/",
"source_domain": "martinshervington.com",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "168748",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BMY3CHG3EPZQ46MEP4KK2EOMVSGPQ6I5",
"WARC-Concurrent-To": "<urn:uuid:ea501c23-433e-4782-b2b0-8c75c91958af>",
"WARC-Date": "2018-12-17T17:31:42Z",
"WARC-IP-Address": "167.99.163.141",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5EBRKAWYAY6J6AP4ADN7RMDOMVCQRFZB",
"WARC-Record-ID": "<urn:uuid:e64955a1-2d78-4b77-bf67-3ba6fb0c86c7>",
"WARC-Target-URI": "https://martinshervington.com/complete-user-guide-to-your-youtube-channel/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aa26dbc5-14b6-4665-a9fa-fb6ceac1f110>"
},
"warc_info": "isPartOf: CC-MAIN-2018-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-152-235-249.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
141,
142,
533,
534,
560,
561,
606,
607,
858,
859,
1432,
1433,
1478,
1479,
1650,
1651,
1679,
1680,
1727,
1728,
1929,
1930,
2021,
2022,
2089,
2134,
2135,
2220,
2317,
2493,
2537,
2538,
2602,
2603,
2875,
2945,
2946,
3044,
3045,
3099,
3100,
3144,
3145,
3194,
3195,
3243,
3244,
3337,
3338,
3402,
3403,
3443,
3444,
3587,
3588,
3632,
3688,
3689,
4079,
4080,
4096,
4097,
4136,
4137,
4219,
4220,
4258,
4432,
4433,
4475,
4476,
4746,
4844,
4845,
4908,
4909,
5142,
5225,
5226,
5336,
5424,
5557,
5558,
6000,
6001,
6193,
6194,
6198,
6199,
6424,
6425,
6448,
6449,
6451,
6452,
6491,
6492,
6610,
6611,
6699,
6700,
6805,
6806,
6892,
6893,
7175,
7176,
7259,
7260,
7353,
7392,
7393,
7395,
7396,
7424,
7425,
7510,
7511,
7528,
7529,
7531,
7532,
7597,
7598,
7628,
7629,
7697,
7698,
7757,
7758,
7800,
7801,
7868,
7869,
8158,
8159,
8192,
8193,
8371,
8372,
8431,
8432,
8491,
8492,
8542,
8543,
8611,
8612,
8642,
8643,
8723,
8724,
8745,
8746,
8809,
8810,
8844,
8845,
8873,
8874,
8893,
8894,
8906,
8907,
9237,
9238,
9367,
9368,
9689,
9690,
9810,
9811,
10058,
10059,
10472,
10473,
10943,
10944,
11345,
11346,
11565,
11566,
11826,
11827,
12132,
12133,
12463,
12464,
12767,
12768,
13180,
13181,
13675,
13676,
13775,
13776,
14172,
14173,
14383,
14384,
14610,
14611,
14756,
14757,
15192,
15193,
15590,
15591,
15745,
15746,
15997,
15998,
16269,
16270,
16294,
16295,
16347,
16348,
16361,
16362,
16496,
16497,
16710,
16711,
17052,
17053,
17324,
17325,
17715,
17716,
18084,
18085,
18479,
18480,
18773,
18774,
19085,
19086,
19305,
19306,
19491,
19492,
19760,
19761,
19884,
19885,
20035,
20036,
20051,
20052,
20264,
20265,
20279,
20280,
20376,
20377,
20689,
20690,
20996,
20997,
21249,
21250,
21538,
21539,
21997,
21998,
22275,
22276,
22381,
22382,
22467,
22468,
22653,
22654,
23040,
23041,
23262,
23263,
23566,
23567,
23888,
23889,
24162,
24163,
24462,
24463,
24935,
24936,
25130,
25131,
25444,
25445,
25719,
25720,
25744,
25745,
25776,
25777,
25806,
25807,
25899,
25900,
26087,
26088,
26101,
26102,
26280,
26281,
26306,
26307,
26630,
26631,
26964,
26965,
27301,
27302,
27407,
27408,
27759,
27760,
28070,
28071,
28259,
28260,
28273,
28274,
28407,
28408,
28913,
28914,
29298,
29299,
29600,
29601,
29886,
29887,
30313,
30314,
30443,
30444,
30699,
30700,
31184,
31185,
31520,
31521,
31630,
31631,
31914,
31915,
32125,
32126,
32389,
32390,
32603,
32604,
32856,
32857,
33253,
33254,
33285,
33286,
33856,
33857,
34375,
34376,
34488,
34489,
34541,
34542,
34604,
34605,
34630,
34631,
34803,
34804,
34886,
34887,
34910,
34911,
34947,
34948,
35191,
35192,
35501,
35502,
35785,
35786,
36047,
36048,
36418,
36419,
36647,
36648,
36874,
36875,
37317,
37318,
37754,
37755,
38157,
38158,
38496,
38497,
38804,
38805,
38934,
38935,
39041,
39042,
39075,
39076,
39424,
39425,
39712,
39713,
39972,
39973,
40406,
40407,
40710,
40711,
41263,
41264,
41439,
41440,
41462,
41463,
41543,
41544,
41556,
41557,
41883,
41884,
41914,
41915,
42350,
42351,
42412,
42413,
43001,
43002,
43287,
43288,
43654,
43655,
43831,
43832,
44292,
44293,
44601,
44602,
44617,
44618,
44641,
44642,
44665,
44666,
44688,
44689,
44880,
44881,
44894,
44895,
45277,
45278,
45707,
45708,
45721,
45722,
46089,
46090,
46443,
46444,
46519,
46520,
46532,
46533,
46638,
46639,
46656,
46657,
46673,
46674,
46957,
46958,
47263,
47264,
47390,
47391,
47484,
47485,
47527,
47528,
47747,
47748,
48070,
48071,
48347,
48348,
48580,
48581,
48903,
48904,
48962,
48963,
48991,
48992,
49490,
49491,
49943,
49944,
50219,
50220,
50441,
50442,
50657,
50658,
50875,
50876,
51258,
51259,
51495,
51496,
51724,
51725,
51882,
51883,
52055,
52056,
52273,
52274,
52459,
52460,
52614,
52615,
53076,
53077,
53550,
53551,
53677,
53678,
53944,
53945,
54161,
54162,
54291,
54292,
54381,
54382,
54768,
54769,
55029,
55030,
55078,
55079,
55105,
55106,
55358,
55359,
55549,
55550,
55927,
55928,
56187,
56188,
56387,
56388,
56403,
56404,
56761,
56762,
56775,
56776,
57091,
57092,
57402,
57403,
57541,
57542,
57948,
57949,
58139,
58140,
58345,
58346,
58638,
58639,
58652,
58653,
58914,
58915,
58972,
58973,
59148,
59149,
59164,
59165,
59241,
59242,
59400,
59401,
59679,
59680,
59990,
59991,
60088,
60089,
60468,
60469,
60817,
60818,
61083,
61084,
61364,
61365,
61694,
61695,
61941,
61942,
62112,
62113,
62349,
62350,
62744,
62745,
63008,
63009,
63034,
63035,
63145,
63146,
63538,
63539,
63722,
63723,
64113,
64114,
64410,
64411,
64829,
64830,
65041,
65042,
65479,
65480,
65649,
65650,
65854,
65855,
65880,
65881,
66033,
66034,
66416,
66417,
66761,
66762,
66980,
66981,
67250,
67251,
67761,
67762,
68011,
68012,
68180,
68181,
68447,
68448,
68572,
68573,
68959,
68960,
69228,
69229,
69315,
69316,
69329,
69330,
69345,
69346,
69577,
69578,
69780,
69781,
70355,
70356,
70958,
70959,
71098,
71099,
71287,
71288,
71474,
71475,
71688,
71689,
71740,
71741,
71798,
71799,
71816,
71817,
71836,
71837,
71904,
71905,
71926,
71927,
71929,
71930,
71932,
71933,
71935,
71936,
71938,
71939,
71941,
71942,
71944,
71945,
71947,
71948,
71950,
71951,
71953,
71954,
71956,
71957,
71959,
71960,
71962,
71963,
71965,
71966,
71968,
71969,
71971,
71972,
71974,
71975
],
"line_end_idx": [
141,
142,
533,
534,
560,
561,
606,
607,
858,
859,
1432,
1433,
1478,
1479,
1650,
1651,
1679,
1680,
1727,
1728,
1929,
1930,
2021,
2022,
2089,
2134,
2135,
2220,
2317,
2493,
2537,
2538,
2602,
2603,
2875,
2945,
2946,
3044,
3045,
3099,
3100,
3144,
3145,
3194,
3195,
3243,
3244,
3337,
3338,
3402,
3403,
3443,
3444,
3587,
3588,
3632,
3688,
3689,
4079,
4080,
4096,
4097,
4136,
4137,
4219,
4220,
4258,
4432,
4433,
4475,
4476,
4746,
4844,
4845,
4908,
4909,
5142,
5225,
5226,
5336,
5424,
5557,
5558,
6000,
6001,
6193,
6194,
6198,
6199,
6424,
6425,
6448,
6449,
6451,
6452,
6491,
6492,
6610,
6611,
6699,
6700,
6805,
6806,
6892,
6893,
7175,
7176,
7259,
7260,
7353,
7392,
7393,
7395,
7396,
7424,
7425,
7510,
7511,
7528,
7529,
7531,
7532,
7597,
7598,
7628,
7629,
7697,
7698,
7757,
7758,
7800,
7801,
7868,
7869,
8158,
8159,
8192,
8193,
8371,
8372,
8431,
8432,
8491,
8492,
8542,
8543,
8611,
8612,
8642,
8643,
8723,
8724,
8745,
8746,
8809,
8810,
8844,
8845,
8873,
8874,
8893,
8894,
8906,
8907,
9237,
9238,
9367,
9368,
9689,
9690,
9810,
9811,
10058,
10059,
10472,
10473,
10943,
10944,
11345,
11346,
11565,
11566,
11826,
11827,
12132,
12133,
12463,
12464,
12767,
12768,
13180,
13181,
13675,
13676,
13775,
13776,
14172,
14173,
14383,
14384,
14610,
14611,
14756,
14757,
15192,
15193,
15590,
15591,
15745,
15746,
15997,
15998,
16269,
16270,
16294,
16295,
16347,
16348,
16361,
16362,
16496,
16497,
16710,
16711,
17052,
17053,
17324,
17325,
17715,
17716,
18084,
18085,
18479,
18480,
18773,
18774,
19085,
19086,
19305,
19306,
19491,
19492,
19760,
19761,
19884,
19885,
20035,
20036,
20051,
20052,
20264,
20265,
20279,
20280,
20376,
20377,
20689,
20690,
20996,
20997,
21249,
21250,
21538,
21539,
21997,
21998,
22275,
22276,
22381,
22382,
22467,
22468,
22653,
22654,
23040,
23041,
23262,
23263,
23566,
23567,
23888,
23889,
24162,
24163,
24462,
24463,
24935,
24936,
25130,
25131,
25444,
25445,
25719,
25720,
25744,
25745,
25776,
25777,
25806,
25807,
25899,
25900,
26087,
26088,
26101,
26102,
26280,
26281,
26306,
26307,
26630,
26631,
26964,
26965,
27301,
27302,
27407,
27408,
27759,
27760,
28070,
28071,
28259,
28260,
28273,
28274,
28407,
28408,
28913,
28914,
29298,
29299,
29600,
29601,
29886,
29887,
30313,
30314,
30443,
30444,
30699,
30700,
31184,
31185,
31520,
31521,
31630,
31631,
31914,
31915,
32125,
32126,
32389,
32390,
32603,
32604,
32856,
32857,
33253,
33254,
33285,
33286,
33856,
33857,
34375,
34376,
34488,
34489,
34541,
34542,
34604,
34605,
34630,
34631,
34803,
34804,
34886,
34887,
34910,
34911,
34947,
34948,
35191,
35192,
35501,
35502,
35785,
35786,
36047,
36048,
36418,
36419,
36647,
36648,
36874,
36875,
37317,
37318,
37754,
37755,
38157,
38158,
38496,
38497,
38804,
38805,
38934,
38935,
39041,
39042,
39075,
39076,
39424,
39425,
39712,
39713,
39972,
39973,
40406,
40407,
40710,
40711,
41263,
41264,
41439,
41440,
41462,
41463,
41543,
41544,
41556,
41557,
41883,
41884,
41914,
41915,
42350,
42351,
42412,
42413,
43001,
43002,
43287,
43288,
43654,
43655,
43831,
43832,
44292,
44293,
44601,
44602,
44617,
44618,
44641,
44642,
44665,
44666,
44688,
44689,
44880,
44881,
44894,
44895,
45277,
45278,
45707,
45708,
45721,
45722,
46089,
46090,
46443,
46444,
46519,
46520,
46532,
46533,
46638,
46639,
46656,
46657,
46673,
46674,
46957,
46958,
47263,
47264,
47390,
47391,
47484,
47485,
47527,
47528,
47747,
47748,
48070,
48071,
48347,
48348,
48580,
48581,
48903,
48904,
48962,
48963,
48991,
48992,
49490,
49491,
49943,
49944,
50219,
50220,
50441,
50442,
50657,
50658,
50875,
50876,
51258,
51259,
51495,
51496,
51724,
51725,
51882,
51883,
52055,
52056,
52273,
52274,
52459,
52460,
52614,
52615,
53076,
53077,
53550,
53551,
53677,
53678,
53944,
53945,
54161,
54162,
54291,
54292,
54381,
54382,
54768,
54769,
55029,
55030,
55078,
55079,
55105,
55106,
55358,
55359,
55549,
55550,
55927,
55928,
56187,
56188,
56387,
56388,
56403,
56404,
56761,
56762,
56775,
56776,
57091,
57092,
57402,
57403,
57541,
57542,
57948,
57949,
58139,
58140,
58345,
58346,
58638,
58639,
58652,
58653,
58914,
58915,
58972,
58973,
59148,
59149,
59164,
59165,
59241,
59242,
59400,
59401,
59679,
59680,
59990,
59991,
60088,
60089,
60468,
60469,
60817,
60818,
61083,
61084,
61364,
61365,
61694,
61695,
61941,
61942,
62112,
62113,
62349,
62350,
62744,
62745,
63008,
63009,
63034,
63035,
63145,
63146,
63538,
63539,
63722,
63723,
64113,
64114,
64410,
64411,
64829,
64830,
65041,
65042,
65479,
65480,
65649,
65650,
65854,
65855,
65880,
65881,
66033,
66034,
66416,
66417,
66761,
66762,
66980,
66981,
67250,
67251,
67761,
67762,
68011,
68012,
68180,
68181,
68447,
68448,
68572,
68573,
68959,
68960,
69228,
69229,
69315,
69316,
69329,
69330,
69345,
69346,
69577,
69578,
69780,
69781,
70355,
70356,
70958,
70959,
71098,
71099,
71287,
71288,
71474,
71475,
71688,
71689,
71740,
71741,
71798,
71799,
71816,
71817,
71836,
71837,
71904,
71905,
71926,
71927,
71929,
71930,
71932,
71933,
71935,
71936,
71938,
71939,
71941,
71942,
71944,
71945,
71947,
71948,
71950,
71951,
71953,
71954,
71956,
71957,
71959,
71960,
71962,
71963,
71965,
71966,
71968,
71969,
71971,
71972,
71974,
71975,
71985
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 71985,
"ccnet_original_nlines": 742,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5034058690071106,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019470730796456337,
"rps_doc_frac_lines_end_with_ellipsis": 0.006729479879140854,
"rps_doc_frac_no_alph_words": 0.16842485964298248,
"rps_doc_frac_unique_words": 0.11027011275291443,
"rps_doc_mean_word_length": 4.15323543548584,
"rps_doc_num_sentences": 1124,
"rps_doc_symbol_to_word_ratio": 0.00030139999580569565,
"rps_doc_unigram_entropy": 5.716882705688477,
"rps_doc_word_count": 13476,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.041094180196523666,
"rps_doc_frac_chars_dupe_6grams": 0.015329910442233086,
"rps_doc_frac_chars_dupe_7grams": 0.009326590225100517,
"rps_doc_frac_chars_dupe_8grams": 0.00225124997086823,
"rps_doc_frac_chars_dupe_9grams": 0.00225124997086823,
"rps_doc_frac_chars_top_2gram": 0.008040170185267925,
"rps_doc_frac_chars_top_3gram": 0.003930749837309122,
"rps_doc_frac_chars_top_4gram": 0.002787260105833411,
"rps_doc_books_importance": -6863.3662109375,
"rps_doc_books_importance_length_correction": -6863.3662109375,
"rps_doc_openwebtext_importance": -3260.4326171875,
"rps_doc_openwebtext_importance_length_correction": -3260.4326171875,
"rps_doc_wikipedia_importance": -2455.957763671875,
"rps_doc_wikipedia_importance_length_correction": -2455.957763671875
},
"fasttext": {
"dclm": 0.023703809827566147,
"english": 0.9544796347618103,
"fineweb_edu_approx": 1.3403400182724,
"eai_general_math": 0.21231365203857422,
"eai_open_web_math": 0.3098074793815613,
"eai_web_code": 0.08089060336351395
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
3,635,196,857,586,473,000 |
Synchronet now requires the libarchive development package (e.g. libarchive-dev on Debian-based Linux distros, libarchive.org for more info) to build successfully.
• Rob Swindell's avatar
DIZ enhancements: Read/use SAUCE data, support ANSI, increase max 1->4K · 2a8e1c11
Rob Swindell authored
Inspired by Blocktronics (and other ANSI art group) packs' FILE_ID.DIZ/ANS files:
* Support (and prioritize) FILE_ID.ANS
* Convert ANSI color/attribute sequences in DIZ files to Ctrl-A equivalent (uses SAUCE width and ICE color, if specified)
* Don't treat DIZ as a series of lines, they're not always nowadays.
* New putmsg() mode: P_INDENT to print files indented by current column
* Display full (up to 64-char) filenames in lists when using 132+ column terminal.
* Use the Author, Group, and Title fields from the SAUCE if present/non-blank
* 2 new text.dat strings: 301 (FiAuthor) and 302 (FiGroup)
* Also fix bug with repeated Cost header field on bulk-uploaded files.
I know this'll break the *nix build (sauce.c dependency), but I'll fix that next.
2a8e1c11
addfiles.vcxproj 12.1 KB
|
{
"url": "https://gitlab.synchro.net/main/sbbs/-/blob/7dc1bc798e5a06e2278711ea7f3def8f23347381/src/sbbs3/addfiles.vcxproj",
"source_domain": "gitlab.synchro.net",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "82095",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UEC2AFTEPPEMIHFUWNMXQ76YXQNMV5WU",
"WARC-Concurrent-To": "<urn:uuid:ad705c18-fa4c-416c-8d97-6dc2409b58a9>",
"WARC-Date": "2021-12-03T16:04:20Z",
"WARC-IP-Address": "71.95.196.37",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HHUUMDBRCQTP6OLLTAPO47OP7ESOUOHF",
"WARC-Record-ID": "<urn:uuid:8bc34519-6272-4970-a046-2d9ed69c74a3>",
"WARC-Target-URI": "https://gitlab.synchro.net/main/sbbs/-/blob/7dc1bc798e5a06e2278711ea7f3def8f23347381/src/sbbs3/addfiles.vcxproj",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8ad3e655-9602-4b1b-abd2-b7390012a046>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-171\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,
164,
165,
191,
278,
304,
390,
433,
559,
632,
708,
795,
877,
940,
1015,
1020,
1106,
1119
],
"line_end_idx": [
164,
165,
191,
278,
304,
390,
433,
559,
632,
708,
795,
877,
940,
1015,
1020,
1106,
1119,
1143
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1143,
"ccnet_original_nlines": 17,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20717130601406097,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08366534113883972,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3147410452365875,
"rps_doc_frac_unique_words": 0.8037974834442139,
"rps_doc_mean_word_length": 5.335443019866943,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.7385077476501465,
"rps_doc_word_count": 158,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -111.20279693603516,
"rps_doc_books_importance_length_correction": -111.20279693603516,
"rps_doc_openwebtext_importance": -73.95679473876953,
"rps_doc_openwebtext_importance_length_correction": -70.19454193115234,
"rps_doc_wikipedia_importance": -66.27761840820312,
"rps_doc_wikipedia_importance_length_correction": -66.27761840820312
},
"fasttext": {
"dclm": 0.10033810138702393,
"english": 0.7543966770172119,
"fineweb_edu_approx": 1.1241759061813354,
"eai_general_math": 0.13254064321517944,
"eai_open_web_math": 0.5794965624809265,
"eai_web_code": 0.5113102197647095
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
7,399,702,691,919,091,000 |
📝Use Cases
DCI's decentralized infrastructure unlocks a vast array of possibilities across diverse industries, empowering users to take control and ownership of their projects. Here we explore several compelling use cases that showcase the versatility and transformative potential of the DCI platform:
1. Secure and Reliable Web Development
• Decentralized Applications (dApps): DCI provides a secure and reliable foundation for deploying and managing dApps, fostering innovation in the blockchain space.
• Front-End Development: Developers can utilize DCI to host static websites and front-end components, ensuring data security and control over project deployment.
• Content Delivery Networks (CDNs): Leverage DCI's decentralized network to establish secure and distributed CDNs, improving website performance and user experience.
2. Secure and Scalable Data Storage
• Decentralized File Storage: Store sensitive data securely with complete ownership and control, eliminating reliance on centralized storage providers.
• Data Backups: Establish secure and reliable backups for critical data assets, ensuring data integrity and accessibility in case of unforeseen events.
• Cloud Storage Alternative: DCI offers a decentralized alternative to traditional cloud storage solutions, providing enhanced security and user control over data.
3. High-Performance Computing
• Machine Learning and AI Development: Train and deploy machine learning models on DCI's network, leveraging the platform's distributed computing power for faster and more efficient processing.
• Scientific Simulations: Conduct complex scientific simulations and calculations on the DCI platform, benefiting from its scalability and distributed processing capabilities.
• GPU-Intensive Applications: Run graphics rendering, video editing, and other computationally intensive tasks with ease, utilizing the platform's decentralized GPU resources.
4. Secure and Private Communication
• Decentralized Messaging Applications: Build and deploy secure and private messaging applications on the DCI network, fostering secure communication without relying on centralized servers.
• VPN Services: Establish secure and private connections through a decentralized VPN network, protecting user privacy and internet traffic.
• Secure File Sharing: Share sensitive files and data securely with complete control over access and permissions, leveraging the platform's decentralized infrastructure.
5. Decentralized Finance (DeFi) Applications
• DeFi Protocols: Deploy and manage DeFi protocols on the DCI platform, benefiting from its secure and transparent environment for financial applications.
• Cryptocurrency Wallets: Store and manage cryptocurrencies securely with self-custody, eliminating the risks associated with centralized exchanges and wallets.
• Decentralized Marketplaces: Build and deploy decentralized marketplaces for various assets and services, fostering trust and transparency within the DeFi ecosystem.
These are just a few examples of the diverse use cases that DCI empowers. With its commitment to decentralization, security, and user control, the platform opens doors for innovation and empowers individuals and organizations to shape the future of the digital world on their own terms.
Last updated
|
{
"url": "https://docs-gitbook.dcicloud.ai/use-cases",
"source_domain": "docs-gitbook.dcicloud.ai",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "159157",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EL4X4KFDAGOMDY3SFRR35SDTJG34D2BM",
"WARC-Concurrent-To": "<urn:uuid:f6650dc7-204a-41f9-9739-9016d5c53e38>",
"WARC-Date": "2024-06-18T02:28:33Z",
"WARC-IP-Address": "172.64.147.209",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PBQROEK2VFIKJXNYBFBEI7HQWU7DNTTM",
"WARC-Record-ID": "<urn:uuid:f97fe2a8-6c48-4ea5-bd0e-8e44f095cd9d>",
"WARC-Target-URI": "https://docs-gitbook.dcicloud.ai/use-cases",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:669ec637-f8a5-4eb0-b801-b51af7516c41>"
},
"warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-161\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
11,
12,
303,
304,
343,
344,
510,
511,
675,
676,
844,
845,
881,
882,
1036,
1037,
1191,
1192,
1358,
1359,
1389,
1390,
1586,
1587,
1765,
1766,
1944,
1945,
1981,
1982,
2174,
2175,
2317,
2318,
2490,
2491,
2536,
2537,
2694,
2695,
2858,
2859,
3028,
3029,
3316,
3317
],
"line_end_idx": [
11,
12,
303,
304,
343,
344,
510,
511,
675,
676,
844,
845,
881,
882,
1036,
1037,
1191,
1192,
1358,
1359,
1389,
1390,
1586,
1587,
1765,
1766,
1944,
1945,
1981,
1982,
2174,
2175,
2317,
2318,
2490,
2491,
2536,
2537,
2694,
2695,
2858,
2859,
3028,
3029,
3316,
3317,
3329
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3329,
"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.24144487082958221,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03041825070977211,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18250951170921326,
"rps_doc_frac_unique_words": 0.4851936101913452,
"rps_doc_mean_word_length": 6.2892937660217285,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.882105827331543,
"rps_doc_word_count": 439,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.023904379457235336,
"rps_doc_frac_chars_dupe_6grams": 0.023904379457235336,
"rps_doc_frac_chars_dupe_7grams": 0.023904379457235336,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0293371994048357,
"rps_doc_frac_chars_top_3gram": 0.015211880207061768,
"rps_doc_frac_chars_top_4gram": 0.017385009676218033,
"rps_doc_books_importance": -192.61453247070312,
"rps_doc_books_importance_length_correction": -192.61453247070312,
"rps_doc_openwebtext_importance": -77.3431396484375,
"rps_doc_openwebtext_importance_length_correction": -77.3431396484375,
"rps_doc_wikipedia_importance": -88.31713104248047,
"rps_doc_wikipedia_importance_length_correction": -88.31713104248047
},
"fasttext": {
"dclm": 0.036824170500040054,
"english": 0.8598485589027405,
"fineweb_edu_approx": 1.587917447090149,
"eai_general_math": 0.033425990492105484,
"eai_open_web_math": 0.06749463081359863,
"eai_web_code": 0.15063530206680298
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "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": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-7,266,809,349,950,385,000 |
Pirl 2.0 AMA
00 Days
00 Hrs
00 Mins
00 Secs
Expired
Save the date, register, and get your free seat for the next AMA,
the most important move since the Pirl launch 3 years ago.
Pirl 2.0 AMA the 17 October 2020 at 8PM UTC+4
Watch the replay
Crypto For Beginners 5 – Smart Contracts
Share This Post
Share on facebook
Share on linkedin
Share on twitter
Share on email
Smart Contracts
Today as a part of our Crypto for beginners series we would like to introduce to the nontechnical part of our community the basics of Smart Contracts. How do they work? What are the benefits?
With blockchain being a decentralized, immutable open ledger, it can be a platform for transacting many things. The most common or well known utility is as digital currency, like Bitcoin. Another asset that can live on the blockchain include smart contracts, or self-executing contracts. Smart contracts help you exchange anything of value in a transparent way that does not depend on intermediaries. This place smart contracts as a quite impressive tool with unlimited use case possibilities.
How do smart contracts work?
Smart contracts can be thought of as digital contracts. They are converted to computer code, stored and replicated on a network of computers that run and secure the blockchain. Based on the details in the code, a smart contract is automatically executed when criteria are met between both parties by this same network of computers. Just like how code works behind a website, a code in a smart contract is essentially an “if, then” statement meaning: if conditions in the contract are met, then an event detailed in the contract is triggered. Easy to understand real world example: if someone pays X amount to the smart contract, then the smart contract will send that person the desired product.
What are benefits of smart contracts?
1. Trustless and Autonomous
Because no single entity owns or controls the blockchain, smart contracts are able to transact and execute autonomously without a third party. You don’t have to rely on a lawyer, broker, or even the person you are transacting with. All the details are in a smart contract hosted on the blockchain and the code (conditions of the smart contract) can be reviewed by anyone as it is open source. Also the smart contract code can’t be changed afterwards as, once submitted to the blockchain, it is immutable, so everyone can trust that the agreed upon terms are executed no matter what. The person who writes the smart contract code needs to be very sure the code is 100% correct, because once it is on the blockchain, it is there forever!
2. Safety and Backup
Because of the cryptographic properties of blockchain technology a properly coded smart contract is very secure and the assets that it might hold are therefore safe against for example hacking. And once a smart contract is submitted to the blockchain network, it also means that it is distributed to all the computers that form the network and by that automatically backed up.
3. Savings and Speed
With not having to rely on a third-party like a lawyer or broker, you can save on these fees. Because smart contracts auto-execute based on when criteria is met, the transactions are automated and save time.
What are some examples of smart contracts?
1. Business
There are many applications for smart contracts in business to business transactions (B2B), such as supply chain and logistics. Companies can use self-executing smart contracts to pay their suppliers when their goods arrive, for instance.
2. Copyrights
In creative industries, content creators and musicians can fully own rights to content they put out. Using smart contracts, it would allow them to collect royalty fees every time their content is used for commercial purposes. The blockchain would keep track of all ownership rights and ensure content creators are paid in real time.IPFS would allow to store the original copyrighted content into the blockchain and cross validate in case of any dispute.
3. Property?
By using smart contracts to facilitate property ownership and sales, these transactions will always be backed up on the blockchain and can reduce auditing cost, time, and need for third-parties. An example could be the issuance of a car title once the car has been paid off. The smart contract is self-enforced and will auto execute, while all the payments are recorded on the blockchain and are immutable.
4. Escrow
Code is law.
What does it cost? Who pays for it?
Running smart contracts on the blockchain requires computer calculations to be made by the network, just as normal transactions do. Normal (peer-to-peer) transaction fees are paid in the Blockchain’s native currency, in case of PIRL the native currency is PIRL, and the fee for smart contract transactions as well. Smart contract transactions are more complicated, so the fee is usually a bit higher. Just as normal transaction fees the smart contract fees are paid by the user that initiates the transaction to the smart contract for most smart contract enables networks. You may expect those fees to be infinitely smaller than intermediaries would charge for the services that smart contracts replace.
Last words.
As we proceed into a more digitized world, smart contracts will become more prominent and developed. Technology is constantly evolving, and smart contracts are an innovation to help us become a more efficient and transparent society. Their functionality can widely spread into the business sector as well as into online markets and simple user’s everyday use.
Combined with the recently announced implementation of IPFS technology we are looking into a bright future for the platform. Giving the chance to Smart Contract developers also include an immutable file storage and content in the smart contracts game.
Subscribe To Our Newsletter
Get updates and learn from the best
More To Explore
en_USEnglish
fr_FRFrançais nl_NLNederlands tr_TRTürkçe es_ESEspañol pt_PTPortuguês ru_RUРусский ko_KR한국어 zh_CN简体中文 hi_INहिन्दी en_USEnglish
|
{
"url": "https://pirl.io/en/crypto-for-beginners-5-smart-contracts/",
"source_domain": "pirl.io",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "63819",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H6UVRT7SDW5FLRKPNKVYXVO3LYC7YX67",
"WARC-Concurrent-To": "<urn:uuid:a0389c9a-fb13-48d9-86a0-08071f0e8fd8>",
"WARC-Date": "2020-10-21T02:29:44Z",
"WARC-IP-Address": "104.28.13.76",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NDOIW7P4HXMSYRD2XJPHLJUVLKPX3CTL",
"WARC-Record-ID": "<urn:uuid:7a5d657d-12a1-4681-898c-53c82adc8555>",
"WARC-Target-URI": "https://pirl.io/en/crypto-for-beginners-5-smart-contracts/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9cffc7a7-f862-4793-8dee-a37f93d8be9b>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-159.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
13,
21,
28,
36,
44,
52,
118,
177,
223,
240,
241,
282,
283,
299,
300,
318,
336,
353,
368,
369,
385,
386,
579,
580,
1074,
1075,
1104,
1105,
1801,
1803,
1804,
1842,
1843,
1871,
1872,
2608,
2609,
2630,
2631,
3008,
3009,
3030,
3031,
3239,
3240,
3283,
3284,
3297,
3298,
3537,
3538,
3552,
3553,
4007,
4008,
4022,
4023,
4430,
4431,
4441,
4442,
4455,
4456,
4492,
4493,
5197,
5198,
5210,
5211,
5571,
5572,
5824,
5825,
5853,
5854,
5890,
5891,
5907,
5908,
5921
],
"line_end_idx": [
13,
21,
28,
36,
44,
52,
118,
177,
223,
240,
241,
282,
283,
299,
300,
318,
336,
353,
368,
369,
385,
386,
579,
580,
1074,
1075,
1104,
1105,
1801,
1803,
1804,
1842,
1843,
1871,
1872,
2608,
2609,
2630,
2631,
3008,
3009,
3030,
3031,
3239,
3240,
3283,
3284,
3297,
3298,
3537,
3538,
3552,
3553,
4007,
4008,
4022,
4023,
4430,
4431,
4441,
4442,
4455,
4456,
4492,
4493,
5197,
5198,
5210,
5211,
5571,
5572,
5824,
5825,
5853,
5854,
5890,
5891,
5907,
5908,
5921,
6047
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6047,
"ccnet_original_nlines": 80,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4118689000606537,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009743140079081059,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1302037239074707,
"rps_doc_frac_unique_words": 0.41295546293258667,
"rps_doc_mean_word_length": 4.966598987579346,
"rps_doc_num_sentences": 60,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.278764724731445,
"rps_doc_word_count": 988,
"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.05991441011428833,
"rps_doc_frac_chars_top_3gram": 0.026085179299116135,
"rps_doc_frac_chars_top_4gram": 0.009781939908862114,
"rps_doc_books_importance": -457.3772277832031,
"rps_doc_books_importance_length_correction": -457.3772277832031,
"rps_doc_openwebtext_importance": -276.52264404296875,
"rps_doc_openwebtext_importance_length_correction": -276.52264404296875,
"rps_doc_wikipedia_importance": -212.39617919921875,
"rps_doc_wikipedia_importance_length_correction": -212.39617919921875
},
"fasttext": {
"dclm": 0.31913429498672485,
"english": 0.9456782937049866,
"fineweb_edu_approx": 1.9924373626708984,
"eai_general_math": 0.06689708679914474,
"eai_open_web_math": 0.06603938341140747,
"eai_web_code": 0.008019329980015755
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "332.87",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
2,918,563,690,351,744,500 |
C is (partly) a strongly typed language.
Some people claim that C is not a strongly typed language [1], but I claim it is -- it is just that C compilers are generally weak about type-checking. In other words, C allows the programmer to be cavalier about its rules. I like to call C a ‘weakly strongly typed’ language. Others might just call it a statically-typed language. In any case, it is important to keep track of types.
The definition of a strongly typed language is that every variable, function call, and constant has some type chosen at compile time and enforced by the compiler.[2] In languages stricter than C, you would not be able to assign a character to an integer variable, or an integer to a floating-point variable; and you would definitely not be allowed to do many of the things you can do with pointers. Still, C does enforce various type rules, as we shall see.
C’s types are grouped into three major divisions: object types, function types, and incomplete types. (It is tempting to lump incomplete types under the object types, but the C standards separate them.) Object types are essentially those used to declare variables, and function types are those used to declare functions. Incomplete types are just a special case of object types, when some important piece or pieces are missing. An incomplete type can usually be ‘completed’ later, filling in the missing bits, as needed.
These types can be grouped several other ways. I prefer to start with the division into ‘basic’ and ‘derived’ types. The basic types are simply those from a list:
char
signed char
unsigned char
short int
unsigned short int
int
unsigned int
long int
unsigned long int
long long int (new in C99)
unsigned long long int (new in C99)
float
double
long double
float complex (new in C99)
double complex (new in C99)
long double complex (new in C99)
Excluding float, double, long double, and the three complexes, these are called the integral types. The three variants of char are also called the character types. The last six of these are the floating-point types, split into ‘real’ and ‘complex’ floating-point types.
Many of the integral types have shorter names, because the keyword int can be omitted after short or long. (In C89, you can omit it in even more cases, but C99 has pretty much eliminated ‘implicit int’.) The type char (sometimes called ‘plain char’) has exactly the same characteristics -- minimum and maximum values, and sizeof -- as either signed char or unsigned char, at the implemention's discretion. Often int is ‘similarly similar’, as it were, to either short or long. Nonetheless, all of these types are considered distinct, and it is an error to mix them (as with pointers, below) even when the characteristics match. (This is one reason C can be considered ‘strongly typed’.)
As a special case, C has enumerated types, which are ‘compatible with’ some integral type, but are nonetheless distinct types. As another special case, C offers the void type, which is just an incomplete type that can never be completed. There are no actual values of type void, which is something of a self-contradiction. (Think of it as the empty set of values. Since all null sets are identical, it really does not matter what value it has, or does not have.)
These basic types are used to build the derived types. The derived types can sometimes also refer to the incomplete and function types. The derived types are:
Pointers can be confusing, because C's are so unusual and have a strong relationship with C's arrays. We will see much more about this later.
Values
All values are typed. Constants have a type that is determined by their syntax and value. The most obvious are the simple integral and floating-point constants, such as 42 or 3.14159. The constant 42 has type int, and the constant 3.14159 has type double. Very large constants will automatically use a larger type than int if needed, and integral and floating-point constants can be suffixed to give them an alternative type. Hexadecimal and octal constants use slightly different rules than decimal constants. Thus, 2.71828F has type float instead of double, while 0xFFUL has type unsigned long int. (The complete list of rules can be found elsewhere[insert link]).
In a departure from most other similar languages (even including C++), character constants like 'a' have type int.
The set of operations allowed on any value, and the meaning of those operations, are determined entirely by the type of that value. (This is the other main requirement to call C a strongly typed language.) For instance, the precise action of the right-shift operation >> may change depending on whether the value being shifted is signed or unsigned. This is why it is crucial to keep track of the type of each value. If you do not know the type as well as the value, you cannot predict the outcome of the operation.
For this reason, when analyzing any particular expression in C, you should write down both the type and the value of each sub-expression. I like to write them in pairs, enclosed in angle brackets:
42 is an <int, 42>
3.14159F is a <float, 3.14159>
Later we will add a third element to these, so as to distinguish between objects and values.
Conversions
C offers relatively free conversions. These change not only the type but also the value. Often the underlying machine's bit patterns, or even size in bytes, change in the process. Changing 3.14, a double, to an int drops the fractional part. If sizeof(double) is 8 and sizeof(int) is 2 or 4, changing one to the other even changes the number of bytes.
Many of C's conversions will happen automatically. That is, given something like:
int i = 3;
double d = 3.14159;
the assignments i = d; and d = i; are entirely legal, and cause an automatic conversion. Since character constants have type int, even something simple like:
char c = 'A';
contains an automatic conversion. Conversions are thus quite ordinary and frequent (which is one argument some use to say that C is not strongly typed).
A cast is a syntactic construct that forces a conversion. The syntax is a type-name enclosed in parentheses, and the result of a cast is a new value with a new type. The new type is just the type-name inside the parentheses, and usually, the new value is just the value that would result from an automatic conversion. That is:
(double)i
converts the value in i to type double, just as if it had been assigned to d. There are, however, any number of conversions that are at least questionable, if not outright wrong. For instance, converting a value of type ‘pointer to char’ to a new value of type ‘pointer to int’ is not guaranteed to do anything useful. Such conversions will not happen automatically -- if you create a situation in which one would have to happen automatically, the compiler must produce a diagnostic [xref to diagnostics]. The cast is a ‘more powerful’ conversion, in effect telling the compiler: just shut up and do this, even though it is fraught with peril.
This leads to a general rule: Be suspicious of any cast, especially pointer casts. Unfortunately, some C compilers are unnecessarily picky about converting from, e.g., int to short, producing warnings if the programmer does not shut them up with a cast. Equally unfortunately, many C programs contain questionable -- or outright wrong -- pointer conversions, and many C programmers have learned to disable warnings about them by sprinkling casts in liberally. After all, one typical diagnostic is ‘warning: integer to pointer conversion without a cast’, practically begging the programmer to insert a cast blindly, rather than figuring out why the compiler thinks one of the values involved is an integer.
The void * weirdness
Before C89, C did not have any special pointer cases. This led to a problem: there was no ‘generic’ pointer type, yet a function like malloc() had to return a valid pointer without knowing what type it might be. The solution in K&R-1 C was to return a value of type char *, counting on the ability to decompose everything into bytes. Unfortunately, that meant that most uses of malloc() required a cast. ANSI C removed the need for this cast by adding a new generic pointer type. Logically this should be an ‘anyptr’ or some such spelling, but the ANSI committee did not want to add a new keyword. Since the void type is already special -- meaning ‘nothing’ -- they used ‘pointer to void’, or void *, to denote a generic pointer. Instead of ‘pointing to nothing’, this ‘points to anything’.
What makes this particularly weird is that void ** cannot point to just any pointer. The special type void * works as a generic pointer, converting freely to or from any other pointer type, but it is a unique type -- an ‘anyptr’, as it were -- in and of itself. The type void ** can only point to these special pointers. Even though void * can point to any other type (including another void *), void ** can only point to void *.
back
[1] In fact, Kernighan and Ritchie themselves claim, in the original White Book, that ‘C is not a strongly typed language in the sense of Pascal or Algol-68’ (p. 3). However, they use the reasoning that ‘where strong type checking is desirable, a separate version of the compiler is used. This program is called lint ...’. Modern compilers, especially those with C99 features, often produce most or all of the diagnostics that the original lint program did. If lint was a strongly-typed C ‘compiler’, and a modern C compiler does what lint did, then C itself must be strongly typed.
[2] It is worth noting that the term ‘strongly typed’ is not all that well-defined in the first place; different programming texts have different definitions. Many would call this ‘static typing’, to contrast with ‘dynamic typing’ where a variable name acquires a new type based on the most recent assignment to it. The idea here, though, is not to pin down the terminology, but rather to emphasize that C expressions always have types.
|
{
"url": "http://web.torek.net/torek/c/types.html",
"source_domain": "web.torek.net",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "17934",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BH5PKX63BBNITKOBRB6GDW76BVLN6ODJ",
"WARC-Concurrent-To": "<urn:uuid:ddcf52a1-cba8-46a8-9d97-785b6de8a9c8>",
"WARC-Date": "2022-12-10T09:41:53Z",
"WARC-IP-Address": "50.212.202.245",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7KV7255TLKGCBLSX5NTG56HINRO27SUK",
"WARC-Record-ID": "<urn:uuid:e1eae6fc-afcd-46fd-ace6-783ce2c9d335>",
"WARC-Target-URI": "http://web.torek.net/torek/c/types.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5d2dfae3-2f7d-44eb-b57c-9aa7e4624e54>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-182\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
41,
42,
431,
432,
892,
893,
1418,
1419,
1584,
1585,
1590,
1602,
1616,
1626,
1645,
1649,
1662,
1671,
1689,
1716,
1752,
1758,
1765,
1777,
1804,
1832,
1865,
2137,
2138,
2830,
2831,
3298,
3299,
3460,
3461,
3604,
3605,
3612,
3613,
4287,
4288,
4403,
4404,
4923,
4924,
5122,
5123,
5142,
5173,
5266,
5268,
5269,
5281,
5282,
5638,
5639,
5722,
5723,
5734,
5754,
5913,
5927,
6081,
6082,
6412,
6413,
6423,
7071,
7072,
7781,
7782,
7805,
7806,
8604,
8605,
9038,
9039,
9044,
9045,
9046,
9047,
9634
],
"line_end_idx": [
41,
42,
431,
432,
892,
893,
1418,
1419,
1584,
1585,
1590,
1602,
1616,
1626,
1645,
1649,
1662,
1671,
1689,
1716,
1752,
1758,
1765,
1777,
1804,
1832,
1865,
2137,
2138,
2830,
2831,
3298,
3299,
3460,
3461,
3604,
3605,
3612,
3613,
4287,
4288,
4403,
4404,
4923,
4924,
5122,
5123,
5142,
5173,
5266,
5268,
5269,
5281,
5282,
5638,
5639,
5722,
5723,
5734,
5754,
5913,
5927,
6081,
6082,
6412,
6413,
6423,
7071,
7072,
7781,
7782,
7805,
7806,
8604,
8605,
9038,
9039,
9044,
9045,
9046,
9047,
9634,
10072
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10072,
"ccnet_original_nlines": 82,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4175405204296112,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024785509333014488,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1873212605714798,
"rps_doc_frac_unique_words": 0.31290513277053833,
"rps_doc_mean_word_length": 4.646434783935547,
"rps_doc_num_sentences": 101,
"rps_doc_symbol_to_word_ratio": 0.0004766400088556111,
"rps_doc_unigram_entropy": 5.449591636657715,
"rps_doc_word_count": 1697,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.026886489242315292,
"rps_doc_frac_chars_dupe_6grams": 0.011667720042169094,
"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.004565630108118057,
"rps_doc_frac_chars_top_3gram": 0.008877620100975037,
"rps_doc_frac_chars_top_4gram": 0.013950539752840996,
"rps_doc_books_importance": -999.0469360351562,
"rps_doc_books_importance_length_correction": -999.0469360351562,
"rps_doc_openwebtext_importance": -649.543212890625,
"rps_doc_openwebtext_importance_length_correction": -649.543212890625,
"rps_doc_wikipedia_importance": -484.5074768066406,
"rps_doc_wikipedia_importance_length_correction": -484.5074768066406
},
"fasttext": {
"dclm": 0.25024813413619995,
"english": 0.9057571887969971,
"fineweb_edu_approx": 2.918644428253174,
"eai_general_math": 0.9801241755485535,
"eai_open_web_math": 0.38569432497024536,
"eai_web_code": 0.9607927203178406
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-5,001,370,778,976,028,000 |
Un sistema operativo (SO) es un programa o conjunto de programas que en un sistema informático gestiona los recursos de hardware y provee servicios a los programas de aplicación, y corre en modo privilegiado respecto de los restantes.
Uno de los propósitos del sistema operativo que gestiona el núcleo intermediario consiste en gestionar los recursos de localización y protección de acceso del hardware, hecho que alivia a los programadores de aplicaciones de tener que tratar con estos detalles. La mayoría de aparatos electrónicos que utilizan microprocesadores para funcionar, llevan incorporado un sistema operativo. (teléfonos móviles, reproductores de DVD, computadoras, radios, enrutadores, etc). En cuyo caso, son manejados mediante una Interfaz Gráfica de Usuario, un gestor de ventanas o un entorno de escritorio, si es un celular, mediante una consola o control remoto si es un DVD y, mediante una línea de comandos o navegador web si es un enrutador.
Los primeros sistemas (1945-1955) eran grandes máquinas operadas desde la consola maestra por los programadores. Durante la década siguiente (1955-1965) se llevaron a cabo avances en el hardware: lectoras de tarjetas, impresoras, cintas magnéticas, etc. Esto a su vez provocó un avance en el software: compiladores, ensambladores, cargadores, manejadores de dispositivos, etc.
El problema principal de los primeros sistemas era la baja utilización de los mismos, la primera solución fue poner un operador profesional que lo manejase, con lo que se eliminaron las hojas de reserva, se ahorró tiempo y se aumentó la velocidad.
Para ello, los trabajos se agrupaban de forma manual en lotes mediante lo que se conoce como procesamiento por lotes (batch) sin automatizar.
Fichas en lenguaje de procesamiento por lotes, con programa y datos, para ejecución secuencial.
Según fue avanzando la complejidad de los programas, fue necesario implementar soluciones que automatizaran la organización de tareas sin necesidad de un operador. Debido a ello se crearon los monitores residentes: programas que residían en memoria y que gestionaban la ejecución de una cola de trabajos.
Los sistemas operativos que fueron trascendentes en el avance de la computación fueron el OS de Apple y el DOS de IBM, a partir de los cuales se desarrollaron las plataformas para los Windows 1.0 hasta el actual.
Carrito de compras
x
Carro vacío
Selector de moneda
Seleccionar y dar click en "Cambiar Moneda"
Traductor
esenfrde
Artículos de guitarrras de Paracho
Búsqueda por palabra
¿Quién está en línea?
Hay 129 invitados y ningún miembro en línea
Contacto
|
{
"url": "https://www.tiendasvirtualesycomercioweb.com/preguntas-frecuentes/667-ique-es-un-sistema-operativo",
"source_domain": "www.tiendasvirtualesycomercioweb.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "43145",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F6LOA2SWOGTORNBNBFJU3T5PGGQOL62I",
"WARC-Concurrent-To": "<urn:uuid:0057cda6-4955-4ddb-a63d-789fdbbce28c>",
"WARC-Date": "2022-05-24T15:57:24Z",
"WARC-IP-Address": "5.39.11.40",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6VFN32DFVB552MKQ5PCZF43OLEM4KT3V",
"WARC-Record-ID": "<urn:uuid:60e9b937-a0f5-4537-98ce-163fea473077>",
"WARC-Target-URI": "https://www.tiendasvirtualesycomercioweb.com/preguntas-frecuentes/667-ique-es-un-sistema-operativo",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:706943e9-cad7-4257-a832-f7a5fdda67ba>"
},
"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-141\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,
235,
236,
964,
965,
1343,
1344,
1592,
1593,
1735,
1736,
1832,
1833,
2138,
2139,
2141,
2142,
2355,
2356,
2357,
2376,
2377,
2381,
2382,
2394,
2395,
2414,
2415,
2459,
2460,
2470,
2471,
2480,
2481,
2516,
2517,
2538,
2539,
2561,
2562,
2606,
2607
],
"line_end_idx": [
235,
236,
964,
965,
1343,
1344,
1592,
1593,
1735,
1736,
1832,
1833,
2138,
2139,
2141,
2142,
2355,
2356,
2357,
2376,
2377,
2381,
2382,
2394,
2395,
2414,
2415,
2459,
2460,
2470,
2471,
2480,
2481,
2516,
2517,
2538,
2539,
2561,
2562,
2606,
2607,
2615
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2615,
"ccnet_original_nlines": 41,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10064239799976349,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012847970239818096,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1456102728843689,
"rps_doc_frac_unique_words": 0.5483871102333069,
"rps_doc_mean_word_length": 5.359801292419434,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.8720703125,
"rps_doc_word_count": 403,
"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.01388888992369175,
"rps_doc_frac_chars_top_3gram": 0.008333330042660236,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -172.5835418701172,
"rps_doc_books_importance_length_correction": -172.5835418701172,
"rps_doc_openwebtext_importance": -120.48140716552734,
"rps_doc_openwebtext_importance_length_correction": -120.48140716552734,
"rps_doc_wikipedia_importance": -114.54312896728516,
"rps_doc_wikipedia_importance_length_correction": -114.54312896728516
},
"fasttext": {
"dclm": 0.9757905006408691,
"english": 0.0007358400034718215,
"fineweb_edu_approx": 1.3035489320755005,
"eai_general_math": 0.00007819999882485718,
"eai_open_web_math": 0.634668231010437,
"eai_web_code": 0.517336905002594
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.09",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
1,132,910,926,334,304,000 |
Skip to main content
How do I unembed a video in my group?
YouTube video embedding is fun! But, with the proliferation of YouTube videos being posted in groups, some group owners have asked us "What do we do if there are minors in the videos?". Put simply - unembed the video. Links to pictures or videos with non-sexualized images of minors are ok. This leaves the link and the discussion in place, but removes the video from FetLife itself.
All you have to do is add [square brackets] around the link. For example:
http://www.youtube.com/watch........ - puts in an embedded video
[http://www.youtube.com/watch].... - takes out the embedding
JohnDoe
Secret treasure awaits for the chosen one who discovers and decodes this encrypted message: aHR0cHM6Ly9nb28uZ2wvZXY5SDN1
|
{
"url": "https://fetlife.com/help/unembed-video-in-group-discussion",
"source_domain": "fetlife.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "21239",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MIQEUHSLVHIFZ6WTS5EMFUKLZRIILCBS",
"WARC-Concurrent-To": "<urn:uuid:343eb1dd-e82f-4f2b-9ef5-4f3aa5730684>",
"WARC-Date": "2018-06-22T07:24:31Z",
"WARC-IP-Address": "151.101.194.109",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4HBMPEPAPAVRYPQVIK7Q7VV2AHVKP5UX",
"WARC-Record-ID": "<urn:uuid:43e53e1c-f180-4316-8c5a-214bd96519b3>",
"WARC-Target-URI": "https://fetlife.com/help/unembed-video-in-group-discussion",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2c60ab25-c387-4ee0-815e-709ab2c77399>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-167-170-5.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
21,
22,
60,
61,
445,
446,
520,
521,
586,
587,
648,
649,
657,
658
],
"line_end_idx": [
21,
22,
60,
61,
445,
446,
520,
521,
586,
587,
648,
649,
657,
658,
778
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 778,
"ccnet_original_nlines": 14,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36477985978126526,
"rps_doc_ut1_blacklist": 23,
"rps_doc_frac_all_caps_words": 0.006289309822022915,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18867924809455872,
"rps_doc_frac_unique_words": 0.675000011920929,
"rps_doc_mean_word_length": 5.016666889190674,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0.018867919221520424,
"rps_doc_unigram_entropy": 4.202600479125977,
"rps_doc_word_count": 120,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02657807059586048,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -84.92945098876953,
"rps_doc_books_importance_length_correction": -84.92945098876953,
"rps_doc_openwebtext_importance": -50.846195220947266,
"rps_doc_openwebtext_importance_length_correction": -50.846187591552734,
"rps_doc_wikipedia_importance": -37.79170227050781,
"rps_doc_wikipedia_importance_length_correction": -37.79170227050781
},
"fasttext": {
"dclm": 0.01962394081056118,
"english": 0.8226245045661926,
"fineweb_edu_approx": 1.6088628768920898,
"eai_general_math": 0.005189539864659309,
"eai_open_web_math": 0.22396332025527954,
"eai_web_code": 0.00000810999972600257
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "302.23",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-2,937,405,806,164,421,000 |
Guide to Moving Away from TimThumb Script to BFIThumb
Filled in Wordpress
What is it?
Timthumb developer has been closed, and that script is not continue because its script contains many bugs. Where, through its bug, someone can inject script in your hosting.
And now, its time to move from timthumb to another on-the-fly image resizeing script. In wordpress, many developers offers image resizing technique, such as Matthew Ruddy who creating WordPress Timthumb alternative, you can download its script from github
Then, i am choosing use BFIThumb script. Its not a plugin, but litle library that support wordpress image class, or in simple word : its enhancing wordpress image class in order you can easily got these features :
1. Grayscale
2. Color (colorize)
3. Opacity
4. Negate
5. Resize images down or UP
6. Image Quality (1-100)
All feature above is working on the fly. Cool, right?
So, after download BFIThumb, its time to create a custom function to display thumbnail easily in front-end (template). Open your functions.php file, and paste this code
require_once('BFI_Thumb.php');
function first_image($w,$h,$o,$gray,$crop) {
global $post, $posts;
$first_img = '';
ob_start();
ob_end_clean();
$output = preg_match_all('/<img.+src=[\'"]([^\'"]+)[\'"].*>/i', $post->post_content, $matches);
$first_img = $matches [1] [0];
if(empty($first_img)){
$img_dir = get_template_directory_uri();
$first_img = $img_dir . '/images/thumb.gif';
}
//return $first_img;
$params = array( 'width' => $w, 'height' => $h, 'opacity' => $o, 'grayscale' => $gray, 'crop' => $crop );
$image=bfi_thumb($first_img,$params);
return $image;
}
How the function is work?
1. We’are using a regular expression to get img url in a post.
2. Then, when the script got it, BFIThumb will resize it or anything what you want.
3. This function return image url in resized version.
4. This function support many parameter, or you can modify it as you like.
Use it on template
To use this function, just call it on template where ever you want.
<img src="<?php echo first_image();?>" alt="" />
I hope this article will guide yo to move away from timthumb, because many site has been hacked which still using timthumb.
Meta Details
|
{
"url": "https://freshwebdev.com/guide-moving-away-timthumb-script-bfithumb.html",
"source_domain": "freshwebdev.com",
"snapshot_id": "crawl=CC-MAIN-2018-22",
"warc_metadata": {
"Content-Length": "25223",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TO2TIY6KALNUDVZFN6SX6SORIDYHOLXJ",
"WARC-Concurrent-To": "<urn:uuid:61dd5a14-ac10-4ef3-87d7-4e42d3a13575>",
"WARC-Date": "2018-05-26T21:39:35Z",
"WARC-IP-Address": "104.27.131.174",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZEHRQSSG546YC7IBO6S6EJDE6HQT3KHS",
"WARC-Record-ID": "<urn:uuid:b42a640c-5dc3-48a4-ab48-75b6a7b0daa8>",
"WARC-Target-URI": "https://freshwebdev.com/guide-moving-away-timthumb-script-bfithumb.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7dcb5012-24c9-4ca5-8351-174f342085a0>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-144-228-54.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 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,
54,
55,
75,
87,
88,
262,
263,
519,
520,
734,
735,
750,
772,
785,
797,
827,
854,
855,
909,
910,
1079,
1080,
1111,
1112,
1157,
1181,
1199,
1212,
1229,
1326,
1358,
1359,
1384,
1426,
1472,
1475,
1497,
1604,
1643,
1659,
1661,
1662,
1688,
1689,
1754,
1840,
1896,
1973,
1974,
1993,
1994,
2062,
2063,
2112,
2113,
2237,
2238,
2240,
2241
],
"line_end_idx": [
54,
55,
75,
87,
88,
262,
263,
519,
520,
734,
735,
750,
772,
785,
797,
827,
854,
855,
909,
910,
1079,
1080,
1111,
1112,
1157,
1181,
1199,
1212,
1229,
1326,
1358,
1359,
1384,
1426,
1472,
1475,
1497,
1604,
1643,
1659,
1661,
1662,
1688,
1689,
1754,
1840,
1896,
1973,
1974,
1993,
1994,
2062,
2063,
2112,
2113,
2237,
2238,
2240,
2241,
2253
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2253,
"ccnet_original_nlines": 59,
"rps_doc_curly_bracket": 0.0017754100263118744,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2616632878780365,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004056800156831741,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.33874237537384033,
"rps_doc_frac_unique_words": 0.5714285969734192,
"rps_doc_mean_word_length": 5.126984119415283,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.9419755935668945,
"rps_doc_word_count": 315,
"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.022291019558906555,
"rps_doc_frac_chars_top_3gram": 0.01981423981487751,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -199.2066650390625,
"rps_doc_books_importance_length_correction": -199.2066650390625,
"rps_doc_openwebtext_importance": -112.21649169921875,
"rps_doc_openwebtext_importance_length_correction": -112.21649169921875,
"rps_doc_wikipedia_importance": -63.18406295776367,
"rps_doc_wikipedia_importance_length_correction": -63.18406295776367
},
"fasttext": {
"dclm": 0.5291196703910828,
"english": 0.7756585478782654,
"fineweb_edu_approx": 2.251909017562866,
"eai_general_math": 0.2604631781578064,
"eai_open_web_math": 0.07655590772628784,
"eai_web_code": 0.06250829249620438
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
9,097,337,793,491,671,000 |
Bootstrap snippet and html example. Blog Detail App
This html snippet was created to help web designers, web developers, front-end and back-end developer save time. Use it for free in your project and build your app faster, You can also download the HTML, CSS, and JS code.
Tags: blog,blog-detail
HTML code
This is the html code used to create this bootstrap snippet, You can copy and paste the following html code inside a page with bootstrap 4.5.0 included, to get the result that you can see in the preview selection
<link href="https://maxcdn.bootstrapcdn.com/font-awesome/4.7.0/css/font-awesome.min.css" rel="stylesheet" />
<div id="main-content" class="blog-page">
<div class="container">
<div class="row clearfix">
<div class="col-lg-8 col-md-12 left-box">
<div class="card single_post">
<div class="body">
<div class="img-post">
<img class="d-block img-fluid" src="https://www.bootdey.com/image/800x280/87CEFA/000000" alt="First slide">
</div>
<h3><a href="blog-details.html">All photographs are accurate</a></h3>
<p>Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book. It has survived not only five centuries, but also the leap into electronic typesetting, remaining essentially unchanged. It was popularised in the 1960s with the release of Letraset sheets containing Lorem Ipsum passages, and more recently with desktop publishing software like Aldus PageMaker including versions of Lorem Ipsum.</p>
</div>
</div>
<div class="card">
<div class="header">
<h2>Comments 3</h2>
</div>
<div class="body">
<ul class="comment-reply list-unstyled">
<li class="row clearfix">
<div class="icon-box col-md-2 col-4"><img class="img-fluid img-thumbnail" src="https://bootdey.com/img/Content/avatar/avatar7.png" alt="Awesome Image"></div>
<div class="text-box col-md-10 col-8 p-l-0 p-r0">
<h5 class="m-b-0">Gigi Hadid </h5>
<p>Why are there so many tutorials on how to decouple WordPress? how fast and easy it is to get it running (and keep it running!) and its massive ecosystem. </p>
<ul class="list-inline">
<li><a href="javascript:void(0);">Mar 09 2018</a></li>
<li><a href="javascript:void(0);">Reply</a></li>
</ul>
</div>
</li>
<li class="row clearfix">
<div class="icon-box col-md-2 col-4"><img class="img-fluid img-thumbnail" src="https://bootdey.com/img/Content/avatar/avatar3.png" alt="Awesome Image"></div>
<div class="text-box col-md-10 col-8 p-l-0 p-r0">
<h5 class="m-b-0">Christian Louboutin</h5>
<p>Great tutorial but few issues with it? If i try open post i get following errors. Please can you help me?</p>
<ul class="list-inline">
<li><a href="javascript:void(0);">Mar 12 2018</a></li>
<li><a href="javascript:void(0);">Reply</a></li>
</ul>
</div>
</li>
<li class="row clearfix">
<div class="icon-box col-md-2 col-4"><img class="img-fluid img-thumbnail" src="https://bootdey.com/img/Content/avatar/avatar4.png" alt="Awesome Image"></div>
<div class="text-box col-md-10 col-8 p-l-0 p-r0">
<h5 class="m-b-0">Kendall Jenner</h5>
<p>Very nice and informative article. In all the years I've done small and side-projects as a freelancer, I've ran into a few problems here and there.</p>
<ul class="list-inline">
<li><a href="javascript:void(0);">Mar 20 2018</a></li>
<li><a href="javascript:void(0);">Reply</a></li>
</ul>
</div>
</li>
</ul>
</div>
</div>
<div class="card">
<div class="header">
<h2>Leave a reply <small>Your email address will not be published. Required fields are marked*</small></h2>
</div>
<div class="body">
<div class="comment-form">
<form class="row clearfix">
<div class="col-sm-6">
<div class="form-group">
<input type="text" class="form-control" placeholder="Your Name">
</div>
</div>
<div class="col-sm-6">
<div class="form-group">
<input type="text" class="form-control" placeholder="Email Address">
</div>
</div>
<div class="col-sm-12">
<div class="form-group">
<textarea rows="4" class="form-control no-resize" placeholder="Please type what you want..."></textarea>
</div>
<button type="submit" class="btn btn-block btn-primary">SUBMIT</button>
</div>
</form>
</div>
</div>
</div>
</div>
<div class="col-lg-4 col-md-12 right-box">
<div class="card">
<div class="body search">
<div class="input-group m-b-0">
<div class="input-group-prepend">
<span class="input-group-text"><i class="fa fa-search"></i></span>
</div>
<input type="text" class="form-control" placeholder="Search...">
</div>
</div>
</div>
<div class="card">
<div class="header">
<h2>Categories Clouds</h2>
</div>
<div class="body widget">
<ul class="list-unstyled categories-clouds m-b-0">
<li><a href="javascript:void(0);">eCommerce</a></li>
<li><a href="javascript:void(0);">Microsoft Technologies</a></li>
<li><a href="javascript:void(0);">Creative UX</a></li>
<li><a href="javascript:void(0);">Wordpress</a></li>
<li><a href="javascript:void(0);">Angular JS</a></li>
<li><a href="javascript:void(0);">Enterprise Mobility</a></li>
<li><a href="javascript:void(0);">Website Design</a></li>
<li><a href="javascript:void(0);">HTML5</a></li>
<li><a href="javascript:void(0);">Infographics</a></li>
<li><a href="javascript:void(0);">Wordpress Development</a></li>
</ul>
</div>
</div>
<div class="card">
<div class="header">
<h2>Popular Posts</h2>
</div>
<div class="body widget popular-post">
<div class="row">
<div class="col-lg-12">
<div class="single_post">
<p class="m-b-0">Apple Introduces Search Ads Basic</p>
<span>jun 22, 2018</span>
<div class="img-post">
<img src="https://www.bootdey.com/image/280x280/87CEFA/000000" alt="Awesome Image">
</div>
</div>
<div class="single_post">
<p class="m-b-0">new rules, more cars, more races</p>
<span>jun 8, 2018</span>
<div class="img-post">
<img src="https://www.bootdey.com/image/280x280/87CEFA/000000" alt="Awesome Image">
</div>
</div>
</div>
</div>
</div>
</div>
<div class="card">
<div class="header">
<h2>Instagram Post</h2>
</div>
<div class="body widget">
<ul class="list-unstyled instagram-plugin m-b-0">
<li><a href="javascript:void(0);"><img src="https://www.bootdey.com/image/100x100/87CEFA/000000" alt="image description"></a></li>
<li><a href="javascript:void(0);"><img src="https://www.bootdey.com/image/100x100/87CEFA/000000" alt="image description"></a></li>
<li><a href="javascript:void(0);"><img src="https://www.bootdey.com/image/100x100/87CEFA/000000" alt="image description"></a></li>
<li><a href="javascript:void(0);"><img src="https://www.bootdey.com/image/100x100/87CEFA/000000" alt="image description"></a></li>
<li><a href="javascript:void(0);"><img src="https://www.bootdey.com/image/100x100/87CEFA/000000" alt="image description"></a></li>
<li><a href="javascript:void(0);"><img src="https://www.bootdey.com/image/100x100/87CEFA/000000" alt="image description"></a></li>
<li><a href="javascript:void(0);"><img src="https://www.bootdey.com/image/100x100/87CEFA/000000" alt="image description"></a></li>
<li><a href="javascript:void(0);"><img src="https://www.bootdey.com/image/100x100/87CEFA/000000" alt="image description"></a></li>
<li><a href="javascript:void(0);"><img src="https://www.bootdey.com/image/100x100/87CEFA/000000" alt="image description"></a></li>
</ul>
</div>
</div>
<div class="card">
<div class="header">
<h2>Email Newsletter <small>Get our products/news earlier than others, let’s get in touch.</small></h2>
</div>
<div class="body widget newsletter">
<div class="input-group">
<input type="text" class="form-control" placeholder="Enter Email">
<div class="input-group-append">
<span class="input-group-text"><i class="icon-paper-plane"></i></span>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
CSS code
This is the css code used to create this bootstrap snippet, You can copy and paste the following css code inside a page with bootstrap 4.5.0 included, to get the result that you can see in the preview selection
body{
background-color: #f4f7f6;
margin-top:20px;
}
.card {
background: #fff;
transition: .5s;
border: 0;
margin-bottom: 30px;
border-radius: .55rem;
position: relative;
width: 100%;
box-shadow: 0 1px 2px 0 rgb(0 0 0 / 10%);
}
.card .body {
color: #444;
padding: 20px;
font-weight: 400;
}
.card .header {
color: #444;
padding: 20px;
position: relative;
box-shadow: none;
}
.single_post {
-webkit-transition: all .4s ease;
transition: all .4s ease
}
.single_post .body {
padding: 30px
}
.single_post .img-post {
position: relative;
overflow: hidden;
max-height: 500px;
margin-bottom: 30px
}
.single_post .img-post>img {
-webkit-transform: scale(1);
-ms-transform: scale(1);
transform: scale(1);
opacity: 1;
-webkit-transition: -webkit-transform .4s ease, opacity .4s ease;
transition: transform .4s ease, opacity .4s ease;
max-width: 100%;
filter: none;
-webkit-filter: grayscale(0);
-webkit-transform: scale(1.01)
}
.single_post .img-post:hover img {
-webkit-transform: scale(1.02);
-ms-transform: scale(1.02);
transform: scale(1.02);
opacity: .7;
filter: gray;
-webkit-filter: grayscale(1);
-webkit-transition: all .8s ease-in-out
}
.single_post .img-post:hover .social_share {
display: block
}
.single_post .footer {
padding: 0 30px 30px 30px
}
.single_post .footer .actions {
display: inline-block
}
.single_post .footer .stats {
cursor: default;
list-style: none;
padding: 0;
display: inline-block;
float: right;
margin: 0;
line-height: 35px
}
.single_post .footer .stats li {
border-left: solid 1px rgba(160, 160, 160, 0.3);
display: inline-block;
font-weight: 400;
letter-spacing: 0.25em;
line-height: 1;
margin: 0 0 0 2em;
padding: 0 0 0 2em;
text-transform: uppercase;
font-size: 13px
}
.single_post .footer .stats li a {
color: #777
}
.single_post .footer .stats li:first-child {
border-left: 0;
margin-left: 0;
padding-left: 0
}
.single_post h3 {
font-size: 20px;
text-transform: uppercase
}
.single_post h3 a {
color: #242424;
text-decoration: none
}
.single_post p {
font-size: 16px;
line-height: 26px;
font-weight: 300;
margin: 0
}
.single_post .blockquote p {
margin-top: 0 !important
}
.single_post .meta {
list-style: none;
padding: 0;
margin: 0
}
.single_post .meta li {
display: inline-block;
margin-right: 15px
}
.single_post .meta li a {
font-style: italic;
color: #959595;
text-decoration: none;
font-size: 12px
}
.single_post .meta li a i {
margin-right: 6px;
font-size: 12px
}
.single_post2 {
overflow: hidden
}
.single_post2 .content {
margin-top: 15px;
margin-bottom: 15px;
padding-left: 80px;
position: relative
}
.single_post2 .content .actions_sidebar {
position: absolute;
top: 0px;
left: 0px;
width: 60px
}
.single_post2 .content .actions_sidebar a {
display: inline-block;
width: 100%;
height: 60px;
line-height: 60px;
margin-right: 0;
text-align: center;
border-right: 1px solid #e4eaec
}
.single_post2 .content .title {
font-weight: 100
}
.single_post2 .content .text {
font-size: 15px
}
.right-box .categories-clouds li {
display: inline-block;
margin-bottom: 5px
}
.right-box .categories-clouds li a {
display: block;
border: 1px solid;
padding: 6px 10px;
border-radius: 3px
}
.right-box .instagram-plugin {
overflow: hidden
}
.right-box .instagram-plugin li {
float: left;
overflow: hidden;
border: 1px solid #fff
}
.comment-reply li {
margin-bottom: 15px
}
.comment-reply li:last-child {
margin-bottom: none
}
.comment-reply li h5 {
font-size: 18px
}
.comment-reply li p {
margin-bottom: 0px;
font-size: 15px;
color: #777
}
.comment-reply .list-inline li {
display: inline-block;
margin: 0;
padding-right: 20px
}
.comment-reply .list-inline li a {
font-size: 13px
}
@media (max-width: 640px) {
.blog-page .left-box .single-comment-box>ul>li {
padding: 25px 0
}
.blog-page .left-box .single-comment-box ul li .icon-box {
display: inline-block
}
.blog-page .left-box .single-comment-box ul li .text-box {
display: block;
padding-left: 0;
margin-top: 10px
}
.blog-page .single_post .footer .stats {
float: none;
margin-top: 10px
}
.blog-page .single_post .body,
.blog-page .single_post .footer {
padding: 30px
}
}
Similar snippets
Bootstrap example and template. Latest Blog and News
Latest Blog and News
Bootstrap example and template. bs4 blog post with image hover
bs4 blog post with image hover
Bootstrap example and template. Blog List App
Blog List App
Bootstrap example and template. blog item
blog item
Bootstrap example and template. bs5 dark footer
bs5 dark footer
Bootstrap example and template. bs5 edit profile account details
bs5 edit profile account details
Bootstrap example and template. profile with data and skills
profile with data and skills
Bootstrap example and template. User profile with friends and chat
User profile with friends and chat
Bootstrap example and template. Blog Detail App
About this bootstrap example/template
We hope you will enjoy this awesome snippet and stay tuned for the latest updates, bootdey snippets are already used in thousands of blogs, websites and projects. We believe it will save your precious time and gives trendy look to your next web project.
We always try to offer the best beautiful and responsive source of Bootstrap code examples and components.
This code example currectly have 14.6K views, Using this bootstrap snippet you have the following benefits:
Bootstrap 4.5.0
<link rel='stylesheet' href='https://cdn.jsdelivr.net/npm/[email protected]/dist/css/bootstrap.min.css'>
<script src='https://cdn.jsdelivr.net/npm/[email protected]/dist/js/bootstrap.bundle.min.js'></script>
This code example is based on bootstrap 4.5.0 and the grid system of this framework
Responsive
Based on bootstrap framework makes all the layouts perfectly responsive for all devices
Crossbrowser compatibility
Tested on all major browsers, it works smoothly on all of them
semantic html 5
Built on html / css3 the code quality is really amazing
Simple Integration
This code example can be simply integrated on existing sites and new ones too, all you need to do is copy the code and start working
|
{
"url": "https://www.bootdey.com/snippets/view/Blog-Detail-App",
"source_domain": "www.bootdey.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "46435",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ORKDOAZEICXDJLLSIOOBOOMJ3YWDFRBB",
"WARC-Concurrent-To": "<urn:uuid:1d4a0e53-8fe7-40c4-a453-1fe27e672902>",
"WARC-Date": "2023-12-08T16:38:25Z",
"WARC-IP-Address": "172.67.165.186",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:I6YC5LYRATX6YTGEMP66CSY3SDQQ7C7J",
"WARC-Record-ID": "<urn:uuid:dadf7550-8ca1-414e-b8f2-6ea4610d46bb>",
"WARC-Target-URI": "https://www.bootdey.com/snippets/view/Blog-Detail-App",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ede739ba-e63d-4fd1-a724-02b4cc37ff3a>"
},
"warc_info": "isPartOf: CC-MAIN-2023-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-150\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
52,
53,
275,
298,
299,
309,
310,
523,
524,
633,
634,
676,
708,
747,
805,
856,
899,
950,
1090,
1125,
1223,
1833,
1888,
1915,
1954,
2003,
2055,
2090,
2137,
2210,
2272,
2470,
2560,
2639,
2845,
2914,
3017,
3114,
3164,
3211,
3253,
3315,
3513,
3603,
3690,
3847,
3916,
4019,
4116,
4166,
4213,
4255,
4317,
4515,
4605,
4687,
4886,
4955,
5058,
5155,
5205,
5252,
5294,
5372,
5407,
5438,
5481,
5530,
5670,
5705,
5752,
5811,
5875,
5938,
6007,
6120,
6171,
6218,
6281,
6350,
6467,
6518,
6565,
6629,
6698,
6851,
6902,
7018,
7097,
7141,
7180,
7215,
7246,
7269,
7328,
7367,
7417,
7477,
7543,
7646,
7685,
7818,
7853,
7884,
7911,
7950,
7995,
8050,
8081,
8131,
8210,
8295,
8393,
8480,
8565,
8651,
8746,
8836,
8917,
9005,
9102,
9136,
9167,
9194,
9233,
9278,
9353,
9384,
9447,
9493,
9549,
9611,
9706,
9772,
9835,
10003,
10094,
10137,
10199,
10293,
10358,
10421,
10593,
10640,
10683,
10722,
10757,
10788,
10815,
10854,
10899,
10951,
10982,
11032,
11110,
11273,
11436,
11599,
11762,
11925,
12088,
12251,
12414,
12577,
12611,
12642,
12669,
12708,
12753,
12885,
12916,
13001,
13055,
13154,
13219,
13326,
13365,
13400,
13431,
13458,
13481,
13500,
13501,
13516,
13527,
13528,
13537,
13538,
13749,
13750,
13756,
13787,
13808,
13810,
13818,
13840,
13861,
13876,
13901,
13928,
13952,
13969,
14015,
14017,
14031,
14048,
14067,
14089,
14091,
14107,
14124,
14143,
14167,
14189,
14191,
14206,
14244,
14273,
14275,
14276,
14297,
14315,
14317,
14318,
14343,
14367,
14389,
14412,
14436,
14438,
14439,
14468,
14501,
14530,
14555,
14571,
14641,
14695,
14716,
14734,
14768,
14803,
14805,
14806,
14841,
14877,
14909,
14937,
14954,
14972,
15006,
15050,
15052,
15053,
15098,
15117,
15119,
15120,
15143,
15173,
15175,
15176,
15208,
15234,
15236,
15237,
15267,
15288,
15310,
15326,
15353,
15371,
15386,
15408,
15410,
15411,
15444,
15497,
15524,
15546,
15574,
15594,
15617,
15641,
15672,
15692,
15694,
15695,
15730,
15746,
15748,
15749,
15794,
15814,
15834,
15854,
15856,
15857,
15875,
15896,
15926,
15928,
15929,
15949,
15969,
15995,
15997,
15998,
16015,
16036,
16059,
16081,
16095,
16097,
16098,
16127,
16156,
16158,
16159,
16180,
16202,
16218,
16232,
16234,
16235,
16259,
16286,
16309,
16311,
16312,
16338,
16362,
16382,
16409,
16429,
16431,
16432,
16460,
16483,
16503,
16505,
16506,
16522,
16543,
16545,
16546,
16571,
16593,
16618,
16642,
16665,
16667,
16668,
16710,
16734,
16748,
16763,
16779,
16781,
16782,
16826,
16853,
16870,
16888,
16911,
16932,
16956,
16992,
16994,
16995,
17027,
17048,
17050,
17051,
17082,
17102,
17104,
17105,
17140,
17167,
17190,
17192,
17193,
17230,
17250,
17273,
17296,
17319,
17321,
17322,
17353,
17374,
17376,
17377,
17411,
17428,
17450,
17477,
17479,
17480,
17500,
17524,
17526,
17527,
17558,
17582,
17584,
17585,
17608,
17628,
17630,
17631,
17653,
17677,
17698,
17714,
17716,
17717,
17750,
17777,
17792,
17816,
17818,
17819,
17854,
17874,
17876,
17877,
17905,
17958,
17982,
17988,
18051,
18081,
18087,
18150,
18174,
18199,
18224,
18230,
18275,
18296,
18321,
18327,
18362,
18400,
18422,
18428,
18430,
18431,
18448,
18449,
18502,
18503,
18524,
18525,
18588,
18589,
18620,
18621,
18667,
18668,
18682,
18683,
18725,
18726,
18736,
18737,
18785,
18786,
18802,
18803,
18868,
18869,
18902,
18903,
18964,
18965,
18994,
18995,
19062,
19063,
19098,
19099,
19147,
19148,
19186,
19187,
19441,
19442,
19549,
19550,
19658,
19659,
19675,
19676,
19781,
19782,
19885,
19886,
19970,
19971,
19982,
19983,
20071,
20072,
20099,
20100,
20163,
20164,
20180,
20181,
20237,
20238,
20257,
20258
],
"line_end_idx": [
52,
53,
275,
298,
299,
309,
310,
523,
524,
633,
634,
676,
708,
747,
805,
856,
899,
950,
1090,
1125,
1223,
1833,
1888,
1915,
1954,
2003,
2055,
2090,
2137,
2210,
2272,
2470,
2560,
2639,
2845,
2914,
3017,
3114,
3164,
3211,
3253,
3315,
3513,
3603,
3690,
3847,
3916,
4019,
4116,
4166,
4213,
4255,
4317,
4515,
4605,
4687,
4886,
4955,
5058,
5155,
5205,
5252,
5294,
5372,
5407,
5438,
5481,
5530,
5670,
5705,
5752,
5811,
5875,
5938,
6007,
6120,
6171,
6218,
6281,
6350,
6467,
6518,
6565,
6629,
6698,
6851,
6902,
7018,
7097,
7141,
7180,
7215,
7246,
7269,
7328,
7367,
7417,
7477,
7543,
7646,
7685,
7818,
7853,
7884,
7911,
7950,
7995,
8050,
8081,
8131,
8210,
8295,
8393,
8480,
8565,
8651,
8746,
8836,
8917,
9005,
9102,
9136,
9167,
9194,
9233,
9278,
9353,
9384,
9447,
9493,
9549,
9611,
9706,
9772,
9835,
10003,
10094,
10137,
10199,
10293,
10358,
10421,
10593,
10640,
10683,
10722,
10757,
10788,
10815,
10854,
10899,
10951,
10982,
11032,
11110,
11273,
11436,
11599,
11762,
11925,
12088,
12251,
12414,
12577,
12611,
12642,
12669,
12708,
12753,
12885,
12916,
13001,
13055,
13154,
13219,
13326,
13365,
13400,
13431,
13458,
13481,
13500,
13501,
13516,
13527,
13528,
13537,
13538,
13749,
13750,
13756,
13787,
13808,
13810,
13818,
13840,
13861,
13876,
13901,
13928,
13952,
13969,
14015,
14017,
14031,
14048,
14067,
14089,
14091,
14107,
14124,
14143,
14167,
14189,
14191,
14206,
14244,
14273,
14275,
14276,
14297,
14315,
14317,
14318,
14343,
14367,
14389,
14412,
14436,
14438,
14439,
14468,
14501,
14530,
14555,
14571,
14641,
14695,
14716,
14734,
14768,
14803,
14805,
14806,
14841,
14877,
14909,
14937,
14954,
14972,
15006,
15050,
15052,
15053,
15098,
15117,
15119,
15120,
15143,
15173,
15175,
15176,
15208,
15234,
15236,
15237,
15267,
15288,
15310,
15326,
15353,
15371,
15386,
15408,
15410,
15411,
15444,
15497,
15524,
15546,
15574,
15594,
15617,
15641,
15672,
15692,
15694,
15695,
15730,
15746,
15748,
15749,
15794,
15814,
15834,
15854,
15856,
15857,
15875,
15896,
15926,
15928,
15929,
15949,
15969,
15995,
15997,
15998,
16015,
16036,
16059,
16081,
16095,
16097,
16098,
16127,
16156,
16158,
16159,
16180,
16202,
16218,
16232,
16234,
16235,
16259,
16286,
16309,
16311,
16312,
16338,
16362,
16382,
16409,
16429,
16431,
16432,
16460,
16483,
16503,
16505,
16506,
16522,
16543,
16545,
16546,
16571,
16593,
16618,
16642,
16665,
16667,
16668,
16710,
16734,
16748,
16763,
16779,
16781,
16782,
16826,
16853,
16870,
16888,
16911,
16932,
16956,
16992,
16994,
16995,
17027,
17048,
17050,
17051,
17082,
17102,
17104,
17105,
17140,
17167,
17190,
17192,
17193,
17230,
17250,
17273,
17296,
17319,
17321,
17322,
17353,
17374,
17376,
17377,
17411,
17428,
17450,
17477,
17479,
17480,
17500,
17524,
17526,
17527,
17558,
17582,
17584,
17585,
17608,
17628,
17630,
17631,
17653,
17677,
17698,
17714,
17716,
17717,
17750,
17777,
17792,
17816,
17818,
17819,
17854,
17874,
17876,
17877,
17905,
17958,
17982,
17988,
18051,
18081,
18087,
18150,
18174,
18199,
18224,
18230,
18275,
18296,
18321,
18327,
18362,
18400,
18422,
18428,
18430,
18431,
18448,
18449,
18502,
18503,
18524,
18525,
18588,
18589,
18620,
18621,
18667,
18668,
18682,
18683,
18725,
18726,
18736,
18737,
18785,
18786,
18802,
18803,
18868,
18869,
18902,
18903,
18964,
18965,
18994,
18995,
19062,
19063,
19098,
19099,
19147,
19148,
19186,
19187,
19441,
19442,
19549,
19550,
19658,
19659,
19675,
19676,
19781,
19782,
19885,
19886,
19970,
19971,
19982,
19983,
20071,
20072,
20099,
20100,
20163,
20164,
20180,
20181,
20237,
20238,
20257,
20258,
20390
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 20390,
"ccnet_original_nlines": 516,
"rps_doc_curly_bracket": 0.004512019921094179,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0.00034855000558309257,
"rps_doc_stop_word_fraction": 0.10601426661014557,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006116210017353296,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4668705463409424,
"rps_doc_frac_unique_words": 0.3812754452228546,
"rps_doc_mean_word_length": 6.7862958908081055,
"rps_doc_num_sentences": 203,
"rps_doc_symbol_to_word_ratio": 0.0030580998864024878,
"rps_doc_unigram_entropy": 5.689568996429443,
"rps_doc_word_count": 1474,
"rps_doc_frac_chars_dupe_10grams": 0.1553533971309662,
"rps_doc_frac_chars_dupe_5grams": 0.27371788024902344,
"rps_doc_frac_chars_dupe_6grams": 0.23602919280529022,
"rps_doc_frac_chars_dupe_7grams": 0.2096371054649353,
"rps_doc_frac_chars_dupe_8grams": 0.1780465841293335,
"rps_doc_frac_chars_dupe_9grams": 0.1780465841293335,
"rps_doc_frac_chars_top_2gram": 0.02399279922246933,
"rps_doc_frac_chars_top_3gram": 0.020693790167570114,
"rps_doc_frac_chars_top_4gram": 0.014395680278539658,
"rps_doc_books_importance": -1852.697265625,
"rps_doc_books_importance_length_correction": -1852.697265625,
"rps_doc_openwebtext_importance": -1070.31787109375,
"rps_doc_openwebtext_importance_length_correction": -1070.31787109375,
"rps_doc_wikipedia_importance": -897.6132202148438,
"rps_doc_wikipedia_importance_length_correction": -897.6132202148438
},
"fasttext": {
"dclm": 0.7748926281929016,
"english": 0.3934136629104614,
"fineweb_edu_approx": 2.010986089706421,
"eai_general_math": 0.005746540147811174,
"eai_open_web_math": 0.08266746997833252,
"eai_web_code": 0.7372106909751892
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
912,514,147,618,274,400 |
Laravel 9 Livewire Wizard Form Tutorial with Example
Last updated on: by Digamber
Throughout this Laravel tutorial, you will learn how to create a multi-step form in the Laravel application using Laravel form wizard using Livewire package.
Laravel livewire is a user-friendly package for developing full-stack web applications; it lowers the pain of building dynamic user interface components. You are going to understand how to use this package to create a dynamic multi-step form with a laravel form wizard.
Laravel 9 Multistep Form with Livewire Wizard Example
Form are useful for collecting user information; vice versa, they establish the communication with the site visitors. Sometimes, you need to build advanced forms that need to be categorized in multi-steps.
This tutorial will guide you from scratch about how to create a multi-step way not only but also form a wizard with the help of the livewire package in the laravel application.
This quick and simple tutorial offers you a facile example of a multi-step using bootstrap wizard UI design in laravel app with livewire library.
Generate Laravel Project
The first step begins with creating a new laravel application using the composer command:
composer create-project laravel/laravel --prefer-dist laravel-multistep-form-example
Connect with Database
Afterwards, you need to add database name, username equally important password in .env configuration file:
DB_CONNECTION=mysql
DB_HOST=127.0.0.1
DB_PORT=3306
DB_DATABASE=database_name
DB_USERNAME=root
DB_PASSWORD=
Model and Migration
Use command to manifest laravel model by the same token migration files:
php artisan make:model Team -m
Define table values in database/migrations/create_teams_table.php file:
<?php
use Illuminate\Database\Migrations\Migration;
use Illuminate\Database\Schema\Blueprint;
use Illuminate\Support\Facades\Schema;
class CreateTeamsTable extends Migration
{
/**
* Run the migrations.
*
* @return void
*/
public function up()
{
Schema::create('teams', function (Blueprint $table) {
$table->id();
$table->string('name')->nullable();
$table->float('price')->nullable();
$table->longText('detail')->nullable();
$table->boolean('status')->default(0);
$table->timestamps();
});
}
/**
* Reverse the migrations.
*
* @return void
*/
public function down()
{
Schema::dropIfExists('teams');
}
}
Add the following code in the app/Models/Team.php file:
<?php
namespace App\Models;
use Illuminate\Database\Eloquent\Factories\HasFactory;
use Illuminate\Database\Eloquent\Model;
class Team extends Model
{
use HasFactory;
protected $fillable = [
'name',
'price',
'detail',
'status'
];
}
Run migration with following command:
php artisan migrate
Install Livewire Package
Now that, you have to use the following command to install the livewire package in your laravel application:
composer require livewire/livewire
Create Livewire Component
Go to console run the artisan command to create the livewire components:
php artisan make:livewire wizard
The above command generated two files on the following path:
app/Http/Livewire/Wizard.php
resources/views/livewire/wizard.php
Go ahead and place the below code in the app/Http/Livewire/Wizard.php file:
<?php
namespace App\Http\Livewire;
use Livewire\Component;
use App\Models\Team;
class Wizard extends Component
{
public $currentStep = 1;
public $name, $price, $detail, $status = 1;
public $successMsg = '';
/**
* Write code on Method
*/
public function render()
{
return view('livewire.wizard');
}
/**
* Write code on Method
*/
public function firstStepSubmit()
{
$validatedData = $this->validate([
'name' => 'required',
'price' => 'required|numeric',
'detail' => 'required',
]);
$this->currentStep = 2;
}
/**
* Write code on Method
*/
public function secondStepSubmit()
{
$validatedData = $this->validate([
'status' => 'required',
]);
$this->currentStep = 3;
}
/**
* Write code on Method
*/
public function submitForm()
{
Team::create([
'name' => $this->name,
'price' => $this->price,
'detail' => $this->detail,
'status' => $this->status,
]);
$this->successMsg = 'Team successfully created.';
$this->clearForm();
$this->currentStep = 1;
}
/**
* Write code on Method
*/
public function back($step)
{
$this->currentStep = $step;
}
/**
* Write code on Method
*/
public function clearForm()
{
$this->name = '';
$this->price = '';
$this->detail = '';
$this->status = 1;
}
}
Next, open resources/views/livewire/wizard.blade.php file, add the following code:
<div>
@if(!empty($successMsg))
<div class="alert alert-success">
{{ $successMsg }}
</div>
@endif
<div class="stepwizard">
<div class="stepwizard-row setup-panel">
<div class="multi-wizard-step">
<a href="#step-1" type="button"
class="btn {{ $currentStep != 1 ? 'btn-default' : 'btn-primary' }}">1</a>
<p>Step 1</p>
</div>
<div class="multi-wizard-step">
<a href="#step-2" type="button"
class="btn {{ $currentStep != 2 ? 'btn-default' : 'btn-primary' }}">2</a>
<p>Step 2</p>
</div>
<div class="multi-wizard-step">
<a href="#step-3" type="button"
class="btn {{ $currentStep != 3 ? 'btn-default' : 'btn-primary' }}"
disabled="disabled">3</a>
<p>Step 3</p>
</div>
</div>
</div>
<div class="row setup-content {{ $currentStep != 1 ? 'display-none' : '' }}" id="step-1">
<div class="col-md-12">
<h3> Step 1</h3>
<div class="form-group">
<label for="title">Team Name:</label>
<input type="text" wire:model="name" class="form-control" id="taskTitle">
@error('name') <span class="error">{{ $message }}</span> @enderror
</div>
<div class="form-group">
<label for="description">Team Price:</label>
<input type="text" wire:model="price" class="form-control" id="teamPrice" />
@error('price') <span class="error">{{ $message }}</span> @enderror
</div>
<div class="form-group">
<label for="detail">Team Details:</label>
<textarea type="text" wire:model="detail" class="form-control"
id="taskDetail">{{{ $detail ?? '' }}}</textarea>
@error('detail') <span class="error">{{ $message }}</span> @enderror
</div>
<button class="btn btn-primary nextBtn btn-lg pull-right" wire:click="firstStepSubmit"
type="button">Next</button>
</div>
</div>
<div class="row setup-content {{ $currentStep != 2 ? 'display-none' : '' }}" id="step-2">
<div class="col-md-12">
<h3> Step 2</h3>
<div class="form-group">
<label for="description">Team Status</label><br />
<label class="radio-inline"><input type="radio" wire:model="status" value="1"
{{{ $status == '1' ? "checked" : "" }}}> Active</label>
<label class="radio-inline"><input type="radio" wire:model="status" value="0"
{{{ $status == '0' ? "checked" : "" }}}> DeActive</label>
@error('status') <span class="error">{{ $message }}</span> @enderror
</div>
<button class="btn btn-primary nextBtn btn-lg pull-right" type="button"
wire:click="secondStepSubmit">Next</button>
<button class="btn btn-danger nextBtn btn-lg pull-right" type="button" wire:click="back(1)">Back</button>
</div>
</div>
<div class="row setup-content {{ $currentStep != 3 ? 'display-none' : '' }}" id="step-3">
<div class="col-md-12">
<h3> Step 3</h3>
<table class="table">
<tr>
<td>Team Name:</td>
<td><strong>{{$name}}</strong></td>
</tr>
<tr>
<td>Team Price:</td>
<td><strong>{{$price}}</strong></td>
</tr>
<tr>
<td>Team status:</td>
<td><strong>{{$status ? 'Active' : 'DeActive'}}</strong></td>
</tr>
<tr>
<td>Team Detail:</td>
<td><strong>{{$detail}}</strong></td>
</tr>
</table>
<button class="btn btn-success btn-lg pull-right" wire:click="submitForm" type="button">Finish!</button>
<button class="btn btn-danger nextBtn btn-lg pull-right" type="button" wire:click="back(2)">Back</button>
</div>
</div>
</div>
Next, add custom styling in multi-step form. So create a public/multiform.css file and add the following code:
.display-none {
display: none;
}
.multi-wizard-step p {
margin-top: 12px;
}
.stepwizard-row {
display: table-row;
}
.stepwizard {
display: table;
position: relative;
width: 100%;
}
.multi-wizard-step button[disabled] {
filter: alpha(opacity=100) !important;
opacity: 1 !important;
}
.stepwizard-row:before {
top: 14px;
bottom: 0;
content: " ";
width: 100%;
height: 1px;
z-order: 0;
position: absolute;
background-color: #fefefe;
}
.multi-wizard-step {
text-align: center;
position: relative;
display: table-cell;
}
Create Form Route
Open routes/web.php file and define the route to access the multistep form from view:
<?php
use Illuminate\Support\Facades\Route;
/*
|--------------------------------------------------------------------------
| Web Routes
|--------------------------------------------------------------------------
|
*/
Route::get('wizard', function () {
return view('welcome');
});
Render Multi-step Form in Blade View
Add below code in resources/views/welcome.blade.php file:
<!DOCTYPE html>
<html lang="{{ str_replace('_', '-', app()->getLocale()) }}">
<head>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1">
<title>Laravel Multistep Livewire Form Example</title>
@livewireStyles
<link href="//maxcdn.bootstrapcdn.com/bootstrap/4.5.0/css/bootstrap.min.css" rel="stylesheet" id="bootstrap">
<link href="{{ asset('multiform.css') }}" rel="stylesheet" id="bootstrap">
</head>
<body class="mt-5">
<div class="container">
<div class="text-center">
Laravel Form Wizard Example
</div>
<livewire:wizard />
</div>
</body>
<script src="//cdnjs.cloudflare.com/ajax/libs/jquery/3.2.1/jquery.min.js"></script>
<script src="//maxcdn.bootstrapcdn.com/bootstrap/4.1.1/js/bootstrap.min.js"></script>
@livewireScripts
</html>
Now you can run the app to check the multi-step form.
php artisan serve
Open the URL on the browser:
http://localhost:8000/wizard
Laravel Livewire Wizard Form Example
Eventually, the Laravel Livewire Wizard Form tutorial is over, i hope now you have clear understanding of how to build multi step form in Laravel application with Livewire Wizard package.
Digamber
I am Digamber, a full-stack developer and fitness aficionado. I created this site to bestow my coding experience with newbie programmers. I love to write on JavaScript, ECMAScript, React, Angular, Vue, Laravel.
|
{
"url": "https://www.positronx.io/laravel-livewire-wizard-form-tutorial-with-example/",
"source_domain": "www.positronx.io",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "131038",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H65LLFOZING7KUH4O6FFTKHSWXQAHJ4V",
"WARC-Concurrent-To": "<urn:uuid:7627db5b-01a2-4cd7-9385-b7e32537c7d4>",
"WARC-Date": "2022-07-01T11:40:11Z",
"WARC-IP-Address": "192.124.249.107",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YNFCPS2VRZ4J6WMJ6LXCCVNLOCLMBS7U",
"WARC-Record-ID": "<urn:uuid:6cde1d52-01a7-48f4-b7b0-0f50384dd1f0>",
"WARC-Target-URI": "https://www.positronx.io/laravel-livewire-wizard-form-tutorial-with-example/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:10d3bb68-be43-4eb7-ac79-574a4c2a8475>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-203\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
53,
54,
83,
84,
242,
243,
513,
514,
568,
569,
775,
776,
953,
954,
1100,
1101,
1126,
1127,
1217,
1218,
1303,
1304,
1326,
1327,
1434,
1435,
1455,
1473,
1486,
1512,
1529,
1542,
1543,
1563,
1564,
1637,
1638,
1669,
1670,
1742,
1743,
1749,
1795,
1837,
1876,
1917,
1919,
1927,
1954,
1961,
1981,
1989,
2014,
2020,
2082,
2108,
2156,
2204,
2256,
2315,
2349,
2361,
2367,
2375,
2406,
2413,
2433,
2441,
2468,
2474,
2513,
2519,
2521,
2522,
2578,
2579,
2585,
2607,
2662,
2702,
2727,
2729,
2749,
2777,
2794,
2812,
2831,
2848,
2859,
2861,
2862,
2900,
2901,
2921,
2922,
2947,
2948,
3057,
3058,
3093,
3094,
3120,
3121,
3194,
3195,
3228,
3229,
3290,
3291,
3320,
3356,
3357,
3433,
3434,
3440,
3443,
3472,
3496,
3517,
3520,
3551,
3553,
3582,
3630,
3659,
3662,
3670,
3698,
3706,
3735,
3741,
3781,
3787,
3790,
3798,
3826,
3834,
3872,
3878,
3921,
3955,
3998,
4034,
4046,
4048,
4080,
4086,
4089,
4097,
4125,
4133,
4172,
4178,
4221,
4257,
4269,
4272,
4304,
4310,
4313,
4321,
4349,
4357,
4390,
4396,
4419,
4454,
4491,
4530,
4569,
4581,
4584,
4642,
4645,
4673,
4676,
4708,
4714,
4717,
4725,
4753,
4761,
4793,
4799,
4839,
4845,
4848,
4856,
4884,
4892,
4924,
4930,
4956,
4983,
5011,
5038,
5044,
5046,
5047,
5130,
5131,
5137,
5166,
5204,
5230,
5241,
5252,
5281,
5330,
5374,
5422,
5516,
5546,
5565,
5609,
5657,
5751,
5781,
5800,
5844,
5892,
5980,
6026,
6056,
6075,
6090,
6101,
6195,
6227,
6256,
6293,
6347,
6437,
6520,
6539,
6576,
6637,
6730,
6814,
6833,
6870,
6928,
7007,
7076,
7161,
7180,
7279,
7323,
7338,
7349,
7443,
7475,
7504,
7541,
7608,
7702,
7782,
7876,
7958,
8043,
8062,
8146,
8206,
8324,
8339,
8350,
8444,
8476,
8505,
8539,
8560,
8600,
8656,
8678,
8699,
8740,
8797,
8819,
8840,
8882,
8964,
8986,
9007,
9049,
9107,
9129,
9150,
9267,
9385,
9400,
9411,
9418,
9419,
9530,
9531,
9547,
9566,
9568,
9591,
9613,
9615,
9633,
9657,
9659,
9673,
9693,
9717,
9734,
9736,
9774,
9817,
9844,
9846,
9871,
9886,
9901,
9919,
9936,
9953,
9969,
9993,
10024,
10026,
10047,
10071,
10095,
10120,
10122,
10123,
10141,
10142,
10228,
10229,
10235,
10273,
10276,
10352,
10365,
10441,
10443,
10446,
10481,
10509,
10513,
10514,
10551,
10552,
10610,
10611,
10627,
10689,
10696,
10723,
10796,
10855,
10875,
10989,
11068,
11076,
11096,
11124,
11158,
11198,
11213,
11241,
11252,
11260,
11344,
11430,
11447,
11455,
11456,
11510,
11511,
11529,
11530,
11559,
11560,
11589,
11590,
11627,
11628,
11816,
11817,
11826,
11827
],
"line_end_idx": [
53,
54,
83,
84,
242,
243,
513,
514,
568,
569,
775,
776,
953,
954,
1100,
1101,
1126,
1127,
1217,
1218,
1303,
1304,
1326,
1327,
1434,
1435,
1455,
1473,
1486,
1512,
1529,
1542,
1543,
1563,
1564,
1637,
1638,
1669,
1670,
1742,
1743,
1749,
1795,
1837,
1876,
1917,
1919,
1927,
1954,
1961,
1981,
1989,
2014,
2020,
2082,
2108,
2156,
2204,
2256,
2315,
2349,
2361,
2367,
2375,
2406,
2413,
2433,
2441,
2468,
2474,
2513,
2519,
2521,
2522,
2578,
2579,
2585,
2607,
2662,
2702,
2727,
2729,
2749,
2777,
2794,
2812,
2831,
2848,
2859,
2861,
2862,
2900,
2901,
2921,
2922,
2947,
2948,
3057,
3058,
3093,
3094,
3120,
3121,
3194,
3195,
3228,
3229,
3290,
3291,
3320,
3356,
3357,
3433,
3434,
3440,
3443,
3472,
3496,
3517,
3520,
3551,
3553,
3582,
3630,
3659,
3662,
3670,
3698,
3706,
3735,
3741,
3781,
3787,
3790,
3798,
3826,
3834,
3872,
3878,
3921,
3955,
3998,
4034,
4046,
4048,
4080,
4086,
4089,
4097,
4125,
4133,
4172,
4178,
4221,
4257,
4269,
4272,
4304,
4310,
4313,
4321,
4349,
4357,
4390,
4396,
4419,
4454,
4491,
4530,
4569,
4581,
4584,
4642,
4645,
4673,
4676,
4708,
4714,
4717,
4725,
4753,
4761,
4793,
4799,
4839,
4845,
4848,
4856,
4884,
4892,
4924,
4930,
4956,
4983,
5011,
5038,
5044,
5046,
5047,
5130,
5131,
5137,
5166,
5204,
5230,
5241,
5252,
5281,
5330,
5374,
5422,
5516,
5546,
5565,
5609,
5657,
5751,
5781,
5800,
5844,
5892,
5980,
6026,
6056,
6075,
6090,
6101,
6195,
6227,
6256,
6293,
6347,
6437,
6520,
6539,
6576,
6637,
6730,
6814,
6833,
6870,
6928,
7007,
7076,
7161,
7180,
7279,
7323,
7338,
7349,
7443,
7475,
7504,
7541,
7608,
7702,
7782,
7876,
7958,
8043,
8062,
8146,
8206,
8324,
8339,
8350,
8444,
8476,
8505,
8539,
8560,
8600,
8656,
8678,
8699,
8740,
8797,
8819,
8840,
8882,
8964,
8986,
9007,
9049,
9107,
9129,
9150,
9267,
9385,
9400,
9411,
9418,
9419,
9530,
9531,
9547,
9566,
9568,
9591,
9613,
9615,
9633,
9657,
9659,
9673,
9693,
9717,
9734,
9736,
9774,
9817,
9844,
9846,
9871,
9886,
9901,
9919,
9936,
9953,
9969,
9993,
10024,
10026,
10047,
10071,
10095,
10120,
10122,
10123,
10141,
10142,
10228,
10229,
10235,
10273,
10276,
10352,
10365,
10441,
10443,
10446,
10481,
10509,
10513,
10514,
10551,
10552,
10610,
10611,
10627,
10689,
10696,
10723,
10796,
10855,
10875,
10989,
11068,
11076,
11096,
11124,
11158,
11198,
11213,
11241,
11252,
11260,
11344,
11430,
11447,
11455,
11456,
11510,
11511,
11529,
11530,
11559,
11560,
11589,
11590,
11627,
11628,
11816,
11817,
11826,
11827,
12037
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12037,
"ccnet_original_nlines": 386,
"rps_doc_curly_bracket": 0.010467720218002796,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10083366185426712,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00476380018517375,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.46843984723091125,
"rps_doc_frac_unique_words": 0.42900609970092773,
"rps_doc_mean_word_length": 7.157200813293457,
"rps_doc_num_sentences": 83,
"rps_doc_symbol_to_word_ratio": 0.0015879300190135837,
"rps_doc_unigram_entropy": 5.530973434448242,
"rps_doc_word_count": 986,
"rps_doc_frac_chars_dupe_10grams": 0.02295592986047268,
"rps_doc_frac_chars_dupe_5grams": 0.11449623852968216,
"rps_doc_frac_chars_dupe_6grams": 0.10854470729827881,
"rps_doc_frac_chars_dupe_7grams": 0.05469746142625809,
"rps_doc_frac_chars_dupe_8grams": 0.03939351066946983,
"rps_doc_frac_chars_dupe_9grams": 0.03939351066946983,
"rps_doc_frac_chars_top_2gram": 0.01105285994708538,
"rps_doc_frac_chars_top_3gram": 0.009352420456707478,
"rps_doc_frac_chars_top_4gram": 0.01445372961461544,
"rps_doc_books_importance": -1185.1529541015625,
"rps_doc_books_importance_length_correction": -1185.1529541015625,
"rps_doc_openwebtext_importance": -668.9801025390625,
"rps_doc_openwebtext_importance_length_correction": -668.9801025390625,
"rps_doc_wikipedia_importance": -409.5079345703125,
"rps_doc_wikipedia_importance_length_correction": -409.5079345703125
},
"fasttext": {
"dclm": 0.913187563419342,
"english": 0.4829334318637848,
"fineweb_edu_approx": 2.8295392990112305,
"eai_general_math": 0.12318742275238037,
"eai_open_web_math": 0.14532160758972168,
"eai_web_code": 0.9134742617607117
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-3,173,516,648,154,199,600 |
Riferimento Cinema 4D Funzionalità Base di Cinema 4D Menu Rendering Settaggi di Rendering
Funzione disponibile in CINEMA 4D Prime, Visualize, Broadcast, Studio & BodyPaint 3D
Settaggi di Rendering
Base Output Salva Multi-Pass Anti-Aliasing Sovrascrivi Materiale Opzioni Stereoscopico Team Render
Salva
Funzione disponibile in CINEMA 4D Prime, Visualize, Broadcast, Studio & BodyPaint 3D
Immagine Regolare
Salva
Salva automaticamente le immagini o le animazioni quando renderizzate nel Visualizzatore Immagini.
File...
Potete inserire l’intero percorso manualmente o selezionarlo cliccando su Percorso per aprire una finestra di sistema e selezionare la cartella.
Se immettete un nome senza un percorso, l’immagine o l’animazione verranno salvate nella cartella della scena attiva.
Quando usate i percorsi relativi, mettete i punti all'inizio del nome del percorso
• ./xy/beauty salva il file denominato beauty nella cartella xy del percorso di salvataggio del file di scena.
• ../xy/beauty salta di un livello nella directory, rispetto alla posizione in cui il file di scena viene salvato. In questo esempio, il file denominato beauty verrà salvato in una” cartella padre” chiamata xy.
Questo funziona praticamente ovunque in Cinema 4D, laddove è possibile inserire un percorso di file (ad esempio, il percorso di una bitmap in un materiale o un file audio in un Effettuatore Suono).
Nell’impostare il percorso, tenete in considerazione questo consiglio, in modo da evitare problemi con i nomi dei file quando spostate questi ultimi da un sistema operativo ad un altro. Utilizzate un massimo di 22 caratteri per il nome del file. Ad esempio, macOS 9.1 ha i seguenti limiti: la lunghezza del nome del file può arrivare fino a 31 caratteri, quattro per l’estensione (ad esempio, *.tif) e cinque per la numerazione sequenziale, quando si produce una sequenza di frame (ad esempio, _0023). Inoltre, usate i caratteri che seguono solo nel nome file: A - Z, a - z, 0-9, _. Alcuni caratteri speciali potrebbero funzionare, ma si consiglia di non usarli per garantire la massima compatibilità.
Suggerimento:
Usate Nomi di Variabili di Percorso o File se desiderate che il nome del file e del percorso si riferiscano automaticamente al nome del progetto o alla risoluzione del rendering definita; in questo modo non sarà necessario cambiare il nome file o di percorso ogni volta che renderizzate con una risoluzione diversa (ad esempio per evitare di sovrascrivere file esistenti).
Formato
Questo pulsante appare disabilitato finché non selezionate un formato AVI Movie o QuickTime Movie (Windows e Macintosh).
Se cliccate su questo pulsante, si apre una finestra che vi dà accesso alle varie opzioni dei codec. Se questa finestra non appare, assicuratevi di aver installato l’ultima versione di QuickTime. (visita www.quicktime.com).
Le opzioni sono elencate sotto. A seconda del formato scelto, cliccare sulla freccina a sinistra del settaggio Formato renderà disponibili le opzioni di tale formato per le diverse modifiche (come la compressione JPEG o i codici per i formati video). Maggiori info su questi formati e sui loro settaggi si trovano qui.
Quanto segue si applica ai formati RLA/RPF:
Il formato RPF è un ulteriore sviluppo del formato RLA. Entrambi i formati possono essere utilizzati per assegnare numerosi canali ad un’immagine, che saranno poi utilizzati dalle applicazioni di compositing come After Effects® o Cumbustion®.
Il formato RPF contiene i seguenti canali (RLA contiene solo i canali da Z a Copertura):
Z
Informazioni su camera <-> distanza oggetto. Utile per effetti di profondità di campo.
Oggetto
Attiva materiali diversi da usare nel post-editing.
Coordinate UV
Informazioni sulle coordinate UV in modo che le nuove texture possano essere mappate correttamente durante il post editing.
Normale
Informazioni sulla direzione riguardanti oggetti e texture.
Colore Non Immobilizzato
Informazioni sul colore dell’oggetto. Può estendersi oltre la gamma RGB.
Copertura
Informazioni sull’antialiasing dei contorni dell’oggetto.
ID Oggetto (solo RPF)
Attiva una chiara identificazione degli oggetti.
Colore (solo RPF)
Informazioni sul colore dell’oggetto.
Trasparenza (solo RPF)
Informazioni sulla trasparenza dell’oggetto.
Peso Sottopixel
Informazioni sul colore dei sottopixel.
Maschera Sottopixel
Informazioni che collegano i sottopixel ai loro oggetti.
Profondità
Definisce la profondità di bit per canale di colore. Selezionate 8 bit per canale (per colore a 24 bit), 16 bit per canale (per colore a 48 bit) o 32 bit per canale (per colore a 96 bit). I formati di file che supportano fino a 16 bit per canale sono TIFF, PSD, RPF, RLA e B3D.
Una lista di tutti i colori profondità supportati per ogni formato e altri dettagli possono essere trovati qui.
HDRI Formats
Nota
Qui di seguito vengono discusse le immagini HDR. Non si tratta solo di "radianza (HDR)", ma include anche OpenEXR e tutti gli altri formati in grado di gestire immagini con una elevato range dinamico.
La versione standard di Cinema 4D può esportare, caricare e renderizzare immagini HDR (cioè, se volete utilizzare la texture HDRI per riflessioni).
Vi permette di avere pieno vantaggio del massimo colore e lucentezza mentre esportate le vostre immagini da Cinema 4D. Inizialmente, Cinema 4D renderizza sostanzialmente colori e luminosità più alti (98-Bit / pixel) che possono essere realizzati su un convenzionale formato immagine RGB.
Questi limiti non esistono per le immagini renderizzate al formato HDRI.
I seguenti formati sono abilitati a leggere questa profondità di colore:
Usando queste applicazioni che possono lavorare con questi formati troverete grandi vantaggi.
Cosa c’è di buono in tutto questo?
Ebbene, ci sono diversi utilizzi:
1. I formati HDR possono essere usati come formati di elaborazione foto durante il montaggio. Di solito, monitor e stampanti comuni non possono visualizzare questa profondità di colore; essi utilizzano profondità di colore convenzionale.
Uno degli svantaggi della profondità colore convenzionale é il limite di luminosità. Per esempio, un valore RGB di 255, 255, 255 per il colore bianco é perfetto. Supponiamo vogliate oscurire l’immagine nella post-produzione che contenga una area bianca, per esempio una superficie illuminata in modo brillante dalla luce del sole attraverso una finestra. L’area bianca diventerà grigia, anche se il colore attuale della superficie dovrebbe partire mostrano il bianco.
Sopra, l’immagine originale; centro, l’immagine originale oscurata in photoshop prodotta come TIFF; sotto, l’immagine originale prodotta in 32-bit, oscurata usando il software appropriato.
Come potete vedere nell’esempio sotto l’immagine HDR può essere oscurata (utilizzando il settaggio di Cinema 4D Esposizione senza preoccuparsi che la superficie ritorni grigia, come nel caso dei formati d’immagine convenzionale. La scena sopra è messa esclusivamente per GI con una luminosità a (400%).
La rappresentazione delle immagini HDR é solamente un’interpretazione del dato del colore che non può essere attualmente rappresentata con la tecnologia convenzionale.
Verrà utilizzato un modo HDR anti-aliasing speciale, quando renderizzate un’immagine HDR in picture viewer o nella visuale dell’editor. A prima vista, l’immagine risulterà imperfetta. Ciò é dovuto al fatto che la vista dell’immagine deve essere ridotta alla limitata gamma di colori del vostro monitor. Se si renderizza utilizzando un formato convenzionale, l’immagine sarà perfettamente in antialiasing, poiché l’antialiasing prende effetto quando la profondità del colore viene ridotta a 8-Bit o a 16-Bit. L’anti-aliasing a 32-bit é renderizzato senza limitazioni di colori, cioé un pixel uniforme può possedere un valore di luminosità maggiore del 100%,quindi esso potrà essere rappresentato come bianco.
Un corretto anti-aliasing a 32-bit non sarà visibile ma é internamente presente.
2. I formati immagine HDR (in particolare i formati HDR: (Radiosity) HDR e OpenEXR) possono essere usati per renderizzare riflessioni chiare. Per esempio, collocando semplicemente l’immagine 32-bit in un canale materiale dell’oggetto Cielo Luminosità.
Quando viene renderizzato, Cinema 4D prenderà in considerazione il livello di luminosità.
3. I formati immagine HDR (in particolare i formati HDR:(Radiosity) HDR e OpenEXR) sono validi per utilizzare ciò che viene chiamato Immagine Basata sull’Illuminazione, cioé l’illuminazione delle scene attraverso IG, esclusivamente con le texture, senza l’utilizzo di fonti di luce.
I classici formati di HDR.
Entrambi i formati classici di HDR (in base ai quali il termine classico é relativo nel mondo sempre più veloce dell’ IT ), il Radiosity (HDR) e OpenEXR, che vengono utilizzati in numerosi rendering, sono ora supportati da Cinema 4D.
Il radiosity HDR é il più vecchio tra i due formati e verrà, nell’eventualità, piacevolmente sostituito da OpenEXR. Anche se OpenEXR dimostra meno dinamicità comparato con HDR (Radiance) (il quale non é di base pertinente nell’uso quotidiano, altrimenti, OpenEXR non verrebbe utilizzato in così tante produzioni a Hollywood) esso può essere compresso in un file di piccole dimensioni.
Radiance (HDR)
HDR vi permette di salvare in un speciale modo a 32-bit. La Radianza (HDR) possiedono una vasta ampiezza dinamica, più che in natura. Questo é il motivo per il quale i file HDR sono spesso molto pesanti.
Tuttavia, molte biblioteche di texture HDR sono disponibili nel formato Radiosità (HDR).
OpenEXR
Questo formato fu sviluppato da ILM (Industrial Light & Magic) e può essere compresso ad un elevato grado, nonostante la sua vasta ampiezza dinamica.
Con l’introduzione di Cinema 4D R13 sono supportati anche i file con canali multipli. Al contrario dei reali file Multi-Pass che contengono livelli multipli che sono ricoperti con una modalità mix, OpenEXR riconosce solo i canali senza modi mix (per creare livelli per questi canali si devono utilizzare delle applicazioni di compositing). Cinema 4D cercherà comunque di creare livelli in base ai nomi dei canali durante l’importazione.
Cliccando in Opzioni verranno rese disponibile diverse opzioni:
Invece di tediarvi con dettagli tecnici vi daremo una descrizione generale. I metodi di compressione disponibili potrebbero causare una perdita dei dati riguardanti il colore o meno (vedi i primi 5 nella lista sotto) e mantenere l’intero ambito dinamico.
In particolare non devono essere utilizzate immagini che necessitano di un gran numero di editing, in quanto esse potrebbero comportare scale di colori imprecise o limitate.
Il metodo di compressione migliore per il vostro progetto deve essere accertato facendo delle prove, in modo da determinare il miglior compromesso tra qualità, dimensioni del file e velocità nell’editing.
Funzione disponibile in CINEMA 4D Prime, Visualize, Broadcast, Studio & BodyPaint 3D
Nome
Molti programmi di editing accettano sequenze di immagini. Tuttavia, tendono ad utilizzare convenzioni differenti per i nomi.
Alcuni programmi utilizzano nomi di file che terminano con un numero, altri con un’estensione. Altri ancora possono lavorare solo con numeri di tre cifre.
Utilizzate questo menu per impostare la numerazione sequenziale e/o lo stile dei caratteri richiesti dal vostro editor. Nell’esempio sotto, 0000 rappresenta un numero sequenziale qualsiasi, TIF l’estensione a tre lettere.
Name0000.TIF es. risultato: Test1234.JPG,
Name0000 es. risultato: Test1234,
Name.0000 es. risultato: Test.1234,
Name000.TIF es. risultato: Test123.TGA
Name000 es. risultato: Test123,
Name.000 es. risultato: Test.123.
Profilo Colore Immagine
Con questo settaggio è possibile definire quale profilo colore deve essere incorporato nell’immagine/texture. Nelle versioni precedenti alla R12, Cinema 4D salvava automaticamente utilizzando il profilo colore sRGB. Il profilo colore può essere ora del colore desiderato. Tuttavia, è consigliato apportare delle modifiche a questi settaggi solo se assolutamente necessario.
Notate che molti programmi non possono leggere profili colore (ad esempio, Windows 7 riesce a leggerli solo parzialmente).
Quando utilizzate il Workflow Lineare assieme ai Mult-Pass, vi raccomandiamo di renderizzare con una profondità di campo di almeno 16-bit. Se ciò non è possibile, disattivate l’opzione Workflow Lineare per ripristinare le normali proprietà di Cinema 4D R12 (motivo: i Multi-Pass sono salvati con un profilo lineare.
Ulteriori informazioni riguardanti la Gestione Colore possono essere trovate in Gestione Colore.
Generalmente parlando, il profilo sRGB di default è quello corretto.
Cliccando sul pulsante a destra si renderà disponibile il seguente menu per la selezione:
Gestione Colore disattiva
Non sarà incorporato alcun profilo colore (e sarà letto in base ai Parametri Progetto o dei settaggi shader bitmap, quando il file sarà aperto).
Carica/Salva
Qui potete caricare un profilo colore o salvarne uno esistente. Questi file hanno l’estensione "*.icc". Se un’immagine viene caricata qui, sarà assunto il suo colore profilo.
Carica da Monitor
Potete utilizzare i profili monitor (hardware). Tuttavia, ciò non è raccomandato dal momento che il profilo colore del vostro monitor non sarà mai uguale a quello di un altro.
sRGB
Salva l’immagine con il profilo colore sRGB.
Lineare
Salva l’immagine con un profilo colore lineare.
Canale Alfa
Se abilitate questa opzione, un canale alfa pre-moltiplicato verrà calcolato durante il rendering.
Il canale alfa è un’immagine in scala di grigi della stessa risoluzione della vostra immagine a colori. I pixel nel canale alfa sono bianchi o neri. Un pixel bianco nel canale alfa indica la presenza di un oggetto in quella posizione dell’immagine mentre un pixel nero indica che non c’è nessun oggetto.
Potete utilizzare il canale alfa per il compositing nei programmi di video editing. Ad esempio, supponete di avere una fotografia di un aeroporto e di voler renderizzare un aereo e posizionarlo sulla pista. Renderizzate l’aereo con il canale alfa in Cinema 4D, quindi utilizzate quel canale nel vostro programma di compositing per tagliare le parti non interessate dall’aereo in modo che venga visualizzato l’aeroporto dietro. I bordi del canale alfa sono in antialiasing per assicurare una transizione morbida dell’immagine composita.
L’alfa pre-moltiplicato ha una limitazione particolare, illustrata di seguito.
Da sinistra a destra: l’immagine renderizzata, il canale alfa, il risultato.
Nell’immagine sopra, il canale alfa produce un segno scuro. Questo perché sia l’immagine che il canale alfa sono stati renderizzati con antialiasing. Per definizione, l’immagine colorata e il canale alfa devono essere moltiplicati, così il nero viene calcolato due volte. Potete evitare questo problema utilizzando l’opzione Alfa Semplice. Notate che questa è adatta solo al compositing e non è utilizzabile come immagine convenzionale.
L’intero canale alfa viene mascherato se utilizzate un oggetto Cielo, Pavimento o Sfondo nella vostra scena. Non utilizzate nessuno di questi oggetti se avete bisogno del canale alfa.
Se avete abilitato l’opzione Separa Alfa o se avete selezionato un formato immagine diverso, il canale alfa viene salvato separatamente dall’immagine a colori. Questi file vengono indicati con il prefisso A_ prima del nome del file, ad esempio A_stanza.tif. Gli alfa separati vengono salvati in formato TIFF.
Il canale alfa può essere integrato all’interno di un filmato solo se i canali alfa vengono supportati dal codec selezionato.
Alfa Semplice
Potete utilizzare questa opzione se è supportata nel vostro programma di compositing per evitare i segni scuri associati agli alfa premoltiplicati. Notate che gli alfa semplici sono adatti solo al compositing, non possono essere usati per immagini convenzionali.
Da sinistra a destra: l’immagine renderizzata, il canale alfa, il risultato.
Suggerimento:
Non utilizzate le virgolette (") nelle denominazioni.
Le versioni di Cinema 4D precedenti alla R11.5 trattavano le superfici piatte trasparenti (mascherate con maschere alfa o con canali trasparenza) in maniera differente a seconda dell’output del canale alfa.
Esempio: Un materiale con una maschera alfa è stato utilizzato per creare un foro in un piano che è posizionato con una larga sfera che viene utilizzata come sfondo. Il risultato renderizzato è mostrato sulla sinistra dell’immagine sotto. prendiamo in considerazione che adesso si voglia emettere la scena come un canale Alfa nel quale viene incluso solo il piano con il foro. per fare ciò, assegnate un tag Compositing allo sfondo (nel nostro esempio la sfera). nelle versioni precedenti di Cinema 4D tutto ciò che dovevate fare era disattivare l’opzione Visibile dalla Camera. Nella versione R11.5 (e superiori) dovete anche disattivare l’opzione Visto dalla Trasparenza in modo di generare il canale Alfa visualizzato sulla destra dell’immagine sotto:
Per generare un canale Alfa come mostrato sula destra, entrambe le opzioni sopra menzionate devono essere disattivate nel tag Compositing.
La ragione è che essi si trovano nell’ottimizzatore del rendering, il quale ora calcola le superfici piatte trasparenti (incluse le maschere Alfa) utilizzando il raytracer. Il raytracer deve dire esplicitamente al tag Compositing che lo sfondo dietro all’oggetto trasparente non deve essere visibile.
Funzione disponibile in CINEMA 4D Prime, Visualize, Broadcast, Studio & BodyPaint 3D
Alfa Separato
I canali alfa vengono integrati automaticamente nei file in formati immagine alfa, ossia vengono salvati come parte del file immagine. Tuttavia, se volete salvare il canale alfa come file separato, attivate questa opzione. Oltre alla vostra immagine a colori (es. stanza.tif), avrete un file contenente il canale alfa (es. A_stanza.tif).
I file di canali alfa separati saranno salvati nello stesso formato immagine delle immagini renderizzate (Formato).
Dithering 8 Bit
Il dithering è un processo che aggiunge una retinatura ai colori per prevenire problemi nell’immagine. Nonostante il dithering migliori la qualità dell’immagine, esso aumenta anche la dimensione del file. Per la grafica web in particolare, è meglio disabilitare questa opzione per ridurre la dimensione dell’immagine.
Includi Suono
Se uno dei formati video sopra citati viene selezionato, il Suono sarà usato per integrare un file suono nel video.
Suggerimento:
Nota: Non funziona con il Team Render!
Funzione disponibile in CINEMA 4D Prime, Visualize, Broadcast, Studio & BodyPaint 3D
Immagine Multi-Pass
Salva
Il Rendering Multi Pass facilita la post produzione dei vostri rendering in software di compositing come Adobe After Effects, Photoshop e Combustion. Con multi pass potete dividere il rendering di Cinema 4D in livelli separati come ad esempio ombre, riflessioni, luci e ciascuna sorgente luce. Potete salvare questi livelli in RLA, RPF, Photoshop (PSD) e BodyPaint 3D (B3D).
Supponete di aver renderizzato un filmato complesso e che le riflessioni siano troppo forti. Con multi pass non c’è bisogno di renderizzare nuovamente la scena Cinema 4D. Potete ridurre semplicemente l’opacità del livello delle riflessioni nel vostro software di compositing, oppure includere un parametro alternativo di luci nello stesso rendering. Potrete quindi scegliere il risultato migliore durante la post produzione.
Multi-pass è l’ideale per provare varie situazioni di luce per il vostro rendering. Queste situazioni saranno renderizzate più velocemente come un singolo multi-pass piuttosto che progetti separati.
Suggerimento:
Nell’effettuare un rendering Multi-Pass ver NET a un percorso relativo, non deve essere definito un percorso assoluto.
File
Qui potete impostare il percorso di salvataggio del file.
I file multi livello richiedono molto più spazio di quelli a livello singolo. Prima di renderizzare, controllate di avere spazio a sufficienza sul disco, specialmente quando renderizzate animazioni multipass.
Un percorso relativo deve essere inserito qui nel momento in cui si effettua un rendering con Team Render.
Formato
Opzioni..
Questo pulsante è oscurato, a meno che il formato scelto non abbia opzioni extra. Per accedervi, cliccate su Opzioni.
File
Questo percorso definisce dove saranno salvate le immagini o le animazioni renderizzate. Notare che in particolare per le animazioni sarà selezionata una posizione che abbia lo spazio sufficiente per contenere l’intera animazione.
Suggerimento:
Usate Nomi di Variabili di Percorso o File per associare automaticamente il nome file o di percorso ad esempio con il tipo di multipass definito.
Vedi anche File qui sopra in riferimento ai nomi File e Percorso.
Maggiori dettagli su questi formati e sui loro settaggi si trovano qui.
Profondità
Qui potete impostare la profondità canale a 8 bit, a 16 bit o a 32 bit.
Funzione disponibile in CINEMA 4D Prime, Visualize, Broadcast, Studio & BodyPaint 3D
File Multi-Livelli
Se questa opzione è abilitata, tutti i livelli vengono salvati in un file multi livello. Inoltre, dovete impostare il formato nella pagina Uscita in Photoshop (PSD), RLA, RPF o BodyPaint 3D (B3D) o TIFF. Se l’opzione è disabilitata, Cinema 4D crea un file separato per ogni pass utilizzando il Formato impostato nella pagina Salva. Un suffisso viene aggiunto ad ognuno dei nomi di file per differenziarli.
L’immagine può sembrare diversa se visualizzata in un’altra applicazione, a seconda delle modalità blend supportate. Ad esempio, Photoshop non ha il modo Aggiungi, così le highlight possono sembrare salvate e aver bisogno di correzioni. Si possono riscontrare differenze anche quando si usa una combinazione di luci colorate, specialmente utilizzanto valori di Luminosità superiori al 100%.
Suggerimento 2:
Notate che i multi-livelli a 32-bit possono essere problematici se utilizzati con l’opzione Workflow Lineare disattiva, poiché Photoshop importa correttamente i file *.psd e non può visualizzarli correttamente. Non appena si attiva Workflow Lineare o si utilizzano altre profondità bit, esso lavorerà correttamente.
Nome Livello come Suffisso
Se il formato selezionato non supporta i multi livelli, ciascun livello verrà salvato come un file separato. Se questa opzione è abilitata, il nome del livello, come ad esempio _diffusione o _rifrazione viene aggiunto dopo il nome del file.
Utente Definito Nome Livello
Se questa opzione è attiva, sarà usato il nome che avete definito per il Multi-Pass (doppio clic sul nome del Multi-Pass per rinominare) anzichè il nome del Multi-Pass predefinito.
Alfa Semplice
Questa opzione è disponibile solamente se avete attivato l’opzione Canale Afa. Non fa alcuna differenza se avete attivato o no Alfa Semplice.
Con l’opzione Semplice (Alfa Non-Moltiplicato) (tab Multi-Pass) potete definire se i corrispondenti multi-pass dovranno essere pre-moltiplicati oppure no, in riferimento al canale alfa salvato.
Compositing File Progetto
Un file compositing progetto è costituito da più livelli. Ciascun livello può essere modificato separatamente.
Cinema 4D supporta i seguenti programmi di video compositing:
• Adobe After Effects (CS3 o superiore): file Multi-Pass, dati camera, luci e Oggetti Nulli (vedere anche After Effects per quanto riguarda le varie possibilità di scambio).
• Foundry Nuke (testato per versione 6.3 e superiori): fiie Multi-Pass files. Dati Camera, luci, oggetti tramite file FBX separati.
• Apple Final Cut Pro (4.0 o superiore, solo versione Cinema 4D Mac): file Multi-Pass.
• Apple Motion versione 3: dati camera, luci e oggetti come oggetti NULLI.
• Apple Shake versioni 3.5 e 4: file Multi-Pass.
• eyeon’s Digital Fusion a partire dalla versione 5.0: file Multi-Pass.
Cinema 4D è in grado di renderizzare più multi pass salvandoli come file separati (bitmap o video). I pass possono poi essere caricati in uno dei pacchetti compositing elencati sopra. Nel pacchetto compositing potete modificare i pass separatamente, applicando molteplici effetti.
Altre applicazioni compositing possono aprire il file senza dover fare il plugin.
Potete esportare anche camere e luci di Cinema 4D, animazione inclusa, e modificarle in After Effects (da 5.5 in su) o Combustion.
Sono supportati i seguenti dati di camera:
• posizione camera
• orientamento camera
• lunghezza focale
• distanza camera dal target (sempre che la scena Cinema 4D usi una telecamera target).
• Sono supportati i seguenti tipi di luce:
• Punto
• Parallela
• Spot.
Esportare i multi pass
Per esportare i multi pass da Cinema 4D:
1. Nei Settaggi di Rendering, alla pagina Multi Pass, usate la lista Canali per scegliere i pass da renderizzare. Disattivate l’opzione File Multi-Livelli (ogni pass deve essere salvato come un file separato) nella tab Salva.
Impostate l’opzione Formato sul formato file desiderato, come QuickTime Movie.
Impostate l’opzione Percorso sul percorso di salvataggio dei pass.
2. Assicurati che l’opzione Salva nel sottomenu Multi-Pass sia attiva e scegli l’applicazione di compositing. Renderizza l’immagine o l’applicazione Seleziona lo stesso percorso di salvataggio come per qualsiasi immagine così anche per il file compositing va inserito nella stessa directory con tutti i relativi file.
Se Relativo è abilitato (pagina Salva), verrà trasferito anche il tempo di inizio e fine dell’animazione Cinema 4D (solo con After Effects, versione 6.5 o superiore). Altrimenti, le animazioni inizieranno sempre dal fotogramma 0 nel programma di compositing.
Salva File FBX
Se create un file compositing per Nuke, esso non potrà contenere informazioni 3D per le camere, le luci o gli oggetti. Se questa opzione è attiva, queste informazioni potranno essere estratte dal file FBX. Sarà generato un nuovo file FBX separato.
Premendo il tasto Salva File Progetto... vi sarà permesso di creare un file compositing senza dover renderizzare l’intera scena. Comunque, ciò ha senso solo se tutti i pass sono già stati renderizzati. Ad esempio, se avete già renderizzato un’animazione completa utilizzando il Team Render, inclusi tutti i Multi-Pass, potete premere questo tasto per generare il file compositing corretto.
Notare tuttavia che il renderer deve ancora essere avviato in background, il che può richiedere molto tempo quando si utilizza il renderer fisico. È possibile aggirare il problema utilizzando il renderer standard, che richiede un tempo di preparazione più breve.
3. Importate il file multi pass in uscita da Cinema 4D nella vostra applicazione di compositing.
Il progetto in Cinema 4D.
After Effects
Nota:
Notare che After Effects è progettato per l’utilizzo con Scambio descritto sopra al punto 2.
In After Effects, importare il file .aec (File / Importa / File).
Il Progetto in After Effects.
Per After Effects è necessario copiare il seguente plugin (posizionato nella directory programma Cinema 4D nella cartella "Cambia Plugins/aftereffects/importa"; selezionate quello che corrisponde al vostro sistema operativo e la versione di After Effects) nella directory plugin After Effects (se essa non esiste, utilizzate la cartella "Effetto"):
• PC: "C4Dimporter.aex"
• macOS: "C4Dimporter.plugin" (prima può dover essere decompresso)
Altre applicazioni possono caricare i dati senza un plugin.
Funzionalità aggiuntive:
• La densità delle ombre assegnate alle sorgenti di luce possono essere esportate (animate)
• Lo "stato di rendering" nella Gestione Oggetti sarà presa in considerazione. Nel seguente esempio, sarà esportato solo l’oggetto 2:
• Tutte le camere esistenti saranno esportate (se non è stato disattivato nello "stato di rendering" sopra descritto)
• XRefs sono supportati (e saranno esportati)
• denominazione logica delle luci e delle directory in After Effects
• Vedere anche qui
• La stereoscopia è supportata: saranno caricati canali e Multi-Pass stereoscopici (vedere anche Stereoscopia) in After Effects con una corretta combinazione e nominati chiaramente.
• L’oggetto Stage sarà valutato a seconda delle camere.
Vedere After Effects per ulteriori informazioni riguardanti la connettività tra After Effects e Cinema 4D.
• Sono supportati il colore, la densità ombra e l’angolo e l’intensità dell’angolo delle sorgenti di luce.
• E’ supportato Unicode.
Suggerimento:
Assicuratevi che il colore Spazio Lavoro "Lineare" (il quale lavora solo se esiste un colore spazio lavoro; che deve essere impostato a sRGB) sia attivo in After Effects quando utilizzate Workflow Lineare.
Motion
Nuke
Aprite il corrispondente file *.nk:
Final Cut Pro
In Final Cut Pro, importate il file .xml (File / Importa / XML) e ignorate il messaggio di avviso che compare.
Il progetto in Final Cut Pro.
Digital Fusion
Utilizzate il comando Apri per aprire un file *.comp esportato da CINEMA
Includi Marcatore Timeline
Se avete settato Marcatori nella Timeline, questi saranno inclusi nel file di compositing, incluso il loro nome.
Includi dati 3D
Usate questo parametro per stabilire se devono essere esportati camere, luci o oggetti. Gli oggetti diversi da luci e camere saranno esportati come Oggetti Nulli se è stato assegnato loro un tag Compositing Esterno (vedere sotto).
Relativo
Supponiamo che la vostra scena contenga due camere animate. La prima è animata dal fotogramma 20 al fotogramma 50, la seconda dal 2 al 117. Il parametro Relativo viene usato per decidere tra quali fotogrammi deve svilupparsi l’animazione nell’applicazione di compositing: tra 20 e 50 o 2 e 117 (Relativo attivo) oppure tra 0 e 30 o 0 e 115 (Relativo non attivo, l’animazione inizia al fotogramma 0). Naturalmente, questo parametro non è limitato alle camere animate.
I filmati verranno importati più velocemente rispetto alle sequenze di immagini.
I programmi di compositing importeranno la composizione correttamente ammesso che il programma sia nello stesso computer in cui si trova Cinema 4D. Importando in After Effects, il file compositing progetto deve trovarsi nella stessa cartella dei pass; altrimenti, le sequenze di immagini o i video dovranno essere sostituiti manualmente.
Informazioni Generali
I programmi di Compositing importano composizioni senza ulteriori difficoltà se Cinema 4D e il programma utilizzato per il compositing sono situati nello stesso computer. In caso contrario i file compositing e tutti i file collegati dovrebbero essere posizionati nella stessa directory (applicato ad After Effects) o il video/immagine deve essere copiato manualmente nel programma compositing.
Limitazioni
• NET non può scrivere il file di compositing del progetto. Per il rendering in rete, generate il file di progetto manualmente cliccando il pulsante Salva alla pagina Salva dei Settaggi di Rendering. Potete salvare il file progetto in qualsiasi momento, anche prima di aver renderizzato i pass. I pass mancanti sono rappresentati da frame stand-in in After Effects, che potranno essere sostituiti in qualsiasi momento.
Salva
Definisce se i file di compositing dovranno essere salvati oppure no (non funziona quando renderizzate via Team Render)
Applicazione Target
Selezionate l’applicazione di compositing di destinazione. Cinema 4D produrrà il file di compositing nel formato corretto in modo automatico.
Salva File Progetto...
Vi permette di creare file per il "compositing" senza dover renderizzare l’intera scena. Comunque, questo procedimento ha senso solo se avete già renderizzato tutti i pass.
Se avete già renderizzato un’ animazione abbastanza ampia, inclusi i Multi-Pass, utilizzando il NET Render, cliccando questo pulsante creerete i corrispondenti file di compositing.
Notate tuttavia, che il renderizzatore deve ancora essere avviato in background, il che può impiegare un bel po’ di tempo se usate il renderer fisico. È possibile aggirare il problema utilizzando il renderer standard, che richiede tempi di preparazione molto più brevi.
|
{
"url": "https://help.maxon.net/it/html/DRENDERSETTINGS-RDATA_GROUP_SAVE.html",
"source_domain": "help.maxon.net",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "58336",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7B7LWO2A7KISFBUXTF3YDTJOPNYFG5UF",
"WARC-Concurrent-To": "<urn:uuid:9b29bd05-74bd-4029-aa57-a263cbda696d>",
"WARC-Date": "2020-07-16T18:23:15Z",
"WARC-IP-Address": "88.99.93.218",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FG2ISB4WL5RVP3M6VBQLUUI3NY7RL4M7",
"WARC-Record-ID": "<urn:uuid:725b864b-b8cb-4f5d-b52e-016193137631>",
"WARC-Target-URI": "https://help.maxon.net/it/html/DRENDERSETTINGS-RDATA_GROUP_SAVE.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b68dfa1c-b339-4d20-9b4a-56c7497c2c38>"
},
"warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-211.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
90,
175,
197,
198,
297,
298,
304,
305,
390,
391,
410,
411,
417,
418,
517,
518,
526,
527,
672,
673,
791,
792,
875,
876,
989,
1202,
1203,
1401,
1402,
2104,
2105,
2119,
2492,
2493,
2501,
2502,
2623,
2624,
2848,
2849,
3168,
3169,
3213,
3214,
3457,
3458,
3547,
3548,
3550,
3551,
3638,
3639,
3647,
3648,
3700,
3701,
3715,
3716,
3840,
3841,
3849,
3850,
3910,
3911,
3936,
3937,
4010,
4011,
4021,
4022,
4080,
4081,
4103,
4104,
4153,
4154,
4172,
4173,
4211,
4212,
4235,
4236,
4281,
4282,
4298,
4299,
4339,
4340,
4360,
4361,
4418,
4419,
4430,
4431,
4709,
4710,
4822,
4823,
4836,
4837,
4842,
5043,
5044,
5192,
5193,
5481,
5482,
5555,
5556,
5629,
5630,
5724,
5725,
5760,
5761,
5795,
5796,
6036,
6037,
6509,
6510,
6703,
6704,
7011,
7012,
7184,
7185,
7897,
7982,
7983,
8237,
8331,
8332,
8617,
8618,
8645,
8646,
8880,
8881,
9266,
9267,
9282,
9283,
9487,
9488,
9577,
9578,
9586,
9587,
9737,
9738,
10175,
10176,
10240,
10241,
10496,
10497,
10671,
10672,
10877,
10878,
10963,
10968,
10969,
11095,
11096,
11251,
11252,
11474,
11475,
11517,
11518,
11552,
11553,
11589,
11590,
11629,
11630,
11662,
11663,
11697,
11698,
11722,
11723,
12097,
12098,
12221,
12222,
12538,
12539,
12636,
12637,
12706,
12707,
12797,
12798,
12824,
12825,
12970,
12971,
12984,
12985,
13160,
13161,
13179,
13180,
13356,
13357,
13362,
13363,
13408,
13409,
13417,
13418,
13466,
13467,
13479,
13480,
13579,
13580,
13884,
13885,
14421,
14422,
14501,
14502,
14579,
14580,
15017,
15018,
15202,
15203,
15512,
15513,
15639,
15640,
15654,
15655,
15918,
15919,
15996,
15997,
16011,
16065,
16066,
16273,
16274,
17029,
17030,
17169,
17170,
17471,
17472,
17557,
17571,
17572,
17910,
17911,
18027,
18028,
18044,
18045,
18363,
18364,
18378,
18379,
18495,
18496,
18510,
18549,
18550,
18635,
18636,
18657,
18658,
18664,
18665,
19040,
19041,
19466,
19467,
19666,
19667,
19681,
19800,
19801,
19806,
19807,
19865,
19866,
20075,
20076,
20183,
20184,
20192,
20202,
20203,
20321,
20322,
20327,
20328,
20559,
20560,
20574,
20720,
20721,
20787,
20788,
20860,
20861,
20872,
20873,
20945,
20946,
21031,
21050,
21051,
21457,
21458,
21849,
21850,
21866,
22182,
22183,
22210,
22211,
22452,
22453,
22482,
22483,
22664,
22665,
22679,
22680,
22822,
22823,
23017,
23018,
23045,
23046,
23157,
23158,
23220,
23221,
23397,
23531,
23620,
23697,
23748,
23822,
23823,
24104,
24105,
24187,
24188,
24319,
24320,
24363,
24364,
24385,
24409,
24430,
24520,
24565,
24566,
24576,
24590,
24600,
24601,
24624,
24625,
24666,
24667,
24668,
24896,
24897,
24980,
24981,
25052,
25053,
25373,
25374,
25375,
25638,
25639,
25640,
25659,
25911,
25912,
25913,
26307,
26574,
26575,
26576,
26675,
26676,
26702,
26703,
26717,
26718,
26724,
26817,
26818,
26884,
26885,
26915,
26916,
27265,
27266,
27292,
27361,
27362,
27422,
27423,
27448,
27449,
27543,
27679,
27799,
27847,
27918,
27939,
28123,
28181,
28182,
28289,
28290,
28399,
28426,
28427,
28441,
28647,
28648,
28655,
28656,
28661,
28662,
28698,
28699,
28713,
28714,
28825,
28826,
28856,
28857,
28872,
28873,
28946,
28947,
28974,
28975,
29088,
29089,
29105,
29106,
29337,
29338,
29347,
29348,
29815,
29816,
29897,
29898,
30236,
30237,
30259,
30260,
30654,
30655,
30667,
30668,
31089,
31090,
31096,
31097,
31217,
31218,
31238,
31239,
31381,
31382,
31405,
31406,
31579,
31580,
31761,
31762
],
"line_end_idx": [
90,
175,
197,
198,
297,
298,
304,
305,
390,
391,
410,
411,
417,
418,
517,
518,
526,
527,
672,
673,
791,
792,
875,
876,
989,
1202,
1203,
1401,
1402,
2104,
2105,
2119,
2492,
2493,
2501,
2502,
2623,
2624,
2848,
2849,
3168,
3169,
3213,
3214,
3457,
3458,
3547,
3548,
3550,
3551,
3638,
3639,
3647,
3648,
3700,
3701,
3715,
3716,
3840,
3841,
3849,
3850,
3910,
3911,
3936,
3937,
4010,
4011,
4021,
4022,
4080,
4081,
4103,
4104,
4153,
4154,
4172,
4173,
4211,
4212,
4235,
4236,
4281,
4282,
4298,
4299,
4339,
4340,
4360,
4361,
4418,
4419,
4430,
4431,
4709,
4710,
4822,
4823,
4836,
4837,
4842,
5043,
5044,
5192,
5193,
5481,
5482,
5555,
5556,
5629,
5630,
5724,
5725,
5760,
5761,
5795,
5796,
6036,
6037,
6509,
6510,
6703,
6704,
7011,
7012,
7184,
7185,
7897,
7982,
7983,
8237,
8331,
8332,
8617,
8618,
8645,
8646,
8880,
8881,
9266,
9267,
9282,
9283,
9487,
9488,
9577,
9578,
9586,
9587,
9737,
9738,
10175,
10176,
10240,
10241,
10496,
10497,
10671,
10672,
10877,
10878,
10963,
10968,
10969,
11095,
11096,
11251,
11252,
11474,
11475,
11517,
11518,
11552,
11553,
11589,
11590,
11629,
11630,
11662,
11663,
11697,
11698,
11722,
11723,
12097,
12098,
12221,
12222,
12538,
12539,
12636,
12637,
12706,
12707,
12797,
12798,
12824,
12825,
12970,
12971,
12984,
12985,
13160,
13161,
13179,
13180,
13356,
13357,
13362,
13363,
13408,
13409,
13417,
13418,
13466,
13467,
13479,
13480,
13579,
13580,
13884,
13885,
14421,
14422,
14501,
14502,
14579,
14580,
15017,
15018,
15202,
15203,
15512,
15513,
15639,
15640,
15654,
15655,
15918,
15919,
15996,
15997,
16011,
16065,
16066,
16273,
16274,
17029,
17030,
17169,
17170,
17471,
17472,
17557,
17571,
17572,
17910,
17911,
18027,
18028,
18044,
18045,
18363,
18364,
18378,
18379,
18495,
18496,
18510,
18549,
18550,
18635,
18636,
18657,
18658,
18664,
18665,
19040,
19041,
19466,
19467,
19666,
19667,
19681,
19800,
19801,
19806,
19807,
19865,
19866,
20075,
20076,
20183,
20184,
20192,
20202,
20203,
20321,
20322,
20327,
20328,
20559,
20560,
20574,
20720,
20721,
20787,
20788,
20860,
20861,
20872,
20873,
20945,
20946,
21031,
21050,
21051,
21457,
21458,
21849,
21850,
21866,
22182,
22183,
22210,
22211,
22452,
22453,
22482,
22483,
22664,
22665,
22679,
22680,
22822,
22823,
23017,
23018,
23045,
23046,
23157,
23158,
23220,
23221,
23397,
23531,
23620,
23697,
23748,
23822,
23823,
24104,
24105,
24187,
24188,
24319,
24320,
24363,
24364,
24385,
24409,
24430,
24520,
24565,
24566,
24576,
24590,
24600,
24601,
24624,
24625,
24666,
24667,
24668,
24896,
24897,
24980,
24981,
25052,
25053,
25373,
25374,
25375,
25638,
25639,
25640,
25659,
25911,
25912,
25913,
26307,
26574,
26575,
26576,
26675,
26676,
26702,
26703,
26717,
26718,
26724,
26817,
26818,
26884,
26885,
26915,
26916,
27265,
27266,
27292,
27361,
27362,
27422,
27423,
27448,
27449,
27543,
27679,
27799,
27847,
27918,
27939,
28123,
28181,
28182,
28289,
28290,
28399,
28426,
28427,
28441,
28647,
28648,
28655,
28656,
28661,
28662,
28698,
28699,
28713,
28714,
28825,
28826,
28856,
28857,
28872,
28873,
28946,
28947,
28974,
28975,
29088,
29089,
29105,
29106,
29337,
29338,
29347,
29348,
29815,
29816,
29897,
29898,
30236,
30237,
30259,
30260,
30654,
30655,
30667,
30668,
31089,
31090,
31096,
31097,
31217,
31218,
31238,
31239,
31381,
31382,
31405,
31406,
31579,
31580,
31761,
31762,
32031
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 32031,
"ccnet_original_nlines": 487,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09383100271224976,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030240189284086227,
"rps_doc_frac_lines_end_with_ellipsis": 0.00409835996106267,
"rps_doc_frac_no_alph_words": 0.18040435016155243,
"rps_doc_frac_unique_words": 0.25796177983283997,
"rps_doc_mean_word_length": 5.5808916091918945,
"rps_doc_num_sentences": 307,
"rps_doc_symbol_to_word_ratio": 0.0005183999892324209,
"rps_doc_unigram_entropy": 6.1348185539245605,
"rps_doc_word_count": 4710,
"rps_doc_frac_chars_dupe_10grams": 0.0308148805052042,
"rps_doc_frac_chars_dupe_5grams": 0.0642927810549736,
"rps_doc_frac_chars_dupe_6grams": 0.05158640071749687,
"rps_doc_frac_chars_dupe_7grams": 0.04489082098007202,
"rps_doc_frac_chars_dupe_8grams": 0.04078216850757599,
"rps_doc_frac_chars_dupe_9grams": 0.03773872181773186,
"rps_doc_frac_chars_top_2gram": 0.011869439855217934,
"rps_doc_frac_chars_top_3gram": 0.005934719927608967,
"rps_doc_frac_chars_top_4gram": 0.006162980105727911,
"rps_doc_books_importance": -2905.241943359375,
"rps_doc_books_importance_length_correction": -2905.241943359375,
"rps_doc_openwebtext_importance": -1525.181396484375,
"rps_doc_openwebtext_importance_length_correction": -1525.181396484375,
"rps_doc_wikipedia_importance": -1213.52294921875,
"rps_doc_wikipedia_importance_length_correction": -1213.52294921875
},
"fasttext": {
"dclm": 0.42640089988708496,
"english": 0.0018303300021216273,
"fineweb_edu_approx": 1.0461663007736206,
"eai_general_math": 0.00008214000263251364,
"eai_open_web_math": 0.5671975016593933,
"eai_web_code": 0.4231857657432556
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "778.9",
"labels": {
"level_1": "Arts",
"level_2": "Photography",
"level_3": "Cinematography"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
7,829,084,390,541,085,000 |
/srv/irclogs.ubuntu.com/2009/01/28/#ubuntu-mythtv.txt
afmis the mythtv usb recording feature in trunk AND -fixes? more specifically for the hdpvr00:02
MezBLZ: thats a link to a video of Daviey doing a talk about mythbuntu00:04
BLZaah cool00:07
BLZtgm4883: you still there? I have a slight issue with the new poster directory00:13
BLZI changed the poster directory from /home/mythtv/.mythv/etc... to /var/lib/mythtv/posters. Everything works, except that mythweb's video section doesn't show movie posters... what gives?00:18
afmare the mythbuntu default directories the same as upstream svn? such that a ./configure wouldn't need any crazy flags?00:23
afmhttp://mythbuntu.pastebin.com/d5c98e81d00:40
afmfresh install...reboot...updated fully..reboot...upgraded to trunk....00:41
afmdist-upgrade....moving along00:52
afmarrrrrrg00:58
afmUnable to load window 'mainmenu' from menu-ui.xml01:13
a1faxrap02:10
wjs_ltop_Hello, I'm having a problem with one of my front ends when I try to go into MythVideo. I tried the FrontEnd on the Backend, and it worked ok. The pastebin from yesterday is http://mythbuntu.pastebin.com/fc96bb9703:01
wjs_ltop_I have disabled vsync in nvidia-settings, and set UseEvents to true in xorg.conf I have done a repair and optimize on all the tables in the database.03:02
wjs_ltop_I have verified that the directory is mounted on the frontend in question, and I can play videos from a command line.03:02
wjs_ltop_I think I'm using the OpenGL painter.03:02
Shadow__Xhow do i allow more memory to php03:06
Shadow__Xi am getting this error03:07
Shadow__XFatal error: Allowed memory size of 33554432 bytes exhausted (tried to allocate 24 bytes) in /usr/share/mythtv/mythweb/modules/tv/includes/objects/Program.php on line 29103:07
Shadow__Xi adjusted the value in /etc/php5/apache2/php.ini03:07
Shadow__Xand restarted apache203:07
Shadow__Xbut still does the same thing03:07
=== J-e-f-f-A_ is now known as J-e-f-f-A
MythbuntuGuest53anyone here?04:36
MythbuntuGuest53wondering if anyone know what manager mythbuntu uses at boot (login screen). Trying to get vnc to start before a local login and the guides don't seem to be for the one that I have since I'm missing folders that they say I need to go into.04:43
gomike.05:29
gomikewhat nvidia driver should I install to get higher resolutions?06:21
Chomhi all12:26
afmhmm after a fresh reboot...i get Node 1 active for firewire plugreport. all tests for p2p and bcast fail. after a bus reset, i get Node 0 and all tests fail..yet myth actually picked up the GUID and STB model, channel changing works...no video14:40
gomikeI am using a nvidia video card but do not know how to get higher resolutions, can someone help me with what to install14:44
sven_hello all, does anyone knows how I can shutdown my pc when I quit mythbuntu?14:45
gomikedo you mean when you leave the frontend?14:46
sven_gomike: yes, in fact the question is how configure a button (power off button on my ati remote) that the pc shuts down completely14:46
sven_neither the button, neither the shutdown works now14:47
gomikedo you know about irw?14:49
sven_irw?14:50
sven_I know there is a file where you can add buttons14:50
gomikego to a terminal window and type in irw14:50
sven_ok14:51
sven_and then I press the button14:51
sven_so I know the name14:51
sven_and after?14:51
gomikewhat is the name14:51
sven_poweroff14:51
gomikeok so i think you can add this to your lircrc14:52
gomikebegin button = Power prog = irexec repeat = 0 config = sudo /usr/sbin/hibernate-ram end14:52
gomikehold on i will pastebin it14:52
gomikehttp://mythbuntu.pastebin.com/m5dffb45414:53
sven_are you sure the sudo command will shut down the system completely?14:53
afmrun it manually and find out :)14:54
gomikeyeah14:54
gomikewhat afm said14:54
gomikei think this will hibernate your system, which uses no power14:54
sven_why hibernate?14:55
gomikebecause thats all i could find :-D14:55
afmmakes booting back up faster14:55
afmyou can sudo /sbin/shutdown -h now14:56
sven_and I use only a remote, will sudo not ask for my pwsc?14:56
gomikewhat happened when you ran that command from terminal?14:56
sven_dont now, I am not at that pc now14:57
sven_will have to test it14:57
gomikeafm are you using nvidia?14:58
afmi got trunk installed finally last night. drivers compiled for the hdpvr...can't wait to get back to hacking at it tonight14:58
afmno on the nvidia....mac mini14:58
gomikewhats trunk?14:59
afmthe svn weekly builds14:59
=== a1fa_ is now known as a1fa
gomikeok15:00
afmhave to run trunk for the hdpvr for USB recording support apparently15:00
* afm is trying to remember how to obtain the vendor and model id to add to the 6200ch.c code15:04
afmi need to add my qip7100 STB to it....15:04
gomikeso i just put a 1.5TB drive in my myth yesterday :-D15:06
sven_gomike: sudo /usr/sbin/hibernate-ram doesnt work15:13
gomikeok i dunno then15:15
afmthe only hibernate i find is /etc/acpi/hibernate.sh15:15
gomikedid you try that?15:16
afmi didn't...not local to my machine either....15:17
sven_the acpi?15:17
gomikei just tested /etc/acpi/hibernate.sh15:17
gomikenow i have to go downstairs to see what it did :-D15:17
sven_lol15:17
afmha15:17
afmyou hibernated it most likely15:18
afmheh15:18
sven_etc/acpi/hibernate.sh does the job here15:20
gomikeyeah15:20
gomikeme too15:20
sven_i'm only curious if mythtv doesn't need my sudo-psw...15:20
gomikejust put it in the config and find out, let us know15:21
afmjust run the command in a terminal as mythtv and see if ti works or says permission denied15:21
gomikeit doesnt ask for my pass when i run that from perminal15:22
* afm curses firewire :|15:24
sven_gomike: it didn't do a thing here15:26
sven_strange15:26
sven_gomike: the command works in terminal but does nothing in mythtv15:33
gomikeok i dunno sorry15:35
sven_damn15:35
Zinnsven_: Please watch your language.15:35
gomikeyeah man, kids are present15:36
sven_do you know how to run nvidea config?15:37
sven_via terminal15:37
gomikeno15:37
gomikethats what I am here for to get help with nvidia drivers/config15:40
sven_my prob is that I needs to be sudo so I must start the Nvidia Control Center via terminal but dont know the command15:41
gomikeim just trying to get a higer resolution15:42
gomikewhat commmand did you use to install the driver?15:42
afmlame-o bot...damn is not a bad word...these things really should be fcc calibrated15:43
Zinnafm: Please watch your language.15:43
gomikesven_ do you know how to change resolution?15:49
NeoMatrixJR!pcm17:27
ZinnSorry I don't know about pcm17:27
NeoMatrixJR!mixer17:27
ZinnSorry I don't know about mixer17:27
selinuxiumCan anyone recommend a USB TV preferably with aerial socket... or PCMCIA ...17:43
Thraeselinuxium: Take a look at MythTV's hardware wiki. There's a link on the main Mythbuntu page.17:44
selinuxiumCheers17:44
NeoMatrixJRcan anyone help me properly configure alsa/pulse/mythtv?18:07
oobedoes anyone know what replaces sudo dpkg-reconfigure lirc in 8.10 apparent that wont work and im still using 8.04 and cannot update a guide i wrote18:13
Louis_I moved my video posters directory to /var/lib/mythtv/posters. Everything is working fine except that now when i got to the video section of mythweb, i don't see any of my movie posters... what gives?18:42
Louis_anyone here?18:48
rhpot1991Louis_: check the mythweb data directory, you prob need to fix the symlink to point at your new location19:16
Louis_rhpot1991 what's the mythweb data directory?19:16
Louis_/var/www ?19:16
rhpot1991Louis_: /var/www/mythweb/data19:18
rhpot1991you need to fix video_covers19:19
Louis_aah okay let me have a look19:20
Louis_okay there's a symlink for video_covers, but it points to /var/lib/mythtv/videos19:21
Louis_how do i change whre it points?19:21
rhpot1991delete the old and make a new one19:22
Louis_what's the command for that? i've never really dealt with symlinks19:24
rhpot1991ln19:24
rhpot1991ln -s target link_name19:25
Louis_okay so ln -s /path/to/target video_covers ?19:26
Louis_i just want to double check, sorry19:26
rhpot1991yeo19:28
rhpot1991might need to run it as sudo19:28
Louis_aah. right19:28
Louis_lol good thing i asked =P19:28
Louis_okay. do i need to restart apache?19:29
Louis_nvm. win! thank you!19:30
rhpot1991your welcome19:31
Louis_Ahh, but another question... when i click on a video, my browser switches to the VLC plugin, but I get an indefinite "video is loading" message and the video doesn't play19:31
Louis_i'm on the local net so i should be getting a beastly connection...19:31
Louis_and the other thing that's weird is that if i right click on the movie title and select "save link as", i can download the movie19:32
Louis_so i'm guessing it's either a problem with the vlc plugin, or the streaming from mythweb?19:32
rhpot1991Louis_: can't help you there, I use the flash player for streaming when I need to19:36
rhpot1991I know I tried to stream the ascx at some point and it didn't play nicely19:36
Louis_rhpot: a flash player would be fine. how is that done?19:38
Louis_rhpot1991: ^19:42
rhpot1991Louis_: you have to enable it in the mythweb settings19:45
Louis_rhpot1991: yeah I looked for it there, but i can't find it... maybe i need glasses19:46
Louis_ah nvm i found it...19:48
Louis_how stable is it? it says it's proof-of-concept only19:48
Louis_hmm it's still trying to stream to vlc19:49
rhpot1991stable, but only does 4:319:49
rhpot1991to use it you go into the recordings, choose one19:50
rhpot1991and the player will be on the next page19:50
Louis_by chose one, you mean click on the title? because that's still streaming to the vlc plugin19:51
rhpot1991mythweb > recorded programs > click on the title or image > thie next page should have the flash player19:56
Louis_oooh recorded programs...19:57
Louis_i was on the video page19:57
Louis_there's no way to stream the videos via flash player?19:57
rhpot1991Louis_: I don't think so19:58
Louis_balls...19:58
Louis_at least i can download them19:58
rhpot1991might be able to do them if you hack some code together yourself19:58
Louis_haha that's funny =)20:01
Louis_no but this is a good start20:01
Louis_at least i can download the files20:01
fernando__hi guys, i have the MS USB IR Blaster/reseaver , i tell the system that i have it but i dont know what to put in for externil channel changer, any help would be great..20:26
fernando__!help20:28
Zinn!help Use ! followed by a topic to get help on the topic (if it exists) example: !logs. Other available commands: !status, !about, !bug [bug_number]. For a complete list of my knowledge visit: http://www.baablogic.net/Zinn.cgi20:28
fernando__hi guys, i have the MS USB IR Blaster/reserver , i tell the system that i have it , but i don't know what to put in for external channel changer. i dont know what script to use.21:31
fernando__hi guys, i have the MS USB IR Blaster/reserver , i tell the system that i have it , but i don't know what to put in for external channel changer. i dont know what script to use.21:41
afmHOLY CRAP, I'VE done it....hdpvr working in mythtv with optical audio22:37
afmgooo me22:37
fernando__any help with the channel changing script23:10
Generated by irclog2html.py 2.7 by Marius Gedminas - find it at mg.pov.lt!
|
{
"url": "https://irclogs.ubuntu.com/2009/01/28/%23ubuntu-mythtv.html",
"source_domain": "irclogs.ubuntu.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "43038",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UZFTWRHFQXE6OQOBVOVBF27KG3UQGGDU",
"WARC-Concurrent-To": "<urn:uuid:af4d0240-2348-46aa-9884-9d8807b5b969>",
"WARC-Date": "2021-10-27T12:42:34Z",
"WARC-IP-Address": "185.125.188.184",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YZAOSRIFTK5K5SJDVTD7YYW4DEQNXNIL",
"WARC-Record-ID": "<urn:uuid:d6ce725b-ed7d-44ba-86ba-c1b7e27f6399>",
"WARC-Target-URI": "https://irclogs.ubuntu.com/2009/01/28/%23ubuntu-mythtv.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a1d81107-321b-4c7f-8e92-3a5f55df1d48>"
},
"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-40\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,
54,
55,
153,
229,
246,
334,
530,
658,
706,
785,
822,
839,
897,
911,
1138,
1302,
1434,
1486,
1534,
1572,
1757,
1821,
1857,
1901,
1942,
1976,
2237,
2250,
2324,
2340,
2594,
2724,
2811,
2863,
3003,
3064,
3098,
3113,
3172,
3223,
3236,
3274,
3303,
3324,
3352,
3371,
3428,
3531,
3569,
3620,
3698,
3738,
3754,
3779,
3851,
3876,
3922,
3959,
4002,
4068,
4134,
4178,
4209,
4246,
4378,
4415,
4439,
4469,
4500,
4514,
4591,
4690,
4737,
4801,
4860,
4887,
4947,
4976,
5030,
5050,
5098,
5160,
5174,
5185,
5223,
5235,
5285,
5301,
5319,
5384,
5447,
5546,
5613,
5643,
5687,
5705,
5780,
5808,
5823,
5867,
5905,
5953,
5976,
5990,
6065,
6191,
6243,
6303,
6394,
6436,
6491,
6512,
6550,
6573,
6613,
6705,
6809,
6831,
6904,
7061,
7274,
7298,
7417,
7473,
7495,
7539,
7582,
7621,
7713,
7756,
7804,
7883,
7900,
7937,
7993,
8039,
8057,
8100,
8122,
8159,
8205,
8239,
8266,
8448,
8527,
8667,
8768,
8864,
8952,
9019,
9044,
9112,
9207,
9239,
9304,
9354,
9394,
9457,
9511,
9615,
9733,
9770,
9805,
9870,
9909,
9929,
9969,
10048,
10080,
10119,
10164,
10348,
10369,
10608,
10801,
10994,
11072,
11088,
11145,
11146
],
"line_end_idx": [
54,
55,
153,
229,
246,
334,
530,
658,
706,
785,
822,
839,
897,
911,
1138,
1302,
1434,
1486,
1534,
1572,
1757,
1821,
1857,
1901,
1942,
1976,
2237,
2250,
2324,
2340,
2594,
2724,
2811,
2863,
3003,
3064,
3098,
3113,
3172,
3223,
3236,
3274,
3303,
3324,
3352,
3371,
3428,
3531,
3569,
3620,
3698,
3738,
3754,
3779,
3851,
3876,
3922,
3959,
4002,
4068,
4134,
4178,
4209,
4246,
4378,
4415,
4439,
4469,
4500,
4514,
4591,
4690,
4737,
4801,
4860,
4887,
4947,
4976,
5030,
5050,
5098,
5160,
5174,
5185,
5223,
5235,
5285,
5301,
5319,
5384,
5447,
5546,
5613,
5643,
5687,
5705,
5780,
5808,
5823,
5867,
5905,
5953,
5976,
5990,
6065,
6191,
6243,
6303,
6394,
6436,
6491,
6512,
6550,
6573,
6613,
6705,
6809,
6831,
6904,
7061,
7274,
7298,
7417,
7473,
7495,
7539,
7582,
7621,
7713,
7756,
7804,
7883,
7900,
7937,
7993,
8039,
8057,
8100,
8122,
8159,
8205,
8239,
8266,
8448,
8527,
8667,
8768,
8864,
8952,
9019,
9044,
9112,
9207,
9239,
9304,
9354,
9394,
9457,
9511,
9615,
9733,
9770,
9805,
9870,
9909,
9929,
9969,
10048,
10080,
10119,
10164,
10348,
10369,
10608,
10801,
10994,
11072,
11088,
11145,
11146,
11220
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11220,
"ccnet_original_nlines": 180,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33112838864326477,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022957200184464455,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.30739301443099976,
"rps_doc_frac_unique_words": 0.4573690593242645,
"rps_doc_mean_word_length": 5.360536098480225,
"rps_doc_num_sentences": 135,
"rps_doc_symbol_to_word_ratio": 0.010894940234720707,
"rps_doc_unigram_entropy": 5.912103176116943,
"rps_doc_word_count": 1642,
"rps_doc_frac_chars_dupe_10grams": 0.03715065121650696,
"rps_doc_frac_chars_dupe_5grams": 0.05112474039196968,
"rps_doc_frac_chars_dupe_6grams": 0.04044535011053085,
"rps_doc_frac_chars_dupe_7grams": 0.04044535011053085,
"rps_doc_frac_chars_dupe_8grams": 0.04044535011053085,
"rps_doc_frac_chars_dupe_9grams": 0.03715065121650696,
"rps_doc_frac_chars_top_2gram": 0.006248579826205969,
"rps_doc_frac_chars_top_3gram": 0.007157459855079651,
"rps_doc_frac_chars_top_4gram": 0.00738468999043107,
"rps_doc_books_importance": -886.8844604492188,
"rps_doc_books_importance_length_correction": -886.8844604492188,
"rps_doc_openwebtext_importance": -597.1271362304688,
"rps_doc_openwebtext_importance_length_correction": -597.1271362304688,
"rps_doc_wikipedia_importance": -424.59912109375,
"rps_doc_wikipedia_importance_length_correction": -424.59912109375
},
"fasttext": {
"dclm": 0.02434277907013893,
"english": 0.8238694667816162,
"fineweb_edu_approx": 1.2558246850967407,
"eai_general_math": 0.41045820713043213,
"eai_open_web_math": 0.19650858640670776,
"eai_web_code": 0.5972288846969604
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02854",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
9,161,086,112,972,638,000 |
package Starman::Server; use strict; use base 'Net::Server::PreFork'; use Data::Dump qw(dump); use Socket qw(IPPROTO_TCP TCP_NODELAY); use IO::Socket qw(:crlf); use HTTP::Parser::XS qw(parse_http_request); use HTTP::Status qw(status_message); use HTTP::Date qw(time2str); use Symbol; use Plack::Util; use Plack::TempBuffer; use constant DEBUG => $ENV{STARMAN_DEBUG} || 0; use constant CHUNKSIZE => 64 * 1024; use constant READ_TIMEOUT => 5; my $null_io = do { open my $io, "<", \""; $io }; use Net::Server::SIG qw(register_sig); # Override Net::Server's HUP handling - just restart all the workers and that's about it sub sig_hup { my $self = shift; $self->hup_children; } sub run { my($self, $app, $options) = @_; $self->{app} = $app; $self->{options} = $options; my %extra = (); if ( $options->{pid} ) { $extra{pid_file} = $options->{pid}; } if ( $options->{daemonize} ) { $extra{setsid} = $extra{background} = 1; } if ( $options->{error_log} ) { $extra{log_file} = $options->{error_log}; } if ( DEBUG ) { $extra{log_level} = 4; } if ( $options->{ssl_cert} ) { $extra{SSL_cert_file} = $options->{ssl_cert}; } if ( $options->{ssl_key} ) { $extra{SSL_key_file} = $options->{ssl_key}; } if (! exists $options->{keepalive}) { $options->{keepalive} = 1; } if (! exists $options->{keepalive_timeout}) { $options->{keepalive_timeout} = 1; } my @port; for my $listen (@{$options->{listen} || [ "$options->{host}:$options->{port}" ]}) { my %listen; if ($listen =~ /:/) { my($h, $p, $opt) = split /:/, $listen, 3; $listen{host} = $h if $h; $listen{port} = $p; $listen{proto} = 'ssl' if 'ssl' eq lc $opt; } else { %listen = ( host => 'localhost', port => $listen, proto => 'unix', ); } push @port, \%listen; } my $workers = $options->{workers} || 5; local @ARGV = (); $self->SUPER::run( port => \@port, host => '*', # default host proto => $options->{ssl} ? 'ssl' : 'tcp', # default proto serialize => ( $^O =~ m!(linux|darwin|bsd|cygwin)$! ) ? 'none' : 'flock', min_servers => $options->{min_servers} || $workers, min_spare_servers => $options->{min_spare_servers} || $workers - 1, max_spare_servers => $options->{max_spare_servers} || $workers - 1, max_servers => $options->{max_servers} || $workers, max_requests => $options->{max_requests} || 1000, user => $options->{user} || $>, group => $options->{group} || $), listen => $options->{backlog} || 1024, check_for_waiting => 1, no_client_stdout => 1, %extra ); } sub pre_loop_hook { my $self = shift; my $host = $self->{server}->{host}->[0]; my $port = $self->{server}->{port}->[0]; $self->{options}{server_ready}->({ host => $host, port => $port, proto => $port =~ /unix/ ? 'unix' : 'http', server_software => 'Starman', }) if $self->{options}{server_ready}; register_sig( TTIN => sub { $self->{server}->{$_}++ for qw( min_servers max_servers ) }, TTOU => sub { $self->{server}->{$_}-- for qw( min_servers max_servers ) }, QUIT => sub { $self->server_close(1) }, ); } sub server_close { my($self, $quit) = @_; if ($quit) { $self->log(2, $self->log_time . " Received QUIT. Running a graceful shutdown\n"); $self->{server}->{$_} = 0 for qw( min_servers max_servers ); $self->hup_children; while (1) { Net::Server::SIG::check_sigs(); $self->coordinate_children; last if !keys %{$self->{server}{children}}; sleep 1; } $self->log(2, $self->log_time . " Worker processes cleaned up\n"); } $self->SUPER::server_close(); } sub run_parent { my $self = shift; $0 = "starman master " . join(" ", @{$self->{options}{argv} || []}); no warnings 'redefine'; local *Net::Server::PreFork::register_sig = sub { my %args = @_; delete $args{QUIT}; Net::Server::SIG::register_sig(%args); }; $self->SUPER::run_parent(@_); } # The below methods run in the child process sub child_init_hook { my $self = shift; srand(); if ($self->{options}->{psgi_app_builder}) { DEBUG && warn "[$$] Initializing the PSGI app\n"; $self->{app} = $self->{options}->{psgi_app_builder}->(); } $0 = "starman worker " . join(" ", @{$self->{options}{argv} || []}); } sub post_accept_hook { my $self = shift; $self->{client} = { headerbuf => '', inputbuf => '', keepalive => 1, }; } sub process_request { my $self = shift; my $conn = $self->{server}->{client}; if ($conn->NS_proto eq 'TCP') { setsockopt($conn, IPPROTO_TCP, TCP_NODELAY, 1) or die $!; } while ( $self->{client}->{keepalive} ) { last if !$conn->connected; # Read until we see all headers last if !$self->_read_headers; my $env = { REMOTE_ADDR => $self->{server}->{peeraddr}, REMOTE_HOST => $self->{server}->{peerhost} || $self->{server}->{peeraddr}, REMOTE_PORT => $self->{server}->{peerport} || 0, SERVER_NAME => $self->{server}->{sockaddr} || 0, # XXX: needs to be resolved? SERVER_PORT => $self->{server}->{sockport} || 0, SCRIPT_NAME => '', 'psgi.version' => [ 1, 1 ], 'psgi.errors' => *STDERR, 'psgi.url_scheme' => ($conn->NS_proto eq 'SSL' ? 'https' : 'http'), 'psgi.nonblocking' => Plack::Util::FALSE, 'psgi.streaming' => Plack::Util::TRUE, 'psgi.run_once' => Plack::Util::FALSE, 'psgi.multithread' => Plack::Util::FALSE, 'psgi.multiprocess' => Plack::Util::TRUE, 'psgix.io' => $conn, 'psgix.input.buffered' => Plack::Util::TRUE, 'psgix.harakiri' => Plack::Util::TRUE, }; # Parse headers my $reqlen = parse_http_request(delete $self->{client}->{headerbuf}, $env); if ( $reqlen == -1 ) { # Bad request DEBUG && warn "[$$] Bad request\n"; $self->_http_error(400, { SERVER_PROTOCOL => "HTTP/1.0" }); last; } # Initialize PSGI environment # Determine whether we will keep the connection open after the request my $connection = delete $env->{HTTP_CONNECTION}; my $proto = $env->{SERVER_PROTOCOL}; if ( $proto && $proto eq 'HTTP/1.0' ) { if ( $connection && $connection =~ /^keep-alive$/i ) { # Keep-alive only with explicit header in HTTP/1.0 $self->{client}->{keepalive} = 1; } else { $self->{client}->{keepalive} = 0; } } elsif ( $proto && $proto eq 'HTTP/1.1' ) { if ( $connection && $connection =~ /^close$/i ) { $self->{client}->{keepalive} = 0; } else { # Keep-alive assumed in HTTP/1.1 $self->{client}->{keepalive} = 1; } # Do we need to send 100 Continue? if ( $env->{HTTP_EXPECT} ) { if ( $env->{HTTP_EXPECT} eq '100-continue' ) { syswrite $conn, 'HTTP/1.1 100 Continue' . $CRLF . $CRLF; DEBUG && warn "[$$] Sent 100 Continue response\n"; } else { DEBUG && warn "[$$] Invalid Expect header, returning 417\n"; $self->_http_error( 417, $env ); last; } } unless ($env->{HTTP_HOST}) { # No host, bad request DEBUG && warn "[$$] Bad request, HTTP/1.1 without Host header\n"; $self->_http_error( 400, $env ); last; } } unless ($self->{options}->{keepalive}) { DEBUG && warn "[$$] keep-alive is disabled. Closing the connection after this request\n"; $self->{client}->{keepalive} = 0; } $self->_prepare_env($env); # Run PSGI apps my $res = Plack::Util::run_app($self->{app}, $env); if (ref $res eq 'CODE') { $res->(sub { $self->_finalize_response($env, $_[0]) }); } else { $self->_finalize_response($env, $res); } DEBUG && warn "[$$] Request done\n"; if ( $self->{client}->{keepalive} ) { # If we still have data in the input buffer it may be a pipelined request if ( $self->{client}->{inputbuf} ) { if ( $self->{client}->{inputbuf} =~ /^(?:GET|HEAD)/ ) { if ( DEBUG ) { warn "Pipelined GET/HEAD request in input buffer: " . dump( $self->{client}->{inputbuf} ) . "\n"; } # Continue processing the input buffer next; } else { # Input buffer just has junk, clear it if ( DEBUG ) { warn "Clearing junk from input buffer: " . dump( $self->{client}->{inputbuf} ) . "\n"; } $self->{client}->{inputbuf} = ''; } } DEBUG && warn "[$$] Waiting on previous connection for keep-alive request...\n"; my $sel = IO::Select->new($conn); last unless $sel->can_read($self->{options}->{keepalive_timeout}); } } DEBUG && warn "[$$] Closing connection\n"; } sub _read_headers { my $self = shift; eval { local $SIG{ALRM} = sub { die "Timed out\n"; }; alarm( READ_TIMEOUT ); while (1) { # Do we have a full header in the buffer? # This is before sysread so we don't read if we have a pipelined request # waiting in the buffer last if defined $self->{client}->{inputbuf} && $self->{client}->{inputbuf} =~ /$CR?$LF$CR?$LF/s; # If not, read some data my $read = sysread $self->{server}->{client}, my $buf, CHUNKSIZE; if ( !defined $read || $read == 0 ) { die "Read error: $!\n"; } if ( DEBUG ) { warn "[$$] Read $read bytes: " . dump($buf) . "\n"; } $self->{client}->{inputbuf} .= $buf; } }; alarm(0); if ( $@ ) { if ( $@ =~ /Timed out/ ) { DEBUG && warn "[$$] Client connection timed out\n"; return; } if ( $@ =~ /Read error/ ) { DEBUG && warn "[$$] Read error: $!\n"; return; } } # Pull out the complete header into a new buffer $self->{client}->{headerbuf} = $self->{client}->{inputbuf}; # Save any left-over data, possibly body data or pipelined requests $self->{client}->{inputbuf} =~ s/.*?$CR?$LF$CR?$LF//s; return 1; } sub _http_error { my ( $self, $code, $env ) = @_; my $status = $code || 500; my $msg = status_message($status); my $res = [ $status, [ 'Content-Type' => 'text/plain', 'Content-Length' => length($msg) ], [ $msg ], ]; $self->{client}->{keepalive} = 0; $self->_finalize_response($env, $res); } sub _prepare_env { my($self, $env) = @_; my $get_chunk = sub { if ($self->{client}->{inputbuf}) { my $chunk = delete $self->{client}->{inputbuf}; return ($chunk, length $chunk); } my $read = sysread $self->{server}->{client}, my($chunk), CHUNKSIZE; return ($chunk, $read); }; my $chunked = do { no warnings; lc delete $env->{HTTP_TRANSFER_ENCODING} eq 'chunked' }; if (my $cl = $env->{CONTENT_LENGTH}) { my $buf = Plack::TempBuffer->new($cl); while ($cl > 0) { my($chunk, $read) = $get_chunk->(); if ( !defined $read || $read == 0 ) { die "Read error: $!\n"; } $cl -= $read; $buf->print($chunk); } $env->{'psgi.input'} = $buf->rewind; } elsif ($chunked) { my $buf = Plack::TempBuffer->new; my $chunk_buffer = ''; my $length; DECHUNK: while (1) { my($chunk, $read) = $get_chunk->(); $chunk_buffer .= $chunk; while ( $chunk_buffer =~ s/^(([0-9a-fA-F]+).*\015\012)// ) { my $trailer = $1; my $chunk_len = hex $2; if ($chunk_len == 0) { last DECHUNK; } elsif (length $chunk_buffer < $chunk_len + 2) { $chunk_buffer = $trailer . $chunk_buffer; last; } $buf->print(substr $chunk_buffer, 0, $chunk_len, ''); $chunk_buffer =~ s/^\015\012//; $length += $chunk_len; } last unless $read && $read > 0; } $env->{CONTENT_LENGTH} = $length; $env->{'psgi.input'} = $buf->rewind; } else { $env->{'psgi.input'} = $null_io; } } sub _finalize_response { my($self, $env, $res) = @_; if ($env->{'psgix.harakiri.commit'}) { $self->{client}->{keepalive} = 0; $self->{client}->{harakiri} = 1; } my $protocol = $env->{SERVER_PROTOCOL}; my $status = $res->[0]; my $message = status_message($status); my(@headers, %headers); push @headers, "$protocol $status $message"; # Switch on Transfer-Encoding: chunked if we don't know Content-Length. my $chunked; my $headers = $res->[1]; for (my $i = 0; $i < @$headers; $i += 2) { my $k = $headers->[$i]; my $v = $headers->[$i + 1]; next if $k eq 'Connection'; push @headers, "$k: $v"; $headers{lc $k} = $v; } if ( $protocol eq 'HTTP/1.1' ) { if ( !exists $headers{'content-length'} ) { if ( $status !~ /^1\d\d|[23]04$/ ) { DEBUG && warn "[$$] Using chunked transfer-encoding to send unknown length body\n"; push @headers, 'Transfer-Encoding: chunked'; $chunked = 1; } } elsif ( my $te = $headers{'transfer-encoding'} ) { if ( $te eq 'chunked' ) { DEBUG && warn "[$$] Chunked transfer-encoding set for response\n"; $chunked = 1; } } } else { if ( !exists $headers{'content-length'} ) { DEBUG && warn "[$$] Disabling keep-alive after sending unknown length body on $protocol\n"; $self->{client}->{keepalive} = 0; } } if ( ! $headers{date} ) { push @headers, "Date: " . time2str( time() ); } # Should we keep the connection open? if ( $self->{client}->{keepalive} ) { push @headers, 'Connection: keep-alive'; } else { push @headers, 'Connection: close'; } my $conn = $self->{server}->{client}; # Buffer the headers so they are sent with the first write() call # This reduces the number of TCP packets we are sending syswrite $conn, join( $CRLF, @headers, '' ) . $CRLF; if (defined $res->[2]) { Plack::Util::foreach($res->[2], sub { my $buffer = $_[0]; if ($chunked) { my $len = length $buffer; return unless $len; $buffer = sprintf( "%x", $len ) . $CRLF . $buffer . $CRLF; } syswrite $conn, $buffer; DEBUG && warn "[$$] Wrote " . length($buffer) . " bytes\n"; }); syswrite $conn, "0$CRLF$CRLF" if $chunked; } else { return Plack::Util::inline_object write => sub { my $buffer = $_[0]; if ($chunked) { my $len = length $buffer; return unless $len; $buffer = sprintf( "%x", $len ) . $CRLF . $buffer . $CRLF; } syswrite $conn, $buffer; DEBUG && warn "[$$] Wrote " . length($buffer) . " bytes\n"; }, close => sub { syswrite $conn, "0$CRLF$CRLF" if $chunked; }; } } sub post_client_connection_hook { my $self = shift; if ($self->{client}->{harakiri}) { exit; } } 1;
|
{
"url": "http://cpansearch.perl.org/src/MIYAGAWA/Starman-0.4001/lib/Starman/Server.pm",
"source_domain": "cpansearch.perl.org",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "17381",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CZ6SZUIVNGOE4GQBRMFUVMQM7UFD4FRA",
"WARC-Concurrent-To": "<urn:uuid:2471b50e-3f17-47f3-a7b4-651a41ea683e>",
"WARC-Date": "2014-12-19T21:52:28Z",
"WARC-IP-Address": "199.15.177.162",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FR2HRTLD6YYCSABJSADLXUUPEUD6AOYX",
"WARC-Record-ID": "<urn:uuid:cd65daa1-3b3a-41c5-b79d-a1635e988aff>",
"WARC-Target-URI": "http://cpansearch.perl.org/src/MIYAGAWA/Starman-0.4001/lib/Starman/Server.pm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c2849a38-0438-4802-b4fb-702c25e02d9d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-231-17-201.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-52\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for December 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
12830
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12830,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.04162120074033737,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12888027727603912,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03353659063577652,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5764966607093811,
"rps_doc_frac_unique_words": 0.36901864409446716,
"rps_doc_mean_word_length": 6.355231285095215,
"rps_doc_num_sentences": 88,
"rps_doc_symbol_to_word_ratio": 0.008037690073251724,
"rps_doc_unigram_entropy": 5.468173027038574,
"rps_doc_word_count": 1233,
"rps_doc_frac_chars_dupe_10grams": 0.03420111909508705,
"rps_doc_frac_chars_dupe_5grams": 0.07376211881637573,
"rps_doc_frac_chars_dupe_6grams": 0.051812149584293365,
"rps_doc_frac_chars_dupe_7grams": 0.04211331903934479,
"rps_doc_frac_chars_dupe_8grams": 0.04211331903934479,
"rps_doc_frac_chars_dupe_9grams": 0.04211331903934479,
"rps_doc_frac_chars_top_2gram": 0.021822359412908554,
"rps_doc_frac_chars_top_3gram": 0.011230220086872578,
"rps_doc_frac_chars_top_4gram": 0.00957120954990387,
"rps_doc_books_importance": -2013.8076171875,
"rps_doc_books_importance_length_correction": -2013.8076171875,
"rps_doc_openwebtext_importance": -926.5816040039062,
"rps_doc_openwebtext_importance_length_correction": -926.5816040039062,
"rps_doc_wikipedia_importance": -780.3204345703125,
"rps_doc_wikipedia_importance_length_correction": -780.3204345703125
},
"fasttext": {
"dclm": 0.992804229259491,
"english": 0.3976779282093048,
"fineweb_edu_approx": 2.2943551540374756,
"eai_general_math": 0.4936228394508362,
"eai_open_web_math": 0.31714940071105957,
"eai_web_code": 0.988593578338623
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
8,681,952,436,371,257,000 |
Archive
Tag Archives: Limit
Our protagonists are Cartesius (1596-1650) and Fermat (1607-1665). As Judith Grabiner states, in a recommendable text:
“One could claim that, just as the history of Western philosophy has been viewed as a series of footnotes to Plato, so the past 350 years of mathematics can be viewed as a series of footnotes to Descartes’ Geometry.” (Grabiner) (But remember Michel Onfray‘s observation that followers of Plato have been destroying texts by opponents. (Dutch readers check here.))
Both Cartesius and Fermat were involved in the early development of calculus. Both worked on the algebraic approach without limits. Cartesius developed the method of normals and Fermat the method of adequality.
Fermat and Δf / Δx
Fermat’s method was algebraic itself, but later has been developed into the method of limits anyhow. When asked what the slope of a ray y = s x is at the point x = 0, then the answer y / x = s runs into problems, since we cannot use 0 / 0. The conventional answer is to use limits. This problem is more striking when one considers the special ray that is defined everywhere except at the origin itself. The crux of the problem lies in the notion of slope Δf / Δthat obviously has a problematic division. With set theory we can now define the “dynamic quotient”, so that we can use Δf // Δx = s even when Δx = 0, so that Fermat’s problem is resolved, and his algebraic approach can be maintained. This originated in 2007, see Conquest of the Plane (2011).
Cartesius and Euclid’s notion of tangency
Cartesius followed Euclid’s notion of tangency. Scholars tend to assign this notion to Cartesius as well, since he embedded the approach within his new idea of analytic geometry.
I thank Roy Smith for this eye-opening question:
“Who first defined a tangent to a circle as a line meeting it only once? From googling, it seems commonly believed that Euclid did this, but it seems nowhere in Euclid does he even state this property of a tangent line explicitly. Rather Euclid gives 4 other equivalent properties, that the line does not cross the circle, that it is perpendicular to the radius, that is a limit of secant lines, and that it makes an angle of zero with the circle, the first of which is his definition, the others being in Proposition III.16. I am wondering where the “meets only once” definition got started. I presume once it got going, and people stopped reading Euclid, (which seems to have occurred over 100 years ago), the currently popular definition took over. Perhaps I should consult Legendre or Hadamard? Thank you for any leads.” (Roy Smith, at StackExchange)
In this notion of tangency there is no problematic division, whence there is no urgency to use limits.
The reasoning is:
• (Circle & Line) A line is tangent to a circle when there is only one common point (or the two intersecting points overlap).
• (Circle & Curve) A smooth curve is tangent to a circle when the two intersecting points overlap (but the curve might cross the circle at that point so that the notion of “two points” is even more abstract).
• (Curve & Line) A curve is tangent to a line when the above two properties hold (but the line might cross the curve, whence we better speak about incline rather than tangent).
Example of line and circle
Consider the line y f[x] = c + s x and the point {a, f[a]}. The line can also be written with c = f[a] – s a:
y – f[a] = s (x a)
The normal has slope –sHwhere we use = -1. The formula for the normal is the line y – f[a] = –sH (xa). We can choose the center of the circle anywhere on this line. A handy choice is {u, 0}, so that we choose the center on the horizontal axis. (If we looked at a ray and point {0, 0}, then the issue would be similar for {0, c} for nonzero c and thus the approach remains general.) Substituting the point into the normal gives
0 – f[a] = –sH (ua)
s = (u – a) / f[a]
u + s f[a]
The circle has the formula (x u)² + y² = r². Substituting {a, f[a]} generates the value for the radius r² = (a – (a + s f[a]))² + f[a]² = (1 + s²) f[a]² . The following diagram has {c, s, a} = {0, 2, 3} and thus u = 15 and r = 6√5.
descartesMethod of normals
For the method of normals and arbitrary function f[x], Cartesius’s trick is to substitute y = f[x] into the formula for the circle, and then solve for the unknown center of the circle.
(x u)² + (y – 0)² = r²
(x u)² + f[x]² – r² = 0 … (* circle)
This expression is only true for x = a, but we treat it as if it were more general. The key property is:
Since {a, f[a]} satisfies the circle, this equation has a solution for x = a with a double root.
Thus there might be some g such that the root can be isolated:
(x ag [x, u] = 0 … (* roots)
Thus, if we succeed in rewriting the formula for the circle into the form of the formula with the two roots, then we can use information about the structure of the latter to say something about u.
The method works for polynomials, that obviously have roots, but not necessarily for trigonometry and the exponential function.
Algorithm
The algorithm thus is: (1) Substitute f[x] in the formula for the circle. (2) Compare with the expression with the double root. (3) Derive u. (4) Then the line through {a, f[a]} and {u, 0} will give slope –sH. Thus s = (ua) / f[a] gives the slope of the incline (tangent) of the curve. (5) If f[a] = 0, add a constant or choose center {u, v}.
Application to the line itself
Consider the line y f[x] = c + s x again. Let us apply the algorithm. The formula for the circle gives:
(x u)² + (c + s x)² – r² = 0
x² – 2ux + u² + c² + 2csx + s²x² – r² = 0
(1 + s²) x² – 2 (u cs) x + u² + c² – r² = 0
This is a polynomial. It suffices to choose g [x, u] = 1 + s² so that the coefficients of are the same. Also the coefficient of must be the same. Thus expanding (xa)²:
(1 + s²) (x² – 2ax + a²) = 0
– 2 (u cs) = -2 a (1 +)
u = a (1 +) + cs = a + s (c + sa) = a + s f[a]
which is the same result as above.
A general formula with root x – a
We can deduce a general form that may be useful on occasion. When we substitute the point {af[a]} into the formula for the circle, then we can find r, and actually eliminate it.
(x u)² + f[x]² = r² = (a u)² + f[a
f[x f[a = (a u)² – (x u
(f[x] f[a](f[x] + f[a]) = ((a u) – (x u)) ((a u) + (x u))
(f[x] f[a](f[x] + f[a]) = (a x) (a + x 2u)
f[x] f[a] = (a x) (a + x 2u) / (f[x] + f[a])
f[x] f[a] = (x a) (2u – x – a) / (f[x] + f[a]) … (* general)
f[x] f[a] = (x a) q[x, a, u]
We cannot do much with this, since this is basically only true for x = a and f[x] – f[a] = 0. Yet we have this “branch cut”:
(1) q[x, a, u] = f[x] – f[a] / (a x) if x ≠ a
(2) q[a, a, u] potentially found by other means
If it is possible to “simplify” (1) into another expression Simplify[q[x, a, u]] without the division, then the tantalising question becomes whether we can “simply” substitute x = a. Or, if we were to find q[a, a, u] via other means in (2), whether it links up with (1). These are questions of continuity, and those are traditionally studied by means of limits.
Theorem on the slope
We can still use the general formula to state a theorem.
Theorem. If we can eliminate factors without division, then there is an expression q[x, a, u] such that evaluation at x = a gives the slope s of the line, or q[a, a, u] = s, such that at this point both curve and line are touching the same circle.
Proof. Eliminating factors without division in above general formula gives:
q[x, a, u] (2u – x – a) / (f[x] + f[a])
Setting x = a gives:
q[a, a, u] = (u – a) / f[a]
And the above s = (u – a) / f[a] implies that q[a, a, u] = s. QED
This theorem gives us the general form of the incline (tangent).
y[x, a, u] = (x – a) q[a, a, u] + f[a] … (* incline)
y[x, a, u] = (x – a) (u – a) / f[a] + f[a
PM. Dynamic division satisfies the condition “without division” in the theorem. For, the term “division” in the theorem concerns the standard notion of static division.
Corollary. Polynomials as the showcase
Polynomials are the showcase. For polynomials p[x], there is the polynomial remainder theorem:
When a polynomial p[x] is divided by (x a) then the remainder is p[a].
(Also, x – a is called a “divisor” of the polynomial if and only if p[a] = 0.)
Using this property we now have a dedicated proof for the particular case of polynomials.
Corollary. For polynomials q[a] = s, with no need for u.
Proof. Now, p[x] – p[a] = 0 implies that – is a root, and then there is a “quotient” polynomial q[x] such that:
p[x] – p[a] = (x a) q[x]
From the general theorem we also have:
p[x] – p[a] = (x a) q[x, a, u]
Eliminating the common factor (x – a) without division and then setting x = a gives q[a] = q[a, a, u] = s. QED
We now have a sound explanation why this polynomial property gives us the slope of the polynomial at that point. The slope is given by the incline (tangent), and it must also be slope of the polynomial because of the mutual touching of the same circle.
See the earlier discussion about techniques to eliminate factors of polynomials without division. We have seen a new technique here: comparing the coefficients of factors.
Second corollary
Since q[x] is a polynomial too, we can apply the polynomial remainder theorem again, and thus we have q[x] = (x a) w[x] + q[a] for some w[x]. Thus we can write:
p[x] = (x a) q[x] + p[a
p[x] = (x a) ( (x – a) w[x] + q[a] ) + p[a] … (* Ruffini’s Rule twice)
p[x] = (x a w[x] + (x – a) q[a] + p[a] … (* Range’s proof)
p[x] = (x a w[x] + y[x, a] … (* with incline)
We see two properties:
• The repeated application of Ruffini’s Rule uses the indicated relation to find both s = q[a] and constant f[a], as we have seen in last discussion.
• Evaluating f[x] / (x a)² gives the remainder y[x, a], which is the formula for the incline.
Range’s proof method
Michael Range proves q[a] = s as follows (in this article (p406) or book (p32)). Take above (*) and determine the error by substracting the line y = s (x a) + p[a] :
error = p[x] – y = (x a w[x] + (x – a) q[a] – s (x a)
= (x a w[x] + (x – a) (q[a] – s)
The error = 0 has a root x = a with multiplicity greater than one if and only if s = q[a].
Direct application to the incline itself
Now that we have established this theory, there may be no need to refer to the circle explicitly. It can suffice to use the property of the double root. Michael Range (2014) gives the example of the incline (tangent) at x² at {a, a²}. The formula for the incline is:
f[x] – f[a] = s (x – a)
x² a² – s (x – a) = 0
(x – a) (x + a s) = 0
There is only a double root or (xa)² when s = 2a.
Working directly on the line allows us to focus on s, and we don’t need to determine q[x] and plug in x = a.
Michael Range (2011) clarifies – with thanks to a referee – that the “point-slope” form of a line was introduced by Gaspard Monge (1746-1818), and that Descartes apparently did not think about this himself and thus neither to plug in y = f [x] here. However, observe that we only can maintain that there must be a double root on this line form too, since {a, f[a]} still lies on a tangent circle.
[Addendum 2017-01-10: The later argument in a subsequent weblog entry becomes: If the function can be factored twice, then there is no need to refer to the circle. But when this would be equivalent to the circle then such a distinction is immaterial.]
Addendum. Example of function crossing a circle
When a circle touches a curve, it still remains possible that the curve crosses the circle. The original idea of two points merging together into an overlapping point then doesn’t apply anymore, since there is only one intersecting point on either side if the circle were smaller or bigger.
An example is the spline function g[x] = {If x < 0 then 4 – x² / 4 else 4 + x² / 4}. This function is C1 continuous at 0, meaning that the sections meet and that the slopes of the two sections are equal at 0, while the second and higher derivatives differ. The circle with center at {0, 0} and radius 4 still fits the point {0, 4}, and the incline is the line y = 4.
descartes-spline
An application of above algorithm would look at the sections separately and paste the results together. Thus this might not be the most useful example of crossing.
In this example there might be no clear two “overlapping” points. However, observe:
• Lines through {0, 4} might have three points with the curve, so that the incline might be seen as having three overlapping points.
• Points on the circle can always be seen as the double root solutions for tangency at that point.
Addendum. Discussion
There is still quite a conceptual distance between (i) the story about the two overlapping points on the circle and (ii) the condition of double roots in the error between line and polynomial.
The proof given by Range uses the double root to infer the slope of the incline. This is mathematically fine, but this deduction doesn’t contain a direct concept that identifies q[a] as the slope of an incline (tangent): it might be any line.
We see this distinction between concept and algorithm also in the direct application to Monge’s point-slope formulation of the line. Requiring a double root works, but we can only do so because we know about the theory about the tangent circle.
The combination of circle and line remains the fundamental reason why there are two roots. Thus the more general proof given above, that reasons from the circle and unpacks f[x]² – f[a]² into the conditions for incline and its normal, is conceptually more attractive. I am new to this topic and don’t know whether there are references for this general proof.
Conclusions
(1) We now understand where the double root comes from. See the earlier discussion on polynomials, Ruffini’s rule and the meaning of division (see the section on “method 2”).
(2) There, we referred to polynomial division, with the comment: “Remarkably, the method presumes x ≠ a, and still derives q[a]. I cannot avoid the impression that this method still has a conceptual hole.” However, we now observe that we can compare the values of the coefficients of the powers of x, whence we can avoid also polynomial division.
(3) There, we had a problem that developing p[x] = (x aw[x] + y[x, a] didn’t have a notion of tangency, in terms of Δf / Δx. However, we actually have a much older definition of tangency.
(4) The above states an algorithm and a general theorem with the requirements that must be satisfied.
(5) Cartesius wins from Fermat on this issue of the incline (tangent), and actually also on providing an exact method for polynomials, where Fermat introduced the problem of error.
(6) For trigonometry and exponentials we know that these can be written as power series, and thus the Cartesian method would also apply. However, the power series are based upon derivatives, and this would introduce circularity. However, the method of the dynamic quotient from 2007 still allows an algebraic result. The further development from Fermat into the approach with limits would become relevant for more complex functions.
PM. The earlier discussion referred to Peter Harremoës (2016) and John Suzuki (2005) on this approach. New to me (and the book unread) are: Michael Range (2011), the recommendable Notices, or the book (2015) – review Ruane (2016) – and Shen & Lin (2014).
Cartesius, Portrait by Frans Hals 1648
Cartesius, Portrait by Frans Hals 1648
Advertisements
We continue the earlier discussion on (1) differentials and (2) polynomials. There is also this earlier discussion about (static or dynamic) division.
At issue is: Can we avoid the use of limits when determining the derivative of a polynomial ?
A sub-issue is: Can we avoid division that requires a limit ?
We use the term incline instead of tangent (line), since this line can also cross a function and not just touch it.
We use H = -1, so that we can write x xH = xH x = 1 for x ≠ 0. Check that xH = 1 / x, that the use of H is much more effective and efficient. The use of 1 / x is superfluous since students must learn about exponents anyway.
Ruffini’s Rule
Ruffini’s Rule is a method not only to factor polynomials but also to isolate the factors. A generalised version is called “synthetic division” for the reason that it isn’t actually division. On wikipedia, Ruffini’s Rule is called “Horner’s Method“. On mathworld, the label “Horner’s Method” is used for something else but related again. My suggestion is to stick to mathworld.
Thus, the issue at hand would seem to have been answered by Ruffini’s Rule already. When we can avoid division then we don’t need a limit around it. However, our discussion is about whether this really answers our question and whether we really understand the answer.
Historical note
I thank Peter Harremoēs for informing me about both Ruffini’s Rule and some neat properties that we will see below. His lecture note in Danish is here. Surprising for me, he traced the history back to Descartes. Following this further, we can find this paper by John Suzuki, who identifies two key contributions by Jan Hudde in Amsterdam 1657-1658. Looking into my copy of Boyer “The history of the calculus” now, page 186, I must admit that this didn’t register to me when I read this originally, as it registers now. We see the tug and push of history with various authors and influences, and thus we should be cautious about claiming who did what when. Suzuki’s statement remains an eye-opener.
“We examine the evolution of the lost calculus from its beginnings in the work of Descartes and its subsequent development by Hudde, and end with the intriguing possibility that nearly every problem of calculus, including the problems of tangents, optimization, curvature, and quadrature, could have been solved using algorithms entirely free from the limit concept.” (John Suzuki)
Apparently Newton dropped the algebra because it didn’t work on trigonometry and such, but with modern set theory we can show that the algebraic approach to the derivative works there too. For the discussion below: check that limits can be avoided.
Division is also a way to isolate factors
When we have 2 x = 6, then we can determine 2 x = 2 3, and recognize the common factor 2. By the human eye, we can see that x = 3 and then we have isolated the factor 3. But in mathematics, we must follow procedures as if we were a computer programme. Hence, we have the procedure of eliminating 2, which is called division:
2H 2 x = 2H 2 3
x = 3
The latter example abuses the property that 2 is nonzero. We must actually check that the divisor is nonzero. If we don’t check then we get:
4 x = 9 x
4 x xH = 9 xH
4 = 9
Checking for zero is not as simple as it seems. Also expressions with only numbers might contain zero in hidden format, as for example (4 + 2 – 6)H. Thus it would seem to be an essential part of mathematics to develop a sound theory for the algebra of expressions and the testing on zero.
Calculus uses the limit around the difference quotient to prevent division by zero. But the real question might rather be whether we can isolate a factor. When we can isolate that factor without division that requires a limit, then we hopefully have a simpler exposition. Polynomials are a good place to start this enquiry.
Shifting to rings without division ?
The real numbers form a “field” and when we drop the idea of division, then we get a “ring“. Above 2 x = 6 might also be solved in a ring without division. For we can do:
2 x – 2 3 = 6 – 2 3
2 (x – 3) = 0
2 = 0 or x – 3 = 0
We again use that 2 ≠ 0. Thus x = 3.
This example doesn’t show a material difference w.r.t. the assumption of division by 2. We also used that 6 can be factored and that 2 was a common factor. Perhaps this is the more relevant notion. Whatever the case, it doesn’t seem to be so useful to leave the realm of the real numbers.
Properties of polynomials
Our setup has a polynomial p[x] with focus of attention at x = a with point {a, b} = {a, p[a]}. When we regard (xa) as a factor, then we get a “quotient” q[x] and a “remainder” r[x].
p[x] = (xa) q[x] + r[x]
It is a nontrivial issue that q and r are polynomials again (proof of polynomial division algorithm, or proofwiki). These proofs don’t use limits but assume that the divisor is nonzero. Thus we might be making a circular argument when we use that q and are polynomials to argue that limits aren’t needed. Examples can be given of polynomial long division. Such examples tend not to mention explicitly that the divisor cannot be zero. Nevertheless, let us proceed with what we have.
Since (xa) has degree 1, the remainder must be a constant, and thus be equal to p[a]. Thus the “core equation” is:
p[x] = (xa) q[x] + p[a] … (* core)
p[x] – p[a] = (xa) q[x]
At x = a we get 0 = 0 q[a], whence we are at a loss about how to isolate q[x] or q[a].
When we have defined derivatives via other ways, then we can check that the derivative of (*) is:
p’ [x] = q[x] + (xa) q’ [x]
p’ [a] = q[a]
We can also rewrite (*) so that it indeed looks like an difference quotient.
q[x] = (p[x] – p[a]) (xa)H …. (** slope = tan[θ], see Spiegel’s diagram)
We cannot divide by (x a) for x = a, for this factor would be zero.
PM. In the world of limits, we could define the derivative of p at a by taking the Limit[x → a, q[x]]. This generates again (Spiegel’s diagram):
q[a] = tan[α]
But our issue is that we want to avoid limits.
Incline
The incline of the polynomial at point {a, b} = {a, p[a]} is the line, with the same slope as the polynomial.
y – p[a] = s (x a) … (*** incline)
The difference between polynomial and incline might be called the error. Thus:
error = p[x] – y = (p[x] – p[a]) – (y – p[a])
= (x a) q[x] – s (x a)
= (x a) (q[x] – s)
When we take s = q[a] then:
error = p[x] – y = (x a) (q[x] – q[a])
Key question
A key question becomes: can we isolate q[x] by some method ? We already have (**), but this format contains the problematic division. Is there another way to isolate q ? There appear to be three ways. Likely these ways are essentially the same but emphasize different aspects.
Method 1. Dynamic quotient
The dynamic quotient manipulates the domain and relies on algebraic simplification. Instead of H we use D, with y xD = y // x.
q[x] = (p[x] – p[a]) (xa)D
means: we first take x ≠ a,
then take D = H, so that this is normal division again,
then simplify,
and then declare the result also valid for x = a.
The idea was presented in ALOE 2007 while COTP 2011 is a proof of concept. COTP shows that it works for polynomials, trigonometry, exponentials and recovered exponents (logarithms). For polynomials it is shown by means of recursion.
Looking at this from the current perspective of the polynomial division algorithm, then we can say that the method also works because division of a polynomial of degree n > 0 by a polynomial of degree m = 1 generates a neat polynomial of degree n m. Thus we can isolate q[x] indeed. Since q[x] is polynomial, substitution of x = a provides no problem.
The condition on manipulating the domain nicely plugs the hole in the polynomial division algorithm. It is actually necessary to prevent circularity.
Method 2. Incline
Via Descartes (and Suzuki’s article above) we understand that perpendicular to the incline (tangent) there is a line on which there is a circle that touches the incline too. This implies that (x a) must be a double root of the polynomial.
We may consider p[x] / (x a)2 and determine the remainder v[x]. The line y = v[x] then is the incline. Or, the equation of the tangent of the polynomial at point {a, p[a]}. It is relatively easy to determine the slope of this line, and then we have q[a].
Check the wikipedia example. In Mathematica we get PolynomialRemainder[x^3 – 12 x^2 – 42, (x – 1)^2, x] = -21 x – 32 indeed. At = 1, q[a] = -21.
This method assumes “algebraic ways” to separate quotient and remainder. We can find the slope for polynomials without using the limit for the derivative. Potentially the same theory is required for the simplification used in the dynamic quotient.
Remarkably, the method presumes x ≠ a, and still derives q[a]. I cannot avoid the impression that this method still has a conceptual hole.
Addendum 2017-01-11: By now we have identified these methods to isolate a factor “algebraically”:
1. Look at the form (powers) and coefficients. This is basically Ruffini’s rule, see below. Michael Range works directly with coefficients.
2. Dynamic quotient that relies on the algebra of expressions.
3. Divide away nonzero factors so that only the problematic factor remains that we need to isolate. (This however is a version of the dynamic quotient, so why not apply it directly ?)
An example of the latter is p[x] = x^3 – 6 x^2 + 11 x – 6. Trial and error or a graph indicates that zero’s are at 1 and 2. Assuming that those points don’t apply we can isolate p[x] / ((x – 1) (x – 2)) = (x – 3) by means of long division. Subsequently we have identified the separate factors, and the total is p[x] = (x – 1) (x – 2) (x – 3).
Check also that “division” is repeated subtraction, whence the method is fairly “algebraic” by itself too.
Addendum 2016-12-26: However, check the next weblog entry.
PM 1. General method to find the slope
The traditional method is to use the derivative p'[x] = 3 x^2 – 24 x, find slope p‘[1] = -21, and construct the line y = -21 (x – 1) + p[1]. This method remains didactically preferable since it applies to all functions.
PM 2. Double root in error too
If p[x] = 0 has solution x = a, then the latter is called a root, and we can factor p[x] = (x a) q[x] with remainder zero.
For example, p[x] – p[a] = 0 has solution x = a. Thus p[x] – p[a] = (x a) q[x] with remainder zero.
Also q[x] – q[a] = 0 has solution x = a. Thus q[x] – q[a] = (x a) u[x] with remainder zero.
Thus the error has a double root.
error = p[x] – y = (x a)2 u[x]
Unfortunately, this insight only allows us to check a given line y = s x + c, for then we can eliminate y.
Method 3. Ruffini’s Rule
See above for the summary of Ruffini’s Rule and the links. For the application below you might want to become more familiar with it. Check why it works. Check how it works, or here.
The observation of the double root generates the idea of applying Ruffini’s Rule twice.
I don’t think that it would be so useful to teach this method in highschool. Mathematics undergraduates and teachers better know about its existence, but that is all. The method might be at the core of efficient computer programmes, but human beings better deal with computer algebra at the higher level of interface.
The assumption that x a goes without saying, but it remains useful to say it, because at some stage we still use q[a], and we better be able to explain the paradox.
Application of Ruffini’s Rule to the derivative
Let us use the example of Ruffini’s Rule at MathWorld to determine the incline (tangent) to their example polynomial 3 x^3 – 6 x + 2, at x = 2. They already did most of the work, and we only include the derivative.
The first round of application gives us p[a] = p[2] = 14, namely the constant following from MathWorld.
A second round of application gives the slope, q[a] = 30.
2 | 3 6 6
6 24
3 12 30
Using the traditional method, the derivative is p’ [x] = 9 x^2 – 6, with p‘[2] = 30.
The incline (tangent) in both cases is y = 30 (x – 2) + 14 = 30 x – 46.
The major conceptual issue
The major conceptual issue is: while s is the slope of a line, and we take s = q[a], why would we call q[a] the slope of the polynomial at x = a ? Where is the element of “inclination” ? We might have just a formula of a line, without the notion of slope that fits the function. In other words, q[a] is just a number and no concept.
The key question w.r.t. this issue of the limit – and whether division causes a limit – is not quite w.r.t. Ruffini’s Rule but with the definition of slope, first for the line itself, secondly now for the incline of a function. We represent the incline of a function with a line, but only because it has the property of having a slope and angle with the horizontal axis.
The only reason to speak about an incline is the recognition that above equation (**) generates a slope. We are only interested in q[a] = tan[α] since this is the special case at the point x a itself.
It is only after this notion of having a slope has been established, that Ruffini’s Rule comes into play. It focuses on “factoring as synthetic division” since that is how it has been designed. There is nothing in Ruffini’s Rule that clarifies what the calculation is about. It is an algorithm, no more.
Thus, for the argument that q[a] provides the slope at x = a, we still need the reasoning that first x ≠ a, then find a general expression q[x] and only then find x = a.
And this is what the algebraic approach to the derivative was designed to accomplish.
Addendum 2016-12-26: See the next weblog entry for another approach to the notion of the incline (tangency).
Ruffini’s Rule corroborates that the method works, but that it works had already been shown. However, it is likely a mark of mathematics that all these approaches are actually quite related. In that perspective, the algebraic approach to the derivative supplements the application of Ruffini’s Rule to clarify what it does.
Obviously, mathematicians have been working in this manner for ages, but implicitly. It really helps to state explicitly that the domain of a function can be manipulated around (supposed) singularities. The method can be generalised as
f ‘[x] = {Δf x)Dthen set Δx = 0} = {Δf // Δx, then set Δx = 0}
It also has been shown to work for trigonometry and the exponential function.
Joost Hulshof & Ronald Meester (2010) suggest to introduce the derivative in highschool by means of polynomials (pdf p16-17). My problem is that they first hide the limit and then let it ambush the student. Thus:
• When they say that “you can present the derivative for polynomials without limits” then they mean this only for didactics and not for mathematics.
• But they are not trained in didactics, so they are arguing this as a hobby, as mathematicians with a peculiar view on didactics. They provide a course for mathematics teachers, but this concerns mathematics and not didactics.
• They only hide the limit, but they do not deny that fundamentally you must refer to limits.
• Eventually they still present the limit to maintain exactness, but then it has no other role than to link up to a later course (perhaps only for mathematicians).
• Thus, they make the gap between “didactics” and proper “mathematics” larger on purpose.
• This is quite different from the algebraic approach (see here), that really avoids limits, and also argues that limits are fundamentally irrelevant (for the functions used in highschool).
I have invited Hulshof since at least 2013 (presentation at the NVvW study day) to look at the algebraic approach to the derivative. He refuses to look into it and write a report on it, though he was so kind to look at this recent skirmish.
Hulshof refers to his approach perhaps as sufficient. It is quite unclear what he thinks about all this, since he doesn’t discuss the proposal of the algebraic approach to the derivative.
Let me explain what is wrong with their approach with the polynomials.
Please let mathematicians stop infringing upon didactics of mathematics. It is okay to check the quality of mathematics in texts that didacticians produce, but stop this “hobby” of second-guessing.
PM. A recent text is Hulshof & Meester (2015), “Wiskunde in je vingers“, VU University Press (EUR 29.95). Potentially they have improved upon the exposition in the pdf, but I am looking at the pdf only. Meester lists this book as “books mathematics” (p14). Hulshof calls it “concepts from mathematics” with “uncommon viewpoints” for “teacher, student” and for “education and curriculum”. When you address students then it is didactics. It is unclear why VU University Press thinks that he and Meester are qualified for this.
The incline
A standard notation for a line is y = c + s x, for constant c and slope s.
The line gives us the possibility of a definition of the incline (Dutch: richtlijn). An incline is defined for a function and a point. An incline of a function f at a point {a, f[a]} is a line that gives the slope of that function at that point.
It is wrong to say that the incline “has the same slope”. You are not comparing two lines. You are looking at the slope. You only know the slope of the function because of the incline (the line with that slope).
Incline versus tangent
The incline is often called the tangent. Students tend to think that tangents cannot cross the function, while tangents actually can. Thus incline can be a better term.
Hulshof & Meester refer in horror to the Oxford Advance Learner’s Dictionary, that has:
ERROR “Tangent: (geometry) a straight line that touches the outside of a curve but does not cross it. The cart track branches off at a tangent.”
I don’t think that “incline” will quickly replace “tangent”. But it is useful to discuss the issue with students and offer them an alternative word if “tangent” continues to confuse them. It is useful to start a discussion with students by mentioning the (quite universal) intuition of not-crossing. An orange touches a table, and doesn’t cross it. But mathematically it would be quite complex to test whether there is any crossing or not. Thus it is simpler to focus on the idea of incline, straight course, alignment.
When you swing a ball and then let go, then the ball will continue in the incline of the last moment. The incline captures that idea, by giving the line with that very slope.
I thank Peter Harremoës for a discussion on this (quite universal) confusion by students (and the OALD) and potential alternative terms. (Incline is still a suggestion.) (The word “directive” was rejected as too confusing with “derivative”. But Dutch “richtlijn” is better than raaklijn.)
Polynomials and their division
A polynomial of degree n has powers of x of size n:
p[x] = c + s x + c2 x² + … + cn xn.
In this, we take c = c0 and s = c1. For n = 1 we get the line again. We allow that the line has s = 0, so that we can have a horizontal line, which would strictly be a polynomial of n = 0. There is also the vertical line, that cannot be represented by a polynomial.
If p[a] = 0 then x = a is called a zero of the polynomial. Then (x a) is called a factor, and the polynomial can be written as
p[x] = (x aq[x]
where q[x] is a polynomial of a lower degree.
If p[a] ≠ 0 then we can still try to factor with (x a) but then there will be a remainder, as p[x] = (x aq[x] + r[x]. When we consider p[x] – r[x] then x = a is a zero of this. Thus:
p[x] – r[x] = (x aq[x]
With polynomials we can do long division as with numbers. The following example is the division of x³ – 7x – 6 by x – 4 that generates a remainder.
purplemath-divisionIncline or tangent at a polynomial
Regard the polynomial p[x] at x = a, so that bp[a]. We consider point {a, b}. What incline does the curve have ?
(A) For the incline we have the line in {a, b}:
y b = s (x a)
(B) We have p[a] – b = 0 and thus x = a is a zero of the polynomial p[x] – b. Thus:
p[x] – b = (x aq[x]
(C) Thus (A) and (B) allow to assume y ≈ p[x] and to look at the common term x – a, “so that” (quotes because this is problematic):
s = q[a]
The example by Hulshof & Meester is p[x] = – 2 at the point {a, b} = {1, -1}.
p[x] – b = (x² – 2) – (-1) = – 1
Factor: ( – 1) = (x – 1) q[x]
Or divide: q[x] = ( – 1) / (x – 1) = x + 1
Substituting the value = a = 1 in x + 1 gives q[a] = q[1] = 2.
H&M apparently avoid division by using the process of factoring.
Later they mention the limiting process for the division: Limit[x → 1, q[x]] = Limit[x → 1, ( – 1) / (x – 1)] = 2.
Critique
As said, the H&M approach is convoluted. They have no background in didactics and they hide the limit (rather than explaining its relevance since they still deem it relevant).
Mathematically, they might argue that they don’t divide but only factor polynomials.
• But, when you are “factoring systematically” then you are actually dividing.
• When you use “realistic mathematics education” then you can approximate division by trial and error of repeated subtraction, but I don’t think that they propose this. See the “partial quotient method” and my comments.
• Addendum December 22: there is a way to look only at coefficients, Ruffini’s Rule, in wikipedia called Horner’s method. A generalisation is known as synthetic division, which expresses that it is no real division, but a method of factoring. (MathWorld has a different entry on “Horner’s method“.) See the next weblog entry.
When dividing systematically, you are using algebra, and you are assuming that a denominator like x – 1 isn’t zero but an abstract algebraic term. Well, this is precisely what the algebraic approach to the derivative has been proposing. Thus, their suggestion provides support for the algebraic approach, be it, that they do it somewhat crummy and non-systematically, whence it is little use to refer to this kind of support.
Didactically, their approach is undeveloped. They compare the slopes of the polynomial and the line, but there is no clear discussion why this would be a slope, or why you would make such a comparison. Basically, you can compare polynomials of order n with those of order m, and this would be a mathematical exercise, but devoid of interpretation. For didactics it does make sense to discuss: (a) the notion of “slope” of a function is given by the incline, (b) we want to find the incline of a polynomial for a particular reason (e.g. instantaneous velocity), (c) we can find it by a procedure called “derivative”. NB. My book Conquest of the Plane starts with surface and integral, and only later looks at slopes.
A main criticism however is also that H&M overlooked the fundamental problem with the notion of a slope of a line itself. They rely on some hidden issues here too. I discussed this recently, and repeat this below.
PM. See a discussion of approximating a function by polynomials. Observe that we are not “approximating” a function by its incline now. At {a, b} the values and slope are exactly the same, and there is nothing approximate about this. Only at other points we might say that there is an “error” by looking at the incline rather than the polynomial, but we are not looking at such errors now, and this would be a quite different topic of discussion.
Copy of December 8 2016: Ray through an origin
Let us first consider a ray through the origin, with horizontal axis x and vertical axis y. The ray makes an angle α with the horizontal axis. The ray can be represented by a function as y = f [x] = s x, with the slope s = tan[α]. Observe that there is no constant term (c = 0).
2016-12-08-ray
The quotient y / x is defined everywhere, with the outcome s, except at the point x = 0, where we get an expression 0 / 0. This is quite curious. We tend to regard y / x as the slope (there is no constant term), and at x = 0 the line has that slope too, but we seem unable to say so.
There are at least three responses:
(i) Standard mathematics then takes off, with limits and continuity.
(ii) A quick fix might be to try to define a separate function to find the slope of a ray, but we can wonder whether this is all nice and proper, since we can only state the value s at 0 when we have solved the value elsewhere. If we substitute y when it isn’t a ray, or example x², then we get a curious construction, and thus the definition isn’t quite complete since there ought to be a test on being a ray.
2016-12-10-slopeofray
(iii) The algebraic approach uses the following definition of the dynamic quotient:
y // x ≡ { y / x, unless x is a variable and then: assume x ≠ 0, simplify the expression y / x, declare the result valid also for the domain extension x = 0 }
Thus in this case we can use y // x = s x // x = s, and this slope also holds for the value x = 0, since this has now been included in the domain too.
Line with constant
When we have a line y = c + s x, then a hidden part of the definition is that the slope is s everywhere, even though we cannot compute (y c) / x when x = 0. (One might say: “This is what it means to be linear.”)
When we look at x = a and determine the slope by taking a difference Δx, then we get:
b = c + s a
b + Δy = c + s (a + Δx)
Δy = Δx
The slope at would be s but is also Δy / Δx, undefined for Δx = 0
Thus, the slope of a line is either given as s for all points (or, critically for x = 0 too) (perhaps with a rule: if you find a slope somewhere then it holds everywhere), or we must use limits.
The latter can be more confusing when s has not been given and must be calculated from other resources. In the case of differentials dy = s dx, the notation dy / dx causes conceptual problems when s itself is found by a limit on the difference quotient.
Conclusions
1. The H&M claim that polynomials can be used without limits is basically a didactic claim since they evidently still rely on limits (perhaps to fend of fellow mathematicians). This didactic claim is a wild-goose chase since they are not involved in didactics research.
2. If they really would hold that factoring can be done systematically without division, then they might have a point, but then they still must give an adequate explanation how you get from (A) & (B) to (C). Saying that differences are “small” is not enough (not even for polynomials). Addendum December 22: see the next weblog entry on Ruffini’s rule.
3. They present this for a “reminder course in mathematics” for teachers of mathematics, but it isn’t really mathematics and it is neither useful for teaching mathematics.
4. A serious development that avoids limits and relies on algebraic methods, that covers the same area of polynomials but also trigonometry and exponential functions, is the algebraic approach to the derivative, available since 2007 with a proof of concept in Conquest of the Plane in 2011.
5. It is absurd that Hulshof & Meester neglect the algebraic approach. But they are mathematicians, and didactics is not their field of research. I think that the algebraic method provides a fundamental redefinition of calculus, but I prefer the realm of didactics above the realm of mathematics with its culture of contempt for empirical science.
6. The H&M exposition and neglect is just an example of Holland as Absurdistan, and the need to boycott Holland till the censorship of science by the directorate of the Dutch Central Planning Bureau has been lifted.
I wouldn't want to be caught before a blackboard like that (Screenshot UChicago)
I wouldn’t want to be caught before a blackboard like that (Screenshot UChicago)
I am looking for a story on continuity and limits that can be told in junior highschool and still makes sense. We would like an isomorphy between space and numbers. For some aspects, mathematical theory sends us to number theory, and for isomorph aspects, mathematical theory sends us to topology. It is awkward to have to translate similar notions, and to eliminate the overload of notions that are not directly relevant for this search for this junior highschool story.
For example, topology has rephrased results into statements on open and closed sets and boundaries, but I am wondering whether that is an effective manner of communication, when the relevant distinction is whether you are assuming a well-ordening or not. But I am not at home in number theory or topology. These comments on continuity and limits have been caused precisely because I am feeling the water.
Basically, I already designed such a story on continuity and limits (pdf, weblog), but now I am noticing that I can include a question mark on infinitesimals.
Addendum December 16
This weblog text is a rewrite of yesterday’s text.
Principle
The framework contains both the handling of real numbers on the calculator and a development of theory.
Example 1
Also in junior highschool, we want students to be aware that 0.999…. = 1.000…. so that these are the same number. You can see this by checking 3 * 1/3 = 1.
Example 2
When we approximate numbers with n the number of decimals, then these basically are like the natural numbers, and there remains a well ordering. Numbers are δ[n] = 10^(-n) apart.
When we shift to the use of the infinite number of decimals then we lose this “infinitesimal”. At issue is now whether the infinitesimal can be retained in some manner.
Standard definition of density causes contradiction
Discussing the continuum and the set of real numbers R recently, I suggested (here, property (a)) that R would be a dense set, according to the standard definition of density. This definition is that for any two elements x < y there would be at least one z between, as x < z < y. This would allow you to make cuts everywhere.
Oops. I retract.
Wikipedia (no source but a portal) has:
“From the ZFC axioms of set theory (including the axiom of choice) one can show that there is a well order of the reals.”
I don’t know quite what to think about this. Elsewhere I deduced that ZFC is inconsistent. But perhaps in a revised set theory, the well order can be retained.
We would like R to have a well-order for finite intervals too. Thus every number x has a next number x’. When you select y = x’ then you couldn’t find anything between x and y. This contradicts above statement on density.
Thus, the standard definition of density doesn’t fit a well-ordered R.
Designing a new definition for density of the reals R
We can design a new definition of density.
• The standard definition is useful for the rationals Q. If we restrict your freedom to making cuts along Q, then we are safe again. In this manner, the distinction between rational and irrational numbers is useful to explain a property of R.
• R is defined as “more dense” because Q is dense w.r.t. that original definition ((a)).
• This proposal is quite similar to the Dedekind cut, with the distinction that we now allow that R might retain a well-ordering. That is, this issue on the ordering is no longer forced by the standard definition of density.
Surprise consequence as a bonus
Switching to another notion of density, generates the bonus that we have more scope to introduce the infinitesimal.
When every number x has a next x’, then we can define the infinitesimal as the difference:
δ = x’ x
It also means that an open set (a, b) can also be seen as a closed set [a + δ, b – δ].
Wikipedia (no source but a portal) claims today:
“The standard ordering ≤ of any real interval is not a well ordering, since, for example, the open interval (0, 1) ⊆ [0,1] does not contain a least element.”
Yet now we have (0, 1) = [δ, 1 – δ] and the least element is δ. Only the intervals with negative infinity might be excluded, check (-∞, ∞).
Properties of these infinitesimals
Some properties are:
(1) We still have 0.999…. = 1.000…..
(2) A current statement is that a line consists of points, and each point is a co-ordinate without length. We now can better express that length consists of a sum of short lengths. A sum of these infinitesimals Σδ makes sense if we regard it as the sum from x = 0 to x = 1 for x‘ – x. The trick is that the length is determined by the statement on x and not by the coefficient of δ.
(3) Using H = -1, then δ δH = 1. That is, δ ≠ 0, and thus there is no problem with division. The discussion about differentials is quite different from the discussion about these (new) infinitesimals. Much time has been spent in history in looking whether there might be a connection, but there isn’t.
Separate arithmetic for infinity and infinitesimal
Students already know that they cannot apply the rules of arithmetic to infinity. E.g. ∞ + ∞ = ∞. The same now holds for above hypothetical notion of the infinitesimal.
Property (2) carries over from δ[n] with n the number of decimals. Property (1) arises when n → ∞ . Potentially, these notions cannot be combined without some conflict.
We are accustomed to think that any real number can be divided. But e.g. δ / 2 is nonsense because it gives the distance between two numbers, and there is nothing smaller. Thus, the normal rules for arithmetic only hold for reals that are not these infinitesimals.
With δ = x’ x we also want to consider y = (x / n). When the numbers are halved for n = 2, is the distance halved or isn’t it halved ? In the approximation δ[n] the distance can become smaller when more digits are included. For an infinite number of digits, presumably, the distance cannot be halved. Thus δ = y’ y. Multiplication by n gives nδ = n (x / n)x. Thus x’ = n (x / n)‘ – nδ + δ for any n. This would make (most) sense by the choice δ = 0 and x’ / n = (x / n)‘. But then we are back in the classical approach again, without the well ordering. (The next number is the number itself.)
Persumably, we can argue that n * δ is as problematic as δ / n, though. The notion of Σδ namely has been solved by putting the consideration of length into the Σ sign.
I don’t know yet whether it is sufficient (consistent) to state δ = x’ and that the rules for arithmetic don’t apply to δ like they don’t apply to ∞. Potentially, we might write δH → ∞ (and this doesn’t mean that δ ∞ → 1).
All this depends upon whether we can develop a consistent set of definitions. Students at junior highschool might agree that they aren’t much interested in that.
Thus, it might only be in senior highschool, when we discuss the “classical” approach to the reals, that has (a, b) as an open interval only. We would be forced to this not because of the definition of density but because of the rules of arithmetic.
Conclusion
In itself, notions like these are not world shocking but they would tend to fit the intuitions of space and number for junior highschool.
At some point of history, the main stream in mathematics has opted for an approach to the reals so that they have no well ordering. The obstacle of the standard definition of density can be removed, as shown above. A problem still resides in arithmetic with δ = x’ x. It is not clear to me whether this can be resolved. It is not clear to me neither whether it is okay to have benign neglect till senior highschool, and face the consequences of losing the well ordering only there.
|
{
"url": "https://boycottholland.wordpress.com/tag/limit/",
"source_domain": "boycottholland.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2019-22",
"warc_metadata": {
"Content-Length": "145835",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YMKE5H5AJG5NZZH3ABJP3YWAMC2HKKDF",
"WARC-Concurrent-To": "<urn:uuid:8e604c42-0512-4574-ae2c-43d57305fcb1>",
"WARC-Date": "2019-05-27T07:13:23Z",
"WARC-IP-Address": "192.0.78.13",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7OUYV6S62ZYJCGMPXRKQNHJ5QSMD3P5C",
"WARC-Record-ID": "<urn:uuid:f6fb7eec-b729-4909-940e-1658e9904db0>",
"WARC-Target-URI": "https://boycottholland.wordpress.com/tag/limit/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f98ac4ae-a33a-4a90-a1da-250729d8d26b>"
},
"warc_info": "isPartOf: CC-MAIN-2019-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-109-171-211.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
8,
9,
29,
30,
149,
150,
515,
516,
727,
728,
747,
748,
1503,
1504,
1546,
1547,
1726,
1727,
1776,
1777,
2632,
2633,
2736,
2737,
2755,
2756,
2884,
3096,
3275,
3302,
3303,
3413,
3414,
3433,
3434,
3862,
3863,
3884,
3885,
3904,
3905,
3916,
3917,
4149,
4150,
4152,
4153,
4180,
4181,
4366,
4367,
4390,
4391,
4436,
4437,
4542,
4543,
4640,
4641,
4704,
4705,
4742,
4743,
4940,
4941,
5069,
5070,
5080,
5081,
5424,
5425,
5456,
5457,
5561,
5562,
5591,
5592,
5634,
5635,
5680,
5681,
5850,
5851,
5881,
5882,
5907,
5908,
5955,
5956,
5991,
5992,
6026,
6027,
6205,
6206,
6241,
6242,
6266,
6267,
6327,
6328,
6373,
6374,
6421,
6422,
6491,
6492,
6522,
6523,
6648,
6649,
6708,
6709,
6767,
6768,
7130,
7131,
7152,
7153,
7210,
7211,
7459,
7460,
7536,
7537,
7577,
7578,
7599,
7600,
7628,
7629,
7695,
7696,
7761,
7762,
7822,
7823,
7865,
7866,
8035,
8036,
8075,
8076,
8171,
8172,
8243,
8322,
8323,
8413,
8414,
8471,
8472,
8584,
8585,
8610,
8611,
8650,
8651,
8683,
8684,
8795,
8796,
9049,
9050,
9222,
9223,
9240,
9241,
9402,
9403,
9427,
9428,
9505,
9506,
9575,
9576,
9650,
9651,
9674,
9675,
9827,
9923,
9944,
9945,
10111,
10112,
10166,
10167,
10200,
10201,
10292,
10293,
10334,
10335,
10602,
10603,
10628,
10629,
10651,
10652,
10675,
10676,
10726,
10727,
10836,
10837,
11234,
11235,
11487,
11488,
11536,
11537,
11828,
11829,
12196,
12197,
12214,
12215,
12379,
12380,
12464,
12465,
12600,
12701,
12722,
12723,
12916,
12917,
13160,
13161,
13406,
13407,
13766,
13767,
13779,
13780,
13955,
13956,
14303,
14304,
14492,
14493,
14595,
14596,
14777,
14778,
15211,
15212,
15467,
15468,
15507,
15508,
15547,
15548,
15550,
15551,
15553,
15554,
15569,
15570,
15721,
15722,
15816,
15817,
15879,
15880,
15996,
15997,
16221,
16222,
16237,
16238,
16616,
16617,
16885,
16886,
16902,
16903,
17601,
17602,
17984,
17985,
18234,
18235,
18277,
18278,
18603,
18604,
18620,
18621,
18627,
18628,
18769,
18770,
18780,
18781,
18796,
18797,
18803,
18804,
19094,
19095,
19419,
19420,
19457,
19458,
19629,
19630,
19650,
19651,
19665,
19666,
19691,
19692,
19729,
19730,
20019,
20020,
20046,
20047,
20230,
20231,
20255,
20256,
20738,
20739,
20854,
20855,
20896,
20897,
20921,
20922,
21009,
21010,
21108,
21109,
21137,
21138,
21152,
21153,
21230,
21231,
21311,
21312,
21380,
21381,
21526,
21527,
21541,
21542,
21589,
21590,
21598,
21599,
21709,
21710,
21749,
21750,
21829,
21830,
21876,
21877,
21900,
21901,
21920,
21921,
21949,
21950,
21989,
21990,
22003,
22004,
22282,
22283,
22310,
22311,
22438,
22439,
22467,
22468,
22496,
22497,
22553,
22554,
22569,
22570,
22620,
22621,
22854,
22855,
23207,
23208,
23358,
23359,
23377,
23378,
23617,
23618,
23873,
23874,
24020,
24021,
24269,
24270,
24409,
24410,
24508,
24509,
24651,
24716,
24902,
24903,
25246,
25247,
25354,
25355,
25414,
25415,
25454,
25455,
25675,
25676,
25707,
25708,
25831,
25832,
25932,
25933,
26025,
26026,
26060,
26061,
26092,
26093,
26200,
26201,
26226,
26227,
26409,
26410,
26498,
26499,
26817,
26818,
26983,
26984,
27032,
27033,
27249,
27250,
27354,
27355,
27413,
27414,
27430,
27448,
27464,
27465,
27550,
27551,
27623,
27624,
27651,
27652,
27985,
27986,
28358,
28359,
28560,
28561,
28865,
28866,
29036,
29037,
29123,
29124,
29233,
29234,
29558,
29559,
29795,
29796,
29860,
29861,
29939,
29940,
30153,
30154,
30305,
30535,
30631,
30797,
30889,
31081,
31082,
31323,
31324,
31512,
31513,
31584,
31585,
31783,
31784,
32309,
32310,
32322,
32323,
32398,
32399,
32645,
32646,
32858,
32859,
32882,
32883,
33052,
33053,
33141,
33142,
33287,
33288,
33808,
33809,
33984,
33985,
34274,
34275,
34306,
34307,
34359,
34360,
34396,
34397,
34663,
34664,
34791,
34792,
34808,
34809,
34855,
34856,
35039,
35040,
35064,
35065,
35213,
35214,
35268,
35269,
35382,
35383,
35431,
35432,
35446,
35447,
35531,
35532,
35552,
35553,
35686,
35687,
35696,
35697,
35775,
35776,
35809,
35810,
35842,
35843,
35887,
35888,
35951,
35952,
36017,
36018,
36133,
36134,
36143,
36144,
36320,
36321,
36406,
36407,
36488,
36710,
37038,
37039,
37465,
37466,
38182,
38183,
38397,
38398,
38845,
38846,
38893,
38894,
39174,
39175,
39190,
39191,
39475,
39476,
39512,
39513,
39582,
39583,
39994,
39995,
40017,
40018,
40020,
40021,
40023,
40024,
40108,
40109,
40268,
40269,
40420,
40421,
40440,
40441,
40653,
40654,
40740,
40741,
40753,
40754,
40778,
40779,
40787,
40788,
40854,
40855,
41050,
41051,
41305,
41306,
41318,
41590,
41945,
42119,
42412,
42762,
42980,
43061,
43062,
43143,
43144,
43616,
43617,
44022,
44023,
44182,
44183,
44204,
44205,
44256,
44257,
44267,
44268,
44372,
44373,
44383,
44384,
44540,
44541,
44551,
44552,
44731,
44732,
44901,
44902,
44954,
44955,
45281,
45282,
45299,
45300,
45340,
45341,
45463,
45464,
45624,
45625,
45848,
45849,
45920,
45921,
45975,
45976,
46019,
46020,
46265,
46356,
46583,
46615,
46616,
46732,
46733,
46824,
46825,
46834,
46835,
46922,
46923,
46972,
46973,
47131,
47132,
47272,
47273,
47308,
47309,
47330,
47331,
47368,
47369,
47752,
47753,
48055,
48056,
48107,
48108,
48277,
48278,
48447,
48448,
48713,
48714,
49307,
49308,
49476,
49477,
49700,
49701,
49863,
49864,
50114,
50115,
50126,
50127,
50265,
50266
],
"line_end_idx": [
8,
9,
29,
30,
149,
150,
515,
516,
727,
728,
747,
748,
1503,
1504,
1546,
1547,
1726,
1727,
1776,
1777,
2632,
2633,
2736,
2737,
2755,
2756,
2884,
3096,
3275,
3302,
3303,
3413,
3414,
3433,
3434,
3862,
3863,
3884,
3885,
3904,
3905,
3916,
3917,
4149,
4150,
4152,
4153,
4180,
4181,
4366,
4367,
4390,
4391,
4436,
4437,
4542,
4543,
4640,
4641,
4704,
4705,
4742,
4743,
4940,
4941,
5069,
5070,
5080,
5081,
5424,
5425,
5456,
5457,
5561,
5562,
5591,
5592,
5634,
5635,
5680,
5681,
5850,
5851,
5881,
5882,
5907,
5908,
5955,
5956,
5991,
5992,
6026,
6027,
6205,
6206,
6241,
6242,
6266,
6267,
6327,
6328,
6373,
6374,
6421,
6422,
6491,
6492,
6522,
6523,
6648,
6649,
6708,
6709,
6767,
6768,
7130,
7131,
7152,
7153,
7210,
7211,
7459,
7460,
7536,
7537,
7577,
7578,
7599,
7600,
7628,
7629,
7695,
7696,
7761,
7762,
7822,
7823,
7865,
7866,
8035,
8036,
8075,
8076,
8171,
8172,
8243,
8322,
8323,
8413,
8414,
8471,
8472,
8584,
8585,
8610,
8611,
8650,
8651,
8683,
8684,
8795,
8796,
9049,
9050,
9222,
9223,
9240,
9241,
9402,
9403,
9427,
9428,
9505,
9506,
9575,
9576,
9650,
9651,
9674,
9675,
9827,
9923,
9944,
9945,
10111,
10112,
10166,
10167,
10200,
10201,
10292,
10293,
10334,
10335,
10602,
10603,
10628,
10629,
10651,
10652,
10675,
10676,
10726,
10727,
10836,
10837,
11234,
11235,
11487,
11488,
11536,
11537,
11828,
11829,
12196,
12197,
12214,
12215,
12379,
12380,
12464,
12465,
12600,
12701,
12722,
12723,
12916,
12917,
13160,
13161,
13406,
13407,
13766,
13767,
13779,
13780,
13955,
13956,
14303,
14304,
14492,
14493,
14595,
14596,
14777,
14778,
15211,
15212,
15467,
15468,
15507,
15508,
15547,
15548,
15550,
15551,
15553,
15554,
15569,
15570,
15721,
15722,
15816,
15817,
15879,
15880,
15996,
15997,
16221,
16222,
16237,
16238,
16616,
16617,
16885,
16886,
16902,
16903,
17601,
17602,
17984,
17985,
18234,
18235,
18277,
18278,
18603,
18604,
18620,
18621,
18627,
18628,
18769,
18770,
18780,
18781,
18796,
18797,
18803,
18804,
19094,
19095,
19419,
19420,
19457,
19458,
19629,
19630,
19650,
19651,
19665,
19666,
19691,
19692,
19729,
19730,
20019,
20020,
20046,
20047,
20230,
20231,
20255,
20256,
20738,
20739,
20854,
20855,
20896,
20897,
20921,
20922,
21009,
21010,
21108,
21109,
21137,
21138,
21152,
21153,
21230,
21231,
21311,
21312,
21380,
21381,
21526,
21527,
21541,
21542,
21589,
21590,
21598,
21599,
21709,
21710,
21749,
21750,
21829,
21830,
21876,
21877,
21900,
21901,
21920,
21921,
21949,
21950,
21989,
21990,
22003,
22004,
22282,
22283,
22310,
22311,
22438,
22439,
22467,
22468,
22496,
22497,
22553,
22554,
22569,
22570,
22620,
22621,
22854,
22855,
23207,
23208,
23358,
23359,
23377,
23378,
23617,
23618,
23873,
23874,
24020,
24021,
24269,
24270,
24409,
24410,
24508,
24509,
24651,
24716,
24902,
24903,
25246,
25247,
25354,
25355,
25414,
25415,
25454,
25455,
25675,
25676,
25707,
25708,
25831,
25832,
25932,
25933,
26025,
26026,
26060,
26061,
26092,
26093,
26200,
26201,
26226,
26227,
26409,
26410,
26498,
26499,
26817,
26818,
26983,
26984,
27032,
27033,
27249,
27250,
27354,
27355,
27413,
27414,
27430,
27448,
27464,
27465,
27550,
27551,
27623,
27624,
27651,
27652,
27985,
27986,
28358,
28359,
28560,
28561,
28865,
28866,
29036,
29037,
29123,
29124,
29233,
29234,
29558,
29559,
29795,
29796,
29860,
29861,
29939,
29940,
30153,
30154,
30305,
30535,
30631,
30797,
30889,
31081,
31082,
31323,
31324,
31512,
31513,
31584,
31585,
31783,
31784,
32309,
32310,
32322,
32323,
32398,
32399,
32645,
32646,
32858,
32859,
32882,
32883,
33052,
33053,
33141,
33142,
33287,
33288,
33808,
33809,
33984,
33985,
34274,
34275,
34306,
34307,
34359,
34360,
34396,
34397,
34663,
34664,
34791,
34792,
34808,
34809,
34855,
34856,
35039,
35040,
35064,
35065,
35213,
35214,
35268,
35269,
35382,
35383,
35431,
35432,
35446,
35447,
35531,
35532,
35552,
35553,
35686,
35687,
35696,
35697,
35775,
35776,
35809,
35810,
35842,
35843,
35887,
35888,
35951,
35952,
36017,
36018,
36133,
36134,
36143,
36144,
36320,
36321,
36406,
36407,
36488,
36710,
37038,
37039,
37465,
37466,
38182,
38183,
38397,
38398,
38845,
38846,
38893,
38894,
39174,
39175,
39190,
39191,
39475,
39476,
39512,
39513,
39582,
39583,
39994,
39995,
40017,
40018,
40020,
40021,
40023,
40024,
40108,
40109,
40268,
40269,
40420,
40421,
40440,
40441,
40653,
40654,
40740,
40741,
40753,
40754,
40778,
40779,
40787,
40788,
40854,
40855,
41050,
41051,
41305,
41306,
41318,
41590,
41945,
42119,
42412,
42762,
42980,
43061,
43062,
43143,
43144,
43616,
43617,
44022,
44023,
44182,
44183,
44204,
44205,
44256,
44257,
44267,
44268,
44372,
44373,
44383,
44384,
44540,
44541,
44551,
44552,
44731,
44732,
44901,
44902,
44954,
44955,
45281,
45282,
45299,
45300,
45340,
45341,
45463,
45464,
45624,
45625,
45848,
45849,
45920,
45921,
45975,
45976,
46019,
46020,
46265,
46356,
46583,
46615,
46616,
46732,
46733,
46824,
46825,
46834,
46835,
46922,
46923,
46972,
46973,
47131,
47132,
47272,
47273,
47308,
47309,
47330,
47331,
47368,
47369,
47752,
47753,
48055,
48056,
48107,
48108,
48277,
48278,
48447,
48448,
48713,
48714,
49307,
49308,
49476,
49477,
49700,
49701,
49863,
49864,
50114,
50115,
50126,
50127,
50265,
50266,
50747
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 50747,
"ccnet_original_nlines": 745,
"rps_doc_curly_bracket": 0.00126116001047194,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4435935318470001,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009634389542043209,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26770421862602234,
"rps_doc_frac_unique_words": 0.16461998224258423,
"rps_doc_mean_word_length": 4.20920467376709,
"rps_doc_num_sentences": 528,
"rps_doc_symbol_to_word_ratio": 0.0012351799523457885,
"rps_doc_unigram_entropy": 5.831462383270264,
"rps_doc_word_count": 9039,
"rps_doc_frac_chars_dupe_10grams": 0.008673479780554771,
"rps_doc_frac_chars_dupe_5grams": 0.07503876835107803,
"rps_doc_frac_chars_dupe_6grams": 0.0433148518204689,
"rps_doc_frac_chars_dupe_7grams": 0.016479620710015297,
"rps_doc_frac_chars_dupe_8grams": 0.010933839716017246,
"rps_doc_frac_chars_dupe_9grams": 0.009251710027456284,
"rps_doc_frac_chars_top_2gram": 0.007753570098429918,
"rps_doc_frac_chars_top_3gram": 0.0011827499838545918,
"rps_doc_frac_chars_top_4gram": 0.0033642600756138563,
"rps_doc_books_importance": -5398.37060546875,
"rps_doc_books_importance_length_correction": -5398.37060546875,
"rps_doc_openwebtext_importance": -2683.836669921875,
"rps_doc_openwebtext_importance_length_correction": -2683.836669921875,
"rps_doc_wikipedia_importance": -1777.863525390625,
"rps_doc_wikipedia_importance_length_correction": -1777.863525390625
},
"fasttext": {
"dclm": 0.169538676738739,
"english": 0.9325217008590698,
"fineweb_edu_approx": 2.4115865230560303,
"eai_general_math": 0.9991044998168945,
"eai_open_web_math": 0.6978512406349182,
"eai_web_code": 0.8838639259338379
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "515.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
},
"secondary": {
"code": "516.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-6,969,575,086,568,178,000 |
PDA
View Full Version : De-recruitment Script
harIII
03-06-2009, 11:53 AM
I need a script to remove an NPC from your party once they have joined you for K1.
Giant Graffiti
03-06-2009, 12:33 PM
I think there are already scripts to remove the entire party in K1, but this should also work.
void main()
{
RemoveAvailableNPC(2);
}
This removes the character in Carth's spot. The numbers for other party members are:
BASTILA = 0
CANDEROUS = 1
CARTH = 2
HK_47 = 3
JOLEE = 4
JUHANI = 5
MISSION = 6
T3_M4 = 7
ZAALBAR = 8
HK-47Droid
03-12-2009, 11:21 AM
Just a quick reply to this- can you import new people instead of them? like get rid of Zalbarr (cuz he isnt an important part until his planet, and that can be the first completed) for a new HK-47 but with a different skin? cuz i wanna roam around with two vicious killing machines.
Giant Graffiti
03-12-2009, 12:08 PM
Yes. For more information go here. (http://lucasforums.com/showthread.php?t=131944)
|
{
"url": "http://www.lucasforums.com/archive/index.php/t-196245.html",
"source_domain": "www.lucasforums.com",
"snapshot_id": "crawl=CC-MAIN-2014-49",
"warc_metadata": {
"Content-Length": "3830",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KPKPLLLZEOQTPRRDZIA2PAJE6FMYW2NZ",
"WARC-Concurrent-To": "<urn:uuid:d9303add-6e3b-4516-9333-2e057ca52672>",
"WARC-Date": "2014-11-28T18:26:51Z",
"WARC-IP-Address": "76.73.74.242",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:2YP5LDCPWE4YLBXOAAEA466X5AKG74QL",
"WARC-Record-ID": "<urn:uuid:2f66c89a-5c1c-4a43-87e5-5a2515c4a78d>",
"WARC-Target-URI": "http://www.lucasforums.com/archive/index.php/t-196245.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e32f9666-9418-4207-98b4-a1b966aeeb30>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-23-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-49\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for November 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
1,
5,
6,
48,
49,
50,
57,
78,
161,
162,
177,
198,
293,
294,
306,
308,
331,
333,
334,
419,
420,
432,
446,
456,
466,
476,
487,
499,
509,
521,
522,
533,
554,
837,
838,
853,
874
],
"line_end_idx": [
1,
5,
6,
48,
49,
50,
57,
78,
161,
162,
177,
198,
293,
294,
306,
308,
331,
333,
334,
419,
420,
432,
446,
456,
466,
476,
487,
499,
509,
521,
522,
533,
554,
837,
838,
853,
874,
957
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 957,
"ccnet_original_nlines": 37,
"rps_doc_curly_bracket": 0.0020898599177598953,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27966102957725525,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08898305147886276,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.37711864709854126,
"rps_doc_frac_unique_words": 0.7628204822540283,
"rps_doc_mean_word_length": 4.596153736114502,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.680979251861572,
"rps_doc_word_count": 156,
"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.02231520041823387,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -103.03947448730469,
"rps_doc_books_importance_length_correction": -103.03947448730469,
"rps_doc_openwebtext_importance": -64.60482025146484,
"rps_doc_openwebtext_importance_length_correction": -51.33783721923828,
"rps_doc_wikipedia_importance": -45.78959655761719,
"rps_doc_wikipedia_importance_length_correction": -45.78959655761719
},
"fasttext": {
"dclm": 0.41139155626296997,
"english": 0.8963090777397156,
"fineweb_edu_approx": 1.1871381998062134,
"eai_general_math": 0.31720882654190063,
"eai_open_web_math": 0.14173054695129395,
"eai_web_code": 0.01711452007293701
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-8,147,785,594,330,953,000 |
Vanilla 1 is no longer supported or maintained. If you need a copy, you can get it here.
HackerOne users: Testing against this community violates our program's Terms of Service and will result in your bounty being denied.
Why are banned users allowed to participate in all discussions by default?
edited January 2007 in Vanilla 1.0 Help
I notice that when creating a category that by default, members who are banned are allowed to participate. Is banned even necessary as a choice? I mean, if I ban someone I shouldn't have to worry about permissions, they should be banned from everything until I choose otherwise.
Comments
• Banned isn't a special role in any way, it's a role just like the others, and the default for any new category is to allow everyone. If you don't like it, you can just click on the "select none" link and check only those you want to allow. :)
• Yeh, that struck me as being funny, too.
• Banned isn't a special role in any way, it's a role just like the others, and the default for any new category is to allow everyone.
While I see the logic in this, common sense tells us that it should be set up by default to at least prevent someone from posting, if not banning them from viewing discussions as well.
• By the way, you do realise that "participate" doesn't equal starting discussions or posting comments, right? It's just able to view a certain category.
• bjrn is right, even if it meant more, the fact that banned users do not have "can sign in" permission trumps all others.
• I'm confused by the "participate" thing (I'm ill and it's not anywhere on the Edit Roles & Permissions page...), so if you could explain the point a little more...
I think the point I and a few others here are trying to make here, is that when you are banned, you should be banned! Cannot see/do anything, or waste anything but the most meagre amount of b/w from the server. At least that's how I understand the word. I mean we could easily create a role ourselves called "Posting/Participation Restricted" that basically does everything the "Banned" role does by default - doesn't allow people to post ANYTHING but still allows them to read/search through the forum.
• Participation determines if someone can view a certain category. Say you have a category that only admins can participate in, that means only admins can see that that category exists and post in it.
By default the "Banned" role can't do anything, because they can't sign in, which means they have the same reading/writing permissions as anyone not signed in. So it doesn't really matter in which categories you allow them to participate, because they'll never really sign in.
Oh, and participation isn't under Roles & Permissions, it's under Categories.
• Thanks bjrn, that's been very helpful. However...
By default, Banned is allowed to participate in categories! So once again, we're back at the place we don't really want to be. Yes yes, I know we can manually turn it off each time we create a category, but not everyone will know this, so I reckon we need to get something better in place for default.
• I still dont see what the problem is here...banned users (assuming you set it as such, and if not there's not much point banning them) CANT log in. Stat. With that barrier in place their permissions once logged in are irrelevant. You could give them every permission under the sun but if they cant actually authenticate themselves it's utterly useless.
• Yes yes yes, I take back everything I said earlier (I reserve the right to change my mind again). I'm suffering from some god awful bug and it's making me trip out a little...
• *hands stash some vicks
• so, let me try to wrap my small brain around this one... if I am banned from this forum, for example, my username/password will not work, correct? Or are you saying that there won't even be a sign in option? How is Vanilla making the determination that I am banned at that point? IP addy? It seems to me that a user would actually have to log-in in order for the forum to recognize that they are banned, otherwise they are just guests. Not trying to make this super complicated, but my point is that 'banned' should be unchecked by default, that is blocking all forum benefits/privileges by default. Maybe you can explain a situation where I would want a banned user to be able to 'participate' in the forum... seems like a contradiction to me.
• Your username and password wont work, correct. You would have the same access rights as an unauthenticated user - on this forum you'd still be able to browse but not be able to post (etc). On a private forum, you'd just sit looking at the login screen.
• Which seems completely reasonable...
• but shouldn't that box be left unchecked by default, and have the system admin opt the banned user in vs. having opt the banned user out? not trying to get semantic, but rather I think that a banned user should fall to the bottom of the important people list and be administered at the profile level vs. the category level. just my two cents, probably not worth much more than that. thanks for bouncing this around
• Well, in that case default would have to be unchecked for all roles. But I guess you could make an extension that would uncheck the participation checkbox for any roles that don't have sign-in rights. :)
• It's possible but it's really just unnecessary work...vanilla doesnt know the banned role is any more or less special than the super master administrative god role, to it theyre just lines of boolean values...
This discussion has been closed.
|
{
"url": "https://open.vanillaforums.com/discussion/5065/why-are-banned-users-allowed-to-participate-in-all-discussions-by-default",
"source_domain": "open.vanillaforums.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "108779",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7EAAXMLHUMOCZF6FRCHLS5FGTEOAMYVT",
"WARC-Concurrent-To": "<urn:uuid:387d90b5-0d14-4f86-8f1c-9daa866ec143>",
"WARC-Date": "2022-05-28T14:01:56Z",
"WARC-IP-Address": "162.159.138.78",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KPKELOL7XX7L237YDPX2CGTXKHD4BUZ2",
"WARC-Record-ID": "<urn:uuid:c4b151c9-eb2c-445c-ad8f-84c2d40dfdfd>",
"WARC-Target-URI": "https://open.vanillaforums.com/discussion/5065/why-are-banned-users-allowed-to-participate-in-all-discussions-by-default",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:513509b3-6d90-4c02-a334-57f4b9aa6e16>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-40\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
89,
222,
223,
298,
299,
339,
618,
619,
628,
629,
876,
921,
1058,
1059,
1248,
1404,
1529,
1697,
1698,
2206,
2409,
2410,
2691,
2692,
2774,
2828,
2829,
3135,
3492,
3672,
3700,
4449,
4706,
4747,
5166,
5374,
5588
],
"line_end_idx": [
89,
222,
223,
298,
299,
339,
618,
619,
628,
629,
876,
921,
1058,
1059,
1248,
1404,
1529,
1697,
1698,
2206,
2409,
2410,
2691,
2692,
2774,
2828,
2829,
3135,
3492,
3672,
3700,
4449,
4706,
4747,
5166,
5374,
5588,
5620
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5620,
"ccnet_original_nlines": 37,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5028712153434753,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022149300202727318,
"rps_doc_frac_lines_end_with_ellipsis": 0.1315789520740509,
"rps_doc_frac_no_alph_words": 0.16817063093185425,
"rps_doc_frac_unique_words": 0.36703741550445557,
"rps_doc_mean_word_length": 4.4014153480529785,
"rps_doc_num_sentences": 62,
"rps_doc_symbol_to_word_ratio": 0.008203449659049511,
"rps_doc_unigram_entropy": 5.308165073394775,
"rps_doc_word_count": 989,
"rps_doc_frac_chars_dupe_10grams": 0.04732368141412735,
"rps_doc_frac_chars_dupe_5grams": 0.04732368141412735,
"rps_doc_frac_chars_dupe_6grams": 0.04732368141412735,
"rps_doc_frac_chars_dupe_7grams": 0.04732368141412735,
"rps_doc_frac_chars_dupe_8grams": 0.04732368141412735,
"rps_doc_frac_chars_dupe_9grams": 0.04732368141412735,
"rps_doc_frac_chars_top_2gram": 0.018607860431075096,
"rps_doc_frac_chars_top_3gram": 0.013783600181341171,
"rps_doc_frac_chars_top_4gram": 0.010107969865202904,
"rps_doc_books_importance": -498.0274658203125,
"rps_doc_books_importance_length_correction": -498.0274658203125,
"rps_doc_openwebtext_importance": -313.8704528808594,
"rps_doc_openwebtext_importance_length_correction": -313.8704528808594,
"rps_doc_wikipedia_importance": -195.20582580566406,
"rps_doc_wikipedia_importance_length_correction": -195.20582580566406
},
"fasttext": {
"dclm": 0.3011114001274109,
"english": 0.968328058719635,
"fineweb_edu_approx": 1.3333635330200195,
"eai_general_math": 0.5969535112380981,
"eai_open_web_math": 0.3354215621948242,
"eai_web_code": 0.2109784483909607
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "302.22",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "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": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
5,993,326,968,117,213,000 |
Philosophy Stack Exchange is a question and answer site for those interested in logical reasoning. Join them; it only takes a minute:
Sign up
Here's how it works:
1. Anybody can ask a question
2. Anybody can answer
3. The best answers are voted up and rise to the top
I was wondering if it is the practice to compensate a user for a glitch in your system that penalized them. Namely, if Stack Exchange had a glitch which caused some of my awards to disappear, should they fix the glitch and add those awards back to my account? I would think so but I am getting a fairly large number of disagreements on MetaStackOverflow to my Question Here: http://meta.stackexchange.com/questions/167523/glitch-where-did-my-gold-badge-go#comment492656_167523
share|improve this question
closed as off topic by Dennis, Joseph Weissman Feb 14 '13 at 5:58
Questions on Philosophy Stack Exchange are expected to relate to philosophy within the scope defined by the community. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about reopening questions here.If this question can be reworded to fit the rules in the help center, please edit the question.
I've voted to close. As far as I can tell, this is not a question about philosophy. Rather, it is a question asking us to evaluate the policies and (possible) glitches of the Stackexchange format. I have voted to close rather than asking for an edit because I do not see how this question could be turned into a question of philosophical interest. – Dennis Feb 14 '13 at 4:45
2
@DaveNewton (and Albert) Please take this to chat. – Dennis Feb 14 '13 at 5:21
1
@Dennis I already flagged the post for comment cleanup (including mine, which I don't want to delete in isolation). – Dave Newton Feb 14 '13 at 5:22
2
Just in passing: this community isn't a court of last resort for SE; we're in no way arbiters of SE policy (or morality for that matter!) -- we're just philosophy students/teachers... – Joseph Weissman Feb 14 '13 at 6:03
1
In my opinion, with any online services such as SO, you never actually "own" the badge. This is their ground, so they can do whatever the hell they want with the badge they have let you use, including taking them away for absolutely no reason at all. Morality or ethics does not come into play here since us users don't have any enforceable claim towards anything they owned. Nevertheless, a bug is a bug, and while they might try to fix and compensate glitches as a sign of good will, they are under no obligation - moral, legal, nor ethical - to do so. – Lie Ryan Feb 15 '13 at 21:18
Why would you link to my comment?
I didn't say they wouldn't give it back to you, I explained Animuson's comment regarding that he has never heard of an award being given manually.
You are avoiding the real-world cost/ROI equation for something that has zero intrinsic value.
Would it be nice to have your badge back? Sure. Is it worth it? Different question, and different people will answer it differently. We understand your answer. You'll have to wait for their answer, and no answer is an answer–but you're assuming short turnaround on something that isn't of critical importance.
Ethical actions have trade-offs: it sucks to kill, but would you to save a room of kids? Where do you draw the line between the action and the action's cost to you, and to others? Let's say it took an SE employee an hour to fix your badge issue: is your worthless gold badge worth $50? $100? $150? To who? To you? To SE?
Is it worth the cost of sounding like you're whining across multiple sites, posts, and comments? Who pays that cost? Not us–you do, in your public image, ephemeral as it is.
share|improve this answer
I think the real question would then be (if you are going to put such high values on the time of fixing something like this) is it worth this to them to fix a glitch that would happen to any user who created accounts so long ago that they were not associated because that system was not yet set up and they are now associating them. This is a glitch that could affect many users, especially their loyal users that have been with SE for years. I guess it boils down to what are they willing to do to provide the best user experience possible to their users and what are they not willing to do. – Albert Renshaw Feb 14 '13 at 4:58
1
@AlbertRenshaw Fixing the glitch itself could cost hundreds or thousands of dollars; I'm speaking only of manually awarding a badge (assuming it's a simple matter of DB manipulation for which there is likely no UI). Yes, it does boil down to ROI, which is more or less what I've been saying, and Animuson's further comments explain more of the technical reasons. – Dave Newton Feb 14 '13 at 5:00
Well if changing a database value (and maybe a minute of verification research) costs hardly anything would you agree that it would be worth it to keep a client of almost 2 years satisfied with your services, do you think the client (I) should be compensated (nothing additional, just my badges back) It took me almost 2 years to earn my gold badge, I have a job, I give expert advice in programming free-of-charge for months on end, this is why I place a high value on earning that badge... It is something I value, yes it's worth nothing in reality, but I think value is in the eye of the beholder. – Albert Renshaw Feb 14 '13 at 5:03
@AlbertRenshaw Exactly: you think it's really important; I suspect you're in the minority precisely because it isn't. You think I don't have a job? You think I get paid to help other people on SO? Or am I not an expert? Come on: what on earth is making you think this is as important as you seem to think it is??? – Dave Newton Feb 14 '13 at 5:06
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://philosophy.stackexchange.com/questions/6050/morals-glitch-in-your-system-penalizes-user-undeservingly-do-you-compensate",
"source_domain": "philosophy.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "79702",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NIPBZJSYG3PMOY6PI5666ZUPDMVT4TN5",
"WARC-Concurrent-To": "<urn:uuid:5bc5fd58-8509-4f04-905f-be867205dc67>",
"WARC-Date": "2016-07-27T03:43:43Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BE2JJS7AXVYES2ERKFKNW5RMH6MZYMSX",
"WARC-Record-ID": "<urn:uuid:565ececf-9a17-40de-9d2c-d66f2a7374b1>",
"WARC-Target-URI": "http://philosophy.stackexchange.com/questions/6050/morals-glitch-in-your-system-penalizes-user-undeservingly-do-you-compensate",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:89912765-bb86-4560-9853-357e67d7baec>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-27-174.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-30\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for July 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
134,
135,
143,
164,
196,
220,
275,
276,
753,
754,
782,
783,
849,
850,
1241,
1242,
1247,
1623,
1627,
1706,
1710,
1859,
1863,
2084,
2088,
2674,
2675,
2709,
2710,
2857,
2858,
2953,
2954,
3264,
3265,
3586,
3587,
3761,
3762,
3788,
3793,
4422,
4426,
4822,
4827,
5464,
5469,
5816,
5817
],
"line_end_idx": [
134,
135,
143,
164,
196,
220,
275,
276,
753,
754,
782,
783,
849,
850,
1241,
1242,
1247,
1623,
1627,
1706,
1710,
1859,
1863,
2084,
2088,
2674,
2675,
2709,
2710,
2857,
2858,
2953,
2954,
3264,
3265,
3586,
3587,
3761,
3762,
3788,
3793,
4422,
4426,
4822,
4827,
5464,
5469,
5816,
5817,
5907
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5907,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.45406225323677063,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027334850281476974,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19969627261161804,
"rps_doc_frac_unique_words": 0.3964049220085144,
"rps_doc_mean_word_length": 4.3396406173706055,
"rps_doc_num_sentences": 58,
"rps_doc_symbol_to_word_ratio": 0.0022778999991714954,
"rps_doc_unigram_entropy": 5.4324822425842285,
"rps_doc_word_count": 1057,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05144974961876869,
"rps_doc_frac_chars_dupe_6grams": 0.05144974961876869,
"rps_doc_frac_chars_dupe_7grams": 0.023108789697289467,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.008720300160348415,
"rps_doc_frac_chars_top_3gram": 0.013734470121562481,
"rps_doc_frac_chars_top_4gram": 0.017658600583672523,
"rps_doc_books_importance": -560.148193359375,
"rps_doc_books_importance_length_correction": -560.148193359375,
"rps_doc_openwebtext_importance": -375.519287109375,
"rps_doc_openwebtext_importance_length_correction": -375.519287109375,
"rps_doc_wikipedia_importance": -260.32708740234375,
"rps_doc_wikipedia_importance_length_correction": -260.32708740234375
},
"fasttext": {
"dclm": 0.37504082918167114,
"english": 0.9727684259414673,
"fineweb_edu_approx": 1.0102667808532715,
"eai_general_math": 0.3592209815979004,
"eai_open_web_math": 0.26995593309402466,
"eai_web_code": 0.00651120999827981
}
}
|
{
"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": "170",
"labels": {
"level_1": "Philosophy and psychology",
"level_2": "Ethics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
3,568,650,535,795,701,000 |
Super User is a question and answer site for computer enthusiasts and power users. It's 100% free, no registration required.
Sign up
Here's how it works:
1. Anybody can ask a question
2. Anybody can answer
3. The best answers are voted up and rise to the top
I have a need to sync Active Directory information with another system. I need to pull out a list of AD users, and all their info (first name, last name, email -- anything stored with their record in AD, essentially.)
I did this once before -- years ago -- and it involved running a command line utility to export the AD user database to an XML file, which I then parsed.
Is this still the right way to do it, or have things changed in the intervening years? Any chance the domain controller has some sort of real-time Web service now?
share|improve this question
What OS are you using? 2003 or 2008? – KCotreau Jun 13 '11 at 22:31
2003 or 2008? Have you looked at dsget.exe, dsquery.exe or csvde.exe yet? – goblinbox Jun 13 '11 at 22:33
I'd also be curious what you plan to do with the data. That might change someone's potential answer as to the best tool for the job. – Patrick S. Jun 13 '11 at 23:30
PowerShell in the way to go. The Get-Aduser (or the Quest equiv - get-Qaduser) command will easily get the user information and powershell will export to csv, xml, etc.
Your next best option are the DS* utilities (dsget, dssearch, etc) will find user info as well. They work well, but Powershell is the wave of the future and you'll find a lot of help for it these days.
share|improve this answer
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://superuser.com/questions/296706/whats-the-optimal-method-to-extract-a-list-of-users-and-their-information-from",
"source_domain": "superuser.com",
"snapshot_id": "crawl=CC-MAIN-2016-18",
"warc_metadata": {
"Content-Length": "71847",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZHUKM22WFD3RX7TUN3MVHUEFDYYTAG52",
"WARC-Concurrent-To": "<urn:uuid:b6bddd9c-5c30-4a8b-bd60-a9f393b7eedc>",
"WARC-Date": "2016-05-03T11:13:32Z",
"WARC-IP-Address": "104.16.127.192",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4D3UYTM5JJD2QDGSQKN2ULIVBVXFSZ2C",
"WARC-Record-ID": "<urn:uuid:9166cc28-8e49-4adf-a225-e3c07f23a162>",
"WARC-Target-URI": "http://superuser.com/questions/296706/whats-the-optimal-method-to-extract-a-list-of-users-and-their-information-from",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ade76b8f-21df-4de1-9ee1-e8c0317a80da>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-239-7-51.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
125,
126,
134,
155,
187,
211,
266,
267,
485,
486,
640,
641,
805,
806,
834,
839,
907,
912,
1018,
1023,
1189,
1190,
1359,
1360,
1562,
1563,
1589,
1590,
1602,
1603,
1605,
1613,
1614,
1692,
1693
],
"line_end_idx": [
125,
126,
134,
155,
187,
211,
266,
267,
485,
486,
640,
641,
805,
806,
834,
839,
907,
912,
1018,
1023,
1189,
1190,
1359,
1360,
1562,
1563,
1589,
1590,
1602,
1603,
1605,
1613,
1614,
1692,
1693,
1783
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1783,
"ccnet_original_nlines": 35,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3891625702381134,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029556650668382645,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22906404733657837,
"rps_doc_frac_unique_words": 0.5862069129943848,
"rps_doc_mean_word_length": 4.238244533538818,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.932530879974365,
"rps_doc_word_count": 319,
"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.011094669811427593,
"rps_doc_frac_chars_top_3gram": 0.015532540157437325,
"rps_doc_frac_chars_top_4gram": 0.01997040957212448,
"rps_doc_books_importance": -167.696533203125,
"rps_doc_books_importance_length_correction": -161.41851806640625,
"rps_doc_openwebtext_importance": -104.3587646484375,
"rps_doc_openwebtext_importance_length_correction": -104.3587646484375,
"rps_doc_wikipedia_importance": -72.42594146728516,
"rps_doc_wikipedia_importance_length_correction": -71.0799560546875
},
"fasttext": {
"dclm": 0.07782304286956787,
"english": 0.9173269867897034,
"fineweb_edu_approx": 1.2879081964492798,
"eai_general_math": 0.00005162000161362812,
"eai_open_web_math": 0.11110938340425491,
"eai_web_code": -0.000008340000022144523
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
2,784,219,995,476,266,000 |
Public | Automated Build
Last pushed: 3 days ago
Short Description
Short description is empty for this repo.
Full Description
OpenVPN for Docker
the original project - jpetazzo/dockvpn and it has its own automatic build on dockerhub.
Quick instructions:
CID=$(docker run -d --privileged -p 1194:1194/udp -p 443:443/tcp umputun/dockvpn)
docker run -t -i -p 8080:8080 --volumes-from $CID umputun/dockvpn serveconfig
Now download the file located at the indicated URL. You will get a
certificate warning, since the connection is done over SSL, but we are
using a self-signed certificate. After downloading the configuration,
stop the serveconfig container. You can restart it later if you need
to re-download the configuration, or to download it to multiple devices.
The file can be used immediately as an OpenVPN profile. It embeds all the
required configuration and credentials. It has been tested successfully on
Linux, Windows, and Android clients. If you can test it on OS X and iPhone,
let me know!
Note: there is a bug in the Android Download Manager which prevents
downloading files from untrusted SSL servers; and in that case, our
self-signed certificate means that our server is untrusted. If you
try to download with the default browser on your Android device,
it will show the download as "in progress" but it will remain stuck.
You can download it with Firefox; or you can transfer it with another
way: Dropbox, USB, micro-SD card...
If you reboot the server (or stop the container) and you docker run
again, you will create a new service (with a new configuration) and
you will have to re-download the configuration file. However, you can
use docker start to restart the service without touching the configuration.
How does it work?
When the jpetazzo/openvpn image is started, it generates:
• Diffie-Hellman parameters,
• a private key,
• a self-certificate matching the private key,
• two OpenVPN server configurations (for UDP and TCP),
• an OpenVPN client profile.
Then, it starts two OpenVPN server processes (one on 1194/udp, another
on 443/tcp).
The configuration is located in /etc/openvpn, and the Dockerfile
declares that directory as a volume. It means that you can start another
container with the --volumes-from flag, and access the configuration.
Conveniently, jpetazzo/openvpn comes with a script called serveconfig,
which starts a pseudo HTTPS server on 8080/tcp. The pseudo server
does not even check the HTTP request; it just sends the HTTP status line,
headers, and body right away.
OpenVPN details
We use tun mode, because it works on the widest range of devices.
tap mode, for instance, does not work on Android, except if the device
is rooted.
The topology used is net30, because it works on the widest range of OS.
p2p, for instance, does not work on Windows.
The TCP server uses 192.168.255.0/25 and the UDP server uses
192.168.255.128/25.
The client profile specifies redirect-gateway def1, meaning that after
establishing the VPN connection, all traffic will go through the VPN.
This might cause problems if you use local DNS recursors which are not
directly reachable, since you will try to reach them through the VPN
and they might not answer to you. If that happens, use public DNS
resolvers like those of Google (8.8.4.4 and 8.8.8.8) or OpenDNS
(208.67.222.222 and 208.67.220.220).
Security discussion
For simplicity, the client and the server use the same private key and
certificate. This is certainly a terrible idea. If someone can get their
hands on the configuration on one of your clients, they will be able to
connect to your VPN, and you will have to generate new keys. Which is,
by the way, extremely easy, since each time you docker run the OpenVPN
image, a new key is created. If someone steals your configuration file
(and key), they will also be able to impersonate the VPN server (if they
can also somehow hijack your connection).
It would probably be a good idea to generate two sets of keys.
It would probably be even better to generate the server key when
running the container for the first time (as it is done now), but
generate a new client key each time the serveconfig command is
called. The command could even take the client CN as argument, and
another revoke command could be used to revoke previously issued
keys.
Docker Pull Command
Owner
umputun
Source Repository
|
{
"url": "https://hub.docker.com/r/umputun/dockvpn/",
"source_domain": "hub.docker.com",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "85287",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GP4UIHH4I6QCXQ75AWNF4QUB22QGYPM6",
"WARC-Concurrent-To": "<urn:uuid:18076cec-2e6d-478d-ac44-5f991f0d1688>",
"WARC-Date": "2017-11-20T22:02:02Z",
"WARC-IP-Address": "34.232.123.36",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CZCGKMFGTE2RNUKMYAJG3ZT7CLTWQUF7",
"WARC-Record-ID": "<urn:uuid:ce654d05-29c8-4ac5-bb38-f5ead3094442>",
"WARC-Target-URI": "https://hub.docker.com/r/umputun/dockvpn/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f747330e-45c9-4d36-bf8f-7381696f46f4>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-144-140-14.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-47\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for November 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
26,
50,
68,
110,
127,
128,
147,
148,
237,
238,
258,
259,
341,
419,
420,
487,
558,
628,
697,
770,
771,
845,
920,
996,
1009,
1010,
1078,
1146,
1213,
1278,
1347,
1417,
1453,
1454,
1522,
1590,
1660,
1736,
1737,
1755,
1756,
1814,
1815,
1846,
1865,
1914,
1971,
2002,
2003,
2074,
2087,
2088,
2153,
2226,
2296,
2367,
2433,
2507,
2537,
2538,
2554,
2555,
2621,
2692,
2703,
2704,
2776,
2821,
2822,
2883,
2903,
2904,
2975,
3045,
3116,
3185,
3251,
3315,
3352,
3353,
3373,
3374,
3445,
3518,
3590,
3661,
3732,
3803,
3876,
3918,
3919,
3982,
3983,
4048,
4114,
4177,
4244,
4309,
4315,
4316,
4336,
4342,
4350
],
"line_end_idx": [
25,
26,
50,
68,
110,
127,
128,
147,
148,
237,
238,
258,
259,
341,
419,
420,
487,
558,
628,
697,
770,
771,
845,
920,
996,
1009,
1010,
1078,
1146,
1213,
1278,
1347,
1417,
1453,
1454,
1522,
1590,
1660,
1736,
1737,
1755,
1756,
1814,
1815,
1846,
1865,
1914,
1971,
2002,
2003,
2074,
2087,
2088,
2153,
2226,
2296,
2367,
2433,
2507,
2537,
2538,
2554,
2555,
2621,
2692,
2703,
2704,
2776,
2821,
2822,
2883,
2903,
2904,
2975,
3045,
3116,
3185,
3251,
3315,
3352,
3353,
3373,
3374,
3445,
3518,
3590,
3661,
3732,
3803,
3876,
3918,
3919,
3982,
3983,
4048,
4114,
4177,
4244,
4309,
4315,
4316,
4336,
4342,
4350,
4367
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4367,
"ccnet_original_nlines": 104,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39045554399490356,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027114970609545708,
"rps_doc_frac_lines_end_with_ellipsis": 0.009523809887468815,
"rps_doc_frac_no_alph_words": 0.22451193630695343,
"rps_doc_frac_unique_words": 0.4219409227371216,
"rps_doc_mean_word_length": 4.841068744659424,
"rps_doc_num_sentences": 57,
"rps_doc_symbol_to_word_ratio": 0.0010845999931916595,
"rps_doc_unigram_entropy": 5.159931182861328,
"rps_doc_word_count": 711,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04183613881468773,
"rps_doc_frac_chars_dupe_6grams": 0.03253921866416931,
"rps_doc_frac_chars_dupe_7grams": 0.018593840301036835,
"rps_doc_frac_chars_dupe_8grams": 0.018593840301036835,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03253921866416931,
"rps_doc_frac_chars_top_3gram": 0.008715859614312649,
"rps_doc_frac_chars_top_4gram": 0.016269609332084656,
"rps_doc_books_importance": -387.7709655761719,
"rps_doc_books_importance_length_correction": -387.7709655761719,
"rps_doc_openwebtext_importance": -241.52052307128906,
"rps_doc_openwebtext_importance_length_correction": -241.52052307128906,
"rps_doc_wikipedia_importance": -184.38861083984375,
"rps_doc_wikipedia_importance_length_correction": -184.38861083984375
},
"fasttext": {
"dclm": 0.1304783821105957,
"english": 0.8945265412330627,
"fineweb_edu_approx": 2.053440809249878,
"eai_general_math": 0.5990914702415466,
"eai_open_web_math": 0.24137449264526367,
"eai_web_code": 0.7513570785522461
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-402,034,495,150,524,500 |
Voltix
Multipurpose WordPress Theme
Introduction
Thank you for purchasing a WordPress template. This documentation consists of several parts and covers the entire process of installing and setting up a WordPress website from scratch.
What is WordPress CMS?
WordPress is a free open-source blogging tool and content management system (CMS) based on PHP and MySQL. With its help you can create and administrate websites or powerful on-line applications without possessing any special technical skills. Due to the ease of use and flexibility, WordPress has become the most popular platform for website development. Learn More.
What is a WordPress Template?
WordPress template is a theme for the WordPress CMS platform. You can easily change your website appearance by installing a new WordPress template in a few easy steps. Despite its simplicity, a WordPress template contains all the necessary source files that can be altered the way you need.
Template Structure
The template package includes several folders. Let’s check what’s inside:
• theme - contains WordPress theme files.
• manual_install - contains files that make the WordPress website look like on our live demo.
• uploads - contains theme images.
• voltix.sql - database file (contains theme content).
• documentation.txt - contains documentation link information.
• info.txt - instructions on how to extract source files.
• license.txt - contains information about GPL license.
Preparation
Before installing a WordPress website, you need to get fully prepared. We recommend you to get the following aspects covered:
Software
Before you start working with the WordPress template, you should download the required software. You can check the required software on the template preview page.
• First of all, you will need the right software to extract files from the password protected sources_#########.zip archive. You can use WinZip 9 or a later version (if you have Windows OS) or Stuffit Expander 10 or a later version (if you have Mac OS).
• You might also need Adobe Photoshop. It is used to edit the source .PSD files in case you need to change the graphic design and images of the template.
• To edit the source code of the template, you can use code editors like Adobe Dreamweaver, Notepad++, Sublime Text, etc.
• To upload the files to a hosting server, you will need an FTP manager like Total Commander, FileZilla, CuteFTP, etc.
Hosting
Since WordPress CMS is a PHP/MySQL platform, you need to have the hosting server prepared for it.
In case you already have a hosting server, you need to check whether it is compatibile with WordPress hosting requirements or not. In other words, whether you can host a WordPress website with it.
Our theme itself requires Apache or Nginx hosting servers with the following configuration settings:
1. In define the following:
‘max_execution_time’ => 60;
‘memory_limit’ => 128;
‘post_max_size’ => 8;
‘upload_max_filesize’ => 8;
‘max_input_time’ => 45;
‘file_uploads’ => ‘on’;
‘safe_mode’ => ‘off’.
In the file .htaccess, ‘php_value max_execution_time’ => 60.
2. 50 MB of disk space.
3. Memory limit per process: 64mb (128mb or more recommended).
4. PHP and MySQL;
Minimal required version of PHP is 5.2.4 and MySQL 5. PHP 5.2 is already not safe as contains critical vulnerabilities that can be used to harm your website. Some Theme extensions will not work with PHP 5.2 and require version 5.4 or later.
Recommended settings are:
1. PHP 5.4;
2. MySQL 5.5 or later;
3. mod_rewrite;
4. php fopen;
5. suPHP.
You can also install WordPress on your PC or laptop through a local server. You can use the following software to create a local server: WAMP, AppServ, MAMP, etc. All of these support WordPress and can be installed as a regular software.
These tutorials will help you set up the local server:
1. How to install AppServ web development environment;
2. How to install WAMP web development environment;
3. How to install XAMP web development environment.
|
{
"url": "http://documentation.zemez.io/wordpress/projects/voltix/index.html",
"source_domain": "documentation.zemez.io",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "31197",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z2NCRSUMIV46XQ5ZXXMMDZ6NJ4NY7LVX",
"WARC-Concurrent-To": "<urn:uuid:769ebce3-9634-47a8-a389-f38190b10026>",
"WARC-Date": "2024-03-01T02:00:17Z",
"WARC-IP-Address": "172.67.138.126",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:K7VBA4HIDEXDUHMQACODRNYYO5PD2WW2",
"WARC-Record-ID": "<urn:uuid:d64df867-f4f7-4bde-ad1c-4c89eeabfb5e>",
"WARC-Target-URI": "http://documentation.zemez.io/wordpress/projects/voltix/index.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dd3a4d56-9e23-4b8a-8f18-be56938849cf>"
},
"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,
7,
8,
37,
38,
51,
52,
237,
238,
261,
262,
629,
630,
660,
661,
952,
953,
972,
973,
1047,
1048,
1092,
1190,
1231,
1292,
1357,
1417,
1475,
1476,
1488,
1489,
1615,
1616,
1625,
1626,
1789,
1790,
2050,
2210,
2338,
2463,
2464,
2472,
2473,
2571,
2572,
2769,
2770,
2871,
2872,
2902,
2903,
2939,
2940,
2971,
2972,
3002,
3003,
3039,
3040,
3072,
3073,
3105,
3106,
3136,
3137,
3206,
3207,
3233,
3234,
3299,
3300,
3320,
3321,
3566,
3567,
3597,
3598,
3614,
3641,
3661,
3679,
3693,
3694,
3936,
3937,
3996,
3997,
4056,
4112
],
"line_end_idx": [
7,
8,
37,
38,
51,
52,
237,
238,
261,
262,
629,
630,
660,
661,
952,
953,
972,
973,
1047,
1048,
1092,
1190,
1231,
1292,
1357,
1417,
1475,
1476,
1488,
1489,
1615,
1616,
1625,
1626,
1789,
1790,
2050,
2210,
2338,
2463,
2464,
2472,
2473,
2571,
2572,
2769,
2770,
2871,
2872,
2902,
2903,
2939,
2940,
2971,
2972,
3002,
3003,
3039,
3040,
3072,
3073,
3105,
3106,
3136,
3137,
3206,
3207,
3233,
3234,
3299,
3300,
3320,
3321,
3566,
3567,
3597,
3598,
3614,
3641,
3661,
3679,
3693,
3694,
3936,
3937,
3996,
3997,
4056,
4112,
4167
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4167,
"ccnet_original_nlines": 89,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3216520845890045,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027534419670701027,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25156447291374207,
"rps_doc_frac_unique_words": 0.4385964870452881,
"rps_doc_mean_word_length": 5.019138813018799,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0.011264080181717873,
"rps_doc_unigram_entropy": 5.10457181930542,
"rps_doc_word_count": 627,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.015252619981765747,
"rps_doc_frac_chars_dupe_6grams": 0.015252619981765747,
"rps_doc_frac_chars_dupe_7grams": 0.015252619981765747,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.015252619981765747,
"rps_doc_frac_chars_top_3gram": 0.011439469642937183,
"rps_doc_frac_chars_top_4gram": 0.009532890282571316,
"rps_doc_books_importance": -333.5686950683594,
"rps_doc_books_importance_length_correction": -333.5686950683594,
"rps_doc_openwebtext_importance": -214.17703247070312,
"rps_doc_openwebtext_importance_length_correction": -214.17703247070312,
"rps_doc_wikipedia_importance": -178.81109619140625,
"rps_doc_wikipedia_importance_length_correction": -178.81109619140625
},
"fasttext": {
"dclm": 0.026095930486917496,
"english": 0.813960075378418,
"fineweb_edu_approx": 2.3552281856536865,
"eai_general_math": 0.02878027968108654,
"eai_open_web_math": 0.044814590364694595,
"eai_web_code": 0.027584020048379898
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.7",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-8,463,138,181,137,285,000 |
Practical .NET
Agile Development: How to Pick the Most Valuable User Stories
Some of the critical problems for any team working in an Agile way are managing the backlog of user stories, converting epics into stories, preventing scope creep, and -- most importantly -- picking the most valuable stories for the next sprint. Impact mapping provides a visual solution for all these issues.
One of the most time-consuming problems faced by the teams I work on is just managing the list of potential changes. In software maintenance we used to call this "the backlog" and we knew we'd never get to the end of it. If we're not careful, just managing that backlog can become a significant task, taking time away from delivering functionality.
Right off the bat, applications worth doing tend to have lots of requests. The standard process in the Agile world for handling requests only makes this worse.
In the Agile world, user stories ("As an employee I want to be able to review my hours worked so that I can know when I'm earning overtime"), are the standard way to record the initial state of those requests. Good user stories are "small" (so that they can be implemented in a single sprint) and "valuable" (delivers something that matters). To get to "small" it's often necessary to break a story down into multiple stories (an "epic").
As I said, stories also tend to be "many." Splitting stories into epics just makes the "many" problem worse while creating the new problem of making sure that all of the stories that make up an epic maintain their relationship to one another.
Which all leads to the most challenging problem: making sure that you're picking the most valuable story/requirement/request to work on next out of this huge backlog. It's also the task that's the most important to the organization's (and your) success and it can be ... fractious. Plus, I often suspect that some of the requirements/user stories that make it into a sprint are an example of scope creep rather than a case of maximizing value for the organization.
On the various teams I've worked on, I've seen several solutions applied to address these problems. It's only recently, though, that I've been part of a comprehensive solution that addresses all of them: impact mapping.
Creating an Epic Hierarchy
Impact maps create a hierarchy that leverages the standard user story template of "<role>, <need/goal>, <reason>" to reduce the apparent size of the backlog. In an impact map, the highest level of organization is a goal that matters to the business and is too big to accomplish by implementing a single story. "Improving customer loyalty" would be a good example of a goal. A good goal has a measure associated with it so that the organization can tell if the goal has been achieved.
A goal that's big enough to be worthwhile will usually have multiple actors involved -- these correspond to the roles of the standard user story template. In a retail environment, improving customer loyalty would involve not only the customer but also the parts of the company that the customer interacts with (shipping, ordering, marketing). This is the second level of the hierarchy: the actors involved in achieving the goal.
For any actor, there are probably multiple "impacts" that need to be achieved. For example, if we want to improve customer loyalty, then we want customers to be more satisfied with us, to order more frequently from us and to buy more stuff when they do order from us.
These impacts form the third level of an impact map and correspond to both the needs and reasons portions of the standard user template. This means that an impact isn't a deliverable: "Improving shipping" isn't an impact; instead "improving shipping" is a deliverable that might contribute to achieving that "improved customer satisfaction" impact. A good impact also has a measure associated with it that allows the organization to tell when it's been achieved.
The fourth (and final) level is where our stories (and, eventually, our deliverables) live.
Improving Story Management
This process has multiple impacts on story management. When it comes to splitting stories, for example, the hierarchy provides a way of thinking about how a story can be broken up: by goal, by actor and by impact. A story could be attached to multiple impacts if it contributes to, for example, several goals.
This mapping also changes the process for picking stories for the next sprint. With an impact map in place, the obvious place to begin is with the organization's current, critical goal. Impact planning pulls all the stories for any goal together so that the team focuses on what currently is most important to the organization. Story management is simplified because, essentially, the team now focuses on managing goals and only has to pay attention to those stories associated with the critical goals.
Impact planning also allows stories to be reprioritized as times change. If an impact has been achieved, then unimplemented stories associated with the impact can be ignored (at least for now). As the organization's goals shift or are eliminated, stories associated move with the goals. Again, instead of managing stories, the team is managing goals.
Impact planning also helps manage the number of stories. For example, stories that can't be assigned to an impact on an actor that achieves a goal just disappear, reducing scope creep.
On top of all that, it's easy to make the hierarchy visual. When the hierarchy is drawn from the goal down to the story then, given any goal, it's easy to see what the relevant stories are.
One of the reasons that I find this approach appealing is that it reflects the way most of the teams I'm part of work. In practice, not all stories are equal and the stories that are "more equal than others" are the ones that are most closely associated with the organization's current goals. Within those goals, it's the roles and the benefit that often make one story more valuable to implement than another.
Credit Where Credit Is Due
If you're interested in more about this, there's a site devoted to it. If you want more comprehensive coverage, there's the book "Impact Planning: Making a Big Impact with Software Products and Projects." For more succinct coverage there's a good section on impact planning in "Fifty Quick Ideas To Improve Your User Stories" (which, despite its title, has a lot of worthwhile things to say about user stories though I think that it does focus a little too much on software for startups).
After all, isn't that what you want to do: Make an impact?
About the Author
Peter Vogel is a system architect and principal in PH&V Information Services. PH&V provides full-stack consulting from UX design through object modeling to database design. Peter tweets about his VSM columns with the hashtag #vogelarticles. His blog posts on user experience design can be found at http://blog.learningtree.com/tag/ui/.
comments powered by Disqus
Featured
• Community Dev Gives VS Code Python Some YAPF
The latest update to Python in Visual Studio Code includes a new extension for Python formatting that was contributed by a member of the open source community.
• Devs Demand Visual Studio 2022 Ditch Old .NET Framework Dependencies
Developers commenting on a Microsoft post about performance improvements in the upcoming .NET 8 demanded the company end Visual Studio 2022's dependency on the old .NET Framework.
• Microsoft Remakes Azure Quantum Dev Kit with Rust, 'and It Runs in the Browser!'
"The' tl;dr' is that we rewrote it (mostly) in Rust which compiles to WebAssembly for VS Code or the web, and to native binaries for Python."
• GitHub Copilot Chat Beta Opens Up for Everybody
GitHub Copilot Chat has taken another step toward general availability, as GitHub announced a beta offering previously accessible only by team/business customers is now available to individuals.
Subscribe on YouTube
|
{
"url": "https://visualstudiomagazine.com/articles/2019/08/23/user-stories.aspx",
"source_domain": "visualstudiomagazine.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "126876",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CMUULIA4TG2XX3HJK52VKKCEPG5MBBAI",
"WARC-Concurrent-To": "<urn:uuid:0983e40c-697b-4865-971b-76d4338ff0f2>",
"WARC-Date": "2023-09-26T15:55:34Z",
"WARC-IP-Address": "172.66.41.25",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MOUPPC3N4JTW6XCLGCKVJ7ACC27Z4EQ2",
"WARC-Record-ID": "<urn:uuid:f9448f20-7827-42f5-8dac-92bf238a7a0b>",
"WARC-Target-URI": "https://visualstudiomagazine.com/articles/2019/08/23/user-stories.aspx",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9e898925-84a2-4083-9d32-be6e6fc4a46f>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-18\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
15,
16,
78,
79,
389,
390,
739,
740,
900,
901,
1340,
1341,
1584,
1585,
2050,
2051,
2271,
2272,
2299,
2783,
2784,
3213,
3214,
3482,
3483,
3946,
3947,
4039,
4040,
4067,
4377,
4378,
4881,
4882,
5233,
5234,
5419,
5420,
5610,
5611,
6022,
6023,
6050,
6539,
6540,
6599,
6600,
6617,
6618,
6954,
6955,
6982,
6983,
6992,
6993,
7042,
7043,
7207,
7208,
7281,
7282,
7466,
7467,
7552,
7553,
7699,
7700,
7752,
7753,
7952,
7953
],
"line_end_idx": [
15,
16,
78,
79,
389,
390,
739,
740,
900,
901,
1340,
1341,
1584,
1585,
2050,
2051,
2271,
2272,
2299,
2783,
2784,
3213,
3214,
3482,
3483,
3946,
3947,
4039,
4040,
4067,
4377,
4378,
4881,
4882,
5233,
5234,
5419,
5420,
5610,
5611,
6022,
6023,
6050,
6539,
6540,
6599,
6600,
6617,
6618,
6954,
6955,
6982,
6983,
6992,
6993,
7042,
7043,
7207,
7208,
7281,
7282,
7466,
7467,
7552,
7553,
7699,
7700,
7752,
7753,
7952,
7953,
7973
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7973,
"ccnet_original_nlines": 71,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4305468201637268,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018227530643343925,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14770585298538208,
"rps_doc_frac_unique_words": 0.3596358001232147,
"rps_doc_mean_word_length": 4.81107759475708,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0.0012570699909701943,
"rps_doc_unigram_entropy": 5.415721416473389,
"rps_doc_word_count": 1318,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.024601800367236137,
"rps_doc_frac_chars_dupe_6grams": 0.008516009896993637,
"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.009462229907512665,
"rps_doc_frac_chars_top_3gram": 0.007096670102328062,
"rps_doc_frac_chars_top_4gram": 0.006938970182090998,
"rps_doc_books_importance": -752.7489624023438,
"rps_doc_books_importance_length_correction": -752.7489624023438,
"rps_doc_openwebtext_importance": -392.408447265625,
"rps_doc_openwebtext_importance_length_correction": -392.408447265625,
"rps_doc_wikipedia_importance": -257.68817138671875,
"rps_doc_wikipedia_importance_length_correction": -257.68817138671875
},
"fasttext": {
"dclm": 0.37298691272735596,
"english": 0.953978419303894,
"fineweb_edu_approx": 1.9260538816452026,
"eai_general_math": 0.12227284908294678,
"eai_open_web_math": 0.0708681270480156,
"eai_web_code": 0.3860398530960083
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.403",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-462,282,794,794,552,060 |
0
I read where NVidia guarantees backward capability for drivers but what about apps?
The app (asteroids-at-home) generates the following error message when using libcudart.so.5.5
Unsupported CC detected (CC2.0 and better supported only)
The co-processor is GTX-1660Ti which is far better than CC2.0
Seems to me this should have worked if backwards compatible. I tried substituting the 10.2 shared library for the 5.5 which didnt work. It was used by the app (different error message) but that was as far as I got. If the project app does not take advantage of new processors one would think their code should still work if the lib is backwards compatible IMHO.
1
Depends on how the app was compiled and with what resources. The app in question was compiled/developed when CC2.0 was current and probably checks for that as minimum requirement. When the app checks current hardware and software drivers, the returned values are outside the minimum requirement because the app wasn't written for >2.0 as a possibility.
Your statement about the code still working as backwards compatible is only correct if it was written to do so.
Also your statement about Nvidia guaranteeing that their drivers are backwards compatible is not true. They have regularly deprecated both hardware and drivers after a reasonable length of time after the models were sold. Seems like 10-15 years is typical.
| improve this answer | |
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://askubuntu.com/questions/1204434/cuda-backwards-capability",
"source_domain": "askubuntu.com",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "143539",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YR7NL2PWGT3N4IXOV4F25KRW2KBLNA5D",
"WARC-Concurrent-To": "<urn:uuid:9b074b02-3a99-4ecc-b9c5-1e0b2c585fb6>",
"WARC-Date": "2020-06-06T08:06:26Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NW3MRNFHW4AATU3DJOF4YMKK4UNSNYVR",
"WARC-Record-ID": "<urn:uuid:644a99b5-1e59-485a-b2a7-87cb0322e87e>",
"WARC-Target-URI": "https://askubuntu.com/questions/1204434/cuda-backwards-capability",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0b3ef476-1d9f-43e8-9c5d-e5f273345e12>"
},
"warc_info": "isPartOf: CC-MAIN-2020-24\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-5.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
87,
88,
182,
183,
241,
242,
304,
305,
667,
668,
670,
671,
1024,
1025,
1137,
1138,
1395,
1396,
1422,
1423,
1435,
1436,
1536,
1537
],
"line_end_idx": [
2,
3,
87,
88,
182,
183,
241,
242,
304,
305,
667,
668,
670,
671,
1024,
1025,
1137,
1138,
1395,
1396,
1422,
1423,
1435,
1436,
1536,
1537,
1627
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1627,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4092307686805725,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027692310512065887,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1846153736114502,
"rps_doc_frac_unique_words": 0.5817490220069885,
"rps_doc_mean_word_length": 4.961977005004883,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.762277126312256,
"rps_doc_word_count": 263,
"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.027586210519075394,
"rps_doc_frac_chars_top_3gram": 0.027586210519075394,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -164.84339904785156,
"rps_doc_books_importance_length_correction": -151.0407257080078,
"rps_doc_openwebtext_importance": -87.51289367675781,
"rps_doc_openwebtext_importance_length_correction": -87.51289367675781,
"rps_doc_wikipedia_importance": -64.02823638916016,
"rps_doc_wikipedia_importance_length_correction": -50.962547302246094
},
"fasttext": {
"dclm": 0.8360546231269836,
"english": 0.972557008266449,
"fineweb_edu_approx": 1.9181084632873535,
"eai_general_math": 0.0003510699898470193,
"eai_open_web_math": 0.042342718690633774,
"eai_web_code": 0.000931439979467541
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-2,998,604,959,683,563,000 |
Tell me more ×
Facebook - Stack Overflow is a question and answer site for facebook developers. It's 100% free, no registration required.
Facebook and Stack Exchange are now working together to support the Facebook developer community. Facebook engineers participate here along with the best Facebook developers in the world. If you have a technical question about Facebook, this is the best place to ask.
in a previous question i asked, the suggested answer was for me to partition my field onto another Filegroup, keeping the field in the same table.
I'm not sure how to do this.
I've tried to google for things like partition table, partition view, etc. Could anyone provide me with some links or some sample sql code?
DB Server is Sql 2008.
Table Schema
FooId INT PK IDENTITY
Name VARCHAR(100) NOT NULL
Boo VARCHAR(100) NOT NULL
BlahId INT NOT NULL
Photo VARBINARY(MAX) <-- This field wants to go onto another filegroup.
Can be null.
cheers!
share|improve this question
1 Answer
up vote 1 down vote accepted
You need to use the TEXTIMAGE ON clause in CREATE TABLE.
share|improve this answer
The BooksOnline say: " ...are keywords that indicate that the text, ntext, image, xml, varchar(max), nvarchar(max), varbinary(max), and CLR user-defined type columns are stored on the specified filegroup. " So if i do that, then Name, Boo and Photo will all be stored on the specified Filegroup? If so, how can i only set the 'photo' file be on the specified fielgroup? – Pure.Krome May 28 '09 at 3:28
name and boo aren't varchar(max) - they're varchar(100). They won't be stored with the balance of the blob fields. Varchar(max) is a variant of varchar that scales up to 2GB - not what you're using here :-D – Aaron Alton May 28 '09 at 4:29
ah haaa. right you are. kewlies :) Would i have to restore both filesystems (to a test server) or can i restore the main (default) one .. and the data will still work, it will just have NULL data for those fields. OR will the restore not work at all ? – Pure.Krome May 28 '09 at 4:43
You would need to restore all filegroups, but you can use the MOVE clause in the RESTORE DATABASE command to move your files to a different array. – Aaron Alton May 28 '09 at 13:03
Cheers mate!! :) – Pure.Krome Jun 2 '09 at 0:42
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://facebook.stackoverflow.com/questions/918885/need-help-partitioning-a-field-on-a-sql-2008-table-to-a-different-filegroup",
"source_domain": "facebook.stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "51504",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RP5WMQCEFC3SUFTNLEJKPBUX3CKCM5NV",
"WARC-Concurrent-To": "<urn:uuid:5b267a14-00af-4eda-8409-62e9bbff534d>",
"WARC-Date": "2013-05-25T04:56:27Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:VDN4AQV7QY3K4K6XOADM4FOR7SKVFBYX",
"WARC-Record-ID": "<urn:uuid:a6ba5060-02f1-4f2d-ba30-2999a0846030>",
"WARC-Target-URI": "http://facebook.stackoverflow.com/questions/918885/need-help-partitioning-a-field-on-a-sql-2008-table-to-a-different-filegroup",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8c145ef0-0980-4ded-9141-388fed339f36>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-60-113-184.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-20\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Spring 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
15,
138,
406,
407,
554,
555,
584,
585,
725,
726,
749,
750,
763,
764,
787,
816,
845,
865,
942,
984,
985,
993,
994,
1022,
1023,
1032,
1033,
1062,
1063,
1120,
1121,
1147,
1549,
1789,
2073,
2254,
2302,
2303,
2315,
2316,
2318,
2326,
2327,
2405,
2406
],
"line_end_idx": [
15,
138,
406,
407,
554,
555,
584,
585,
725,
726,
749,
750,
763,
764,
787,
816,
845,
865,
942,
984,
985,
993,
994,
1022,
1023,
1032,
1033,
1062,
1063,
1120,
1121,
1147,
1549,
1789,
2073,
2254,
2302,
2303,
2315,
2316,
2318,
2326,
2327,
2405,
2406,
2496
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2496,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3633093535900116,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05215827003121376,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24640287458896637,
"rps_doc_frac_unique_words": 0.5,
"rps_doc_mean_word_length": 4.4528303146362305,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.0017985600279644132,
"rps_doc_unigram_entropy": 5.0213823318481445,
"rps_doc_word_count": 424,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07203389704227448,
"rps_doc_frac_chars_dupe_6grams": 0.04131355881690979,
"rps_doc_frac_chars_dupe_7grams": 0.02118643932044506,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01059321966022253,
"rps_doc_frac_chars_top_3gram": 0.014830510132014751,
"rps_doc_frac_chars_top_4gram": 0.019067799672484398,
"rps_doc_books_importance": -297.69659423828125,
"rps_doc_books_importance_length_correction": -297.69659423828125,
"rps_doc_openwebtext_importance": -172.45162963867188,
"rps_doc_openwebtext_importance_length_correction": -172.45162963867188,
"rps_doc_wikipedia_importance": -114.58014678955078,
"rps_doc_wikipedia_importance_length_correction": -114.58014678955078
},
"fasttext": {
"dclm": 0.3724287748336792,
"english": 0.8636314868927002,
"fineweb_edu_approx": 1.2515820264816284,
"eai_general_math": 0.0005617699935100973,
"eai_open_web_math": 0.12503385543823242,
"eai_web_code": 0.0003890400112140924
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.746",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
898,199,571,302,086,000 |
What is best citra build now or ever?
Till now February, 2018 which is the best official CITRA build playable on PC. I have gone through a lot of people mentioning a lot of builds and stuffs about CITRA. So I really wanna know which is the best citra build So I can use it too.
We only provide support for the builds downloaded from the official site, preferably recent ones.
It says in the link page, that support is provided only for nightly and not for Canary. So is it OK if I Download the Canary? Also which one runs at a faster FPS?Nightly or Canary? And will it work on a Windows 10 Home,
GPU: GTX 1050 DDR5
Intel Core i7 (7t gen) CPU,
Without much lagg or slow speed? Thanks
Canary is faster but if you’re having bugs or glitches, you should test again with nightly.
Those are pretty good specs but it depends upon the game you are playing.
I’m planning to Dump Ultra Sun or moon from friend’s 3ds and play on my PC…? We tried in his PC with nightly or something, it was a but slow with 70% or something…his specs were a but higher than mine with GTX 1050ti so…I really need to use a build which works fast.
You can try the Canary version. It’ll be faster. You’ll get a nice speed boost (~85%). Download it from the installer. Just put a ✓ on Canary while downloading.
But you should reposting issues only if they occur in Nightly. Also, you’ll have to transfer the save to the 3DS to bypass that Alola Photo Club Scene.
Can you please share me a link so I could download the canary build…also is there any ads and stuffs? I’m having doughts,which is worth buying Pokemon sun or Pokemin Ultra- sun? It will be my first time playing 7th generation pokemon.
Also after downloading either nightly or canary build where do I install it or extract it? Anywher? I got the link from above REPLY. Thanks
Just download the installer, you’ll be fine. Install to default location.
NO ADS.
|
{
"url": "https://community.citra-emu.org/t/what-is-best-citra-build-now-or-ever/11224",
"source_domain": "community.citra-emu.org",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "31250",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TQSYIDCWBJGDT5OZZVOW52VWVQH7UZWQ",
"WARC-Concurrent-To": "<urn:uuid:7aa80f8d-f52a-4da9-8dfb-f94213d72188>",
"WARC-Date": "2022-09-27T10:28:34Z",
"WARC-IP-Address": "172.67.165.22",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AG2TFDZY4X2CBETB722QBUEXSM3PTB75",
"WARC-Record-ID": "<urn:uuid:f017d6aa-e519-4686-b466-e4299ff39e02>",
"WARC-Target-URI": "https://community.citra-emu.org/t/what-is-best-citra-build-now-or-ever/11224",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:001bea57-495a-4faf-9c91-f87b377d8f12>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-183\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,
38,
39,
279,
280,
378,
379,
599,
618,
646,
686,
687,
779,
780,
854,
855,
1122,
1123,
1284,
1285,
1437,
1438,
1673,
1674,
1814,
1815,
1889
],
"line_end_idx": [
38,
39,
279,
280,
378,
379,
599,
618,
646,
686,
687,
779,
780,
854,
855,
1122,
1123,
1284,
1285,
1437,
1438,
1673,
1674,
1814,
1815,
1889,
1896
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1896,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4150943458080292,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.061320748180150986,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14858491718769073,
"rps_doc_frac_unique_words": 0.5395480394363403,
"rps_doc_mean_word_length": 4.189265727996826,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.009433959610760212,
"rps_doc_unigram_entropy": 4.942694187164307,
"rps_doc_word_count": 354,
"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.020229270681738853,
"rps_doc_frac_chars_top_3gram": 0.018880650401115417,
"rps_doc_frac_chars_top_4gram": 0.018880650401115417,
"rps_doc_books_importance": -203.04122924804688,
"rps_doc_books_importance_length_correction": -203.0408172607422,
"rps_doc_openwebtext_importance": -114.08563232421875,
"rps_doc_openwebtext_importance_length_correction": -114.08563232421875,
"rps_doc_wikipedia_importance": -84.0684814453125,
"rps_doc_wikipedia_importance_length_correction": -84.0684814453125
},
"fasttext": {
"dclm": 0.018795669078826904,
"english": 0.9471411108970642,
"fineweb_edu_approx": 1.1287927627563477,
"eai_general_math": 0.29452455043792725,
"eai_open_web_math": 0.16151058673858643,
"eai_web_code": 0.04148000106215477
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-8,937,675,696,093,651,000 |
3 Replies Latest reply: Jul 10, 2011 4:43 PM by EERCZ
EERCZ Level 1 Level 1 (5 points)
I am wondering if anyone knows how one will be able to manage multiple users under a single account under the new iOS5. Let me explain. In my house my wife and children download content ( movies, music, app) under my itunes log in so we can decide to watch the movie on my computer or my sons iphone without running into DRM issues. With the automatic syncing of pictures with iCloud I dont want my pictures and hers being mixed up but would like to each have an account. The problem is that I dont want to loose the ability of having the same DRM account for different itunes account. In other words, is there a way to associate a couple of me.com (icloud) emails / accounts to be associated with one itune store purchase account to be able to take advantage of sharing content with in the family. My apologies for the long winded question but I couldn't explain it any other way.:)
Any insight is greatly appreciated. thanks
itunes, Mac OS X (10.6.8), DRM Management
• roaminggnome Level 10 Level 10 (92,460 points)
As neither ios 5 nor icloud has been released to the public in their final versions, it is difficult to know.
Wait until they are released. it should be more clear then.
• rbrian Scotland Level 2 Level 2 (430 points)
This is from a MobileMe page, so it may not fully apply, but it suggests you'll be able to use separate accounts for iCloud and iTunes.
http://www.apple.com/mobileme/transition.html
If I use different accounts for iTunes and MobileMe, can I merge them into a single account and use it with iCloud?
No. You cannot merge two accounts into one. However, you will be able to move your MobileMe account ([email protected]) to iCloud and, if you choose, you can continue to use a different iTunes account for store purchases and iTunes in the Cloud.
• EERCZ Level 1 Level 1 (5 points)
I unfortunately have the reverse problem. My iTunes account is actually my mobile me address. I would like to keep that email address and move it to icloud but still be able to share iTunes store content within my family. Hopefully I can just sign into the iTunes store with that id and have all oher features run of the icloud id which would be the same but hopefully with different passwords. As roamingnome said, we will know more when it launches. I was hoping that someone beta testing iOS 5 had the answer.
Thanks for the link above
|
{
"url": "https://discussions.apple.com/thread/3170254",
"source_domain": "discussions.apple.com",
"snapshot_id": "crawl=CC-MAIN-2015-14",
"warc_metadata": {
"Content-Length": "230833",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GCYMTZL26RGZ5I55N7O43UNCTWSV32PY",
"WARC-Concurrent-To": "<urn:uuid:8cea60f4-2edd-417d-b453-cb48a865e996>",
"WARC-Date": "2015-04-01T10:51:50Z",
"WARC-IP-Address": "172.232.11.207",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:E23E35FL6QR2FZJMXUJEDDXZCZ2OCDVN",
"WARC-Record-ID": "<urn:uuid:8128a447-0e2e-4747-8a9c-b72ea00f66f9>",
"WARC-Target-URI": "https://discussions.apple.com/thread/3170254",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d05ad6a2-300d-4db5-8d07-d1831205e4f9>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-168-14-71.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-14\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
54,
87,
88,
972,
973,
1016,
1017,
1018,
1060,
1111,
1112,
1226,
1227,
1233,
1234,
1299,
1300,
1349,
1350,
1490,
1491,
1497,
1498,
1548,
1549,
1669,
1670,
1918,
1919,
1956,
1957,
2474,
2475
],
"line_end_idx": [
54,
87,
88,
972,
973,
1016,
1017,
1018,
1060,
1111,
1112,
1226,
1227,
1233,
1234,
1299,
1300,
1349,
1350,
1490,
1491,
1497,
1498,
1548,
1549,
1669,
1670,
1918,
1919,
1956,
1957,
2474,
2475,
2504
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2504,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43320611119270325,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03625953942537308,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17938931286334991,
"rps_doc_frac_unique_words": 0.4920634925365448,
"rps_doc_mean_word_length": 4.358276844024658,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.986011028289795,
"rps_doc_word_count": 441,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.026014570146799088,
"rps_doc_frac_chars_dupe_6grams": 0.026014570146799088,
"rps_doc_frac_chars_dupe_7grams": 0.026014570146799088,
"rps_doc_frac_chars_dupe_8grams": 0.026014570146799088,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.015608740039169788,
"rps_doc_frac_chars_top_3gram": 0.020811650902032852,
"rps_doc_frac_chars_top_4gram": 0.016649320721626282,
"rps_doc_books_importance": -230.84132385253906,
"rps_doc_books_importance_length_correction": -230.84132385253906,
"rps_doc_openwebtext_importance": -141.9707489013672,
"rps_doc_openwebtext_importance_length_correction": -141.9707489013672,
"rps_doc_wikipedia_importance": -102.25251770019531,
"rps_doc_wikipedia_importance_length_correction": -102.25251770019531
},
"fasttext": {
"dclm": 0.02726488932967186,
"english": 0.9423719644546509,
"fineweb_edu_approx": 1.0602691173553467,
"eai_general_math": 0.19568222761154175,
"eai_open_web_math": 0.05536872148513794,
"eai_web_code": 0.20775049924850464
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-2,488,528,669,073,714,700 |
In addition to video streams, Axis devices can also deliver metadata streams. While the purpose of video streams is self-explanatory, the purpose of metadata might not be.
Metadata is the foundation for gathering intelligence from video. It assigns digital meaning to each video frame by describing the key details in the scene. Using metadata, you can quickly find, evaluate, and act on what is important in large amounts of video. This is why metadata has increasingly become an essential part of efficient security, safety, and business operations.
Hinweis
Visualization of analytics metadata generated by Axis cameras available on AXIS OS 11.11 or later.
Analytics metadata stream
The analytics metadata stream, describes the events, content, and characteristics of a scene including Event data and Scene metadata.
Car being detected within defined area for 1 minute
Event data
Logical rules based on what has occurred at the scene for example, when an object crossing a line is counted, or an object is dwelling in an area.
A yellow bus, grey car and white track being detected on a street
Scene metadata
Describes which objects are in the scene (such as humans and vehicles) and their attributes.
Introduction
AXIS Scene Metadata enhances scene understanding, providing critical details such as object classes (human or vehicle), clothing and vehicle colors, license plates, and speed data. This in turn enables rapid decision-making, automated actions, and simplified search. Seamlessly integrated with third-party solutions through standardized methods, and delivered directly from Axis cameras, AXIS Scene Metadata helps reduce system and operational costs while ensuring efficiency and precision.
AXIS Scene Metadata includes information about the object types as well as other specific attributes such as clothing and vehicle color, license plate information, speed, location, and timestamp. AI-based analytics, featuring object detection and classification, lets you filter the attained metadata, trigger events, and examine specific elements of the scene.
A complete list of supported object classes and attributes is available below, but please note that the detection and classification capabilities are camera dependent. For detailed information about which object classes and attributes a specific camera model supports, please refer to the camera's data sheet.
Object Classes
• Human
• Vehicle
• Car
• Bus
• Truck
• Bike (Motorcycle/Bicycle)
• Other
• Human Face
• License Plate
Object Attributes
• Clothing Color (Upper/Lower)
• Vehicle Color
In addition to the listed object attributes, the analytics metadata stream may also provide information about other properties of the detected objects such as likelihood, duration, shape, images, speed*, geocoordinates* and position.
*Requires radar or radar-video fusion camera integration.
It is also worth noting that AXIS Scene Metadata generates information such as shape and position about non-classified moving objects in the video scene as well.
The value of analytics metadata
Analytics metadata not only provides details about objects in a scene. It also provides context to events and allows large amounts of footage to be quickly sorted and searched. This enables functions that can be broadly categorized into the areas of post-event forensic search, real-time use, and identification of trends, patterns, and insights.
illustration metadata consumers
The main consumers of analytics metadata can be summarized as follows:
1) Edge applications
2) Real-time alarm notification and post event forensic searching within a Video Management System
3) Statistical analysis and reporting leveraging IoT and business intelligence platforms, such as data visualization dashboards
4) Advanced analytics requiring additional processing power
Axis devices generate analytics metadata that is conformant with ONVIF Profile M streaming over RTSP to support use-cases related to post-event forensic search. However, this metadata is also accessible through alternative communication protocols and file formats, enabling a straight forward integration with a wide variety of systems covering a large array of use-cases. This guide provides important information such as suggested architecture, development examples, and recommended considerations when designing a solution that consumes this analytics metadata.
This guide also assumes that you are familiar with the concept of video metadata and more specifically with the capabilities that Axis cameras posses for detection of classified objects in a scene. In order to better understand the added value of video metadata, as well as an introduction to the capabilities of Axis cameras in this context, consider visiting the AXIS Scene Metadata product page and reading our white paper if you haven’t done so already.
Plan your integration
Axis devices with AXIS OS 11.11 or later support two different methods of generating analytics metadata, each being designed and optimized to support specific use-cases, such as real-time alarm notifications or post-event forensic search and identification of trends, patterns, and insights. To retrieve information regarding the metadata analytics producers on the Axis camera and the kind of metadata they can produce, please refer to the Analytics Metadata Producer Configuration API available in the VAPIX Library.
Consider whether your application requires the device to deliver the information in real-time when selecting which method is most suitable to fulfill your specific use-case. In the following section, we will take a deeper dive into each of the available methods.
Frame-by-frame metadata
The Analytics Scene Description producer generates metadata on a frame-by-frame basis at a frequency of 10 times a second.
Each metadata frame contains information about the moving objects in the scene at that specific point in time, as exemplified below:
Consolidated metadata
The Analytics Object Description producer generates metadata based on the track of a detected object, meaning that it can deliver metadata frames either when an object has entered and left the video scene. The information gathered during the lifetime of the object is combined and included in each metadata frame that is delivered by the camera.
Frame-by-frame metadata example
Frame 1 contains Object A and Object B as detected in the scene. Object A is classified as a Human wearing red clothing, while Object B is classified as a Human wearing blue clothing.
Consolidated metadata example
Frame 1 contains only information about Object A, when the object was first and last detected and a summary of the trajectory of the object and attributes that the camera was able to detect during the course of the track – so Object A had a 33% likelihood of wearing red clothing and 67% likelihood of wearing blue clothing, as the camera detected both colors during
Frame-by-frame metadata example
In Frame 2, the camera now determines that Object A is actually wearing blue clothing and that Object B is now wearing yellow clothing. They are the same objects as in frame 1, but with different color attributes which is also reflected in the metadata output.
Consolidated metadata example
Similarly, Frame 2 contains all known information about Object B.
Even if the data is being generated based on detected objects instead of on a frame-by-frame basis, it can contain the same information with regards to object trajectory and detected object classes and attributes.
Frame-by-frame metadata example
In Frame 3, Object B is no longer present in the scene and the camera can only track Object A in the scene, which is still a Human wearing blue clothing.
When to use frame-by-frame metadata
This method could, for example, be suitable for an edge application running on the Axis camera to trigger real-time events based on the content of the metadata, e.g. when a yellow vehicle is detected and an access gate needs to be opened.
When to use consolidated metadata
This method of generating metadata is best suited for non-real-time applications, such as performing post-incident forensic search or statistical analysis as it eliminates the need to process and store irrelevant information and greatly reduces the amount of logic necessary to develop powerful applications based on object classification metadata.
Best snapshot
The analytics metadata streams can also be configured to include cropped images of detected classified objects using the Best Snapshot feature.
The image is represented as a base-64 encoded string within the metadata output. For examples, please refer to sample data frames which include images in the Ways of accessing the metadata section. The Best Snapshot feature must be enabled manually by issuing the following request to the camera:
Enable the Best Snapshot feature
http://<servername>/config/rest/best-snapshot/v1/enabled
method
PUT
PATCH
JSON Input parameters
{
"data": {
"enabled": true
}
}
Parse the JSON Response
{
"status": "success"
}
Ways of accessing the metadata
In this section, we will provide examples of how different consumer types are capable of accessing and consuming AXIS Scene Metadata.
1) Edge applications
AXIS Camera Application Platform (ACAP) is an open application platform from Axis. It provides a development platform for software-based solutions and systems built around Axis devices. ACAP is available for various types of Axis products such as cameras, speakers and intercoms.
The ACAP Native SDK is targeted towards users that want to develop plug-in style, event generating applications that fit well into a Video Management System centric environment. From AXIS OS 11.9, ACAP applications can consume AXIS Scene Metadata leveraging the Message Broker to further apply logical filters and rules to the information about the object in the scene in order to, for example, trigger actions based on defined thresholds or specific behaviors.
Example
This example showcases how an ACAP application can consume frame-by-frame or consolidated analytics metadata using the Message Broker API.
The available topics to subscribe to are:
AvailableOutputTopicSample Data
AXIS OS 11.9 or laterFrame by framecom.axis.analytics_scene_description.v0.betaexamples_json_frame_based.json
AXIS OS 11.11 or laterConsolidatedcom.axis.consolidated_track.v1.betaexamples_json_consolidated.json
Please refer to the following resource for more detailed information on available topics and terminology.
2) Video management systems
Axis devices send both the analytics metadata and video streams to the Video management system (vms) to enable forensic search integrations. Two examples of these integrations are AXIS Optimizer forensic search for Milestone plugin and AXIS Forensic Search for Genetec
The Analytics Scene Description metadata stream can be retrieved from an Axis device by opening an RTSP stream that uses the TCP transport protocol according to the following example:
RTSP requestDescriptionSample frame
rtsp://ip-address/axis-media/media.amp?analytics=polygonVideo analytics metadata excluding video streamdetections.xm
metadata sample with explanations
1) Information about the type of metadata stream generated by the device.
2) Frame timestamp crucial for syncing metadata with video (or audio) when you play or query and source field.
3) Information for bounding boxes and polygons, represented in ONVIF coordinate system which is -1 to 1 in the X and Y axes.
4) Bounding boxes and polygons are currently the same if you use Analytics Scene Description as a source.
5) Represents the color (of the car) and the probability value of the object classification. The color is presented before object class due to the ONVIF Profile M format. Object class can be found in section 6.
6) Object class and probability value of the object classification, such as vehicle in this example.
7) In addition to the main category, it presents a sub-category, such as a car in this example.
Additional parameters such as "camera=2" can be added to the above request to e.g. receive metadata events from a different video channel. This is useful when the Axis device supports more than one video source.
Please visit the AXIS OS knowledge base for additional information.
3) Second layer of analytics
Some applications require a combination of edge-based and server-based processing to perform more advanced analyses. Pre-processing can be performed on the camera and further processing on a server. Such a hybrid system can facilitate cost-efficient scaling of analytics by streaming only relevant video or images along with metadata to the server.
MQTT is a standard messaging protocol that facilitates efficient and reliable exchange of data between IoT devices and cloud applications. It allows devices (through their MQTT clients) to publish messages to a common MQTT broker (server) that mediates communication with other devices. The broker keeps track of who is publishing what and who wants to see the data, forwarding messages to only the clients that subscribe to the right topic. In a typical VMS ecosystem, Axis event notifications from devices are traditionally streamed to a single destination via VAPIX/ONVIF API interface using the RTSP streaming protocol. But the same notifications can be distributed using the MQTT protocol via the device’s built-in MQTT client (applicable for devices running AXIS OS 9.80 or a later version). This is possible both within VMS ecosystems and outside of them, and is particularly useful over the internet. This guide does not provide an overview of the MQTT protocol or specific configuration of the MQTT client on the camera. To find out more about these topics, please visit Device integration with MQTT and VAPIX MQTT Client API.
The capability of obtaining analytics metadata using the MQTT client available on Axis cameras is available by enabling a feature flag through the Feature Flag Service API. Feature flags can be used to, among other things, toggle experimental features on/off and to enable prototyping a solution early on in the development process to get feedback from developers.
Developers interested in exploring this capability can obtain detailed instructions on how to enable this feature by creating a support helpdesk ticket specifying AXIS Scene Metadata in the product category field. Please include information about your project and use-case in the description field.
Configure the metadata stream
From AXIS OS 10.11 and onwards, it's possible to choose dedicated analytics producers within the Axis camera or to have multiple analytics metadata producers enabled simultaneously. There are currently three methods available to configure the metadata producers within the camera. Additional information about each of these methods can be found below.
Once the metadata stream has been configured according to your needs, you can access the output using one of the available methods as described in the previous section.
Start implementing
You now posses the necessary information to develop solutions based on the analytics metadata content generated by Axis cameras. The components making up a solution can vary drastically depending on the specific needs of your project.
Safety and security
Analytics metadata can be used in real time to help operators respond quickly to situational changes. It can also provide valuable input to support decision making or enable automated action.
Real time edge analytics that work with high-quality metadata can help you secure people, sites, and buildings and protect them from intentional or accidental harm. You can rapidly detect, verify, and evaluate threats so they can be efficiently handled.
Operational efficiency
The analytics metadata is typical stored in a database type component which can be queried regularly to extract the data that is of interest and visually present it in dashboard.
In the case of leveraging cloud services to perform advanced analysis on a detected object, however, the database component might not be required if there is a need to present the data in as close to real-time as possible.
An example implementation is represented below.
Analytics schematic
1) An Axis camera with MLPU or DLPU, generating analytics metadata
2) The analytics metadata is transmitted to consumers through the available communication protocols
3) The analytics metadata is further processed and stored, then consumed by different applications
4a) Collected data is visualized in a graphical dashboard to analyze trends and gain insights
4b) Access to a sensitive area is restricted based on license plate information included in the analytics metadata
Release updates
You can view upcoming changes in the AXIS OS Portal.
AXIS OS 12.0Changes in the analytics metadata stream. Read more
AXIS OS 11.9Introduced the Message Broker API (in beta). This API lets you build applications that can easily access analytics metadata of detected objects in the scene.
AXIS OS 11.5Upper and lower clothing color has been added as an attribute to the human object class within the analytics scene description metadata stream. Read more
AXIS OS 11.1Vehicle color is included in the Axis analytics metadata stream. Read more
AXIS OS 11.0The source parameter in the Axis analytics metadata stream changed to "AnalyticsSceneDescription". Read more
AXIS OS 10.11
For new products and after defaulting the devices, AXIS Object Analytics will become the default metadata producer. Old configured systems will work as it is once you upgrade to AXIS OS 10.11.
• AXIS Object Analytics will also deliver objects that cannot be classified. See sample package.
• Added support for HumanFace, LicensePlate, Bike, Bus, Car and Truck as new object detection classes to machine learning cameras. See affected products in the AXIS OS portal.
• Added information about supported features for metadata producers in web GUI(Axis Device Assistant). See how it looks.
• Corrected an issue where changing rotation required restart of the device for the metadata in Axis Object Analytics. See affected products in the AXIS OS portal.
AXIS OS 10.10
Restructure of AXIS Object Analytics and Motion Object Tracking Engine (MOTE) metadata producers. AXIS Object Analytics ACAP is no longer the producer for object classification metadata.
The metadata from the Axis Object Analytics provider will add two new classifications and associated bounding boxes for:
• HumanFace
• LicensePlate (location of the license plate on the image)
Note: The additional classifications will only be available on DL cameras.
For releases after AXIS OS 10.10, it is good to be aware that:
• There might be new metadata producer added
• The factory default metadata producer might change
• The contents of the metadata from the producers that already exist may evolve with new classifications and other additional data
For more information, see changes in Metadata Analytics stream AXIS OS 10.10.
AXIS OS 10.9Motion Object Tracking Engine (MOTE) data got a source name. The main difference is Source=VideoMotionTracker, the rest is the same. See example package.
AXIS OS 10.6
With the release of Axis OS 10.6, you are able to retrieve object classification data, e.g. humans and vehicles.
To be able to retrieve object classification data, you need a device with MLPU or DLPU. Please refer to the Product selector...
Resources
ONVIF Profile M
|
{
"url": "https://www.axis.com/de-ch/developer-community/scene-metadata-integration",
"source_domain": "www.axis.com",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "314232",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y6VOZ7A6EFFH5NOLO32XT27O2ZFXYUSP",
"WARC-Concurrent-To": "<urn:uuid:5d0857cc-a265-4472-b741-4f6ae350aef8>",
"WARC-Date": "2024-07-25T04:29:34Z",
"WARC-IP-Address": "146.75.37.117",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DR3BHHNMDHL4IR3GML7Y3OUJALPFL5HF",
"WARC-Record-ID": "<urn:uuid:0c74d6d9-3dc8-464a-80d3-03f3a405b0c4>",
"WARC-Target-URI": "https://www.axis.com/de-ch/developer-community/scene-metadata-integration",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bed07651-fb79-417a-ae05-341c351de3c2>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-235\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
172,
173,
553,
554,
562,
563,
662,
663,
689,
690,
824,
825,
877,
878,
889,
890,
1037,
1038,
1104,
1105,
1120,
1121,
1214,
1215,
1228,
1229,
1720,
1721,
2083,
2084,
2394,
2395,
2410,
2411,
2421,
2433,
2443,
2453,
2465,
2497,
2509,
2524,
2542,
2543,
2561,
2562,
2595,
2613,
2614,
2849,
2850,
2908,
2909,
3072,
3073,
3105,
3106,
3453,
3454,
3486,
3487,
3558,
3559,
3580,
3581,
3680,
3681,
3809,
3810,
3871,
3872,
4437,
4438,
4896,
4897,
4919,
4920,
5439,
5440,
5703,
5704,
5728,
5729,
5852,
5853,
5986,
5987,
6009,
6010,
6356,
6357,
6389,
6390,
6574,
6575,
6605,
6606,
6973,
6974,
7006,
7007,
7268,
7269,
7299,
7300,
7366,
7367,
7581,
7582,
7614,
7615,
7769,
7770,
7806,
7807,
8047,
8048,
8082,
8083,
8432,
8433,
8447,
8448,
8592,
8593,
8890,
8891,
8924,
8925,
8982,
8983,
8990,
8991,
8995,
8996,
9002,
9003,
9005,
9006,
9028,
9030,
9044,
9068,
9074,
9076,
9077,
9101,
9102,
9104,
9128,
9130,
9131,
9162,
9163,
9297,
9298,
9319,
9320,
9600,
9601,
10063,
10064,
10072,
10073,
10212,
10213,
10255,
10256,
10288,
10398,
10499,
10500,
10606,
10607,
10635,
10636,
10905,
10906,
11090,
11091,
11127,
11244,
11278,
11279,
11353,
11354,
11465,
11466,
11591,
11592,
11698,
11699,
11910,
11911,
12012,
12013,
12109,
12110,
12322,
12323,
12391,
12392,
12421,
12422,
12771,
12772,
13908,
13909,
14274,
14275,
14574,
14575,
14605,
14606,
14959,
14960,
15129,
15130,
15149,
15150,
15385,
15386,
15406,
15407,
15599,
15600,
15854,
15855,
15878,
15879,
16058,
16059,
16283,
16284,
16332,
16333,
16353,
16354,
16421,
16422,
16522,
16523,
16622,
16623,
16717,
16718,
16833,
16834,
16850,
16851,
16904,
16905,
16969,
17139,
17305,
17392,
17513,
17527,
17528,
17721,
17722,
17821,
17999,
18122,
18288,
18302,
18303,
18490,
18491,
18613,
18614,
18628,
18690,
18691,
18766,
18767,
18830,
18831,
18878,
18933,
19066,
19072,
19073,
19151,
19152,
19318,
19331,
19332,
19445,
19446,
19574,
19575,
19585,
19586
],
"line_end_idx": [
172,
173,
553,
554,
562,
563,
662,
663,
689,
690,
824,
825,
877,
878,
889,
890,
1037,
1038,
1104,
1105,
1120,
1121,
1214,
1215,
1228,
1229,
1720,
1721,
2083,
2084,
2394,
2395,
2410,
2411,
2421,
2433,
2443,
2453,
2465,
2497,
2509,
2524,
2542,
2543,
2561,
2562,
2595,
2613,
2614,
2849,
2850,
2908,
2909,
3072,
3073,
3105,
3106,
3453,
3454,
3486,
3487,
3558,
3559,
3580,
3581,
3680,
3681,
3809,
3810,
3871,
3872,
4437,
4438,
4896,
4897,
4919,
4920,
5439,
5440,
5703,
5704,
5728,
5729,
5852,
5853,
5986,
5987,
6009,
6010,
6356,
6357,
6389,
6390,
6574,
6575,
6605,
6606,
6973,
6974,
7006,
7007,
7268,
7269,
7299,
7300,
7366,
7367,
7581,
7582,
7614,
7615,
7769,
7770,
7806,
7807,
8047,
8048,
8082,
8083,
8432,
8433,
8447,
8448,
8592,
8593,
8890,
8891,
8924,
8925,
8982,
8983,
8990,
8991,
8995,
8996,
9002,
9003,
9005,
9006,
9028,
9030,
9044,
9068,
9074,
9076,
9077,
9101,
9102,
9104,
9128,
9130,
9131,
9162,
9163,
9297,
9298,
9319,
9320,
9600,
9601,
10063,
10064,
10072,
10073,
10212,
10213,
10255,
10256,
10288,
10398,
10499,
10500,
10606,
10607,
10635,
10636,
10905,
10906,
11090,
11091,
11127,
11244,
11278,
11279,
11353,
11354,
11465,
11466,
11591,
11592,
11698,
11699,
11910,
11911,
12012,
12013,
12109,
12110,
12322,
12323,
12391,
12392,
12421,
12422,
12771,
12772,
13908,
13909,
14274,
14275,
14574,
14575,
14605,
14606,
14959,
14960,
15129,
15130,
15149,
15150,
15385,
15386,
15406,
15407,
15599,
15600,
15854,
15855,
15878,
15879,
16058,
16059,
16283,
16284,
16332,
16333,
16353,
16354,
16421,
16422,
16522,
16523,
16622,
16623,
16717,
16718,
16833,
16834,
16850,
16851,
16904,
16905,
16969,
17139,
17305,
17392,
17513,
17527,
17528,
17721,
17722,
17821,
17999,
18122,
18288,
18302,
18303,
18490,
18491,
18613,
18614,
18628,
18690,
18691,
18766,
18767,
18830,
18831,
18878,
18933,
19066,
19072,
19073,
19151,
19152,
19318,
19331,
19332,
19445,
19446,
19574,
19575,
19585,
19586,
19601
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 19601,
"ccnet_original_nlines": 294,
"rps_doc_curly_bracket": 0.00030611001420766115,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34705036878585815,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03798561170697212,
"rps_doc_frac_lines_end_with_ellipsis": 0.0033898300025612116,
"rps_doc_frac_no_alph_words": 0.1453237384557724,
"rps_doc_frac_unique_words": 0.27340570092201233,
"rps_doc_mean_word_length": 5.424694538116455,
"rps_doc_num_sentences": 163,
"rps_doc_symbol_to_word_ratio": 0.00028777000261470675,
"rps_doc_unigram_entropy": 5.657864093780518,
"rps_doc_word_count": 2948,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05396448075771332,
"rps_doc_frac_chars_dupe_6grams": 0.038394201546907425,
"rps_doc_frac_chars_dupe_7grams": 0.016445720568299294,
"rps_doc_frac_chars_dupe_8grams": 0.0045022498816251755,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.029764879494905472,
"rps_doc_frac_chars_top_3gram": 0.013756879605352879,
"rps_doc_frac_chars_top_4gram": 0.004002000205218792,
"rps_doc_books_importance": -1503.32861328125,
"rps_doc_books_importance_length_correction": -1503.32861328125,
"rps_doc_openwebtext_importance": -782.5630493164062,
"rps_doc_openwebtext_importance_length_correction": -782.5630493164062,
"rps_doc_wikipedia_importance": -597.7586669921875,
"rps_doc_wikipedia_importance_length_correction": -597.7586669921875
},
"fasttext": {
"dclm": 0.06624960899353027,
"english": 0.8755422234535217,
"fineweb_edu_approx": 2.4000422954559326,
"eai_general_math": 0.10152720659971237,
"eai_open_web_math": 0.06661946326494217,
"eai_web_code": 0.7511698007583618
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
6,039,509,075,815,449,000 |
The moose likes Programmer Certification (SCJP/OCPJP) and the fly likes Overrding Parent class method's Big Moose Saloon
Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login
JavaRanch » Java Forums » Certification » Programmer Certification (SCJP/OCPJP)
Bookmark "Overrding Parent class method Watch "Overrding Parent class method New topic
Author
Overrding Parent class method's
s khosa
Ranch Hand
Joined: May 15, 2003
Posts: 72
What will be the output of the following piece of code?
class CorbaComponent
{
String ior;
CorbaComponent(){ startUp("IOR"); }
void startUp(String s){ ior = s; }
void print(){ System.out.println(ior); }
}
class OrderManager extends CorbaComponent
{
OrderManager(){ }
void startUp(String s)
{ ior = getIORFromURL(s); }
String getIORFromURL(String s){ return "URL://"+s; }
}
public class Application
{
public static void main(String args[])
{ start(new OrderManager()); }
static void start(CorbaComponent cc)
{ cc.print(); }
}
I thought the output should be "IOR", but it turns out to be "URL://IOR". Could some one please explain reason for this as to my understanding when the parent class constructor is called, startUp(string str) method called belongs to the parent class, right?
Jose Botella
Ranch Hand
Joined: Jul 03, 2001
Posts: 2120
Welcome to the Ranch sumeer.
The call "startup("IOR");" within the parent constructor is a polymorphic one: because the object being constructed is an OrderManager, the method startup in that class is called.
In fact, it is not advisable to make polymorphic method invocations to the object being constructed inside a constructor. There is a risk that the overriding method relies in the initialization of some fields declared in the class of the object being constructed, that were not initialized by the time the base constructor calls the polymorphic method.
For instance declare:
String wrong="wrong";
inside OrderManager, and modify OrderManager.getIORFromURL() to return:
return "URL://"+s+wrong;
The output is:
URL://IORnull
SCJP2. Please Indent your code using UBB Code
I agree. Here's the link: http://aspose.com/file-tools
subject: Overrding Parent class method's
It's not a secret anymore!
|
{
"url": "http://www.coderanch.com/t/241855/java-programmer-SCJP/certification/Overrding-Parent-class-method",
"source_domain": "www.coderanch.com",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "22917",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LR6L6PC7H42YC4U7MIZXJSQQ2635DUI5",
"WARC-Concurrent-To": "<urn:uuid:48724d74-19a9-499d-9c40-d5bd1ad347af>",
"WARC-Date": "2015-08-29T00:22:44Z",
"WARC-IP-Address": "204.144.184.130",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:CIVWHCNYSSBR4ICXHZLPTVQKS7EDYR3L",
"WARC-Record-ID": "<urn:uuid:b27e2ccb-bb2a-44b0-971b-d60a1fc15d1a>",
"WARC-Target-URI": "http://www.coderanch.com/t/241855/java-programmer-SCJP/certification/Overrding-Parent-class-method",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:470ef4b2-f166-4b83-9c3b-7785bf5cc2e8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-96-226.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
121,
202,
219,
299,
386,
393,
394,
426,
427,
435,
446,
447,
468,
478,
534,
555,
557,
569,
605,
640,
681,
683,
725,
727,
745,
768,
796,
849,
851,
876,
878,
917,
948,
985,
1001,
1003,
1261,
1274,
1285,
1286,
1307,
1319,
1348,
1528,
1881,
1903,
1925,
1997,
2022,
2037,
2051,
2052,
2053,
2099,
2101,
2156,
2158,
2199,
2201
],
"line_end_idx": [
121,
202,
219,
299,
386,
393,
394,
426,
427,
435,
446,
447,
468,
478,
534,
555,
557,
569,
605,
640,
681,
683,
725,
727,
745,
768,
796,
849,
851,
876,
878,
917,
948,
985,
1001,
1003,
1261,
1274,
1285,
1286,
1307,
1319,
1348,
1528,
1881,
1903,
1925,
1997,
2022,
2037,
2051,
2052,
2053,
2099,
2101,
2156,
2158,
2199,
2201,
2227
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2227,
"ccnet_original_nlines": 59,
"rps_doc_curly_bracket": 0.009878760203719139,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21710525453090668,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03728070110082626,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2785087823867798,
"rps_doc_frac_unique_words": 0.5261437892913818,
"rps_doc_mean_word_length": 5.627450942993164,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.729478359222412,
"rps_doc_word_count": 306,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04471544921398163,
"rps_doc_frac_chars_top_3gram": 0.058072008192539215,
"rps_doc_frac_chars_top_4gram": 0.047038331627845764,
"rps_doc_books_importance": -238.99636840820312,
"rps_doc_books_importance_length_correction": -238.99636840820312,
"rps_doc_openwebtext_importance": -131.16676330566406,
"rps_doc_openwebtext_importance_length_correction": -131.16676330566406,
"rps_doc_wikipedia_importance": -95.9192886352539,
"rps_doc_wikipedia_importance_length_correction": -95.9192886352539
},
"fasttext": {
"dclm": 0.24432498216629028,
"english": 0.7818710207939148,
"fineweb_edu_approx": 2.4323654174804688,
"eai_general_math": 0.01904452033340931,
"eai_open_web_math": 0.11733472347259521,
"eai_web_code": 0.0010068999836221337
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-5,822,630,379,803,178,000 |
Page 13 of 24PREVNEXT
See and share multiple calendars
You can see shared calendars side by side
You can view shared calendars together, side by side.
Sharing used to mean looking at someone else's calendar in another window. Now, Outlook lets you look at several people's calendars at once, without having to switch views. This means that you can:
• Easily see when your colleagues will be in or out of the office, or involved in many meetings.
• Easily set up meetings with the people you're sharing with.
• Easily move or copy appointments between schedules.
Note If you want to copy a meeting to your schedule, the best way to do that is to have the meeting organizer send you the meeting request (or have some other invitee forward it to you). That way, if the meeting is updated or canceled, you'll hear about the change.
Page 13 of 24PREVNEXT
|
{
"url": "http://office.microsoft.com/en-gb/training/share-your-calendar-RZ001030994.aspx?section=13",
"source_domain": "office.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2014-49",
"warc_metadata": {
"Content-Length": "34529",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:S2ZHWFXEKC3C6D3QW7DXPR2VU42V2V4S",
"WARC-Concurrent-To": "<urn:uuid:d0d3a18a-46cd-40c7-9fa7-551125400f84>",
"WARC-Date": "2014-11-23T11:36:05Z",
"WARC-IP-Address": "65.55.227.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5OENTP42OEKYKZAI2HL4PADCKQRVMRZJ",
"WARC-Record-ID": "<urn:uuid:5dbaa38d-6970-4a60-936d-676885be5b5e>",
"WARC-Target-URI": "http://office.microsoft.com/en-gb/training/share-your-calendar-RZ001030994.aspx?section=13",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b4aa612d-ed20-4306-b4af-be57affd881b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-23-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-49\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for November 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
2,
24,
25,
58,
59,
101,
102,
156,
157,
355,
356,
455,
519,
575,
576,
846,
847
],
"line_end_idx": [
2,
24,
25,
58,
59,
101,
102,
156,
157,
355,
356,
455,
519,
575,
576,
846,
847,
868
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 868,
"ccnet_original_nlines": 17,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4858756959438324,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011299439705908298,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14689266681671143,
"rps_doc_frac_unique_words": 0.5986841917037964,
"rps_doc_mean_word_length": 4.447368621826172,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.291501045227051,
"rps_doc_word_count": 152,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02662722021341324,
"rps_doc_frac_chars_top_3gram": 0.023668639361858368,
"rps_doc_frac_chars_top_4gram": 0.05325444042682648,
"rps_doc_books_importance": -69.63158416748047,
"rps_doc_books_importance_length_correction": -69.63158416748047,
"rps_doc_openwebtext_importance": -38.96319580078125,
"rps_doc_openwebtext_importance_length_correction": -33.53675079345703,
"rps_doc_wikipedia_importance": -33.286102294921875,
"rps_doc_wikipedia_importance_length_correction": -33.286102294921875
},
"fasttext": {
"dclm": 0.10616427659988403,
"english": 0.9387528896331787,
"fineweb_edu_approx": 1.0448259115219116,
"eai_general_math": 0.25106555223464966,
"eai_open_web_math": 0.2302008867263794,
"eai_web_code": 0.13130974769592285
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.432",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "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
|
-9,123,985,669,606,335,000 |
Home » Tech News » Steamwebhelper is not responding
Steamwebhelper is not responding
Steamwebhelper is a crucial component of Steam, the globally recognized gaming platform. Users encounter frustrating moments when steamwebhelper is not responding, affecting their overall gaming experience. This article delves into the causes behind the non-responsive nature of steamwebhelper and provides comprehensive solutions to rectify it. This user-friendly guide is aimed at aiding users to navigate through these issues efficiently, ensuring a seamless gaming experience.
Understanding Steamwebhelper
The steamwebhelper is a critical component integral to Steam’s functioning, acting as a browser process that renders the web content within the application. Its proper functioning is paramount for a smooth and seamless user experience on Steam. A malfunctioning steamwebhelper can significantly impede the usability and operation of the Steam client, leading to substantial inconveniences for the users.
Steamwebhelper is not responding
Causes Behind Steamwebhelper Not Responding
Certainly. The reasons behind the steamwebhelper not responding issue are multifarious and varied, each contributing to a disruption in user experience.
Outdated Software
One prime culprit behind the non-responsiveness of steamwebhelper can be outdated software. Outdated versions of Steam or system software may harbor bugs or compatibility issues, leading to operational disruptions.
Conflicting Applications
Another common reason is conflicting applications. Certain software running concurrently with Steam may interfere with its operations, causing the steamwebhelper to become unresponsive.
Faulty Internet Connections
A faulty or unstable internet connection can also be a significant factor. Interruptions or fluctuations in the network connectivity can hinder the seamless functioning of steamwebhelper.
Don’t miss: Spectrum Error Code rge-1001
Incompatible System Configurations
The presence of incompatible system configurations can also lead to this issue. Specific settings or configurations of the user’s system may conflict with Steam’s requirements, inducing operational anomalies.
Corrupted Files
Corrupted files within the Steam installation can notably impact the steamwebhelper’s responsiveness. These corrupt files can obstruct the normal workflow of the application, leading to a myriad of issues.
Browser Sandboxing Conflicts
The Browser Sandboxing feature, although crucial for security, might sometimes conflict with other processes, causing the steamwebhelper to stop responding.
Insufficient Permissions
Sometimes, insufficient permissions can also lead to the non-responsiveness of steamwebhelper. The lack of necessary permissions can restrict Steam from accessing essential resources, affecting its operation.
Overloaded Cache and Cookies
An overloaded browser cache and cookies in the Steam browser can also lead to steamwebhelper issues. Accumulation of these elements can result in conflicts and sluggishness, impacting the functionality of steamwebhelper.
Each of these reasons contributes to the overall issue of steamwebhelper not responding, and identifying the exact cause is the first step toward resolving it effectively.
How to Fix Steamwebhelper is not responding?
Fix 1: Update Outdated Software
Addressing outdated software is a fundamental step in rectifying the steamwebhelper not responding issue. Here’s a detailed step-by-step guide to ensure your software is up to date, allowing Steam to function seamlessly.
1. Check Steam for Updates:
• Open the Steam client on your computer.
• Navigate to the “Steam” menu located at the top-left corner.
• Select “Check for Steam Client Updates…” from the dropdown menu.
• If an update is available, follow the on-screen instructions to install it.
2. Update System Software:
• For Windows Users:
• Open Settings.
• Go to Update & Security > Windows Update.
• Click on Check for updates and install any available updates.
• For Mac Users:
• Open the Apple Menu.
• Select System Preferences > Software Update.
• If updates are available, click Update Now to install them.
3. Verify Steam Game Files:
• Go to your Steam Library.
• Right-click on the affected game and select Properties.
• Navigate to the Local Files tab.
• Click on Verify Integrity of Game Files.
• Steam will then check and replace any missing or corrupted game files.
4. Restart Steam:
• Once all updates are installed, close Steam completely.
• Relaunch the Steam client.
• Check whether steamwebhelper is responding.
5. Update Drivers:
• Regularly updating the drivers, especially the graphics drivers, is crucial.
• Navigate to the device manager on your computer and update all outdated drivers.
• For graphics drivers, it’s recommended to visit the manufacturer’s website, like NVIDIA, AMD, or Intel, to get the latest updates.
By meticulously following these steps, users can ensure that both Steam and their system software are updated, mitigating the risks of encountering steamwebhelper not responding due to outdated software. Regularly updating software and drivers is paramount in maintaining optimal application functionality and avoiding potential conflicts or compatibility issues, thereby enabling a smoother and more stable gaming experience on Steam.
Fix 2: Resolve Conflicting Applications
Addressing conflicting applications is crucial when dealing with steamwebhelper not responding. Certain applications running in the background may interfere with Steam, causing it to malfunction. Here’s a comprehensive guide to identify and resolve such conflicts:
1. Identify Conflicting Applications:
• Open Task Manager on Windows or Activity Monitor on Mac.
• Observe the running applications and processes.
• Look for any unfamiliar or suspicious applications that could be conflicting with Steam.
2. Close Potential Conflicting Applications:
• Select the potentially conflicting application.
• Click End Task on Windows or Quit on Mac.
• Restart Steam to see if the issue is resolved.
3. Perform Clean Boot:
• Performing a clean boot can help in identifying the conflicting software.
• For Windows:
• Type “msconfig” in the Run dialog box and press Enter.
• Go to the Services tab, check Hide all Microsoft services, and click Disable all.
• Go to the Startup tab, open Task Manager, and disable all startup items.
• Restart your computer and run Steam to see if the issue persists.
• For Mac:
• Boot in Safe Mode by restarting and holding the Shift key.
• Login and restart the computer normally to exit Safe Mode.
• Run Steam to check if steamwebhelper is responding.
4. Investigate Antivirus Interference:
• Some antivirus software may falsely identify Steam as a threat and block it.
• Check your antivirus quarantine or blocklist, and make sure Steam is not listed.
• If Steam is blocked, add it to the whitelist or exceptions list.
5. Uninstall Conflicting Software:
• If a specific software is identified as conflicting, consider uninstalling it.
• Navigate to Control Panel > Uninstall a program on Windows or use Finder on Mac to remove the application.
• After uninstalling, restart your computer and run Steam.
6. Reinstall Steam:
• If the issue persists, reinstalling Steam can resolve potential conflicts with other software.
• Backup your game files to avoid data loss.
• Uninstall Steam and download the latest version from the official website.
• Install Steam and restore your game files.
Addressing conflicting applications promptly and efficiently is pivotal in resolving steamwebhelper not responding issues. By isolating and eliminating these conflicts, users can ensure a harmonious interaction between Steam and other software, fostering a stable and uninterrupted gaming experience. Regularly monitoring and managing applications can significantly reduce the likelihood of conflicts and contribute to the overall health and performance of your system.
Fix 3: Rectify Faulty Internet Connections
A faulty or unstable internet connection can often be the unseen antagonist behind the steamwebhelper not responding issue. Here’s a well-rounded guide on diagnosing and resolving internet connection issues affecting Steam:
1. Test Internet Connection:
• Start by testing your internet connection using online tools like Speedtest.
• Ensure you have a stable and active internet connection before proceeding with other steps.
2. Restart the Router:
• A simple restart of your router can resolve minor connectivity glitches.
• Turn off the router, wait for a minute, and turn it back on.
• Once the network is stable, check if steamwebhelper is responding.
3. Disable VPN or Proxy:
• VPNs or proxies can sometimes interfere with Steam.
• Disable any VPN or proxy service you are using and try accessing Steam again.
4. Configure DNS Settings:
• Changing the DNS server can sometimes rectify connection issues.
• Modify the DNS settings to use Google’s DNS or another reliable DNS service.
• For changing DNS, navigate to Network and Sharing Center > Change adapter settings, right-click on your connection, select Properties, and alter the DNS servers under Internet Protocol Version 4 (TCP/IPv4).
5. Check Firewall Settings:
• Firewalls can block Steam from accessing the internet.
• Ensure Steam and steamwebhelper are allowed through your firewall.
• Access your firewall settings and make sure Steam is on the allowed list or add it if it’s not present.
6. Use a Wired Connection:
• If possible, switch to a wired connection instead of Wi-Fi for a more stable internet connection.
• Plug an Ethernet cable into your router and computer and see if it resolves the steamwebhelper issue.
7. Contact Your Internet Service Provider (ISP):
• If the issue still persists, there may be a problem from your ISP’s end.
• Contact your ISP and inquire if there are any outages or issues affecting your internet connection.
8. Steam Server Status:
• Lastly, check if Steam servers are down or experiencing issues.
• Use online tools or websites like Downdetector to verify the status of Steam servers.
By meticulously addressing the internet connection issues, users can significantly reduce the likelihood of encountering steamwebhelper not responding problems. Maintaining a stable and robust internet connection is paramount for seamless gaming experiences and ensures uninterrupted access to all of Steam’s features and services. Regularly reviewing and optimizing your network settings can lead to an enhanced and more reliable connection, fostering smooth and hassle-free gaming sessions on Steam.
Fix 4: Adjust Incompatible System Configurations
Incompatible system configurations can indeed be a silent instigator behind the steamwebhelper not responding predicament. To rectify such discrepancies, here’s a detailed methodical guide:
1. Adjust System Settings:
• Navigate to your system settings and review them to ensure compatibility with Steam’s requirements.
• Adjust any settings that could potentially be conflicting with the optimal functioning of Steam.
2. Modify Steam’s Compatibility Mode:
• Right-click on the Steam shortcut on your desktop and select Properties.
• Go to the Compatibility tab.
• Check the box that says Run this program in compatibility mode for, and select an older Windows version from the dropdown menu.
• Click Apply and then OK.
• Relaunch Steam and check if the steamwebhelper issue persists.
3. Update Operating System:
• An outdated operating system can cause compatibility issues.
• Update your OS to the latest version available, ensuring optimal compatibility and performance.
• For Windows, go to Settings > Update & Security > Windows Update and install any available updates.
4. Run Steam as Administrator:
• Running Steam with administrative privileges can solve permission-related issues.
• Right-click on the Steam shortcut and select Run as administrator.
• Confirm any prompts that appear and check if steamwebhelper is responding.
5. Configure Display Settings:
• Incorrect display settings can sometimes cause issues with steamwebhelper.
• Right-click on your desktop and select Display settings.
• Adjust the resolution and scaling to meet the system requirements of Steam.
• Confirm the changes and restart Steam.
6. Adjust Steam Launch Options:
• Configuring Steam’s launch options can resolve compatibility issues.
• Right-click on your game in Steam Library, select Properties, and enter the necessary launch options.
• Save the changes and restart Steam to see if the issue is resolved.
7. Reset Steam Configuration:
• Resetting Steam’s configuration can solve issues caused by incorrect settings.
• Close Steam completely.
• Press Windows + R, type “steam://flushconfig” in the Run dialog box, and press Enter.
• Confirm the action and restart your computer. Launch Steam again and log in.
By amending incompatible system configurations, users can diminish the possibilities of steamwebhelper not responding. Regularly reviewing and adjusting system and application settings can circumvent potential conflicts, ensuring a smooth and interruption-free interaction between the system and Steam. Addressing these aspects proactively can greatly enhance the overall user experience and provide a seamless and enjoyable gaming environment on Steam.
Fix 5: Clear Steam Web Browser Cache and Cookies
Accumulated cache and cookies in the Steam web browser can sometimes lead to the steamwebhelper not responding issue. Here’s a precise guide to clearing cache and cookies in Steam to resolve such hindrances:
1. Access Steam Settings:
• Open the Steam client on your computer.
• Navigate to the Steam menu located at the top-left corner and select Settings from the dropdown.
2. Navigate to Web Browser Settings:
• Within the Settings window, locate and select the Web Browser tab.
• This tab houses the options related to Steam’s built-in web browser settings.
3. Clear Web Browser Cache:
• Once in the Web Browser tab, find and click on the Delete Web Browser Cache button.
• Confirm the action when prompted.
• Clearing the cache will remove the locally stored data, potentially resolving conflicts or corruptions causing the steamwebhelper to malfunction.
4. Clear Cookies:
• Similarly, find and click on the Delete All Browser Cookies button.
• Confirm the action, allowing Steam to remove all the cookies stored by the web browser.
• Clearing cookies can resolve issues related to session data and login states affecting steamwebhelper.
5. Restart Steam:
• After clearing both the cache and cookies, close all open Steam windows.
• Restart the Steam client to allow the changes to take effect and check if steamwebhelper is now responding properly.
6. Refrain from Excessive Cache Accumulation:
• Regularly clearing cache and cookies can prevent them from accumulating and causing issues.
• Consider periodically following the above steps to maintain Steam’s web browser’s optimal functionality.
By methodically clearing Steam’s web browser cache and cookies, users can potentially resolve the underlying causes of steamwebhelper not responding and reinstate the smooth operation of Steam’s web-related features. Maintaining cleanliness in the browser’s stored data ensures the avoidance of data corruption and conflicts, paving the way for an uninterrupted and streamlined gaming experience on Steam. Regular maintenance of Steam’s web browser components contributes to the long-term stability and performance of the platform.
Fix 6: Update Graphics Driver and Disable GPU Acceleration
Sometimes, outdated or incompatible graphics drivers can be a significant cause behind the steamwebhelper not responding error. Furthermore, GPU acceleration can also interfere with Steam’s functioning. Here’s how to address these issues:
1. Update Graphics Driver:
• Open Device Manager on your computer.
• Locate and expand the Display adapters section.
• Right-click on your graphics adapter and choose Update driver.
• Follow the prompts to search for and install any available updates.
2. Reinstall Graphics Driver:
• If updating doesn’t work, you can try reinstalling the driver.
• In the Device Manager, right-click your graphics adapter again and select Uninstall device.
• Restart your computer. Windows should automatically reinstall the driver.
• After reinstalling, check if steamwebhelper is responding.
3. Disable GPU Acceleration in Steam:
• Open the Steam client and go to Settings.
• Select the Interface tab.
• Find and uncheck the Enable GPU accelerated rendering in web views option.
• Click OK and restart Steam to apply the changes.
4. Adjust In-Game Settings:
• Lowering in-game graphics settings can also reduce the load on your GPU.
• Open the settings menu in your game and lower the graphics settings.
• After adjusting, see if the steamwebhelper issue persists.
5. Install Latest DirectX Version:
• Having the latest version of DirectX can resolve compatibility issues with the graphics driver.
• Visit the official Microsoft website to download and install the latest DirectX version compatible with your system.
6. Monitor GPU Temperature and Usage:
• Overheating or overuse of GPU can also cause issues.
• Use software like MSI Afterburner to monitor GPU temperature and usage.
• If the GPU is overheating, consider improving cooling in your system, and if usage is high, consider lowering game settings or using a less resource-intensive application.
By proactively updating graphics drivers and moderating GPU acceleration, users can ensure the smooth interaction between Steam and the system’s graphics components, mitigating the steamwebhelper not responding problem. Regularly updating drivers and adjusting graphics settings to suit your system’s capabilities can yield a seamless and enjoyable gaming experience, free from interruptions and hitches, while maintaining the visual fidelity of your games on Steam.
Fix 7: Run Steam with Lower Priority
In some cases, running Steam with high priority can cause resource allocation conflicts, leading to the steamwebhelper not responding issue. Adjusting Steam’s priority can help in the effective allocation of system resources, thus potentially resolving the problem. Here’s a detailed step-by-step guide:
1. Open Task Manager:
• Press Ctrl + Shift + Esc or right-click on the taskbar and select Task Manager to open it.
• This tool allows you to view and manage the processes running on your computer.
2. Locate Steam Processes:
• In the Processes tab, find all the processes related to Steam.
• Look for Steam Client Bootstrapper and steamwebhelper processes.
3. Change Priority:
• Right-click on the Steam Client Bootstrapper process and hover over Set priority.
• Choose a lower priority level, such as Below normal or Low.
• Perform the same action for all steamwebhelper processes.
4. Observe System Response:
• After changing the priority, observe if Steam and the overall system performance improve.
• Check if steamwebhelper is now responding properly.
5. Check Other High-Priority Processes:
• While in the Task Manager, review other high-priority processes that might be hogging system resources.
• Consider lowering the priority of other non-essential high-priority processes if needed.
6. Ensure Adequate System Resources:
• Regularly monitor your system’s resource usage to avoid overutilization.
• Use Task Manager to close unnecessary applications running in the background.
7. Optimize PC Performance:
• Regularly update your system and optimize settings for better performance.
• Use built-in or third-party optimization tools to manage system resources effectively.
By carefully adjusting the priority levels of Steam and other processes, users can potentially rectify the steamwebhelper not responding issue. Managing and allocating system resources efficiently can lead to a balanced and harmonious computing environment, allowing all applications, including Steam, to run smoothly without interfering with each other. Regular monitoring and adjustment of process priorities can significantly enhance the stability and responsiveness of both Steam and the overall system, ensuring a hassle-free gaming experience.
Fix 8: Disable Browser Sandboxing
Browser Sandboxing is an essential security feature in Steam, isolating individual browsers from each other and from local resources. However, in some instances, it may lead to the steamwebhelper not responding issue. To resolve this, you can temporarily disable Browser Sandboxing by following the steps below:
1. Navigate to Steam’s Shortcut:
• Find the Steam shortcut on your desktop or start menu.
• This is the quickest way to access Steam properties where you can adjust sandboxing settings.
2. Open Properties:
• Right-click on the Steam shortcut and select Properties from the dropdown menu.
• This will open a window where you can modify various Steam settings.
3. Modify Target Field:
• In the Target field, you will see the path to the Steam executable.
• Add -no-cef-sandbox at the end of this path. The final line should look something like this: “C:\Program Files (x86)\Steam\Steam.exe” -no-cef-sandbox
4. Apply Changes:
• Click Apply, then OK to save the changes.
• These changes will disable the Browser Sandboxing feature the next time you launch Steam.
5. Restart Steam:
• Close any open Steam windows and restart the client for the changes to take effect.
• After restarting, verify whether the steamwebhelper is now responding as expected.
6. Reenable Browser Sandboxing:
• After verifying whether the issue is resolved, it’s recommended to reenable Browser Sandboxing for security reasons.
• Repeat the steps and remove -no-cef-sandbox from the Target field to reenable it.
7. Stay Updated and Maintain Security:
• Regularly update Steam and your system to receive the latest security features and improvements.
• Maintain a balance between security and functionality to enjoy a secure and smooth gaming experience.
By temporarily disabling Browser Sandboxing, users can deduce whether it is the culprit behind steamwebhelper not responding. It is crucial to reenable it afterward to maintain security and protect your system from potential threats. Regularly updating and maintaining a secure environment can help users enjoy a seamless and worry-free gaming experience on Steam without compromising their system’s safety.
Preventative steamwebhelper not responding issues
Maintain System and Application Updates:
• Regularly Update Steam: Ensure that Steam is always updated to the latest version. Updates often include fixes for various issues and improvements in performance.
• Update Operating System: Keep your operating system updated with the latest patches and security updates to avoid compatibility issues and vulnerabilities.
• Update Graphics Drivers: Regularly updating graphics drivers can resolve compatibility issues and improve performance, preventing problems with steamwebhelper.
Manage System Resources Wisely:
• Monitor System Performance: Regularly check the system’s performance using Task Manager or similar tools to avoid overutilization of resources which can lead to application unresponsiveness.
• Close Unnecessary Applications: Shut down unnecessary background applications and processes to free up system resources for Steam and its components.
Optimize Internet Connection:
• Use Stable Internet Connection: A stable and fast internet connection can prevent many issues related to steamwebhelper. Avoid using public Wi-Fi and prefer wired connections when possible.
• Configure Network Settings: Properly configured network settings can help in avoiding connectivity-related issues with Steam. Regularly review and adjust network settings as necessary.
Regular Maintenance:
• Clear Cache and Cookies Regularly: Regular cleaning of Steam’s web browser cache and cookies can prevent accumulation and potential conflicts, ensuring smooth operation.
• Perform Regular System Scans: Regularly scan your system for malware and viruses. Any malicious software present can interfere with Steam’s functioning.
Adjust Steam Settings:
• Disable GPU Acceleration if Necessary: If you experience issues with steamwebhelper, consider disabling GPU acceleration in Steam settings, especially if your GPU or its drivers are not compatible.
• Use Steam’s Safe Mode: Running Steam in safe mode can help in identifying and resolving issues related to steamwebhelper by loading Steam with a minimum set of drivers and services.
Regular Backups:
• Backup Important Data: Regularly backup important game data and settings to avoid loss in case of any severe issues with Steam.
• Create System Restore Points: Regularly creating restore points for your system can be crucial for quickly reverting your system to a previous state in case of any critical errors or malfunctions.
By following these preventative measures and tips, users can significantly reduce the likelihood of encountering the steamwebhelper not responding issue, ensuring a more stable and seamless gaming experience on Steam. Balancing security, system optimization, and resource management is key to maintaining a trouble-free environment for gaming and other computer-related activities.
Conclusion
Encountering a non-responsive steamwebhelper can be inconvenient for avid Steam users. Understanding the causes, such as outdated software, conflicting applications, or faulty configurations, is pivotal in addressing the issue effectively. Solutions ranging from restarting Steam, disabling GPU acceleration, and updating software, to running Steam as an administrator and reinstalling the application, can aid users in mitigating this problem, leading to an enhanced, unimpeded gaming experience. It’s crucial to approach each solution mindfully, ensuring the longevity and optimal performance of the Steam application, thereby offering users a seamless and enjoyable gaming environment.
FAQs
What is steamwebhelper?
It’s a component of Steam that manages browser-based aspects and web-related functions of the client.
Why does steamwebhelper stop responding?
It may face issues due to outdated drivers, software conflicts, or system resource limitations.
Can restarting Steam solve the not responding issue?
Yes, a simple restart can sometimes resolve the issue by refreshing the Steam’s processes and connections.
Similar Posts
|
{
"url": "https://basicknowledgehub.com/steamwebhelper-is-not-responding/",
"source_domain": "basicknowledgehub.com",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "180679",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:THLUEMPL26ISW33SBZXMJEW7ZVVLSXF6",
"WARC-Concurrent-To": "<urn:uuid:3ad3b598-2122-4546-ab01-3892f57cbab4>",
"WARC-Date": "2024-07-19T22:33:44Z",
"WARC-IP-Address": "172.67.195.77",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:J7DI4YIPL3SYIPPG5ZLO5KDANWKCOGBU",
"WARC-Record-ID": "<urn:uuid:85bd2ec7-b1fc-409a-b764-7b049aa1de02>",
"WARC-Target-URI": "https://basicknowledgehub.com/steamwebhelper-is-not-responding/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:73bf17a8-8eb7-432d-9257-5d9f36abf5ba>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-32\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,
52,
53,
86,
87,
568,
569,
598,
599,
1003,
1004,
1037,
1038,
1083,
1084,
1237,
1238,
1256,
1257,
1472,
1473,
1498,
1499,
1685,
1686,
1714,
1715,
1903,
1904,
1945,
1946,
1981,
1982,
2191,
2192,
2208,
2209,
2415,
2416,
2445,
2446,
2603,
2604,
2629,
2630,
2839,
2840,
2869,
2870,
3091,
3092,
3264,
3265,
3310,
3311,
3343,
3344,
3565,
3566,
3596,
3642,
3709,
3780,
3862,
3891,
3916,
3939,
3989,
4059,
4080,
4109,
4162,
4230,
4260,
4292,
4354,
4393,
4440,
4517,
4537,
4599,
4632,
4682,
4703,
4786,
4873,
5010,
5011,
5447,
5448,
5488,
5489,
5754,
5755,
5795,
5858,
5912,
6007,
6054,
6108,
6156,
6209,
6234,
6314,
6333,
6396,
6486,
6567,
6641,
6656,
6723,
6790,
6850,
6891,
6974,
7061,
7132,
7169,
7254,
7367,
7430,
7452,
7553,
7602,
7683,
7732,
7733,
8203,
8204,
8247,
8248,
8472,
8473,
8504,
8587,
8685,
8710,
8789,
8856,
8929,
8956,
9014,
9098,
9127,
9198,
9281,
9494,
9524,
9585,
9658,
9768,
9797,
9901,
10009,
10060,
10139,
10245,
10271,
10341,
10433,
10434,
10936,
10937,
10986,
10987,
11177,
11178,
11207,
11313,
11416,
11456,
11535,
11570,
11704,
11735,
11804,
11834,
11901,
12003,
12109,
12142,
12230,
12303,
12384,
12417,
12498,
12561,
12643,
12688,
12722,
12797,
12905,
12979,
13011,
13096,
13126,
13218,
13301,
13302,
13756,
13757,
13806,
13807,
14015,
14016,
14044,
14090,
14193,
14232,
14305,
14389,
14419,
14509,
14549,
14701,
14721,
14795,
14889,
14998,
15018,
15097,
15220,
15268,
15366,
15477,
15478,
16010,
16011,
16070,
16071,
16310,
16311,
16340,
16384,
16438,
16507,
16581,
16613,
16682,
16780,
16860,
16925,
16965,
17013,
17045,
17126,
17181,
17211,
17290,
17365,
17430,
17467,
17569,
17692,
17732,
17791,
17869,
18047,
18048,
18515,
18516,
18553,
18554,
18858,
18859,
18883,
18980,
19066,
19095,
19164,
19235,
19257,
19345,
19411,
19475,
19505,
19601,
19659,
19701,
19811,
19906,
19945,
20024,
20108,
20138,
20219,
20312,
20313,
20863,
20864,
20898,
20899,
21211,
21212,
21247,
21308,
21408,
21430,
21516,
21591,
21617,
21691,
21847,
21867,
21915,
22011,
22031,
22121,
22210,
22244,
22367,
22455,
22496,
22599,
22707,
22708,
23116,
23117,
23167,
23168,
23209,
23210,
23377,
23537,
23701,
23702,
23734,
23735,
23930,
24084,
24085,
24115,
24116,
24310,
24499,
24500,
24521,
24522,
24696,
24853,
24854,
24877,
24878,
25080,
25266,
25267,
25284,
25285,
25417,
25618,
25619,
26001,
26002,
26013,
26014,
26703,
26704,
26709,
26710,
26734,
26735,
26837,
26838,
26879,
26880,
26976,
26977,
27030,
27031,
27138,
27139
],
"line_end_idx": [
52,
53,
86,
87,
568,
569,
598,
599,
1003,
1004,
1037,
1038,
1083,
1084,
1237,
1238,
1256,
1257,
1472,
1473,
1498,
1499,
1685,
1686,
1714,
1715,
1903,
1904,
1945,
1946,
1981,
1982,
2191,
2192,
2208,
2209,
2415,
2416,
2445,
2446,
2603,
2604,
2629,
2630,
2839,
2840,
2869,
2870,
3091,
3092,
3264,
3265,
3310,
3311,
3343,
3344,
3565,
3566,
3596,
3642,
3709,
3780,
3862,
3891,
3916,
3939,
3989,
4059,
4080,
4109,
4162,
4230,
4260,
4292,
4354,
4393,
4440,
4517,
4537,
4599,
4632,
4682,
4703,
4786,
4873,
5010,
5011,
5447,
5448,
5488,
5489,
5754,
5755,
5795,
5858,
5912,
6007,
6054,
6108,
6156,
6209,
6234,
6314,
6333,
6396,
6486,
6567,
6641,
6656,
6723,
6790,
6850,
6891,
6974,
7061,
7132,
7169,
7254,
7367,
7430,
7452,
7553,
7602,
7683,
7732,
7733,
8203,
8204,
8247,
8248,
8472,
8473,
8504,
8587,
8685,
8710,
8789,
8856,
8929,
8956,
9014,
9098,
9127,
9198,
9281,
9494,
9524,
9585,
9658,
9768,
9797,
9901,
10009,
10060,
10139,
10245,
10271,
10341,
10433,
10434,
10936,
10937,
10986,
10987,
11177,
11178,
11207,
11313,
11416,
11456,
11535,
11570,
11704,
11735,
11804,
11834,
11901,
12003,
12109,
12142,
12230,
12303,
12384,
12417,
12498,
12561,
12643,
12688,
12722,
12797,
12905,
12979,
13011,
13096,
13126,
13218,
13301,
13302,
13756,
13757,
13806,
13807,
14015,
14016,
14044,
14090,
14193,
14232,
14305,
14389,
14419,
14509,
14549,
14701,
14721,
14795,
14889,
14998,
15018,
15097,
15220,
15268,
15366,
15477,
15478,
16010,
16011,
16070,
16071,
16310,
16311,
16340,
16384,
16438,
16507,
16581,
16613,
16682,
16780,
16860,
16925,
16965,
17013,
17045,
17126,
17181,
17211,
17290,
17365,
17430,
17467,
17569,
17692,
17732,
17791,
17869,
18047,
18048,
18515,
18516,
18553,
18554,
18858,
18859,
18883,
18980,
19066,
19095,
19164,
19235,
19257,
19345,
19411,
19475,
19505,
19601,
19659,
19701,
19811,
19906,
19945,
20024,
20108,
20138,
20219,
20312,
20313,
20863,
20864,
20898,
20899,
21211,
21212,
21247,
21308,
21408,
21430,
21516,
21591,
21617,
21691,
21847,
21867,
21915,
22011,
22031,
22121,
22210,
22244,
22367,
22455,
22496,
22599,
22707,
22708,
23116,
23117,
23167,
23168,
23209,
23210,
23377,
23537,
23701,
23702,
23734,
23735,
23930,
24084,
24085,
24115,
24116,
24310,
24499,
24500,
24521,
24522,
24696,
24853,
24854,
24877,
24878,
25080,
25266,
25267,
25284,
25285,
25417,
25618,
25619,
26001,
26002,
26013,
26014,
26703,
26704,
26709,
26710,
26734,
26735,
26837,
26838,
26879,
26880,
26976,
26977,
27030,
27031,
27138,
27139,
27152
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 27152,
"ccnet_original_nlines": 370,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2951626777648926,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008989729918539524,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18878425657749176,
"rps_doc_frac_unique_words": 0.20735444128513336,
"rps_doc_mean_word_length": 5.558222770690918,
"rps_doc_num_sentences": 297,
"rps_doc_symbol_to_word_ratio": 0.0002140400029020384,
"rps_doc_unigram_entropy": 5.605472564697266,
"rps_doc_word_count": 3916,
"rps_doc_frac_chars_dupe_10grams": 0.010107509791851044,
"rps_doc_frac_chars_dupe_5grams": 0.12312781065702438,
"rps_doc_frac_chars_dupe_6grams": 0.0724983885884285,
"rps_doc_frac_chars_dupe_7grams": 0.04056786000728607,
"rps_doc_frac_chars_dupe_8grams": 0.02480934001505375,
"rps_doc_frac_chars_dupe_9grams": 0.016355780884623528,
"rps_doc_frac_chars_top_2gram": 0.01612607017159462,
"rps_doc_frac_chars_top_3gram": 0.026049800217151642,
"rps_doc_frac_chars_top_4gram": 0.015161260031163692,
"rps_doc_books_importance": -1805.1527099609375,
"rps_doc_books_importance_length_correction": -1805.1527099609375,
"rps_doc_openwebtext_importance": -1053.3238525390625,
"rps_doc_openwebtext_importance_length_correction": -1053.3238525390625,
"rps_doc_wikipedia_importance": -851.0426025390625,
"rps_doc_wikipedia_importance_length_correction": -851.0426025390625
},
"fasttext": {
"dclm": 0.055669430643320084,
"english": 0.8551903367042542,
"fineweb_edu_approx": 1.8317590951919556,
"eai_general_math": 0.03834598883986473,
"eai_open_web_math": 0.14503663778305054,
"eai_web_code": 0.039188798516988754
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.468",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-6,264,552,801,936,769,000 |
id summary reporter owner description type status priority milestone component version resolution keywords cc os architecture failure testcase blockedby blocking related differential wikipage 1232 generalise runhaskell to support arbitrary file names, not just those with .{l}hs extensions Frederik "The GHC installation should include an executable (either a binary or e.g. /bin/sh script) which can be used at the top of files with the unix ""#!"" mechanism to create an executable script. Malcolm Wallace points out that runhs from the hmake distribution can be used for this, but it should really be part of GHC. http://www.haskell.org/pipermail/glasgow-haskell-users/2007-March/012172.html Now that Simon Marlow (?) has implemented the '-x' option to allow files to use arbitrary extensions, this should be as easy as a 2 or 3 line shell script, although I don't know if runghc recognises -x so maybe there is a bit more work to be done. I would suggest that the name of the executable be 'runhs-ghc' and that a link should be created called 'runhs' (similar to 'runhaskell'; also included in /etc/alternatives/ in Debian) which can be shared with other compilers/interpreters. For instance, if runghc recognised -x then the following would work as the contents of runhs-ghc: #!/bin/sh /path/to/runghc -x hs ""$@"" (The /path/to/runghc should point to the runghc which is installed at the same time as the above script is installed, so it will not be as simple as copying the script into place - some variable substitution will be needed - I think this is standard practice, see the 'firefox' script on a Linux distro for an example of such binding) Thanks, Frederik" feature request closed normal 6.10.1 Compiler 6.6 fixed runhaskell Bulat.Ziganshin@… id@… Unknown/Multiple Unknown/Multiple
|
{
"url": "https://ghc.haskell.org/trac/ghc/ticket/1232?format=tab",
"source_domain": "ghc.haskell.org",
"snapshot_id": "crawl=CC-MAIN-2016-36",
"warc_metadata": {
"Content-Length": "2256",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7CYGQEFN5I36T7IUMXDDXGWS3KK5TMBT",
"WARC-Concurrent-To": "<urn:uuid:1a4c34c4-7611-4ed7-8f72-5f45b8fcad7d>",
"WARC-Date": "2016-08-30T09:13:04Z",
"WARC-IP-Address": "162.242.166.62",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:SO2TTONVVW6PLSNCIJ6ZZZLI34XR2RXE",
"WARC-Record-ID": "<urn:uuid:73d3285c-e391-4d4b-b38a-007987192c45>",
"WARC-Target-URI": "https://ghc.haskell.org/trac/ghc/ticket/1232?format=tab",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3173c8e0-53f4-4a64-9cf1-8d9f8f6f4a76>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-153-172-175.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-36\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
1797
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1797,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.001112970057874918,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36125653982162476,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013089009560644627,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23560209572315216,
"rps_doc_frac_unique_words": 0.625,
"rps_doc_mean_word_length": 5.231617450714111,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0.01047119963914156,
"rps_doc_unigram_entropy": 4.859467506408691,
"rps_doc_word_count": 272,
"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.010541110299527645,
"rps_doc_frac_chars_top_3gram": 0.01405480969697237,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -165.94326782226562,
"rps_doc_books_importance_length_correction": -161.0210418701172,
"rps_doc_openwebtext_importance": -95.12074279785156,
"rps_doc_openwebtext_importance_length_correction": -95.12074279785156,
"rps_doc_wikipedia_importance": -52.907676696777344,
"rps_doc_wikipedia_importance_length_correction": -52.511112213134766
},
"fasttext": {
"dclm": 0.05812472105026245,
"english": 0.8899018168449402,
"fineweb_edu_approx": 1.8663368225097656,
"eai_general_math": 0.97455233335495,
"eai_open_web_math": 0.6249035000801086,
"eai_web_code": 0.8457621932029724
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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
|
-6,716,354,103,413,866,000 |
SVNBOOK Chap1 Subversion in Action Revisions
De Framalang Wiki.
Cette page fait partie du projet Version control with subversion.
Pseudo Code Rôle Statut
Penugin Traduction Terminé
SVF 1ère Relecture Fait
HST Mise à jour en version 1.5 Fait
Relecture
Validation
Sommaire
Titre
Revisions
Révisions
Paragraphe 1
An svn commit operation publishes changes to any number of files and directories as a single atomic transaction. In your working copy, you can change files' contents; create, delete, rename and copy files and directories; then commit a complete set of changes as an atomic transaction.
Une opération svn commit publie les modifications d'un nombre quelconque de fichiers et de répertoires en une seule opération atomique. Dans votre copie de travail, vous pouvez modifier le contenu des fichiers : créer, supprimer, renommer et copier fichiers et répertoires ; puis propager un ensemble de modifications en une seule transaction atomique.
Paragraphe 2
By “atomic transaction”, we mean simply this: either all of the changes happen in the repository, or none of them happen. Subversion tries to retain this atomicity in the face of program crashes, system crashes, network problems, and other users' actions.
Par "transaction atomique", on entend simplement ceci : soit toutes les modifications sont propagées dans le dépôt, soit aucune ne l'est. Subversion essaie de conserver cette atomicité vis-à-vis des plantages du programme, du système ou du réseau, et vis-à-vis des actions des autres utilisateurs.
Paragraphe 3
Each time the repository accepts a commit, this creates a new state of the filesystem tree, called a revision. Each revision is assigned a unique natural number, one greater than the number of the previous revision. The initial revision of a freshly created repository is numbered zero, and consists of nothing but an empty root directory.
Chaque fois que le dépôt accepte une propagation, ceci crée un nouvel état de l'arborescence du système de fichiers, appelé révision. Un numéro unique est associé à chaque révision, correspondant au numéro de la révision précédente augmenté de 1. La révision initiale d'un dépôt fraîchement créé porte le numéro 0 et ne consiste en rien d'autre qu'un répertoire racine vide.
Paragraphe 4
Figure 1.7, “The repository” illustrates a nice way to visualize the repository. Imagine an array of revision numbers, starting at 0, stretching from left to right. Each revision number has a filesystem tree hanging below it, and each tree is a “snapshot” of the way the repository looked after a commit.
La figure 1.7, "Le dépôt", offre une vue intéressante du dépôt. Imaginez un tableau de numéros de révisions, commençant à 0 et s'étirant de la gauche vers la droite. Chaque numéro de révision correspond à une arborescence de système de fichiers située en-dessous de lui, et chaque arborescence est un "instantané" ("snapshot" en anglais) de ce à quoi ressemble le dépôt après une propagation.
Paragraphe 5
Global Revision Numbers
Unlike most version control systems, Subversion's revision numbers apply to entire trees, not individual files. Each revision number selects an entire tree, a particular state of the repository after some committed change. Another way to think about it is that revision N represents the state of the repository filesystem after the Nth commit. When Subversion users talk about “revision 5 of foo.c”, they really mean “foo.c as it appears in revision 5.” Notice that in general, revisions N and M of a file do not necessarily differ! Many other version control systems use per-file revision numbers, so this concept may seem unusual at first. (Former CVS users might want to see Appendix B, Subversion for CVS Users for more details.)
Numéros de révision globaux
Contrairement à la plupart des systèmes de gestion de versions, les numéros de révision de Subversion s'appliquent à l'arborescence toute entière, pas à chaque fichier individuellement. A chaque numéro de révision correspond une arborescence toute entière, un état particulier du dépôt après une propagation de modifications. Une autre façon de voir cela est de considérer que la révision N représente l'état du système de fichiers du dépôt après la Nième propagation. Quand des utilisateurs de Subversion parlent de la "révision 5 de truc.c", ils veulent parler en fait de "truc.c tel qu'il apparaît dans la révision 5". Remarquez bien qu'en règle générale, les révisions N et M d'un fichier ne sont pas forcément différentes ! Beaucoup d'autres systèmes de gestion de versions utilisent des numéros de révision gérés par fichier, ce concept peut donc sembler inhabituel à première vue. (Les anciens utilisateurs de CVS peuvent se référer à l'appendice B, "Subversion pour les utilisateurs de CVS" pour plus de détails).
Paragraphe 6
It's important to note that working copies do not always correspond to any single revision in the repository; they may contain files from several different revisions. For example, suppose you check out a working copy from a repository whose most recent revision is 4:
Il est important de noter que les copies de travail ne correspondent pas toujours à une unique révision dans le dépôt ; elles peuvent contenir des fichiers provenant de plusieurs révisions différentes. Par exemple, supposons que vous extrayiez une copie de travail d'un dépôt dont la révision la plus récente est la 4 :
calc/Makefile:4
integer.c:4
button.c:4
calc/Makefile:4
entier.c:4
bouton.c:4
Paragraphe 7
At the moment, this working directory corresponds exactly to revision 4 in the repository. However, suppose you make a change to button.c, and commit that change. Assuming no other commits have taken place, your commit will create revision 5 of the repository, and your working copy will now look like this:
A cet instant, le répertoire de travail correspond exactement à la révision 4 du dépôt. Néanmoins, supposons que vous effectuiez une modification à bouton.c, et que vous propagiez cette modification. En supposant qu'aucune autre propagation n'a eu lieu, votre propagation va créer la révision 5 du dépôt, et votre copie de travail va maintenant ressembler à ceci :
calc/Makefile:4
entier.c:4
bouton.c:5
Paragraphe 8
Suppose that, at this point, Sally commits a change to integer.c, creating revision 6. If you use svn update to bring your working copy up to date, it will look like this:
Supposons maintenant qu'à ce moment, Sally propage une modification à entier.c, créant la révision 6. Si vous utilisez svn update pour mettre à jour votre copie de travail, elle va alors ressembler à ceci :
calc/Makefile:6
integer.c:6
button.c:6
calc/Makefile:6
entier.c:6
bouton.c:6
Paragraphe 9
Sally's change to integer.c will appear in your working copy, and your change will still be present in button.c. In this example, the text of Makefile is identical in revisions 4, 5, and 6, but Subversion will mark your working copy of Makefile with revision 6 to indicate that it is still current. So, after you do a clean update at the top of your working copy, it will generally correspond to exactly one revision in the repository.
Les modifications apportées par Sally à entier.c vont apparaître dans votre copie de travail, et vos modifications seront toujours présentes dans bouton.c. Dans cet exemple, le texte de Makefile est identique dans les révisions 4, 5 et 6, mais Subversion va marquer votre copie de travail comme étant à la révision 6 pour indiquer qu'elle est à jour. Ainsi, quand vous effectuez une mise à jour au niveau de la racine de votre copie de travail, celle-ci correspondra en général à une révision donnée du dépôt.
|
{
"url": "http://www.framalang.org/wiki/SVNBOOK_Chap1_Subversion_in_Action_Revisions",
"source_domain": "www.framalang.org",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "25961",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EBCWM5HTSH2WMVGDZ7R352ZKJHPSDBYM",
"WARC-Concurrent-To": "<urn:uuid:fdcb9b93-f555-4ab3-b6a8-12b04a195487>",
"WARC-Date": "2013-05-19T01:16:27Z",
"WARC-IP-Address": "91.121.102.77",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:COEOZ46E64KWW4BGNHGB5LXXIGBZB4CZ",
"WARC-Record-ID": "<urn:uuid:718e131e-f69f-40d7-ab23-71f5be8ba4ee>",
"WARC-Target-URI": "http://www.framalang.org/wiki/SVNBOOK_Chap1_Subversion_in_Action_Revisions",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dacbe45a-3fbc-4041-b0f1-2b6ac949ad91>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-60-113-184.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-20\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Spring 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
45,
46,
65,
66,
132,
133,
134,
158,
185,
209,
245,
255,
266,
267,
268,
269,
278,
279,
285,
286,
296,
306,
307,
320,
321,
607,
960,
961,
974,
975,
1231,
1529,
1530,
1543,
1544,
1884,
2259,
2260,
2273,
2274,
2579,
2972,
2973,
2986,
2987,
3011,
3012,
3746,
3747,
3775,
3776,
4798,
4799,
4812,
4813,
5081,
5401,
5417,
5433,
5448,
5464,
5479,
5494,
5495,
5508,
5509,
5817,
6182,
6198,
6213,
6228,
6229,
6242,
6243,
6415,
6622,
6638,
6654,
6669,
6685,
6700,
6715,
6716,
6729,
6730,
7166
],
"line_end_idx": [
45,
46,
65,
66,
132,
133,
134,
158,
185,
209,
245,
255,
266,
267,
268,
269,
278,
279,
285,
286,
296,
306,
307,
320,
321,
607,
960,
961,
974,
975,
1231,
1529,
1530,
1543,
1544,
1884,
2259,
2260,
2273,
2274,
2579,
2972,
2973,
2986,
2987,
3011,
3012,
3746,
3747,
3775,
3776,
4798,
4799,
4812,
4813,
5081,
5401,
5417,
5433,
5448,
5464,
5479,
5494,
5495,
5508,
5509,
5817,
6182,
6198,
6213,
6228,
6229,
6242,
6243,
6415,
6622,
6638,
6654,
6669,
6685,
6700,
6715,
6716,
6729,
6730,
7166,
7675
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7675,
"ccnet_original_nlines": 86,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21301774680614471,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011176859959959984,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20775805413722992,
"rps_doc_frac_unique_words": 0.41439205408096313,
"rps_doc_mean_word_length": 5.215053558349609,
"rps_doc_num_sentences": 75,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.655872821807861,
"rps_doc_word_count": 1209,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.026962729170918465,
"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.020618559792637825,
"rps_doc_frac_chars_top_3gram": 0.01554321963340044,
"rps_doc_frac_chars_top_4gram": 0.01808089017868042,
"rps_doc_books_importance": -671.7161865234375,
"rps_doc_books_importance_length_correction": -671.7161865234375,
"rps_doc_openwebtext_importance": -403.99114990234375,
"rps_doc_openwebtext_importance_length_correction": -403.99114990234375,
"rps_doc_wikipedia_importance": -375.3337707519531,
"rps_doc_wikipedia_importance_length_correction": -375.3337707519531
},
"fasttext": {
"dclm": 0.6574330925941467,
"english": 0.06957759708166122,
"fineweb_edu_approx": 1.415893316268921,
"eai_general_math": 0.0828818678855896,
"eai_open_web_math": 0.608171820640564,
"eai_web_code": 0.9330848455429077
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
7,646,475,450,263,790,000 |
What is the difference between Serializable and parseable?
Member
by kim , in category: Technology , 3 years ago
What is the difference between Serializable and parseable?
Facebook Twitter LinkedIn Telegram Whatsapp
1 answer
Member
by ashlynn , 3 years ago
Serializable is a standard Java interface. It is not a part of the Android SDK. Its simplicity is its biggest beauty. Just by implementing this interface the POJO will be ready to jump from one particular activity to another. There is another interface known as parseable. It is a part of the Android SDK. Paracelable was specifically designed in a way that there is no reflection left while using.
|
{
"url": "https://emediaworld.com/thread/what-is-the-difference-between-serializable-and",
"source_domain": "emediaworld.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "87612",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NYXPDNMEKF7OK2RQ6BI5I7PUIABJBCAD",
"WARC-Concurrent-To": "<urn:uuid:e96d1e97-d158-4aee-872b-6331ad435740>",
"WARC-Date": "2024-02-25T03:14:55Z",
"WARC-IP-Address": "206.189.243.26",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SDC2SOS75RPLYA6MOP47CTSR3NFPMUOC",
"WARC-Record-ID": "<urn:uuid:e46c042a-55dd-4605-b820-a6afcf5848a5>",
"WARC-Target-URI": "https://emediaworld.com/thread/what-is-the-difference-between-serializable-and",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:df575a78-b175-462b-bb0d-a822dbff3800>"
},
"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-208\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,
59,
60,
67,
68,
115,
116,
175,
176,
220,
221,
230,
231,
238,
239,
264,
265
],
"line_end_idx": [
59,
60,
67,
68,
115,
116,
175,
176,
220,
221,
230,
231,
238,
239,
264,
265,
663
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 663,
"ccnet_original_nlines": 16,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40833333134651184,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02500000037252903,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13333332538604736,
"rps_doc_frac_unique_words": 0.6261681914329529,
"rps_doc_mean_word_length": 4.981308460235596,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.033907890319824,
"rps_doc_word_count": 107,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.26266416907310486,
"rps_doc_frac_chars_dupe_6grams": 0.26266416907310486,
"rps_doc_frac_chars_dupe_7grams": 0.1876172572374344,
"rps_doc_frac_chars_dupe_8grams": 0.1876172572374344,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.022514069452881813,
"rps_doc_frac_chars_top_3gram": 0.03377110883593559,
"rps_doc_frac_chars_top_4gram": 0.07129456102848053,
"rps_doc_books_importance": -37.23411178588867,
"rps_doc_books_importance_length_correction": -45.05604934692383,
"rps_doc_openwebtext_importance": -28.879426956176758,
"rps_doc_openwebtext_importance_length_correction": -36.70136260986328,
"rps_doc_wikipedia_importance": -25.809337615966797,
"rps_doc_wikipedia_importance_length_correction": -33.63127517700195
},
"fasttext": {
"dclm": 0.8623558282852173,
"english": 0.949582576751709,
"fineweb_edu_approx": 2.7063920497894287,
"eai_general_math": 0.08233863115310669,
"eai_open_web_math": 0.2285873293876648,
"eai_web_code": 0.0000386200008506421
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-1,185,482,446,386,761,700 |
robust-apricot
robust-apricot3mo ago
useSelect pagination next page load trigger
When using useSelect with pagination, how do I change pages?
11 Replies
kapa.ai
kapa.ai3mo ago
Hi @Chrystian Ferreira. I'm kapa.ai, your friendly support bot. I will try to answer your question by searching through the knowledge base. :wave: ---------------------- Based on the extracts provided, there isn't specific information on how to directly change pages using the useSelect hook with pagination in refine. The extracts focus on the configuration changes for pagination in useSelect from version 3.x.x to 4.x.x, specifically mentioning the transition to enabling server-side pagination by setting the pagination.mode prop to "server" and replacing the sort prop with sorters. However, they do not detail methods or functions for navigating between pages. For detailed guidance on implementing pagination and navigating between pages with useSelect or any other refine hooks, I recommend consulting the official refine documentation or community resources for examples and best practices. The refine documentation is a comprehensive source that likely covers pagination handling in depth, including examples of how to implement page navigation. Here's a general approach based on refine's patterns for hooks that involve pagination, although it's important to note this is not directly extracted from the provided information:
// Hypothetical example based on refine patterns
const { data, pagination } = useSelect({
resource: "your-resource",
pagination: {
current: 1, // Current page
pageSize: 10, // Items per page
},
// Other configurations...
});
// Function to change page
const changePage = (newPage) => {
// Update the pagination state here
// This might involve setting a new state for 'current' and re-fetching data
};
// Hypothetical example based on refine patterns
const { data, pagination } = useSelect({
resource: "your-resource",
pagination: {
current: 1, // Current page
pageSize: 10, // Items per page
},
// Other configurations...
});
// Function to change page
const changePage = (newPage) => {
// Update the pagination state here
// This might involve setting a new state for 'current' and re-fetching data
};
For useSelect and pagination specifically, you would typically manage the current page state outside of the useSelect hook and then pass the updated state (e.g., the next page number) into the hook to fetch data for the next page. This might involve using React state hooks like useState to keep track of the current page and providing UI elements for the user to navigate between pages (e.g., next and previous buttons). Since the exact method for changing pages with useSelect wasn't detailed in the extracts, please refer to the refine documentation (https://refine.dev/docs/) for the most accurate and up-to-date information. ---------------------- Note: you can ask me a follow up question by @ mentioning me again :speech_balloon: ----------------------
kapa.ai
kapa.ai3mo ago
<@1072217596058939412> kapa.ai is still learning and improving, please let us know how it did by reacting below
robust-apricot
robust-apricot3mo ago
@kapa.ai Can you please provide implementation details for the 'changePage' function in your last answer?
kapa.ai
kapa.ai3mo ago
Let me check the knowledge base for you. One moment! :books: ---------------------- Hmm, I don't know enough to give you a confident answer yet. The extracts provided do not include specific details on implementing a changePage function using the useSelect hook in refine, nor do they offer direct examples of pagination logic or functions for navigating between pages. For accurate and detailed information on implementing pagination, including changing pages in refine applications, I recommend consulting the official refine documentation. The documentation is likely to provide comprehensive guides, examples, and API references that cover pagination and navigation between pages in depth, which would be essential for implementing a changePage function correctly. You can start exploring more about refine and its pagination capabilities here: refine documentation (https://refine.dev/docs/). ---------------------- Note: you can ask me a follow up question by @ mentioning me again :speech_balloon: ----------------------
kapa.ai
kapa.ai3mo ago
<@1072217596058939412> kapa.ai is still learning and improving, please let us know how it did by reacting below
robust-apricot
robust-apricot3mo ago
Is this even possible? @kapa.ai I have managed to develop a solution but I am struggling to make the loading state work. isLoading, that comes from queryResult, is true on initial load but then when I change pages it never changes from false to true. Is this a possible bug? Here is my current code:
const SelectStore = ({ onChange }: SelectStoreProps) => {
const [currentPage, setCurrentPage] = useState(1);
const [isLoading, setIsLoading] = useState(true);
const { selectProps: storeSelectProps, queryResult } = useSelect({
resource: LOCALE_STORE_RESOURCE,
optionLabel: "name",
pagination: {
current: currentPage,
pageSize: 5,
mode: "server",
},
});
const {
data: storeSelectData,
isRefetching,
isLoading: queryResultIsLoading,
} = queryResult;
console.log({ isRefetching, queryResultIsLoading }); // both always false
const goToNextPage = () => {
setIsLoading(true);
setCurrentPage(currentPage + 1);
};
const goToPreviousPage = () => {
setIsLoading(true);
setCurrentPage(currentPage - 1);
};
useEffect(() => {
setIsLoading(false);
}, [storeSelectProps.options]);
return (
<Select
{...storeSelectProps}
placeholder="Revendas"
onChange={onChange}
dropdownRender={(menu) => (
<Space direction="vertical">
{currentPage > 1 && (
<Button onClick={goToPreviousPage}>
Anterior
</Button>
)}
{isLoading ? (
<>
<Skeleton />
</>
) : (
<>{menu}</>
)}
{currentPage < storeSelectData?.pages && (
<Button onClick={goToNextPage}>
Próximo
</Button>
)}
{!isLoading && currentPage === storeSelectData?.pages && (
<p>Não há mais revendas.</p>
)}
</Space>
)}
/>
);
};
const SelectStore = ({ onChange }: SelectStoreProps) => {
const [currentPage, setCurrentPage] = useState(1);
const [isLoading, setIsLoading] = useState(true);
const { selectProps: storeSelectProps, queryResult } = useSelect({
resource: LOCALE_STORE_RESOURCE,
optionLabel: "name",
pagination: {
current: currentPage,
pageSize: 5,
mode: "server",
},
});
const {
data: storeSelectData,
isRefetching,
isLoading: queryResultIsLoading,
} = queryResult;
console.log({ isRefetching, queryResultIsLoading }); // both always false
const goToNextPage = () => {
setIsLoading(true);
setCurrentPage(currentPage + 1);
};
const goToPreviousPage = () => {
setIsLoading(true);
setCurrentPage(currentPage - 1);
};
useEffect(() => {
setIsLoading(false);
}, [storeSelectProps.options]);
return (
<Select
{...storeSelectProps}
placeholder="Revendas"
onChange={onChange}
dropdownRender={(menu) => (
<Space direction="vertical">
{currentPage > 1 && (
<Button onClick={goToPreviousPage}>
Anterior
</Button>
)}
{isLoading ? (
<>
<Skeleton />
</>
) : (
<>{menu}</>
)}
{currentPage < storeSelectData?.pages && (
<Button onClick={goToNextPage}>
Próximo
</Button>
)}
{!isLoading && currentPage === storeSelectData?.pages && (
<p>Não há mais revendas.</p>
)}
</Space>
)}
/>
);
};
kapa.ai
kapa.ai3mo ago
Let me check the knowledge base for you. One moment! :books: ---------------------- Based on the provided code and the information from the extracts, it seems like you're trying to manage the loading state manually with a separate useState hook (isLoading, setIsLoading). However, refine provides a loading state directly from the queryResult object (queryResultIsLoading in your code). The queryResultIsLoading should be true while the data is being fetched, including when you're changing pages. If it's not changing to true when changing pages, it might be a bug or an issue with the implementation. However, there's a known issue with refine where the loading state doesn't change to true during revalidation of the cache, as mentioned in the Github Issue (closed): [BUG] Caching does not work with useTable due to the returned loading attribute set to true during re-validation (https://github.com/refinedev/refine/issues/1321). This issue is specifically about useTable, but it might be related to your issue with useSelect. In the issue, it's suggested to rely on status or isSuccess instead of isFetching (which is also true while revalidating cache). However, in your case, you're using isLoading from queryResult, which should be equivalent to isFetching. If you're still facing the issue, I recommend creating a new issue in the refine Github repository (https://github.com/pankod/refine/issues) providing all the necessary details. The maintainers and the community can help you identify if it's a bug or an issue with the implementation. ---------------------- Note: you can ask me a follow up question by @ mentioning me again :speech_balloon: ----------------------
kapa.ai
kapa.ai3mo ago
<@1072217596058939412> kapa.ai is still learning and improving, please let us know how it did by reacting below
robust-apricot
robust-apricot3mo ago
BRUH. It was because this was in my useSelect:
queryOptions: {
cacheTime: 10000,
keepPreviousData: true,
},
queryOptions: {
cacheTime: 10000,
keepPreviousData: true,
},
This made isRefetching changing from false to true not possible for 10s after changing pages @kapa.ai How can I assert that the onSearch function was called using vitest?
kapa.ai
kapa.ai3mo ago
Let me check the knowledge base for you. One moment! :books: ---------------------- Based on the provided extracts, you can use the jest testing library to create a mock function and assert that it was called. Here's an example of how you might do this:
import { fireEvent, render } from "@testing-library/react";
import { TestComponent } from "./TestComponent"; // replace with your component
test("calls onSearch function when button is clicked", () => {
const onSearch = jest.fn();
const { getByText } = render(<TestComponent onSearch={onSearch} />);
fireEvent.click(getByText("Search")); // replace "Search" with the text on your button
expect(onSearch).toHaveBeenCalled();
});
import { fireEvent, render } from "@testing-library/react";
import { TestComponent } from "./TestComponent"; // replace with your component
test("calls onSearch function when button is clicked", () => {
const onSearch = jest.fn();
const { getByText } = render(<TestComponent onSearch={onSearch} />);
fireEvent.click(getByText("Search")); // replace "Search" with the text on your button
expect(onSearch).toHaveBeenCalled();
});
In this example, jest.fn() is used to create a mock function. This mock function is passed as a prop to the component being tested. After simulating a click event on the button, expect(onSearch).toHaveBeenCalled() is used to assert that the onSearch function was called. Please replace TestComponent and "Search" with your actual component and button text. This is a general example and might need to be adjusted based on your specific use case and testing setup. For more detailed information on testing in React, you can refer to the React Testing Library documentation (https://testing-library.com/docs/react-testing-library/intro/). Please note that the provided extracts do not contain specific information about vitest. The example above uses jest and @testing-library/react, which are commonly used for testing React components. If you're using vitest, you might need to adjust the example to fit with vitest's API and usage. For more information on using vitest, please refer to the vitest documentation (https://vitest.dev/). ---------------------- Note: you can ask me a follow up question by @ mentioning me again :speech_balloon: ----------------------
kapa.ai
kapa.ai3mo ago
<@1072217596058939412> kapa.ai is still learning and improving, please let us know how it did by reacting below
|
{
"url": "https://discord-questions.refine.dev/m/1212837648326991905",
"source_domain": "discord-questions.refine.dev",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "302837",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XMBPSH2TSBPIIQORSW2G63AO6ZYAK5BA",
"WARC-Concurrent-To": "<urn:uuid:54e55d51-d89b-4ec7-a73e-efa557367678>",
"WARC-Date": "2024-05-21T16:41:44Z",
"WARC-IP-Address": "76.76.21.123",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Z2NDVV5JAMGS7GFKFO5PV42W6UD2GVHD",
"WARC-Record-ID": "<urn:uuid:34603f0a-33f2-470e-963d-bb2952fb928a>",
"WARC-Target-URI": "https://discord-questions.refine.dev/m/1212837648326991905",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:532fee87-565e-4d6f-9608-610aab81fc37>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-184\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
15,
37,
38,
82,
83,
144,
155,
163,
178,
1416,
1465,
1506,
1533,
1547,
1575,
1607,
1610,
1637,
1641,
1642,
1669,
1703,
1739,
1816,
1819,
1868,
1909,
1936,
1950,
1978,
2010,
2013,
2040,
2044,
2045,
2072,
2106,
2142,
2219,
2222,
2982,
2990,
3005,
3117,
3132,
3154,
3260,
3268,
3283,
4311,
4319,
4334,
4446,
4461,
4483,
4783,
4841,
4892,
4942,
5009,
5042,
5063,
5077,
5099,
5112,
5128,
5131,
5135,
5143,
5166,
5180,
5213,
5230,
5304,
5333,
5353,
5386,
5389,
5422,
5442,
5475,
5478,
5479,
5497,
5518,
5550,
5551,
5560,
5568,
5590,
5613,
5633,
5661,
5690,
5712,
5748,
5757,
5767,
5770,
5785,
5788,
5801,
5805,
5811,
5823,
5826,
5869,
5901,
5909,
5919,
5922,
5981,
6010,
6013,
6022,
6025,
6028,
6031,
6034,
6092,
6143,
6193,
6260,
6293,
6314,
6328,
6350,
6363,
6379,
6382,
6386,
6394,
6417,
6431,
6464,
6481,
6555,
6584,
6604,
6637,
6640,
6673,
6693,
6726,
6729,
6730,
6748,
6769,
6801,
6802,
6811,
6819,
6841,
6864,
6884,
6912,
6941,
6963,
6999,
7008,
7018,
7021,
7036,
7039,
7052,
7056,
7062,
7074,
7077,
7120,
7152,
7160,
7170,
7173,
7232,
7261,
7264,
7273,
7276,
7279,
7282,
7285,
7293,
7308,
8989,
8997,
9012,
9124,
9139,
9161,
9208,
9224,
9242,
9266,
9269,
9285,
9303,
9327,
9330,
9501,
9509,
9524,
9778,
9838,
9918,
9919,
9982,
10010,
10011,
10080,
10081,
10168,
10169,
10206,
10210,
10270,
10350,
10351,
10414,
10442,
10443,
10512,
10513,
10600,
10601,
10638,
10642,
11807,
11815,
11830
],
"line_end_idx": [
15,
37,
38,
82,
83,
144,
155,
163,
178,
1416,
1465,
1506,
1533,
1547,
1575,
1607,
1610,
1637,
1641,
1642,
1669,
1703,
1739,
1816,
1819,
1868,
1909,
1936,
1950,
1978,
2010,
2013,
2040,
2044,
2045,
2072,
2106,
2142,
2219,
2222,
2982,
2990,
3005,
3117,
3132,
3154,
3260,
3268,
3283,
4311,
4319,
4334,
4446,
4461,
4483,
4783,
4841,
4892,
4942,
5009,
5042,
5063,
5077,
5099,
5112,
5128,
5131,
5135,
5143,
5166,
5180,
5213,
5230,
5304,
5333,
5353,
5386,
5389,
5422,
5442,
5475,
5478,
5479,
5497,
5518,
5550,
5551,
5560,
5568,
5590,
5613,
5633,
5661,
5690,
5712,
5748,
5757,
5767,
5770,
5785,
5788,
5801,
5805,
5811,
5823,
5826,
5869,
5901,
5909,
5919,
5922,
5981,
6010,
6013,
6022,
6025,
6028,
6031,
6034,
6092,
6143,
6193,
6260,
6293,
6314,
6328,
6350,
6363,
6379,
6382,
6386,
6394,
6417,
6431,
6464,
6481,
6555,
6584,
6604,
6637,
6640,
6673,
6693,
6726,
6729,
6730,
6748,
6769,
6801,
6802,
6811,
6819,
6841,
6864,
6884,
6912,
6941,
6963,
6999,
7008,
7018,
7021,
7036,
7039,
7052,
7056,
7062,
7074,
7077,
7120,
7152,
7160,
7170,
7173,
7232,
7261,
7264,
7273,
7276,
7279,
7282,
7285,
7293,
7308,
8989,
8997,
9012,
9124,
9139,
9161,
9208,
9224,
9242,
9266,
9269,
9285,
9303,
9327,
9330,
9501,
9509,
9524,
9778,
9838,
9918,
9919,
9982,
10010,
10011,
10080,
10081,
10168,
10169,
10206,
10210,
10270,
10350,
10351,
10414,
10442,
10443,
10512,
10513,
10600,
10601,
10638,
10642,
11807,
11815,
11830,
11941
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11941,
"ccnet_original_nlines": 230,
"rps_doc_curly_bracket": 0.010049410164356232,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2588486075401306,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007675909902900457,
"rps_doc_frac_lines_end_with_ellipsis": 0.008658009581267834,
"rps_doc_frac_no_alph_words": 0.31982943415641785,
"rps_doc_frac_unique_words": 0.2819986343383789,
"rps_doc_mean_word_length": 6.160848617553711,
"rps_doc_num_sentences": 119,
"rps_doc_symbol_to_word_ratio": 0.0017057600198313594,
"rps_doc_unigram_entropy": 5.473923206329346,
"rps_doc_word_count": 1461,
"rps_doc_frac_chars_dupe_10grams": 0.44017329812049866,
"rps_doc_frac_chars_dupe_5grams": 0.4908343553543091,
"rps_doc_frac_chars_dupe_6grams": 0.4759471118450165,
"rps_doc_frac_chars_dupe_7grams": 0.4759471118450165,
"rps_doc_frac_chars_dupe_8grams": 0.4477280378341675,
"rps_doc_frac_chars_dupe_9grams": 0.44017329812049866,
"rps_doc_frac_chars_top_2gram": 0.013331850059330463,
"rps_doc_frac_chars_top_3gram": 0.015998220071196556,
"rps_doc_frac_chars_top_4gram": 0.005777140147984028,
"rps_doc_books_importance": -874.7565307617188,
"rps_doc_books_importance_length_correction": -874.7565307617188,
"rps_doc_openwebtext_importance": -668.8416137695312,
"rps_doc_openwebtext_importance_length_correction": -668.8416137695312,
"rps_doc_wikipedia_importance": -581.1417846679688,
"rps_doc_wikipedia_importance_length_correction": -581.1417846679688
},
"fasttext": {
"dclm": 0.9810640215873718,
"english": 0.7372898459434509,
"fineweb_edu_approx": 2.276092529296875,
"eai_general_math": 0.7740113735198975,
"eai_open_web_math": 0.10597729682922363,
"eai_web_code": 0.9357782006263733
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
1,022,320,017,155,976,300 |
Short explanations how the algorithms work. Press 's' while cursor is on a node to define it as the source. 1. This e-Lecture mode is automatically shown to first time (or non logged-in) visitors to showcase the data structure and/or the algorithm being visualized. Considering some learners face difficulties in advanced topics, several AV tools cover complex algorithms and … ). Graphics & Visualization: Principles & Algorithms Chapter 12 11 • Photometry law (from (12.7) and solid angle definition): (12.8) • In Computer Graphics we are interested in the relationship between the incident light from a certain direction onto a surface and: The reflected light in another direction Draw Graphs and Visualize Algorithms (Python3) Built using the Pygame Library. Python is a great language for doing data analysis, primarily because of the fantastic ecosystem of data-centric Python packages. Though specifically designed for National University of Singapore (NUS) students taking various data structure and algorithm classes (e.g. 9. Description . Algorithm Visualizer is an interactive online platform that visualizes algorithms from code. The algorithm was published as a method of constructing an efficient electricity network. Learning an algorithm gets much easier with visualizing it. Visualization of algorithms has been shown to be a useful aid for educational purposes. This view promotes the creator to form a central plot and define abstract participating players. They commonly cover basic algorithms and data structures such as sequential data structures (e.g., array, stack, queue, and linked list) , and searching & sorting algorithms , , . 99. Algorithm Visualizer. The algorithm's visualization contains mostly white bars representing the value of the array position corresponding to the x-axis. Sollin’s Algorithm Sollin’s algorithm is also called Boruvka’s algorithm It is used to find MST. How to rewire edges in minimum spanning tree (R)? We have multiple repositories under the hood that comprise the website. There is a wide range of techniques and algorithms used to represent data in a visual way, often using Maths concepts (2D or 3D Coordinates, Trigonometry, Proportionality etc.) Get Started! An algorithm to see if there are exactly two MSTs in a graph? When the algorithm gets or sets an array item, the white bar runs red for one algorithmic step. This page shall provide the possibility pupils and students to understand and fully comprehend the algorithms (which are of importance also in daily life). Kruskal Minimum Cost Spanning Treeh. Animation is an arguably more sophisticated option, which, of course, is much more difficult to implement. Algorithm animation, on the other hand, shows a continuous, movie-like presentation of an algorithm’s operations. WINTER SEMESTER 2013/2014 Tamara Mchedlidze – MARTIN NOLLENBURG¨ www.kit.edu KIT – Universitat des Landes Baden-W¨ urttemberg und¨ nationales Forschungszentrum in der Helmholtz-Gemeinschaft. Check it out: algorithm-visualizer.org. In this article, I have used Pandas to analyze data on Country Data.csv file from UN public Data Sets of a popular ‘statweb.stanford.edu’ website. Pseudocode implementations with dynamically highlighted lines. And it's going to find the minimum spanning tree using two and four threads to see what impact we have with concurrency. In this chapter, the behavior of animals is explored to help create a method and an algorithm for data visualization suited for big data visualization. Prediction and Data Visualization of Breast Cancer using K-Nearest Neighbor (KNN)Classifier Algorithm. K Nearest Neighbor(KNN) algorithm is a very simple, easy to understand, vers a tile and one of the topmost machine learning algorithms. Keywords Data visualization Bio-inspired behavior This is a preview of subscription content, log in to check access. Algorithm. This A* Path Finding tutorial will show you how to implement the a* search algorithm using python. Designed for use in a variety of courses including Information Visualization, Human--Computer Interaction, Graph Algorithms, Computational Geometry, and Graph Drawing. Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization Michael Weylandt1, John Nagorski 1, and Genevera I. Allen 1,2,3,4 1Department of Statistics, Rice University 2Department of Computer Science, Rice University 3Department of Electrical and Computer Engineering, Rice University 4Jan and Dan Neurological Research Institute, Baylor … Cheriton-Tarjan algorithm for MST. Data visualisation algorithms are used in most software (or video games) which are based on a Graphical User Interface. A swap operation is represented by two bars turning red and their values being exchanged. pip install pygame. Algorithm visualization construction and presentation appear not only to focus students on relevant activities and concepts, but also to enable them to participate more extensively the course, thus contributing to their learning 8. By Daniel Moisset, (Machinalis.com). Contributing. References. They are used to provide a more intuitive, user-friendly visual representation of data. Faster second-best MST algorithm? Agbehadji, I. E., Millham, R., Fong, S. J., & Yang, H. (2018). The algorithms presented on the pages at hand are very basic examples for methods of discrete mathematics (the daily research conducted at the chair reaches far beyond that point). Press 'l' while cursor is on a node to initialize a node link. Don't get what we mean? Sollin’s algorithm 14. Static algorithm visualization shows an algorithm’s progress through a series of still images. Linear search or sequential search is a method for finding an element within a list. Algorithm Visualisation (AV) tools help learners to learn how algorithms and data structures work . 1. It is actually the oldest of the three algorithms (invented in 1926 by the Czech mathematician Otakar B˚ oruvka, well before the first digital computers! Are you a visual learner looking to better understand important algorithms? It was given by Boruvkas in 1926.at tthat time it was the first algorithm to find the MST. Boruvka’s Algorithm is a greedy algorithm and is similar to Kruskal’s algorithm and Prim’s algorithm… Update centroid Update each centroid to be the mean of the points in its group. CS1010, CS1020, CS2010, CS2020, CS3230, and CS3230), as advocators of online learning, we hope that curious minds around the world will find these … Hot Network Questions Is there a general solution to the problem of "sudden unexpected bursts of errors" in software? Pandas is one of those packages, and makes importing and analyzing data much easier. This book describes fundamental algorithmic techniques for constructing drawings of graphs. Algorithm Visualizations. This one is called Boruvka’s algorithm. Press 'd' while cursor is on a node to define it as the destination . I made AlgoVis for all the people who want to learn about algorithms, but don't feel like studying textbooks for hours just to understand them. Orthogonal drawing. Graph Traversal 'ADD' button adds a new node to the canvas. Algorithms for graph visualization Incremental algorithms. In this work we focus on the creation of algorithm visualizations based on viewing the visualization as a narrative. Difference between Prim's and Dijkstra's algorithms? Find closest centroid. The algorithm was developed in 1926 by Czech mathematician Otakar Borůvka, when he was trying to find an optimal routing for the electrical grid in Moravia. Data Clustered points . We have released an initial version of TheWalnut.io, a web application which allows creating and sharing algorithm visualizations.We are going beyond just making a gallery of nice algorithm visualizations, to building the place where people can learn, talk and communicate visually about their code. This tutorial explains how to perform Data Visualization, K-means Cluster Analysis, and Association Rule Mining using WEKA Explorer: In the Previous tutorial, we learned about WEKA Dataset, Classifier, and J48 Algorithm for Decision Tree.. As we have seen before, WEKA is an open-source data mining tool used by many researchers and students to perform many machine learning tasks. Let's run this algorithm on some roadway data that examines the distance between cities on all the roads in the northeast of America. Graphics & Visualization: Principles & Algorithms Chapter 2 2 • 2D display devices consist of discrete grid of pixels • Rasterization: converting 2D primitives into a discrete pixel representation • The complexity of rasterization is O(Pp), where P is the number of primitives and p is the number of pixels An object is classified by a plurality vote of its neighbours, with the object being assigned to the class most common among its k nearest neighbours (k is a positive integer, typically small). Process mining techniques provide data-driven visualizations that help gaining multi-perspective insights into business processes. Because the algorithm was later several times reinvented (among others by M. Sollin), the procedure is also sometimes called Sollin's algorithm. These pages shall provide pupils and students with the possibility to (better) understand and fully comprehend the algorithms, which are often of importance in daily life. 2) Boruvka’s algorithm is used as a step in a faster randomized algorithm that works in linear time O(E). Repeat until convergence: Find closest centroid Find the closest centroid to each point, and group points that share the same closest centroid. در این مطلب، «الگوریتم بروکا» (Boruvka’s Algorithm) مورد بررسی قرار گرفته و پیادهسازی آن در زبانهای برنامهنویسی C++/C و پایتون انجام شده است. Algorithm Visualization Python3. The Borůvka's algorithm is based on merging of disjoint components. Boruvka’s Algorithm: Given that we have seen two algorithms (Kruskal’s and Prim’s) for solving the MST problem, it may seem like complete overkill to consider yet another algorithm. Visualization through visual imagery has been an effective way to communicate both abstract and concrete ideas since the dawn of humanity. In k-NN classification, the output is a class membership. Your online algorithm visualization tool. Visualization or visualisation (see spelling differences) is any technique for creating images, diagrams, or animations to communicate a message. The algorithms presented on the pages at hand are very basic examples for methods of discrete mathematics (the research conducted daily at the chair reaches far beyond that point). Today, some of these advanced algorithms visualization/animation can only be found in VisuAlgo. Each visualization page has an 'e-Lecture Mode' that is accessible from that page's top right corner that explains the data structure and/or algorithm being visualized. 3) Boruvka’s algorithm is the oldest minimum spanning tree algorithm was discovered by Boruuvka in 1926, long before computers even existed.
Best Binoculars For Shed Hunting, Kc G34 Fog Lights, What Is The Job Of A Doctor, Ford F150 Cabin Air Filter, Sc Caste List In Mp, Ephesians 4:23 Nkjv, Fresno County Assessor-recorder's Office, Srikanth Deva Age, Patriot Lighting Replacement Glass, Cream Sauce For Lamb, Photography Degree Netherlands, Floating Wall Shelves,
|
{
"url": "http://airware-inc.com/ufi0n/boruvka%27s-algorithm-visualization-d43455",
"source_domain": "airware-inc.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "24228",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WSTPVYUCL3UCI7O6KYVIZA2SAY7KCAC4",
"WARC-Concurrent-To": "<urn:uuid:ea3146d2-d538-478b-a334-6c52045f7b4a>",
"WARC-Date": "2023-06-10T18:52:35Z",
"WARC-IP-Address": "64.29.145.73",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4Z3HUOFCGKZGNJX2UFG5U6Z5SGN5O7CN",
"WARC-Record-ID": "<urn:uuid:ac1d1d3c-7a31-497a-af77-62b538fae3ce>",
"WARC-Target-URI": "http://airware-inc.com/ufi0n/boruvka%27s-algorithm-visualization-d43455",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2e0ad350-4f2c-4d69-beeb-73945df0535d>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-37\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
10995,
10996
],
"line_end_idx": [
10995,
10996,
11321
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11321,
"ccnet_original_nlines": 2,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3248826265335083,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027699530124664307,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19530515372753143,
"rps_doc_frac_unique_words": 0.45320776104927063,
"rps_doc_mean_word_length": 5.4526190757751465,
"rps_doc_num_sentences": 126,
"rps_doc_symbol_to_word_ratio": 0.0018779300153255463,
"rps_doc_unigram_entropy": 5.9041056632995605,
"rps_doc_word_count": 1699,
"rps_doc_frac_chars_dupe_10grams": 0.02741795964539051,
"rps_doc_frac_chars_dupe_5grams": 0.061312608420848846,
"rps_doc_frac_chars_dupe_6grams": 0.04792746156454086,
"rps_doc_frac_chars_dupe_7grams": 0.04792746156454086,
"rps_doc_frac_chars_dupe_8grams": 0.045552678406238556,
"rps_doc_frac_chars_dupe_9grams": 0.02741795964539051,
"rps_doc_frac_chars_top_2gram": 0.0025906700175255537,
"rps_doc_frac_chars_top_3gram": 0.004209840204566717,
"rps_doc_frac_chars_top_4gram": 0.004857509862631559,
"rps_doc_books_importance": -841.604248046875,
"rps_doc_books_importance_length_correction": -841.604248046875,
"rps_doc_openwebtext_importance": -503.043701171875,
"rps_doc_openwebtext_importance_length_correction": -503.043701171875,
"rps_doc_wikipedia_importance": -418.259521484375,
"rps_doc_wikipedia_importance_length_correction": -418.259521484375
},
"fasttext": {
"dclm": 0.20757538080215454,
"english": 0.8863043189048767,
"fineweb_edu_approx": 2.8937008380889893,
"eai_general_math": 0.9335871338844299,
"eai_open_web_math": 0.4156760573387146,
"eai_web_code": 0.40070080757141113
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "006.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
6,263,233,319,104,440,000 |
Qu'est-ce qu'un fichier Desktop.ini?
Le fichier desktop.ini est un fichier caché utilisé pour stocker des informations de personnalisation d’un dossier de Windows. Essentiellement, si la mise en page ou paramètres d’un dossier sont modifiés, un fichier desktop.ini est automatiquement générée pour enregistrer ces modifications.
fichier Desktop.ini
Par exemple lorsque vous activez l’affichage des fichiers cachés sur votre système, l’un des fichiers que vous pouvez voir encore et encore est appelé Desktop.ini. Les informations de personnalisation contrôle la façon dont ce dossier est affiché par Windows.
Vous pouvez également voir un (ou plusieurs) fichiers Desktop.ini sur votre bureau. Ce ne sont pas différents de ceux que vous pouvez voir dans d’autres dossiers pendant votre navigation autour.
Supprimer le fichier Desktop.ini
Le fichier desktop.ini peut techniquement être supprimé de n’importe quel répertoire, bien que ce ne est pas conseillé. Il convient de noter que, le fichier enregistre les paramètres associés au dossier dans lequel il est contenu, la suppression restaure les réglages par défaut. Par exemple, si vous avez modifié l’ icône d’un dossier, puis supprimé le fichier desktop.ini, l’icône revient à ce qu’elle était avant.
Conseil: Pour supprimer un fichier desktop.ini, tout simplement un clic droit sur l’icône du fichier et sélectionnez Supprimer dans le menu déroulant . Vous pouvez également sélectionner le fichier desktop.ini et appuyez sur Suppr de votre clavier.
Si vous n’êtes pas sûr de ce que vous faites, il suffit de renommer le fichier Desktop.ini à autre chose (il suffit de changer l’extension du fichier, si vous voulez) et redémarrez Windows.
1 réflexion au sujet de « Qu'est-ce qu'un fichier Desktop.ini? »
1. bonjour je veux graver un CD-R avec express burn ,tout va bien jusqu’a la fin mais lorsque j’ouvre le CD-R pour ecouter les chansons il m’apparait DESKTOP.INI et mes chansons sont effacees…..je narrive pas a graver de CD-R …que dois-je faire pour eviter cela et graver des CD-R en toute securite…merci, cordialement
Répondre
Laisser un commentaire
|
{
"url": "https://megastuces.com/fichier-desktop-ini/",
"source_domain": "megastuces.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "35417",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UQ2X6565JUETMFURRS4QGVQPGVPCEX6Z",
"WARC-Concurrent-To": "<urn:uuid:f039559f-a918-4cd7-b1d2-b047c6ef7045>",
"WARC-Date": "2020-11-28T02:56:53Z",
"WARC-IP-Address": "146.88.235.140",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UNBQ4UUAYKDSVCI43O2PBESQRY5WTDXU",
"WARC-Record-ID": "<urn:uuid:2dafbabd-f79f-47fb-a2c5-2ffa82109c15>",
"WARC-Target-URI": "https://megastuces.com/fichier-desktop-ini/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6709888b-eb68-4b01-9af5-a02ba5b45b62>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-195.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
37,
38,
39,
331,
351,
611,
806,
807,
840,
841,
1258,
1509,
1699,
1700,
1765,
1766,
2087,
2088,
2101,
2102
],
"line_end_idx": [
37,
38,
39,
331,
351,
611,
806,
807,
840,
841,
1258,
1509,
1699,
1700,
1765,
1766,
2087,
2088,
2101,
2102,
2124
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2124,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09276018291711807,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022624429315328598,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19230769574642181,
"rps_doc_frac_unique_words": 0.5109034180641174,
"rps_doc_mean_word_length": 5.507788181304932,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.006787329912185669,
"rps_doc_unigram_entropy": 4.7333550453186035,
"rps_doc_word_count": 321,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.040723979473114014,
"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.10576923191547394,
"rps_doc_frac_chars_top_3gram": 0.06447964161634445,
"rps_doc_frac_chars_top_4gram": 0.031674209982156754,
"rps_doc_books_importance": -214.45228576660156,
"rps_doc_books_importance_length_correction": -214.45228576660156,
"rps_doc_openwebtext_importance": -132.13345336914062,
"rps_doc_openwebtext_importance_length_correction": -132.13345336914062,
"rps_doc_wikipedia_importance": -111.90470886230469,
"rps_doc_wikipedia_importance_length_correction": -111.90470886230469
},
"fasttext": {
"dclm": 0.9920871257781982,
"english": 0.0006170399719849229,
"fineweb_edu_approx": 1.3485136032104492,
"eai_general_math": 0.0007019600016064942,
"eai_open_web_math": 0.35169553756713867,
"eai_web_code": 0.36376863718032837
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.432",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-2,262,567,000,101,948,700 |
Some Tips About Desktop Personal computers That Anyone Can Adhere to
by laynegreenfield
Modern technology these days is exploding with growth, and another location which includes gained significantly is desktop computer computers. With the coming of the net came a boon in desktop computer revenue, but there is far more to learn about them aside from simply using it to visit on the web. These article has lots of superb advice on things personal computer computers.
Look at the disk burning up functionality of any personal computer personal computers that you are looking at. Think about regardless of whether you plan to just view mass media or make your own CDs and DVDs. If you are considering doing the latter, be sure certain the pc that you might want supports it. Not all desktop computers include these capabilities.
Check a computer’s add-ons before you purchase it. Some pcs have extra add-ons accessible to purchase. You should only get add-ons you will use. Also, be mindful as many accessories are less costly on other web sites. The people purchased in manufacturers specifically normally have a higher cost.
Be extremely careful to evaluate the types of software program in any new personal computer you get, except when you need to be continuously changing it or replacing the platform fully. Many discounted prices can be experienced on desktop computers which contain nearly obsolete software program, which may complicate use later on. Make sure what you get will be appropriate online and for other reasons.
Prior to buying a whole new desktop computer, create a list of all of the things you would like to use your pc for. Do you have a little one who must do schoolwork or would you love to play online games online? You will need to purchase a design which not has only the best software set up for your requirements, but is likewise quickly enough to run the programs you love making use of.
Speak to friends and relations about seeking a computer. A number of of them may have been planning to invest in a new personal computer, so when you inform them, they already have a reason to do so. Ingest outdated computer systems, which generally work nicely. Many people have personal computers resting about, so determine whether all your family members have a pc they are likely to present you with.
Buying a computer usually provides the issue that varieties of add-ons or accessories are needed and that happen to be not. Make sure to understand which products are offered with the pc alone so that you will not end up throwing away money on redundant devices which a knowledgeable salesperson persuaded you was crucial to have.
If you’re preparation to apply your desktop computer as being an enjoyment product, don’t forget about the speaker good quality. A check with little speaker systems may offer you a bad, tinny music experience. You might be more well off with acquiring some additional loudspeakers rather than relying on the loudspeakers with your keep track of.
To ensure that you buy a desktop computer that may previous, check out online reviews before buying. There are many trustworthy websites that supply the two skilled and testimonials of the very well-liked desktop computers. These reviews provides you with an idea of which desktops are reliable and difficulty totally free.
Should you be concentrating on durability from the pc acquire, don’t accept the minimal specifications presented. These specifications can be okay now, but each year, you may well be in for an distressing shock. Your laptop or computer could become out of date rather quickly when you aren’t mindful. If funds is an issue, a good tiny hit to the memory could be a big aid.
Learn what type of give you support get with all the desktop computer you wish to purchase. You have to know this if you happen to come across a challenge along with your purchase. Find what their hrs are and what days and nights they are closed. You also have to know if they are readily available by telephone, e-mail, chitchat, and so on.
Would you like to possibly want to upgrade your pc? If so, then think about this as you may create your obtain. Which means that the tower must be spacious adequate allowing for extra components. Additionally, it signifies the existing components have in order to handle far more Memory, a more effective processor chip, etc.
Could you return the computer when it doesn’t exercise for you? Or else, you can find much better areas being making your purchase. Be sure you totally know the return insurance policies of your place you might be getting from so that you don’t end up with a device that is certainly of no use to you.
In case you have shopped about online and in retailers for your personal ideal pc and possess not found it, consider getting a custom made construct. Nearby impartial retailers and particular on-line companies are experts in making specific computer methods. The costs of these systems are related, and even occasionally less than overpaying for which you don’t want to get what you do.
Think about getting a refurbished computer. Refurbished computers can preform along with new computer systems. They could also help save you quite a bit of dollars. If you decide to buy a refurbished computer, ensure you are getting it coming from a reputable vendor. Ensure it possesses a refund policy just in case it isn’t from the guaranteed problem.
Because a desktop computer is fixed, it has a long term source of energy. This really is a wonderful edge over a laptop which runs using power supply, unless of course it is connected. Desktop computer computer systems can also have large, easy to read watches and ergonomically made keyboards which makes entering less difficult and quicker.
4 weeks ago
Look at storage once you buy a computer. There are several things to consider and odds for updating. A couple of items to thinks about are what programs you manage and how many of them run concurrently. An effective guideline is to figure out the volume of Memory your pc has and double the needs for that software that is used most.
As you have seen after reading these article, there is a lot more to desktop pcs than using it to surfing the internet. With the actually-shifting technology, desktop computer pcs are changing day time-by-working day. Should you have any questions with regards to where by and how to use bitcoin casino, you possibly can contact us in our website. Luckily you came across a fantastic post that has simple desktop computer systems in way which make it easy to understand.
|
{
"url": "https://www.paris-billets.com/author/laynegreenfield",
"source_domain": "www.paris-billets.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "41047",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z6FMDDQOAQJQKKIKXBPEQGNMM2EFI3AG",
"WARC-Concurrent-To": "<urn:uuid:a781e0e1-4ce5-49a2-9eed-b087513bc8c7>",
"WARC-Date": "2022-06-26T05:55:18Z",
"WARC-IP-Address": "94.23.216.42",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6JK4F4X4RN7L5SKMQKPZRGX5M3CZKYE2",
"WARC-Record-ID": "<urn:uuid:7383c2d2-66fb-4506-9ad4-6577a8539b71>",
"WARC-Target-URI": "https://www.paris-billets.com/author/laynegreenfield",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:76469b20-1202-44ff-a80f-262083f64e93>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-203\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
69,
70,
89,
90,
470,
471,
831,
832,
1130,
1131,
1536,
1537,
1925,
1926,
2332,
2333,
2664,
2665,
3011,
3012,
3336,
3337,
3710,
3711,
4053,
4054,
4380,
4381,
4683,
4684,
5071,
5072,
5427,
5428,
5771,
5772,
5784,
5785,
6119,
6120
],
"line_end_idx": [
69,
70,
89,
90,
470,
471,
831,
832,
1130,
1131,
1536,
1537,
1925,
1926,
2332,
2333,
2664,
2665,
3011,
3012,
3336,
3337,
3710,
3711,
4053,
4054,
4380,
4381,
4683,
4684,
5071,
5072,
5427,
5428,
5771,
5772,
5784,
5785,
6119,
6120,
6590
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6590,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5055379867553711,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0023734199348837137,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.09493671357631683,
"rps_doc_frac_unique_words": 0.40674954652786255,
"rps_doc_mean_word_length": 4.738010883331299,
"rps_doc_num_sentences": 64,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.423935890197754,
"rps_doc_word_count": 1126,
"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.02811620943248272,
"rps_doc_frac_chars_top_3gram": 0.007872539572417736,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -601.7694091796875,
"rps_doc_books_importance_length_correction": -601.7694091796875,
"rps_doc_openwebtext_importance": -356.3667907714844,
"rps_doc_openwebtext_importance_length_correction": -356.3667907714844,
"rps_doc_wikipedia_importance": -253.12933349609375,
"rps_doc_wikipedia_importance_length_correction": -253.12933349609375
},
"fasttext": {
"dclm": 0.06461954116821289,
"english": 0.9650921821594238,
"fineweb_edu_approx": 2.1508538722991943,
"eai_general_math": 0.1528092622756958,
"eai_open_web_math": 0.0811617374420166,
"eai_web_code": 0.033390581607818604
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.15",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-5,795,223,592,363,521,000 |
LCM the 6 and 10 is the the smallest number amongst all common multiples the 6 and 10. The first few multiples of 6 and 10 are (6, 12, 18, 24, 30, 36, 42, . . . ) and (10, 20, 30, 40, . . . ) respectively. There are 3 generally used techniques to discover LCM that 6 and 10 - through listing multiples, by element factorization, and by division method.
You are watching: What is the lcm of 6 and 10
1.LCM that 6 and also 10
2.List of Methods
3.Solved Examples
4.FAQs
Answer: LCM the 6 and 10 is 30.
*
Explanation:
The LCM of two non-zero integers, x(6) and also y(10), is the smallest confident integer m(30) that is divisible by both x(6) and also y(10) without any type of remainder.
The approaches to uncover the LCM the 6 and 10 are described below.
By division MethodBy Listing MultiplesBy element Factorization Method
LCM of 6 and also 10 by department Method
To calculate the LCM that 6 and also 10 by the department method, we will divide the numbers(6, 10) by their prime components (preferably common). The product of these divisors offers the LCM that 6 and also 10.
Step 3: continue the measures until only 1s room left in the last row.
The LCM the 6 and 10 is the product of every prime numbers on the left, i.e. LCM(6, 10) by division method = 2 × 3 × 5 = 30.
LCM that 6 and also 10 by Listing Multiples
*
To calculate the LCM the 6 and also 10 by listing out the typical multiples, we have the right to follow the given below steps:
Step 1: list a few multiples the 6 (6, 12, 18, 24, 30, 36, 42, . . . ) and also 10 (10, 20, 30, 40, . . . . )Step 2: The common multiples native the multiples of 6 and also 10 space 30, 60, . . .Step 3: The smallest common multiple the 6 and also 10 is 30.
∴ The least common multiple the 6 and 10 = 30.
See more: What Does 1 Ct Tw Mean ? What Is Cttw For Diamonds
LCM of 6 and also 10 by element Factorization
Prime factorization of 6 and also 10 is (2 × 3) = 21 × 31 and (2 × 5) = 21 × 51 respectively. LCM the 6 and 10 have the right to be derived by multiplying prime determinants raised to their respective highest possible power, i.e. 21 × 31 × 51 = 30.Hence, the LCM the 6 and 10 by prime factorization is 30.
|
{
"url": "https://ptcouncil.net/what-is-the-lcm-of-6-and-10/",
"source_domain": "ptcouncil.net",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "11166",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MKPWE7LWNFD4MPRRRJUVR3SMV4YSU6C7",
"WARC-Concurrent-To": "<urn:uuid:868de0cf-cd43-47f6-9daf-b897715715a9>",
"WARC-Date": "2021-12-04T23:30:45Z",
"WARC-IP-Address": "172.67.219.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:36N2OGRCFURMWW5WQJNV3LCVUE2LVHIT",
"WARC-Record-ID": "<urn:uuid:1d93c4bc-be2b-4fc4-b781-9940272d5563>",
"WARC-Target-URI": "https://ptcouncil.net/what-is-the-lcm-of-6-and-10/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:13a20bcd-9f8b-4a86-8b33-27a9cf9d4b29>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-203\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
353,
354,
400,
401,
426,
444,
462,
469,
470,
502,
503,
505,
506,
519,
520,
692,
693,
694,
762,
763,
833,
834,
876,
877,
1089,
1090,
1161,
1162,
1287,
1288,
1332,
1333,
1335,
1336,
1464,
1465,
1722,
1723,
1770,
1771,
1832,
1833,
1879,
1880
],
"line_end_idx": [
353,
354,
400,
401,
426,
444,
462,
469,
470,
502,
503,
505,
506,
519,
520,
692,
693,
694,
762,
763,
833,
834,
876,
877,
1089,
1090,
1161,
1162,
1287,
1288,
1332,
1333,
1335,
1336,
1464,
1465,
1722,
1723,
1770,
1771,
1832,
1833,
1879,
1880,
2185
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2185,
"ccnet_original_nlines": 44,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3060109317302704,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02914389967918396,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4298725128173828,
"rps_doc_frac_unique_words": 0.34541061520576477,
"rps_doc_mean_word_length": 3.867149829864502,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.225936412811279,
"rps_doc_word_count": 414,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.21549032628536224,
"rps_doc_frac_chars_dupe_6grams": 0.14615865051746368,
"rps_doc_frac_chars_dupe_7grams": 0.10056214779615402,
"rps_doc_frac_chars_dupe_8grams": 0.01998751051723957,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05246720835566521,
"rps_doc_frac_chars_top_3gram": 0.04122423008084297,
"rps_doc_frac_chars_top_4gram": 0.06246095895767212,
"rps_doc_books_importance": -292.811279296875,
"rps_doc_books_importance_length_correction": -292.811279296875,
"rps_doc_openwebtext_importance": -153.57870483398438,
"rps_doc_openwebtext_importance_length_correction": -153.57870483398438,
"rps_doc_wikipedia_importance": -66.54525756835938,
"rps_doc_wikipedia_importance_length_correction": -66.54525756835938
},
"fasttext": {
"dclm": 0.2426777482032776,
"english": 0.9439270496368408,
"fineweb_edu_approx": 1.604286551475525,
"eai_general_math": 0.9851415753364563,
"eai_open_web_math": 0.6109132170677185,
"eai_web_code": 0.08354204893112183
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "512.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
6,063,921,769,302,422,000 |
Trigger once but for each instance?
This forum is currently in read-only mode.
• Hello. I'm working on a game where the characters rely on state machines to change their actions and animations. I have a character change to his jump animation and set the frame number to 4, then resume the animation. Once while true. Another character who uses the same objects but different variables controls differently and works out just fine. The only thing is, when they both try to jump, only one of the instances changes to the jump animation and resumes. The other changes to the animation but is stuck on the frame is is set to and remains that way until the other one lands. Is there any way to set an action to run once but for each object instance?
• Hello StreakThundrstrm. I'm not quite sure I understand you problem. Sorry. :(
I think you should post a .cap, maybe that could help us understand your problem a little better? :)
• --character-is in air(or whatever your condition is that supposed to trigger once while true)
----Is Private Variable ('DoneOnce') equals 0
--------Set Animation "jump"
--------Set Animation Frame to 4
--------Resume Animation
--------Set Private Variable ('DoneOnce') to 1
--[Inverted]character-is in air(or whatever....)
----Set Private Variable ('DoneOnce') to 0
• Try Construct 3
Develop games in your browser. Powerful, performant & highly capable.
Try Now Construct 3 users don't see these ads
• I understand how that would work, thanks. Is there any way to make it a bit more global? The characters have tons of animations and actions. Right now I have a way of choosing each character seperately and it works globally rather than locally except for these animation changes. I'll try something else and see what I can come up with. Thank you for your help. I'll post a reply if I find anything or need more help.
Jump to:
Active Users
There are 1 visitors browsing this topic (0 users and 1 guests)
|
{
"url": "https://www.construct.net/en/forum/construct-classic/help-support-using-construct-38/trigger-once-instance-43748",
"source_domain": "www.construct.net",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "74707",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2MHVA3OEJWKQXLOQI2U223WPV2USXC66",
"WARC-Concurrent-To": "<urn:uuid:be269011-7d43-42b3-969b-baf136f3a120>",
"WARC-Date": "2020-10-24T06:28:52Z",
"WARC-IP-Address": "104.22.2.122",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AOY3YGIMWR3PXMLZ2RWHZCGK7BOVTBRA",
"WARC-Record-ID": "<urn:uuid:f8c5790d-5e72-4453-a623-2bcb58da7684>",
"WARC-Target-URI": "https://www.construct.net/en/forum/construct-classic/help-support-using-construct-38/trigger-once-instance-43748",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:78adf04e-6534-4903-a290-3b8e2b4948ba>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-124.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
36,
37,
80,
748,
749,
835,
836,
941,
942,
1040,
1041,
1091,
1092,
1125,
1126,
1163,
1164,
1193,
1194,
1245,
1246,
1299,
1300,
1347,
1348,
1368,
1369,
1443,
1444,
1494,
1916,
1917,
1926,
1939
],
"line_end_idx": [
36,
37,
80,
748,
749,
835,
836,
941,
942,
1040,
1041,
1091,
1092,
1125,
1126,
1163,
1164,
1193,
1194,
1245,
1246,
1299,
1300,
1347,
1348,
1368,
1369,
1443,
1444,
1494,
1916,
1917,
1926,
1939,
2002
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2002,
"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.4236453175544739,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02709360048174858,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19704432785511017,
"rps_doc_frac_unique_words": 0.5090909004211426,
"rps_doc_mean_word_length": 4.509090900421143,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0.00246304995380342,
"rps_doc_unigram_entropy": 4.812537670135498,
"rps_doc_word_count": 330,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.057795699685811996,
"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.030241940170526505,
"rps_doc_frac_chars_top_3gram": 0.0463709682226181,
"rps_doc_frac_chars_top_4gram": 0.018817199394106865,
"rps_doc_books_importance": -230.4712677001953,
"rps_doc_books_importance_length_correction": -230.4712677001953,
"rps_doc_openwebtext_importance": -125.18529510498047,
"rps_doc_openwebtext_importance_length_correction": -125.18529510498047,
"rps_doc_wikipedia_importance": -99.532470703125,
"rps_doc_wikipedia_importance_length_correction": -99.532470703125
},
"fasttext": {
"dclm": 0.15694928169250488,
"english": 0.9299866557121277,
"fineweb_edu_approx": 1.6165026426315308,
"eai_general_math": 0.7240146398544312,
"eai_open_web_math": 0.4236621856689453,
"eai_web_code": 0.5329006314277649
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
2,713,322,152,078,654,000 |
Как стать автором
Обновить
Генерация случайных чисел в .NET
.NET *C# *
Из песочницы
Перевод статьи Random numbers широко известного в узких кругах Джона Скита. Остановился на этой статье, так как в своё время сам столкнулся с описываемой в ней проблемой.
Просматривая темы по .NET и C# на сайте StackOverflow, можно увидеть бесчисленное множество вопросов с упоминанием слова «random», в которых, по сути, поднимается один и тот же извечный и «неубиваемый» вопрос: почему генератор случайных чисел System.Random «не работает» и как это «исправить». Данная статья посвящена рассмотрению данной проблемы и способов её решения.
Постановка проблемы
На StackOverflow, в новостных группах и рассылках все вопросы по теме «random» звучат примерно так:
Я использую Random.Next для генерации нескольких случайных чисел, но метод возвращает одно и то же число при его множественных вызовах. Число меняется при каждом запуске приложения, однако в рамках одного выполнения программы оно постоянное.
В качестве примера кода приводится примерно следующее:
// Плохой код! Не использовать!
for (int i = 0; i < 100; i++)
{
Console.WriteLine(GenerateDigit());
}
...
static int GenerateDigit()
{
Random rng = new Random();
// Предположим, что здесь много логики
return rng.Next(10);
}
Итак, что здесь неправильно?
Объяснение
Класс Random не является истинным генератором случайных чисел, он содержит генератор псевдослучайных чисел. Каждый экземпляр класса Random содержит некоторое внутреннее состояние, и при вызове метода Next (или NextDouble, или NextBytes) метод использует это состояние для возврата числа, которое будет казаться случайным. После этого внутреннее состояние меняется таким образом, чтобы при следующем вызове метода Next он возвратил другое кажущееся-случайным число, отличное от возвращённого ранее.
Все «внутренности» работы класса Random полностью детерминистичны. Это значит, что если вы возьмёте несколько экземпляров класса Random с одинаковым начальным состоянием, которое задаётся через параметр конструктора seed, и для каждого экземпляра вызовите определённые методы в одинаковом порядке и с одинаковыми параметрами, то в конце вы получите одинаковые результаты.
Так что ж плохого в вышеприведённом коде? Плохо то, что мы используем новый экземпляр класса Random внутри каждой итерации цикла. Конструктор Random, не принимающий параметров, принимает значение текущей даты и времени как seed (начальное состояние). Итерации в цикле «прокрутятся» настолько быстро, что системное время «не успеет измениться» по их окончании; таким образом, все экземпляры Random получат в качестве начального состояния одинаковое значение и поэтому возвратят одинаковое псевдослучайное число.
Как это исправить?
Есть немало решений проблемы, каждое со своими плюсами и минусами. Мы рассмотрим несколько из них.
Использование криптографического генератора случайных чисел
.NET содержит абстрактный класс RandomNumberGenerator, от которого должны наследоваться все реализации криптографических генераторов случайных чисел (далее — криптоГСЧ). Одну из таких реализаций содержит и .NET — встречайте класс RNGCryptoServiceProvider. Идея криптоГСЧ в том, что даже если он всё так же является генератором псевдослучайных чисел, он обеспечивает достаточно сильную непредсказуемость результатов. RNGCryptoServiceProvider использует несколько источников энтропии, которые фактически являются «шумами» в вашем компьютере, и генерируемую им последовательность чисел очень тяжело предсказать. Более того, «внутрикомпьютерный» шум может использоваться не только в качестве начального состояния, но и между вызовами следующих случайных чисел; таким образом, даже зная текущее состояние класса, этого не хватит для вычисления как следующих чисел, которые будут сгенерированы в будущем, так и тех, которые были сгенерированы ранее. Вообще-то точное поведение зависит от реализации. Помимо этого, Windows может использовать специализированное аппаратное обеспечение, являющееся источником «истинных случайностей» (например, это может быть датчик распада радиоактивного изотопа) для генерации ещё более защищённых и надёжных случайных чисел.
Сравним это с ранее рассматриваемым классом Random. Предположим, вы вызвали Random.Next(100) десять раз и сохранили результаты. Если вы имеете достаточно вычислительной мощи, то можете сугубо на основании этих результатов вычислить начальное состояние (seed), с которым был создан экземпляр Random, предсказать следующие результаты вызова Random.Next(100) и даже вычислить результаты предыдущих вызовов метода. Такое поведение катастрофически неприемлемо, если вы используете случайные числа для обеспечения безопасности, в финансовых целях и т.д. КриптоГСЧ работают существенно медленнее класса Random, но генерируют последовательность чисел, каждое из которых более независимо и непредсказуемо от значений остальных.
В большинстве случаев более низкая производительность не является препятствием — им является плохой API. RandomNumberGenerator создан для генерации последовательностей байтов — и всё. Сравните это с методами класса Random, где есть возможность получения случайного целого числа, дробного числа, а также набора байтов. Ещё одно полезное свойство — возможность получения случайного числа в указанном диапазоне. Сравните эти возможности с массивом случайных байтов, который выдаёт RandomNumberGenerator. Исправить ситуацию можно, создав свою оболочку (враппер) вокруг RandomNumberGenerator, которая будет преобразовывать случайные байты в «удобный» результат, однако это решение нетривиально.
Тем не менее, в большинстве случаев «слабость» класса Random вполне подходит, если вы сможете решить проблему, описанную в начале статьи. Посмотрим, что здесь можно сделать.
Используйте один экземпляр класса Random при множественных вызовах
Вот он, корень решения проблемы — использовать лишь один экземпляр Random при создании множества случайных чисел посредством Random.Next. И это очень просто — посмотрите, как можно изменить вышеприведённый код:
// Этот код будет получше
Random rng = new Random();
for (int i = 0; i < 100; i++)
{
Console.WriteLine(GenerateDigit(rng));
}
...
static int GenerateDigit(Random rng)
{
// Предположим, что здесь много логики
return rng.Next(10);
}
Теперь в каждой итерации будут разные числа, … но это ещё не всё. Что будет, если мы вызовем этот блок кода два раза подряд? Правильно, мы создадим два экземпляра Random с одинаковым начальным значением и получим два одинаковых набора случайных чисел. В каждом наборе числа будут различаться, однако между собой эти наборы будут равны.
Есть два способа решения проблемы. Во-первых, мы можем использовать не экземплярное, а статическое поле, содержащее экземпляр Random, и тогда вышеприведённый кусок кода создаст лишь один экземпляр, и будет его использовать, вызываясь сколько угодно раз. Во-вторых, мы можем вообще убрать оттуда создание экземпляра Random, переместив его «повыше», в идеале — на самый «верх» программы, где будет создан единичный экземпляр Random, после чего он будет передаваться во все места, где нужны случайные числа. Это отличная идея, которая красиво выражается зависимостями, но она будет работать до тех пор, пока мы используем лишь один поток.
Потокобезопасность
Класс Random не потокобезопасен. Учитывая то, как мы любим создавать один экземпляр и использовать его по всей программе на протяжении всего времени её выполнения (синглтон, привет!), отсутствие потокобезопасности становится реальной занозой. Ведь если мы используем один экземпляр одновременно в нескольких потоках, то есть вероятность обнуления его внутреннего состояния, и если это произойдёт, то с этого момента экземпляр станет бесполезным.
Снова-таки, здесь есть два пути решения проблемы. Первый путь по-прежнему предполагает использование одного экземпляра, однако на этот раз с использованием блокировки ресурса посредством монитора. Для этого необходимо создать оболочку вокруг Random, которая будет оборачивать вызов его методов в оператор lock, обеспечивающий эксклюзивный доступ к экземпляру для вызывающей стороны. Этот путь плох тем, что снижает производительность в многопоточно-интенсивных сценариях.
Другой путь, который я опишу ниже — использование по одному экземпляру на каждый поток. Единственное, нам нужно удостовериться, что при создании экземпляров мы используем разные начальные значения (seed), а потому мы не можем использовать конструкторы по умолчанию. Во всём остальном этот путь относительно прямолинеен.
Безопасный провайдер
К счастью, новый обобщённый класс ThreadLocal<T>, появившийся в .NET 4, очень сильно облегчает написание провайдеров, обеспечивающих по одному экземпляру на поток. Просто нужно в конструктор ThreadLocal передать делегат, который будет ссылаться на получение значения собственно нашего экземпляра. В данном случае я решил использовать единственное начальное значение (seed), инициализируя его при помощи Environment.TickCount (именно так действует конструктор Random без параметров). Далее полученное количество тиков инкрементируется каждый раз, когда нам нужно получить новый экземпляр Random для отдельного потока.
Нижепредставленный класс полностью статический и содержит лишь один публичный (открытый) метод GetThreadRandom. Этот метод сделан методом, а не свойством, в основном из-за удобства: благодаря этому все классы, которым нужен экземпляр Random, будут зависеть от Func<Random> (делегат, указывающий на метод, не принимающий параметров и возвращающий значение типа Random), а не от самого класса Random. Если тип предназначен для работы в одном потоке, он может вызвать делегат для получения единого экземпляра Random и после чего использовать его повсюду; если же тип должен работать в многопоточных сценариях, он может вызывать делегат каждый раз, когда ему требуется генератор случайных чисел. Нижеприведенный класс создаст столько экземпляров класса Random, сколько есть потоков, и каждый экземпляр будет стартовать с различного начального значения. Если нам нужно использовать провайдер случайных чисел как зависимость в других типах, мы можем сделать так: new TypeThatNeedsRandom(RandomProvider.GetThreadRandom). Ну а вот и сам код:
using System;
using System.Threading;
public static class RandomProvider
{
private static int seed = Environment.TickCount;
private static ThreadLocal<Random> randomWrapper = new ThreadLocal<Random>(() =>
new Random(Interlocked.Increment(ref seed))
);
public static Random GetThreadRandom()
{
return randomWrapper.Value;
}
}
Достаточно просто, не правда ли? Всё потому, что весь код направлен на выдачу правильного экземпляра Random. После того, как экземпляр создан и возвращён, совершенно неважно, что вы будете с ним делать дальше: все дальнейшие выдачи экземпляров совершенно не зависят от текущего. Конечно, клиентский код имеет лазейку для злонамеренного неправильного использования: он может получить один экземпляр Random и передать его в другие потоки вместо вызова в тех, других потоках, нашего RandomProvider.
Проблемы с дизайном интерфейса
Одна проблема всё равно остаётся: мы используем слабо защищённый генератор случайных чисел. Как упоминается ранее, существует намного более безопасная во всех отношениях версия ГСЧ в RandomNumberGenerator, реализация которого находится в классе RNGCryptoServiceProvider. Однако его API достаточно сложно использовать в стандартных сценариях.
Было бы очень приятно, если бы провайдеры ГСЧ в фреймворке имели отдельные «источники случайности». В таком случае мы могли бы иметь единый простой и удобный API, который бы поддерживался как небезопасной-но-быстрой реализацией, так и безопасной-но-медленной. Что-ж, мечтать не вредно. Возможно, подобный функционал появится в следующих версиях .NET Framework. Возможно, кто-то не из Microsoft предложит свою реализацию адаптера. (К сожалению, я не буду этим кем-то… правильная реализация подобной задумки удивительно сложна.) Вы также можете создать свой класс, отнаследовав его от Random и переопределив методы Sample и NextBytes, однако неясно, как именно они должны работать, и даже собственная реализация Sample может быть намного сложнее, нежели кажется. Может быть, в следующий раз…
Теги:
Хабы:
Всего голосов 43: ↑37 и ↓6 +31
Просмотры 116K
Комментарии Комментарии 23
|
{
"url": "https://habr.com/ru/post/165459/",
"source_domain": "habr.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "97164",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RNX4HUFTDJGPR23WLCA7NIMRSRUY7WWR",
"WARC-Concurrent-To": "<urn:uuid:b9c2f5dd-e03d-4a71-a35b-b9b77426e024>",
"WARC-Date": "2021-12-08T19:37:02Z",
"WARC-IP-Address": "178.248.237.68",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5EHPPJAIEKLKDP5Q2NKIR3NEI6PKIBZ7",
"WARC-Record-ID": "<urn:uuid:81358d9e-bcf5-4082-a2ea-2ca6fea39fd9>",
"WARC-Target-URI": "https://habr.com/ru/post/165459/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d86c7d1d-4c41-404c-b216-2738ba4a2d8f>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-102\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
18,
27,
28,
61,
62,
73,
86,
257,
258,
259,
629,
630,
650,
651,
652,
752,
994,
995,
1050,
1082,
1112,
1114,
1155,
1157,
1162,
1189,
1191,
1223,
1267,
1293,
1295,
1296,
1325,
1326,
1337,
1338,
1339,
1837,
1838,
2210,
2211,
2722,
2723,
2742,
2743,
2744,
2843,
2844,
2904,
2905,
4157,
4158,
4877,
4878,
5568,
5569,
5743,
5744,
5811,
5812,
6023,
6049,
6077,
6107,
6110,
6154,
6157,
6162,
6199,
6202,
6246,
6272,
6275,
6276,
6612,
6613,
7249,
7250,
7269,
7270,
7271,
7717,
7718,
8190,
8191,
8511,
8512,
8533,
8534,
8535,
9152,
9153,
10187,
10201,
10225,
10228,
10263,
10269,
10323,
10329,
10415,
10468,
10476,
10477,
10521,
10528,
10565,
10572,
10574,
10575,
11071,
11072,
11103,
11104,
11105,
11447,
11448,
12238,
12244,
12250,
12281,
12296
],
"line_end_idx": [
18,
27,
28,
61,
62,
73,
86,
257,
258,
259,
629,
630,
650,
651,
652,
752,
994,
995,
1050,
1082,
1112,
1114,
1155,
1157,
1162,
1189,
1191,
1223,
1267,
1293,
1295,
1296,
1325,
1326,
1337,
1338,
1339,
1837,
1838,
2210,
2211,
2722,
2723,
2742,
2743,
2744,
2843,
2844,
2904,
2905,
4157,
4158,
4877,
4878,
5568,
5569,
5743,
5744,
5811,
5812,
6023,
6049,
6077,
6107,
6110,
6154,
6157,
6162,
6199,
6202,
6246,
6272,
6275,
6276,
6612,
6613,
7249,
7250,
7269,
7270,
7271,
7717,
7718,
8190,
8191,
8511,
8512,
8533,
8534,
8535,
9152,
9153,
10187,
10201,
10225,
10228,
10263,
10269,
10323,
10329,
10415,
10468,
10476,
10477,
10521,
10528,
10565,
10572,
10574,
10575,
11071,
11072,
11103,
11104,
11105,
11447,
11448,
12238,
12244,
12250,
12281,
12296,
12322
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12322,
"ccnet_original_nlines": 122,
"rps_doc_curly_bracket": 0.0009738699882291257,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.007378260139375925,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012297100387513638,
"rps_doc_frac_lines_end_with_ellipsis": 0.024390239268541336,
"rps_doc_frac_no_alph_words": 0.9158878326416016,
"rps_doc_frac_unique_words": 0.4924337863922119,
"rps_doc_mean_word_length": 6.492434024810791,
"rps_doc_num_sentences": 110,
"rps_doc_symbol_to_word_ratio": 0.0034431898966431618,
"rps_doc_unigram_entropy": 6.152040958404541,
"rps_doc_word_count": 1586,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.011265420354902744,
"rps_doc_frac_chars_dupe_6grams": 0.011265420354902744,
"rps_doc_frac_chars_dupe_7grams": 0.011265420354902744,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.018937550485134125,
"rps_doc_frac_chars_top_3gram": 0.006992329843342304,
"rps_doc_frac_chars_top_4gram": 0.0015538500156253576,
"rps_doc_books_importance": -844.142333984375,
"rps_doc_books_importance_length_correction": -844.142333984375,
"rps_doc_openwebtext_importance": -506.56365966796875,
"rps_doc_openwebtext_importance_length_correction": -506.56365966796875,
"rps_doc_wikipedia_importance": -277.0599365234375,
"rps_doc_wikipedia_importance_length_correction": -277.0599365234375
},
"fasttext": {
"dclm": 0.6497711539268494,
"english": 0.00001190999955724692,
"fineweb_edu_approx": 2.2411065101623535,
"eai_general_math": -0.000004170000011072261,
"eai_open_web_math": 0.20701926946640015,
"eai_web_code": 0.8525804877281189
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "519.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "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": "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,046,127,241,406,146,000 |
Grafana vs. Kibana: 5 Key Differences
2016 年 6 月 6 日1,8820
本站主要内容均为原创，转帖需注明出处www.alexclouds.net
上周看到这篇好文，忍不住要转载，一直在用Grafana和Kibaba，实际生产环境中都是二者搭配使用。 以前我自己要总结这二者的区别，无奈虽然能够理解，但是无法写出5 key difference，哈哈.
http://logz.io/blog/grafana-vs-kibana/?utm_source=marketo&utm_medium=email&utm_content=headline&utm_campaign=Newsletters.Newsletter June 2&mkt_tok=eyJpIjoiTW1NNE5UYzBZV1l5WWpSaCIsInQiOiJvbHBUcXJhYUVkTENMU3ZLRFJxUG4zYXlzekZpU3lvR25ZT3pxU0dhbkJpWGVOY0NNdUc2VHY0MjRpVWk2SjJwdGE1MWoxbm9OQ1BLY3M4SVdwVzlMbEJoTXRYM2JmQUFoNmwxSUE3a3lqbz0ifQ%3D%3D
It’s a well-known fact that we’re surrounded by huge amounts of data. Even if you manage one single Linux server, you will probably still encounter problems when trying to manage all of your logs because they are intended to detect and act on issues as soon as they happen. The significance of this issue varies based on the size of one’s environment, the role of each host, the services that are installed, and the protocols that are used.
Of course, log data can give us better insights into detecting patterns and allow us to take action more quickly when that information is presented in visualized form. This method of analysis allows IT operations teams to create the transparency that is needed to understand what is occurring at any given point in time.
Kibana and Grafana are two open source tools that can visualize and understand trends within vast amounts of log data. In this post, I will give you a short introduction to each of the tools and highlight the key differences between them.
Kibana
Kibana is a platform for analytics and visualization that allows you to explore, visualize, and build dashboards on top of the log data stored in Elasticsearch clusters. You can perform advanced data analysis and visualize your data in a variety of types of charts, tables, and maps.
kibana image
Many modern IT organizations such as Netflix and Linkedin use the the popular ELK Stack (Elasticsearch, Logstash and Kibana) for log management. Using Kibana within this stack makes it simple to deploy and use visualizations. Once the ELK stack is installed, you will be able to access Kibana’s powerful tools within the “Discover” section of the platform to explore and visualize your log data. Kibana’s simple and easy-to-use dashboard can be used by anyone, even business users with minimal IT skills and knowledge.
Grafana
Grafana is is an open source dashboard tool that commonly works with Graphite, InfluxDB, and OpenTSDB. Newer versions can also work with other data sources such as Elasticsearch.
Essentially, it’s a feature-rich replacement for Graphite-web, which helps users to easily create and edit dashboards. It contains a unique Graphite target parser that enables easy metric and function editing. Users can create comprehensive charts with smart axis formats (such as lines and points) as a result of Grafana’s fast, client-side rendering — even over long ranges of time — that uses Flot as a default option.
grafana dashboard
1. Logs vs. metrics
The main difference is that Grafana focuses on presenting time-series charts based on specific metrics such as CPU and I/O utilization. Kibana, on the other hand, runs on top of Elasticsearch and can create a comprehensive log analytics dashboard. For example, Grafana does not allow for data search and exploring.
2. Role-based access
By default, the Kibana dashboard is public. There are no built-in role-based access (RBA) controls. If you need to set up permission levels for multiple users, you will have to purchase Shield to add the additional configuration overhead. In comparison, Grafana’s built-in RBA allows you to maintain user and team access to dashboards. In addition, Grafana’s rich API can be used for tasks such as saving a specific dashboard, creating users, and updating data sources. You can also create specific API keys and assign them to specific roles.
3. Dashboard flexibility
While Kibana has a large number of built-in types of charts, the control over them was initially limited. Initially, Grafana contained several more options for flexible navigation and chart usage using tools such as the Y-Bar when choosing a specific time series. However, with the enhancements presented in Kibana 4 such as the ability to save elements and drag-and-drop them into new dashboards, we can expect Kibana to close the gap quickly.
4. Integration of data sources
Grafana supports many different storage backends. For each data source, Grafana has a specific query editor that is customized for the features and capabilities that are included in that data source. However, as mentioned above, Kibana’s native integration within the ELK Stack makes the setup fairly simple and user-friendly.
5. Open source communities
Both open source tools are powerful. When looking closely at the Grafana on Github, you will see roughly 7,000 code commits while Kibana has more than 12,000. However, to see the true strength Kibana’s open source community, look at what Google Trends reveals about the ELK Stack as a whole:
kibana grafana
Even when adding Graphite into the mix, ELK’s traction is still growing quickly and has the potential to lead in the near future:
kibana graphite
Working together
Both Kibana and Grafana are powerful visualization tools. However, the Grafana and InfluxDB combination is used for metric data whereas Kibana is part of the popular ELK Stack, which provides more flexibility when exploring log data.
Both platforms are good options and can even sometimes complement each other. First, use Kibana to analyze your logs. Then, export the data into Grafana as the visualization layer. Both rely on the same Elasticsearch repository.
0 0
|
{
"url": "http://www.alexclouds.net/2314.html",
"source_domain": "www.alexclouds.net",
"snapshot_id": "crawl=CC-MAIN-2018-22",
"warc_metadata": {
"Content-Length": "19476",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HCVBR6HNFB5SGIKJEIXSZ3TVWRYDEQFE",
"WARC-Concurrent-To": "<urn:uuid:c57d7b89-be46-40dd-9191-aeb9a0a40f32>",
"WARC-Date": "2018-05-21T20:34:08Z",
"WARC-IP-Address": "119.18.232.73",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:VWUWQBK7LFVXPHFARK2EM7PO7BWROCIH",
"WARC-Record-ID": "<urn:uuid:2d209833-e40c-4e05-bd52-eed68a1926a7>",
"WARC-Target-URI": "http://www.alexclouds.net/2314.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4a2c1609-e91c-4c7a-865c-61141cc54288>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-31-118-222.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 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,
38,
39,
60,
61,
98,
99,
209,
210,
212,
213,
553,
554,
556,
557,
998,
999,
1320,
1321,
1560,
1561,
1568,
1569,
1853,
1854,
1867,
1868,
2387,
2388,
2396,
2397,
2576,
2577,
2999,
3000,
3018,
3019,
3039,
3040,
3355,
3356,
3377,
3378,
3922,
3923,
3948,
3949,
4394,
4395,
4426,
4427,
4754,
4755,
4782,
4783,
5075,
5076,
5091,
5092,
5222,
5223,
5239,
5240,
5257,
5258,
5492,
5493,
5722,
5723
],
"line_end_idx": [
38,
39,
60,
61,
98,
99,
209,
210,
212,
213,
553,
554,
556,
557,
998,
999,
1320,
1321,
1560,
1561,
1568,
1569,
1853,
1854,
1867,
1868,
2387,
2388,
2396,
2397,
2576,
2577,
2999,
3000,
3018,
3019,
3039,
3040,
3355,
3356,
3377,
3378,
3922,
3923,
3948,
3949,
4394,
4395,
4426,
4427,
4754,
4755,
4782,
4783,
5075,
5076,
5091,
5092,
5222,
5223,
5239,
5240,
5257,
5258,
5492,
5493,
5722,
5723,
5726
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5726,
"ccnet_original_nlines": 68,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35866543650627136,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018535679206252098,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17979611456394196,
"rps_doc_frac_unique_words": 0.4462616741657257,
"rps_doc_mean_word_length": 5.462616920471191,
"rps_doc_num_sentences": 55,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.36144495010376,
"rps_doc_word_count": 856,
"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.008982039988040924,
"rps_doc_frac_chars_top_3gram": 0.007057310082018375,
"rps_doc_frac_chars_top_4gram": 0.008126599714159966,
"rps_doc_books_importance": -458.55255126953125,
"rps_doc_books_importance_length_correction": -458.55255126953125,
"rps_doc_openwebtext_importance": -259.4367370605469,
"rps_doc_openwebtext_importance_length_correction": -259.4367370605469,
"rps_doc_wikipedia_importance": -185.14474487304688,
"rps_doc_wikipedia_importance_length_correction": -185.14474487304688
},
"fasttext": {
"dclm": 0.3293883204460144,
"english": 0.8971429467201233,
"fineweb_edu_approx": 2.5761122703552246,
"eai_general_math": 0.5183553695678711,
"eai_open_web_math": 0.200567364692688,
"eai_web_code": 0.6556246280670166
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "12",
"label": "Listicle"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
3,762,146,922,967,383,600 |
Jump to content
TXG/MNX
Members
• Content Count
2,252
• Joined
• Last visited
Community Reputation
255 Excellent
About TXG/MNX
• Rank
River Patroller
• Birthday 05/01/1972
Profile Information
• Gender
Male
Recent Profile Visitors
14,829 profile views
1. Hi Mike I own an original ATR-8000 without the 8088 addon card. Would it be possible to connect the new 8088 board you may add also be used in the original ATR8000 ?
2. I am looking for Cubase audio for atari
3. New iso link http://www.retro1games.com/download/jagmovie.iso Enjoy and share with everyone its free. Verstuurd vanaf mijn POCO F1 met Tapatalk
4. Will share a full iso link today Verstuurd vanaf mijn POCO F1 met Tapatalk
5. Hi I just did see someone is selling one of my cinepak releases on ebay for 50usd!!!! The cd was made free for everyone please dont buy it. https://www.u-235.co.uk/jaguar-archives/txgmnx-cinepak-movies/ https://www.ebay.com/itm/164028062958 Verstuurd vanaf mijn POCO F1 met Tapatalk
6. Accelerated io on ide+? What do you need to enable that? Verstuurd vanaf mijn POCO F1 met Tapatalk
7. No mind reading needed, I wanted to create a transulant box over an existing background see picture above. I also posted the changes I made to get it working. Varmode_on did the trick for me. Thanx for pointing me to the right direction CJ. Verstuurd vanaf mijn POCO F1 met Tapatalk
8. Hi, I read the JAG_V8.PDF Okay I turned VARMODE ON and now I can mix cry with RGB, and have a transulent color in rapapp.s raptor_video_VARMOD equ vidVARMOD_ON In assets.txt I added this line: ABS,sprite_overlay,gfx_cry,ASSETS\GFX\overlay.bmp and in rapinit.s overlay dc.l 1 ; repeat dc.l is_active ; active dc.w 100,0 ; x dc.w 90,0 ; y dc.w 0,0 ; xadd dc.w 0,0 ; yadd dc.l 160 ; width dc.l 80 ; height dc.l is_normal ; flip dc.l 0 ; coffx dc.l 0 ; coffy dc.l 160 ; hbox dc.l 80 ; vbox dc.l sprite_overlay ; gfxbase dc.l 16 ; gfxbits dc.l is_cry ; gfxformat dc.l is_trans ; gfxbacktype jag_v8.pdf
9. Hi, In the manual I see these modes: CRY16, RGB16, RGB24, DIRECT16 When using RGB16 only RGB values are supported right or can I still use CRY objects? What about DIRECT16 mode I cannot find the info on that in the manual.
10. Hi, I like to mix RGB and CRY pictures, is that even possible? I did set the mode in the objectlist to is_Cry The reason is that I would like to try if I get a picture transulant instead of transparant. I failed to set a picture to cry any help would be great.
11. yep fixed it not using 256 color images right now
12. Hi, I was playing around with to images 8-bit 256 color bmp files. The first does display right when I disable the second object in the rapinit.s When enable both pictures the first objects gets corrupt and doesnot look the same. It seems its using the clut table of the second picture. Both pictures are 8-bit bmp loadclut(strptr(sprite_background_clut),0,256) loadclut(strptr(sprite_girlb_clut),0,256) How can I handle two or more 8-bit bmp files with cluts ? picture 1: Jaguar is 256 color bmp picture 2: Jaguar + clut enabled + second sprite girlb 256 color no clut in code jaguar ok, girlb sprite not ok picture 3: Jaguar no clut in code and girlb clut enabled in code girlb displays ok, jaguar don't Could someone show me an example code of two 256 color bmp files shown on screen ?
13. Hi, In the rapinit there is this line: dc.l ani_rept ; animloop What value shout ani_rept be to use the once option ?
×
×
• Create New...
|
{
"url": "https://atariage.com/forums/profile/2754-txgmnx/",
"source_domain": "atariage.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "109658",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O63PXLPHFZ32IXCXG6JE6PS3FA6CJPRX",
"WARC-Concurrent-To": "<urn:uuid:7c44f7b2-c205-4d7e-8c75-b287222ceaf7>",
"WARC-Date": "2021-09-16T11:50:33Z",
"WARC-IP-Address": "104.26.3.211",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VAUHYF7SBVOEZAUZY6P5IB3YE4TXM3EI",
"WARC-Record-ID": "<urn:uuid:e934d161-a908-4087-9876-e173eaee1961>",
"WARC-Target-URI": "https://atariage.com/forums/profile/2754-txgmnx/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1a11f58b-3380-4e19-80f4-24649a78dfe4>"
},
"warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-22\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
16,
17,
25,
26,
34,
52,
53,
63,
74,
75,
92,
93,
114,
115,
129,
130,
144,
145,
154,
174,
198,
199,
219,
220,
231,
240,
241,
265,
266,
287,
458,
503,
652,
732,
1020,
1124,
1412,
2014,
2242,
2509,
2565,
3360,
3484,
3486,
3488
],
"line_end_idx": [
16,
17,
25,
26,
34,
52,
53,
63,
74,
75,
92,
93,
114,
115,
129,
130,
144,
145,
154,
174,
198,
199,
219,
220,
231,
240,
241,
265,
266,
287,
458,
503,
652,
732,
1020,
1124,
1412,
2014,
2242,
2509,
2565,
3360,
3484,
3486,
3488,
3505
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3505,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27654320001602173,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06913580000400543,
"rps_doc_frac_lines_end_with_ellipsis": 0.021739130839705467,
"rps_doc_frac_no_alph_words": 0.26913580298423767,
"rps_doc_frac_unique_words": 0.5,
"rps_doc_mean_word_length": 4.534246444702148,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0.0012345700524747372,
"rps_doc_unigram_entropy": 5.305467128753662,
"rps_doc_word_count": 584,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06608761101961136,
"rps_doc_frac_chars_dupe_6grams": 0.06608761101961136,
"rps_doc_frac_chars_dupe_7grams": 0.06608761101961136,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01132931001484394,
"rps_doc_frac_chars_top_3gram": 0.033987920731306076,
"rps_doc_frac_chars_top_4gram": 0.04154079034924507,
"rps_doc_books_importance": -394.4070739746094,
"rps_doc_books_importance_length_correction": -394.4070739746094,
"rps_doc_openwebtext_importance": -152.68341064453125,
"rps_doc_openwebtext_importance_length_correction": -152.68341064453125,
"rps_doc_wikipedia_importance": -100.43937683105469,
"rps_doc_wikipedia_importance_length_correction": -100.43937683105469
},
"fasttext": {
"dclm": 0.037990450859069824,
"english": 0.7103668451309204,
"fineweb_edu_approx": 1.1399773359298706,
"eai_general_math": 0.034919921308755875,
"eai_open_web_math": 0.2039889693260193,
"eai_web_code": 0.0012714900076389313
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-1,831,639,328,163,587,600 |
52 posts tagged with chat.
Displaying 51 through 52 of 52. Subscribe:
iParty Audio Chat?
Sort of a feature: iParty is an audio chat program. Would anyone be intrested in setting up a server for MetaFilter? MF is a grat place to start a conversation, and there are a lot of people here that provide it. I think giving everyone the ability to have an actual, real-time conversation would be an interesting extension to the MetaFilter experience.
p.s. I'm not asking this specifically of Matt, either. I understand that about five people can be in a room together on a 28.8 server before lag becomes a real problem, so I imagine anyone that would have a static ip number could run the server. Of course, Matt might have to point it out before it would be accepted. (i.e. "official")
posted by Lirp on Nov 12, 2000 - 7 comments
Welcome to MetaTalk
I like you both in different ways...
how meta can you get...? I think this post a topic thingie that I am typing in right now could be more specialized to metatalk, like it's not always gonna link someplace... differentiation of the two sections -- besides just by color -- is probably a good idea.
any way to get threaded comments going using this interface? some of the metachat may get kinda lengthy.
posted by jessamyn on Mar 4, 2000 - 7 comments
Page: 1 2
|
{
"url": "https://metatalk.metafilter.com/tags/chat?page=2",
"source_domain": "metatalk.metafilter.com",
"snapshot_id": "crawl=CC-MAIN-2019-22",
"warc_metadata": {
"Content-Length": "43977",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GRZ5WXKSEUMRVATQJKP5BNCML2IOKTTL",
"WARC-Concurrent-To": "<urn:uuid:740ee333-dff4-4dc3-a407-a4bb7a973242>",
"WARC-Date": "2019-05-22T19:10:06Z",
"WARC-IP-Address": "54.186.13.33",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:M7ILPW54A3KV5QMSEC52YP745OHGA3GD",
"WARC-Record-ID": "<urn:uuid:18fb7607-0252-4c1e-bbf4-e063507cf4a2>",
"WARC-Target-URI": "https://metatalk.metafilter.com/tags/chat?page=2",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ca11d7fa-b9a6-4370-8deb-27a6edd5802d>"
},
"warc_info": "isPartOf: CC-MAIN-2019-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-113-197-177.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
27,
70,
71,
90,
91,
446,
447,
783,
827,
828,
848,
849,
886,
887,
1149,
1150,
1255,
1256,
1257,
1304,
1305
],
"line_end_idx": [
27,
70,
71,
90,
91,
446,
447,
783,
827,
828,
848,
849,
886,
887,
1149,
1150,
1255,
1256,
1257,
1304,
1305,
1314
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1314,
"ccnet_original_nlines": 21,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.457446813583374,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028368789702653885,
"rps_doc_frac_lines_end_with_ellipsis": 0.04545455053448677,
"rps_doc_frac_no_alph_words": 0.19858156144618988,
"rps_doc_frac_unique_words": 0.632478654384613,
"rps_doc_mean_word_length": 4.337606906890869,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0.010638300329446793,
"rps_doc_unigram_entropy": 4.764708518981934,
"rps_doc_word_count": 234,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.017733989283442497,
"rps_doc_frac_chars_top_3gram": 0.025615759193897247,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -95.20932006835938,
"rps_doc_books_importance_length_correction": -95.20932006835938,
"rps_doc_openwebtext_importance": -65.60572052001953,
"rps_doc_openwebtext_importance_length_correction": -65.60572052001953,
"rps_doc_wikipedia_importance": -53.10676574707031,
"rps_doc_wikipedia_importance_length_correction": -53.10669708251953
},
"fasttext": {
"dclm": 0.021884439513087273,
"english": 0.9516883492469788,
"fineweb_edu_approx": 1.110876441001892,
"eai_general_math": 0.20294588804244995,
"eai_open_web_math": 0.190393328666687,
"eai_web_code": 0.012408019974827766
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.