id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
1,526,083,730,148,041,200
|
Indentation in editor inconsistent with actual preview
Steps to reproduce
1. Write a topline note and hit Return
2. Indent on the next line and hit Return.
3. On the new line write a comment. In the editor this new line will be indented. In the preview it will not be indented.
Expected result
The editor view should match the preview.
Actual result
The editor shows indentation, the preview is not indented.
Environment
• Operating system: Windows 10
• Obsidian version: v0.10.09
Additional information
The error is caused by indenting, not adding any text to that line and then hitting return and adding the text on the next line. Everything behaves correctly if you create the topline note, hit return twice and the indent. The problem is that if you do it wrong in the editor it will still display correctly in the editor but not in the preview. The editor should be representative of what will show in the preview so as not to confuse and frustrate newbies like me :stuck_out_tongue_winking_eye:
Example: “Structure and systems, all gaps must be filled. Atomic structures are emergent and naturally formed.” is indented in the editor but not in the preview.
2 Likes
ok, the editor is wrong.
|
{
"url": "https://forum.obsidian.md/t/indentation-in-editor-inconsistent-with-actual-preview/11987",
"source_domain": "forum.obsidian.md",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "18565",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WLGBXG72H7FXV24FPPMS6DT3YCIKMOPB",
"WARC-Concurrent-To": "<urn:uuid:f55a5e80-3663-4223-b5f0-de21e6f1e9d9>",
"WARC-Date": "2022-06-28T19:19:28Z",
"WARC-IP-Address": "172.67.139.124",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SOLZT7676VJSGCADNUT4UOP74QJFXWBE",
"WARC-Record-ID": "<urn:uuid:7c544342-934f-4a29-b044-c13a38e6b924>",
"WARC-Target-URI": "https://forum.obsidian.md/t/indentation-in-editor-inconsistent-with-actual-preview/11987",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2a0e0157-92d9-4046-8086-91963b649bd0>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-143\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,
55,
56,
75,
76,
117,
162,
286,
287,
303,
304,
346,
347,
361,
362,
421,
422,
434,
435,
468,
499,
500,
523,
524,
1021,
1022,
1184,
1185,
1193,
1194
],
"line_end_idx": [
55,
56,
75,
76,
117,
162,
286,
287,
303,
304,
346,
347,
361,
362,
421,
422,
434,
435,
468,
499,
500,
523,
524,
1021,
1022,
1184,
1185,
1193,
1194,
1218
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1218,
"ccnet_original_nlines": 29,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39406779408454895,
"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.16101695597171783,
"rps_doc_frac_unique_words": 0.49268293380737305,
"rps_doc_mean_word_length": 4.678048610687256,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.205297470092773,
"rps_doc_word_count": 205,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06047967076301575,
"rps_doc_frac_chars_dupe_6grams": 0.06047967076301575,
"rps_doc_frac_chars_dupe_7grams": 0.06047967076301575,
"rps_doc_frac_chars_dupe_8grams": 0.06047967076301575,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.041710108518600464,
"rps_doc_frac_chars_top_3gram": 0.045881129801273346,
"rps_doc_frac_chars_top_4gram": 0.027111569419503212,
"rps_doc_books_importance": -106.18696594238281,
"rps_doc_books_importance_length_correction": -106.18696594238281,
"rps_doc_openwebtext_importance": -59.75682067871094,
"rps_doc_openwebtext_importance_length_correction": -59.756690979003906,
"rps_doc_wikipedia_importance": -52.190006256103516,
"rps_doc_wikipedia_importance_length_correction": -52.190006256103516
},
"fasttext": {
"dclm": 0.07618451118469238,
"english": 0.8465262055397034,
"fineweb_edu_approx": 1.3540536165237427,
"eai_general_math": 0.899526834487915,
"eai_open_web_math": 0.6066989898681641,
"eai_web_code": 0.14495742321014404
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.435",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,774,505,685,595,061,000
|
A Beginner’s Guide to Mining Dogecoin: Step-by-Step Tutorial
• Dogecoin, a cryptocurrency developed in 2013 and Mining Dogecoin, is the method of adding new blocks to the Blockchain of Dogecoin by solving mathematically complex problems to get Dogecoin rewards.
• Two of the most frequently utilized mining hardware choices that are used for Dogecoin include ASIC miners as well as GPU/CPU as well. ASIC miners work better, but they require more investment upfront.
• To successfully mine, Dogecoin, miners should evaluate their preferred mining method and hardware choices and create an ASIC miner or become a member of a mining pool and meet the requirements for mining, including high-quality electricity, fast internet connectivity, and a secure Bitcoin wallet.
Cryptocurrency mining is now an increasingly popular method of earning a passive income. A popular and talked about cryptocurrency that you can mine is Dogecoin. In this tutorial for beginners, we’ll give you a step-by-step guide on how to make Dogecoin a profitable investment and increase your profits.
Introduction
Dogecoin is a cryptocurrency created in the year 2013. It is based on the Litecoin blockchain and employs its Scrypt algorithm. Dogecoin was initially designed to be a funny joke. However, it has received a considerable following and is widely recognized as a real cryptocurrency.
Mining with Dogecoin is adding new blocks to the blockchain by solving complicated mathematical issues. Miners are paid by way of Dogecoin to reward their efforts.
Understanding Dogecoin Mining
Explanation of Mining
mining is adding transactions on the Blockchain and solving complicated mathematical problems to add blocks to the Blockchain. When it comes to Dogecoin mining recognized with Dogecoin after successfully working through these math-related problems.
Description of the Dogecoin Network and How Mining Works
The Dogecoin system is a decentralized network based on nodes to verify transactions and add new blockages to the Blockchain. When the miner solves a mathematical challenge, it is checked by the other nodes of the network before the block can be added to the Blockchain.
Comparison of ASIC and GPU/CPU Mining Hardware
The two most frequently used equipment for mining Dogecoin is ASIC mining equipment and GPU/CPU. ASIC (Application-Specific Integrated Circuit) miners are explicitly designed for cryptocurrency mining and are more efficient than GPU/CPU mining. GPU/CPU mining is more demanding regarding power and energy consumption but can be a cheaper alternative for those new to the field.
Overall, the choice between ASIC and GPU/CPU mining equipment for Dogecoin mining is a complex one that depends on various factors. While ASIC miners offer high efficiency, they can lead to centralization, whereas GPU/CPU mining can help maintain decentralization. The long-term survival and prospects of Dogecoin and other cryptocurrencies will depend on many factors, including technological advancements and regulatory measures.
Starting with Dogecoin Mining
Assessing Mining Method of Choice and Hardware Options
Before you begin Dogecoin mining, evaluating your mining strategy and hardware choices is essential. Take into consideration factors like the power required to process as well as energy consumption. The initial cost of investment.
Setting up an ASIC Miner
Setting up the ASIC miner is simple and requires no complicated software downloads or settings. All you have to do is connect the miner to an internet connection and then start mining.
Overview of Popular Dogecoin Mining Software Options
MultiMiner, as well as PhoenixMiner, are well-known Dogecoin mining software choices. These software programs assist you in managing the mining activity, which allows you to maximize your profits.
Joining a Mining Pool
Participating in a mining pool is an easy method to begin mining Dogecoin. It lets you pool your processing capabilities with fellow miners to participate in the profits. If you sign up for a mining pool, you’ll get a share of the rewards based on the amount of processing power.
Mining Dogecoin
Solo Mining vs. Pool Mining
Solo mining validates transactions and blocks in the Dogecoin blockchain with your computing power and hardware. Pool mining is, however, the,e process of using your processing power in conjunction with other miners to increase your chance of getting rewards.
Explanation of the Mining Process
The mining process requires solving mathematically complex problems to add Blocks to the Blockchain of Dogecoin. Miners get rewarded with Dogecoin when they solve these challenges.
Tips for Maximizing Mining Profitability
To make money mining Dogecoin, You will require ASIC machines specifically designed for Scrypt-based mining. It is also essential to evaluate the mining method you prefer and the hardware options before committing to any significant investment in Dogecoin mining.
Cryptocurrency mining requires careful consideration of technical and financial factors. The proper hardware and mining method are crucial for profitability. Understanding the differences between popular cryptocurrencies like Dogecoin and Bitcoin can help make informed investment decisions.
Overview of Mining Rewards and Payout Methods
Mining rewards are paid in Dogecoin and depend on the processing power of miners. The payout methods differ based on the mining pool or the software used. Popular payout methods include PPS (Pay Per Share), PPLNS (Pay Per Last N Shares), and SOLO.
Dogecoin’s rise to fame may have been unexpected, but it has certainly captured the attention of many cryptocurrency enthusiasts. As the digital asset landscape evolves, it will be interesting to see how Dogecoin and other cryptocurrencies fare in adoption and market value.
Essential Requirements for Dogecoin Mining
To successfully mine Dogecoin, there are some fundamental requirements you have to be able to meet:
Reliable Source of Electricity
Dogecoin mining is an effective use of energy. Therefore an uninterrupted source of power is vital. Be sure that you are connected to a reliable and continuous power source.
Internet Connection Speed
A fast and uncapped internet connection is vital to the success of Dogecoin mining. Low internet speed can result in the loss of mining profits.
Dogecoin Wallet
You will require a wallet for Dogecoin to collect mining outputs and keep your Dogecoin reward. Select a secure and reliable wallet that will keep your profits safe.
Conclusion
Dogecoin mining is profitable if it is done correctly. You can make the most of your profit by considering your mining strategy of choice, the hardware options, installing an ASIC miner, and registering the mining group. Make sure you feel the most critical needs, like the power supply and speed of internet connectivity, and pick a safe wallet to keep your Dogecoin earnings.
In summary, Dogecoin mining profitability can be influenced by Elon Musk’s tweets and remarks, which significantly impact the price of Dogecoin. While careful mining strategy and high-quality hardware can increase profitability, miners should also consider power supply and wallet security factors. Keeping an eye on Musk’s statements is also crucial for informed decision-making.
FAQs
What is the Dogecoin mining process, what is it, and how do they function?
The process of mining Dogecoin involves the process of adding blocks onto the Dogecoin blockchain by solving mathematically complex problems. Miners are paid with the help of Dogecoin to reward their efforts.
What equipment is required for mining Dogecoin?
The most popular Dogecoin hardware mining options are ASIC mining equipment and GPU/CPU.
What is the difference between ASIC as well as GPU/CPU mining?
ASIC (Application-Specific Integrated Circuit) miners are explicitly designed for cryptocurrency mining and are more efficient than GPU/CPU mining. GPU/CPU mining demands more processing power and energy consumption but is a cost-effective alternative for those new to the field.
How do I set up the ASIC miner?
Setting up your ASIC miner is simple and does not require complicated software downloads or settings. All you have to do is connect the miner to an internet connection and then start mining.
What is a Dogecoin mining pool, and how can I become a member?
The mining pool is a collection of miners that combine their processing power to enhance their chance of receiving rewards. If you want to be a part of a mining pool, you must first sign up for accounts with them and then follow their guidelines to start mining.
Can I solo mine Dogecoin?
Yes, you can mine solo Dogecoin. However, it requires lots of energy and processing power. Pool mining is the more efficient choice for the majority of miners.
What is the most efficient mining software to mine Dogecoin?
MultiMiner as well as PhoenixMiner are two popular dogecoin mining programs.
How can I increase my mining profit?
You require ASIC machines specifically designed for Scrap-based mining to maximize your mining profits. Consider the preferred mining strategy and hardware choices before investing in Dogecoin mining.
How are mining rewards and payouts how are they calculated?
The processing power provided by miners determines mining rewards. Payment methods differ depending on the pool and the software employed.
Is Dogecoin mining still profitable?
The mining of Dogecoin is profitable. However, it is contingent on various factors, such as the price at which Dogecoin is traded and the cost of electricity.
Authors
• Ivan Brightly
Ivan Brightly is a leading cryptocurrency analyst and author with over 5 years of experience in the blockchain and digital asset space. He previously served as a senior analyst at a major cryptocurrency hedge fund where he led quantitative research and trading strategy development.
Ivan holds a Master's degree in Finance from the London School of Economics and a Bachelor's in Computer Science from Stanford University. He is frequently invited to speak at fintech and blockchain conferences worldwide on topics spanning cryptocurrency trading, blockchain technology, and the future of digital assets.
Ivan's commentary has been featured in several major finance and technology publications including Forbes, Bloomberg, and CoinDesk. He is considered one of the most insightful voices analyzing new developments in the cryptocurrency and blockchain industry.
View all posts
• Gabriele Spapperi
Gabriele Spapperi is a veteran cryptocurrency investor and blockchain technology specialist. He became fascinated with Bitcoin and distributed ledgers while studying computer science at MIT in 2011.
Since 2013, Gabriele has actively traded major cryptocurrencies and identified early-stage projects to invest in. He contributes articles to leading fintech publications sharing his insights on blockchain technology, crypto markets, and trading strategies.
With over a decade of experience in the crypto space, Gabriele provides reliable insights and analysis on the latest developments in digital assets and blockchain platforms. When he's not analyzing crypto markets, Gabriele enjoys travel, golf, and fine wine. He currently resides in Austin, Texas.
View all posts
|
{
"url": "http://www.google-watch.org/dogecoin/a-beginners-guide-to-mining-dogecoin-step-by-step-tutorial/",
"source_domain": "www.google-watch.org",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "130287",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OWGVRHPBM7QS63SB7PF4POOIJPXAPHGT",
"WARC-Concurrent-To": "<urn:uuid:47b5ea4a-d97a-4ad9-ae6a-3560e57db3b0>",
"WARC-Date": "2024-09-18T05:32:32Z",
"WARC-IP-Address": "78.142.29.185",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KLKRTCP5MC6Y6J6INFJ7JFJXACGEVRFR",
"WARC-Record-ID": "<urn:uuid:d6d4e435-8c99-4a46-ba22-6ffa5f6140c9>",
"WARC-Target-URI": "http://www.google-watch.org/dogecoin/a-beginners-guide-to-mining-dogecoin-step-by-step-tutorial/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:13e9bfc6-5461-4e82-961e-6aafa1969c85>"
},
"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 (info@commoncrawl.org)\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,
61,
62,
265,
471,
773,
774,
1079,
1080,
1093,
1094,
1375,
1376,
1540,
1541,
1571,
1572,
1594,
1595,
1844,
1845,
1902,
1903,
2174,
2175,
2222,
2223,
2601,
2602,
3034,
3035,
3065,
3066,
3121,
3122,
3353,
3354,
3379,
3380,
3565,
3566,
3619,
3620,
3817,
3818,
3840,
3841,
4121,
4122,
4138,
4139,
4167,
4168,
4428,
4429,
4463,
4464,
4645,
4646,
4687,
4688,
4952,
4953,
5245,
5246,
5292,
5293,
5541,
5542,
5817,
5818,
5861,
5862,
5962,
5963,
5994,
5995,
6169,
6170,
6196,
6197,
6342,
6343,
6359,
6360,
6526,
6527,
6538,
6539,
6917,
6918,
7299,
7300,
7305,
7306,
7381,
7382,
7591,
7592,
7640,
7641,
7730,
7731,
7794,
7795,
8075,
8076,
8108,
8109,
8300,
8301,
8364,
8365,
8628,
8629,
8655,
8656,
8816,
8817,
8878,
8879,
8956,
8957,
8994,
8995,
9196,
9197,
9257,
9258,
9397,
9398,
9435,
9436,
9595,
9596,
9604,
9605,
9623,
9624,
9911,
9912,
10237,
10238,
10499,
10500,
10519,
10541,
10542,
10745,
10746,
11007,
11008,
11310,
11311
],
"line_end_idx": [
61,
62,
265,
471,
773,
774,
1079,
1080,
1093,
1094,
1375,
1376,
1540,
1541,
1571,
1572,
1594,
1595,
1844,
1845,
1902,
1903,
2174,
2175,
2222,
2223,
2601,
2602,
3034,
3035,
3065,
3066,
3121,
3122,
3353,
3354,
3379,
3380,
3565,
3566,
3619,
3620,
3817,
3818,
3840,
3841,
4121,
4122,
4138,
4139,
4167,
4168,
4428,
4429,
4463,
4464,
4645,
4646,
4687,
4688,
4952,
4953,
5245,
5246,
5292,
5293,
5541,
5542,
5817,
5818,
5861,
5862,
5962,
5963,
5994,
5995,
6169,
6170,
6196,
6197,
6342,
6343,
6359,
6360,
6526,
6527,
6538,
6539,
6917,
6918,
7299,
7300,
7305,
7306,
7381,
7382,
7591,
7592,
7640,
7641,
7730,
7731,
7794,
7795,
8075,
8076,
8108,
8109,
8300,
8301,
8364,
8365,
8628,
8629,
8655,
8656,
8816,
8817,
8878,
8879,
8956,
8957,
8994,
8995,
9196,
9197,
9257,
9258,
9397,
9398,
9435,
9436,
9595,
9596,
9604,
9605,
9623,
9624,
9911,
9912,
10237,
10238,
10499,
10500,
10519,
10541,
10542,
10745,
10746,
11007,
11008,
11310,
11311,
11329
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11329,
"ccnet_original_nlines": 153,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35987749695777893,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026544159278273582,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10974986851215363,
"rps_doc_frac_unique_words": 0.30128204822540283,
"rps_doc_mean_word_length": 5.4172492027282715,
"rps_doc_num_sentences": 104,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.327433109283447,
"rps_doc_word_count": 1716,
"rps_doc_frac_chars_dupe_10grams": 0.05292598903179169,
"rps_doc_frac_chars_dupe_5grams": 0.13296040892601013,
"rps_doc_frac_chars_dupe_6grams": 0.09832186251878738,
"rps_doc_frac_chars_dupe_7grams": 0.06712564826011658,
"rps_doc_frac_chars_dupe_8grams": 0.05292598903179169,
"rps_doc_frac_chars_dupe_9grams": 0.05292598903179169,
"rps_doc_frac_chars_top_2gram": 0.027108430862426758,
"rps_doc_frac_chars_top_3gram": 0.009681579656898975,
"rps_doc_frac_chars_top_4gram": 0.009036139585077763,
"rps_doc_books_importance": -787.8475341796875,
"rps_doc_books_importance_length_correction": -787.8475341796875,
"rps_doc_openwebtext_importance": -502.8961181640625,
"rps_doc_openwebtext_importance_length_correction": -502.8961181640625,
"rps_doc_wikipedia_importance": -400.8824157714844,
"rps_doc_wikipedia_importance_length_correction": -400.8824157714844
},
"fasttext": {
"dclm": 0.5518437623977661,
"english": 0.9394217133522034,
"fineweb_edu_approx": 2.1651477813720703,
"eai_general_math": 0.07412540912628174,
"eai_open_web_math": 0.156341552734375,
"eai_web_code": 0.012857319787144661
}
}
|
{
"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.874",
"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": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-9,025,249,976,182,575,000
|
A letter in response to Adam Gopnik’s article (April 4, 2011)
Adam Gopnik, along with other reviewers, misses one important element in writing about the performance of Watson, the I.B.M. computer that competed with two humans on “Jeopardy” (Books, April 4th). Watson had an advantage, in that he was able to push the signal button much faster, and so was able to respond to almost every answer. Had I.B.M. programmed a very short delay into the signal, comparable to the time it takes a human to respond, my guess is that Watson could have been beaten, but then I.B.M. would have had egg all over its face.
Robert Spies
Los Angeles, Calif.
|
{
"url": "https://www.newyorker.com/magazine/2011/05/02/match-point",
"source_domain": "www.newyorker.com",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "357699",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NJWP5YEOG4PHMA3MI7J3NLFASSJ6W3WG",
"WARC-Concurrent-To": "<urn:uuid:5a339654-9b8f-4f0d-acbd-c85295cd7e5f>",
"WARC-Date": "2021-05-10T06:04:41Z",
"WARC-IP-Address": "151.101.248.239",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:42LSKESRD743PG5BFG7MGREQ34DYWB7B",
"WARC-Record-ID": "<urn:uuid:bd4bf872-e6e2-4762-be26-9fcba1a6a3be>",
"WARC-Target-URI": "https://www.newyorker.com/magazine/2011/05/02/match-point",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:551e5b4e-1077-4465-991b-4c1777906759>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-34.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,
62,
63,
608,
609,
622,
623
],
"line_end_idx": [
62,
63,
608,
609,
622,
623,
642
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 642,
"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.38255032896995544,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06711409240961075,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21476510167121887,
"rps_doc_frac_unique_words": 0.7410714030265808,
"rps_doc_mean_word_length": 4.464285850524902,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.275078296661377,
"rps_doc_word_count": 112,
"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.02800000086426735,
"rps_doc_frac_chars_top_3gram": 0.035999998450279236,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -65.75507354736328,
"rps_doc_books_importance_length_correction": -76.25119018554688,
"rps_doc_openwebtext_importance": -46.46389389038086,
"rps_doc_openwebtext_importance_length_correction": -56.96000671386719,
"rps_doc_wikipedia_importance": -33.0501823425293,
"rps_doc_wikipedia_importance_length_correction": -43.54629898071289
},
"fasttext": {
"dclm": 0.8658795356750488,
"english": 0.9822118878364563,
"fineweb_edu_approx": 2.481661796569824,
"eai_general_math": 0.42321348190307617,
"eai_open_web_math": 0.48526644706726074,
"eai_web_code": 0.26439130306243896
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "006.3",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"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": "1",
"label": "News/Editorial"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,123,872,265,032,902,000
|
Hi All,
A complete newbie here, I have been left some Ruby code by a contractor
and need some help.
I would like the bot to reconnect when it is kicked from the room or
when the server is rebooted/goes offline. Current this is happening, but
the time it takes for it to reconnect is random, sometimes it will take
5 minutes others 50 seconds.
Also, how would I go about adding some logging?
Thanks in advance for your help
Nick
CODE
======
#!/usr/bin/env ruby
require 'rubygems'
require 'xmpp4r/client'
require 'xmpp4r/roster'
require 'xmpp4r/muc'
require 'socket'
require 'daemons'
include Jabber
options = {}
options[:host] = 'XXXXXX'
options[:port] = 5222
options[:jid] = "XXXX@XXXXXX/#ETVDVXDF"
options[:password] = 'XXXXXX'
options[:room_jid] = 'XXXX@XXXXXX/XXXXX'
## Bind to localhost
server = TCPServer.new("127.0.0.1", 5223) # Server bind to port 5223
cl = Client.new(JID::new(options[:jid]))
def reconnect(cl)
cl.connect('XXXXXX', 5222 )
cl.auth( 'XXXXX')
cl.send(Presence.new.set_type(:available))
end
cl.connect('talk.google.com', 5222 )
cl.auth( 'XXXXXXX')
cl.send(Presence.new.set_type(:available))
muc_room = MUC::SimpleMUCClient.new(cl)
muc_room.join(options[:room_jid])
while true
Thread.start(server.accept) do |cl|
response = cl.gets
muc_room.say(response)
cl.close
end
end
reconnect(cl)
cl.on_exception { sleep 1; reconnect(cl) }
--
Posted via http://www.ruby-forum.com/.
|
{
"url": "http://blade.nagaokaut.ac.jp/cgi-bin/scat.rb/ruby/ruby-talk/412450",
"source_domain": "blade.nagaokaut.ac.jp",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "5307",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4UMYW577TM5Z354VUT3PC62QB2NERNL3",
"WARC-Concurrent-To": "<urn:uuid:2d830eac-63b3-4e6c-8a8b-0ae977b61a8f>",
"WARC-Date": "2020-03-31T23:52:13Z",
"WARC-IP-Address": "133.44.98.95",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VJO44UIFVM37NGOUBDL5QRGCJAWW6U42",
"WARC-Record-ID": "<urn:uuid:8ad513c4-ffcf-48b3-bf16-596ed45e8170>",
"WARC-Target-URI": "http://blade.nagaokaut.ac.jp/cgi-bin/scat.rb/ruby/ruby-talk/412450",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:37cc4736-1928-42df-a43a-cf3273adee01>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-193.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
8,
9,
81,
101,
102,
171,
244,
316,
345,
346,
394,
395,
427,
428,
433,
434,
439,
446,
466,
485,
509,
533,
554,
571,
589,
604,
605,
618,
644,
666,
706,
736,
777,
778,
799,
868,
869,
910,
911,
929,
961,
983,
1030,
1034,
1035,
1072,
1092,
1135,
1136,
1176,
1210,
1211,
1222,
1262,
1289,
1320,
1337,
1343,
1347,
1348,
1362,
1405,
1406,
1410
],
"line_end_idx": [
8,
9,
81,
101,
102,
171,
244,
316,
345,
346,
394,
395,
427,
428,
433,
434,
439,
446,
466,
485,
509,
533,
554,
571,
589,
604,
605,
618,
644,
666,
706,
736,
777,
778,
799,
868,
869,
910,
911,
929,
961,
983,
1030,
1034,
1035,
1072,
1092,
1135,
1136,
1176,
1210,
1211,
1222,
1262,
1289,
1320,
1337,
1343,
1347,
1348,
1362,
1405,
1406,
1410,
1448
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1448,
"ccnet_original_nlines": 64,
"rps_doc_curly_bracket": 0.002762430114671588,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1763085424900055,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04958678036928177,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.42424240708351135,
"rps_doc_frac_unique_words": 0.7261146306991577,
"rps_doc_mean_word_length": 6.541401386260986,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.013774099759757519,
"rps_doc_unigram_entropy": 4.59691858291626,
"rps_doc_word_count": 157,
"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.02142162062227726,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -127.7552261352539,
"rps_doc_books_importance_length_correction": -123.83909606933594,
"rps_doc_openwebtext_importance": -87.9770736694336,
"rps_doc_openwebtext_importance_length_correction": -87.9770736694336,
"rps_doc_wikipedia_importance": -76.1187515258789,
"rps_doc_wikipedia_importance_length_correction": -67.80216979980469
},
"fasttext": {
"dclm": 0.868484377861023,
"english": 0.6657344698905945,
"fineweb_edu_approx": 2.9874091148376465,
"eai_general_math": 0.8359939455986023,
"eai_open_web_math": 0.30971264839172363,
"eai_web_code": 0.7301721572875977
}
}
|
{
"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": "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": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "1",
"label": "Technically Flawed"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,079,457,855,443,830,300
|
It's important to know the signs of a phishing message so you can safeguard your personal information. We've pulled together several examples we've seen recently and identified some warning signs in each.
Example 1: "Amazon" Refund Notification
Phishing email spoofing a message from Amazon.
One of the telltale signs of a phishing scam is poor grammar and spelling. In this example of a fake Amazon message, you'll notice punctuation errors like a run-on sentence and a missing period, as well odd spacing issues.
Before you click a link in an email, you should hover over the link and make sure it's going to a valid, secure site. In phishing messages, you'll often find links that claim they're going to a site you trust, but, upon further inspection, go to a different site.
Example 2: "IRS" Identity Verification
An email claiming to be from the IRS regarding identity verification.
Phishing emails play up a sense of urgency, and what could be more urgent than a message from the IRS? It's good to go over these high-profile and high-impact messages in detail. Here are the things we spotted in the email message above:
• The sender display name is "irs gov," which sounds right on the surface but may not be accurate. Instead of trusting the display name, mouse over and look at the sender's email address to make sure it matches.
• The actual IRS is not likely to send a message to "Dear Tax Payer." If they're sending you a notice — in this case, for missing information — they're going to send it to you, not a blanket addressee.
• Little typos can be a big giveaway. Often, phishing emails are littered with misspellings, along with errors in grammar or punctuation.
• Never click links that ask you to verify information. In this case, the IRS likely would have given you directions on where to go to update the information, so you can navigate to a secure site on your own.
Example 3: "Paypal" Account Suspension
An email claiming to be from "PayPal" in regards to a suspended account.
The target of a phishing email is your personal information — and, often, that means payment and banking information. This message, supposedly from PayPal, is a classic example. There are several clues, however, that this message is not legitimate.
• There are numerous grammar and spelling mistakes.
• The PayPal logo used is not styled like the official logo you'll find on PayPal's website.
• The link to "Update Your Information" seems designed to camouflage its true destination.
Example 4: "Google" Login Screen
Fake Google login screen
Phishing doesn't begin and end with emails. It's important to look at websites with the same scrutiny, particularly if the website has been linked from an email.
The above page spoofs Google's sign-in screen pretty well. The user interface seems familiar, and everything looks legitimate — until you notice the URL. In this case, what's in the browser bar isn't a URL at all. Instead, this "site" is really a computer file.
It's important always to look at the URL of a site and make sure it looks familiar. Additionally, any page that requests you to log in with a username and password should be a secure site, meaning it should start with "https://".
|
{
"url": "https://support.stedwards.edu/customer/en/portal/articles/2927020-spotting-a-phishing-attempt",
"source_domain": "support.stedwards.edu",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "91901",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FRPNCXN4PCCOJVZR4SGFYHTJQGM2TKFA",
"WARC-Concurrent-To": "<urn:uuid:479cb822-da31-4149-9871-04673cc8a1b3>",
"WARC-Date": "2019-08-21T21:22:15Z",
"WARC-IP-Address": "184.169.175.12",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JF5SEHDY2WAWHFCYSYJF4VRXWT5HOERS",
"WARC-Record-ID": "<urn:uuid:1924f43e-7f95-4389-99c9-ca4ec6ae55ca>",
"WARC-Target-URI": "https://support.stedwards.edu/customer/en/portal/articles/2927020-spotting-a-phishing-attempt",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5c489fef-579e-40f3-8d26-faa0a2996d9b>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-238.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,
206,
207,
247,
248,
295,
519,
520,
785,
786,
825,
826,
896,
897,
1136,
1351,
1556,
1697,
1909,
1910,
1949,
1950,
2023,
2024,
2274,
2328,
2424,
2518,
2519,
2552,
2553,
2578,
2579,
2742,
2743,
3006,
3007
],
"line_end_idx": [
206,
207,
247,
248,
295,
519,
520,
785,
786,
825,
826,
896,
897,
1136,
1351,
1556,
1697,
1909,
1910,
1949,
1950,
2023,
2024,
2274,
2328,
2424,
2518,
2519,
2552,
2553,
2578,
2579,
2742,
2743,
3006,
3007,
3237
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3237,
"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.41703376173973083,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011747430078685284,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17914831638336182,
"rps_doc_frac_unique_words": 0.44283121824264526,
"rps_doc_mean_word_length": 4.59528112411499,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.016953468322754,
"rps_doc_word_count": 551,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.018167460337281227,
"rps_doc_frac_chars_dupe_6grams": 0.018167460337281227,
"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.005924169905483723,
"rps_doc_frac_chars_top_3gram": 0.013033179566264153,
"rps_doc_frac_chars_top_4gram": 0.012638229876756668,
"rps_doc_books_importance": -276.8521423339844,
"rps_doc_books_importance_length_correction": -276.8521423339844,
"rps_doc_openwebtext_importance": -205.0230712890625,
"rps_doc_openwebtext_importance_length_correction": -205.0230712890625,
"rps_doc_wikipedia_importance": -143.1380157470703,
"rps_doc_wikipedia_importance_length_correction": -143.1380157470703
},
"fasttext": {
"dclm": 0.1046629473567009,
"english": 0.9186546206474304,
"fineweb_edu_approx": 1.8490736484527588,
"eai_general_math": 0.058594051748514175,
"eai_open_web_math": 0.1151997372508049,
"eai_web_code": 0.1768718957901001
}
}
|
{
"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": "363.25",
"labels": {
"level_1": "Social sciences",
"level_2": "Social service and Societies",
"level_3": "Political activists"
}
}
},
"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": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,765,643,059,946,175,000
|
I found the following code currently used on our website to match a url
expression. Unfortunately, when I added a question mark, the webpage that
contained the url with the question mark just "hung" and would not load into
my browser at all. Currently, the url links only up to the question mark.
Here's the url I'm trying to get to work:
http://www.thejakartapost.com/yesterdaydetail.asp?fileid=20011018.G07
Can you look at the code below and tell me what I'm doing wrong?
- Shawna
ORIGINAL CODE
// this will find web addresses and encapsulate each one in a standard
anchor
while(ereg("http://([\/~_\.0-9A-Za-z#&-]+)", $content, $match)){
$http_old = $match[0];
$http = "dubdubdub" . $match[1] . $match[2];
$url = "<A HREF=\"javascript:externalURL('$http')\";>$http</A>";
$content = ereg_replace($http_old, $url, $content);
};
$content = ereg_replace("dubdubdub", "http://";, $content);
CODE WITH QUESTION MARK
// this will find web addresses and encapsulate each one in a standard
anchor
while(ereg("http://([\/~_\.0-9A-Za-z#&-?]+)", $content, $match)){
$http_old = $match[0];
$http = "dubdubdub" . $match[1] . $match[2];
$url = "<A HREF=\"javascript:externalURL('$http')\";>$http</A>";
$content = ereg_replace($http_old, $url, $content);
};
$content = ereg_replace("dubdubdub", "http://";, $content);
--
PHP General Mailing List (http://www.php.net/)
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
To contact the list administrators, e-mail: [EMAIL PROTECTED]
Reply via email to
|
{
"url": "https://www.mail-archive.com/php-general@lists.php.net/msg38001.html",
"source_domain": "www.mail-archive.com",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "9616",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QC7AQO44PNHRHNVSD4D5IBZLCTNBYXEE",
"WARC-Concurrent-To": "<urn:uuid:94df16f4-96a3-42a1-a8a9-0f3a36776f91>",
"WARC-Date": "2018-04-24T01:36:12Z",
"WARC-IP-Address": "72.52.77.8",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:53WVFPPNTJJ2S35KSM4HWX7QZDM6C6RN",
"WARC-Record-ID": "<urn:uuid:fc0466ce-e2ca-481b-86d3-e83db2532167>",
"WARC-Target-URI": "https://www.mail-archive.com/php-general@lists.php.net/msg38001.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:680067c4-9f1d-44dc-b7c1-2e37657c5d2a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-228-166-67.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-17\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for April 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
72,
146,
223,
297,
298,
340,
410,
411,
477,
478,
487,
488,
489,
503,
504,
575,
582,
583,
648,
681,
734,
808,
873,
884,
885,
945,
946,
947,
971,
972,
1043,
1050,
1051,
1117,
1150,
1203,
1277,
1342,
1353,
1354,
1414,
1415,
1419,
1466,
1508,
1559,
1621,
1622
],
"line_end_idx": [
72,
146,
223,
297,
298,
340,
410,
411,
477,
478,
487,
488,
489,
503,
504,
575,
582,
583,
648,
681,
734,
808,
873,
884,
885,
945,
946,
947,
971,
972,
1043,
1050,
1051,
1117,
1150,
1203,
1277,
1342,
1353,
1354,
1414,
1415,
1419,
1466,
1508,
1559,
1621,
1622,
1640
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1640,
"ccnet_original_nlines": 48,
"rps_doc_curly_bracket": 0.0024390199687331915,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1848958283662796,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0677083283662796,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4322916567325592,
"rps_doc_frac_unique_words": 0.516853928565979,
"rps_doc_mean_word_length": 5.988763809204102,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.005208330228924751,
"rps_doc_unigram_entropy": 4.239138126373291,
"rps_doc_word_count": 178,
"rps_doc_frac_chars_dupe_10grams": 0.454033762216568,
"rps_doc_frac_chars_dupe_5grams": 0.454033762216568,
"rps_doc_frac_chars_dupe_6grams": 0.454033762216568,
"rps_doc_frac_chars_dupe_7grams": 0.454033762216568,
"rps_doc_frac_chars_dupe_8grams": 0.454033762216568,
"rps_doc_frac_chars_dupe_9grams": 0.454033762216568,
"rps_doc_frac_chars_top_2gram": 0.045028138905763626,
"rps_doc_frac_chars_top_3gram": 0.0534709207713604,
"rps_doc_frac_chars_top_4gram": 0.028142590075731277,
"rps_doc_books_importance": -167.10711669921875,
"rps_doc_books_importance_length_correction": -153.37939453125,
"rps_doc_openwebtext_importance": -79.88573455810547,
"rps_doc_openwebtext_importance_length_correction": -79.88573455810547,
"rps_doc_wikipedia_importance": -48.82826232910156,
"rps_doc_wikipedia_importance_length_correction": -36.21208953857422
},
"fasttext": {
"dclm": 0.06859003752470016,
"english": 0.6759281158447266,
"fineweb_edu_approx": 2.4367406368255615,
"eai_general_math": 0.479600191116333,
"eai_open_web_math": 0.2651224732398987,
"eai_web_code": 0.2383652925491333
}
}
|
{
"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": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "1",
"label": "Technically Flawed"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,546,283,570,107,897,000
|
SCCM Collections for Physical and Virtual machines
Computers that are running on virtual (Hyper-V or VMWare) will have an entry in win32_computersystem with attribute model in WMI.
You can create a collection to using table called SMS_G_System_COMPUTER_SYSTEM.
select SMS_R_SYSTEM.ResourceID,SMS_R_SYSTEM.ResourceType,SMS_R_SYSTEM.Name,SMS_R_SYSTEM.SMSUniqueIdentifier,
SMS_R_SYSTEM.ResourceDomainORWorkgroup,SMS_R_SYSTEM.Client from SMS_R_System
inner join SMS_G_System_COMPUTER_SYSTEM on
SMS_G_System_COMPUTER_SYSTEM.ResourceId = SMS_R_System.ResourceId
where SMS_G_System_COMPUTER_SYSTEM.Model like “%Virtual%”
To list all physical computers ,create another collection using operator not in from above collection like below:
select SMS_R_System.ResourceId, SMS_R_System.ResourceType, SMS_R_System.Name, SMS_R_System.SMSUniqueIdentifier, SMS_R_System.ResourceDomainORWorkgroup, SMS_R_System.Client from SMS_R_System where SMS_R_System.ResourceId not in (select SMS_R_SYSTEM.ResourceID from SMS_R_System inner join SMS_G_System_COMPUTER_SYSTEM on SMS_G_System_COMPUTER_SYSTEM.ResourceId = SMS_R_System.ResourceId where SMS_G_System_COMPUTER_SYSTEM.Model like “%Virtual%”)
|
{
"url": "https://wanderingpanda.net/2019/07/",
"source_domain": "wanderingpanda.net",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "29813",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FWO5ZTYA7E4OQKCBRSFPQF4YKJR57AVT",
"WARC-Concurrent-To": "<urn:uuid:a0348c47-b12c-426a-bbb5-e9f5e9495a67>",
"WARC-Date": "2021-04-13T18:50:55Z",
"WARC-IP-Address": "192.0.78.245",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VMYR2KOIL6AMASTQMY3SJVPH2IB3WDWO",
"WARC-Record-ID": "<urn:uuid:b9c8dcee-ad35-4b66-b708-4623407eda8a>",
"WARC-Target-URI": "https://wanderingpanda.net/2019/07/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b33b0358-281f-49cc-9edc-73b1591bc165>"
},
"warc_info": "isPartOf: CC-MAIN-2021-17\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-40.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
51,
52,
182,
183,
263,
264,
373,
450,
493,
559,
617,
618,
732,
733
],
"line_end_idx": [
51,
52,
182,
183,
263,
264,
373,
450,
493,
559,
617,
618,
732,
733,
1178
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1178,
"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.23636363446712494,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.060606058686971664,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2666666805744171,
"rps_doc_frac_unique_words": 0.625,
"rps_doc_mean_word_length": 10.03125,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.951390504837036,
"rps_doc_word_count": 96,
"rps_doc_frac_chars_dupe_10grams": 0.31152647733688354,
"rps_doc_frac_chars_dupe_5grams": 0.31152647733688354,
"rps_doc_frac_chars_dupe_6grams": 0.31152647733688354,
"rps_doc_frac_chars_dupe_7grams": 0.31152647733688354,
"rps_doc_frac_chars_dupe_8grams": 0.31152647733688354,
"rps_doc_frac_chars_dupe_9grams": 0.31152647733688354,
"rps_doc_frac_chars_top_2gram": 0.04361370950937271,
"rps_doc_frac_chars_top_3gram": 0.039460018277168274,
"rps_doc_frac_chars_top_4gram": 0.04776738956570625,
"rps_doc_books_importance": -91.01336669921875,
"rps_doc_books_importance_length_correction": -91.01336669921875,
"rps_doc_openwebtext_importance": -60.996604919433594,
"rps_doc_openwebtext_importance_length_correction": -60.81257629394531,
"rps_doc_wikipedia_importance": -59.20841598510742,
"rps_doc_wikipedia_importance_length_correction": -59.20841598510742
},
"fasttext": {
"dclm": 0.07337135076522827,
"english": 0.42647841572761536,
"fineweb_edu_approx": 1.607675313949585,
"eai_general_math": 0.5253525376319885,
"eai_open_web_math": 0.021021660417318344,
"eai_web_code": 0.9372565746307373
}
}
|
{
"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": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,918,243,125,016,074,000
|
Первое погружение в исходники хуков (задел на будущие статьи)
Привет, Хабр!
Чтобы писать более глубокие статьи и они не были бесконечными лонг ридами, я решил написать отдельную статью про исходники хуков, чтобы еще лучше понимать как они работают на самом деле и потом иметь возможность в следующих статьях ссылаться на эту (данная статья является расшифровкой видео).
Поиск исходников хуков
Для этого мы откроем репозиторий React-а в Github. Он представляет из себя монорепозиторий, где все известные нам пакеты лежат в packages. Ниже на скрине я выделил те самые пакеты, которые мы используем в ежедневной разработке:
В ней мы видим те самые репозитории, которые мы как пользователи импортируем себе в проект. Например мы видим пакет react-dom. Из которого мы импортируем метод render, для вставки React приложения в HTML.
import React from "react";
import ReactDOM from "react-dom";
import App from "./App";
ReactDOM.render(<App />, document.getElementById("root"));
Хуки же мы импортируем из пакета React. Соответственно такой package так же присутствует. Зайдем в него и откроем index.js файл.
export {
...
useCallback,
useContext,
useEffect,
...
__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED,
...
} from './src/React';
И действительно, здесь мы видим, как экспортируются хуки useCallback, useContext, useEffect. Из смешного, мне еще понравилась экспортируемая переменная “SECRET INTERNALS DO NOT USE OR YOU WILL BE FIRED”. Видимо у них так же есть технический долг, за который еще и уволить могут))) Экспортируется же все это из файла packages/react/src/React.js. Этот файл тоже занимается экспортом хуков из соседнего файла packages/react/src/ReactHooks.js. Именно в этом файле мы можем уже найти кое какую реализацию хуков:
export function useCallback<T>(
callback: T,
deps: Array<mixed> | void | null,
): T {
const dispatcher = resolveDispatcher();
return dispatcher.useCallback(callback, deps);
}
И действительно здесь useCallback получает те самые 2 параметра callback и deps, но это нам не сильно помогло, так как мы видим еще один слой абстракции в видео dispatcher и уже из него вызываем опять метод useCallback. Сам метод resolveDispatcher находится вверху этого файла:
import ReactCurrentDispatcher from './ReactCurrentDispatcher';
function resolveDispatcher() {
const dispatcher = ReactCurrentDispatcher.current;
invariant(
dispatcher !== null,
'Invalid hook call. Hooks can only be called inside of the body of a function component. This could happen for' +
' one of the following reasons:n' +
'1. You might have mismatching versions of React and the renderer (such as React DOM)n' +
'2. You might be breaking the Rules of Hooksn' +
'3. You might have more than one copy of React in the same appn' +
'See https://reactjs.org/link/invalid-hook-call for tips about how to debug and fix this problem.',
);
return dispatcher;
}
Все что он делает это извлекает какой-то dispatcher из переменной ReactCurrentDispatcher, который как мы видим импортится из соседнего файла с таким же именем. А если вас заинтересовал метод invariant, вот в документации про него рассказывают. А мы рассмотри файл packages/react/src/ReactCurrentDispatcher.js.
import type {Dispatcher} from 'react-reconciler/src/ReactInternalTypes';
/**
* Keeps track of the current dispatcher.
*/
const ReactCurrentDispatcher = {
/**
* @internal
* @type {ReactComponent}
*/
current: (null: null | Dispatcher),
};
И здесь нас ждет легкое разочарование, так как по факту этот current является просто свойством объекта и явно понять кто сетит значение в него достаточно сложно. Но есть подсказка. Тип данных которые сетятся в current имеет значение Dispatcher. И он импортится из соседнего пакета react-reconcilier.
Поэтому я перешел в пакет react-reconcilier и поискал по имени подходящий нам файл. И кажется таким файлом является packages/react-reconcilier/src/ReactFiberHooks.new.js. Использовав поиск по странице внутри и действительно обнаружился тот самый ReactCurrentDispatcher
import ReactSharedInternals from 'shared/ReactSharedInternals';
const {ReactCurrentDispatcher, ReactCurrentBatchConfig} = ReactSharedInternals;
Я проследил цепочку создания объекта ReactSharedInternals, чтобы понять действительно ли это тот самый ReactCurrentDispatcher. И обнаружил в файле packages/shared/ReactSharedInternals.js следующую картину :
import * as React from 'react';
const ReactSharedInternals =
React.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED;
export default ReactSharedInternals;
Да ReactSharedInternals это та самая смешная переменная “SECRET INTERNALS DO NOT USE OR YOU WILL BE FIRED”. И действительно если вы проследите эти исходники, то убедитесь, что она в себя включает, тот самый ReactCurrentDispatcher
Давайте лучше попробуем разобраться, что происходит с переменной ReactCurrentDispatcher в рамках файла packages/react-reconcilier/src/ReactFiberHooks.new.js.
if (__DEV__) {
if (current !== null && current.memoizedState !== null) {
ReactCurrentDispatcher.current = HooksDispatcherOnUpdateInDEV;
} else if (hookTypesDev !== null) {
// This dispatcher handles an edge case where a component is updating,
// but no stateful hooks have been used.
// We want to match the production code behavior (which will use HooksDispatcherOnMount),
// but with the extra DEV validation to ensure hooks ordering hasn't changed.
// This dispatcher does that.
ReactCurrentDispatcher.current = HooksDispatcherOnMountWithHookTypesInDEV;
} else {
ReactCurrentDispatcher.current = HooksDispatcherOnMountInDEV;
}
} else {
ReactCurrentDispatcher.current =
current === null || current.memoizedState === null
? HooksDispatcherOnMount
: HooksDispatcherOnUpdate;
}
В переменную ReactCurrentDispatcher.current присваивается много разных значений. Большинство значений имеют приставку InDEV, да и они все находятся в одном if блоке с проверкой на __DEV__ окружение. Поэтому лучше рассмотрим else секцию. Там мы видим тернарный оператор, который в зависимости от переменной ReactCurrentDispatcher.current присвоит HooksDispatcherOnMount или HooksDispatcherOnUpdate. Если мы перейдем посмотреть, что же такое HooksDispatcherOnMount мы увидим объект у которого методы совпадают с названиями хуков, но значения присваиваемые в эти свойства отличаются (ссылка на объект):
const HooksDispatcherOnMount: Dispatcher = {
useCallback: mountCallback,
useContext: readContext,
useEffect: mountEffect,
...
};
Немного ниже мы найдем HooksDispatcherOnUpdate, где свойства так же совпадают с именами хуков, а значения снова отличаются (ссылка на объект):
const HooksDispatcherOnUpdate: Dispatcher = {
useCallback: updateCallback,
useContext: readContext,
useEffect: updateEffect,
...
};
И это не единственные диспатчеры, их много в этом файле, но я бы сказал, что для продакнеша используются в основном эти 2, а остальные диспатчеры либо для dev режима, либо для каких то более специфических случаев.
Таким образом хотя бы из названий переменных мы можем предположить, утрированную версию как это работает на самом деле:
Допустим у нас есть простейший компонент с одним хуком useEffect. И когда мы первый раз рендерим этот компонент, подставляется HooksDispatcherOnMount.useEffect и соответственно вызывается метод mountEffect. Далее, при следующем рендере компонента, подставляется уже HooksDispatcherOnUpdate.useEffect и соответственно вызывается метод updateEffect.
Вот такая любопытная магия происходит в React. Вы используете один хук, а на самом деле, в зависимости от какого-либо скрытого от нас состояния приложения вам подсовывается разный метод.
Изучаем useCallback
Мы достаточно долго искали где хранятся исходники хуков, давайте уже рассмотрим саму функцию mountCallback.
function mountCallback<T>(callback: T, deps: Array<mixed> | void | null): T {
const hook = mountWorkInProgressHook();
const nextDeps = deps === undefined ? null : deps;
hook.memoizedState = [callback, nextDeps];
return callback;
}
Она по прежнему принимает 2 параметра callback и deps. В следующей строке из метода mountWorkInProgressHook() мы получаем какой-то hook, рассмотрим его немного позже. А пока перейдем к следующей строке, здесь если мы не прислали deps, значение превращается в null вместо undefined. И далее в вышеупомянутый hook в свойство memoizedState массивом сохраняются присланные параметры callback и deps. И в последней строке уже просто возвращается callback.
Даже общий осмотр этого метода мне показался понятным. mountCallback вызывается только при первом рендере компонента. А при первом рендере по факту нужно просто сохранить куда-то параметры, вот мы и получили какой-то хук, в который и сохранили все нужные данные для последующих рендеров, а после вернули callback, т.к. при первом рендере нечего больше возвращать, кроме как саму присланную функцию.
Давайте теперь рассмотрим функцию updateCallback:
function updateCallback<T>(callback: T, deps: Array<mixed> | void | null): T {
const hook = updateWorkInProgressHook();
const nextDeps = deps === undefined ? null : deps;
const prevState = hook.memoizedState;
if (prevState !== null) {
if (nextDeps !== null) {
const prevDeps: Array<mixed> | null = prevState[1];
if (areHookInputsEqual(nextDeps, prevDeps)) {
return prevState[0];
}
}
}
hook.memoizedState = [callback, nextDeps];
return callback;
}
Она конечно же, так же принимает 2 параметра callback и deps. В следующей строке, уже из метода updateWorkInProgressHook() получаем hook, подозреваю, что это тот самый инстанс хука, с которым мы взаимодействовали в функции mountCallback. Далее снова превращаем undefined зависимости в null.
И следующая строка уже более интересная. В функции mountCallback мы сохраняли callback и deps в свойство memoizedState объекта hook:
function mountCallback<T>(...): T {
...
hook.memoizedState = [callback, nextDeps];
...
}
А сейчас извлекаем значения и далее проверяем сохранили ли мы в него что-нибудь ранее prevState !== null. В следующей строке nextDeps !== null проверяем, прислали ли нам зависимости в текущей итерации . И если все условия соблюдены, наконец то можем извлечь зависимости с одной из предыдущих итераций const prevDeps = prevState[1] и сравнить его значение с зависимостями текущей итерации areHookInputsEqual(nextDeps, prevDeps). И если зависимости по какому то правилу сравнения совпадают, значит можно вернуть функцию из предыдущих итераций return prevState[0].
А если же хоть одно условие не выполнилось, тогда просто перезаписываем данные hook.memoizedState = [callback, nextDeps] . И возвращаем немемоизированный callback, а присланный в текущей итерации.
Думаю общую идею как работает хук useCallback вы уловили. Более того, мы ее обсуждали ранее в выпуске “Что вы знаете о useCallback?”. Где мы писали свою версию имплементации useCallback. Но для меня как всегда интересны детали. А в этом хуке мы не раскрыли, что же такое этот объект hook, и как на самом деле сравниваются зависимости.
Изучаем функцию сравнения зависимостей
Начнем с простого, функция areHookInputsEqual сравнивает зависимости, находится в этом же файле:
function areHookInputsEqual(
nextDeps: Array<mixed>,
prevDeps: Array<mixed> | null,
) {
...
if (prevDeps === null) {
return false;
}
...
for (let i = 0; i < prevDeps.length && i < nextDeps.length; i++) {
if (is(nextDeps[i], prevDeps[i])) {
continue;
}
return false;
}
return true;
}
Она принимает 2 массива зависимостей. И точками (...) я сократил блоки для дев окружения (__DEV__). И самое интересное. Мы видим for, который итерирует элементы массива, до того момента, пока хотя бы в одном из массивов зависимостей не закончатся элементы. Таким образом следующие зависимости могут будут равны:
[user, book, author] === [user, book]
Поэтому лучше не экспериментировать с динамической длинной зависимостей, а всегда удерживать место под объект:
// плохо
const deps = [props.user, props.book]
if (hasAuthor) {
deps.push(props.author);
}
// [user, book, author] === [user, book]
// хорошо
const deps = [props.user, props.book, hasAuthor ? props.author : null];
// [user, book, author] !== [user, book, null]
Далее функцией is(nextDeps[i], prevDeps[i]) сравниваем значения элементов в массивах, если они равны то идем к следующей итерации. Здесь из интересного, то что мы сравниваем i-ый элемент одного массива с i-ым элементов второго, а это значит, что важно сохранять порядок элементов в массивах между рендерами, иначе вы потеряете мемоизацию:
[user, book, author] !== [user, author, book]
Осталось только посмотреть, что из себя представляет функция is. Она импортируется из packages/shared/objectIs.js:
function is(x: any, y: any) {
return (
(x === y && (x !== 0 || 1 / x === 1 / y)) || (x !== x && y !== y)
);
}
const objectIs: (x: any, y: any) => boolean =
typeof Object.is === 'function' ? Object.is : is;
export default objectIs;
Здесь мы видим, что для сравнения используется браузерное API Object.is (MDN) и если вдруг по какой то причине, такой метод не существует, подставляется полифил.
Какие еще выводы можно сделать из увиденного, по факту в массив зависимостей мы привыкли добавлять в основном какие-то props верхнего уровня.
useEffect(() => {
...
}, [props.user]);
Но судя по коду, нам никто не мешает добавить в зависимости, какое-то глубокое свойство например props.book.author.id, или если вы не уверены в существовании объекта, использовать амперсанды или вообще тернарный оператор:
useEffect(() => {
...
}, [
props.book.author.id,
props.selectedBooks && props.selectedBooks.id,
props.book.isFavorite ? props.book : null,
]);
Но еще из любопытного, можно вставлять и совсем не props, например ref или же вообще какой-нибудь window.location.pathname:
useEffect(() => {
...
}, [
scrollRef.current,
window.location.pathname,
]);
Никаких ограничений, что именно передавать не существует, существует лишь проверка с помощью Object.is, которой вы можете самостоятельно даже в браузерной консоли сравнить зависимости и решить стоит их добавлять или нет.
Изучаем mountWorkInProgressHook()
Осталось только исследовать последний момент, это методы mountWorkInProgressHook(), updateWorkInProgressHook(). Рассмотрим внутренности первого метода:
function mountWorkInProgressHook(): Hook {
const hook: Hook = {
memoizedState: null,
baseState: null,
baseQueue: null,
queue: null,
next: null,
};
if (workInProgressHook === null) {
// This is the first hook in the list
currentlyRenderingFiber.memoizedState = workInProgressHook = hook;
} else {
// Append to the end of the list
workInProgressHook = workInProgressHook.next = hook;
}
return workInProgressHook;
}
Здесь мы видим создание самого объекта hook, первое свойство объекта memoizedState нам уже известно, там мы храним данные между рендерами. С остальными полями нам еще предстоит познакомиться в будущем.
В следующих строках мелькает какая-то глобальная переменная workInProgressHook. Она инициализируются вверху файла и изначально равна null.
// Hooks are stored as a linked list on the fiber's memoizedState field. The
// current hook list is the list that belongs to the current fiber. The
// work-in-progress hook list is a new list that will be added to the
// work-in-progress fiber.
let currentHook: Hook | null = null;
let workInProgressHook: Hook | null = null;
Далее (см. код ниже) мы видим, если workInProgressHook все еще равен null, тогда сперва мы вновь созданный объект hook присваиваем в workInProgressHook. И тот же hook сохраняем в переменную currentlyRenderingFiber.memoizedState. И осталось вернуть тот самый workInProgressHook:
function mountWorkInProgressHook(): Hook {
...
if (workInProgressHook === null) {
workInProgressHook = hook;
currentlyRenderingFiber.memoizedState = hook;
} else {
...
}
return workInProgressHook;
}
Для второго хука, глобальная переменная workInProgressHook уже равен не null, а ссылка на предыдущий хук. И вновь созданный объект hook сохраняется уже в поле workInProgressHook.next. И далее перезаписывается значение переменной workInProgressHook.
function mountWorkInProgressHook(): Hook {
...
if (workInProgressHook === null) {
...
} else {
workInProgressHook.next = hook;
workInProgressHook = hook;
}
return workInProgressHook;
}
Из этой информации уже вырисовывается определенная картина. При использовании 8 хуков список выглядит примерно следующим образом:
Таким образом из 8 хуков строится длинная цепочка, где currentlyRenderingFiber.memoizedState указывает на первый хук, а workInProgressHook указывает на последний хук. Называется такой список Linked List.
То что мы описали выше – это лишь первый рендер, как вы знаете в рамках одного компонента количество хуков меняться не может, поэтому эта цепочка будет жить вплоть до конца жизни компонента, но сам метод updateWorkInProgressHook немного сложнее, он ссылается на Linked List то из текущего рендера, то из предыдущего, но суть примерная такая же. Оставлю рассмотрение этого метода на самостоятельное изучение.
Итоги
Этой статьей я хотел показать вам, где хранится код от хуков. Показать, что между рендарами мы работаем с одним и тем же инстансом хука (или его клоном), который создается с помощью mountWorkInProgressHook() и потом возвращается на каждой итерации из updateWorkInProgressHook(). И как видите там нет никакой магии, местами даже код крайне примитивный.
Как я и говорил в начале, эта статья – база. На нее можно будет ссылаться в следующих статьях, чтобы меньше разъяснять в процессе раскрытия другой темы. Поэтому не судите строго 😉
А если Вам нравится, то что мы делаем, можете нас поддержать здесь
Чао!
Let’s block ads! (Why?)
Read More
Добавить комментарий
Ваш адрес email не будет опубликован. Обязательные поля помечены *
|
{
"url": "https://web-center.su/%D0%BF%D0%B5%D1%80%D0%B2%D0%BE%D0%B5-%D0%BF%D0%BE%D0%B3%D1%80%D1%83%D0%B6%D0%B5%D0%BD%D0%B8%D0%B5-%D0%B2-%D0%B8%D1%81%D1%85%D0%BE%D0%B4%D0%BD%D0%B8%D0%BA%D0%B8-%D1%85%D1%83%D0%BA%D0%BE%D0%B2-%D0%B7/",
"source_domain": "web-center.su",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "86300",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JIE5GDXEZHF4EMAXNJ4HIGJXG735H3JP",
"WARC-Concurrent-To": "<urn:uuid:afb64c21-58ed-4f2f-b03e-0c1890304e08>",
"WARC-Date": "2022-12-08T14:08:34Z",
"WARC-IP-Address": "172.67.129.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6DOFUMQO2KZUINWTQC4EKJBFI3G2MSK3",
"WARC-Record-ID": "<urn:uuid:e9c9ce85-1941-46af-9fb8-c93f63e8bf10>",
"WARC-Target-URI": "https://web-center.su/%D0%BF%D0%B5%D1%80%D0%B2%D0%BE%D0%B5-%D0%BF%D0%BE%D0%B3%D1%80%D1%83%D0%B6%D0%B5%D0%BD%D0%B8%D0%B5-%D0%B2-%D0%B8%D1%81%D1%85%D0%BE%D0%B4%D0%BD%D0%B8%D0%BA%D0%B8-%D1%85%D1%83%D0%BA%D0%BE%D0%B2-%D0%B7/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2d2cb756-b14c-41a8-a516-8f8deae02405>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-177\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,
62,
63,
77,
78,
372,
373,
396,
397,
625,
626,
831,
832,
859,
893,
894,
919,
920,
979,
980,
1109,
1110,
1119,
1125,
1140,
1154,
1167,
1173,
1227,
1233,
1255,
1256,
1763,
1764,
1796,
1811,
1847,
1854,
1896,
1945,
1947,
1948,
2227,
2228,
2291,
2292,
2323,
2376,
2389,
2414,
2532,
2574,
2670,
2725,
2798,
2904,
2909,
2930,
2932,
2933,
3243,
3244,
3317,
3318,
3322,
3364,
3368,
3401,
3407,
3422,
3450,
3456,
3494,
3497,
3498,
3798,
3799,
4068,
4069,
4133,
4134,
4214,
4215,
4422,
4423,
4455,
4456,
4485,
4545,
4546,
4583,
4584,
4814,
4815,
4973,
4974,
4989,
5049,
5116,
5154,
5229,
5274,
5368,
5450,
5484,
5563,
5574,
5640,
5644,
5653,
5688,
5743,
5774,
5807,
5809,
5810,
6410,
6411,
6456,
6486,
6513,
6539,
6545,
6548,
6549,
6692,
6693,
6739,
6770,
6797,
6824,
6830,
6833,
6834,
7048,
7049,
7169,
7170,
7518,
7519,
7706,
7707,
7727,
7728,
7836,
7837,
7915,
7957,
8010,
8055,
8074,
8076,
8077,
8528,
8529,
8928,
8929,
8979,
8980,
9059,
9102,
9155,
9195,
9223,
9252,
9310,
9362,
9391,
9399,
9405,
9409,
9454,
9473,
9475,
9476,
9767,
9768,
9901,
9902,
9938,
9944,
9989,
9995,
9997,
9998,
10560,
10561,
10758,
10759,
11094,
11095,
11134,
11135,
11232,
11233,
11262,
11288,
11321,
11325,
11331,
11332,
11359,
11377,
11381,
11382,
11388,
11391,
11460,
11500,
11516,
11522,
11540,
11544,
11559,
11561,
11562,
11874,
11875,
11913,
11914,
12025,
12026,
12035,
12073,
12074,
12091,
12118,
12120,
12121,
12162,
12163,
12173,
12174,
12246,
12247,
12294,
12295,
12634,
12635,
12681,
12682,
12797,
12798,
12828,
12839,
12909,
12914,
12916,
12917,
12963,
13015,
13016,
13041,
13042,
13204,
13205,
13347,
13348,
13366,
13372,
13390,
13391,
13613,
13614,
13632,
13638,
13643,
13667,
13716,
13761,
13765,
13766,
13890,
13891,
13909,
13915,
13920,
13941,
13969,
13973,
13974,
14195,
14196,
14230,
14231,
14383,
14384,
14427,
14450,
14475,
14476,
14497,
14518,
14535,
14536,
14552,
14557,
14558,
14595,
14637,
14708,
14719,
14756,
14813,
14817,
14846,
14848,
14849,
15051,
15052,
15191,
15192,
15269,
15341,
15411,
15438,
15475,
15519,
15520,
15798,
15799,
15842,
15848,
15849,
15886,
15917,
15967,
15978,
15986,
15990,
15991,
16020,
16022,
16023,
16272,
16273,
16316,
16322,
16323,
16360,
16368,
16379,
16415,
16446,
16450,
16453,
16482,
16484,
16485,
16615,
16616,
16820,
16821,
17229,
17230,
17236,
17237,
17589,
17590,
17770,
17771,
17838,
17839,
17844,
17845,
17869,
17870,
17880,
17881,
17902,
17903
],
"line_end_idx": [
62,
63,
77,
78,
372,
373,
396,
397,
625,
626,
831,
832,
859,
893,
894,
919,
920,
979,
980,
1109,
1110,
1119,
1125,
1140,
1154,
1167,
1173,
1227,
1233,
1255,
1256,
1763,
1764,
1796,
1811,
1847,
1854,
1896,
1945,
1947,
1948,
2227,
2228,
2291,
2292,
2323,
2376,
2389,
2414,
2532,
2574,
2670,
2725,
2798,
2904,
2909,
2930,
2932,
2933,
3243,
3244,
3317,
3318,
3322,
3364,
3368,
3401,
3407,
3422,
3450,
3456,
3494,
3497,
3498,
3798,
3799,
4068,
4069,
4133,
4134,
4214,
4215,
4422,
4423,
4455,
4456,
4485,
4545,
4546,
4583,
4584,
4814,
4815,
4973,
4974,
4989,
5049,
5116,
5154,
5229,
5274,
5368,
5450,
5484,
5563,
5574,
5640,
5644,
5653,
5688,
5743,
5774,
5807,
5809,
5810,
6410,
6411,
6456,
6486,
6513,
6539,
6545,
6548,
6549,
6692,
6693,
6739,
6770,
6797,
6824,
6830,
6833,
6834,
7048,
7049,
7169,
7170,
7518,
7519,
7706,
7707,
7727,
7728,
7836,
7837,
7915,
7957,
8010,
8055,
8074,
8076,
8077,
8528,
8529,
8928,
8929,
8979,
8980,
9059,
9102,
9155,
9195,
9223,
9252,
9310,
9362,
9391,
9399,
9405,
9409,
9454,
9473,
9475,
9476,
9767,
9768,
9901,
9902,
9938,
9944,
9989,
9995,
9997,
9998,
10560,
10561,
10758,
10759,
11094,
11095,
11134,
11135,
11232,
11233,
11262,
11288,
11321,
11325,
11331,
11332,
11359,
11377,
11381,
11382,
11388,
11391,
11460,
11500,
11516,
11522,
11540,
11544,
11559,
11561,
11562,
11874,
11875,
11913,
11914,
12025,
12026,
12035,
12073,
12074,
12091,
12118,
12120,
12121,
12162,
12163,
12173,
12174,
12246,
12247,
12294,
12295,
12634,
12635,
12681,
12682,
12797,
12798,
12828,
12839,
12909,
12914,
12916,
12917,
12963,
13015,
13016,
13041,
13042,
13204,
13205,
13347,
13348,
13366,
13372,
13390,
13391,
13613,
13614,
13632,
13638,
13643,
13667,
13716,
13761,
13765,
13766,
13890,
13891,
13909,
13915,
13920,
13941,
13969,
13973,
13974,
14195,
14196,
14230,
14231,
14383,
14384,
14427,
14450,
14475,
14476,
14497,
14518,
14535,
14536,
14552,
14557,
14558,
14595,
14637,
14708,
14719,
14756,
14813,
14817,
14846,
14848,
14849,
15051,
15052,
15191,
15192,
15269,
15341,
15411,
15438,
15475,
15519,
15520,
15798,
15799,
15842,
15848,
15849,
15886,
15917,
15967,
15978,
15986,
15990,
15991,
16020,
16022,
16023,
16272,
16273,
16316,
16322,
16323,
16360,
16368,
16379,
16415,
16446,
16450,
16453,
16482,
16484,
16485,
16615,
16616,
16820,
16821,
17229,
17230,
17236,
17237,
17589,
17590,
17770,
17771,
17838,
17839,
17844,
17845,
17869,
17870,
17880,
17881,
17902,
17903,
17969
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 17969,
"ccnet_original_nlines": 370,
"rps_doc_curly_bracket": 0.004340809769928455,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0532342903316021,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024760140106081963,
"rps_doc_frac_lines_end_with_ellipsis": 0.043126679956912994,
"rps_doc_frac_no_alph_words": 0.7332095503807068,
"rps_doc_frac_unique_words": 0.4034038484096527,
"rps_doc_mean_word_length": 6.451702117919922,
"rps_doc_num_sentences": 220,
"rps_doc_symbol_to_word_ratio": 0.005571030080318451,
"rps_doc_unigram_entropy": 6.191326141357422,
"rps_doc_word_count": 2174,
"rps_doc_frac_chars_dupe_10grams": 0.007272209972143173,
"rps_doc_frac_chars_dupe_5grams": 0.05447027087211609,
"rps_doc_frac_chars_dupe_6grams": 0.04398972913622856,
"rps_doc_frac_chars_dupe_7grams": 0.032011978328228,
"rps_doc_frac_chars_dupe_8grams": 0.018964780494570732,
"rps_doc_frac_chars_dupe_9grams": 0.014259230345487595,
"rps_doc_frac_chars_top_2gram": 0.004990729968994856,
"rps_doc_frac_chars_top_3gram": 0.004634249955415726,
"rps_doc_frac_chars_top_4gram": 0.005133320111781359,
"rps_doc_books_importance": -1577.426025390625,
"rps_doc_books_importance_length_correction": -1577.426025390625,
"rps_doc_openwebtext_importance": -931.9268188476562,
"rps_doc_openwebtext_importance_length_correction": -931.9268188476562,
"rps_doc_wikipedia_importance": -793.0908203125,
"rps_doc_wikipedia_importance_length_correction": -793.0908203125
},
"fasttext": {
"dclm": 0.9080501198768616,
"english": 0.001035840017721057,
"fineweb_edu_approx": 2.1213765144348145,
"eai_general_math": 0.00011110000195913017,
"eai_open_web_math": 0.13604331016540527,
"eai_web_code": 0.9473117589950562
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,490,989,150,799,037,000
|
Slow ethernet speeds
• Hi,
My nas is up and running however it is running at stupidly slow speeds, around 10 megabytes read and write when using a 10 gigabyte file (not multiple smaller files although I have the same problem when I try and transfer lots of small files).
The nas has a 1 gigabit ethernet connection as does my computer which should mean I get around 100+ megabytes of speed.
For the purpose of the test I am using RAID 0 (software through openmediavault) The drives when plugged into my computer get around 60-70 megabytes read and write which should give me over a 100 megabyte read and write when in RAID 0 and over ethernet, however it does not.
If you have any further questions about my nas please ask and as I am new to all of this please use simple and descriptive terms.
Thank you
• Hi, hope to be of help.
Which hardware is connecting both devices, a router or switch? Which model exactly?
NOW:
Mac mini Late 2012 / macOS Catalina / Docker Desktop for Mac
Intel Core i7-3615QM CPU @ 2.30GHz - 16GB RAM - 4 external disks via USB3.0 - Gigabit Ethernet - 20 docker containers via docker-compose ;)
PREVIOUS:
omv 5.2.1-1 (Usul) - Bevy NUC thanks to TechnoDadLife (NUC5CPYB)
Celeron N3050 @ 1.60GHz - 8GB RAM - 2 external disks via USB3.0 - Gigabit Ethernet - 21 docker containers via docker-compose :)
• I am afraid we need a lot more information if you want to get help.
What kind of hardware is the NAS running on?
What kind of drives are we talking about?
How are the drives connected to the NAS?
How do you share the filesystem? Cifs or nfs?
The next step is to test drive and network seperated. Do you know how to use the shell on the nas?
iperf for network and iozone for drive benchmarks would be a good way to start.
• The nas has a 1 gigabit ethernet connection as does my computer which should mean I get around 100+ megabytes of speed
Not if there's something in between that is limited to Fast Ethernet (100 Mbits/sek). You need to look at the whole data path as already suggested and of course you need to include network cables as well (if they've just 2 cable pairs or are damaged then they're 'downgrading' the connection to Fast Ethernet already).
• Exactly, knowing first what hardware is connecting both ends of the transfer, be it a router or switch, and cables is very important in this situation.
Even though the Network Cards on the computers may be 1Gb, if the central piece is 100Mbps, it till run at 100Mbps anyways.
Tell us more about what connects both ends of the transfer to help you sir. :)
NOW:
Mac mini Late 2012 / macOS Catalina / Docker Desktop for Mac
Intel Core i7-3615QM CPU @ 2.30GHz - 16GB RAM - 4 external disks via USB3.0 - Gigabit Ethernet - 20 docker containers via docker-compose ;)
PREVIOUS:
omv 5.2.1-1 (Usul) - Bevy NUC thanks to TechnoDadLife (NUC5CPYB)
Celeron N3050 @ 1.60GHz - 8GB RAM - 2 external disks via USB3.0 - Gigabit Ethernet - 21 docker containers via docker-compose :)
• Hi, hope to be of help.
Which hardware is connecting both devices, a router or switch? Which model exactly?
A router is connecting both devices. It is connected through cat 6 cables (I upgraded all the cables and since my original post however capping but it is now a little higher at around 30 megabytes per second) My router is the plusnet hub 1 which I believe is based off the bt home hub 5 (which is capable of 1 gigabit speeds) however I have also tried the ASUS RT-AC66U which a friend loaned us and we still faced the same problem.
Your NAS and PC have GbEthernet.
What about your SBC (single-board computer)?
In case you have a Raspberry Pi 3 here is a brief overview about it’s bottlenecks.
For the NAS we are using an old computer rather than a single board computer. The computer (Dell Optiplex 780 small form factor) has a 1 Gigabit ethernet port attached so I do not believe we are being bottlenecked and for the computer we are using a 2017 imac 5k (which has a gigabit ethernet port built in) although we have tried other computers with little success.
As I said earlier the pc is the Dell Optiplex 780 small form factor)
CPU: Intel® Pentium® Processor E5500 @ 2.80 GHz
Inbuilt graphics (no idea what)
4 gigabytes of DDR3 RAM running at 1066 mhz
The operating system is running off an 120GB SSD
3x500 gb Seagate ST3500312CS (I know these are not meant for a nas and will most likely die however I am just testing the nas at the moment and trying to iron out any problems we may face such as this). The drives run at about 60-70 megabytes each when we tested them so in RAID 0 they should give us over 100 megabytes a second which is what I am looking for.
The drives are connected via SATA II (which although not great is capable of around 300 megabytes so is fine for our needs)
The filesystem is being shared through SMB/CIFS
I ran an iperf test. I have attached the results at the bottom of the page.
Not if there's something in between that is limited to Fast Ethernet (100 Mbits/sek). You need to look at the whole data path as already suggested and of course you need to include network cables as well (if they've just 2 cable pairs or are damaged then they're 'downgrading' the connection to Fast Ethernet already).
I do not believe anything is limiting it to 100 mbits/sec as the the nas is connected directly by cat 6 to the router which is connected by cat 6 to my imac and like I said earlier I have bought all new cables and replaced them. I am only using short cables 2-3m so there is no chance of the signal being degraded.
Hopefully I have answered all the questions and if you have any ideas please let me know. I have also reinstalled openmediavault since posting this in case I had done something wrong or something had bugged out.
Screenshot 2019-05-11 at 15.49.37.png
• If you transmit tcp, maybe look at netstat - s, and see if there is a loss rate.
Iperf is benchmarking the network connection, so its completly independent of the hdds.
The pc you connect with, does it have a usb ethernet interface?
Edit: did not the its an imac. So it clearly looks like something broken in your network.
If you got a laptop, connect it directly to the nas and measure with iperf. Than go to the next part on the way to your mac until speeds drop.
• The iperf test shows clearly that ethernet is the limiting factor. So now we know at what to look at.
The results also show that its not fast ethernet but gbit, it clearly looks like something like a bad cable, bad isolation or something like that.
I believed it was also a bad cable which is why I have replaced all my cables (only two) to cat 6 (I did this since I have posted as I said earlier it changed speeds from around 10 megabytes to about 30 megabytes) cat6 should be able to provide more then enough bandwidth if you want I can replace them again.
If you transmit tcp, maybe look at netstat - s, and see if there is a loss rate.
Iperf is benchmarking the network connection, so its completly independent of the hdds.
The pc you connect with, does it have a usb ethernet interface?
Edit: did not the its an imac. So it clearly looks like something broken in your network.
If you got a laptop, connect it directly to the nas and measure with iperf. Than go to the next part on the way to your mac until speeds drop.
Im very sorry however as i am new I have been following a guide to doing the iperf test I currently just enter
iperf -c 192.168.1.78 -P 1 -i 10 -p 5001 -f M -t 60
and it works so if you could send me the iperf command you want me to do then i can enter it.
The pc (nas) im using has a built in gigabit ethernet (soldered to the motherboard not plugged in by usb) as I said before Im not too sure what you are asking but I think I have answered, and if you mean the pc Im using to connect to the nas then it has a gigabit ethernet port built in(not over usb)
I have a laptop however I am not sure how I would connect it to the nas so if you could roughly explain or link me to a guide that would be great.
• Hi
Have you tried to reboot all you LAN (router(s), server, PC) ?
Sometimes I have the same problem and it fix it, specially the ISP router (SFR 4K box, firmware made with the feet like we said in france :whistling::thumbdown: ) and my small switch netgear, not expensive but do his job since 10 years, but sometimes it need 5 minutes of holidays.
Participate now!
Don’t have an account yet? Register yourself now and be a part of our community!
|
{
"url": "https://forum.openmediavault.org/index.php?thread/27224-slow-ethernet-speeds/",
"source_domain": "forum.openmediavault.org",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "139616",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PB6BFQYGWV3X6ERWMYGUAZIKOL6WDJDX",
"WARC-Concurrent-To": "<urn:uuid:4743c6e8-9ee1-43ad-ab8d-d38189298be7>",
"WARC-Date": "2020-04-06T08:23:07Z",
"WARC-IP-Address": "178.254.11.33",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KTMWMWM3B4G7P33RLC6A2JPLHMS6CYWU",
"WARC-Record-ID": "<urn:uuid:ea582886-55db-46d5-a8c2-feda610765bb>",
"WARC-Target-URI": "https://forum.openmediavault.org/index.php?thread/27224-slow-ethernet-speeds/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fc059408-3944-4463-b707-0fb8c086ca2b>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-212.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
21,
22,
30,
31,
32,
280,
281,
282,
406,
407,
408,
686,
687,
688,
822,
823,
824,
838,
839,
867,
868,
869,
957,
958,
967,
1032,
1176,
1190,
1259,
1391,
1392,
1464,
1513,
1559,
1604,
1654,
1757,
1841,
1842,
1965,
1966,
2289,
2290,
2446,
2447,
2448,
2576,
2577,
2578,
2661,
2662,
2671,
2736,
2880,
2894,
2963,
3095,
3096,
3124,
3125,
3126,
3214,
3215,
3651,
3652,
3689,
3690,
3691,
3740,
3741,
3742,
3829,
3830,
4202,
4203,
4204,
4277,
4329,
4365,
4413,
4466,
4467,
4468,
4833,
4834,
4835,
4963,
4964,
4965,
5017,
5018,
5019,
5099,
5100,
5101,
5424,
5425,
5744,
5745,
5746,
5747,
5963,
5964,
5965,
6007,
6008,
6093,
6185,
6253,
6347,
6348,
6349,
6496,
6497,
6603,
6754,
6755,
7069,
7070,
7071,
7072,
7157,
7249,
7317,
7411,
7412,
7413,
7560,
7561,
7676,
7677,
7678,
7734,
7735,
7736,
7834,
7835,
7836,
8141,
8142,
8143,
8294,
8295,
8302,
8369,
8655,
8656,
8673,
8674
],
"line_end_idx": [
21,
22,
30,
31,
32,
280,
281,
282,
406,
407,
408,
686,
687,
688,
822,
823,
824,
838,
839,
867,
868,
869,
957,
958,
967,
1032,
1176,
1190,
1259,
1391,
1392,
1464,
1513,
1559,
1604,
1654,
1757,
1841,
1842,
1965,
1966,
2289,
2290,
2446,
2447,
2448,
2576,
2577,
2578,
2661,
2662,
2671,
2736,
2880,
2894,
2963,
3095,
3096,
3124,
3125,
3126,
3214,
3215,
3651,
3652,
3689,
3690,
3691,
3740,
3741,
3742,
3829,
3830,
4202,
4203,
4204,
4277,
4329,
4365,
4413,
4466,
4467,
4468,
4833,
4834,
4835,
4963,
4964,
4965,
5017,
5018,
5019,
5099,
5100,
5101,
5424,
5425,
5744,
5745,
5746,
5747,
5963,
5964,
5965,
6007,
6008,
6093,
6185,
6253,
6347,
6348,
6349,
6496,
6497,
6603,
6754,
6755,
7069,
7070,
7071,
7072,
7157,
7249,
7317,
7411,
7412,
7413,
7560,
7561,
7676,
7677,
7678,
7734,
7735,
7736,
7834,
7835,
7836,
8141,
8142,
8143,
8294,
8295,
8302,
8369,
8655,
8656,
8673,
8674,
8754
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8754,
"ccnet_original_nlines": 149,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44540542364120483,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05189188942313194,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1827027052640915,
"rps_doc_frac_unique_words": 0.308038592338562,
"rps_doc_mean_word_length": 4.218649387359619,
"rps_doc_num_sentences": 85,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.523705005645752,
"rps_doc_word_count": 1555,
"rps_doc_frac_chars_dupe_10grams": 0.33521342277526855,
"rps_doc_frac_chars_dupe_5grams": 0.3722561001777649,
"rps_doc_frac_chars_dupe_6grams": 0.3528963327407837,
"rps_doc_frac_chars_dupe_7grams": 0.33521342277526855,
"rps_doc_frac_chars_dupe_8grams": 0.33521342277526855,
"rps_doc_frac_chars_dupe_9grams": 0.33521342277526855,
"rps_doc_frac_chars_top_2gram": 0.009146340191364288,
"rps_doc_frac_chars_top_3gram": 0.006097559817135334,
"rps_doc_frac_chars_top_4gram": 0.012804879806935787,
"rps_doc_books_importance": -624.851318359375,
"rps_doc_books_importance_length_correction": -624.851318359375,
"rps_doc_openwebtext_importance": -423.9088134765625,
"rps_doc_openwebtext_importance_length_correction": -423.9088134765625,
"rps_doc_wikipedia_importance": -305.3106994628906,
"rps_doc_wikipedia_importance_length_correction": -305.3106994628906
},
"fasttext": {
"dclm": 0.040364090353250504,
"english": 0.9472404718399048,
"fineweb_edu_approx": 1.7127132415771484,
"eai_general_math": 0.6647805571556091,
"eai_open_web_math": 0.32297009229660034,
"eai_web_code": 0.26207518577575684
}
}
|
{
"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": "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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,926,364,062,494,837,000
|
Creating dashboards in Insights (Professional and Enterprise) Follow
Comments
8 comments
• Avatar
Alberto Aznar César (Edited )
Hi!,
I created a dropdown ticket field, with a few values, like the default field "type".
I need to create a report about how many tickets are solved on this values.
For example, how many tickets are solved on "incident", how many on "question"... but with my own values.
How I can do this? I need help.
• Avatar
Jessie - Community Manager
Hi Alberto!
Once solved tickets exist with values in that field, that data will automatically sync over to Insights and you can create a report with it. You can find more detailed information on how to do this here: Reporting on custom fields in Insights (Professional and Enterprise).
• Avatar
Johanne
I have created a dashboard I want to share with everyone in a Microsoft group but when I embed the link supplied, it asks for a Zendesk Analytics sign-in. My intention is to share the dashboard in that group without them having to do this login. Can you help please?
• Avatar
Heather R
The way I understand it, you have to be an Agent or Light Agent on Zendesk AND have activated the Insights page AND sign in to see the reports....
I get around this by sending as a pdf via email (I'm on Enterprise, not sure if that makes a difference) with pdf to the interested parties.
I hope that helps!
• Avatar
Johanne
Not really but thanks anyways.
• Avatar
Heather
We got really excited about the ability to embed dashboards into a webpage, but it's absolutely pointless if it can only be accessed behind a login for agents. It would be a great tool to share and "toot our own horns" so that our actual stats are visible to our end users/coworkers/non-it superiors. Why the login? Folks get enough emails as it is. Email reports is not ideal.
• Avatar
Leigh Cohen
I am creating a dashboard(s) for a multi-brand instance. I would like each brand to have the same dashboard. I have been creating the same report twice and then adding the relevant reports to the relevant dashboards. Is it possible for me to create one dashboad and then use a filter by brand? If so, when I choose "Ticket Brand" as the filter option, I see two options but they are numbers, not the names of the brands. Any suggestions?
Thanks!
• Avatar
Graeme Carmichael
Leigh
I would suggest that you want to avoid repeating yourself with multiple dashboards and the filter option is the best way to go. This should be possible.
It sounds like you are looking at the internal number for the brand. When you apply the filter, ensure that the label is is set to 'Ticket Brand Name'.
Please sign in to leave a comment.
Powered by Zendesk
|
{
"url": "https://support.zendesk.com/hc/en-us/articles/203662436-Creating-dashboards-in-Insights-Professional-and-Enterprise-",
"source_domain": "support.zendesk.com",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "77665",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FADT24VGGDWEKGHNS7B53AUXFV7FVXQ4",
"WARC-Concurrent-To": "<urn:uuid:cfee55f7-0ee7-471a-aa47-8bdf178fa7d9>",
"WARC-Date": "2018-07-18T14:33:30Z",
"WARC-IP-Address": "192.161.156.1",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YE27RDURFS5WJGYOF75PJDS4IJOAWFRN",
"WARC-Record-ID": "<urn:uuid:dd2133e9-53c5-4131-9119-bc68cd017b8d>",
"WARC-Target-URI": "https://support.zendesk.com/hc/en-us/articles/203662436-Creating-dashboards-in-Insights-Professional-and-Enterprise-",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ffa36686-5846-4cb9-b7dd-834c47bcf508>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-225-182-164.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
69,
70,
79,
80,
91,
92,
103,
137,
138,
147,
148,
237,
238,
319,
320,
430,
431,
467,
468,
474,
475,
486,
517,
518,
534,
535,
813,
814,
820,
821,
832,
844,
845,
1116,
1117,
1123,
1124,
1135,
1149,
1150,
1301,
1302,
1447,
1448,
1471,
1472,
1483,
1495,
1496,
1531,
1532,
1543,
1555,
1556,
1942,
1943,
1954,
1970,
1971,
2413,
2414,
2420,
2421,
2433,
2434,
2440,
2441,
2452,
2474,
2475,
2485,
2486,
2643,
2644,
2800,
2801,
2836,
2837
],
"line_end_idx": [
69,
70,
79,
80,
91,
92,
103,
137,
138,
147,
148,
237,
238,
319,
320,
430,
431,
467,
468,
474,
475,
486,
517,
518,
534,
535,
813,
814,
820,
821,
832,
844,
845,
1116,
1117,
1123,
1124,
1135,
1149,
1150,
1301,
1302,
1447,
1448,
1471,
1472,
1483,
1495,
1496,
1531,
1532,
1543,
1555,
1556,
1942,
1943,
1954,
1970,
1971,
2413,
2414,
2420,
2421,
2433,
2434,
2440,
2441,
2452,
2474,
2475,
2485,
2486,
2643,
2644,
2800,
2801,
2836,
2837,
2855
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2855,
"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.44285714626312256,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.035714291036129,
"rps_doc_frac_lines_end_with_ellipsis": 0.012658230029046535,
"rps_doc_frac_no_alph_words": 0.14642857015132904,
"rps_doc_frac_unique_words": 0.4488517642021179,
"rps_doc_mean_word_length": 4.388309001922607,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0.0035714299883693457,
"rps_doc_unigram_entropy": 4.940967082977295,
"rps_doc_word_count": 479,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05708849057555199,
"rps_doc_frac_chars_dupe_6grams": 0.023786870762705803,
"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.02664129063487053,
"rps_doc_frac_chars_top_3gram": 0.020932450890541077,
"rps_doc_frac_chars_top_4gram": 0.023786870762705803,
"rps_doc_books_importance": -208.8483428955078,
"rps_doc_books_importance_length_correction": -208.8483428955078,
"rps_doc_openwebtext_importance": -123.39909362792969,
"rps_doc_openwebtext_importance_length_correction": -123.39909362792969,
"rps_doc_wikipedia_importance": -105.56053161621094,
"rps_doc_wikipedia_importance_length_correction": -105.56053161621094
},
"fasttext": {
"dclm": 0.03668045997619629,
"english": 0.9247168302536011,
"fineweb_edu_approx": 1.0891958475112915,
"eai_general_math": 0.018736420199275017,
"eai_open_web_math": 0.1954311728477478,
"eai_web_code": 0.007202209904789925
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,368,202,265,608,415,000
|
Aes_256_cbc frente a aes_128_gcm
AES is a symmetric-key algorithm with different key lengths (128, 192, and 256 bits). FortiOS supports Suite-B is a set of AES encryption with ICV in GCM mode. FortiOS supports Suite-B on new kernel platforms only. So, let’s look at AES or Advanced Encryption Standard, which is commonly used as a bulk As we covered, you can actually safely run AES in GCM or CCM with 128-bit keys and be fine. 256-bit encryption is fairly standard in 2019, but every mention of 256-bit Demonstrates AES encryption using the Galois/Counter Mode (GCM).
IBM Knowledge Center
initialization vector - 128 bits long.
VICERRECTORADO DE INVESTIGACIÓN, INNOVACIÓN Y .
Block Size. AES-128 is considered by experts to have a security level of 128 bits.
encryption — Kik WhatsApp: ¿cifrado? iOS / Android .
Block size in AES is also 128 bits. CBC: This is the mode of encryption that you want. There are number of modes of encryption, which depends on how fast you want your algorithm to work, parallelism and level of security. Why would I ever use AES-256-CBC if AES-256-GCM is more secure?
Cómo desactivar los cifrados SSL de fuerza media para el .
128. SHA256. 256. 2.
Palo Alto Networks Web Interface Reference Guide [PDF .
These slides are based on Lawrie Brown’s slides stefano:~$ openssl aes-256-cbc -in attack-plan.txt -a enter aes-256-cbc encryption password: Verifying - enter aes-256-cbc encryption password: U2FsdGVkX192dXI7yHGs/4Ed+xEC3ejXFINKO6Hufnc=. Note that you have a choice of AES-128 uses ten rounds, AES-192 uses twelve rounds, and AES-256 uses fourteen rounds. Each added round reduces the chance of a shortcut attack of the kind AES-CBC remains the most common mode in general use, but AES-GCM is increasing in popularity. AES – Advanced Encryption Standard – is the successor to DES. Patent free. In public domain. Uses keys of size 128, 192, or 256 bits.
UNIVERSIDAD NACIONAL AGRARIA DE LA SELVA .
Depending on what Windows Updates the server has applied, the order can be different even with the same version of Windows. What is AES CBC. AES-CBC (cipher block chaining) mode is one of the most used symmetric encryption algorithms. The data size must be nonzero and multiple of 16 bytes, which is the size of a “block”.
|
{
"url": "https://privacidadgtmn.firebaseapp.com/xagyweqav/738761.html",
"source_domain": "privacidadgtmn.firebaseapp.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "14395",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NKY23QEFWCEU4SVE3GDQGI5VSOIUW7P2",
"WARC-Concurrent-To": "<urn:uuid:f6035873-2f5f-4d49-912c-1bcf27b77dab>",
"WARC-Date": "2021-10-22T18:59:06Z",
"WARC-IP-Address": "199.36.158.100",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JODTVOO7VKP4I3F2BFPZKJ3OCIIWGHGN",
"WARC-Record-ID": "<urn:uuid:7f669ade-5e02-4946-ab60-e6149a17385f>",
"WARC-Target-URI": "https://privacidadgtmn.firebaseapp.com/xagyweqav/738761.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a21d744b-ca66-44cc-bb3c-d0282ec1d519>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-74\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
33,
34,
572,
573,
594,
595,
634,
635,
683,
684,
767,
768,
821,
822,
1108,
1109,
1168,
1169,
1190,
1191,
1247,
1248,
1903,
1904,
1947,
1948
],
"line_end_idx": [
33,
34,
572,
573,
594,
595,
634,
635,
683,
684,
767,
768,
821,
822,
1108,
1109,
1168,
1169,
1190,
1191,
1247,
1248,
1903,
1904,
1947,
1948,
2270
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2270,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27142855525016785,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.09795918315649033,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2551020383834839,
"rps_doc_frac_unique_words": 0.5714285969734192,
"rps_doc_mean_word_length": 4.901098728179932,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.988029479980469,
"rps_doc_word_count": 364,
"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.011771299876272678,
"rps_doc_frac_chars_top_3gram": 0.023542599752545357,
"rps_doc_frac_chars_top_4gram": 0.035874441266059875,
"rps_doc_books_importance": -232.1576690673828,
"rps_doc_books_importance_length_correction": -232.1576690673828,
"rps_doc_openwebtext_importance": -147.46070861816406,
"rps_doc_openwebtext_importance_length_correction": -147.46070861816406,
"rps_doc_wikipedia_importance": -129.12380981445312,
"rps_doc_wikipedia_importance_length_correction": -129.12380981445312
},
"fasttext": {
"dclm": 0.12748396396636963,
"english": 0.8302122354507446,
"fineweb_edu_approx": 2.817108631134033,
"eai_general_math": 0.7971221208572388,
"eai_open_web_math": 0.4106815457344055,
"eai_web_code": 0.6989173889160156
}
}
|
{
"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": "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": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,572,038,658,496,375,000
|
DragonFly On-Line Manual Pages
Search: Section:
CURLOPT_FORBID_REUSE(3) curl_easy_setopt options CURLOPT_FORBID_REUSE(3)
NAME
CURLOPT_FORBID_REUSE - make connection get closed at once after use
SYNOPSIS
#include <curl/curl.h> CURLcode curl_easy_setopt(CURL *handle, CURLOPT_FORBID_REUSE, long close);
DESCRIPTION
Pass a long. Set close to 1 to make libcurl explicitly close the connection when done with the transfer. Normally, libcurl keeps all connections alive when done with one transfer in case a succeeding one follows that can re-use them. This option should be used with caution and only if you understand what it does as it can seriously impact performance. Set to 0 to have libcurl keep the connection open for possible later re-use (default behavior).
DEFAULT
0
PROTOCOLS
Most
EXAMPLE
{ curl_easy_setopt(curl, CURLOPT_URL, "https://example.com/"); curl_easy_setopt(curl, CURLOPT_FORBID_REUSE, 1L); curl_easy_perform(curl); /* this second transfer may not reuse the same connection */ curl_easy_perform(curl); }
AVAILABILITY
Always
RETURN VALUE
Returns CURLE_OK
SEE ALSO
CURLOPT_FRESH_CONNECT(3), CURLOPT_MAXCONNECTS(3), libcurl 7.68.0 May 31, 2017 CURLOPT_FORBID_REUSE(3)
Search: Section:
|
{
"url": "https://man.dragonflybsd.org/?command=CURLOPT_FORBID_REUSE§ion=3",
"source_domain": "man.dragonflybsd.org",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "3351",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2OGLZHLU6DXTSN2HGXPXMRLUJSYWJES5",
"WARC-Concurrent-To": "<urn:uuid:9244f61e-c4f8-4db2-872d-266e8f04f668>",
"WARC-Date": "2020-07-10T20:34:09Z",
"WARC-IP-Address": "199.233.90.68",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:S7WIXCHI3GIZXARDRWZXRZ5VCQYBI7R7",
"WARC-Record-ID": "<urn:uuid:729d1200-1a4e-4b93-8286-1b1c1900c162>",
"WARC-Target-URI": "https://man.dragonflybsd.org/?command=CURLOPT_FORBID_REUSE§ion=3",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0f3a42f1-1c3e-47c5-8ee4-275c85c483d9>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-48.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,
31,
32,
51,
52,
53,
132,
133,
138,
139,
207,
208,
217,
218,
316,
317,
329,
330,
780,
781,
789,
790,
792,
793,
803,
804,
809,
810,
818,
819,
1045,
1046,
1059,
1060,
1067,
1068,
1081,
1082,
1099,
1100,
1109,
1110,
1212,
1213
],
"line_end_idx": [
31,
32,
51,
52,
53,
132,
133,
138,
139,
207,
208,
217,
218,
316,
317,
329,
330,
780,
781,
789,
790,
792,
793,
803,
804,
809,
810,
818,
819,
1045,
1046,
1059,
1060,
1067,
1068,
1081,
1082,
1099,
1100,
1109,
1110,
1212,
1213,
1231
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1231,
"ccnet_original_nlines": 43,
"rps_doc_curly_bracket": 0.0016247000312432647,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27802690863609314,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.1031390130519867,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3139013648033142,
"rps_doc_frac_unique_words": 0.7142857313156128,
"rps_doc_mean_word_length": 6.448979377746582,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0.004484300035983324,
"rps_doc_unigram_entropy": 4.531709671020508,
"rps_doc_word_count": 147,
"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.027426160871982574,
"rps_doc_frac_chars_top_3gram": 0.02531646005809307,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -99.44599151611328,
"rps_doc_books_importance_length_correction": -99.44599151611328,
"rps_doc_openwebtext_importance": -66.20214080810547,
"rps_doc_openwebtext_importance_length_correction": -66.20213317871094,
"rps_doc_wikipedia_importance": -55.12596130371094,
"rps_doc_wikipedia_importance_length_correction": -55.12596130371094
},
"fasttext": {
"dclm": 0.26280879974365234,
"english": 0.7350764274597168,
"fineweb_edu_approx": 1.830871820449829,
"eai_general_math": 0.01818173937499523,
"eai_open_web_math": 0.3792531490325928,
"eai_web_code": 0.008868220262229443
}
}
|
{
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,995,868,360,692,728,300
|
WA in POPGATES
THE PROBLEM IS-https://www.codechef.com/problems/POPGATES
AND MY CODE IS-
#include
using namespace std;
int main(){
int t;
cin>>t;
for(int i=0;i<t;i++){
int n,k;
int n_head=0,prev_head=0,h=0,t=0;
cin>>n>>k;
char coin[n];
for(int j=1;j<=n;j++)
cin>>coin[j];
for(int j=n;j>=n-k+1;j–){
if(coin[j]==‘H’)
{++prev_head; ++n_head;}
else if(coin[j]==‘T’ && prev_head%2==1)
{++prev_head; ++n_head;}
}
for(int j=1;j<=n-k;j++){
if(coin[j]==‘T’) t=t+1;
else h=h+1;
}
if(n_head%2==0) cout<<h;
else cout<<t;
}
}
please format your code or provide a link for your solution.
and mistake is not in your logic, the way you are printing the answer is not correct.
at last write
if (n_head%2==0) cout<<h<<endl;
else cout<<t<<endl;
|
{
"url": "https://discuss.codechef.com/t/wa-in-popgates/55184",
"source_domain": "discuss.codechef.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "14576",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HHXTCHET2452NBFN5IZFIE2C3XI2QZDB",
"WARC-Concurrent-To": "<urn:uuid:963e7099-5dd0-4954-a38c-56cda107b9eb>",
"WARC-Date": "2022-01-18T11:04:09Z",
"WARC-IP-Address": "54.157.194.233",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WR3NQ6GRBLPTYOHV7J472VMXNIGE47AK",
"WARC-Record-ID": "<urn:uuid:95c4a941-8a57-439c-91ac-699d302a3cde>",
"WARC-Target-URI": "https://discuss.codechef.com/t/wa-in-popgates/55184",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ffc6777e-c2ba-43c8-b3b3-5b43d7f48b99>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-13\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
15,
16,
74,
90,
99,
120,
132,
139,
147,
169,
178,
212,
223,
237,
259,
273,
299,
316,
341,
381,
406,
408,
433,
457,
469,
471,
496,
510,
512,
514,
515,
576,
577,
663,
664,
678,
710
],
"line_end_idx": [
15,
16,
74,
90,
99,
120,
132,
139,
147,
169,
178,
212,
223,
237,
259,
273,
299,
316,
341,
381,
406,
408,
433,
457,
469,
471,
496,
510,
512,
514,
515,
576,
577,
663,
664,
678,
710,
729
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 729,
"ccnet_original_nlines": 37,
"rps_doc_curly_bracket": 0.016460910439491272,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.282527893781662,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.048327140510082245,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4795539081096649,
"rps_doc_frac_unique_words": 0.7471264600753784,
"rps_doc_mean_word_length": 5.367815971374512,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0.003717469982802868,
"rps_doc_unigram_entropy": 4.04950475692749,
"rps_doc_word_count": 87,
"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.05567451938986778,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -129.8952178955078,
"rps_doc_books_importance_length_correction": -129.90325927734375,
"rps_doc_openwebtext_importance": -81.7660903930664,
"rps_doc_openwebtext_importance_length_correction": -81.77413177490234,
"rps_doc_wikipedia_importance": -41.196659088134766,
"rps_doc_wikipedia_importance_length_correction": -41.20470428466797
},
"fasttext": {
"dclm": 0.8748817443847656,
"english": 0.44520488381385803,
"fineweb_edu_approx": 1.4482232332229614,
"eai_general_math": 0.7330132126808167,
"eai_open_web_math": 0.11308705806732178,
"eai_web_code": 0.6403639912605286
}
}
|
{
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "1",
"label": "Technically Flawed"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,772,877,258,247,857,000
|
What you need to know to create your own cryptocurrency
Many have probably already understood and accepted the fact that various types of cryptocurrencies have become an integral part of the international financial system. This is such an attractive area for both entrepreneurs and investors that every year & nbsp; the number of investments is constantly multiplied. If you are thinking about creating your own cryptocurrency, then you need to have a good understanding of not only the technical aspects, but also the economic and legal aspects of this area. Next, we will look at the main steps that you should take to successfully create your own cryptocurrency. So what do you need to know to create your own cryptocurrency or tokens?
What you need to know to create your own cryptocurrency
How to create your own cryptocurrency: a beginner’s guide
Research existing cryptocurrencies: Before you start creating your own cryptocurrency, it is important to study existing projects and technologies. Study the white papers and white papers of other cryptocurrencies to understand how they work and what benefits they offer. This will help you decide on the goals and features of your own cryptocurrency.
Your goals to create
Define the goals and features of your cryptocurrency: What do you want to achieve by creating your cryptocurrency? Determine the main goals of your project and what benefits you want to offer users. You can focus on increased privacy and anonymity, fast transactions, low fees, or some other unique feature. Setting goals will help you focus on specific aspects of development.
Choosing a platform to create your own cryptocurrency
Choose the right system: Cryptocurrencies can be created on various platforms, such as Ethereum, Stellar, Waves, and many others. Each platform has its own characteristics and development tools. Explore different platforms. Then choose the one that best suits your needs. Please note that the choice of platform may affect the future scalability of your cryptocurrency.
Concept and white paper: In this step, you should develop a detailed concept for your cryptocurrency and describe it on a white paper. A white paper is a document that contains a description of the technical and economic aspects of your cryptocurrency, including consensus algorithms, blockchain structure, token distribution, and other important information. The white paper will help you attract investors and the community.
Blockchain and token development
Develop the blockchain and tokens: Based on the chosen platform, develop the blockchain and issue tokens of your cryptocurrency. This may include the creation of smart contracts, the definition of consensus rules, the development of wallets and other necessary components. Please note that the development of blockchain and tokens requires knowledge of programming and security.
Secure: Security is one of the most important aspects of creating a cryptocurrency. Your blockchain and wallets must be protected from potential attacks and hackers. Conduct a security audit and implement measures to ensure the security of your cryptocurrency.
Develop a community and partnerships: It is important to have an active community and partnerships in order to successfully develop your cryptocurrency. Actively interact with the community, hold events, discuss news and improvements with users. Also look for partners who can help you promote and accept your cryptocurrency.
Cryptocurrency Programming Languages
Legal and practical issues when creating a cryptocurrency
Pay attention to legislation: Cryptocurrencies are regulated by legislation in many countries. When creating your cryptocurrency, pay attention to the requirements and regulations in force in your jurisdiction. Work with lawyers to make sure that your project complies with all necessary legal regulations.
Launch an ICO or IEO: If you are planning to raise funds for the development of your cryptocurrency, you can conduct an Initial Coin Offering (ICO) or an Initial Exchange Offering (IEO). During these campaigns, you invite investors to purchase your tokens in exchange for funding. Please note that conducting an ICO or IEO also requires compliance with the law and compliance with the rules of the platform on which the campaign is running.
Project Development
Support development and updates: Creating a cryptocurrency is a long-term process. Once your project is launched, it is important to keep it evolving and release regular updates. Listen to feedback from users, improve functionality and security, and promote your cryptocurrency in the market.
What programming language can be used to create a cryptocurrency?
There are several programming languages in which you can create a cryptocurrency. However, the most common programming language for developing cryptocurrencies is the Solidity language.
Solidity is a programming language, specifically designed to create smart contracts on the Ethereum platform. Smart contracts are software codes that run on a blockchain and control the functionality of a cryptocurrency. Solidity provides the ability to define consensus rules, create tokens, and implement other important cryptocurrency functions.
However, in addition to Solidity, other programming languages can be used to create a cryptocurrency, depending on the chosen platform. For example, the Stellar platform uses the Stellar Language programming language, while the Waves platform uses the Ride language.
In addition, there are also frameworks that allow you to develop cryptocurrencies on several programming languages. For example, the Ethereum Framework (Ethereum Framework) supports the Solidity, Vyper and Serpent languages.
It is important to note that the choice of programming language depends on the platform you choose to develop your cryptocurrency. Therefore, before starting development, it is important to study the features of the chosen platform and language programming to properly implement the functionality of your cryptocurrency.
Conclusions and conclusion about creating your own cryptocurrency
Creating your own cryptocurrency is a complex and multifaceted process that requires technical, economic and legal knowledge. However, with enough research and the right approach, you can realize your idea and create a successful project.
• How to open bin format files? Tips for PC usersHow to open bin format files? Tips for PC users
A more or less experienced PC user knows that in the world of computers and files there are many different formats, and one of them is *bin. Files with this …
• Maintenance of your PC for a long lifeMaintenance of your PC for a long life
In our modern information age, the computer has become an indispensable assistant for many tasks, whether it is work, communication, entertainment or study. However, for a computer to serve us …
Leave a Reply
|
{
"url": "https://fialtop.net/en/what-you-need-to-know-to-create-your-own-cryptocurrency/",
"source_domain": "fialtop.net",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "118767",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TNWYVYK6JBJRYM7BXAHUWCTAVR4NT6VV",
"WARC-Concurrent-To": "<urn:uuid:e7a93b41-5a93-4a5d-aee3-2a29befc73fc>",
"WARC-Date": "2023-10-01T02:15:09Z",
"WARC-IP-Address": "104.21.69.205",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WEJ6OFTUTTPP7T2MUK7L6EM4ZLF2COME",
"WARC-Record-ID": "<urn:uuid:8db867e6-0268-4c23-96e2-d24013aa6a91>",
"WARC-Target-URI": "https://fialtop.net/en/what-you-need-to-know-to-create-your-own-cryptocurrency/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:476150e4-90bb-4f00-b384-3f96c94c72ef>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-67\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,
740,
741,
797,
798,
856,
857,
1209,
1210,
1231,
1232,
1610,
1611,
1665,
1666,
2036,
2037,
2464,
2465,
2498,
2499,
2878,
2879,
3140,
3141,
3467,
3468,
3505,
3506,
3564,
3565,
3872,
3873,
4314,
4315,
4335,
4336,
4629,
4630,
4696,
4697,
4883,
4884,
5233,
5234,
5501,
5502,
5727,
5728,
6049,
6050,
6116,
6117,
6356,
6357,
6456,
6619,
6700,
6899,
6900
],
"line_end_idx": [
56,
57,
740,
741,
797,
798,
856,
857,
1209,
1210,
1231,
1232,
1610,
1611,
1665,
1666,
2036,
2037,
2464,
2465,
2498,
2499,
2878,
2879,
3140,
3141,
3467,
3468,
3505,
3506,
3564,
3565,
3872,
3873,
4314,
4315,
4335,
4336,
4629,
4630,
4696,
4697,
4883,
4884,
5233,
5234,
5501,
5502,
5727,
5728,
6049,
6050,
6116,
6117,
6356,
6357,
6456,
6619,
6700,
6899,
6900,
6913
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6913,
"ccnet_original_nlines": 61,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42687076330184937,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011054419912397861,
"rps_doc_frac_lines_end_with_ellipsis": 0.032258059829473495,
"rps_doc_frac_no_alph_words": 0.11139456182718277,
"rps_doc_frac_unique_words": 0.3352435529232025,
"rps_doc_mean_word_length": 5.442215919494629,
"rps_doc_num_sentences": 57,
"rps_doc_symbol_to_word_ratio": 0.0017006800044327974,
"rps_doc_unigram_entropy": 5.09903621673584,
"rps_doc_word_count": 1047,
"rps_doc_frac_chars_dupe_10grams": 0.016146019101142883,
"rps_doc_frac_chars_dupe_5grams": 0.0951211005449295,
"rps_doc_frac_chars_dupe_6grams": 0.059319060295820236,
"rps_doc_frac_chars_dupe_7grams": 0.044928040355443954,
"rps_doc_frac_chars_dupe_8grams": 0.03369602933526039,
"rps_doc_frac_chars_dupe_9grams": 0.023517020046710968,
"rps_doc_frac_chars_top_2gram": 0.044226039201021194,
"rps_doc_frac_chars_top_3gram": 0.04054053872823715,
"rps_doc_frac_chars_top_4gram": 0.028431029990315437,
"rps_doc_books_importance": -510.57855224609375,
"rps_doc_books_importance_length_correction": -510.57855224609375,
"rps_doc_openwebtext_importance": -355.85174560546875,
"rps_doc_openwebtext_importance_length_correction": -355.85174560546875,
"rps_doc_wikipedia_importance": -312.43255615234375,
"rps_doc_wikipedia_importance_length_correction": -312.43255615234375
},
"fasttext": {
"dclm": 0.03348278999328613,
"english": 0.9342874884605408,
"fineweb_edu_approx": 2.394671678543091,
"eai_general_math": 0.0451011098921299,
"eai_open_web_math": 0.06829875707626343,
"eai_web_code": 0.09124290943145752
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "332.8",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,911,416,698,431,762,000
|
3
I have been unable to get the CiviCRM warning about timezone settings corrected after this just past daylight savings transition. Usually I would correct it by changing the timezone setting of the Drupal user ID's. In the past, the user's timezone setting would be an hour off to the real time, so adjusting the timezone setting in Drupal back to current time always corrected the issue. However this time the user timezone setting already was correct.
I have written up the following PHP tester:
<?php
$db = new mysqli('localhost', 'dbuserid', 'blablablapassword', 'db');
if($db->connect_errno > 0){
die('Unable to connect to database [' . $db->connect_error . ']');
}
$sql = <<<SQL
SELECT NOW() AS `NOW`
SQL;
if(!$result = $db->query($sql)){
die('There was an error running the query [' . $db->error . ']');
}
while($row = $result->fetch_assoc()){
echo 'MySQLi date: ' . $row['NOW'] . '<br />';
}
$result->free();
echo 'PHP date: ' . date('Y-m-d H:i:s');
?>
Which outputs:
MySQLi date: 2015-05-26 21:32:56
PHP date: 2015-05-26 21:32:56
Looks like they match to me.
I have also hard coded set the timezone into the Apache virtual site's configuration by adding to the site's .htaccess file:
#Added PHP Timezone information to match Linux configuration
php_value date.timezone "America/New_York"
Where else could be causing CiviCRM to complain thusly:
Environment Settings
Timestamps reported by MySQL (eg "2015-05-26 21:28") and PHP (eg "2015-05-26 20:28" ) are mismatched.
Read more about this warning
I am thankful, Michael
1 Answer 1
3
I know you said you checked the user's timezone but did you check the sitewide time zone in Drupal at /admin/config/regional/settings?
1
• Thank you, frTommy, that is already set correct as well... the Drupal site-wide timezone setting. Since "all of these settings" are still correct after the last daylight savings change, I wonder if the settings were incorrect before the change yet CiviCRM was not siting the error? May 28, 2015 at 1:06
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://civicrm.stackexchange.com/questions/2721/why-is-civicrm-not-seeing-the-timezone-correctly",
"source_domain": "civicrm.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "155874",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ETORP7L2BA6K5CQLVNL3FGRKOX7UVHAS",
"WARC-Concurrent-To": "<urn:uuid:9846801d-0974-41a9-a9a2-ee705a60ccf5>",
"WARC-Date": "2024-04-17T21:46:08Z",
"WARC-IP-Address": "172.64.144.30",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6MWTMULQA6ULZIO2ZOPEHXKW5XH77SEA",
"WARC-Record-ID": "<urn:uuid:c9ecc966-7080-4b6e-b1df-2db7f72c922f>",
"WARC-Target-URI": "https://civicrm.stackexchange.com/questions/2721/why-is-civicrm-not-seeing-the-timezone-correctly",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:092f5a70-9b49-4eea-ac19-3d4d29ae1d34>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-23\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
456,
457,
501,
502,
508,
509,
579,
580,
608,
677,
679,
680,
694,
720,
725,
726,
759,
827,
829,
830,
868,
917,
919,
920,
937,
938,
979,
980,
983,
984,
999,
1000,
1033,
1063,
1064,
1093,
1094,
1219,
1220,
1283,
1328,
1329,
1385,
1386,
1407,
1509,
1538,
1539,
1562,
1563,
1574,
1575,
1577,
1578,
1713,
1714,
1716,
2023,
2024,
2036,
2037,
2153,
2154
],
"line_end_idx": [
2,
3,
456,
457,
501,
502,
508,
509,
579,
580,
608,
677,
679,
680,
694,
720,
725,
726,
759,
827,
829,
830,
868,
917,
919,
920,
937,
938,
979,
980,
983,
984,
999,
1000,
1033,
1063,
1064,
1093,
1094,
1219,
1220,
1283,
1328,
1329,
1385,
1386,
1407,
1509,
1538,
1539,
1562,
1563,
1574,
1575,
1577,
1578,
1713,
1714,
1716,
2023,
2024,
2036,
2037,
2153,
2154,
2244
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2244,
"ccnet_original_nlines": 65,
"rps_doc_curly_bracket": 0.002673800103366375,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26356589794158936,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.042635660618543625,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3410852551460266,
"rps_doc_frac_unique_words": 0.5902140736579895,
"rps_doc_mean_word_length": 5.048929691314697,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0.003875969909131527,
"rps_doc_unigram_entropy": 4.948579788208008,
"rps_doc_word_count": 327,
"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.04542700946331024,
"rps_doc_frac_chars_top_3gram": 0.021804969757795334,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -281.58392333984375,
"rps_doc_books_importance_length_correction": -281.58392333984375,
"rps_doc_openwebtext_importance": -169.31314086914062,
"rps_doc_openwebtext_importance_length_correction": -169.31314086914062,
"rps_doc_wikipedia_importance": -122.59235382080078,
"rps_doc_wikipedia_importance_length_correction": -122.59235382080078
},
"fasttext": {
"dclm": 0.36850476264953613,
"english": 0.8599047064781189,
"fineweb_edu_approx": 1.4844154119491577,
"eai_general_math": 0.0007315300172194839,
"eai_open_web_math": 0.1880818009376526,
"eai_web_code": 0.0005169499781914055
}
}
|
{
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,955,868,070,459,776,000
|
consultants are sandburs
Thursday, February 07, 2013
Technology is great. Chip your dog if you're a Brit. Chip the newborn?
Think how much TSA would love that at the airport. How employers could use a low cost RFID reader to avoid liability for hiring illegal immigrant workers. How you'd never have to carry around a bulky Social Security card, or have to remember the number when filling out forms. Ease of driver license renewals or denials, lack of need for any voter photo-ID. The possibilities are endless.
This Strib link. This Google. Here.
They could even chip personal firearms, at the factories, at retail outlets, and cross reference your chip and your handgun's. Chip cartridge boxes before sale. As easy as pie. A while back, decades actually, there was an outcry when Intel proposed to code a unique identity into every microprocessor it made. Now as I understand it Microsoft codes unique identifiers into its Windows operating system copies, so it can refuse to update pirate copies - no payment up front, no update. And when you visit websites you IP is easily identified. You can even sign up with Facebook, and identify yourself by the social network data you generate, there, for Zuckerberg and whoever else your data is shared with. Once they chip you, and the reader has to verify your chip and workstation are duly registered, as a set and individually before you can access the web, things will be so much more open and less oppressive. With Reagan as president back in 1984, it's probably been done already. All but chipping you. For now. Your medical records would be in the cloud, indexed by your chip, in case of an accident while a tourist. For setting insurance contracts, verifying drug prescriptions at border crossings. Many innovations are feasible.
Money would be unnecessary, your credit would ride with your chip.
The black market for chip removal, recoding, chips at the border for illegal entrants, pirated chips removed at autopsy, all that might prosper. It could be bigger market-wise than illicit drugs. DNA logging and chipping at birth would make aspects of law enforcement easier. Hacking the database could, as needed, be made a capital crime.
No comments:
|
{
"url": "http://zaetsch.blogspot.com/2013/02/technology-is-great-chip-your-dog-if.html",
"source_domain": "zaetsch.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2016-36",
"warc_metadata": {
"Content-Length": "223085",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EIZBTW6SLPXUDLQHUAWYLQYY7VC3YK5F",
"WARC-Concurrent-To": "<urn:uuid:1e10ba31-6613-4c34-bf78-9920a7f0aa7d>",
"WARC-Date": "2016-08-26T10:04:53Z",
"WARC-IP-Address": "216.58.217.65",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:66Q2QOIACHNW2IH45PSWK4BTKMTXEWED",
"WARC-Record-ID": "<urn:uuid:863e7fb6-5a60-41fb-9185-d3f80efef51e>",
"WARC-Target-URI": "http://zaetsch.blogspot.com/2013/02/technology-is-great-chip-your-dog-if.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:29879074-19e9-44b9-8dc1-e6262d2a317b>"
},
"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,
25,
26,
27,
28,
56,
57,
128,
129,
518,
519,
555,
556,
1792,
1793,
1860,
1861,
2201,
2202
],
"line_end_idx": [
25,
26,
27,
28,
56,
57,
128,
129,
518,
519,
555,
556,
1792,
1793,
1860,
1861,
2201,
2202,
2214
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2214,
"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.3786848187446594,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015873020514845848,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15646259486675262,
"rps_doc_frac_unique_words": 0.6287263035774231,
"rps_doc_mean_word_length": 4.794037818908691,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.152448654174805,
"rps_doc_word_count": 369,
"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.01808932051062584,
"rps_doc_frac_chars_top_3gram": 0.012436400167644024,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -200.98233032226562,
"rps_doc_books_importance_length_correction": -200.98233032226562,
"rps_doc_openwebtext_importance": -105.41839599609375,
"rps_doc_openwebtext_importance_length_correction": -105.41839599609375,
"rps_doc_wikipedia_importance": -72.9311294555664,
"rps_doc_wikipedia_importance_length_correction": -72.9311294555664
},
"fasttext": {
"dclm": 0.322969913482666,
"english": 0.948600172996521,
"fineweb_edu_approx": 1.9424095153808594,
"eai_general_math": 0.025508219376206398,
"eai_open_web_math": 0.20684456825256348,
"eai_web_code": 0.005482969805598259
}
}
|
{
"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": "303.483",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social sciences — Dictionaries"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,042,722,643,521,134,100
|
aboutsummaryrefslogtreecommitdiffstats
path: root/init
diff options
context:
space:
mode:
authorPaul E. McKenney <paulmck@linux.vnet.ibm.com>2010-08-04 17:31:12 -0700
committerPaul E. McKenney <paulmck@linux.vnet.ibm.com>2010-08-19 17:18:04 -0700
commit4d87ffadbba88105f33271bef5f2c79366c6a4e1 (patch)
treeb9866241327c17a810c3c9ca9bac0f525762cb7e /init
parent910b1b7e19a292ff685001caf1bf1a9775b771a1 (diff)
downloadmrst-s0i3-test-4d87ffadbba88105f33271bef5f2c79366c6a4e1.tar.gz
mrst-s0i3-test-4d87ffadbba88105f33271bef5f2c79366c6a4e1.tar.xz
mrst-s0i3-test-4d87ffadbba88105f33271bef5f2c79366c6a4e1.zip
rcu: Fix RCU_FANOUT help message
Commit cf244dc01bf68 added a fourth level to the TREE_RCU hierarchy, but the RCU_FANOUT help message still said "cube root". This commit fixes this to "fourth root" and also emphasizes that production systems are well-served by the default. (Stress-testing RCU itself uses small RCU_FANOUT values in order to test large-system code paths on small(er) systems.) Located-by: John Kacur <jkacur@redhat.com> Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Diffstat (limited to 'init')
-rw-r--r--init/Kconfig9
1 files changed, 6 insertions, 3 deletions
diff --git a/init/Kconfig b/init/Kconfig
index 79ac52bef4c..dbc08baad77 100644
--- a/init/Kconfig
+++ b/init/Kconfig
@@ -388,9 +388,12 @@ config RCU_FANOUT
help
This option controls the fanout of hierarchical implementations
of RCU, allowing RCU to work efficiently on machines with
- large numbers of CPUs. This value must be at least the cube
- root of NR_CPUS, which allows NR_CPUS up to 32,768 for 32-bit
- systems and up to 262,144 for 64-bit systems.
+ large numbers of CPUs. This value must be at least the fourth
+ root of NR_CPUS, which allows NR_CPUS to be insanely large.
+ The default value of RCU_FANOUT should be used for production
+ systems, but if you are stress-testing the RCU implementation
+ itself, small RCU_FANOUT values allow you to test large-system
+ code paths on small(er) systems.
Select a specific number if testing RCU itself.
Take the default if unsure.
|
{
"url": "https://git.zytor.com/mrst/mrst-s0i3-test.git/commit/init?h=v2.6.37-rc5&id=4d87ffadbba88105f33271bef5f2c79366c6a4e1",
"source_domain": "git.zytor.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "9981",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZDQT67QFAAEFRNJD2AEWX7WHYF4AR324",
"WARC-Concurrent-To": "<urn:uuid:9762ef23-4e71-49eb-bc1a-0e01d8fc40b4>",
"WARC-Date": "2021-02-27T16:36:01Z",
"WARC-IP-Address": "198.137.202.136",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HGHXUFHWRCCMX6FHCYJQJTOKKZT3AK6R",
"WARC-Record-ID": "<urn:uuid:351aefb0-cb15-40f2-906e-e44e45047519>",
"WARC-Target-URI": "https://git.zytor.com/mrst/mrst-s0i3-test.git/commit/init?h=v2.6.37-rc5&id=4d87ffadbba88105f33271bef5f2c79366c6a4e1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2b179cd8-29af-4147-9c45-121160d47f98>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-35.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,
39,
55,
68,
77,
84,
90,
167,
247,
302,
353,
407,
478,
541,
601,
634,
1099,
1128,
1152,
1195,
1236,
1274,
1293,
1312,
1351,
1356,
1420,
1478,
1540,
1604,
1652,
1716,
1778,
1842,
1906,
1971,
2006,
2054
],
"line_end_idx": [
39,
55,
68,
77,
84,
90,
167,
247,
302,
353,
407,
478,
541,
601,
634,
1099,
1128,
1152,
1195,
1236,
1274,
1293,
1312,
1351,
1356,
1420,
1478,
1540,
1604,
1652,
1716,
1778,
1842,
1906,
1971,
2006,
2054,
2081
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2081,
"ccnet_original_nlines": 37,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21218961477279663,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.042889390140771866,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3679458200931549,
"rps_doc_frac_unique_words": 0.5708333253860474,
"rps_doc_mean_word_length": 6.958333492279053,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.6895623207092285,
"rps_doc_word_count": 240,
"rps_doc_frac_chars_dupe_10grams": 0.05149700865149498,
"rps_doc_frac_chars_dupe_5grams": 0.136526957154274,
"rps_doc_frac_chars_dupe_6grams": 0.136526957154274,
"rps_doc_frac_chars_dupe_7grams": 0.10179641097784042,
"rps_doc_frac_chars_dupe_8grams": 0.10179641097784042,
"rps_doc_frac_chars_dupe_9grams": 0.05149700865149498,
"rps_doc_frac_chars_top_2gram": 0.01616765931248665,
"rps_doc_frac_chars_top_3gram": 0.023952100425958633,
"rps_doc_frac_chars_top_4gram": 0.025149699300527573,
"rps_doc_books_importance": -248.449951171875,
"rps_doc_books_importance_length_correction": -248.449951171875,
"rps_doc_openwebtext_importance": -125.94511413574219,
"rps_doc_openwebtext_importance_length_correction": -125.94511413574219,
"rps_doc_wikipedia_importance": -105.69254302978516,
"rps_doc_wikipedia_importance_length_correction": -105.69254302978516
},
"fasttext": {
"dclm": 0.06440997123718262,
"english": 0.6923038363456726,
"fineweb_edu_approx": 2.672179937362671,
"eai_general_math": 0.45203864574432373,
"eai_open_web_math": 0.6325405240058899,
"eai_web_code": 0.022892119362950325
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,954,869,558,641,971,700
|
Stylish Contact Form Using CSS3
The form is material design based. It uses materialize CSS & JS.
Usage:
1. Press the download button above. The zip file contains all the code you need for the form.
2. Unzip the file contact-form-css3
3. Open the file named "handler.php"
Look for sendEmailTo add the email addresses to receive the form submissions.
4. Upload the whole folder to your website
5. Open the formpage.html in your browser and test
See the customization guide . You can change the validations, edit the styles, and more
See a video demo here
The sections below explain the code of this form
The HTML Code
<div class="imagebg"></div>
<div class="container">
<div class="form-container z-depth-5">
<h3>Contact Form</h3>
<div class="row">
<form class="col s12" id="reused_form">
<div class="row">
<div class="input-field col s12">
<input id="name" type="text" name="name" required class="validate">
<label for="name">Name</label>
</div>
</div>
<div class="row">
<div class="input-field col s12">
<input id="email" type="email" name="email" required class="validate">
<label for="email">Email</label>
</div>
</div>
<div class="row">
<div class="input-field col s12">
<textarea id="message" name="message" class="materialize-textarea" class="validate"
></textarea>
<label for="message">Message</label>
</div>
</div>
<div>
<button class="waves-effect waves-light btn submitbtn" type="submit">Submit</button>
</div>
</form>
<div id="error_message" style="width:100%; height:100%; display:none; ">
<h4>Error</h4>
Sorry there was an error sending your form.
</div>
<div id="success_message" style="width:100%; height:100%; display:none; ">
<h4>Success! Your Message was Sent Successfully.</h4>
</div>
</div>
</div>
</div>
<!--Import jQuery before materialize.js-->
<script type="text/javascript" src="https://code.jquery.com/jquery-2.1.1.min.js"></script>
<script src="https://cdnjs.cloudflare.com/ajax/libs/materialize/0.98.2/js/materialize.min.js"></script>
CSS Styling
The following extra CSS styling is used to make the form look better
<link rel="stylesheet" href="form.css" >
jQuery Form submission handling
<script>
$(function()
{
function after_form_submitted(data)
{
if(data.result == 'success')
{
$('form#reused_form').hide();
$('#success_message').show();
$('#error_message').hide();
}
else
{
$('#error_message').append('<ul></ul>');
jQuery.each(data.errors,function(key,val)
{
$('#error_message ul').append('<li>'+key+':'+val+'</li>');
});
$('#success_message').hide();
$('#error_message').show();
//reverse the response on the button
$('button[type="button"]', $form).each(function()
{
$btn = $(this);
label = $btn.prop('orig_label');
if(label)
{
$btn.prop('type','submit' );
$btn.text(label);
$btn.prop('orig_label','');
}
});
}//else
}
$('#reused_form').submit(function(e)
{
e.preventDefault();
$form = $(this);
//show some response on the button
$('button[type="submit"]', $form).each(function()
{
$btn = $(this);
$btn.prop('type','button' );
$btn.prop('orig_label',$btn.text());
$btn.text('Sending ...');
});
$.ajax({
type: "POST",
url: 'handler.php',
data: $form.serialize(),
success: after_form_submitted,
dataType: 'json'
});
});
});
</script>
Form Validations
HTML5 validations are used. For example, the Name and Email fields have 'required' validation and the email field is of input type 'email'.
<input type="email" class="form-control" id="email" name="email" required>
Similarly, the message field (textarea) allows a max length of 6000 characters
<textarea name="Message" maxlength="6000" required></textarea>
using the built-in HTML5 validations has the advantage that the browser itself shows the error message.
You can customize those validations to fit your needs
Server Side Handling
Every form requires a server side script to collect the form data and do the processing like send emails, save to database etc. This form comes with a PHP script to handle the form submissions. PHP is widely supported server side scripting platform.
When the form is submitted, the javascript form submission event handler above collects the form data and sends it to the server side script.
The serverside script entry point is handler.php (see in your downloaded zip file). The script uses a library called FormHandler, which inturn, uses other libraries.
Here is the code of the handler.php
<?php
ini_set('display_errors', 1);
ini_set('display_startup_errors', 1);
error_reporting(E_ALL);
/*
Tested working with PHP5.4 and above (including PHP 7 )
*/
require_once './vendor/autoload.php';
use FormGuide\Handlx\FormHandler;
$pp = new FormHandler();
$validator = $pp->getValidator();
$validator->fields(['name','email'])->areRequired()->maxLength(50);
$validator->field('email')->isEmail();
$validator->field('message')->maxLength(6000);
$pp->sendEmailTo('someone@gmail.com'); // ← Your email here
echo $pp->process($_POST);
You have to edit the handler.php and change "someone@gmail.com" to your email address. If you want to add a second or third email address, you can do so like this:
$fh->sendEmailTo(['someone@gmail.com', 'someone.else@gmail.com']);
Server Side Form Validations
Server side form validations are essential for any form. You can't trust data sent to a form processing script.
For this form, the server side form validations are done using this PHPFormValidation library. See the documentation to add or update the validations.
Customizations
Edit the handler.php and change abc@cdef to your email address. Remove the second email address, if not required.
See the customization guide for more customization options.
Preview the form Download
Try Simfatic Forms (html form builder download) . Self hosted, unlimited forms
|
{
"url": "http://reusableforms.com/d/o1/contact-form-css3",
"source_domain": "reusableforms.com",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "16039",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:K3P5775MGE5EKTIMG4LXWBICW4CHBKHK",
"WARC-Concurrent-To": "<urn:uuid:dc2b4ca4-a2a3-4d2a-8340-a0169105e7e5>",
"WARC-Date": "2019-01-24T05:23:46Z",
"WARC-IP-Address": "167.99.105.150",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7XYMSPS57DH6L57GMW4HRWOGE3OB5LQK",
"WARC-Record-ID": "<urn:uuid:4fbbb897-f67a-4f1a-801c-642ebdc994a4>",
"WARC-Target-URI": "http://reusableforms.com/d/o1/contact-form-css3",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b38f8f7e-fbee-4f4c-be5b-0d6cb33a3c36>"
},
"warc_info": "isPartOf: CC-MAIN-2019-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-101-220-24.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,
32,
33,
98,
99,
106,
107,
203,
241,
280,
362,
407,
460,
461,
549,
550,
572,
573,
622,
623,
637,
638,
639,
667,
696,
741,
770,
795,
842,
869,
914,
995,
1039,
1057,
1073,
1100,
1145,
1229,
1275,
1293,
1309,
1336,
1381,
1478,
1504,
1554,
1572,
1588,
1604,
1698,
1713,
1728,
1808,
1837,
1902,
1916,
1998,
2057,
2071,
2083,
2096,
2108,
2157,
2254,
2364,
2365,
2377,
2378,
2447,
2448,
2489,
2490,
2522,
2523,
2524,
2533,
2546,
2548,
2589,
2595,
2632,
2642,
2684,
2726,
2766,
2776,
2789,
2799,
2852,
2853,
2907,
2921,
2996,
3012,
3054,
3094,
3095,
3144,
3206,
3220,
3252,
3301,
3327,
3345,
3395,
3433,
3481,
3499,
3515,
3528,
3544,
3550,
3551,
3589,
3597,
3625,
3626,
3651,
3694,
3752,
3762,
3790,
3832,
3881,
3919,
3931,
3940,
3941,
3970,
4000,
4036,
4077,
4124,
4158,
4182,
4191,
4202,
4206,
4216,
4217,
4234,
4235,
4375,
4376,
4453,
4454,
4533,
4534,
4535,
4600,
4601,
4705,
4759,
4760,
4781,
4782,
5032,
5033,
5175,
5176,
5342,
5343,
5379,
5380,
5381,
5387,
5417,
5455,
5479,
5482,
5538,
5539,
5543,
5581,
5582,
5616,
5617,
5618,
5644,
5645,
5679,
5747,
5786,
5833,
5834,
5835,
5836,
5837,
5897,
5898,
5925,
6089,
6090,
6158,
6159,
6188,
6189,
6301,
6302,
6453,
6454,
6469,
6470,
6584,
6585,
6645,
6646,
6672,
6673
],
"line_end_idx": [
32,
33,
98,
99,
106,
107,
203,
241,
280,
362,
407,
460,
461,
549,
550,
572,
573,
622,
623,
637,
638,
639,
667,
696,
741,
770,
795,
842,
869,
914,
995,
1039,
1057,
1073,
1100,
1145,
1229,
1275,
1293,
1309,
1336,
1381,
1478,
1504,
1554,
1572,
1588,
1604,
1698,
1713,
1728,
1808,
1837,
1902,
1916,
1998,
2057,
2071,
2083,
2096,
2108,
2157,
2254,
2364,
2365,
2377,
2378,
2447,
2448,
2489,
2490,
2522,
2523,
2524,
2533,
2546,
2548,
2589,
2595,
2632,
2642,
2684,
2726,
2766,
2776,
2789,
2799,
2852,
2853,
2907,
2921,
2996,
3012,
3054,
3094,
3095,
3144,
3206,
3220,
3252,
3301,
3327,
3345,
3395,
3433,
3481,
3499,
3515,
3528,
3544,
3550,
3551,
3589,
3597,
3625,
3626,
3651,
3694,
3752,
3762,
3790,
3832,
3881,
3919,
3931,
3940,
3941,
3970,
4000,
4036,
4077,
4124,
4158,
4182,
4191,
4202,
4206,
4216,
4217,
4234,
4235,
4375,
4376,
4453,
4454,
4533,
4534,
4535,
4600,
4601,
4705,
4759,
4760,
4781,
4782,
5032,
5033,
5175,
5176,
5342,
5343,
5379,
5380,
5381,
5387,
5417,
5455,
5479,
5482,
5538,
5539,
5543,
5581,
5582,
5616,
5617,
5618,
5644,
5645,
5679,
5747,
5786,
5833,
5834,
5835,
5836,
5837,
5897,
5898,
5925,
6089,
6090,
6158,
6159,
6188,
6189,
6301,
6302,
6453,
6454,
6469,
6470,
6584,
6585,
6645,
6646,
6672,
6673,
6751
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6751,
"ccnet_original_nlines": 208,
"rps_doc_curly_bracket": 0.0029625201132148504,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1579335778951645,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011070109903812408,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4014759957790375,
"rps_doc_frac_unique_words": 0.4848966598510742,
"rps_doc_mean_word_length": 6.562798023223877,
"rps_doc_num_sentences": 88,
"rps_doc_symbol_to_word_ratio": 0.006642070133239031,
"rps_doc_unigram_entropy": 5.1622161865234375,
"rps_doc_word_count": 629,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05692828819155693,
"rps_doc_frac_chars_dupe_6grams": 0.03076549991965294,
"rps_doc_frac_chars_dupe_7grams": 0.03076549991965294,
"rps_doc_frac_chars_dupe_8grams": 0.019864339381456375,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01453488040715456,
"rps_doc_frac_chars_top_3gram": 0.010901159606873989,
"rps_doc_frac_chars_top_4gram": 0.021075580269098282,
"rps_doc_books_importance": -463.7183532714844,
"rps_doc_books_importance_length_correction": -463.7183532714844,
"rps_doc_openwebtext_importance": -350.6581115722656,
"rps_doc_openwebtext_importance_length_correction": -350.6581115722656,
"rps_doc_wikipedia_importance": -291.4212646484375,
"rps_doc_wikipedia_importance_length_correction": -291.4212646484375
},
"fasttext": {
"dclm": 0.27724170684814453,
"english": 0.49849337339401245,
"fineweb_edu_approx": 1.9172474145889282,
"eai_general_math": 0.08460831642150879,
"eai_open_web_math": 0.11774122714996338,
"eai_web_code": 0.8131077885627747
}
}
|
{
"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": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,321,350,776,859,863,000
|
writing guide computer forensic examiners
Corporate Responsibility in The Global Market Discussion
November 22, 2020
Assignment 1 Swot Analysis
November 22, 2020
writing guide computer forensic examiners
Your training supervisor has asked you to research and recommend a writing guide which will be used by the future investigators in your computer forensics investigation unit to writing official reports.
You should also research professional associations for writing guidelines. In a 2- to 3-page Microsoft Word document, combine guidelines from different sources while formulating your recommendations for a technical and legal writing guide for computer forensic examiners. Support your responses with examples.
Cite any sources in APA format.
Here is something you can use tfor a guide.
It is very important to communicate the meaning of the evidence; otherwise you can’t do anything with it. The presentation of the evidence should be such that it even a layman can understand it easily.
The examiner is responsible for reporting his or her findings and the results of the analysis of the digital evidence examination in an accurate manner. Documentation is an ongoing process throughout the examination. Steps taken during the examination of the digital evidence should be recorded properly.
The entire documentation should be complete, accurate, and comprehensive. The resulting report should be written for the intended audience.
It is crucial to record and document each and everything that is done and used during the procedure of the investigation. This ensures that the procedure is repeatable. These records and documents can be extensive as the job of the investigator is to identify and report on the facts. The level of detail can make or break an investigation. As an investigator, one should never take a short cut in documentation by omitting relevant information. Even the minute information as to who initially reported the suspected incident along with the time, date, and circumstances surrounding the suspected incident should be recorded during an investigation. Also, details of the initial assessment leading to the formal investigation should be recorded.
In addition, it is important to record the names of all persons conducting the investigation. The case number of the incident and the reasons for the investigation should also be recorded. Furthermore, a list of all computer systems included in the investigation along with complete system specifications should be recorded. Network diagrams and applications running on the computer systems previously listed should be recorded. Also, a copy of the policy or policies that relate to accessing and using the systems previously listed should be recorded. A list of administrators responsible for the routine maintenance of the system as well as a detailed list of steps used in collecting and analyzing evidence should be recorded. Finally, an access control list of who had access to the collected evidence at what date and time should be recorded.
In the present times, all scientific examinations are rigorously tested and documented. When scientific information, especially, digital evidence is presented in court; even judges, attorneys, and examiners struggle to understand or effectively present the technology. At time, prosecutors and defense attorneys with large caseloads and severe time constraints wrestle to comprehend even the basic concepts.
Effective courtroom testimony is a critical component of the examiner’s duties. The ability to effectively communicate an understanding of the science, technology, and test analyses involved with a particular case to non-scientists is essential. Maintaining objectivity, professionalism, and scientific integrity is absolutely necessary and will avoid many of the pitfalls that examiners may otherwise face.
Do you need a similar assignment done for you from scratch? We have qualified writers to help you. We assure you an A+ quality paper that is free from plagiarism. Order now for an Amazing Discount!
Use Discount Code “Newclient” for a 15% Discount!
NB: We do not resell papers. Upon ordering, we do an original paper exclusively for you.
Buy Custom Nursing Papers
"Is this question part of your assignment? We Can Help!"
Essay Writing Service
|
{
"url": "https://nursingtermpaper.org/writing-guide-computer-forensic-examiners/",
"source_domain": "nursingtermpaper.org",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "91641",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IUS6IH3WLEBVMMQL7AAZTQJ6XJTBALNN",
"WARC-Concurrent-To": "<urn:uuid:cacb205e-3972-4961-8fa7-beeb7a54dfa2>",
"WARC-Date": "2020-11-27T06:08:20Z",
"WARC-IP-Address": "172.67.137.54",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2EWSPLA7PCUF56Z2OWVINH4INWA3BCLW",
"WARC-Record-ID": "<urn:uuid:b921686b-df24-4cbb-9c0f-366c60d27ace>",
"WARC-Target-URI": "https://nursingtermpaper.org/writing-guide-computer-forensic-examiners/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b5257109-f073-4866-b624-879269337d8b>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-27.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,
42,
43,
100,
118,
145,
163,
164,
206,
207,
412,
413,
415,
416,
726,
759,
760,
762,
763,
807,
808,
810,
811,
1013,
1014,
1319,
1320,
1460,
1461,
2207,
2208,
3056,
3057,
3465,
3466,
3874,
3875,
3877,
3878,
4076,
4126,
4127,
4216,
4217,
4218,
4219,
4245,
4246,
4248,
4249,
4306,
4307
],
"line_end_idx": [
42,
43,
100,
118,
145,
163,
164,
206,
207,
412,
413,
415,
416,
726,
759,
760,
762,
763,
807,
808,
810,
811,
1013,
1014,
1319,
1320,
1460,
1461,
2207,
2208,
3056,
3057,
3465,
3466,
3874,
3875,
3877,
3878,
4076,
4126,
4127,
4216,
4217,
4218,
4219,
4245,
4246,
4248,
4249,
4306,
4307,
4328
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4328,
"ccnet_original_nlines": 51,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40514904260635376,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0054200501181185246,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11788617819547653,
"rps_doc_frac_unique_words": 0.4580152630805969,
"rps_doc_mean_word_length": 5.436641216278076,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.09280252456665,
"rps_doc_word_count": 655,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0426846407353878,
"rps_doc_frac_chars_dupe_6grams": 0.021903960034251213,
"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.019657399505376816,
"rps_doc_frac_chars_top_3gram": 0.03594496101140976,
"rps_doc_frac_chars_top_4gram": 0.015725919976830482,
"rps_doc_books_importance": -315.494384765625,
"rps_doc_books_importance_length_correction": -315.494384765625,
"rps_doc_openwebtext_importance": -212.77938842773438,
"rps_doc_openwebtext_importance_length_correction": -212.77938842773438,
"rps_doc_wikipedia_importance": -130.9298858642578,
"rps_doc_wikipedia_importance_length_correction": -130.9298858642578
},
"fasttext": {
"dclm": 0.03536713123321533,
"english": 0.9470402002334595,
"fineweb_edu_approx": 2.209296703338623,
"eai_general_math": 0.21762895584106445,
"eai_open_web_math": 0.2173250913619995,
"eai_web_code": 0.045455459505319595
}
}
|
{
"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": "363.25",
"labels": {
"level_1": "Social sciences",
"level_2": "Social service and Societies",
"level_3": "Political activists"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,873,614,934,077,484,500
|
Slashdot is powered by your submissions, so send in your scoop
Forgot your password?
typodupeerror
Slashdot Deals: Deal of the Day - Pay What You Want for the Learn to Code Bundle, includes AngularJS, Python, HTML5, Ruby, and more. ×
Submission + - Why don't Android smartphones have IR transmitters? 2
cpaluc writes: I am a dynamic figure often seen sitting on my couch with my Android smartphone. I email friends, I check the weather, I play games, I check my bank balance. I take photos and record video and then edit them before sharing them. I log in to a remote Windows session and save the day at work. I balance, I weave, I dodge, I frolic, and my bills are all paid.
But I can't change the TV channel because my smartphone doesn't have an IR transmitter.
Apologies to Hugh Galagher, but seriously, why don't Android smartphones have IR transmitters? My Nexus 4 is always in my hand, but when I want to change the TV channel, I have to turn the house upside down to find the remote. I would have thought it would be cheap and easy to include an IR transmitter in a smartphone and that a decent Android remote control app would be a killer app. Your thoughts?
Security
Submission + - Paypal Accounts compromised? (overclockers.com.au)
cpaluc writes: I received an odd spam message today. It was odd because, unlike most spam, it included my real name. I searched the address that the message was inviting me to visit and within the first 10 results was a forum discussion involving other people who had received the same message, also with their own real names. It may be too early to draw any conclusions yet, but the common element appears to be everyone's Paypal accounts. If Paypal is indeed the source, then it has some serious explaining to do.
Comment Hiss drive? Barn-door? EQ platform? (Score 4, Informative) 85
Take your work seriously but never take yourself seriously; and do not take what happens either to yourself or your work seriously. -- Booth Tarkington
Working...
|
{
"url": "http://slashdot.org/~cpaluc",
"source_domain": "slashdot.org",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "59460",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AFD6X3LQPSYWYL3X35247TQO3N2IWIFN",
"WARC-Concurrent-To": "<urn:uuid:c75295c7-9878-4dd2-845d-8d2884b0e493>",
"WARC-Date": "2015-11-26T17:00:04Z",
"WARC-IP-Address": "216.34.181.45",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:U6Q2CANZWCE7TH5LKVSDRQCZWDMNLDPL",
"WARC-Record-ID": "<urn:uuid:80573654-fd8c-4950-9965-3142cb12c1ff>",
"WARC-Target-URI": "http://slashdot.org/~cpaluc",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:77ddd527-91b8-46e3-9a38-d32071fea34d>"
},
"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,
63,
64,
66,
67,
68,
69,
91,
105,
240,
241,
310,
311,
684,
685,
773,
774,
1177,
1186,
1187,
1253,
1254,
1770,
1771,
1841,
1842,
1994,
1995
],
"line_end_idx": [
63,
64,
66,
67,
68,
69,
91,
105,
240,
241,
310,
311,
684,
685,
773,
774,
1177,
1186,
1187,
1253,
1254,
1770,
1771,
1841,
1842,
1994,
1995,
2005
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2005,
"ccnet_original_nlines": 27,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3752969205379486,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.059382420033216476,
"rps_doc_frac_lines_end_with_ellipsis": 0.035714291036129,
"rps_doc_frac_no_alph_words": 0.17814727127552032,
"rps_doc_frac_unique_words": 0.5813953280448914,
"rps_doc_mean_word_length": 4.561046600341797,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0.0023753000423312187,
"rps_doc_unigram_entropy": 4.960140705108643,
"rps_doc_word_count": 344,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.054811980575323105,
"rps_doc_frac_chars_dupe_6grams": 0.054811980575323105,
"rps_doc_frac_chars_dupe_7grams": 0.054811980575323105,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0076481797732412815,
"rps_doc_frac_chars_top_3gram": 0.01784575916826725,
"rps_doc_frac_chars_top_4gram": 0.03186742961406708,
"rps_doc_books_importance": -162.66709899902344,
"rps_doc_books_importance_length_correction": -162.66709899902344,
"rps_doc_openwebtext_importance": -110.29676055908203,
"rps_doc_openwebtext_importance_length_correction": -110.29676055908203,
"rps_doc_wikipedia_importance": -48.86615753173828,
"rps_doc_wikipedia_importance_length_correction": -48.86615753173828
},
"fasttext": {
"dclm": 0.021022500470280647,
"english": 0.9631344676017761,
"fineweb_edu_approx": 1.1324695348739624,
"eai_general_math": 0.027841990813612938,
"eai_open_web_math": 0.09844464063644409,
"eai_web_code": 0.013562980107963085
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,347,802,790,139,533,000
|
Diskon kelas baru hingga 25%! Masukkan kupon "lebihcepat" di kelas ini
X
Logo Koala Skodev mengetik
Skodev
Belajar coding dalam bahasa Indonesia
CARA PENULISAN CSS
Artikel ini akan memberikan panduan bagaimana cara penulisan CSS yang benar dan efektif untuk meningkatkan kualitas desain website kamu.
Daftar Isi:
Penentuan Selector
Penggunaan Deklarasi Properti
Penggunaan Penulisan Nilai War...
Penulisan CSS di HTML
CSS (Cascading Style Sheets) merupakan bahasa yang digunakan untuk mengatur tampilan dan desain pada website. Penulisan CSS yang benar dan efektif sangat penting agar website terlihat menarik dan profesional. Berikut ini beberapa cara penulisan CSS.
Penentuan Selector
Pada saat menulis CSS, kamu perlu menentukan selector terlebih dahulu. Selector ini berfungsi untuk memilih elemen HTML yang akan diberi gaya. Terdapat beberapa jenis selector dalam CSS, yaitu element selector, class selector, dan id selector.
Element Selector
Element selector digunakan untuk memilih semua elemen dengan jenis tertentu. Misalnya, jika kamu ingin mewarnai semua teks paragraph (p) menjadi merah, kamu bisa menulis seperti berikut:
p{
color: red;
}
Class Selector
Class selector digunakan untuk memilih elemen dengan class tertentu. Misalnya, jika kamu ingin mengubah latar belakang semua elemen dengan class “konten” menjadi biru, kamu bisa menulis:
.konten{
background-color: blue;
}
ID Selector
ID selector digunakan untuk memilih satu elemen dengan ID tertentu. Misalnya, jika kamu ingin merubah ukuran teks elemen dengan ID “judul” menjadi 24px, kamu bisa menulis:
#judul{
font-size: 24px;
}
Penggunaan Deklarasi Properti
Setelah menentukan selector, kamu perlu menulis deklarasi properti. Deklarasi properti terdiri dari nama properti dan nilai properti. Properti ditulis di dalam kurung kurawal {} dan diakhiri dengan titik koma. Contoh:
p{
font-size: 20px;
color: red;
}
Penggunaan Penulisan Nilai Warna
Dalam CSS, nilai warna bisa ditulis dengan beberapa cara, yaitu menggunakan nama warna, kode hexadecimal, rgb, dan rgba. Contoh:
p{
color: red; /*menggunakan nama warna*/
background-color: #ffffff; /*menggunakan kode hexadecimal*/
border-color: rgb(255,0,0); /*menggunakan rgb*/
box-shadow: 0 0 10px rgba(0,0,0,0.5); /*menggunakan rgba*/
}
Penulisan CSS di HTML
Terdapat tiga cara penulisan CSS di HTML, yaitu inline style, internal style, dan external style. Inline style ditulis langsung di tag HTML, internal style ditulis di dalam tag <style> pada bagian “head” HTML, dan external style ditulis di file CSS terpisah yang nantinya di-link-kan ke file HTML menggunakan tag <link>.
Penulisan CSS yang baik dan benar sangat berpengaruh pada tampilan website. Semoga panduan ini membantu kamu dalam menulis CSS. Selamat mencoba!
Daftar newsletter skodev masukkan emailmu untuk dapat informasi menarik dari dunia koding
|
{
"url": "https://sko.dev/snippet/cara-penulisan-css",
"source_domain": "sko.dev",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "15905",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RD3IAXFDRBBZVP52GGSUCII7TVZWDUIB",
"WARC-Concurrent-To": "<urn:uuid:1a9bfdea-bc3e-47de-9edf-a2a33cbcca0f>",
"WARC-Date": "2023-09-23T11:33:06Z",
"WARC-IP-Address": "76.76.21.21",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EJXK5BDX4LPBQUKB6YKGOYESYEE7S5FF",
"WARC-Record-ID": "<urn:uuid:666fd308-8c7b-4720-9157-4e7b93300537>",
"WARC-Target-URI": "https://sko.dev/snippet/cara-penulisan-css",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:050a85b5-59b7-4e5e-8c49-b446c1ed354a>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-221\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,
71,
72,
74,
101,
102,
109,
110,
148,
149,
168,
169,
306,
307,
319,
320,
339,
369,
403,
425,
426,
676,
677,
696,
697,
941,
942,
959,
960,
1147,
1148,
1151,
1167,
1169,
1170,
1185,
1186,
1373,
1374,
1383,
1411,
1413,
1414,
1426,
1427,
1599,
1600,
1608,
1629,
1631,
1632,
1662,
1663,
1881,
1882,
1885,
1906,
1922,
1924,
1925,
1958,
1959,
2088,
2089,
2092,
2135,
2199,
2251,
2314,
2316,
2317,
2339,
2340,
2661,
2662,
2807,
2808,
2809
],
"line_end_idx": [
71,
72,
74,
101,
102,
109,
110,
148,
149,
168,
169,
306,
307,
319,
320,
339,
369,
403,
425,
426,
676,
677,
696,
697,
941,
942,
959,
960,
1147,
1148,
1151,
1167,
1169,
1170,
1185,
1186,
1373,
1374,
1383,
1411,
1413,
1414,
1426,
1427,
1599,
1600,
1608,
1629,
1631,
1632,
1662,
1663,
1881,
1882,
1885,
1906,
1922,
1924,
1925,
1958,
1959,
2088,
2089,
2092,
2135,
2199,
2251,
2314,
2316,
2317,
2339,
2340,
2661,
2662,
2807,
2808,
2809,
2898
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2898,
"ccnet_original_nlines": 77,
"rps_doc_curly_bracket": 0.004140790086239576,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.007575760129839182,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05303030088543892,
"rps_doc_frac_lines_end_with_ellipsis": 0.012820510193705559,
"rps_doc_frac_no_alph_words": 0.24621212482452393,
"rps_doc_frac_unique_words": 0.41475826501846313,
"rps_doc_mean_word_length": 5.867684364318848,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0.005681820213794708,
"rps_doc_unigram_entropy": 4.749910831451416,
"rps_doc_word_count": 393,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06461405009031296,
"rps_doc_frac_chars_dupe_6grams": 0.026886379346251488,
"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.04163052886724472,
"rps_doc_frac_chars_top_3gram": 0.027753690257668495,
"rps_doc_frac_chars_top_4gram": 0.023417169228196144,
"rps_doc_books_importance": -248.0462188720703,
"rps_doc_books_importance_length_correction": -248.0462188720703,
"rps_doc_openwebtext_importance": -145.80548095703125,
"rps_doc_openwebtext_importance_length_correction": -145.80548095703125,
"rps_doc_wikipedia_importance": -109.42251586914062,
"rps_doc_wikipedia_importance_length_correction": -109.42251586914062
},
"fasttext": {
"dclm": 0.8851985931396484,
"english": 0.00590158998966217,
"fineweb_edu_approx": 1.9553452730178833,
"eai_general_math": 0.0000014299999975264654,
"eai_open_web_math": 0.23768460750579834,
"eai_web_code": 0.7726709246635437
}
}
|
{
"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": "-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": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,364,758,559,334,831,600
|
Prioritizing Your Dark0de Market TO FIND THE Most Out Of Your Business
You can look at the next links to get information about us and our products. This process is vastly more time-efficient and allows you to put your web monitoring on auto-pilot, reducing costs while concurrently increasing efficiency. As cyber-criminals accept new systems it’s becoming more and more necessary for security experts to do the same to be able to stay forward. Other markets include Icarus market, Dark0de Reborn, Canada HQ, Monopoly Market, and more. The total value of bitcoin transacted on the dark web jumped by 65% in 2019.
The European Union is along the way of creating a “digital green certificate” which they hope to move out by June to permit its people and residents to travel across borders. In america, proof vaccination could grant people access to certain venues, and employers may necessitate it of their employees to go back to the place of work. With COVID-19 screening becoming more popular, the price for negative test results is really as little as $25. Vaccination cards are harder forward by and can sell for more, around $200.
The experts sent $500 to a Bitcoin wallet, and while they’ve received a FedEx shipping and delivery label, they’ve yet to receive the shipment. In lots of marketplaces, consumers don’t have access to everything they’d like to make a decision but still get to see and feel something, such as a toaster or a car, before buying it. Malware is actually information, so keeping products secret is often critically important. Take, for example, the relationship across the purchase of a software vulnerability.
Because, we’ve not seen any other darknet market with product-categories such as chem. Equipment, APT, shill marketing, racketeering, motor vehicle theft, problem, camgirls etc. The second top-bar shows the market charges for currencies, has a search-bar, and links to user-account and cart. We’re scribbling this Dark0de market review today because it appears to be the most “unique” and feature-rich darknet market in existence currently.
Dark0de’s focus is on creating an increased quality market both in Design and Features. For more system security, we recommend you run a secure operating-system like Tails or Whonix on your dedicated system for darknet activities. We also recommend utilizing a VPN as yet another security measure since TOR will only anonymize your browsing classes however, not other traffic. Switch to the light mode that’s kinder on your eye at morning. Change to the dark setting that’s kinder on your eye during the night time.
This is why the time for Car Finalize of most Escrow orders is 2 weeks. When these 2 weeks are over and there is no open up dispute for an order you will receive the money from that order in your Dark0de Wallet. If you have received your order and everything is appropriate we ask you to release the Escrow funds as soon as possible so the seller can also gather his area of the deal. If you’re satisfied with your experience you can give the seller a corresponding review. We allow feedback changes up to 7 days after the original responses was given, after this period you can’t change the given reviews anymore. When you have an Escrow order that was never shipped, never received and/or the seller is not responding to your messages you can open up a dispute for the order.
World market has strong anti-DDoS protection, is user-friendly, and easy to get around. Feedback, trust rating, and supplier level systems produced and optimized from AlphaBay and other old marketplaces. Featured Products with an auction system to allow anyone to promote their products on Deep Sea Market’s homepage. State-of-the-art hot/cool wallet system with funds isolation and much more.
Nearly seven days later, these directories were published on the market on the Dark0de forum by consumer ShinyHunters. Most often, this happens when the platform controller suspects police are closing in. They pre-empt the move by taking down the platform, working off with any customer money they eventually hold at the time.
TOR hyperlinks tend to be unstable as well as can’t be counted at for every information move. Users should also observe that dark web hyperlinks can’t be it easily keep in mind since they are available in alphanumeric kind. Due to the range of goods and services found for sale, as well as the discussions that happen around these sales, dark web marketplaces can be hugely valuable sources of data on legal activity. Therefore, they are usually under extreme scrutiny from law enforcement and security experts alike. It contains the latest security features combined with a beautiful frontend design. Dark fox is the only darknet market that currently has a debit card auto shop.
There’s been much issue on the potency of the Darkode Market Link. I have individually been debating this for a number of days now, therefore far, I have decided that it’s an alright tool to use if you intend on using it correctly. First of all, a “versus” keyword search will come back all the onion websites that are associated with each of the shown keywords. That’s great theoretically – imagine if you could search for a particular term, expression or idiom and get a list of all the dark web sites that related compared to that phrase, term or idiom? It might be interesting to see how many links there would be between many of these “dark net” sites. The Darkode forum, launched in 2007, was once a hotbed for criminals to snap up from hacking software to access to affected company servers.
This entry was posted in Uncategorized and tagged , , , . Bookmark the permalink.
|
{
"url": "https://wwwblackmarket.com/prioritizing-your-dark0de-market-to-find-the-most-out-of-your-business/",
"source_domain": "wwwblackmarket.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "27058",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RIV5EDWGYJ2E4IFFNBCO5W5XCYRX2I75",
"WARC-Concurrent-To": "<urn:uuid:b3efae5e-5d32-43a5-baca-72a2dd8b9ff1>",
"WARC-Date": "2021-10-19T20:28:18Z",
"WARC-IP-Address": "172.67.223.70",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AYA2G3RIUADCQZRLEU3VF3YOUT5MJRLA",
"WARC-Record-ID": "<urn:uuid:1dc1e24c-67d6-46c6-8a8c-d445ba8528dd>",
"WARC-Target-URI": "https://wwwblackmarket.com/prioritizing-your-dark0de-market-to-find-the-most-out-of-your-business/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a5126bce-357e-449b-afb3-bcfd3bf51119>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-40\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
71,
72,
614,
615,
1137,
1138,
1643,
1644,
2085,
2086,
2602,
2603,
3381,
3382,
3776,
3777,
4104,
4105,
4786,
4787,
5586,
5587
],
"line_end_idx": [
71,
72,
614,
615,
1137,
1138,
1643,
1644,
2085,
2086,
2602,
2603,
3381,
3382,
3776,
3777,
4104,
4105,
4786,
4787,
5586,
5587,
5668
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5668,
"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.4422735273838043,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009769090451300144,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14031971991062164,
"rps_doc_frac_unique_words": 0.5090137720108032,
"rps_doc_mean_word_length": 4.8674445152282715,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.618683338165283,
"rps_doc_word_count": 943,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.009150329977273941,
"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.004357299767434597,
"rps_doc_frac_chars_top_3gram": 0.004357299767434597,
"rps_doc_frac_chars_top_4gram": 0.007843139581382275,
"rps_doc_books_importance": -457.569091796875,
"rps_doc_books_importance_length_correction": -457.569091796875,
"rps_doc_openwebtext_importance": -328.35894775390625,
"rps_doc_openwebtext_importance_length_correction": -328.35894775390625,
"rps_doc_wikipedia_importance": -235.73660278320312,
"rps_doc_wikipedia_importance_length_correction": -235.73660278320312
},
"fasttext": {
"dclm": 0.019073670729994774,
"english": 0.9560522437095642,
"fineweb_edu_approx": 1.2297797203063965,
"eai_general_math": 0.06495559215545654,
"eai_open_web_math": 0.10968785732984543,
"eai_web_code": 0.0037532399874180555
}
}
|
{
"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": "363.25",
"labels": {
"level_1": "Social sciences",
"level_2": "Social service and Societies",
"level_3": "Political activists"
}
}
},
"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": "14",
"label": "Reviews/Critiques"
}
},
"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": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,135,937,646,520,116,000
|
Plotly Dash Apache Server: Advantages, Disadvantages, and FAQs
Introduction
Welcome to our comprehensive guide on Plotly Dash Apache Server. In today’s digital age, data visualization has become an integral part of businesses and organizations. Companies are generating massive amounts of data, and they require an efficient method to make sense of this information and gain insights to make informed decisions. Dash is a tool that has been gaining popularity as a powerful open-source framework for creating web applications and interactive dashboards that provide real-time data visualization and insightful reporting. In this article, we will discuss everything you need to know about Plotly Dash Apache Server, its advantages, disadvantages, and other essential information.
What is Plotly Dash Apache Server?
Plotly Dash is a modern, open-source Python framework for building web applications and interactive dashboards that provide real-time data visualization and insightful reporting. It combines the power of Python, React.js, and Plotly.js to create a tool that is easy to use, highly customizable, and scalable. Apache is a powerful open-source web server that is widely used for hosting and serving web applications built using various programming languages. Plotly Dash Apache Server is a combination of these two technologies that allows users to host their Plotly dashboards on an Apache web server.
How does Plotly Dash Apache Server work?
Plotly Dash applications are built using Python, and they can run on any web server that supports Python. However, when you use Plotly Dash Apache Server, your application is hosted on an Apache web server. Apache is a powerful and widely used web server that is capable of serving web applications built using various programming languages, including Python. Apache is highly customizable and scalable, making it an ideal choice for hosting Plotly Dash applications.
Advantages of Plotly Dash Apache Server
Plotly Dash Apache Server offers numerous benefits, including:
Advantages
Scalability
Customizability
Real-time data visualization
Cross-platform compatibility
Easy to learn and use
Supports various data sources
Scalability
One of the significant advantages of using Plotly Dash Apache Server is its scalability. Apache is a powerful and highly scalable web server that can handle large volumes of traffic and requests. Therefore, when you use Plotly Dash Apache Server, your application can handle a large number of users and requests without any issues, making it ideal for use in large organizations or businesses.
Customizability
Another advantage of Plotly Dash Apache Server is its customizability. Apache is highly customizable, and you can configure it to suit your specific needs and requirements. This allows you to create a unique and personalized dashboard that meets your business needs.
Real-time Data Visualization
Plotly Dash Apache Server provides real-time data visualization, which is essential for businesses that need to make informed decisions quickly. With real-time data visualization, you can monitor your data in real-time and respond quickly to any changes or trends.
Cross-platform Compatibility
Plotly Dash Apache Server is cross-platform compatible, meaning it can run on any operating system, including Windows, Mac, and Linux. This makes it accessible to a broad range of users, regardless of their preferred operating system.
Easy to Learn and Use
Plotly Dash Apache Server is easy to learn and use, even for users without any programming experience. It comes with comprehensive documentation and a rich set of examples that make it easy for users to get started quickly and without any hassle.
Supports Various Data Sources
Plotly Dash Apache Server supports various data sources, including CSV, Excel, SQL, and NoSQL databases. This allows you to connect to your data source of choice and create custom queries to extract the relevant data.
Disadvantages of Plotly Dash Apache Server
While Plotly Dash Apache Server has numerous advantages, there are also some disadvantages you should be aware of, including:
Disadvantages
Requires a web server
Limited personalization
Complexity
No native mobile app support
Resource-intensive
Requires a Web Server
One of the main disadvantages of using Plotly Dash Apache Server is that it requires a web server to host your application. While this is not a significant issue for most users, it can pose some challenges for users who do not have access to a web server or lack the technical knowledge to set up their own server.
Limited Personalization
Another disadvantage of Plotly Dash Apache Server is that it allows limited personalization options. The dashboard layout and style are defined by the template you choose, and customization options are limited to changing colors and fonts. This can be a significant drawback for users who require a high degree of personalization.
READ ALSO Check Server Type Apache: Exploring its Pros and Cons
Complexity
Plotly Dash Apache Server can be complex, especially for users without any experience in programming or web development. It requires a good understanding of Python, HTML, CSS, and JavaScript, making it challenging for beginners to get started.
No Native Mobile App Support
Plotly Dash Apache Server does not provide native mobile app support. While it is possible to create a responsive dashboard that works on mobile devices, creating a native mobile app requires additional development efforts.
Resource-Intensive
Plotly Dash Apache Server can be resource-intensive, especially when dealing with large datasets. This means that it requires a powerful server with a lot of CPU and memory resources to provide a smooth user experience.
FAQs
What are the system requirements to install Plotly Dash Apache Server?
To install Plotly Dash Apache Server, you need a system that meets the following requirements:
Requirements
Python 3.x
Flask 1.x
Dash 1.x
Apache web server
Mod_WSGI module
What programming languages does Plotly Dash support?
Plotly Dash supports Python.
Can I use Plotly Dash Apache Server to create real-time dashboards?
Yes, Plotly Dash Apache Server provides real-time data visualization, making it an ideal choice for creating real-time dashboards.
Is Plotly Dash Apache Server open-source?
Yes, Plotly Dash Apache Server is open-source.
What data sources does Plotly Dash Apache Server support?
Plotly Dash Apache Server supports various data sources, including CSV, Excel, SQL, and NoSQL databases.
Is Plotly Dash Apache Server easy to learn and use?
Yes, Plotly Dash Apache Server is easy to learn and use, even for users without any programming experience. It comes with comprehensive documentation and a rich set of examples that make it easy for users to get started quickly and without any hassle.
Can I create custom themes for my dashboard using Plotly Dash Apache Server?
Yes, you can create custom themes for your dashboard using Plotly Dash Apache Server. However, customization options are limited to changing colors and fonts.
Can I use Plotly Dash Apache Server to create mobile applications?
Plotly Dash Apache Server does not provide native mobile app support. While it is possible to create a responsive dashboard that works on mobile devices, creating a native mobile app requires additional development efforts.
Is Plotly Dash Apache Server resource-intensive?
Yes, Plotly Dash Apache Server can be resource-intensive, especially when dealing with large datasets. This means that it requires a powerful server with a lot of CPU and memory resources to provide a smooth user experience.
How can I optimize my dashboard’s performance using Plotly Dash Apache Server?
To optimize your dashboard’s performance using Plotly Dash Apache Server, you can follow these best practices:
• Use caching to reduce server load
• Optimize your queries to reduce the amount of data retrieved from the server
• Use pagination to reduce the number of records displayed on a single page
• Minimize the use of external CSS and JavaScript files
• Optimize your images and other media files
Does Plotly Dash Apache Server provide multi-language support?
Plotly Dash Apache Server does not provide multi-language support natively, but it is possible to use third-party libraries to add this functionality.
Can I add authentication and authorization to my dashboard using Plotly Dash Apache Server?
Yes, you can add authentication and authorization to your dashboard using Plotly Dash Apache Server. The framework provides built-in support for Flask-Login and Flask-Principal, which makes it easy to add user authentication and authorization to your application.
How can I deploy my Plotly Dash Apache Server dashboard to a production environment?
To deploy your Plotly Dash Apache Server dashboard to a production environment, you can follow these steps:
1. Choose a suitable web server and hosting provider
2. Install and configure the necessary software and dependencies
3. Upload your application code to the server
4. Configure your web server to run your application
5. Test your application to ensure it works as expected
How can I troubleshoot issues with my Plotly Dash Apache Server dashboard?
To troubleshoot issues with your Plotly Dash Apache Server dashboard, you can follow these best practices:
• Check your server and application logs for errors and warnings
• Use debugging tools to identify and fix issues
• Test your application on different devices and browsers
• Check your network configuration and firewall settings
• Get help from the community or professional support services
READ ALSO HackThisSite Apache Web Server: An In-Depth Analysis
Conclusion
In conclusion, Plotly Dash Apache Server is a powerful and versatile tool for creating web applications and interactive dashboards that provide real-time data visualization and insightful reporting. It offers numerous advantages, including scalability, customizability, and real-time data visualization, making it an ideal choice for businesses and organizations that require a reliable and efficient tool for data analysis and reporting. However, it also has some disadvantages, including complexity and resource-intensiveness, that users should be aware of before using it. Overall, if you’re looking for a powerful and customizable solution for data visualization and reporting, Plotly Dash Apache Server is definitely worth considering.
Closing
We hope this guide has provided you with valuable insights into Plotly Dash Apache Server and its advantages and disadvantages. However, we encourage you to do further research and testing before making a decision on whether to use it for your business or organization. Remember that every tool has its strengths and weaknesses, and you should consider your specific needs and requirements before choosing a particular tool.
Disclaimer
The information provided in this article is for educational and informational purposes only. The author and publisher of this article make no representations or warranties with respect to the accuracy or completeness of the contents of this article and accept no liability for any losses or damages arising from the use of this information.
Video:Plotly Dash Apache Server: Advantages, Disadvantages, and FAQs
|
{
"url": "https://www.cybexhosting.net/plotly-dash-apache-server",
"source_domain": "www.cybexhosting.net",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "86882",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:35CD2E4RX2KEGKB2FM4FKVULXDE2MRPD",
"WARC-Concurrent-To": "<urn:uuid:814987c6-f1cd-4eed-b85f-831f26388e8e>",
"WARC-Date": "2024-05-26T15:07:47Z",
"WARC-IP-Address": "103.150.60.198",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3DYHWI3ZCTHSYHMC6ZBYQW74FR2RXM3J",
"WARC-Record-ID": "<urn:uuid:77cfe0d2-e088-4a21-aa4d-b2640d5f1b40>",
"WARC-Target-URI": "https://www.cybexhosting.net/plotly-dash-apache-server",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8583c0c7-42e6-4e9f-a6c3-1642ab381bfd>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-253\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,
63,
64,
77,
78,
781,
782,
817,
818,
1419,
1420,
1461,
1462,
1930,
1931,
1971,
1972,
2035,
2036,
2047,
2059,
2075,
2104,
2133,
2155,
2185,
2186,
2198,
2199,
2593,
2594,
2610,
2611,
2878,
2879,
2908,
2909,
3174,
3175,
3204,
3205,
3440,
3441,
3463,
3464,
3711,
3712,
3742,
3743,
3961,
3962,
4005,
4006,
4132,
4133,
4147,
4169,
4193,
4204,
4233,
4252,
4253,
4275,
4276,
4591,
4592,
4616,
4617,
4948,
4949,
5014,
5015,
5026,
5027,
5271,
5272,
5301,
5302,
5526,
5527,
5546,
5547,
5767,
5768,
5773,
5774,
5845,
5846,
5941,
5942,
5955,
5966,
5976,
5985,
6003,
6019,
6020,
6073,
6074,
6103,
6104,
6172,
6173,
6304,
6305,
6347,
6348,
6395,
6396,
6454,
6455,
6560,
6561,
6613,
6614,
6866,
6867,
6944,
6945,
7104,
7105,
7172,
7173,
7397,
7398,
7447,
7448,
7673,
7674,
7753,
7754,
7865,
7866,
7904,
7985,
8063,
8121,
8168,
8169,
8232,
8233,
8384,
8385,
8477,
8478,
8742,
8743,
8828,
8829,
8937,
8938,
8993,
9060,
9108,
9163,
9221,
9222,
9297,
9298,
9405,
9406,
9473,
9524,
9584,
9643,
9708,
9772,
9773,
9784,
9785,
10526,
10527,
10535,
10536,
10961,
10962,
10973,
10974,
11315,
11316
],
"line_end_idx": [
63,
64,
77,
78,
781,
782,
817,
818,
1419,
1420,
1461,
1462,
1930,
1931,
1971,
1972,
2035,
2036,
2047,
2059,
2075,
2104,
2133,
2155,
2185,
2186,
2198,
2199,
2593,
2594,
2610,
2611,
2878,
2879,
2908,
2909,
3174,
3175,
3204,
3205,
3440,
3441,
3463,
3464,
3711,
3712,
3742,
3743,
3961,
3962,
4005,
4006,
4132,
4133,
4147,
4169,
4193,
4204,
4233,
4252,
4253,
4275,
4276,
4591,
4592,
4616,
4617,
4948,
4949,
5014,
5015,
5026,
5027,
5271,
5272,
5301,
5302,
5526,
5527,
5546,
5547,
5767,
5768,
5773,
5774,
5845,
5846,
5941,
5942,
5955,
5966,
5976,
5985,
6003,
6019,
6020,
6073,
6074,
6103,
6104,
6172,
6173,
6304,
6305,
6347,
6348,
6395,
6396,
6454,
6455,
6560,
6561,
6613,
6614,
6866,
6867,
6944,
6945,
7104,
7105,
7172,
7173,
7397,
7398,
7447,
7448,
7673,
7674,
7753,
7754,
7865,
7866,
7904,
7985,
8063,
8121,
8168,
8169,
8232,
8233,
8384,
8385,
8477,
8478,
8742,
8743,
8828,
8829,
8937,
8938,
8993,
9060,
9108,
9163,
9221,
9222,
9297,
9298,
9405,
9406,
9473,
9524,
9584,
9643,
9708,
9772,
9773,
9784,
9785,
10526,
10527,
10535,
10536,
10961,
10962,
10973,
10974,
11315,
11316,
11384
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11384,
"ccnet_original_nlines": 179,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3220595717430115,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010095910169184208,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11862695962190628,
"rps_doc_frac_unique_words": 0.24346309900283813,
"rps_doc_mean_word_length": 5.428820610046387,
"rps_doc_num_sentences": 89,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.142724514007568,
"rps_doc_word_count": 1721,
"rps_doc_frac_chars_dupe_10grams": 0.18420207500457764,
"rps_doc_frac_chars_dupe_5grams": 0.41710370779037476,
"rps_doc_frac_chars_dupe_6grams": 0.3483891785144806,
"rps_doc_frac_chars_dupe_7grams": 0.31306859850883484,
"rps_doc_frac_chars_dupe_8grams": 0.26308465003967285,
"rps_doc_frac_chars_dupe_9grams": 0.23600557446479797,
"rps_doc_frac_chars_top_2gram": 0.06100824102759361,
"rps_doc_frac_chars_top_3gram": 0.0907631367444992,
"rps_doc_frac_chars_top_4gram": 0.12244460731744766,
"rps_doc_books_importance": -860.6588134765625,
"rps_doc_books_importance_length_correction": -860.6588134765625,
"rps_doc_openwebtext_importance": -401.0002746582031,
"rps_doc_openwebtext_importance_length_correction": -401.0002746582031,
"rps_doc_wikipedia_importance": -398.26031494140625,
"rps_doc_wikipedia_importance_length_correction": -398.26031494140625
},
"fasttext": {
"dclm": 0.7129040360450745,
"english": 0.8956255912780762,
"fineweb_edu_approx": 1.9721273183822632,
"eai_general_math": 0.11121047288179398,
"eai_open_web_math": 0.08271604776382446,
"eai_web_code": 0.9084005951881409
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.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": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "9",
"label": "FAQ"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,941,468,374,226,253,300
|
Jump to content
Movie playing software
homers
Share
7 posts in this topic
Recommended Posts
The reason why avi playback is fishy is because there are a ton of different codecs covered under avi. One file can have an entirely different codec from another file that shares the same avi extension.QuickTime will offer limited avi playback and that limit gets bigger with Perian. But it still can't play 100% of the avi files out there. Since all the best porn is avi (sarcasm, btw), you need something like VLC or MPlayer to play all of those avi files.
Quicktime is rubbish, it can't go full screen.
/facepalmTHE NEWEST VERSION WILL DO FULL SCREEN FOR FREE.
Link to comment
Share on other sites
Share
×
×
• Create New...
|
{
"url": "https://www.insanelymac.com/forum/topic/63355-movie-playing-software/",
"source_domain": "www.insanelymac.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "118722",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DWS35I63XSJISM7YM6AJINAR4N754CBK",
"WARC-Concurrent-To": "<urn:uuid:6b88cf89-a30b-4364-92a6-45761f936252>",
"WARC-Date": "2023-09-30T02:27:22Z",
"WARC-IP-Address": "192.64.80.34",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6FPU2Y2Y2M6X6NYFYBXFL2RYVXSGTRFU",
"WARC-Record-ID": "<urn:uuid:764ce6d6-b28f-424a-8815-3c4701aca0f6>",
"WARC-Target-URI": "https://www.insanelymac.com/forum/topic/63355-movie-playing-software/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7407e27a-580a-4edf-8e34-1d52a5cff100>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-168\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,
16,
17,
40,
41,
42,
49,
56,
57,
79,
80,
98,
99,
558,
559,
606,
664,
680,
701,
702,
709,
710,
712,
714
],
"line_end_idx": [
16,
17,
40,
41,
42,
49,
56,
57,
79,
80,
98,
99,
558,
559,
606,
664,
680,
701,
702,
709,
710,
712,
714,
731
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 731,
"ccnet_original_nlines": 23,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3877550959587097,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06122449040412903,
"rps_doc_frac_lines_end_with_ellipsis": 0.0416666716337204,
"rps_doc_frac_no_alph_words": 0.1428571343421936,
"rps_doc_frac_unique_words": 0.7421875,
"rps_doc_mean_word_length": 4.46875,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0.00680272001773119,
"rps_doc_unigram_entropy": 4.419267177581787,
"rps_doc_word_count": 128,
"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.03846153989434242,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -78.98899841308594,
"rps_doc_books_importance_length_correction": -78.99398803710938,
"rps_doc_openwebtext_importance": -47.984649658203125,
"rps_doc_openwebtext_importance_length_correction": -47.98964309692383,
"rps_doc_wikipedia_importance": -37.6978759765625,
"rps_doc_wikipedia_importance_length_correction": -37.70286560058594
},
"fasttext": {
"dclm": 0.870056688785553,
"english": 0.9124298691749573,
"fineweb_edu_approx": 1.0071858167648315,
"eai_general_math": 0.0023682699538767338,
"eai_open_web_math": 0.16394412517547607,
"eai_web_code": 0.00005089999831398018
}
}
|
{
"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": "791.4372",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,777,024,614,680,623,000
|
1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.
xrandr on laptop with second monitor
Discussion in 'Other Window Managers' started by gpatrick, Apr 11, 2010.
1. gpatrick
gpatrick New Member
Messages:
320
Thanks Received:
32
Have a second 23" monitor that is connected to the VGA port. The laptop has a resolution of 1366x768 and the monitor has a resolution of 1920x1080.
Currently I have the laptop screen set to 1366x768 but with Windowmaker my dockapps are not on the right of the screen and cannot be moved. They're only 2/3's of the way to the right. I have the external screen to the left of the laptop and it is set using xrandr to 1920x1080.
How do I set it so the external screen is set to the left using 1920x1080 and the laptop to 1366x768. I also want the external screen to be an additional screen while currently it is a duplicate of the laptop monitor.
This is what I want but get the following error:
Code:
$ xrandr --output VGA-0 --mode 1920x1080 --left-of LVDS --output LVDS --mode 1366x768
xrandr: screen cannot be larger than 1920x1920 (desired size 3286x1080)
Code:
$ xrandr -q
Screen 0: minimum 320 x 200, current 1920 x 1080, maximum 1920 x 1920
VGA-0 connected 1920x1080+0+0 (normal left inverted right x axis y axis) 510mm x 287mm
1920x1080 60.0*+
1680x1050 60.0
1280x1024 60.0
1440x900 59.9
1280x800 59.8
1152x864 75.0
1024x768 70.1 60.0
800x600 60.3 56.2
640x480 66.7 59.9
720x400 70.1
LVDS connected 1366x768+0+0 (normal left inverted right x axis y axis) 344mm x 194mm
1366x768 60.0*+
1280x720 59.9
1152x768 59.8
1024x768 59.9
800x600 59.9
640x480 59.4
HDMI-0 disconnected (normal left inverted right x axis y axis)
I found this on an xrandr wiki and I put it in a file that is called before wmaker in the .xinitrc. However my mouse doesn't work and the screens are clones:
Code:
# If an external monitor is connected, place it with xrandr
# External output may be "VGA" or "VGA-0" or "DVI-0" or "TMDS-1"
EXTERNAL_OUTPUT="VGA-0"
INTERNAL_OUTPUT="LVDS"
# EXTERNAL_LOCATION may be one of: left, right, above, or below
EXTERNAL_LOCATION="left"
case "$EXTERNAL_LOCATION" in
left|LEFT)
EXTERNAL_LOCATION="--left-of $INTERNAL_OUTPUT"
;;
right|RIGHT)
EXTERNAL_LOCATION="--right-of $INTERNAL_OUTPUT"
;;
top|TOP|above|ABOVE)
EXTERNAL_LOCATION="--above $INTERNAL_OUTPUT"
;;
bottom|BOTTOM|below|BELOW)
EXTERNAL_LOCATION="--below $INTERNAL_OUTPUT"
;;
*)
EXTERNAL_LOCATION="--left-of $INTERNAL_OUTPUT"
;;
esac
xrandr |grep $EXTERNAL_OUTPUT | grep " connected "
if [ $? -eq 0 ]; then
xrandr --output $INTERNAL_OUTPUT --auto --output $EXTERNAL_OUTPUT --auto $EXTERNAL_LOCATION
# Alternative command in case of trouble:
# (sleep 2; xrandr --output $INTERNAL_OUTPUT --auto --output $EXTERNAL_OUTPUT --auto $EXTERNAL_LOCATION) &
else
xrandr --output $INTERNAL_OUTPUT --auto --output $EXTERNAL_OUTPUT --off
fi
2. adamk
adamk New Member
Messages:
1,624
Thanks Received:
265
Code:
xrandr: screen cannot be larger than 1920x1920 (desired size 3286x1080)
You need to create an xorg.conf file and add a Virtual directive in the Display SubSection. Something alone these lines:
Code:
Section "Screen"
Identifier "ati"
Device "ati"
DefaultDepth 24
SubSection "Display"
Viewport 0 0
Depth 24
Virtual 3286 1080
EndSubSection
EndSection
3. gpatrick
gpatrick New Member
Messages:
320
Thanks Received:
32
Thanks that worked. Now though since I reinstalled I am having a problem that VGA-0 becomes the primary screen at boot and LVDS is blank.
When I run
Code:
$ xrandr --output VGA-0 --mode 1920x1080 --left-of LVDS --output LVDS --mode 1366x768
It is setting VGA-0 to the correct resolution, but LVDS is blank. Below is the output of 'xrandr -q'
Code:
$ xrandr -q
Screen 0: minimum 320 x 200, current 3286 x 1080, maximum 3286 x 1080
VGA-0 connected 1920x1080+0+0 (normal left inverted right x axis y axis) 510mm x 287mm
1920x1080 60.0*+
1680x1050 60.0
1280x1024 60.0
1440x900 59.9
1280x800 59.8
1152x864 75.0
1024x768 70.1 60.0
800x600 60.3 56.2
640x480 66.7 59.9
720x400 70.1
LVDS connected 1366x768+1920+0 (normal left inverted right x axis y axis) 344mm x 194mm
1366x768 60.0*+
1280x720 59.9
1152x768 59.8
1024x768 59.9
800x600 59.9
640x480 59.4
HDMI-0 disconnected (normal left inverted right x axis y axis)
I have a subsection with a line of 'Virtual 3286 1080' in xorg.conf.
Code:
$ cat /etc/X11/xorg.conf
Section "ServerLayout"
Identifier "X.org Configured"
Screen 0 "Screen0" 0 0
InputDevice "Mouse0" "CorePointer"
InputDevice "Keyboard0" "CoreKeyboard"
EndSection
Section "Files"
ModulePath "/usr/local/lib/xorg/modules"
FontPath "/usr/local/lib/X11/fonts/misc/"
FontPath "/usr/local/lib/X11/fonts/TTF/"
FontPath "/usr/local/lib/X11/fonts/OTF"
FontPath "/usr/local/lib/X11/fonts/Type1/"
FontPath "/usr/local/lib/X11/fonts/100dpi/"
FontPath "/usr/local/lib/X11/fonts/75dpi/"
EndSection
Section "Module"
Load "dbe"
Load "dri"
Load "dri2"
Load "extmod"
Load "glx"
Load "record"
EndSection
Section "InputDevice"
Identifier "Keyboard0"
Driver "kbd"
EndSection
Section "InputDevice"
Identifier "Mouse0"
Driver "mouse"
Option "Protocol" "auto"
Option "Device" "/dev/sysmouse"
Option "ZAxisMapping" "4 5 6 7"
EndSection
Section "Monitor"
#DisplaySize 340 190 # mm
Identifier "Monitor0"
VendorName "LGD"
ModelName "d801"
EndSection
Section "Device"
### Available Driver options are:-
### Values: <i>: integer, <f>: float, <bool>: "True"/"False",
### <string>: "String", <freq>: "<f> Hz/kHz/MHz"
### [arg]: arg optional
#Option "NoAccel" # [<bool>]
#Option "SWcursor" # [<bool>]
#Option "Dac6Bit" # [<bool>]
#Option "Dac8Bit" # [<bool>]
#Option "BusType" # [<str>]
#Option "CPPIOMode" # [<bool>]
#Option "CPusecTimeout" # <i>
#Option "AGPMode" # <i>
#Option "AGPFastWrite" # [<bool>]
#Option "AGPSize" # <i>
#Option "GARTSize" # <i>
#Option "RingSize" # <i>
#Option "BufferSize" # <i>
#Option "EnableDepthMoves" # [<bool>]
#Option "EnablePageFlip" # [<bool>]
#Option "NoBackBuffer" # [<bool>]
#Option "DMAForXv" # [<bool>]
#Option "FBTexPercent" # <i>
#Option "DepthBits" # <i>
#Option "PCIAPERSize" # <i>
#Option "AccelDFS" # [<bool>]
#Option "IgnoreEDID" # [<bool>]
#Option "DisplayPriority" # [<str>]
#Option "PanelSize" # [<str>]
#Option "ForceMinDotClock" # <freq>
#Option "ColorTiling" # [<bool>]
#Option "VideoKey" # <i>
#Option "RageTheatreCrystal" # <i>
#Option "RageTheatreTunerPort" # <i>
#Option "RageTheatreCompositePort" # <i>
#Option "RageTheatreSVideoPort" # <i>
#Option "TunerType" # <i>
#Option "RageTheatreMicrocPath" # <str>
#Option "RageTheatreMicrocType" # <str>
#Option "ScalerWidth" # <i>
#Option "RenderAccel" # [<bool>]
#Option "SubPixelOrder" # [<str>]
#Option "ShowCache" # [<bool>]
#Option "DynamicClocks" # [<bool>]
#Option "VGAAccess" # [<bool>]
#Option "ReverseDDC" # [<bool>]
#Option "LVDSProbePLL" # [<bool>]
#Option "AccelMethod" # <str>
#Option "DRI" # [<bool>]
#Option "ConnectorTable" # <str>
#Option "DefaultConnectorTable" # [<bool>]
#Option "DefaultTMDSPLL" # [<bool>]
#Option "TVDACLoadDetect" # [<bool>]
#Option "ForceTVOut" # [<bool>]
#Option "TVStandard" # <str>
#Option "IgnoreLidStatus" # [<bool>]
#Option "DefaultTVDACAdj" # [<bool>]
#Option "Int10" # [<bool>]
#Option "EXAVSync" # [<bool>]
#Option "ATOMTVOut" # [<bool>]
#Option "R4xxATOM" # [<bool>]
Identifier "Card0"
Driver "radeon"
VendorName "ATI Technologies Inc"
BoardName "Unknown Board"
BusID "PCI:1:5:0"
EndSection
Section "Screen"
Identifier "Screen0"
Device "Card0"
Monitor "Monitor0"
SubSection "Display"
Viewport 0 0
Depth 1
EndSubSection
SubSection "Display"
Viewport 0 0
Depth 4
EndSubSection
SubSection "Display"
Viewport 0 0
Depth 8
EndSubSection
SubSection "Display"
Viewport 0 0
Depth 15
EndSubSection
SubSection "Display"
Viewport 0 0
Depth 16
EndSubSection
SubSection "Display"
Viewport 0 0
Depth 24
Virtual 3286 1080
EndSubSection
EndSection
Want LVDS to be the primary display at boot and VGA-0 to not be a clone but just an extended desktop. Using xfce4 right now but may go back to Windowmaker.
4. adamk
adamk New Member
Messages:
1,624
Thanks Received:
265
There is no way to force LVDS to be primary at boot, or even at X start. You can use 'xrandr --output LVDS --primary' to force it to be primary once X starts. However, from what I'm understanding, the LVDS just stays blank now no matter what?
Adam
gpatrick thanks for this.
5. aragon
aragon New Member
Messages:
2,031
Thanks Received:
252
There is, but it'll require the OP to switch to the radeonhd driver and adding something like this to xorg.conf:
Code:
Option "RROutputOrder" "DVI-I_1/digital VGA_1"
gpatrick thanks for this.
6. gpatrick
gpatrick New Member
Messages:
320
Thanks Received:
32
If I use
Code:
xrandr --output VGA-0 --off
Then LVDS comes on of course, but when I run
Code:
xrandr --auto --output VGA-0 --mode 1920x1080 --left-of LVDS --auto
Then LVDS goes blank and VGA-0 becomes the desktop. And if I'm using Windowmaker, then icons at the bottom for Firefox, for example, are not at the bottom of the screen but only two-thirds down.
For some reason I can't get LVDS to activate with VGA-0 active at the same time, though I had it before I reinstalled.
If I run this script I found
Code:
# External output may be "VGA" or "VGA-0" or "DVI-0" or "TMDS-1"
EXTERNAL_OUTPUT="VGA-0"
INTERNAL_OUTPUT="LVDS"
# EXTERNAL_LOCATION may be one of: left, right, above, or below
EXTERNAL_LOCATION="left"
case "$EXTERNAL_LOCATION" in
left|LEFT)
EXTERNAL_LOCATION="--left-of $INTERNAL_OUTPUT"
;;
right|RIGHT)
EXTERNAL_LOCATION="--right-of $INTERNAL_OUTPUT"
;;
top|TOP|above|ABOVE)
EXTERNAL_LOCATION="--above $INTERNAL_OUTPUT"
;;
bottom|BOTTOM|below|BELOW)
EXTERNAL_LOCATION="--below $INTERNAL_OUTPUT"
;;
*)
EXTERNAL_LOCATION="--left-of $INTERNAL_OUTPUT"
;;
esac
xrandr |grep $EXTERNAL_OUTPUT | grep " connected "
if [ $? -eq 0 ]; then
xrandr --output $INTERNAL_OUTPUT --auto --output $EXTERNAL_OUTPUT --auto $EXTERNAL_LOCATION
# Alternative command in case of trouble:
# (sleep 2; xrandr --output $INTERNAL_OUTPUT --auto --output $EXTERNAL_OUTPUT --auto $EXTERNAL_LOCATION) &
else
xrandr --output $INTERNAL_OUTPUT --auto --output $EXTERNAL_OUTPUT --off
fi
it returns this
Code:
VGA-0 connected 1920x1080+0+0 (normal left inverted right x axis y axis) 510mm x 287mm
And only VGA-0 is displayed. LVDS is blank.
What is very, very bizarre, is that after a 10 minute (or so, never timed) timeout (probably power saving) when I go back to use the laptop, both screens are available.
|
{
"url": "http://forums.freebsd.org/threads/xrandr-on-laptop-with-second-monitor.13184/",
"source_domain": "forums.freebsd.org",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "53988",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PQAN75H5G7MEQN4WUTWSX33YFGQF4CKB",
"WARC-Concurrent-To": "<urn:uuid:dd3f8876-b0ec-4950-9924-2078c6a2880a>",
"WARC-Date": "2014-12-20T09:40:54Z",
"WARC-IP-Address": "149.20.54.209",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LBI5G6OUXYKP4DDUWS3AVHERFOWN5CVB",
"WARC-Record-ID": "<urn:uuid:28d1fe39-3b83-4616-98f8-6cd1bd2b46cc>",
"WARC-Target-URI": "http://forums.freebsd.org/threads/xrandr-on-laptop-with-second-monitor.13184/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b0f1a878-31ee-45e9-87cf-bfc3c41bc994>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-231-17-201.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-52\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for December 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
113,
114,
151,
152,
225,
226,
240,
241,
265,
266,
280,
288,
309,
316,
468,
469,
751,
752,
974,
975,
1028,
1038,
1128,
1204,
1209,
1210,
1211,
1221,
1237,
1311,
1402,
1431,
1460,
1489,
1518,
1547,
1576,
1614,
1652,
1690,
1719,
1808,
1837,
1866,
1895,
1924,
1953,
1982,
2049,
2054,
2055,
2056,
2218,
2228,
2292,
2298,
2367,
2395,
2422,
2490,
2519,
2525,
2558,
2580,
2646,
2668,
2692,
2759,
2781,
2813,
2877,
2899,
2937,
3001,
3023,
3037,
3103,
3125,
3134,
3140,
3195,
3221,
3321,
3371,
3486,
3495,
3575,
3582,
3587,
3593,
3604,
3605,
3626,
3627,
3641,
3651,
3672,
3680,
3690,
3766,
3771,
3772,
3773,
3898,
3899,
3909,
3930,
3959,
3988,
4019,
4052,
4087,
4124,
4164,
4190,
4205,
4210,
4216,
4230,
4231,
4255,
4256,
4270,
4278,
4299,
4306,
4448,
4449,
4464,
4474,
4564,
4569,
4570,
4675,
4676,
4686,
4702,
4776,
4867,
4896,
4925,
4954,
4983,
5012,
5041,
5079,
5117,
5155,
5184,
5276,
5305,
5334,
5363,
5392,
5421,
5450,
5517,
5522,
5523,
5524,
5597,
5607,
5636,
5663,
5702,
5736,
5779,
5826,
5841,
5846,
5866,
5914,
5965,
6015,
6064,
6116,
6169,
6221,
6236,
6241,
6262,
6279,
6296,
6314,
6334,
6351,
6371,
6386,
6391,
6417,
6446,
6469,
6484,
6489,
6515,
6541,
6566,
6600,
6641,
6682,
6697,
6702,
6724,
6759,
6788,
6812,
6837,
6852,
6857,
6878,
6925,
6999,
7060,
7096,
7153,
7210,
7267,
7324,
7380,
7437,
7489,
7541,
7598,
7650,
7702,
7754,
7806,
7863,
7920,
7977,
8034,
8086,
8138,
8190,
8247,
8304,
8360,
8416,
8471,
8528,
8580,
8632,
8686,
8744,
8799,
8851,
8908,
8965,
9017,
9074,
9130,
9187,
9244,
9301,
9358,
9415,
9469,
9526,
9580,
9640,
9697,
9754,
9811,
9865,
9922,
9979,
10036,
10093,
10150,
10207,
10232,
10258,
10298,
10331,
10360,
10375,
10380,
10401,
10427,
10451,
10478,
10504,
10525,
10543,
10562,
10588,
10609,
10627,
10646,
10672,
10693,
10711,
10730,
10756,
10777,
10796,
10815,
10841,
10862,
10881,
10900,
10926,
10947,
10966,
10992,
11011,
11026,
11031,
11032,
11033,
11193,
11199,
11210,
11211,
11232,
11233,
11247,
11257,
11278,
11286,
11533,
11534,
11543,
11549,
11579,
11591,
11592,
11614,
11615,
11629,
11639,
11660,
11668,
11785,
11786,
11796,
11847,
11852,
11858,
11888,
11902,
11903,
11927,
11928,
11942,
11950,
11971,
11978,
11991,
12001,
12033,
12034,
12083,
12093,
12165,
12166,
12365,
12366,
12489,
12490,
12523,
12533,
12602,
12630,
12657,
12725,
12754,
12760,
12793,
12815,
12881,
12903,
12927,
12994,
13016,
13048,
13112,
13134,
13172,
13236,
13258,
13272,
13338,
13360,
13369,
13375,
13430,
13456,
13556,
13606,
13721,
13730,
13810,
13817,
13822,
13823,
13843,
13853,
13944,
13949,
13950,
13998,
13999,
14172
],
"line_end_idx": [
113,
114,
151,
152,
225,
226,
240,
241,
265,
266,
280,
288,
309,
316,
468,
469,
751,
752,
974,
975,
1028,
1038,
1128,
1204,
1209,
1210,
1211,
1221,
1237,
1311,
1402,
1431,
1460,
1489,
1518,
1547,
1576,
1614,
1652,
1690,
1719,
1808,
1837,
1866,
1895,
1924,
1953,
1982,
2049,
2054,
2055,
2056,
2218,
2228,
2292,
2298,
2367,
2395,
2422,
2490,
2519,
2525,
2558,
2580,
2646,
2668,
2692,
2759,
2781,
2813,
2877,
2899,
2937,
3001,
3023,
3037,
3103,
3125,
3134,
3140,
3195,
3221,
3321,
3371,
3486,
3495,
3575,
3582,
3587,
3593,
3604,
3605,
3626,
3627,
3641,
3651,
3672,
3680,
3690,
3766,
3771,
3772,
3773,
3898,
3899,
3909,
3930,
3959,
3988,
4019,
4052,
4087,
4124,
4164,
4190,
4205,
4210,
4216,
4230,
4231,
4255,
4256,
4270,
4278,
4299,
4306,
4448,
4449,
4464,
4474,
4564,
4569,
4570,
4675,
4676,
4686,
4702,
4776,
4867,
4896,
4925,
4954,
4983,
5012,
5041,
5079,
5117,
5155,
5184,
5276,
5305,
5334,
5363,
5392,
5421,
5450,
5517,
5522,
5523,
5524,
5597,
5607,
5636,
5663,
5702,
5736,
5779,
5826,
5841,
5846,
5866,
5914,
5965,
6015,
6064,
6116,
6169,
6221,
6236,
6241,
6262,
6279,
6296,
6314,
6334,
6351,
6371,
6386,
6391,
6417,
6446,
6469,
6484,
6489,
6515,
6541,
6566,
6600,
6641,
6682,
6697,
6702,
6724,
6759,
6788,
6812,
6837,
6852,
6857,
6878,
6925,
6999,
7060,
7096,
7153,
7210,
7267,
7324,
7380,
7437,
7489,
7541,
7598,
7650,
7702,
7754,
7806,
7863,
7920,
7977,
8034,
8086,
8138,
8190,
8247,
8304,
8360,
8416,
8471,
8528,
8580,
8632,
8686,
8744,
8799,
8851,
8908,
8965,
9017,
9074,
9130,
9187,
9244,
9301,
9358,
9415,
9469,
9526,
9580,
9640,
9697,
9754,
9811,
9865,
9922,
9979,
10036,
10093,
10150,
10207,
10232,
10258,
10298,
10331,
10360,
10375,
10380,
10401,
10427,
10451,
10478,
10504,
10525,
10543,
10562,
10588,
10609,
10627,
10646,
10672,
10693,
10711,
10730,
10756,
10777,
10796,
10815,
10841,
10862,
10881,
10900,
10926,
10947,
10966,
10992,
11011,
11026,
11031,
11032,
11033,
11193,
11199,
11210,
11211,
11232,
11233,
11247,
11257,
11278,
11286,
11533,
11534,
11543,
11549,
11579,
11591,
11592,
11614,
11615,
11629,
11639,
11660,
11668,
11785,
11786,
11796,
11847,
11852,
11858,
11888,
11902,
11903,
11927,
11928,
11942,
11950,
11971,
11978,
11991,
12001,
12033,
12034,
12083,
12093,
12165,
12166,
12365,
12366,
12489,
12490,
12523,
12533,
12602,
12630,
12657,
12725,
12754,
12760,
12793,
12815,
12881,
12903,
12927,
12994,
13016,
13048,
13112,
13134,
13172,
13236,
13258,
13272,
13338,
13360,
13369,
13375,
13430,
13456,
13556,
13606,
13721,
13730,
13810,
13817,
13822,
13823,
13843,
13853,
13944,
13949,
13950,
13998,
13999,
14172,
14177
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14177,
"ccnet_original_nlines": 404,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1603960394859314,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05782178044319153,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.45980197191238403,
"rps_doc_frac_unique_words": 0.3126353919506073,
"rps_doc_mean_word_length": 5.575451374053955,
"rps_doc_num_sentences": 83,
"rps_doc_symbol_to_word_ratio": 0.0534653514623642,
"rps_doc_unigram_entropy": 5.4457316398620605,
"rps_doc_word_count": 1385,
"rps_doc_frac_chars_dupe_10grams": 0.34110334515571594,
"rps_doc_frac_chars_dupe_5grams": 0.4105153977870941,
"rps_doc_frac_chars_dupe_6grams": 0.40714842081069946,
"rps_doc_frac_chars_dupe_7grams": 0.39873090386390686,
"rps_doc_frac_chars_dupe_8grams": 0.3737373650074005,
"rps_doc_frac_chars_dupe_9grams": 0.3737373650074005,
"rps_doc_frac_chars_top_2gram": 0.037555038928985596,
"rps_doc_frac_chars_top_3gram": 0.01631701923906803,
"rps_doc_frac_chars_top_4gram": 0.020849520340561867,
"rps_doc_books_importance": -1167.812255859375,
"rps_doc_books_importance_length_correction": -1167.812255859375,
"rps_doc_openwebtext_importance": -529.4572143554688,
"rps_doc_openwebtext_importance_length_correction": -529.4572143554688,
"rps_doc_wikipedia_importance": -434.03961181640625,
"rps_doc_wikipedia_importance_length_correction": -434.03961181640625
},
"fasttext": {
"dclm": 0.09849900007247925,
"english": 0.6746450662612915,
"fineweb_edu_approx": 1.370991587638855,
"eai_general_math": 0.7441678047180176,
"eai_open_web_math": 0.36470651626586914,
"eai_web_code": 0.6120110154151917
}
}
|
{
"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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,882,033,558,818,178,000
|
US7810151B1 - Automated change detection within a network environment - Google Patents
Automated change detection within a network environment Download PDF
Info
Publication number
US7810151B1
US7810151B1 US11/044,240 US4424005A US7810151B1 US 7810151 B1 US7810151 B1 US 7810151B1 US 4424005 A US4424005 A US 4424005A US 7810151 B1 US7810151 B1 US 7810151B1
Authority
US
United States
Prior art keywords
network
database
application
layer
packet flows
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active, expires
Application number
US11/044,240
Inventor
Kowsik Guruswamy
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Juniper Networks Inc
Original Assignee
Juniper Networks Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Juniper Networks Inc filed Critical Juniper Networks Inc
Priority to US11/044,240 priority Critical patent/US7810151B1/en
Assigned to JUNIPER NETWORKS, INC. reassignment JUNIPER NETWORKS, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: GURUSWAMY, KOWSIK
Application granted granted Critical
Publication of US7810151B1 publication Critical patent/US7810151B1/en
Active legal-status Critical Current
Adjusted expiration legal-status Critical
Links
Images
Classifications
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
• H04L63/00Network architectures or network communication protocols for network security
• H04L63/14Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
• H04L63/1408Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
• GPHYSICS
• G06COMPUTING; CALCULATING; COUNTING
• G06FELECTRIC DIGITAL DATA PROCESSING
• G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
• G06F21/50Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems
• G06F21/57Certifying or maintaining trusted computer platforms, e.g. secure boots or power-downs, version controls, system software checks, secure updates or assessing vulnerabilities
• G06F21/577Assessing vulnerabilities and evaluating computer system security
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
• H04L43/00Arrangements for monitoring or testing packet switching networks
• H04L43/02Arrangements for monitoring or testing packet switching networks involving a reduction of monitoring data
• H04L43/028Arrangements for monitoring or testing packet switching networks involving a reduction of monitoring data using filtering
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
• H04L43/00Arrangements for monitoring or testing packet switching networks
• H04L43/04Processing of captured monitoring data
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
• H04L43/00Arrangements for monitoring or testing packet switching networks
• H04L43/18Arrangements for monitoring or testing packet switching networks using protocol analyzers
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04WWIRELESS COMMUNICATION NETWORKS
• H04W12/00Security arrangements; Authentication; Protecting privacy or anonymity
• H04W12/60Context-dependent security
• H04W12/69Identity-dependent
• H04W12/79Radio fingerprint
Abstract
A correlation database stores profiling data that describes packet flows within a network. A network device presents a user interface by which a user defines a database trigger to detect database operations that change to the profiling data stored within the correlation database. The network device may maintain a log to record the detected database operations. The database trigger may specify a combination of low-level network elements associated with the packet flows and application-layer elements extracted from application-layer communications reassembled from the packet flows.
Description
TECHNICAL FIELD
The invention relates to computer networks and, more particularly, to monitoring and profiling network traffic.
BACKGROUND
A computer network typically includes a collection of interconnected computing devices that exchange data and share resources. The devices may include, for example, web servers, database servers, file servers, routers, printers, end-user computers and other devices. The variety of devices may execute a myriad of different services and communication protocols. Each of the different services and communication protocols exposes the network to different security vulnerabilities. Moreover, each version of a particular protocol or service may also have different vulnerabilities and potential security risks. Further, devices may be misconfigured, and unwanted applications or services may be present within the enterprise network. As a result, it is often difficult for a network administrator to accurately determine a security posture for a computer network.
SUMMARY
In general, the invention is directed to techniques for detecting and preventing network attacks. More specifically, an intrusion detection and prevention (IDP) device is described that includes network profiling capabilities. A profiler module within the IDP device monitors an enterprise network and learns network elements as well as application-layer elements presently associated with the network. For example, the IDP device monitors traffic within the enterprise network to learn of network hosts, ports, peers and other network elements.
In addition, the IDP device utilizes a set of protocol-specific decoders to further analyze the traffic to learn the application-layer elements. In particular, the protocol decoders provide protocol-specific “context” and “values” from the network traffic. The profiler software module correlates the protocol-specific information produced by the protocol decoders to the network elements by building associations between the application-layer elements and the network elements. The profiler software may build the correlations within a relational database (i.e., a correlation database) and provide mechanisms for querying the correlation database. The profiler module may locally store the correlation database, or may provide a mechanism for efficiently communicating the application-layer information to a remote device.
The IDP device may provide mechanisms for automatically identifying changes within the enterprise network. For example, the IDP device allows a system administrator or other user to configure database triggers for the correlation database. For example, the system administrator may configure database triggers to detect new hosts, users, protocols or applications. As the protocol decoders analyze the enterprise traffic and the profiler module builds the application-layer associations within the database, the profiler maintains a log of database operations (e.g., inserts, updates or deletes) that fire the defined triggers. This allows the system administrator to identify network changes that may expose security risks and apply measures to preserve the security posture of the enterprise.
Further, the IDP device may provide a mechanism for detecting network traffic that violates the enterprise policies. In particular, the IDP device allows a system administrator or other user to define a “policy violation” object that comprises a set of rules. Each rule defines permissible traffic characteristics (e.g., flows) for the network. In this manner, the set of rules may reflect the actual policies implemented by the enterprise. The IDP device applies the policy violation object to the correlation database, and produces a result set that lists entries that violate the rules. In this manner, the result set identifies traffic flows that the system administrator does not expect to be present within the enterprise. This information can be used to assist the system administrator in identifying misconfigured devices, firewall holes and unwanted devices or services.
In one embodiment, a method comprises maintaining a correlation database that stores profiling data describing packet flows within a network, and defining a database trigger to detect database operations that change to the profiling data stored within the correlation database. The method further comprises maintaining a log to record the detected database operations.
In another embodiment, a system comprises a correlation database that stores profiling data that describes packet flows within a network, and a network device that presents a user interface by which a user defines a database trigger to detect database operations that change to the profiling data stored within the correlation database.
In another embodiment, a computer-readable medium comprises instructions that cause a programmable processor of a network device to present a user interface by which a user defines a database trigger to detect database operations that change to the profiling data stored within the correlation database. The profiling data describes packet flows within a network. The instructions further cause the processor to maintain a log to record the detected database operations.
The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of the invention will be apparent from the description and drawings, and from the claims.
BRIEF DESCRIPTION OF DRAWINGS
FIG. 1 is a block diagram illustrating an exemplary enterprise computer network in which an intrusion detection and prevention (IDP) device monitors network traffic and correlates network and application-layer elements in accordance with the principles of the invention.
FIG. 2 is a block diagram illustrating an exemplary embodiment of IDP device in further detail.
FIG. 3 illustrates a portion of the IDP device of FIG. 2 in further detail
FIG. 4 is a block diagram that illustrates an example embodiment for correlation database.
FIG. 5 is a flowchart illustrating exemplary operation of an IDP device in accordance with the principles of the invention.
FIGS. 6 and 7 block diagrams illustrating additional embodiment of an exemplary IDP devices.
FIG. 8 is a block diagram in which a firewall incorporates an IDP module that provides network profiling functions described herein.
DETAILED DESCRIPTION
FIG. 1 is a block diagram illustrating an exemplary system 2 in which enterprise 4 includes a private enterprise computing network 5 that is coupled to public network 6, such as the Internet. Firewall 9 protects enterprise network 5 and, in particular, internal computing nodes 8A-8N. Computing nodes 8A-8N (computing nodes 8) represent any private computing device within enterprise network 5, including workstations, file servers, print servers, database servers, printers and other devices.
In addition, firewall 9 may provide a “demilitarized zone” (DMZ) 7, which represents a semi-private area of enterprise network 5 that supports limited access by public network 6 via specific communication protocols. For example, client devices (not shown) within public network 6 may have limited access to nodes 15A-15M via the hypertext transport protocol (HTTP) or the file transfer protocol (FTP).
In the example of FIG. 1, enterprise network 5 includes intrusion detection and prevention (IDP) device 10 that monitors traffic flowing between firewall 9 and internal computing nodes 8. IDP device 10 analyzes the network traffic and dynamically “learns” the network elements associated with the network traffic. As used herein, the term “network elements” refers to hosts, peers, ports, address and other lower-level information associated with the network traffic.
In addition, IDP device 10 utilizes a set of protocol-specific decoders (not shown in FIG. 1) to analyze the network traffic and provide application-layer visibility. In particular, the protocol decoders extract protocol-specific “context” and “values” from the network traffic. IDP device 10 correlates the protocol-specific information produced by the protocol decoders with the network elements by mapping the application-layer elements detected by the protocol decoders to the network elements. IDP device 10 builds the correlations within a relational database (not shown in FIG. 1) and provides mechanisms by which a system administrator or other user queries the correlation database for report generation and analysis.
In some embodiments, IDP device 10 provides mechanisms for automatically identifying changes within enterprise network 5. For example, IDP device 10 allows the system administrator to define database triggers for the correlation database. The system administrator may configure database triggers to detect new hosts, users, protocols, applications or other changes to the network. IDP device 10 builds the application-layer associations within the database and maintains a log of database operations (e.g., inserts, updates or deletes) that fire the defined triggers. This allows the system administrator to identify network changes that may expose security risks and apply measures to preserve the security posture of enterprise network 5.
IDP device 10 may also provide mechanisms for detecting network traffic that violates the policies of enterprise 4. In particular, IDP device 10 allows the system administrator to define a “policy violation” object that comprises a set of rules. Each rule defines permissible traffic characteristics (e.g., flows) for the network. In this manner, the set of rules may reflect the actual policies implemented by the enterprise, such as policies implemented by firewall 9. IDP device 10 applies the policy violation object to the correlation database and produces a result set that lists exceptions, i.e., entries within the correlation database that fail to satisfy any of the rules. In this manner, the result set identifies traffic flows that the system administrator does not expect to be present within the enterprise. This information can be used to assist the system administrator in identifying misconfigured devices, firewall holes and unwanted devices or services.
In some embodiments, IDP device 10 maintains a small cache of application-layer correlations, and provides a mechanism for efficiently communicating the information to a remote security management device 18 or other device for storage for storage within a relational database. In this manner, security management device 18 may operate as a central device for aggregating application-layer information from multiple IDP devices 10, 12 and 14 located within different regions (e.g., sub-networks) of enterprise network 5.
Although the example illustrated in FIG. 1 is described in terms of dedicated IDP devices 10, 12 and 14, the functionality described herein may be incorporated within other devices, such as firewall 9 or switch 19. These devices may have limited persistent storage, and the aggregation features of security management device 18 may be particularly useful in these applications.
FIG. 2 is a block diagram illustrating an example embodiment of an IDP device 20. IDP device 20 includes a forwarding plane 22 that monitors inbound network traffic 24 and transparently forwards the network traffic as outbound network traffic 26. In the illustrated example, FIG. 2, forwarding plane 22 includes flow analysis module 25, stateful inspection engine 28, protocol decoders 30 and forwarding component 31.
Flow analysis module 25 receives inbound traffic 24 and identifies network flows within the traffic. Each network flow represents a communication session within the network traffic and is identified by at least a source address, a destination address and a communication protocol. Flow analysis module 25 may utilize additional information to specify network flows, including source media access control (MAC) address, destination MAC address, source port and destination port.
Flow analysis module 25 maintains data within flow table 35 that describes each active flow present within the network traffic. Flow analysis module 25 outputs commands 32 that reflect changes to flow table 35. In particular, flow analysis module 25 outputs ADD_FLOW, REMOVE_FLOW and UPDATE_FLOW commands 32 as it modifies flow table 35 to reflect the current network flows. In this fashion, each of commands 32 represents an operation performed on flow table 35 and conveys network elements associated with each operation, i.e., low-level information such as network hosts, peers, and ports associated with the network traffic.
For each packet stream, stateful inspection engine 28 buffers a copy of the packets and reassembles the copied packets to form application-layer communications 37. In addition, stateful inspection engine 28 invokes the appropriate one of protocol decoders 30 to analyze the application-layer communications 37. Protocol decoders 30 represent a set of one or more protocol-specific software modules. Each of protocol decoders 30 corresponds to a different communication protocol or service. Examples of communication protocols that may be supported by protocol decoders 30 include the HyperText Transfer Protocol (HTTP), the File Transfer Protocol (FTP), the Network News Transfer Protocol (NNTP), the Simple Mail Transfer Protocol (SMTP), Telnet, Domain Name System (DNS), Gopher, Finger, the Post Office Protocol (POP), the Secure Socket Layer (SSL) protocol, the Lightweight Directory Access Protocol (LDAP), Secure Shell (SSH), Server Message Block (SMB) and other protocols.
Protocol decoders 30 analyze reassembled application-layer communications 37 and extract application-layer elements 34. As used herein, the term “application-layer elements” refer to protocol-specific information obtained at the application-layer. In particular, protocol decoders 30 extract protocol-specific “contexts” and “values” from the reassembled application-layer communications. In general, “contexts” are named elements within a protocol stream that uniquely identifies various application-layer elements. Example of contexts includes file names, user names, application names, names of attached documents, protocol-specific header information and other information that describes the communication session. For example, a context for an HTTP protocol stream includes the name of a server providing the HTTP service and the name of the type of web browser (e.g., Internet Explorer) accessing the server. By reassembling application-layer communications, protocol decoders 30 extract specific contexts (e.g., browser type) and corresponding values (e.g., Internet Explorer). Protocol decoders output application elements 34 to profiler 36 for profiling and subsequent analysis.
In addition, protocol decoders 30 apply protocol-specific algorithms to analyze the application-elements to determine whether each packet stream represents a security risk, e.g., a network attack. If no security risk is detected, stateful inspection engine 28 sends the original packets to forwarding component 31 for forwarding to the corresponding destinations. Forwarding component 31 may, for example, maintain a routing table that stores routes in accordance with a topology of the enterprise network.
Profiler 36 receives commands 32 that describe the updates to flow table 35 and the network elements associated with the network flows. In addition, profiler 36 receives application-layer elements 34 from protocol decoders 30. Profiler 36 correlates the network elements and the application-layer elements within correlation database 38. In particular, profiler 36 stores the network elements and application-layer elements 34 within correlation database 38, and builds associations between the application-layer and the network elements. Correlation database 38 may be a relational database, such as SQL Server from Microsoft Corporation.
Applications 40 allow users, such as administrator 42, to query correlation database 38 for report generation and analysis. For example, administrator 42 may interact with applications 40 to query correlation database 38 and view the associations between application-layer elements and network elements for the network traffic within the enterprise network.
Configuration manager 44 presents a user interface by which administrator 42 configures profiler 36. For example, administrator 42 may configure profiler 36 to monitor particular subnets of the enterprise network. When building associations within correlation database 38, profiler 36 may associate all external source network addresses with a single external source to reduce storage requirements and aid analysis.
FIG. 3 illustrates a portion of IDP device 20 (FIG. 2) in further detail. In particular, FIG. 3 illustrates an exemplary set of protocol decoders 30A-30N. In this example, protocol decoders 30A-30N include HTTP decoder 30A, Telnet decoder 30B, FTP decoder 30C, NNTP decoder 30D, SMTP decoder 30E and Small Message Block (SMB) decoder 30N.
As illustrated in FIG. 3, each of protocol decoders 30A-30N analyzes corresponding protocol-specific application-layer communications 37A-37N that have been reassembled by stateful inspection engine 28. Based on the analysis, each of protocol decoders 30A-30N extract and output corresponding application-layer elements 34A-34N describing contexts and values associated with each communication session for the respective protocol.
FIG. 4 is a block diagram that illustrates an example embodiment for correlation database 38. In the example embodiment, correlation database 38 includes hosts table 50, peers table 52 and ports table 54 that store low-level network elements. In addition, correlation database 38 includes profiles table 56, values table 58 and contexts table 60 that store application-layer elements. Profiler 36 (FIG. 2) builds associations between the network elements and application-layer elements by way of database relationships, as indicated by arrows within FIG. 4.
Hosts table 50 stores data identifying individual nodes that act as either sources or destinations for one or more network flows within the network traffic. For example, hosts table 50 may comprises a set of rows, where each row corresponds to a different network device, i.e., either a source device or a destination device. Each row may store an Internet Protocol (IP) address, MAC address and other information low-level network elements for corresponding device. Profiler 36 analyzes commands 32 (FIG. 2) and the associated network elements and updates hosts table 50 as communications from or to new devices are detected.
Peers table 52 stores data identifying “peers,” i.e., pairs of hosts that have established a communication session. For example, peers table 52 may comprise a set of rows, where each row identifies a pair of hosts listed within hosts table 50. Profiler 36 analyzes commands 32 and the associated network elements update the rows to represent the peer relationships within the network traffic.
Ports table 54 stores data specifying the particular ports utilized by the peers when communicating. For example, two peers may communicate via HTTP using port 80. As another example, two peers may communicate via FTP using port 21.
Contexts table 60 stores data specifying named elements for each type of protocol. The named elements provide an application-layer basis for describing a communication session. Example of named elements includes file names, user names, application names and other information that describes the application-layer of the communication session. For example, a context for an HTTP protocol stream may include the name of a server providing the HTTP service and the type of web browser accessing the server. Contexts table 60 defines the types of named elements that describe the application-layer of the communication sessions within the network traffic.
Values table 58 stores particular values for the named elements specified by contexts table 60. For example, contexts table 60 may specify a context of BROWSER for an HTTP protocol, and values table 58 may include particular values of “Internet Explorer,” “FireFox” and “Mozilla” for different communication sessions within enterprise 4.
Profiles table 56 associates peers specified within peers table 52 with specific application-layer values specified within values table 58. In this manner, profiles table 56 may be viewed as defining profiles that map application-layer contexts and values with particular communication sessions between peers.
FIG. 5 is a flowchart illustrating exemplary operation of an IDP device in accordance with the principles of the invention. For exemplary purposes, the flowchart is described in reference to IDP device 20 (FIG. 2).
Initially, configuration manager 44 receives configuration information from administrator 42 and, in response, configures IDP device 20 to monitor subnets of interest (70). Once configured, IDP device 20 monitors inbound network traffic 24 (72). In some configurations, stateful inspection engine 28 of forwarding plane 22 may receive network traffic and mirror the network traffic for purposes of analysis. Forwarding plane 22 seamlessly forwards the original network traffic.
Flow analysis module 25 analyzes the network traffic to identify packets flows and updates flow table 35 to describe each active flow present within the network traffic (74). While updating flow table 35, flow analysis module 25 outputs commands 32 (e.g., ADD_FLOW, REMOVE_FLOW and UPDATE_FLOW commands) and corresponding network elements to reflect the current network flows (76). Profiler 36 receives commands 32 and updates hosts table 50, peers table 52 and ports table 54 of correlation database 38 based on the received commands and respective network elements (78).
Next, stateful inspection engine 28 buffers and reassembles the packets to form application-layer communications 37 (80), and invokes the appropriate protocol decoders 30 to analyze the application-layer communications (82). Protocol decoders 30 analyze reassembled application-layer communications 37 and communicate application-layer elements 34 to profiler 36 (84).
Profiler 36 receives application-layer elements 34 and updates profiles table 56, values table 58 and contexts table 60 of correlation database 38 based on the received application-layer elements (86). In this fashion, profiler 36 correlates the network elements and the application-layer elements within correlation database 38. In some embodiments, profiler 36 does not correlate each individual network flow within correlation database 38. Rather, profiler 36 maintains totals describing the number of packet flows having the same network elements and application-layer contexts and values. For example, profiler 36 may update profiles table 56, values table 58 and contexts table 60 to record a first, last and total number of sessions between two peers using the same application-layer contexts and values. This approach may lead to data reduction and simplify analysis.
Finally, applications 40 query correlation database 38 for report generation, security assessment and traffic analysis (88).
FIG. 6 is a block diagram illustrating an example IDP device 90 that generally conforms to IDP device 20 described above. In addition, configuration manager 44 allows administrator 42 to define a policy violation object 92 that specifies a set of rules. Each rule utilizes network elements and application-layer elements to define permissible traffic characteristics (e.g., flows) for the enterprise network. In this manner, policy violation object 92 may be viewed as a pseudo firewall in that the set of rules may reflect the actual policies implemented by the enterprise, e.g., via one or more actual firewalls, network scanners and other devices.
Upon a request from administrator 42, configuration manager 44 applies policy violation object 92 to correlation database 38 to produce a result set that lists entries within the correlation database that violate the rules. In other words, profiler 36 applies one or more queries to correlation database 38 and instead of identifying matching entries configuration manager 44 produces a result set that includes any exceptions that fail to satisfy the rules defined by policy violation object 92. Consequently, the result set identifies traffic flows profiled within correlation database 38 that administrator 42 does not expect to be present within the enterprise.
For example, administrator 42 may define pseudo firewall 92 with the following rules:
• Rule #1: src_ip=Engineering, dst_ip=Accounting, port-TCP/139, smb_user=administrator
• Rule #2: src_ip=Engineering, dst_ip=Marketing, port-TCP/21, telnet_user=administrator
In this example, rule #1 defines a first rule that permits traffic having a source address within an “Engineering” address range that accesses a destination IP address within an “Accounting” address range using the TCP protocol over port 139 where the “smb_user” application-layer element has a value equal to “administrator.” Similarly, rule #2 defines a second rule as any traffic having a source address of within an Engineering address range that accesses a destination IP address within a Marketing address range using the TCP protocol over port 21 where the “telnet_user” application-layer element has a value equal to “administrator.”
In this manner, network elements and protocol-specific application-layer elements may be combined to form policy rules for purposes of examining profiled network traffic. Configuration manager 44 applies policy violation object 92 to correlation database 38 and returns a resultant data set describing any communication sessions that fail to match the rules, i.e., policy violations. In this example, profiler 36 may return data describing any profiled network traffic associated with an SMB session from engineering to accounting or a Telnet session from engineering to marketing where the user is not an authorized administrator. Administrator 42 uses this information in identifying malicious behavior, misconfigured devices, firewall holes and unwanted devices or services. For example, administrator 42 may interact with IDP device 90 to apply additional report filters to view the exceptions for particular hosts, subnets, protocols or other criteria.
In one embodiment, stateful inspection engine 28 may maintain and apply policy violation object 92 to correlation database 38. In the event policy violations are detected, stateful inspection engine 28 may automatically update forwarding rules within forwarding component 31 to drop traffic associated with the violations.
FIG. 7 is a block diagram illustrating an example IDP device 100 that generally conforms to IDP device 20 described above with respect to FIG. 2. In the example embodiment of FIG. 7, IDP device 100 includes change detection module 102 that aids administrator 42 in identifying changes within the enterprise network.
Change detection module 102 presents a user interface with which administrator 42 interacts to define database triggers 102 for correlation database 32. Administrator 42 may configure database triggers 104 to detect database operations that update correlation database 32 with a specified combination of network elements and application-layer elements. As one example, change detection module 102 may define a database trigger that “fires” when profiler 36 performs a database insert operation that specifies newly detected peers that utilize a particular version of a communication protocol. As another example, change detection module 102 may define a database trigger that fires when a new host is detected that utilizes a particularly vulnerable software version of a web service or email protocol. In this manner, database triggers 104 may utilize any combination of network and application-layer elements. Other examples include detection of new hosts appearing on the enterprise network, new peers and ports being utilized, new users, new applications and protocol commands appearing on the network and other network changes.
When one of database triggers 104 fires, profiler 36 updates logs 106 to record the database operation or operations for subsequent analysis and reporting by change detection module 102 or other software application. In this fashion, IDP device 100 may aid administrator 42 in identifying changes within the enterprise network, allowing the administrator to apply any measures necessary to preserve the security of the network, such as applying any appropriate security patches or disabling undesired services.
FIG. 8 is a block diagram in which a firewall 110 incorporates an IDP module 112 that provides some or all of the network profiling functions described herein. For example, IDP module 112 generally includes the components described with respect to IDP device 20 (FIG. 2). Although described in reference to firewall 110, IDP module 112 may be incorporated within other devices within an enterprise network, such as switches, routers, intelligent hubs or gateways or other devices.
In the example of FIG. 8, firewall 110 has limited persistent storage. To address this limitation, IDP module 112 does not maintain a complete local correlation database. Rather, IDP module 112 maintains a small, in-memory cache 114 of network elements and application-layer correlations. Cache 114 may be organized in a manner similar to correlation database 38 of FIG. 4. In particular, cache 112 may include a hosts table, peers table and ports table 54 that store low-level network elements, and a profiles table, values table, and a contexts table that store application-layer elements. In other words, cache 114 may be stored as a small, in-memory database in accordance with the schema described in FIG. 4. IDP module 112 builds associations within cache 114 between the network elements and application-layer elements by way of database relationships as described above.
As IDP module 112 updates cache 114, IDP module 112 outputs communications 116 to mirror stateful database operations (e.g., insert, update and remove operations) to remote device 111. Remote device 111 may be directly coupled to firewall 110 or remotely located anywhere within the enterprise network. Remote device 111 receives the database operations by way of communications 116 and builds correlation database 115 to provide persistent storage.
Further, remote device 111 may aggregate profiling data from other devices that incorporate the IDP functions described herein, such as a standalone IDP device 120, a second firewall 122 and an intelligent switch 124. When aggregating the profiling data, remote device 111 automatically correlates information received from the different sources. For example, remote device 111 ensures that a hosts table within correlation database 115 accurately reflects the hosts detected within the enterprise network, and eliminates duplicate entries in the event the same host is detected by different IDP-enabled devices, e.g., firewall 110, IDP device 120, firewall 122 or switch 124. In similar fashion, remote device 111 ensures that other tables of correlation database 115, such as contexts and values tables, accurately reflect application-layer elements detected by different IDP-enabled devices. In this manner, remote device 111 intelligently aggregate network profiling data from multiple IDP-enabled devices.
In one embodiment, IDP module 112 sends incremental data to remote device 111 to conserve network bandwidth. For example, IDP module 112 may output communications 116 only when new elements are inserted within cache 114. In other words, IDP module 112 may not send communications 116 when elements within cache 114 are merely updated with new values.
Further, each table of cache 114 may comprise a limited capacity (e.g., number of rows) for caching network and application-layer elements. IDP module 112 may employ a least-recently used (LRU) technique for replacing entries within cache 114 in the event the capacity of one or more tables is reached. In particular, IDP module 112 may maintain modification timestamps for each entry within cache 114. When inserting a new entry into a full table, IDP module 112 replaces the entry having the oldest timestamp and communicates the replaced entry to remote device 111 for aggregation within correlation database 115.
Further, IDP module 112 may employ deferred replacement for any entries in the other tables that are related to the replaced entry. Specifically, IDP module 112 may defer communicating the related entries to remote device 111 until such time as the capacity for the tables storing those entries is reached.
Security management device 128 provides a user interface by which administrator 130 configures the generation and aggregation of profiling data. In particular, administrator 130 interacts with security management device 128 to provide configuration information 132 to firewall 110 and other IDP-enabled devices (e.g., IDP device 120, firewall 122 or switch 124). Configuration data 132 may specify, for example, particular subnets of interest. Further, configuration data 132 may specify a network address of remote device 111 to which firewall 110 and the other IDP-enabled devices communicate profiling data.
In addition, security management device 128 may allow administrator 130 to define a policy violation object as described above with respect to FIG. 6. Security management device 128 may apply the policy violation object to the aggregated profiling data stored within correlation database 115. In this manner, security management device 128 may detect exceptions within the aggregate profiling data that fail to satisfy the rules defined by policy violation object, thereby identifying traffic flows that administrator 130 does not expect to be present within the enterprise.
Further, security management device 128 may execute other queries on correlation database 115 at the request of administrator 130. Correlation database 115 allows correlation based on events generated by different IDP-enabled devices. For example, application-layer elements describing a VPN failure event from firewall 110 may be used to identify a client device associated with the failure and to retrieve historical information for the client device.
Various embodiments of the invention have been described. Although the embodiments have been described in terms of packet-based systems and methods, any network and application-layer profiling data may be correlated for other types of networks without departing from the principles of the invention. These and other embodiments are within the scope of the following claims.
Claims (19)
1. A method comprising:
processing, with an intrusion detection device, packet flows to identify low-level network elements associated with the packet flows, wherein the low-level network elements describe one or more network devices of a network;
assembling application-layer communications from the packet flows with protocol-specific decoders;
processing the application-layer communications with the protocol-specific decoders to identify application-layer elements;
analyzing the application-layer communications to determine whether any of the packet flows represent a network attack and, for each of the packet flows, forwarding the packet flow only when the packet flow does not represent a network attack;
generating profiling data that associates the application-layer elements of the application-layer communications with the low-level network elements of the packet flows;
maintaining, within the intrusion detection device, a correlation database that stores the profiling data describing the packet flows within the network;
defining a database trigger for the correlation database to detect database operations that have changed the profiling data stored within the correlation database, wherein the database trigger is defined to detect database operations that have utilized a specified combination of the low-level network elements and the application-layer elements, such that the database trigger fires when changes are made to the network devices of the network that are determined to expose the network to security risks; and
maintaining, within the intrusion detection device, a log to record the detected database operations by updating the log when the database trigger fires to record in the log the database operation that fired the database trigger.
2. The method of claim 1, wherein the network elements comprise low-level network information including at least one of a network host, network peers or a network port associated with the network traffic.
3. The method of claim 1, wherein the application-layer elements comprise named elements that uniquely identify types of the application-layer elements and values for the named elements.
4. The method of claim 3, wherein the named elements for the application-layer communications include at least one of a file name, a user name, a software application name or a name of an attached document.
5. The method of claim 1, wherein generating profiling data comprises:
storing the network elements and the application-layer elements in the correlation database; and
defining relationships within the correlation database to associate the network elements of the packet flows with the application-layer elements of the application-layer communications.
6. The method of claim 5,
wherein the network elements comprise data defining hosts associated with the packet flows, data defining peers for each of the packet flows, and data defining ports associated with the packet flows, and
wherein defining relationships within the database comprises mapping each of the application-layer elements to a respective one of the peers.
7. The method of claim 1, wherein processing the application-layer communications comprises processing the application-layer communications with protocol-specific decoders for at least one of a HyperText Transfer Protocol (HTTP) decoder, a File Transfer Protocol (FTP) decoder, a Network News Transfer Protocol (NNTP) decoder, a Telnet decoder, a Domain Name System (DNS) decoder, a Gopher decoder, a Finger decoder, a Post Office Protocol (POP) decoder, a Secure Socket Layer (SSL) protocol decoder, a Lightweight Directory Access Protocol (LDAP) decoder, a Secure Shell (SSH) decoder, a Server Message Block (SMB) decoder or a Simple Mail Transfer Protocol (SMTP) decoder.
8. The method of claim 1, further comprising presenting a user interface by which a user defines the database triggers.
9. A system comprising:
a flow analysis module to process packet flows and identify low-level network elements associated with the packet flows in a network, wherein the low-level network elements describe one or more network devices of the network;
an analysis engine to form application-layer communications from the packet flows;
a plurality of protocol-specific decoders to process the application-layer communications to generate application-layer elements and to assemble application-layer communications from the packet flows, and to analyze the application-layer communications to determine whether any of the packet flows represent a network attack;
a forwarding component to, for each of the packet flows, forward the packet flow only when the packet flow does not represent a network attack, as determined by the plurality of protocol-specific decoders;
a profiler to generate profiling data by correlating the application-layer elements of the application-layer communications with the low-level network elements of the packet flows;
a correlation database that stores profiling data that describes the packet flows within the network; and
a network device that presents a user interface by which a user defines a database trigger to detect database operations that have changed the profiling data stored within the correlation database, wherein the user interface allows the user to define the database trigger by specifying a combination of the low-level network elements and the application-layer elements that the detected database operations have utilized, such that the database trigger fires when changes are made to the network devices of the network that are determined to expose the network to security risks; and
a log file maintained by the network device, wherein the network device records the detected database operations in the log file, and wherein the network device updates the log when the database trigger fires to record in the log the database operation fired the database trigger.
10. The system of claim 9, wherein the profiling data maps the application-layer elements to the network elements.
11. The system of claim 9, wherein the plurality of protocol-specific decoders include at least one of a HyperText Transfer Protocol (HTTP) decoder, a File Transfer Protocol (FTP) decoder, a Network News Transfer Protocol (NNTP) decoder or a Simple Mail Transfer Protocol (SMTP) decoder.
12. The system of claim 9, wherein the network elements comprise low-level network information including at least one of a network host, network peers or a network port associated with the network traffic.
13. The system of claim 9, wherein the application-layer elements comprise named elements that uniquely identify types of the application-layer elements and values for the named elements.
14. The system of claim 13, wherein the named elements for the application-layer communications include at least one of a file name, a user name, a software application name or a name of an attached document.
15. A computer-readable storage medium comprising instructions that cause a programmable processor within a network device to:
process packet flows to identify low-level network elements associated with the packet flows, wherein the low-level network elements describe one or more network devices of a network;
assemble application-layer communications from the packet flows with protocol-specific decoders;
process the application-layer communications with the protocol-specific decoders to identify application-layer elements;
analyze the application-layer communications to determine whether any of the packet flows represent a network attack and, for each of the packet flows, forwarding the packet flow only when the packet flow does not represent a network attack;
generate profiling data that associates the application-layer elements of the application-layer communications with the low-level network elements of the packet flows;
present a user interface by which a user defines a database trigger to detect database operations that have changed the profiling data stored within a correlation database, wherein the profiling data describes packet flows within the network, wherein the database trigger is defined to detect database operations that have utilized a specified combination of the low-level network elements and the application-layer elements, such that the database trigger fires when changes are made to the network devices of the network that are determined to expose the network to security risks;
maintain a log to record the detected database operations by updating the log when the database trigger fires to record in the log the database operation that fired the database trigger.
16. The method of claim 1, wherein defining a database trigger to detect database operations that change the profiling data stored within the correlation database comprises defining the trigger to fire in response to the database operations that change the profiling data.
17. The method of claim 1, wherein defining a database trigger to detect database operations that change the profiling data stored within the correlation database comprises defining the trigger to fire in response to one or more of a database insert operation and a database update operation.
18. The method of claim 1, wherein defining a database trigger to detect database operations that change the profiling data stored within the correlation database comprises defining the trigger to fire in response to a database insert operation that specifies newly detected peers that utilize a particular version of a communication protocol.
19. The method of claim 1, wherein defining a database trigger to detect database operations that change the profiling data stored within the correlation database comprises defining the trigger to fire in response to a database insert operation that specifies a new host that utilizes a specific vulnerable version of software.
US11/044,240 2005-01-27 2005-01-27 Automated change detection within a network environment Active 2027-12-20 US7810151B1 (en)
Priority Applications (1)
Application Number Priority Date Filing Date Title
US11/044,240 US7810151B1 (en) 2005-01-27 2005-01-27 Automated change detection within a network environment
Applications Claiming Priority (1)
Application Number Priority Date Filing Date Title
US11/044,240 US7810151B1 (en) 2005-01-27 2005-01-27 Automated change detection within a network environment
Publications (1)
Publication Number Publication Date
US7810151B1 true US7810151B1 (en) 2010-10-05
Family
ID=42797900
Family Applications (1)
Application Number Title Priority Date Filing Date
US11/044,240 Active 2027-12-20 US7810151B1 (en) 2005-01-27 2005-01-27 Automated change detection within a network environment
Country Status (1)
Country Link
US (1) US7810151B1 (en)
Cited By (16)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100071024A1 (en) * 2008-09-12 2010-03-18 Juniper Networks, Inc. Hierarchical application of security services within a computer network
US20100100949A1 (en) * 2007-07-06 2010-04-22 Abhilash Vijay Sonwane Identity and policy-based network security and management system and method
US20110196958A1 (en) * 2010-02-05 2011-08-11 International Business Machines Corporation Automatic updates to fabric alert definitions for fabric segmentation, fabric merge, and fabric principal switch changes
US8266267B1 (en) 2005-02-02 2012-09-11 Juniper Networks, Inc. Detection and prevention of encapsulated network attacks using an intermediate device
US8339959B1 (en) 2008-05-20 2012-12-25 Juniper Networks, Inc. Streamlined packet forwarding using dynamic filters for routing and security in a shared forwarding plane
US9213735B1 (en) * 2012-01-25 2015-12-15 Google Inc. Flow control in very large query result sets using a release message to confirm that a client computer is ready to receive the data associated with a data collection operation
US9251535B1 (en) 2012-01-05 2016-02-02 Juniper Networks, Inc. Offload of data transfer statistics from a mobile access gateway
US9756061B1 (en) * 2016-11-18 2017-09-05 Extrahop Networks, Inc. Detecting attacks using passive network monitoring
US9774520B1 (en) 2008-10-20 2017-09-26 Juniper Networks, Inc. Service aware path selection with a network acceleration device
EP3226479A1 (en) * 2016-03-31 2017-10-04 The Boeing Company System and method for automatic generation of filter rules
US10728126B2 (en) 2018-02-08 2020-07-28 Extrahop Networks, Inc. Personalization of alerts based on network monitoring
US10742677B1 (en) 2019-09-04 2020-08-11 Extrahop Networks, Inc. Automatic determination of user roles and asset types based on network monitoring
US10742530B1 (en) 2019-08-05 2020-08-11 Extrahop Networks, Inc. Correlating network traffic that crosses opaque endpoints
US10965702B2 (en) 2019-05-28 2021-03-30 Extrahop Networks, Inc. Detecting injection attacks using passive network monitoring
US10979282B2 (en) 2018-02-07 2021-04-13 Extrahop Networks, Inc. Ranking alerts based on network monitoring
US11012329B2 (en) 2018-08-09 2021-05-18 Extrahop Networks, Inc. Correlating causes and effects associated with network activity
Citations (42)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5787253A (en) * 1996-05-28 1998-07-28 The Ag Group Apparatus and method of analyzing internet activity
US6219786B1 (en) * 1998-09-09 2001-04-17 Surfcontrol, Inc. Method and system for monitoring and controlling network access
US6279113B1 (en) 1998-03-16 2001-08-21 Internet Tools, Inc. Dynamic signature inspection-based network intrusion detection
US20020078370A1 (en) 2000-12-18 2002-06-20 Tahan Thomas E. Controlled information flow between communities via a firewall
US20020144156A1 (en) * 2001-01-31 2002-10-03 Copeland John A. Network port profiling
US6499107B1 (en) 1998-12-29 2002-12-24 Cisco Technology, Inc. Method and system for adaptive network security using intelligent packet analysis
US20020198981A1 (en) 2001-06-22 2002-12-26 International Business Machines Corporation Method and system for exploiting likelihood in filter rule enforcement
US6507834B1 (en) * 1999-12-22 2003-01-14 Ncr Corporation Method and apparatus for parallel execution of SQL from stored procedures
US20030065953A1 (en) 2001-09-28 2003-04-03 Siemens Aktiengesellshaft Proxy unit, method for the computer-assisted protection of an application server program, a system having a proxy unit and a unit for executing an application server program
US20030105976A1 (en) 2000-11-30 2003-06-05 Copeland John A. Flow-based detection of network intrusions
US20030154399A1 (en) 2002-02-08 2003-08-14 Nir Zuk Multi-method gateway-based network security systems and methods
US20030182580A1 (en) 2001-05-04 2003-09-25 Lee Jai-Hyoung Network traffic flow control system
US20030204632A1 (en) * 2002-04-30 2003-10-30 Tippingpoint Technologies, Inc. Network security system integration
US20030212903A1 (en) 1998-11-09 2003-11-13 Porras Phillip Andrew Network surveillance
US20030217289A1 (en) * 2002-05-17 2003-11-20 Ken Ammon Method and system for wireless intrusion detection
US20030236990A1 (en) 2002-05-20 2003-12-25 Scott Hrastar Systems and methods for network security
US20040025044A1 (en) * 2002-07-30 2004-02-05 Day Christopher W. Intrusion detection system
US20040034800A1 (en) 2002-08-09 2004-02-19 Anil Singhal Intrusion detection system and network flow director method
US20040044912A1 (en) 2002-08-26 2004-03-04 Iven Connary Determining threat level associated with network activity
US20040083299A1 (en) 1999-06-30 2004-04-29 Dietz Russell S. Method and apparatus for monitoring traffic in a network
US6751728B1 (en) 1999-06-16 2004-06-15 Microsoft Corporation System and method of transmitting encrypted packets through a network access point
US6772345B1 (en) * 2002-02-08 2004-08-03 Networks Associates Technology, Inc. Protocol-level malware scanner
US20040151382A1 (en) 2003-02-04 2004-08-05 Tippingpoint Technologies, Inc. Method and apparatus for data packet pattern matching
US6789116B1 (en) * 1999-06-30 2004-09-07 Hi/Fn, Inc. State processor for pattern matching in a network monitor device
US20040255167A1 (en) 2003-04-28 2004-12-16 Knight James Michael Method and system for remote network security management
US20050044406A1 (en) 2002-03-29 2005-02-24 Michael Stute Adaptive behavioral intrusion detection systems and methods
US6918034B1 (en) 1999-09-29 2005-07-12 Nokia, Corporation Method and apparatus to provide encryption and authentication of a mini-packet in a multiplexed RTP payload
US7007301B2 (en) 2000-06-12 2006-02-28 Hewlett-Packard Development Company, L.P. Computer architecture for an intrusion detection system
US20060117386A1 (en) 2001-06-13 2006-06-01 Gupta Ramesh M Method and apparatus for detecting intrusions on a computer system
US7065657B1 (en) 1999-08-30 2006-06-20 Symantec Corporation Extensible intrusion detection system
US7076803B2 (en) 2002-01-28 2006-07-11 International Business Machines Corporation Integrated intrusion detection services
US7089428B2 (en) 2000-04-28 2006-08-08 Internet Security Systems, Inc. Method and system for managing computer security information
US7100201B2 (en) 2002-01-24 2006-08-29 Arxceo Corporation Undetectable firewall
US7174566B2 (en) 2002-02-01 2007-02-06 Intel Corporation Integrated network intrusion detection
US7222366B2 (en) 2002-01-28 2007-05-22 International Business Machines Corporation Intrusion event filtering
US7240368B1 (en) 1999-04-14 2007-07-03 Verizon Corporate Services Group Inc. Intrusion and misuse deterrence system employing a virtual network
US7277404B2 (en) 2002-05-20 2007-10-02 Airdefense, Inc. System and method for sensing wireless LAN activity
US7322044B2 (en) 2002-06-03 2008-01-22 Airdefense, Inc. Systems and methods for automated network policy exception detection and correction
US7324447B1 (en) 2002-09-30 2008-01-29 Packeteer, Inc. Methods, apparatuses and systems facilitating concurrent classification and control of tunneled and non-tunneled network traffic
US7324804B2 (en) 2003-04-21 2008-01-29 Airdefense, Inc. Systems and methods for dynamic sensor discovery and selection
US7331061B1 (en) 2001-09-07 2008-02-12 Secureworks, Inc. Integrated computer security management system and method
US7383577B2 (en) 2002-05-20 2008-06-03 Airdefense, Inc. Method and system for encrypted network management and intrusion detection
Patent Citations (45)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5787253A (en) * 1996-05-28 1998-07-28 The Ag Group Apparatus and method of analyzing internet activity
US6279113B1 (en) 1998-03-16 2001-08-21 Internet Tools, Inc. Dynamic signature inspection-based network intrusion detection
US6219786B1 (en) * 1998-09-09 2001-04-17 Surfcontrol, Inc. Method and system for monitoring and controlling network access
US20030212903A1 (en) 1998-11-09 2003-11-13 Porras Phillip Andrew Network surveillance
US6499107B1 (en) 1998-12-29 2002-12-24 Cisco Technology, Inc. Method and system for adaptive network security using intelligent packet analysis
US7240368B1 (en) 1999-04-14 2007-07-03 Verizon Corporate Services Group Inc. Intrusion and misuse deterrence system employing a virtual network
US6751728B1 (en) 1999-06-16 2004-06-15 Microsoft Corporation System and method of transmitting encrypted packets through a network access point
US6789116B1 (en) * 1999-06-30 2004-09-07 Hi/Fn, Inc. State processor for pattern matching in a network monitor device
US20040083299A1 (en) 1999-06-30 2004-04-29 Dietz Russell S. Method and apparatus for monitoring traffic in a network
US7065657B1 (en) 1999-08-30 2006-06-20 Symantec Corporation Extensible intrusion detection system
US6918034B1 (en) 1999-09-29 2005-07-12 Nokia, Corporation Method and apparatus to provide encryption and authentication of a mini-packet in a multiplexed RTP payload
US6507834B1 (en) * 1999-12-22 2003-01-14 Ncr Corporation Method and apparatus for parallel execution of SQL from stored procedures
US7089428B2 (en) 2000-04-28 2006-08-08 Internet Security Systems, Inc. Method and system for managing computer security information
US7007301B2 (en) 2000-06-12 2006-02-28 Hewlett-Packard Development Company, L.P. Computer architecture for an intrusion detection system
US20030105976A1 (en) 2000-11-30 2003-06-05 Copeland John A. Flow-based detection of network intrusions
US20020078370A1 (en) 2000-12-18 2002-06-20 Tahan Thomas E. Controlled information flow between communities via a firewall
US20020144156A1 (en) * 2001-01-31 2002-10-03 Copeland John A. Network port profiling
US20030182580A1 (en) 2001-05-04 2003-09-25 Lee Jai-Hyoung Network traffic flow control system
US7234168B2 (en) 2001-06-13 2007-06-19 Mcafee, Inc. Hierarchy-based method and apparatus for detecting attacks on a computer system
US7308715B2 (en) 2001-06-13 2007-12-11 Mcafee, Inc. Protocol-parsing state machine and method of using same
US20060117386A1 (en) 2001-06-13 2006-06-01 Gupta Ramesh M Method and apparatus for detecting intrusions on a computer system
US20020198981A1 (en) 2001-06-22 2002-12-26 International Business Machines Corporation Method and system for exploiting likelihood in filter rule enforcement
US7331061B1 (en) 2001-09-07 2008-02-12 Secureworks, Inc. Integrated computer security management system and method
US20030065953A1 (en) 2001-09-28 2003-04-03 Siemens Aktiengesellshaft Proxy unit, method for the computer-assisted protection of an application server program, a system having a proxy unit and a unit for executing an application server program
US7100201B2 (en) 2002-01-24 2006-08-29 Arxceo Corporation Undetectable firewall
US7222366B2 (en) 2002-01-28 2007-05-22 International Business Machines Corporation Intrusion event filtering
US7076803B2 (en) 2002-01-28 2006-07-11 International Business Machines Corporation Integrated intrusion detection services
US7174566B2 (en) 2002-02-01 2007-02-06 Intel Corporation Integrated network intrusion detection
US20030154399A1 (en) 2002-02-08 2003-08-14 Nir Zuk Multi-method gateway-based network security systems and methods
US6772345B1 (en) * 2002-02-08 2004-08-03 Networks Associates Technology, Inc. Protocol-level malware scanner
US20050044406A1 (en) 2002-03-29 2005-02-24 Michael Stute Adaptive behavioral intrusion detection systems and methods
US20030204632A1 (en) * 2002-04-30 2003-10-30 Tippingpoint Technologies, Inc. Network security system integration
US20030217289A1 (en) * 2002-05-17 2003-11-20 Ken Ammon Method and system for wireless intrusion detection
US7277404B2 (en) 2002-05-20 2007-10-02 Airdefense, Inc. System and method for sensing wireless LAN activity
US7383577B2 (en) 2002-05-20 2008-06-03 Airdefense, Inc. Method and system for encrypted network management and intrusion detection
US20030236990A1 (en) 2002-05-20 2003-12-25 Scott Hrastar Systems and methods for network security
US7322044B2 (en) 2002-06-03 2008-01-22 Airdefense, Inc. Systems and methods for automated network policy exception detection and correction
US20040025044A1 (en) * 2002-07-30 2004-02-05 Day Christopher W. Intrusion detection system
US7017186B2 (en) 2002-07-30 2006-03-21 Steelcloud, Inc. Intrusion detection system using self-organizing clusters
US20040034800A1 (en) 2002-08-09 2004-02-19 Anil Singhal Intrusion detection system and network flow director method
US20040044912A1 (en) 2002-08-26 2004-03-04 Iven Connary Determining threat level associated with network activity
US7324447B1 (en) 2002-09-30 2008-01-29 Packeteer, Inc. Methods, apparatuses and systems facilitating concurrent classification and control of tunneled and non-tunneled network traffic
US20040151382A1 (en) 2003-02-04 2004-08-05 Tippingpoint Technologies, Inc. Method and apparatus for data packet pattern matching
US7324804B2 (en) 2003-04-21 2008-01-29 Airdefense, Inc. Systems and methods for dynamic sensor discovery and selection
US20040255167A1 (en) 2003-04-28 2004-12-16 Knight James Michael Method and system for remote network security management
Non-Patent Citations (16)
* Cited by examiner, † Cited by third party
Title
"Norton Internet Security(TM) 2003 User's Guide," 2002, Symantec Corporation.
"Norton Internet Security™ 2003 User's Guide," 2002, Symantec Corporation.
Brugger, "Data Mining Methods for Network Intrusion Detection," Jun. 9, 2004, 65 pp.
Notice of Allowance in U.S. Appl. No. 11/044,619, mailed Dec. 15, 2009, 8 pp.
Office Action for U.S. Appl. No. 11/044,481, dated Nov. 9, 2009, 15 pp.
Office Action for U.S. Appl. No. 11/045,572, dated Nov. 12, 2009, 25 pp.
Reflex Security, Reflex Interceptor 500, Jan 29, 2004 http://web.archive.org/web/20040605205639/http://reflexsecurity.com/documents/ReflexInterceptor-500V32004-01-29.pdf, 2 pp.
Reflex Security, Reflex Intrusion Prevention System, May 7, 2004, 11 pp.
Response to Office Action dated Nov. 12, 2009, for U.S. Appl. No. 11/045,572, filed Feb. 12, 2010, 15 pp.
Response to Office Action dated Nov. 9, 2009, for U.S. Appl. No. 11/044,481, filed Feb. 9, 2010, 13 pp.
U.S. Patent Application entitled "Compound Attack Detection in a Computer Network", U.S. Appl. No. 11/045,572, filed Jan. 27, 2005.
U.S. Patent Application entitled "Detection and Prevention of Encapsulated Network Attacks Using an Intermediate Device", U.S. Appl. No. 11/049,620, filed Feb. 2, 2005.
U.S. Patent Application entitled "Identification of Network Policy Violations", U.S. Appl. No. 11/044,332, filed Jan. 27, 2005.
U.S. Patent Application entitled "Remote Aggregation of Network Traffic Profiling Data", U.S. Appl. No. 11/044,481, filed Jan. 27, 2005.
U.S. Patent Applicaton entitled "Application-Layer Monitoring and Profiling Network Traffic", U.S. Appl. No. 11/044,619, filed Jan. 27, 2005.
www.ethereal.com, retrieved from the Internet Archive WayBackMachine, indexed Jan. 1, 2004. *
Cited By (23)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8266267B1 (en) 2005-02-02 2012-09-11 Juniper Networks, Inc. Detection and prevention of encapsulated network attacks using an intermediate device
US20100100949A1 (en) * 2007-07-06 2010-04-22 Abhilash Vijay Sonwane Identity and policy-based network security and management system and method
US8984620B2 (en) * 2007-07-06 2015-03-17 Cyberoam Technologies Pvt. Ltd. Identity and policy-based network security and management system and method
US8339959B1 (en) 2008-05-20 2012-12-25 Juniper Networks, Inc. Streamlined packet forwarding using dynamic filters for routing and security in a shared forwarding plane
US8955107B2 (en) * 2008-09-12 2015-02-10 Juniper Networks, Inc. Hierarchical application of security services within a computer network
US20100071024A1 (en) * 2008-09-12 2010-03-18 Juniper Networks, Inc. Hierarchical application of security services within a computer network
US9774520B1 (en) 2008-10-20 2017-09-26 Juniper Networks, Inc. Service aware path selection with a network acceleration device
US10084640B2 (en) 2010-02-05 2018-09-25 International Business Machines Corporation Automatic updates to fabric alert definitions
US8326978B2 (en) * 2010-02-05 2012-12-04 International Business Machines Corporation Automatic updates to fabric alert definitions for fabric segmentation, fabric merge, and fabric principal switch changes
US20110196958A1 (en) * 2010-02-05 2011-08-11 International Business Machines Corporation Automatic updates to fabric alert definitions for fabric segmentation, fabric merge, and fabric principal switch changes
US9813345B1 (en) 2012-01-05 2017-11-07 Juniper Networks, Inc. Offload of data transfer statistics from a mobile access gateway
US9251535B1 (en) 2012-01-05 2016-02-02 Juniper Networks, Inc. Offload of data transfer statistics from a mobile access gateway
US9213735B1 (en) * 2012-01-25 2015-12-15 Google Inc. Flow control in very large query result sets using a release message to confirm that a client computer is ready to receive the data associated with a data collection operation
EP3226479A1 (en) * 2016-03-31 2017-10-04 The Boeing Company System and method for automatic generation of filter rules
US10721259B2 (en) * 2016-03-31 2020-07-21 The Boeing Company System and method for automatic generation of filter rules
US9756061B1 (en) * 2016-11-18 2017-09-05 Extrahop Networks, Inc. Detecting attacks using passive network monitoring
US10243978B2 (en) 2016-11-18 2019-03-26 Extrahop Networks, Inc. Detecting attacks using passive network monitoring
US10979282B2 (en) 2018-02-07 2021-04-13 Extrahop Networks, Inc. Ranking alerts based on network monitoring
US10728126B2 (en) 2018-02-08 2020-07-28 Extrahop Networks, Inc. Personalization of alerts based on network monitoring
US11012329B2 (en) 2018-08-09 2021-05-18 Extrahop Networks, Inc. Correlating causes and effects associated with network activity
US10965702B2 (en) 2019-05-28 2021-03-30 Extrahop Networks, Inc. Detecting injection attacks using passive network monitoring
US10742530B1 (en) 2019-08-05 2020-08-11 Extrahop Networks, Inc. Correlating network traffic that crosses opaque endpoints
US10742677B1 (en) 2019-09-04 2020-08-11 Extrahop Networks, Inc. Automatic determination of user roles and asset types based on network monitoring
Similar Documents
Publication Publication Date Title
US7769851B1 (en) Application-layer monitoring and profiling network traffic
US7810151B1 (en) Automated change detection within a network environment
US7937755B1 (en) Identification of network policy violations
US7809826B1 (en) Remote aggregation of network traffic profiling data
US8879415B2 (en) Method and system for annotating network flow information
Kandula et al. What's going on? Learning communication rules in edge networks
US10079846B2 (en) Domain name system (DNS) based anomaly detection
US10296748B2 (en) Simulated attack generator for testing a cybersecurity system
US7633944B1 (en) Managing timeouts for dynamic flow capture and monitoring of packet flows
US9917856B2 (en) Rule-based network-threat detection for encrypted communications
US7747737B1 (en) Network device having service card for dynamic flow capture and monitoring of packet flows
US8572717B2 (en) Dynamic access control policy with port restrictions for a network security appliance
US8584226B2 (en) Method and apparatus for geographically regulating inbound and outbound network communications
US20200137021A1 (en) Using intent to access in discovery protocols in a network for analytics
US8209756B1 (en) Compound attack detection in a computer network
US20090210523A1 (en) Network management method and system
US20200137115A1 (en) Smart and selective mirroring to enable seamless data collection for analytics
US20050207447A1 (en) IP address duplication monitoring device, IP address duplication monitoring method and IP address duplication monitoring program
Heidemann et al. Uses and challenges for network datasets
JP2021516024A (en) Determining traceability of network traffic over communication networks
US11005736B2 (en) Determining traceability of network traffic over a communications network
Holsopple et al. Virtual terrain: a security-based representation of a computer network
US20200137094A1 (en) Behavioral profiling of service access using intent to access in discovery protocols
Bonola et al. StreaMon: A data-plane programming abstraction for software-defined stream monitoring
US11025588B2 (en) Identify assets of interest in enterprise using popularity as measure of importance
Legal Events
Date Code Title Description
AS Assignment
Owner name: JUNIPER NETWORKS, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:GURUSWAMY, KOWSIK;REEL/FRAME:016238/0046
Effective date: 20050126
STCF Information on status: patent grant
Free format text: PATENTED CASE
FPAY Fee payment
Year of fee payment: 4
FEPP Fee payment procedure
Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.)
FEPP Fee payment procedure
Free format text: 7.5 YR SURCHARGE - LATE PMT W/IN 6 MO, LARGE ENTITY (ORIGINAL EVENT CODE: M1555)
MAFP Maintenance fee payment
Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552)
Year of fee payment: 8
|
{
"url": "https://patents.google.com/patent/US7810151B1/en",
"source_domain": "patents.google.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "260697",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MHE7KG4CXZABWZRDQNI57CM57DPMDGHU",
"WARC-Concurrent-To": "<urn:uuid:f6459003-7fa6-4380-9b5c-718e8a256b00>",
"WARC-Date": "2021-07-27T03:04:07Z",
"WARC-IP-Address": "142.250.188.206",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SV4RMEROGPFE5VLOR3OGTJZBQ5RNXXDB",
"WARC-Record-ID": "<urn:uuid:c225f7fa-ddd8-4e9a-8125-c8461ec9da9a>",
"WARC-Target-URI": "https://patents.google.com/patent/US7810151B1/en",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5eb4f2c4-a5d9-4bdb-8237-374eacdf0a34>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-198.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,
87,
88,
157,
158,
163,
164,
183,
195,
360,
370,
373,
387,
406,
414,
423,
435,
441,
454,
469,
660,
676,
695,
708,
717,
734,
907,
928,
946,
967,
1158,
1170,
1187,
1265,
1330,
1491,
1528,
1598,
1635,
1677,
1678,
1684,
1685,
1692,
1693,
1709,
1710,
1729,
1771,
1849,
1942,
2089,
2268,
2283,
2325,
2368,
2498,
2641,
2830,
2912,
2931,
2973,
3051,
3131,
3252,
3390,
3409,
3451,
3529,
3609,
3663,
3682,
3724,
3802,
3882,
3987,
4006,
4048,
4090,
4176,
4218,
4252,
4285,
4286,
4295,
4296,
4883,
4884,
4896,
4897,
4913,
5025,
5036,
5898,
5906,
6452,
7277,
8072,
8952,
9321,
9658,
10129,
10385,
10415,
10686,
10782,
10857,
10948,
11072,
11165,
11298,
11319,
11813,
12215,
12683,
13410,
14151,
15124,
15644,
16022,
16440,
16918,
17547,
18526,
19714,
20221,
20861,
21219,
21635,
21974,
22405,
22963,
23590,
23983,
24216,
24868,
25206,
25516,
25731,
26209,
26782,
27151,
28027,
28152,
28803,
29469,
29555,
29646,
29738,
30380,
31338,
31661,
31977,
33110,
33621,
34102,
34981,
35431,
36442,
36793,
37410,
37717,
38328,
38903,
39357,
39731,
39732,
39744,
39745,
39769,
39993,
40092,
40216,
40460,
40630,
40784,
41293,
41523,
41728,
41915,
42122,
42193,
42290,
42476,
42502,
42706,
42848,
43523,
43643,
43667,
43893,
43976,
44302,
44508,
44689,
44795,
45379,
45660,
45775,
46063,
46269,
46457,
46666,
46793,
46977,
47074,
47195,
47437,
47605,
48189,
48376,
48649,
48942,
49286,
49614,
49740,
49741,
49767,
49768,
49819,
49927,
49928,
49963,
49964,
50015,
50123,
50124,
50141,
50142,
50178,
50223,
50224,
50231,
50232,
50244,
50245,
50269,
50270,
50321,
50447,
50448,
50467,
50468,
50481,
50505,
50506,
50520,
50521,
50565,
50630,
50770,
50914,
51124,
51272,
51440,
51669,
51796,
51912,
52038,
52157,
52275,
52421,
52543,
52668,
52775,
52903,
52904,
52919,
52920,
52964,
53029,
53134,
53257,
53380,
53502,
53587,
53731,
53889,
54020,
54263,
54366,
54481,
54575,
54688,
54774,
54880,
54978,
55069,
55185,
55299,
55416,
55560,
55669,
55798,
55916,
56037,
56154,
56320,
56457,
56582,
56680,
56803,
56935,
57015,
57111,
57220,
57364,
57472,
57612,
57796,
57915,
58030,
58161,
58162,
58184,
58185,
58229,
58294,
58399,
58522,
58645,
58731,
58875,
59019,
59163,
59281,
59398,
59496,
59662,
59793,
59925,
60062,
60165,
60287,
60372,
60466,
60598,
60706,
60831,
60989,
61104,
61347,
61427,
61536,
61659,
61755,
61870,
61979,
62096,
62209,
62315,
62423,
62554,
62652,
62792,
62883,
62997,
63113,
63227,
63411,
63540,
63659,
63780,
63781,
63807,
63808,
63852,
63858,
63936,
64011,
64096,
64174,
64246,
64319,
64496,
64569,
64675,
64779,
64911,
65080,
65208,
65345,
65487,
65581,
65582,
65596,
65597,
65641,
65706,
65854,
65998,
66147,
66315,
66451,
66591,
66717,
66847,
67053,
67263,
67390,
67517,
67746,
67865,
67985,
68101,
68216,
68323,
68441,
68569,
68694,
68816,
68962,
68963,
68981,
68982,
69017,
69093,
69166,
69227,
69297,
69372,
69450,
69517,
69597,
69688,
69770,
69878,
69981,
70093,
70187,
70252,
70310,
70410,
70560,
70618,
70709,
70801,
70889,
70995,
71095,
71197,
71198,
71211,
71212,
71240,
71254,
71255,
71302,
71303,
71404,
71405,
71430,
71431,
71472,
71473,
71505,
71506,
71523,
71524,
71547,
71548,
71575,
71576,
71654,
71655,
71682,
71683,
71782,
71783,
71812,
71813,
71911,
71912
],
"line_end_idx": [
87,
88,
157,
158,
163,
164,
183,
195,
360,
370,
373,
387,
406,
414,
423,
435,
441,
454,
469,
660,
676,
695,
708,
717,
734,
907,
928,
946,
967,
1158,
1170,
1187,
1265,
1330,
1491,
1528,
1598,
1635,
1677,
1678,
1684,
1685,
1692,
1693,
1709,
1710,
1729,
1771,
1849,
1942,
2089,
2268,
2283,
2325,
2368,
2498,
2641,
2830,
2912,
2931,
2973,
3051,
3131,
3252,
3390,
3409,
3451,
3529,
3609,
3663,
3682,
3724,
3802,
3882,
3987,
4006,
4048,
4090,
4176,
4218,
4252,
4285,
4286,
4295,
4296,
4883,
4884,
4896,
4897,
4913,
5025,
5036,
5898,
5906,
6452,
7277,
8072,
8952,
9321,
9658,
10129,
10385,
10415,
10686,
10782,
10857,
10948,
11072,
11165,
11298,
11319,
11813,
12215,
12683,
13410,
14151,
15124,
15644,
16022,
16440,
16918,
17547,
18526,
19714,
20221,
20861,
21219,
21635,
21974,
22405,
22963,
23590,
23983,
24216,
24868,
25206,
25516,
25731,
26209,
26782,
27151,
28027,
28152,
28803,
29469,
29555,
29646,
29738,
30380,
31338,
31661,
31977,
33110,
33621,
34102,
34981,
35431,
36442,
36793,
37410,
37717,
38328,
38903,
39357,
39731,
39732,
39744,
39745,
39769,
39993,
40092,
40216,
40460,
40630,
40784,
41293,
41523,
41728,
41915,
42122,
42193,
42290,
42476,
42502,
42706,
42848,
43523,
43643,
43667,
43893,
43976,
44302,
44508,
44689,
44795,
45379,
45660,
45775,
46063,
46269,
46457,
46666,
46793,
46977,
47074,
47195,
47437,
47605,
48189,
48376,
48649,
48942,
49286,
49614,
49740,
49741,
49767,
49768,
49819,
49927,
49928,
49963,
49964,
50015,
50123,
50124,
50141,
50142,
50178,
50223,
50224,
50231,
50232,
50244,
50245,
50269,
50270,
50321,
50447,
50448,
50467,
50468,
50481,
50505,
50506,
50520,
50521,
50565,
50630,
50770,
50914,
51124,
51272,
51440,
51669,
51796,
51912,
52038,
52157,
52275,
52421,
52543,
52668,
52775,
52903,
52904,
52919,
52920,
52964,
53029,
53134,
53257,
53380,
53502,
53587,
53731,
53889,
54020,
54263,
54366,
54481,
54575,
54688,
54774,
54880,
54978,
55069,
55185,
55299,
55416,
55560,
55669,
55798,
55916,
56037,
56154,
56320,
56457,
56582,
56680,
56803,
56935,
57015,
57111,
57220,
57364,
57472,
57612,
57796,
57915,
58030,
58161,
58162,
58184,
58185,
58229,
58294,
58399,
58522,
58645,
58731,
58875,
59019,
59163,
59281,
59398,
59496,
59662,
59793,
59925,
60062,
60165,
60287,
60372,
60466,
60598,
60706,
60831,
60989,
61104,
61347,
61427,
61536,
61659,
61755,
61870,
61979,
62096,
62209,
62315,
62423,
62554,
62652,
62792,
62883,
62997,
63113,
63227,
63411,
63540,
63659,
63780,
63781,
63807,
63808,
63852,
63858,
63936,
64011,
64096,
64174,
64246,
64319,
64496,
64569,
64675,
64779,
64911,
65080,
65208,
65345,
65487,
65581,
65582,
65596,
65597,
65641,
65706,
65854,
65998,
66147,
66315,
66451,
66591,
66717,
66847,
67053,
67263,
67390,
67517,
67746,
67865,
67985,
68101,
68216,
68323,
68441,
68569,
68694,
68816,
68962,
68963,
68981,
68982,
69017,
69093,
69166,
69227,
69297,
69372,
69450,
69517,
69597,
69688,
69770,
69878,
69981,
70093,
70187,
70252,
70310,
70410,
70560,
70618,
70709,
70801,
70889,
70995,
71095,
71197,
71198,
71211,
71212,
71240,
71254,
71255,
71302,
71303,
71404,
71405,
71430,
71431,
71472,
71473,
71505,
71506,
71523,
71524,
71547,
71548,
71575,
71576,
71654,
71655,
71682,
71683,
71782,
71783,
71812,
71813,
71911,
71912,
71934
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 71934,
"ccnet_original_nlines": 472,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22391550242900848,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.045190490782260895,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.28645792603492737,
"rps_doc_frac_unique_words": 0.1473483294248581,
"rps_doc_mean_word_length": 5.952792167663574,
"rps_doc_num_sentences": 534,
"rps_doc_symbol_to_word_ratio": 0.0003017699928022921,
"rps_doc_unigram_entropy": 5.99752140045166,
"rps_doc_word_count": 9956,
"rps_doc_frac_chars_dupe_10grams": 0.4014105796813965,
"rps_doc_frac_chars_dupe_5grams": 0.5826612114906311,
"rps_doc_frac_chars_dupe_6grams": 0.529426634311676,
"rps_doc_frac_chars_dupe_7grams": 0.4907366931438446,
"rps_doc_frac_chars_dupe_8grams": 0.45393648743629456,
"rps_doc_frac_chars_dupe_9grams": 0.43242332339286804,
"rps_doc_frac_chars_top_2gram": 0.010798770003020763,
"rps_doc_frac_chars_top_3gram": 0.005669360049068928,
"rps_doc_frac_chars_top_4gram": 0.004555730149149895,
"rps_doc_books_importance": -4069.967529296875,
"rps_doc_books_importance_length_correction": -4069.967529296875,
"rps_doc_openwebtext_importance": -3721.75341796875,
"rps_doc_openwebtext_importance_length_correction": -3721.75341796875,
"rps_doc_wikipedia_importance": -2281.379638671875,
"rps_doc_wikipedia_importance_length_correction": -2281.379638671875
},
"fasttext": {
"dclm": 0.0625075101852417,
"english": 0.7916550040245056,
"fineweb_edu_approx": 2.5729665756225586,
"eai_general_math": 0.13042175769805908,
"eai_open_web_math": 0.17514008283615112,
"eai_web_code": 0.02949797920882702
}
}
|
{
"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": "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": "11",
"label": "Legal/Regulatory"
},
"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": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,260,334,350,973,953,300
|
Is it possible to predict the future using virtual reality?
Source: Aurecon , Author: Posted by BI-ME staff
Posted: Wed March 8, 2017 12:40 pm
INTERNATIONAL. “Why shouldn’t people be able to teleport wherever they want?” asked Palmer Luckey. Now they can – in virtual reality, thanks to his design of Oculus VR, a high definition virtual reality head-mounted display.
They can visit their dream travel destinations or explore completely dreamt up worlds. Using Google’s low-cost Cardboard headsets, a child in Africa can go on a virtual field trip. And Microsoft has just taken it to another level with HoloLens, which provides a mixed reality experience where high definition holograms interact with the real world.
Designers and engineers have been exploring different ways of using virtual reality, mixed reality and augmented reality , including prototyping, design reviews, stakeholder engagement and training. But how much value is this really providing? Is it saving us enough time and money to justify the cost? While virtual reality allows us to ‘see’ far more, what are we not ‘seeing’?
Are we in danger of getting swept up in using new technology, just because we can? Would stopping to question how we’re using virtual reality lead us to discover that we’ve overlooked its true potential?
Professor at the University of California, San Franciso, School of Medicine, Atul Butte said: “Hiding within those mounds of data is knowledge that could change the life of a patient, or change the world.” One of the biggest challenges for our industry (and many others) is making sense of big data. What’s clear is that we can’t rely on traditional approaches. This is where virtual reality comes in…
Just imagine if we could pick up the data on all vehicle movements in a city…and what if we could also collect data on the volume of traffic that is on the roads, the velocity and the acceleration and deceleration of every vehicle, and the number of people that are in each car. How could we represent that data in a way that makes sense to the human brain?
How can we make the inter-dependences and interactions between this data clear and meaningful? The solution is certainly not a spreadsheet!
Traditionally, when we do a traffic analysis, we do it on a bit by bit basis. Big data allows whole data sets to be viewed at the same time and the consequences of one optimisation to be seen
elsewhere.
Wouldn’t it be great if we could ‘see’ the interactions between big data sets? Imagine being immersed in a virtual city where the number of people in each car is shown on a heat map? What if you could see trends, patterns and inconsistencies? Universities, such as the University of Technology Sydney, are developing data arenas with 360° screens that enable data visualisation in an immersive environment.
And if teams could not only see, but interact, with a design at a data arena early in a project, how much time and effort would we save then? How much better would our designs be? Which previously unworkable problems will we now be able to solve?
As new technologies continue to disrupt our industry, the future of design is unclear . But if we can use virtual reality to understand big data, just imagine what we might be able to see that we’ve never been able to see before. And if we can bring together diverse teams to explore new ideas and design in an immersive, digital environment, who knows what solutions we might uncover?
Notes:
This glimpse of the future was crafted by: Robert Angus
Aurecon has launched a new futuristic blog! Called Just Imagine, it provides a glimpse into the future for curious readers, exploring ideas that are probable, possible and for the imagination.
Click here to view this original post on the Just Imagine blog
Get access to the latest blog posts as soon as they are published by subscribing to the blog
MIDDLE EAST BUSINESS COMMENT & ANALYSIS
date:Posted: September 18, 2017
SAUDI ARABIA. A new report by executive search firm Metin Mitchell & Co highlights the confidence that Saudi women feel about their working futures and what needs to be done to increase the number of women in the workplace.
date:Posted: September 15, 2017
UAE. First of its kind study in the MENA region reveals why we are emotionally drawn to certain destinations and environments; Visible everyday human activity, greenery, artistic features and bright colours found to be the most powerful drivers of emotional engagement.
date:Posted: September 14, 2017
UAE. Family offices, importers and exporters, and the TMT industry will be impacted by VAT in various ways, so the need to ensure they are prepared for when VAT is introduced from 1 January 2018 is clear.
SAUDI ARABIA. The Future Investment Initiative (FII) will host global leaders, investors and innovators; FII will be a game-changing platform exploring the trends, opportunities and challenges that will shape the world economy and investment environment over the coming decades.
dhgate
|
{
"url": "http://www.bi-me.com/main.php?id=72578&t=1&c=10&cg=3&mset=1021",
"source_domain": "www.bi-me.com",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "50569",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XLHWYQXCXXV4RNQSWRKWA4JWZTYSIAZ5",
"WARC-Concurrent-To": "<urn:uuid:75faae12-0035-4f96-b5f6-16a7b5289591>",
"WARC-Date": "2017-09-20T07:19:17Z",
"WARC-IP-Address": "5.39.81.151",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:BHL3TAPGPHJ6WKGITHQHGG346AIBMSNL",
"WARC-Record-ID": "<urn:uuid:0906de91-9e5c-402b-90b4-3013c5a82278>",
"WARC-Target-URI": "http://www.bi-me.com/main.php?id=72578&t=1&c=10&cg=3&mset=1021",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:39fdb670-8f4a-4443-b80c-4bb5b41f1a4a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-143-241-238.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,
60,
108,
143,
144,
369,
370,
719,
720,
1101,
1102,
1306,
1307,
1709,
1710,
2068,
2069,
2209,
2210,
2402,
2413,
2414,
2821,
2822,
3069,
3070,
3456,
3457,
3464,
3465,
3522,
3523,
3717,
3718,
3785,
3786,
3880,
3881,
3883,
3884,
3924,
3925,
3957,
4181,
4213,
4483,
4515,
4720,
4999
],
"line_end_idx": [
60,
108,
143,
144,
369,
370,
719,
720,
1101,
1102,
1306,
1307,
1709,
1710,
2068,
2069,
2209,
2210,
2402,
2413,
2414,
2821,
2822,
3069,
3070,
3456,
3457,
3464,
3465,
3522,
3523,
3717,
3718,
3785,
3786,
3880,
3881,
3883,
3884,
3924,
3925,
3957,
4181,
4213,
4483,
4515,
4720,
4999,
5005
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5005,
"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.4250764548778534,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022426100447773933,
"rps_doc_frac_lines_end_with_ellipsis": 0.020408159121870995,
"rps_doc_frac_no_alph_words": 0.14882773160934448,
"rps_doc_frac_unique_words": 0.4909747242927551,
"rps_doc_mean_word_length": 4.851985454559326,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.002038740087300539,
"rps_doc_unigram_entropy": 5.447542667388916,
"rps_doc_word_count": 831,
"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.0277777798473835,
"rps_doc_frac_chars_top_3gram": 0.014136900193989277,
"rps_doc_frac_chars_top_4gram": 0.008432540111243725,
"rps_doc_books_importance": -422.4434509277344,
"rps_doc_books_importance_length_correction": -422.4434509277344,
"rps_doc_openwebtext_importance": -277.8200378417969,
"rps_doc_openwebtext_importance_length_correction": -277.8200378417969,
"rps_doc_wikipedia_importance": -167.64732360839844,
"rps_doc_wikipedia_importance_length_correction": -167.64732360839844
},
"fasttext": {
"dclm": 0.02740556001663208,
"english": 0.932549774646759,
"fineweb_edu_approx": 2.2547922134399414,
"eai_general_math": 0.09625493735074997,
"eai_open_web_math": 0.1487005352973938,
"eai_web_code": 0.009347019717097282
}
}
|
{
"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": "658.401",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "1",
"label": "News/Editorial"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "15",
"label": "Nonfiction Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,807,127,164,837,220,000
|
Archive for the ‘Line Integrals’ Tag
Math 213: How to Integrate
After the second test, most of Calc III revolves around various methods for finding line and surface integrals (in Rogawski’s text, this corresponds to chapter 16). Evaluating these integrals is straightforward, particularly once you know the shortcuts (e.g., divergence theorem). Even without the shortcuts, however, integrals of this type are simple so long as you know which formula to use when. So, what follows is a flowchart you can follow to figure out which formula to use. After the chart are a number of example problems solved using the flowchart.
Before I introduce the flowchart, however, keep a few things in mind:
• Your final answer should always be a number. So, if you integrate and your answer is a vector, you’ve done something wrong! Specifically, if you’re trying to integrate a vector-valued function (e.g., \langle x^2y, ye^z,\sin y \rangle ), you should do a dot product at some point.
• Sometimes, you’ll have to figure out which parametrization to use. If you’re given something like y=f(x) , you should probably parametrize like {\mathbf c}(t) = \langle t, f(t) \rangle . Here, t will have the same bounds as x. If you’re given something else, you’ll have to work a little harder. Some common cases are the parametrization of a line and parametrization of a circle. Say you’re given two points, {\mathbf a} and {\mathbf b}. Then, it’s probably easiest to parametrize like {\mathbf c}(t)={\mathbf a}+({\mathbf b}-{\mathbf a})t for 0\leq t \leq 1 (Note: You can also find an equation for you line in terms of y=mx+b and use {\mathbf c}(t) = \langle t, f(t) \rangle . Sometimes this is easier, sometimes it’s harder – it’s hard to say a priori how it will go. Really, the parametrization you use is a matter of personal preference and how comfortable you are with each method.). Parameterizing a circle is a little more straightforward. Unless you have a particularly compelling reason not to (and off the top of my head, I certainly can’t think of any), always use {\mathbf c}(t)=\langle r\cos \theta, r\sin \theta \rangle. Then, make your \theta bounds correspond to how much of the circle you’re considering.
• The above point is, of course, a little trickier for 3D surfaces, but the same ideas roughly apply. For example, if you’re given z=f(x,y), you can parametrize using {\mathbf\phi}(r,s) = \langle r,s,f(r,s)\rangle. Here, your bounds on r and s correspond to your bounds on x and y. See your book (or me or Gus) for more details.
With those points out of the way, we can now look at the flowchart. Though it doesn’t explicitly say so, start in the upper-left corner (click on the image to make it bigger).
This flowchart describes (essentially) four cases. We’ll give an example of each.
Example 1: Contour Integral of a scalar function
Say we’re trying to find \int_c xy ds over the contour described by x^2+y^2=16. Following the flowchart, we answer a few questions. First, we are given a function (xy), so we move on to answer if our function is scalar or vector. Obviously, we know from the title of this example that we have a scalar function. If we weren’t given that information, however, we would still know we have a scalar function (recall, a scalar function is anything which isn’t a vector function). Moreover, since we’re integrating over something in 2D, x^2+y^2=16, we know that we have a contour (or line) integral. So, following the flowchart, we evaluate our integral using \int_a^b f({\mathbf c}(t))||{\mathbf c}^\prime(t)||dt. That is, we only have three more things to do until we’ve found our answer: first, we must find {\mathbf c}(t) and its derivative. Second, we substitute what we’ve just found into the equation for scalar line integrals. Finally, we evaluate the integral.
Since we’re integrating over a circle of radius 4 (recall that a circle with radius r is written implicitly as x^2+y^2=r^2), we want to parametrize using {\mathbf c}(t) = \langle 4\cos\theta, 4\sin\theta \rangle for 0\leq \theta \leq 2\pi . So, {\mathbf c}^\prime(t) = \langle -4\sin\theta, 4\cos\theta \rangle. Thus, we’ve accomplished our first step. Second, we want to substitute these into our integral, giving
\int_a^b f({\mathbf c}(t))||{\mathbf c}^\prime(t)||dt = \int_0^{2\pi} (4\cos\theta)(4\sin\theta)\sqrt{(-4\sin\theta)^2+(4\cos\theta)^2} = 64\int_0^{2\pi} \cos\theta\sin\theta .
Finally, we want to evaluate this integral. There are a few methods for doing this (one could, say, rewrite this integral using trig-identities). I’ll use u-substitution. So, setting u=\sin\theta, we have du=\cos\theta d\theta, and our bounds go from \theta=0 to u=\sin 0=0 and from \theta=2\pi to u=\sin 2\pi=0. Since our bounds now go from 0 to 0, we’re not integrating over any area! That is, our final answer is
\int_c xy ds = 0 .
Of course, since we’re integrating over a closed contour, this is expected.
Example 2: Contour integral of a vector function
When we have a vector-valued function, we know we need to take a dot product. Otherwise, we’d be integrating over a vector (which we know is wrong from the bulleted list above!). So, say we have {\mathbf F}=\langle x,y,z \rangle and a contour described by {\mathbf c}(t)=\langle t, e^t,t^2 \rangle for 0\leq t \leq 2. Following the flowchart, we get to a point where we have to test if {\mathbf F} is conservative. Indeed, testing each of our conditions, we find that {\mathbf F} is conservative. So, we can use the fundamental theorem of line integrals to evaluate our answer quite easily. We’ll do it the long way too, for practice.
• Using the Fundamental Theorem of Line Integrals (FTLI)
To use the FTLI, we have to first find the potential function for {\mathbf F}. In this case, it’s pretty straightforward. We want to find a scalar function, say \phi, such that \nabla \phi={\mathbf F}. By inspection, we see that \phi=\frac{x^2}{2}+\frac{y^2}{2}+\frac{z^2}{2} will work (\nabla[\frac{x^2}{2}+\frac{y^2}{2}+\frac{z^2}{2}] = \langle \frac{\partial}{\partial x}, \frac{\partial}{\partial y}, \frac{\partial}{\partial z} \rangle[\frac{x^2}{2}+\frac{y^2}{2}+\frac{z^2}{2}] = \langle x,y,z\rangle). So, to finish evaluating, we simply use the formula \phi({\mathbf c}(2))-\phi({\mathbf c}(0)) = \phi(2,e^2,4)-\phi(0,1,0) = \frac{19+e^4}{2}.
• Using Parameterization
Following the flowchart the wrong way leads to the formula \int_c {\mathbf F}\cdot d{\mathbf s} = \int_a^b {\mathbf F}(\mathbf{c}(t))\cdot {\mathbf c}^\prime(t) dt. Like in Example 1, we follow a three step process here. First, we find {\mathbf c}^{\prime} (t) = \langle 1, e^t,2t \rangle. Next, we find {\mathbf F}({\mathbf c}(t))\cdot{\mathbf c}^{\prime}(t) = 2t^3+t+e^{2t}. Finally, we integrate this function, \int_0^2 2t^3+t+e^{2t} dt = \frac{19+e^4}{2}. These are the same answers (which is nice).
Example 3 : Surface integral of a scalar function
Let’s consider \int_S xy+z ds over the surface x+2y+z=2 in the first octant (x,y,z\geq 0). Following the flowchart appropriately, we arrive at the formula \int\int_S f ds = \int\int_D f(\phi(u,v))||\phi(u,v)_u\times\phi(u,v)_v||. So, to continue, we need to find a parametrization, \phi(u,v) of our surface, x+2y+z=2. One valid parametrization here is \phi(u,v)=\langle u,v,2-u-2v \rangle. Note that this comes from solving the surface equation x+2y+z=2 for z and replacing x and y with u and v, respectively. Then, to find our normal vector, we compute
{\mathbf n} = \phi_u\times\phi_v = \langle 1,2,1 \rangle.
(It’s quite hard to write down how to do a cross product in wordpress. If you’re unsure how I got \langle 1,2,1 \rangle, check your book, or ask me or Gus). Now that we have our normal vector, we simply need to take its magnitude and take the actual integral. So, we find that ||{\mathbf n}|| = \sqrt{1^2+2^2+1^2}=\sqrt{6}. Here, it’s important to point out an important short-cut for this. You learned in class that, if you can write your surface as z=f(x,y) for some function f(x,y), you can use the formula ||{\mathbf n}|| = \sqrt{1+\left(\frac{\partial f}{\partial x}\right)^2+\left(\frac{\partial f}{\partial y}\right)^2}. Let’s try that in this case: \frac{\partial f}{\partial x} = -1 and \frac{\partial f}{\partial y} = -2. So, \sqrt{1+\left(\frac{\partial f}{\partial x}\right)^2+\left(\frac{\partial f}{\partial y}\right)^2} = \sqrt{6}, just like we found above.The next step is to determine that f(\phi(u,v))=uv+2-u-2v.
Finally, we just need to find the bounds of our integral and actually compute the answer. Because we’re doing a surface integral, we only look at the projection of our surface. In other words, we need to find the triangle in the xy-plane. So, we set z=0 and find y=1-\frac{1}{2}x. Thus, the bounds on our integral will be 0\leq x \leq \frac{1}{2} and 0\leq y \leq 1-\frac{1}{2}x . So, our integral becomes \sqrt{6}\int_0^\frac{1}{2}\int_0^{1-\frac{1}{2}u} uv-u-2v+2 dvdu = \frac{659}{1536}\sqrt{6}. This is an ugly answer, but it’s certainly an answer.
Example 4 : Surface integral of a vector function
Finally, let’s find the surface integral of the vector field {\mathbf F}=\langle x,y^2,xy \rangle over the helicoid parameterized by \phi(u,v)=\langle u \cos v, u\sin v, v \rangle for 0\leq u \leq 1 and 0 \leq v \leq 2\pi. Following the flowchart, we see that this integral is fairly straightforward. We simply need to find: {\mathbf F(\phi(u,v))}, {\mathbf n}=\phi_u\times \phi_v, and {\mathbf F}(\phi(u,v))\cdot {\mathbf n}. So, we do each of these in turn.
Substituting \phi(u,v) into {\mathbf F} gives u\cos v,u^2\sin^2 v,u^2\cos v\sin v \rangle. Then, taking the cross product of the partials of \phi will give {\mathbf n} = \phi_u\times \phi_v = \langle \sin v, -\cos v, u \rangle. Next, we find the dot product of these two quantities, giving \langle u\cos v,u^2\sin^2 v,u^2\cos v\sin v\rangle\cdot\langle \sin v, -\cos v, u \rangle = u\cos v\sin v - u^2\sin^2 v\cos v+u^3\cos^2 v\sin v. This is a particularly ugly integrand, but we can certainly do it (mostly by using integration-by-parts). In fact, we’ll find that \int_0^1\int_0^{2\pi} u\cos v\sin v - u^2\sin^2v\cos v+u^3\cos^2v\sin v dvdu = 0.
So that’s it – how you do surface and line integrals without any of the tools from chapter 17. Do you have any questions after that? Did I make any mistakes in my math? If so, feel free to comment below (or send me an email) and I’ll do my best to fix things!
|
{
"url": "https://mathematiclysm.wordpress.com/tag/line-integrals/",
"source_domain": "mathematiclysm.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "56591",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LLAF5J7YJUEMPHC2UTMNBDADBLKSMTGE",
"WARC-Concurrent-To": "<urn:uuid:d8cb93e5-bada-4e6e-962a-82dc3b587d29>",
"WARC-Date": "2017-06-27T20:38:30Z",
"WARC-IP-Address": "192.0.78.12",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:GIKQ7C3CDX4F4ZJSO5CPDF6XWFFN3245",
"WARC-Record-ID": "<urn:uuid:f243d452-95cb-4824-9c7e-436aae4bed31>",
"WARC-Target-URI": "https://mathematiclysm.wordpress.com/tag/line-integrals/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f2942962-822d-4325-ac1b-b01ca86d8192>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-166-28-94.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,
37,
38,
65,
66,
626,
627,
697,
698,
982,
2211,
2543,
2544,
2720,
2721,
2803,
2804,
2853,
2854,
3819,
3820,
4235,
4236,
4413,
4414,
4830,
4831,
4850,
4851,
4927,
4928,
4977,
4978,
5613,
5614,
5673,
5674,
6325,
6326,
6353,
6354,
6858,
6859,
6909,
6910,
7465,
7466,
7524,
7525,
8456,
8457,
9010,
9011,
9061,
9062,
9522,
9523,
10171,
10172
],
"line_end_idx": [
37,
38,
65,
66,
626,
627,
697,
698,
982,
2211,
2543,
2544,
2720,
2721,
2803,
2804,
2853,
2854,
3819,
3820,
4235,
4236,
4413,
4414,
4830,
4831,
4850,
4851,
4927,
4928,
4977,
4978,
5613,
5614,
5673,
5674,
6325,
6326,
6353,
6354,
6858,
6859,
6909,
6910,
7465,
7466,
7524,
7525,
8456,
8457,
9010,
9011,
9061,
9062,
9522,
9523,
10171,
10172,
10431
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10431,
"ccnet_original_nlines": 58,
"rps_doc_curly_bracket": 0.021474450826644897,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3439597189426422,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007718119770288467,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3657718002796173,
"rps_doc_frac_unique_words": 0.3092394769191742,
"rps_doc_mean_word_length": 4.746071815490723,
"rps_doc_num_sentences": 106,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.518702507019043,
"rps_doc_word_count": 1591,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06250827759504318,
"rps_doc_frac_chars_dupe_6grams": 0.019600050523877144,
"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.01430273987352848,
"rps_doc_frac_chars_top_3gram": 0.011918949894607067,
"rps_doc_frac_chars_top_4gram": 0.012183819897472858,
"rps_doc_books_importance": -1107.4525146484375,
"rps_doc_books_importance_length_correction": -1107.4525146484375,
"rps_doc_openwebtext_importance": -504.26263427734375,
"rps_doc_openwebtext_importance_length_correction": -504.26263427734375,
"rps_doc_wikipedia_importance": -338.742919921875,
"rps_doc_wikipedia_importance_length_correction": -338.742919921875
},
"fasttext": {
"dclm": 0.41719508171081543,
"english": 0.8108845353126526,
"fineweb_edu_approx": 2.4128072261810303,
"eai_general_math": 0.999525785446167,
"eai_open_web_math": 0.9686554670333862,
"eai_web_code": 0.9557751417160034
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "515.35",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
},
"secondary": {
"code": "515.63",
"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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,559,605,363,834,322,400
|
Posts
Showing posts from September, 2008
My pyweek postmortem. Making a game in a week.
Image
Pyweek, finished recently, and was a real blast... as usual.
Congrats to everyone who took part, pyweek was really fun! I look forward to playing everyones games (I've only got through around ten so far).
'Eye stabs' was our team name.
We didn't post a final entry. Our game isn't really at the stage where we'd like it to be... There's still a number of core features required before it's a 'game'. At the moment, it's kind of a fun intro, and a demo of what the game could be.
For me, recently these competitions have been about experimenting, rather than finishing a game. Getting a buzz off everyone else's energy as they create something in a small amount of time. These competitions are also really good for 'finishing' a game... since they have a finish built in. When the week has ended it's finished.
So we'll make a release some time in the next few weeks. Because we want to show everyone... but not before the basic elements…
pygame.test -- moving testing forward.
We are moving to including the tests with an installed python package... pygame.
>>> import pygame
>>> pygame.test.run()
Why?
Why include tests in pygame? Rather than only with the build process?
More people will run the tests. people can run the tests to see if everything works in their own programs.Can run tests on a persons computer to see if everything in pygame+ your program is working.Which driver/function combination works, or works fastest? Run tests and find out.
Testing a py2exe/pyapp generated binary is much easier. Reuse of our testing enhancements for their own tests. Reporting bugs would be easier. Since everyone could run unittests, since they will be installed everywhere pygame is installed. Result submission of unittests easy. This would result in a much larger base of computers running the unittests and submitting problems. This would be opt in of course. Make the testing stuff more a library, than a framework. Allow people submit unittests more eas…
|
{
"url": "https://renesd.blogspot.com/2008/09/",
"source_domain": "renesd.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "133359",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TLWMKQZGLL6JY5SEYO6OXSIVHDUXONIV",
"WARC-Concurrent-To": "<urn:uuid:a709c914-24f9-445d-869f-d4270ed78f52>",
"WARC-Date": "2019-06-25T03:35:10Z",
"WARC-IP-Address": "172.217.7.225",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SWCV3RFLVLTM4CYQQTGZJQD2PMR3M3SZ",
"WARC-Record-ID": "<urn:uuid:bc400e71-08d3-4a9c-9e6f-44cd584aa20c>",
"WARC-Target-URI": "https://renesd.blogspot.com/2008/09/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f79aa5f9-55ae-4a55-94f4-b437f9022a29>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-155-46-35.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
6,
7,
42,
43,
90,
91,
97,
158,
159,
303,
304,
305,
306,
337,
338,
339,
582,
583,
914,
915,
916,
1044,
1045,
1084,
1085,
1166,
1184,
1206,
1207,
1212,
1282,
1283,
1564
],
"line_end_idx": [
6,
7,
42,
43,
90,
91,
97,
158,
159,
303,
304,
305,
306,
337,
338,
339,
582,
583,
914,
915,
916,
1044,
1045,
1084,
1085,
1166,
1184,
1206,
1207,
1212,
1282,
1283,
1564,
2069
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2069,
"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.4018264710903168,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004566209856420755,
"rps_doc_frac_lines_end_with_ellipsis": 0.05882352963089943,
"rps_doc_frac_no_alph_words": 0.17579908668994904,
"rps_doc_frac_unique_words": 0.5652173757553101,
"rps_doc_mean_word_length": 4.678260803222656,
"rps_doc_num_sentences": 41,
"rps_doc_symbol_to_word_ratio": 0.01598173938691616,
"rps_doc_unigram_entropy": 4.9595723152160645,
"rps_doc_word_count": 345,
"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.012391570024192333,
"rps_doc_frac_chars_top_3gram": 0.01734820008277893,
"rps_doc_frac_chars_top_4gram": 0.02106568031013012,
"rps_doc_books_importance": -201.48683166503906,
"rps_doc_books_importance_length_correction": -201.48683166503906,
"rps_doc_openwebtext_importance": -109.44615936279297,
"rps_doc_openwebtext_importance_length_correction": -109.44615936279297,
"rps_doc_wikipedia_importance": -65.49507904052734,
"rps_doc_wikipedia_importance_length_correction": -65.49507904052734
},
"fasttext": {
"dclm": 0.14946359395980835,
"english": 0.9703689813613892,
"fineweb_edu_approx": 1.482643723487854,
"eai_general_math": 0.22474980354309082,
"eai_open_web_math": 0.10882568359375,
"eai_web_code": 0.13968515396118164
}
}
|
{
"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": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-381,357,117,035,575,700
|
Internet freedom of speech and Irish Neutrality.
While reading this article 5 Reasons Why Online Freedom of Speech Does Not Exist I was encouraged that a person of Arabic decent wrote it. And is spot on about the real lack of freedom on the internet.
And a thought came to mind that what Irelands ‘Smart Economy’ ought to be, is to create a genuine open internet connection to the world. An Internet free of ALL censorship, blocking, filtering and snooping both into and out to the rest of the internet. Even so much as establishing free VPN connections into the country for people living in internet ‘oppressed’ world areas thus giving an open gateway into a free, and (as) open as anyone could make, Internet. It would not prevent countries from blocking export of banned information into Ireland, but Ireland would not add any blockages. And it would not prevent information from Ireland into censored countries. but it would create a cloud of truly free internet.
I think this could foster an internet ‘Switzerland’ much like Switzerland is to banking. Businesses like Google, Linkedin, Facebook, Twitter, Skype would find this an attractive country to expand and centralize in. It would make Ireland an Internet sanctuary for complete and open exchange of ideas and communications.
Google begins to crumble
With all the press at MWC and for that matter, everyplace else, Google is King of the internet. But it’s crumbling. Right in front of everyone, their entire infrastructure is beginning to fail. Not in the obvious way like a server outage or service unavailability. It’s the control structure.
I’ve never been a big user of Google, I only really got a Google Mail account when I started searching for a smartphone, which may have been an Android model. I had heard that this gmail account was needed to be set up in advance to load contacts and what not. But then the office IT manager thought Google Wave was a great way to keep all our remote activities documented, in other words, a tool to herd cats. Then he discovered Google Docs and gee isn’t that a great way to share document creation. Now there’s Google Buzz …. and then … and then. Google just can’t stop, and beyond that, they can’t integrate either. All these systems seem disjointed to the point I can’t even sign on and get to them, they must each be logged on to, no single sign-on. THE single most important step in services, and they can’t seem to make it work. It’s quite apparent that there is no single share point in the login process where all the services can be accessed, in a way, Google is competing against itself. And to quote verse:
‘A house divided, cannot stand’
Google is crumbling.
They have grown so fast and so broad, they have not built out the infrastructure required to support the entire breadth of their development groups. Which from empirical evidence, seems to need some method of communication, not currently visible to the outside world. To quote again;
The right hand does not know what the left hand is doing
Google is stumbling
Watching fall will not be pretty.
Internet Privacy myths
One of the enduring myths of the internet is the one involving privacy. This article on CNN titled U.S. enables Chinese hacking of Google takes umbrage at the notion that everyones email is secret and private. And while this myth might comfort many, the truth is that email was NEVER private. Every email host, every email relay was able, and in fact, completely open to reading, scanning and snooping, by man-in-the-middle processes and furthermore always has been since the beginning of the internet. And even if everyone was using https or ssh with their email clients while connected to their mail server, it did not encrypt the contents of the email. It may have minimized the likelihood of it being read in the data stream, but unless you were in the habit of encrypting your email with PGP or some other cypher your email and hence your ‘Privacy’ is negligible, hence, the privacy myth.
And while on the CNN article the discussions brought up the same old saw that governments HAD to have backdoors to snoop on email communications to prevent crime and terrorism without the concern that at no time has it proved itself in practice. Anyone wishing to sent communication, and have it stay private can do so, even in the face of a dedicated snoop. Anyone who had even browsed an encryption textbook can create a completely uncrackable code, and I mean uncrackable by anyone, by any means and present their messages in plain text in emails. Hacking them by any government is merely security theater and fundamentally has NO value.
If you seek ‘privacy’ stop sending anything through the internet unless it is encrypted by at least PGP (if not something more substantial). The only thing Google has lost in this privacy issue is the trust of their users to protect their email ‘publications’ on the internet. Now everyone will know that they have another recipient to all their emails, in other words, all the other governments, hackers, scammers and spammers in the internet.
Baidu Spider is MIA
Is it me, or my sites, that the www.baidu.com spider is no longer scanning? I have normally been scanned several times a day by that Chinese Search engine, but they all stopped yesterday? Perhaps a crackdown? Who knows, but there is a missing element now in the internet.
Another Reason to Love Nokia and Maemo
It’s not Google and it’s Deadly Power of Data I have always been leery of Power. I don’t buy Microsoft , and I’ve stopped playing into Apple fandom. The last computer I bought was a home-brew DIY Server built from parts I chose, powered by OpenSolaris So now it’s another validation of my still unshipped Nokia N900 and Maemo! Please let Amazon ship it soon 🙂
The first one to Sue, Loses!
Looks like Google has showed their true Android colors as Google has just slapped Cyanogen with a cease-and-desist letter By demonstrating that Android is really NOT Open Source it makes my decision a bit easier. Palm Pre (WebOS), or Nokia N900 (Maemo). Of the two, only Maemo is still considered Open Source, however Palm WebOS has never pretended to be Open Source either. Android always had the feel of Google Lock-in functionality with the real intention to permanently lock the Android platform into Google. And this Cease-and-Desist is the final straw. More here!
Internet to shutdown to help environment.
In this article Revealed: the environmental impact of Google searches the Times On-Line quotes from an energy researcher who has no access to Google energy data to state “A Google search has a definite environmental impact.” Much like posting his article online. Perhaps he should reflect on the old adage Without Reliable Data, I’m Just another A__Ho_e with an Opinion!
Google Rebuttals: Powering a Google Search
Apple Slaps down developers again
Every day I’m more and more impressed with my Palm T/X choice as Apple extends iPhone NDA. Apple is getting genuinely proprietary about their iPhone/iPod app store. They are making a mockery of their own developer community and that won’t last, seeing as there is now the Google G1 Android phone and it’s open source development roots.
UPDATE:
|
{
"url": "http://www.branedy.net/?tag=google",
"source_domain": "www.branedy.net",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "56019",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PABMHJDMMGY7I7XPFX34GQNNX3B2KG2W",
"WARC-Concurrent-To": "<urn:uuid:ca5ad4ac-db5e-4f15-8f5e-8dfc99dd2ace>",
"WARC-Date": "2017-01-21T02:04:18Z",
"WARC-IP-Address": "81.17.241.160",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LCPA65G5OUNMUMRWF27V3AUMTOW2CY3P",
"WARC-Record-ID": "<urn:uuid:1739328c-bc50-4d7e-9c0b-f76086c83943>",
"WARC-Target-URI": "http://www.branedy.net/?tag=google",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6e8c0f67-73f1-4cab-909c-3bcd9d7b4b2f>"
},
"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,
49,
50,
252,
253,
970,
971,
1290,
1291,
1316,
1317,
1610,
1611,
2630,
2631,
2663,
2664,
2685,
2686,
2970,
2971,
3028,
3029,
3049,
3050,
3084,
3085,
3108,
3109,
4003,
4004,
4645,
4646,
5091,
5092,
5112,
5113,
5385,
5386,
5425,
5426,
5786,
5787,
5816,
5817,
6387,
6388,
6430,
6431,
6802,
6803,
6846,
6847,
6881,
6882,
7218,
7219
],
"line_end_idx": [
49,
50,
252,
253,
970,
971,
1290,
1291,
1316,
1317,
1610,
1611,
2630,
2631,
2663,
2664,
2685,
2686,
2970,
2971,
3028,
3029,
3049,
3050,
3084,
3085,
3108,
3109,
4003,
4004,
4645,
4646,
5091,
5092,
5112,
5113,
5385,
5386,
5425,
5426,
5786,
5787,
5816,
5817,
6387,
6388,
6430,
6431,
6802,
6803,
6846,
6847,
6881,
6882,
7218,
7219,
7226
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7226,
"ccnet_original_nlines": 56,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43448275327682495,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02896551974117756,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12896552681922913,
"rps_doc_frac_unique_words": 0.4375,
"rps_doc_mean_word_length": 4.715909004211426,
"rps_doc_num_sentences": 70,
"rps_doc_symbol_to_word_ratio": 0.001379310037009418,
"rps_doc_unigram_entropy": 5.608898639678955,
"rps_doc_word_count": 1232,
"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.01703958958387375,
"rps_doc_frac_chars_top_3gram": 0.008950090035796165,
"rps_doc_frac_chars_top_4gram": 0.005851979833096266,
"rps_doc_books_importance": -513.565673828125,
"rps_doc_books_importance_length_correction": -513.565673828125,
"rps_doc_openwebtext_importance": -310.8523254394531,
"rps_doc_openwebtext_importance_length_correction": -310.8523254394531,
"rps_doc_wikipedia_importance": -254.4607391357422,
"rps_doc_wikipedia_importance_length_correction": -254.4607391357422
},
"fasttext": {
"dclm": 0.024462219327688217,
"english": 0.949783205986023,
"fineweb_edu_approx": 1.9048113822937012,
"eai_general_math": 0.013586999848484993,
"eai_open_web_math": 0.12656480073928833,
"eai_web_code": 0.01621014066040516
}
}
|
{
"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": "303.4833",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social sciences — Dictionaries"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,465,121,876,690,655,000
|
Splits
DSL object for configuring APK Splits options.
See APK Splits.
Properties
PropertyDescription
abi
ABI settings.
abiFilters
The list of ABI filters used for multi-apk.
density
Density settings.
densityFilters
The list of Density filters used for multi-apk.
Methods
No methods
Script blocks
BlockDescription
abi
Configures ABI split settings.
density
Configures density split settings.
Property details
ABI settings.
Set<String> abiFilters
The list of ABI filters used for multi-apk.
null value is allowed, indicating the need to generate an apk with all abis.
Density settings.
Set<String> densityFilters
The list of Density filters used for multi-apk.
null value is allowed, indicating the need to generate an apk with all densities.
Script block details
abi { }
Configures ABI split settings.
Delegates to:
AbiSplitOptions from abi
density { }
Configures density split settings.
Delegates to:
DensitySplitOptions from density
|
{
"url": "https://google.github.io/android-gradle-dsl/1.3/com.android.build.gradle.internal.dsl.Splits.html",
"source_domain": "google.github.io",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "14213",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HVKRI2ZBKJI7MHLXUOY4FR43IP5CBERG",
"WARC-Concurrent-To": "<urn:uuid:13f945ca-9c44-42b6-9b25-8be7bdb509df>",
"WARC-Date": "2023-06-05T16:46:21Z",
"WARC-IP-Address": "185.199.109.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RVABS6YRH6HYGBNHAPDDVYADFIXVGMQR",
"WARC-Record-ID": "<urn:uuid:4892fd1a-ec11-49fb-a750-a1f1c3b28ac8>",
"WARC-Target-URI": "https://google.github.io/android-gradle-dsl/1.3/com.android.build.gradle.internal.dsl.Splits.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8a0d5e5a-4ac1-4bea-b389-61e9b23769c5>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-229\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
7,
8,
55,
56,
72,
73,
84,
85,
105,
109,
110,
124,
125,
136,
137,
181,
182,
190,
191,
209,
210,
225,
226,
274,
275,
283,
284,
295,
296,
310,
311,
328,
332,
333,
364,
365,
373,
374,
409,
410,
427,
428,
442,
443,
466,
467,
511,
512,
589,
590,
608,
609,
636,
637,
685,
686,
768,
769,
790,
791,
799,
800,
831,
832,
846,
871,
872,
884,
885,
920,
921,
935
],
"line_end_idx": [
7,
8,
55,
56,
72,
73,
84,
85,
105,
109,
110,
124,
125,
136,
137,
181,
182,
190,
191,
209,
210,
225,
226,
274,
275,
283,
284,
295,
296,
310,
311,
328,
332,
333,
364,
365,
373,
374,
409,
410,
427,
428,
442,
443,
466,
467,
511,
512,
589,
590,
608,
609,
636,
637,
685,
686,
768,
769,
790,
791,
799,
800,
831,
832,
846,
871,
872,
884,
885,
920,
921,
935,
967
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 967,
"ccnet_original_nlines": 72,
"rps_doc_curly_bracket": 0.00413649994879961,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1964285671710968,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0535714291036129,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.190476194024086,
"rps_doc_frac_unique_words": 0.3769230842590332,
"rps_doc_mean_word_length": 5.9076924324035645,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.63952898979187,
"rps_doc_word_count": 130,
"rps_doc_frac_chars_dupe_10grams": 0.2057291716337204,
"rps_doc_frac_chars_dupe_5grams": 0.5703125,
"rps_doc_frac_chars_dupe_6grams": 0.3984375,
"rps_doc_frac_chars_dupe_7grams": 0.3984375,
"rps_doc_frac_chars_dupe_8grams": 0.3984375,
"rps_doc_frac_chars_dupe_9grams": 0.3984375,
"rps_doc_frac_chars_top_2gram": 0.0364583283662796,
"rps_doc_frac_chars_top_3gram": 0.046875,
"rps_doc_frac_chars_top_4gram": 0.1145833283662796,
"rps_doc_books_importance": -81.119384765625,
"rps_doc_books_importance_length_correction": -81.119384765625,
"rps_doc_openwebtext_importance": -66.45109558105469,
"rps_doc_openwebtext_importance_length_correction": -52.834556579589844,
"rps_doc_wikipedia_importance": -54.69577407836914,
"rps_doc_wikipedia_importance_length_correction": -54.69577407836914
},
"fasttext": {
"dclm": 0.03048098087310791,
"english": 0.7539856433868408,
"fineweb_edu_approx": 1.868764877319336,
"eai_general_math": 0.2751889228820801,
"eai_open_web_math": 0.09978353977203369,
"eai_web_code": 0.9058070182800293
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,523,375,726,474,657,000
|
Контакты
Для связи с нами можно использовать:
irc://irc.chatnet.ru:#gfs
icq://546460
email://cobalt[@]gfs-team.ru
Все материалы предоставлены только с ознакомительной целью
ГлавнаяСтатьиКодингMFC - урок четвертый.
© s0 22.03.2007
Работа с файлами Часть 1 - Разбираем класс
Для работы с файлами в MFC существует класс CFile. Этот класс на много удобнее чем изветные нам функции из stdio и iostream.Чтобы получить возможность использовать этот класс, надо в ваш проэкт вклюить файл afx.h(если вы используете мастер создание проэкта, то этот файл будетавтоматически добавлен к проэкту)
Класс CFile предоставляет нам большой набор функций для работы с файлами, но самыми важными для нас являются функции чтения-записи, и функции позицирования(установки указателя в нужное место в открытом файле)Функции:
CFile::Open - функция служит для открытия файла.
CFile:: Open( LPCTSTR lpszFileName, UINT nOpenFlags, CFileException* pError = NULL ); lpszFileName - строка содержащая путь к файлу.
nOpenFlags - флаги для открытия файла. В основном ипользуются флаги modeRead - открыть для чтения, modeWrite - открыть для записи и modeCreate - создать файл. Флаги можно комбинировать используя символ "|".
CFileException* pError = NULL - указатель на переменную которая будет содержать информацию об ошибке открытия файла. Функция Open возвращает не нулевое значение в случае если открытие прошло успешно. Либо возращает 0 если произошла ошибка - в этом случае переменная pError будет содержать информацию об ошибке.
Пример:
CFile openFile;
CString fName;
fName = "file.txt";
if(!openFile.Open(fName, CFile::modeRead|CFile::modeWrite, NULL))
{
//Тут действия в случае ошибки
}
CFile::Close - служит для закрытия файла. Функция требует аргументов.
CFile::Read - служит для чтения из файла(если файл был открыт с
флагом CFile::modeRead)
CFile::Read(void* lpBuf, UINT nCount);
lpBuf - указатель на переменную для приема данных прочитаных из файла nCount - указывает сколько байт прочитать из файла. Функция возвращает кол-во байт прочитаных из файла(это значение может быть меньше nCount в том случае если достигнут конец файла)
Пример:
extern CFile cfile;
char pbuf[100];
UINT nBytesRead = cfile.Read( pbuf, 100 );
CFile::Write - служит для записи в файл
CFile::Write( const void* lpBuf, UINT nCount );
lpBuf - указатель на переменную содержащию данные для записи в файл nCount - кол-во байт которое будет записанно CFile::GetLength - служит для получения размера открытого файла. Часть 2 - пишем программу
Итак, мы с вами напишем программу которая будет - открывать текстовый файл, и считывать его содержимое в EditBox на форме.
Создаем новый проэкт MFC AppWizard(EXE) - Проделываем все шаги из прошлого урока. Project name - step4 Открое в ресурсах нашу форму и накидаем на нее контролы:
1 кнопка - IDC_OPEN, Open
2 EditBox:
1) IDC_EditOpen
2) IDC_EditText, и на вкладке Style ставим галочку на Multiline, Vertical Scroll и Want Return
Теперь так же, как в предыдущей статье присвоим нашим EditBox"ам переменные с помощью ClassWizard(CTRL+W)
Для IDC_EditOpen - m_EditOpen
Для IDC_EditText - m_EditText
Для IDC_OPEN - m_bOpen
Так же добавим 1 глобальную переменную(как в прошлом уроке)
Type - bool
Name - OpenRead
Public
И в файле step4Dlg.cpp в функции BOOL CStep4Dlg::OnInitDialog() после строчки // TODO: Add extra initialization here Проинициализируем ее OpenRead = false;
Щелкаем два раза на кнопке Open и начинаем писать код.
void CStep4Dlg::OnOpen()
{
// TODO: Add your control notification handler code here
CString fname; //Переменная для хранения имени файла
CFile file; //обьект класса CFile
char ch[1024]; //Буффер для чтения данных из файла
if(!OpenRead) //Если OpenRead=false то показываем диалог открытия файлов
{
CFileDialog fDialog(TRUE);
fDialog.DoModal();
m_EditOpen.SetWindowText(fDialog.GetPathName());
m_bOpen.SetWindowText("Read");
OpenRead = true;
}
else //Иначе
{
m_EditOpen.GetWindowText(fname); //Получаем имя файла
if(!file.Open(fname, CFile::modeRead, NULL)) //Открываем его
{
AfxMessageBox("Cannot open file");
return;
}
file.Read(&ch, 1024); //Читаем 1024 байт
m_EditText.SetWindowText(ch);
file.Close(); //Закрываем файл
m_bOpen.SetWindowText("Open");//Меняем текст кнопки
OpenRead = false;
}
}
Я думаю из коментариев все понятно. Остановлюсь лишь на классе CFileDialog этот класс используется для показа диалогов открыти/закрытия файлов. CFileDialog fDialog(TRUE);
Обьявляем обьект класса. Значение TRUE говорит о том, что мы хотим Диалог открытия Файлов. Если поствить FALSE, то мы увидим Диалог Сохранения Файлов fDialog.DoModal()
Показывает диалог m_EditOpen.SetWindowText(fDialog.GetPathName()); Копируем в наш EditBox полный путь выбраному файлу, с помощью функции GetPathName() Подробние про функцию CFileDialog можно почитать тут
Ну вот и все. До встречи.
© s0 22.03.2007
e-Commerce Partners Network
Ник:
Текст:
P Br B I Qute
Код: обновить
Последние комментарии
29.10.2020 13:30:03 oratrg.se написал:
whoah this weblog is excellent i love studying your posts....
Пишем guestbook
29.10.2020 03:29:41 oreiep.se написал:
It's difficult to find knowledgeable people about this subject, but...
Пишем guestbook
29.10.2020 00:28:51 aperca.se написал:
Do you mind if I quote a few of your...
Пишем guestbook
Реклама
Тут должна была быть ваша реклама, но мы потеряли глиняную табличку с ее текстом. SapeId: 665044
Rambler's Top100
|
{
"url": "http://www.gfs-team.ru/articles/read/101",
"source_domain": "www.gfs-team.ru",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "25726",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F2QUND5NA63I5UQHQZXARGYQ5UHMEXMB",
"WARC-Concurrent-To": "<urn:uuid:f5286c8c-f0ed-417b-a92a-b37c997d1fa5>",
"WARC-Date": "2020-10-30T01:29:45Z",
"WARC-IP-Address": "80.87.201.47",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:AIN66DU3I6VBF6QUDFN5N4E2IRWGNHT2",
"WARC-Record-ID": "<urn:uuid:f8448939-b05b-4aab-84d8-6f08ec033e0d>",
"WARC-Target-URI": "http://www.gfs-team.ru/articles/read/101",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:73a29d77-6eb4-439f-a652-3866a13dea5e>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-127.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,
9,
10,
47,
73,
86,
115,
116,
175,
216,
232,
233,
276,
277,
587,
588,
805,
806,
855,
988,
1195,
1506,
1507,
1515,
1516,
1532,
1547,
1567,
1633,
1635,
1674,
1676,
1677,
1747,
1811,
1835,
1875,
2127,
2128,
2136,
2137,
2138,
2158,
2174,
2217,
2218,
2258,
2306,
2510,
2511,
2634,
2635,
2795,
2796,
2822,
2833,
2849,
2944,
2945,
3051,
3052,
3082,
3112,
3135,
3136,
3196,
3197,
3209,
3225,
3232,
3233,
3389,
3390,
3445,
3446,
3471,
3473,
3538,
3599,
3644,
3703,
3784,
3794,
3837,
3872,
3937,
3984,
4017,
4027,
4048,
4058,
4128,
4205,
4223,
4282,
4314,
4332,
4389,
4435,
4482,
4550,
4584,
4594,
4596,
4597,
4768,
4769,
4937,
4938,
5142,
5143,
5169,
5170,
5171,
5172,
5173,
5189,
5190,
5218,
5223,
5224,
5231,
5245,
5246,
5247,
5248,
5262,
5284,
5323,
5385,
5401,
5440,
5511,
5527,
5566,
5606,
5622,
5630,
5631,
5728,
5729
],
"line_end_idx": [
9,
10,
47,
73,
86,
115,
116,
175,
216,
232,
233,
276,
277,
587,
588,
805,
806,
855,
988,
1195,
1506,
1507,
1515,
1516,
1532,
1547,
1567,
1633,
1635,
1674,
1676,
1677,
1747,
1811,
1835,
1875,
2127,
2128,
2136,
2137,
2138,
2158,
2174,
2217,
2218,
2258,
2306,
2510,
2511,
2634,
2635,
2795,
2796,
2822,
2833,
2849,
2944,
2945,
3051,
3052,
3082,
3112,
3135,
3136,
3196,
3197,
3209,
3225,
3232,
3233,
3389,
3390,
3445,
3446,
3471,
3473,
3538,
3599,
3644,
3703,
3784,
3794,
3837,
3872,
3937,
3984,
4017,
4027,
4048,
4058,
4128,
4205,
4223,
4282,
4314,
4332,
4389,
4435,
4482,
4550,
4584,
4594,
4596,
4597,
4768,
4769,
4937,
4938,
5142,
5143,
5169,
5170,
5171,
5172,
5173,
5189,
5190,
5218,
5223,
5224,
5231,
5245,
5246,
5247,
5248,
5262,
5284,
5323,
5385,
5401,
5440,
5511,
5527,
5566,
5606,
5622,
5630,
5631,
5728,
5729,
5745
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5745,
"ccnet_original_nlines": 140,
"rps_doc_curly_bracket": 0.0017406400293111801,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.024667929857969284,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028463000431656837,
"rps_doc_frac_lines_end_with_ellipsis": 0.021276600658893585,
"rps_doc_frac_no_alph_words": 0.7390891909599304,
"rps_doc_frac_unique_words": 0.5982404947280884,
"rps_doc_mean_word_length": 6.27419376373291,
"rps_doc_num_sentences": 66,
"rps_doc_symbol_to_word_ratio": 0.003795070108026266,
"rps_doc_unigram_entropy": 5.706389904022217,
"rps_doc_word_count": 682,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.034120120108127594,
"rps_doc_frac_chars_dupe_6grams": 0.019163360819220543,
"rps_doc_frac_chars_dupe_7grams": 0.019163360819220543,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01051647961139679,
"rps_doc_frac_chars_top_3gram": 0.014723069965839386,
"rps_doc_frac_chars_top_4gram": 0.008413179777562618,
"rps_doc_books_importance": -348.7703552246094,
"rps_doc_books_importance_length_correction": -348.7703552246094,
"rps_doc_openwebtext_importance": -206.56689453125,
"rps_doc_openwebtext_importance_length_correction": -206.56689453125,
"rps_doc_wikipedia_importance": -122.85839080810547,
"rps_doc_wikipedia_importance_length_correction": -122.85839080810547
},
"fasttext": {
"dclm": 0.5411780476570129,
"english": 0.0003380000125616789,
"fineweb_edu_approx": 2.5403661727905273,
"eai_general_math": -0.000003580000111469417,
"eai_open_web_math": 0.14758914709091187,
"eai_web_code": 0.7342642545700073
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "6",
"label": "Indeterminate"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-990,236,500,623,108,400
|
Shyam Walked 6 metres facing towards East, then took a right turn and walked a distance of 9 metres.He then took a left turn and walked a distance of a metres. How far is he from the starting point?
A) 15 metres
B) 21 metres
C) 18 metres
D) Cannot be determined
View Answer
Option – A.
More Questions
error: Content is protected !!
|
{
"url": "https://mcq.jobsandhan.com/shyam-walked-6-metres-facing-towards-east-then-took-a-right-turn-and-walked-a-distance-of-9-metres-he-then-took-a-left-turn-and-walked-a-distance-of-a-metres-how-far-is-he-from-the-starting-point/",
"source_domain": "mcq.jobsandhan.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "138779",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NU47FJOVW7EQI5Y67JY3LHPERJEGYO3H",
"WARC-Concurrent-To": "<urn:uuid:2e06eb5c-e5e2-4cb4-bf12-9b17c24afd46>",
"WARC-Date": "2022-11-28T04:00:03Z",
"WARC-IP-Address": "104.21.54.161",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZTT3O74I7MZQJTJI7YPELZU45CDATTLL",
"WARC-Record-ID": "<urn:uuid:ac9faf44-5cbf-4bf8-9c67-f20b60097b17>",
"WARC-Target-URI": "https://mcq.jobsandhan.com/shyam-walked-6-metres-facing-towards-east-then-took-a-right-turn-and-walked-a-distance-of-9-metres-he-then-took-a-left-turn-and-walked-a-distance-of-a-metres-how-far-is-he-from-the-starting-point/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5acecfe9-f517-40c7-9f17-7f4e6817dffc>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-199\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,
199,
200,
213,
214,
227,
228,
241,
242,
266,
267,
279,
291,
292,
307,
308
],
"line_end_idx": [
199,
200,
213,
214,
227,
228,
241,
242,
266,
267,
279,
291,
292,
307,
308,
338
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 338,
"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.2933333218097687,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06666667014360428,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2266666740179062,
"rps_doc_frac_unique_words": 0.6984127163887024,
"rps_doc_mean_word_length": 4.063492298126221,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.592841625213623,
"rps_doc_word_count": 63,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1875,
"rps_doc_frac_chars_dupe_6grams": 0.1875,
"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.0625,
"rps_doc_frac_chars_top_3gram": 0.0703125,
"rps_doc_frac_chars_top_4gram": 0.109375,
"rps_doc_books_importance": -33.21376419067383,
"rps_doc_books_importance_length_correction": -33.21376419067383,
"rps_doc_openwebtext_importance": -14.944875717163086,
"rps_doc_openwebtext_importance_length_correction": -14.944875717163086,
"rps_doc_wikipedia_importance": -12.462158203125,
"rps_doc_wikipedia_importance_length_correction": -12.462158203125
},
"fasttext": {
"dclm": 0.17178887128829956,
"english": 0.9491097331047058,
"fineweb_edu_approx": 1.513957142829895,
"eai_general_math": 0.7083340883255005,
"eai_open_web_math": 0.9000097513198853,
"eai_web_code": -0.000007390000064333435
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
},
"secondary": {
"code": "372.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Elementary and Kindergarten"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-566,777,668,333,745,660
|
Not logged in. Login/Logout/Register | List snippets | | Create snippet | Upload image | Upload data
1861
LINES
< > TinyBrain | #759 - "Super-Edgy" JavaX Translator (Extension of #7)
JavaX translator [tags: use-pretranspiled]
Libraryless. Click here for Pure Java version (13758L/97K/291K).
!1006722
static bool autoQuine = true;
static int maxQuineLength = 80;
static L<S> functionsToAlwaysInclude = ll("_registerThread", "asRuntimeException");
!include #1001496 // Matches
!include #1000882 // EGDiff
!include #1000883 // BlockDiffer
!include #1001065 // DialoGIO
!include #1004045 // IndexedList2
//include #1001296 // MultiMap
!include #1000988 // MultiSet
!include #1004543 // DynamicObject
!include #1005575 // CompilerBot
!include #1002662 // isTrue
static int varCount;
static new Map<S, S> snippetCache;
static bool useIndexedList = true, opt_javaTok = true;
static bool cacheStdFunctions = true, cacheStdClasses = true;
static new HashMap<Long, CachedInclude> cachedIncludes;
static new HashSet<Long> included;
static new HashSet<S> definitions;
static new HashSet<S> shouldNotIncludeFunction, shouldNotIncludeClass;
sclass CachedInclude {
S javax, java;
}
p {
pcall { vmKeepWithProgramMD5_get('cachedIncludes); }
//reTok_modify_check = true;
if (useIndexedList) findCodeTokens_debug = true;
javaTok_opt = opt_javaTok;
findCodeTokens_indexed = findCodeTokens_unindexed = 0;
findCodeTokens_bails = findCodeTokens_nonbails = 0;
javaTok_n = javaTok_elements = 0;
S in = loadMainJava();
print("759 STARTING " + identityHashCode(main.class));
included.clear();
shouldNotIncludeFunction.clear();
shouldNotIncludeClass.clear();
varCount = 0;
//L ts = findTranslators(toLines(join(tok)));
//print("Translators in source at start: " + structure(ts));
// "duplicate" statement - unused
/*L<S> lines = toLines(in);
call(getJavaX(), "findTranslators", lines);
in = fromLines(lines);
new Matches m;
if (match("duplicate *", in, m)) {
// actual copying - unused
// tok = jtok(loadSnippet(m.get(0)));
// reference by include()
in = "m { p { callMain(include(" + quote(m.get(0)) + ")); } }";
}*/
L<S> tok = jtok(in);
// add m { }
if (!hasCodeTokens(tok, "m", "{") && !hasCodeTokens(tok, "main", "{") && !hasCodeTokens(tok, "class", "main")) {
//tok = jtok(moveImportsUp("m {\n" + in + "\n}"));
replaceTokens_reTok(tok, 1, 2, "m {\n" + tok.get(1));
replaceTokens_reTok(tok, l(tok)-2, l(tok)-1, tok.get(l(tok)-2) + "}");
tok_moveImportsUp(tok);
}
// standard translate
//ts = findTranslators(toLines(join(tok)));
//print("Translators in source: " + structure(ts));
tok = jtok(defaultTranslate(join(tok)));
//print("end of default translate");
//print(join(tok));
//tok_autoCloseBrackets(tok);
tok = tok_processIncludes(tok); // before standard functions
processConceptsDot(tok);
tok = tok_processIncludes(tok);
tok = localStuff1(tok);
int safety = 0;
boolean same;
do {
S before = join(tok);
//tok = localStuff1(tok);
// shortened method declarations BEFORE standardFunctions
jreplace(tok, "svoid", "static void");
jreplace(tok, "void <id> {", "$1 $2() {");
jreplace(tok, "String <id> {", "$1 $2() {");
jreplace(tok, "Object <id> {", "$1 $2() {");
jreplace(tok, "List <id> {", "$1 $2() {");
tok_definitions(tok);
tok_ifndef(tok);
tok_ifdef(tok);
tok = standardFunctions(tok);
tok = stdstuff(tok); // standard functions and all the keywords
S diff;
long startTime = now();
//diff = unidiff(before, join(tok));
//print("unidiff: " + (now()-startTime) + " ms");
//same = eq(diff, "");
same = tok_sameTest(tok, before);
if (!same) {
print("Not same " + safety + ".");
//print(indent(2, diff));
}
if (safety++ >= 10) {
//print(unidiff(before, join(tok)));
print("----");
print(join(tok));
print("----");
fail("safety 10 error!");
}
} while (!same);
print("Post.");
tok = indexedList2(tok);
// POST-PROCESSING after stdstuff loop
// Type<A> to Type<A, A>
for (S clazz : ll("Pair", "Either", "Map", "HashMap", "TreeMap", "LinkedHashMap")) {
print(clazz);
jreplace(tok, clazz + "< <id> >", clazz + "<$3, $3>");
jreplace(tok, clazz + "< <id><<id>> >", clazz + "<$3<$5>, $3<$5>>");
jreplace(tok, clazz + "< <id><<id>,<id>> >", clazz + "<$3<$5,$7>, $3<$5,$7>>");
}
//print('quicknew2); quicknew2(tok);
//tok = jtok(quicknew(join(tok)));
print('extendClasses); tok = extendClasses(tok);
print('libs); libs(tok);
print('sourceCodeLine); sourceCodeLine(tok);
print('throwFail); throwFail(tok);
print('innerClassesVar); innerClassesVar(tok);
print('ifclass); tok_ifclass(tok);
// Stuff that depends on the list of inner classes (haveClasses)
HashSet<S> haveClasses = haveClasses(tok);
expandClassReferences(tok, haveClasses);
slashCasts(tok, haveClasses);
newWithoutNew(tok, haveClasses);
print('autoImports); tok = autoImports(tok); // faster to do it at the end
/*if (useIndexedList)
print("Indexed/unindexed lookups: " + findCodeTokens_indexed + "/" + findCodeTokens_unindexed + ", lists made: " + IndexedList2.instances);
print("findCodeToken bails: " + findCodeTokens_bails + "/" + findCodeTokens_nonbails);
print("javaToks: " + javaTok_n + "/" + javaTok_elements);*/
print("Saving.");
if (tok.contains("package"))
splitJavaFiles(tok);
else
saveMainJava(tok);
}
static L<S> localStuff1(L<S> tok) {
int safety = 0, i;
boolean same;
tok = indexedList2(tok);
do {
S before = join(tok);
earlyStuff(tok);
tok = multilineStrings(tok);
tok_singleQuoteIdentifiersToStringConstants(tok);
inStringEvals(tok);
listComprehensions(tok);
doubleFor_simple(tok);
forPing(tok);
directSnippetRefs(tok);
quicknu(tok);
//tok_juxtaposeCalls(tok);
expandVarCopies(tok);
jreplace(tok, "do ping {", "do { ping();");
replaceKeywordBlock(tok,
"swing",
"{ swing(r {",
"}); }");
jreplace(tok, "synced <id>", "synchronized $2");
replaceKeywordBlock(tok, "answer",
"static S answer(S s) {\nfinal new Matches m;\n",
"\nret null;\n}");
replaceKeywordBlock(tok, "static-pcall",
"static { pcall {",
"}}");
replaceKeywordBlock(tok, "loading",
"{ JWindow _loading_window = showLoadingAnimation(); try {",
"} finally { disposeWindow(_loading_window); }}");
replaceKeywordPlusQuotedBlock(tok, "loading",
func(L<S> tok, int i) {
S text = tok.get(i+2);
ret new S[] {
"{ JWindow _loading_window = showLoadingAnimation(" + text + "); try {",
"} finally { disposeWindow(_loading_window); }}" };
});
replaceKeywordBlock(tok, "html",
"static O html(S uri, fMap<S, S> params) ctex " + "{\n", "}");
// "static sync" => static synchronized
jreplace(tok, "static sync", "static synchronized");
// "sclass" => static class
jreplace(tok, "sclass", "static class");
// "asclass" => abstract static class
jreplace(tok, "asclass", "abstract static class");
// "sinterface" => static interface
jreplace(tok, "sinterface", "static interface");
// "ssynchronized" => static synchronized
jreplace(tok, "ssynchronized", "static synchronized");
jreplace(tok, "ssvoid", "static synchronized void");
jreplace(tok, "sbool", "static bool");
jreplace(tok, "sint", "static int");
jreplace(tok, "snew", "static new");
jreplace(tok, "sv <id>", "static void $2");
jreplace(tok, "pvoid", "public void");
// "sS" => static S
jreplace(tok, "sS", "static S");
// "sO" => static O
jreplace(tok, "sO", "static O");
// "sL" => static L
jreplace(tok, "sL", "static L");
// "toString {" => "public S toString() {"
jreplace(tok, "toString {", "public S toString() {");
jreplace(tok, "Int", "Integer");
jreplace(tok, "Bool", "Boolean");
jreplace(tok, "BigInt", "BigInteger");
jreplace(tok, "Char", "Character");
// I REALLY wanted to avoid this, but eh...
jreplace(tok, "SS", "Map<S, S>");
// "on fail {" => "catch (Throwable _e) { ... rethrow(_e); }"
replaceKeywordBlock(tok, "on fail",
"catch (Throwable _e) {",
"\nthrow rethrow(_e); }");
// "catch {" => "catch (Throwable _e) {"
jreplace(tok, "catch {", "catch (Throwable _e) {");
// "catch X e {" => "catch (X e) {"
jreplace(tok, "catch <id> <id> {", "catch ($2 $3) {");
// "catch e {" => "catch (Throwable e) {" (if e is lowercase)
jreplace(tok, "catch <id> {", "catch (Throwable $2) {", new O() {
bool get(L<S> tok, int i) {
S word = tok.get(i+3);
ret startsWithLowerCaseOrUnderscore(word);
}
});
jreplace(tok, "+ +", "+", new O() {
bool get(L<S> tok, int i) {
//printStructure("++: ", subList(tok, i-1, i+6));
if (empty(_get(tok, i+2))) ret false; // no space between the pluses
if (empty(_get(tok, i)) && eq("+", _get(tok, i-1))) ret false; // an actual "++" at the left
if (empty(_get(tok, i+4)) && eq("+", _get(tok, i+5))) ret false; // an actual "++" at the right
//print("doing it");
ret true;
}
});
// some crazy fancy syntax
jreplace(tok, "set <id>;", "$2 = true;");
// [stdEq] -> implementation of equals() and hashCode()
jreplace(tok, "[stdEq]",
"public bool equals(O o) { ret stdEq2(this, o); }\n" +
"public int hashCode() { ret stdHash2(this); }");
// [concepts] "concept.field!" for dereferencing references
jreplace(tok, "<id>!", "$1.get()", func(L<S> tok, int i) {
if (tok.get(i+2).contains("\n")) false; // no line break between <id> and !
if (nempty(tok.get(i+4))) true; // space after = ok
S t = _get(tok, i+5);
if (t == null) ret false;
if (isIdentifier(t) || eqOneOf(t, "=", "(")) false;
true;
});
// [concepts] "field := value" for defining fields e.g. in "uniq"
while ((i = jfind(tok, "<id> :=")) >= 0) {
tok.set(i, quote(tok.get(i)));
tok.set(i+2, ",");
tok.set(i+4, "");
reTok(tok, i, i+5);
}
// "quoted" := value
while ((i = jfind(tok, "<quoted> :=")) >= 0) {
tok.set(i, tok.get(i));
tok.set(i+2, ",");
tok.set(i+4, "");
reTok(tok, i, i+5);
}
// more shortening
jreplace(tok, "fS", "final S");
jreplace(tok, "fO", "final O");
jreplace(tok, "fL", "final L");
jreplace(tok, "fMap", "final Map");
jreplace(tok, "fRunnable", "final Runnable");
jreplace(tok, "f int", "final int");
// "continue unless"
while ((i = jfind(tok, "continue unless")) >= 0) {
int j = scanOverExpression(tok, getBracketMap(tok), i+4, ";");
replaceTokens(tok, i, i+4, "{ if (!(");
tok.set(j, ")) continue; }");
reTok(tok, i, j+1);
}
// "continue if"
while ((i = jfind(tok, "continue if")) >= 0) {
int j = scanOverExpression(tok, getBracketMap(tok), i+4, ";");
replaceTokens(tok, i, i+4, "{ if (");
tok.set(j, ") continue; }");
reTok(tok, i, j+1);
}
// "return if"
while ((i = jfind(tok, "return if")) >= 0) {
int j = scanOverExpression(tok, getBracketMap(tok), i+4, ";");
replaceTokens(tok, i, i+4, "{ if (");
tok.set(j, ") return; }");
reTok(tok, i, j+1);
}
// while not null ()
while ((i = jfind(tok, "while not null (")) >= 0) {
int closingBracket = findEndOfBracketPart(tok, i+6)-1;
replaceTokens(tok, i+2, i+6, "(");
tok.set(closingBracket, ") != null)");
reTok(tok, i, closingBracket+1);
}
// Replace $1 with m.unq(0) etc. - caveat: this blocks identifiers $1, $2, ...
for (i = 1; i < l(tok); i += 2) {
S s = tok.get(i);
if (s.startsWith("$")) {
s = substring(s, 1);
if (isInteger(s)) {
tok.set(i, "m.unq(" + (parseInt(s)-1) + ")");
reTok(tok, i);
}
}
}
// instanceof trickery
jreplace(tok, "is a <id>", "instanceof $3");
jreplace(tok, "!<id> instanceof <id>.<id>", "!($2 instanceof $4.$6)");
jreplace(tok, "!<id> instanceof <id>", "!($2 instanceof $4)");
jreplace(tok, "<id> !instanceof <id>", "!($1 instanceof $4)");
// map funcname(...) => map(f funcname, ...)
jreplace(tok, "map <id>(", "map(f $2,");
// func keyword for lambdas - now automatically quines toString() if enabled
while ((i = jfind(tok, "func(")) >= 0) {
int argsFrom = i+4, argsTo = findCodeTokens(tok, i, false, ")");
int idx = findCodeTokens(tok, argsTo, false, "{");
int j = findEndOfBracketPart(tok, idx);
L<S> contents = subList(tok, idx+1, j-1);
S returnType = null;
if (eq(tok.get(argsTo+2), "-") && eq(tok.get(argsTo+4), ">"))
returnType = join(subList(tok, argsTo+6, idx-1));
S toString = autoQuine ? " public S toString() { ret " + quote(shorten(maxQuineLength, trim(join(contents)))) + "; }" : "";
// TODO: infer argument types
/* if (nempty(returnType))
replaceTokens(tok, i, j, "new F1<?, " + returnType + ">{ " + returnType + " get(" + join(subList(tok, argsFrom, argsTo-1)) + ") ctex { " + tok_addReturn(contents) + " }\n" +*/
replaceTokens(tok, i, j, "new O { O get(" + join(subList(tok, argsFrom, argsTo-1)) + ") ctex { " + tok_addReturn(contents) + " }\n" +
+ toString + "}");
reTok(tok, i, j);
}
while ((i = jfind(tok, "voidfunc(")) >= 0) {
int argsFrom = i+4, argsTo = findCodeTokens(tok, i, false, ")");
int idx = findCodeTokens(tok, argsTo, false, "{");
int j = findEndOfBracketPart(tok, idx);
L<S> contents = subList(tok, idx+1, j-1);
replaceTokens(tok, i, j, "new O { void get(" + join(subList(tok, argsFrom, argsTo-1)) + ") ct" + "ex { " + tok_addSemicolon(contents) + " }\n" +
(autoQuine ? " public S toString() { ret " + quote(shorten(maxQuineLength, trim(join(contents)))) + "; }" : "") + "}");
reTok(tok, i, j);
}
for (S keyword : ll("f", "func")) {
while ((i = jfind(tok, keyword + " {")) >= 0) {
int idx = findCodeTokens(tok, i, false, "{");
int j = findEndOfBracketPart(tok, idx+2); // XXX - not idx???
L<S> contents = subList(tok, idx+1, j-1);
replaceTokens(tok, i, j, "new O { O get() ct" + "ex { " + tok_addReturn(contents) + " }\n" +
(autoQuine ? " public S toString() { ret " + quote(shorten(maxQuineLength, trim(join(contents)))) + "; }" : "") + "}");
reTok(tok, i, j);
}
while ((i = jfind(tok, keyword + " ->")) >= 0) {
// I think there is a bug here for something like func -> x { new x { } }
int idx = findCodeTokens(tok, i, false, "{");
int j = findEndOfBracketPart(tok, idx);
S returnType = join(subList(tok, i+6, idx-1));
L<S> contents = subList(tok, idx+1, j-1);
replaceTokens(tok, i, j, "new F0<" + returnType + ">() { " + returnType + " get() ctex { " + tok_addReturn(contents) + " }\n" +
(autoQuine ? " public S toString() { ret " + quote(shorten(maxQuineLength, trim(join(contents)))) + "; }" : "") + "}");
reTok(tok, i, j);
}
}
// "ref -> bla" for dereferencing Concept.Ref or ThreadLocal or other
//jreplace(tok, "<id> ->", "$1.get().");
jreplace(tok, "->", ".get().", func(L<S> tok, int i) {
empty(tok.get(i+2))
&& !(empty(_get(tok, i)) && eq(_get(tok, i-1), "-")) // i-->0
});
// shortened subconcept declaration (before star constructors!)
shortenedSubconcepts(tok);
// "case" as a variable name ( => _case)
caseAsVariableName(tok);
// "do" as a function name ( => dO)
tok_doAsMethodName(tok);
// "continue" as a function name ( => _continue)
continueAsFunctionName(tok);
// Do this BEFORE awt replacement! ("p-awt" contains "awt" token)
if (hasCodeTokens(tok, "p", "-")) {
jreplace(tok, "p-pretty {", "p-noconsole {");
replaceKeywordBlock(tok, "p-awt-noconsole", "p-awt {", "\nhideConsole(); }");
replaceKeywordBlock(tok, "p-substance-noconsole", "p-substance {", "\nhideConsole(); }");
replaceKeywordBlock(tok, "p-nimbus-noconsole", "p-nimbus {", "\nhideConsole(); }");
replaceKeywordBlock(tok, "p-subst-noconsole", "p-subst {", "\nhideConsole(); }");
replaceKeywordBlock(tok, "p-noconsole", "p-subst {", "\nhideConsole(); }");
replaceKeywordBlock(tok, "p-subst", "p-substance-thread {", "}");
replaceKeywordBlock(tok, "p-substance-thread", "p { substance();", "}");
replaceKeywordBlock(tok, "p-magellan-thread", "p { magellan();", "}");
replaceKeywordBlock(tok, "p-substance", "p-awt { substance();", "}");
replaceKeywordBlock(tok, "p-nimbus", "p-awt { nimbus();", "}");
jreplace(tok, "p-type {", "p-typewriter {");
jreplace(tok, "p-tt {", "p-typewriter {");
replaceKeywordBlock(tok, "p-awt", "p { swing {", "}}");
replaceKeywordBlock(tok, "p-typewriter", "p { typeWriterConsole();", "}");
replaceKeywordBlock(tok, "p-lowprio", "p { lowPriorityThread(r " + "{", "}); }");
tok_p_repeatWithSleep(tok);
}
replaceKeywordBlock(tok,
"awt",
"swingLater(r {",
"});");
unswing(tok);
lockBlocks(tok);
// crazy stuff
jreplace (tok, "for <id> over <id>:", "for (int $2 = 0; $2 < l($4); $2++)");
jreplace (tok, "for <id>, <id> <id> over <id>: {", "for (int $2 = 0; $2 < l($7); $2++) { $4 $5 = $7.get($2);");
jreplace (tok, "for <id> to <id>:", "for (int $2 = 0; $2 < $4; $2++)");
jreplace (tok, "for <id> to <int>:", "for (int $2 = 0; $2 < $4; $2++)");
tok = expandShortTypes(tok);
if (containsToken(tok, "cast")) {
// TODO: use tokens
S s = join(tok);
s = s.replaceAll("(\\w+<[\\w\\s,\\[\\]]+>|\\w+|\\w+\\[\\]|\\w+\\[\\]\\[\\])\\s+(\\w+)\\s*=\\s*cast(\\W[^;]*);", "$1 $2 = ($1) ($3);");
tok = jtok(s);
}
replaceKeywordBlock(tok, "r-thread", "runnableThread(r " + "{", "})");
rNamedThread(tok);
// runnable and r - now also with automatic toString if enabled
for (S keyword : ll("runnable", "r"))
while ((i = jfind(tok, keyword + " {")) >= 0) {
int idx = findCodeTokens(tok, i, false, "{");
int j = findEndOfBracketPart(tok, idx);
L<S> contents = subList(tok, idx+1, j-1);
//print("r contents: " + structure(contents));
replaceTokens(tok, i, j+1, "new Runnable() { public void run() { try { " + tok_addSemicolon(contents) +
"\n} catch (Exception __e) { throw rethrow(__e); } }" +
(autoQuine ? " public S toString() { return " + quote(shorten(maxQuineLength, trim(join(contents)))) + "; }" : "") +
"}");
reTok(tok, i, j+1);
}
replaceKeywordBlock(tok,
"expectException",
"{ bool __ok = false; try {",
"} catch { __ok = true; } assertTrue(\"expected exception\", __ok); }");
while ((i = tok.indexOf("tex")) >= 0) {
tok.set(i, "throws Exception");
tok = jtok(tok);
}
// shorter & smarter whiles
jreplace(tok, "while true", "while (true)");
jreplace(tok, "while licensed", "while (licensed())");
jreplace(tok, "repeat {", "while (licensed()) {");
tok_repeatWithSleep(tok);
// null; => return null; etc.
O cond = func(L<S> tok, int i) {
tok_tokenBeforeLonelyReturnValue(_get(tok, i-1))
};
jreplace(tok, "null;", "return null;", cond);
jreplace(tok, "false;", "return false;", cond);
jreplace(tok, "true;", "return true;", cond);
jreplace(tok, "this;", "return this;", cond);
// "myFunction;" instead of "myFunction();" - quite rough
cond = new O() {
bool get(L<S> tok, int i) {
S word = tok.get(i+3);
//print("single word: " + word);
ret !litlist("break", "continue", "return", "else").contains(word);
}
};
for (S pre : litlist("}", ";"))
jreplace(tok, pre + " <id>;", "$1 $2();", cond);
// shorter match syntax for answer methods
jreplace(tok, "if <quoted> || <quoted>",
"if (matchOneOf(s, m, $2, $5))");
// "bla..."
jreplace(tok, "if <quoted>", "if (matchStartX($2, s, m))",
new O() { bool get(L<S> tok, int i) {
ret unquote(tok.get(i+3)).endsWith("...");
}});
// "bla * bla | blubb * blubb"
jreplace_dyn(tok, "if <quoted>", func(L<S> tok, int cIdx) {
S s = unquote(tok.get(cIdx+2));
//print("multimatch: " + quote(s));
new L<S> l;
for (S pat : splitAtJavaToken(s, "|")) {
//print("multimatch part: " + quote(pat));
if (javaTok(pat).contains("*"))
l.add("match(" + quote(trim(pat)) + ", s, m)");
else
l.add("match(" + quote(trim(pat)) + ", s)");
}
ret "if (" + join(" || ", l) + ")";
}, func(L<S> tok, int i) {
javaTokC(unquote(tok.get(i+3))).contains("|")
});
// "bla"
jreplace(tok, "if <quoted>", "if (match($2, s))",
new O() { bool get(L<S> tok, int i) {
ret !javaTokC(unquote(tok.get(i+3))).contains("*");
}});
// "bla * bla"
jreplace(tok, "if <quoted>", "if (match($2, s, m))");
jreplace(tok, "if match <quoted>", "if (match($3, s, m))");
// extra commas ("litlist(1, 2,)")
jreplace(tok, ",)", ")");
// additional translations (if necessary)
replaceKeywordBlock(tok,
"pcall",
"try {",
"} catch (Throwable __e) { printStackTrace2(__e); }");
replaceKeywordBlock(tok,
"pcall-short",
"try {",
"} catch (Throwable __e) { print(exceptionToStringShort(__e)); }");
replaceKeywordBlock(tok,
"pcall-silent",
"try {",
"} catch (Throwable __e) { silentException(__e); }");
replaceKeywordBlock(tok,
"pcall-messagebox",
"try {",
"} catch __e { messageBox(__e); }");
replaceKeywordBlock(tok,
"pcall-infobox",
"try {",
"} catch __e { infoBox(__e); }");
tok = dialogHandler(tok);
replaceKeywordBlock(tok, "exceptionToUser",
"try {",
"} catch (Throwable __e) { ret exceptionToUser(__e); }");
if (hasCodeTokens(tok, "twice", "{"))
replaceKeywordBlock(tok, "twice",
"for (int __twice = 0; __twice < 2; __twice++) {",
"}");
while ((i = findCodeTokens(tok, "repeat", "*", "{")) >= 0) {
S v = makeVar("repeat");
tok.set(i, "for (int " + v + " = 0; " + v + " < " + tok.get(i+2) + "; " + v + "++)");
tok.set(i+2, "");
tok = jtok(tok);
}
replaceKeywordBlockDyn(tok,
"time",
new O() { S[] get() {
S var = makeVar("startTime");
ret new S[] {
"{ long " + var + " = sysNow(); try { ",
"} finally { " + var + " = sysNow()-" + var + "; saveTiming(" + var + "); } }"};
}});
// version without { }
replaceKeywordBlockDyn(tok,
"time2",
new O() { S[] get() {
S var = makeVar("startTime");
ret new S[] {
"long " + var + " = sysNow(); ",
" " + var + " = sysNow()-" + var + "; saveTiming(" + var + "); "};
}});
// time "bla" {
replaceKeywordPlusQuotedBlock(tok,
"time",
func(L<S> tok, int i) {
S var = makeVar("startTime");
ret new S[] {
"long " + var + " = sysNow(); ",
" done2(" + tok.get(i+2) + ", " + var + "); "};
});
if (hasCodeTokens(tok, "assertFail", "{")) {
S var = makeVar("oops");
replaceKeywordBlock(tok,
"assertFail",
"boolean " + var + " = false; try {",
"\n" + var + " = true; } catch (Exception e) { /* ok */ } assertFalse(" + var + ");");
}
replaceKeywordBlock(tok,
"yo",
"try {",
"} catch (Exception " + makeVar("e") + ") { ret false; }");
replaceKeywordBlock(tok,
"awtIfNecessary",
"swingNowOrLater(r " + "{",
"});");
ctex(tok);
replaceKeywordBlock(tok,
"actionListener",
"new java.awt.event.ActionListener() { " +
"public void actionPerformed(java.awt.event.ActionEvent _evt) {",
"}}");
namedThreads(tok);
threads(tok);
// try answer
while ((i = findCodeTokens(tok, "try", "answer")) >= 0) {
int j = findEndOfStatement(tok, i);
S v = makeVar("a");
tok.set(i, "{ S " + v);
tok.set(i+2, "=");
tok.set(j-1, "; if (!empty(" + v + ")) ret " + v + "; }");
reTok(tok, i, j);
}
// return optional (return if not null)
while ((i = jfind(tok, "return optional <id> =")) >= 0) {
int j = findEndOfStatement(tok, i);
S v = tok.get(i+4);
clearTokens(tok, i+2, i+4);
tok.set(i, "{");
tok.set(j-1, "; if (" + v + " != null) ret " + v + "; }");
reTok(tok, i, j);
}
functionReferences(tok);
quicknew2(tok);
tok_unpair(tok);
tok_cachedFunctions(tok);
// end of localStuff1
same = tok_sameTest(tok, before);
/*if (!same)
print("local not same " + safety + " (" + l(tok) + " tokens)");*/
if (safety++ >= 10) {
print("----");
print(join(tok));
print("----");
fail("safety 10 error!");
}
} while (!same);
ret tok;
}
static L<S> reTok_include(L<S> tok, int i, int j) {
ret reTok_modify(tok, i, j, f localStuff1);
}
static L<S> includeInMainLoaded_reTok(L<S> tok, int i, int j) {
ret reTok_include(tok, i, j);
}
static L<S> stdstuff(L<S> tok) {
//if (++level >= 10) fail("woot? 10");
print("stdstuff!");
int i;
new L<S> ts;
tok_findTranslators(tok, ts);
if (nempty(ts))
print("DROPPING TRANSLATORS: " + structure(ts));
tok = quickmain(tok);
tok = tok_processIncludes(tok);
processConceptsDot(tok);
tok = tok_processIncludes(tok);
conceptDeclarations(tok);
// * constructors
if (hasCodeTokens(tok, "\\*", "("))
tok = expandStarConstructors(tok);
// STANDARD CLASSES & INTERFACES
S sc = cacheGet("#1003674");
new L<S> lclasses;
for (S line : toLinesFullTrim(sc)) {
line = javaDropComments(line).trim();
int idx = line.indexOf('/');
lclasses.addAll(ll(line.substring(0, idx), line.substring(idx+1)));
}
final Set<S> haveClasses = addStandardClasses(tok, toStringArray(lclasses));
if (tok.contains("Triple") && !haveClasses.contains("Triple"))
jreplace(tok, "Triple", "T3");
// "x << X" or "x >> X" => "x instanceof X"
for (S op : ll("<<", ">>"))
jreplace(tok, "<id> " + op + " <id>", "$1 instanceof $4", func(L<S> tok, int i) {
haveClasses.contains(tok.get(i+7))
});
// concept-related stuff
// auto-import concepts
bool _a = tok_hasClassRef2(tok, /*"extends",*/ "Concept") || tok_hasClassRef2(tok, "Concepts"), _b = !haveClasses.contains("Concept");
//print("auto-import: " + _a + ", " + _b);
if (_a && _b) {
print("Auto-including concepts.");
if (shouldNotIncludeClass.contains("Concepts")) {
print(join(tok));
fail("Unwanted concepts import");
}
printStruct(haveClasses);
tok = includeInMainLoaded(tok, "concepts.");
reTok(tok, l(tok)-1, l(tok));
//processConceptsDot(tok);
}
jreplace(tok, "for (<id> <id>)", "for ($3 $4 : list($3))");
jreplace(tok, "for (final <id> <id>)", "for (final $4 $5 : list($4))");
// the infamous missing functions (usually caused by class Matches)
// maybe not needed anymore?
/*if (!hasCodeTokens(tok, "String", "unquote") && containsToken(tok, "unquote")) {
print("Adding unquote");
tok = includeInMain(tok, "#1001735");
}
if (!hasCodeTokens(tok, "String", "formatSnippetID") && containsToken(tok, "formatSnippetID")) {
print("Adding formatSnippetID");
tok = includeInMain(tok, "#1000709");
}*/
tok_moveImportsUp(tok);
/*S moved = moveImportsUp2(join(tok));
if (moved != null) tok = jtok(moved);*/
ret tok;
} // end of stdStuff!
static L<S> multilineStrings(L<S> tok) {
for (int i = 1; i < tok.size(); i += 2) {
S t = tok.get(i);
if (isQuoted(t))
if (t.startsWith("[") || t.contains("\r") || t.contains("\n"))
tok.set(i, quote(unquote(t)));
}
ret tok;
}
static void inStringEvals(L<S> tok) {
bool change = false;
for (int i = 1; i < tok.size(); i += 2) {
S t = tok.get(i);
if (!isQuoted(t)) continue;
if (t.contains("\\*") && !t.contains("\\\\")) { // << rough
tok.set(i, inStringEval(t));
change = true;
}
}
if (change) reTok(tok);
}
static S inStringEval(S t) {
t = dropPrefix("\"", dropSuffix("\"", t));
new L<S> l;
int idx;
while ((idx = t.indexOf("\\*")) >= 0) {
int j = indexOf(t, idx, "*/");
if (j < 0) break;
if (idx > 0)
l.add("\"" + substring(t, 0, idx) + "\"");
l.add("(" + trim(substring(t, idx+2, j)) + ")");
t = substring(t, j+2);
}
if (nempty(t))
l.add("\"" + t + "\"");
ret "(" + join(" + ", l) + ")";
}
static L<S> quickmain(L<S> tok) {
bool change = false;
int i = findCodeTokens(tok, "main", "{");
if (i < 0) i = findCodeTokens(tok, "m", "{");
if (i >= 0 && !(i-2 > 0 && tok.get(i-2).equals("class"))) {
tok.set(i, "class main");
change = true;
}
i = findCodeTokens(tok, "psvm", "{");
if (i < 0) i = findCodeTokens(tok, "p", "{");
if (i >= 0) {
int idx = i+2;
int j = findEndOfBracketPart(tok, idx);
L<S> contents = subList(tok, idx+1, j-1);
tok.set(i, "public static void main(final String[] args) throws Exception");
replaceTokens(tok, idx+1, j-1, tok_addSemicolon(contents));
change = true;
}
ret change ? jtok(tok) : tok;
}
static S makeVar(S name) {
ret "_" + name + "_" + varCount++;
}
static S makeVar() { ret makeVar(""); }
/*static L<S> standardFunctions(L<S> tok) {
ret rtq(tok, "#1002474");
}*/
static L<S> rtq(L<S> tok, S id) {
ret runTranslatorQuick(tok, id);
}
static L<S> expandShortTypes(L<S> tok) {
// replace <int> with <Integer>
for (int i = 1; i+4 < tok.size(); i += 2)
if (tok.get(i).equals("<")
&& litlist(">", ",").contains(tok.get(i+4))) {
String type = tok.get(i+2);
if (type.equals("int")) type = "Integer";
else if (type.equals("long")) type = "Long";
tok.set(i+2, type);
}
// O = Object, S = String, ret = return
for (int i = 1; i < tok.size(); i += 2) {
String t = tok.get(i);
if (t.equals("O")) t = "Object";
if (t.equals("S")) t = "String";
else if (t.equals("L")) t = "List";
//else if (t.equals("F")) t = "Function";
else if (t.equals("ret")) t = "return";
else if (t.equals("bool") && i+2 < tok.size() && neq(tok.get(i+2), "(")) t = "boolean"; // bool -> boolean if it's not a function name
tok.set(i, t);
}
jreplace(tok, "LL< <id> >", "L<L<$3>>");
jreplace(tok, "Clusters< <id> >", "Map<$3, Collection<$3>>");
ret tok;
}
static L<S> autoImports(L<S> tok) {
HashSet<S> imports = new HashSet(tok_findImports(tok));
new StringBuilder buf;
for (S c : standardImports)
if (!(imports.contains(c)))
buf.append("import " + c + ";\n");
if (buf.length() == 0) ret tok;
tok.set(0, buf+tok.get(0));
ret reTok(tok, 0, 1);
}
static String[] standardImports = {
"java.util.*",
"java.util.zip.*",
"java.util.List",
"java.util.regex.*",
"java.util.concurrent.*",
"java.util.concurrent.atomic.*",
"java.util.concurrent.locks.*",
"javax.swing.*",
"javax.swing.event.*",
"javax.swing.text.*",
"javax.swing.table.*",
"java.io.*",
"java.net.*",
"java.lang.reflect.*",
"java.lang.ref.*",
"java.lang.management.*",
"java.security.*",
"java.security.spec.*",
"java.awt.*",
"java.awt.event.*",
"java.awt.image.*",
"javax.imageio.*",
"java.math.*"
};
static L<S> expandStarConstructors(L<S> tok) {
mainLoop: for (int i = 3; i+6 < tok.size(); i += 2) {
String t = tok.get(i), l = tok.get(i-2);
if (!t.equals("*"))
continue;
if (!tok.get(i+2).equals("("))
continue;
if (!eqOneOf(l, "}", "public", "private", "protected", ";", "{", "endif") && neq(get(tok, i-4), "ifclass")) // is this correct...??
continue;
// ok, it seems like a constructor declaration.
// Now find class name by going backwards.
int j = i, level = 1;
while (j > 0 && level > 0) {
t = tok.get(j);
if (t.equals("}")) ++level;
if (t.equals("{")) --level;
j -= 2;
}
while (j > 0) {
t = tok.get(j);
if (t.equals("class")) {
String className = tok.get(j+2);
tok.set(i, className); // exchange constructor name!
// now for the parameters.
// Syntax: *(Learner *learner) {
// We will surely add type inference here in time... :)
j = i+2;
while (!tok.get(j).equals("{"))
j += 2;
int block = j+1;
for (int k = i+2; k < block-1; k += 2)
if (tok.get(k).equals("*")) {
tok.remove(k);
tok.remove(k);
block -= 2;
String name = tok.get(k);
tok.addAll(block, Arrays.asList(new String[] {
"\n ", "this", "", ".", "", name, " ", "=", " ", name, "", ";" }));
}
continue mainLoop;
}
j -= 2;
}
}
ret tok;
}
static L<S> tok_processIncludes(L<S> tok) {
int safety = 0;
while (hasCodeTokens(tok, "!", "include") && ++safety < 100)
tok = tok_processIncludesSingle(tok);
//tok_autoCloseBrackets(tok);
ret tok;
}
static L<S> tok_processIncludesSingle(L<S> tok) {
int i;
while ((i = jfind(tok, "!include #<int>")) >= 0) {
S id = tok.get(i+6);
included.add(parseLong(id));
replaceTokens(tok, i, i+8, "\n" + loadSnippet(id) + "\n");
reTok_include(tok, i, i+8);
}
while ((i = jfind(tok, "!include once #<int>")) >= 0) {
S id = tok.get(i+8);
bool isNew = included.add(parseLong(id));
replaceTokens(tok, i, i+10,
isNew ? "\n" + loadSnippet(id) + "\n" : "");
reTok_include(tok, i, i+10);
}
ret tok;
}
static void ctex(L<S> tok) {
replaceKeywordBlock(tok, "ctex",
"{ try {",
"} catch (Exception __e) { throw rethrow(__e); } }");
replaceKeywordBlock(tok, "null on exception",
"{ try {",
"} catch (Throwable __e) { return null; } }");
replaceKeywordBlock(tok, "false on exception",
"{ try {",
"} catch (Throwable __e) { return false; } }");
}
static L<S> dialogHandler(L<S> tok) {
ret replaceKeywordBlock(tok,
"dialogHandler",
"new DialogHandler() {\n" +
"public void run(final DialogIO io) {",
"}}");
}
static void quicknew2(L<S> tok) {
jreplace(tok, "new <id> <id>;", "$2 $3 = new $2;");
jreplace(tok, "new <id><<id>> <id>;", "$2<$4> $6 = new $2;");
jreplace(tok, "new <id><<id>> <id>, <id>;", "$2<$4> $6 = new $2, $8 = new $2;");
jreplace(tok, "new <id><<id>,<id>> <id>;", "$2<$4,$6> $8 = new $2;");
jreplace(tok, "new <id><<id><<id>>> <id>;", "$2 $3 $4 $5 $6 $7 $8 $9 = new $2;");
jreplace(tok, "new <id><<id>[]> <id>;", "$2 $3 $4 $5 $6 $7 $8 = new $2;");
jreplace(tok, "new <id>< <id><<id>,<id>> > <id>;", "$2 $3 $4 $5 $6 $7 $8 $9 $10 $11 = new $2;");
// [abandoned, confusing, looks like a function definition] with arguments - new A a(...); => A a = new A(...);
//jreplace(tok, "new <id> <id>(", "$2 $3 = new $2(");
jreplace(tok, "for args " + "{", "for (int i = 0; i < args.length; i++) { final String arg = args[i];");
// Constructor calls without parentheses
// So you can say something like: predictors.add(new P1);
jreplace1(tok, "new <id>", "new $2()", func(L<S> tok, int i) {
eqOneOf(_get(tok, i+5), "{", ",", ")", ";", ":")
});
jreplace(tok, "new List(", "new ArrayList(");
jreplace(tok, "new Map(", "new HashMap(");
jreplace(tok, "new Set(", "new HashSet(");
jreplace(tok, "new (Hash)Set", "new HashSet"); // rough
jreplace(tok, "new (Tree)Set", "new TreeSet");
jreplace(tok, "new (Hash)Map", "new HashMap");
jreplace(tok, "new (Tree)Map", "new TreeMap");
jreplace(tok, "\\*<id>[<id>] <id>;", "$2[] $6 = new $2[$4];");
// X x = new(...) => X x = new X(...)
// X x = new => X x = new
jreplace(tok, "<id> <id> = new", "$1 $2 = new $1", func(L<S> tok, int i) {
eqOneOf(_get(tok, i+9), "(", ";", ",", ")")
});
jreplace(tok, "<id> <id> = new \\*", "$1 $2 = new $1");
jreplace(tok, "\\* <id> = new <id>", "$5 $2 = new $5");
jreplace(tok, "<id><<id>> <id> = new", "$1 $2 $3 $4 $5 = new $1", func(L<S> tok, int i) {
eqOneOf(_get(tok, i+9+3*2), "(", ";", ",", ")")
});
jreplace(tok, "<id><<id>,<id>> <id> = new", "$1 $2 $3 $4 $5 $6 $7 = new $1", func(L<S> tok, int i) {
eqOneOf(_get(tok, i+9+5*2), "(", ";", ",", ")")
});
}
static L<S> extendClasses(L<S> tok) {
int i;
while ((i = jfind(tok, "extend <id> {")) >= 0) {
S className = tok.get(i+2);
int idx = findCodeTokens(tok, i, false, "{");
int j = findEndOfBracketPart(tok, idx+2);
S content = join(subList(tok, idx+1, j-1));
L<S> c = findInnerClassOfMain(tok, className);
print("Extending class " + className);
clearTokens(tok.subList(i, j+1));
if (c == null) {
print("Warning: Can't extend class " + className + ", not found");
continue;
}
int startOfClass = indexOfSubList(tok, c); // magicIndexOfSubList is broken
int endOfClass = startOfClass + l(c)-1;
//print("Extending class " + className + " ==> " + join(subList(tok, startOfClass, endOfClass)));
while (neq(tok.get(endOfClass), "}")) --endOfClass;
//print("Extending class " + className + " ==> " + join(subList(tok, startOfClass, endOfClass)));
tok.set(endOfClass, content + "\n" + tok.get(endOfClass));
time { doubleReTok(tok, i, j+1, endOfClass, endOfClass+1); }
// time { reTok(tok); } // changed in 2 places, let's retok it all
}
ret tok;
}
static void listComprehensions(L<S> tok) {
int i;
for (S op : ll(":", "in"))
while ((i = jfind(tok, "[<id> <id> " + op)) >= 0) {
Map<Integer, Integer> bracketMap = getBracketMap(tok); // XXX - optimize
S type = tok.get(i+2), id = tok.get(i+4);
int j = scanOverExpression(tok, bracketMap, i+8, "|");
S exp = join(tok.subList(i+8, j));
j += 2;
int k = scanOverExpression(tok, bracketMap, j, "]");
S where = join(tok.subList(j, k));
++k;
S code = "filter(" + exp + ", func(" + type + " " + id + ") { " + where + " })";
replaceTokens(tok, i, k, code);
reTok(tok, i, k);
}
}
/* complicated version - TODO */
// for (S key, S value : map)
/*static void doubleFor(L<S> tok) {
int i;
while ((i = jfind(tok, "for (<id> <id>, <id> <id> :")) >= 0) {
int iComma = indexOf(tok, ",", i);
S valType = tok.get(iComma+2);
S valName = tok.get(iComma+4);
int expStart = indexOf(tok, ":", i)+2;
int expEnd = findEndOfBracketPart(expStart-2);
assertEquals(")", tok.get(expEnd));
assertEquals("{", tok.get(expEnd+2));
replaceTokens(tok, iComma, expStart, ": keys(");
tok.set(expEnd, "))");
tok.set(expEnd+2, "{ " + valType + " " + valName + " = " +
S type = tok.get(i+2), id = tok.get(i+4);
int j = scanOverExpression(tok, bracketMap, i+8, "|");
S exp = join(tok.subList(i+8, j));
j += 2;
int k = scanOverExpression(tok, bracketMap, j, "]");
S where = join(tok.subList(j, k));
++k;
S code = "filter(" + exp + ", func(" + type + " " + id + ") { " + where + " })";
replaceTokens(tok, i, k, code);
reTok(tok, i, k);
}
}*/
static void doubleFor_simple(L<S> tok) {
jreplace(tok, "for (<id> <id>, <id> <id> : <id>) {",
"for ($3 $4 : keys($9)) { $6 $7 = $9.get($4);");
jreplace(tok, "for (<id> <id>, <id> : <id>) {",
"for ($3 $4 : keys($8)) { $3 $6 = $8.get($4);");
}
static void forPing(L<S> tok) {
int i, safety = 0;
while ((i = jfind(tok, "for ping (")) >= 0) {
if (++safety >= 10) fail("safety");
int bracketEnd = findEndOfBracketPart(tok, i+4)-1;
if (neq("{", tok.get(bracketEnd+2)))
fail("Please use { with 'for ping' : " + joinSubList(tok, i+4, bracketEnd+3));
tokSet(tok, bracketEnd+2, "{ ping();");
tokSet(tok, i+2, "");
}
}
// lib 123 => !123
static void libs(L<S> tok) {
new TreeSet<S> libs;
int i;
while ((i = jfind(tok, "lib <int>")) >= 0) {
S id = tok.get(i+2);
print("lib " + id);
if (!libs.contains(id)) {
libs.add(id);
tok.set(i, "!");
tok.set(i+1, "");
} else {
print("...ignoring (duplicate)");
clearAllTokens(tok, i, i+3);
reTok(tok, i, i+3);
}
}
}
// sourceCodeLine() => 1234
static void sourceCodeLine(L<S> tok) {
int i ;
while ((i = jfind(tok, "sourceCodeLine()")) >= 0) {
replaceTokens(tok, i, i+5, str(countChar(join(subList(tok, 0, i)), '\n')+1));
reTok(tok, i, i+5);
}
}
// done before any other processing
static void earlyStuff(L<S> tok) {
int i;
tok_autosemi(tok);
tok_autoCloseBrackets(tok);
jreplace(tok, "°", "()");
// Note: this makes the word "quine" a special operator
// (unusable as a function name)
while ((i = jfind(tok, "quine(")) >= 0) {
int idx = findCodeTokens(tok, i, false, "(");
int j = findEndOfBracketPart(tok, idx+2);
tok.set(i, "new Quine");
tok.set(idx, "(" + quote(join(subList(tok, idx+1, j-1))) + ", ");
reTok(tok, i, idx+1);
}
}
static void throwFail(L<S> tok) {
bool anyChange = false;
for (int i = 1; i+2 < l(tok); i += 2)
if (eq(get(tok, i+2), "fail") && !eqOneOf(get(tok, i), "throw", "RuntimeException", "return")) {
tok.set(i+2, "throw fail");
anyChange = true;
}
if (anyChange)
reTok(tok);
}
static void namedThreads(L<S> tok) {
for (int i = 0; i < 100; i++) {
int idx = findCodeTokens(tok, "thread", "<quoted>", "{");
if (idx < 0) idx = findCodeTokens(tok, "thread", "<id>", "{");
if (idx < 0)
break;
int j = findEndOfBracketPart(tok, idx+4);
S tName = tok.get(idx+2);
S var = "_t_" + i;
S pre = "{ Thread " + var + " = new Thread(" + tName + ") {\n" +
"public void run() { pcall {\n";
S post = "} }\n};\n" +
"startThread(" + var + "); }";
tok.set(idx, pre);
tok.set(idx+2, "");
tok.set(idx+4, "");
tok.set(j-1, post);
//print(join(subList(tok, idx, j)));
reTok(tok, idx, j);
}
}
static void rNamedThread(L<S> tok) {
for (int i = 0; i < 100; i++) {
int idx = findCodeTokens(tok, "r", "-", "thread", "<quoted>", "{");
if (idx < 0) idx = findCodeTokens(tok, "r", "-", "thread", "<id>", "{");
if (idx < 0)
break;
int j = findEndOfBracketPart(tok, idx+8);
S tName = tok.get(idx+6);
S pre = "r { thread " + tName + " {";
S post = "}}";
replaceTokens(tok, idx, idx+9, pre);
tok.set(j-1, post);
reTok(tok, idx, j);
}
}
static void threads(L<S> tok) {
for (bool daemon : litlist(false, true))
for (int i = 0; i < 100; i++) {
int idx = findCodeTokens(tok, daemon ? "daemon" : "thread", "{");
if (idx < 0)
break;
int j = findEndOfBracketPart(tok, idx+2);
S var = "_t_" + i;
S pre = "{ Thread " + var + " = new Thread() {\n" +
"public void run() { pcall\n";
S post = "} }\n};\n" +
(daemon ? var + ".setDaemon(true);\n" : "") +
"startThread(" + var + "); }";
tok.set(idx, pre);
tok.set(j-1, post);
reTok(tok, idx, j);
}
}
static Map<S, S> sf;
static Bool _761ok;
static L<S> standardFunctions(L<S> tok) {
if (sf == null) {
S _761 = cacheGet("#761");
if (_761ok == null)
_761ok = isBracketHygienic(_761);
assertTrue("Whoa! #761 truncated?", _761ok);
L<S> standardFunctions = concatLists(
(L) loadVariableDefinition(_761, "standardFunctions"),
(L) loadVariableDefinition(cacheGet("#1006654"), "standardFunctions"));
sf = new HashMap;
for (S x : standardFunctions) {
S[] f = x.split("/");
sf.put(f[1], f[0]);
}
}
for (int i = 0; ; i++) {
Set<S> defd = new HashSet(findFunctions(tok));
int j;
while ((j = jfind(tok, "should not include function *.")) >= 0) {
S fname = tok.get(j+8);
shouldNotIncludeFunction.add(fname);
clearAllTokens(tok.subList(j, j+12));
}
// changes tok
Set<String> invocations = findFunctionInvocations(tok, sf);
invocations.addAll(functionsToAlwaysInclude);
//print("Functions invoked: " + structure(invocations));
List<String> needed = diff(invocations, defd);
if (needed.isEmpty())
break;
print("Adding functions: " + join(" " , needed));
Collection<S> bad = setIntersection(new HashSet(needed), shouldNotIncludeFunction);
if (nempty(bad)) {
S msg = "INCLUDING BAD FUNCTIONS: " + sfu(bad);
print(msg);
print(join(tok));
fail(msg);
}
new L<S> added;
new StringBuilder buf;
new L<S> preload;
for (S x : needed)
if (sf.containsKey(x))
preload.add(sf.get(x));
cachePreload(preload);
for (String x : cloneList(needed)) {
if (defd.contains(x)) continue;
String id = sf.get(x);
if (id == null) {
print("Standard function " + x + " not found.");
needed.remove(x);
continue;
}
//print("Adding function: " + x + " (" + id + ")");
S function = cacheGet(id);
if (("\n" + function).contains("\n!")) print("Warning: " + id + " contains translators.");
if (cacheStdFunctions) {
long _id = psI(id);
CachedInclude ci = cachedIncludes.get(_id);
if (ci == null) cachedIncludes.put(_id, ci = new CachedInclude);
function += "\n";
if (neq(ci.javax, function)) {
print("Compiling function: " + x);
ci.javax = function;
ci.java = join(localStuff1(jtok(function)));
}
buf.append(ci.java);
} else
buf.append(function).append("\n");
added.add(x);
defd.addAll(findFunctionDefs(javaTok(function)));
}
if (cacheStdFunctions)
tok = includeInMainLoaded_stdReTok(tok, str(buf));
else
tok = includeInMainLoaded(tok, str(buf));
// defd = new HashSet(findFunctions(tok));
//print("Functions added: " + structure(added));
for (String x : needed)
if (!defd.contains(x)) {
print(join(tok));
fail("Function not defined properly: " + x);
}
//print("Iteration " + (i+2));
tok_definitions(tok);
tok_ifndef(tok);
tok_ifdef(tok);
if (i >= 1000) fail("Too many iterations");
}
ret tok;
}
static L<S> findFunctions(L<S> tok) {
//ret findFunctionDefinitions(join(findMainClass(tok)));
ret findFunctionDefs(findMainClass(tok));
}
static S cacheGet(S snippetID) {
snippetID = formatSnippetID(snippetID);
S text = snippetCache.get(snippetID);
if (text == null)
snippetCache.put(snippetID, text = loadSnippet(snippetID));
ret text;
}
static void cachePreload(L<S> ids) {
new L<S> needed;
for (S id : ids)
if (!snippetCache.containsKey(formatSnippetID(id)))
needed.add(formatSnippetID(id));
if (l(needed) > 1) {
L<S> texts = loadSnippets(needed);
for (int i = 0; i < l(needed); i++)
if (texts.get(i) != null)
snippetCache.put(needed.get(i), texts.get(i));
}
}
static L<S> jtok(L<S> tok) {
ret jtok(join(tok));
}
static L<S> jtok(S s) {
L<S> l = javaTok(s);
ret useIndexedList ? new IndexedList2(l) : l;
}
static HashSet<S> haveClasses(L<S> tok) {
new HashSet<S> have;
for (L<S> c : innerClassesOfMain(tok))
have.add(getClassDeclarationName(c));
have.addAll(tok_importedClassNames(tok));
have.add("String");
ret have;
}
// works on Java level (no "sclass" etc)
// returns list of classes we have (useful for other processing)
static Set<S> addStandardClasses(L<S> tok, S... data) {
HashSet<S> have = haveClasses(tok);
int j;
while ((j = jfind(tok, "should not include class *.")) >= 0) {
S cname = tok.get(j+8);
shouldNotIncludeClass.add(cname);
clearAllTokens(tok.subList(j, j+12));
}
//L<S> idx = IndexedList2.ensureIndexed(tok);
Set<S> idx = tokenIndexWithoutIfclass(tok);
for (int i = 0; i+1 < l(data); i++) {
S className = data[i], snippetID = data[i+1];
if (idx.contains(className)
&& !have.contains(className)) {
if (shouldNotIncludeClass.contains(className)) {
S msg = "INCLUDING BAD CLASS: " + className;
print(msg);
print(join(tok));
fail(msg);
}
print("Adding class " + className + " / " + snippetID);
snippetID = fsI(snippetID);
S text = cacheGet(snippetID);
if (cacheStdClasses) {
long _id = psI(snippetID);
CachedInclude ci = cachedIncludes.get(_id);
if (ci == null) cachedIncludes.put(_id, ci = new CachedInclude);
if (neq(ci.javax, text)) {
print("Compiling standard class: " + className);
ci.javax = text;
ci.java = join(localStuff1(jtok(text)));
}
includeInMainLoaded_stdReTok(tok, ci.java);
} else {
includeInMainLoaded(tok, text);
}
L<S> ct = javaTok(text);
shortenedSubconcepts(ct);
conceptDeclarations(ct);
jreplace(ct, "sclass", "static class");
jreplace(ct, "sinterface", "static interface");
//tok_autoCloseBrackets(ct);
for (L<S> c : allClasses(ct))
have.add(getClassDeclarationName(c));
if (!have.contains(className))
fail("Wrongly defined class: " + className + " / " + snippetID);
}
}
ret have;
}
static Set<S> expandableClassNames = lithashset("BigInteger");
// magically append ".class" to class name references
static void expandClassReferences(L<S> tok, Set<S> classNames) {
bool change = false;
for (int i = 3; i+2 < l(tok); i += 2) {
S t = tok.get(i);
// skip implements/extends/throws lists
if (eqOneOf(t, "implements", "extends", "throws")) {
i = tok_endOfImplementsList(tok, i);
continue;
}
if (classNames.contains(t) || expandableClassNames.contains(t)) {
S s = tok.get(i-2); t = tok.get(i+2);
if (eqOneOf(s, "instanceof", "new", ".", "<", ">", "/", "nu")) continue;
if (isIdentifier(s) || isInteger(s)) continue;
if (eq(s, ",") && isIdentifier(get(tok, i-4)) && eqGet(tok, i-6, "<")) continue; // e.g. T3<S, S, S>
if (eq(s, ",") && eqOneOf(_get(tok, i-6), "implements", "throws")) continue;
// TODO: longer lists
// check for cast
if (eq(s, "(") && eq(t, ")") && i >= 5) {
if (!eqOneOf(get(tok, i+4), "{", ";")) {
S x = tok.get(i-4);
if (!isIdentifier(x)) continue;
if (eqOneOf(x, "ret", "return")) continue;
}
}
if (eqOneOf(t, ",", ")", ";", ":")) {
tok.set(i, tok.get(i) + ".class");
change = true;
}
}
}
if (change) reTok(tok);
}
// "<id>/<ClassName>" => "((ClassName) <id>)"
static void slashCasts(L<S> tok, final Set<S> classNames) {
jreplace(tok, "<id>/<id>", "(($3) $1)", new O() {
O get(L<S> tok, int i) {
ret classNames.contains(tok.get(i+5));
}
});
}
// experimental - "<ClassName>(...)" => "new <ClassName>(...)"
// doesn't work at beginning of statement as we can't easily
// distinguish it from a constructor declaration.
static void newWithoutNew(L<S> tok, final Set<S> classNames) {
jreplace(tok, "<id>(", "new $1(", func(L<S> tok, int i) {
if (!classNames.contains(tok.get(i+1))) false;
bool ok = neqOneOf(_get(tok, i-1), "new", ";", "}", "{", "public", "protected", "private", ".");
//print("newWithoutNew: checking " + struct(subList(tok, i-1, i+2)) + " => " + ok);
ret ok;
});
}
// +var => "var", +var
static void expandVarCopies(L<S> tok) {
bool change = false;
for (int i = 3; i+2 < l(tok); i += 2) {
if (!eq(tok.get(i), "+")) continue;
if (!eqOneOf(tok.get(i-2), "(", ",", "{")) continue;
S s = tok.get(i+2);
if (!isIdentifier(s)) continue;
tok.set(i, quote(s) + ", ");
change = true;
}
if (change) reTok(tok);
}
static void processConceptsDot(L<S> tok) {
bool change;
do {
change = false;
for (int i : jfindAll(tok, "concepts."))
if (contains(get(tok, i+3), "\n")) {
replaceTokens(tok, i, i+3, "!" + "include #1004863 // Dynamic Concepts");
reTok(tok, i, i+3);
change = true;
break;
}
} while (change);
}
static void addFieldOrder(L<S> tok, int i) {
int idx = findCodeTokens(tok, i, false, "{");
if (idx < 0) ret;
int j = findEndOfBracketPart(tok, idx);
L<S> vars = allVarNames(subList(tok, idx+1, j-1));
print("addFieldOrder " + struct(vars));
if (!vars.contains("_fieldOrder")
&& !isSortedList(vars)) {
print("Adding field order");
tok.set(idx+2, "static String _fieldOrder = " + quote(join(" ", vars)) + ";\n " + tok.get(idx+2));
// reTok has to be done by caller
}
}
static void caseAsVariableName(L<S> tok) {
if (!tok.contains("case")) ret;
for (int i = 1; i+2 < l(tok); i += 2) {
S t = tok.get(i+2);
if (tok.get(i).equals("case")
&& !(t.startsWith("'") || isInteger(t) || isIdentifier(t)))
tok.set(i, "_case");
}
}
static void continueAsFunctionName(L<S> tok) {
jreplace(tok, "continue(", "_continue(");
}
// f bla => "bla" - and "please include function bla."
static void functionReferences(L<S> tok) {
int i;
S keyword = "f";
while ((i = jfind(tok, keyword + " <id>", new O() {
O get(L<S> tok, int i) {
ret !eq(tok.get(i+3), "instanceof");
}
})) >= 0) {
S f = tok.get(i+2);
clearTokens(tok, i, i+2);
tok.set(i+2, quote(f));
reTok(tok, i, i+2);
tok.set(l(tok)-1, last(tok) + "\nplease include function " + f + ".");
reTok(tok, l(tok)-1, l(tok));
}
}
// # 123 => "#123"
static void directSnippetRefs(L<S> tok) {
int i;
while ((i = jfind(tok, "#<int>", new O() {
bool get(L<S> tok, int i) {
ret !eqOneOf(_get(tok, i-1), "include", "once");
}
})) >= 0) {
S id = tok.get(i+2);
clearTokens(tok, i+1, i+3);
tok.set(i, quote("#" + id));
reTok(tok, i, i+3);
}
}
static void quicknu(L<S> tok) {
jreplace(tok, "nu <id>(", "nu($2.class, ");
jreplace(tok, "nu <id>", "new $2");
}
// fill variable innerClasses_list
static void innerClassesVar(L<S> tok) {
if (!tok.contains("myInnerClasses_list")) ret;
L<S> have = classDeclarationNames(innerClassesOfMain(tok));
int i = jfind(tok, ">myInnerClasses_list;");
if (i < 0) ret;
tok.set(i+4, "=litlist(\n" + joinQuoted(", ", have) + ");");
reTok(tok, i+4, i+5);
}
// process ifclass x ... endif blocks
static void tok_ifclass(L<S> tok) {
if (!tok.contains("ifclass")) ret;
L<S> have = classDeclarationNames(innerClassesOfMain(tok));
int i;
while ((i = rjfind(tok, "ifclass <id>")) >= 0) {
int j = jfind(tok, i+4, "endif");
if (j < 0) j = l(tok)-1;
bool has = have.contains(tok.get(i+2));
clearTokens(tok, i, i+3);
clearTokens(tok, j, j+1);
if (!has) clearTokens(tok, i+3, j);
reTok(tok, i, j+1);
}
}
// set flag *.
static void tok_definitions(L<S> tok) {
int i;
while ((i = jfind(tok, "set flag <id>.")) >= 0) {
String fname = tok.get(i+4);
definitions.add(fname);
clearAllTokens(tok.subList(i, i+8));
}
}
// process ifndef x ... endifndef blocks
static void tok_ifndef(L<S> tok) {
if (!tok.contains("ifndef")) ret;
int i;
while ((i = rjfind(tok, "ifndef <id>")) >= 0) {
int j = jfind(tok, i+4, "endifndef");
if (j < 0) j = l(tok)-1;
S fname = tok.get(i+2);
bool has = !definitions.contains(fname);
print("ifndef " + fname + " => " + has);
clearTokens(tok, i, i+3);
clearTokens(tok, j, j+1);
if (!has) clearTokens(tok, i+3, j);
reTok(tok, i, j+1);
}
}
// process ifdef x ... endifdef blocks
static void tok_ifdef(L<S> tok) {
if (!tok.contains("ifdef")) ret;
int i;
while ((i = rjfind(tok, "ifdef <id>")) >= 0) {
int j = jfind(tok, i+4, "endifdef");
if (j < 0) j = l(tok)-1;
S fname = tok.get(i+2);
bool has = definitions.contains(fname);
print("ifdef " + fname + " => " + has);
clearTokens(tok, i, i+3);
clearTokens(tok, j, j+1);
if (!has) clearTokens(tok, i+3, j);
reTok(tok, i, j+1);
}
}
svoid conceptDeclarations(L<S> tok) {
for (S kw : ll("concept", "sconcept")) {
O cond = new O() {
O get(L<S> tok, int i) {
addFieldOrder(tok, i+1);
ret true;
}
};
bool re = false;
if (jreplace(tok, kw + " <id> {", "static class $2 extends Concept {", cond)) re = true;
if (jreplace(tok, kw + " <id> implements", "static class $2 extends Concept implements", cond)) re = true;
if (jreplace(tok, kw + " <id>", "static class $2", cond)) re = true;
if (re) reTok(tok);
}
}
svoid shortenedSubconcepts(L<S> tok) {
jreplace(tok, "<id> > <id> {", "concept $3 extends $1 {", new O() { O get(L<S> tok, int i) {
bool b = (i == 0 || tok.get(i).contains("\n")) || eq(_get(tok, i-1), "abstract"); // only at beginning of line or after "abstract"
//print("subconcept " + b + ": " + structure(subList(tok, i-1, i+5)));
ret b;
}});
}
// -slightly experimental
// -do calculation in another thread, then return to AWT thread
// -must be placed in a block
// -transforms rest of block
svoid unswing(L<S> tok) {
int i;
while ((i = jfind(tok, "unswing {")) >= 0) {
int idx = i+2;
int closingBracket = findEndOfBracketPart(tok, idx)-1;
int endOfOuterBlock = findEndOfBracketPart(tok, closingBracket)-1;
tok.set(i, "thread");
tok.set(closingBracket, " awt {");
tok.set(endOfOuterBlock, "}}}");
reTok(tok, closingBracket-1, endOfOuterBlock+1);
}
}
// -slightly experimental
// -Syntax: lock theLock;
// -lock a lock, unlock at end of current block with finally
svoid lockBlocks(L<S> tok) {
int i;
while ((i = jfind(tok, "lock <id>", func(L<S> tok, int i) { neq(tok.get(i+3), "instanceof") })) >= 0) {
int semicolon = findEndOfStatement(tok, i)-1;
S var = makeVar("lock");
int endOfOuterBlock = findEndOfBracketPart(tok, semicolon)-1;
replaceTokens(tok, i, semicolon+1,
"Lock " + var + " = " + joinSubList(tok, i+2, semicolon-1) + "; lock(" + var + "); try {");
tok.set(endOfOuterBlock, "} finally { " + var + ".unlock(); } }");
reTok(tok, i, endOfOuterBlock+1);
}
}
svoid cleanMeUp {
vmKeepWithProgramMD5_save('cachedIncludes);
}
Author comment
Began life as a copy of #752
download show line numbers debug dex
Travelled to 10 computer(s): cfunsshuasjs, ddnzoavkxhuk, etmzoiygucik, jtubtzbbkimh, nbgitpuheiab, onxytkatvevr, sawdedvomwva, teubizvjbppd, tvejysmllsmz, xprdwmaupziu
No comments. add comment
Snippet ID: #759
Snippet name: "Super-Edgy" JavaX Translator (Extension of #7)
Eternal ID of this version: #759/303
Text MD5: 4544792575aa1cb7754f9bdbdcac7ec4
Transpilation MD5: bde11d2be779a9af3bc4c720a5ed7866
Author: stefan
Category: javax
Type: JavaX translator
Public (visible to everyone): Yes
Archived (hidden from active list): No
Created/modified: 2017-09-20 16:59:26
Source code size: 60578 bytes / 1861 lines
Pitched / IR pitched: No / No
Views / Downloads: 2549 / 21434
Version history: 302 change(s)
Referenced in: [show]
|
{
"url": "http://tinybrain.de:8080/tb/show-snippet.php?id=759",
"source_domain": "tinybrain.de:8080",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "245784",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KG3LMMA2RXA7R7EV77TL4SNZJ4CBBN4H",
"WARC-Concurrent-To": "<urn:uuid:8a6ceb7a-0d1a-46f4-ad7d-c44f6812ba25>",
"WARC-Date": "2017-09-20T23:45:10Z",
"WARC-IP-Address": "84.201.25.107",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EOXHLLGIYMBIVBO5DWJZNAREOKXEQGE2",
"WARC-Record-ID": "<urn:uuid:427ec723-b565-4351-93b7-5e485e470f47>",
"WARC-Target-URI": "http://tinybrain.de:8080/tb/show-snippet.php?id=759",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5828753f-a47d-433d-82df-4930e1d165a5>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-150-110-222.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-39\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for September 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
102,
103,
108,
114,
115,
186,
187,
230,
231,
296,
297,
306,
307,
337,
369,
370,
454,
455,
484,
512,
545,
575,
609,
640,
670,
705,
738,
739,
767,
768,
789,
824,
879,
941,
997,
998,
1033,
1068,
1139,
1140,
1163,
1180,
1182,
1183,
1187,
1242,
1245,
1276,
1327,
1356,
1413,
1467,
1503,
1528,
1531,
1588,
1608,
1644,
1677,
1693,
1696,
1744,
1807,
1810,
1846,
1849,
1879,
1925,
1950,
1967,
2004,
2035,
2077,
2082,
2112,
2180,
2186,
2189,
2212,
2213,
2228,
2231,
2346,
2401,
2459,
2534,
2562,
2566,
2569,
2593,
2596,
2642,
2696,
2739,
2742,
2781,
2803,
2804,
2840,
2903,
2930,
2964,
2990,
2993,
3011,
3027,
3034,
3060,
3065,
3095,
3100,
3162,
3205,
3252,
3301,
3350,
3397,
3402,
3428,
3449,
3469,
3503,
3571,
3583,
3611,
3652,
3706,
3733,
3771,
3788,
3829,
3861,
3867,
3893,
3936,
3957,
3981,
4002,
4034,
4040,
4059,
4062,
4080,
4107,
4110,
4151,
4154,
4181,
4268,
4286,
4345,
4418,
4502,
4506,
4507,
4546,
4583,
4634,
4661,
4708,
4745,
4794,
4831,
4832,
4899,
4944,
4987,
5019,
5054,
5057,
5134,
5137,
5161,
5305,
5394,
5456,
5459,
5479,
5510,
5535,
5542,
5565,
5567,
5568,
5604,
5625,
5641,
5668,
5675,
5701,
5706,
5727,
5730,
5763,
5817,
5841,
5870,
5897,
5915,
5943,
5961,
5992,
6018,
6023,
6071,
6072,
6101,
6116,
6137,
6153,
6160,
6213,
6218,
6257,
6313,
6338,
6345,
6390,
6416,
6429,
6436,
6476,
6543,
6600,
6603,
6653,
6683,
6714,
6736,
6819,
6881,
6891,
6894,
6931,
7000,
7005,
7049,
7106,
7109,
7141,
7186,
7189,
7231,
7286,
7289,
7329,
7382,
7385,
7431,
7490,
7493,
7550,
7593,
7634,
7675,
7723,
7766,
7769,
7793,
7830,
7833,
7857,
7894,
7897,
7921,
7958,
7961,
8008,
8066,
8071,
8108,
8146,
8189,
8229,
8234,
8282,
8320,
8323,
8389,
8429,
8461,
8494,
8497,
8542,
8598,
8601,
8641,
8700,
8703,
8769,
8839,
8873,
8904,
8955,
8963,
8971,
8976,
9016,
9050,
9108,
9185,
9287,
9392,
9421,
9439,
9447,
9455,
9458,
9489,
9535,
9540,
9600,
9629,
9690,
9746,
9751,
9815,
9820,
9883,
9965,
10023,
10051,
10083,
10141,
10153,
10161,
10166,
10236,
10283,
10320,
10345,
10369,
10395,
10401,
10406,
10431,
10482,
10512,
10537,
10561,
10587,
10593,
10598,
10621,
10624,
10660,
10696,
10732,
10772,
10822,
10863,
10868,
10893,
10898,
10953,
11022,
11068,
11104,
11130,
11136,
11141,
11162,
11167,
11218,
11287,
11331,
11366,
11392,
11398,
11403,
11422,
11427,
11476,
11545,
11589,
11622,
11648,
11654,
11659,
11684,
11689,
11745,
11806,
11847,
11892,
11931,
11937,
11942,
12025,
12063,
12087,
12118,
12147,
12175,
12231,
12256,
12266,
12274,
12280,
12283,
12310,
12315,
12364,
12439,
12506,
12573,
12578,
12627,
12632,
12677,
12680,
12761,
12766,
12811,
12882,
12939,
12985,
13033,
13040,
13067,
13135,
13193,
13202,
13333,
13340,
13376,
13409,
13593,
13733,
13759,
13783,
13789,
13794,
13843,
13914,
13971,
14017,
14065,
14216,
14343,
14367,
14373,
14378,
14418,
14472,
14526,
14596,
14646,
14747,
14876,
14902,
14910,
14915,
14970,
15052,
15106,
15154,
15209,
15259,
15395,
15524,
15550,
15558,
15564,
15567,
15641,
15686,
15745,
15771,
15841,
15849,
15854,
15922,
15953,
15958,
16003,
16008,
16037,
16042,
16082,
16087,
16116,
16121,
16174,
16207,
16212,
16282,
16322,
16374,
16458,
16554,
16644,
16732,
16814,
16886,
16965,
17042,
17118,
17188,
17239,
17288,
17350,
17431,
17519,
17553,
17559,
17562,
17591,
17604,
17628,
17642,
17645,
17663,
17684,
17687,
17706,
17709,
17790,
17906,
17982,
18059,
18064,
18097,
18104,
18142,
18168,
18191,
18332,
18353,
18359,
18364,
18439,
18462,
18467,
18535,
18577,
18631,
18685,
18733,
18783,
18838,
18951,
19017,
19141,
19157,
19185,
19193,
19198,
19227,
19252,
19288,
19367,
19374,
19418,
19456,
19479,
19485,
19490,
19522,
19527,
19576,
19635,
19690,
19720,
19725,
19759,
19762,
19799,
19854,
19861,
19911,
19963,
20013,
20063,
20066,
20128,
20149,
20183,
20214,
20255,
20331,
20339,
20346,
20382,
20437,
20440,
20487,
20492,
20537,
20577,
20593,
20656,
20700,
20751,
20762,
20769,
20804,
20868,
20906,
20948,
20966,
21013,
21064,
21104,
21162,
21175,
21230,
21238,
21280,
21311,
21363,
21371,
21376,
21389,
21443,
21487,
21547,
21558,
21577,
21635,
21699,
21702,
21741,
21746,
21776,
21781,
21827,
21832,
21861,
21876,
21891,
21952,
21955,
21984,
22005,
22020,
22094,
22097,
22126,
22148,
22163,
22223,
22226,
22255,
22281,
22296,
22339,
22342,
22371,
22394,
22409,
22449,
22452,
22482,
22487,
22535,
22550,
22615,
22618,
22660,
22700,
22759,
22774,
22777,
22842,
22873,
22965,
22989,
23012,
23018,
23021,
23053,
23067,
23095,
23133,
23155,
23206,
23297,
23308,
23313,
23340,
23372,
23387,
23415,
23453,
23475,
23518,
23595,
23606,
23611,
23631,
23670,
23684,
23714,
23752,
23774,
23817,
23875,
23885,
23890,
23939,
23970,
23977,
24008,
24030,
24076,
24172,
24178,
24183,
24212,
24224,
24239,
24305,
24308,
24337,
24361,
24395,
24409,
24416,
24431,
24438,
24467,
24491,
24540,
24614,
24627,
24634,
24657,
24675,
24678,
24696,
24758,
24800,
24826,
24856,
24881,
24946,
24970,
24976,
24979,
25023,
25085,
25127,
25153,
25187,
25210,
25275,
25299,
25305,
25310,
25339,
25359,
25364,
25385,
25415,
25420,
25446,
25447,
25485,
25502,
25574,
25600,
25621,
25645,
25666,
25698,
25704,
25723,
25726,
25737,
25739,
25740,
25792,
25838,
25840,
25841,
25905,
25937,
25939,
25940,
25973,
26014,
26017,
26039,
26048,
26051,
26066,
26098,
26116,
26169,
26170,
26194,
26228,
26255,
26289,
26292,
26320,
26323,
26343,
26381,
26420,
26425,
26460,
26461,
26495,
26516,
26555,
26597,
26630,
26702,
26706,
26709,
26788,
26791,
26856,
26891,
26894,
26940,
26970,
27056,
27097,
27105,
27106,
27133,
27136,
27162,
27299,
27344,
27362,
27401,
27455,
27479,
27519,
27525,
27555,
27604,
27638,
27669,
27673,
27676,
27738,
27812,
27813,
27883,
27914,
27999,
28028,
28070,
28074,
28079,
28178,
28215,
28257,
28263,
28264,
28290,
28331,
28373,
28378,
28389,
28411,
28412,
28453,
28497,
28519,
28540,
28609,
28648,
28652,
28663,
28665,
28666,
28704,
28727,
28771,
28793,
28825,
28889,
28924,
28945,
28951,
28955,
28981,
28983,
28984,
29013,
29058,
29072,
29083,
29125,
29160,
29182,
29199,
29248,
29301,
29328,
29332,
29349,
29377,
29411,
29413,
29414,
29448,
29471,
29474,
29518,
29566,
29628,
29658,
29677,
29681,
29686,
29726,
29774,
29790,
29809,
29853,
29899,
29980,
30044,
30063,
30067,
30072,
30104,
30106,
30107,
30134,
30171,
30173,
30174,
30214,
30215,
30259,
30287,
30291,
30292,
30326,
30361,
30363,
30364,
30405,
30439,
30483,
30514,
30567,
30601,
30649,
30700,
30726,
30732,
30737,
30779,
30823,
30850,
30887,
30924,
30964,
31010,
31054,
31193,
31212,
31216,
31219,
31262,
31265,
31329,
31332,
31343,
31345,
31346,
31382,
31440,
31465,
31495,
31527,
31568,
31602,
31632,
31656,
31658,
31659,
31695,
31712,
31733,
31753,
31776,
31804,
31839,
31873,
31892,
31917,
31941,
31966,
31981,
31997,
32022,
32043,
32071,
32092,
32118,
32134,
32156,
32178,
32199,
32215,
32218,
32219,
32266,
32322,
32367,
32391,
32407,
32442,
32458,
32594,
32610,
32617,
32669,
32716,
32721,
32747,
32780,
32802,
32836,
32870,
32884,
32890,
32895,
32915,
32937,
32968,
33009,
33070,
33079,
33114,
33155,
33219,
33228,
33245,
33285,
33303,
33328,
33375,
33415,
33442,
33469,
33493,
33531,
33590,
33673,
33685,
33694,
33721,
33729,
33743,
33749,
33753,
33764,
33766,
33767,
33811,
33829,
33892,
33934,
33937,
33969,
33980,
33982,
33983,
34033,
34042,
34095,
34120,
34153,
34216,
34248,
34252,
34310,
34335,
34381,
34414,
34465,
34498,
34502,
34513,
34515,
34516,
34545,
34580,
34595,
34653,
34701,
34716,
34767,
34816,
34831,
34883,
34885,
34888,
34926,
34957,
34978,
35010,
35056,
35067,
35069,
35070,
35104,
35158,
35222,
35305,
35377,
35461,
35538,
35637,
35640,
35754,
35810,
35811,
35918,
35921,
35964,
36024,
36027,
36092,
36145,
36151,
36154,
36202,
36247,
36292,
36350,
36399,
36448,
36497,
36562,
36565,
36607,
36642,
36719,
36767,
36773,
36831,
36889,
36981,
37033,
37039,
37142,
37194,
37200,
37202,
37203,
37241,
37250,
37301,
37333,
37383,
37429,
37477,
37528,
37571,
37609,
37630,
37703,
37719,
37725,
37805,
37849,
37951,
38007,
38109,
38172,
38177,
38242,
38313,
38317,
38328,
38330,
38331,
38374,
38383,
38412,
38468,
38547,
38595,
38656,
38697,
38711,
38770,
38811,
38822,
38829,
38916,
38954,
38978,
38984,
38986,
38987,
39020,
39050,
39086,
39095,
39160,
39199,
39234,
39269,
39312,
39363,
39403,
39445,
39498,
39525,
39589,
39635,
39696,
39737,
39751,
39810,
39851,
39862,
39869,
39956,
39994,
40018,
40024,
40028,
40029,
40070,
40125,
40178,
40228,
40281,
40283,
40284,
40316,
40337,
40385,
40425,
40480,
40521,
40606,
40650,
40676,
40680,
40682,
40683,
40702,
40731,
40754,
40763,
40810,
40835,
40859,
40889,
40909,
40932,
40956,
40969,
41009,
41044,
41070,
41076,
41080,
41082,
41083,
41111,
41150,
41160,
41214,
41296,
41320,
41324,
41326,
41327,
41363,
41398,
41407,
41410,
41431,
41461,
41489,
41492,
41550,
41585,
41588,
41632,
41682,
41728,
41757,
41827,
41853,
41857,
41859,
41860,
41894,
41920,
41960,
42061,
42095,
42119,
42125,
42142,
42158,
42160,
42161,
42198,
42232,
42294,
42361,
42378,
42391,
42437,
42467,
42472,
42495,
42564,
42603,
42630,
42667,
42668,
42691,
42715,
42739,
42763,
42804,
42828,
42832,
42834,
42835,
42872,
42906,
42978,
43055,
43072,
43085,
43131,
43161,
43166,
43208,
43227,
43228,
43269,
43293,
43317,
43321,
43323,
43324,
43356,
43399,
43435,
43507,
43526,
43541,
43589,
43590,
43615,
43673,
43712,
43741,
43795,
43834,
43835,
43860,
43886,
43912,
43918,
43920,
43921,
43942,
43962,
43963,
44005,
44025,
44056,
44080,
44120,
44169,
44211,
44272,
44350,
44351,
44373,
44409,
44437,
44463,
44469,
44473,
44476,
44503,
44554,
44559,
44570,
44640,
44670,
44713,
44757,
44763,
44764,
44783,
44847,
44897,
44898,
44959,
45010,
45036,
45049,
45103,
45108,
45196,
45219,
45273,
45291,
45315,
45332,
45338,
45345,
45365,
45392,
45414,
45419,
45442,
45471,
45503,
45530,
45535,
45576,
45614,
45621,
45650,
45674,
45731,
45757,
45775,
45783,
45841,
45849,
45882,
45979,
45986,
46017,
46045,
46097,
46170,
46196,
46235,
46280,
46311,
46366,
46376,
46405,
46418,
46461,
46481,
46537,
46543,
46548,
46575,
46632,
46641,
46689,
46736,
46789,
46794,
46822,
46853,
46879,
46932,
46940,
46975,
46980,
47006,
47027,
47047,
47052,
47100,
47104,
47107,
47118,
47120,
47121,
47159,
47218,
47262,
47264,
47265,
47298,
47340,
47380,
47400,
47464,
47476,
47478,
47479,
47516,
47535,
47554,
47610,
47649,
47672,
47711,
47751,
47783,
47838,
47842,
47844,
47845,
47874,
47897,
47899,
47900,
47924,
47947,
47995,
47997,
47998,
48040,
48063,
48104,
48146,
48190,
48212,
48224,
48226,
48227,
48268,
48333,
48389,
48427,
48428,
48437,
48502,
48530,
48568,
48610,
48614,
48615,
48663,
48709,
48749,
48799,
48831,
48869,
48876,
48931,
48984,
49004,
49030,
49049,
49057,
49058,
49120,
49154,
49190,
49197,
49226,
49261,
49313,
49386,
49421,
49480,
49507,
49558,
49568,
49620,
49635,
49675,
49683,
49690,
49721,
49753,
49784,
49830,
49884,
49919,
49955,
50001,
50038,
50111,
50117,
50121,
50124,
50136,
50138,
50139,
50202,
50203,
50257,
50322,
50345,
50387,
50409,
50414,
50458,
50515,
50558,
50574,
50580,
50585,
50655,
50699,
50778,
50831,
50938,
51021,
51049,
51056,
51080,
51128,
51177,
51207,
51249,
51302,
51312,
51320,
51364,
51407,
51430,
51438,
51444,
51448,
51474,
51476,
51477,
51523,
51583,
51635,
51664,
51709,
51715,
51721,
51723,
51724,
51787,
51848,
51898,
51961,
52021,
52072,
52173,
52261,
52273,
52279,
52281,
52282,
52305,
52345,
52368,
52410,
52450,
52507,
52531,
52567,
52600,
52619,
52623,
52649,
52651,
52652,
52695,
52710,
52717,
52737,
52782,
52825,
52907,
52935,
52958,
52973,
52981,
53001,
53003,
53004,
53049,
53097,
53117,
53159,
53212,
53254,
53290,
53320,
53353,
53457,
53495,
53499,
53501,
53502,
53545,
53579,
53621,
53645,
53679,
53745,
53772,
53776,
53778,
53779,
53826,
53870,
53872,
53873,
53928,
53971,
53980,
53999,
54053,
54082,
54125,
54131,
54145,
54169,
54199,
54227,
54251,
54326,
54360,
54364,
54366,
54367,
54386,
54428,
54437,
54482,
54514,
54569,
54575,
54589,
54614,
54646,
54679,
54703,
54707,
54709,
54710,
54742,
54788,
54826,
54828,
54829,
54864,
54904,
54953,
54956,
55018,
55065,
55083,
55146,
55170,
55172,
55173,
55211,
55247,
55284,
55287,
55349,
55358,
55409,
55447,
55476,
55520,
55550,
55580,
55620,
55644,
55648,
55650,
55651,
55666,
55706,
55715,
55767,
55800,
55828,
55869,
55873,
55875,
55876,
55917,
55952,
55988,
55991,
56000,
56050,
56092,
56121,
56149,
56194,
56239,
56269,
56299,
56339,
56363,
56367,
56369,
56370,
56409,
56443,
56478,
56481,
56490,
56539,
56580,
56609,
56637,
56681,
56725,
56755,
56785,
56825,
56849,
56853,
56855,
56856,
56894,
56937,
56960,
56991,
57024,
57042,
57050,
57057,
57078,
57171,
57282,
57355,
57379,
57383,
57385,
57386,
57425,
57520,
57655,
57730,
57741,
57748,
57750,
57751,
57777,
57841,
57871,
57901,
57927,
57936,
57983,
58002,
58061,
58132,
58158,
58197,
58234,
58287,
58291,
58293,
58294,
58320,
58346,
58407,
58436,
58445,
58551,
58601,
58630,
58696,
58735,
58833,
58904,
58942,
58946,
58948,
58949,
58967,
59013,
59015,
59016,
59031,
59032,
59061,
59062,
59104,
59105,
59273,
59274,
59299,
59300,
59317,
59379,
59416,
59459,
59511,
59526,
59542,
59565,
59599,
59638,
59676,
59719,
59749,
59781,
59812
],
"line_end_idx": [
102,
103,
108,
114,
115,
186,
187,
230,
231,
296,
297,
306,
307,
337,
369,
370,
454,
455,
484,
512,
545,
575,
609,
640,
670,
705,
738,
739,
767,
768,
789,
824,
879,
941,
997,
998,
1033,
1068,
1139,
1140,
1163,
1180,
1182,
1183,
1187,
1242,
1245,
1276,
1327,
1356,
1413,
1467,
1503,
1528,
1531,
1588,
1608,
1644,
1677,
1693,
1696,
1744,
1807,
1810,
1846,
1849,
1879,
1925,
1950,
1967,
2004,
2035,
2077,
2082,
2112,
2180,
2186,
2189,
2212,
2213,
2228,
2231,
2346,
2401,
2459,
2534,
2562,
2566,
2569,
2593,
2596,
2642,
2696,
2739,
2742,
2781,
2803,
2804,
2840,
2903,
2930,
2964,
2990,
2993,
3011,
3027,
3034,
3060,
3065,
3095,
3100,
3162,
3205,
3252,
3301,
3350,
3397,
3402,
3428,
3449,
3469,
3503,
3571,
3583,
3611,
3652,
3706,
3733,
3771,
3788,
3829,
3861,
3867,
3893,
3936,
3957,
3981,
4002,
4034,
4040,
4059,
4062,
4080,
4107,
4110,
4151,
4154,
4181,
4268,
4286,
4345,
4418,
4502,
4506,
4507,
4546,
4583,
4634,
4661,
4708,
4745,
4794,
4831,
4832,
4899,
4944,
4987,
5019,
5054,
5057,
5134,
5137,
5161,
5305,
5394,
5456,
5459,
5479,
5510,
5535,
5542,
5565,
5567,
5568,
5604,
5625,
5641,
5668,
5675,
5701,
5706,
5727,
5730,
5763,
5817,
5841,
5870,
5897,
5915,
5943,
5961,
5992,
6018,
6023,
6071,
6072,
6101,
6116,
6137,
6153,
6160,
6213,
6218,
6257,
6313,
6338,
6345,
6390,
6416,
6429,
6436,
6476,
6543,
6600,
6603,
6653,
6683,
6714,
6736,
6819,
6881,
6891,
6894,
6931,
7000,
7005,
7049,
7106,
7109,
7141,
7186,
7189,
7231,
7286,
7289,
7329,
7382,
7385,
7431,
7490,
7493,
7550,
7593,
7634,
7675,
7723,
7766,
7769,
7793,
7830,
7833,
7857,
7894,
7897,
7921,
7958,
7961,
8008,
8066,
8071,
8108,
8146,
8189,
8229,
8234,
8282,
8320,
8323,
8389,
8429,
8461,
8494,
8497,
8542,
8598,
8601,
8641,
8700,
8703,
8769,
8839,
8873,
8904,
8955,
8963,
8971,
8976,
9016,
9050,
9108,
9185,
9287,
9392,
9421,
9439,
9447,
9455,
9458,
9489,
9535,
9540,
9600,
9629,
9690,
9746,
9751,
9815,
9820,
9883,
9965,
10023,
10051,
10083,
10141,
10153,
10161,
10166,
10236,
10283,
10320,
10345,
10369,
10395,
10401,
10406,
10431,
10482,
10512,
10537,
10561,
10587,
10593,
10598,
10621,
10624,
10660,
10696,
10732,
10772,
10822,
10863,
10868,
10893,
10898,
10953,
11022,
11068,
11104,
11130,
11136,
11141,
11162,
11167,
11218,
11287,
11331,
11366,
11392,
11398,
11403,
11422,
11427,
11476,
11545,
11589,
11622,
11648,
11654,
11659,
11684,
11689,
11745,
11806,
11847,
11892,
11931,
11937,
11942,
12025,
12063,
12087,
12118,
12147,
12175,
12231,
12256,
12266,
12274,
12280,
12283,
12310,
12315,
12364,
12439,
12506,
12573,
12578,
12627,
12632,
12677,
12680,
12761,
12766,
12811,
12882,
12939,
12985,
13033,
13040,
13067,
13135,
13193,
13202,
13333,
13340,
13376,
13409,
13593,
13733,
13759,
13783,
13789,
13794,
13843,
13914,
13971,
14017,
14065,
14216,
14343,
14367,
14373,
14378,
14418,
14472,
14526,
14596,
14646,
14747,
14876,
14902,
14910,
14915,
14970,
15052,
15106,
15154,
15209,
15259,
15395,
15524,
15550,
15558,
15564,
15567,
15641,
15686,
15745,
15771,
15841,
15849,
15854,
15922,
15953,
15958,
16003,
16008,
16037,
16042,
16082,
16087,
16116,
16121,
16174,
16207,
16212,
16282,
16322,
16374,
16458,
16554,
16644,
16732,
16814,
16886,
16965,
17042,
17118,
17188,
17239,
17288,
17350,
17431,
17519,
17553,
17559,
17562,
17591,
17604,
17628,
17642,
17645,
17663,
17684,
17687,
17706,
17709,
17790,
17906,
17982,
18059,
18064,
18097,
18104,
18142,
18168,
18191,
18332,
18353,
18359,
18364,
18439,
18462,
18467,
18535,
18577,
18631,
18685,
18733,
18783,
18838,
18951,
19017,
19141,
19157,
19185,
19193,
19198,
19227,
19252,
19288,
19367,
19374,
19418,
19456,
19479,
19485,
19490,
19522,
19527,
19576,
19635,
19690,
19720,
19725,
19759,
19762,
19799,
19854,
19861,
19911,
19963,
20013,
20063,
20066,
20128,
20149,
20183,
20214,
20255,
20331,
20339,
20346,
20382,
20437,
20440,
20487,
20492,
20537,
20577,
20593,
20656,
20700,
20751,
20762,
20769,
20804,
20868,
20906,
20948,
20966,
21013,
21064,
21104,
21162,
21175,
21230,
21238,
21280,
21311,
21363,
21371,
21376,
21389,
21443,
21487,
21547,
21558,
21577,
21635,
21699,
21702,
21741,
21746,
21776,
21781,
21827,
21832,
21861,
21876,
21891,
21952,
21955,
21984,
22005,
22020,
22094,
22097,
22126,
22148,
22163,
22223,
22226,
22255,
22281,
22296,
22339,
22342,
22371,
22394,
22409,
22449,
22452,
22482,
22487,
22535,
22550,
22615,
22618,
22660,
22700,
22759,
22774,
22777,
22842,
22873,
22965,
22989,
23012,
23018,
23021,
23053,
23067,
23095,
23133,
23155,
23206,
23297,
23308,
23313,
23340,
23372,
23387,
23415,
23453,
23475,
23518,
23595,
23606,
23611,
23631,
23670,
23684,
23714,
23752,
23774,
23817,
23875,
23885,
23890,
23939,
23970,
23977,
24008,
24030,
24076,
24172,
24178,
24183,
24212,
24224,
24239,
24305,
24308,
24337,
24361,
24395,
24409,
24416,
24431,
24438,
24467,
24491,
24540,
24614,
24627,
24634,
24657,
24675,
24678,
24696,
24758,
24800,
24826,
24856,
24881,
24946,
24970,
24976,
24979,
25023,
25085,
25127,
25153,
25187,
25210,
25275,
25299,
25305,
25310,
25339,
25359,
25364,
25385,
25415,
25420,
25446,
25447,
25485,
25502,
25574,
25600,
25621,
25645,
25666,
25698,
25704,
25723,
25726,
25737,
25739,
25740,
25792,
25838,
25840,
25841,
25905,
25937,
25939,
25940,
25973,
26014,
26017,
26039,
26048,
26051,
26066,
26098,
26116,
26169,
26170,
26194,
26228,
26255,
26289,
26292,
26320,
26323,
26343,
26381,
26420,
26425,
26460,
26461,
26495,
26516,
26555,
26597,
26630,
26702,
26706,
26709,
26788,
26791,
26856,
26891,
26894,
26940,
26970,
27056,
27097,
27105,
27106,
27133,
27136,
27162,
27299,
27344,
27362,
27401,
27455,
27479,
27519,
27525,
27555,
27604,
27638,
27669,
27673,
27676,
27738,
27812,
27813,
27883,
27914,
27999,
28028,
28070,
28074,
28079,
28178,
28215,
28257,
28263,
28264,
28290,
28331,
28373,
28378,
28389,
28411,
28412,
28453,
28497,
28519,
28540,
28609,
28648,
28652,
28663,
28665,
28666,
28704,
28727,
28771,
28793,
28825,
28889,
28924,
28945,
28951,
28955,
28981,
28983,
28984,
29013,
29058,
29072,
29083,
29125,
29160,
29182,
29199,
29248,
29301,
29328,
29332,
29349,
29377,
29411,
29413,
29414,
29448,
29471,
29474,
29518,
29566,
29628,
29658,
29677,
29681,
29686,
29726,
29774,
29790,
29809,
29853,
29899,
29980,
30044,
30063,
30067,
30072,
30104,
30106,
30107,
30134,
30171,
30173,
30174,
30214,
30215,
30259,
30287,
30291,
30292,
30326,
30361,
30363,
30364,
30405,
30439,
30483,
30514,
30567,
30601,
30649,
30700,
30726,
30732,
30737,
30779,
30823,
30850,
30887,
30924,
30964,
31010,
31054,
31193,
31212,
31216,
31219,
31262,
31265,
31329,
31332,
31343,
31345,
31346,
31382,
31440,
31465,
31495,
31527,
31568,
31602,
31632,
31656,
31658,
31659,
31695,
31712,
31733,
31753,
31776,
31804,
31839,
31873,
31892,
31917,
31941,
31966,
31981,
31997,
32022,
32043,
32071,
32092,
32118,
32134,
32156,
32178,
32199,
32215,
32218,
32219,
32266,
32322,
32367,
32391,
32407,
32442,
32458,
32594,
32610,
32617,
32669,
32716,
32721,
32747,
32780,
32802,
32836,
32870,
32884,
32890,
32895,
32915,
32937,
32968,
33009,
33070,
33079,
33114,
33155,
33219,
33228,
33245,
33285,
33303,
33328,
33375,
33415,
33442,
33469,
33493,
33531,
33590,
33673,
33685,
33694,
33721,
33729,
33743,
33749,
33753,
33764,
33766,
33767,
33811,
33829,
33892,
33934,
33937,
33969,
33980,
33982,
33983,
34033,
34042,
34095,
34120,
34153,
34216,
34248,
34252,
34310,
34335,
34381,
34414,
34465,
34498,
34502,
34513,
34515,
34516,
34545,
34580,
34595,
34653,
34701,
34716,
34767,
34816,
34831,
34883,
34885,
34888,
34926,
34957,
34978,
35010,
35056,
35067,
35069,
35070,
35104,
35158,
35222,
35305,
35377,
35461,
35538,
35637,
35640,
35754,
35810,
35811,
35918,
35921,
35964,
36024,
36027,
36092,
36145,
36151,
36154,
36202,
36247,
36292,
36350,
36399,
36448,
36497,
36562,
36565,
36607,
36642,
36719,
36767,
36773,
36831,
36889,
36981,
37033,
37039,
37142,
37194,
37200,
37202,
37203,
37241,
37250,
37301,
37333,
37383,
37429,
37477,
37528,
37571,
37609,
37630,
37703,
37719,
37725,
37805,
37849,
37951,
38007,
38109,
38172,
38177,
38242,
38313,
38317,
38328,
38330,
38331,
38374,
38383,
38412,
38468,
38547,
38595,
38656,
38697,
38711,
38770,
38811,
38822,
38829,
38916,
38954,
38978,
38984,
38986,
38987,
39020,
39050,
39086,
39095,
39160,
39199,
39234,
39269,
39312,
39363,
39403,
39445,
39498,
39525,
39589,
39635,
39696,
39737,
39751,
39810,
39851,
39862,
39869,
39956,
39994,
40018,
40024,
40028,
40029,
40070,
40125,
40178,
40228,
40281,
40283,
40284,
40316,
40337,
40385,
40425,
40480,
40521,
40606,
40650,
40676,
40680,
40682,
40683,
40702,
40731,
40754,
40763,
40810,
40835,
40859,
40889,
40909,
40932,
40956,
40969,
41009,
41044,
41070,
41076,
41080,
41082,
41083,
41111,
41150,
41160,
41214,
41296,
41320,
41324,
41326,
41327,
41363,
41398,
41407,
41410,
41431,
41461,
41489,
41492,
41550,
41585,
41588,
41632,
41682,
41728,
41757,
41827,
41853,
41857,
41859,
41860,
41894,
41920,
41960,
42061,
42095,
42119,
42125,
42142,
42158,
42160,
42161,
42198,
42232,
42294,
42361,
42378,
42391,
42437,
42467,
42472,
42495,
42564,
42603,
42630,
42667,
42668,
42691,
42715,
42739,
42763,
42804,
42828,
42832,
42834,
42835,
42872,
42906,
42978,
43055,
43072,
43085,
43131,
43161,
43166,
43208,
43227,
43228,
43269,
43293,
43317,
43321,
43323,
43324,
43356,
43399,
43435,
43507,
43526,
43541,
43589,
43590,
43615,
43673,
43712,
43741,
43795,
43834,
43835,
43860,
43886,
43912,
43918,
43920,
43921,
43942,
43962,
43963,
44005,
44025,
44056,
44080,
44120,
44169,
44211,
44272,
44350,
44351,
44373,
44409,
44437,
44463,
44469,
44473,
44476,
44503,
44554,
44559,
44570,
44640,
44670,
44713,
44757,
44763,
44764,
44783,
44847,
44897,
44898,
44959,
45010,
45036,
45049,
45103,
45108,
45196,
45219,
45273,
45291,
45315,
45332,
45338,
45345,
45365,
45392,
45414,
45419,
45442,
45471,
45503,
45530,
45535,
45576,
45614,
45621,
45650,
45674,
45731,
45757,
45775,
45783,
45841,
45849,
45882,
45979,
45986,
46017,
46045,
46097,
46170,
46196,
46235,
46280,
46311,
46366,
46376,
46405,
46418,
46461,
46481,
46537,
46543,
46548,
46575,
46632,
46641,
46689,
46736,
46789,
46794,
46822,
46853,
46879,
46932,
46940,
46975,
46980,
47006,
47027,
47047,
47052,
47100,
47104,
47107,
47118,
47120,
47121,
47159,
47218,
47262,
47264,
47265,
47298,
47340,
47380,
47400,
47464,
47476,
47478,
47479,
47516,
47535,
47554,
47610,
47649,
47672,
47711,
47751,
47783,
47838,
47842,
47844,
47845,
47874,
47897,
47899,
47900,
47924,
47947,
47995,
47997,
47998,
48040,
48063,
48104,
48146,
48190,
48212,
48224,
48226,
48227,
48268,
48333,
48389,
48427,
48428,
48437,
48502,
48530,
48568,
48610,
48614,
48615,
48663,
48709,
48749,
48799,
48831,
48869,
48876,
48931,
48984,
49004,
49030,
49049,
49057,
49058,
49120,
49154,
49190,
49197,
49226,
49261,
49313,
49386,
49421,
49480,
49507,
49558,
49568,
49620,
49635,
49675,
49683,
49690,
49721,
49753,
49784,
49830,
49884,
49919,
49955,
50001,
50038,
50111,
50117,
50121,
50124,
50136,
50138,
50139,
50202,
50203,
50257,
50322,
50345,
50387,
50409,
50414,
50458,
50515,
50558,
50574,
50580,
50585,
50655,
50699,
50778,
50831,
50938,
51021,
51049,
51056,
51080,
51128,
51177,
51207,
51249,
51302,
51312,
51320,
51364,
51407,
51430,
51438,
51444,
51448,
51474,
51476,
51477,
51523,
51583,
51635,
51664,
51709,
51715,
51721,
51723,
51724,
51787,
51848,
51898,
51961,
52021,
52072,
52173,
52261,
52273,
52279,
52281,
52282,
52305,
52345,
52368,
52410,
52450,
52507,
52531,
52567,
52600,
52619,
52623,
52649,
52651,
52652,
52695,
52710,
52717,
52737,
52782,
52825,
52907,
52935,
52958,
52973,
52981,
53001,
53003,
53004,
53049,
53097,
53117,
53159,
53212,
53254,
53290,
53320,
53353,
53457,
53495,
53499,
53501,
53502,
53545,
53579,
53621,
53645,
53679,
53745,
53772,
53776,
53778,
53779,
53826,
53870,
53872,
53873,
53928,
53971,
53980,
53999,
54053,
54082,
54125,
54131,
54145,
54169,
54199,
54227,
54251,
54326,
54360,
54364,
54366,
54367,
54386,
54428,
54437,
54482,
54514,
54569,
54575,
54589,
54614,
54646,
54679,
54703,
54707,
54709,
54710,
54742,
54788,
54826,
54828,
54829,
54864,
54904,
54953,
54956,
55018,
55065,
55083,
55146,
55170,
55172,
55173,
55211,
55247,
55284,
55287,
55349,
55358,
55409,
55447,
55476,
55520,
55550,
55580,
55620,
55644,
55648,
55650,
55651,
55666,
55706,
55715,
55767,
55800,
55828,
55869,
55873,
55875,
55876,
55917,
55952,
55988,
55991,
56000,
56050,
56092,
56121,
56149,
56194,
56239,
56269,
56299,
56339,
56363,
56367,
56369,
56370,
56409,
56443,
56478,
56481,
56490,
56539,
56580,
56609,
56637,
56681,
56725,
56755,
56785,
56825,
56849,
56853,
56855,
56856,
56894,
56937,
56960,
56991,
57024,
57042,
57050,
57057,
57078,
57171,
57282,
57355,
57379,
57383,
57385,
57386,
57425,
57520,
57655,
57730,
57741,
57748,
57750,
57751,
57777,
57841,
57871,
57901,
57927,
57936,
57983,
58002,
58061,
58132,
58158,
58197,
58234,
58287,
58291,
58293,
58294,
58320,
58346,
58407,
58436,
58445,
58551,
58601,
58630,
58696,
58735,
58833,
58904,
58942,
58946,
58948,
58949,
58967,
59013,
59015,
59016,
59031,
59032,
59061,
59062,
59104,
59105,
59273,
59274,
59299,
59300,
59317,
59379,
59416,
59459,
59511,
59526,
59542,
59565,
59599,
59638,
59676,
59719,
59749,
59781,
59812,
59833
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 59833,
"ccnet_original_nlines": 1898,
"rps_doc_curly_bracket": 0.012568320147693157,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11266531050205231,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03153610974550247,
"rps_doc_frac_lines_end_with_ellipsis": 0.0010531899752095342,
"rps_doc_frac_no_alph_words": 0.570956289768219,
"rps_doc_frac_unique_words": 0.25550076365470886,
"rps_doc_mean_word_length": 6.162367343902588,
"rps_doc_num_sentences": 523,
"rps_doc_symbol_to_word_ratio": 0.003179040038958192,
"rps_doc_unigram_entropy": 5.938302993774414,
"rps_doc_word_count": 5272,
"rps_doc_frac_chars_dupe_10grams": 0.07756710052490234,
"rps_doc_frac_chars_dupe_5grams": 0.19678035378456116,
"rps_doc_frac_chars_dupe_6grams": 0.16073626279830933,
"rps_doc_frac_chars_dupe_7grams": 0.13266436755657196,
"rps_doc_frac_chars_dupe_8grams": 0.10394606739282608,
"rps_doc_frac_chars_dupe_9grams": 0.0906180664896965,
"rps_doc_frac_chars_top_2gram": 0.007633590139448643,
"rps_doc_frac_chars_top_3gram": 0.008187640458345413,
"rps_doc_frac_chars_top_4gram": 0.005201919935643673,
"rps_doc_books_importance": -7948.16259765625,
"rps_doc_books_importance_length_correction": -7948.16259765625,
"rps_doc_openwebtext_importance": -4032.631591796875,
"rps_doc_openwebtext_importance_length_correction": -4032.631591796875,
"rps_doc_wikipedia_importance": -2052.081298828125,
"rps_doc_wikipedia_importance_length_correction": -2052.081298828125
},
"fasttext": {
"dclm": 0.9794646501541138,
"english": 0.27619245648384094,
"fineweb_edu_approx": 2.290093421936035,
"eai_general_math": 0.6804405450820923,
"eai_open_web_math": 0.1251612901687622,
"eai_web_code": 0.920011043548584
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.136",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-702,960,036,330,485,800
|
in ,
Mining cryptocurrencies in the cloud. What is cloud mining?
Hashtoro 880x400 1
Cryptocurrency mining is a process that allows you to verify transactions, add new information to the database (blockchain) and introduce new coins into circulation. Mining is important as it enables cryptocurrencies to operate as a decentralized peer-to-peer network.
This is a similar concept to mining gold or any other metal as Bitcoin "exists in the software" and must therefore be "discovered". This is thanks to specialized mining equipment (miners) that solve the encryption tasks and then deliver the cryptocurrency.
Cryptocurrency mining in the cloud is a service that has shared computing capabilities and is performed from a remote server center. Therefore, cloud mining allows any user around the world to mine Bitcoin or any other cryptocurrency that can be mined without operating or investing in cryptocurrency mining hardware.
The cost of mining cryptocurrency can be very highespecially when it comes to bitcoin mining. As the largest and most popular cryptocurrency in the world, Bitcoin also has the largest mining community. The market is so competitive that no one can actually mine BTC on their own, for example using their own CPU or graphics card. This was only possible in the early stages of cryptocurrency development.
Currently, cryptocurrency miners use professional cryptocurrency mining equipment, usually worth over several dozen thousand zlotys. We haven't even mentioned the enormous cost of electricity that is necessary for the operation of cryptocurrency miners.
Digging on your own is therefore very expensive and hardly anyone can afford to buy such expensive equipment that would be effective.
The situation is not improved by the fact of very expensive and inaccessible graphics cards.
Cloud computing is one of the fastest growing trends, it gives access to all types of computing services such as storage, databases, servers and software. For computers, smartphones or tablets for cloud mining, you only need to be connected to the Internet when ordering services.
Basically Cloud mining is about investing certain resources in companies that own mining equipment (ie excavators). The company calculates how much hashing energy users can get from the investment and pays the equivalent of a specified amount of BTC. It also means that the user's investment in the purchase of mining rights is to maintain the equipment, cover the mining costs and service technicians.
The amount of user investment depends on the contract they choose, as cloud mining companies offer a variety of options that can meet the needs and capabilities of almost all potential stakeholders.
What do you think?
Comments
Leave a Reply
Loading…
0
Veteran
Written by admin
Content AuthorGallery MakerStory MakerImage MakerVideo MakerYears Of MembershipEmoji AddictUp / Down Voter
611978933905399251370387006030423662788608n
It got a little bit of dust because the window from the street
Bitcoin 800x533 L 1610388554
Bitcoin will hit its highest price ever. This will happen after reaching a new bottom
|
{
"url": "https://porytka.com/en/news/kopanie-krypto-walut-w-chmurze-czym-jest-cloud-mining/",
"source_domain": "porytka.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "233584",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RS5WHR2CYYUPU32VPMEKH4ZSFYSUIFN6",
"WARC-Concurrent-To": "<urn:uuid:f19464df-a446-4cc1-ae44-730119ce341f>",
"WARC-Date": "2023-10-04T16:58:10Z",
"WARC-IP-Address": "134.122.52.222",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:D35LWKBHIRX466SPLYY7A6Z66ID533B2",
"WARC-Record-ID": "<urn:uuid:860ec701-5c97-471e-a727-dba38ce0945f>",
"WARC-Target-URI": "https://porytka.com/en/news/kopanie-krypto-walut-w-chmurze-czym-jest-cloud-mining/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:400e975f-c360-4a26-9658-ad4686d9892e>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-48\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,
5,
6,
66,
67,
86,
87,
356,
357,
614,
615,
933,
934,
1337,
1338,
1592,
1593,
1727,
1728,
1821,
1822,
2103,
2104,
2507,
2508,
2707,
2708,
2727,
2728,
2737,
2738,
2752,
2753,
2762,
2763,
2765,
2773,
2774,
2791,
2792,
2899,
2943,
2944,
3007,
3008,
3037,
3038
],
"line_end_idx": [
5,
6,
66,
67,
86,
87,
356,
357,
614,
615,
933,
934,
1337,
1338,
1592,
1593,
1727,
1728,
1821,
1822,
2103,
2104,
2507,
2508,
2707,
2708,
2727,
2728,
2737,
2738,
2752,
2753,
2762,
2763,
2765,
2773,
2774,
2791,
2792,
2899,
2943,
2944,
3007,
3008,
3037,
3038,
3123
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3123,
"ccnet_original_nlines": 46,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43151968717575073,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0075046899728477,
"rps_doc_frac_lines_end_with_ellipsis": 0.021276600658893585,
"rps_doc_frac_no_alph_words": 0.10318949073553085,
"rps_doc_frac_unique_words": 0.5178197026252747,
"rps_doc_mean_word_length": 5.387840747833252,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0.0018761700484901667,
"rps_doc_unigram_entropy": 4.988202095031738,
"rps_doc_word_count": 477,
"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.011673149652779102,
"rps_doc_frac_chars_top_3gram": 0.0077820997685194016,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -212.94602966308594,
"rps_doc_books_importance_length_correction": -212.94602966308594,
"rps_doc_openwebtext_importance": -127.13297271728516,
"rps_doc_openwebtext_importance_length_correction": -127.13297271728516,
"rps_doc_wikipedia_importance": -100.3814697265625,
"rps_doc_wikipedia_importance_length_correction": -100.3814697265625
},
"fasttext": {
"dclm": 0.16359561681747437,
"english": 0.9437878131866455,
"fineweb_edu_approx": 2.3093554973602295,
"eai_general_math": 0.030108269304037094,
"eai_open_web_math": 0.08901680260896683,
"eai_web_code": 0.0031831299420446157
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "332.8",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,031,006,348,910,148,000
|
×
Welcome to the Slashdot Beta site -- learn more here. Use the link in the footer or click here to return to the Classic version of Slashdot.
Comments
top
Comcast Turning Chicago Homes Into Xfinity Hotspots
profplump Re:So what happens (253 comments)
So if you lease a car the owner is entitled to run it whenever they want so long as they compensate you for gas? Or to install advertising on it? If not, why can the cable company do the same thing with the modem you lease from them?
about a week ago
top
Comcast Turning Chicago Homes Into Xfinity Hotspots
profplump Re:So what happens (253 comments)
I agree it's unlikely that these routers are being configured with a second public IP. But since Comcast controls the upstream network they don't need one -- they just eventually need to NAT before routing you to the Internet. Which they are interested in doing because they aren't running a portal/auth on all these individual routers -- they're forwarding all the related traffic to a central pool and dealing with it there.
about a week ago
top
Comcast Turning Chicago Homes Into Xfinity Hotspots
profplump Re:So what happens (253 comments)
It would make for the same routing rules in any machine with 3 or more logical interfaces (i.e. most non-SOHO routers). And a relatively simple configuration at that, as the routes are completely isolated at the IP layer.
about a week ago
top
Bitcoin Exchange Flexcoin Wiped Out By Theft
profplump Re:Centralized theft registry as a solution? (698 comments)
BitCoin already works perfectly fine with offline, encrypted wallets. It's just that people keep putting their coins into these unsecured, uninsured exchanges.
about a week ago
top
Pro-Vaccination Efforts May Be Scaring Wary Parents From Shots
profplump Re:Solution - Face-saving way out (481 comments)
We seem to be okay with the mandate to feed children, and to provide at least a minimum level of medical care for them, even against the wishes of their parents. It's not clear how vaccinations are fundamentally different from those existing mandates.
Plus we have a long history of promoting public health over individual freedom in a whole slew of contexts, sometimes including confinement.
about a week ago
top
Pro-Vaccination Efforts May Be Scaring Wary Parents From Shots
profplump Re:Solution - Face-saving way out (481 comments)
What part of the constitution allows parents to compel their children not to get vaccinated (or to get vaccinated, for that matter)? If we're going to talk about this in terms of individual freedom, shouldn't we consider the individuals actually affected?
about a week ago
top
The Science of Solitary Confinement
profplump Re:isn't it used on violent prisoners? (326 comments)
So maybe we shouldn't create situations where members of society have nothing to lose? It's bad enough that such situations might arise in the world at large -- we certainly don't have to create them as a matter of law.
about two weeks ago
top
Apple Urges Arizona Governor To Veto Anti-Gay Legislation
profplump Re:Is it ok to refuse service to a class of people (917 comments)
A) They're not discriminating against people who hold a permit, just people currently exercising it -- you have a right to defecate, but I bet you'll only eat at restaurants who throw out people who do it on the table.
B) Your gun is not a person and cannot itself be discriminated against
C) Anti-discrimination laws only apply to immutable and difficult-to-change attributes; you can easily disarm yourself and suffer no direct harm as a result
about two weeks ago
top
Apple Urges Arizona Governor To Veto Anti-Gay Legislation
profplump Re:Two different things here.... (917 comments)
The only restrictions in the AZ law are that the interaction cannot be trivial or technical. Those two terms are not well defined, and would probably need to be settled via case law. I'd like to think that a PoS transaction is pretty trivial, but it's hard to say what a court would decide.
But honestly it doesn't matter. The line isn't (or at least shouldn't be) "how involved the seller feels" it's "are you offering services to the public". If you're offering services to the public, you must serve the entire public, even the parts you disapprove of. If you only offer services to members then you don't have to worry about these rules. As such a pastor who only performs ceremonies for members of his church is free to discriminate as he sees fit, but a for-rent chapel that's open to the public would not be in a position to refuse.
Please stop pretending this is a new and open question -- it's been settled both legislatively and in the courts for decades, and the only difference here is the specific group being discriminated against. You either know that and are trolling, or you're not informed enough to participate in the debate.
about two weeks ago
top
Apple Urges Arizona Governor To Veto Anti-Gay Legislation
profplump Re:First blacks, (917 comments)
You can choose who you serve without interference from the government, even if you want to exclude protected classes. You just can't claim to be open to the public while refusing service to certain groups -- either you serve the entire public, or you're a members-only club.
about two weeks ago
top
Apple SSL Bug In iOS Also Affects OS X
profplump Re:in other words (140 comments)
Because bugs exist testing must not?
about two weeks ago
top
Amazon Coins and How the Definition of 'Crypto-Currency' Is Getting Too Loose
profplump Re:Do we care? (115 comments)
In my experience, 'classic' paper currencies follow this general pattern: 1) you obtain them from a bank, 2) you pass it to another user, and 3) that other user brings it back to the bank.
Certainly you can use cash in other ways, but but you *can* use gift cards in other ways. Or you can barter with stamps and rocks. There isn't anything special about paper money that lets it be pass more anonymously than other valuable goods (or electronic records of value) -- it's just more efficient because it's more liquid.
about three weeks ago
top
Government Secrecy Spurs $4 Million Lawsuit Over Simple 'No Fly' List Error
profplump Re:OK - I'll be that guy. (239 comments)
I know. The willful obstruction of justice isn't important. And even if it was, we don't have to worry because they'd never do that to a citizen. I know the summary and article note how a US citizen was also denied travel, but I'm sure there was a good reason for that too, that we don't need to understand.
I'm not sure why we're even talking about this -- it's not like Canadians are human beings in the first place
about a month ago
top
Government Secrecy Spurs $4 Million Lawsuit Over Simple 'No Fly' List Error
profplump Re:Large damages should be paid (239 comments)
Exactly. And we all know that the one thing that defines human beings and their rights is the geographic coordinates of their mother at the time of their birth. If you're unhappy with the situation there's really no one to blame but her -- if she cared about you having rights she would have found some way to get her vagina inside the US border before squeezing you out.
about a month ago
top
FCC Wants To Trial Shift From Analog Phone Networks To Digital
profplump Re:It's Like The Last Piece Of Technology That Wor (218 comments)
I've experienced two different kinds of call mis-routing on POTS. The first is where my phone rings, but there are actually two other parties connected to the call, and no one can hear me. This is almost certainly a signaling failure at the electrical level, which doesn't have an equivalent failure mode under VoIP. (VoIP *has* failure modes related to electrical misconnection, but they don't cause the same error). To the best of my knowledge, no fire was related to this failure (certainly nothing at my end caught fire).
The other failure mode is almost certainly related to the in-band command signaling I was complaining about and you were defending, wherein the number I dial is not the endpoint to which I am connected. I don't mean "I misdialed" or even "the computer at the remote end of my call failed to decode my in-call DTMF signaling" I mean "my auto-dialer sent DTMF and I got connected to a different number than the one represented by the tones I played on the line".
And the failure of DTMF in-call is also in issue with POTS, whether you believe it or not. I agree, it's not something POTS was designed to deal with, but it is something that is actually used in the real world that POTS does not handle cleanly and has no capability to improve its reliability. If you want to convince end users around the world that they should not require the use of DTMF signaling because it's unreliable over POTS be my guest, but arguing that it's not useful just because POTS wasn't designed for it is like arguing that electricity is not useful just because steam locomotives were not designed for it.
about a month ago
top
FCC Wants To Trial Shift From Analog Phone Networks To Digital
profplump Re:It's Like The Last Piece Of Technology That Wor (218 comments)
Really, because my POTS line goes down every couple of months, sometimes mis-routes calls, only supports in-band DTMF signaling, and often has lower quality audio than my VoIP line.
It's almost like the underlying signaling technology is not the sole determining factor in quality of service, and there are a number of ways to meet (or fail to meet) desired service goals. But I know that's a silly idea -- we know from history that older == more robust, just like older cars start better in cold weather and older flashlights need fewer batteries.
about a month ago
top
Should Self-Driving Cars Chauffeur Shopping 'Whales' For Free?
profplump Re:automated transportation is "un-American" (213 comments)
A) We already have that in many places. For example, toll roads and pay-to-use-carpool-lane systems. Such things have existed for a long time. You might not think they're a good idea, but they're hardly a new trend.
B) You're assuming it's not possible to build "enough" infrastructure to provide basic transportation so travel will be impractical without excessive usage fees. That doesn't reflect the status quo, and it's not clear why changing the way vehicles are piloted would reduce the amount of road infrastructure we can afford for public, free usage.
C) If you can trust cars to do what they are told (or what they collectively agree to do) you need way less infrastructure for the same amount of traffic. For example, there's no reason to have directional lanes or traffic lights. So even without building anything new traffic would be expected to decrease in the system you describe, at least until the growth in number of vehicles in use catches back up.
about a month and a half ago
top
Should Self-Driving Cars Chauffeur Shopping 'Whales' For Free?
profplump Re:The Economics of self driving cars (213 comments)
Exactly. Just like we hold airline passengers responsible for crashes.
Wait, I forgot that we're all pretending there's no analogy for liability and accident investigation for automated vehicles. Because planes are still controlled by WWII vets yanking on cables.
about a month and a half ago
top
Revolutionary Scuba Mask Creates Breathable Oxygen Underwater On Its Own
profplump Re:Pure Oxygen? (375 comments)
You need about 0.2 ATM oxygen partial pressure at more or less any altitude. So even at the surface this thing would need other gasses to keep you healthy. If it's got some sort of gas segregation technology it's possible to build a re-breather system that mostly re-uses the non-oxygen, non-CO2 gasses, but that's not a trivial task even if you have a readily available supply of oxygen.
about 2 months ago
Submissions
profplump hasn't submitted any stories.
Journals
profplump has no journal entries.
Slashdot Account
Need an Account?
Forgot your password?
Don't worry, we never post anything without your permission.
Submission Text Formatting Tips
We support a small subset of HTML, namely these tags:
• b
• i
• p
• br
• a
• ol
• ul
• li
• dl
• dt
• dd
• em
• strong
• tt
• blockquote
• div
• quote
• ecode
"ecode" can be used for code snippets, for example:
<ecode> while(1) { do_something(); } </ecode>
Create a Slashdot Account
Loading...
|
{
"url": "http://beta.slashdot.org/~profplump",
"source_domain": "beta.slashdot.org",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "68099",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7MD3D4GTPHOP4Y4DZGKOSUCERGRQDUQT",
"WARC-Concurrent-To": "<urn:uuid:c8b82a8b-8c69-4c08-83df-53b40b61f7cb>",
"WARC-Date": "2014-03-11T22:18:47Z",
"WARC-IP-Address": "216.34.181.43",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:44GT2W73QGK5HU6JQFRCE3WSND4RNW73",
"WARC-Record-ID": "<urn:uuid:d4f3f962-53cb-40f6-9a3d-34b30a5db129>",
"WARC-Target-URI": "http://beta.slashdot.org/~profplump",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:78514d7b-2836-4bc1-a489-4041555da0d5>"
},
"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,
2,
3,
144,
145,
154,
155,
159,
160,
212,
213,
257,
258,
492,
493,
510,
514,
515,
567,
568,
612,
613,
1040,
1041,
1058,
1062,
1063,
1115,
1116,
1160,
1161,
1383,
1384,
1401,
1405,
1406,
1451,
1452,
1522,
1523,
1683,
1684,
1701,
1705,
1706,
1769,
1770,
1829,
1830,
2082,
2083,
2224,
2225,
2242,
2246,
2247,
2310,
2311,
2370,
2371,
2627,
2628,
2645,
2649,
2650,
2686,
2687,
2751,
2752,
2972,
2973,
2993,
2997,
2998,
3056,
3057,
3133,
3134,
3353,
3354,
3425,
3426,
3583,
3584,
3604,
3608,
3609,
3667,
3668,
3726,
3727,
4018,
4019,
4568,
4569,
4874,
4875,
4895,
4899,
4900,
4958,
4959,
5001,
5002,
5277,
5278,
5298,
5302,
5303,
5342,
5343,
5386,
5387,
5424,
5425,
5445,
5449,
5450,
5528,
5529,
5569,
5570,
5759,
5760,
6089,
6090,
6112,
6116,
6117,
6193,
6194,
6245,
6246,
6554,
6555,
6665,
6666,
6684,
6688,
6689,
6765,
6766,
6823,
6824,
7196,
7197,
7215,
7219,
7220,
7283,
7284,
7360,
7361,
7887,
7888,
8349,
8350,
8976,
8977,
8995,
8999,
9000,
9063,
9064,
9140,
9141,
9323,
9324,
9691,
9692,
9710,
9714,
9715,
9778,
9779,
9849,
9850,
10066,
10067,
10412,
10413,
10820,
10821,
10850,
10854,
10855,
10918,
10919,
10982,
10983,
11054,
11055,
11248,
11249,
11278,
11282,
11283,
11356,
11357,
11398,
11399,
11788,
11789,
11808,
11809,
11821,
11822,
11862,
11863,
11872,
11873,
11907,
11908,
11925,
11926,
11943,
11944,
11966,
11967,
12028,
12029,
12061,
12062,
12116,
12117,
12123,
12129,
12135,
12142,
12148,
12155,
12162,
12169,
12176,
12183,
12190,
12197,
12208,
12215,
12230,
12238,
12248,
12258,
12259,
12311,
12312,
12361,
12387,
12388
],
"line_end_idx": [
2,
3,
144,
145,
154,
155,
159,
160,
212,
213,
257,
258,
492,
493,
510,
514,
515,
567,
568,
612,
613,
1040,
1041,
1058,
1062,
1063,
1115,
1116,
1160,
1161,
1383,
1384,
1401,
1405,
1406,
1451,
1452,
1522,
1523,
1683,
1684,
1701,
1705,
1706,
1769,
1770,
1829,
1830,
2082,
2083,
2224,
2225,
2242,
2246,
2247,
2310,
2311,
2370,
2371,
2627,
2628,
2645,
2649,
2650,
2686,
2687,
2751,
2752,
2972,
2973,
2993,
2997,
2998,
3056,
3057,
3133,
3134,
3353,
3354,
3425,
3426,
3583,
3584,
3604,
3608,
3609,
3667,
3668,
3726,
3727,
4018,
4019,
4568,
4569,
4874,
4875,
4895,
4899,
4900,
4958,
4959,
5001,
5002,
5277,
5278,
5298,
5302,
5303,
5342,
5343,
5386,
5387,
5424,
5425,
5445,
5449,
5450,
5528,
5529,
5569,
5570,
5759,
5760,
6089,
6090,
6112,
6116,
6117,
6193,
6194,
6245,
6246,
6554,
6555,
6665,
6666,
6684,
6688,
6689,
6765,
6766,
6823,
6824,
7196,
7197,
7215,
7219,
7220,
7283,
7284,
7360,
7361,
7887,
7888,
8349,
8350,
8976,
8977,
8995,
8999,
9000,
9063,
9064,
9140,
9141,
9323,
9324,
9691,
9692,
9710,
9714,
9715,
9778,
9779,
9849,
9850,
10066,
10067,
10412,
10413,
10820,
10821,
10850,
10854,
10855,
10918,
10919,
10982,
10983,
11054,
11055,
11248,
11249,
11278,
11282,
11283,
11356,
11357,
11398,
11399,
11788,
11789,
11808,
11809,
11821,
11822,
11862,
11863,
11872,
11873,
11907,
11908,
11925,
11926,
11943,
11944,
11966,
11967,
12028,
12029,
12061,
12062,
12116,
12117,
12123,
12129,
12135,
12142,
12148,
12155,
12162,
12169,
12176,
12183,
12190,
12197,
12208,
12215,
12230,
12238,
12248,
12258,
12259,
12311,
12312,
12361,
12387,
12388,
12398
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12398,
"ccnet_original_nlines": 248,
"rps_doc_curly_bracket": 0.00016132000018842518,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41003862023353577,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021235520020127296,
"rps_doc_frac_lines_end_with_ellipsis": 0.0040160599164664745,
"rps_doc_frac_no_alph_words": 0.16679537296295166,
"rps_doc_frac_unique_words": 0.3785988390445709,
"rps_doc_mean_word_length": 4.67466402053833,
"rps_doc_num_sentences": 90,
"rps_doc_symbol_to_word_ratio": 0.0007722000009380281,
"rps_doc_unigram_entropy": 5.925922870635986,
"rps_doc_word_count": 2084,
"rps_doc_frac_chars_dupe_10grams": 0.13118456304073334,
"rps_doc_frac_chars_dupe_5grams": 0.15120099484920502,
"rps_doc_frac_chars_dupe_6grams": 0.13816465437412262,
"rps_doc_frac_chars_dupe_7grams": 0.13570109009742737,
"rps_doc_frac_chars_dupe_8grams": 0.13570109009742737,
"rps_doc_frac_chars_dupe_9grams": 0.13118456304073334,
"rps_doc_frac_chars_top_2gram": 0.011086019687354565,
"rps_doc_frac_chars_top_3gram": 0.006158899981528521,
"rps_doc_frac_chars_top_4gram": 0.008006569929420948,
"rps_doc_books_importance": -1265.8851318359375,
"rps_doc_books_importance_length_correction": -1265.8851318359375,
"rps_doc_openwebtext_importance": -780.9076538085938,
"rps_doc_openwebtext_importance_length_correction": -780.9076538085938,
"rps_doc_wikipedia_importance": -589.9512939453125,
"rps_doc_wikipedia_importance_length_correction": -589.9512939453125
},
"fasttext": {
"dclm": 0.3359221816062927,
"english": 0.9491603970527649,
"fineweb_edu_approx": 1.50617253780365,
"eai_general_math": 0.1683691143989563,
"eai_open_web_math": 0.17349761724472046,
"eai_web_code": 0.026562150567770004
}
}
|
{
"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": "340",
"labels": {
"level_1": "Social sciences",
"level_2": "Law",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,634,388,063,574,300,000
|
VB.NET vs. C#: 效率直击
从效率上看，是不是所有的.NET语言都拥有同样的执行效率呢？这里的答案可能使你惊讶。来看看Lamont Adams 从深层次代码分析得到的结果。
VB.NET vs. C#, round 2: Pounding on performance
Dec 3, 2001
Lamont Adams
Author's Bio | E-Mail | Archive
If there's one property that all new technologies share as they pass through their infancy, it's an excess of questions about them. Judging by the number of questions we received in response to our recent article "The three-million-programmer question: VB.NET or C#?," Microsoft's new .NET development framework is no different.
Hence, we decided to launch a new Developer Republic column, .NET Answers. Aside from using this space to challenge English punctuation rules on a regular basis, I hope to answer your questions about .NET development. So if you have a question about Microsoft's new development platform, send it my way. I'll take my best shot at it.
We received our inaugural question from member Vladimir Srecovic, from Yugoslavia, in response to the article referenced above. Vladimir has a question about performance.
C# performance benchmarking
Q: I've seen reports that C#-produced IL (Intermediate Language) code runs faster than VB.NET-produced code. Is this true?
Vladimir Srecovic
A: I was all set to respond to this question with a negative answer. I haven't seen anything that would point to C# having a speed advantage and therefore didn't think it likely that any significant performance difference would exist. After all, IL code is compiled to native code by the same Just In Time (JIT) compiler, regardless of which IL compiler generated it. So in theory at least, as long as your IL compiler was built to standard, equivalent VB.NET, C#, or even COBOL.NET code would compile into essentially the same IL code.
That's the conventional wisdom, anyway. Being the thorough type, though, I decided to perform a little experiment to see if this reasoning bore out. I took the VB.NET and C# versions of the TypeFinder sample application (look for it in /Program Files/Microsoft.Net/FrameworkSDK/Samples/applications/typefinder) and compiled them both. Next, I took the resulting executable files and ran them through the MSIL disassembler utility (/Program Files/Microsoft.Net/FrameworkSDK/Bin/ildasm.exe) to view the IL that both compilers produced. I then compared the two pieces of IL that were generated for the rather simple method IndentedWriter.WriteLine. You can see the VB.NET source for this method in Figure A. The C# source is shown in Figure B.
Figure A
The VB.NET version is slightly longer than the C# version.
Figure B
The C# version takes seven lines of code.
I was surprised by what I discovered when I compared the resulting IL code: The VB.NET version was nine lines (and 9 KB) longer than the C# version. You can see the IL that the VB.NET compiler generated in Listing A; the C# compiler's results appear in Listing B.
After comparing the code, I did a little quick and dirty benchmarking and found that over 12 trials, the C# version of FindType.exe, which uses reflection to list the methods belonging to a particular object, narrowly outperformed the VB.NET version. The latter's best time was slightly slower than the former's worst time.
What's going on here?
I'm no expert on IL, and it's currently poorly documented. But from looking at the IL code, it seems obvious that even though the two pieces of source are functionally identical and perform the same tasks in the same order, the resulting IL code is quite different:
• Five of the extra opcodes generated by the VB.NET compiler are nop, which, according to Microsoft's current documentation, stands for "No Operation" or "pass."
• The VB.NET IL declares an extra local variable of type int32 in the .locals section. This local variable is apparently used to cache a copy of the IndentedWriter.myIndent field for use in the for loop (line IL_002b). The C# IL, on the other hand, refers to the class field directly in line IL_0021).
• The VB.NET IL uses six opcodes (IL_0000 to IL_000e) to create its StringBuilder object, while the C#-generated IL uses only five (IL_0000 to IL_000d). One of the VB.NET opcodes used here is a nop.
• Both for loops are implemented in 13 opcodes (lines IL_001a through IL_002c for VB.NET and lines IL_0010 to IL_0026 for C#). Interestingly though, one of the opcodes in the VB.NET for loop is a nop.
Anyone care to explain this?
I would like to hear from any IL gurus that can more adequately explain what's going on here. Send me an e-mail with your explanation.
Something strange is afoot
Although there's no smoking gun here, it does appear that the VB.NET compiler generated slightly less efficient code than its C# counterpart. That would seem to support the conclusion that, at least in this example, C# does in fact outperform equivalent VB.NET code. All this could change since we are still dealing with a beta. So stay tuned. There may be another chapter to this story yet.
• 0
点赞
• 0
收藏
• 打赏
打赏
• 2
评论
“相关推荐”对你有帮助么？
• 非常没帮助
• 没帮助
• 一般
• 有帮助
• 非常有帮助
提交
©️2022 CSDN 皮肤主题：大白 设计师：CSDN官方博客 返回首页
评论 2
打赏作者
qianqian
你的鼓励将是我创作的最大动力
¥2 ¥4 ¥6 ¥10 ¥20
输入1-500的整数
余额支付 (余额：-- )
扫码支付
扫码支付：¥2
获取中
扫码支付
您的余额不足，请更换扫码支付或充值
打赏作者
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0
抵扣说明：
1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、C币套餐、付费专栏及课程。
余额充值
|
{
"url": "https://blog.csdn.net/qianqian/article/details/2660",
"source_domain": "blog.csdn.net",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "127232",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YVTGGOHJJH63LQ5FCHSMTDLHGBR7XIIC",
"WARC-Concurrent-To": "<urn:uuid:b697bc6c-052b-42d7-9288-c47ba8afefa7>",
"WARC-Date": "2022-10-04T17:24:09Z",
"WARC-IP-Address": "114.116.236.109",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KOT7JUQTKTM32ZPTCL3I5TLVLMYRHPIF",
"WARC-Record-ID": "<urn:uuid:8ea98fca-d363-4d35-b6b2-9beb9ff005c2>",
"WARC-Target-URI": "https://blog.csdn.net/qianqian/article/details/2660",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8af79689-8a5d-4092-a40c-0d29ae61a526>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-72\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,
20,
21,
23,
24,
97,
98,
146,
158,
171,
203,
204,
533,
534,
868,
869,
1040,
1041,
1069,
1070,
1071,
1194,
1195,
1213,
1214,
1215,
1752,
1753,
2494,
2495,
2504,
2563,
2564,
2565,
2574,
2616,
2617,
2618,
2619,
2883,
2884,
3208,
3209,
3231,
3232,
3233,
3499,
3500,
3664,
3968,
4169,
4372,
4373,
4402,
4537,
4538,
4539,
4566,
4567,
4568,
4960,
4961,
4967,
4974,
4980,
4987,
4994,
5001,
5007,
5014,
5015,
5029,
5030,
5040,
5048,
5055,
5063,
5073,
5076,
5114,
5119,
5120,
5125,
5126,
5135,
5136,
5151,
5152,
5169,
5180,
5194,
5199,
5207,
5211,
5216,
5217,
5235,
5236,
5241,
5242,
5245,
5252,
5259,
5264,
5271,
5272,
5278,
5279,
5313,
5348,
5349
],
"line_end_idx": [
20,
21,
23,
24,
97,
98,
146,
158,
171,
203,
204,
533,
534,
868,
869,
1040,
1041,
1069,
1070,
1071,
1194,
1195,
1213,
1214,
1215,
1752,
1753,
2494,
2495,
2504,
2563,
2564,
2565,
2574,
2616,
2617,
2618,
2619,
2883,
2884,
3208,
3209,
3231,
3232,
3233,
3499,
3500,
3664,
3968,
4169,
4372,
4373,
4402,
4537,
4538,
4539,
4566,
4567,
4568,
4960,
4961,
4967,
4974,
4980,
4987,
4994,
5001,
5007,
5014,
5015,
5029,
5030,
5040,
5048,
5055,
5063,
5073,
5076,
5114,
5119,
5120,
5125,
5126,
5135,
5136,
5151,
5152,
5169,
5180,
5194,
5199,
5207,
5211,
5216,
5217,
5235,
5236,
5241,
5242,
5245,
5252,
5259,
5264,
5271,
5272,
5278,
5279,
5313,
5348,
5349,
5353
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5353,
"ccnet_original_nlines": 110,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3324742317199707,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0996563583612442,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26116839051246643,
"rps_doc_frac_unique_words": 0.4669756591320038,
"rps_doc_mean_word_length": 4.840092658996582,
"rps_doc_num_sentences": 82,
"rps_doc_symbol_to_word_ratio": 0.016323020681738853,
"rps_doc_unigram_entropy": 5.427972793579102,
"rps_doc_word_count": 863,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02394063025712967,
"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.022982999682426453,
"rps_doc_frac_chars_top_3gram": 0.010533880442380905,
"rps_doc_frac_chars_top_4gram": 0.006703380029648542,
"rps_doc_books_importance": -517.2702026367188,
"rps_doc_books_importance_length_correction": -517.2702026367188,
"rps_doc_openwebtext_importance": -310.3818054199219,
"rps_doc_openwebtext_importance_length_correction": -310.3818054199219,
"rps_doc_wikipedia_importance": -271.3250732421875,
"rps_doc_wikipedia_importance_length_correction": -271.3250732421875
},
"fasttext": {
"dclm": 0.10115457326173782,
"english": 0.9109525680541992,
"fineweb_edu_approx": 2.1686923503875732,
"eai_general_math": 0.6594931483268738,
"eai_open_web_math": 0.2091781497001648,
"eai_web_code": 0.4373311400413513
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,457,880,083,116,413,000
|
How to pass data to a launched process
Gene Kennedy cyberscope at home.com
Tue Dec 11 22:21:01 EST 2001
I have read the Transcript dictionary descriptions of the process-related commands
namely: Open Process, Close Process, Write to Process and Read from Process but do
not have an understanding yet as to how one actually sets up the inter-application
process.
What I'd like to do is to create two applications A & B. Normally only app A
would be running however under certain conditions I would like App a to open
process B then send it some initialization data. Then, after process B has done
its work, send data back to process A (or have process a "Read from Process B").
What do you use as a container in each app to send and receive the data to and
fro? Does anybody have an example they would be willing to share?
Thanks for any help.
Gene Kennedy
More information about the use-livecode mailing list
|
{
"url": "http://lists.runrev.com/pipermail/use-livecode/2001-December/000548.html",
"source_domain": "lists.runrev.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "3532",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SPGNCSJ2L67QXO62CZBMU5GWBIOCB6QB",
"WARC-Concurrent-To": "<urn:uuid:098b88a7-76c5-4ea9-8257-ace8a29bfa48>",
"WARC-Date": "2024-02-26T18:44:26Z",
"WARC-IP-Address": "50.28.38.113",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DGYE2DA7LJZHH3IIE4Y3UFMW5FOTLIVM",
"WARC-Record-ID": "<urn:uuid:380af19b-08d6-469d-9a3b-72eeaeea6b13>",
"WARC-Target-URI": "http://lists.runrev.com/pipermail/use-livecode/2001-December/000548.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:23c814d5-31f3-4010-9c62-176964a5ccb3>"
},
"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 (info@commoncrawl.org)\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,
39,
40,
76,
105,
106,
107,
190,
273,
356,
365,
366,
444,
521,
602,
683,
762,
829,
830,
851,
864,
865,
866,
867,
868
],
"line_end_idx": [
39,
40,
76,
105,
106,
107,
190,
273,
356,
365,
366,
444,
521,
602,
683,
762,
829,
830,
851,
864,
865,
866,
867,
868,
920
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 920,
"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.4293193817138672,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.057591620832681656,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.141361266374588,
"rps_doc_frac_unique_words": 0.6111111044883728,
"rps_doc_mean_word_length": 4.456789970397949,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.300754547119141,
"rps_doc_word_count": 162,
"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.03324100002646446,
"rps_doc_frac_chars_top_3gram": 0.04155125096440315,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -86.6543960571289,
"rps_doc_books_importance_length_correction": -86.6543960571289,
"rps_doc_openwebtext_importance": -46.87646484375,
"rps_doc_openwebtext_importance_length_correction": -35.819637298583984,
"rps_doc_wikipedia_importance": -31.530654907226562,
"rps_doc_wikipedia_importance_length_correction": -31.530654907226562
},
"fasttext": {
"dclm": 0.019955750554800034,
"english": 0.9559962153434753,
"fineweb_edu_approx": 2.5151708126068115,
"eai_general_math": 0.08124052733182907,
"eai_open_web_math": 0.10809581726789474,
"eai_web_code": 0.03187644109129906
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,653,402,050,042,588,700
|
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
I am creating a dynamic table control with ASP.NET/C# and the table is being used to hold a form. I need to allow users to click on a button in a row and make a duplicate of that row right below the original. My page is also using AJAX and jQuery.
I have tried to use Table.Rows.AddAt(indexoforigrow+1, newrow) but I get an error that the index is out of the range of values. I figured maybe I wasn't getting the original row's index correctly so I just tossed in a 1 and still got the error.
I also noticed that when I press the button to execute the code, the table disappears. Any ideas on how to fix that?
I am thinking that if I am unable to get these issues fixed I will have to loop through the table and submit the data to a temp table, adding a new row where indicated. Then I would pull all of the data back out and display again.
EDIT
I moved on when I could not get this working and tried to setup my submit functions to loop through the data and submit it to a db and realized that I am experiencing the same issues when clicking the submit button as when I click the add row button. It appears that my issue is really with viewstates/postback.
I did some reading on this and from what I can tell the solution is to re-create the dynamic control on page load every time. But I am confused about how I can do this if I have no idea how many rows/cells I have and how is the information the user entered kept in the form? I have no way of saving the information to a DB or anything because as soon as submit is clicked it all disappears.
share|improve this question
Ok, so I did a debug and it looks like the row count for the table when I am trying to add the new row is coming up as 0. Not sure how this is happening because the table has already been created. The table creation script and the table add script are located in different functions in my c#, I wouldnt think this has anything to do with it since both reference objects in the page. – LoganGoesPlaces Oct 23 '09 at 0:47
It is definitely a problem with there being 0 rows when my onclick function is running. Though, the button and the table are in updatepanels so I am not sure why they would get cleared like it was a postback. – LoganGoesPlaces Oct 23 '09 at 2:32
My guess is the table is created dynamically too late in the page-lifecycle. Care to share more? – o.k.w Oct 23 '09 at 5:35
The table is created late in the lifecycle. Well, thats not completely correct. I created the Table itself in design view but no rows/cells are created until the user picks some options, hits a button to call a SQL stored procedure, then the table is populated with the data that is returned from the sproc. – LoganGoesPlaces Oct 23 '09 at 12:13
4 Answers 4
Have you considered using a different control? One of the grid controls might better serve your purpose.
I've handled situations (that sound) similar to what you're describing by using the footer of a GridView (among other ways). The big trick is to bind the display object (Table, GridView, etc.) to a list of objects. Then you manipulate the list of objects, rebinding the display object after the list has changed.
You will need to persist this list in some manner, or you could wind up with the list being reset to null. One way would be to save it as part of the session.
At any rate, the idea is to have a display object (GridView) bound to a list of objects. When the user clicks 'add', an item is added to the list. Save the list, then call the GridView.DataBind method.
share|improve this answer
I dont believe I can use a different control because of the nature of the data and how I am bringing it in from the Database. The user needs to select user(s) and assessment(s), then they click a button to generate the table. I need to loop through the data that is returned from SQL and add different types of controls, do some data processing, etc and then add the final product to a cell. I don't think I can accomplish that with a control that requires a data source. – LoganGoesPlaces Oct 23 '09 at 12:17
You are on the right track with re-creating the dynamic table each time the page loads. I have dome similar things and my solution was to keep a client state in a hidden field on the page. Every time you add a row to the table on the client, increment a counter or adjust the state data in the hidden field. Then, on the server-when the page posts back, read from that hidden field to know how many rows were added on the client. You will have to use some kind of naming convention for the new rows you add(and the widgets in them) so you can re-create them on the server.
A simpler option may be to use an UpdatePanel. Rather than try to add the rows on the client, your "add row" button would cause a partial update. The server side code would add the new row to the table and the viewstate would be updated.
share|improve this answer
I ended getting my data guy to do a bit more processing on his end so that I could just bind a ListView to a sproc. Solved a few of my problems.
Thanks for the helpful comments.
share|improve this answer
up vote 0 down vote accepted
Just returning to this almost a year later because I faced a similar issue in my current project. I was doing a few things wrong my first time around. First, I did indeed need to recreate the controls every load, but I also had to create them earlier in the page cycle. I was trying to create them during page load, which is after the viewstate is loaded.
The controls need to be recreated with the same ID before viewstate is loaded. I went with page init and it worked fine.
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/1610772/adding-a-new-row-to-a-dynamic-asp-net-table-control-at-position-x-problems-wi",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "87907",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7CLWK6SLLDIP3Y5GBOVCK2SRG4NPGFTH",
"WARC-Concurrent-To": "<urn:uuid:baf61315-1fc6-48ec-a373-b18133486a3f>",
"WARC-Date": "2015-05-27T08:03:03Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:CGTFVTWYZQMVTNREJTTHC5D76SLED7WF",
"WARC-Record-ID": "<urn:uuid:f8363e16-0d78-4c72-bd79-7c2feaadf27e>",
"WARC-Target-URI": "http://stackoverflow.com/questions/1610772/adding-a-new-row-to-a-dynamic-asp-net-table-control-at-position-x-problems-wi",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c5a69deb-019c-424c-a44f-fa271938d821>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-206-219.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
406,
407,
652,
653,
770,
771,
1002,
1003,
1008,
1009,
1321,
1322,
1713,
1714,
1742,
1747,
2168,
2173,
2420,
2425,
2550,
2555,
2902,
2903,
2915,
2916,
3021,
3022,
3335,
3336,
3495,
3496,
3698,
3699,
3725,
3730,
4241,
4242,
4815,
4816,
5054,
5055,
5081,
5082,
5227,
5228,
5261,
5262,
5288,
5317,
5318,
5674,
5675,
5796,
5797,
5823,
5824,
5836,
5837,
5839,
5847,
5848,
5926,
5927
],
"line_end_idx": [
25,
157,
158,
406,
407,
652,
653,
770,
771,
1002,
1003,
1008,
1009,
1321,
1322,
1713,
1714,
1742,
1747,
2168,
2173,
2420,
2425,
2550,
2555,
2902,
2903,
2915,
2916,
3021,
3022,
3335,
3336,
3495,
3496,
3698,
3699,
3725,
3730,
4241,
4242,
4815,
4816,
5054,
5055,
5081,
5082,
5227,
5228,
5261,
5262,
5288,
5317,
5318,
5674,
5675,
5796,
5797,
5823,
5824,
5836,
5837,
5839,
5847,
5848,
5926,
5927,
6017
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6017,
"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.4668697714805603,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.041888799518346786,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1378522515296936,
"rps_doc_frac_unique_words": 0.35872453451156616,
"rps_doc_mean_word_length": 4.144375324249268,
"rps_doc_num_sentences": 67,
"rps_doc_symbol_to_word_ratio": 0.00152322999201715,
"rps_doc_unigram_entropy": 5.216440200805664,
"rps_doc_word_count": 1129,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.045949991792440414,
"rps_doc_frac_chars_dupe_6grams": 0.03205813094973564,
"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.0256465096026659,
"rps_doc_frac_chars_top_3gram": 0.0074802301824092865,
"rps_doc_frac_chars_top_4gram": 0.009617440402507782,
"rps_doc_books_importance": -551.1635131835938,
"rps_doc_books_importance_length_correction": -551.1635131835938,
"rps_doc_openwebtext_importance": -338.0933532714844,
"rps_doc_openwebtext_importance_length_correction": -338.0933532714844,
"rps_doc_wikipedia_importance": -220.03298950195312,
"rps_doc_wikipedia_importance_length_correction": -220.03298950195312
},
"fasttext": {
"dclm": 0.3102344274520874,
"english": 0.9525660276412964,
"fineweb_edu_approx": 1.1845364570617676,
"eai_general_math": 0.267406165599823,
"eai_open_web_math": 0.1261191964149475,
"eai_web_code": 0.16382312774658203
}
}
|
{
"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": "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": "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": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,508,553,068,311,740,200
|
# Copyright 1999-2023 Gentoo Authors # Distributed under the terms of the GNU General Public License v2 EAPI=8 inherit gnome.org gnome2-utils linux-info meson readme.gentoo-r1 vala xdg DESCRIPTION="Simple GNOME application to access remote or virtual systems" HOMEPAGE="https://wiki.gnome.org/Apps/Boxes" LICENSE="LGPL-2+ CC-BY-2.0" SLOT="0" KEYWORDS="~amd64" # FIXME: qemu probably needs to depend on spice[smartcard] directly with USE=spice # FIXME: Check over libvirt USE=libvirtd,qemu and the smartcard/usbredir requirements # Technically vala itself still ships a libsoup vapi, but that may change, and # it should be better to use the .vapi from the same libsoup version DEPEND=" >=app-arch/libarchive-3.0.0:= >=dev-libs/glib-2.52:2 >=x11-libs/gtk+-3.24.1:3 >=gui-libs/libhandy-1.5.0:1 >=sys-libs/libosinfo-1.10.0-r1 net-libs/libsoup:3.0 virtual/libusb:1 >=app-emulation/libvirt-glib-4.0.0 >=dev-libs/libxml2-2.7.8:2 >=net-misc/spice-gtk-0.32[gtk3(+),smartcard,usbredir] >=net-libs/webkit-gtk-2.38.0:4.1 >=dev-libs/gobject-introspection-1.56:= >=dev-libs/libgudev-165:= " # gobject-introspection needed for libovf subproject # These are called via exec(): # - sys-fs/mtools mcopy for unattended file copying for files that libarchive doesn't support # - app-cdr/cdrtools mkisofs is needed for unattended installer secondary disk image creation # - app-emulation/libguestfs virt-sysprep is used for VM cloing, if not there, it logs debug and doesn't function # - sys-apps/policycoreutils restorecon is used for checking selinux context # - app-emulation/libvirt virsh used for various checks (and we need the library anyways) # - sys-auth/polkit used for making all libvirt system disks readable via "pkexec # chmod a+r" that aren't already readable to the user (libvirt system importer) # - app-emulation/qemu qemu-img used to convert image to QCOW2 format during copy RDEPEND="${DEPEND} app-cdr/cdrtools app-misc/tracker-miners:3[iso] app-emulation/spice[smartcard] >=app-emulation/libvirt-0.9.3[libvirtd,qemu] >=app-emulation/qemu-1.3.1[spice,smartcard,usbredir] sys-fs/mtools sys-auth/polkit " # This is only needed for creating the .vapi file, but gnome-boxes needs it BDEPEND=" $(vala_depend) sys-libs/libosinfo[vala] app-crypt/libsecret[vala] net-libs/libsoup:3.0[vala] app-emulation/libvirt-glib[vala] net-misc/spice-gtk[vala] x11-libs/vte:2.91[vala] dev-libs/appstream-glib dev-util/itstool >=sys-devel/gettext-0.19.8 virtual/pkgconfig " DISABLE_AUTOFORMATTING="yes" DOC_CONTENTS="Before running gnome-boxes for local VMs, you will need to load the KVM modules. If you have an Intel Processor, run: # modprobe kvm-intel If you have an AMD Processor, run: # modprobe kvm-amd" pkg_pretend() { linux-info_get_any_version if linux_config_exists; then if ! { linux_chkconfig_present KVM_AMD || \ linux_chkconfig_present KVM_INTEL; }; then ewarn "You need KVM support in your kernel to use GNOME Boxes local VM support!" fi fi } src_prepare() { default vala_setup xdg_environment_reset } src_configure() { local emesonargs=( -Ddistributor_name=Gentoo -Ddistributor_version=${PVR} -Dinstalled_tests=false -Dflatpak=false -Dprofile=default -Duefi=true ) meson_src_configure } src_install() { meson_src_install readme.gentoo_create_doc } pkg_postinst() { xdg_pkg_postinst gnome2_schemas_update readme.gentoo_print_elog } pkg_postrm() { xdg_pkg_postrm gnome2_schemas_update }
|
{
"url": "https://linux.mathematik.tu-darmstadt.de/pub/linux/distributions/gentoo-portage/gnome-extra/gnome-boxes/gnome-boxes-44.3.ebuild",
"source_domain": "linux.mathematik.tu-darmstadt.de",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "3761",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IPYQ7ARPCVXO2CRFPAV45RERTSGE7KYG",
"WARC-Concurrent-To": "<urn:uuid:60ad3a47-1f94-4349-a40b-b055868b291e>",
"WARC-Date": "2023-11-30T11:22:19Z",
"WARC-IP-Address": "130.83.2.34",
"WARC-Identified-Payload-Type": "text/plain",
"WARC-Payload-Digest": "sha1:ND6MGXX3RR52U2RX3ODORPKEQO5Q22B7",
"WARC-Record-ID": "<urn:uuid:646e4bf7-8923-4428-bb0d-df07e9c5963e>",
"WARC-Target-URI": "https://linux.mathematik.tu-darmstadt.de/pub/linux/distributions/gentoo-portage/gnome-extra/gnome-boxes/gnome-boxes-44.3.ebuild",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c4106cb4-44fc-4d1c-bf95-3a4ab23d7f42>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-154\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
3379
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3379,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.005327019840478897,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12351544201374054,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.036817099899053574,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.45605701208114624,
"rps_doc_frac_unique_words": 0.7210031151771545,
"rps_doc_mean_word_length": 8.134796142578125,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.022565320134162903,
"rps_doc_unigram_entropy": 5.254550457000732,
"rps_doc_word_count": 319,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.010789980180561543,
"rps_doc_frac_chars_top_3gram": 0.0069364202208817005,
"rps_doc_frac_chars_top_4gram": 0.008477839641273022,
"rps_doc_books_importance": -348.33978271484375,
"rps_doc_books_importance_length_correction": -348.33978271484375,
"rps_doc_openwebtext_importance": -213.18370056152344,
"rps_doc_openwebtext_importance_length_correction": -213.18370056152344,
"rps_doc_wikipedia_importance": -180.92074584960938,
"rps_doc_wikipedia_importance_length_correction": -180.92074584960938
},
"fasttext": {
"dclm": 0.647432804107666,
"english": 0.5190674066543579,
"fineweb_edu_approx": 2.5518994331359863,
"eai_general_math": 0.8660006523132324,
"eai_open_web_math": 0.5090662240982056,
"eai_web_code": 0.7536578178405762
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
317,915,088,271,583,000
|
Edit Your Website Navigation Menu | Teesnap Tutorial
The navigation menu appears at the header of your website, and allows users to visit different pages of your site.
Editing Existing Menu Items:
1. Navigate to "Appearance" then "Menus"
2. Drag and drop to order your menu items
3. Drag a menu item inward to create a sub-menu
Adding a New Menu Item:
1. Add a new page by selecting it in the left drop-down and clicking "Add to Menu"
2. Add a custom link by selecting the "Custom Link" dropdown.
3. Enter the URL and a title for the menu item before clicking "Add to Menu"
Here is a video:
HubSpot Video
|
{
"url": "https://support.teesnap.com/edit-your-website-navigation-menu-teesnap-tutorial",
"source_domain": "support.teesnap.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "58923",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CGEQPRFWE5RF45ZBAVKNUPY663255XNR",
"WARC-Concurrent-To": "<urn:uuid:a9910f0b-ac54-4c2d-b755-d348a3efc4bf>",
"WARC-Date": "2022-09-27T03:59:18Z",
"WARC-IP-Address": "199.60.103.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YBD375XZEPXBCWG54WHTKYHTYWY3TOII",
"WARC-Record-ID": "<urn:uuid:de04db23-7e84-4917-b589-c615fd416e5e>",
"WARC-Target-URI": "https://support.teesnap.com/edit-your-website-navigation-menu-teesnap-tutorial",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a812ab31-9d6e-4b37-b7b4-336405661a98>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-194\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,
53,
54,
170,
171,
172,
201,
202,
245,
289,
339,
340,
364,
365,
450,
514,
593,
594,
611,
612
],
"line_end_idx": [
53,
54,
170,
171,
172,
201,
202,
245,
289,
339,
340,
364,
365,
450,
514,
593,
594,
611,
612,
625
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 625,
"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.30434784293174744,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0072463802061975,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2246376872062683,
"rps_doc_frac_unique_words": 0.5405405163764954,
"rps_doc_mean_word_length": 4.216216087341309,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.8355700969696045,
"rps_doc_word_count": 111,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05128204822540283,
"rps_doc_frac_chars_top_3gram": 0.055555559694767,
"rps_doc_frac_chars_top_4gram": 0.07264956831932068,
"rps_doc_books_importance": -61.422569274902344,
"rps_doc_books_importance_length_correction": -73.58201599121094,
"rps_doc_openwebtext_importance": -28.327531814575195,
"rps_doc_openwebtext_importance_length_correction": -40.48698043823242,
"rps_doc_wikipedia_importance": -38.74678421020508,
"rps_doc_wikipedia_importance_length_correction": -50.90623474121094
},
"fasttext": {
"dclm": 0.8752110004425049,
"english": 0.7230381369590759,
"fineweb_edu_approx": 0.8169112801551819,
"eai_general_math": 0.00005794000026071444,
"eai_open_web_math": 0.02260464057326317,
"eai_web_code": 0.0036661599297076464
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,079,355,820,688,755,000
|
What can I do to protect the images I place on my site?
• 1
• 10
• Question
• Updated 2 years ago
• Answered
• (Edited)
Archived and Closed
This conversation is no longer open for comments or replies and is no longer visible to community members.
Note: We want to provide a few common and useful snippets for your use, but our support department is not able to assist you with editing code. They can help you with code placement.
Protecting digital media (especially images) on the internet is next to impossible due to the nature of how the internet and webpages work. When someone views a webpage the web browser is downloading a copy of all the content of the page to the computer. So even if you go to great lengths to prevent them from taking an image from the website, the reality is they already have that image on their computer in the temporary internet files. On top of that, anyone can take a screenshot when viewing a website and get the image that way.What you can do is make it more difficult for the average internet user to take the image. Most of these were mentioned by your fellow community members, but here are the most common ways our users do that:
Disable Right-Click: The right-click menu allows the viewer to easily save an image from the browser. It can be disabled by putting code on your website, but it will not prevent some browsers from being able to drag the image directly to the desktop. There are several different ways to do it in code, but here is the most efficient code we've found to disable the right-click menu. Place this code in the head section, under Page Settings > Advanced
oncontextmenu="return false" onselectstart="return false" ondragstart="return false"
Shrink Wrap Images:
This is the technique of putting a transparent image on top of the image you are protecting so they cannot drag it or right click save since it will save the invisible transparent "shrink wrap" that is on top. In SiteBuilder you can do it easily without code by adding a border over the image since borders have a transparent center and are essentially like a picture frame with glass.
Add a Watermark: Adding a digital watermark does not make it more difficult to steal the image, but it is the best deterrent since they would have to use Photoshop or another image editor to remove the watermark. How efficient it is depends on the complexity of the image, the watermark placement on it, and how difficult it would be to remove. There are free websites online to add watermarks such as http://www.picmarkr.com or you could use just about any image editing software.
Resize before uploading: Images on your site need to be downloaded to the visitors computer. If you are uploading high resolution images, it will slow down page loads. If you resize the images to a lower resolution, you can still have a good looking image that isn't as useful to the person that does manage to steal it. Sitebuilder will alert you if the image you are uploading is larger than necessary and offer to resize it to a more appropriate size.There are several other methods out there but like these the best they do is make images difficult to steal so a viewer might find an easier website to take images from.
Photo of Drew N
Drew N, Alum
• 262,826 Points 100k badge 2x thumb
Posted 6 years ago
• 1
• 10
Photo of Lynn0013
Lynn0013
• 562 Points 500 badge 2x thumb
There used to be a TM message if people tried to copy one of my web pages. It is no longer there. How do I prevent someone from copying a page? Is there a new code I can put in place?
Photo of Mike F.
Mike F., Alum
• 184,698 Points 100k badge 2x thumb
If it use to work, but no longer does, it's most likely due to changes in the actual web browser. It probably works on older versions but not newer versions. If you are primarily trying to protect text it's very hard to do. You can try to place a transparent .gif image over the text so that if someone tries to right click it, they click the image instead, but anyone that is very computer savvy will still know how to get the text. It's as simple as viewing the source code for the web page.
Photo of Lynn0013
Lynn0013
• 562 Points 500 badge 2x thumb
I guess this all can go down as evolution. Sometimes the "good old days" are better. I suppose even if there were codes, people can still take screen shots anyway so one way or another we are all vulnerable. Thank you for trying to help.
Photo of Mike F.
Mike F., Alum
• 184,698 Points 100k badge 2x thumb
You are exactly right, it's as simple as taking a screenshot and pasting it into numerous types of OCR (optical character recognition) software and in seconds it's in an editable format.
Photo of Lynn0013
Lynn0013
• 562 Points 500 badge 2x thumb
HEY I just tried the little snippet above and it works. When someone tries to right click it doesn't show any message but it shows nothing which is just as good
<body oncontextmenu="return false;"> That's what I used.
Photo of Mike F.
Mike F., Alum
• 184,698 Points 100k badge 2x thumb
That is great! We've had good luck with that one. You may want to check it ever few weeks or months. As new browsers are released, it may or may not work. Let us know if you have any more questions or concerns.
Photo of Keith5330
Keith5330
• 664 Points 500 badge 2x thumb
This reply was created from a merged topic originally titled
How can I prevent copying of my website images?.
I am pretty sure when I initially set up my website with intuit that viewers could not copy my photos from the website. I see now that I am, and I would assume others are, able to right click and copy then paste images from my website. I don't like that. Is there a solution? Thanks.
Photo of Drew N
Drew N, Alum
• 262,826 Points 100k badge 2x thumb
It is not perfect, but here are your options.
Drew
Photo of Ronald8383
Ronald8383
• 92 Points 75 badge 2x thumb
This reply was created from a merged topic originally titled
How can I copyright my Gallery?.
I want to keep my website visitors from copying and pasting my gallery photos elsewhere
Photo of Mike F.
Mike F., Alum
• 184,698 Points 100k badge 2x thumb
You'll find a few options on this page.
Photo of Ronald8383
Ronald8383
• 92 Points 75 badge 2x thumb
What page?
Photo of Mike F.
Mike F., Alum
• 184,698 Points 100k badge 2x thumb
This page. Just scroll up.
This reply was created from a merged topic originally titled What can I do to keep pictures from being copied on my site by viewers?.
Photo of Mike F.
Mike F., Alum
• 184,698 Points 100k badge 2x thumb
Hi doubledeucekartingmedia7929, Take a look at this page. It has several options which you can try.
Photo of goflo0400
goflo0400
• 232 Points 100 badge 2x thumb
This reply was created from a merged topic originally titled is there a way to protect my content so ppl cant just right click and take my pho....
protect my content
Photo of charles6722
charles6722
• 182 Points 100 badge 2x thumb
This reply was created from a merged topic originally titled How do I make pictures can be opened larger but not be able to save them?.
Allow pictures to be opened in a viewer (what ever OS) but not allow them to be saved off?
Photo of Drew N
Drew N, Alum
• 262,826 Points 100k badge 2x thumb
Use the photo gallery to get thumbnails of your images that can be clicked and enlarged
Photo of Lew9734
Lew9734
• 82 Points 75 badge 2x thumb
This reply was created from a merged topic originally titled I+am+posting+a+picture+on+my+site+that+I+do+not+want+downloaded+by+viewers.++Can+....
www.menofmusic.org This website contains a JPG picture of our group that was made by a professional studio. Can I prevent people from downloading this image for their own use?
Photo of Lynn0250
Lynn0250
• 0 Points
This reply was created from a merged topic originally titled Is there a way to make it so people can not save my pictures?.
I want to have my pictures on my website so people can not save them without permission
Photo of Sherri7225
Sherri7225
• 32 Points
This reply was created from a merged topic originally titled can I make my photos where people can not copy them.
I want to know if there is a way I can keep people from copying the photos off of my web site
Photo of Drew N
Drew N, Alum
• 262,826 Points 100k badge 2x thumb
There is no foolproof way, but here are some things that can help discourage it.
Photo of Spencer2281
Spencer2281
• 114 Points 100 badge 2x thumb
This reply was created from a merged topic originally titled right click protection.
how do I prevent right click downloading of my images
This conversation is no longer open for comments or replies.
|
{
"url": "https://community.homestead.com/homestead/topics/what_can_i_do_to_protect_the_images_i_place_on_my_site",
"source_domain": "community.homestead.com",
"snapshot_id": "crawl=CC-MAIN-2020-10",
"warc_metadata": {
"Content-Length": "172520",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:A4FGDICJME6PGCWCDPI4CHRH33XC27UX",
"WARC-Concurrent-To": "<urn:uuid:04b7f6f0-a505-425d-bbdd-a283fb845abf>",
"WARC-Date": "2020-02-20T15:26:23Z",
"WARC-IP-Address": "54.244.234.169",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EOJ4OFZT5HG6EFXH5LXH57EDH53WDJIE",
"WARC-Record-ID": "<urn:uuid:3aadbb81-8b09-41f5-bb95-d4f86e0768b8>",
"WARC-Target-URI": "https://community.homestead.com/homestead/topics/what_can_i_do_to_protect_the_images_i_place_on_my_site",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:da371feb-df43-4f1d-b06d-1413b3f3cdc8>"
},
"warc_info": "isPartOf: CC-MAIN-2020-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-151.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
56,
57,
63,
70,
83,
107,
120,
133,
153,
154,
261,
262,
445,
446,
1188,
1189,
1640,
1641,
1726,
1727,
1728,
1748,
2134,
2135,
2617,
2618,
3242,
3258,
3259,
3272,
3273,
3312,
3313,
3332,
3333,
3339,
3346,
3364,
3365,
3374,
3375,
3409,
3593,
3610,
3611,
3625,
3626,
3665,
4160,
4178,
4179,
4188,
4189,
4223,
4462,
4479,
4480,
4494,
4495,
4534,
4721,
4739,
4740,
4749,
4750,
4784,
4785,
4946,
4947,
5016,
5017,
5034,
5035,
5049,
5050,
5089,
5302,
5321,
5322,
5332,
5333,
5367,
5428,
5477,
5478,
5479,
5763,
5779,
5780,
5793,
5794,
5833,
5879,
5880,
5885,
5905,
5906,
5917,
5918,
5950,
6011,
6044,
6045,
6046,
6134,
6151,
6152,
6166,
6167,
6206,
6247,
6267,
6268,
6279,
6280,
6312,
6323,
6340,
6341,
6355,
6356,
6395,
6423,
6557,
6574,
6575,
6589,
6590,
6629,
6732,
6751,
6752,
6762,
6763,
6797,
6944,
6945,
6964,
6985,
6986,
6998,
6999,
7033,
7169,
7170,
7261,
7277,
7278,
7291,
7292,
7331,
7419,
7436,
7437,
7445,
7446,
7478,
7625,
7626,
7804,
7822,
7823,
7832,
7833,
7846,
7970,
7971,
8059,
8079,
8080,
8091,
8092,
8106,
8220,
8221,
8315,
8331,
8332,
8345,
8346,
8385,
8466,
8487,
8488,
8500,
8501,
8535,
8620,
8621,
8675,
8676
],
"line_end_idx": [
56,
57,
63,
70,
83,
107,
120,
133,
153,
154,
261,
262,
445,
446,
1188,
1189,
1640,
1641,
1726,
1727,
1728,
1748,
2134,
2135,
2617,
2618,
3242,
3258,
3259,
3272,
3273,
3312,
3313,
3332,
3333,
3339,
3346,
3364,
3365,
3374,
3375,
3409,
3593,
3610,
3611,
3625,
3626,
3665,
4160,
4178,
4179,
4188,
4189,
4223,
4462,
4479,
4480,
4494,
4495,
4534,
4721,
4739,
4740,
4749,
4750,
4784,
4785,
4946,
4947,
5016,
5017,
5034,
5035,
5049,
5050,
5089,
5302,
5321,
5322,
5332,
5333,
5367,
5428,
5477,
5478,
5479,
5763,
5779,
5780,
5793,
5794,
5833,
5879,
5880,
5885,
5905,
5906,
5917,
5918,
5950,
6011,
6044,
6045,
6046,
6134,
6151,
6152,
6166,
6167,
6206,
6247,
6267,
6268,
6279,
6280,
6312,
6323,
6340,
6341,
6355,
6356,
6395,
6423,
6557,
6574,
6575,
6589,
6590,
6629,
6732,
6751,
6752,
6762,
6763,
6797,
6944,
6945,
6964,
6985,
6986,
6998,
6999,
7033,
7169,
7170,
7261,
7277,
7278,
7291,
7292,
7331,
7419,
7436,
7437,
7445,
7446,
7478,
7625,
7626,
7804,
7822,
7823,
7832,
7833,
7846,
7970,
7971,
8059,
8079,
8080,
8091,
8092,
8106,
8220,
8221,
8315,
8331,
8332,
8345,
8346,
8385,
8466,
8487,
8488,
8500,
8501,
8535,
8620,
8621,
8675,
8676,
8736
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8736,
"ccnet_original_nlines": 191,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4191054701805115,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028713420033454895,
"rps_doc_frac_lines_end_with_ellipsis": 0.010416669771075249,
"rps_doc_frac_no_alph_words": 0.1446714550256729,
"rps_doc_frac_unique_words": 0.26920634508132935,
"rps_doc_mean_word_length": 4.314285755157471,
"rps_doc_num_sentences": 87,
"rps_doc_symbol_to_word_ratio": 0.0011043599806725979,
"rps_doc_unigram_entropy": 5.354983329772949,
"rps_doc_word_count": 1575,
"rps_doc_frac_chars_dupe_10grams": 0.21383370459079742,
"rps_doc_frac_chars_dupe_5grams": 0.23164090514183044,
"rps_doc_frac_chars_dupe_6grams": 0.2214863896369934,
"rps_doc_frac_chars_dupe_7grams": 0.21383370459079742,
"rps_doc_frac_chars_dupe_8grams": 0.21383370459079742,
"rps_doc_frac_chars_dupe_9grams": 0.21383370459079742,
"rps_doc_frac_chars_top_2gram": 0.022663719952106476,
"rps_doc_frac_chars_top_3gram": 0.035320088267326355,
"rps_doc_frac_chars_top_4gram": 0.025018399581313133,
"rps_doc_books_importance": -841.0131225585938,
"rps_doc_books_importance_length_correction": -841.0131225585938,
"rps_doc_openwebtext_importance": -470.7231750488281,
"rps_doc_openwebtext_importance_length_correction": -470.7231750488281,
"rps_doc_wikipedia_importance": -308.80438232421875,
"rps_doc_wikipedia_importance_length_correction": -308.80438232421875
},
"fasttext": {
"dclm": 0.042740169912576675,
"english": 0.9342015385627747,
"fineweb_edu_approx": 2.177375316619873,
"eai_general_math": 0.0139767499640584,
"eai_open_web_math": 0.12126421928405762,
"eai_web_code": 0.00533038005232811
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.8",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,692,929,465,486,042,000
|
3
I have access to two NUMA servers. One of them is Dell R720 and has these CPUs:
$ cat /proc/cpuinfo |grep Xeon|sort|uniq -c
24 model name : Intel(R) Xeon(R) CPU E5-2630L v2 @ 2.40GHz
The other is a HPE DL360 Gen8 and has these CPUs:
$ cat /proc/cpuinfo |grep Xeon|sort|uniq -c
24 model name : Intel(R) Xeon(R) CPU E5-2630 0 @ 2.30GHz
At work where we have many HPE Gen9 servers, I have been used to CPU numbering (socket0, socket1, socket0 HyperThreads, socket1 HyperThreads). It seems the HPE DL360 Gen8 uses this numbering:
$ cat /proc/cpuinfo |grep physical.id|uniq -c
6 physical id : 0
6 physical id : 1
6 physical id : 0
6 physical id : 1
But the Dell R720 server uses different numbering:
$ cat /proc/cpuinfo |grep physical.id|uniq -c
1 physical id : 0
1 physical id : 1
1 physical id : 0
1 physical id : 1
1 physical id : 0
1 physical id : 1
1 physical id : 0
1 physical id : 1
1 physical id : 0
1 physical id : 1
1 physical id : 0
1 physical id : 1
1 physical id : 0
1 physical id : 1
1 physical id : 0
1 physical id : 1
1 physical id : 0
1 physical id : 1
1 physical id : 0
1 physical id : 1
1 physical id : 0
1 physical id : 1
1 physical id : 0
1 physical id : 1
My question is, what causes this difference? The servers have two slightly different kernel versions:
Dell R720:
$ uname -a
Linux dell 4.10.0-33-generic #37~16.04.1-Ubuntu SMP Fri Aug 11 14:07:24 UTC 2017 x86_64 x86_64 x86_64 GNU/Linux
HPE DL360 Gen8:
$ uname -a
Linux hpe 4.11.0-14-generic #20~16.04.1-Ubuntu SMP Wed Aug 9 09:06:22 UTC 2017 x86_64 x86_64 x86_64 GNU/Linux
Is this caused by different kernel versions? Or by different CPUs? Or by different motherboards / BIOSes?
Edit: I updated the kernels on both machines and rebooted, so now both machines use exactly the same kernel version. Nevertheless, the difference is still there.
• 2
Why are you doing this? – ewwhite Dec 16 '17 at 15:15
• I have performance critical packet processing applications needing a subset of the virtual CPUs, and need to decide which virtual CPUs I should pin them on. – juhist Dec 17 '17 at 9:09
• Use the physical CPUs or disable hyperthreading. – ewwhite Dec 17 '17 at 13:09
• 1
The difference between the servers doesn't matter. Both answers provided show you the tools to determine the topology. Please use them! – ewwhite Dec 18 '17 at 15:12
2
Stop the grepping and uniq and run lscpu and lstopo --of png > server.png and visualize the results...
[root@LA_Specialty ~]# lscpu
Architecture: x86_64
CPU op-mode(s): 32-bit, 64-bit
Byte Order: Little Endian
CPU(s): 24
On-line CPU(s) list: 0-23
Thread(s) per core: 2
Core(s) per socket: 6
Socket(s): 2
NUMA node(s): 2
Vendor ID: GenuineIntel
CPU family: 6
Model: 62
Model name: Intel(R) Xeon(R) CPU E5-2643 v2 @ 3.50GHz
Stepping: 4
CPU MHz: 3501.000
BogoMIPS: 7013.88
Virtualization: VT-x
L1d cache: 32K
L1i cache: 32K
L2 cache: 256K
L3 cache: 25600K
NUMA node0 CPU(s): 0-5,12-17
NUMA node1 CPU(s): 6-11,18-23
enter image description here
1
lscpu [1] will more concisely express the numa layout of each system. lstopo [2] gives a hierarchic view of the processor relations.
Enumeration is determined by CPU + BIOS + kernel. At a high level, the motherboard has different sockets for 0 and 1, it always launches 0. The CPU in socket 0 then starts core 0 at a particular address and launches the BIOS, which then enumerates the logical CPUs on this chip and additional CPUs (possibly not in that order)[3]. The BIOS passes the enumeration data to the OS as needed, but the OS is free to number the CPUs however it wants (imagine what hotplugging CPUs does to numbering).
If you're worried about affinities and caching, the apicid is a useful number to use. The bitfield should be defined such that memory/caches that are closest together have apicids that are numerically close by ordering the bits Socket | Core | SMT. The widths of these fields are not fixed though, so you can't count on the LSB to always mean SMT, it could have no SMT and this bit is part of the core id.
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/888430/numa-cpu-numbering-in-linux",
"source_domain": "serverfault.com",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "144688",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MZFJ46SIKJULSRONNIA2UJB52SQ4D5G7",
"WARC-Concurrent-To": "<urn:uuid:1315e4c5-37c8-4c31-8f8d-fcffacee24b9>",
"WARC-Date": "2019-06-18T22:37:01Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EJ6RUX2RJN6344OXRJ5DR6N36HPCD37V",
"WARC-Record-ID": "<urn:uuid:5ff6b161-994c-4c46-9c09-1f81c8085902>",
"WARC-Target-URI": "https://serverfault.com/questions/888430/numa-cpu-numbering-in-linux",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cbe1670c-36aa-459a-82b1-e1d65f9362bd>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-144-182-216.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
83,
84,
128,
193,
194,
244,
245,
289,
352,
353,
545,
546,
592,
616,
640,
664,
688,
689,
740,
741,
787,
811,
835,
859,
883,
907,
931,
955,
979,
1003,
1027,
1051,
1075,
1099,
1123,
1147,
1171,
1195,
1219,
1243,
1267,
1291,
1315,
1339,
1363,
1364,
1466,
1467,
1478,
1479,
1490,
1602,
1603,
1619,
1620,
1631,
1741,
1742,
1848,
1849,
2011,
2012,
2018,
2076,
2265,
2348,
2354,
2524,
2526,
2527,
2630,
2631,
2660,
2690,
2728,
2765,
2791,
2819,
2844,
2869,
2894,
2919,
2955,
2980,
3006,
3071,
3096,
3128,
3159,
3187,
3214,
3241,
3269,
3299,
3332,
3366,
3367,
3396,
3397,
3399,
3400,
3533,
3534,
4029,
4030,
4436,
4437,
4449,
4450,
4550,
4551
],
"line_end_idx": [
2,
3,
83,
84,
128,
193,
194,
244,
245,
289,
352,
353,
545,
546,
592,
616,
640,
664,
688,
689,
740,
741,
787,
811,
835,
859,
883,
907,
931,
955,
979,
1003,
1027,
1051,
1075,
1099,
1123,
1147,
1171,
1195,
1219,
1243,
1267,
1291,
1315,
1339,
1363,
1364,
1466,
1467,
1478,
1479,
1490,
1602,
1603,
1619,
1620,
1631,
1741,
1742,
1848,
1849,
2011,
2012,
2018,
2076,
2265,
2348,
2354,
2524,
2526,
2527,
2630,
2631,
2660,
2690,
2728,
2765,
2791,
2819,
2844,
2869,
2894,
2919,
2955,
2980,
3006,
3071,
3096,
3128,
3159,
3187,
3214,
3241,
3269,
3299,
3332,
3366,
3367,
3396,
3397,
3399,
3400,
3533,
3534,
4029,
4030,
4436,
4437,
4449,
4450,
4550,
4551,
4641
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4641,
"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.2179732322692871,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06214148923754692,
"rps_doc_frac_lines_end_with_ellipsis": 0.008771929889917374,
"rps_doc_frac_no_alph_words": 0.3747609853744507,
"rps_doc_frac_unique_words": 0.42817679047584534,
"rps_doc_mean_word_length": 4.366022109985352,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0.0038240898866206408,
"rps_doc_unigram_entropy": 5.118258476257324,
"rps_doc_word_count": 724,
"rps_doc_frac_chars_dupe_10grams": 0.13603289425373077,
"rps_doc_frac_chars_dupe_5grams": 0.20404934883117676,
"rps_doc_frac_chars_dupe_6grams": 0.19677317142486572,
"rps_doc_frac_chars_dupe_7grams": 0.1512179672718048,
"rps_doc_frac_chars_dupe_8grams": 0.1512179672718048,
"rps_doc_frac_chars_dupe_9grams": 0.13603289425373077,
"rps_doc_frac_chars_top_2gram": 0.08857955783605576,
"rps_doc_frac_chars_top_3gram": 0.08351787179708481,
"rps_doc_frac_chars_top_4gram": 0.045555200427770615,
"rps_doc_books_importance": -464.85345458984375,
"rps_doc_books_importance_length_correction": -464.85345458984375,
"rps_doc_openwebtext_importance": -268.0257263183594,
"rps_doc_openwebtext_importance_length_correction": -268.0257263183594,
"rps_doc_wikipedia_importance": -172.793212890625,
"rps_doc_wikipedia_importance_length_correction": -172.793212890625
},
"fasttext": {
"dclm": 0.13088440895080566,
"english": 0.7971048355102539,
"fineweb_edu_approx": 2.1257054805755615,
"eai_general_math": 0.019357919692993164,
"eai_open_web_math": 0.06373394280672073,
"eai_web_code": 0.08413451910018921
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "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": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,509,422,869,593,705,000
|
How to Install Nano on Alpine Linux Latest
Nano is a popular text editor for Linux systems that provides a user-friendly interface and various features. Follow these steps to install Nano on Alpine Linux Latest:
Step 1: Update Package Index
Before installing Nano, you need to ensure that the package index on your Alpine Linux is up-to-date. To update the package index, open the terminal and run the following command:
sudo apk update
Step 2: Install Nano using Apk Package Manager
Next, type the following command to install Nano on your Alpine Linux system.
sudo apk add nano
This command will download and install Nano along with its dependencies.
Step 3: Verify Nano Installation
After installing Nano, verify whether it is installed correctly or not using the following command:
nano -V
This command will display the Nano version installed on your system.
Step 4: Basic Usage of Nano
You can open a file with Nano using the following command:
nano filename
Replace the 'filename' with the actual name of the file.
Once you open a file with Nano, you can use the following basic commands:
Commands Purpose
Ctrl + G Display help
Ctrl + W Search for a pattern
Ctrl + O Save changes to the file
Ctrl + X Exit the Nano editor
Conclusion
Nano is now installed on your Alpine Linux system, and you can use this user-friendly text editor to edit and save files from your terminal. If you face any issues during the installation process or have any questions, feel free to consult Nano's documentation or Alpine Linux support resources.
If you want to self-host in an easy, hands free way, need an external IP address, or simply want your data in your own hands, give IPv6.rs a try!
Alternatively, for the best virtual desktop, try Shells!
|
{
"url": "https://ipv6.rs/tutorial/Alpine_Linux_Latest/Nano/",
"source_domain": "ipv6.rs",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "11762",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CEZAKZ6VI2QWYCFLIJSJ47H6KOPUGIKH",
"WARC-Concurrent-To": "<urn:uuid:2c7edaea-1d1f-470c-b692-4ced306e7d5b>",
"WARC-Date": "2024-08-05T16:44:48Z",
"WARC-IP-Address": "172.233.129.37",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GOZPKRSUP3BVC5ARWXR4L7LNYSLKCT2I",
"WARC-Record-ID": "<urn:uuid:c2bee63a-2f0e-46b6-a92f-ebf0c2827116>",
"WARC-Target-URI": "https://ipv6.rs/tutorial/Alpine_Linux_Latest/Nano/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1044d4de-4074-4399-8190-9ccd56e29123>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-209\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,
43,
44,
213,
214,
243,
244,
424,
425,
441,
442,
489,
490,
568,
569,
587,
588,
661,
662,
695,
696,
796,
797,
805,
806,
875,
876,
904,
905,
964,
965,
979,
980,
1037,
1038,
1112,
1113,
1130,
1152,
1182,
1216,
1246,
1247,
1258,
1259,
1555,
1556,
1702,
1703
],
"line_end_idx": [
43,
44,
213,
214,
243,
244,
424,
425,
441,
442,
489,
490,
568,
569,
587,
588,
661,
662,
695,
696,
796,
797,
805,
806,
875,
876,
904,
905,
964,
965,
979,
980,
1037,
1038,
1112,
1113,
1130,
1152,
1182,
1216,
1246,
1247,
1258,
1259,
1555,
1556,
1702,
1703,
1759
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1759,
"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.3514285683631897,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01714286021888256,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1428571343421936,
"rps_doc_frac_unique_words": 0.46464645862579346,
"rps_doc_mean_word_length": 4.683501720428467,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.564826011657715,
"rps_doc_word_count": 297,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.14378145337104797,
"rps_doc_frac_chars_dupe_6grams": 0.046010058373212814,
"rps_doc_frac_chars_dupe_7grams": 0.046010058373212814,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04744787886738777,
"rps_doc_frac_chars_top_3gram": 0.05463695153594017,
"rps_doc_frac_chars_top_4gram": 0.03235083073377609,
"rps_doc_books_importance": -150.97158813476562,
"rps_doc_books_importance_length_correction": -142.6178741455078,
"rps_doc_openwebtext_importance": -80.24170684814453,
"rps_doc_openwebtext_importance_length_correction": -80.24170684814453,
"rps_doc_wikipedia_importance": -72.6009521484375,
"rps_doc_wikipedia_importance_length_correction": -68.76578521728516
},
"fasttext": {
"dclm": 0.7010685205459595,
"english": 0.820833683013916,
"fineweb_edu_approx": 2.274428606033325,
"eai_general_math": 0.4313843250274658,
"eai_open_web_math": 0.10950381308794022,
"eai_web_code": 0.570493221282959
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.435",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,387,957,360,824,005,600
|
Saturday, January 24, 2015
A Surprise Synchronization Context Gotcha
I got into an interesting argument conversation with a co worker last week about whether async/ await was multi-threaded. He thought I was bonkers for suggesting it was not multi-threaded. So I did some research.
First off, obviously if you're if you're doing async/await it's probably because you want some multithreaded behavior like network IO or file IO where some other thread does some work for you while freeing your UI thread to handle UI stuff (or in the case of IIS, releasing your thread to handle other incoming requests, thus giving you better throughput). So my co-worker was right that 99% of the time async/await will probably involve multiple threads.
However, if async/await were multi-threaded by it's very nature, then it should be impossible to write a program using async/await that was single-threaded. So let's try to write a method that we can prove is single-threaded that also uses async/await. How about this:
public async void HandleClickEvent()
{
await Task.Yield();
j = 1;
while (j != 0)
{
if (j == -1) j++;
j++;
}
await Task.Yield();
}
It took some work to come up with an infinite loop that looked normal to the compiler, but that's what the while loop is doing. If async/await were multi-threaded, then we might think that the UI thread would hit the first Task.Yield and spawn off a new thread. Then the infinite loop would be run on a new thread and the UI would work great, right?
If we actually run that code in a Windows Store app the UI freezes. Why? Because, according to MSDN:
The async and await keywords don't cause additional threads to be created. Async methods don't require multithreading because an async method doesn't run on its own thread. The method runs on the current synchronization context and uses time on the thread only when the method is active. You can use Task.Run to move CPU-bound work to a background thread, but a background thread doesn't help with a process that's just waiting for results to become available.
So when I claimed async/await wasn't multi-threaded I was thinking of that. What's basically happening is that the UI thread is a message pump that processes events, and when you await within the UI thread's synchronization context you yield control to the UI thread's message pump, which allows it to process UI events and such. When your awaited call returns it throws an event back to the UI thread's message pump and the UI thread gets back to your method when it's done with anything else it's working on.
But after some research I realized that I didn't know nearly enough about synchronization contexts and so I spent the morning reading about them. After a lot of research I finally found someone that has a great description of how all this works under the covers and if you get the chance I highly recommend reading C# MVP Jerome Laban's awesome series C# 5.0 Async Tips and Tricks.
In particular one thing I learned is that if you start a new Task, you throw away the UI thread's synchronization context. If you await when there is no synchronization context, then by default WinRt will give you some random thread from the thread pool, which may be different after each await. In other words if you do this:
public async Task RefreshAvailableAssignments()
{
await Task.Run(async () =>
{
Debug.WriteLine(Environment.CurrentManagedThreadId);
await Task.Yield();
Debug.WriteLine(Environment.CurrentManagedThreadId);
});
}
You will (usually) get a different thread after the yield than you did before it. That can lead to trouble if you aren't careful and aren't aware of it. It can be especially dangerous if you're deep in the guts of something and you aren't 100% sure of whether you are being called from the UI thread or from some other thread. It can be particularly bad if someone after you decides to put your code into a Task.Run and you were dependent upon the UI thread's synchronization context without being aware of it. Nasty, huh?
It makes me like more and more the idea introduced in the post by Jason Gorman entitled Can Restrictive Coding Standards Make Us More Productive? where he describes ways of discouraging team members from starting new threads (or Tasks on my project since WinRt doesn't give us Thread's) unless there is a really good reason for doing so.
It goes back to a most excellent statement my co-worker made:
Async/await is very powerful, but we all knows what comes with great power.
So that was fun. I look forward to having lots more constructive arguments conversations like this one in the future. :)
Wednesday, January 7, 2015
The TFS 2013 + Git API Disaster
Don't get me wrong, the addition of Git to TFS is huge, and it actually removes all of my previous complains about the platform. Sadly, the API's for it aren't up to par yet, the documentation is poor, and the technology is so young that the Internet is completely silent on how to programmatically accomplish just about anything with it.
So after about 24 total hours of wasting time searching the internet, decompiling source, watching network traffic on Fiddler, and triggering builds I have some working code (and a bit of a rant) that I wanted to share to help fill out the Internet (because clearly it doesn't contain enough ranting; but at least this one has working code).
API #Fail
As my regular readers no doubt know I occupy my spare time running Siren of Shame, a build monitor, USB siren, and CI gamification engine. The software needs to work such that when a continuous integration build is triggered it needs to determine which check-in triggered the build and give that user credit for the check-in (or exude a little light hearted shame on failure).
For every other major CI server in the world this is pretty easy. TFS 2013 + Git? Not so much. If it worked the way it should you could simply do this:
var query = _buildServer.CreateBuildDetailSpec(buildDefinitionUris);
query.MaxBuildsPerDefinition = 1;
query.Status = Microsoft.TeamFoundation.Build.Client.BuildStatus.All;
query.QueryOrder = BuildQueryOrder.FinishTimeDescending;
// this gets changesets (TFVC) as well as commits (Git)
query.InformationTypes = new[] { "AssociatedChangeset", "AssociatedCommit" };
var buildQueryResult = _buildServer.QueryBuilds(query);
var buildDetail = buildQueryResult.Builds[0];
var commits = buildDetail.Information.GetNodesByType("AssociatedCommit");
And it wouldn't even require a second web request to get the triggering commit.
Sadly, the above only works for completed builds. In-progress builds return nothing in AssociatedCommit().
That's the older, strongly typed API that requires referencing Microsoft.TeamFoundation.Build.Client.dll (which you can find in the GAC). With TFS 2013, there is now also a TFS Web API. Sadly even the equivalent new Web API methods have the same limitation. For example if build 5 were in progress then this:
GET http://myserver:8080/defaultcollection/project/_apis/build/builds/5/details?api-version=1.0&types=AssociatedCommit&types=AssociatedChangeset
Wouldn't return the associated commit until it completed.
So, for in-progress builds you're stuck doing a second query.
More API #Fail
Ideally at this point you would use the powerful and convenient QueryHistory() method. Using it looks something like this:
var workspaceServerMappings = _buildDefinition.Workspace.Mappings
.Where(m => m.MappingType != WorkspaceMappingType.Cloak)
.Select(m => m.ServerItem);
var workspaceMappingServerUrl = workspaceMappingServerMappings[0];
// p.s. GetService() is a dumb way to get services, why not just make
// it dynamic, it’s just as undiscoverable
var
versionControlServer = _tfsTeamProjectCollection.GetService<VersionControlServer>();
// notice the workspace server mapping url is a parameter. This facilitates onne web call
var
changesets = versionControlServer.QueryHistory(workspaceMappingServerUrl,
version: VersionSpec.Latest,
deletionId: 0,
recursion: RecursionType.Full,
user: null,
versionFrom: null,
versionTo: VersionSpec.Latest,
maxCount: 1,
includeChanges: true,
slotMode: false,
includeDownloadInfo: true);
Sadly this only works for changesets; in other words traditional Team Foundation Version Control (TFVC) checkins. It doesn't work for Git, despite that what we want to accomplish is so very, very similar (i.e. couldn't we just throw in an overload that asks for the branch you're querying against?).
But Wait, There's More
As far as I can tell there is only one remaining option. It's the new TFS Rest API.
There are two ways to use it. The documentation says to use an HttpClient, but there's also a nice convenience wrapper that you can get by adding a reference to Microsoft.TeamFoundation.SourceControl.WebApi.dll, which you can find in the GAC. Using this approach if you write something like this:
var vssCredentials = new VssCredentials(new WindowsCredential(_networkCredential));
GitHttpClient
client = new GitHttpClient(projectCollectionUri, vssCredentials)
// unnecessary web request #1: get the list of all repositories to get our repository id (guid)
var repositories = await client.GetRepositoriesAsync();
// sadly the workspace server mapping in the build definition barely resembles the repository Name, thus the EndsWith()
var
repository = repositories.FirstOrDefault(i => workspaceMappingServerUrl.EndsWith(i.Name));
var repositoryId = repository.Id;
// unnecessary web request #2: the workspace server mapping told us which server path triggered the build, but it #FAIL’ed to tell us which branch, so we have to scan them all!!!
var
branches = await client.GetBranchRefsAsync(repositoryId);
List<GitCommitRef> latestCommitForEachBranch = new List<GitCommitRef>();
foreach (var branchRef in branches)
{
// branchRef.Name = e.g. 'refs/heads/master', but GetBranchStatisticsAsync() needs just 'master'
var branchName = branchRef.Name.Split('/').Last();
// Ack! Unnecessary web requests #3 through (number of branches + 2)!!!
// p.s. repositoryId.ToString()? Can we please be consistent with data types!?
var gitBranchStats = await client.GetBranchStatisticsAsync(repositoryId.ToString(), branchName);
latestCommitForEachBranch.Add(gitBranchStats.Commit);
}
var lastCheckinAcrossAllBranches = latestCommitForEachBranch.Aggregate((i, j) => i.Author.Date > j.Author.Date ? i : j);
I've documented everything I hate about this in comments, but the most important point is this: The workspace mapping API for build definitions (which says which folder(s) trigger the build) fails to include a branch property. This is true even for the Web API's. For instance:
http://tfsserver:8080/tfs/DefaultCollection/_apis/build/definitions/1?api=1.0
Fails to tell us anything about the workspace mappings. This API omission forces you to query all branches, which requests lots of web requests. Specifically it requires the number of pushed branches plus two web requests in order to find the latest check-in across all branches. This could be insanely expensive, and it might not even be correct in some circumstances.
Is There No Better Way?
As nice as the strongly typed API approach sounds, it turns out to be missing a number of API's that you can get to if you use a WebClient to request them manually. Specifically if you use the web API directly you can issue a single request against the commits endpoint to get the latest commit across all branches.
Sadly, the authentication via WebClient is a bit tricky and is dependent upon whether you are using a locally hosted TFS or Visual Studio Online. For this reason you're better off with some helper methods:
///
/// This method handles requests to the TFS api + authentication
///
public async Task ExecuteGetHttpClientRequest(string relativeUrl, Func<dynamic, T> action)
{
using (var webClient = GetRestWebClient())
{
string fullUrl = Uri + relativeUrl;
var resultString = await webClient.DownloadStringTaskAsync(fullUrl);
dynamic deserializedResult = JsonConvert.DeserializeObject(resultString);
return action(deserializedResult.value);
}
}
public WebClient GetRestWebClient()
{
var webClient = new WebClient();
if (MyTfsServer.IsHostedTfs)
{
SetBasicAuthCredentials(webClient);
}
else
{
SetNetworkCredentials(webClient);
}
webClient.Headers.Add(HttpRequestHeader.ContentType, "application/json; charset=utf-8");
return webClient;
}
///
/// Using basic auth via network headers should be unnecessary, but with hosted TFS the NetworkCredential method
/// just doesn't work. Watch it in Fiddler and it just isn't adding the Authentication header at all.
///
///
private void SetBasicAuthCredentials(WebClient webClient)
{
var authenticationHeader = GetBasicAuthHeader();
webClient.Headers.Add(authenticationHeader);
}
public NameValueCollection GetBasicAuthHeader()
{
const string userName = "username";
const string password = "password";
string usernamePassword = Convert.ToBase64String(System.Text.Encoding.ASCII.GetBytes(string.Format("{0}:{1}", userName, password)));
return new NameValueCollection
{
{"Authorization", "basic" + usernamePassword}
};
}
private void SetNetworkCredentials(WebClient webClient)
{
var networkCredentials = new NetworkCredential("username", "password");
webClient.UseDefaultCredentials = networkCredentials == null;
if (networkCredentials != null)
{
webClient.Credentials = networkCredentials;
}
}
Wow. That's a lot of boilerplate setup code. Now to actually use it to retrieve check-in information associated with a build:
// Get all repositories so we can find the id of the one that matches our workspace server mapping
var repositoryId = await _myTfsProject.ProjectCollection.ExecuteGetHttpClientRequest<Guid?>("/_apis/git/repositories", repositories =>
{
foreach (var workspaceMappingServerUrl in workspaceMappingServerUrls)
{
foreach (var repository in repositories)
{
string repositoryName = repository.name;
if (workspaceMappingServerUrl.EndsWith(repositoryName))
{
return repository.id;
}
}
}
return null;
});
// now get commits for the repository id we just retrieved. This will get the most recent across all branches, which is usually good enough
var getCommitsUrl = "/_apis/git/repositories/" + repositoryId + "/commits?top=1";
var commit = await _myTfsProject.ProjectCollection.ExecuteGetHttpClientRequest(getCommitsUrl, commits =>
{
var comment = commits[0].comment;
var author = commits[0].author.name;
return new CheckinInfo
{
Comment = comment,
Committer = author
};
});
return commit;
Is this absolutely terrible? Perhaps not But it is a lot of code to do something that used to be quite simple with TFVC and is quite simple with all other build servers (or at least those I have experience with, specifically: Hudson, Jenkins, Team City, Bamboo, CruiseControl, and Travis).
Summary
So that's my story and I'm sticking to it. If any readers find a better approach please post in the comments, send me a note at @lprichar, issue a pull request against my CheckinInfoGetterService.cs where you can find the full source for this article, and/or comment on this SO article where I originally started this terrible journey. Hopefully this will save someone else some time -- if not in the solution, perhaps in the following advice: if you value your time avoid the TFS Git API.
|
{
"url": "http://www.leerichardson.com/2015/01/",
"source_domain": "www.leerichardson.com",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "151686",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JXLAG5TMAR4I2EM7LWU63VEOQL5C4JKU",
"WARC-Concurrent-To": "<urn:uuid:af00fab6-3c19-4ebf-9b3d-ec2c5358cea1>",
"WARC-Date": "2018-08-18T09:03:50Z",
"WARC-IP-Address": "172.217.7.211",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LWD35GPZ6HGRBBIKA7KXT3CPFITRNGQG",
"WARC-Record-ID": "<urn:uuid:92c98a6b-2d32-43ba-a8ab-e566489da2b1>",
"WARC-Target-URI": "http://www.leerichardson.com/2015/01/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5efa2158-45e4-4310-96fc-d7764ab33642>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-11-199-188.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
27,
28,
70,
71,
286,
287,
744,
745,
1016,
1017,
1054,
1056,
1080,
1091,
1110,
1116,
1142,
1155,
1161,
1185,
1187,
1188,
1540,
1541,
1644,
1645,
2106,
2619,
2620,
3003,
3004,
3333,
3334,
3382,
3384,
3415,
3421,
3482,
3510,
3571,
3579,
3580,
3582,
3583,
4110,
4111,
4449,
4450,
4512,
4588,
4711,
4712,
4739,
4740,
4772,
4773,
5113,
5114,
5115,
5116,
5458,
5459,
5469,
5470,
5471,
5848,
5849,
6004,
6005,
6074,
6108,
6178,
6235,
6291,
6369,
6370,
6426,
6427,
6473,
6474,
6548,
6549,
6629,
6630,
6738,
6739,
7050,
7051,
7196,
7197,
7255,
7256,
7318,
7319,
7334,
7335,
7336,
7460,
7461,
7527,
7588,
7620,
7687,
7757,
7804,
7805,
7809,
7894,
7984,
7988,
8062,
8095,
8114,
8149,
8165,
8188,
8223,
8240,
8266,
8287,
8288,
8320,
8321,
8622,
8623,
8646,
8647,
8648,
8733,
8734,
9033,
9034,
9118,
9132,
9197,
9198,
9294,
9350,
9351,
9471,
9475,
9566,
9600,
9601,
9780,
9784,
9842,
9843,
9916,
9952,
9954,
10055,
10110,
10186,
10269,
10370,
10428,
10430,
10431,
10552,
10553,
10833,
10834,
10912,
10913,
11286,
11287,
11311,
11312,
11313,
11630,
11631,
11838,
11839,
11843,
11844,
11909,
11913,
11914,
12005,
12007,
12054,
12060,
12104,
12181,
12263,
12312,
12318,
12320,
12321,
12357,
12359,
12396,
12429,
12435,
12479,
12485,
12494,
12500,
12542,
12548,
12641,
12663,
12665,
12666,
12670,
12671,
12784,
12887,
12891,
12892,
12896,
12954,
12956,
13009,
13058,
13060,
13108,
13110,
13150,
13190,
13327,
13362,
13368,
13422,
13429,
13431,
13487,
13489,
13565,
13631,
13667,
13673,
13725,
13731,
13733,
13861,
13960,
14095,
14097,
14171,
14177,
14226,
14236,
14289,
14357,
14371,
14409,
14423,
14433,
14439,
14456,
14460,
14601,
14683,
14788,
14790,
14828,
14869,
14896,
14902,
14929,
14956,
14963,
14967,
14982,
15274,
15275,
15283,
15284
],
"line_end_idx": [
27,
28,
70,
71,
286,
287,
744,
745,
1016,
1017,
1054,
1056,
1080,
1091,
1110,
1116,
1142,
1155,
1161,
1185,
1187,
1188,
1540,
1541,
1644,
1645,
2106,
2619,
2620,
3003,
3004,
3333,
3334,
3382,
3384,
3415,
3421,
3482,
3510,
3571,
3579,
3580,
3582,
3583,
4110,
4111,
4449,
4450,
4512,
4588,
4711,
4712,
4739,
4740,
4772,
4773,
5113,
5114,
5115,
5116,
5458,
5459,
5469,
5470,
5471,
5848,
5849,
6004,
6005,
6074,
6108,
6178,
6235,
6291,
6369,
6370,
6426,
6427,
6473,
6474,
6548,
6549,
6629,
6630,
6738,
6739,
7050,
7051,
7196,
7197,
7255,
7256,
7318,
7319,
7334,
7335,
7336,
7460,
7461,
7527,
7588,
7620,
7687,
7757,
7804,
7805,
7809,
7894,
7984,
7988,
8062,
8095,
8114,
8149,
8165,
8188,
8223,
8240,
8266,
8287,
8288,
8320,
8321,
8622,
8623,
8646,
8647,
8648,
8733,
8734,
9033,
9034,
9118,
9132,
9197,
9198,
9294,
9350,
9351,
9471,
9475,
9566,
9600,
9601,
9780,
9784,
9842,
9843,
9916,
9952,
9954,
10055,
10110,
10186,
10269,
10370,
10428,
10430,
10431,
10552,
10553,
10833,
10834,
10912,
10913,
11286,
11287,
11311,
11312,
11313,
11630,
11631,
11838,
11839,
11843,
11844,
11909,
11913,
11914,
12005,
12007,
12054,
12060,
12104,
12181,
12263,
12312,
12318,
12320,
12321,
12357,
12359,
12396,
12429,
12435,
12479,
12485,
12494,
12500,
12542,
12548,
12641,
12663,
12665,
12666,
12670,
12671,
12784,
12887,
12891,
12892,
12896,
12954,
12956,
13009,
13058,
13060,
13108,
13110,
13150,
13190,
13327,
13362,
13368,
13422,
13429,
13431,
13487,
13489,
13565,
13631,
13667,
13673,
13725,
13731,
13733,
13861,
13960,
14095,
14097,
14171,
14177,
14226,
14236,
14289,
14357,
14371,
14409,
14423,
14433,
14439,
14456,
14460,
14601,
14683,
14788,
14790,
14828,
14869,
14896,
14902,
14929,
14956,
14963,
14967,
14982,
15274,
15275,
15283,
15284,
15775
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 15775,
"ccnet_original_nlines": 270,
"rps_doc_curly_bracket": 0.0031695698853582144,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3331156075000763,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02677988074719906,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25473546981811523,
"rps_doc_frac_unique_words": 0.3663270175457001,
"rps_doc_mean_word_length": 5.8641438484191895,
"rps_doc_num_sentences": 195,
"rps_doc_symbol_to_word_ratio": 0.002612669952213764,
"rps_doc_unigram_entropy": 5.90642786026001,
"rps_doc_word_count": 2061,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01638258993625641,
"rps_doc_frac_chars_dupe_6grams": 0.00794306956231594,
"rps_doc_frac_chars_dupe_7grams": 0.0038060599472373724,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.004550720099359751,
"rps_doc_frac_chars_top_3gram": 0.004964420106261969,
"rps_doc_frac_chars_top_4gram": 0.006701970007270575,
"rps_doc_books_importance": -1142.473388671875,
"rps_doc_books_importance_length_correction": -1142.473388671875,
"rps_doc_openwebtext_importance": -532.5039672851562,
"rps_doc_openwebtext_importance_length_correction": -532.5039672851562,
"rps_doc_wikipedia_importance": -313.9411315917969,
"rps_doc_wikipedia_importance_length_correction": -313.9411315917969
},
"fasttext": {
"dclm": 0.6073999404907227,
"english": 0.8195281028747559,
"fineweb_edu_approx": 1.8873298168182373,
"eai_general_math": 0.1316317319869995,
"eai_open_web_math": 0.15244543552398682,
"eai_web_code": 0.2876918315887451
}
}
|
{
"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": "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": "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": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,986,476,641,982,326,300
|
Ben Nadel
On User Experience (UX) Design, JavaScript, ColdFusion, Node.js, Life, and Love.
Ben Nadel at CFUNITED 2008 (Washington, D.C.) with: Qasim Rasheed and Sana Ullah
Ben Nadel at CFUNITED 2008 (Washington, D.C.) with: Qasim Rasheed ( @qasimrasheed ) and Sana Ullah
Ask Ben: Dynamic Table Names In ColdFusion Queries
By Ben Nadel on
This question was a bit lengthy, but it basically came down to creating dynamic table names in ColdFusion queries. The questioner was attempting to do something like this:
• FROM table_<cfqueryparam value="#arguments.suffix#" />
I have never seen this work. As much as I love ColdFusion's CFQueryParam tag (it really is the bomb-digity), I think when it comes to creating dynamic table names in ColdFusion queries, you just have to use the good-old hash signs:
• FROM #table_name#
Of course, once we do this, we do open ourselves up to some potential danger. If these are system-based values, such as application-scoped names:
• FROM #APPLICATION.ProductTable#
... then you are safe. If these dynamic table names are fairly static and just part of some package configuration, then go ahead and use them without concern - only you can do harm in this scenario. However, if a user has any influence at all over which table can be selected wether through a link or a form submission, then we have to really lock the code down.
In cases where my table selection is user-based (even if it is an administrative user), I have put in one of two types of security. I either CFParam the table name using a regular expression in such a way that only acceptable tables can be used:
• <!---
• Check to make sure that the user-selected table is a
• valid table for this situation.
• --->
• <cfparam
• name="URL.table"
• type="regex"
• pattern="contact|company|vendor|partner"
• />
What this does is create a pipe-delimited list of viable table names that the user may select. If the user selects a table that is not valid (or tries to hack the URL or FORM submission), then ColdFusion will throw a validation error.
I have also performed this same type security logic using a standard ColdFusion list:
• <!--- Make sure a table is passed in. --->
• <cfparam name="URL.table" type="string" />
•
• <!--- Make sure this table is valid. --->
• <cfif NOT ListFind( "contact,company,vendor,partner", URL.table )>
•
• <!--- The selected table was not valid. Throw error. --->
• <cfthrow
• type="InvalidTable"
• message="You have selected an invalid table."
• detail="The table that you selected, [#URL.table#], is not a valid choice on this page."
• />
•
• </cfif>
This is doing the same things as the ColdFusion CFParam tag but allows us to handle errors in a slightly different way (by manually throwing them rather than catching validation exceptions).
Either way, once you are sure that the user-selected table is valid, I would say that there is nothing wrong with just throwing that table name into the dynamic query using hash signs:
• FROM #URL.table#
I hope that helps.
Reader Comments
You should really be using parameters for 'constant' values in SQL as it affects the database's execution plan (this includes fixed value in your where clause). So the plain text approach is the way to go. :)
Oops type above should read:
"You shouldn't really be using parameters for 'constant' values in SQL as it affects the database's execution plan (this includes fixed value in your where clause). So the plain text approach is the way to go. :)"
Sorry!
Just regarding this:
{quote}
FROM table_<cfqueryparam value="#arguments.suffix#" />
I have never seen this work. As much as I love ColdFusion's CFQueryParam tag
{quote}
One should not expect it to work. <cfqueryparam> is for setting paramater values. It has the dual purpose of where the parameter will be used in the SQL, as well as taking the value for the parameter. It's not simply for validated string substitution, and can't be used for "building" SQL.
If one looks at the SQL being passed when using <cfqueryparam> (in debug, or dumping the RESULT of the query), one doesn't end up with the values of the params simply inserted into the rest of the SQL; a marker is placed in the SQL where the parameter should go, and the value is sent separately.
In short, a parameter - and this has nothing to do with how mcfqueryparam> works, it's how SQL *parameters* work - can be used for a static *value*. Not part of the SQL (like SELECT or WHERE), or not in any reference to the DB schema (such as table names or column names, etc).
Ben, you may well know this, but you sounded a bit vague in your statement.
--
Adam
@Ben - it's certainly easier to read!
I really hope CF9 supports a cfscript version cfqueryparam something like:
WHERE is_deleted = #QueryParam(myvar, 'cf_sql_bit')#
which is much nicer than:
WHERE is_deleted = <cfqueryparam value="1" cfsqltype="cf_sql_bit" />
Hi Ben!
Thanks for answering my question - so quick too! As I mentioned, I'm not too familiar with certain parts of ColdFusion so this does clear a few things up for me.
While there are a lot of tutorials and code examples on the Internet, I find it hard to locate information on "best practices". If only we could log a few of these on a website somewhere, that would be sweet - because sometimes I'm not always sure if what I am doing is the best approach...then again, every application is usually different I suppose.
Many thanks for your help once again - you are really great at what you do!
Cheers,
Mikey.
@John Wish
Hey John,
Could you just write a user defined function for this called "queryParam"? Hmm, actually, on second thoughts, I'm not sure what would happen using this tag outside of a CFQUERY tag. Probably wouldn't work. Meh!
But yeah, looks a bit nicer doesn't it! :)
I think this is a case of someone hearing that cfqueryparam is "A Good Thing" but not understanding why. The result is, they just naturally think that if a few cfqueryparams are good, then more of them are better.
cfqueryparam solves two problems: 1) it helps guard against sql injection attacks. 2) it allows the database to cache the execution plan.
The reason sql injection attacks happen is that you have to get data from a user, and you have to pass that data on to the database. Seeing cfqueryparam used to construct a table name makes me think (as you did) that maybe the person who asked this question is getting a table name, or part of a table name from the user. That would be a really really bad idea, and I'm glad that you covered that. Even if cfqueryparam allowed you to specify a table name, it would not protect against sql injection in this case. Your note about using the cfparam tag is the way to go.
In summary - potentially really tremendously awe-inspiringly dangerous things going on here.
I do this sort of thing quite often and I don't feel like I'm opening myself up to a can of worms because I always use forms and I always explicitly control what get's passed to the CFC responsible for making the dynamic SQL. Basically if you allow the user to form the queries using only cfselect lists then you can avoid an injection attack. I typically will throw the table names in a cfselect and pass that to the CFC to dynamically make the query and return the results. If you allow users to key the table name into the form then you're asking for it and you probably will get hacked as somebody is going to come along and get mid-evil on your CFC.
@Andy: "Basically if you allow the user to form the queries using only cfselect lists then you can avoid an injection attack."
What is there to stop someone from selecting "file/save as" in their browser, then editing the form to add something to the select box, then hitting the submit button?
(or if you prefer, using a browser plugin like firebug)
I really don't think that cfselect protects you from an injection attack. You still have to manually check the input on the server side. If you disagree, I'd like to see the code.
I'm populating a cfselect list using a query returned from a cfc (querying a database table full of acceptable table names that can be used for query). I fail to see how this is some giant security hole. It seems as though you're implying that someone is going to save a copy of my page, edit it and then upload it as a malicious cfm page onto the server and then execute it. If you have that going on (your sever is open to the world) then you've got a lot more to be concerned about than just SQL queries.
Andy,
The attacker don't need to upload a malicious cfm page on your server. He just save the file on his own hard-drive, edit the code of the HTML (action attribute of the form and options of the select input), then he just open the modified file locally with his browser and submit it. The action attribute of the form can be change to http://www.yoursite.com/yourcfmpage.cfm and the data of the form will be sent to your cfm page. That's it, SQL Injection is done.
You always need to control what is coming from the user (url, form, cookie) because they can modify them in many ways.
This is a stupid argument. My code checks the value against my table in the database - see what I mean? It is not like I'm saying that you don't have to perform any validation on the back end.
Hi
This is satyam
can u tell me how to convert one application into multiple languages.
Suppose one person develop the application in English language how to convert that into another languages.
Regards,
Satyam
@ satyam, Google Translate is your answer, Another way is to to create resource files for each language and then configure with CF to run it
Hi ben!
I have a Question here, I am listing the columns from a query which is a Join of two tables and it has some fields which is defined in both, we had maked it different as by using the tablename, my question is i am trying to search by choosing the column and and clicking on Search, how the query Knows which column of the table to refer to
|
{
"url": "https://www.bennadel.com/blog/1396-ask-ben-dynamic-table-names-in-coldfusion-queries.htm",
"source_domain": "www.bennadel.com",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "33974",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CX4SLJPGUBDLHL2QTXKBDBQETJMIE3J6",
"WARC-Concurrent-To": "<urn:uuid:064dcb6b-6c58-4603-8026-9a06484d88b3>",
"WARC-Date": "2019-08-21T15:41:14Z",
"WARC-IP-Address": "184.175.125.55",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:S37ZMO6XPXKHG3EHRGQ57ARIGRGW2UAW",
"WARC-Record-ID": "<urn:uuid:cde12eda-2930-4165-abd2-e27695be02a1>",
"WARC-Target-URI": "https://www.bennadel.com/blog/1396-ask-ben-dynamic-table-names-in-coldfusion-queries.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8b2440da-ee5e-4c3c-add7-6a36108eeab7>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-214.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
10,
91,
172,
271,
272,
323,
324,
340,
341,
513,
514,
573,
574,
806,
807,
829,
830,
976,
977,
1013,
1014,
1377,
1378,
1624,
1625,
1635,
1692,
1728,
1737,
1750,
1771,
1788,
1833,
1840,
1841,
2076,
2077,
2163,
2164,
2211,
2258,
2264,
2310,
2381,
2387,
2449,
2462,
2486,
2536,
2629,
2636,
2642,
2654,
2655,
2846,
2847,
3032,
3033,
3054,
3055,
3074,
3075,
3076,
3092,
3093,
3302,
3303,
3332,
3546,
3553,
3554,
3575,
3576,
3584,
3639,
3716,
3724,
3725,
4015,
4016,
4313,
4314,
4592,
4593,
4669,
4670,
4673,
4678,
4679,
4717,
4718,
4793,
4794,
4847,
4848,
4874,
4875,
4944,
4945,
4953,
4954,
5116,
5117,
5469,
5470,
5546,
5547,
5555,
5562,
5563,
5574,
5575,
5585,
5586,
5797,
5798,
5841,
5842,
6056,
6057,
6195,
6196,
6765,
6766,
6859,
6860,
7515,
7516,
7643,
7644,
7812,
7813,
7869,
7870,
8050,
8051,
8559,
8560,
8566,
8567,
9029,
9030,
9149,
9150,
9343,
9344,
9347,
9362,
9432,
9539,
9540,
9549,
9556,
9557,
9698,
9699,
9707,
9708
],
"line_end_idx": [
10,
91,
172,
271,
272,
323,
324,
340,
341,
513,
514,
573,
574,
806,
807,
829,
830,
976,
977,
1013,
1014,
1377,
1378,
1624,
1625,
1635,
1692,
1728,
1737,
1750,
1771,
1788,
1833,
1840,
1841,
2076,
2077,
2163,
2164,
2211,
2258,
2264,
2310,
2381,
2387,
2449,
2462,
2486,
2536,
2629,
2636,
2642,
2654,
2655,
2846,
2847,
3032,
3033,
3054,
3055,
3074,
3075,
3076,
3092,
3093,
3302,
3303,
3332,
3546,
3553,
3554,
3575,
3576,
3584,
3639,
3716,
3724,
3725,
4015,
4016,
4313,
4314,
4592,
4593,
4669,
4670,
4673,
4678,
4679,
4717,
4718,
4793,
4794,
4847,
4848,
4874,
4875,
4944,
4945,
4953,
4954,
5116,
5117,
5469,
5470,
5546,
5547,
5555,
5562,
5563,
5574,
5575,
5585,
5586,
5797,
5798,
5841,
5842,
6056,
6057,
6195,
6196,
6765,
6766,
6859,
6860,
7515,
7516,
7643,
7644,
7812,
7813,
7869,
7870,
8050,
8051,
8559,
8560,
8566,
8567,
9029,
9030,
9149,
9150,
9343,
9344,
9347,
9362,
9432,
9539,
9540,
9549,
9556,
9557,
9698,
9699,
9707,
9708,
10047
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10047,
"ccnet_original_nlines": 158,
"rps_doc_curly_bracket": 0.000398130010580644,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4430147111415863,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03722425922751427,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1819852888584137,
"rps_doc_frac_unique_words": 0.32083094120025635,
"rps_doc_mean_word_length": 4.442008018493652,
"rps_doc_num_sentences": 103,
"rps_doc_symbol_to_word_ratio": 0.007352939806878567,
"rps_doc_unigram_entropy": 5.533998012542725,
"rps_doc_word_count": 1733,
"rps_doc_frac_chars_dupe_10grams": 0.10444270819425583,
"rps_doc_frac_chars_dupe_5grams": 0.13665887713432312,
"rps_doc_frac_chars_dupe_6grams": 0.12886464595794678,
"rps_doc_frac_chars_dupe_7grams": 0.11639387160539627,
"rps_doc_frac_chars_dupe_8grams": 0.11639387160539627,
"rps_doc_frac_chars_dupe_9grams": 0.10444270819425583,
"rps_doc_frac_chars_top_2gram": 0.006495189853012562,
"rps_doc_frac_chars_top_3gram": 0.008833459578454494,
"rps_doc_frac_chars_top_4gram": 0.00740452017635107,
"rps_doc_books_importance": -1015.9081420898438,
"rps_doc_books_importance_length_correction": -1015.9081420898438,
"rps_doc_openwebtext_importance": -575.3717041015625,
"rps_doc_openwebtext_importance_length_correction": -575.3717041015625,
"rps_doc_wikipedia_importance": -422.1347351074219,
"rps_doc_wikipedia_importance_length_correction": -422.1347351074219
},
"fasttext": {
"dclm": 0.16819393634796143,
"english": 0.9237461686134338,
"fineweb_edu_approx": 1.8432210683822632,
"eai_general_math": 0.7223113179206848,
"eai_open_web_math": 0.33149415254592896,
"eai_web_code": 0.6112521886825562
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,952,635,508,307,816,000
|
• Create BookmarkCreate Bookmark
• Create Note or TagCreate Note or Tag
• PrintPrint
Selecting Layers
Because layers are also objects, they have the same set of properties as objects, such as Position, Rotation, and Scale. Changing the parameters of a layer affects all the objects contained in the layer, but not necessarily in the same manner as selecting all the objects directly (see “Transforming Layers,” later in this chapter).
To select a layer:
• In the Layers tab, click the layer row.
When you select a layer, a single bounding box appears in the Canvas around the edges of the entire layer (Figure 4.3).
Figure 4.3. When you select a layer, a bounding box appears around the edges of the entire layer.
To select multiple layers:
• In the Layers tab, click one layer row, then Command-click additional layer rows.
✓ Tip
• If you select a layer row and then Shift-click another layer, you select all the objects in between the layers as well.
• Creative Edge
• Create BookmarkCreate Bookmark
• Create Note or TagCreate Note or Tag
• PrintPrint
|
{
"url": "http://www.creativeedge.com/book/animation-and-3d/0321294580/changing-object-properties/ch04lev1sec2",
"source_domain": "www.creativeedge.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "62377",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PUH6YPCVPQA7TGZ2MJIC5ALM6D7IHJWM",
"WARC-Concurrent-To": "<urn:uuid:667191fe-0c66-41f9-ada7-3ec48f04b284>",
"WARC-Date": "2017-10-17T21:12:27Z",
"WARC-IP-Address": "151.101.32.64",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:3C7WQVEESSRB7PVOOBDSUT2RUVUBDVEH",
"WARC-Record-ID": "<urn:uuid:232bd574-7a93-485b-bbff-998842321690>",
"WARC-Target-URI": "http://www.creativeedge.com/book/animation-and-3d/0321294580/changing-object-properties/ch04lev1sec2",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:68327bd1-4439-43cd-a167-45d854e7bf56>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-0-250.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
35,
76,
91,
92,
109,
110,
443,
444,
463,
464,
508,
509,
633,
634,
736,
737,
738,
765,
766,
852,
853,
859,
860,
984,
985,
986,
1004,
1039,
1080
],
"line_end_idx": [
35,
76,
91,
92,
109,
110,
443,
444,
463,
464,
508,
509,
633,
634,
736,
737,
738,
765,
766,
852,
853,
859,
860,
984,
985,
986,
1004,
1039,
1080,
1094
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1094,
"ccnet_original_nlines": 29,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3194444477558136,
"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.20370370149612427,
"rps_doc_frac_unique_words": 0.43169400095939636,
"rps_doc_mean_word_length": 4.595628261566162,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.9910593032836914,
"rps_doc_word_count": 183,
"rps_doc_frac_chars_dupe_10grams": 0.16884660720825195,
"rps_doc_frac_chars_dupe_5grams": 0.33531510829925537,
"rps_doc_frac_chars_dupe_6grams": 0.33531510829925537,
"rps_doc_frac_chars_dupe_7grams": 0.24019025266170502,
"rps_doc_frac_chars_dupe_8grams": 0.16884660720825195,
"rps_doc_frac_chars_dupe_9grams": 0.16884660720825195,
"rps_doc_frac_chars_top_2gram": 0.035671819001436234,
"rps_doc_frac_chars_top_3gram": 0.057074908167123795,
"rps_doc_frac_chars_top_4gram": 0.0535077303647995,
"rps_doc_books_importance": -130.07630920410156,
"rps_doc_books_importance_length_correction": -130.07630920410156,
"rps_doc_openwebtext_importance": -75.63056182861328,
"rps_doc_openwebtext_importance_length_correction": -66.22607421875,
"rps_doc_wikipedia_importance": -54.396114349365234,
"rps_doc_wikipedia_importance_length_correction": -54.396114349365234
},
"fasttext": {
"dclm": 0.043347541242837906,
"english": 0.814048171043396,
"fineweb_edu_approx": 3.5071768760681152,
"eai_general_math": 0.9294372797012329,
"eai_open_web_math": 0.3345950245857239,
"eai_web_code": 0.302642822265625
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,183,768,585,233,845,000
|
TradeStation Plugin
TradeStation is a Florida-based broker that supports many instruments, including stocks, options, futures, and futures options. The TradeStation plugin was designed specifically to work with TradeStation's v3 Web API. You need Zorro S for using the plugin.
For using the bridge you need an API Key and API Secret. The steps:
User API Key
Password API_Secret(space)Refresh_Token
For the first time authentication described above, the refresh token is not needed.
Example account list entries:
Name,Server,AccountId,User,Pass,Assets,CCY,Real,NFA,Plugin
TS-firsttime,TradeStation,0,abcd,efgh,AssetsTS,USD,1,14,TradeStation.dll
TS-real-margin,TradeStation,1234M,abcd,efgh ijkl,AssetsTS,USD,1,14,TradeStation.dll
TS-real-futures,TradeStation,1234F,abcd,efgh ijkl,AssetsTS,USD,1,14,TradeStation.dll
TS-demo-margin,TradeStation,2345M,abcd,efgh ijkl,AssetsTS,USD,0,14,TradeStation.dll
TS-demo-futures,TradeStation,2345F,abcd,efgh ijkl,AssetsTS,USD,0,14,TradeStation.dll
Example asset list entries:
Name,Price,Spread,RollLong,RollShort,PIP,PIPCost,MarginCost,Market,Multiplier_LotAmount,Commission,Symbol
ESZ21,2576,0.25,0,0,0.25,0.25,160,0.04,-50,1,*
ES-CONT,2576,0.25,0,0,0.25,0.25,160,0.04,-50,1,@ES
AAPL,118.44,0.01,0,0,0.01,0.01,0,2,-100,0.01,*
AMZN,118.44,0.01,0,0,0.01,0.01,0,2,-100,0.01,*
AXP,74.35,0.03,0,0,0.01,0.01,0,2,-100,0.01,*
BA,146.78,0.05,0,0,0.01,0.01,0,2,-100,0.01,*
RRemarks
Supported broker commands
The bridge supports the brokerCommand function with the following commands:
See also:
Brokers, broker plugin, MT4 bridge, Sierra bridge
► latest version online
|
{
"url": "https://zorro-project.com/manual/en/tradestation.htm",
"source_domain": "zorro-project.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "4394",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:S6H2YE5RBYR7B26JOKIYK5QEL5KJ66IA",
"WARC-Concurrent-To": "<urn:uuid:261b3204-3582-4b7e-8907-b5e507eb2cc1>",
"WARC-Date": "2021-10-22T07:43:21Z",
"WARC-IP-Address": "217.160.0.66",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FWTZCMKMO4ZQ6JJREBQVDUDKUKMA3OWQ",
"WARC-Record-ID": "<urn:uuid:f78a9724-e4c9-4481-bd30-02aa3d6237f3>",
"WARC-Target-URI": "https://zorro-project.com/manual/en/tradestation.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a1d127e6-c9e9-4307-9947-ea81bf6536fb>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-88\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
20,
21,
278,
279,
347,
348,
361,
401,
402,
486,
487,
517,
518,
577,
650,
734,
819,
903,
988,
989,
1017,
1018,
1124,
1171,
1222,
1269,
1316,
1361,
1406,
1407,
1416,
1417,
1443,
1444,
1520,
1521,
1531,
1532,
1582,
1583
],
"line_end_idx": [
20,
21,
278,
279,
347,
348,
361,
401,
402,
486,
487,
517,
518,
577,
650,
734,
819,
903,
988,
989,
1017,
1018,
1124,
1171,
1222,
1269,
1316,
1361,
1406,
1407,
1416,
1417,
1443,
1444,
1520,
1521,
1531,
1532,
1582,
1583,
1606
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1606,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0630081295967102,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0630081295967102,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6016260385513306,
"rps_doc_frac_unique_words": 0.6829268336296082,
"rps_doc_mean_word_length": 10.235772132873535,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.255446434020996,
"rps_doc_word_count": 123,
"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.0285941194742918,
"rps_doc_frac_chars_top_3gram": 0.017474189400672913,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -191.2117919921875,
"rps_doc_books_importance_length_correction": -177.50775146484375,
"rps_doc_openwebtext_importance": -34.17162322998047,
"rps_doc_openwebtext_importance_length_correction": -34.17162322998047,
"rps_doc_wikipedia_importance": -75.0562744140625,
"rps_doc_wikipedia_importance_length_correction": -61.48417663574219
},
"fasttext": {
"dclm": 0.05509465932846069,
"english": 0.9007060527801514,
"fineweb_edu_approx": 1.3349223136901855,
"eai_general_math": 0.06941372156143188,
"eai_open_web_math": 0.11145616322755814,
"eai_web_code": 0.4712788462638855
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "332.6",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,854,765,284,506,309,000
|
Home Uncategorized What Is Virtual Data Space?
What Is Virtual Data Space?
The term virtual data space is took out from expenditure banking. When a company acquires information, it must post the information in a safeguarded and private environment that only the relevant get-togethers can enjoy. In contrast, a online data area is a world wide web application which makes collaboration among firms transparent and secure. The training course allows both sides to change files at the same time and is very easily maintained. It is also a flexible treatment for large organizations, because multiple users can get the same documents from everywhere.
Virtual info rooms are a good way to protect very sensitive information. The skills offer a higher level of transparency and protection, which allows these to be used simply by businesses and individuals similar. They also provide advanced features that shields programmers from unneeded functions. A number of the features incorporate data security, watermarks, firewalls, and load handling. You don’t need to study complex technical details, since several VDSs have a very intuitive interface.
Using a virtual info room, you simply won’t have to worry about your clients’ reliability. The system was designed to ensure the https://navmotorsportsmarketing.com/citrix-sharefile-review/ protection of delicate documents. With security procedures in place, the files will never be lost, taken, or hacked. In addition to this, a VDS will assist you to avoid potential legal issues by keeping paperwork in a central location that may be protected and secure. You can implement load balancing and comparison adventures to enhance the transparency of your virtual data room.
Leave a Reply
Your email address will not be published.
|
{
"url": "https://sefabumipersada.com/2022/01/10/what-is-virtual-data-space/",
"source_domain": "sefabumipersada.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "62876",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RJ6KVEIBNQC7FZRKAVK2XB6JALLBAPAX",
"WARC-Concurrent-To": "<urn:uuid:a873a03e-7004-4b01-a3e7-b161896016b6>",
"WARC-Date": "2022-01-20T05:02:39Z",
"WARC-IP-Address": "156.67.212.160",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RRCMJFBNGDSDS7QXGSOJ6SGRUWK5KCSC",
"WARC-Record-ID": "<urn:uuid:7f2b6214-31f6-4e28-a704-3dc69d8d598d>",
"WARC-Target-URI": "https://sefabumipersada.com/2022/01/10/what-is-virtual-data-space/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f10cfd9b-b5ff-43c9-bcea-5f727f5732e6>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-236\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,
47,
48,
76,
77,
650,
651,
1147,
1148,
1721,
1722,
1736,
1737
],
"line_end_idx": [
47,
48,
76,
77,
650,
651,
1147,
1148,
1721,
1722,
1736,
1737,
1778
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1778,
"ccnet_original_nlines": 12,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35825544595718384,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006230529863387346,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12772585451602936,
"rps_doc_frac_unique_words": 0.6286764740943909,
"rps_doc_mean_word_length": 5.371323585510254,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.8366312980651855,
"rps_doc_word_count": 272,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.030116360634565353,
"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.030116360634565353,
"rps_doc_frac_chars_top_3gram": 0.03285421058535576,
"rps_doc_frac_chars_top_4gram": 0.023271730169653893,
"rps_doc_books_importance": -105.27416229248047,
"rps_doc_books_importance_length_correction": -98.53728485107422,
"rps_doc_openwebtext_importance": -48.00532150268555,
"rps_doc_openwebtext_importance_length_correction": -48.00532150268555,
"rps_doc_wikipedia_importance": -40.56615447998047,
"rps_doc_wikipedia_importance_length_correction": -38.7420654296875
},
"fasttext": {
"dclm": 0.04938114061951637,
"english": 0.9316767454147339,
"fineweb_edu_approx": 1.721449375152588,
"eai_general_math": 0.0045127300545573235,
"eai_open_web_math": 0.12446296215057373,
"eai_web_code": 0.0005716099985875189
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,337,901,423,173,885,000
|
Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
Results 1 to 2 of 2
Thread: Help me out with my code
1. #1
Member
Join Date
Sep 2013
Posts
36
Thanks
13
Thanked 0 Times in 0 Posts
Post Help me out with my code
I have to display traffic lights and run dialog boxes. When I do this I get the dialog boxes to appear properly but my traffic light stays green for the whole thing, instead of going red, yellow, green. I feel I am pretty close with my code and I just think maybe I'm using repaint wrong or have to do something with the setColor. Here is my working code so far.
//Import JComponent Graphics, Graphic2D, Color
import java.awt.Color;
import java.awt.Graphics;
import java.awt.Graphics2D;
import java.awt.Rectangle;
import java.awt.geom.Ellipse2D;
import java.awt.geom.Line2D;
import javax.swing.JComponent;
import javax.swing.JOptionPane;
public class TrafficLight extends JComponent
{
private Color lightColor;
private int radius;
private int x;
private int y;
/* public TrafficLight(Color lightColor, int radius, int x, int y)
{
this.lightColor = lightColor;
this.radius = radius;
this.x = x;
this.y = y;
}*/
public void paintComponent(Graphics g)
{
//convert g to graphics 2d and use to draw ellipse for circle.
//set color to lightColor
Graphics2D g2 = (Graphics2D) g;
Rectangle box = new Rectangle(0,0,300,400);
g2.setColor(lightColor.WHITE);
g2.fill(box);
Ellipse2D.Double redRing = new Ellipse2D.Double(35,75,200,200);
g2.setColor(lightColor.RED);
g2.draw(redRing);
g2.fill(redRing);
validate();
repaint();
Ellipse2D.Double yellowRing = new Ellipse2D.Double(35,75,200,200);
g2.setColor(lightColor.YELLOW);
g2.draw(yellowRing);
g2.fill(yellowRing);
validate();
repaint();
Ellipse2D.Double greenRing = new Ellipse2D.Double(35,75,200,200);
g2.setColor(lightColor.GREEN);
g2.draw(greenRing);
g2.fill(greenRing);
validate();
repaint();
/* Rectangle body = new Rectangle(x, y + 10, 60, 10);
Ellipse2D.double redLight = new Ellipse2D.double(x + 40, y + 20, radius + 10, 10, 10);
Ellipse2D.Double yellowLight
= new Ellipse2D.Double(x + 40, y + 20, radius + 10, 10, 10);
Ellipse2D.Double greenLight
= new Ellipse2D.Double(x + 40, y + 20, radius + 10, 10, 10);*/
}
public void setColor(Color newLightColor)
{
lightColor = newLightColor;
//return lightColor;
//newLightColor = lightColor.YELLOW;
}
}
//Traffic Light viewer
import javax.swing.JFrame;
import javax.swing.JOptionPane;
public class TrafficLightViewer
{
public static void main(String[] args)
{
JFrame LightVisible = new JFrame();
LightVisible.setSize(400,400);
LightVisible.setTitle("Traffic Lights");
LightVisible.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
TrafficLight TrafficViewerOne = new TrafficLight();
JOptionPane.showMessageDialog(null,"Ready!");
//LightVisible.setColor(TrafficViewerOne);
//LightVisible.setColor(redRing);
LightVisible.add(TrafficViewerOne);
LightVisible.setVisible(true);
JOptionPane.showMessageDialog(null,"Set!");
JOptionPane.showMessageDialog(null,"Go!");
}
}
Any help is much appreciated, just need some advice in the right direction. It's almost like there should be stop and then repaint the color but I don't know how to this. Do I have to place the showMessageDialog code in a certain spot. Thanks for your time.
2. #2
Super Moderator
Join Date
Jun 2013
Location
So. Maryland, USA
Posts
5,520
My Mood
Mellow
Thanks
215
Thanked 688 Times in 675 Posts
Default Re: Help me out with my code
Traffic lights don't go red, yellow, green, but I'll assume that the requirements are dictated by the assignment.
You have all of the necessary elements, some of them unused, others used incorrectly. I'm not going to show you anything new by talking you through each of the necessary changes, so I'll mention the important changes and then post your corrected code:
paintComponent(() should begin with a call to the super's paintComponent() method
NEVER, NEVER, NEVER call repaint from the paintComponent() method. Doing so creates an infinite loop and indicates you don't understand Swing's painting mechanism. You can learn more about it in Oracle's Custom Painting lesson.
Use the setColor() method between dialog boxes to change the light's color. (Should be named setLightColor().)
You might want to move the first dialog to after the setVisible() statement and then alternate change color / new dialog, but that's up to you.
Here's the working code:
//Traffic Light viewer
//Import JComponent Graphics, Graphic2D, Color
import java.awt.Color;
import java.awt.Graphics;
import java.awt.Graphics2D;
import java.awt.Rectangle;
import java.awt.geom.Ellipse2D;
import javax.swing.JComponent;
import javax.swing.JFrame;
import javax.swing.JOptionPane;
public class TestClass
{
public static void main(String[] args)
{
JFrame LightVisible = new JFrame();
LightVisible.setSize(400,400);
LightVisible.setTitle("Traffic Lights");
LightVisible.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
TrafficLight trafficViewerOne = new TrafficLight();
JOptionPane.showMessageDialog(null,"Ready!");
LightVisible.add(trafficViewerOne);
LightVisible.setVisible(true);
JOptionPane.showMessageDialog(null,"Set!");
trafficViewerOne.setColor( Color.YELLOW );
JOptionPane.showMessageDialog(null,"Go!");
trafficViewerOne.setColor( Color.GREEN );
}
}
class TrafficLight extends JComponent
{
private Color lightColor;
public TrafficLight()
{
// set initial color to green
lightColor = Color.RED;
}
public void paintComponent(Graphics g)
{
// always begin the paintComponent() method with:
super.paintComponent( g );
//convert g to graphics 2d and use to draw ellipse for circle.
//set color to lightColor
Graphics2D g2 = (Graphics2D) g;
Rectangle box = new Rectangle(0,0,300,400);
g2.setColor(Color.WHITE);
g2.fill(box);
Ellipse2D.Double lightRing = new Ellipse2D.Double(35,75,200,200);
g2.setColor( lightColor );
g2.draw(lightRing);
g2.fill(lightRing);
}
public void setColor(Color newLightColor)
{
lightColor = newLightColor;
repaint();
}
}
3. The Following User Says Thank You to GregBrannon For This Useful Post:
Edmacelroy (September 29th, 2013)
Similar Threads
1. Replies: 3
Last Post: April 27th, 2013, 07:19 AM
2. Replies: 4
Last Post: January 24th, 2013, 10:20 AM
3. Replies: 7
Last Post: January 24th, 2013, 09:41 AM
4. Replies: 5
Last Post: November 14th, 2012, 09:47 AM
5. Replies: 3
Last Post: September 3rd, 2012, 11:36 AM
|
{
"url": "http://www.javaprogrammingforums.com/whats-wrong-my-code/32447-help-me-out-my-code.html",
"source_domain": "www.javaprogrammingforums.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "80753",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:V4VXZU4SMB3P33KK4C3MRGHNSPS4BQ62",
"WARC-Concurrent-To": "<urn:uuid:713264be-1ff1-4e2f-808c-03f6fae071d0>",
"WARC-Date": "2017-05-29T23:07:22Z",
"WARC-IP-Address": "198.57.177.180",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:6W35IIQFX647QVVUFJO563URGUHVY72B",
"WARC-Record-ID": "<urn:uuid:691f7e0e-7820-44d6-a5b0-b5aaf2d43c2f>",
"WARC-Target-URI": "http://www.javaprogrammingforums.com/whats-wrong-my-code/32447-help-me-out-my-code.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5dfec2c6-1b91-440c-95e2-5b8ecd10ee2e>"
},
"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,
39,
40,
41,
112,
113,
114,
623,
624,
625,
658,
659,
660,
749,
750,
770,
771,
804,
805,
813,
824,
838,
851,
861,
868,
879,
886,
917,
918,
952,
953,
1320,
1321,
1372,
1399,
1429,
1461,
1492,
1528,
1561,
1596,
1632,
1638,
1687,
1693,
1726,
1753,
1775,
1797,
1803,
1875,
1884,
1921,
1950,
1969,
1988,
1999,
2005,
2051,
2060,
2130,
2163,
2206,
2262,
2305,
2335,
2341,
2417,
2458,
2488,
2518,
2542,
2566,
2572,
2650,
2694,
2727,
2760,
2784,
2807,
2813,
2819,
2825,
2903,
2946,
2978,
3010,
3034,
3057,
3063,
3069,
3075,
3081,
3153,
3253,
3296,
3372,
3414,
3492,
3500,
3506,
3555,
3564,
3601,
3632,
3679,
3685,
3691,
3700,
3709,
3710,
3711,
3712,
3739,
3770,
3806,
3812,
3848,
3854,
3900,
3909,
3915,
3961,
4002,
4053,
4124,
4186,
4241,
4293,
4336,
4382,
4424,
4430,
4436,
4489,
4541,
4551,
4557,
4563,
4564,
4826,
4827,
4828,
4836,
4856,
4870,
4883,
4896,
4918,
4928,
4938,
4950,
4961,
4972,
4980,
5015,
5016,
5057,
5058,
5176,
5177,
5433,
5434,
5520,
5521,
5753,
5754,
5869,
5870,
6018,
6019,
6048,
6075,
6126,
6153,
6183,
6215,
6246,
6282,
6288,
6323,
6354,
6390,
6396,
6402,
6429,
6435,
6482,
6492,
6540,
6583,
6636,
6709,
6773,
6779,
6837,
6843,
6891,
6897,
6940,
6946,
6952,
7008,
7014,
7069,
7075,
7130,
7136,
7190,
7200,
7206,
7212,
7218,
7260,
7266,
7300,
7306,
7336,
7346,
7388,
7424,
7434,
7440,
7487,
7497,
7559,
7598,
7604,
7679,
7717,
7761,
7817,
7855,
7885,
7891,
7969,
8008,
8040,
8072,
8082,
8088,
8138,
8148,
8188,
8211,
8221,
8227,
8233,
8234,
8310,
8311,
8349,
8350,
8366,
8367,
8383,
8425,
8441,
8485,
8501,
8545,
8561,
8606,
8622
],
"line_end_idx": [
39,
40,
41,
112,
113,
114,
623,
624,
625,
658,
659,
660,
749,
750,
770,
771,
804,
805,
813,
824,
838,
851,
861,
868,
879,
886,
917,
918,
952,
953,
1320,
1321,
1372,
1399,
1429,
1461,
1492,
1528,
1561,
1596,
1632,
1638,
1687,
1693,
1726,
1753,
1775,
1797,
1803,
1875,
1884,
1921,
1950,
1969,
1988,
1999,
2005,
2051,
2060,
2130,
2163,
2206,
2262,
2305,
2335,
2341,
2417,
2458,
2488,
2518,
2542,
2566,
2572,
2650,
2694,
2727,
2760,
2784,
2807,
2813,
2819,
2825,
2903,
2946,
2978,
3010,
3034,
3057,
3063,
3069,
3075,
3081,
3153,
3253,
3296,
3372,
3414,
3492,
3500,
3506,
3555,
3564,
3601,
3632,
3679,
3685,
3691,
3700,
3709,
3710,
3711,
3712,
3739,
3770,
3806,
3812,
3848,
3854,
3900,
3909,
3915,
3961,
4002,
4053,
4124,
4186,
4241,
4293,
4336,
4382,
4424,
4430,
4436,
4489,
4541,
4551,
4557,
4563,
4564,
4826,
4827,
4828,
4836,
4856,
4870,
4883,
4896,
4918,
4928,
4938,
4950,
4961,
4972,
4980,
5015,
5016,
5057,
5058,
5176,
5177,
5433,
5434,
5520,
5521,
5753,
5754,
5869,
5870,
6018,
6019,
6048,
6075,
6126,
6153,
6183,
6215,
6246,
6282,
6288,
6323,
6354,
6390,
6396,
6402,
6429,
6435,
6482,
6492,
6540,
6583,
6636,
6709,
6773,
6779,
6837,
6843,
6891,
6897,
6940,
6946,
6952,
7008,
7014,
7069,
7075,
7130,
7136,
7190,
7200,
7206,
7212,
7218,
7260,
7266,
7300,
7306,
7336,
7346,
7388,
7424,
7434,
7440,
7487,
7497,
7559,
7598,
7604,
7679,
7717,
7761,
7817,
7855,
7885,
7891,
7969,
8008,
8040,
8072,
8082,
8088,
8138,
8148,
8188,
8211,
8221,
8227,
8233,
8234,
8310,
8311,
8349,
8350,
8366,
8367,
8383,
8425,
8441,
8485,
8501,
8545,
8561,
8606,
8622,
8666
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8666,
"ccnet_original_nlines": 263,
"rps_doc_curly_bracket": 0.002769439946860075,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.17942121624946594,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024437300860881805,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3832797408103943,
"rps_doc_frac_unique_words": 0.43176472187042236,
"rps_doc_mean_word_length": 6.412940979003906,
"rps_doc_num_sentences": 149,
"rps_doc_symbol_to_word_ratio": 0.0012861699797213078,
"rps_doc_unigram_entropy": 5.4751296043396,
"rps_doc_word_count": 850,
"rps_doc_frac_chars_dupe_10grams": 0.21170426905155182,
"rps_doc_frac_chars_dupe_5grams": 0.30141258239746094,
"rps_doc_frac_chars_dupe_6grams": 0.29297375679016113,
"rps_doc_frac_chars_dupe_7grams": 0.2388552576303482,
"rps_doc_frac_chars_dupe_8grams": 0.21830856800079346,
"rps_doc_frac_chars_dupe_9grams": 0.21830856800079346,
"rps_doc_frac_chars_top_2gram": 0.004402860067784786,
"rps_doc_frac_chars_top_3gram": 0.007338100112974644,
"rps_doc_frac_chars_top_4gram": 0.007154650054872036,
"rps_doc_books_importance": -667.1444702148438,
"rps_doc_books_importance_length_correction": -667.1444702148438,
"rps_doc_openwebtext_importance": -365.1325378417969,
"rps_doc_openwebtext_importance_length_correction": -365.1325378417969,
"rps_doc_wikipedia_importance": -128.48089599609375,
"rps_doc_wikipedia_importance_length_correction": -128.48089599609375
},
"fasttext": {
"dclm": 0.045631710439920425,
"english": 0.6912767291069031,
"fineweb_edu_approx": 1.6124368906021118,
"eai_general_math": 0.005822420120239258,
"eai_open_web_math": 0.0905073881149292,
"eai_web_code": 0.0014460099628195167
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,578,501,163,425,700,000
|
Jefferson Elias
What are SQL Server deadlocks and how to monitor them
May 19, 2017 by
Introduction
As a DBA, I’ve been, more than , confronted with performance problems. Sometimes, poorly written code or lack of indexes will generate blocking conditions that we refer to as a“Deadlock”. Due to their nature and like any similar blocking situation, deadlocks can have a direct impact on user experience and the more they occur, the bigger the impact.
This article is the first one of a series that will focus on deadlock issues and reporting. After reading this article you will be able to explain how a deadlock can occur and how we can get extended information about this deadlock so that we will be able to diagnose and take the appropriate actions. These actions would lead to either a lower occurrence frequency or a total disappearance of deadlock conditions.
So, in following sections, we will try to understand, basically, what a deadlock is and how it occurs with a practical example in T-SQL. Then we will see that SQL Server actually has some tools to help detect their occurrences and get everything we need to find and fix it, although solution might be simpler said than done…
Basics understanding
Intuitive comprehension
So, what is a “deadlock” ? Etymologically, it can be divided into two root words: “dead” and “lock”. We could intuitively understand it as a lock that leads to a dead end
In relational database management systems, locking is a mechanism that happens every time. Actually, we can acquire a lock on different kind of resources (row identifier, key, page, table…) and using different modes (shared, exclusive…). Choosing a mode instead of another to access a given resource in a session will either let other sessions (or transaction) access the same resource or will make other sessions wait for that resource to be unlocked. Let’s notice that all locking modes are not compatible. For that reason, Microsoft provided a documentation page about what they call lock compatibility.
Still, intuitively, we could say that a deadlock falls into the second case, the one that tells other sessions to wait for a resource, but this wait might never end. This second case is commonly referred to as “blocking”. We will take some time to understand blocking before talking about deadlocks as they seem to be the worst case of blockin
Understanding blocking
A blocking situation can be understood with the following example.
Let’s assume that we have two database users already connected to SQL Server using an application: UserA and UserB.
UserA is currently editing an invoice, which implies an UPDATE statement against an Invoice table with a WHERE clause that restricts to a particular value of InvoiceId column of that table. To perform this operation, the thread associated to that session inside SQL Server database engine has to acquire and hold:
• An Intent-Exclusive (IX) lock on the Invoice table and on the page, that contain the row userA is editing. This lock is used to establish a lock hierarchy in order to perform data modifications.
• An Exclusive (X) lock on the row userA is editing. This means that the session will be the only one allowed to modify that row until it releases this lock.
At the same time, UserB wants to get a list of the invoices for current month and unfortunately, the invoice UserA is editing sits in that list. UserB’s thread will:
• Acquire an Intent Shared (IS) lock on the Invoice table. This lock is used to establish a lock hierarchy in order to perform read-only operations. This will work as IX and IS on a table are compatible.
• Try to attempt a shared (S) lock on the pages needed to display the list. Among them, the page with an X lock acquired by UserA. However, shared and exclusive locks are incompatible (even semantically). This means that thread taking care of UserB’s session has to wait for UserA’s session to release this X lock. Until that happen, we can say that UserB’s session is blocked by UserA’s session.
The situation can be graphically summarized as follows:
This situation will end as soon as the UPDATE query has been completed and UserA has committed their transaction.
As we may expect, we can encounter a lot more complex situations, involving a session holding multiple locks on multiple resources. However, when blocking occurs, using the appropriate query, we will be able to get a tree view of blocking like the following one:
In this example, we would pinpoint three blocking sessions (59, 79, 145) but as the session with id 145 is actually blocked by the session with id 59, there are actually two “top blocking sessions” (59 and 79). These are called “head blockers” while the other sessions are called “waiters”.
Understanding deadlocks
Although it’s based on the same principles, deadlocks are a different from blocking. Actually, when a deadlock situation happens, there is no identifiable head blocker as both sessions implied holds incompatible locks on objects the other session needs to access. It’s a circular blocking chain.
For better understanding, we will go back to the situation we used for blocking presentation and add some complexity to that situation.
Let’s say that in order to modify a row in Invoice table, UserA must also read from an InvoiceDetails table to get the total that is billed to customer. Let’s say that, no matter the reason, UserB has already acquired an exclusive lock on a page containing a row of InvoiceDetails table that UserA needs to read.
In such a case, we are in the situation depicted by following figure. (As a reminder, green is used to refer to UserA and orange for UserB)
As you can see in the figure above, both threads are waiting for a lock that won’t be ever released as the activity of one is suspended until the other releases its acquired locks. There can be more complicated in real life situationsand I would suggest those interested in the subject to search the web for resources like the one written by Minette Steynberg in 2016 entitled What is a SQL Server deadlock?.
Fortunately, the SQL Server database engine comes with a deadlock monitor thread that will periodically check for deadlock situations, choose one of the process implied as victim for termination. While this is a good point for one of the sessions, this is not for the other. The “victim” is actually terminated with an error and has to be run again.
Here is some further information about the deadlock monitor thread:
• It runs every 5 seconds by default
• When it detects a deadlock, this interval falls from 5 seconds to as low as 100 milliseconds based on frequency of deadlock occurrences
• When it finally finds no deadlock, it put the interval to its default of 5 seconds
• Once the deadlock victim is chosen, it will roll back the transaction of this victim and return a 1205 error message to user. The error message looks like follows
Transaction (Process ID 89) was deadlocked on resources with another process and has been chosen as the deadlock victim. Rerun the transaction.
• By default, the deadlock victim is chosen based on the estimated amount of resource consumption for rolling back. It’s the least expensive one that is chosen. We can use SET DEADLOCK_PRIORITY <Value> statement to influence the choice of deadlock victim.
Deadlock in action
In this section, we will implement the example explained above in T-SQL and check that the explanation corresponds to what actually happens in the real world.
In this example, we have 2 tables: Invoices and InvoiceDetails. We will build these tables based on AdventureWorks database.
First session, representing UserA in the example, will run following statement. Notice that there is no commit.
We can check that the transaction is still open, so not rolled back neither committed using following query:
Now, let’s run following statement in another session which will play the role of UserB in our example.
If now, we run following statement in first session (UserA):
Then, either session (UserA or UserB) will be marked for deadlock. In my case, it was UserA’s session.
If we rollback, nothing should have changed for SalesOrderId #43659.
How to keep track of deadlocks occurrences only?
Well, we now know what a deadlock is and the error 1205 is raised by Deadlock monitor thread. If we only need to get an overview of deadlock occurrences for a timed interval, we could run the following statement against a SQL Server instance:
This statement will tell SQL Server to log any 1205 error messages to SQL Server Error Log. Using xp_readerrorlog stored procedure, we will be able to read this log and get back only records of 1205 error.
How to keep track of deadlocks details
Option 1: Trace Flags 1204 and 1222
DBAs can tell SQL Server to (temporarily) change its behavior by specifying a trace flag. These trace flags are enabled and disabled using following instruction:
An alternate way to enabling trace flags is by defining them as startup parameters to SQL Server service:
Note that this requires a restart of SQL Server services.
There are two trace flags or interest for deadlock monitoring: 1204 and 1222.
According to documentation on Microsoft’s website, the first one will tell SQL Server to return resources and types of lock participating in a deadlock and also the current command affected while the second one returns the resources and types of lock that are participating in a deadlock and also the current command affected in an XML format.
Basically, both do the same job and I would recommend using 1222 trace flag in preference to the first one as it will generate an XML which is easier to parse and integrate.
The output of both trace flags will be visible in SQL Server Error Log.
This is an old-fashioned way to get deadlock information and I would only recommend this one when the other methods are not available. Plus, we will need to build a specific parser to extract data for further analysis.
Option 2: SQL Server Profiler and SQL Server Trace
This is also an old way to get detailed information about deadlock occurrences introduced in SQL Server 2005. This seems to be the most commonly used by developers and DBAs.
We open SQL Server Profiler and create a new trace with selected Locks/Deadlock Graph item:
When this item is selected, we can go to the third tab and specify whether to save deadlock XML events in a separate results file. We will need to parse this file with a script or something else.
This method is simple and provides a results we can use quite easily to investigate deadlocks. We can also run the T-SQL equivalent code to generate the trace.
Note: This solution can impact performance as it will use additional resources to collect and provide deadlock information to user. As such, this isn’t the optional solution
Option 3: Extended Events and system_health session
In SQL Server 2008, Extended Events were introduced and a default Extended Events session called system_health was defined. This session starts automatically with the SQL Server Database Engine and collects system data to help DBAs in troubleshooting performance issues.
Actually, it collects information about any detected deadlock into XEL files. We can extract information from these files either:
• using Dynamic Management views and functions;
• using the function provided by Microsoft to read data from an Extended Events Session file:
This collection is totally integrated and does not harm performances.
You will find below an example query to get deadlock XML from system_health session.
This script can also run against another extended events session as the one in next subsection.
Option 4: Custom Extended Events Session
Extended Events is a great feature in which we define the events and associated information we want to collect.
Starting SQL Server 2012, SQL Server Management Studio (SSMS) provides a graphical user interface to work with extended events. We will go through the steps to create a custom extended event that will keep track of deadlock graph with extended information. For T-SQL friendly guys, generated code will also be provided.
Unfortunately, this solution won’t work on versions prior to SQL Server 2012 without adaptations to generated script.
In SSMS, rendezvous at “management” item in tree view of a SQL Server connection. Expand it to have following view then right-click on “Sessions” to open up a menu.
Click on “New Session…”.
Following windows will show up. Fill information as you want. Notice that I checked two checkboxes under “Schedule:”.
Now we set General parameters, let’s select events. There is a filter on the events view that will help us to only get the list of deadlock related events.
We should only need xml_deadlock_report event and we can either double-click on it or click on the “>“ sign. Once done, this event will appear in the “Selected events” list. Actually, an item of this list can be customized by double-clicking on it. So, if we double-click on xml_deadlock_report or if we select an item and click on the “Configure” button on top-right corner, the interface will change to an event editing panel as follows:
If we go on “Global fields” tab, we can actually add actions and so information to our events collection.
Once we are done with this part, we can go to Data Storage page and tell SQL Server where to store results. Generally, we will take a file as output.
Finally, we can review advanced settings for this Extended Events Session.
Then, click OK.
Here is the equivalent T-SQL script for creating Collect-Deadlock event:
For this solution to be working on SQL Server versions prior to SQL Server 2012, we need to change
By
In some versions of SQL Server, the sys.fn_xe_file_target_read_file function needs its caller to provide the non-null value for second parameter. This parameter refers to the path to a description file with an XEM extension. We can actually modify target definition so that it looks like this:
Which gives for SQL Server 2008 and 2008 R2:
Now, let’s review some operations on this event.
To prevent an Extended event from running, run following queries:
To set it back to a running state, run following query:
And to completely drop the event session:
I would recommend using this option over the option #3 because it takes a lot less time to get simple information using previous query. As an example, on my test server, in order to get one row from system_health, it took more than 15 seconds while it took less than one seconds with this solution.
Plus, a really cool thing about this option is that when I created this session, it took back deadlocks that occurred prior to its creation.
Additional words on Extended Events collections
Pay attention to time formats
From my experiments, we must be careful when we want to collect data from Extended Events based on ring_buffer and we want to filter out (or simply display) timing information.
Actually, this information is stored in UTC format and we need to convert it to local time before using it.
I tried to transform this format using following piece of code:
OR
But I don’t get the actual time as you will see in following screen capture. On left side, there is the ordered DateStamp results from query presented above to get back deadlock information. On the right side, the results of the option 1 (Trace flags).
Note: There is an open bug on Microsoft Connect regarding datetime differences.
A simple information collection method is available on SQLShack
No matter if you take deadlock information from system_health or from an homemade event session, you can refer to Musab Umair’s article entitled “Monitoring SQL Server Deadlocks – the easy way“. He defines a simple method to extract some deadlock information from extended event files.
Summary
Until now, we’ve seen what is a deadlock and how to collect information about them using multiple approaches. Following table summarizes what we could expect from each of these ways.
Option# Option Name Works Prior to 2008 Works prior to 2012 Automated Needs activation Performance Impact Facilitated
output analysis
1 Trace flags X X X X
2 SQL Server Profiler and SQL Trace X X X X X
3 Default Extended Events Session (system_health) X X X
4 Custom Extended Events Session X X
In next article, we will have a closer look at what kind of reports we can perform in order to launch a chase against deadlock occurrences. We will also take a close look at the stored procedure used to get those reports.
Next articles in this series:
See more
To get 3 free licenses to a SQL Server monitoring tool, download ApexSQL Monitor and fill out this simple survey
References
Jefferson Elias
Jefferson Elias
Living in Belgium, I obtained a master degree in Computer Sciences in 2011 at the University of Liege.
I'm one of the rare guys out there who started to work as a DBA immediately after his graduation. So, I work at the university hospital of Liege since 2011. Initially involved in Oracle Database administration (which are still under my charge), I had the opportunity to learn and manage SQL Server instances in 2013. Since 2013, I've learned a lot about SQL Server in administration and development.
I like the job of DBA because you need to have a general knowledge in every field of IT. That's the reason why I won't stop learning (and share) the products of my learnings.
View all posts by Jefferson Elias
Jefferson Elias
SQL Server performance tuning
About Jefferson Elias
Living in Belgium, I obtained a master degree in Computer Sciences in 2011 at the University of Liege.
I’m one of the rare guys out there who started to work as a DBA immediately after his graduation. So, I work at the university hospital of Liege since 2011. Initially involved in Oracle Database administration (which are still under my charge), I had the opportunity to learn and manage SQL Server instances in 2013. Since 2013, I’ve learned a lot about SQL Server in administration and development.
I like the job of DBA because you need to have a general knowledge in every field of IT. That’s the reason why I won’t stop learning (and share) the products of my learnings.
View all posts by Jefferson Elias
1,947 Views
• Jefferson
Hi mbourgon, thanks for the feedback. This is a valuable information that I will take into account!
Many thanks!
|
{
"url": "https://www.sqlshack.com/what-are-sql-server-deadlocks-and-how-to-monitor-them/",
"source_domain": "www.sqlshack.com",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "213100",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D6YQ7INZRFFOMULELXVBC6WV45CFNW6L",
"WARC-Concurrent-To": "<urn:uuid:ee0ad1b4-c161-4fdc-99a3-2ff42546b449>",
"WARC-Date": "2017-11-25T00:13:12Z",
"WARC-IP-Address": "192.124.249.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OFUVFTGPJHUHCN47GRWJADDQSLF3BFOU",
"WARC-Record-ID": "<urn:uuid:11e9eae3-5015-40f1-bf1f-6becdd449332>",
"WARC-Target-URI": "https://www.sqlshack.com/what-are-sql-server-deadlocks-and-how-to-monitor-them/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0aa8bd6b-8f38-4cd5-9065-294000485515>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-149-82-108.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,
16,
17,
71,
72,
88,
89,
102,
103,
454,
455,
870,
871,
1196,
1197,
1218,
1219,
1243,
1244,
1415,
1416,
2023,
2024,
2368,
2369,
2392,
2393,
2460,
2461,
2577,
2578,
2892,
2893,
3092,
3252,
3253,
3419,
3420,
3626,
4025,
4026,
4082,
4083,
4197,
4198,
4461,
4462,
4753,
4754,
4778,
4779,
5075,
5076,
5212,
5213,
5526,
5527,
5667,
5668,
6077,
6078,
6428,
6429,
6497,
6498,
6537,
6677,
6764,
6931,
6932,
7080,
7081,
7339,
7340,
7359,
7360,
7519,
7520,
7645,
7646,
7758,
7759,
7868,
7869,
7973,
7974,
8035,
8036,
8139,
8140,
8209,
8210,
8259,
8260,
8503,
8504,
8710,
8711,
8750,
8751,
8787,
8788,
8950,
8951,
9057,
9058,
9116,
9117,
9195,
9196,
9540,
9541,
9715,
9716,
9788,
9789,
10008,
10009,
10060,
10061,
10235,
10236,
10328,
10329,
10525,
10526,
10686,
10687,
10861,
10862,
10914,
10915,
11186,
11187,
11317,
11318,
11368,
11464,
11465,
11535,
11536,
11621,
11622,
11718,
11719,
11760,
11761,
11873,
11874,
12194,
12195,
12313,
12314,
12479,
12480,
12505,
12506,
12624,
12625,
12781,
12782,
13222,
13223,
13329,
13330,
13480,
13481,
13556,
13557,
13573,
13574,
13647,
13648,
13747,
13748,
13751,
13752,
14046,
14047,
14092,
14093,
14142,
14143,
14209,
14210,
14266,
14267,
14309,
14310,
14609,
14610,
14751,
14752,
14800,
14801,
14831,
14832,
15009,
15010,
15118,
15119,
15183,
15184,
15187,
15188,
15441,
15442,
15522,
15523,
15587,
15588,
15874,
15875,
15883,
15884,
16067,
16068,
16186,
16202,
16224,
16270,
16326,
16363,
16364,
16586,
16587,
16617,
16618,
16627,
16628,
16741,
16742,
16753,
16754,
16770,
16771,
16787,
16788,
16891,
16892,
17292,
17293,
17468,
17469,
17503,
17519,
17549,
17550,
17572,
17573,
17676,
17677,
18077,
18078,
18253,
18254,
18288,
18289,
18301,
18315,
18316,
18420
],
"line_end_idx": [
16,
17,
71,
72,
88,
89,
102,
103,
454,
455,
870,
871,
1196,
1197,
1218,
1219,
1243,
1244,
1415,
1416,
2023,
2024,
2368,
2369,
2392,
2393,
2460,
2461,
2577,
2578,
2892,
2893,
3092,
3252,
3253,
3419,
3420,
3626,
4025,
4026,
4082,
4083,
4197,
4198,
4461,
4462,
4753,
4754,
4778,
4779,
5075,
5076,
5212,
5213,
5526,
5527,
5667,
5668,
6077,
6078,
6428,
6429,
6497,
6498,
6537,
6677,
6764,
6931,
6932,
7080,
7081,
7339,
7340,
7359,
7360,
7519,
7520,
7645,
7646,
7758,
7759,
7868,
7869,
7973,
7974,
8035,
8036,
8139,
8140,
8209,
8210,
8259,
8260,
8503,
8504,
8710,
8711,
8750,
8751,
8787,
8788,
8950,
8951,
9057,
9058,
9116,
9117,
9195,
9196,
9540,
9541,
9715,
9716,
9788,
9789,
10008,
10009,
10060,
10061,
10235,
10236,
10328,
10329,
10525,
10526,
10686,
10687,
10861,
10862,
10914,
10915,
11186,
11187,
11317,
11318,
11368,
11464,
11465,
11535,
11536,
11621,
11622,
11718,
11719,
11760,
11761,
11873,
11874,
12194,
12195,
12313,
12314,
12479,
12480,
12505,
12506,
12624,
12625,
12781,
12782,
13222,
13223,
13329,
13330,
13480,
13481,
13556,
13557,
13573,
13574,
13647,
13648,
13747,
13748,
13751,
13752,
14046,
14047,
14092,
14093,
14142,
14143,
14209,
14210,
14266,
14267,
14309,
14310,
14609,
14610,
14751,
14752,
14800,
14801,
14831,
14832,
15009,
15010,
15118,
15119,
15183,
15184,
15187,
15188,
15441,
15442,
15522,
15523,
15587,
15588,
15874,
15875,
15883,
15884,
16067,
16068,
16186,
16202,
16224,
16270,
16326,
16363,
16364,
16586,
16587,
16617,
16618,
16627,
16628,
16741,
16742,
16753,
16754,
16770,
16771,
16787,
16788,
16891,
16892,
17292,
17293,
17468,
17469,
17503,
17519,
17549,
17550,
17572,
17573,
17676,
17677,
18077,
18078,
18253,
18254,
18288,
18289,
18301,
18315,
18316,
18420,
18436
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 18436,
"ccnet_original_nlines": 261,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4210968017578125,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0338556207716465,
"rps_doc_frac_lines_end_with_ellipsis": 0.003816789947450161,
"rps_doc_frac_no_alph_words": 0.13710129261016846,
"rps_doc_frac_unique_words": 0.2661082446575165,
"rps_doc_mean_word_length": 4.761919975280762,
"rps_doc_num_sentences": 145,
"rps_doc_symbol_to_word_ratio": 0.0019585900008678436,
"rps_doc_unigram_entropy": 5.759178161621094,
"rps_doc_word_count": 3104,
"rps_doc_frac_chars_dupe_10grams": 0.08998037874698639,
"rps_doc_frac_chars_dupe_5grams": 0.12786686420440674,
"rps_doc_frac_chars_dupe_6grams": 0.10337595641613007,
"rps_doc_frac_chars_dupe_7grams": 0.08998037874698639,
"rps_doc_frac_chars_dupe_8grams": 0.08998037874698639,
"rps_doc_frac_chars_dupe_9grams": 0.08998037874698639,
"rps_doc_frac_chars_top_2gram": 0.02252892032265663,
"rps_doc_frac_chars_top_3gram": 0.009945199824869633,
"rps_doc_frac_chars_top_4gram": 0.0032474100589752197,
"rps_doc_books_importance": -1450.431396484375,
"rps_doc_books_importance_length_correction": -1450.431396484375,
"rps_doc_openwebtext_importance": -983.3912963867188,
"rps_doc_openwebtext_importance_length_correction": -983.3912963867188,
"rps_doc_wikipedia_importance": -731.046630859375,
"rps_doc_wikipedia_importance_length_correction": -731.046630859375
},
"fasttext": {
"dclm": 0.05420231819152832,
"english": 0.9248290061950684,
"fineweb_edu_approx": 1.9567292928695679,
"eai_general_math": 0.7562676668167114,
"eai_open_web_math": 0.2614890933036804,
"eai_web_code": 0.6548827290534973
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.746",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,361,547,416,657,877,000
|
Dark web link
194K subscribers in the TOR community. News and discussion about the Tor anonymity software. New to Tor? Please read the Tor FAQ. Today, we'll showyou how to explore the deep web safely with a VPN, Tor, and best security practices, plus recommend 11 of our favorite fully. The dark web is a collection of websites that exist on encrypted darknet overlay networks that can't be found by search engines or. Onion sites on the internet. Introduction. If you're concerned about privacy and zealous about anonymity, you need to check out the dark web. Yes, some parts. Learning how to access the dark web doesn't have to be scary, and it certainly isn't illegal, but you need to take precautions to stay safe. Since Deep Web/Dark web is full of spammers, there are lots of people just When you log onto TOR, you'll need to use special Dark Web links to find the.
The dark web links directory 2021 directly not have any tor links because these days tor links sharing also illegal that why I am sharing red text. Dark web sites use a cannazon market link PGP key to translate encrypted communication. Escrow services are used to solve a dispute between customers and vendors. Topic links 3 0 onion link. Free version makes finding servers, domains, URLs and documents published, as well as the discovery of versions of software on. Our step-by-step guide on navigating the deep web and dark net with Tor. Plus information on search engines, wikis,.onion sites, and using. The Best Dark Web Websites Links collections with more than 150 Dark web Links for Tor Darknet links of onion internet dark market. Best Dark Web Sites for. The deep web and the dark web both offer a degree of privacy and anonymity. Dark web websites are often associated with illegal activity.
Welcome to cannazon market darknet onionland. This is your guide to understanding the Dark Web: what's on the hidden Internet, and how it. That initial platform was cannazon link called 'Tor', which stands for 'The Onion Router'. They rolled it out to the public to make it harder for outsiders to. 6 days ago After an apparent refusal to pay a ransom demand, Russian hackers have leaked a sampling of 13 million records of UK police data to the dark. The DarkNet is an overlay network built over the regular internet like other overlay networks - peer-to-peer and client-server applications. It has its own. Dark Web markets aren't just focused on selling data, passwords, and hacking services. There's also a booming trade in dangerous, illegal, and. But one needs specific software (Tor) to access dark web links. The dark web operates on a Tor network run by volunteers that provides anonymity to its.
Dread onion link The basic dredge definition is to lightly coat a food in a dry ingredient, such as dark web link flour, cornmeal, or breadcrumbs. The Onion Router (TOR). I will walk you through on how to harden your Tor browser and ensure link encryption (communication path data including network packet payloads. Onion Addresses, Including Dozens of 'Dark Market' Sites, Targeted as Part of Global Enforcement Action on Tor Network. WASHINGTONFederal law. Dark Web is a part or division of the Deep web which is intentionally hidden from normal search engines. All its data is encrypted. The Best Dark Web Websites Links collections with more than 150 Dark web Links for Tor Darknet links of onion internet dark market. Best Dark Web Sites for. The dark web is the hidden collective of internet sites only accessible by a specialized web browser. It is used for keeping internet activity anonymous and.
The Dark Web, Deep Web or Darknet is a term that refers specifically to a collection of websites that are publicly visible, but hide the IP. The Deep Web Sites, Dark web, Hidden Wiki is accessed using Tor that contains.onion cannazon darknet market websites and provided Deep Web Links 2021 with more of deep web news. The browser immediately checks for updates. onion links, deep web link 2021 Deep Web News Portal - Hidden Wiki Tor - Tor Wiki - Onion Urls and Links. You can access to the dark web through TOR(The Onion Router). The Hidden Wiki is the name used by censorship-resistant wikis operating as Tor. For a beginner, it is almost impossible to find a website on the Tor browser, and that's where dark web search engines help. The DarkNet is an overlay network built over the regular internet like other overlay networks - peer-to-peer and client-server applications. It has its own.
World Market Link
World Market Url
This website have a huge number of online complaints on Reddit, like this one or on Ripoff Report, like for example this one. Although that’s partially true, there are also plenty of good reasons for you dark web link to access dark web websites. She brings to her work a background in both classical and contemporary theater, as well as film. Unfortunately, I can only speculate about the reasons for this. If you are already aware these security rules then you are ready to visit listed links otherwise first read below given step by step guide. Kilos works by searching through multiple dark web markets for specified products.
World Market
By JaLi
|
{
"url": "https://monopoly-marketpolace.link/dark-web-link/",
"source_domain": "monopoly-marketpolace.link",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "60652",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BZKID6NVPKFYPXFXUZ2GRVDKLGVV6B7R",
"WARC-Concurrent-To": "<urn:uuid:48a6f877-ed8b-48d3-89d1-da2d2705da44>",
"WARC-Date": "2022-10-03T14:09:36Z",
"WARC-IP-Address": "172.67.136.23",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4KC4ZKF5CXRKSF2N6SUU4VHAAIEERY3L",
"WARC-Record-ID": "<urn:uuid:1aa10f87-0525-4a1a-8404-0dd54c004d26>",
"WARC-Target-URI": "https://monopoly-marketpolace.link/dark-web-link/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ab0844a1-bbbe-411f-b97c-8ecf95661dac>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-62\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,
15,
873,
874,
1776,
1777,
2683,
2684,
3590,
3591,
4485,
4486,
4504,
4521,
4522,
5153,
5154,
5167,
5168
],
"line_end_idx": [
14,
15,
873,
874,
1776,
1777,
2683,
2684,
3590,
3591,
4485,
4486,
4504,
4521,
4522,
5153,
5154,
5167,
5168,
5175
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5175,
"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.3275696337223053,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012487989850342274,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1412103772163391,
"rps_doc_frac_unique_words": 0.4011363685131073,
"rps_doc_mean_word_length": 4.705681800842285,
"rps_doc_num_sentences": 63,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.162198066711426,
"rps_doc_word_count": 880,
"rps_doc_frac_chars_dupe_10grams": 0.12412460893392563,
"rps_doc_frac_chars_dupe_5grams": 0.1361989825963974,
"rps_doc_frac_chars_dupe_6grams": 0.12412460893392563,
"rps_doc_frac_chars_dupe_7grams": 0.12412460893392563,
"rps_doc_frac_chars_dupe_8grams": 0.12412460893392563,
"rps_doc_frac_chars_dupe_9grams": 0.12412460893392563,
"rps_doc_frac_chars_top_2gram": 0.04902198165655136,
"rps_doc_frac_chars_top_3gram": 0.024148760363459587,
"rps_doc_frac_chars_top_4gram": 0.005795700009912252,
"rps_doc_books_importance": -563.2147216796875,
"rps_doc_books_importance_length_correction": -563.2147216796875,
"rps_doc_openwebtext_importance": -265.1062927246094,
"rps_doc_openwebtext_importance_length_correction": -265.1062927246094,
"rps_doc_wikipedia_importance": -214.14637756347656,
"rps_doc_wikipedia_importance_length_correction": -214.14637756347656
},
"fasttext": {
"dclm": 0.044666651636362076,
"english": 0.9083054661750793,
"fineweb_edu_approx": 1.6348798274993896,
"eai_general_math": 0.03374392166733742,
"eai_open_web_math": 0.07646656036376953,
"eai_web_code": 0.010782959870994091
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,451,042,427,899,124,700
|
Author: larry
Date: Fri Apr 7 12:26:35 2006
New Revision: 8608
Modified:
doc/trunk/design/syn/S02.pod
Log:
Simplified postfix/infix parsing policy to use "long dot".
Modified: doc/trunk/design/syn/S02.pod
==============================================================================
--- doc/trunk/design/syn/S02.pod (original)
+++ doc/trunk/design/syn/S02.pod Fri Apr 7 12:26:35 2006
@@ -67,25 +67,49 @@
between postfix operators and infix operators, either of which
may occur after a term. If a given token may be interpreted as
either a postfix operator or an infix operator, the infix operator
-requires space before it, and the postfix operator requires a lack
-of space before it unless the previous token was follwed by a dot.
-(Infix operators may not start with a dot.) In other words, the only
-way to put whitespace before a postfix operator is to put whitespace
-between a dot and the normal representation of the postfix operator.
-In other other words, a postfix operator starting with a dot is allowed
-to have any amount of whitespace between the dot and the rest of the
-postfix operator.
+requires space before it. Postfix operators may never have intervening
+space, though they may have an intervening dot, or a "long dot" that begins
+and ends with dots and contains whitespace and commentary between the dots.
+The pattern for "long dot" is C<< m:p/\.+ \s<ws> \./ >>. (A minor
+consequence of this is that the C<< postfix:<...> >> operator should not
+be followed by whitespace.)
For instance, if you were to add your own C<< infix:<++> >> operator,
-then it must have space before it, and the normal autoincrementing
-C<< postfix:<++> >> operator may not have space before it, or must
-be written as C<$x. ++> instead. In standard Perl 6, however, it
-doesn't matter if you put a space in front of C<< postfix:<++> >>.
-To be future proof, though, you should omit the space or use dot.
-
-(A consequence of this rule is that a dot with whitespace in front of it
-is always considered a method call on C<$_>. If a term is not expected at
-this point, it is a syntax error.)
+then it must have space before it. The normal autoincrementing
+C<< postfix:<++> >> operator may never have space before it, but may
+be written in any of these forms:
+
+ $x++
+
+ $x.++
+
+ $x. .++
+
+ $x... .++
+
+ $x.................. .++
+
+ $x...
+ .++
+
+ $x... # comment
+ # more comment
+ .++
+
+ $x... # comment
+ =begin podstuff
+ whatever
+ =end podstuff
+ .++
+
+A consequence of this rule is that, in the absence of a "long dot",
+a dot with whitespace in front of it is always considered a method
+call on C<$_> where a term is expected. If a term is not expected
+at this point, it is a syntax error. (Unless, of course, there is
+an infix operator of that name beginning with dot. You could define
+a Fortranly C<< infix:<.EQ.> >>, for instance, if the fit took you.
+But you'll have to be sure to always put whitespace in front of it, or
+it would be interpreted as a postfix method call instead.)
=item *
Reply via email to
|
{
"url": "https://www.mail-archive.com/perl6-language@perl.org/msg23615.html",
"source_domain": "www.mail-archive.com",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "10170",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TANDG46JYGKUKTQFHDJVVFA6XVE2YDZG",
"WARC-Concurrent-To": "<urn:uuid:81200538-c478-4b78-9ba6-2e6bbe1c3153>",
"WARC-Date": "2018-08-15T15:22:26Z",
"WARC-IP-Address": "72.52.77.8",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:I7LFM2SQKZVZGZOC6ZYFBVXN75IKIO7U",
"WARC-Record-ID": "<urn:uuid:15861da5-5ba6-479f-b8e5-92a84baa8da3>",
"WARC-Target-URI": "https://www.mail-archive.com/perl6-language@perl.org/msg23615.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a9f750fa-f0bf-4721-a5e3-9a6ca26d55bb>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-11-199-188.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,
14,
45,
64,
65,
75,
107,
108,
113,
172,
173,
174,
213,
292,
343,
408,
428,
492,
557,
625,
693,
761,
832,
902,
972,
1045,
1115,
1134,
1207,
1284,
1361,
1429,
1503,
1532,
1534,
1605,
1673,
1741,
1808,
1876,
1943,
1945,
2019,
2095,
2131,
2195,
2265,
2300,
2302,
2312,
2314,
2325,
2327,
2340,
2342,
2365,
2367,
2405,
2407,
2418,
2427,
2429,
2455,
2486,
2495,
2497,
2523,
2544,
2558,
2577,
2586,
2588,
2657,
2725,
2793,
2861,
2931,
3000,
3072,
3132,
3134,
3143,
3145,
3146
],
"line_end_idx": [
14,
45,
64,
65,
75,
107,
108,
113,
172,
173,
174,
213,
292,
343,
408,
428,
492,
557,
625,
693,
761,
832,
902,
972,
1045,
1115,
1134,
1207,
1284,
1361,
1429,
1503,
1532,
1534,
1605,
1673,
1741,
1808,
1876,
1943,
1945,
2019,
2095,
2131,
2195,
2265,
2300,
2302,
2312,
2314,
2325,
2327,
2340,
2342,
2365,
2367,
2405,
2407,
2418,
2427,
2429,
2455,
2486,
2495,
2497,
2523,
2544,
2558,
2577,
2586,
2588,
2657,
2725,
2793,
2861,
2931,
3000,
3072,
3132,
3134,
3143,
3145,
3146,
3164
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3164,
"ccnet_original_nlines": 83,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3502747416496277,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02472526952624321,
"rps_doc_frac_lines_end_with_ellipsis": 0.011904760263860226,
"rps_doc_frac_no_alph_words": 0.3214285671710968,
"rps_doc_frac_unique_words": 0.3333333432674408,
"rps_doc_mean_word_length": 4.427672863006592,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.01923076994717121,
"rps_doc_unigram_entropy": 4.569737911224365,
"rps_doc_word_count": 477,
"rps_doc_frac_chars_dupe_10grams": 0.10227272659540176,
"rps_doc_frac_chars_dupe_5grams": 0.25710228085517883,
"rps_doc_frac_chars_dupe_6grams": 0.19933712482452393,
"rps_doc_frac_chars_dupe_7grams": 0.19602273404598236,
"rps_doc_frac_chars_dupe_8grams": 0.10227272659540176,
"rps_doc_frac_chars_dupe_9grams": 0.10227272659540176,
"rps_doc_frac_chars_top_2gram": 0.06392045319080353,
"rps_doc_frac_chars_top_3gram": 0.04308712109923363,
"rps_doc_frac_chars_top_4gram": 0.03219696879386902,
"rps_doc_books_importance": -397.3201904296875,
"rps_doc_books_importance_length_correction": -397.3201904296875,
"rps_doc_openwebtext_importance": -200.23614501953125,
"rps_doc_openwebtext_importance_length_correction": -200.23614501953125,
"rps_doc_wikipedia_importance": -157.99923706054688,
"rps_doc_wikipedia_importance_length_correction": -157.99923706054688
},
"fasttext": {
"dclm": 0.48358023166656494,
"english": 0.8818504810333252,
"fineweb_edu_approx": 2.5564167499542236,
"eai_general_math": 0.7768609523773193,
"eai_open_web_math": 0.7170478105545044,
"eai_web_code": 0.5953314900398254
}
}
|
{
"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": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,161,674,063,130,930,700
|
хХх::[Dunia Remaja Indonesia]::хХх
MAAF, FORUM DUNIA REMAJA INDONESIA PINDAH KE http://nadakeras.taro.tv/forum
Situs/Web/Forum/Blog dan Komunitas Remaja (Indonesian Only)
You are not connected. Please login or register
AVCHD files for playback on the big screen TV via DLNA
Topik sebelumnya Topik selanjutnya Go down Message [Halaman 1 dari 1]
xperiaplay123
avatar
[DRI] Teman Baru
[DRI] Teman Baru
Complete Guide to Connect and Enjoy MTS/M2TS files via DLNA
How would you enjoy the videos from your AVCHD camcorder on a DLNA-certified TV? It would be perfect if your camcorder is also certified with DLNA. The most important element is the home network. However, there is a limited amount of AVCHD camcorders for DLNA. So you would need a PC connected to HDTV via home network, and watch them in the living room with your family and friends.
First of all, let's take a look at the supported file formats by DLNA.
Media Format:
Image: JPEG PNG, GIF, TIFF
Audio: LPCM AAC, AC-3, ATRAC 3plus, MP3, WMA9
Video: MPEG2 MPEG-1, MPEG-4*, AVC, WMV9
AVCHD files in .mts and .m2ts encoded in MPEG-4/AVC are supported for streaming through DLNA. However, when you play different files, there would be buffering for loading each file. Aunsoft Final Mate is the recommended AVCHD joiner for lossless DLNA streaming formats. You can join the clips into one single file, connect and enjoy HD recordings on HDTV.
Part 1: Lossless join AVCHD for DLNA streaming on your networked PC
Step 1. Import AVCHD MTS/M2TS files to Aunsoft Final Mate.
Run Aunsoft Final Mate, and you can capture videos from the camcorder connected to PC through the pop-up wizard. Alternatively, for the videos on hard drive, just the "Add file path" and browse the folder with .mts or .m2ts files from hard drive.
Step 2. Join AVCHD for DLNA.
Click the "Create New Movie" button on Movies tab for lossless output, drag and drop clips from Camcorder tab or Resource tab to the Movie ID. When files are dropped into one movie ID, the clips will be joined as a single file. You can create another movie for different events, and enjoy AVCHD files via DLNA.
Step 3. Export MTS/M2TS file for DLNA streaming.
Click the "Export" button, and then the OK button. The MTS/M2TS joiner for HDTV will start combining short clips without delay/pause, retaining the native format as DLNA supported file.
Part 2: Enjoy AVCHD recordings on DLNA certified TV
Step 1. Add lossless videos to your designating folder on PC for sharing to DLNA certified TV.
In this process, certain PC share manager software may be needed according to different DLNA certified TV sets. Let me take SAMSUNG PC Share Manager as an example. After you install manager software, a simple way to share videos on your home network is to create and name specific folders on PC for DLNA certified TV to access. Create a new folder on your networked pc, and then name it accordingly, for example "Videos". Copy or load in converted HD videos to the folder you want to access.
PC Share Manager will only access those folders you designate as being shared. Here's how to do that. Select a folder you would like to share, or create a new folder for sharing.
Step 2: Enjoy AVCHD recordings in your DLNA certified TV
Accessing the joined AVCHD files is as easy as pushing the WiseLink button on your Samsung HDTV. Make sure that your media server or networked PC is turned on and the PC Share Manager application is running so that WiseLink Pro can find your shared files and folders.
You can access WiseLink Pro directly from your remote, or from the main menu. (The red Device button, located directly below the Info button on your remote control, lets you choose between one or more networked PCs and the WiseLink USB connector on the side of your Samsung HDTV.) Once you have started WiseLink Pro, you will see the main menu shown below.
Then you can choose the AVCHD files for playback on the big screen TV via DLNA, and share videos at home.
Tips:
1. Aunsoft Final Mate also supports 64-bits and 32-bits system.
2. In case that your HDTV does not support AVCHD format yet, you would need to convert AVCHD to TV supported format like .mpg. Just create movie for conversion in Step 2 of Part I on Aunsoft Final Mate.
Lihat profil user
Share this post on: Excite BookmarksDiggRedditDel.icio.usGoogleLiveSlashdotNetscapeTechnoratiStumbleUponNewsvineFurlYahooSmarking
No Comment.
Topik sebelumnya Topik selanjutnya Kembali Ke Atas Message [Halaman 1 dari 1]
Permissions in this forum:
Anda tidak dapat menjawab topik
|
{
"url": "http://duniaremaja.gogoo.us/t1311-avchd-files-for-playback-on-the-big-screen-tv-via-dlna",
"source_domain": "duniaremaja.gogoo.us",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "39041",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:A3PBELB3RWXMYMS4O36K7K7YLIPQUXEA",
"WARC-Concurrent-To": "<urn:uuid:be797ed8-93e0-4d47-b9e0-c5998ac90f57>",
"WARC-Date": "2017-10-18T18:38:04Z",
"WARC-IP-Address": "178.33.44.177",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:YGTGDWOVKGBBIFP2AMRZQ4HGTK4RRAV2",
"WARC-Record-ID": "<urn:uuid:281e11d0-c0ad-45d4-afbf-22ea61fa93e0>",
"WARC-Target-URI": "http://duniaremaja.gogoo.us/t1311-avchd-files-for-playback-on-the-big-screen-tv-via-dlna",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0aa6ca07-13de-435f-9332-abd2844adf38>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-111-221-182.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
35,
111,
112,
172,
173,
174,
222,
223,
278,
279,
350,
351,
365,
366,
373,
390,
407,
467,
468,
469,
470,
854,
855,
926,
940,
967,
1013,
1053,
1054,
1410,
1411,
1479,
1480,
1539,
1786,
1787,
1816,
2127,
2128,
2129,
2178,
2364,
2365,
2417,
2418,
2513,
3005,
3006,
3185,
3186,
3187,
3244,
3512,
3513,
3870,
3871,
3872,
3978,
3979,
3985,
4049,
4050,
4253,
4254,
4272,
4402,
4403,
4415,
4416,
4495,
4496,
4523,
4555,
4556
],
"line_end_idx": [
35,
111,
112,
172,
173,
174,
222,
223,
278,
279,
350,
351,
365,
366,
373,
390,
407,
467,
468,
469,
470,
854,
855,
926,
940,
967,
1013,
1053,
1054,
1410,
1411,
1479,
1480,
1539,
1786,
1787,
1816,
2127,
2128,
2129,
2178,
2364,
2365,
2417,
2418,
2513,
3005,
3006,
3185,
3186,
3187,
3244,
3512,
3513,
3870,
3871,
3872,
3978,
3979,
3985,
4049,
4050,
4253,
4254,
4272,
4402,
4403,
4415,
4416,
4495,
4496,
4523,
4555,
4556,
4557
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4557,
"ccnet_original_nlines": 74,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30612245202064514,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.10848549753427505,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1750805526971817,
"rps_doc_frac_unique_words": 0.3892529606819153,
"rps_doc_mean_word_length": 4.730012893676758,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.19089937210083,
"rps_doc_word_count": 763,
"rps_doc_frac_chars_dupe_10grams": 0.024383490905165672,
"rps_doc_frac_chars_dupe_5grams": 0.035466890782117844,
"rps_doc_frac_chars_dupe_6grams": 0.024383490905165672,
"rps_doc_frac_chars_dupe_7grams": 0.024383490905165672,
"rps_doc_frac_chars_dupe_8grams": 0.024383490905165672,
"rps_doc_frac_chars_dupe_9grams": 0.024383490905165672,
"rps_doc_frac_chars_top_2gram": 0.013854250311851501,
"rps_doc_frac_chars_top_3gram": 0.022166810929775238,
"rps_doc_frac_chars_top_4gram": 0.011637570336461067,
"rps_doc_books_importance": -348.2269592285156,
"rps_doc_books_importance_length_correction": -348.2269592285156,
"rps_doc_openwebtext_importance": -196.6012420654297,
"rps_doc_openwebtext_importance_length_correction": -196.6012420654297,
"rps_doc_wikipedia_importance": -128.23805236816406,
"rps_doc_wikipedia_importance_length_correction": -128.23805236816406
},
"fasttext": {
"dclm": 0.02574002929031849,
"english": 0.8483990430831909,
"fineweb_edu_approx": 1.108284592628479,
"eai_general_math": 0.010528620332479477,
"eai_open_web_math": 0.04612218961119652,
"eai_web_code": 0.0039216298609972
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,597,775,097,406,823,000
|
Tuesday, July 03, 2007
Is the Iphone overhyped ?? Are apple products really great.
The wait was over and Iphone was launched. Records tumbled,Share prices rose,expectations gained high and the result was that over 300,000 iphones were sold over 4 days only in the United States. So what makes an iphone such as great product. Is it the Hype created or is it the shear greatness of the product or is it Steve Jobs Marketing strategies or is it the secrecy of the products that was maintained until its official release. We all know that we crave more for what we dont have... isnt it true What do you think?
I have always been a fan of Apple's products becuase of its shear Quality and Excellent Performance. Looking at its products like the Macintosh OS proved to be Unhackable and Virus Free for a long time. Is there an mp3 product that can beat the Ipod with a statistics of over 100 million sold in its first four years.
What more do you need to measure success. Perhaps Apple was eager for success. It has been six years since the launch of Ipod and Apple needed something to break the shackes. The iphone was expected to break the long term drought of Apples product in the market. Would you believe that Apple hired Armed guards to protect the container that had iphones shipped from an unknown Asian Center. Apple also seems to have maintained mum over the disclosure of the components that were used in the manufacture of the iphone except the NVDIA and the AMD graphic components. Was all this added to create an unnatural Hype??
I think the iphone infact was over hyped but did Apple live up to its expectations. Did it better its performance or worse.. What do you think. post your comments
f you like my post you can subscribe to my Newsletter for my Future posts. I would also like to know if this trick has worked for you. Let me know your comments
No comments:
|
{
"url": "https://nuvvenuvve.blogspot.com/2007/06/iphone-is-out-in-united-states-is-it.html",
"source_domain": "nuvvenuvve.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "47665",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6T4Z7SLV2HR3ZVOEHWYGG6R3PWRYBI3Z",
"WARC-Concurrent-To": "<urn:uuid:433dfeb5-7af4-4b41-ab04-e8df5496c753>",
"WARC-Date": "2017-11-24T11:06:44Z",
"WARC-IP-Address": "172.217.7.225",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:45LL3D345AJ74QJ2PIBGMKI63XQNQE6E",
"WARC-Record-ID": "<urn:uuid:4eca6e75-4d79-4923-9178-48705bd9d755>",
"WARC-Target-URI": "https://nuvvenuvve.blogspot.com/2007/06/iphone-is-out-in-united-states-is-it.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:24ff67e5-31b2-43b0-b8a6-dc858f043480>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-230-1-184.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,
24,
84,
85,
609,
610,
928,
929,
1544,
1545,
1708,
1709,
1870,
1871
],
"line_end_idx": [
23,
24,
84,
85,
609,
610,
928,
929,
1544,
1545,
1708,
1709,
1870,
1871,
1883
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1883,
"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.47999998927116394,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01600000075995922,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.09600000083446503,
"rps_doc_frac_unique_words": 0.5190615653991699,
"rps_doc_mean_word_length": 4.398827075958252,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0.002666669897735119,
"rps_doc_unigram_entropy": 4.79405403137207,
"rps_doc_word_count": 341,
"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.024000000208616257,
"rps_doc_frac_chars_top_3gram": 0.014000000432133675,
"rps_doc_frac_chars_top_4gram": 0.012000000104308128,
"rps_doc_books_importance": -166.34864807128906,
"rps_doc_books_importance_length_correction": -166.34564208984375,
"rps_doc_openwebtext_importance": -98.05219268798828,
"rps_doc_openwebtext_importance_length_correction": -98.05219268798828,
"rps_doc_wikipedia_importance": -83.65363311767578,
"rps_doc_wikipedia_importance_length_correction": -83.65363311767578
},
"fasttext": {
"dclm": 0.02956218086183071,
"english": 0.9794549345970154,
"fineweb_edu_approx": 1.1518365144729614,
"eai_general_math": 0.014654519967734814,
"eai_open_web_math": 0.15546458959579468,
"eai_web_code": 0.0014352200087159872
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,880,499,551,851,135,500
|
Having problems with your Toshiba Satellite U300-ST3091 Notebook ?
Need a user freindly manual/operating instructions for someone who is not very experienced...for example how do i play my dvd's on my laptop...is there anything in writing somewhere???
Answers :
You will find that Microsoft has a lot of excellent information available online to help you in the use of windows. (Click here and follow the links)
\015\012Toshiba also has an online support site (available here) where you can download or read a user's guide and take a product tour that will help you to become familiar with the controls on your laptop.
\015\012Here' a link to Music & Sounds that will show you how to use windows media center. But you also have a help center accessible from your start menu that can answer many of these questions for you. Just ask what you want to know in a few key words, don't be intimidated by the help screens, and you'll soon be surfing and browsing with the best of them....
\015\012
I hope this information allows you to resolve this issue. If you need further assistance, please post back with a comment to this thread.
If I've managed to answer your question or solve a problem, please take just a moment to rate this post....thanks!
\015\012
\015\012
Repair Help & Product Troubleshooting for Toshiba Satellite U300-ST3091 Notebook
Tips for a great answer:
- Provide details, support with references or personal experience .
- If you need clarification, ask it in the comment box .
- It's 100% free, no registration required.
Suggested Questions/Answers :
Need help with Compaq Presario v2000 drivers
Your DVD drive is missing the Burning Program not the driver. I found an update for your windvd software for windows 7 but you probably have to have the full program installed to run the update. Hope this helps.http://h20000.www2.hp.com/ ... HP Compaq Presario V2000 Notebook
Cd/dvd works but the r/rw won't work
If you already have a burner like Nero for example, try reinstalling the software. Most probably your burner software is corrupted. ... Dell Inspiron 1501 Notebook
Need a user freindly manual/operating instructions for someone who is not very experienced...for example how do i play my dvd's on my laptop...is there anything in writing somewhere???
You will find that Microsoft has a lot of excellent information available online to help you in the use of windows. (Click here and follow the link ... Toshiba Satellite U300-ST3091 Notebook
DVD/CD play incompaibility
Write the publishers - they're using more complex methods of preventing people from legally watching their legally purchased DVDs on anything other than sanctioned standalone players. ... PC Laptops
I just bought a W3653 last week and I've 3-4 questions. First, I'm 70 years old, had open-heart surgery 20 years ago which pretty well zapped me of any short-term memory and I am basically computer illiterate. I can't remember two thongs at a time and I must write down everything. I need to know how to get my speakers working, do I have to subscribe to some type provider to play DVDs, does this machine have a word processor, and how do I print an e-mail or anything else???
Hi,Your concerns:\015\012\015\012"how to get my speakers working" - depending on what type of speakers were bundled with your eMachine W3653, the speakers may either be connected as shown bel ... PC Desktops
When turning on laptop its asking for a password.didn't set 1
New computers recommend an administrator password so you can set it up. The password would be one that you want to put in. So just use one that you will remember and it will then ask you to confirm the password that you entered. Remember to write ... Acer Aspire One PC Notebook
Dell Inspiron 1501...just not working. At all.
Http://support.dell.com/support/downloads/dr ... Dell Inspiron 1501 Notebook
Sony NEC OptiArc can't read but can write!!!
Try to play the cd that you have wrote with other machine if it was able to read with other machine then your dvd is faulty.If it cannot play with other machine, then there is a problem with the software that you use in cd writing or the ... Dell PC Laptops
I can't burn anything with my DVD/CD-ROM but it reads dvds and cds
First reinstall the operating system and then you use either nero 6 or NTI CD? DVD maker ... PC Desktops
HP G5056EA laptop won't always write to or play dvds properly. I have an Slimtype DVD A DS8AZP ATA Device. About 1 year after buying it, the dvd drive stopped writing to cds, dvds or playing them. I reset the laptop to the way I bought it in preparation to take it back to the store. Before taking it in, I tried it again after a day and it would only read cds. After another day or two, it could read cds and any dvds bought from the shop. A little while later, it could play dvds that I had burn
1st of all which burning software you are using ?2ndly burn the disc @ lowest speedmight help you ... PC Laptops
All dvds will not play in dvd rom on xps400
You can start from checking its general status (it is not clear from your description of the problem). The first you can check if the drive is visible to the systemWith WinXP it is in menu Start\\Control Panel\\System\\Hardware\\"DVD/CD-R ... Dell XPS 400 PC Desktop
Nero 7 and Vista update.
I know most of people will disagree with me, but I will write it anyway.\015\012\015\012Disable Windows Update, specially if you have windows more then few days (months) with plenty of programs on it.\015\012\015\012Updates are ok only wh ... PC Laptops
Trojan.Gampass and Trojan.Wimad
Hi sdcurrie\015\012\015\012Yes your PC is still clean the reason why Norton could'nt remove the virusses is becuase it is on the cd and norton can't write to the cd but it did stop the viruses to spread to your PC.\015\012Just anoth ... PC Desktops
Optiarc DVD RW AD-5170A ATA not writing DVDs
That's not true you clueless ******. It's the dvd writer/reader. It tends to give those faulty errors and i didnt find a way to fix it as well. ... PC Desktops
I need to change the region from 1 to 4 - HP Pavilion dv5-1160us Notebook
What are regional codes ? Motion picture studios want to control the home release of movies in different countries because theater releases aren't simultaneous (a movie may come out on video in the U.S. when it's just hitting scree ... HP Pavilion dv5-1160us Notebook
Re: Errors being experienced with the ACER ASPIRE 5100-5758, OS VISTA. Error dealing with BUS:06, DEVICE:04, FUNCTION:00 AND ON TO FUNCTION:03
Hi, Nice report. We don't see these too often. You've had quite a few tech inclined people on your machine. My first hunch was memory timings and that could still be the problem. However, there is also memory on the display ad ... Acer Aspire 5100 Notebook
Will CD-RW drive play video or do I need CD-Rom? (Gulp) Cost ?
A CD-RW drive can read and write various CD formats, but not DVD. For that you need a combo drive that supports DVD-ROM to read, or DVD-RW to read and write DVDs. Searching the Dell website indicates that they do not make a compatible internal driv ... Dell Latitude C810 PIII 1Ghz, 10-30Gb, 128-256Mb, CD, FD ,Sealed,Refurbished,No OS. (DELLLATITUDEC8101) PC Notebook
My sony vaio laptop model pcg-k33 does not play any type of dvds. would you please let me know how I can fix it? Thank you for you help.
I see its a DVD ROM not writeer so should read DVDs. Maybe the country is not set correctly. Access this by clicking on My Computer / Right click on CD/DVD writer / properties /auto play select mixed content. Also check for country and ensure it is s ... Sony VAIO PCG-K33P Notebook
Computer Freezes While Scanning the Computer
Suggest your anti-virus programs are a bunch of junk. Not trying to be offense. 'Google' -> Norton problems on the internet. Makes you want to run away quickly!Avast? Couldn't cure a problem if it was standing knee deep in it! BItDefender? N ... PC Desktops
The multi DVD recorder can no longer plays DVDs, AVSEC and MPEG
Try servicing ur latop at local repair station..............bcoz the CD lens is not able to write ur data on disk............this is the possible error..............hope this will help u..........Sameeraryan ... PC Desktops
Dvd burner not detected
Sorry, but that model is not a DVD writer. It can only write and rewrite CD's. It can only read DVD's.\015\012\015\012Here is a page with specs:\015\012\015\012 ... Dell Dimension E521 PC Desktop
When playing C/Ds or DVDs the sound output is intermittant
1) Check the cables if you are connecting to an external stereo or speakers.2) Press control-alt-delete to launch the program manager, and look for other tasks hawking the system. Try increasing the media player's execution priori ... PC Desktops
Problem with toshiba satellite A 105 dvd rom
Try a CDROM cleaning disk. ... Toshiba Satellite A105 Notebook
I just installed a phillips dvd cd burner in a computer that used to only have a dvd player and a seperate cd burner. The conputer regonizes the dvd burner and plays and records cds. Plays DVDS, but wont write or record dvds? Anybody know what I need to do? emachine w2260?
Hi There,\015\012\015\012Windows XP doesn't support burning DVDs, only CDs. You need to install an application that will burn DVDs. There are several;\015\012\015\012 ... PC Desktops
WONT PLAY DVDS ,BUT PLAYS CDS
You need to check a few things. May seem basic, but we start with basic steps.\015\0121) Is the drive a DVD capable drive? Not all optical drives are made to read CD's and DVD's. Earlier models only read CD's. Should either have a raised DVD sy ... Sony PC Laptops
• Start your question with What, Why, How, When, etc. and end with a "?"
• Be clear and specific
• Use proper spelling and grammar
all rights reserved to the respective owners || www.electronic-servicing.com || Terms of Use || Contact || Privacy Policy
Load time: 0.4645 seconds
|
{
"url": "http://www.electronic-servicing.com/toshiba_satellite_u300_st3091_notebook/q1452065-need_user_freindly_manual_operating",
"source_domain": "www.electronic-servicing.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "27494",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4WNNQZARC6MSRMVTU53LMRALSOEMKHPX",
"WARC-Concurrent-To": "<urn:uuid:5d43cdfd-c5fc-4cd0-9444-e549b6824038>",
"WARC-Date": "2017-10-21T03:24:02Z",
"WARC-IP-Address": "104.27.179.222",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EM3WQ7MZC4WYM5RNVA463AU3R6QLV4MR",
"WARC-Record-ID": "<urn:uuid:0befe439-ec9f-4f43-8796-0e308bf8114e>",
"WARC-Target-URI": "http://www.electronic-servicing.com/toshiba_satellite_u300_st3091_notebook/q1452065-need_user_freindly_manual_operating",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5608465f-4afe-4690-b7fa-be3165946089>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-71-180-189.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
1,
68,
69,
254,
255,
256,
266,
267,
417,
624,
987,
996,
1134,
1249,
1258,
1259,
1268,
1349,
1350,
1375,
1376,
1444,
1501,
1545,
1546,
1576,
1577,
1622,
1623,
1624,
1900,
1901,
1938,
1939,
1940,
2104,
2105,
2290,
2291,
2292,
2483,
2484,
2511,
2512,
2513,
2712,
2713,
3191,
3192,
3193,
3401,
3402,
3464,
3465,
3466,
3745,
3746,
3793,
3794,
3795,
3872,
3873,
3918,
3919,
3920,
4178,
4179,
4246,
4247,
4248,
4353,
4354,
4852,
4853,
4854,
4967,
4968,
5012,
5013,
5014,
5281,
5282,
5307,
5308,
5309,
5563,
5564,
5596,
5597,
5598,
5847,
5848,
5893,
5894,
5895,
6055,
6056,
6130,
6131,
6132,
6400,
6401,
6544,
6545,
6546,
6803,
6804,
6867,
6868,
6869,
7238,
7239,
7376,
7377,
7378,
7661,
7662,
7707,
7708,
7709,
7967,
7968,
8032,
8033,
8034,
8258,
8259,
8283,
8284,
8285,
8481,
8482,
8541,
8542,
8543,
8790,
8791,
8836,
8837,
8838,
8901,
8902,
9176,
9177,
9178,
9361,
9362,
9392,
9393,
9394,
9659,
9734,
9760,
9796,
9918
],
"line_end_idx": [
1,
68,
69,
254,
255,
256,
266,
267,
417,
624,
987,
996,
1134,
1249,
1258,
1259,
1268,
1349,
1350,
1375,
1376,
1444,
1501,
1545,
1546,
1576,
1577,
1622,
1623,
1624,
1900,
1901,
1938,
1939,
1940,
2104,
2105,
2290,
2291,
2292,
2483,
2484,
2511,
2512,
2513,
2712,
2713,
3191,
3192,
3193,
3401,
3402,
3464,
3465,
3466,
3745,
3746,
3793,
3794,
3795,
3872,
3873,
3918,
3919,
3920,
4178,
4179,
4246,
4247,
4248,
4353,
4354,
4852,
4853,
4854,
4967,
4968,
5012,
5013,
5014,
5281,
5282,
5307,
5308,
5309,
5563,
5564,
5596,
5597,
5598,
5847,
5848,
5893,
5894,
5895,
6055,
6056,
6130,
6131,
6132,
6400,
6401,
6544,
6545,
6546,
6803,
6804,
6867,
6868,
6869,
7238,
7239,
7376,
7377,
7378,
7661,
7662,
7707,
7708,
7709,
7967,
7968,
8032,
8033,
8034,
8258,
8259,
8283,
8284,
8285,
8481,
8482,
8541,
8542,
8543,
8790,
8791,
8836,
8837,
8838,
8901,
8902,
9176,
9177,
9178,
9361,
9362,
9392,
9393,
9394,
9659,
9734,
9760,
9796,
9918,
9943
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9943,
"ccnet_original_nlines": 155,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36603423953056335,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06802406162023544,
"rps_doc_frac_lines_end_with_ellipsis": 0.00641026021912694,
"rps_doc_frac_no_alph_words": 0.19759370386600494,
"rps_doc_frac_unique_words": 0.38196125626564026,
"rps_doc_mean_word_length": 4.6271185874938965,
"rps_doc_num_sentences": 137,
"rps_doc_symbol_to_word_ratio": 0.021749189123511314,
"rps_doc_unigram_entropy": 5.7202372550964355,
"rps_doc_word_count": 1652,
"rps_doc_frac_chars_dupe_10grams": 0.0703819990158081,
"rps_doc_frac_chars_dupe_5grams": 0.07613815367221832,
"rps_doc_frac_chars_dupe_6grams": 0.0703819990158081,
"rps_doc_frac_chars_dupe_7grams": 0.0703819990158081,
"rps_doc_frac_chars_dupe_8grams": 0.0703819990158081,
"rps_doc_frac_chars_dupe_9grams": 0.0703819990158081,
"rps_doc_frac_chars_top_2gram": 0.010465719737112522,
"rps_doc_frac_chars_top_3gram": 0.010204079560935497,
"rps_doc_frac_chars_top_4gram": 0.013343799859285355,
"rps_doc_books_importance": -881.12158203125,
"rps_doc_books_importance_length_correction": -881.12158203125,
"rps_doc_openwebtext_importance": -510.1728210449219,
"rps_doc_openwebtext_importance_length_correction": -510.1728210449219,
"rps_doc_wikipedia_importance": -359.6197814941406,
"rps_doc_wikipedia_importance_length_correction": -359.6197814941406
},
"fasttext": {
"dclm": 0.022391559556126595,
"english": 0.9122055172920227,
"fineweb_edu_approx": 1.3184309005737305,
"eai_general_math": 0.029101790860295296,
"eai_open_web_math": 0.12672573328018188,
"eai_web_code": 0.011609789915382862
}
}
|
{
"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": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,153,096,595,856,363,300
|
PHP-PHPExcel Range to Array игнорирует пустой столбец
PHP-PHPExcel Range to Array игнорирует пустой столбец
17.12.2019 10:39:26 Просмотров 112 Источник
У меня есть ниже лист Excel, где я хочу получить диапазон A1:D4в массив PHP.
enter image description here
Для этого я использую PHPExcelкак показано ниже. У меня есть простой Excel
Excel.php
И тогда у меня есть простая функция для получения диапазона, используя функцию rangeToArray() :
public function __construct($file)
{
if ($file instanceof \SplFileInfo) {
$filename = $file->getRealPath();
} else {
$filename = $file;
}
$this->objPHPExcel = \PhpOffice\PhpSpreadsheet\IOFactory::load($filename);
$this->objPHPExcel->setActiveSheetIndex(0);
}
Теперь проблема заключается в том, что вышеупомянутая функция "переключает" столбцы. Смотрите ниже Выходные данные:
public function getRange($range)
{
$spreadsheet = $this->objPHPExcel;
return $spreadsheet->rangeToArray($range,' ', true, true, true);
}
$excel = new ExcelManipulator(storage_path() . '/app/temp_files/myfile.xlsx');
$array = $excel->getRange($range);
return response()->json(['result' => $array], 200);
Как вы можете видеть в массиве для строк [ '1': [ "A": " ", "B": " ", "C": " ", "D": " " ], '2': [ "A": "Company", "B": "Acme Inc", "C": " ", "D": " " ], '3': [ "A": "Address", "B": "New York", "C": " ", "D": " " ], '4': [ "A": " ", "B": " ", "C": " ", "D": " " ] ] и 2, текст компании и адреса начинается уже в 3, в то время как они должны начинаться в Column A
У вопроса есть решение - Посмотреть?
https://stackoverflow.com/questions/59369572/php-phpexcel-range-to-array-ignores-empty-column#comment105038869_59369572
Привет @oliverbj, просто проверяю, используете ли вы пакет phpoffice/phpspreadsheet, а не устаревший phpoffice/phpexcel, верно?
https://stackoverflow.com/questions/59369572/php-phpexcel-range-to-array-ignores-empty-column#comment105092429_59369572
Проблема, вероятно, исходит из переменной $range. Не могли бы вы добавить немного больше контекста ?
Ответы - PHP-PHPExcel Range to Array игнорирует пустой столбец / PHP - PHPExcel Range to Array ignores empty column
Fabrice Fabiyi
19.12.2019 05:16:43
Вы можете попробовать это сделать
function getRange($range, $inputFileName)
{
$spreadsheet = \PhpOffice\PhpSpreadsheet\IOFactory::load($inputFilename);
return $spreadsheet->getActiveSheet()->rangeToArray($range," ", true, true, true);
}
$inputFilename = storage_path() . '/app/temp_files/myfile.xlsx';
$array = getRange($range, $inputFilename);
https://stackoverflow.com/questions/59369572/php-phpexcel-range-to-array-ignores-empty-column/59411535#comment105099865_59411535
Это сработало и для меня тоже.
diegowc
24.12.2019 06:23:15
Это прекрасно работало для меня, используя php 7.2.26 и phpoffice/phpspreadsheet 1.10.1. Я создал xlsx-файл с теми же значениями ячеек, что и у вас.
$excel = new Excel('file.xlsx');
$range = 'A1:D4';
$array = $excel->getRange($range);
var_dump($array);
class Excel
{
private $objPHPExcel;
public function __construct($file)
{
if ($file instanceof \SplFileInfo) {
$filename = $file->getRealPath();
} else {
$filename = $file;
}
$this->objPHPExcel = \PhpOffice\PhpSpreadsheet\IOFactory::load($filename);
$this->objPHPExcel->setActiveSheetIndex(0);
}
public function getRange($range)
{
$spreadsheet = $this->objPHPExcel->getActiveSheet();
return $spreadsheet->rangeToArray($range,' ', true, true, true);
}
}
А это уже выход:
array(4) {
[1] =>
array(4) {
'A' =>
string(2) " "
'B' =>
string(2) " "
'C' =>
string(2) " "
'D' =>
string(2) " "
}
[2] =>
array(4) {
'A' =>
string(2) " "
'B' =>
string(7) "Company"
'C' =>
string(8) "Acme Inc"
'D' =>
string(2) " "
}
[3] =>
array(4) {
'A' =>
string(2) " "
'B' =>
string(7) "Address"
'C' =>
string(8) "New York"
'D' =>
string(2) " "
}
[4] =>
array(4) {
'A' =>
string(2) " "
'B' =>
string(2) " "
'C' =>
string(2) " "
'D' =>
string(2) " "
}
}
Помочь в развитии проекта:
Закрыть X
|
{
"url": "https://rugeek.ru/questions/php-phpexcel-range-to-array-ignores-empty-column/",
"source_domain": "rugeek.ru",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "43681",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EKF5AIQJPENU3LOL3HX6N7X7G7D2IL7N",
"WARC-Concurrent-To": "<urn:uuid:eb6a710a-7e49-4660-a049-6c762b71b5e2>",
"WARC-Date": "2021-10-15T20:13:43Z",
"WARC-IP-Address": "87.236.16.122",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RPFHVYWRU2Z7O6JHAHPX7IVMH7V66UX4",
"WARC-Record-ID": "<urn:uuid:3dafa3a5-6ba6-4947-b613-2e8bbb84d476>",
"WARC-Target-URI": "https://rugeek.ru/questions/php-phpexcel-range-to-array-ignores-empty-column/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a7b41ca6-f3eb-47a9-bf9b-5c8a147e12ff>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-112\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
54,
55,
56,
110,
111,
155,
156,
233,
234,
263,
264,
339,
340,
350,
351,
447,
448,
483,
485,
527,
570,
584,
612,
619,
620,
700,
749,
751,
752,
868,
869,
902,
904,
943,
1013,
1014,
1016,
1017,
1096,
1131,
1132,
1184,
1185,
1548,
1549,
1586,
1587,
1707,
1835,
1955,
2056,
2057,
2173,
2174,
2189,
2190,
2210,
2211,
2245,
2246,
2288,
2290,
2368,
2455,
2456,
2458,
2523,
2566,
2695,
2726,
2734,
2735,
2755,
2756,
2905,
2906,
2939,
2957,
2992,
2993,
3011,
3012,
3024,
3026,
3050,
3051,
3088,
3092,
3134,
3177,
3191,
3219,
3226,
3227,
3307,
3356,
3360,
3361,
3396,
3400,
3457,
3527,
3531,
3533,
3534,
3551,
3552,
3563,
3572,
3585,
3596,
3615,
3626,
3645,
3656,
3675,
3686,
3705,
3709,
3718,
3731,
3742,
3761,
3772,
3796,
3807,
3832,
3843,
3862,
3866,
3875,
3888,
3899,
3918,
3929,
3953,
3964,
3989,
4000,
4019,
4023,
4032,
4045,
4056,
4075,
4086,
4105,
4116,
4135,
4146,
4165,
4169,
4171,
4198
],
"line_end_idx": [
54,
55,
56,
110,
111,
155,
156,
233,
234,
263,
264,
339,
340,
350,
351,
447,
448,
483,
485,
527,
570,
584,
612,
619,
620,
700,
749,
751,
752,
868,
869,
902,
904,
943,
1013,
1014,
1016,
1017,
1096,
1131,
1132,
1184,
1185,
1548,
1549,
1586,
1587,
1707,
1835,
1955,
2056,
2057,
2173,
2174,
2189,
2190,
2210,
2211,
2245,
2246,
2288,
2290,
2368,
2455,
2456,
2458,
2523,
2566,
2695,
2726,
2734,
2735,
2755,
2756,
2905,
2906,
2939,
2957,
2992,
2993,
3011,
3012,
3024,
3026,
3050,
3051,
3088,
3092,
3134,
3177,
3191,
3219,
3226,
3227,
3307,
3356,
3360,
3361,
3396,
3400,
3457,
3527,
3531,
3533,
3534,
3551,
3552,
3563,
3572,
3585,
3596,
3615,
3626,
3645,
3656,
3675,
3686,
3705,
3709,
3718,
3731,
3742,
3761,
3772,
3796,
3807,
3832,
3843,
3862,
3866,
3875,
3888,
3899,
3918,
3929,
3953,
3964,
3989,
4000,
4019,
4023,
4032,
4045,
4056,
4075,
4086,
4105,
4116,
4135,
4146,
4165,
4169,
4171,
4198,
4207
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4207,
"ccnet_original_nlines": 154,
"rps_doc_curly_bracket": 0.0071309697814285755,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.022482890635728836,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04692082107067108,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7106549143791199,
"rps_doc_frac_unique_words": 0.5149051547050476,
"rps_doc_mean_word_length": 7.363143444061279,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.0029325499199330807,
"rps_doc_unigram_entropy": 4.950301170349121,
"rps_doc_word_count": 369,
"rps_doc_frac_chars_dupe_10grams": 0.13765181601047516,
"rps_doc_frac_chars_dupe_5grams": 0.2675745189189911,
"rps_doc_frac_chars_dupe_6grams": 0.21751931309700012,
"rps_doc_frac_chars_dupe_7grams": 0.21751931309700012,
"rps_doc_frac_chars_dupe_8grams": 0.16562384366989136,
"rps_doc_frac_chars_dupe_9grams": 0.16562384366989136,
"rps_doc_frac_chars_top_2gram": 0.017666539177298546,
"rps_doc_frac_chars_top_3gram": 0.017666539177298546,
"rps_doc_frac_chars_top_4gram": 0.022083180025219917,
"rps_doc_books_importance": -426.22894287109375,
"rps_doc_books_importance_length_correction": -426.22894287109375,
"rps_doc_openwebtext_importance": -259.0934143066406,
"rps_doc_openwebtext_importance_length_correction": -259.0934143066406,
"rps_doc_wikipedia_importance": -207.00238037109375,
"rps_doc_wikipedia_importance_length_correction": -207.00238037109375
},
"fasttext": {
"dclm": 0.9446408152580261,
"english": 0.0457068607211113,
"fineweb_edu_approx": 2.828094482421875,
"eai_general_math": 0.006567299831658602,
"eai_open_web_math": 0.15694725513458252,
"eai_web_code": 0.539918065071106
}
}
|
{
"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": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,141,588,927,824,379,000
|
XPath is a fundamental component in the XSLT standard. Xpath does not operate on its surface syntax and instead functions on the logical structure of an XML document. It can be used effectively for manipulating numbers, strings and booleans.
Upah xpath Developers
Tapis
Carian terbaru saya
Tapis melalui:
Bajet
hingga
hingga
hingga
Jenis
Kemahiran
Bahasa
Status Pekerjaan
1 tugasan ditemui, harga dalam USD
Parsehub ([log masuk untuk melihat URL]) is a web scraping tool that is easy to use. With this advanced web scraper, extracting data is as easy as clicking the data you need. We are looking for a freelancer that can work with Parsehub. For our projects, multiple sources would be identified, of which data would be retrieved. All-in-all we can identify 10 projects for which we would need your suppo...
$9 / hr (Avg Bid)
$9 / hr Avg Bida
14 bida
Artikel Komuniti xpath Teratas
|
{
"url": "https://www.my.freelancer.com/jobs/xpath/",
"source_domain": "www.my.freelancer.com",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "135987",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SMJDI26P7GJSL3D4AW6NC3Y2B4PBL5DT",
"WARC-Concurrent-To": "<urn:uuid:9942b100-e28a-4ccf-bc62-3c35bd448e04>",
"WARC-Date": "2018-11-15T10:32:49Z",
"WARC-IP-Address": "54.88.198.164",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ALOP3FOKQNE3AZ4FNCYIAAHK4V4Y6SNM",
"WARC-Record-ID": "<urn:uuid:1163bd63-2033-456c-a890-4f75978e4f59>",
"WARC-Target-URI": "https://www.my.freelancer.com/jobs/xpath/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:55e14127-0403-4fc4-81e9-c719b4301b67>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-229-81-75.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,
242,
243,
265,
266,
272,
273,
293,
308,
314,
321,
328,
335,
341,
351,
358,
379,
418,
419,
826,
827,
849,
870,
882,
883
],
"line_end_idx": [
242,
243,
265,
266,
272,
273,
293,
308,
314,
321,
328,
335,
341,
351,
358,
379,
418,
419,
826,
827,
849,
870,
882,
883,
917
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 917,
"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.323699414730072,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023121390491724014,
"rps_doc_frac_lines_end_with_ellipsis": 0.03999999910593033,
"rps_doc_frac_no_alph_words": 0.16763006150722504,
"rps_doc_frac_unique_words": 0.7142857313156128,
"rps_doc_mean_word_length": 4.809523582458496,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0.00578034995123744,
"rps_doc_unigram_entropy": 4.537580490112305,
"rps_doc_word_count": 147,
"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.008486559614539146,
"rps_doc_frac_chars_top_3gram": 0.016973130404949188,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -56.01322555541992,
"rps_doc_books_importance_length_correction": -56.01322555541992,
"rps_doc_openwebtext_importance": -38.04344177246094,
"rps_doc_openwebtext_importance_length_correction": -27.230209350585938,
"rps_doc_wikipedia_importance": -26.16215705871582,
"rps_doc_wikipedia_importance_length_correction": -26.16215705871582
},
"fasttext": {
"dclm": 0.02789931930601597,
"english": 0.7753344178199768,
"fineweb_edu_approx": 1.7094621658325195,
"eai_general_math": 0.3240739703178406,
"eai_open_web_math": 0.36358392238616943,
"eai_web_code": 0.011796300299465656
}
}
|
{
"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.138",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "8",
"label": "Documentation"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,871,196,271,465,555,000
|
Skip to main content
A permission that allows agents to only see certain CRM usergroups - Community / Feature Request - Deskpro Support
9
A permission that allows agents to only see certain CRM usergroups Collecting Feedback
The ability to allow only certain agents can only see certain CRM usergroups. For instance, if there was a confidential client that only certain agents should see the details of, to have a confidential user group and then only allow certain agents to see who was in that user group.
Add a comment
Please log in or register to submit a comment.
Need a password reminder?
|
{
"url": "https://support.deskpro.com/en-US/community/view/a-permission-that-allows-agents-to-only-see-certain-crm-usergroups",
"source_domain": "support.deskpro.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "156529",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UFIUTPCC4H73MAKQYRHDAXHLNU6HHVGJ",
"WARC-Concurrent-To": "<urn:uuid:4a6383b9-a073-495b-b095-ba6b23210eaa>",
"WARC-Date": "2024-05-19T08:01:40Z",
"WARC-IP-Address": "104.16.29.121",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:A6ZDXQWFJSPLJAACXMVU56VL2KNVBIM3",
"WARC-Record-ID": "<urn:uuid:c4a78f53-404e-42cc-89ac-3b7b9fa13ffe>",
"WARC-Target-URI": "https://support.deskpro.com/en-US/community/view/a-permission-that-allows-agents-to-only-see-certain-crm-usergroups",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ee7aad41-3957-401b-89f3-ad5b12518812>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-33\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
21,
22,
137,
138,
140,
141,
228,
229,
512,
513,
527,
528,
575,
576
],
"line_end_idx": [
21,
22,
137,
138,
140,
141,
228,
229,
512,
513,
527,
528,
575,
576,
601
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 601,
"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.47706422209739685,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0458715595304966,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.0917431190609932,
"rps_doc_frac_unique_words": 0.5299999713897705,
"rps_doc_mean_word_length": 4.829999923706055,
"rps_doc_num_sentences": 4,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.6967899799346924,
"rps_doc_word_count": 100,
"rps_doc_frac_chars_dupe_10grams": 0.23188406229019165,
"rps_doc_frac_chars_dupe_5grams": 0.2877846658229828,
"rps_doc_frac_chars_dupe_6grams": 0.23188406229019165,
"rps_doc_frac_chars_dupe_7grams": 0.23188406229019165,
"rps_doc_frac_chars_dupe_8grams": 0.23188406229019165,
"rps_doc_frac_chars_dupe_9grams": 0.23188406229019165,
"rps_doc_frac_chars_top_2gram": 0.049689438194036484,
"rps_doc_frac_chars_top_3gram": 0.08695652335882187,
"rps_doc_frac_chars_top_4gram": 0.10559006035327911,
"rps_doc_books_importance": -56.742061614990234,
"rps_doc_books_importance_length_correction": -70.46011352539062,
"rps_doc_openwebtext_importance": -34.59941482543945,
"rps_doc_openwebtext_importance_length_correction": -48.317466735839844,
"rps_doc_wikipedia_importance": -20.582698822021484,
"rps_doc_wikipedia_importance_length_correction": -34.300750732421875
},
"fasttext": {
"dclm": 0.028620479628443718,
"english": 0.8927245140075684,
"fineweb_edu_approx": 0.9658889770507812,
"eai_general_math": 0.007111249957233667,
"eai_open_web_math": 0.4572363495826721,
"eai_web_code": 0.00022548000561073422
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.402",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,833,813,338,674,552,000
|
Docunext
• About
My Experience Runing pfSense 1.2 on a Verizon FIOS Powered Network
March 5th, 2008
Now that pfSense 1.2 is out and I finally hav FIOS, I'm planning a new router based on either an ALIX board or a VIA C7 board. I'm leaning towards the VIA C7, as it has padlock support as well as PATA / SATA support for a real hard drive. I recently tested out the Squid cache package for pfSense and was pleased with how it worked, so I'll probably set that up as well.
I happen to have two of the same ALIX and C7 boards, so I would like to setup CARP failover, but that is definitely unchartered territory for me. I just read here that you need one real IP address for each CARP member, and since I only have 1 IP address (Verizon wants $20 / 5 ips / month!), I guess that answers my question.
The only thing about the C7 board that I'm concerned about is the power and heat factor. The C7 is efficient, but not as efficient as the Geode LX. The board I have uses about 20 watts by itself, so if I added a hard drive, that would also consume power. Maybe I'll use a laptop hard drive.
Yearly Indexes: 2010 2003 2005 2006 2007 2008 2009 2004 2011 2012 2013 2015 2019 2020
|
{
"url": "http://www.docunext.com/2008/03/pfsense-12-and-fios/",
"source_domain": "www.docunext.com",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "15965",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7GGRWC3XJGCGGUBGT3V4KXQJAYSTWOSN",
"WARC-Concurrent-To": "<urn:uuid:24db14ac-3edf-4a7f-84ad-a8059f1391c0>",
"WARC-Date": "2020-08-04T11:01:26Z",
"WARC-IP-Address": "185.199.111.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SP4IIQX5IHD6QI5BD7GHQRFVYMMZO2IB",
"WARC-Record-ID": "<urn:uuid:9ed456fe-d58f-4074-911e-b1d106c64dc9>",
"WARC-Target-URI": "http://www.docunext.com/2008/03/pfsense-12-and-fios/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1dab6797-e62b-4c31-a0d4-36d8ebc6ecf5>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-214.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,
9,
10,
20,
21,
88,
89,
105,
106,
477,
478,
804,
805,
1096,
1097
],
"line_end_idx": [
9,
10,
20,
21,
88,
89,
105,
106,
477,
478,
804,
805,
1096,
1097,
1183
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1183,
"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.36940300464630127,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.11940298974514008,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21268656849861145,
"rps_doc_frac_unique_words": 0.6140350699424744,
"rps_doc_mean_word_length": 3.9824562072753906,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.701303005218506,
"rps_doc_word_count": 228,
"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.029735680669546127,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -119.7117919921875,
"rps_doc_books_importance_length_correction": -119.7117919921875,
"rps_doc_openwebtext_importance": -79.18243408203125,
"rps_doc_openwebtext_importance_length_correction": -79.09945678710938,
"rps_doc_wikipedia_importance": -55.70201873779297,
"rps_doc_wikipedia_importance_length_correction": -55.70201873779297
},
"fasttext": {
"dclm": 0.022112669423222542,
"english": 0.9655187726020813,
"fineweb_edu_approx": 0.9689249396324158,
"eai_general_math": 0.37352097034454346,
"eai_open_web_math": 0.19708621501922607,
"eai_web_code": 0.05083608999848366
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.028563",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "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": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,142,846,735,412,697,000
|
Subset Sum – HackerRank Solution
In this post, we will solve Subset Sum HackerRank Solution. This problem (Subset Sum) is a part of HackerRank Functional Programming series.
Contents
Task
You are given a list of N positive integers, A = {a[1], a[2], …, a[N]} and another integer S. You have to find whether there exists a non-empty subset of A whose sum is greater than or equal to S.
You have to print the size of minimal subset whose sum is greater than or equal to S. If there exists no such subset then print -1 instead.
Input
First line will contain an integer, N, which is the size of list A. Second line contains N space separated integers, representing the elements of list A. In third line there is an integer, T, which represent the number of test cases to follow. Then follows T lines. Each one of them contains an single integer, S.
Output
For each test case, print the size of minimal subset whose sum is greater than or equal to S. If there’s no such subset then print -1.
Constraints
• 1 ≤ N ≤ 105
• 1 ≤ a[i] ≤ 109
• 1 ≤ T ≤ 105
• 1 ≤ S ≤ 1015
Note
Two subsets are different if there’s an element a[i] which exists in one of them and not in other. That is, for set A = {4, 4} there are four possible subsets {}{a[1]}{a[2]} and {a[1], a[2]}.
Sample Input
4
4 8 10 12
4
4
13
30
100
Sample Output
1
2
3
-1
Explanation
Sample Case #00: For S = 4, we can select any one element of set A as each of them is greater than or equal to 4.
Sample Case #01: There are many possible subsets of size 2 whose sum is not less than 13. They are {4, 10}{4, 12}{8, 10}{8, 12} and {10, 12}.
Sample Case #02: Subset {8, 10, 12}, with sum 30, is the only subset of size 3 whose sum is not less than S = 30.
Sample Case #03: Even after selecting all the elements of A, we can’t exceed S = 100.
Solution – Subset Sum – HackerRank Solution
Scala
import java.util.Scanner
import scala.collection.Searching._
object Solution {
def main(args: Array[String]): Unit = {
val sc = new Scanner(System.in)
sc.nextLine
val a = sc.nextLine.split(' ').map(_.toLong).sortBy(-_)
var sum = 0L
val sums = a.map(v => {
sum += v
sum
})
val t = sc.nextInt
(0 until t).foreach(_ => {
val s = sc.nextLong
val count = (sums.search(s) match {
case InsertionPoint(i) => i
case Found(i) => i
}) + 1
println(if (count <= a.length) count else -1)
})
}
}
Note: This problem (Subset Sum) is generated by HackerRank but the solution is provided by CodingBroz. This tutorial is only for Educational and Learning purpose.
Leave a Comment
Your email address will not be published. Required fields are marked *
|
{
"url": "https://www.codingbroz.com/subset-sum-hackerrank-solution/",
"source_domain": "www.codingbroz.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "203249",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:66HPSF5CMLZU5566S7R2HW5KLUUSAMQX",
"WARC-Concurrent-To": "<urn:uuid:7a189f06-03cf-4887-8f55-b594024fbca0>",
"WARC-Date": "2023-02-09T12:22:09Z",
"WARC-IP-Address": "104.21.28.87",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:X2NKSHBWB42DEARPBM67IBPPB5TSJZQZ",
"WARC-Record-ID": "<urn:uuid:677989c7-fab2-4fd8-b3bb-2f7734ef2895>",
"WARC-Target-URI": "https://www.codingbroz.com/subset-sum-hackerrank-solution/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d58fd2a0-9075-4876-8a1e-8f977a17a0b5>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-78\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
33,
34,
175,
176,
185,
186,
191,
192,
389,
390,
530,
531,
537,
538,
852,
853,
860,
861,
996,
997,
1009,
1010,
1026,
1045,
1061,
1078,
1079,
1084,
1276,
1277,
1290,
1291,
1293,
1303,
1305,
1307,
1310,
1313,
1317,
1318,
1332,
1333,
1335,
1337,
1339,
1342,
1343,
1355,
1356,
1470,
1612,
1726,
1812,
1813,
1857,
1858,
1864,
1865,
1890,
1891,
1927,
1928,
1946,
1988,
2024,
2025,
2041,
2101,
2102,
2119,
2147,
2162,
2172,
2179,
2180,
2203,
2234,
2260,
2261,
2303,
2339,
2366,
2379,
2431,
2438,
2442,
2444,
2445,
2608,
2609,
2625,
2626
],
"line_end_idx": [
33,
34,
175,
176,
185,
186,
191,
192,
389,
390,
530,
531,
537,
538,
852,
853,
860,
861,
996,
997,
1009,
1010,
1026,
1045,
1061,
1078,
1079,
1084,
1276,
1277,
1290,
1291,
1293,
1303,
1305,
1307,
1310,
1313,
1317,
1318,
1332,
1333,
1335,
1337,
1339,
1342,
1343,
1355,
1356,
1470,
1612,
1726,
1812,
1813,
1857,
1858,
1864,
1865,
1890,
1891,
1927,
1928,
1946,
1988,
2024,
2025,
2041,
2101,
2102,
2119,
2147,
2162,
2172,
2179,
2180,
2203,
2234,
2260,
2261,
2303,
2339,
2366,
2379,
2431,
2438,
2442,
2444,
2445,
2608,
2609,
2625,
2626,
2696
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2696,
"ccnet_original_nlines": 92,
"rps_doc_curly_bracket": 0.01261128019541502,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27123695611953735,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03725782036781311,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3695976138114929,
"rps_doc_frac_unique_words": 0.4192139804363251,
"rps_doc_mean_word_length": 4.093886375427246,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0.007451559882611036,
"rps_doc_unigram_entropy": 4.877449989318848,
"rps_doc_word_count": 458,
"rps_doc_frac_chars_dupe_10grams": 0.06400000303983688,
"rps_doc_frac_chars_dupe_5grams": 0.19893333315849304,
"rps_doc_frac_chars_dupe_6grams": 0.13813333213329315,
"rps_doc_frac_chars_dupe_7grams": 0.08053333312273026,
"rps_doc_frac_chars_dupe_8grams": 0.08053333312273026,
"rps_doc_frac_chars_dupe_9grams": 0.08053333312273026,
"rps_doc_frac_chars_top_2gram": 0.018666669726371765,
"rps_doc_frac_chars_top_3gram": 0.0266666691750288,
"rps_doc_frac_chars_top_4gram": 0.03200000151991844,
"rps_doc_books_importance": -296.2294921875,
"rps_doc_books_importance_length_correction": -296.2294921875,
"rps_doc_openwebtext_importance": -175.46981811523438,
"rps_doc_openwebtext_importance_length_correction": -175.46981811523438,
"rps_doc_wikipedia_importance": -122.67119598388672,
"rps_doc_wikipedia_importance_length_correction": -122.67119598388672
},
"fasttext": {
"dclm": 0.46531736850738525,
"english": 0.6871395707130432,
"fineweb_edu_approx": 3.0799803733825684,
"eai_general_math": 0.8386569619178772,
"eai_open_web_math": 0.3489706516265869,
"eai_web_code": 0.06001954898238182
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "511.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,893,202,149,292,342,300
|
st*b*rc
Posted by Eiim at 4:32 PM on 12/3/2020 EST:
If you were to un-capitalize STiBaRC, would it be stibarc or stIbArc?
˄ 2 ˅ 0
Comments:
herronjo
I believe the general consensus is it would be stibarc, since nobody seems to capitalize it correctly in normal usage but me, but if you wanted to be technical and "flip the case", it would be stIbArc.
Log in to post a comment!
|
{
"url": "http://legacy.stibarc.com/post.sjs?id=3439",
"source_domain": "legacy.stibarc.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "1215",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HIJJAZU53SKUXDMY2XSVZJYVZPLW23PR",
"WARC-Concurrent-To": "<urn:uuid:c7749b4e-04e3-4b45-a833-aad51943cd88>",
"WARC-Date": "2022-08-14T03:39:35Z",
"WARC-IP-Address": "74.140.55.163",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GUS3Y4VLK27JKZJZTATIMAY656C5FPA4",
"WARC-Record-ID": "<urn:uuid:c7c3bcb9-b5ed-48dc-bef7-7c58ac9b96f8>",
"WARC-Target-URI": "http://legacy.stibarc.com/post.sjs?id=3439",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3eaf2657-0fdd-489e-98c4-f074349da6aa>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-115\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
8,
9,
53,
54,
124,
125,
134,
135,
145,
154,
356
],
"line_end_idx": [
8,
9,
53,
54,
124,
125,
134,
135,
145,
154,
356,
381
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 381,
"ccnet_original_nlines": 11,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4193548262119293,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.032258059829473495,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2688171863555908,
"rps_doc_frac_unique_words": 0.7183098793029785,
"rps_doc_mean_word_length": 4.070422649383545,
"rps_doc_num_sentences": 3,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.770989418029785,
"rps_doc_word_count": 71,
"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.09342560917139053,
"rps_doc_frac_chars_top_3gram": 0.06228373944759369,
"rps_doc_frac_chars_top_4gram": 0.11072663962841034,
"rps_doc_books_importance": -44.82785415649414,
"rps_doc_books_importance_length_correction": -44.82785415649414,
"rps_doc_openwebtext_importance": -30.913270950317383,
"rps_doc_openwebtext_importance_length_correction": -30.913270950317383,
"rps_doc_wikipedia_importance": -24.444210052490234,
"rps_doc_wikipedia_importance_length_correction": -24.444210052490234
},
"fasttext": {
"dclm": 0.0752076506614685,
"english": 0.9549219608306885,
"fineweb_edu_approx": 1.1554445028305054,
"eai_general_math": 0.546100914478302,
"eai_open_web_math": 0.5106135606765747,
"eai_web_code": 0.000050430000555934384
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.01",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,762,181,815,430,729,000
|
May 26, 2005
tabbed tying
The IE team continues to post news about IE7, including an in-depth look at their approach to tabbed browsing. There's lots of interesting stuff about how tabs will interact with the browser window and third party helper apps / toolbars, but long time watchers of Microsoft's legal battles will certainly enjoy this paragraph...
Another example of what makes this challenging is that IE and Explorer windows share the same code for the frame and chrome (toolbars, menus, etc.), which means there are more code paths and different types of interactions with the hosted view (in this case, a ShellView) that were required to continue working after adding tabbed browsing to IE.
Remember when a post like that would have made its way into evidence? Good times.
|
{
"url": "https://sippey.com/2005/05/tabbed_tying.html",
"source_domain": "sippey.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "4078",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:I3BVPHMSWOOPT5KD5ZRMETPHARHSDAYB",
"WARC-Concurrent-To": "<urn:uuid:300d9198-8e33-4941-95cd-b03df099f28d>",
"WARC-Date": "2022-09-26T12:20:13Z",
"WARC-IP-Address": "185.199.110.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:K766SDHXUN6XTBFVJQ4MHRX75FB2D2R2",
"WARC-Record-ID": "<urn:uuid:0e42a3aa-8489-4b9a-843a-32bd4907c9dd>",
"WARC-Target-URI": "https://sippey.com/2005/05/tabbed_tying.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fe357e6d-1b60-4f34-af5a-033e735fc061>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-215\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,
13,
14,
27,
28,
358,
359,
706,
707
],
"line_end_idx": [
13,
14,
27,
28,
358,
359,
706,
707,
789
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 789,
"ccnet_original_nlines": 8,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40789473056793213,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02631578966975212,
"rps_doc_frac_lines_end_with_ellipsis": 0.1111111119389534,
"rps_doc_frac_no_alph_words": 0.1381578892469406,
"rps_doc_frac_unique_words": 0.7769230604171753,
"rps_doc_mean_word_length": 4.846153736114502,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0.006578950211405754,
"rps_doc_unigram_entropy": 4.4909467697143555,
"rps_doc_word_count": 130,
"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.04444444179534912,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -52.0926628112793,
"rps_doc_books_importance_length_correction": -52.0926628112793,
"rps_doc_openwebtext_importance": -37.45459747314453,
"rps_doc_openwebtext_importance_length_correction": -37.454490661621094,
"rps_doc_wikipedia_importance": -32.88942337036133,
"rps_doc_wikipedia_importance_length_correction": -32.88942337036133
},
"fasttext": {
"dclm": 0.29260408878326416,
"english": 0.9618166089057922,
"fineweb_edu_approx": 2.0108389854431152,
"eai_general_math": 0.06006687879562378,
"eai_open_web_math": 0.02457714080810547,
"eai_web_code": 0.10268110036849976
}
}
|
{
"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": "344.73",
"labels": {
"level_1": "Social sciences",
"level_2": "Law",
"level_3": "Martial law"
}
}
},
"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": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "13",
"label": "News (Org.)"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,245,391,511,012,249,000
|
Music Messenger Makes it Easy to Share YouTube Songs
We all have loads of songs that are our favorites and videos we love to watch on YouTube, but when you come across one that you absolutely have to share with your best friend, you are stopped short in your tracks, because it’s just not a straightforward task to perform in YouTube.
Now, take Music Messenger. It’s been out for some time, but took a break for a while. In its initial run, most people loved what it had to offer. It makes sense of YouTube by providing a superb search engine from which to explore and find songs you know and love, and to make new discoveries.
It’s a music player of sorts, but feeds off of what is already in YouTube, so in a nutshell, it allows you to dig around in YouTube and then pull out what you like, save it, and store it in a way that makes sense to you, so you can find it again and so you can share it.
The sharing is the big game changer with Music Messenger. While YouTube does not make it easy to share, Music Messenger does.
When you download and set up your Music Messenger account, it will ask for permission to access your contacts list. You will have to say yes if you want the app to be able to send to friends. On your end, you will need to provide a phone number. While the app does not specifically say which phone number, I would assume it to be your cell phone number, otherwise, anything else would not make sense.
The one feature that sets Music Messenger apart from just using YouTube is that you can customize messages that you send to friends. These customizations include screen shots and verbiage. It adds some zing to a message that would otherwise just be a link to song. Creating these messages is as easy as using the entire app. It’s all right there at your fingertips.
Music Messenger
To start using the app, you most likely are going to use the Search and Explore function. From here you can type in keywords to look for song based on words in the title or artist or genre. If you would prefer narrowing down your choices, you can go into either the Trending list or Charts list. From here your searches are just taps into areas that are defined.
After finding songs you like, you can add them to existing or newly created playlists. These playlists are something that will coincide with your YouTube playlists, as well.
Once you’ve built up songs and playlists, both can be shared. You can send individual song or full playlists to people on your contacts list, and package them up nicely with a customized messaging format. I thought this was really neat and all of my friends really like it as well.
What I would like to figure out is how to make sure that all of my iOS devices have the same set of playlists and songs as I have setup on my iPhone. I have been doing everything from the iPhone, but I’m not even sure if I will see the same things on my iPad.
I am sure that is a supported feature, and I’ll have to tinker around with the Music Messenger to figure it out. Until them, I am going to take full advantage of the app to make using YouTube an easier experience for me. I am also looking forward to making more customized messages to send out soon!
|
{
"url": "http://appsandapplications.com/tag/music-messenger-app-review/",
"source_domain": "appsandapplications.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "76209",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TNNDH2T73MKLAAN7AA6HSTYEDUO3E6GK",
"WARC-Concurrent-To": "<urn:uuid:52b3b693-97a7-41f4-baae-50a3214be078>",
"WARC-Date": "2017-10-20T07:09:55Z",
"WARC-IP-Address": "108.167.140.181",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VFGNQOV227KCYUOLC5K3MQOOFPCHMI5G",
"WARC-Record-ID": "<urn:uuid:d8c34c05-d710-4121-b6f1-abcb2b8b69c5>",
"WARC-Target-URI": "http://appsandapplications.com/tag/music-messenger-app-review/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f55a4942-fd30-4da3-a418-6aef9376cecd>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-155-170-72.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
53,
54,
336,
337,
630,
631,
902,
903,
1029,
1030,
1431,
1432,
1798,
1799,
1815,
1816,
1818,
1819,
2182,
2183,
2357,
2358,
2640,
2641,
2901,
2902
],
"line_end_idx": [
53,
54,
336,
337,
630,
631,
902,
903,
1029,
1030,
1431,
1432,
1798,
1799,
1815,
1816,
1818,
1819,
2182,
2183,
2357,
2358,
2640,
2641,
2901,
2902,
3201
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3201,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5311572551727295,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016320470720529556,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.09792284667491913,
"rps_doc_frac_unique_words": 0.4126455783843994,
"rps_doc_mean_word_length": 4.2046589851379395,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.009121894836426,
"rps_doc_word_count": 601,
"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.04432132840156555,
"rps_doc_frac_chars_top_3gram": 0.006331619806587696,
"rps_doc_frac_chars_top_4gram": 0.010288880206644535,
"rps_doc_books_importance": -307.6839904785156,
"rps_doc_books_importance_length_correction": -307.6839904785156,
"rps_doc_openwebtext_importance": -179.20103454589844,
"rps_doc_openwebtext_importance_length_correction": -179.20103454589844,
"rps_doc_wikipedia_importance": -151.5517120361328,
"rps_doc_wikipedia_importance_length_correction": -151.5517120361328
},
"fasttext": {
"dclm": 0.05847698077559471,
"english": 0.9658946394920349,
"fineweb_edu_approx": 1.1785199642181396,
"eai_general_math": 0.03931117057800293,
"eai_open_web_math": 0.13775289058685303,
"eai_web_code": 0.016945000737905502
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "780",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "-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": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,085,106,743,024,928,000
|
• Home
• Map
• Email: mail@besthelp.duckdns.org
Syntax error missing operator sql access
com/ questions/ / Syntax- error- missing- operator- in- query. · Access SQL: basic concepts, vocabulary, and syntax. This is one of a set of articles about Access SQL. · Syntax Error ( missing operator) in query expression the code below works perfectly. Proficient in Access, Excel, VBA, and SQL. Office VBA Reference Access VBA Syntax error ( missing operator). ( Error 2431) Syntax error ( missing operator). Create and Delete Tables and. The reason for the syntax error is that you have not surrounded any of your. a date ( in Access) with a # character and numerics with nothing. to use parameters, you have no parameter placeholders in your SQL string and. Error: Syntax error ( missing operator).
• Fatal error steamapi init failed
• Throw custom error message c
• Error message e161 403e
• Fatal error class zend config ini not found
• Video:Error operator access
Error syntax missing
Syntax error ( missing operator) in query expression ‘ ( And(. MS Access & SQL ( 9) Other ( 20). · I am getting an error when trying to filer a query: Syntax error ( missing operator) in query expression ' Total Employees'. I have read in other questions. I think you and iambaman are right - it is the stuff in the field itself. I am not good enough with Access to understand the bad SQL in rowsource property part though. Try changing the where clause to this: WHERE institution. institutionName = " CMI" AND student. gender = " boy" ;. In MS Access, & is for string concatenation. I assume the error is because a string is expected between the two. · I have a simple Access Database with 1 table and multiple forms that feed data into the table. Access Error: Syntax error. Syntax error ( missing operator). · Syntax error ( missing operator) when setting query sql.
Microsoft Access / VBA Forums on Bytes. Oracle Migration Workbench for MS Access Reference Guide Release. Missing semicolon ( ; ) at end of SQL statement. As far as I can tell it is a perfectly valid SQL query: SELECT T1. Access Driver] Syntax error ( missing operator) in query expression ' T1. ERROR: Syntax error ( missing operator) in query expression ' PopID = '. Ideally I would like to be able to list four cells that would go into four columns in access appending each time the macro is ran. Const TARGET_ DB. in query expression". I have the following error message " Syntax Error ( missing operator) in query expression". My str SQL code is all one line. Dim strSQL As String Me. MS Access is very particular with the parentheses in queries.
When you have multi- table joins a pair of parentheses must be around each join: SELECT ERM_ HAZARD. HAZARDID AS PKTrans, ERM_ HAZARD. One of my forms is open in datasheet view and when I click on the arrow besides name of the field to filter data it gives me an error: Syntax error ( missing operator) in query operation ' Name of Person'. There are no queries. · I am new to Access, VB, and SQL so bear with me a little. When I run the below code it keeps giving me a syntax error, saying I am missing an operator between. · Error Message: Syntax error ( missing operator). There are considerable differences between the SQL dialects in Access and SQL Server,. SELECT * QA- Technical into the SQL, the Microsoft Query says that I have a Syntax Error ( missing operator) in query expression ' * QA- Total'. · Syntax Error ( Missing Operator) In Query Expression Forms.
Adjust your field names and SQL statement accordingly and you should avoid the problem. Syntax error ( missing operator) in query expression ' Name = ' O' Malleys' '. A sample query in Access that uses all these field types would look like:. · Syntax error ( missing operator) in query expression while. otherwise you' ll need to know what ' escape characters' to use in the sql for access. · MS Access 3075 error on simple query. I don' t see a syntax error in that and it' s not like I' m tying it in SQL anyway to get a syntax error. · I keep getting a syntax error ( Missing Operator in. in the SQL syntax for Excel that I don' t know about. Or maybe it' s because I used the Access syntax. · Access for Developers msdn. The table Coins is already used in SQL.
Same error as originally posted- syntax error ( missing operator). · Syntax error ( missing operator) in query expression- Microsoft Access Development. Visit Dev Articles to discuss Syntax error ( missing operator) in. Its based on an Access Db, and I' m getting the a missing operator error for the following SQL:. [ odbc microsoft access driver] syntax error ( missing operator). Syntax error ( missing operator) in query expression. The query is missing the IN and commas between. Is there a syntax to access the table name in the select. · MS ACCESS, Syntax error ( missing operator). · I had this query works for MS SQL, but getting error running it for Access DB.
[ Microsoft] [ ODBC Microsoft Access Driver] Syntax error ( missing operator) in. Everytime I run this SQL it says - syntax error ( missing operator) in query expression ' row_ number( ) over ( order by RunTime) ' Table Name:. · Syntax error ( missing operator) in query expression Errors in vb. I was able to quickly fix it by going into Design View of the Form and putting [ ] around any field names that had spaces. I am now able to use the built in filters without the annoying popup about syntax problems. Access has strong opinions on parentheses. SELECT * FROM ( tblUSPS INNER JOIN tblProductUSPS ON tblProductUSPS. [ PRODUCTUSPS_ USPS] = tblUSPS. [ USPS_ CODE] ) INNER JOIN tblAttribute ON tblUSPS. · hi, getting this error when storing the data in a database. ERROR [ 4] [ Microsoft] [ ODBC Microsoft Access Driver] Syntax error ( missing operator) in query. · Does anyone know this error : Syntax error ( missing operator) in query. ( missing operator) in query expression ' Name'.
Syntax error( missing. · I have an Access front end with a SQL backend. I' m trying to add a couple of fields to a form. When I edit the working SQL s. | 10 replies | General Databases. There are a number of items in your query that should also have failed in any SQL- compliant database: You have fields from tables in GROUP BY not referenced in FROM or JOIN clauses. Number of fields in SELECT query. The following error occurred when running SQL query " SELECT STKGRP,. Access Driver] Syntax error ( missing operator) in query expression. · Hello I am getting the following syntax error ( missing operator). ( missing operator) in query expression - Access. Then grab the SQL to us in VBA. · Then you can visually inspect it to see if it looks correct. If you cannot see anything obvious, try creating a query manually using the exact same SQL code ( open up. · Syntax error: missing operator in query expression Queries.
|
{
"url": "http://besthelp.duckdns.org/1c8a4a77d07d.html",
"source_domain": "besthelp.duckdns.org",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "12535",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VACFNLXNM7YZ5IUCYZVTMSSXXSWDR7DY",
"WARC-Concurrent-To": "<urn:uuid:7da4d4ea-8de3-4aeb-aad9-4f35c1feb180>",
"WARC-Date": "2019-11-22T09:34:36Z",
"WARC-IP-Address": "77.220.212.209",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:3AA6W2NJKSJ3AL5BJ76HUIH6REW3D7FI",
"WARC-Record-ID": "<urn:uuid:cefe42ee-3289-431a-9e15-87a93e85544e>",
"WARC-Target-URI": "http://besthelp.duckdns.org/1c8a4a77d07d.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5fdf3fb5-5b7c-4e69-8a5b-2cfe51d8107d>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-112.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,
9,
17,
54,
55,
96,
97,
801,
802,
839,
872,
900,
948,
949,
950,
982,
983,
1008,
1009,
1883,
1884,
2640,
2641,
3515,
3516,
4285,
4286,
4961,
4962,
5958,
5959
],
"line_end_idx": [
9,
17,
54,
55,
96,
97,
801,
802,
839,
872,
900,
948,
949,
950,
982,
983,
1008,
1009,
1883,
1884,
2640,
2641,
3515,
3516,
4285,
4286,
4961,
4962,
5958,
5959,
6887
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6887,
"ccnet_original_nlines": 30,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2876044511795044,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07869081199169159,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2277158796787262,
"rps_doc_frac_unique_words": 0.3088364005088806,
"rps_doc_mean_word_length": 4.61154842376709,
"rps_doc_num_sentences": 102,
"rps_doc_symbol_to_word_ratio": 0.0006963799824006855,
"rps_doc_unigram_entropy": 4.908548831939697,
"rps_doc_word_count": 1143,
"rps_doc_frac_chars_dupe_10grams": 0.023524949327111244,
"rps_doc_frac_chars_dupe_5grams": 0.2546006441116333,
"rps_doc_frac_chars_dupe_6grams": 0.23126541078090668,
"rps_doc_frac_chars_dupe_7grams": 0.20849934220314026,
"rps_doc_frac_chars_dupe_8grams": 0.12938721477985382,
"rps_doc_frac_chars_dupe_9grams": 0.06450389325618744,
"rps_doc_frac_chars_top_2gram": 0.08347561955451965,
"rps_doc_frac_chars_top_3gram": 0.11952190846204758,
"rps_doc_frac_chars_top_4gram": 0.1677101105451584,
"rps_doc_books_importance": -689.8591918945312,
"rps_doc_books_importance_length_correction": -689.8591918945312,
"rps_doc_openwebtext_importance": -435.1268005371094,
"rps_doc_openwebtext_importance_length_correction": -435.1268005371094,
"rps_doc_wikipedia_importance": -265.3001403808594,
"rps_doc_wikipedia_importance_length_correction": -265.3001403808594
},
"fasttext": {
"dclm": 0.03564494848251343,
"english": 0.8023461699485779,
"fineweb_edu_approx": 1.6353551149368286,
"eai_general_math": 0.554360568523407,
"eai_open_web_math": 0.17786306142807007,
"eai_web_code": 0.9512717127799988
}
}
|
{
"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": "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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,526,345,253,842,441,000
|
Page MenuHomePhabricator
Remove reference to fields replaced by the actor table from WMCS views
Closed, ResolvedPublic
Description
T188327: Deploy refactored actor storage is at the point where we can usefully begin planning the removal of the xx_user and xx_user_text fields that are being replaced by the actor table, as we're beginning to stop writing them in production in preparation for dropping them. Before we can drop them in WMF production, we'll have to make the following changes to the WMCS views.
The fields that need changing are:
• archive: ar_user and ar_user_text.
• filearchive: fa_user and fa_user_text.
• image: img_user and img_user_text.
• ipblocks: ipb_by and ipb_by_text.
• logging: log_user and log_user_text.
• oldimage: oi_user and oi_user_text.
• recentchanges: rc_user and rc_user_text.
• revision: rev_user and rev_user_text.
In non-compat views these fields should be removed. In compat views, the existing conditional should be simplified to remove the case that reads these fields when the corresponding xx_actor fields are null/0.
Note the "_userindex" tables are not obsolete as they're still needed for queries by xx_actor, although they are perhaps slightly misnamed now.
The end result should be no change in user-visible behavior for the compat views, as everything should already be hitting the actor table cases, while users using the non-compat views will start getting errors about nonexistent fields if they haven't already updated their code to join with actor.
Event Timeline
Anomie created this task.May 15 2019, 6:51 PM
Restricted Application added a subscriber: Aklapper. · View Herald TranscriptMay 15 2019, 6:51 PM
Change 510595 had a related patch set uploaded (by Anomie; owner: Anomie):
[operations/puppet@production] wiki replicas: Remove reference to old user fields
https://gerrit.wikimedia.org/r/510595
Bstorm added a subscriber: Bstorm.May 17 2019, 10:29 PM
Announced a deployment of 2019-05-27. Hopefully that will work pretty well for everyone.
Krenair added a subscriber: Krenair.
Nux added a subscriber: Nux.May 18 2019, 8:50 PM
Hi. I just fixed my tool on toolforge, but... Am I correct to assume that actor_user is null only for anonymous actors (IP)?
So below will only select non-anon actors right? And will also work after the deployment?
SELECT actor_id as id, actor_name FROM actor
WHERE
actor_id IN ($idList)
AND actor_user IS NOT NULL
Hi,
I tried to update one of my tools (intersect-contribs) to use the actor table instead of the revision.rev_user_text field.
Joining the revision and actor tables on revision.rev_actor = actor.actor_id is painfully slow and makes my tool unusable.
I guess that the reason is that there is no index on the revision.rev_actor column (which is nullable, by the way).
Would it be possible to have a view like revision_userindex (which has index on rev_user_text) with an index on the rev_actor column instead?
In this way, this very common join would be way faster.
I tried to update one of my tools (intersect-contribs) to use the actor table instead of the revision.rev_user_text field.
Joining the revision and actor tables on revision.rev_actor = actor.actor_id is painfully slow and makes my tool unusable.
Can you give an example of a slow query?
Pietrodn added a comment.EditedMay 19 2019, 7:57 PM
Sure! In my case, I'm trying to find the the IDs of all the pages edited by both User:Pietrodn and User:Frieda (the database is itwiki_p).
SELECT rev_page, COUNT(rev_id) AS edit_count
FROM revision
JOIN actor ON actor_id = rev_actor
WHERE actor_name IN ('Pietrodn', 'Frieda')
GROUP BY rev_page
HAVING COUNT(DISTINCT actor_id)=2
...but this simpler query, consisting of a plain JOIN, is also slow:
SELECT rev_page
FROM revision
JOIN actor ON actor_id = rev_actor
WHERE actor_name IN ('Pietrodn', 'Frieda')
Use FROM revision_userindex instead of FROM revision.
Still slow. The query executed in 21 minutes. revision_userindex has no index on rev_author either, indeed.
The same query on the indexed rev_user_text field executed in 7 seconds, instead:
SELECT rev_page
FROM revision_userindex
WHERE rev_user_text IN ('Pietrodn', 'Frieda')
Krenair added a comment.EditedMay 19 2019, 9:58 PM
This seems to return quickly, on itwiki_p:
SELECT rev_page, COUNT(rev_id) AS edit_count
FROM revision_userindex
JOIN actor ON actor_id = rev_actor
WHERE actor_name IN ('Pietrodn', 'Frieda')
GROUP BY rev_page
HAVING COUNT(DISTINCT actor_id)=2
838 rows in set (6.09 sec)
Weird. Runs fast on SQL console but slow in a web-based tool.
Anyway, I see this is being taken care of. https://phabricator.wikimedia.org/T221339
ahhh, that being in-progress might explain the difference observed. good catch
Bstorm added a comment.EditedMay 20 2019, 6:39 PM
Announced that this is now going to be scheduled for June 3rd after more feedback and finding at least one issue that, I hope, is fixed over at T221339.
bd808 moved this task from Backlog to Wiki replicas on the Data-Services board.May 30 2019, 7:02 PM
MBH added a subscriber: MBH.May 31 2019, 4:29 PM
I changed a code of one of my bots to using actor_name instead of log/rev_user_text and bot became work several times longer (more than a hour vs. 5-10 min). This bot makes two requests to DB replicas on Toolforge:
select cast(actor_name as char) user, log_type, log_action, log_namespace, cast(log_title as char) title from logging join actor on actor_id=log_actor where (actor_user in (select ug_user from user_groups where (ug_group = "sysop" or ug_group = "closer")) and log_timestamp >= 20190101000000 and log_timestamp < 20190601000000);
select page_namespace, cast(page_title as char) title, cast(actor_name as char) user from revision join page on rev_page=page_id join actor on actor_id=rev_actor where (actor_user in (select ug_user from user_groups where (ug_group = "sysop" or ug_group = "closer")) and rev_timestamp >= 20190101000000 and rev_timestamp < 20190601000000);
(closer is semi-admin user group in ruwiki)
In T223406#5226490, @MaxBioHazard wrote:
I changed a code of one of my bots to using actor_name instead of log/rev_user_text and bot became work several times longer (more than a hour vs. 5-10 min). This bot makes two requests to DB replicas on Toolforge:
select cast(actor_name as char) user, log_type, log_action, log_namespace, cast(log_title as char) title from logging join actor on actor_id=log_actor where (actor_user in (select ug_user from user_groups where (ug_group = "sysop" or ug_group = "closer")) and log_timestamp >= 20190101000000 and log_timestamp < 20190601000000);
select page_namespace, cast(page_title as char) title, cast(actor_name as char) user from revision join page on rev_page=page_id join actor on actor_id=rev_actor where (actor_user in (select ug_user from user_groups where (ug_group = "sysop" or ug_group = "closer")) and rev_timestamp >= 20190101000000 and rev_timestamp < 20190601000000);
(closer is semi-admin user group in ruwiki)
The actor view uses subqueries for data scrubbing unfortunately. We don't yet have a way to speed that up directly, but if @Anomie has any advice for querying it I can offer to users, I am eager to hear it. We are working on additional speed-ups for that view. Work on that was a bit stalled by some other tasks recently.
Huji updated the task description. (Show Details)Jun 2 2019, 11:33 PM
Change 510595 merged by Bstorm:
[operations/puppet@production] wiki replicas: Remove reference to old user fields
https://gerrit.wikimedia.org/r/510595
Mentioned in SAL (#wikimedia-operations) [2019-06-03T15:39:09Z] <bstorm_> T223406 labsdb1012 updated views for actor table changes
Meno25 added a subscriber: Meno25.Jun 3 2019, 4:12 PM
Change 514063 had a related patch set uploaded (by Bstorm; owner: Bstorm):
[operations/puppet@production] wikireplicas: depool labsdb1010 for view updates
https://gerrit.wikimedia.org/r/514063
Change 514063 merged by Bstorm:
[operations/puppet@production] wikireplicas: depool labsdb1010 for view updates
https://gerrit.wikimedia.org/r/514063
Mentioned in SAL (#wikimedia-operations) [2019-06-03T16:30:40Z] <bstorm_> T223406 depooled labsdb1010 for view updates
Change 514185 had a related patch set uploaded (by Bstorm; owner: Bstorm):
[operations/puppet@production] wikireplicas: depool labsdb1011 for view updates
https://gerrit.wikimedia.org/r/514185
Mentioned in SAL (#wikimedia-operations) [2019-06-03T22:08:59Z] <bstorm_> T223406 repooled labsdb1010 after completing view updates
Change 514185 merged by Bstorm:
[operations/puppet@production] wikireplicas: depool labsdb1011 for view updates
https://gerrit.wikimedia.org/r/514185
Mentioned in SAL (#wikimedia-operations) [2019-06-03T22:20:15Z] <bstorm_> T223406 depooled labsdb1011
Change 514199 had a related patch set uploaded (by Bstorm; owner: Bstorm):
[operations/puppet@production] wikireplicas: depool labsdb1009 for view updates
https://gerrit.wikimedia.org/r/514199
Mentioned in SAL (#wikimedia-operations) [2019-06-04T00:09:26Z] <bstorm_> T223406 repooled labsdb1011 after completing view updates
Change 514199 merged by Bstorm:
[operations/puppet@production] wikireplicas: depool labsdb1009 for view updates
https://gerrit.wikimedia.org/r/514199
Mentioned in SAL (#wikimedia-operations) [2019-06-04T01:10:57Z] <bstorm_> T223406 depooled/repooled labsdb1009 for view updates
Bstorm added a comment.Jun 4 2019, 2:54 AM
This is deployed. Running a quick check on some views shows the fields are gone.
Bstorm added a comment.Jun 4 2019, 2:55 AM
I set up a wiki page to help direct people to if they have issues. Hopefully I can make it a bit better as I see where people are having trouble. I know some folks didn't finish migrating to the new schema since I saw their queries when I depooled things, so I expect some issues. https://wikitech.wikimedia.org/wiki/News/Actor_storage_changes_on_the_Wiki_Replicas
Bstorm closed this task as Resolved.Jun 4 2019, 6:31 PM
|
{
"url": "https://phabricator.wikimedia.org/T223406",
"source_domain": "phabricator.wikimedia.org",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "214239",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2G5OPWHD4KMFHCNMIIQEMZIGDW4IIEXQ",
"WARC-Concurrent-To": "<urn:uuid:841ef661-3a83-4f33-bdbf-9c3814fbb8ad>",
"WARC-Date": "2019-10-22T06:32:17Z",
"WARC-IP-Address": "208.80.154.224",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5U4RDOB7WYZOX2WJEZAQDUIN6XJSA6P6",
"WARC-Record-ID": "<urn:uuid:2df8ab19-aa66-4de0-8775-f38fe084bf9e>",
"WARC-Target-URI": "https://phabricator.wikimedia.org/T223406",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6aa29f01-0ae7-4623-8735-8208f437d8e4>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-65.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
25,
26,
97,
120,
121,
133,
134,
514,
515,
550,
551,
590,
633,
672,
710,
751,
791,
836,
878,
879,
1088,
1089,
1233,
1234,
1532,
1533,
1548,
1549,
1595,
1693,
1694,
1769,
1851,
1852,
1890,
1891,
1947,
1948,
2037,
2038,
2075,
2124,
2125,
2250,
2251,
2341,
2342,
2387,
2394,
2418,
2447,
2448,
2452,
2575,
2576,
2699,
2815,
2816,
2958,
3014,
3015,
3138,
3261,
3262,
3303,
3304,
3356,
3357,
3496,
3497,
3542,
3556,
3591,
3634,
3652,
3686,
3687,
3756,
3757,
3773,
3787,
3822,
3865,
3866,
3920,
3921,
4029,
4030,
4112,
4113,
4129,
4153,
4199,
4250,
4251,
4294,
4295,
4340,
4364,
4399,
4442,
4460,
4494,
4521,
4522,
4584,
4669,
4670,
4749,
4750,
4800,
4801,
4954,
4955,
5055,
5104,
5105,
5320,
5321,
5650,
5990,
5991,
6035,
6036,
6077,
6078,
6293,
6294,
6623,
6963,
6964,
7008,
7009,
7331,
7332,
7402,
7403,
7435,
7517,
7518,
7556,
7557,
7688,
7689,
7743,
7744,
7819,
7899,
7900,
7938,
7939,
7971,
8051,
8052,
8090,
8091,
8210,
8211,
8286,
8366,
8367,
8405,
8406,
8538,
8539,
8571,
8651,
8652,
8690,
8691,
8793,
8794,
8869,
8949,
8950,
8988,
8989,
9121,
9122,
9154,
9234,
9235,
9273,
9274,
9402,
9403,
9446,
9447,
9528,
9529,
9572,
9573,
9938,
9939
],
"line_end_idx": [
25,
26,
97,
120,
121,
133,
134,
514,
515,
550,
551,
590,
633,
672,
710,
751,
791,
836,
878,
879,
1088,
1089,
1233,
1234,
1532,
1533,
1548,
1549,
1595,
1693,
1694,
1769,
1851,
1852,
1890,
1891,
1947,
1948,
2037,
2038,
2075,
2124,
2125,
2250,
2251,
2341,
2342,
2387,
2394,
2418,
2447,
2448,
2452,
2575,
2576,
2699,
2815,
2816,
2958,
3014,
3015,
3138,
3261,
3262,
3303,
3304,
3356,
3357,
3496,
3497,
3542,
3556,
3591,
3634,
3652,
3686,
3687,
3756,
3757,
3773,
3787,
3822,
3865,
3866,
3920,
3921,
4029,
4030,
4112,
4113,
4129,
4153,
4199,
4250,
4251,
4294,
4295,
4340,
4364,
4399,
4442,
4460,
4494,
4521,
4522,
4584,
4669,
4670,
4749,
4750,
4800,
4801,
4954,
4955,
5055,
5104,
5105,
5320,
5321,
5650,
5990,
5991,
6035,
6036,
6077,
6078,
6293,
6294,
6623,
6963,
6964,
7008,
7009,
7331,
7332,
7402,
7403,
7435,
7517,
7518,
7556,
7557,
7688,
7689,
7743,
7744,
7819,
7899,
7900,
7938,
7939,
7971,
8051,
8052,
8090,
8091,
8210,
8211,
8286,
8366,
8367,
8405,
8406,
8538,
8539,
8571,
8651,
8652,
8690,
8691,
8793,
8794,
8869,
8949,
8950,
8988,
8989,
9121,
9122,
9154,
9234,
9235,
9273,
9274,
9402,
9403,
9446,
9447,
9528,
9529,
9572,
9573,
9938,
9939,
9994
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9994,
"ccnet_original_nlines": 194,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.242600679397583,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05676855891942978,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3008248507976532,
"rps_doc_frac_unique_words": 0.34996384382247925,
"rps_doc_mean_word_length": 5.6218366622924805,
"rps_doc_num_sentences": 98,
"rps_doc_symbol_to_word_ratio": 0.004366809967905283,
"rps_doc_unigram_entropy": 5.599446773529053,
"rps_doc_word_count": 1383,
"rps_doc_frac_chars_dupe_10grams": 0.38533762097358704,
"rps_doc_frac_chars_dupe_5grams": 0.4518328011035919,
"rps_doc_frac_chars_dupe_6grams": 0.43048232793807983,
"rps_doc_frac_chars_dupe_7grams": 0.4204501509666443,
"rps_doc_frac_chars_dupe_8grams": 0.40565916895866394,
"rps_doc_frac_chars_dupe_9grams": 0.40565916895866394,
"rps_doc_frac_chars_top_2gram": 0.008488750085234642,
"rps_doc_frac_chars_top_3gram": 0.014405139721930027,
"rps_doc_frac_chars_top_4gram": 0.02546623907983303,
"rps_doc_books_importance": -1001.5050048828125,
"rps_doc_books_importance_length_correction": -1001.5050048828125,
"rps_doc_openwebtext_importance": -604.9918823242188,
"rps_doc_openwebtext_importance_length_correction": -604.9918823242188,
"rps_doc_wikipedia_importance": -455.0118103027344,
"rps_doc_wikipedia_importance_length_correction": -455.0118103027344
},
"fasttext": {
"dclm": 0.03802258148789406,
"english": 0.8527836799621582,
"fineweb_edu_approx": 1.2766203880310059,
"eai_general_math": 0.3673626184463501,
"eai_open_web_math": 0.148809015750885,
"eai_web_code": 0.3420804738998413
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-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": "18",
"label": "Q&A Forum"
}
},
"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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,263,913,073,636,658,700
|
Jump to content
Search the Community
Showing results for tags 'subtract'.
More search options
• Search By Tags
Type tags separated by commas.
• Search By Author
Content Type
Forums
• Affinity Support
• News and Information
• Affinity Support & Questions
• Feature Requests, Suggestions & Discussions
• Learn and Share
• Tutorials (Serif and Customer Created Tutorials)
• Share your work
• Resources
• Bug Reporting
• Report a Bug in Affinity Designer
• Report a Bug in Affinity Photo
• Report a Bug in Affinity Publisher
• (Pre 1.7) Affinity Range Bugs Forums
• Beta Software Forums
• Affinity Designer Beta Forums
• Affinity Photo Beta Forums
• Affinity Publisher Beta Forums
Find results in...
Find results that contain...
Date Created
• Start
End
Last Updated
• Start
End
Filter by number of...
Joined
• Start
End
Group
AIM
MSN
Website URL
ICQ
Yahoo
Jabber
Skype
Location
Interests
Found 35 results
1. I was trying to subtract two shapes from another and it gives an unexpected behaviour. Even if I this was a user error (which I don't think it is) this result does not match the expectation. So I'd consider this either a bug in code or in UX. This is with latest version from the MAS on 10.14.6
2. Hello! I looked for similar issues but found none that described my experience, so I'm starting a new thread. I'm having an issue where the subtract operation works for two specific layers but doesn't work after a small change is made. (Yes, fill mode is set to alternate) I want to subtract a text on a path from a simple shape, see here: Upon hitting subtract I am left with the expected result (correctly subtracted): However, when I try the same with the text in German (which is what I am intending to do), I end up with something different. Same setup, only the text has changed: result: There's just nothing left. It was driving me a mad because I thought I had made a mistake and simply couldn't figure out what was going wrong. Having isolated the issue so clearly I believe it must be a bug, right? It's the same when I convert the text to shapes first, by the way. Any insight would be most welcome, thanks! klsmn
3. I am trying to use the boolean tool but the operation leaves a thin unwanted line, kindly help.
4. When making a selection with the Selection Brush Tool the action of the Add and Subtract buttons are reversed.
5. Hi, I was trying to create a shape by overlapping a circle shape with another circle shape (the 2nd circle was only the stroke and with no fill) when I tried to crop (subtract) the first circle with the 2nd circle the program cut the shape as if there 2nd circle had a fill and ignoring it was only the stroke (see attached). I had to convert the circle in to a donut to perform this. Thanks
6. Hi, I'm completely new to vectors/ Affinity Designer and enjoying using it but really struggling with one thing, subtracting text from multiple shapes. I want the black text in the first image to be clear, so need to subtract it from the white stripes, grey stripes, and white stars beneath. They are all in different layers/groups, and as you can see from the second picture multiple groups within layers. When I select the layers and text the subtract tool is greyed out. I've read a few other posts about similar subjects and it seems I have to convert to curves? But can't get my head around it or work out how to apply it all to my file. Been driving me mad all week so any help would be much appreciated, thanks!
7. I can never seem to get the ADD, SUBTRACT, DIVIDE, COMBINE functions to work right, can someone please tell me what I may be doing wrong or if it's something with the software settings? https://screencast-o-matic.com/watch/cqfeDnZfQU
8. Hello, is there any shortcut to use will have a selection tool to change between add and subtract instantly? Like in PS? This will make my life waaaay easier. thank you!
9. Hello, I'm having an issue when I'm trying to perform the Subtract operation of two simple shapes. In my situation, one square overlaps the edge of another, and when I Subtract the front one there is a residual line of geometry closing the gap. The strangest thing is that this only occurs when the underneath shape is at a certain orientation, only if it is rotated less than 90 degrees anti-clockwise, which happened to be the situation I was in. See the screenshot and file for more clarity. subtract.afdesign
10. Geometry operations (Add, Subtract, etc.) take a very long time to complete. With a large number of objects indefinitely, or the program crashes. This also applies to the stable version (1.6.5) and is independent of the file. For the test, I checked the same file in Affinity Designer and Xara Designer Pro X10, which performs this operation in 1-2 seconds. I hope in new versions this feature will finally be working adequately.
11. I seem to be going round in circles in trying to resolve this issue, so please help me if you can. I have an image that I want to crop at a diagonal (see attached image). It would seem that the Add/Subtract/etc. functions only work when it is two shapes that are being worked on, not a shape and an image - at least, when I try to do this, they are all greyed-out except for the Divide function (which doesn't appear to do anything). I have tried using a jpeg image, but have also converted that image to an eps and an svg, all with no luck. Am I doing something wrong, or asking AD to do something it can't - and, if that is the case, what can I do as an alternative? Is there a function in AP that would allow me to do this? I want to overlay the resulting, cropped, image onto an artist's impression. Any input would be much appreciated. Shape from image.afdesign
12. Hi, I want to subtract one curve from the other but it doesn't work. What's wrong, please help. test.afdesign
13. Hi Affinity Designer Users ! I redesign a logo for one of our customers and need some help. I have to subtract the red area from the blue... as I subtract it, Affinity Designer just subtract "HWABEN", but "SC" stays blue and is not subtracted. What can I do ? I really need help ! Thanks in advance. Best regards Lucas
14. Hello everyone! I've got some suggestions for improving the selection tools: 1: Could you add a shortcut to the tools that lets the user add to selection when holding shift? 2: Could you add a shortcut to the tools that lets the user subtract from the selection when holding alt? 3: Currently, when I select Mode -> Add, I can only add to selection if I am starting the loop outside of the current selection. It seems there is no way to start a loop inside the selection, because if I try to do so, I actually move the selection. This behaviour could be accessed with M (Rectangular Marquee Tool), though. Being able to start a loop inside the current selection is just easier sometimes. 4: Could you include the selection menu (from the menu bar) in the selection tools so that it is being displayed at cursor location when right clicking? 5: I guess this is a bug, but I am adding this here as it's about the same tool: Clicking L to select the Free Hand Selection Tool will not show a different cursor initially. The cursor will only be displayed after using the tool. Best wishes, Shu
15. Greetings! I'm trying to find out how I can punch a hole in an object in Affinity Photo. (not Designer) With Photoshop, I'm used to just grabbing the marquee tool, draw a selection and hit delete since everything is in raster form. When I try searching online or in the AF forums I keep getting information related to Affinity Designer. Thanks ... Scott
16. While editing an old eps file I had imported into Affinity Designer, I tried to use a Boolean Subtract to convert 3 curve layers to a single Curves layer with 2 transparent holes in it. I have done this a zillion times without problems but for these 3 curves what I got instead was no transparency, something like this: It took me much too long to figure out why, but the reason is simple: by default, shapes are assigned the Alternate (Even-Odd) fill mode. For whatever reason, the shapes in the old eps file all used the Winding (Non-Zero) fill mode, which for subtractions like this one fill everything.
17. See the video and the file attached for example. bug480.mov bug.afdesign
18. In this short tutorial I demonstrate the Geometry operations (add, subtract, intersect, divide, combine) in Affinity Designer 1.6.0 (destructively and non-destructively) with some samples. Keep on drawin' Norbert
19. I've created a vector mask, for a vector, to make the image look degraded. How do I then combine this mask/aged look effect, so I get one complete vector layer, so I can scale and resize with no loss? Am I missing something obvious? Edit: 'Distressed Look' Chapter in Affinity Workbook p.324 should help. Any more pointers though, do let me know.
20. I'm trying to do Geometry operations with symbols but they seem to be greyed out or unavailable. ---Repro steps--- 1) Create a shape using the rectangle tool (M) 2) Go to view/studio/symbols 3) Create a symbol from the rectangle tool 4) Drag this newly created symbol onto the canvas multiple times 5) Select several symbols and note that you are unable to add, subtract, intersect, divide, combine Is there a way to do these things with symbols?
21. With CTRL+left click on a layer icon it is possible to create a selection from the contents of this layer. In PS (I know, AP is not PS...) you can use SHIFT or ALT as modifiers for adding to, subtracting from or intersecting with an existing selection. I would like to see this in AP, too. For adding two or more layers to a single selection there is at least a workaround: make a group from the layers you want the selection from and CTRL+left click the group layer icon to get a selection made of the "summed up" content of each of the grouped layers. However I haven't either figured out a way to realize the other operations or how to modify an existing selection with "selection from layer".
22. I made a GROUP of these squares which I would like to subtract from the white square/background (to create a mask)... but I can't. It seems the only way is to subtract each separate square individually. Is subtracting a group something that isn't possible in AD? Here's a screenshot: It doesn't seem to matter if it's just a group or (like what I'm doing here) a group filled with other groups.
23. I am trying to subtract from an enclosed vector but I cannot find an option to do this in Affinity Photo. I can do this in PS CS5, I tried doing this in Affinity Photo but I do not see a subtract from mask option. The window on the house vector is an example of what I am trying to accomplish, I watched all the vector cropping Affinity videos but I couldn't find anything about subtracting from a vector mask. If you know how this can be done please let me know, thanks!
24. Hello! I'm quite new to Affinity Designer and when I was trying to create something, and stumbled across this which I didn't understand. I've recreated it simply to show you. When I tried to subtract two objects (1), by selecting them both (2) and clicking the subtract button, it ended up like (3). I now understand why it does this, but was wondering if there is a way to make it look more like (4). I made (4) badly to show you what it might look like, but don't know how I would do it properlly, I guess is what I mean. Any help would be appreciated! Thanks, Dan
25. Hi, Apologies if this is already explained somewhere but I have searched other posts and help to no avail. New to Affinity Designer and not that much experience with vectors in general so hope this isn't too dumb a question but I can't understand why the subtract function is cutting my two shapes in a particular way. I have attached a file showing the two shapes and what happens when I subtract the crescent shape from the half circle - why does the new shape still contain the small line at the end of the half crescent and half moon?! I was expecting it to negatively cut away all that space to effectively leave the shape like my example C (it took me forever to work out how to just cut away that small section as I couldn't get the break curves function to work either for a bit ... think I have a steep learning curve ahead :-)). Would be very grateful if anyone could take a moment out their day to explain the above to me. Many thanks, Ali x Subtract problem.afdesign
×
|
{
"url": "https://forum.affinity.serif.com/index.php?/tags/subtract/",
"source_domain": "forum.affinity.serif.com",
"snapshot_id": "crawl=CC-MAIN-2019-39",
"warc_metadata": {
"Content-Length": "198108",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SPSRWFFJ5OSLGLZT5FJLZJRYHIGK7QPW",
"WARC-Concurrent-To": "<urn:uuid:b123f91b-0455-46db-a0d3-a0b140750929>",
"WARC-Date": "2019-09-18T12:05:49Z",
"WARC-IP-Address": "34.249.213.105",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YHGTC64GJ4CMD4RLQKCU4GQS4BUVVS73",
"WARC-Record-ID": "<urn:uuid:a0a0e539-796f-451f-98be-cee073f98881>",
"WARC-Target-URI": "https://forum.affinity.serif.com/index.php?/tags/subtract/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:26dcfb30-ae9e-4ea2-a02a-e80d3ad9a3e9>"
},
"warc_info": "isPartOf: CC-MAIN-2019-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-102.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
16,
17,
38,
39,
76,
77,
78,
79,
99,
100,
119,
120,
155,
176,
177,
190,
191,
192,
199,
200,
221,
248,
283,
333,
353,
408,
430,
446,
464,
504,
541,
582,
625,
650,
686,
719,
756,
757,
776,
777,
806,
807,
808,
821,
822,
832,
833,
841,
842,
843,
856,
857,
867,
868,
876,
877,
878,
901,
902,
909,
910,
920,
921,
929,
930,
931,
937,
938,
939,
943,
944,
945,
949,
950,
951,
963,
964,
965,
969,
970,
971,
977,
978,
979,
986,
987,
988,
994,
995,
996,
1005,
1006,
1007,
1017,
1018,
1035,
1036,
1336,
2266,
2367,
2483,
2880,
3604,
3843,
4018,
4536,
4972,
5845,
5961,
6286,
7381,
7741,
8354,
8433,
8652,
9005,
9458,
10161,
10562,
11040,
11613,
12598
],
"line_end_idx": [
16,
17,
38,
39,
76,
77,
78,
79,
99,
100,
119,
120,
155,
176,
177,
190,
191,
192,
199,
200,
221,
248,
283,
333,
353,
408,
430,
446,
464,
504,
541,
582,
625,
650,
686,
719,
756,
757,
776,
777,
806,
807,
808,
821,
822,
832,
833,
841,
842,
843,
856,
857,
867,
868,
876,
877,
878,
901,
902,
909,
910,
920,
921,
929,
930,
931,
937,
938,
939,
943,
944,
945,
949,
950,
951,
963,
964,
965,
969,
970,
971,
977,
978,
979,
986,
987,
988,
994,
995,
996,
1005,
1006,
1007,
1017,
1018,
1035,
1036,
1336,
2266,
2367,
2483,
2880,
3604,
3843,
4018,
4536,
4972,
5845,
5961,
6286,
7381,
7741,
8354,
8433,
8652,
9005,
9458,
10161,
10562,
11040,
11613,
12598,
12599
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12599,
"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.43103447556495667,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0498899482190609,
"rps_doc_frac_lines_end_with_ellipsis": 0.024390239268541336,
"rps_doc_frac_no_alph_words": 0.17498165369033813,
"rps_doc_frac_unique_words": 0.29964539408683777,
"rps_doc_mean_word_length": 4.304078102111816,
"rps_doc_num_sentences": 157,
"rps_doc_symbol_to_word_ratio": 0.002934700110927224,
"rps_doc_unigram_entropy": 5.632684230804443,
"rps_doc_word_count": 2256,
"rps_doc_frac_chars_dupe_10grams": 0.009268799796700478,
"rps_doc_frac_chars_dupe_5grams": 0.03553038090467453,
"rps_doc_frac_chars_dupe_6grams": 0.020082389935851097,
"rps_doc_frac_chars_dupe_7grams": 0.009268799796700478,
"rps_doc_frac_chars_dupe_8grams": 0.009268799796700478,
"rps_doc_frac_chars_dupe_9grams": 0.009268799796700478,
"rps_doc_frac_chars_top_2gram": 0.008650880306959152,
"rps_doc_frac_chars_top_3gram": 0.006179200019687414,
"rps_doc_frac_chars_top_4gram": 0.0033985599875450134,
"rps_doc_books_importance": -1070.0469970703125,
"rps_doc_books_importance_length_correction": -1070.0469970703125,
"rps_doc_openwebtext_importance": -597.8721313476562,
"rps_doc_openwebtext_importance_length_correction": -597.8721313476562,
"rps_doc_wikipedia_importance": -477.5172424316406,
"rps_doc_wikipedia_importance_length_correction": -477.5172424316406
},
"fasttext": {
"dclm": 0.10210741311311722,
"english": 0.9508627653121948,
"fineweb_edu_approx": 1.3549413681030273,
"eai_general_math": 0.8883971571922302,
"eai_open_web_math": 0.37388700246810913,
"eai_web_code": 0.7267181277275085
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,587,925,155,798,909,000
|
Q
Problem solve Get help with specific problems with your technologies, process and projects.
Using subinterfaces on a Cisco router
When configuring a router for Frame Relay, do you need a serial sub-interface couple to the primary interface?
No. You can use the primary interface if you want to. It's just not a very good idea. There are a lot of reasons; let's cover a few of them:
Reason - Inverse ARP
It is well known that on Ethernet, you use ARP to determine the IP to MAC address mapping, i.e. you have the destination IP address and you want to send the packet to a PC on Ethernet, so you send an ARP request to find out who has the destination and would they please send you their MAC address. Now you have the MAC address, you can send the Ethernet packet.
Now, the PC that receives the packet knows the sender's MAC address, but not necessarily the sender's IP address. The receiver will have to reply to the packet that came in, to confirm it got the packet OK. The receiver will perform the opposite, known generally as Inverse ARP. The receiver sends the Inverse ARP request and maps the MAC address to an IP address. The receiver can dispatch the confirmation packet.
But for Frame Relay, there is no ARP on physical interfaces. There are quite a few reasons for this, which I won't cover here. Thus the router would not know which PVC to send the packet to. So on a physical interface for Frame Relay you manually configure static maps that map the remote IP address to a PVC. Creating static maps is prone to error, hard to read, and hard to administer.
On a sub-interface, however, you can send ARP and inverse ARP, that is, I have the DLCI, what is your IP address, to determine what the remote IP address is.
Reason - Interface Administration
Consider the following scenario, you have a major Frame Relay hub, with 10 PVCs to the spoke sites. If you use the primary interface only, you will have 10 PVCs attached to the one interface. You then need to create mapping statements for each PVC. This is hard to maintain as time goes by. If a single PVC goes down, it is very hard to detect when using physical interfaces.
It is much better to have a different interface for each PVC, and we use sub-interfaces to do this. It makes sense to most people. You can see quickly if a PVC is down because the interface is down. Once the interface is down, OSPF, EIGRP and ISIS routing protocols can converge on a backup path much quicker, if there is one.
Reason - Performance Management
Many performance management tools, like MRTG ( www.mrtg.org), work best when each PVC has an interface and an IP address. Remember that a physical interface can't have a separate IP address for each PVC. Only one IP per interface is allowed.
Reason - Broadcast Control
Keep in mind that the physical interface can have only a single address, so your static map statements have to be in the same network. When you need to broadcast the broadcast goes across every PVC !! This is usually very bad.
Reason - Routing Protocols - Split Horizon and Neighbor Discovery
This is the biggie. If you have use the physical interface, distance vector routing protocols like RIP have split horizon problems. The Link State routing protocols like OSPF have to use special mechanisms to discover their neighbors, and need special configuration.
Conclusion
You might see physical interfaces used in very specialized situation. If you do, you generally know why they are there. Using physical interfaces was the only way to configure Frame Relay for a long time and can be seen in older networks. Sometimes people just don't know about sub-interfaces. Frame Relay took a long time to catch on in the United States compared to Australia and Europe.
As a rule, always use sub-interfaces.
Dig Deeper on Network Infrastructure
Have a question for an expert?
Please add a title for your question
Get answers from a TechTarget expert on whatever's puzzling you.
You will be able to add details on the next page.
Start the conversation
Send me notifications when other members comment.
Please create a username to comment.
-ADS BY GOOGLE
SearchUnifiedCommunications
SearchMobileComputing
SearchDataCenter
SearchITChannel
Close
|
{
"url": "https://searchnetworking.techtarget.com/answer/Using-subinterfaces-on-a-Cisco-router",
"source_domain": "searchnetworking.techtarget.com",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "63254",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TFXN4ADUZ2PRMTWVZTMG7VDMZPP73KNP",
"WARC-Concurrent-To": "<urn:uuid:73501731-f3e9-4bf0-a060-49cf0fbcccbb>",
"WARC-Date": "2019-08-23T17:59:52Z",
"WARC-IP-Address": "206.19.49.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:F6RXECNSLYYWJVTF5SQQD4TMPSX5EEYV",
"WARC-Record-ID": "<urn:uuid:e2e44722-2fcd-4aad-ab1e-a8d3ee1fb915>",
"WARC-Target-URI": "https://searchnetworking.techtarget.com/answer/Using-subinterfaces-on-a-Cisco-router",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a455ad6a-8fbe-4b12-b934-0a737b4ddfb6>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-85.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
94,
95,
133,
134,
245,
386,
387,
408,
770,
771,
1187,
1188,
1576,
1577,
1735,
1736,
1770,
2146,
2147,
2474,
2475,
2507,
2749,
2750,
2777,
3004,
3005,
3071,
3338,
3339,
3350,
3740,
3741,
3779,
3780,
3817,
3818,
3849,
3850,
3887,
3888,
3953,
3954,
4004,
4005,
4028,
4029,
4079,
4080,
4117,
4118,
4133,
4134,
4162,
4163,
4185,
4186,
4203,
4204,
4220,
4221
],
"line_end_idx": [
2,
94,
95,
133,
134,
245,
386,
387,
408,
770,
771,
1187,
1188,
1576,
1577,
1735,
1736,
1770,
2146,
2147,
2474,
2475,
2507,
2749,
2750,
2777,
3004,
3005,
3071,
3338,
3339,
3350,
3740,
3741,
3779,
3780,
3817,
3818,
3849,
3850,
3887,
3888,
3953,
3954,
4004,
4005,
4028,
4029,
4079,
4080,
4117,
4118,
4133,
4134,
4162,
4163,
4185,
4186,
4203,
4204,
4220,
4221,
4226
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4226,
"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.4364705979824066,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0564705915749073,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13058823347091675,
"rps_doc_frac_unique_words": 0.3751724064350128,
"rps_doc_mean_word_length": 4.628965377807617,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.001691818237305,
"rps_doc_word_count": 725,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.010131110437214375,
"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.021454110741615295,
"rps_doc_frac_chars_top_3gram": 0.011620979756116867,
"rps_doc_frac_chars_top_4gram": 0.013110850006341934,
"rps_doc_books_importance": -446.9222717285156,
"rps_doc_books_importance_length_correction": -446.9222717285156,
"rps_doc_openwebtext_importance": -259.29205322265625,
"rps_doc_openwebtext_importance_length_correction": -259.29205322265625,
"rps_doc_wikipedia_importance": -181.3302001953125,
"rps_doc_wikipedia_importance_length_correction": -181.3302001953125
},
"fasttext": {
"dclm": 0.5897704362869263,
"english": 0.9380766153335571,
"fineweb_edu_approx": 2.3942017555236816,
"eai_general_math": 0.5184277296066284,
"eai_open_web_math": 0.16037225723266602,
"eai_web_code": 0.2562883496284485
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,057,663,779,095,850,800
|
blob: c53153cca5245aa9ad8b857edd7f5a5f2f662d68 [file] [log] [blame]
/*
*
* (C) Copyright IBM Corp. and others 1998-2013 - All Rights Reserved
*
*/
#include "LETypes.h"
#include "MorphTables.h"
#include "SubtableProcessor2.h"
#include "NonContextualGlyphSubst.h"
#include "NonContextualGlyphSubstProc2.h"
#include "SegmentSingleProcessor2.h"
#include "LEGlyphStorage.h"
#include "LESwaps.h"
U_NAMESPACE_BEGIN
UOBJECT_DEFINE_RTTI_IMPLEMENTATION(SegmentSingleProcessor2)
SegmentSingleProcessor2::SegmentSingleProcessor2()
{
}
SegmentSingleProcessor2::SegmentSingleProcessor2(const LEReferenceTo<MorphSubtableHeader2> &morphSubtableHeader, LEErrorCode &success)
: NonContextualGlyphSubstitutionProcessor2(morphSubtableHeader, success)
{
const LEReferenceTo<NonContextualGlyphSubstitutionHeader2> header(morphSubtableHeader, success);
segmentSingleLookupTable = LEReferenceTo<SegmentSingleLookupTable>(morphSubtableHeader, success, &header->table);
}
SegmentSingleProcessor2::~SegmentSingleProcessor2()
{
}
void SegmentSingleProcessor2::process(LEGlyphStorage &glyphStorage, LEErrorCode &success)
{
const LookupSegment *segments = segmentSingleLookupTable->segments;
le_int32 glyphCount = glyphStorage.getGlyphCount();
le_int32 glyph;
for (glyph = 0; glyph < glyphCount; glyph += 1) {
LEGlyphID thisGlyph = glyphStorage[glyph];
const LookupSegment *lookupSegment = segmentSingleLookupTable->lookupSegment(segmentSingleLookupTable, segments, thisGlyph, success);
if (lookupSegment != NULL && LE_SUCCESS(success)) {
TTGlyphID newGlyph = (TTGlyphID) LE_GET_GLYPH(thisGlyph) + SWAPW(lookupSegment->value);
glyphStorage[glyph] = LE_SET_GLYPH(thisGlyph, newGlyph);
}
}
}
U_NAMESPACE_END
|
{
"url": "https://android.googlesource.com/platform/external/icu4c/+/e04e5980f1a4ae5efec53fd9e2e3ba1c15ea0aee/layout/SegmentSingleProcessor2.cpp",
"source_domain": "android.googlesource.com",
"snapshot_id": "crawl=CC-MAIN-2019-22",
"warc_metadata": {
"Content-Length": "23326",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PYGBCYM7P2ERGJDBJLEYVG6HDCBJQ47M",
"WARC-Concurrent-To": "<urn:uuid:d940d258-b9d9-4e64-b270-168bfaf4adbd>",
"WARC-Date": "2019-05-19T09:10:37Z",
"WARC-IP-Address": "209.85.201.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Q74TH5GZCHYHWITEY7BT7BPRWG2QLHXU",
"WARC-Record-ID": "<urn:uuid:a03521bd-5db3-41fa-8630-e2a8fa330188>",
"WARC-Target-URI": "https://android.googlesource.com/platform/external/icu4c/+/e04e5980f1a4ae5efec53fd9e2e3ba1c15ea0aee/layout/SegmentSingleProcessor2.cpp",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:93159c82-cc3f-48e3-a48c-b5288263ad40>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-138-146-130.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,
71,
73,
142,
144,
147,
168,
193,
225,
262,
304,
341,
369,
390,
408,
468,
519,
521,
523,
658,
731,
733,
830,
944,
946,
998,
1000,
1002,
1092,
1094,
1162,
1214,
1230,
1280,
1323,
1457,
1509,
1597,
1654,
1656,
1658,
1660
],
"line_end_idx": [
68,
71,
73,
142,
144,
147,
168,
193,
225,
262,
304,
341,
369,
390,
408,
468,
519,
521,
523,
658,
731,
733,
830,
944,
946,
998,
1000,
1002,
1092,
1094,
1162,
1214,
1230,
1280,
1323,
1457,
1509,
1597,
1654,
1656,
1658,
1660,
1675
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1675,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0.007164179813116789,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04779411852359772,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.036764711141586304,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5441176295280457,
"rps_doc_frac_unique_words": 0.6914893388748169,
"rps_doc_mean_word_length": 14.531914710998535,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0.029411759227514267,
"rps_doc_unigram_entropy": 3.9661784172058105,
"rps_doc_word_count": 94,
"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.026354320347309113,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -99.27608489990234,
"rps_doc_books_importance_length_correction": -86.25994873046875,
"rps_doc_openwebtext_importance": -73.78842163085938,
"rps_doc_openwebtext_importance_length_correction": -73.78842163085938,
"rps_doc_wikipedia_importance": -90.81771850585938,
"rps_doc_wikipedia_importance_length_correction": -79.9215316772461
},
"fasttext": {
"dclm": 0.9993056058883667,
"english": 0.34002968668937683,
"fineweb_edu_approx": 3.255622148513794,
"eai_general_math": 0.9811117053031921,
"eai_open_web_math": 0.8216044902801514,
"eai_web_code": 0.0027944999746978283
}
}
|
{
"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": "686.228",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Handicraft and Occupations",
"level_3": "Bookbinding and Printing"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,281,093,725,682,967,600
|
Author: Grimes [3rd ID]
Author Website: https://github.com/kcgrimes/grimes-building-occupation-script
Requirements: No addons required
Version: 1.21
Short description: This script provides the mission maker an extremely simple way to occupy a set of buildings within a radius with a random or fixed amount of AI.
Date: 2018-02-26 10:53
Comments: (0)
Rating:
Grimes' Building Occupation Script
by
KC Grimes
Description:
The Grimes Building Occupation Script provides the ArmA 3 mission maker an extremely simple way to occupy a set of buildings within a radius with a random or fixed amount of AI (of any faction, including civilian), both chosen by the maker and limited by the number of official position inside the building. The spawned AI will fight back as a group, and can be easily manipulated further by adding lines in the right spot in this script. This script can be utilized in many ways, examples including but not limited to:
* Filler - Have a mission where a squad goes from A to C and you want non-mission critical AI at B? Use this script!
* Random Objective - Want to have 3 AI at C that could be ANYWHERE between dozens, hundreds of buildings? Use this script!
* Boredom Fixer - Want a quick CQB practice? Use this script!
This package includes an application of the script, in debug mode, as part of an example mission.
This README is intended to provide detailed information as to the purpose, function, FAQs, and minor troubleshooting for this script in addition to installation, uninstallation, and maintenance tips. For further information or specifics in the code, the user should read the comments to the code within the script files.
Installation / Usage:
For usage instructions and information of how to use the Grimes' Building Occupation Script please refer to the included documentation and/or example mission.
Changelog:
v1.21
This update contains significant bug fixes, optimizations, and otherwise improves performance or makes change that provide for intended performance. Building randomization is working again, invalid spawns are no longer an issue, random numbers are calculated correctly, group limit increased to 288 per side, resistance and civilians spawn correctly, and the documentation is greatly improved.
v1.2
v1.1
- Major changes that require the attention of mission makers! You MUST re-read the param info, as the values have changed slightly (functionality added, nothing removed).
- Added: Param to limit the number of groups. (thanks Katipo66)
- Added: Now supports Civilians. Reminder: This script isn't necessarily for enemies only!
- Added: Param providing the option for the script to run through buildings in order of distance or at random (originally was only by order of distance).
- Fixed: Possible non-critical errors when not in debug mode.
- Changed: Changed markers for spawned units from Objective to Dot for sake of space (thanks Günter Severloh)
v1.0
- first release
Forum topic:
- BI forums
Steam Workshop:
- Subscribe
Enable javascript to be able to download from Armaholic please!
Tags: Automatic, Building, Occupy, Random
|
{
"url": "http://www.armaholic.com/page.php?id=25268",
"source_domain": "www.armaholic.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "20166",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D6TFMKDBFKQRQ7KD4JW6JCL4ZDFOPUNH",
"WARC-Concurrent-To": "<urn:uuid:b20e6cd9-725f-44c9-9ffd-87f994e75840>",
"WARC-Date": "2018-06-25T13:47:47Z",
"WARC-IP-Address": "5.133.183.13",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:FMTMGZYTSEFFVWP5VK6IPEWBTA5HO2QO",
"WARC-Record-ID": "<urn:uuid:0af3ba85-403a-4cd9-951c-ed2c2ef9c49f>",
"WARC-Target-URI": "http://www.armaholic.com/page.php?id=25268",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:95f03dba-11a2-426c-95d5-0c503ce067d7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-158-201-18.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
2,
3,
4,
28,
106,
107,
140,
141,
155,
156,
320,
321,
344,
345,
346,
360,
368,
369,
370,
371,
373,
374,
409,
410,
413,
423,
424,
425,
438,
958,
1075,
1198,
1260,
1261,
1359,
1360,
1681,
1682,
1683,
1705,
1864,
1865,
1866,
1877,
1883,
2277,
2278,
2283,
2288,
2459,
2523,
2614,
2768,
2830,
2940,
2941,
2946,
2962,
2963,
2964,
2977,
2989,
2990,
2991,
3007,
3019,
3020,
3021,
3022,
3023,
3087,
3088,
3089,
3090
],
"line_end_idx": [
2,
3,
4,
28,
106,
107,
140,
141,
155,
156,
320,
321,
344,
345,
346,
360,
368,
369,
370,
371,
373,
374,
409,
410,
413,
423,
424,
425,
438,
958,
1075,
1198,
1260,
1261,
1359,
1360,
1681,
1682,
1683,
1705,
1864,
1865,
1866,
1877,
1883,
2277,
2278,
2283,
2288,
2459,
2523,
2614,
2768,
2830,
2940,
2941,
2946,
2962,
2963,
2964,
2977,
2989,
2990,
2991,
3007,
3019,
3020,
3021,
3022,
3023,
3087,
3088,
3089,
3090,
3137
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3137,
"ccnet_original_nlines": 74,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30668842792510986,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026101140305399895,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21696573495864868,
"rps_doc_frac_unique_words": 0.5178947448730469,
"rps_doc_mean_word_length": 5.22315788269043,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.081691265106201,
"rps_doc_word_count": 475,
"rps_doc_frac_chars_dupe_10grams": 0.07738815248012543,
"rps_doc_frac_chars_dupe_5grams": 0.1039903312921524,
"rps_doc_frac_chars_dupe_6grams": 0.07738815248012543,
"rps_doc_frac_chars_dupe_7grams": 0.07738815248012543,
"rps_doc_frac_chars_dupe_8grams": 0.07738815248012543,
"rps_doc_frac_chars_dupe_9grams": 0.07738815248012543,
"rps_doc_frac_chars_top_2gram": 0.03224505856633186,
"rps_doc_frac_chars_top_3gram": 0.029020560905337334,
"rps_doc_frac_chars_top_4gram": 0.036275699734687805,
"rps_doc_books_importance": -299.54559326171875,
"rps_doc_books_importance_length_correction": -299.54559326171875,
"rps_doc_openwebtext_importance": -156.82032775878906,
"rps_doc_openwebtext_importance_length_correction": -156.82032775878906,
"rps_doc_wikipedia_importance": -130.64013671875,
"rps_doc_wikipedia_importance_length_correction": -130.64013671875
},
"fasttext": {
"dclm": 0.14471542835235596,
"english": 0.8974776864051819,
"fineweb_edu_approx": 1.9170743227005005,
"eai_general_math": 0.36574453115463257,
"eai_open_web_math": 0.312546968460083,
"eai_web_code": 0.06849175691604614
}
}
|
{
"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": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,366,976,989,359,146,000
|
Recover lost video files from DSLR memory card
Select Languages
Recent Posts
Categories
Videography or it may be Photography these things are becoming a part of people routine in their daily life because it’s the only way to capture all our memories.Have you ever knowingly or accidentally formatted DSLR memory card?
Have you ever knowingly or accidentally formatted DSLR memory card? Which results in loss of all the crucial video files. Are there any chances of recovering lost video files from DSLR memory card Of course, Yes! With the usage of third party software, one can easily recover lost video files from DSLR memory card.
With the usage of Video Recovery software, all the lost or damaged video files can be reliably recoverable.
Usually, the user thinks once if they lost video files from DSLR memory card, then it will be impossible to restore back. But it’s not believable.
When you are capturing videos or any pictures with DSLR camera the videos or pictures will be saved on a memory card in DSLR camera.If in case those videos files
If in case those videos files get damaged or lost due to any reason, actually the videos or images are not permanently lost. Once it is deleted memory card marks it as available space or free space.
If the user further continues clicking pictures or recording new videos than all those lost videos will be overwritten with the new one. Unknowingly if the user clicks format button on DSLR camera all the stored data will be lost at that particular time. DSLR memory card gets damaged due to the improper or inappropriate usage of memory card like disconnecting DSLR memory card during processing, even in data transfer etc.
To overcome from loss of data or the files which are already deleted just opt for videos recovery software.Recovery tool helps to restore all the lost video files from DSLR memory card.
This software consists of an advanced scanning process which scans the complete entire DSLR memory card. One can also recover a wide variety of photo and video files. Apart from retrieving all the lost video files from DSLR memory card, it can even work to restore all media files like photos, music files, etc.
Characteristics of Video Recovery tool:-
This recovery tool can perform video recovery from DSLR memory card and works on all the major versions of Windows and Mac OS.
It has designed in such a way that it is consist of strongly working algorithms and programs which work internally to retrieve all the lost videos from entire DSLR memory card.
It is user-friendly interface tool so that works accurately in fetching lost data, it is secured platform for recovery of lost video files.
Few simple steps in recovering video files from DSLR Memory card:
Step 1:
Firstly download Video Recovery software. A welcome screen will be displayed with multiple recovery options. Just need to select “Recover Photos to process further welcome screen displays.
Step 2: This tool automatically starts detecting all the lost DSLR video files though scanning process it can able to access all the lost files from the device.
Henceforth detects and displays all the recovered video files.
Step 3: Finally once the scanning process terminates the end user will get the complete list of all the recovered video files. So that user can store it for further usage.
|
{
"url": "http://cabagroup.com/recover-lost-video-files-from-dslr-memory-card",
"source_domain": "cabagroup.com",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "32543",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NGUA7DODR3LFIY2XMHAM47EPFDIPSI4H",
"WARC-Concurrent-To": "<urn:uuid:8a7340ee-2c5c-4108-8c72-30d69f6a1908>",
"WARC-Date": "2018-11-14T07:50:17Z",
"WARC-IP-Address": "77.246.168.162",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:R27VWOQSYT7VWNKME326D4O4JJS72ESM",
"WARC-Record-ID": "<urn:uuid:24f45ae2-cda3-420d-b30c-7f68d7e1aa6c>",
"WARC-Target-URI": "http://cabagroup.com/recover-lost-video-files-from-dslr-memory-card",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:217c4115-0296-4beb-8a09-f86a8533f375>"
},
"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 (info@commoncrawl.org)\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,
47,
48,
65,
66,
79,
80,
91,
92,
322,
323,
639,
640,
748,
749,
896,
897,
1059,
1060,
1259,
1260,
1685,
1686,
1872,
1873,
2185,
2186,
2227,
2228,
2355,
2356,
2533,
2534,
2674,
2675,
2741,
2742,
2743,
2751,
2940,
2941,
3102,
3103,
3166,
3167
],
"line_end_idx": [
47,
48,
65,
66,
79,
80,
91,
92,
322,
323,
639,
640,
748,
749,
896,
897,
1059,
1060,
1259,
1260,
1685,
1686,
1872,
1873,
2185,
2186,
2227,
2228,
2355,
2356,
2533,
2534,
2674,
2675,
2741,
2742,
2743,
2751,
2940,
2941,
3102,
3103,
3166,
3167,
3338
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3338,
"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.371567040681839,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.032310180366039276,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.08562196791172028,
"rps_doc_frac_unique_words": 0.38898757100105286,
"rps_doc_mean_word_length": 4.806394100189209,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.80070161819458,
"rps_doc_word_count": 563,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1648189127445221,
"rps_doc_frac_chars_dupe_6grams": 0.13008129596710205,
"rps_doc_frac_chars_dupe_7grams": 0.11973392218351364,
"rps_doc_frac_chars_dupe_8grams": 0.09608277678489685,
"rps_doc_frac_chars_dupe_9grams": 0.06725794821977615,
"rps_doc_frac_chars_top_2gram": 0.06282336264848709,
"rps_doc_frac_chars_top_3gram": 0.07243163138628006,
"rps_doc_frac_chars_top_4gram": 0.05321507900953293,
"rps_doc_books_importance": -280.32171630859375,
"rps_doc_books_importance_length_correction": -280.32171630859375,
"rps_doc_openwebtext_importance": -187.66000366210938,
"rps_doc_openwebtext_importance_length_correction": -187.66000366210938,
"rps_doc_wikipedia_importance": -177.94744873046875,
"rps_doc_wikipedia_importance_length_correction": -177.94744873046875
},
"fasttext": {
"dclm": 0.052917420864105225,
"english": 0.8981680274009705,
"fineweb_edu_approx": 1.6561710834503174,
"eai_general_math": 0.014816110022366047,
"eai_open_web_math": 0.03627955913543701,
"eai_web_code": 0.03790723904967308
}
}
|
{
"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": "691.4",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Building",
"level_3": "Building materials"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
783,090,691,374,816,900
|
message.h 27.5 KB
Newer Older
1
/*
Bob Halley's avatar
Bob Halley committed
2
* Copyright (C) 1999, 2000 Internet Software Consortium.
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
* SOFTWARE.
*/
18 19
#ifndef DNS_MESSAGE_H
#define DNS_MESSAGE_H 1
20 21 22 23 24
/***
*** Imports
***/
25 26
#include <isc/lang.h>
#include <isc/magic.h>
27
Michael Graff's avatar
Michael Graff committed
28
#include <dns/compress.h>
29 30
#include <dns/rdatastruct.h>
#include <dns/types.h>
31
32 33
#include <dst/dst.h>
34 35 36
/*
* How this beast works:
*
37
* When a dns message is received in a buffer, dns_message_fromwire() is called
38 39 40 41 42 43 44 45
* on the memory region. Various items are checked including the format
* of the message (if counts are right, if counts consume the entire sections,
* and if sections consume the entire message) and known pseudo-RRs in the
* additional data section are analyzed and removed.
*
* TSIG checking is also done at this layer, and any DNSSEC information should
* also be performed at this time.
*
46
* If dns_message_fromwire() returns DNS_R_MOREDATA additional
47 48
* message packets are required. This implies an EDNS message.
*
49
* When going from structure to wire, dns_message_towire() will return
Michael Graff's avatar
typo
Michael Graff committed
50
* DNS_R_MOREDATA if there is more data left in the output buffer that
51 52
* could not be rendered into the exisiting buffer.
*
53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74
*
* Notes on using the gettemp*() and puttemp*() functions:
*
* These functions return items (names, rdatasets, etc) allocated from some
* internal state of the dns_message_t. These items must be put back into
* the dns_message_t in one of two ways. Assume a name was allocated via
* dns_message_gettempname():
*
* (1) insert it into a section, using dns_message_addname().
*
* (2) return it to the message using dns_message_puttempname().
*
* The same applies to rdata, rdatasets, and rdatalists which were
* allocated using this group of functions.
*
* Buffers allocated using isc_buffer_allocate() can be automatically freed
* as well by giving the buffer to the message using dns_message_takebuffer().
* Doing this will cause the buffer to be freed using isc_buffer_free()
* when the section lists are cleared, such as in a reset or in a destroy.
* Since the buffer itself exists until the message is destroyed, this sort
* of code can be written:
*
75
* buffer = isc_buffer_allocate(mctx, 512);
76 77 78 79 80 81 82 83 84 85
* name = NULL;
* name = dns_message_gettempname(message, &name);
* dns_name_init(name, NULL);
* result = dns_name_fromtext(name, &source, dns_rootname, ISC_FALSE,
* buffer);
* dns_message_takebuffer(message, &buffer);
*
*
* TODO:
*
86 87 88 89 90
* XXX Needed: ways to handle TSIG and DNSSEC, supply TSIG and DNSSEC
* keys, set and retrieve EDNS information, add rdata to a section,
* move rdata from one section to another, remove rdata, etc.
*/
91 92 93 94 95
#define DNS_MESSAGEFLAG_QR 0x8000U
#define DNS_MESSAGEFLAG_AA 0x0400U
#define DNS_MESSAGEFLAG_TC 0x0200U
#define DNS_MESSAGEFLAG_RD 0x0100U
#define DNS_MESSAGEFLAG_RA 0x0080U
Bob Halley's avatar
Bob Halley committed
96 97
#define DNS_MESSAGEFLAG_AD 0x0020U
#define DNS_MESSAGEFLAG_CD 0x0010U
98
Bob Halley's avatar
Bob Halley committed
99
#define DNS_MESSAGE_REPLYPRESERVE (DNS_MESSAGEFLAG_RD)
100
Bob Halley's avatar
Bob Halley committed
101 102 103
#define DNS_MESSAGE_HEADERLEN 12 /* 6 isc_uint16_t's */
#define DNS_MESSAGE_MAGIC 0x4d534740U /* MSG@ */
Michael Graff's avatar
Michael Graff committed
104
#define DNS_MESSAGE_VALID(msg) ISC_MAGIC_VALID(msg, DNS_MESSAGE_MAGIC)
Michael Graff's avatar
Michael Graff committed
105
Michael Graff's avatar
Michael Graff committed
106 107 108 109
/*
* Ordering here matters. DNS_SECTION_ANY must be the lowest and negative,
* and DNS_SECTION_MAX must be one greater than the last used section.
*/
Michael Graff's avatar
Michael Graff committed
110
typedef int dns_section_t;
Michael Graff's avatar
Michael Graff committed
111
#define DNS_SECTION_ANY (-1)
Michael Graff's avatar
Michael Graff committed
112 113 114 115
#define DNS_SECTION_QUESTION 0
#define DNS_SECTION_ANSWER 1
#define DNS_SECTION_AUTHORITY 2
#define DNS_SECTION_ADDITIONAL 3
116
#define DNS_SECTION_MAX 4
117
118 119 120 121 122 123 124 125
typedef int dns_pseudosection_t;
#define DNS_PSEUDOSECTION_ANY (-1)
#define DNS_PSEUDOSECTION_OPT 0
#define DNS_PSEUDOSECTION_TSIG 1
#define DNS_PSEUDOSECTION_SIG0 2
#define DNS_PSEUDOSECTION_MAX 3
126
/*
Andreas Gustafsson's avatar
Andreas Gustafsson committed
127
* Dynamic update names for these sections.
128 129 130 131
*/
#define DNS_SECTION_ZONE DNS_SECTION_QUESTION
#define DNS_SECTION_PREREQUISITE DNS_SECTION_ANSWER
#define DNS_SECTION_UPDATE DNS_SECTION_AUTHORITY
Michael Graff's avatar
Michael Graff committed
132 133
/*
Michael Graff's avatar
Michael Graff committed
134
* These tell the message library how the created dns_message_t will be used.
Michael Graff's avatar
Michael Graff committed
135
*/
Michael Graff's avatar
Michael Graff committed
136 137 138
#define DNS_MESSAGE_INTENTUNKNOWN 0 /* internal use only */
#define DNS_MESSAGE_INTENTPARSE 1 /* parsing messages */
#define DNS_MESSAGE_INTENTRENDER 2 /* rendering */
Michael Graff's avatar
Michael Graff committed
139
Michael Graff's avatar
Michael Graff committed
140 141 142 143 144
/*
* Control behavior of rendering
*/
#define DNS_MESSAGERENDER_ORDERED 0x0001 /* don't change order */
Michael Graff's avatar
Michael Graff committed
145 146
typedef struct dns_msgblock dns_msgblock_t;
Bob Halley's avatar
Bob Halley committed
147
struct dns_message {
Michael Graff's avatar
Michael Graff committed
148
/* public from here down */
Michael Graff's avatar
Michael Graff committed
149
unsigned int magic;
150
151
dns_messageid_t id;
Michael Graff's avatar
Michael Graff committed
152 153 154
unsigned int flags;
unsigned int rcode;
unsigned int opcode;
Michael Graff's avatar
Michael Graff committed
155
dns_rdataclass_t rdclass;
Michael Graff's avatar
Michael Graff committed
156
157
/* 4 real, 1 pseudo */
Michael Graff's avatar
Michael Graff committed
158
unsigned int counts[DNS_SECTION_MAX];
Michael Graff's avatar
Michael Graff committed
159 160
/* private from here down */
Michael Graff's avatar
Michael Graff committed
161 162
dns_namelist_t sections[DNS_SECTION_MAX];
dns_name_t *cursors[DNS_SECTION_MAX];
Bob Halley's avatar
Bob Halley committed
163
dns_rdataset_t *opt;
164 165
dns_rdataset_t *sig0;
dns_rdataset_t *tsigset;
166
Michael Graff's avatar
Michael Graff committed
167
int state;
Michael Graff's avatar
Michael Graff committed
168
unsigned int from_to_wire : 2;
169
unsigned int need_cctx_cleanup : 1;
Bob Halley's avatar
Bob Halley committed
170 171
unsigned int header_ok : 1;
unsigned int question_ok : 1;
172
unsigned int tcp_continuation : 1;
173 174
unsigned int verified_sig : 1;
unsigned int verify_attempted : 1;
175
176
unsigned int opt_reserved;
177
unsigned int reserved; /* reserved space (render) */
178
179
isc_buffer_t *buffer;
Michael Graff's avatar
Michael Graff committed
180
dns_compress_t cctx;
181
Michael Graff's avatar
Michael Graff committed
182
isc_mem_t *mctx;
183 184 185
isc_mempool_t *namepool;
isc_mempool_t *rdspool;
186
isc_bufferlist_t scratchpad;
187 188
isc_bufferlist_t cleanup;
Michael Graff's avatar
Michael Graff committed
189 190
ISC_LIST(dns_msgblock_t) rdatas;
ISC_LIST(dns_msgblock_t) rdatalists;
191 192 193
ISC_LIST(dns_rdata_t) freerdata;
ISC_LIST(dns_rdatalist_t) freerdatalist;
194 195 196
dns_rcode_t tsigstatus;
dns_rcode_t querytsigstatus;
197
dns_name_t *tsigname;
198 199
dns_rdata_any_tsig_t *tsig;
dns_rdata_any_tsig_t *querytsig;
200
dns_tsigkey_t *tsigkey;
201
void *tsigctx;
202 203
int sigstart;
204
dns_name_t *sig0name;
205 206 207
dst_key_t *sig0key;
dns_rcode_t sig0status;
isc_region_t *query;
Brian Wellington's avatar
Brian Wellington committed
208
isc_region_t *saved;
Bob Halley's avatar
Bob Halley committed
209
};
210
211 212 213 214 215 216
/***
*** Functions
***/
ISC_LANG_BEGINDECLS
217
isc_result_t
218
dns_message_create(isc_mem_t *mctx, unsigned int intent, dns_message_t **msgp);
Bob Halley's avatar
Bob Halley committed
219
220
/*
Michael Graff's avatar
Michael Graff committed
221
* Create msg structure.
222
*
Michael Graff's avatar
Michael Graff committed
223
* This function will allocate some internal blocks of memory that are
Michael Graff's avatar
Michael Graff committed
224
* expected to be needed for parsing or rendering nearly any type of message.
Michael Graff's avatar
Michael Graff committed
225 226 227
*
* Requires:
* 'mctx' be a valid memory context.
228
*
Michael Graff's avatar
Michael Graff committed
229
* 'msgp' be non-null and '*msg' be NULL.
Michael Graff's avatar
Michael Graff committed
230
*
Andreas Gustafsson's avatar
typo
Andreas Gustafsson committed
231 232
* 'intent' must be one of DNS_MESSAGE_INTENTPARSE or
* DNS_MESSAGE_INTENTRENDER.
Michael Graff's avatar
Michael Graff committed
233 234
*
* Ensures:
Michael Graff's avatar
Michael Graff committed
235
* The data in "*msg" is set to indicate an unused and empty msg
Michael Graff's avatar
Michael Graff committed
236 237 238
* structure.
*
* Returns:
239 240
* ISC_R_NOMEMORY -- out of memory
* ISC_R_SUCCESS -- success
241 242
*/
Michael Graff's avatar
Michael Graff committed
243
void
Bob Halley's avatar
Bob Halley committed
244
dns_message_reset(dns_message_t *msg, unsigned int intent);
Michael Graff's avatar
Michael Graff committed
245 246 247 248 249 250
/*
* Reset a message structure to default state. All internal lists are freed
* or reset to a default state as well. This is simply a more efficient
* way to call dns_message_destroy() followed by dns_message_allocate(),
* since it avoid many memory allocations.
*
Michael Graff's avatar
Michael Graff committed
251 252 253
* If any data loanouts (buffers, names, rdatas, etc) were requested,
* the caller must no longer use them after this call.
*
Bob Halley's avatar
Bob Halley committed
254 255
* The intended next use of the message will be 'intent'.
*
Michael Graff's avatar
Michael Graff committed
256 257 258
* Requires:
*
* 'msg' be valid.
Bob Halley's avatar
Bob Halley committed
259 260
*
* 'intent' is DNS_MESSAGE_INTENTPARSE or DNS_MESSAGE_INTENTRENDER
Michael Graff's avatar
Michael Graff committed
261
*/
Michael Graff's avatar
Michael Graff committed
262
Michael Graff's avatar
Michael Graff committed
263
void
Michael Graff's avatar
Michael Graff committed
264
dns_message_destroy(dns_message_t **msgp);
Michael Graff's avatar
Michael Graff committed
265
/*
Michael Graff's avatar
Michael Graff committed
266 267 268 269
* Destroy all state in the message.
*
* Requires:
*
Michael Graff's avatar
Michael Graff committed
270
* 'msgp' be valid.
Michael Graff's avatar
Michael Graff committed
271 272
*
* Ensures:
Michael Graff's avatar
Michael Graff committed
273
* '*msgp' == NULL
Michael Graff's avatar
Michael Graff committed
274 275
*/
276 277 278 279 280
isc_result_t
dns_message_sectiontotext(dns_message_t *msg, dns_section_t section,
isc_boolean_t comments,
isc_boolean_t omit_final_dot,
isc_buffer_t *target);
281 282 283 284 285 286 287
isc_result_t
dns_message_pseudosectiontotext(dns_message_t *msg,
dns_pseudosection_t section,
isc_boolean_t comments,
isc_boolean_t omit_final_dot,
isc_buffer_t *target);
288
/*
289 290
* Convert section 'section' or 'pseudosection' of message 'msg' to
* a cleartext representation
291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360
*
* Notes:
* If 'omit_final_dot' is true, then the final '.' in absolute names
* will not be emitted.
* If 'no_rdata_or_tt;' is true, omit rdata and ttl fields.
* If 'comments' is true, lines beginning with ";;" will be emitted
* indicating section name.
*
* Requires:
*
* 'msg' is a valid message.
*
* 'target' is a valid buffer.
*
* 'section' is a valid section label.
*
* Ensures:
*
* If the result is success:
*
* Any bitstring labels are in canonical form.
*
* The used space in 'target' is updated.
*
* Returns:
*
* ISC_R_SUCCESS
* ISC_R_NOSPACE
* ISC_R_NOMORE
*
* Note: On error return, *target may be partially filled with data.
*/
isc_result_t
dns_message_totext(dns_message_t *msg, isc_boolean_t comments,
isc_boolean_t headers, isc_boolean_t omit_final_dot,
isc_buffer_t *target);
/*
* Convert all sections of message 'msg' to a cleartext representation
*
* Notes:
* If 'omit_final_dot' is true, then the final '.' in absolute names
* will not be emitted.
* If 'no_rdata_or_tt;' is true, omit rdata and ttl fields.
* If 'comments' is true, lines beginning with ";;" will be emitted
* indicating section name.
*
* Requires:
*
* 'msg' is a valid message.
*
* 'target' is a valid buffer.
*
* Ensures:
*
* If the result is success:
*
* Any bitstring labels are in canonical form.
*
* The used space in 'target' is updated.
*
* Returns:
*
* ISC_R_SUCCESS
* ISC_R_NOSPACE
* ISC_R_NOMORE
*
* Note: On error return, *target may be partially filled with data.
*/
361
isc_result_t
362 363
dns_message_parse(dns_message_t *msg, isc_buffer_t *source,
isc_boolean_t preserve_order);
Michael Graff's avatar
Michael Graff committed
364
/*
Michael Graff's avatar
Michael Graff committed
365 366 367 368
* Parse raw wire data pointed to by "buffer" and bounded by "buflen" as a
* DNS message.
*
* OPT records are detected and stored in the pseudo-section "opt".
Brian Wellington's avatar
Brian Wellington committed
369
* TSIGs are detected and stored in the pseudo-section "tsig".
Michael Graff's avatar
Michael Graff committed
370
*
371 372 373 374 375 376 377 378 379 380 381 382
* If 'preserve_order' is true, or if the opcode of the message is UPDATE,
* a separate dns_name_t object will be created for each RR in the message.
* Each such dns_name_t will have a single rdataset containing the single RR,
* and the order of the RRs in the message is preserved.
* Otherwise, only one dns_name_t object will be created for each unique
* owner name in the section, and each such dns_name_t will have a list
* of rdatasets. To access the names and their data, use
* dns_message_firstname() and dns_message_nextname().
*
* OPT and TSIG records are always handled specially, regardless of the
* 'preserve_order' setting.
*
Michael Graff's avatar
Michael Graff committed
383 384
* If this is a multi-packet message (edns) and more data is required to
* build the full message state, DNS_R_MOREDATA is returned. In this case,
385
* this function should be repeated with all input buffers until ISC_R_SUCCESS
Michael Graff's avatar
Michael Graff committed
386 387 388 389 390
* (or an error) is returned.
*
* Requires:
* "msg" be valid.
*
Michael Graff's avatar
Michael Graff committed
391
* "buffer" be a wire format binary buffer.
Michael Graff's avatar
Michael Graff committed
392 393 394 395
*
* Ensures:
* The buffer's data format is correct.
*
Michael Graff's avatar
Michael Graff committed
396 397
* The buffer's contents verify as correct regarding header bits, buffer
* and rdata sizes, etc.
Michael Graff's avatar
Michael Graff committed
398 399
*
* Returns:
400 401
* ISC_R_SUCCESS -- all is well
* ISC_R_NOMEMORY -- no memory
Michael Graff's avatar
Michael Graff committed
402
* DNS_R_MOREDATA -- more packets needed for complete message
Michael Graff's avatar
Michael Graff committed
403 404
* DNS_R_??? -- bad signature (XXXMLG need more of these)
* Many other errors possible XXXMLG
Michael Graff's avatar
Michael Graff committed
405 406
*/
407
isc_result_t
Michael Graff's avatar
Michael Graff committed
408
dns_message_renderbegin(dns_message_t *msg, isc_buffer_t *buffer);
Michael Graff's avatar
Michael Graff committed
409
/*
Michael Graff's avatar
Michael Graff committed
410 411
* Begin rendering on a message. Only one call can be made to this function
* per message.
Michael Graff's avatar
Michael Graff committed
412
*
Andreas Gustafsson's avatar
Andreas Gustafsson committed
413
* The buffer is "owned" by the message library until dns_message_renderend()
Michael Graff's avatar
Michael Graff committed
414 415
* is called.
*
Michael Graff's avatar
Michael Graff committed
416
* Requires:
Michael Graff's avatar
Michael Graff committed
417 418
*
* 'msg' be valid.
419
*
Michael Graff's avatar
Michael Graff committed
420 421 422 423 424
* buffer is a valid binary buffer.
*
* Side Effects:
*
* The buffer is cleared before it is used.
425
*
Michael Graff's avatar
Michael Graff committed
426
* Returns:
427 428
* ISC_R_SUCCESS -- all is well
* ISC_R_NOSPACE -- output buffer is too small
Michael Graff's avatar
Michael Graff committed
429
* Anything that dns_compress_init() can return.
Michael Graff's avatar
Michael Graff committed
430 431
*/
432
isc_result_t
433 434 435
dns_message_renderchangebuffer(dns_message_t *msg, isc_buffer_t *buffer);
/*
* Reset the buffer. This can be used after growing the old buffer
436
* on a ISC_R_NOSPACE return from most of the render functions.
437
*
Michael Graff's avatar
Michael Graff committed
438 439 440 441
* On successful completion, the old buffer is no longer used by the
* library. The new buffer is owned by the library until
* dns_message_renderend() is called.
*
442 443 444 445 446 447 448 449 450
* Requires:
*
* 'msg' be valid.
*
* dns_message_renderbegin() was called.
*
* buffer != NULL.
*
* Returns:
451 452
* ISC_R_NOSPACE -- new buffer is too small
* ISC_R_SUCCESS -- all is well.
453 454
*/
455
isc_result_t
456
dns_message_renderreserve(dns_message_t *msg, unsigned int space);
Michael Graff's avatar
Michael Graff committed
457
/*
Michael Graff's avatar
Michael Graff committed
458 459 460
* XXXMLG should use size_t rather than unsigned int once the buffer
* API is cleaned up
*
Michael Graff's avatar
Michael Graff committed
461 462 463 464 465
* Reserve "space" bytes in the given buffer.
*
* Requires:
*
* 'msg' be valid.
Michael Graff's avatar
Michael Graff committed
466
*
467 468
* dns_message_renderbegin() was called.
*
Michael Graff's avatar
Michael Graff committed
469
* Returns:
470 471
* ISC_R_SUCCESS -- all is well.
* ISC_R_NOSPACE -- not enough free space in the buffer.
Michael Graff's avatar
Michael Graff committed
472 473
*/
474
void
Michael Graff's avatar
Michael Graff committed
475 476
dns_message_renderrelease(dns_message_t *msg, unsigned int space);
/*
Michael Graff's avatar
Michael Graff committed
477 478 479
* XXXMLG should use size_t rather than unsigned int once the buffer
* API is cleaned up
*
Michael Graff's avatar
Michael Graff committed
480 481 482 483 484 485
* Release "space" bytes in the given buffer that was previously reserved.
*
* Requires:
*
* 'msg' be valid.
*
486 487
* 'space' is less than or equal to the total amount of space reserved
* via prior calls to dns_message_renderreserve().
488
*
489
* dns_message_renderbegin() was called.
Michael Graff's avatar
Michael Graff committed
490 491
*/
492
isc_result_t
493
dns_message_rendersection(dns_message_t *msg, dns_section_t section,
Michael Graff's avatar
Michael Graff committed
494
unsigned int options);
Michael Graff's avatar
Michael Graff committed
495
/*
Michael Graff's avatar
Michael Graff committed
496 497
* Render all names, rdatalists, etc from the given section at the
* specified priority or higher.
Michael Graff's avatar
Michael Graff committed
498 499
*
* Requires:
Michael Graff's avatar
Michael Graff committed
500 501 502
* 'msg' be valid.
*
* 'section' be a valid section.
Michael Graff's avatar
Michael Graff committed
503
*
504 505
* dns_message_renderbegin() was called.
*
Michael Graff's avatar
Michael Graff committed
506
* Returns:
507
* ISC_R_SUCCESS -- all records were written, and there are
Michael Graff's avatar
Michael Graff committed
508
* no more records for this section.
509
* ISC_R_NOSPACE -- Not enough room in the buffer to write
Michael Graff's avatar
Michael Graff committed
510 511 512
* all records requested.
* DNS_R_MOREDATA -- All requested records written, and there
* are records remaining for this section.
Michael Graff's avatar
Michael Graff committed
513 514
*/
515 516 517 518 519 520 521 522 523 524 525 526 527 528 529
void
dns_message_renderheader(dns_message_t *msg, isc_buffer_t *target);
/*
* Render the message header. This is implicitly called by
* dns_message_renderend().
*
* Requires:
*
* 'msg' be a valid message.
*
* dns_message_renderbegin() was called.
*
* 'target' is a valid buffer with enough space to hold a message header
*/
530
isc_result_t
531
dns_message_renderend(dns_message_t *msg);
Michael Graff's avatar
Michael Graff committed
532
/*
Michael Graff's avatar
Michael Graff committed
533 534 535 536 537 538 539 540
* Finish rendering to the buffer. Note that more data can be in the
* 'msg' structure. Destroying the structure will free this, or in a multi-
* part EDNS1 message this data can be rendered to another buffer later.
*
* Requires:
*
* 'msg' be a valid message.
*
541 542
* dns_message_renderbegin() was called.
*
Michael Graff's avatar
Michael Graff committed
543
* Returns:
544
* ISC_R_SUCCESS -- all is well.
Michael Graff's avatar
Michael Graff committed
545 546
*/
Bob Halley's avatar
Bob Halley committed
547 548 549 550 551 552 553 554 555 556 557 558 559 560
void
dns_message_renderreset(dns_message_t *msg);
/*
* Reset the message so that it may be rendered again.
*
* Notes:
*
* If dns_message_renderbegin() has been called, dns_message_renderend()
* must be called before calling this function.
*
* Requires:
*
* 'msg' be a valid message with rendering intent.
*/
Michael Graff's avatar
Michael Graff committed
561
562
isc_result_t
Michael Graff's avatar
Michael Graff committed
563 564 565 566
dns_message_firstname(dns_message_t *msg, dns_section_t section);
/*
* Set internal per-section name pointer to the beginning of the section.
*
Michael Graff's avatar
Michael Graff committed
567
* The functions dns_message_firstname() and dns_message_nextname() may
568
* be used for iterating over the owner names in a section.
Michael Graff's avatar
Michael Graff committed
569
*
Michael Graff's avatar
Michael Graff committed
570 571 572 573 574 575 576
* Requires:
*
* 'msg' be valid.
*
* 'section' be a valid section.
*
* Returns:
577 578
* ISC_R_SUCCESS -- All is well.
* ISC_R_NOMORE -- No names on given section.
Michael Graff's avatar
Michael Graff committed
579 580
*/
581
isc_result_t
Michael Graff's avatar
Michael Graff committed
582 583 584 585 586 587 588 589 590 591 592
dns_message_nextname(dns_message_t *msg, dns_section_t section);
/*
* Sets the internal per-section name pointer to point to the next name
* in that section.
*
* Requires:
*
* 'msg' be valid.
*
* 'section' be a valid section.
*
Michael Graff's avatar
Michael Graff committed
593
* dns_message_firstname() must have been called on this section,
594
* and the result was ISC_R_SUCCESS.
Michael Graff's avatar
Michael Graff committed
595
*
Michael Graff's avatar
Michael Graff committed
596
* Returns:
597 598
* ISC_R_SUCCESS -- All is well.
* ISC_R_NOMORE -- No names in given section.
Michael Graff's avatar
Michael Graff committed
599 600
*/
Michael Graff's avatar
Michael Graff committed
601
void
Michael Graff's avatar
Michael Graff committed
602 603 604 605 606 607
dns_message_currentname(dns_message_t *msg, dns_section_t section,
dns_name_t **name);
/*
* Sets 'name' to point to the name where the per-section internal name
* pointer is currently set.
*
Michael Graff's avatar
Michael Graff committed
608 609 610
* This function returns the name in the database, so any data associated
* with it (via the name's "list" member) contains the actual rdatasets.
*
Michael Graff's avatar
Michael Graff committed
611 612 613 614 615 616 617 618
* Requires:
*
* 'msg' be valid.
*
* 'name' be non-NULL, and *name be NULL.
*
* 'section' be a valid section.
*
Michael Graff's avatar
Michael Graff committed
619 620
* dns_message_firstname() must have been called on this section,
* and the result of it and any dns_message_nextname() calls was
621
* ISC_R_SUCCESS.
Michael Graff's avatar
Michael Graff committed
622 623
*/
624
isc_result_t
Michael Graff's avatar
Michael Graff committed
625 626
dns_message_findname(dns_message_t *msg, dns_section_t section,
dns_name_t *target, dns_rdatatype_t type,
Bob Halley's avatar
Bob Halley committed
627 628
dns_rdatatype_t covers, dns_name_t **foundname,
dns_rdataset_t **rdataset);
Michael Graff's avatar
Michael Graff committed
629
/*
Michael Graff's avatar
Michael Graff committed
630 631
* Search for a name in the specified section. If it is found, *name is
* set to point to the name, and *rdataset is set to point to the found
Bob Halley's avatar
Bob Halley committed
632
* rdataset (if type is specified as other than dns_rdatatype_any).
Michael Graff's avatar
Michael Graff committed
633 634 635 636 637 638
*
* Requires:
* 'msg' be valid.
*
* 'section' be a valid section.
*
Michael Graff's avatar
Michael Graff committed
639 640
* If a pointer to the name is desired, 'foundname' should be non-NULL.
* If it is non-NULL, '*foundname' MUST be NULL.
Michael Graff's avatar
Michael Graff committed
641 642 643
*
* If a type other than dns_datatype_any is searched for, 'rdataset'
* may be non-NULL, '*rdataset' be NULL, and will point at the found
Michael Graff's avatar
Michael Graff committed
644
* rdataset. If the type is dns_datatype_any, 'rdataset' must be NULL.
Michael Graff's avatar
Michael Graff committed
645 646 647 648 649 650
*
* 'target' be a valid name.
*
* 'type' be a valid type.
*
* Returns:
651
* ISC_R_SUCCESS -- all is well.
Michael Graff's avatar
Michael Graff committed
652
* DNS_R_NXDOMAIN -- name does not exist in that section.
653
* DNS_R_NXRRSET -- The name does exist, but the desired
Michael Graff's avatar
Michael Graff committed
654
* type does not.
Michael Graff's avatar
Michael Graff committed
655 656
*/
657
isc_result_t
658 659 660 661 662 663 664 665 666 667 668 669
dns_message_findtype(dns_name_t *name, dns_rdatatype_t type,
dns_rdatatype_t covers, dns_rdataset_t **rdataset);
/*
* Search the name for the specified type. If it is found, *rdataset is
* filled in with a pointer to that rdataset.
*
* Requires:
* if '**rdataset' is non-NULL, *rdataset needs to be NULL.
*
* 'type' be a valid type, and NOT dns_rdatatype_any.
*
* Returns:
670 671
* ISC_R_SUCCESS -- all is well.
* ISC_R_NOTFOUND -- the desired type does not exist.
672 673
*/
Michael Graff's avatar
Michael Graff committed
674 675 676 677
void
dns_message_movename(dns_message_t *msg, dns_name_t *name,
dns_section_t fromsection,
dns_section_t tosection);
Michael Graff's avatar
Michael Graff committed
678 679
/*
* Move a name from one section to another.
Michael Graff's avatar
Michael Graff committed
680 681 682 683 684
*
* Requires:
*
* 'msg' be valid.
*
Michael Graff's avatar
Michael Graff committed
685
* 'name' must be a name already in 'fromsection'.
Michael Graff's avatar
Michael Graff committed
686 687 688
*
* 'fromsection' must be a valid section.
*
Michael Graff's avatar
Michael Graff committed
689
* 'tosection' must be a valid section.
Michael Graff's avatar
Michael Graff committed
690 691
*/
Michael Graff's avatar
Michael Graff committed
692 693 694
void
dns_message_addname(dns_message_t *msg, dns_name_t *name,
dns_section_t section);
Michael Graff's avatar
Michael Graff committed
695 696 697
/*
* Adds the name to the given section.
*
Michael Graff's avatar
Michael Graff committed
698 699
* It is the caller's responsibility to enforce any unique name requirements
* in a section.
Michael Graff's avatar
Michael Graff committed
700 701 702 703 704 705 706 707
*
* Requires:
*
* 'msg' be valid, and be a renderable message.
*
* 'name' be a valid name.
*
* 'section' be a named section.
Michael Graff's avatar
Michael Graff committed
708
*/
709
710 711 712 713 714 715 716 717
/*
* LOANOUT FUNCTIONS
*
* Each of these functions loan a particular type of data to the caller.
* The storage for these will vanish when the message is destroyed or
* reset, and must NOT be used after these operations.
*/
718
isc_result_t
719 720 721
dns_message_gettempname(dns_message_t *msg, dns_name_t **item);
/*
* Return a name that can be used for any temporary purpose, including
722 723 724
* inserting into the message's linked lists. The name must be returned
* to the message code using dns_message_puttempname() or inserted into
* one of the message's sections before the message is destroyed.
725 726 727 728 729 730 731 732 733
*
* It is the caller's responsibility to initialize this name.
*
* Requires:
* msg be a valid message
*
* item != NULL && *item == NULL
*
* Returns:
734 735
* ISC_R_SUCCESS -- All is well.
* ISC_R_NOMEMORY -- No item can be allocated.
736 737
*/
738
isc_result_t
739 740 741 742 743 744 745 746 747 748 749 750
dns_message_gettemprdata(dns_message_t *msg, dns_rdata_t **item);
/*
* Return a rdata that can be used for any temporary purpose, including
* inserting into the message's linked lists. The storage associated with
* this rdata will be destroyed when the message is destroyed or reset.
*
* Requires:
* msg be a valid message
*
* item != NULL && *item == NULL
*
* Returns:
751 752
* ISC_R_SUCCESS -- All is well.
* ISC_R_NOMEMORY -- No item can be allocated.
753 754
*/
755
isc_result_t
756 757 758 759 760 761 762 763 764 765 766 767
dns_message_gettemprdataset(dns_message_t *msg, dns_rdataset_t **item);
/*
* Return a rdataset that can be used for any temporary purpose, including
* inserting into the message's linked lists. The storage associated with
* this rdataset will be destroyed when the message is destroyed or reset.
*
* Requires:
* msg be a valid message
*
* item != NULL && *item == NULL
*
* Returns:
768 769
* ISC_R_SUCCESS -- All is well.
* ISC_R_NOMEMORY -- No item can be allocated.
770 771
*/
772
isc_result_t
773 774 775 776 777 778 779 780 781 782 783 784
dns_message_gettemprdatalist(dns_message_t *msg, dns_rdatalist_t **item);
/*
* Return a rdatalist that can be used for any temporary purpose, including
* inserting into the message's linked lists. The storage associated with
* this rdatalist will be destroyed when the message is destroyed or reset.
*
* Requires:
* msg be a valid message
*
* item != NULL && *item == NULL
*
* Returns:
785 786
* ISC_R_SUCCESS -- All is well.
* ISC_R_NOMEMORY -- No item can be allocated.
787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848
*/
void
dns_message_puttempname(dns_message_t *msg, dns_name_t **item);
/*
* Return a borrowed name to the message's name free list.
*
* Requires:
* msg be a valid message
*
* item != NULL && *item point to a name returned by
* dns_message_gettempname()
*
* Ensures:
* *item == NULL
*/
void
dns_message_puttemprdata(dns_message_t *msg, dns_rdata_t **item);
/*
* Return a borrowed rdata to the message's rdata free list.
*
* Requires:
* msg be a valid message
*
* item != NULL && *item point to a rdata returned by
* dns_message_gettemprdata()
*
* Ensures:
* *item == NULL
*/
void
dns_message_puttemprdataset(dns_message_t *msg, dns_rdataset_t **item);
/*
* Return a borrowed rdataset to the message's rdataset free list.
*
* Requires:
* msg be a valid message
*
* item != NULL && *item point to a rdataset returned by
* dns_message_gettemprdataset()
*
* Ensures:
* *item == NULL
*/
void
dns_message_puttemprdatalist(dns_message_t *msg, dns_rdatalist_t **item);
/*
* Return a borrowed rdatalist to the message's rdatalist free list.
*
* Requires:
* msg be a valid message
*
* item != NULL && *item point to a rdatalist returned by
* dns_message_gettemprdatalist()
*
* Ensures:
* *item == NULL
*/
849
isc_result_t
Michael Graff's avatar
Michael Graff committed
850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867
dns_message_peekheader(isc_buffer_t *source, dns_messageid_t *idp,
unsigned int *flagsp);
/*
* Assume the remaining region of "source" is a DNS message. Peek into
* it and fill in "*idp" with the message id, and "*flagsp" with the flags.
*
* Requires:
*
* source != NULL
*
* Ensures:
*
* if (idp != NULL) *idp == message id.
*
* if (flagsp != NULL) *flagsp == message flags.
*
* Returns:
*
868
* ISC_R_SUCCESS -- all is well.
Michael Graff's avatar
Michael Graff committed
869
*
870
* ISC_R_UNEXPECTEDEND -- buffer doesn't contain enough for a header.
Michael Graff's avatar
Michael Graff committed
871 872
*/
873
isc_result_t
Bob Halley's avatar
Bob Halley committed
874 875 876 877 878 879
dns_message_reply(dns_message_t *msg, isc_boolean_t want_question_section);
/*
* Start formatting a reply to the query in 'msg'.
*
* Requires:
*
Bob Halley's avatar
EDNS0
Bob Halley committed
880
* 'msg' is a valid message with parsing intent, and contains a query.
Bob Halley's avatar
Bob Halley committed
881 882 883 884
*
* Ensures:
*
* The message will have a rendering intent. If 'want_question_section'
885 886 887 888 889
* is true, the message opcode is query or notify, and the question
* section is present and properly formatted, then the question section
* will be included in the reply. All other sections will be cleared.
* The QR flag will be set, the RD flag will be preserved, and all other
* flags will be cleared.
Bob Halley's avatar
Bob Halley committed
890 891 892
*
* Returns:
*
893
* ISC_R_SUCCESS -- all is well.
Bob Halley's avatar
Bob Halley committed
894
*
Bob Halley's avatar
Bob Halley committed
895 896 897 898 899 900 901
* DNS_R_FORMERR -- the header or question section of the
* message is invalid, replying is impossible.
* If DNS_R_FORMERR is returned when
* want_question_section is ISC_FALSE, then
* it's the header section that's bad;
* otherwise either of the header or question
* sections may be bad.
Bob Halley's avatar
Bob Halley committed
902 903
*/
Bob Halley's avatar
EDNS0
Bob Halley committed
904 905 906 907 908 909 910 911 912 913 914 915 916 917
dns_rdataset_t *
dns_message_getopt(dns_message_t *msg);
/*
* Get the OPT record for 'msg'.
*
* Requires:
*
* 'msg' is a valid message.
*
* Returns:
*
* The OPT rdataset of 'msg', or NULL if there isn't one.
*/
918
isc_result_t
Bob Halley's avatar
EDNS0
Bob Halley committed
919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937
dns_message_setopt(dns_message_t *msg, dns_rdataset_t *opt);
/*
* Set the OPT record for 'msg'.
*
* Requires:
*
* 'msg' is a valid message with rendering intent,
* dns_message_renderbegin() has been called, and no sections have been
* rendered.
*
* 'opt' is a valid OPT record.
*
* Ensures:
*
* The OPT record will be rendered when dns_message_renderend() is
* called.
*
* Returns:
*
938
* ISC_R_SUCCESS -- all is well.
Bob Halley's avatar
EDNS0
Bob Halley committed
939
*
940
* ISC_R_NOSPACE -- there is no space for the OPT record.
Bob Halley's avatar
EDNS0
Bob Halley committed
941 942
*/
943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958
dns_rdataset_t *
dns_message_gettsig(dns_message_t *msg, dns_name_t **owner);
/*
* Get the TSIG record and owner for 'msg'.
*
* Requires:
*
* 'msg' is a valid message.
* 'owner' is not NULL, and *owner is NULL. Contains the owner on return.
*
* Returns:
*
* The TSIG rdataset of 'msg', or NULL if there isn't one.
*/
dns_rdataset_t *
959
dns_message_getsig0(dns_message_t *msg, dns_name_t **owner);
960
/*
961
* Get the SIG(0) record and owner for 'msg'.
962 963 964 965
*
* Requires:
*
* 'msg' is a valid message.
966
* 'owner' is not NULL, and *owner is NULL. Contains the owner on return.
967 968 969 970 971 972
*
* Returns:
*
* The SIG(0) rdataset of 'msg', or NULL if there isn't one.
*/
973 974 975 976 977 978 979 980 981 982 983 984 985 986 987
void
dns_message_takebuffer(dns_message_t *msg, isc_buffer_t **buffer);
/*
* Give the *buffer to the message code to clean up when it is no
* longer needed. This is usually when the message is reset or
* destroyed.
*
* Requires:
*
* msg be a valid message.
*
* buffer != NULL && *buffer is a valid isc_buffer_t, which was
* dynamincally allocated via isc_buffer_allocate().
*/
Brian Wellington's avatar
Brian Wellington committed
988
isc_result_t
989
dns_message_signer(dns_message_t *msg, dns_name_t *signer);
Brian Wellington's avatar
Brian Wellington committed
990
/*
991
* If this message was signed, return the identity of the signer.
Brian Wellington's avatar
Brian Wellington committed
992 993
* Unless ISC_R_NOTFOUND is returned, signer will reflect the name of the
* key that signed the message.
Brian Wellington's avatar
Brian Wellington committed
994 995 996
*
* Requires:
*
997 998
* msg is a valid parsed message.
* signer is a valid name
Brian Wellington's avatar
Brian Wellington committed
999 1000 1001 1002 1003 1004
*
* Returns:
*
* ISC_R_SUCCESS - the message was signed, and *signer
* contains the signing identity
*
1005
* ISC_R_NOTFOUND - no TSIG or SIG(0) record is present in the
Brian Wellington's avatar
Brian Wellington committed
1006 1007
* message
*
1008 1009 1010 1011 1012 1013 1014 1015 1016 1017
* DNS_R_TSIGVERIFYFAILURE - the message was signed by a TSIG, but the
* signature failed to verify
*
* DNS_R_TSIGERRORSET - the message was signed by a TSIG and
* verified, but the query was rejected by
* the server
*
* DNS_R_NOIDENTITY - the message was signed by a TSIG and
* verified, but the key has no identity since
* it was generated by an unsigned TKEY process
Brian Wellington's avatar
Brian Wellington committed
1018
*
1019 1020
* DNS_R_SIGINVALID - the message was signed by a SIG(0), but
* the signature failed to verify
Brian Wellington's avatar
Brian Wellington committed
1021
*
1022 1023
* DNS_R_SIGNOTVERIFIEDYET - the message was signed by a SIG(0), but
* the signature has not been verified yet
Brian Wellington's avatar
Brian Wellington committed
1024 1025
*/
Brian Wellington's avatar
Brian Wellington committed
1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045
isc_result_t
dns_message_checksig(dns_message_t *msg, dns_view_t *view);
/*
* If this message was signed, verify the signature.
*
* Requires:
*
* msg is a valid parsed message.
* view is a valid view
*
* Returns:
*
* ISC_R_SUCCESS - the message was unsigned, or the message
* was signed correctly.
*
* DNS_R_EXPECTEDTSIG - A TSIG was expected, but not seen
* DNS_R_UNEXPECTEDTSIG - A TSIG was seen but not expected
* DNS_R_TSIGVERIFYFAILURE - The TSIG failed to verify
*/
1046 1047
ISC_LANG_ENDDECLS
1048
#endif /* DNS_MESSAGE_H */
|
{
"url": "https://gitlab.isc.org/isc-projects/bind9/-/blame/1d514700515d52b36ad45f864ff77aa65465a957/lib/dns/include/dns/message.h",
"source_domain": "gitlab.isc.org",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "918451",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3V7WSGYFLTGCTGMTGVD4UUAOM6Q4NUAT",
"WARC-Concurrent-To": "<urn:uuid:7e9bfa59-5668-4e41-b226-493daccd4f46>",
"WARC-Date": "2020-11-24T05:54:14Z",
"WARC-IP-Address": "149.20.1.108",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FYZEEJVK2JGOPO6DLP454SEOASDYQARD",
"WARC-Record-ID": "<urn:uuid:7f4a44b7-aba1-42db-934b-201b606f4482>",
"WARC-Target-URI": "https://gitlab.isc.org/isc-projects/bind9/-/blame/1d514700515d52b36ad45f864ff77aa65465a957/lib/dns/include/dns/message.h",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b13e939c-e867-47dd-8b06-f456b4936a22>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-240.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,
18,
30,
32,
35,
55,
76,
78,
137,
175,
179,
252,
326,
395,
399,
478,
558,
629,
705,
778,
853,
932,
945,
949,
950,
956,
978,
1002,
1017,
1018,
1023,
1036,
1042,
1043,
1049,
1071,
1094,
1097,
1098,
1121,
1145,
1148,
1174,
1180,
1209,
1232,
1235,
1236,
1242,
1263,
1264,
1273,
1276,
1301,
1304,
1307,
1387,
1411,
1484,
1563,
1638,
1691,
1694,
1773,
1808,
1811,
1814,
1877,
1883,
1947,
1950,
1953,
2024,
2047,
2054,
2078,
2081,
2152,
2158,
2210,
2213,
2279,
2282,
2341,
2344,
2420,
2495,
2569,
2599,
2602,
2664,
2667,
2732,
2735,
2802,
2846,
2849,
2925,
3004,
3076,
3151,
3227,
3254,
3257,
3260,
3304,
3334,
3350,
3401,
3431,
3501,
3519,
3564,
3567,
3570,
3579,
3582,
3597,
3668,
3736,
3798,
3802,
3803,
3818,
3854,
3890,
3926,
3962,
3998,
4018,
4039,
4045,
4081,
4117,
4120,
4121,
4141,
4162,
4165,
4220,
4224,
4225,
4245,
4266,
4278,
4335,
4336,
4386,
4409,
4433,
4437,
4509,
4532,
4556,
4560,
4561,
4584,
4608,
4624,
4627,
4703,
4774,
4778,
4801,
4825,
4829,
4856,
4879,
4903,
4907,
4938,
4961,
4985,
5001,
5033,
5063,
5096,
5130,
5134,
5162,
5166,
5167,
5199,
5232,
5268,
5310,
5352,
5394,
5436,
5437,
5438,
5442,
5445,
5473,
5502,
5506,
5550,
5566,
5570,
5617,
5669,
5719,
5742,
5766,
5774,
5775,
5778,
5801,
5825,
5829,
5907,
5930,
5954,
5958,
5962,
5985,
6009,
6021,
6081,
6139,
6190,
6213,
6237,
6241,
6242,
6265,
6289,
6309,
6312,
6345,
6349,
6415,
6416,
6439,
6463,
6471,
6515,
6516,
6536,
6557,
6561,
6582,
6605,
6629,
6633,
6662,
6685,
6709,
6713,
6736,
6740,
6741,
6745,
6768,
6791,
6815,
6827,
6850,
6873,
6897,
6920,
6944,
6948,
6976,
6999,
7023,
7027,
7028,
7032,
7056,
7079,
7103,
7107,
7148,
7171,
7195,
7203,
7204,
7234,
7257,
7281,
7289,
7334,
7381,
7401,
7422,
7426,
7456,
7464,
7495,
7529,
7533,
7534,
7557,
7581,
7585,
7600,
7623,
7647,
7651,
7685,
7689,
7728,
7748,
7769,
7777,
7808,
7841,
7845,
7883,
7891,
7925,
7963,
7967,
7968,
7972,
8002,
8006,
8062,
8066,
8067,
8071,
8102,
8125,
8149,
8153,
8177,
8181,
8182,
8205,
8229,
8233,
8259,
8271,
8305,
8338,
8339,
8343,
8374,
8382,
8410,
8411,
8434,
8458,
8466,
8500,
8538,
8550,
8551,
8586,
8628,
8640,
8641,
8668,
8700,
8704,
8735,
8743,
8779,
8820,
8824,
8857,
8861,
8886,
8894,
8912,
8913,
8917,
8948,
8960,
8989,
9016,
9046,
9072,
9099,
9103,
9133,
9153,
9174,
9178,
9181,
9185,
9186,
9210,
9215,
9230,
9236,
9237,
9257,
9258,
9262,
9275,
9279,
9359,
9379,
9400,
9404,
9410,
9414,
9417,
9440,
9464,
9468,
9493,
9497,
9500,
9523,
9547,
9551,
9622,
9645,
9669,
9673,
9751,
9774,
9798,
9810,
9813,
9826,
9863,
9867,
9870,
9893,
9917,
9921,
9963,
9986,
10010,
10014,
10017,
10045,
10052,
10081,
10089,
10143,
10172,
10195,
10219,
10227,
10230,
10242,
10265,
10289,
10293,
10358,
10381,
10405,
10417,
10431,
10434,
10446,
10454,
10490,
10519,
10527,
10531,
10532,
10555,
10579,
10583,
10588,
10608,
10629,
10633,
10693,
10716,
10740,
10764,
10767,
10844,
10917,
10990,
11033,
11036,
11059,
11083,
11095,
11165,
11220,
11223,
11243,
11264,
11272,
11330,
11333,
11356,
11380,
11392,
11405,
11408,
11427,
11447,
11468,
11476,
11479,
11546,
11569,
11593,
11597,
11601,
11624,
11648,
11652,
11653,
11676,
11700,
11704,
11709,
11732,
11756,
11760,
11803,
11826,
11850,
11854,
11857,
11880,
11904,
11920,
11957,
11960,
11973,
11976,
11999,
12023,
12027,
12047,
12070,
12094,
12102,
12105,
12117,
12140,
12164,
12168,
12187,
12210,
12234,
12242,
12246,
12247,
12267,
12280,
12349,
12378,
12413,
12441,
12469,
12470,
12483,
12535,
12568,
12596,
12630,
12657,
12661,
12664,
12672,
12741,
12771,
13051,
13054,
13064,
13133,
13157,
13217,
13285,
13313,
13316,
13329,
13332,
13361,
13364,
13395,
13398,
13437,
13440,
13452,
13455,
13484,
13487,
13535,
13538,
13581,
13584,
13596,
13599,
13616,
13633,
13649,
13652,
13722,
13725,
13726,
13739,
13802,
13860,
13888,
13891,
13962,
13965,
13975,
14044,
14068,
14128,
14196,
14224,
14227,
14240,
14243,
14272,
14275,
14306,
14309,
14321,
14324,
14353,
14356,
14404,
14407,
14450,
14453,
14465,
14468,
14485,
14502,
14518,
14521,
14591,
14594,
14595,
14599,
14612,
14620,
14680,
14715,
14738,
14762,
14766,
14769,
14792,
14816,
14832,
14907,
14923,
14926,
14994,
15020,
15047,
15051,
15114,
15137,
15161,
15165,
15168,
15216,
15291,
15367,
15445,
15502,
15575,
15647,
15706,
15762,
15765,
15837,
15866,
15869,
15892,
15916,
15924,
15997,
16073,
16077,
16156,
16179,
16203,
16223,
16253,
16256,
16269,
16288,
16291,
16314,
16338,
16342,
16386,
16409,
16433,
16449,
16452,
16464,
16504,
16507,
16530,
16554,
16562,
16635,
16661,
16684,
16708,
16716,
16719,
16731,
16739,
16772,
16804,
16827,
16851,
16855,
16918,
16941,
16965,
16973,
17032,
17069,
17092,
17116,
17124,
17128,
17129,
17133,
17146,
17169,
17193,
17197,
17264,
17287,
17311,
17315,
17318,
17341,
17365,
17373,
17450,
17466,
17489,
17513,
17517,
17520,
17548,
17577,
17581,
17659,
17682,
17706,
17714,
17728,
17731,
17754,
17778,
17782,
17795,
17818,
17842,
17850,
17853,
17872,
17876,
17879,
17902,
17926,
17946,
17982,
17985,
18002,
18005,
18049,
18053,
18056,
18079,
18103,
18107,
18119,
18127,
18160,
18208,
18231,
18255,
18259,
18308,
18331,
18355,
18363,
18367,
18368,
18372,
18385,
18397,
18471,
18474,
18542,
18546,
18610,
18614,
18617,
18640,
18664,
18680,
18749,
18807,
18845,
18848,
18884,
18897,
18900,
18919,
18922,
18963,
18966,
18985,
18988,
19000,
19008,
19053,
19087,
19095,
19099,
19100,
19104,
19117,
19121,
19188,
19211,
19235,
19239,
19242,
19265,
19289,
19301,
19370,
19391,
19394,
19417,
19441,
19461,
19507,
19510,
19523,
19526,
19545,
19568,
19592,
19596,
19599,
19607,
19648,
19651,
19674,
19698,
19702,
19714,
19722,
19756,
19814,
19837,
19861,
19869,
19873,
19874,
19878,
19883,
19906,
19930,
19938,
20005,
20008,
20031,
20055,
20067,
20136,
20157,
20160,
20183,
20207,
20231,
20306,
20309,
20322,
20325,
20344,
20347,
20355,
20426,
20477,
20481,
20484,
20488,
20529,
20552,
20576,
20584,
20588,
20589,
20593,
20606,
20610,
20679,
20702,
20726,
20730,
20758,
20781,
20805,
20809,
20812,
20835,
20859,
20867,
20934,
20967,
20990,
21014,
21022,
21025,
21038,
21061,
21085,
21097,
21116,
21119,
21152,
21175,
21199,
21203,
21206,
21214,
21255,
21258,
21281,
21305,
21309,
21321,
21325,
21386,
21409,
21433,
21437,
21480,
21484,
21544,
21567,
21591,
21603,
21635,
21698,
21747,
21770,
21794,
21802,
21806,
21807,
21867,
21872,
21940,
21943,
22003,
22031,
22034,
22047,
22050,
22079,
22082,
22123,
22126,
22199,
22203,
22204,
22208,
22221,
22225,
22268,
22291,
22315,
22319,
22322,
22345,
22369,
22401,
22471,
22548,
22621,
22624,
22637,
22640,
22669,
22672,
22680,
22721,
22724,
22747,
22771,
22775,
22787,
22791,
22825,
22848,
22872,
22880,
22884,
22893,
22913,
22934,
22990,
22995,
23040,
23043,
23098,
23101,
23111,
23114,
23187,
23235,
23238,
23251,
23254,
23305,
23309,
23332,
23356,
23360,
23361,
23365,
23378,
23401,
23425,
23441,
23507,
23510,
23584,
23587,
23610,
23634,
23638,
23710,
23714,
23775,
23798,
23822,
23826,
23829,
23852,
23876,
23904,
23917,
23920,
23942,
23945,
23978,
23981,
23993,
24001,
24035,
24082,
24105,
24129,
24137,
24141,
24142,
24146,
24159,
24182,
24206,
24250,
24315,
24318,
24390,
24410,
24413,
24426,
24429,
24451,
24454,
24487,
24490,
24513,
24537,
24541,
24607,
24611,
24648,
24671,
24695,
24699,
24702,
24725,
24749,
24753,
24765,
24773,
24807,
24854,
24877,
24901,
24909,
24913,
24914,
24937,
24961,
24965,
24970,
24993,
25017,
25041,
25108,
25131,
25134,
25206,
25235,
25238,
25261,
25285,
25297,
25371,
25444,
25447,
25470,
25494,
25526,
25539,
25542,
25561,
25564,
25606,
25609,
25642,
25645,
25668,
25692,
25700,
25766,
25831,
25835,
25853,
25876,
25900,
25908,
25912,
25913,
25917,
25930,
25953,
25977,
25985,
26049,
26098,
26118,
26139,
26147,
26202,
26237,
26260,
26284,
26288,
26291,
26314,
26338,
26346,
26419,
26491,
26511,
26532,
26536,
26604,
26627,
26651,
26675,
26678,
26691,
26710,
26713,
26746,
26749,
26772,
26796,
26804,
26876,
26925,
26948,
26972,
26984,
26987,
27056,
27125,
27148,
27172,
27176,
27248,
27271,
27295,
27319,
27322,
27351,
27354,
27381,
27384,
27396,
27400,
27434,
27457,
27481,
27485,
27544,
27548,
27606,
27629,
27653,
27657,
27681,
27704,
27728,
27736,
27740,
27741,
27745,
27758,
27806,
27867,
27926,
27929,
28002,
28048,
28051,
28064,
28124,
28127,
28181,
28184,
28196,
28204,
28238,
28293,
28301,
28305,
28306,
28329,
28353,
28369,
28374,
28433,
28467,
28500,
28523,
28547,
28555,
28558,
28602,
28625,
28649,
28669,
28672,
28685,
28688,
28707,
28710,
28733,
28757,
28761,
28812,
28835,
28859,
28871,
28874,
28916,
28919,
28942,
28966,
28970,
29010,
29033,
29057,
29065,
29069,
29070,
29093,
29117,
29129,
29134,
29192,
29222,
29245,
29269,
29281,
29284,
29323,
29326,
29349,
29373,
29381,
29458,
29475,
29498,
29522,
29554,
29557,
29570,
29573,
29621,
29624,
29651,
29654,
29687,
29710,
29734,
29738,
29742,
29746,
29747,
29779,
29782,
29803,
29806,
29879,
29949,
30004,
30008,
30009,
30013,
30026,
30038,
30102,
30105,
30176,
30188,
30261,
30333,
30399,
30435,
30438,
30500,
30503,
30516,
30542,
30545,
30578,
30581,
30593,
30601,
30635,
30683,
30691,
30695,
30696,
30700,
30713,
30761,
30827,
30830,
30902,
30977,
31049,
31052,
31065,
31091,
31094,
31127,
31130,
31142,
31150,
31184,
31232,
31240,
31244,
31245,
31249,
31262,
31310,
31382,
31385,
31460,
31535,
31610,
31613,
31626,
31652,
31655,
31688,
31691,
31703,
31711,
31745,
31793,
31801,
31805,
31806,
31810,
31823,
31871,
31945,
31948,
32024,
32099,
32175,
32178,
32191,
32217,
32220,
32253,
32256,
32268,
32276,
32310,
32358,
32606,
32610,
32611,
32616,
32680,
32683,
32742,
32745,
32758,
32784,
32787,
32840,
32869,
32872,
32884,
32901,
32905,
32906,
32911,
32977,
32980,
33041,
33044,
33057,
33083,
33086,
33140,
33170,
33173,
33185,
33202,
33206,
33207,
33212,
33284,
33287,
33354,
33357,
33370,
33396,
33399,
33456,
33489,
33492,
33504,
33521,
33525,
33526,
33531,
33605,
33608,
33677,
33680,
33693,
33719,
33722,
33780,
33814,
33817,
33829,
33846,
33850,
33851,
33855,
33868,
33891,
33915,
33987,
34054,
34086,
34089,
34161,
34237,
34240,
34253,
34256,
34274,
34277,
34289,
34292,
34332,
34335,
34384,
34387,
34399,
34402,
34406,
34440,
34463,
34487,
34491,
34494,
34498,
34568,
34591,
34615,
34623,
34627,
34628,
34632,
34645,
34665,
34686,
34710,
34786,
34789,
34840,
34843,
34856,
34859,
34879,
34887,
34908,
34912,
34983,
35003,
35024,
35040,
35044,
35056,
35059,
35132,
35152,
35220,
35292,
35363,
35436,
35462,
35482,
35503,
35515,
35518,
35530,
35533,
35537,
35571,
35591,
35612,
35616,
35619,
35639,
35660,
35688,
35747,
35800,
35843,
35893,
35938,
35990,
36020,
36040,
36061,
36069,
36073,
36074,
36094,
36102,
36123,
36179,
36196,
36236,
36239,
36272,
36275,
36288,
36291,
36320,
36323,
36335,
36338,
36396,
36400,
36401,
36405,
36418,
36438,
36446,
36467,
36543,
36604,
36607,
36640,
36643,
36656,
36659,
36710,
36782,
36795,
36798,
36830,
36833,
36845,
36848,
36915,
36926,
36929,
36941,
36944,
36948,
36982,
37002,
37010,
37031,
37035,
37038,
37042,
37101,
37121,
37129,
37150,
37158,
37162,
37163,
37227,
37244,
37305,
37308,
37352,
37355,
37368,
37371,
37400,
37475,
37478,
37490,
37493,
37552,
37556,
37557,
37574,
37578,
37639,
37643,
37646,
37650,
37696,
37712,
37715,
37728,
37731,
37760,
37764,
37839,
37863,
37866,
37878,
37881,
37942,
37946,
37947,
38007,
38012,
38079,
38082,
38148,
38212,
38226,
38229,
38242,
38245,
38272,
38275,
38339,
38392,
38396,
38397,
38423,
38450,
38454,
38467,
38471,
38531,
38557,
38584,
38588,
38591,
38595,
38661,
38687,
38714,
38722,
38796,
38828,
38854,
38881,
38893,
38896,
38909,
38912,
38920,
38954,
38980,
39006,
39033,
39062,
39065,
39077,
39080,
39136,
39174,
39177,
39182,
39246,
39272,
39299,
39309,
39325,
39328,
39378,
39449,
39484,
39487,
39548,
39596,
39615,
39618,
39677,
39729,
39782,
39808,
39835,
39840,
39843,
39853,
39915,
39954,
39980,
40007,
40012,
40015,
40025,
40094,
40142,
40168,
40195,
40205,
40209,
40210,
40236,
40263,
40363,
40376,
40436,
40439,
40492,
40495,
40508,
40511,
40545,
40569,
40572,
40584,
40587,
40648,
40678,
40681,
40739,
40798,
40853,
40857,
40858,
40868,
40886,
40887,
40892
],
"line_end_idx": [
18,
30,
32,
35,
55,
76,
78,
137,
175,
179,
252,
326,
395,
399,
478,
558,
629,
705,
778,
853,
932,
945,
949,
950,
956,
978,
1002,
1017,
1018,
1023,
1036,
1042,
1043,
1049,
1071,
1094,
1097,
1098,
1121,
1145,
1148,
1174,
1180,
1209,
1232,
1235,
1236,
1242,
1263,
1264,
1273,
1276,
1301,
1304,
1307,
1387,
1411,
1484,
1563,
1638,
1691,
1694,
1773,
1808,
1811,
1814,
1877,
1883,
1947,
1950,
1953,
2024,
2047,
2054,
2078,
2081,
2152,
2158,
2210,
2213,
2279,
2282,
2341,
2344,
2420,
2495,
2569,
2599,
2602,
2664,
2667,
2732,
2735,
2802,
2846,
2849,
2925,
3004,
3076,
3151,
3227,
3254,
3257,
3260,
3304,
3334,
3350,
3401,
3431,
3501,
3519,
3564,
3567,
3570,
3579,
3582,
3597,
3668,
3736,
3798,
3802,
3803,
3818,
3854,
3890,
3926,
3962,
3998,
4018,
4039,
4045,
4081,
4117,
4120,
4121,
4141,
4162,
4165,
4220,
4224,
4225,
4245,
4266,
4278,
4335,
4336,
4386,
4409,
4433,
4437,
4509,
4532,
4556,
4560,
4561,
4584,
4608,
4624,
4627,
4703,
4774,
4778,
4801,
4825,
4829,
4856,
4879,
4903,
4907,
4938,
4961,
4985,
5001,
5033,
5063,
5096,
5130,
5134,
5162,
5166,
5167,
5199,
5232,
5268,
5310,
5352,
5394,
5436,
5437,
5438,
5442,
5445,
5473,
5502,
5506,
5550,
5566,
5570,
5617,
5669,
5719,
5742,
5766,
5774,
5775,
5778,
5801,
5825,
5829,
5907,
5930,
5954,
5958,
5962,
5985,
6009,
6021,
6081,
6139,
6190,
6213,
6237,
6241,
6242,
6265,
6289,
6309,
6312,
6345,
6349,
6415,
6416,
6439,
6463,
6471,
6515,
6516,
6536,
6557,
6561,
6582,
6605,
6629,
6633,
6662,
6685,
6709,
6713,
6736,
6740,
6741,
6745,
6768,
6791,
6815,
6827,
6850,
6873,
6897,
6920,
6944,
6948,
6976,
6999,
7023,
7027,
7028,
7032,
7056,
7079,
7103,
7107,
7148,
7171,
7195,
7203,
7204,
7234,
7257,
7281,
7289,
7334,
7381,
7401,
7422,
7426,
7456,
7464,
7495,
7529,
7533,
7534,
7557,
7581,
7585,
7600,
7623,
7647,
7651,
7685,
7689,
7728,
7748,
7769,
7777,
7808,
7841,
7845,
7883,
7891,
7925,
7963,
7967,
7968,
7972,
8002,
8006,
8062,
8066,
8067,
8071,
8102,
8125,
8149,
8153,
8177,
8181,
8182,
8205,
8229,
8233,
8259,
8271,
8305,
8338,
8339,
8343,
8374,
8382,
8410,
8411,
8434,
8458,
8466,
8500,
8538,
8550,
8551,
8586,
8628,
8640,
8641,
8668,
8700,
8704,
8735,
8743,
8779,
8820,
8824,
8857,
8861,
8886,
8894,
8912,
8913,
8917,
8948,
8960,
8989,
9016,
9046,
9072,
9099,
9103,
9133,
9153,
9174,
9178,
9181,
9185,
9186,
9210,
9215,
9230,
9236,
9237,
9257,
9258,
9262,
9275,
9279,
9359,
9379,
9400,
9404,
9410,
9414,
9417,
9440,
9464,
9468,
9493,
9497,
9500,
9523,
9547,
9551,
9622,
9645,
9669,
9673,
9751,
9774,
9798,
9810,
9813,
9826,
9863,
9867,
9870,
9893,
9917,
9921,
9963,
9986,
10010,
10014,
10017,
10045,
10052,
10081,
10089,
10143,
10172,
10195,
10219,
10227,
10230,
10242,
10265,
10289,
10293,
10358,
10381,
10405,
10417,
10431,
10434,
10446,
10454,
10490,
10519,
10527,
10531,
10532,
10555,
10579,
10583,
10588,
10608,
10629,
10633,
10693,
10716,
10740,
10764,
10767,
10844,
10917,
10990,
11033,
11036,
11059,
11083,
11095,
11165,
11220,
11223,
11243,
11264,
11272,
11330,
11333,
11356,
11380,
11392,
11405,
11408,
11427,
11447,
11468,
11476,
11479,
11546,
11569,
11593,
11597,
11601,
11624,
11648,
11652,
11653,
11676,
11700,
11704,
11709,
11732,
11756,
11760,
11803,
11826,
11850,
11854,
11857,
11880,
11904,
11920,
11957,
11960,
11973,
11976,
11999,
12023,
12027,
12047,
12070,
12094,
12102,
12105,
12117,
12140,
12164,
12168,
12187,
12210,
12234,
12242,
12246,
12247,
12267,
12280,
12349,
12378,
12413,
12441,
12469,
12470,
12483,
12535,
12568,
12596,
12630,
12657,
12661,
12664,
12672,
12741,
12771,
13051,
13054,
13064,
13133,
13157,
13217,
13285,
13313,
13316,
13329,
13332,
13361,
13364,
13395,
13398,
13437,
13440,
13452,
13455,
13484,
13487,
13535,
13538,
13581,
13584,
13596,
13599,
13616,
13633,
13649,
13652,
13722,
13725,
13726,
13739,
13802,
13860,
13888,
13891,
13962,
13965,
13975,
14044,
14068,
14128,
14196,
14224,
14227,
14240,
14243,
14272,
14275,
14306,
14309,
14321,
14324,
14353,
14356,
14404,
14407,
14450,
14453,
14465,
14468,
14485,
14502,
14518,
14521,
14591,
14594,
14595,
14599,
14612,
14620,
14680,
14715,
14738,
14762,
14766,
14769,
14792,
14816,
14832,
14907,
14923,
14926,
14994,
15020,
15047,
15051,
15114,
15137,
15161,
15165,
15168,
15216,
15291,
15367,
15445,
15502,
15575,
15647,
15706,
15762,
15765,
15837,
15866,
15869,
15892,
15916,
15924,
15997,
16073,
16077,
16156,
16179,
16203,
16223,
16253,
16256,
16269,
16288,
16291,
16314,
16338,
16342,
16386,
16409,
16433,
16449,
16452,
16464,
16504,
16507,
16530,
16554,
16562,
16635,
16661,
16684,
16708,
16716,
16719,
16731,
16739,
16772,
16804,
16827,
16851,
16855,
16918,
16941,
16965,
16973,
17032,
17069,
17092,
17116,
17124,
17128,
17129,
17133,
17146,
17169,
17193,
17197,
17264,
17287,
17311,
17315,
17318,
17341,
17365,
17373,
17450,
17466,
17489,
17513,
17517,
17520,
17548,
17577,
17581,
17659,
17682,
17706,
17714,
17728,
17731,
17754,
17778,
17782,
17795,
17818,
17842,
17850,
17853,
17872,
17876,
17879,
17902,
17926,
17946,
17982,
17985,
18002,
18005,
18049,
18053,
18056,
18079,
18103,
18107,
18119,
18127,
18160,
18208,
18231,
18255,
18259,
18308,
18331,
18355,
18363,
18367,
18368,
18372,
18385,
18397,
18471,
18474,
18542,
18546,
18610,
18614,
18617,
18640,
18664,
18680,
18749,
18807,
18845,
18848,
18884,
18897,
18900,
18919,
18922,
18963,
18966,
18985,
18988,
19000,
19008,
19053,
19087,
19095,
19099,
19100,
19104,
19117,
19121,
19188,
19211,
19235,
19239,
19242,
19265,
19289,
19301,
19370,
19391,
19394,
19417,
19441,
19461,
19507,
19510,
19523,
19526,
19545,
19568,
19592,
19596,
19599,
19607,
19648,
19651,
19674,
19698,
19702,
19714,
19722,
19756,
19814,
19837,
19861,
19869,
19873,
19874,
19878,
19883,
19906,
19930,
19938,
20005,
20008,
20031,
20055,
20067,
20136,
20157,
20160,
20183,
20207,
20231,
20306,
20309,
20322,
20325,
20344,
20347,
20355,
20426,
20477,
20481,
20484,
20488,
20529,
20552,
20576,
20584,
20588,
20589,
20593,
20606,
20610,
20679,
20702,
20726,
20730,
20758,
20781,
20805,
20809,
20812,
20835,
20859,
20867,
20934,
20967,
20990,
21014,
21022,
21025,
21038,
21061,
21085,
21097,
21116,
21119,
21152,
21175,
21199,
21203,
21206,
21214,
21255,
21258,
21281,
21305,
21309,
21321,
21325,
21386,
21409,
21433,
21437,
21480,
21484,
21544,
21567,
21591,
21603,
21635,
21698,
21747,
21770,
21794,
21802,
21806,
21807,
21867,
21872,
21940,
21943,
22003,
22031,
22034,
22047,
22050,
22079,
22082,
22123,
22126,
22199,
22203,
22204,
22208,
22221,
22225,
22268,
22291,
22315,
22319,
22322,
22345,
22369,
22401,
22471,
22548,
22621,
22624,
22637,
22640,
22669,
22672,
22680,
22721,
22724,
22747,
22771,
22775,
22787,
22791,
22825,
22848,
22872,
22880,
22884,
22893,
22913,
22934,
22990,
22995,
23040,
23043,
23098,
23101,
23111,
23114,
23187,
23235,
23238,
23251,
23254,
23305,
23309,
23332,
23356,
23360,
23361,
23365,
23378,
23401,
23425,
23441,
23507,
23510,
23584,
23587,
23610,
23634,
23638,
23710,
23714,
23775,
23798,
23822,
23826,
23829,
23852,
23876,
23904,
23917,
23920,
23942,
23945,
23978,
23981,
23993,
24001,
24035,
24082,
24105,
24129,
24137,
24141,
24142,
24146,
24159,
24182,
24206,
24250,
24315,
24318,
24390,
24410,
24413,
24426,
24429,
24451,
24454,
24487,
24490,
24513,
24537,
24541,
24607,
24611,
24648,
24671,
24695,
24699,
24702,
24725,
24749,
24753,
24765,
24773,
24807,
24854,
24877,
24901,
24909,
24913,
24914,
24937,
24961,
24965,
24970,
24993,
25017,
25041,
25108,
25131,
25134,
25206,
25235,
25238,
25261,
25285,
25297,
25371,
25444,
25447,
25470,
25494,
25526,
25539,
25542,
25561,
25564,
25606,
25609,
25642,
25645,
25668,
25692,
25700,
25766,
25831,
25835,
25853,
25876,
25900,
25908,
25912,
25913,
25917,
25930,
25953,
25977,
25985,
26049,
26098,
26118,
26139,
26147,
26202,
26237,
26260,
26284,
26288,
26291,
26314,
26338,
26346,
26419,
26491,
26511,
26532,
26536,
26604,
26627,
26651,
26675,
26678,
26691,
26710,
26713,
26746,
26749,
26772,
26796,
26804,
26876,
26925,
26948,
26972,
26984,
26987,
27056,
27125,
27148,
27172,
27176,
27248,
27271,
27295,
27319,
27322,
27351,
27354,
27381,
27384,
27396,
27400,
27434,
27457,
27481,
27485,
27544,
27548,
27606,
27629,
27653,
27657,
27681,
27704,
27728,
27736,
27740,
27741,
27745,
27758,
27806,
27867,
27926,
27929,
28002,
28048,
28051,
28064,
28124,
28127,
28181,
28184,
28196,
28204,
28238,
28293,
28301,
28305,
28306,
28329,
28353,
28369,
28374,
28433,
28467,
28500,
28523,
28547,
28555,
28558,
28602,
28625,
28649,
28669,
28672,
28685,
28688,
28707,
28710,
28733,
28757,
28761,
28812,
28835,
28859,
28871,
28874,
28916,
28919,
28942,
28966,
28970,
29010,
29033,
29057,
29065,
29069,
29070,
29093,
29117,
29129,
29134,
29192,
29222,
29245,
29269,
29281,
29284,
29323,
29326,
29349,
29373,
29381,
29458,
29475,
29498,
29522,
29554,
29557,
29570,
29573,
29621,
29624,
29651,
29654,
29687,
29710,
29734,
29738,
29742,
29746,
29747,
29779,
29782,
29803,
29806,
29879,
29949,
30004,
30008,
30009,
30013,
30026,
30038,
30102,
30105,
30176,
30188,
30261,
30333,
30399,
30435,
30438,
30500,
30503,
30516,
30542,
30545,
30578,
30581,
30593,
30601,
30635,
30683,
30691,
30695,
30696,
30700,
30713,
30761,
30827,
30830,
30902,
30977,
31049,
31052,
31065,
31091,
31094,
31127,
31130,
31142,
31150,
31184,
31232,
31240,
31244,
31245,
31249,
31262,
31310,
31382,
31385,
31460,
31535,
31610,
31613,
31626,
31652,
31655,
31688,
31691,
31703,
31711,
31745,
31793,
31801,
31805,
31806,
31810,
31823,
31871,
31945,
31948,
32024,
32099,
32175,
32178,
32191,
32217,
32220,
32253,
32256,
32268,
32276,
32310,
32358,
32606,
32610,
32611,
32616,
32680,
32683,
32742,
32745,
32758,
32784,
32787,
32840,
32869,
32872,
32884,
32901,
32905,
32906,
32911,
32977,
32980,
33041,
33044,
33057,
33083,
33086,
33140,
33170,
33173,
33185,
33202,
33206,
33207,
33212,
33284,
33287,
33354,
33357,
33370,
33396,
33399,
33456,
33489,
33492,
33504,
33521,
33525,
33526,
33531,
33605,
33608,
33677,
33680,
33693,
33719,
33722,
33780,
33814,
33817,
33829,
33846,
33850,
33851,
33855,
33868,
33891,
33915,
33987,
34054,
34086,
34089,
34161,
34237,
34240,
34253,
34256,
34274,
34277,
34289,
34292,
34332,
34335,
34384,
34387,
34399,
34402,
34406,
34440,
34463,
34487,
34491,
34494,
34498,
34568,
34591,
34615,
34623,
34627,
34628,
34632,
34645,
34665,
34686,
34710,
34786,
34789,
34840,
34843,
34856,
34859,
34879,
34887,
34908,
34912,
34983,
35003,
35024,
35040,
35044,
35056,
35059,
35132,
35152,
35220,
35292,
35363,
35436,
35462,
35482,
35503,
35515,
35518,
35530,
35533,
35537,
35571,
35591,
35612,
35616,
35619,
35639,
35660,
35688,
35747,
35800,
35843,
35893,
35938,
35990,
36020,
36040,
36061,
36069,
36073,
36074,
36094,
36102,
36123,
36179,
36196,
36236,
36239,
36272,
36275,
36288,
36291,
36320,
36323,
36335,
36338,
36396,
36400,
36401,
36405,
36418,
36438,
36446,
36467,
36543,
36604,
36607,
36640,
36643,
36656,
36659,
36710,
36782,
36795,
36798,
36830,
36833,
36845,
36848,
36915,
36926,
36929,
36941,
36944,
36948,
36982,
37002,
37010,
37031,
37035,
37038,
37042,
37101,
37121,
37129,
37150,
37158,
37162,
37163,
37227,
37244,
37305,
37308,
37352,
37355,
37368,
37371,
37400,
37475,
37478,
37490,
37493,
37552,
37556,
37557,
37574,
37578,
37639,
37643,
37646,
37650,
37696,
37712,
37715,
37728,
37731,
37760,
37764,
37839,
37863,
37866,
37878,
37881,
37942,
37946,
37947,
38007,
38012,
38079,
38082,
38148,
38212,
38226,
38229,
38242,
38245,
38272,
38275,
38339,
38392,
38396,
38397,
38423,
38450,
38454,
38467,
38471,
38531,
38557,
38584,
38588,
38591,
38595,
38661,
38687,
38714,
38722,
38796,
38828,
38854,
38881,
38893,
38896,
38909,
38912,
38920,
38954,
38980,
39006,
39033,
39062,
39065,
39077,
39080,
39136,
39174,
39177,
39182,
39246,
39272,
39299,
39309,
39325,
39328,
39378,
39449,
39484,
39487,
39548,
39596,
39615,
39618,
39677,
39729,
39782,
39808,
39835,
39840,
39843,
39853,
39915,
39954,
39980,
40007,
40012,
40015,
40025,
40094,
40142,
40168,
40195,
40205,
40209,
40210,
40236,
40263,
40363,
40376,
40436,
40439,
40492,
40495,
40508,
40511,
40545,
40569,
40572,
40584,
40587,
40648,
40678,
40681,
40739,
40798,
40853,
40857,
40858,
40868,
40886,
40887,
40892,
40918
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 40918,
"ccnet_original_nlines": 1767,
"rps_doc_curly_bracket": 0.00004887999966740608,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18883639574050903,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.037916459143161774,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4103679656982422,
"rps_doc_frac_unique_words": 0.3226214051246643,
"rps_doc_mean_word_length": 5.359631538391113,
"rps_doc_num_sentences": 250,
"rps_doc_symbol_to_word_ratio": 0.004724020138382912,
"rps_doc_unigram_entropy": 6.020173072814941,
"rps_doc_word_count": 5539,
"rps_doc_frac_chars_dupe_10grams": 0.11284401267766953,
"rps_doc_frac_chars_dupe_5grams": 0.42432716488838196,
"rps_doc_frac_chars_dupe_6grams": 0.40196046233177185,
"rps_doc_frac_chars_dupe_7grams": 0.2518947720527649,
"rps_doc_frac_chars_dupe_8grams": 0.16492067277431488,
"rps_doc_frac_chars_dupe_9grams": 0.14440664649009705,
"rps_doc_frac_chars_top_2gram": 0.062182098627090454,
"rps_doc_frac_chars_top_3gram": 0.09088152647018433,
"rps_doc_frac_chars_top_4gram": 0.1234883964061737,
"rps_doc_books_importance": -2117.45849609375,
"rps_doc_books_importance_length_correction": -2117.45849609375,
"rps_doc_openwebtext_importance": -1233.3199462890625,
"rps_doc_openwebtext_importance_length_correction": -1233.3199462890625,
"rps_doc_wikipedia_importance": -648.994873046875,
"rps_doc_wikipedia_importance_length_correction": -648.994873046875
},
"fasttext": {
"dclm": 0.7303354740142822,
"english": 0.6197240948677063,
"fineweb_edu_approx": 0.5937795639038086,
"eai_general_math": 0.03107142075896263,
"eai_open_web_math": 0.624453604221344,
"eai_web_code": 0.001671429956331849
}
}
|
{
"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": "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": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,407,265,516,293,552,000
|
Ask Your Question
0
How come abs(x) works?
asked 2012-06-12 14:36:56 -0500
Eviatar Bach gravatar image
updated 2012-06-12 14:37:21 -0500
Hello,
I notice that abs is a Python built-in function, but it also works symbolically:
sage: abs(x)
abs(x)
sage: bool(abs(x) == abs_symbolic(x))
True
sage: preparse('abs(x)')
'abs(x)'
What's going on here? Obviously the Python function should not accept a Sage type.
edit retag flag offensive close merge delete
1 answer
Sort by » oldest newest most voted
3
answered 2012-06-12 16:23:50 -0500
DSM gravatar image
updated 2012-06-12 16:23:59 -0500
Obviously the Python function should not accept a Sage type.
Why not? Python's abs calls __abs__, if it exists:
>>> class NotABuiltinClass(object):
... def __abs__(self):
... return 'fred'
...
>>> a = NotABuiltinClass()
>>> abs(a)
'fred'
The wonders of duck typing. :-)
edit flag offensive delete link more
Comments
You're like a Python tutorial waiting to happen, @DSM!
kcrisman gravatar imagekcrisman ( 2012-06-12 17:00:52 -0500 )edit
You forgot to include a doctest in your code here, very careless...
kcrisman gravatar imagekcrisman ( 2012-06-12 17:01:24 -0500 )edit
Ah, I see. I forgot about the existence of `__abs__`.
Eviatar Bach gravatar imageEviatar Bach ( 2012-06-12 17:20:47 -0500 )edit
Your Answer
Please start posting anonymously - your entry will be published after you log in or create a new account.
Add Answer
Question Tools
Stats
Asked: 2012-06-12 14:36:56 -0500
Seen: 354 times
Last updated: Jun 12 '12
|
{
"url": "https://ask.sagemath.org/question/9023/how-come-absx-works/",
"source_domain": "ask.sagemath.org",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "58262",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F7YXHQLMCOBLNHUMXWEAVTP5443TKKPO",
"WARC-Concurrent-To": "<urn:uuid:8febe500-f7b5-4302-acbb-c3693901adc0>",
"WARC-Date": "2020-10-29T17:44:45Z",
"WARC-IP-Address": "140.254.118.68",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:IRQADKN5SDPF3IJLXFCJBBDGEZ6PDGDO",
"WARC-Record-ID": "<urn:uuid:dab8bc0f-0ebb-4132-a1b0-c1e75320a8c0>",
"WARC-Target-URI": "https://ask.sagemath.org/question/9023/how-come-absx-works/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:60a009eb-206e-4b4b-a459-c19c047fd839>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-241.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,
18,
20,
21,
44,
45,
77,
78,
106,
107,
141,
142,
149,
150,
231,
232,
245,
252,
290,
295,
320,
329,
330,
413,
414,
459,
460,
469,
470,
505,
507,
508,
543,
544,
563,
564,
598,
599,
660,
661,
712,
713,
749,
776,
802,
807,
834,
845,
852,
853,
885,
886,
923,
924,
933,
934,
989,
990,
1056,
1057,
1125,
1126,
1192,
1193,
1247,
1248,
1322,
1323,
1335,
1336,
1442,
1443,
1454,
1455,
1470,
1471,
1477,
1478,
1511,
1512,
1528,
1529
],
"line_end_idx": [
18,
20,
21,
44,
45,
77,
78,
106,
107,
141,
142,
149,
150,
231,
232,
245,
252,
290,
295,
320,
329,
330,
413,
414,
459,
460,
469,
470,
505,
507,
508,
543,
544,
563,
564,
598,
599,
660,
661,
712,
713,
749,
776,
802,
807,
834,
845,
852,
853,
885,
886,
923,
924,
933,
934,
989,
990,
1056,
1057,
1125,
1126,
1192,
1193,
1247,
1248,
1322,
1323,
1335,
1336,
1442,
1443,
1454,
1455,
1470,
1471,
1477,
1478,
1511,
1512,
1528,
1529,
1553
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1553,
"ccnet_original_nlines": 81,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.15926893055438995,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013054830022156239,
"rps_doc_frac_lines_end_with_ellipsis": 0.024390239268541336,
"rps_doc_frac_no_alph_words": 0.4673629105091095,
"rps_doc_frac_unique_words": 0.6164383888244629,
"rps_doc_mean_word_length": 5.114155292510986,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0.010443859733641148,
"rps_doc_unigram_entropy": 4.689563751220703,
"rps_doc_word_count": 219,
"rps_doc_frac_chars_dupe_10grams": 0.089285708963871,
"rps_doc_frac_chars_dupe_5grams": 0.089285708963871,
"rps_doc_frac_chars_dupe_6grams": 0.089285708963871,
"rps_doc_frac_chars_dupe_7grams": 0.089285708963871,
"rps_doc_frac_chars_dupe_8grams": 0.089285708963871,
"rps_doc_frac_chars_dupe_9grams": 0.089285708963871,
"rps_doc_frac_chars_top_2gram": 0.02142857015132904,
"rps_doc_frac_chars_top_3gram": 0.03392856940627098,
"rps_doc_frac_chars_top_4gram": 0.04107142984867096,
"rps_doc_books_importance": -146.78475952148438,
"rps_doc_books_importance_length_correction": -134.55857849121094,
"rps_doc_openwebtext_importance": -82.470703125,
"rps_doc_openwebtext_importance_length_correction": -82.470703125,
"rps_doc_wikipedia_importance": -46.40872573852539,
"rps_doc_wikipedia_importance_length_correction": -32.7874755859375
},
"fasttext": {
"dclm": 0.34590792655944824,
"english": 0.7230235934257507,
"fineweb_edu_approx": 1.647057056427002,
"eai_general_math": 0.009057760238647461,
"eai_open_web_math": 0.013465880416333675,
"eai_web_code": 0.00013077000039629638
}
}
|
{
"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": "512.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-61,705,552,512,368,740
|
Categories
Phones
How to Choose the Best Smartphone
Purchasing a smartphone can be challenging, especially if it’s your first phone. With so many options available in the market today, one may be overwhelmed with what to choose. It’s thus important to have some background information on what to look for in an excellent smartphone. In the last few years, smartphones, the demand for smartphones has increased due to a number of convenient features in these phones. Let’s consider some vital aspects when buying a smartphone.
Evaluate Your Needs
phone
Before purchasing a smartphone, you need to decide what you what. How big should the screen be? What about battery life? Should you choose a single SIM or a dual SIM? What about storage space? Once you’ve evaluated your needs, you are ready to purchase a phone that meets your needs. You can make the work easier by drafting a list of the features that you want in the ideal smartphone then use the list to compared different brands in the market.
Operating System
Just like a computer, your smartphone will require an operating system. Android and iOS are the main commonly used operating systems in smartphones. Apple smartphones …
Categories
Cloud Computing
Benefits of Cloud Computing
Cloud computing has many benefits for businesses. This technology enables you to set up a virtual office and be able to cones to your business no matter where you are. The increase of web-enable devices such as tablets and smartphones has made access to data easy and practical. Moving your business to the cloud comes with numerous benefits that include.
It Is Flexible
Cloud computing offers flexibility, whereby it can be turned on or off depending on the user’s circumstances. For example, when sales promotion becomes more popular, its capacity and be increased immediately to crashing the servers or losing the sales.
cloud computing service
When the promotion is over, the capacity can then be reduced to minimize costs. Employees of one company can work form different locations yet be able to access the same data/information no matter where they are in the globe. For example, workers can use their smartphones or tablets to access company information in the field, in the retail store, when visiting customers, in their homes or offices, or even in conferences and seminars.
Affordability
Cloud computing saves both space and time; since you don’t have to hire technicians …
|
{
"url": "https://www.mygrouptour.com/",
"source_domain": "www.mygrouptour.com",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "37391",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IFNU37LQSB4M7I56LOAINCIKTC4YXNU3",
"WARC-Concurrent-To": "<urn:uuid:0c91c0a0-7ae1-4777-bed9-f057a0931906>",
"WARC-Date": "2019-12-06T03:01:04Z",
"WARC-IP-Address": "104.31.70.100",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CR3K7U6HUW7VCVVSDCUXLJFERAKGPYAQ",
"WARC-Record-ID": "<urn:uuid:bef0952f-6140-427b-8233-654d8991b674>",
"WARC-Target-URI": "https://www.mygrouptour.com/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:51519f3a-21b6-40d3-8d82-455c88b23403>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-159.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
11,
18,
19,
53,
54,
528,
529,
549,
550,
556,
557,
1005,
1006,
1023,
1024,
1193,
1194,
1205,
1221,
1222,
1250,
1251,
1607,
1608,
1623,
1624,
1877,
1878,
1902,
1903,
2341,
2342,
2356,
2357
],
"line_end_idx": [
11,
18,
19,
53,
54,
528,
529,
549,
550,
556,
557,
1005,
1006,
1023,
1024,
1193,
1194,
1205,
1221,
1222,
1250,
1251,
1607,
1608,
1623,
1624,
1877,
1878,
1902,
1903,
2341,
2342,
2356,
2357,
2442
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2442,
"ccnet_original_nlines": 34,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44956138730049133,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0043859598226845264,
"rps_doc_frac_lines_end_with_ellipsis": 0.05714286118745804,
"rps_doc_frac_no_alph_words": 0.10964912176132202,
"rps_doc_frac_unique_words": 0.512499988079071,
"rps_doc_mean_word_length": 4.962500095367432,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0.0043859598226845264,
"rps_doc_unigram_entropy": 4.912135124206543,
"rps_doc_word_count": 400,
"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.017632240429520607,
"rps_doc_frac_chars_top_3gram": 0.021158689633011818,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -150.06158447265625,
"rps_doc_books_importance_length_correction": -150.06158447265625,
"rps_doc_openwebtext_importance": -94.49862670898438,
"rps_doc_openwebtext_importance_length_correction": -94.49862670898438,
"rps_doc_wikipedia_importance": -70.95428466796875,
"rps_doc_wikipedia_importance_length_correction": -70.95428466796875
},
"fasttext": {
"dclm": 0.026627780869603157,
"english": 0.9186689257621765,
"fineweb_edu_approx": 1.94478440284729,
"eai_general_math": 0.03189295902848244,
"eai_open_web_math": 0.11323893070220947,
"eai_web_code": 0.004221320152282715
}
}
|
{
"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": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,342,384,703,063,521,000
|
专业提供：服务器安全，网站安全，服务器环境配置，网站搬家迁移，私有云搭建
商品分类
KubeSphere安装部署
KubeSphere安装部署
Kubesphere简介
KubeSphere是在 Kubernetes 之上构建的企业级分布式多租户容器管理平台，提供简单易用的操作界面以及向导式操作方式，在降低用户使用容器调度平台学习成本的同时，极大减轻开发、测试、运维的日常工作的复杂度，旨在解决 Kubernetes 本身存在的存储、网络、安全和易用性等痛点。除此之外，平台已经整合并优化了多个适用于容器场景的功能模块，以完整的解决方案帮助企业轻松应对敏捷开发与自动化运维、微服务治理、多租户管理、工作负载和集群管理、服务与网络管理、应用编排与管理、镜像仓库管理和存储管理等业务场景。
1.1 产品功能
KubeSphere 为用户提供了一个具备极致体验的 Web 控制台，让您能够像使用任何其他互联网产品一样，快速上手各项功能与服务。KubeSphere 目前集成了应用负载、服务与网络、应用管理、资源管理和平台管理共五大模块，以下从专业的角度为您详解各个模块的功能服务：
KubeSphere安装部署
1.2 部署模式
KubeSphere 部署支持 all-in-one multi-node 两种部署模式， KubeSphere Installer 采用 Ansible 对部署目标机器及部署流程进行集中化管理配置。采用预配置模板，可以在部署前通过对相关配置文件进行自定义实现对部署过程的预配置，以适应不同的 IT 环境，帮助您快速部署 KubeSphere。
• KubeSphere 集群中由于部署服务的不同，分为管理节点和计算节点两个角色。
• 当进行 all-in-one 模式进行单节点部署时，这个节点既是管理节点，也是计算节点。
• 当进行 multi-node 模式部署多节点集群时，可在配置文件中设置集群角色。
• 由于部署过程中需要更新操作系统和从镜像仓库拉取镜像，因此必须能够访问外网。无外网环境需先下载离线安装包安装。
• 如果是新装系统，在 Software Selection 界面需要把 OpenSSH Server 选上。
2 部署
2.1 环境准备
• 集群现有的可用内存至少在 10G 以上
# kubectl version | grep Server
Server Version: version.Info{Major:”1″, Minor:”15″, GitVersion:”v1.15.3″, GitCommit:”2d3c76f9091b6bec110a5e63777c332469e0cba2″, GitTreeState:”clean”, BuildDate:”2019-08-19T11:05:50Z”, GoVersion:”go1.12.9″, Compiler:”gc”, Platform:”linux/amd64″}
# helm version
Client: &version.Version{SemVer:”v2.13.1″, GitCommit:”618447cbf203d147601b4b9bd7f8c37a5d39fbb4″, GitTreeState:”clean”}
Server: &version.Version{SemVer:”v2.13.1″, GitCommit:”618447cbf203d147601b4b9bd7f8c37a5d39fbb4″, GitTreeState:”clean”}
2.1.1 创建StorageClass
首先需要确保集群中有一个默认的 StorageClass 资源对象，关于 StorageClass 的使用可以查看
kubernetes(14)：k8s基于NFS部署storageclass实现pv自动供给
KubeSphere安装部署
其中 annotations 下面的 storageclass.kubernetes.io/is-default-class: “true” 是必须的：
KubeSphere安装部署
2.2 清理环境
建议先停止已经安装的prometheus/gitlab/Jenkins/sonarqube/harbor/ metrics_server/node-exporter/ Dashboard会有冲突
2.3 安装
2.3.1 创建命名空间
首先，在集群中创建名为 kubesphere-system 和 kubesphere-monitoring-system 的namespace：
KubeSphere安装部署
2.3.2 创建集群ca证书secret
注：按照当前集群 ca.crt 和 ca.key 证书路径创建（kubeadm 创建集群的证书路径一般为/etc/kubernetes/pki）
KubeSphere安装部署
2.3.3 创建etcd证书secret
注：以集群实际 etcd 证书位置创建；若 etcd 没有配置证书，则创建空secret
KubeSphere安装部署
KubeSphere安装部署
从这里我们也可以获得 etcd 集群相关的证书。
2.3.4 下载代码
KubeSphere安装部署
2.3.5 在Kubernetes 集群部署 KubeSphere。
版本不一部署方式也不一样，我这里是通过配置文件确定部署模块的，把Jenkins、gitlab、harbor、sonarqube、监控一堆都部署上
修改cat config.yaml 文件
KubeSphere安装部署
# cat config.yaml
apiVersion: v1
data:
ks-config.yaml: |
kubernetes:
apiserverAddr: 10.6.76.25:6443 # master addr or master’s lb addr
etcd:
endpointIps: 10.6.76.25
port: 2379
tlsEnable: True
persistence:
storageClass: “kubesphere-data”
common:
enableHA: True
mysqlVolumeSize: 20Gi
minioVolumeSize: 20Gi
etcdVolumeSize: 20Gi
openldapVolumeSize: 2Gi
redisVolumSize: 2Gi
metrics-server:
enabled: True
console:
enableMultiLogin: True # enable/disable multi login
port: 30880
replicas: 1
monitoring:
prometheusReplicas: 1
prometheusMemoryRequest: 400Mi
prometheusVolumeSize: 20Gi
grafana:
enabled: True
logging:
enabled: True
elasticsearchMasterReplica: 1
elasticsearchDataReplica: 1
elasticsearchVolumeSize: 20Gi
logMaxAge: 7
elkPrefix: logstash
containersLogMountedPath: “”
kibana:
enabled: True
openpitrix:
enabled: True
devops:
enabled: True
jenkinsMemoryLim: 2Gi
jenkinsMemoryReq: 1500Mi
jenkinsVolumeSize: 8Gi
jenkinsJavaOpts_Xms: 512m
jenkinsJavaOpts_Xmx: 512m
jenkinsJavaOpts_MaxRAM: 2g
sonarqube:
enabled: True
servicemesh:
enabled: True
notification:
enabled: True
alerting:
enabled: True
harbor:
enabled: True
domain: harbor.devops.kubesphere.local
gitlab:
enabled: True
domain: gitlab.devops.kubesphere.local
kind: ConfigMap
metadata:
name: ks-installer
namespace: kubesphere-system
cat config.yaml
KubeSphere安装部署
2.3.6 查看部署日志
#这个不同版本也不一样，实在不行就直接 kubectl -n kubesphere-system logs -f 部署的pod
KubeSphere安装部署
2.3.7 所需镜像
注意查看失败的pod信息，如果有镜像不能正确拉取，可以通过ks-installer/scripts/download-docker-images.sh下载 或者根据提示失败的node上拉取
KubeSphere安装部署
3 登录使用kubesphere
3.1 登录
查看控制台的服务端口，使用 IP:30880 访问 KubeSphere UI 界面，默认的集群管理员账号为 admin/P@88w0rd
KubeSphere安装部署
KubeSphere安装部署
KubeSphere安装部署
3.2 prometheus监控
ks整合了prometheus监控，多种维度监控
KubeSphere安装部署
KubeSphere安装部署
KubeSphere安装部署
设置一个测试告警
配置起来非常方便
KubeSphere安装部署
KubeSphere安装部署
KubeSphere安装部署
邮件发送
KubeSphere安装部署
KubeSphere安装部署
3.3 Jenkins
Jenkins 是一款由 Java 开发的开源的持续集成工具，KubeSphere 内置的 Jenkins 服务端可参考如下步骤登录访问。
1、Jenkins Dashboard 服务暴露的端口 (NodePort) 默认为 30180，若在云平台部署 KubeSphere，则需要进行端口转发和添加防火墙规则，确保外网流量能够正常通过该端口。
2、然后访问公网 IP 和端口号即 http://${EIP}:${NODEPORT}，Jenkins 已对接了 KubeSphere 的 LDAP，因此可使用用户名 admin 和 KubeSphere 集群管理员的密码 (初始密码为 P@88w0rd) 登录 Jenkins Dashboard。
说明：若部署在私有环境，则可以在集群的任意节点通过 http://{$节点 IP}:30180 进行访问。
KubeSphere安装部署
3.4 sonarqube
SonarQube 是一个开源的代码分析软件，用来持续分析和检测代码的质量，支持检测 Java、C#、C、C++、JavaScript 等二十多种编程语言。通过 SonarQube 可以检测出项目中潜在的 Bug、漏洞、代码规范、重复代码、缺乏单元测试等问题，SonarQube 提供了 UI 界面进行查看和管理。KubeSphere 安装时默认内置了 SonarQube 服务，可参考如下步骤，访问内置 SonarQube。
KubeSphere安装部署
在浏览器中访问 SonarQube，初次登录的默认账号密码为 admin / admin
创建 SonarQube Token
KubeSphere安装部署
e7a66041f8920011049207b480cef50b54474c8a
KubeSphere安装部署
KubeSphere安装部署
KubeSphere安装部署
3.5 gitlab
在浏览器中可以通过 {$域名}:{$NodePort} 即 http://gitlab.devops.kubesphere.local:30080 访问 GitLab 登录页面。默认的 GitLab 用户名和密码为 admin / P@88w0rd
这个一定要域名解析啊
KubeSphere安装部署
KubeSphere安装部署
3.6 harbor
可以域名解析 http://harbor.devops.kubesphere.local:30280
输入默认的管理员用户名和密码 admin / Harbor12345 登录 Harbor。
其它用户登录的账号密码与 KubeSphere 的 LDAP 用户账户体系一致。
KubeSphere安装部署
3.7 elk日志中心
KubeSphere安装部署
KubeSphere安装部署
KubeSphere安装部署
3.8 kubectl控制台
相当于命令行
KubeSphere安装部署
KubeSphere安装部署
联系我们
联系我们
4006-130-160
在线咨询：点击这里给我发消息
邮件：leo@hs.com.cn
工作时间：周一至周五，9:30-18:30，节假日休息
关注微信
关注微信
分享本页
返回顶部
|
{
"url": "https://www.z8.com.cn/2398.html",
"source_domain": "www.z8.com.cn",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "83313",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YALCEODNB2KFWU6D2HLQPXN2T7DO6SGM",
"WARC-Concurrent-To": "<urn:uuid:f3fce3c4-a549-4b1d-af83-eaa477433b4e>",
"WARC-Date": "2022-11-27T05:35:53Z",
"WARC-IP-Address": "103.90.155.159",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PTIAFGUVGY6VFMTKII7UVSQC4KSMBC3T",
"WARC-Record-ID": "<urn:uuid:d9adf803-7a0c-4ae8-b2e1-4271bf2407b4>",
"WARC-Target-URI": "https://www.z8.com.cn/2398.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:50109282-16b4-4272-a70f-fba44873aa98>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-73\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,
37,
42,
43,
58,
59,
74,
75,
88,
89,
348,
349,
358,
359,
495,
496,
511,
512,
522,
523,
697,
698,
743,
792,
837,
896,
954,
955,
962,
963,
973,
974,
998,
999,
1031,
1276,
1277,
1292,
1411,
1530,
1531,
1552,
1553,
1611,
1612,
1658,
1659,
1674,
1675,
1752,
1753,
1768,
1769,
1779,
1780,
1878,
1879,
1881,
1882,
1890,
1891,
1904,
1905,
1978,
1979,
1994,
1995,
2016,
2017,
2090,
2091,
2106,
2107,
2128,
2129,
2174,
2175,
2190,
2191,
2206,
2207,
2232,
2233,
2244,
2245,
2260,
2261,
2298,
2299,
2372,
2373,
2394,
2395,
2410,
2411,
2429,
2430,
2445,
2451,
2469,
2470,
2482,
2547,
2548,
2554,
2578,
2589,
2605,
2606,
2619,
2651,
2652,
2660,
2675,
2697,
2719,
2740,
2764,
2784,
2785,
2801,
2815,
2816,
2825,
2877,
2889,
2901,
2902,
2914,
2936,
2967,
2994,
3003,
3017,
3018,
3027,
3041,
3071,
3099,
3129,
3142,
3162,
3191,
3199,
3213,
3214,
3226,
3240,
3241,
3249,
3263,
3285,
3310,
3333,
3359,
3385,
3412,
3423,
3437,
3438,
3451,
3465,
3466,
3480,
3494,
3495,
3505,
3519,
3520,
3528,
3542,
3581,
3589,
3603,
3642,
3643,
3659,
3669,
3688,
3717,
3718,
3734,
3735,
3750,
3751,
3766,
3767,
3831,
3832,
3847,
3848,
3861,
3862,
3957,
3958,
3973,
3974,
3976,
3977,
3996,
3997,
4005,
4006,
4076,
4077,
4092,
4093,
4108,
4109,
4124,
4125,
4127,
4128,
4146,
4147,
4172,
4173,
4188,
4189,
4204,
4205,
4220,
4221,
4230,
4231,
4240,
4241,
4256,
4257,
4272,
4273,
4288,
4289,
4294,
4295,
4310,
4311,
4326,
4327,
4340,
4341,
4411,
4412,
4515,
4516,
4667,
4668,
4722,
4723,
4738,
4739,
4753,
4754,
4968,
4969,
4984,
4985,
5030,
5031,
5050,
5051,
5066,
5067,
5108,
5109,
5124,
5125,
5140,
5141,
5156,
5157,
5168,
5169,
5294,
5295,
5306,
5307,
5322,
5323,
5338,
5339,
5350,
5351,
5402,
5403,
5449,
5450,
5491,
5492,
5507,
5508,
5520,
5521,
5536,
5537,
5552,
5553,
5568,
5569,
5584,
5585,
5592,
5593,
5608,
5609,
5624,
5625,
5627,
5628,
5630,
5631,
5633,
5634,
5636,
5637,
5642,
5643,
5648,
5649,
5662,
5663,
5678,
5679,
5696,
5697,
5725,
5726,
5731,
5736,
5741
],
"line_end_idx": [
37,
42,
43,
58,
59,
74,
75,
88,
89,
348,
349,
358,
359,
495,
496,
511,
512,
522,
523,
697,
698,
743,
792,
837,
896,
954,
955,
962,
963,
973,
974,
998,
999,
1031,
1276,
1277,
1292,
1411,
1530,
1531,
1552,
1553,
1611,
1612,
1658,
1659,
1674,
1675,
1752,
1753,
1768,
1769,
1779,
1780,
1878,
1879,
1881,
1882,
1890,
1891,
1904,
1905,
1978,
1979,
1994,
1995,
2016,
2017,
2090,
2091,
2106,
2107,
2128,
2129,
2174,
2175,
2190,
2191,
2206,
2207,
2232,
2233,
2244,
2245,
2260,
2261,
2298,
2299,
2372,
2373,
2394,
2395,
2410,
2411,
2429,
2430,
2445,
2451,
2469,
2470,
2482,
2547,
2548,
2554,
2578,
2589,
2605,
2606,
2619,
2651,
2652,
2660,
2675,
2697,
2719,
2740,
2764,
2784,
2785,
2801,
2815,
2816,
2825,
2877,
2889,
2901,
2902,
2914,
2936,
2967,
2994,
3003,
3017,
3018,
3027,
3041,
3071,
3099,
3129,
3142,
3162,
3191,
3199,
3213,
3214,
3226,
3240,
3241,
3249,
3263,
3285,
3310,
3333,
3359,
3385,
3412,
3423,
3437,
3438,
3451,
3465,
3466,
3480,
3494,
3495,
3505,
3519,
3520,
3528,
3542,
3581,
3589,
3603,
3642,
3643,
3659,
3669,
3688,
3717,
3718,
3734,
3735,
3750,
3751,
3766,
3767,
3831,
3832,
3847,
3848,
3861,
3862,
3957,
3958,
3973,
3974,
3976,
3977,
3996,
3997,
4005,
4006,
4076,
4077,
4092,
4093,
4108,
4109,
4124,
4125,
4127,
4128,
4146,
4147,
4172,
4173,
4188,
4189,
4204,
4205,
4220,
4221,
4230,
4231,
4240,
4241,
4256,
4257,
4272,
4273,
4288,
4289,
4294,
4295,
4310,
4311,
4326,
4327,
4340,
4341,
4411,
4412,
4515,
4516,
4667,
4668,
4722,
4723,
4738,
4739,
4753,
4754,
4968,
4969,
4984,
4985,
5030,
5031,
5050,
5051,
5066,
5067,
5108,
5109,
5124,
5125,
5140,
5141,
5156,
5157,
5168,
5169,
5294,
5295,
5306,
5307,
5322,
5323,
5338,
5339,
5350,
5351,
5402,
5403,
5449,
5450,
5491,
5492,
5507,
5508,
5520,
5521,
5536,
5537,
5552,
5553,
5568,
5569,
5584,
5585,
5592,
5593,
5608,
5609,
5624,
5625,
5627,
5628,
5630,
5631,
5633,
5634,
5636,
5637,
5642,
5643,
5648,
5649,
5662,
5663,
5678,
5679,
5696,
5697,
5725,
5726,
5731,
5736,
5741,
5745
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5745,
"ccnet_original_nlines": 329,
"rps_doc_curly_bracket": 0.0027850300539284945,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.013257579877972603,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017992420122027397,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6240530014038086,
"rps_doc_frac_unique_words": 0.682539701461792,
"rps_doc_mean_word_length": 10.956915855407715,
"rps_doc_num_sentences": 70,
"rps_doc_symbol_to_word_ratio": 0.006628789938986301,
"rps_doc_unigram_entropy": 5.292497158050537,
"rps_doc_word_count": 441,
"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.08692052960395813,
"rps_doc_frac_chars_top_3gram": 0.043460261076688766,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -298.4966735839844,
"rps_doc_books_importance_length_correction": -298.4966735839844,
"rps_doc_openwebtext_importance": -197.74072265625,
"rps_doc_openwebtext_importance_length_correction": -197.74072265625,
"rps_doc_wikipedia_importance": -139.71856689453125,
"rps_doc_wikipedia_importance_length_correction": -139.71856689453125
},
"fasttext": {
"dclm": 0.01908605918288231,
"english": 0.04424038901925087,
"fineweb_edu_approx": 1.4511481523513794,
"eai_general_math": 0.0014049999881535769,
"eai_open_web_math": 0.03903352841734886,
"eai_web_code": 0.36985349655151367
}
}
|
{
"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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
228,204,725,293,239,420
|
turbot/planetscale
GitHub
steampipe plugin install planetscalesteampipe plugin install planetscale
Table: planetscale_certificate
List certificates in your account.
Note:
• database_name must be specified in the where clause for all queries.
Examples
List all certificates for a database
select
*
from
planetscale_certificate
where
database_name = 'test'
List all certificates for all branches
select
c.*
from
planetscale_database as d
join planetscale_certificate as c on d.name = c.database_name
.inspect planetscale_certificate
Database Branches in the PlanetScale account.
NameTypeDescription
_ctxjsonbSteampipe context in JSON form, e.g. connection_name.
branch_nametextName of the database branch.
certificatetextCertificate string.
created_attimestamp with time zoneWhen the certificate was created.
database_nametextName of the database.
deleted_attimestamp with time zoneWhen the certificate was deleted.
idtextID of the certificate.
nametextName of the certificate.
organization_nametextName of the organization.
roletextRole for the certificate.
|
{
"url": "https://hub.steampipe.io/plugins/turbot/planetscale/tables/planetscale_certificate",
"source_domain": "hub.steampipe.io",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "72451",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QG2PH3OYQ5KTDUZCHL2FNJUCTFL3MSLV",
"WARC-Concurrent-To": "<urn:uuid:b30118a6-12b8-4533-9d26-44d55b141d35>",
"WARC-Date": "2023-09-23T18:47:55Z",
"WARC-IP-Address": "76.76.21.9",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KBCFIHT2TJJG5WDJZENZHTX5Z6DOFEBU",
"WARC-Record-ID": "<urn:uuid:93cecd59-b3a8-46b2-b1a9-22277d3c6111>",
"WARC-Target-URI": "https://hub.steampipe.io/plugins/turbot/planetscale/tables/planetscale_certificate",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ecc4e3a1-cd32-4151-9c44-23a43d548cb8>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-168\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,
19,
20,
27,
100,
101,
132,
133,
168,
169,
175,
176,
249,
250,
259,
260,
297,
298,
305,
307,
312,
336,
342,
365,
366,
405,
406,
413,
417,
422,
448,
510,
511,
544,
545,
591,
592,
612,
675,
719,
754,
822,
861,
929,
958,
991,
1038
],
"line_end_idx": [
19,
20,
27,
100,
101,
132,
133,
168,
169,
175,
176,
249,
250,
259,
260,
297,
298,
305,
307,
312,
336,
342,
365,
366,
405,
406,
413,
417,
422,
448,
510,
511,
544,
545,
591,
592,
612,
675,
719,
754,
822,
861,
929,
958,
991,
1038,
1071
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1071,
"ccnet_original_nlines": 46,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33552631735801697,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006578950211405754,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19078947603702545,
"rps_doc_frac_unique_words": 0.574999988079071,
"rps_doc_mean_word_length": 7.416666507720947,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.002223491668701,
"rps_doc_word_count": 120,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07415729761123657,
"rps_doc_frac_chars_dupe_6grams": 0.07415729761123657,
"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.028089890256524086,
"rps_doc_frac_chars_top_3gram": 0.04269662871956825,
"rps_doc_frac_chars_top_4gram": 0.049438200891017914,
"rps_doc_books_importance": -45.59427261352539,
"rps_doc_books_importance_length_correction": -45.59427261352539,
"rps_doc_openwebtext_importance": -21.301706314086914,
"rps_doc_openwebtext_importance_length_correction": -9.988601684570312,
"rps_doc_wikipedia_importance": -23.53353500366211,
"rps_doc_wikipedia_importance_length_correction": -23.53353500366211
},
"fasttext": {
"dclm": 0.10345202684402466,
"english": 0.7690877914428711,
"fineweb_edu_approx": 1.970401406288147,
"eai_general_math": 0.44151633977890015,
"eai_open_web_math": 0.22798043489456177,
"eai_web_code": 0.971735417842865
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
998,946,900,752,767,700
|
Living with A Pixel Slate
I’ve owned many tablets. My first tablet ran Windows 7 and was absymal. I recall my first Android tablet running Honeycomb, which didn’t really spark joy, as they say. The first tablet I ever liked was a Surface Pro 4, but I spilled some water on it and killed it. My last tablet, a Samsung TabPro running Windows 10 was my running favorite; it was the best of the Surface, but with USB-C and a thinner, lighter build. It was great at everything, except Windows kinda sucks at power management still, and Chrome was a slow resource hog.
Enter Pixel Slate, where Chrome is a first class citizen finally and if I live within it I can generally expect 10-15 hours of battery life. These are estimates I could only dream of on any Windows device, let alone a Surface. It’s power management is great, too. On a Surface, if you leave the thing lying around for a week you can expect it to be dead unless you configure it to go into hybernation. Even then, it takes minutes to boot and oftentimes doesn’t even work. If you want to try and save the battery if you pick it up and put it down alot, there’s really no good configuration. With the Slate, where there is no configuration for this at all, it just naturally acts like it’s always on and hasn’t been a problem. You can walk away from it for a week, come back and see it’s at 70% (which is like 8-9 hours).
google-pixel-slate1-e1539100511462.png
I’ve had the Slate for a couple of months now, but when I was considering it there really wasn’t a lot of press on it. The famous MKBHD video destorying the Celeron version was out, and many other review videos on specifically the Celeron version. By the time I worked up the nerve to buy one, Best Buy was only selling the m3 model. So I picked one up, and it was perfectly fine. My biggest concern was Crostini, the Linux layer that’s getting GPU support and already can run most Steam games, and it worked. It didn’t feel slow, but the Shell, the desktop experience, felt very half-baked. Chrome itself could fly, but doing anything in the OS was laggy and slow. I’m a Linux user, at heart. I expect things to be half-baked, so I hedged by bets, returned the m3 and bought and i5, and here I am several months later. There still isn’t GPU support for Crostini, but it’s coming. It runs Docker though, and well enough I can replicate my work dev setup on my tablet without much effort. Pretty cool.
The biggest difference between a Windows tablet and say ChromeTab is the applications. Modern Windows Apps are cool and all, but nobody uses them and the store is an utter wasteland. You certainly not likely to find the control app for my TV, or your doorlock, or even your lightbulbs in a Windows store. No, those kinds of things are targeted towards Android and iOS. Luckilly, ChromeOS runs Android, making it dramatically more useful than a Windows system. I don’t want to give you the impression that it runs Android apps well, but it does run them, and for a device I mostly use in the Living Room this is a good thing.
In all, the hardware is great. The keyboard cover is what it is. The software could stand some improvements, but it runs Chrome better than a Surface, and that should be a convincing sell for most people. If you own a Surface, and you use Chrome for the most part, and realize you can’t swype-type a sentence into a textbox in your browser and that bugs you, then this is basically the only option. Or switching to Edge. It’s adopting Chrome, you know. I just like the Slate hardware better. If the software doesn’t pan out, it looks like you’ll be able to install Windows 10 on it soon enough.
superterran
Doug Hatcher
I'm a developer from Charleston, SC. I like technology, movies, and dabble in Star Trek fandom.
Read More
|
{
"url": "https://superterran.com/2019/04/06/living-with-a-pixel-slate.html",
"source_domain": "superterran.com",
"snapshot_id": "crawl=CC-MAIN-2019-18",
"warc_metadata": {
"Content-Length": "28630",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2OFIBHTVMDTQER4XC73JXOILH3WTX5GC",
"WARC-Concurrent-To": "<urn:uuid:3546329c-bb39-4d09-95f4-824f8a68ffe5>",
"WARC-Date": "2019-04-26T07:36:41Z",
"WARC-IP-Address": "104.24.117.5",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6ISYHPY7FYW4JSHVM5R3SCDIYA3VBHVJ",
"WARC-Record-ID": "<urn:uuid:5aa35c7c-88cc-46dd-a569-0eb474ae2288>",
"WARC-Target-URI": "https://superterran.com/2019/04/06/living-with-a-pixel-slate.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7a5bd899-eb8a-4567-a38b-7fdf9ad917e4>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-165-178-231.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,
26,
27,
564,
565,
1385,
1386,
1425,
1426,
2427,
2428,
3053,
3054,
3649,
3650,
3662,
3663,
3676,
3677,
3773,
3774
],
"line_end_idx": [
26,
27,
564,
565,
1385,
1386,
1425,
1426,
2427,
2428,
3053,
3054,
3649,
3650,
3662,
3663,
3676,
3677,
3773,
3774,
3783
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3783,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4441833198070526,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.035252638161182404,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16098706424236298,
"rps_doc_frac_unique_words": 0.4797687828540802,
"rps_doc_mean_word_length": 4.296242713928223,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.255884170532227,
"rps_doc_word_count": 692,
"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.013454419560730457,
"rps_doc_frac_chars_top_3gram": 0.0053817699663341045,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -396.2662353515625,
"rps_doc_books_importance_length_correction": -396.2662353515625,
"rps_doc_openwebtext_importance": -247.94796752929688,
"rps_doc_openwebtext_importance_length_correction": -247.94796752929688,
"rps_doc_wikipedia_importance": -180.6166534423828,
"rps_doc_wikipedia_importance_length_correction": -180.6166534423828
},
"fasttext": {
"dclm": 0.026384059339761734,
"english": 0.9561188220977783,
"fineweb_edu_approx": 1.2311877012252808,
"eai_general_math": 0.1614496111869812,
"eai_open_web_math": 0.1765558123588562,
"eai_web_code": 0.026605069637298584
}
}
|
{
"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": "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": "9",
"label": "Personal/Misc"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "24",
"label": "User Review"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-159,402,675,028,783,650
|
Become a MacRumors Supporter for $25/year with no ads, private forums, and more!
iPad iPad air release date
rbfinch2
macrumors regular
Original poster
Jul 3, 2013
101
60
When will we know the actual iPad air release date or keynote this month? Just curious. First week of October for the announcement of the keynote?
I heard on a site that it might not make this October because of production issues.
rbfinch2
macrumors regular
Original poster
Jul 3, 2013
101
60
How are we suppose to know anymore than a news site?
Let me clarify my question. When does apple usually let people know about an upcoming keynote presentation. For example, I wasn't really watching the news on Apple's keynote announcement or "special event" that they posted on their website the iPhones. Was it two weeks heads up or more?
miketheappleguy
macrumors regular
May 18, 2014
119
1
Let me clarify my question. When does apple usually let people know about an upcoming keynote presentation. For example, I wasn't really watching the news on Apple's keynote announcement or "special event" that they posted on their website the iPhones. Was it two weeks heads up or more?
Usually like 10 days before the keynote
jbachandouris
macrumors 603
Aug 18, 2009
5,175
2,165
Upstate NY
I'm interested as well as I just bought an Air. Sadly, their return policy was only 14 days. Like had a $75 off deal and $30 student discount that I couldn't pass up.
rbfinch2
macrumors regular
Original poster
Jul 3, 2013
101
60
I'm interested as well as I just bought an Air. Sadly, their return policy was only 14 days. Like had a $75 off deal and $30 student discount that I couldn't pass up.
I've been patiently waiting but in need of a tablet. So, I hope the wait is worth it or I'm going to try out a Samsung Tab S.
rbfinch2
macrumors regular
Original poster
Jul 3, 2013
101
60
What do you use your tablet for?
I had a macbook but sold it. I'll just be using it for watching videos (Hbo Go etc.), word processing and power points on the go. I need a cheap and light versions of a laptop. I had the mini but I sold that as well.
Crosscreek
macrumors 68030
Nov 19, 2013
2,856
5,730
Margarittaville
When will we know the actual iPad air release date or keynote this month? Just curious. First week of October for the announcement of the keynote?
I heard on a site that it might not make this October because of production issues.
I'm betting October 21. Whether there is a keynote, whats the need.
AppleP59
macrumors 6502
Feb 24, 2014
349
4
So Jimmy d. now runs Apple? He said we were not going to get NFC on the iPhone 6 too.
that date was already put out there and given the nope by Jim D. He made no comment if it might be before or after that date, just that nothing is happening on the 21st
He said Nope to two new iPads and release the next version of its Mac operating system at its next event on Oct. 21
Although it's the most simple etc that he was saying Nope to the event being held on the 21st. It could also be a Nope to there being two iPads
Crosscreek
macrumors 68030
Nov 19, 2013
2,856
5,730
Margarittaville
He said Nope to two new iPads and release the next version of its Mac operating system at its next event on Oct. 21
Although it's the most simple etc that he was saying Nope to the event being held on the 21st. It could also be a Nope to there being two iPads
He is nothing more than a talking head.
12vElectronics
macrumors 68040
Jul 19, 2013
3,940
1,237
California
I have a hard time believing we won't see new iPads in October. Apple is smart enough to understand the holiday season and when products need to be released.
mattburley7
macrumors 68040
Oct 13, 2011
3,296
656
well the earnings call is scheduled for october 20th so that rules out an media event for the 21st.. all events have been before the earnings call so it would have to be around october 13-14th otherwise i dont think there is no event/no new ipads :confused:
Plutonius
macrumors G3
Feb 22, 2003
8,692
7,831
New Hampshire, USA
Let me clarify my question. When does apple usually let people know about an upcoming keynote presentation. For example, I wasn't really watching the news on Apple's keynote announcement or "special event" that they posted on their website the iPhones. Was it two weeks heads up or more?
guess we just have to wait and see when invites go out for a event.. hopefully next 1-2 weeks?
Don't expect a keynote or event (the Air update is considered minor). Apple will most likely just update the Air in the stores.
TheDeviceUser
macrumors 6502a
Jul 20, 2014
589
72
U.K
Don't expect a keynote or event (the Air update is considered minor). Apple will most likely just update the Air in the stores.
That is highly unlikely to happen with a flagship product such as the iPad. This isn't going to be a minor spec bump, but a significant update. It'll probably an update similar in size to the iPad 3 which had it's own Keynote, although shared with the Apple TV. I'd expect a late October keynote where they'll announce.
New Mac's
New iPad Air
New iPad Mini
Possible that some iPod updates may be slipped in too.
mattburley7
macrumors 68040
Oct 13, 2011
3,296
656
I have no idea when this event will be. earnings call is the 20th so they wouldn't have an event the day after which is the 21st. that day was shut down anyway already. people claim Yosemite release is the 21st though and would be announced just at the earnings call.. if that is done when are the ipads going to be announced? silent update? press release only? or doing the conference call too? an event on the 14th like the leaked GM build date shows? so many open dates.
Register on MacRumors! This sidebar will go away, and you'll see fewer ads.
|
{
"url": "https://forums.macrumors.com/threads/ipad-air-release-date.1792188/",
"source_domain": "forums.macrumors.com",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "214076",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SFKOYAVLJOGV2PGTAJRLOHZEE5LQCC6P",
"WARC-Concurrent-To": "<urn:uuid:898a127a-8598-4fd8-b268-4c7329947483>",
"WARC-Date": "2020-10-29T23:46:58Z",
"WARC-IP-Address": "104.22.3.106",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZBVXXH4YUBHCCWAK2BQLV5HNEUKJP6ZJ",
"WARC-Record-ID": "<urn:uuid:1799ccb8-1504-48da-abf1-0926331ed45d>",
"WARC-Target-URI": "https://forums.macrumors.com/threads/ipad-air-release-date.1792188/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:27785054-7674-4b37-8338-b0402555c66e>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-143.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
81,
82,
109,
110,
119,
120,
138,
154,
166,
170,
173,
320,
321,
322,
406,
408,
409,
418,
419,
437,
453,
465,
469,
472,
525,
526,
814,
816,
817,
833,
834,
852,
865,
869,
871,
1159,
1160,
1200,
1202,
1203,
1217,
1218,
1232,
1245,
1251,
1257,
1268,
1435,
1437,
1438,
1447,
1448,
1466,
1482,
1494,
1498,
1501,
1668,
1669,
1795,
1797,
1798,
1807,
1808,
1826,
1842,
1854,
1858,
1861,
1894,
1895,
2112,
2114,
2115,
2126,
2127,
2143,
2156,
2162,
2168,
2184,
2331,
2332,
2333,
2417,
2418,
2486,
2488,
2489,
2498,
2499,
2514,
2527,
2531,
2533,
2619,
2620,
2789,
2790,
2906,
2907,
3051,
3053,
3054,
3065,
3066,
3082,
3095,
3101,
3107,
3123,
3239,
3240,
3384,
3385,
3425,
3427,
3428,
3443,
3444,
3460,
3473,
3479,
3485,
3496,
3654,
3656,
3657,
3669,
3670,
3686,
3699,
3705,
3709,
3967,
3969,
3970,
3980,
3981,
3994,
4007,
4013,
4019,
4038,
4326,
4327,
4422,
4423,
4551,
4553,
4554,
4568,
4569,
4585,
4598,
4602,
4605,
4609,
4737,
4738,
5058,
5059,
5069,
5082,
5096,
5151,
5153,
5154,
5166,
5167,
5183,
5196,
5202,
5206,
5680,
5682
],
"line_end_idx": [
81,
82,
109,
110,
119,
120,
138,
154,
166,
170,
173,
320,
321,
322,
406,
408,
409,
418,
419,
437,
453,
465,
469,
472,
525,
526,
814,
816,
817,
833,
834,
852,
865,
869,
871,
1159,
1160,
1200,
1202,
1203,
1217,
1218,
1232,
1245,
1251,
1257,
1268,
1435,
1437,
1438,
1447,
1448,
1466,
1482,
1494,
1498,
1501,
1668,
1669,
1795,
1797,
1798,
1807,
1808,
1826,
1842,
1854,
1858,
1861,
1894,
1895,
2112,
2114,
2115,
2126,
2127,
2143,
2156,
2162,
2168,
2184,
2331,
2332,
2333,
2417,
2418,
2486,
2488,
2489,
2498,
2499,
2514,
2527,
2531,
2533,
2619,
2620,
2789,
2790,
2906,
2907,
3051,
3053,
3054,
3065,
3066,
3082,
3095,
3101,
3107,
3123,
3239,
3240,
3384,
3385,
3425,
3427,
3428,
3443,
3444,
3460,
3473,
3479,
3485,
3496,
3654,
3656,
3657,
3669,
3670,
3686,
3699,
3705,
3709,
3967,
3969,
3970,
3980,
3981,
3994,
4007,
4013,
4019,
4038,
4326,
4327,
4422,
4423,
4551,
4553,
4554,
4568,
4569,
4585,
4598,
4602,
4605,
4609,
4737,
4738,
5058,
5059,
5069,
5082,
5096,
5151,
5153,
5154,
5166,
5167,
5183,
5196,
5202,
5206,
5680,
5682,
5757
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5757,
"ccnet_original_nlines": 176,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4070512652397156,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026442309841513634,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20192308723926544,
"rps_doc_frac_unique_words": 0.3394055664539337,
"rps_doc_mean_word_length": 4.287631988525391,
"rps_doc_num_sentences": 74,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.376229286193848,
"rps_doc_word_count": 1043,
"rps_doc_frac_chars_dupe_10grams": 0.47517889738082886,
"rps_doc_frac_chars_dupe_5grams": 0.5185599327087402,
"rps_doc_frac_chars_dupe_6grams": 0.5185599327087402,
"rps_doc_frac_chars_dupe_7grams": 0.5185599327087402,
"rps_doc_frac_chars_dupe_8grams": 0.5185599327087402,
"rps_doc_frac_chars_dupe_9grams": 0.5002236366271973,
"rps_doc_frac_chars_top_2gram": 0.006708410102874041,
"rps_doc_frac_chars_top_3gram": 0.02146691083908081,
"rps_doc_frac_chars_top_4gram": 0.028622539713978767,
"rps_doc_books_importance": -538.9228515625,
"rps_doc_books_importance_length_correction": -538.9228515625,
"rps_doc_openwebtext_importance": -326.3307800292969,
"rps_doc_openwebtext_importance_length_correction": -326.3307800292969,
"rps_doc_wikipedia_importance": -301.93359375,
"rps_doc_wikipedia_importance_length_correction": -301.93359375
},
"fasttext": {
"dclm": 0.0314522385597229,
"english": 0.9647064805030823,
"fineweb_edu_approx": 0.9764649868011475,
"eai_general_math": 0.01964592933654785,
"eai_open_web_math": 0.09959595650434494,
"eai_web_code": 0.0007360600284300745
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,367,392,495,574,638,000
|
Tech Topics
Monitoring Java Applications with Metricbeat and Jolokia
The Java Virtual Machine (JVM) features a complete framework for operational management and monitoring. In this post we will see what JMX (Java Management eXtensions) is, how to explore the information it exposes and how to take advantage of it with Jolokia and the Elastic Stack. If you know about JMX and Jolokia, you can skip the first part and go directly to learn more about related Metricbeat features.
JMX and JConsole
JMX is a technology that defines a complete architecture and a set of design patterns to monitor and manage Java applications. It is based on managed beans, better known as MBeans, classes that are instantiated by dependency injection that represent resources in a JVM. These representations can be used to manage certain aspects of the application or, more frequently, to collect statistics about the use of these resources. In the core of JMX is the MBean Server, an element that acts as an intermediary between the MBeans, the applications in the same JVM, and the outer world. Any interaction with the MBeans is done through this server. In general, only Java code can directly access the JMX API, but there are adaptors that translate this API to standard protocols, for example Jolokia translates it to HTTP.
A useful tool to work with JMX is JConsole, which is included in the usual distributions of the Java Runtime. When you open it, it welcomes you with the list of Java processes running in your machine. If you dont have any, you see at least JConsole itself.
JConsole welcome screen
When connecting to any of these processes, a window opens with different tabs with generic monitoring information about different aspects of the processes like memory or threads. There is also a tab with an MBeans browser.
JConsole main window
In the browser, you can find the list of MBeans of the process grouped by namespaces. Some of them, like the ones under java.lang namespace, can be found on any JVM, while others are specific to the application. For each MBean, you can see different categories for attributes, operations and notifications. For monitoring, we will focus on attributes. There are some MBeans that despite being different, they implement the same interface. For example, it is common to find that different applications like Tomcat or Kafka use different garbage collectors depending on the use case, but in JMX they are objects of the same type, only with different names.
MBean browser in JConsole
Being able to discover all this information is really nice, but when monitoring infrastructure something like JConsole is not usually available. Additionally, you may also need to aggregate information from different processes that may be in different servers. Fortunately, this can be handled by Metricbeat and Jolokia.
Collecting JMX metrics with Metricbeat and Jolokia
Metricbeat can collect information from different servers, ship it to Elasticsearch, and from there it can be visualized in a variety of ways with Kibana. But as we have seen before, JMX can only be consumed with Java applications, there is when Jolokia enters into the game. Jolokia is an agent that can be deployed on JVMs to expose their MBeans through a REST-like HTTP endpoint, making all this information easily available to non-Java applications running on the same host. It can be deployed as a normal JVM agent, as a WAR for Java EE environments, or as OSGI or Mule agents.
To deploy Jolokia as an agent, the -javaagent flag has to be used when launching the Java application. When using the java command directly, it can be passed as an argument, but some applications can have their own startup scripts and may advise different ways to do it in their documentation. For example, when using Kafka with its own startup scripts, you may need to make use of the KAFKA_OPTS environment variable:
export KAFKA_OPTS=-javaagent:/opt/jolokia-jvm-1.5.0-agent.jar=port=8778,host=localhost
./bin/kafka-server-start.sh ./config/server.properties
To deploy Jolokia as a WAR, the agent has to be installed in the Java EE server. For example, in Tomcat this is done by copying the WAR file to its webapps directory. For each application, it is recommended to check their documentation for the best way to run Java agents. It is also recommended to look at Jolokia documentation to see what agents are available and what their options are. For cases where it is not possible to deploy Jolokia in the same JVM, Jolokia also has a proxy mode that can be used to query JMX from another JVM.
Once the Jolokia agent is running in the JVM of an application, it is pretty straight-forward to collect JMX metrics with Metricbeat using the JMX metricset of the Jolokia module introduced in Metricbeat 5.4. This module has to be configured with the host and port of the Jolokia agent and a set of mappings between JMX metrics and Metricbeat event fields. Lets see it with an example.
Example: Monitoring a Java application with Metricbeat and Jolokia
Suppose that we have Jolokia listening on localhost, port 8778, as would be the case with the previous example with Kafka. We can use JConsole to look for the MBeans and attributes that we want to monitor. By selecting the MBean, we can see its name, which we can copy directly to the configuration file.
Threading MBean in JConsole
For this example, we are going to monitor the number of threads from the java.lang:type=Threading MBean and heap memory usage from java.lang:type=Memory. The configuration would be like this:
- module: jolokia
metricsets: ["jmx"]
hosts: ["localhost:8778"]
period: 10s
namespace: "jvm"
jmx.mappings:
- mbean: "java.lang:type=Memory"
attributes:
- attr: "HeapMemoryUsage"
field: "memory.heap"
- attr: "NonHeapMemoryUsage"
field: "memory.nonheap"
- mbean: "java.lang:type=Threading"
attributes:
- attr: "ThreadCount"
field: "thread.count"
- attr: "DaemonThreadCount"
field: "thread.daemon"
Metricbeat collects the information periodically and ships the events with the four values. You may have noticed in JConsole that memory usage attributes are not plain values like the thread counts, they are objects that contain four fields each. Metricbeat takes care of restructuring the data in the event, so at the end it contains ten fields under the jolokia.jvm namespace:
Event with the collected jolokia metrics
More advanced configurations
You may want to have your fields in different events. Starting with Metricbeat 6.3, JMX mappings can also define how fields must be grouped using the event setting. Two events with the same value will be grouped together. For example the following configuration would generate two different events, one for memory fields, and another one for thread fields:
jmx.mappings:
- mbean: "java.lang:type=Memory"
attributes:
- attr: "HeapMemoryUsage"
field: "memory.heap"
event: "memory"
- attr: "NonHeapMemoryUsage"
field: "memory.nonheap"
event: "memory"
- mbean: "java.lang:type=Threading"
attributes:
- attr: "ThreadCount"
field: "thread.count"
event: "threads"
- attr: "DaemonThreadCount"
field: "thread.daemon"
event: "threads"
Another new feature introduced in version 6.3 is the support of wildcards, this allows us to use a single mapping for multiple MBeans, which is useful when an application contains several instances of the same type, or when the specific name is unknown beforehand. For example, Tomcat has multiple thread pools, we could extend our previous mappings with an additional configuration to obtain also the number of threads and connections per pool:
- mbean: "Catalina:name=*,type=ThreadPool"
attributes:
- attr: "currentThreadCount"
field: "thread.count"
- attr: "maxThreads"
field: "thread.max"
- attr: "connectionCount"
field: "connection.count"
With this configuration, a new event is shipped for each matching mbean, containing the name of the mbean as a new field:
Event with the collected Jolokia metrics when using wildcards
To complete the Jolokia support, in Metricbeat 6.4 we will add proxy mode thanks to a contribution from the community, and also an implementation of Jolokia Discovery, which will allow monitoring Java applications in more dynamic environments.
Jolokia Discovery is a technology based on UDP multicast that allows Jolokia agents to announce their endpoints along with some additional information about the service they are attached to. Our implementation is powered by the autodiscover framework that we already use for Kubernetes and Docker, and brings full featured dynamic configuration based on templates. If we wanted to take advantage of Jolokia Discovery for the previous examples, we could do something like this (reduced to collect only thread count):
metricbeat.autodiscover:
providers:
- type: jolokia
templates:
- condition:
contains:
jolokia.agent.version: "1.5.0"
config:
- module: "jolokia"
metricsets: ["jmx"]
hosts: ["${data.jolokia.url}"]
namespace: "jvm"
jmx.mappings:
- mbean: "java.lang:type=Threading"
attributes:
- attr: "ThreadCount"
field: "thread.count"
- condition:
contains:
jolokia.server.product: "tomcat"
config:
- module: "jolokia"
metricsets: ["jmx"]
hosts: ["${data.jolokia.url}"]
namespace: "jvm"
jmx.mappings:
- mbean: "Catalina:name=*,type=ThreadPool"
attributes:
- attr: "currentThreadCount"
field: "thread.count"
This configuration consists of two templates, one of them will be applied to all discovered Jolokia instances, and the second one will only be applied to Tomcat instances. Notice how the configurations in the templates are mostly the same as before, but using a variable for the host.
Even though this feature has been created to be used with the JMX metricset, it is open to any other creative use with other modules, or even with filebeat. If you want to know more, please take a look at the Jolokia module and autodiscover documentation, or ask us any question on Discuss.
• We're hiring
Work for a global, distributed team where finding someone like you is just a Zoom meeting away. Flexible work with impact? Development opportunities from the start?
|
{
"url": "https://www.elastic.co/blog/monitoring-java-applications-with-metricbeat-and-jolokia",
"source_domain": "www.elastic.co",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "177801",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VUW5CK7CHVSCW4ES4KKCWYMRUU4UU7JO",
"WARC-Concurrent-To": "<urn:uuid:9cb88322-c79c-4a8f-bd32-7b956d964ae9>",
"WARC-Date": "2022-05-28T06:51:39Z",
"WARC-IP-Address": "146.75.34.217",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NJDV6RWRGPEEKA5ULTYNMLPM5Q5DOEKI",
"WARC-Record-ID": "<urn:uuid:fddd85f0-ce47-4735-bfad-1bbe99dd918c>",
"WARC-Target-URI": "https://www.elastic.co/blog/monitoring-java-applications-with-metricbeat-and-jolokia",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a6edd442-9e5c-47a7-9353-2b4f248d9685>"
},
"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 (info@commoncrawl.org)\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,
12,
13,
70,
71,
480,
481,
498,
499,
1314,
1315,
1572,
1573,
1597,
1598,
1821,
1822,
1843,
1844,
2499,
2500,
2526,
2527,
2848,
2849,
2900,
2901,
3484,
3485,
3904,
3905,
3992,
4047,
4048,
4586,
4587,
4973,
4974,
5041,
5042,
5347,
5348,
5376,
5377,
5569,
5570,
5588,
5610,
5638,
5652,
5671,
5687,
5722,
5738,
5768,
5797,
5830,
5862,
5900,
5916,
5942,
5972,
6004,
6035,
6036,
6415,
6416,
6457,
6458,
6487,
6488,
6845,
6846,
6862,
6897,
6913,
6943,
6972,
6996,
7029,
7061,
7085,
7123,
7139,
7165,
7193,
7216,
7248,
7277,
7300,
7301,
7747,
7748,
7793,
7809,
7842,
7870,
7895,
7921,
7951,
7983,
7984,
8106,
8107,
8169,
8170,
8414,
8415,
8931,
8932,
8957,
8970,
8988,
9003,
9020,
9038,
9079,
9093,
9119,
9147,
9186,
9211,
9234,
9278,
9300,
9332,
9366,
9383,
9401,
9444,
9458,
9484,
9512,
9551,
9576,
9598,
9649,
9671,
9710,
9744,
9745,
10030,
10031,
10322,
10323,
10340,
10341
],
"line_end_idx": [
12,
13,
70,
71,
480,
481,
498,
499,
1314,
1315,
1572,
1573,
1597,
1598,
1821,
1822,
1843,
1844,
2499,
2500,
2526,
2527,
2848,
2849,
2900,
2901,
3484,
3485,
3904,
3905,
3992,
4047,
4048,
4586,
4587,
4973,
4974,
5041,
5042,
5347,
5348,
5376,
5377,
5569,
5570,
5588,
5610,
5638,
5652,
5671,
5687,
5722,
5738,
5768,
5797,
5830,
5862,
5900,
5916,
5942,
5972,
6004,
6035,
6036,
6415,
6416,
6457,
6458,
6487,
6488,
6845,
6846,
6862,
6897,
6913,
6943,
6972,
6996,
7029,
7061,
7085,
7123,
7139,
7165,
7193,
7216,
7248,
7277,
7300,
7301,
7747,
7748,
7793,
7809,
7842,
7870,
7895,
7921,
7951,
7983,
7984,
8106,
8107,
8169,
8170,
8414,
8415,
8931,
8932,
8957,
8970,
8988,
9003,
9020,
9038,
9079,
9093,
9119,
9147,
9186,
9211,
9234,
9278,
9300,
9332,
9366,
9383,
9401,
9444,
9458,
9484,
9512,
9551,
9576,
9598,
9649,
9671,
9710,
9744,
9745,
10030,
10031,
10322,
10323,
10340,
10341,
10509
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10509,
"ccnet_original_nlines": 146,
"rps_doc_curly_bracket": 0.00038062999374233186,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37947961688041687,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019145799800753593,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22189493477344513,
"rps_doc_frac_unique_words": 0.3076416254043579,
"rps_doc_mean_word_length": 5.300395488739014,
"rps_doc_num_sentences": 105,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.3948845863342285,
"rps_doc_word_count": 1518,
"rps_doc_frac_chars_dupe_10grams": 0.0196370892226696,
"rps_doc_frac_chars_dupe_5grams": 0.0949540063738823,
"rps_doc_frac_chars_dupe_6grams": 0.09110116958618164,
"rps_doc_frac_chars_dupe_7grams": 0.08240119367837906,
"rps_doc_frac_chars_dupe_8grams": 0.039025600999593735,
"rps_doc_frac_chars_dupe_9grams": 0.0196370892226696,
"rps_doc_frac_chars_top_2gram": 0.006214269902557135,
"rps_doc_frac_chars_top_3gram": 0.009942829608917236,
"rps_doc_frac_chars_top_4gram": 0.008948549628257751,
"rps_doc_books_importance": -825.8067626953125,
"rps_doc_books_importance_length_correction": -825.8067626953125,
"rps_doc_openwebtext_importance": -437.5953063964844,
"rps_doc_openwebtext_importance_length_correction": -437.5953063964844,
"rps_doc_wikipedia_importance": -336.8233947753906,
"rps_doc_wikipedia_importance_length_correction": -336.8233947753906
},
"fasttext": {
"dclm": 0.09668630361557007,
"english": 0.8735664486885071,
"fineweb_edu_approx": 2.347053050994873,
"eai_general_math": 0.7672299742698669,
"eai_open_web_math": 0.3236640691757202,
"eai_web_code": 0.9241262674331665
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,492,843,112,865,927,000
|
Using poker math concepts can help to win hands
Understanding and using poker math concepts can easily be the difference between winning or losing. You need not be mathematically inclined to do so. Today, let’s focus on (1) probability (often called “chance”) and (2) odds.
Probability: It’s an essential element in the game of poker. Don’t let it scare you. According to Wolfram MathWorld, “probability…studies the possible outcomes of given events together with the outcomes’ relative likelihoods and distributions.” It’s the chance that a particular event will occur, often expressed as a fraction or a percentage between 0% (zero probability) and 100% (certain to happen).
Flip a coin. Over the long term, it will land heads-up one out of every two tosses. The probability of that event is 1/2 or 50%. Playing hold’em, your first hole card is an ace. What is the probability (chance) that the second card also will be an ace – giving you pocket aces, the best possible starting hand. Easy: There are three aces still in the deck out of the remaining 51 cards.
So the probability of catching a second ace is 3 out of 51; that’s 3/51 = 1/17 = 5.8%. Interpretation: When your first hole card is an Ace, you can expect to get a second ace 5.8 out of 100 times – quite rare! That is the probability or chance that event will occur.
Odds: More often, we use the card odds which are estimated from probabilities. Starting with one Ace, what are the odds of your next hole card being another Ace? That’s simply the ratio of the probability (chance) of being dealt a second ace in the hole compared to the probability (chance) you will not.
As noted above, you have three chances to catch the second ace out of the 51 remaining cards in the deck, and 48 (51-3) chances of missing. The card odds, therefore, are 48-to-3, or 16-to-1 against it.
Types and uses: Poker players are concerned with two types of odds – Card and Pot. With a drawing hand (as is often the case), what are the odds of catching one of the cards you need to “make” your hand – presumably the winning hand? Example: Starting with two high clubs in the hole, the flop brings two more.
Now, holding four-to-a-club-flush, what are the card odds against completing the flush? Answer: The deck (unseen cards) includes nine cards of “your suit” (13 less the four you “have”). These nine cards are your “outs.” And, there are 52-5 = 47 unseen cards in the deck. (You have seen your two hole cards and the three cards flopped – 5 in all.)
Since nine of these unseen cards are clubs, then the rest, 47 — 9 = 38 cards, will not help you. Therefore, the card odds are 38-to-9 against you. That’s 4.2-to-1 against catching the club flush on the next card – the turn. We can round off the card odds to 4-to-1 against.
Compare these card odds with the pot odds – the amount of money (chips) in the pot vs. your call bet to see the turn. The pot contains $12, including your opponent’s $4 bet. To call the bet in order to see the next card, your pot odds are $12-to-$4 = 3-to-1.
Meaning: With 4-to-1 card odds against you, compared to the 3-to-1 pot odds, in the long run, you would expect to lose more than you win. On this basis, your call would be a Negative Expectation bet. But wait a minute! Don’t fold!
When the card and pot odds are close, consider the Implied Pot Odds – how many more chips will be added by your opponents during the rest of this hand. With two or more opponents staying, there is bound to be considerably more of your opponents’ chips going into the pot on the turn and river.
When you compare the estimated Implied Pot Odds to the present card odds, they are much higher. You have a Positive Expectation and your call is a wise investment.
We welcome your questions about the math of poker.
read more
Закладка Постоянная ссылка.
Добавить комментарий
|
{
"url": "http://bumizd.ru/using-poker-math-concepts-can-help-to-win-hands/",
"source_domain": "bumizd.ru",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "39982",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OLAQ2GSVFYFP3ZAZ7PGFOGXLUMEWISKY",
"WARC-Concurrent-To": "<urn:uuid:df7c7876-4f9b-4a24-acaa-461b12000140>",
"WARC-Date": "2024-03-03T08:35:10Z",
"WARC-IP-Address": "5.45.65.68",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3JTCZDKJJ2Z2KBXL72GGUDJVHYK3AHOK",
"WARC-Record-ID": "<urn:uuid:a7ea1566-60c3-4fa7-8038-69f24db0d9fa>",
"WARC-Target-URI": "http://bumizd.ru/using-poker-math-concepts-can-help-to-win-hands/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:62166f45-7582-4943-80b1-a89c78d7ef18>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-144\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,
48,
49,
275,
678,
1065,
1332,
1637,
1839,
2150,
2497,
2771,
3030,
3261,
3555,
3719,
3770,
3771,
3781,
3782,
3810,
3811
],
"line_end_idx": [
48,
49,
275,
678,
1065,
1332,
1637,
1839,
2150,
2497,
2771,
3030,
3261,
3555,
3719,
3770,
3771,
3781,
3782,
3810,
3811,
3831
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3831,
"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.40176600217819214,
"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.26490065455436707,
"rps_doc_frac_unique_words": 0.38840579986572266,
"rps_doc_mean_word_length": 4.310144901275635,
"rps_doc_num_sentences": 51,
"rps_doc_symbol_to_word_ratio": 0.0011037499643862247,
"rps_doc_unigram_entropy": 4.952517032623291,
"rps_doc_word_count": 690,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04371216893196106,
"rps_doc_frac_chars_dupe_6grams": 0.016139879822731018,
"rps_doc_frac_chars_dupe_7grams": 0.016139879822731018,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.013449899852275848,
"rps_doc_frac_chars_top_3gram": 0.018493609502911568,
"rps_doc_frac_chars_top_4gram": 0.014794889837503433,
"rps_doc_books_importance": -432.0758056640625,
"rps_doc_books_importance_length_correction": -432.0758056640625,
"rps_doc_openwebtext_importance": -224.856689453125,
"rps_doc_openwebtext_importance_length_correction": -224.856689453125,
"rps_doc_wikipedia_importance": -214.6871795654297,
"rps_doc_wikipedia_importance_length_correction": -214.6871795654297
},
"fasttext": {
"dclm": 0.20540165901184082,
"english": 0.9496814012527466,
"fineweb_edu_approx": 1.7584220170974731,
"eai_general_math": 0.3615671396255493,
"eai_open_web_math": 0.3625072240829468,
"eai_web_code": 0.06388217210769653
}
}
|
{
"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": "795.4",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": "Card games"
}
}
},
"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": "2",
"label": "Click Here References"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,428,314,664,643,554,300
|
Contenu | Rechercher | Menus
Annonce
Toute l'équipe d'ubuntu-fr vous souhaite un joyeux Noël et une bonne et heureuse année 2018.
Ubuntu 16.04 LTS
Commandez vos DVD et clés USB Ubuntu-fr !
Pour en savoir un peu plus sur l'équipe du forum.
Si vous avez des soucis pour rester connecté, déconnectez-vous puis reconnectez-vous depuis ce lien en cochant la case
Me connecter automatiquement lors de mes prochaines visites.
#1 Le 11/02/2013, à 09:30
robcom
Connexion internet RESOLU
Bonjour,
merci à l'avance pour votre aide.
J'ai réinstallé la version ubuntu 12.04.Le déroulement est ok, redémarrer le pc, unity est affiché mais je n'ai pas internet. Je me suis servi de la commande : sudo rm/var/:lib/NetworkManger/NetworkManger.state. réponse commande not found.. Cette commande m'avait permis de retrouver internet , lors d'une précédente installation. Je précise que je n'ai encore rien installé sur la version 12. 04.
Dans l'attente de votre aide mes salutations
Dernière modification par robcom (Le 12/02/2013, à 09:41)
Hors ligne
#2 Le 11/02/2013, à 09:58
Ayral
Re : Connexion internet RESOLU
Merci pour les salutations …
Dans ces cas là, je supprime toutes les connexions, filaires en tous cas puisque je n'utilise que celle là, puis je redémarre. Généralement ça suffit.
Pour mettre les retours de commande entre deux balises code, les explications sont là : https://forum.ubuntu-fr.org/viewtopic.php?id=1614731
Blog d'un retraité
Site de graphisme du fiston Loïc
Ubuntu 14.04 LTS sur un desktop et 14.04 sur un Dell Latitude 820
Hors ligne
#3 Le 11/02/2013, à 10:44
robcom
Re : Connexion internet RESOLU
Bonjour,
je ne vois pas de connexion réponse info sur la connexion, message aucune connexion valide active
trouvée, aucune connexion filaire ou autre non plus.
Hors ligne
#4 Le 11/02/2013, à 11:14
robcom
Re : Connexion internet RESOLU
Liste des tests
robert@Robert:~$ sudo ifconfig
eth0 Link encap:Ethernet HWaddr 00:30:05:6e:27:03
adr inet6: 2a01:e34:edff:4400:c5a0:ee1c:cb60:f5d9/64 Scope:Global
adr inet6: 2a01:e34:edff:4400:230:5ff:fe6e:2703/64 Scope:Global
adr inet6: fe80::230:5ff:fe6e:2703/64 Scope:Lien
UP BROADCAST RUNNING MULTICAST MTU:1500 Metric:1
Packets reçus:33 erreurs:0 :0 overruns:0 frame:0
TX packets:40 errors:0 dropped:0 overruns:0 carrier:0
collisions:0 lg file transmission:1000
Octets reçus:5328 (5.3 KB) Octets transmis:7078 (7.0 KB)
lo Link encap:Boucle locale
inet adr:127.0.0.1 Masque:255.0.0.0
adr inet6: ::1/128 Scope:Hôte
UP LOOPBACK RUNNING MTU:16436 Metric:1
Packets reçus:752 erreurs:0 :0 overruns:0 frame:0
TX packets:752 errors:0 dropped:0 overruns:0 carrier:0
collisions:0 lg file transmission:0
Octets reçus:59184 (59.1 KB) Octets transmis:59184 (59.1 KB)
robert@Robert:~$ sudo lshw -c network
[sudo] password for robert:
*-network
description: Ethernet interface
produit: 82547EI Gigabit Ethernet Controller
fabriquant: Intel Corporation
identifiant matériel: 1
information bus: pci@0000:02:01.0
nom logique: eth0
version: 00
numéro de série: 00:30:05:6e:27:03
taille: 1Gbit/s
capacité: 1Gbit/s
bits: 32 bits
horloge: 66MHz
fonctionnalités: pm bus_master cap_list ethernet physical tp 10bt 10bt-fd 100bt 100bt-fd 1000bt-fd autonegotiation
configuration: autonegotiation=on broadcast=yes driver=e1000 driverversion=7.3.21-k8-NAPI duplex=full firmware=N/A latency=0 link=yes mingnt=255 multicast=yes port=twisted pair speed=1Gbit/s
ressources: irq:18 mémoire:e0100000-e011ffff portE/S:4000(taille=32)
robert@Robert:~$ cat /etc/network/interfaces
# This file describes the network interfaces available on your system
# and how to activate them. For more information, see interfaces(5).
# The loopback network interface
auto lo
iface lo inet loopback
# The primary network interface
auto eth0
#NetworkManager#iface eth0 inet dhcp
# This is an autoconfigured IPv6 interface
iface eth0 inet6 auto
robert@Robert:~$
robert@Robert:~$ nm-tool
NetworkManager Tool
State: connected (global)
- Device: eth0 -----------------------------------------------------------------
Type: Wired
Driver: e1000
State: unmanaged
Default: no
HW Address: 00:30:05:6E:27:03
Capabilities:
Carrier Detect: yes
Speed: 1000 Mb/s
Wired Properties
Carrier: on
A+
Hors ligne
#5 Le 11/02/2013, à 23:24
Ayral
Re : Connexion internet RESOLU
Le déroulement de ce que je disais est : Clic de droite sur l'applet des connexions / Modification des connexions / Onglet Filaire = supprimer toutes les connexions.
Redémarrer l'ordi. Si une connexion éthernet automatique n'est pas céée et fonctionnelle, il te faut aller jeter un œil sur la doc de Network-manager et en particulier .
Certains arrivent à de bons résultats en installant Wicd en plus de network-manager, et en l'utilisant à la place.
Pour mettre les retours de commande entre deux balises code, les explications sont là : https://forum.ubuntu-fr.org/viewtopic.php?id=1614731
Blog d'un retraité
Site de graphisme du fiston Loïc
Ubuntu 14.04 LTS sur un desktop et 14.04 sur un Dell Latitude 820
Hors ligne
#6 Le 12/02/2013, à 09:38
robcom
Re : Connexion internet RESOLU
Bonjour,
Merci pour l'aide apportée à mon problème. Hier en fin de soirée mon pc affichait sous ubuntu 12.04 au démarrage, waiting for network configuration,ensuite attente de 60 secondes et ensuite botting etc..., j'ai recherché dans le forum et j'ai trouvé ligne de commande
1-sudo cp /etc/network/interfaces /etc/network/interfaces.save
2-echo -e 'auto lo\niface lo inet loopback\n' | sudo tee /etc/network/interfaces.
J'ai donc retrouvé ma connexion internet. Ce petit message peut aider quelqu'un.
Je marque résolu à+ et merci.
Hors ligne
|
{
"url": "http://forum.ubuntu-fr.org/viewtopic.php?pid=12541911",
"source_domain": "forum.ubuntu-fr.org",
"snapshot_id": "crawl=CC-MAIN-2018-05",
"warc_metadata": {
"Content-Length": "24222",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QTNT57LY636DGE5DYUDCFH3XLPWZC3N2",
"WARC-Concurrent-To": "<urn:uuid:c8115fa2-949c-4e59-86d3-e1bcf9f49f6d>",
"WARC-Date": "2018-01-19T00:10:12Z",
"WARC-IP-Address": "178.20.55.235",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:YGHI5R4M4Z3FUA73QDTE2S5SBDOV47HN",
"WARC-Record-ID": "<urn:uuid:a1138033-fdcb-4b68-9174-a8491e432ca8>",
"WARC-Target-URI": "http://forum.ubuntu-fr.org/viewtopic.php?pid=12541911",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2e81b7c1-e6a8-43ce-a65c-70d4acdbfd3e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-146-219-137.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,
29,
30,
38,
39,
132,
133,
150,
192,
193,
243,
244,
363,
424,
425,
451,
452,
459,
460,
486,
487,
496,
530,
928,
973,
974,
1032,
1033,
1044,
1045,
1071,
1072,
1078,
1079,
1110,
1111,
1140,
1291,
1292,
1293,
1434,
1453,
1486,
1552,
1553,
1564,
1565,
1591,
1592,
1599,
1600,
1631,
1632,
1641,
1740,
1793,
1794,
1805,
1806,
1832,
1833,
1840,
1841,
1872,
1873,
1889,
1920,
1977,
2053,
2127,
2186,
2247,
2306,
2370,
2419,
2486,
2487,
2523,
2570,
2610,
2661,
2721,
2786,
2832,
2903,
2904,
2942,
2970,
2997,
3036,
3088,
3125,
3156,
3197,
3222,
3241,
3283,
3306,
3331,
3352,
3374,
3496,
3694,
3770,
3815,
3885,
3954,
3955,
3988,
3996,
4019,
4020,
4052,
4062,
4099,
4142,
4164,
4181,
4182,
4207,
4208,
4228,
4229,
4255,
4256,
4337,
4364,
4391,
4422,
4446,
4485,
4486,
4502,
4527,
4558,
4559,
4578,
4602,
4605,
4606,
4617,
4618,
4644,
4645,
4651,
4652,
4683,
4684,
4850,
5020,
5135,
5136,
5137,
5278,
5297,
5330,
5396,
5397,
5408,
5409,
5435,
5436,
5443,
5444,
5475,
5476,
5485,
5753,
5816,
5898,
5979,
6009,
6010
],
"line_end_idx": [
29,
30,
38,
39,
132,
133,
150,
192,
193,
243,
244,
363,
424,
425,
451,
452,
459,
460,
486,
487,
496,
530,
928,
973,
974,
1032,
1033,
1044,
1045,
1071,
1072,
1078,
1079,
1110,
1111,
1140,
1291,
1292,
1293,
1434,
1453,
1486,
1552,
1553,
1564,
1565,
1591,
1592,
1599,
1600,
1631,
1632,
1641,
1740,
1793,
1794,
1805,
1806,
1832,
1833,
1840,
1841,
1872,
1873,
1889,
1920,
1977,
2053,
2127,
2186,
2247,
2306,
2370,
2419,
2486,
2487,
2523,
2570,
2610,
2661,
2721,
2786,
2832,
2903,
2904,
2942,
2970,
2997,
3036,
3088,
3125,
3156,
3197,
3222,
3241,
3283,
3306,
3331,
3352,
3374,
3496,
3694,
3770,
3815,
3885,
3954,
3955,
3988,
3996,
4019,
4020,
4052,
4062,
4099,
4142,
4164,
4181,
4182,
4207,
4208,
4228,
4229,
4255,
4256,
4337,
4364,
4391,
4422,
4446,
4485,
4486,
4502,
4527,
4558,
4559,
4578,
4602,
4605,
4606,
4617,
4618,
4644,
4645,
4651,
4652,
4683,
4684,
4850,
5020,
5135,
5136,
5137,
5278,
5297,
5330,
5396,
5397,
5408,
5409,
5435,
5436,
5443,
5444,
5475,
5476,
5485,
5753,
5816,
5898,
5979,
6009,
6010,
6020
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6020,
"ccnet_original_nlines": 172,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0624060183763504,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027067670598626137,
"rps_doc_frac_lines_end_with_ellipsis": 0.00578034995123744,
"rps_doc_frac_no_alph_words": 0.4015037715435028,
"rps_doc_frac_unique_words": 0.5664429664611816,
"rps_doc_mean_word_length": 5.939597129821777,
"rps_doc_num_sentences": 58,
"rps_doc_symbol_to_word_ratio": 0.011278199963271618,
"rps_doc_unigram_entropy": 5.733868598937988,
"rps_doc_word_count": 745,
"rps_doc_frac_chars_dupe_10grams": 0.09853106737136841,
"rps_doc_frac_chars_dupe_5grams": 0.17920903861522675,
"rps_doc_frac_chars_dupe_6grams": 0.13785311579704285,
"rps_doc_frac_chars_dupe_7grams": 0.12067797034978867,
"rps_doc_frac_chars_dupe_8grams": 0.09853106737136841,
"rps_doc_frac_chars_dupe_9grams": 0.09853106737136841,
"rps_doc_frac_chars_top_2gram": 0.026892660185694695,
"rps_doc_frac_chars_top_3gram": 0.031186439096927643,
"rps_doc_frac_chars_top_4gram": 0.028248589485883713,
"rps_doc_books_importance": -642.2721557617188,
"rps_doc_books_importance_length_correction": -642.2721557617188,
"rps_doc_openwebtext_importance": -343.8645935058594,
"rps_doc_openwebtext_importance_length_correction": -343.8645935058594,
"rps_doc_wikipedia_importance": -322.48077392578125,
"rps_doc_wikipedia_importance_length_correction": -322.48077392578125
},
"fasttext": {
"dclm": 0.07460343837738037,
"english": 0.027833109721541405,
"fineweb_edu_approx": 1.7907809019088745,
"eai_general_math": -0.000004170000011072261,
"eai_open_web_math": 0.4889174699783325,
"eai_web_code": 0.9992627501487732
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02854",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,264,869,841,678,504,000
|
Streaming live at 10am (PST)
Does absolute positioning work inside of blocks? or just inside of containers?
I want to create a music player album cover with multiple layers of images that change when the user hovers over the album. One layer is the album art, another layer is the play button on top, which is greyed out until the user hovers or touches the album. Another layer would be a colored border that attaches to music albums (to differentiate them from photos, videos, etc…) and another layer would be a text block with info about the track. I’m trying to put all of these layers in the same div block and use absolute positioning and z-indexing to layer them on top of each other. The problem is that when I assign absolute positioning to an image it does not work inside the div block, but inside the container of the div blocks instead. Here is my public site so you can see what i’m trying to accomplish:
https://webflow.com/design/rykr?preview=fd4fe0369388566b385c89324ac10d79
My question is how do I accomplish what I’m trying to do, and what would be the best way to do it. Please advise if javascript of something else would be better suited to this task.
Here is a website that is doing a similar thing. Scroll down to the last dot of the right hand navigation and check out the blog section. It’s a tile based interface that has images that have a pink filter and text appear on top of them when you hover over them with the mouse, as well as other cool interactions…
Thank you very much for your time, y’all :slight_smile:
Sincerely,
Richard Nash
Los Angeles, CA
Quick tutorial on positioning.
http://quick.as/24qcgpk
Used your images, don’t be angry :slight_smile: Check how I did it.
http://testmapp.webflow.com
https://webflow.com/design/testmapp?preview=9b95e77e09b279da19183d18c2b74a48
thank you for your effort Bartek, but I’m running into an issue. I’m trying to create a dynamic stream of content that reconfigures itself based on the viewport, and the issue I was running into was that columns were simply not cutting it. Sergie suggested I try using divs instead of columns, which has been working better for what I have been trying to do, but when I tried to use absolute positioning to layer several images on top of each other the images defaulted to the parent container, and not the div itself. Not quite sure what to do next.
|
{
"url": "https://discourse.webflow.com/t/does-absolute-positioning-work-inside-of-blocks-or-just-inside-of-containers/1580",
"source_domain": "discourse.webflow.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "29837",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AE3XPZ4PFJMLEMHCXHDRXHWMF6P5RLUS",
"WARC-Concurrent-To": "<urn:uuid:3419a05d-abe0-441e-8185-55a5e057c8c1>",
"WARC-Date": "2021-09-20T12:20:56Z",
"WARC-IP-Address": "64.71.144.205",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QD34RHZVKXDUW6M5L53HTVCUH325JHNL",
"WARC-Record-ID": "<urn:uuid:d3b63abb-7803-4518-8738-519e2b4a9948>",
"WARC-Target-URI": "https://discourse.webflow.com/t/does-absolute-positioning-work-inside-of-blocks-or-just-inside-of-containers/1580",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:89945f42-728d-409b-bd68-40b06a3d7f3b>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-130\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,
109,
110,
921,
922,
995,
996,
1178,
1179,
1493,
1494,
1550,
1551,
1562,
1563,
1576,
1592,
1593,
1624,
1648,
1649,
1717,
1745,
1822,
1823
],
"line_end_idx": [
29,
30,
109,
110,
921,
922,
995,
996,
1178,
1179,
1493,
1494,
1550,
1551,
1562,
1563,
1576,
1592,
1593,
1624,
1648,
1649,
1717,
1745,
1822,
1823,
2373
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2373,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.47590360045433044,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02811245061457157,
"rps_doc_frac_lines_end_with_ellipsis": 0.037037041038274765,
"rps_doc_frac_no_alph_words": 0.1405622512102127,
"rps_doc_frac_unique_words": 0.4887780547142029,
"rps_doc_mean_word_length": 4.715710639953613,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0.0040160599164664745,
"rps_doc_unigram_entropy": 4.890828609466553,
"rps_doc_word_count": 401,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04124801978468895,
"rps_doc_frac_chars_dupe_6grams": 0.020095190033316612,
"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.021152829751372337,
"rps_doc_frac_chars_top_3gram": 0.023268109187483788,
"rps_doc_frac_chars_top_4gram": 0.020095190033316612,
"rps_doc_books_importance": -236.7993927001953,
"rps_doc_books_importance_length_correction": -236.7993927001953,
"rps_doc_openwebtext_importance": -106.00067901611328,
"rps_doc_openwebtext_importance_length_correction": -106.00067901611328,
"rps_doc_wikipedia_importance": -92.72270965576172,
"rps_doc_wikipedia_importance_length_correction": -92.72270965576172
},
"fasttext": {
"dclm": 0.1292034387588501,
"english": 0.9412007331848145,
"fineweb_edu_approx": 1.472131371498108,
"eai_general_math": 0.5360094904899597,
"eai_open_web_math": 0.12567061185836792,
"eai_web_code": 0.7964882850646973
}
}
|
{
"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": "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": "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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,748,497,129,721,316,000
|
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
does anyone have any good "architecture" for the internationalization of dates? like in english its Monday, chinese: 星期一, dutch: maandag, jap: 月曜日
So my first idea is to create some sort of class that stores the strings of Monday to Sunday in 59 different languages. Apparently this isn't scalable at all, imagine now I need to display "12:34 A.M, Monday, 1st Jan 2000" i will then need another translation for A.M, P.M, the months (both long and short forms), the ordinals, etc, etc.
It's too much work, what's the solution?
share|improve this question
possible duplicate of Internationalization in Javascript – Aron Rotteveel May 9 '11 at 10:47
2
There isn't any universal shortcut, if that's what you're asking. Yes, i18n and l10n is "much work", but that is the solution. Sorry. – Piskvor May 9 '11 at 11:39
2
Believing that just translating all the parts of your date/time string is all you have to do is somehow cute :) – OregonGhost May 9 '11 at 11:47
What technology are you using server-side? It may already have anything you'll need. – OregonGhost May 9 '11 at 11:49
1
when it comes to dates, localisation is just as important as internationalisation -- the date formats used in various countries differ wildly. – Spudley May 9 '11 at 12:01
show 6 more comments
5 Answers
up vote 3 down vote accepted
The approach you suggest is not scalable. The Microsoft approach deals with 350 cultures; it has been suggested that there are 160 globally traded currencies etc. Maintaining a class that deals with this range of possibilities is a potential nightmare in the making.
@Aron suggests that your question is a duplicate of Internationalization in Javascript. One of the links in an answer to that question suggests a scalable and maintainable way forward. I would not normally advocate a Microsoft approach, but in this case they do seem to have the right idea for an architecture. Separate out the locale specific material into classes that can be incorporated into your application. Reference the locale specific material by a key based only on the culture (or locale). Don't attempt to maintain culture specific material yourself - unless you HAVE to, you really don't want to go there.
share|improve this answer
add comment
Datejs should be able to do what you are trying to do:
http://code.google.com/p/datejs/
Getting Started With Datejs
Its a javascript date library with about 157 different date-cultures/languages supported.
They took the approach of having a separate .js file for each culture. See: datejs source - trunk/src/globalization
share|improve this answer
add comment
Paul Irish said
date.js was abandoned and the version on the homepage is buggy.
and
moment.js is supergood and should be your first pick for date parsing, manip and formatting.
So I guess you people looking for a reliable date javascript library with i18n should use moment.js
share|improve this answer
+1 for suggesting moment.js – splattne Apr 3 '13 at 12:23
add comment
Much better handled on the server side. ASP.NET, for example, provides support for converting dates to strings in at least 30 or 40 different languages. I don't know about other server languages.
share|improve this answer
i don't want to rely on the server-side for this. My server side is only responsible for passing data, everything is on the javascript (less work to do when swapping server side technologies) – Pacerier May 9 '11 at 11:56
Exactly. This problem is already solved and tested a million times for you on the server side. I18N is not a simple problem: if you reimplement it on the client side, you'll either waste a lot of time or will come up with something that is insufficient. – andref May 9 '11 at 11:59
3
@Pacerier Implement this as simple REST service: http://example.com/de-DE/2011/05/09. As long as you keep the contract, you can swap the technology anytime you want. – andref May 9 '11 at 12:01
add comment
I advise you to have a look at the jQuery framework which can solve your problem without having to re-inventing the wheel: http://jqueryui.com/demos/datepicker/#localization
Note: jquery-ui is a add-on framework which contains plenty of UI components.
Hope this helps
share|improve this answer
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/5936330/internationalization-of-dates-on-the-web/12477354",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "87554",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OW7VZN4ADZAUBSFII2KBYOOR5JQXU5O7",
"WARC-Concurrent-To": "<urn:uuid:29490a86-c83a-4449-a240-42dc2b829a90>",
"WARC-Date": "2014-03-14T00:48:23Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:CM2MDADAA5HCROFTRFP6PQKL63MQ2Z7R",
"WARC-Record-ID": "<urn:uuid:50489331-11fe-4e78-805d-23507283c3f1>",
"WARC-Target-URI": "http://stackoverflow.com/questions/5936330/internationalization-of-dates-on-the-web/12477354",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e86ac460-886f-420d-8355-1e18aae7d1d0>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
305,
306,
644,
645,
686,
687,
715,
717,
811,
815,
979,
983,
1129,
1131,
1250,
1254,
1427,
1448,
1449,
1459,
1460,
1489,
1490,
1757,
1758,
2377,
2378,
2404,
2416,
2417,
2472,
2473,
2506,
2507,
2535,
2536,
2626,
2742,
2743,
2769,
2781,
2782,
2798,
2799,
2863,
2864,
2868,
2869,
2962,
2963,
3063,
3064,
3090,
3092,
3151,
3163,
3164,
3360,
3361,
3387,
3389,
3612,
3614,
3897,
3901,
4096,
4108,
4109,
4283,
4284,
4362,
4363,
4379,
4380,
4406,
4418,
4419,
4431,
4432,
4434,
4442,
4443,
4521,
4522
],
"line_end_idx": [
25,
157,
158,
305,
306,
644,
645,
686,
687,
715,
717,
811,
815,
979,
983,
1129,
1131,
1250,
1254,
1427,
1448,
1449,
1459,
1460,
1489,
1490,
1757,
1758,
2377,
2378,
2404,
2416,
2417,
2472,
2473,
2506,
2507,
2535,
2536,
2626,
2742,
2743,
2769,
2781,
2782,
2798,
2799,
2863,
2864,
2868,
2869,
2962,
2963,
3063,
3064,
3090,
3092,
3151,
3163,
3164,
3360,
3361,
3387,
3389,
3612,
3614,
3897,
3901,
4096,
4108,
4109,
4283,
4284,
4362,
4363,
4379,
4380,
4406,
4418,
4419,
4431,
4432,
4434,
4442,
4443,
4521,
4522,
4612
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4612,
"ccnet_original_nlines": 87,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3760162591934204,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018292680382728577,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24186992645263672,
"rps_doc_frac_unique_words": 0.47333332896232605,
"rps_doc_mean_word_length": 4.826666831970215,
"rps_doc_num_sentences": 51,
"rps_doc_symbol_to_word_ratio": 0.001016260008327663,
"rps_doc_unigram_entropy": 5.393869876861572,
"rps_doc_word_count": 750,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07403314858675003,
"rps_doc_frac_chars_dupe_6grams": 0.019337020814418793,
"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.00883978046476841,
"rps_doc_frac_chars_top_3gram": 0.01325966976583004,
"rps_doc_frac_chars_top_4gram": 0.01767956092953682,
"rps_doc_books_importance": -364.0759582519531,
"rps_doc_books_importance_length_correction": -364.0759582519531,
"rps_doc_openwebtext_importance": -221.36175537109375,
"rps_doc_openwebtext_importance_length_correction": -221.36175537109375,
"rps_doc_wikipedia_importance": -178.13946533203125,
"rps_doc_wikipedia_importance_length_correction": -178.13946533203125
},
"fasttext": {
"dclm": 0.10225445032119751,
"english": 0.9231457710266113,
"fineweb_edu_approx": 1.5114284753799438,
"eai_general_math": 0.010848280042409897,
"eai_open_web_math": 0.1714724898338318,
"eai_web_code": 0.00017123999714385718
}
}
|
{
"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.019",
"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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,611,122,020,845,520,000
|
Security Challenges with IAC and How to Overcome Them
Infrastructure as a Code or IAC has changed the way we deploy environments for web services and software. Developers don’t need to deal with hardware configurations or work on actual devices and operating systems; there is no need to have an in-house team of infrastructure specialists either. Instead, everything is done via software now.
There are more configuration orchestration and management tools available than ever before too, so the whole IAC approach is simpler than ever. That simplicity though can lead to concerns about security and reliability, with the former being the more prominent concern of the two. What are the security challenges with IAC and how can we overcome them?
Human Error
It is necessary to admit that the primary security issue in IAC environment is, well, the people that come in to contact with the servers. It may be an incorrect upgrade applied at the wrong time or a critical file that gets accidentally deleted, but the simplest human error can lead to a catastrophic failure.
Fortunately, there are many ways to mitigate this particular risk. For starters, you can limit the number of people with administrative access. Meticulous identity access management or IAM is also a must for better protection and improved security.
This is an issue that can also be mitigated with the help of Amazon Inspector. The tool automates security checks and maintenance almost entirely. In an EC2 instance, for example, Inspector can do assessments and discover unintended network accessibility. All you need to do then is fix the configuration of your cloud server accordingly.
Unauthorized Access from Within
Identity Access Management(IAM) is also handy for managing security risks caused by poor access regulations. Ingress to different parts of the cloud environment must always be limited and managed in great detail. Only then can you fully protect the entire ecosystem.
Compartmentalization is the key here. Even on a user level, detailed and fully regulated access management can help prevent major security breaches such as information copying and unauthorized admission to sensitive materials. Since there is no physical server to access, adding a good layer of IAM is the way to go.
Amazon GuardDuty is just one of the measures to deploy if you want to mitigate this risk further. While GuardDuty is mainly designed to spot unauthorized deployments and API calls, the tool can be configured to identify user-related anomalies in the hundreds—thousands—of server activities it monitors.
Physical Access to the Servers
Convincing stakeholders, particularly top management and business leaders, about data security when migrating to IAC is not always easy. The big question remains the same. If others have physical access to the servers, what guarantees do we have that they will not access the sensitive information in the servers directly?
This is where security standards come in handy. The implementation of good data security practices and robust security measures can help reduce the risk. It is all about implementing the right security policies and standards.
There are a lot of established standards to follow too. When comparing cloud providers, for example, you can focus on providers with ISO 27017:2015, ISO 9001:2008, and the Multi-Tier Cloud Security Standard Level-3 certifications.
You can then add your own layer of security on top of these guarantees. Adding strong encryption with private keys, for instance, can further fortify your cloud server and prevent unauthorized physical access from ever posing a risk.
Data Transmission Risks
Keep in mind that securing servers alone isn’t enough. There are also risks of data transmissions being sniffed and the information transmitted being stolen. The increasing number of cyber attacks happening recently is a clear indication that this type of security challenges needs to be taken seriously.
There are many ways to mitigate this risk. The obvious one is by using VPN and SSL encryption to protect data transmissions. These are not always the most practical solutions to use, but they add an extra layer of protection and prevent unwanted information theft from happening during data transmissions.
Another way to reduce this risk is by encrypting data or files before they are transmitted to the server. The encrypt/decrypt process can be moved to the client’s side rather than being configured to run on the cloud servers. This too adds an extra layer of protection.
The latest trend, however, is to use Cloud Access Security Brokers or CASBs to take things a step further. CASBs can identify potential threats by analyzing data from different sources. They are also capable of tracking user movements and understanding the security risks those movements create.
Multi-Environment Challenges
The security challenges with IAC are even more difficult to handle when you start using multiple cloud services and environments. The main reason behind this is the lack of communication and standards between cloud providers and IAC services.
When using different cloud services for different purposes, for example, data transmissions between those servers are not always encrypted, even when you have encryption set up for the clients or users. The lack of standardization means you cannot use the same approach or use security configurations from one vendor for the other.
This is where solutions like AlienVault come in handy. In the case of AlienVault, you can configure automatic asset discovery to run correctly, use the endpoint detection and intrusion detection as added security measures, and have all of your environments fully protected from attacks and intrusions.
While, admittedly, there are some serious security challenges that come with the use of infrastructure as code. These tips and tricks will help you deal with those security risks—and other risks associated with IAC use—without a problem.
For more on improving security controls within your architecture, read our post on Best Practice CIS Amazon Web Services Foundations Security Requirements.
Ibexlabs is an experienced DevOps & Managed Services provider and an AWS consulting partner. Our AWS Certified DevOps consultancy team evaluates your infrastructure and make recommendations based on your individual business or personal requirements. Contact us today and set up a free consultation to discuss a custom-built solution tailored just for you.
Kiran Sangeetam
Leave a Comment
Your email address will not be published. Required fields are marked *
As AWS Certified Consulting Partners, you get more than just extensive cloud expertise and first-rate IT support. Our team gives true meaning to the words “brand ambassadors.”
We leverage our comprehensive industry experience on your business' behalf to resolve system pain points, transform your infrastructure, and work in tandem with you.
All for the growth and acceleration of your company.
Follow Us
Subscribe To Our Newsletter
Copyright © 2018 IbexLabs
Scroll to Top
|
{
"url": "https://www.ibexlabs.com/security-challenges-with-iac/",
"source_domain": "www.ibexlabs.com",
"snapshot_id": "crawl=CC-MAIN-2019-09",
"warc_metadata": {
"Content-Length": "78421",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:36K22OZWZXC3OSO2T42SNPDQ2Q6VWEPG",
"WARC-Concurrent-To": "<urn:uuid:fd33d337-afa7-45fe-860a-5258ce4e1890>",
"WARC-Date": "2019-02-17T10:03:26Z",
"WARC-IP-Address": "35.221.46.9",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LW5EXBJMJGTQRQD5NTLGVWCZFOAA6J2R",
"WARC-Record-ID": "<urn:uuid:a45aefd2-d40f-4335-8001-4c326de71c90>",
"WARC-Target-URI": "https://www.ibexlabs.com/security-challenges-with-iac/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c7a0578c-0a4b-483d-b453-0ce53ddae6f8>"
},
"warc_info": "isPartOf: CC-MAIN-2019-09\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-159-135-91.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,
395,
396,
749,
750,
762,
763,
1075,
1076,
1325,
1326,
1665,
1666,
1698,
1699,
1966,
1967,
2284,
2285,
2588,
2589,
2620,
2621,
2944,
2945,
3171,
3172,
3403,
3404,
3638,
3639,
3663,
3664,
3969,
3970,
4276,
4277,
4547,
4548,
4844,
4845,
4874,
4875,
5118,
5119,
5451,
5452,
5754,
5755,
5993,
5994,
6150,
6151,
6152,
6508,
6509,
6525,
6526,
6542,
6543,
6614,
6615,
6791,
6792,
6958,
6959,
7012,
7013,
7023,
7051,
7077
],
"line_end_idx": [
54,
55,
395,
396,
749,
750,
762,
763,
1075,
1076,
1325,
1326,
1665,
1666,
1698,
1699,
1966,
1967,
2284,
2285,
2588,
2589,
2620,
2621,
2944,
2945,
3171,
3172,
3403,
3404,
3638,
3639,
3663,
3664,
3969,
3970,
4276,
4277,
4547,
4548,
4844,
4845,
4874,
4875,
5118,
5119,
5451,
5452,
5754,
5755,
5993,
5994,
6150,
6151,
6152,
6508,
6509,
6525,
6526,
6542,
6543,
6614,
6615,
6791,
6792,
6958,
6959,
7012,
7013,
7023,
7051,
7077,
7090
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7090,
"ccnet_original_nlines": 72,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42041802406311035,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018488749861717224,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10450161248445511,
"rps_doc_frac_unique_words": 0.4188576638698578,
"rps_doc_mean_word_length": 5.291024684906006,
"rps_doc_num_sentences": 63,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.4979248046875,
"rps_doc_word_count": 1103,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.043351609259843826,
"rps_doc_frac_chars_dupe_6grams": 0.020904729142785072,
"rps_doc_frac_chars_dupe_7grams": 0.01028100959956646,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.008224809542298317,
"rps_doc_frac_chars_top_3gram": 0.011309119872748852,
"rps_doc_frac_chars_top_4gram": 0.012851269915699959,
"rps_doc_books_importance": -485.2845764160156,
"rps_doc_books_importance_length_correction": -485.2845764160156,
"rps_doc_openwebtext_importance": -341.5112609863281,
"rps_doc_openwebtext_importance_length_correction": -341.5112609863281,
"rps_doc_wikipedia_importance": -235.92431640625,
"rps_doc_wikipedia_importance_length_correction": -235.92431640625
},
"fasttext": {
"dclm": 0.026449620723724365,
"english": 0.932192862033844,
"fineweb_edu_approx": 2.201965808868408,
"eai_general_math": 0.02401096001267433,
"eai_open_web_math": 0.1307629942893982,
"eai_web_code": 0.00786500982940197
}
}
|
{
"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": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,444,784,870,904,414,000
|
Privatemessage.site Virus Removal
Virus Removal Guides
Privatemessage.site Virus
Privatemessage.site
Privatemessage.site is a page-redirect/browser hijacker that may appear in your browser without your consent. Privatemessage.site claims to be compatible with Google Chrome, Internet Explorer, Mozilla Firefox and other browsers and promises to provide you with some sort of free functionality.However, what Privatemessage.site really does is, it usually hijacks your default browser by imposing certain changes to its homepage or search engine.
Privatemessage.site
The Privatemessage.site virus will display pop up ads and messages
Shortly after these changes take place you may start seeing tens of different ads, pop-ups and banners all over your screen every time you open a new browsing session. What is more disturbing, though, is the fact that your searches may frequently get automatically redirected to specific sponsored web pages and unfamiliar web locations that you never intended to visit. How to stop this activity and remove the annoying ads is what we are going to talk about in the next lines. If you have landed on this page because you want to learn more about that and uninstall Privatemessage.site, we suggest you read the information below.
Privatemessage.site on WhatsApp
Privatemessage.site on WhatsApp advertises itself as an excellent tool that helps the web users to make their online experience safer and more satisfying. Yet, these claims seem quite dubious, because Privatemessage.site on WhatsApp acts as a typical browser hijacker.
You can never know whether they are safe or if they may open insecure web pages or content that may contain viruses. So, do not waste your time thinking that Privatemessage.site can provide you with reliable search results. Better take care of removing it instead. This way, you will save yourself from the ads annoyance and the possible encounter with threats such as Ransomware or Trojans.
Another reason to consider removing this browser hijacker is the fact that it may disclose your tracking activities, the IP address of your computer, your location, and other browsing-related details, which could be transmitted to third parties or used for aggressive online advertising campaigns. This is a common online marketing tactic, which helps the web advertisers learn more about your recent preferences and target you with their ads accordingly. Additionally, when you have Privatemessage.site on your computer, you may experience dubious research suggestions for updating or installing new software, and suggestions to subscribe to unfamiliar web pages and services. If you have started confronting such pages while browsing the web, make sure you do not provide your personal information to them as you never know whether they are legitimate or compromised by fraudsters.
The Privatemessage.site Virus
The Privatemessage.site virus tends to impose certain browsing modifications and to manipulate the users’ web searches. For instance, the Privatemessage.site virus may monitor all search queries and redirect the customer to pages that provide sponsored results and earn pay-per-click revenue for the hijacker’s creators.
If you are experiencing something similar, we would advise you not to trust the links and ads that may get displayed on your screen by this browser hijacker.
To protect yourself, we recommend that you install a trusted anti-malware program and adhere to the basic principles of safe browsing. In addition, you can get rid of the browser hijacker manually. Currently, our team has prepared Removal Instructions, which you can find just a few lines below. Still, if you find them too difficult to follow, we recommend you use the professional Privatemessage.site removal tool that we have posted on this page. It can easily detect this and any other potentially unwanted program and uninstall it without any risk.
Preventing the hijacking of your browser
The majority of browser-hijackers claim to have official web pages, while their distribution methods oftentimes rely on a completely different means of getting installed onto user’s machines. Most of these suspicious programs are spread around the web through software packages (aka bundles), which allow them to get distributed inside the setups of popular free programs such as games, media players, download programs and other free software. Unfortunately, many users miss the ability to customize the installation of these packages by relying on the automatically selected installation settings (Default, Basic and Fast). To protect your computer, you should choose User or Advanced instead. These settings let you uncheck the unwanted add-ons and install only the software you want.
Removing the Privatemessage.site Virus from the system is just a matter of time!
Although the majority of security specialists will tell you that removing a browser hijacker like Privatemessage.site is difficult, we cannot agree with that. As far as the complexity and the level of danger are concerned, such applications do not come close to any sort of malware (Ransomware, Trojans, Spyware) or other dangerous viruses. Therefore, we believe that if you carefully follow the instructions given below, you will be able to safely remove the irritating page-redirect.
SUMMARY:
Name Privatemessage.site
Type Browser Hijacker
Privatemessage.site Removal
We are sending you to another page with a removal guide that is regularly updated to counter the latest tricks malware creators use. It will show you how to:
1. Locate and clean up your phone’s apps if they are infected.
2. Find browser extensions related to the threat and how to remove them.
3. Ensure your passwords were not stolen or tampered with.
You can find the removal guide here.
Exit mobile version
|
{
"url": "https://howtoremove.guide/privatemessage-site-virus-removal/amp/",
"source_domain": "howtoremove.guide",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "38175",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6IQ3YDRF7AQYLZVXSBR3LDBQDK42Q3Z7",
"WARC-Concurrent-To": "<urn:uuid:8b1cf617-1fe6-4f46-b85f-423c61599b26>",
"WARC-Date": "2021-12-01T06:23:07Z",
"WARC-IP-Address": "172.67.74.12",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VEBXCPUSCTOIW73MJECHHTWGQESCSBHW",
"WARC-Record-ID": "<urn:uuid:1a9e4319-0dda-403f-bdd6-4260bdd5fd51>",
"WARC-Target-URI": "https://howtoremove.guide/privatemessage-site-virus-removal/amp/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:54beb1ff-f330-4237-80a7-32db712a5474>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-171\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
36,
57,
58,
84,
85,
105,
106,
551,
552,
572,
573,
640,
641,
1272,
1273,
1305,
1306,
1575,
1576,
1968,
1969,
2853,
2854,
2884,
2885,
3206,
3207,
3365,
3366,
3920,
3921,
3962,
3963,
4751,
4752,
4833,
4834,
5320,
5321,
5330,
5331,
5356,
5378,
5379,
5407,
5408,
5566,
5629,
5702,
5761,
5798,
5799
],
"line_end_idx": [
36,
57,
58,
84,
85,
105,
106,
551,
552,
572,
573,
640,
641,
1272,
1273,
1305,
1306,
1575,
1576,
1968,
1969,
2853,
2854,
2884,
2885,
3206,
3207,
3365,
3366,
3920,
3921,
3962,
3963,
4751,
4752,
4833,
4834,
5320,
5321,
5330,
5331,
5356,
5378,
5379,
5407,
5408,
5566,
5629,
5702,
5761,
5798,
5799,
5818
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5818,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42476189136505127,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0019047600217163563,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12380951642990112,
"rps_doc_frac_unique_words": 0.4448198080062866,
"rps_doc_mean_word_length": 5.387387275695801,
"rps_doc_num_sentences": 65,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.368186950683594,
"rps_doc_word_count": 888,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.009615380316972733,
"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.033653851598501205,
"rps_doc_frac_chars_top_3gram": 0.027173910290002823,
"rps_doc_frac_chars_top_4gram": 0.005434779915958643,
"rps_doc_books_importance": -561.2723388671875,
"rps_doc_books_importance_length_correction": -561.2723388671875,
"rps_doc_openwebtext_importance": -327.77691650390625,
"rps_doc_openwebtext_importance_length_correction": -327.77691650390625,
"rps_doc_wikipedia_importance": -245.84988403320312,
"rps_doc_wikipedia_importance_length_correction": -245.84988403320312
},
"fasttext": {
"dclm": 0.04501914978027344,
"english": 0.9120572209358215,
"fineweb_edu_approx": 1.4543930292129517,
"eai_general_math": 0.02954464964568615,
"eai_open_web_math": 0.14406448602676392,
"eai_web_code": 0.05347437039017677
}
}
|
{
"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.677",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,118,847,765,190,313,700
|
How To Protect Your Computer From E-Mail Threats
If you regularly use email, you could be leaving your computer open to a multitude of threats. However, following some simple free computer maintenance tips can help you protect your computer from e-mail threats. Identity thieves, hackers, and other criminals use email to gain access to your personal information, so it’s important that you cut them off at the pass with these simple tips.
Learn More About How To Protect Your Computer From E-Mail Threats With Free Computer Maintenance
image courtesy of flickr user: bodycoach2
Strong Spam Filter
Choose an email program that comes bundled with a strong spam filter. If you’re using a stand alone email software on your computer, you may want to add a separate spam filtering program to ensure that your computer is protected. Spam emails frequently contain links to dangerous software programs or sites that harvest emails. They can also be used for phishing, a scamming method that hackers use to collect personal information such as birth dates and credit card numbers. Use a spam filter to help secure your computer.
Avoid Clicking Suspicious Links
If an email looks suspicious in any way, don’t click on any of the links it contains. If you’re in doubt that it is from the sender it appears to be from, open a new tab in your browser and type in the web address directly to go to the site, instead of clicking the link. Most major websites have a contact address that you can use to forward suspicious or fraudulent emails to – if you get an email from someone misrepresenting themselves, forward it on to the site owner.
Keep Your Software Up to Date
One of the easiest ways to protect your computer from e-mail threats is to stay on top of your software updates. Your operating system regularly puts out updates to close security gaps and loopholes. Browser developers do the same thing. By upgrading your software when these updates are released, you can protect your computer against malicious attacks. Installing an MRT (malicious software removal tool) will also allow you to remove any viruses that do make their way in.
Use Strong Passwords
To protect your computer, use a different password for your email than you do for every other site you log in to. Most people use the same password for all sites, which means that if their email is hacked, the hacker gains access to their bank account, phone records, and all their other online information. For your safety, use a different password for each site you use.
In addition, change your password every few weeks. Choose a password that contains 7 to 15 characters, made up of letters, numbers, and symbols. Most victims of hacking are, in fact, victims of poor password choice. Avoid using passwords made up of words, birthdates, or simple combinations such as “1234” “abcd” or other easy to guess key strings.
Sign up for Free Computer Maintenance
Posted in Computer Maintenance Tips, Computer Maintenance Tutorials Tagged with: , , , , ,
|
{
"url": "http://www.freecomputermaintenance.com/computer-maintenance-tips/how-to-protect-your-computer-from-e-mail-threats/",
"source_domain": "www.freecomputermaintenance.com",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "32785",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HP376VGK6XC3QSAX4VIEFQDTEM3R7WG5",
"WARC-Concurrent-To": "<urn:uuid:131e67e5-e42c-4c53-9972-9d05f4a478db>",
"WARC-Date": "2017-08-19T20:37:50Z",
"WARC-IP-Address": "208.113.170.165",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WNTTOU4LHXEBBXXD3BV7T6KOTLA6NHXH",
"WARC-Record-ID": "<urn:uuid:e7ea53da-970d-4454-ad8e-575f59c4b70a>",
"WARC-Target-URI": "http://www.freecomputermaintenance.com/computer-maintenance-tips/how-to-protect-your-computer-from-e-mail-threats/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c5103ed7-fe49-4546-8c0c-8db3ac582f0f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-158-100-57.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,
49,
50,
441,
442,
539,
540,
582,
583,
602,
603,
1127,
1128,
1160,
1161,
1635,
1636,
1666,
1667,
2143,
2144,
2165,
2166,
2539,
2540,
2889,
2890,
2928,
2929
],
"line_end_idx": [
49,
50,
441,
442,
539,
540,
582,
583,
602,
603,
1127,
1128,
1160,
1161,
1635,
1636,
1666,
1667,
2143,
2144,
2165,
2166,
2539,
2540,
2889,
2890,
2928,
2929,
3019
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3019,
"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.40784981846809387,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00511944992467761,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1279863566160202,
"rps_doc_frac_unique_words": 0.4536489248275757,
"rps_doc_mean_word_length": 4.794871807098389,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.965112209320068,
"rps_doc_word_count": 507,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08227066695690155,
"rps_doc_frac_chars_dupe_6grams": 0.06252571195363998,
"rps_doc_frac_chars_dupe_7grams": 0.048128340393304825,
"rps_doc_frac_chars_dupe_8grams": 0.03290826827287674,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04936239868402481,
"rps_doc_frac_chars_top_3gram": 0.04689427837729454,
"rps_doc_frac_chars_top_4gram": 0.03455368056893349,
"rps_doc_books_importance": -207.55223083496094,
"rps_doc_books_importance_length_correction": -207.55223083496094,
"rps_doc_openwebtext_importance": -130.2249755859375,
"rps_doc_openwebtext_importance_length_correction": -130.2249755859375,
"rps_doc_wikipedia_importance": -122.94061279296875,
"rps_doc_wikipedia_importance_length_correction": -122.94061279296875
},
"fasttext": {
"dclm": 0.09849637746810913,
"english": 0.9100678563117981,
"fineweb_edu_approx": 2.4545493125915527,
"eai_general_math": 0.005519030150026083,
"eai_open_web_math": 0.0479247011244297,
"eai_web_code": 0.005689740180969238
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,924,155,152,740,169,000
|
Simpson’s paradox explained, or when facts aren’t really facts
Articles 14 min read
Simpson's paradox. Harry Potter example
Blog / Articles / Simpson’s paradox explained, or when facts aren’t really facts
Simpson’s paradox explained, or when facts aren’t really facts
Simpson’s paradox – the effect that occurs when the marginal association between two categorical variables is qualitatively different from the partial association between the same two variables after controlling for one or more other variables…
-Britannica
Come on. There must be a more intuitive explanation!
Simpson’s paradox. Okay. When you cross the doorway of statistics and set forth to enter the world of data science, you should have a few “Remember me” ribbons tied around your fingers. They ought to say, “Don’t jump to conclusions based on significance”, “Don’t automatically infer causality”, and “Check your assumptions before waving the STATISTICALLY SIGNIFICANT banner”.
What we’ll talk about here, has to do with all three and the elusiveness of truth. The phenomenon in question is the Simpson’s Paradox, and every statistician worth her salt ought to know about it. The paradox surfaces when individual groups making up a population show a trend in one direction, but the population as a whole presents a trend in the opposite direction.
Before we do a nose-dive into the world of Simpson’s paradox, here’s what to expect.
1. A real-life Simpson’s paradox example concerned with US wage change
2. A simplified explanation borrowing J.K. Rowling’s fictional world
3. A practical implications section – think medical trials, and voting systems
4. A How To Sidestep Simpson’s Paradox in Data Science section
So… Simpson’s paradox?
Let’s illustrate
A few years back, data on nation-wide income change between 2000 and 2012 in the US sparked a rigorous dialogue. The data came from women at the age of 25 and older who were working full-time. It suggested that in that time frame, their median income had suffered a considerable decrease. Broken down by education level, the data looked like this:
Simpson's paradox. Table 1
Not a great-looking twelve years, for sure. If you decide you want to average this out and obtain an approximation of the income change across the board, you would think you ought to expect the number will fall somewhere in the -5% range, right? Even if you decided to weigh the numbers based on sample size, you would still expect it to be in the ballpark.
However, these calculations will not reflect reality at all. In fact, the income of our target group increased in the period between 2000 and 2012. By 2.8%.
But how does this happen? Given that every segment showed a decrease, why is there an increase in the total numbers for the population?
This is what Simpson’s paradox looks like in real life.
Before I answer how it emerged, let me first give you a much simpler example. See if you can come up with an answer by analogy.
Let’s move into the world of Harry Potter for a second.
As you know, the Ministry of Magic governs the magical world. With the fight against He-Who-Must-Not-Be-Named over, and all casualties accounted for, the Ministry is hiring new personnel.
A twitchy reporter with a misguided sense of social justice gets hold of the ministry employee records. He scans it briefly and notices that for the Auror Department and the Department of Mysteries (DoM), collectively, the number of wizards surpassed that of than witches. Eleven to seven, to be exact.
Simpson's paradox. Harry Potter example
‘This does it!’ – he solemnly says to himself, – ‘I will expose this blatant sexism and ensure our witches have somebody to fight the good fight for them.’
So, he writes an article:
“MINISTRY OF MAGIC EXPOSED: BIAS AGAINST WITCHES UNDER MINISTER’S NOSE”
And goes on to explain how year after year the total number of witches in the Auror Office and the DoM is less than that of wizards. At least 7 to 11. With witches never getting the upside.
But let’s have a look at what happened in reality.
There were eighteen vacant positions. Twelve in the Auror Office and 6 in the Department of Mysteries.
Twenty-four candidates applied for each position.
If we look at the applications individually, you will notice that for the Auror positions, 20 wizards and 4 witches showed interest. Furthermore, their success rate didn’t indicate the presence of a bias. The two bodies hired 50% of the wizard applicants, and 50% of the witch applicants (10 and 2, respectively, amounting to a total of 12 new aurors).
Similar results can be found when we dissect the DoM applicants, but this time it was the women who were keener for the post. Again, the applicants were 24, 20 witches and 4 wizards. And once more, there was no selection bias and the success rate was equal. But remember, the available places were fewer, only 6, so 5 witches get the job, and 1 wizard.
For both positions, Auror Office and DoM, gender had no impact on the chance of being selected. And yet, when you add up the 2 witches who became aurors, and the 5 witches who became DoM employees, you end up with 7 successful witches. And when you add up the 10 male aurors, and the 1 department of mysteries candidate, you get 11 successful wizards.
Even though the applications by department show no evidence of bias, when you look at the aggregated numbers, more wizards than witches got a job at the Ministry of Magic. Simpson’s paradox at play.
The simple conclusion the data urges you to draw from what looks like a very evident gender effect is wrong when you look under the hood.
Why does this happen?
In such situations, there’s usually a bias we have overlooked. Remember, the Auror office has 12 open positions and is therefore easily penetrable, whereas the DoM only advertises 6 posts, which makes it highly selective. In addition, there is a disparity in the appeal each position holds for witches and wizards. Wizards preferred to apply for the ‘easy entry’ job, while witches – to the highly competitive DoM posts.
So, the two groups have different sizes, and there is a differential job preference for witches and wizards. If the sample sizes were equivalent, then we could correctly expect that given that the selection process is unbiased and the success rate of witches and wizards is always equal, the total will also be unbiased. This would hold true even if there is a differential job appeal.
However, in our case, the group sizes differ. When this happens, the results for each side (witches or wizards) can be dominated by a single group (successful auror applicants, successful DoM applicants). In our example, the group totals are dominated by the posts for which most people successfully applied (10/20 > 5/20). In this case, the Wizards were clearly more successful in absolute numbers, which explains why they appear favored in the total (when witches’ and wizards’ job offers are added up).
Simpson’s paradox arose due to two confounding variables (and their interaction). Unequal sample sizes, and differential post preference for witches and wizards, where the latter were more intrigued by the less attainable positions.
Nice and clear.
data science training
So, what do you think happened in the 2012 wage data paper?
The answer to that conundrum is analogous. There must have been a confounding variable that was not considered when conclusions were being drawn. And there was: the people that took part in 2000 are not the same as the ones in 2012.
What’s the difference?
Simpson’s paradox. Pie chart
Simpson’s paradox. Bar chartThe level of education. Look at the data. Logically, the highest paying group of women are those with at least a Bachelor’s degree, right? Well, in 2000 the number of women with these qualifications in a full-time job and over 25 was 11.6 million. Twelve years later this number has jumped to 17.2 million (the data is coming from the same census). That’s a 48% increase. Now, increasing the proportion of the population in the group that pays the most by this much, is enough to increase the overall average. Their absolute numbers are a lot larger. This holds true even if the by-group income averages experience a drop, women with Bachelor’s and more included.
As to why the group average of women with Bachelor’s or higher has fallen… It’s speculative, but it is probably safe to assume that as the number of highly qualified employees increases, their starting salary becomes less competitive. In addition, the new women in the cohort have lower seniority, which also affects their starting compensation packages.
Right.
What this serves to teach us is that premature conclusions, even apparently data-driven ones, are dangerous. For example, the wage data we just examined was used by critics to ask Big Questions, like “Why do wages for college graduates stagnate over the years?” or “Should young professionals even pursue higher education?
The answer is yes. What this data doesn’t take into account is that there is a generational trend: 40 years ago, a college degree constituted a competitive advantage in its own right. As higher education became more accessible, a Master’s degree began to make the difference, then PhD, an MBA, and so on. But it’s important to remember that as the proportion of college graduates increases, the competitive advantage of non-graduates decreases.
Practical implications
Real-life situations
Simpson’s paradox is everywhere around us. Therefore, any data enthusiast ought to know how to recognize it and sidestep its misguiding interpretations, especially if a career in data science is what you aim for.
Medical trials
Imagine the following scenario. You’re testing a drug you hope will cure racism, Decentril. You test 800 people who have “contracted the disease”, 400 of which are randomly allocated to a Placebo condition. The results look like this.
Simpson’s paradox. Table 2
At a glance, it looks like the data proves the Decentril is working. Racism is cured in 50% of those who have taken the drug, whereas only 40% of the placebo patients have improved.
However, taking a closer look at the results shows they tell a different story.
Simpson’s paradox. Table 3
The recovery rate for both men and women taking the placebo is higher. As you have probably noticed, there is once again a difference in sample sizes, which gives rise to the misleading overall positive result of the drug.
Unfortunately, the medical industry is not immune to the Simpson’s paradox, and even though this is a fictitious example with simplified data, there are many real-life cases which corroborate the danger of taking statistical significance at face value.
When possible, stratify (drill into) your results.
Voting (Gerrymandering)
As you probably know well, in politics, and particularly in recent US history, winning a higher percentage of votes in multiple areas doesn’t automatically translate to winning the presidency. You can still lose the overall vote. This happened in 2000 in the George W. Bush – Al Gore election, and more recently with Hillary Clinton and President Trump.
A classic case of Simpson’s paradox. In fact, the root cause of the phenomenon lies in the U.S. electoral college model. For example, in the 2000 election, if the popular vote had been what determines how many electoral votes must be allotted for each candidate in each state, Al Gore would have won. However, the electoral college works by allotting votes equal to the number of legislators a state has in Congress. Then, whoever wins the state, also wins all the votes (fine, except Nebraska and Maine). So, in hindsight, it was irrelevant that Al Gore got over 500,000 more votes nationwide when he was short 5 electoral votes. It also didn’t matter he won New York and California with well over a million. One vote’s margin would have sufficed in each.
Avoiding the paradox in data science
Simpson’s paradox arises when one fails to consider possible confounding variables. In data science, this is especially catastrophic if it happens during study design. A lurking confounding variable can render any obtained results irrelevant, even if they’re significant at the appropriate α-level.
If you, the statistician, are the person designing the study, consider possible confounds before data collection starts. Think about what sample sizes you need, what your demographic is, how to diversify (or not), etc. If you won’t be the person who carries out the analysis, call a statistician! Their help in designing a data-solid study will be invaluable.
To quote R.A. Fisher (c. 1938)[1]:
“To call in the statistician after the experiment is done may be no more than asking him to perform a postmortem examination: he may be able to say what the experiment died of.”
If you’re already at the analysis, double check if your overall results hold up in the data subsets. And in case of a sampling problem, weigh your data according to sample sizes.
If your data are binary, do stratified 2×2 tables and compare with the combined table.
Check for interactions between confound and both the outcome and the factors you are interested in.
Be smart. Do not take frequency data at face value: interpret sensibly.
Thanks for reading our full article! Interested in another great read? Take a look at our piece comparing the two types of statistical errors: false positive and false negative.
[1] Norton, H. J. and Divine, G. (2015), Simpson’s paradox … and how to avoid it. Significance, 12: 40–43. doi:10.1111/j.1740-9713.2015.00844.x
Earn your Data Science Degree
Expert instructions, unmatched support and a verified certificate upon completion!
2 comments
Leave a Reply
Your email address will not be published.
free data science career guid
You have Successfully Subscribed!
×
Learn Data Science
this Summer!
Get 50% OFF
|
{
"url": "https://365datascience.com/simpsons-paradox/",
"source_domain": "365datascience.com",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "118964",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4R76R3MDSZUJVFI5V2GGEOQOYZ56ERCX",
"WARC-Concurrent-To": "<urn:uuid:440ec577-8efa-4654-a44f-03521ebe41db>",
"WARC-Date": "2020-07-06T06:38:52Z",
"WARC-IP-Address": "51.159.18.229",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TC5Q5V5K4SS2CJ3BYOSRFBFXHAV3SATW",
"WARC-Record-ID": "<urn:uuid:3b6137ea-89bc-4013-aea6-e6221e9daed4>",
"WARC-Target-URI": "https://365datascience.com/simpsons-paradox/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1fcb1445-ad64-45a9-9eda-ce3fd58b886e>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-57.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,
63,
64,
85,
125,
206,
207,
270,
271,
516,
517,
529,
530,
583,
584,
586,
587,
963,
964,
1334,
1335,
1420,
1421,
1494,
1565,
1646,
1711,
1712,
1735,
1736,
1753,
1754,
2102,
2103,
2130,
2131,
2489,
2490,
2647,
2648,
2784,
2785,
2841,
2842,
2970,
2971,
3027,
3028,
3216,
3217,
3520,
3521,
3561,
3562,
3718,
3719,
3745,
3746,
3818,
3819,
3821,
3822,
4012,
4013,
4064,
4065,
4168,
4169,
4219,
4220,
4573,
4574,
4927,
4928,
5280,
5281,
5480,
5481,
5619,
5620,
5642,
5643,
6064,
6065,
6451,
6452,
6958,
6959,
7192,
7193,
7209,
7210,
7232,
7233,
7293,
7294,
7527,
7528,
7551,
7552,
7581,
7582,
8274,
8275,
8630,
8631,
8638,
8639,
8962,
8963,
9408,
9409,
9411,
9412,
9435,
9436,
9457,
9458,
9671,
9672,
9687,
9688,
9923,
9924,
9951,
9952,
10134,
10135,
10215,
10216,
10243,
10244,
10467,
10468,
10721,
10722,
10773,
10774,
10798,
10799,
11153,
11154,
11911,
11912,
11949,
11950,
12249,
12250,
12610,
12611,
12646,
12647,
12825,
12826,
12828,
12829,
13008,
13009,
13096,
13097,
13197,
13198,
13270,
13271,
13449,
13450,
13452,
13453,
13597,
13598,
13628,
13629,
13712,
13713,
13724,
13725,
13739,
13740,
13782,
13783,
13813,
13814,
13848,
13849,
13851,
13870,
13883
],
"line_end_idx": [
63,
64,
85,
125,
206,
207,
270,
271,
516,
517,
529,
530,
583,
584,
586,
587,
963,
964,
1334,
1335,
1420,
1421,
1494,
1565,
1646,
1711,
1712,
1735,
1736,
1753,
1754,
2102,
2103,
2130,
2131,
2489,
2490,
2647,
2648,
2784,
2785,
2841,
2842,
2970,
2971,
3027,
3028,
3216,
3217,
3520,
3521,
3561,
3562,
3718,
3719,
3745,
3746,
3818,
3819,
3821,
3822,
4012,
4013,
4064,
4065,
4168,
4169,
4219,
4220,
4573,
4574,
4927,
4928,
5280,
5281,
5480,
5481,
5619,
5620,
5642,
5643,
6064,
6065,
6451,
6452,
6958,
6959,
7192,
7193,
7209,
7210,
7232,
7233,
7293,
7294,
7527,
7528,
7551,
7552,
7581,
7582,
8274,
8275,
8630,
8631,
8638,
8639,
8962,
8963,
9408,
9409,
9411,
9412,
9435,
9436,
9457,
9458,
9671,
9672,
9687,
9688,
9923,
9924,
9951,
9952,
10134,
10135,
10215,
10216,
10243,
10244,
10467,
10468,
10721,
10722,
10773,
10774,
10798,
10799,
11153,
11154,
11911,
11912,
11949,
11950,
12249,
12250,
12610,
12611,
12646,
12647,
12825,
12826,
12828,
12829,
13008,
13009,
13096,
13097,
13197,
13198,
13270,
13271,
13449,
13450,
13452,
13453,
13597,
13598,
13628,
13629,
13712,
13713,
13724,
13725,
13739,
13740,
13782,
13783,
13813,
13814,
13848,
13849,
13851,
13870,
13883,
13894
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13894,
"ccnet_original_nlines": 186,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4032485783100128,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013418080285191536,
"rps_doc_frac_lines_end_with_ellipsis": 0.005347589962184429,
"rps_doc_frac_no_alph_words": 0.1910310685634613,
"rps_doc_frac_unique_words": 0.36073458194732666,
"rps_doc_mean_word_length": 4.857017993927002,
"rps_doc_num_sentences": 170,
"rps_doc_symbol_to_word_ratio": 0.0014124299632385373,
"rps_doc_unigram_entropy": 5.855283737182617,
"rps_doc_word_count": 2287,
"rps_doc_frac_chars_dupe_10grams": 0.010983079671859741,
"rps_doc_frac_chars_dupe_5grams": 0.03736045956611633,
"rps_doc_frac_chars_dupe_6grams": 0.01575440913438797,
"rps_doc_frac_chars_dupe_7grams": 0.01575440913438797,
"rps_doc_frac_chars_dupe_8grams": 0.01575440913438797,
"rps_doc_frac_chars_dupe_9grams": 0.01575440913438797,
"rps_doc_frac_chars_top_2gram": 0.0316888689994812,
"rps_doc_frac_chars_top_3gram": 0.004681310150772333,
"rps_doc_frac_chars_top_4gram": 0.007292040158063173,
"rps_doc_books_importance": -979.4220581054688,
"rps_doc_books_importance_length_correction": -979.4220581054688,
"rps_doc_openwebtext_importance": -597.7713623046875,
"rps_doc_openwebtext_importance_length_correction": -597.7713623046875,
"rps_doc_wikipedia_importance": -433.07470703125,
"rps_doc_wikipedia_importance_length_correction": -433.07470703125
},
"fasttext": {
"dclm": 0.3014376163482666,
"english": 0.9480063319206238,
"fineweb_edu_approx": 2.397996187210083,
"eai_general_math": 0.6100181937217712,
"eai_open_web_math": 0.4762178659439087,
"eai_web_code": 0.1035798192024231
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,225,272,901,861,011,000
|
Quickstart: Determining current heading with the compass
Language: HTML | XAML
Quickstart: Determining current heading with the compass (HTML)
You can use the compass to determine the current heading with an app written in JavaScript.
Navigation apps use the compass to determine the direction a device is facing and then orient the map accordingly.
Objective: After completing this quickstart you will understand how to use the compass to detect changes in heading.
Prerequisites
You should be familiar with HTML, JavaScript, and events.
The device or emulator that you're using must support an compass.
Time to complete: 15 minutes.
Instructions
1. Open Microsoft Visual Studio
Open an instance of Microsoft Visual Studio
2. Create a new project
Create a new project, choosing a Blank App from the JavaScript/Store Apps project types.
3. Replace the JavaScript code
Open your project's default.js file and replace the existing code with the following.
// For an introduction to the Blank template, see the following documentation:
// http://go.microsoft.com/fwlink/p/?linkid=232509
(function () {
"use strict";
var compass;
var app = WinJS.Application;
// This function is invoked within onDataChanged to
// retrieve the given identifier from the HTML document.
function id(elementId) {
return document.getElementById(elementId);
}
// This function is called each time a compass event
// is fired by the driver.
function onDataChanged(e) {
var reading = e.reading;
id('txtMagNorth').innerHTML = reading.headingMagneticNorth.toFixed(2);
if (reading.headingTrueNorth != null) {
id('txtTrueNorth').innerHTML = reading.headingTrueNorth.toFixed(2);
}
}
// This function responds to all app activations.
app.onactivated = function (eventObject) {
if (eventObject.detail.kind === Windows.ApplicationModel.Activation.ActivationKind.launch) {
// Retrieve the default compass and
compass = Windows.Devices.Sensors.Compass.getDefault();
// Choose a report interval supported by the sensor
var minimumReportInterval = compass.minimumReportInterval;
var reportInterval = minimumReportInterval > 16 ? minimumReportInterval : 16;
compass.reportInterval = reportInterval;
// Establish the event handler
compass.addEventListener("readingchanged", onDataChanged);
WinJS.UI.processAll();
}
};
app.start();
})();
4. Add the HTML for the apps
Open the default.html file for the Windows and Windows Phone projects, and copy the following HTML into inside the BODY tags of the file.
<div class="item" id="scenario1Output">
Magnetic North: <a id="txtMagNorth">no data</a>
<br />
True North: <a id="txtTrueNorth">no data</a>
</div>
5. Build, deploy and run the app
Press F5 or select Debug > Start Debugging to build, deploy, and run the app.
Once the app is running, you can change the accelerometer values by moving the device or using the emulator tools.
6. Stop the app
1. Press ALT+Tab to return to Visual Studio.
2. Press Shift+F5 or select Debug > Stop Debugging to stop the app.
Summary and next steps
The previous example demonstrates how little code you'll need to write in order to integrate compass input in your app.
The app establishes a connection with the default compass in the onactivated function. This occurs on the following line.
compass = Windows.Devices.Sensors.Compass.getDefault();
The new compass data is captured in the onDataChanged function. Each time the sensor driver receives new data from the sensor, it passes the values to your app by using this function (or event handler). The app registers this event handler on the following line.
compass.addEventListener("readingchanged", onDataChanged);
These new values are written to the screen via updates to the DOM elements shown below.
<div class="item" id="scenario1Output">
Magnetic North: <a id="txtMagNorth">no data</a>
<br />
True North: <a id="txtTrueNorth">no data</a>
</div>
The app establishes the report interval within the onactivated function. This code retrieves the minimum interval supported by the device and compares it to a requested interval of 16 milliseconds (which approximates a 60-Hz refresh rate). If the minimum supported interval is greater than the requested interval, the code sets the value to the minimum. Otherwise, it sets the value to the requested interval.
var minimumReportInterval = accelerometer.minimumReportInterval;
var reportInterval = minimumReportInterval > 16 ? minimumReportInterval : 16;
accelerometer.reportInterval = reportInterval;
If you're writing a navigation app, the next steps will involve using compass input to control map orientation.
Related topics
Compass class
Compass Sample
Show:
© 2017 Microsoft
|
{
"url": "https://msdn.microsoft.com/en-us/library/windows/apps/Hh465244(v=win.10).aspx",
"source_domain": "msdn.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "94541",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7XSDRH7QKN6IKGZUCJZ76SWTQILC76DA",
"WARC-Concurrent-To": "<urn:uuid:0dd7a8e4-5a5f-463b-a432-327f9c342f6d>",
"WARC-Date": "2017-12-14T13:44:29Z",
"WARC-IP-Address": "157.56.148.19",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:XABWQFM3KB66F3IHA7A24RLFCTY63RSY",
"WARC-Record-ID": "<urn:uuid:dee49826-af3c-4ea2-adda-a4833bc852fe>",
"WARC-Target-URI": "https://msdn.microsoft.com/en-us/library/windows/apps/Hh465244(v=win.10).aspx",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:39200951-b7d7-41aa-af6c-d52a1d735f80>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-136-81-210.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
57,
79,
80,
144,
145,
237,
238,
353,
354,
471,
472,
486,
487,
545,
546,
612,
613,
643,
644,
657,
658,
690,
691,
735,
736,
760,
761,
850,
851,
882,
883,
969,
970,
971,
972,
1051,
1102,
1117,
1135,
1152,
1153,
1186,
1187,
1243,
1304,
1333,
1384,
1390,
1391,
1448,
1479,
1511,
1544,
1623,
1671,
1751,
1761,
1767,
1768,
1822,
1869,
1970,
2018,
2086,
2087,
2151,
2222,
2312,
2365,
2366,
2409,
2480,
2515,
2525,
2532,
2533,
2550,
2556,
2557,
2558,
2559,
2588,
2589,
2727,
2728,
2729,
2730,
2731,
2775,
2831,
2846,
2899,
2910,
2911,
2912,
2945,
2946,
3024,
3025,
3140,
3141,
3157,
3158,
3205,
3275,
3276,
3299,
3300,
3420,
3421,
3543,
3544,
3545,
3601,
3602,
3865,
3866,
3867,
3926,
3927,
4015,
4016,
4017,
4061,
4117,
4132,
4185,
4196,
4197,
4607,
4608,
4609,
4674,
4752,
4799,
4800,
4801,
4913,
4914,
4929,
4930,
4944,
4959,
4960,
4962,
4963,
4965,
4966,
4972
],
"line_end_idx": [
57,
79,
80,
144,
145,
237,
238,
353,
354,
471,
472,
486,
487,
545,
546,
612,
613,
643,
644,
657,
658,
690,
691,
735,
736,
760,
761,
850,
851,
882,
883,
969,
970,
971,
972,
1051,
1102,
1117,
1135,
1152,
1153,
1186,
1187,
1243,
1304,
1333,
1384,
1390,
1391,
1448,
1479,
1511,
1544,
1623,
1671,
1751,
1761,
1767,
1768,
1822,
1869,
1970,
2018,
2086,
2087,
2151,
2222,
2312,
2365,
2366,
2409,
2480,
2515,
2525,
2532,
2533,
2550,
2556,
2557,
2558,
2559,
2588,
2589,
2727,
2728,
2729,
2730,
2731,
2775,
2831,
2846,
2899,
2910,
2911,
2912,
2945,
2946,
3024,
3025,
3140,
3141,
3157,
3158,
3205,
3275,
3276,
3299,
3300,
3420,
3421,
3543,
3544,
3545,
3601,
3602,
3865,
3866,
3867,
3926,
3927,
4015,
4016,
4017,
4061,
4117,
4132,
4185,
4196,
4197,
4607,
4608,
4609,
4674,
4752,
4799,
4800,
4801,
4913,
4914,
4929,
4930,
4944,
4959,
4960,
4962,
4963,
4965,
4966,
4972,
4988
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4988,
"ccnet_original_nlines": 149,
"rps_doc_curly_bracket": 0.0024057698901742697,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24890351295471191,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014254390262067318,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2850877344608307,
"rps_doc_frac_unique_words": 0.4127516746520996,
"rps_doc_mean_word_length": 6.151006698608398,
"rps_doc_num_sentences": 79,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.930110454559326,
"rps_doc_word_count": 596,
"rps_doc_frac_chars_dupe_10grams": 0.0540098212659359,
"rps_doc_frac_chars_dupe_5grams": 0.15166394412517548,
"rps_doc_frac_chars_dupe_6grams": 0.14238953590393066,
"rps_doc_frac_chars_dupe_7grams": 0.08074194937944412,
"rps_doc_frac_chars_dupe_8grams": 0.0540098212659359,
"rps_doc_frac_chars_dupe_9grams": 0.0540098212659359,
"rps_doc_frac_chars_top_2gram": 0.01309328991919756,
"rps_doc_frac_chars_top_3gram": 0.01472994964569807,
"rps_doc_frac_chars_top_4gram": 0.012274960055947304,
"rps_doc_books_importance": -367.8562927246094,
"rps_doc_books_importance_length_correction": -367.8562927246094,
"rps_doc_openwebtext_importance": -210.18045043945312,
"rps_doc_openwebtext_importance_length_correction": -210.18045043945312,
"rps_doc_wikipedia_importance": -198.63742065429688,
"rps_doc_wikipedia_importance_length_correction": -198.63742065429688
},
"fasttext": {
"dclm": 0.9772040843963623,
"english": 0.6551105380058289,
"fineweb_edu_approx": 2.922126531600952,
"eai_general_math": 0.3507867455482483,
"eai_open_web_math": 0.06006402149796486,
"eai_web_code": 0.8431578874588013
}
}
|
{
"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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,901,351,626,057,052,000
|
Swap
If you want to swap tokens on the same chain
// initiate transfer
const swapParams: SwapParams = {
amount: amount,
fromAccountAddress: fromAddress,
toAccountAddress: toAddress,
sourceToken: sourceTokenInfo,
destinationToken: destinationTokenInfo,
minimumReceiveAmount: await sdk.getAmountToBeReceived(amount, sourceTokenInfo, destinationTokenInfo),
};
const rawTransactionTransfer = await sdk.bridge.rawTxBuilder.send(swapParams) as RawEvmTransaction;
console.log(`Swaping ${amount} ${sourceTokenInfo.symbol}`);
const txReceipt = await sendRawTransaction(rawTransactionTransfer);
console.log("tx id:", txReceipt.transactionHash);
Full example
Last updated
|
{
"url": "https://docs-core.allbridge.io/sdk/guides/general/swap",
"source_domain": "docs-core.allbridge.io",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "168543",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6KAO6B36ZHIYX4CJUJWJOM3EHH4CP6BU",
"WARC-Concurrent-To": "<urn:uuid:a60592b2-9918-479e-8282-5309f73ae780>",
"WARC-Date": "2024-06-13T00:31:38Z",
"WARC-IP-Address": "104.21.11.253",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SWHLNNQPLPIIDHHDAYPY6WPP7C5CNPUW",
"WARC-Record-ID": "<urn:uuid:3444d4e2-170e-4fb7-b86e-5abf56c1e75b>",
"WARC-Target-URI": "https://docs-core.allbridge.io/sdk/guides/general/swap",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b901134c-8c7c-45b7-bcd0-6baa3f80595e>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-81\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
5,
6,
51,
52,
73,
106,
124,
159,
190,
222,
264,
368,
371,
471,
472,
532,
600,
650,
651,
664,
665
],
"line_end_idx": [
5,
6,
51,
52,
73,
106,
124,
159,
190,
222,
264,
368,
371,
471,
472,
532,
600,
650,
651,
664,
665,
677
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 677,
"ccnet_original_nlines": 21,
"rps_doc_curly_bracket": 0.0088626304641366,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0747663602232933,
"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.40186914801597595,
"rps_doc_frac_unique_words": 0.8039215803146362,
"rps_doc_mean_word_length": 10.72549057006836,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.6292238235473633,
"rps_doc_word_count": 51,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -51.39432907104492,
"rps_doc_books_importance_length_correction": -57.065677642822266,
"rps_doc_openwebtext_importance": -35.800506591796875,
"rps_doc_openwebtext_importance_length_correction": -41.47185516357422,
"rps_doc_wikipedia_importance": -28.180635452270508,
"rps_doc_wikipedia_importance_length_correction": -33.851985931396484
},
"fasttext": {
"dclm": 0.46170443296432495,
"english": 0.5730157494544983,
"fineweb_edu_approx": 2.027996063232422,
"eai_general_math": 0.7174975872039795,
"eai_open_web_math": 0.03652900084853172,
"eai_web_code": 0.0036310600116848946
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "332.87",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,168,675,556,322,981,000
|
Thread: How do I do that?
1. #1
Registered User
Join Date
Sep 2004
Posts
99
Thumbs down How do I do that?
I wrote a class called MyString. It uses NTS string, c-style. Basically consists of constructors, copy constructor and destructor. Nothing else.
I also wrote another class, called People.
Code:
class People {
private:
MyString name;
MyString address;
int age;
public:
// methods such as constructors asking user to provide
// all the info to instantiate an object. Did not have a problem
// with assigning values to MyString name or MyString address.
I need to write a show() method in this class which will display all its private members...... Here I encountered problems. First it did not compile , it complained that << does not defined in there. OK, so I tried to write a method overloading the operator << to display MyString types data members.
Here it is:
Code:
ostream& operator<<(ostream& os, const MyString &s) {
return os<<s.getName()<<" "<<s.getAddress()<<endl;
}
The compiler complains that
`std::ostream& People::operator<<(std::ostream&, const MyString&)' must take exactly one argument
and then that
'const class MyString' has no member named 'getName'
-- well, it doesn't because it is a public method for People class, not MyString class......
Can anybody help me solve this puzzle? Where am I wrong?
2. #2
Guest Sebastiani's Avatar
Join Date
Aug 2001
Location
Waterloo, Texas
Posts
5,708
>> OK, so I tried to write a method overloading the operator << to display MyString types data members.
well it looks like you're mainipulating a People object within the function.
>> The compiler complains that
make it a friend function.
Code:
struct People
{
friend
ostream &
operator << (ostream & os, const People & me)
{
return os<<me.getName()<<" "<<me.getAddress()<<endl;
}
};
Code:
#include <cmath>
#include <complex>
bool euler_flip(bool value)
{
return std::pow
(
std::complex<float>(std::exp(1.0)),
std::complex<float>(0, 1)
* std::complex<float>(std::atan(1.0)
*(1 << (value + 2)))
).real() < 0;
}
3. #3
Registered User
Join Date
Sep 2004
Posts
99
Maybe I am doing that wrong, but now the compiler lists << as no match again...
What I was thinking, maybe it has a problem with the return type of getName() and getAddress()...... It is MyString.
Code:
MyString getAddress() const { return address; }
Would that cause the problem?
4. #4
Guest Sebastiani's Avatar
Join Date
Aug 2001
Location
Waterloo, Texas
Posts
5,708
did you overload MyString with operator << as well?
Code:
#include <cmath>
#include <complex>
bool euler_flip(bool value)
{
return std::pow
(
std::complex<float>(std::exp(1.0)),
std::complex<float>(0, 1)
* std::complex<float>(std::atan(1.0)
*(1 << (value + 2)))
).real() < 0;
}
5. #5
Registered User
Join Date
Sep 2004
Posts
99
no. Should I?
-----------
Well, I tried that too. It compiles fine, but when I run the program it displays a blank line where the MyString vars (from People class) should go.
I tried to do this:
Code:
friend ostream& operator<<(ostream& os, const MyString &s) {
return os<<s.str<<" "<<endl;
}
void showit() { cout << str; }
-- that's in MyString class, and it works.......... Why it doesn't work for People class?
Last edited by kocika73; 04-07-2006 at 10:19 PM. Reason: tried that
6. #6
Registered User
Join Date
Jan 2005
Posts
7,363
Does your copy constructor for the MyString class work correctly?
Also, your MyString class operator<< shouldn't havethe space and the newline from a design perspective. Just have it output the string and the People class operator<< can do the formatting instead.
Popular pages Recent additions subscribe to a feed
Website Security Test
|
{
"url": "https://cboard.cprogramming.com/cplusplus-programming/77867-how-do-i-do.html",
"source_domain": "cboard.cprogramming.com",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "60320",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WQW2ZFXG2SIGYVL7M7DFOWSMCWA6S6IV",
"WARC-Concurrent-To": "<urn:uuid:315f7374-d700-4cee-bc44-1c84a39bb1f5>",
"WARC-Date": "2017-03-26T09:28:03Z",
"WARC-IP-Address": "76.74.254.184",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:IS4F5YMGQUCPPAPNXY3ZLTI3ZWBUQ2AU",
"WARC-Record-ID": "<urn:uuid:219ddd26-f00f-401a-aa29-2bef31fe25fe>",
"WARC-Target-URI": "https://cboard.cprogramming.com/cplusplus-programming/77867-how-do-i-do.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e6e2f685-40c7-476b-840f-79146b69d366>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
26,
27,
35,
55,
69,
82,
92,
99,
100,
134,
135,
284,
331,
341,
360,
373,
398,
426,
450,
462,
524,
596,
666,
971,
987,
997,
1055,
1123,
1142,
1174,
1276,
1294,
1351,
1448,
1509,
1510,
1518,
1548,
1562,
1575,
1588,
1608,
1618,
1628,
1736,
1737,
1818,
1819,
1854,
1855,
1886,
1887,
1897,
1916,
1923,
1936,
1952,
2003,
2010,
2069,
2077,
2085,
2095,
2116,
2139,
2171,
2177,
2201,
2211,
2260,
2299,
2348,
2381,
2403,
2409,
2410,
2418,
2438,
2452,
2465,
2475,
2482,
2566,
2687,
2697,
2749,
2783,
2784,
2792,
2822,
2836,
2849,
2862,
2882,
2892,
2902,
2958,
2968,
2989,
3012,
3044,
3050,
3074,
3084,
3133,
3172,
3221,
3254,
3276,
3282,
3283,
3291,
3311,
3325,
3338,
3348,
3355,
3373,
3374,
3390,
3543,
3567,
3577,
3642,
3688,
3709,
3748,
3842,
3914,
3915,
3923,
3943,
3957,
3970,
3980,
3990,
4060,
4061,
4263,
4264,
4315
],
"line_end_idx": [
26,
27,
35,
55,
69,
82,
92,
99,
100,
134,
135,
284,
331,
341,
360,
373,
398,
426,
450,
462,
524,
596,
666,
971,
987,
997,
1055,
1123,
1142,
1174,
1276,
1294,
1351,
1448,
1509,
1510,
1518,
1548,
1562,
1575,
1588,
1608,
1618,
1628,
1736,
1737,
1818,
1819,
1854,
1855,
1886,
1887,
1897,
1916,
1923,
1936,
1952,
2003,
2010,
2069,
2077,
2085,
2095,
2116,
2139,
2171,
2177,
2201,
2211,
2260,
2299,
2348,
2381,
2403,
2409,
2410,
2418,
2438,
2452,
2465,
2475,
2482,
2566,
2687,
2697,
2749,
2783,
2784,
2792,
2822,
2836,
2849,
2862,
2882,
2892,
2902,
2958,
2968,
2989,
3012,
3044,
3050,
3074,
3084,
3133,
3172,
3221,
3254,
3276,
3282,
3283,
3291,
3311,
3325,
3338,
3348,
3355,
3373,
3374,
3390,
3543,
3567,
3577,
3642,
3688,
3709,
3748,
3842,
3914,
3915,
3923,
3943,
3957,
3970,
3980,
3990,
4060,
4061,
4263,
4264,
4315,
4336
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4336,
"ccnet_original_nlines": 141,
"rps_doc_curly_bracket": 0.003920659888535738,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22067363560199738,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0220673605799675,
"rps_doc_frac_lines_end_with_ellipsis": 0.014084509573876858,
"rps_doc_frac_no_alph_words": 0.3623693287372589,
"rps_doc_frac_unique_words": 0.44672897458076477,
"rps_doc_mean_word_length": 4.9869160652160645,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0.023228799924254417,
"rps_doc_unigram_entropy": 5.094259262084961,
"rps_doc_word_count": 535,
"rps_doc_frac_chars_dupe_10grams": 0.2143927961587906,
"rps_doc_frac_chars_dupe_5grams": 0.29685157537460327,
"rps_doc_frac_chars_dupe_6grams": 0.2878560721874237,
"rps_doc_frac_chars_dupe_7grams": 0.2878560721874237,
"rps_doc_frac_chars_dupe_8grams": 0.25487256050109863,
"rps_doc_frac_chars_dupe_9grams": 0.2143927961587906,
"rps_doc_frac_chars_top_2gram": 0.017991000786423683,
"rps_doc_frac_chars_top_3gram": 0.026986509561538696,
"rps_doc_frac_chars_top_4gram": 0.03298351168632507,
"rps_doc_books_importance": -371.2054138183594,
"rps_doc_books_importance_length_correction": -371.2054138183594,
"rps_doc_openwebtext_importance": -202.4234619140625,
"rps_doc_openwebtext_importance_length_correction": -202.4234619140625,
"rps_doc_wikipedia_importance": -167.69131469726562,
"rps_doc_wikipedia_importance_length_correction": -167.69131469726562
},
"fasttext": {
"dclm": 0.09530193358659744,
"english": 0.8395681977272034,
"fineweb_edu_approx": 1.6629081964492798,
"eai_general_math": 0.3328978419303894,
"eai_open_web_math": 0.28510361909866333,
"eai_web_code": 0.021670399233698845
}
}
|
{
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,822,104,878,271,177,000
|
Skip to Content
0
Former Member
Feb 09, 2008 at 09:45 AM
Calculating the number of days based on transaction in Query
24 Views
Hi friends,
I would be greatful if u can help me out. I have got a situtation where in i need to take the day when the transaction has occured otherwise i dont need to take that day. For example if one transaction occurs on 1st , i need to take that day and if the transaction dosent occur then i need to ignore it. If there is one transaction or multiple transactions i need to take the day only once.
Like transaction has happened on 1st Jan so it will be considered,
on 2nd the transaction dosent happen so i need to ignore it
on 3rd there is a transaction so its taken.
So its like 1st - 1
2nd - 0
3rd - 1
So total will be 2.
Transactions are being taken from a cube. Kindly let me know as to how to do this in query.
Thanks,
Kapil
|
{
"url": "https://answers.sap.com/questions/3603443/calculating-the-number-of-days-based-on-transactio.html",
"source_domain": "answers.sap.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "54178",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XJK6KHC43B5H3VXI7RLU7MSGM5HJF52H",
"WARC-Concurrent-To": "<urn:uuid:cc7da249-836b-43ea-9e15-57816c5d84b5>",
"WARC-Date": "2023-03-21T09:27:18Z",
"WARC-IP-Address": "18.198.217.67",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YM2L2TJZOCAIMFU62UWR7OS2GGMXYIR4",
"WARC-Record-ID": "<urn:uuid:82e8e444-2733-4e6e-8672-7ff9603329f0>",
"WARC-Target-URI": "https://answers.sap.com/questions/3603443/calculating-the-number-of-days-based-on-transactio.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:384ff7cc-8da0-4756-aaee-957272a79f6b>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-134\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,
18,
32,
57,
58,
119,
120,
129,
130,
142,
143,
534,
535,
602,
603,
663,
664,
708,
709,
729,
730,
738,
739,
747,
748,
768,
769,
861,
862,
870,
871
],
"line_end_idx": [
16,
18,
32,
57,
58,
119,
120,
129,
130,
142,
143,
534,
535,
602,
603,
663,
664,
708,
709,
729,
730,
738,
739,
747,
748,
768,
769,
861,
862,
870,
871,
876
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 876,
"ccnet_original_nlines": 31,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5263158082962036,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015789469704031944,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14210526645183563,
"rps_doc_frac_unique_words": 0.5523256063461304,
"rps_doc_mean_word_length": 3.8953487873077393,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.282903671264648,
"rps_doc_word_count": 172,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.14626866579055786,
"rps_doc_frac_chars_dupe_6grams": 0.05074626952409744,
"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.053731340914964676,
"rps_doc_frac_chars_top_3gram": 0.05223881080746651,
"rps_doc_frac_chars_top_4gram": 0.04925372824072838,
"rps_doc_books_importance": -74.02652740478516,
"rps_doc_books_importance_length_correction": -74.02652740478516,
"rps_doc_openwebtext_importance": -34.35873031616211,
"rps_doc_openwebtext_importance_length_correction": -27.870166778564453,
"rps_doc_wikipedia_importance": -32.444549560546875,
"rps_doc_wikipedia_importance_length_correction": -32.444549560546875
},
"fasttext": {
"dclm": 0.02886044979095459,
"english": 0.9544820785522461,
"fineweb_edu_approx": 1.0410208702087402,
"eai_general_math": 0.6030154824256897,
"eai_open_web_math": 0.4614088535308838,
"eai_web_code": 0.03874194994568825
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.442",
"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": "-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": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,012,821,053,357,796,000
|
2
CやC++では、引数名 = 値のような出力処理を下記のようなマクロで定義ができ、
引数を１つ渡すだけで呼び出すことができたと思います。
#define DPRINTF(x) printf(#x " = %d\n", (x))
DPRINTF(val0);
DPRINTF(val1);
一方、C#では言語仕様でマクロが使えないと聞いたのですが、上記のように
引数を１つ渡すだけで引数名と値を表示できる処理は記述できるのでしょうか？
もしよい方法があれば、ご教授いただけると助かります。
1
6
C#はオブジェクト指向を採用しているので、変数そのものを出力したいというシーンがあまりないように思います。
重要な値であればクラスメンバーとして保持されているでしょうし、ToString()もしくは他のメソッドで表現できるようになっているべきです。クラス利用者側は適切なメソッドを呼ぶだけです。
それでも簡単な記述で変数名と値を取得するためのハックとしては匿名型があります。
匿名型では本来 new { name = value } の形式で構築しますが、省略形式として new { variable } があります。この場合 nameof(variable) がプロパティ名となります。
匿名型の場合、 , 区切りで複数の値を指定することができる点と ToString() メソッドも適切に動作します。
var i = 0;
var s = "abc";
Console.WriteLine(new { i, s }.ToString());
// => { i = 0, s = abc }
2
他の方がコメントされているように、nameofを使用するのが適切かと思います。
どうしても「引数を１つ渡すだけ」を実現したいのであれば、下記の様に式木を使用することもできます。
実行効率が大変悪いので、(デバッグ目的と推察されるので)デバッグビルドでのみ実行されるようにしています。
using System;
using System.Linq.Expressions;
public static class Program {
public static void Main() {
var val0 = "aaa";
DbgPrint(() => val0);
}
[System.Diagnostics.Conditional("DEBUG")]
public static void DbgPrint<T>(Expression<Func<T>> expression)
{
var name = ((MemberExpression)expression.Body).Member.Name;
var value = expression.Compile().Invoke();
Console.WriteLine($"{name} = {value}");
}
}
1
C#では呼び出し元の変数名を受け取ることはできません。
従いまして、呼び出し側で、変数とその名前を引数で渡すことになると思います。
変数の名前はnameof(xx)で取得することができます。
DPRINTF(val0);
DPRINTF(val0, nameof(val0));
みたいになると思います。
1
現行のC#(8.0)ではできませんが、将来のC#(10.0以降)に提案されていますので情報として挙げておきます。
https://github.com/dotnet/csharplang/issues/287
// NOTE: Maybe C# 10.0 or later
public static class FooExtensions
{
public static void DbgPrint<T>(T value, [CallerArgumentExpression("value")] string name = null)
{
Console.WriteLine($"{name} = {value}");
}
}
var a = 123;
FooExtensions.DbgPrint(a); // "a = 123"
回答
“回答を投稿”をクリックすることで利用規約プライバシーポリシー、及びクッキーポリシーに同意したものとみなされます。
求めていた回答ではありませんか？ のタグが付いた他の質問を参照するか、自分で質問をする
|
{
"url": "https://ja.stackoverflow.com/questions/70457/c%E3%81%AB%E3%81%8A%E3%81%91%E3%82%8B%E3%83%9E%E3%82%AF%E3%83%AD%E3%81%AE%E4%BB%A3%E6%9B%BF%E6%96%B9%E6%B3%95%E3%81%AB%E3%81%A4%E3%81%8D%E3%81%BE%E3%81%97%E3%81%A6",
"source_domain": "ja.stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "174037",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CCHB5KL4K4QUYXBABPFU2USZUANM6EML",
"WARC-Concurrent-To": "<urn:uuid:247b8fd5-6767-4089-8032-5660ff8b4c57>",
"WARC-Date": "2021-05-07T20:30:54Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WQ6DAVCJE5VK6ZNXMCIKP7QPDQS4AAZ3",
"WARC-Record-ID": "<urn:uuid:2d3dd53d-4045-4f6c-ae12-496f4d353adc>",
"WARC-Target-URI": "https://ja.stackoverflow.com/questions/70457/c%E3%81%AB%E3%81%8A%E3%81%91%E3%82%8B%E3%83%9E%E3%82%AF%E3%83%AD%E3%81%AE%E4%BB%A3%E6%9B%BF%E6%96%B9%E6%B3%95%E3%81%AB%E3%81%A4%E3%81%8D%E3%81%BE%E3%81%97%E3%81%A6",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:369b750a-c06c-49e5-a48a-bf8f459ebbe3>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-101.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,
44,
71,
72,
119,
120,
135,
150,
151,
187,
224,
225,
252,
253,
255,
257,
258,
312,
406,
407,
408,
448,
555,
613,
614,
625,
640,
641,
685,
710,
712,
713,
753,
754,
803,
856,
857,
871,
902,
903,
933,
965,
991,
1021,
1027,
1073,
1140,
1146,
1214,
1265,
1313,
1319,
1321,
1323,
1324,
1352,
1390,
1420,
1421,
1436,
1437,
1466,
1467,
1480,
1481,
1483,
1484,
1541,
1542,
1590,
1591,
1623,
1657,
1659,
1759,
1765,
1813,
1819,
1821,
1822,
1823,
1836,
1876,
1877,
1880,
1881,
1939,
1940
],
"line_end_idx": [
2,
3,
44,
71,
72,
119,
120,
135,
150,
151,
187,
224,
225,
252,
253,
255,
257,
258,
312,
406,
407,
408,
448,
555,
613,
614,
625,
640,
641,
685,
710,
712,
713,
753,
754,
803,
856,
857,
871,
902,
903,
933,
965,
991,
1021,
1027,
1073,
1140,
1146,
1214,
1265,
1313,
1319,
1321,
1323,
1324,
1352,
1390,
1420,
1421,
1436,
1437,
1466,
1467,
1480,
1481,
1483,
1484,
1541,
1542,
1590,
1591,
1623,
1657,
1659,
1759,
1765,
1813,
1819,
1821,
1822,
1823,
1836,
1876,
1877,
1880,
1881,
1939,
1940,
1983
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1983,
"ccnet_original_nlines": 89,
"rps_doc_curly_bracket": 0.013111449778079987,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08549223095178604,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04663211852312088,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6502590775489807,
"rps_doc_frac_unique_words": 0.6774193644523621,
"rps_doc_mean_word_length": 12.903225898742676,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.020725389942526817,
"rps_doc_unigram_entropy": 4.256439685821533,
"rps_doc_word_count": 124,
"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.03750000149011612,
"rps_doc_frac_chars_top_3gram": 0.029999999329447746,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -163.45962524414062,
"rps_doc_books_importance_length_correction": -163.45962524414062,
"rps_doc_openwebtext_importance": -104.61056518554688,
"rps_doc_openwebtext_importance_length_correction": -104.61056518554688,
"rps_doc_wikipedia_importance": -91.77409362792969,
"rps_doc_wikipedia_importance_length_correction": -91.77409362792969
},
"fasttext": {
"dclm": 0.9377778172492981,
"english": 0.0012463399907574058,
"fineweb_edu_approx": 3.6404080390930176,
"eai_general_math": 0.07244973629713058,
"eai_open_web_math": 0.013912320137023926,
"eai_web_code": 0.7137012481689453
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,354,591,097,897,112,000
|
Сортировка Подсчетом
Тема в разделе "Общие вопросы по С и С++", создана пользователем guffigubber, 12 окт 2011.
Наш партнер Genesis Hackspace
Статус темы:
Закрыта.
1. guffigubber
guffigubber Гость
в общем, суть проблемы. Я новичок в C++.
я создаю динамический массив и заполняю его. затем мне его нужно отсортировать методом подсчета. завис на внесении значения счетчика во вспомогательный массив. объясните что и как делать? как мне заполнить второй массив и вновь составить уже отсортированный первый?
Код (Text):
// КЭП.cpp: определяет точку входа для консольного приложения.
//
/*Создать массив, заполнить его. Отсортировать его методом подсчета*/
#include "stdafx.h"
#include <stdlib.h>
#include <cstdlib>
#include <iostream>
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
{
int n;
cout << "VVedite razmernost massiva: ";
cin >> n;
const int SIZE = n;
int *mas = 0;
try {
mas = new int [SIZE];
}
catch (bad_alloc err){
cout << "Error" << endl;
exit(1);
}
cout << "Vvedite elementy massiva: " << endl;
for (int i=0; i<SIZE; i++){
cin >> mas[i];
}
cout << "Elementy ishodnogo massiva: ";
for (int i=0; i<SIZE;i++){
cout << mas[i] << " ";
}
/*Сортировка подсчетом - Начало*/
int max = mas[0];
for (int i=0; i<SIZE;i++){
if (max < mas[i])
max = mas[i];
}
cout << endl << "Max element: " << max;
const int SIZEN = max;
int *masnew = 0;
try {
masnew = new int [SIZEN];
}
catch (bad_alloc err){
cout << "Error" << endl;
exit(1);
}
/*ТУт я и завис*/
for (int i=0;i<SIZE;i++){
n = mas[i];
int k = 0;
for (int j=0;j<SIZE;j++){
if (mas[i]==n)
k++;
}
masnew[]=k; //занесение значение счетчика во вспомогательный массив
}
cout << endl;
/*Сортировка подсчетом - Конец*/
cout << endl;
delete [] mas;
delete [] masnew;
mas = 0;
masnew = 0;
return 0;
}
2. alekssgor
alekssgor Well-Known Member
Регистрация:
26 май 2008
Сообщения:
118
Симпатии:
0
Зачем всё это ??? С++ Библиотека стандартных шаблонов Класс list .
Код (Text):
#include <list>
int main()
{
list<char> lst;
int i;
// ЗАПОЛНЕНИЕ СПИСКА СЛУЧАЙНЫМИ СИМВОЛАМИ
for(i=0; i<10; i++) lst.push_back('A' + (rand()%26));
cout << "Исходное содержимое: ";
list<char>::iterator p = lst.begin();
while(p != lst.end())
{
cout << *p;
p++;
}
cout << endl;
//Сортировка списка
lst.sort();
cout << "Отсортированное содержимое: ";
p = lst.begin();
while(p != lst.end())
{
cout << *p;
p++;
}
return 0;
}
3. guffigubber
guffigubber Гость
потому что мне необходимо разобраться в принципе работы этой сортировки
Загрузка...
Похожие Темы - Сортировка Подсчетом
1. vera2014
Ответов:
0
Просмотров:
1.197
2. Liori
Ответов:
2
Просмотров:
1.082
3. FCDK
Ответов:
0
Просмотров:
1.327
4. ленарано
Ответов:
1
Просмотров:
1.170
5. Creder
Ответов:
0
Просмотров:
1.416
Статус темы:
Закрыта.
Поделиться этой страницей
|
{
"url": "https://codeby.net/forum/threads/sortirovka-podschetom.43603/",
"source_domain": "codeby.net",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "63320",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XDLZ56GWY24MPPKZ6XKV3DABNEY2ADBB",
"WARC-Concurrent-To": "<urn:uuid:74a030a1-149a-42f0-b634-4867ed1578e9>",
"WARC-Date": "2017-05-28T09:15:19Z",
"WARC-IP-Address": "104.25.5.14",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:O4OO4X4UWBLNDT3Y5LX4BG6PCFPXA4GI",
"WARC-Record-ID": "<urn:uuid:02bc9295-70f4-429a-afa4-7979bf20ebe3>",
"WARC-Target-URI": "https://codeby.net/forum/threads/sortirovka-podschetom.43603/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4c1d1aaf-8894-469d-9b11-bbe0cf387531>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-224-210.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
21,
22,
113,
114,
144,
157,
166,
183,
184,
206,
207,
252,
522,
538,
605,
612,
686,
710,
734,
757,
781,
782,
807,
808,
849,
855,
866,
910,
924,
948,
966,
976,
1002,
1008,
1035,
1064,
1077,
1083,
1133,
1165,
1184,
1190,
1191,
1235,
1266,
1293,
1299,
1300,
1301,
1339,
1361,
1392,
1414,
1432,
1438,
1482,
1509,
1530,
1540,
1570,
1576,
1603,
1632,
1645,
1651,
1652,
1674,
1704,
1720,
1735,
1765,
1784,
1793,
1799,
1871,
1877,
1895,
1896,
1897,
1898,
1899,
1936,
1937,
1955,
1974,
1996,
2009,
2025,
2039,
2045,
2051,
2066,
2067,
2099,
2100,
2117,
2133,
2148,
2156,
2170,
2176,
2247,
2248,
2264,
2284,
2285,
2300,
2306,
2326,
2337,
2338,
2384,
2442,
2443,
2480,
2522,
2548,
2554,
2570,
2579,
2585,
2603,
2627,
2643,
2687,
2708,
2734,
2740,
2756,
2765,
2771,
2785,
2791,
2797,
2814,
2815,
2837,
2838,
2914,
2920,
2932,
2968,
2982,
2995,
3001,
3017,
3027,
3038,
3051,
3057,
3073,
3083,
3093,
3106,
3112,
3128,
3138,
3152,
3165,
3171,
3187,
3197,
3209,
3222,
3228,
3244,
3254,
3267,
3276,
3277
],
"line_end_idx": [
21,
22,
113,
114,
144,
157,
166,
183,
184,
206,
207,
252,
522,
538,
605,
612,
686,
710,
734,
757,
781,
782,
807,
808,
849,
855,
866,
910,
924,
948,
966,
976,
1002,
1008,
1035,
1064,
1077,
1083,
1133,
1165,
1184,
1190,
1191,
1235,
1266,
1293,
1299,
1300,
1301,
1339,
1361,
1392,
1414,
1432,
1438,
1482,
1509,
1530,
1540,
1570,
1576,
1603,
1632,
1645,
1651,
1652,
1674,
1704,
1720,
1735,
1765,
1784,
1793,
1799,
1871,
1877,
1895,
1896,
1897,
1898,
1899,
1936,
1937,
1955,
1974,
1996,
2009,
2025,
2039,
2045,
2051,
2066,
2067,
2099,
2100,
2117,
2133,
2148,
2156,
2170,
2176,
2247,
2248,
2264,
2284,
2285,
2300,
2306,
2326,
2337,
2338,
2384,
2442,
2443,
2480,
2522,
2548,
2554,
2570,
2579,
2585,
2603,
2627,
2643,
2687,
2708,
2734,
2740,
2756,
2765,
2771,
2785,
2791,
2797,
2814,
2815,
2837,
2838,
2914,
2920,
2932,
2968,
2982,
2995,
3001,
3017,
3027,
3038,
3051,
3057,
3073,
3083,
3093,
3106,
3112,
3128,
3138,
3152,
3165,
3171,
3187,
3197,
3209,
3222,
3228,
3244,
3254,
3267,
3276,
3277,
3302
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3302,
"ccnet_original_nlines": 170,
"rps_doc_curly_bracket": 0.007874020375311375,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08123248815536499,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030812319368124008,
"rps_doc_frac_lines_end_with_ellipsis": 0.005847950000315905,
"rps_doc_frac_no_alph_words": 0.7002801299095154,
"rps_doc_frac_unique_words": 0.5318559408187866,
"rps_doc_mean_word_length": 5.252077579498291,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.008403359912335873,
"rps_doc_unigram_entropy": 4.946513652801514,
"rps_doc_word_count": 361,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06434599310159683,
"rps_doc_frac_chars_dupe_6grams": 0.06434599310159683,
"rps_doc_frac_chars_dupe_7grams": 0.06434599310159683,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01582277938723564,
"rps_doc_frac_chars_top_3gram": 0.012658230029046535,
"rps_doc_frac_chars_top_4gram": 0.03375526890158653,
"rps_doc_books_importance": -327.78900146484375,
"rps_doc_books_importance_length_correction": -327.78900146484375,
"rps_doc_openwebtext_importance": -165.45611572265625,
"rps_doc_openwebtext_importance_length_correction": -165.45611572265625,
"rps_doc_wikipedia_importance": -124.86903381347656,
"rps_doc_wikipedia_importance_length_correction": -124.86903381347656
},
"fasttext": {
"dclm": 0.9711299538612366,
"english": 0.0034924799110740423,
"fineweb_edu_approx": 2.920711040496826,
"eai_general_math": 0.030719580128788948,
"eai_open_web_math": 0.11701244115829468,
"eai_web_code": 0.40638846158981323
}
}
|
{
"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": "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": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,979,727,342,556,838,000
|
Remainder and Factor Theorems
The factor theorem is mainly used for factoring polynomials and finding \(n\) roots of polynomials. In this step-by-step guide, you learn more about the factor and remainder theorems.
Remainder and Factor Theorems
When a polynomial is divided by a linear polynomial, the remainder theorem is used to find the remainder.
A step-by-step guide to the remainder and factor theorems
According to the remainder theorem, if we divide a polynomial \(P(x)\) by the factor \((x – a)\); which is essentially not an element of a polynomial; you will find a smaller polynomial with the remainder. This remainder obtained is actually a value of \(P(x)\) at \(x = a\), specifically \(P(a)\). So basically, \((x -a)\) is the divisor of \(P(x)\) if and only if \(P(a) = 0\). It is applied to factorize polynomials of each degree in an elegant manner.
The factor theorem states that if \(f(x)\) is a polynomial of degree \(n\) greater than or equal to \(1\), and \(a\) is any real number, then \((x – a)\) is a factor of \(f(x)\) if \(f(a) = 0\). In other words, we can say that \((x – a)\) is a factor of \(f(x)\) if \(f(a) = 0\).
Difference between the factor theorem and the remainder theorem
The remainder and factor theorems are similar but refer to two different concepts. The remainder theorem relates the remainder of the division of a polynomial by a binomial with the value of a function at a point. The factor theorem relates the factors of a given polynomial to its zeros.
Related to This Article
What people say about "Remainder and Factor Theorems - Effortless Math: We Help Students Learn to LOVE Mathematics"?
No one replied yet.
Leave a Reply
X
45% OFF
Limited time only!
Save Over 45%
Take It Now!
SAVE $40
It was $89.99 now it is $49.99
The Ultimate Algebra Bundle: From Pre-Algebra to Algebra II
|
{
"url": "https://www.effortlessmath.com/math-topics/remainder-and-factor-theorems/",
"source_domain": "www.effortlessmath.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "82206",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LJGID6F4XBBMQAZGSHF2FLSU3Y3EICMD",
"WARC-Concurrent-To": "<urn:uuid:e074d025-eb14-44a8-b080-e15f53c35ec1>",
"WARC-Date": "2024-06-21T05:32:34Z",
"WARC-IP-Address": "5.78.86.142",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LU7AMFEXYZPXNB5ZA5B4O65Z3GPGJGXX",
"WARC-Record-ID": "<urn:uuid:f4c848c5-f66e-4fdd-8b85-4fdf0945a547>",
"WARC-Target-URI": "https://www.effortlessmath.com/math-topics/remainder-and-factor-theorems/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2923289c-29d9-4683-b3aa-4930b8ebd78a>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-81\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
30,
31,
215,
216,
246,
247,
353,
354,
412,
413,
869,
870,
1150,
1151,
1215,
1216,
1505,
1506,
1530,
1531,
1648,
1649,
1669,
1670,
1684,
1685,
1687,
1695,
1696,
1715,
1716,
1730,
1731,
1744,
1745,
1754,
1755,
1786,
1787
],
"line_end_idx": [
30,
31,
215,
216,
246,
247,
353,
354,
412,
413,
869,
870,
1150,
1151,
1215,
1216,
1505,
1506,
1530,
1531,
1648,
1649,
1669,
1670,
1684,
1685,
1687,
1695,
1696,
1715,
1716,
1730,
1731,
1744,
1745,
1754,
1755,
1786,
1787,
1846
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1846,
"ccnet_original_nlines": 39,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3857142925262451,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02619048021733761,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25,
"rps_doc_frac_unique_words": 0.4294871687889099,
"rps_doc_mean_word_length": 4.355769157409668,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.343921661376953,
"rps_doc_word_count": 312,
"rps_doc_frac_chars_dupe_10grams": 0.03090507909655571,
"rps_doc_frac_chars_dupe_5grams": 0.07358352094888687,
"rps_doc_frac_chars_dupe_6grams": 0.03090507909655571,
"rps_doc_frac_chars_dupe_7grams": 0.03090507909655571,
"rps_doc_frac_chars_dupe_8grams": 0.03090507909655571,
"rps_doc_frac_chars_dupe_9grams": 0.03090507909655571,
"rps_doc_frac_chars_top_2gram": 0.0794702023267746,
"rps_doc_frac_chars_top_3gram": 0.06622517108917236,
"rps_doc_frac_chars_top_4gram": 0.0956585705280304,
"rps_doc_books_importance": -241.1848907470703,
"rps_doc_books_importance_length_correction": -240.7825469970703,
"rps_doc_openwebtext_importance": -127.88517761230469,
"rps_doc_openwebtext_importance_length_correction": -127.88517761230469,
"rps_doc_wikipedia_importance": -105.92109680175781,
"rps_doc_wikipedia_importance_length_correction": -105.92066955566406
},
"fasttext": {
"dclm": 0.5181292295455933,
"english": 0.9147427082061768,
"fineweb_edu_approx": 3.155571699142456,
"eai_general_math": 0.9982650876045227,
"eai_open_web_math": 0.5430818796157837,
"eai_web_code": 0.33191800117492676
}
}
|
{
"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": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
384,739,370,261,677,200
|
we can get a stock details in yahoo using the following url . but how can i get stock details using market cap value ,divideend value ,pe ratio ,pro rating instead of sending s=GOOG in the url http://finance.yahoo.com/d/quotes.csv?s=GOOG&f=snd1l1yr second thing i get chart data using the following url http://chartapi.finance.yahoo.com/instrument/1.0/GOOG/chartdata;type=quote;range=5d/csv/ but how can i generate graph using the data please help me ! i spent 5 days to find i cant find the solution . i posted this in some forums i cant get the answer.
Member Avatar
Member Avatar
+1 forum 6
Hi I want to rename Image in this script after downloading ,now it downloads as default Want to rename it to x.png Any help appreciated Saw a way via PHPserver,but Im using JAVA App <html> <head> <script type="text/javascript" src="http://canvg.googlecode.com/svn/trunk/rgbcolor.js"></script> <script type="text/javascript" src="http://canvg.googlecode.com/svn/trunk/canvg.js"></script> <script> function getImgData(chartContainer) { var chartArea = chartContainer.getElementsByTagName('svg')[0].parentNode; var svg = chartArea.innerHTML; var doc = chartContainer.ownerDocument; var canvas = doc.createElement('canvas'); canvas.setAttribute('width', chartArea.offsetWidth); canvas.setAttribute('height', chartArea.offsetHeight); canvas.setAttribute( 'style', 'position: absolute; ' + 'top: ' + (-chartArea.offsetHeight * 2) + 'px;' + 'left: ' + (-chartArea.offsetWidth * 2) + 'px;'); doc.body.appendChild(canvas); canvg(canvas, svg); var imgData = canvas.toDataURL("image/png").replace("image/png", "image/octet-stream"); canvas.parentNode.removeChild(canvas); return imgData; …
Member Avatar
+0 forum 0
Im completely new to programming, and this is my problem. For example, if a train travels 40 miles per hour for three hours, the distance trav-eled is 120 miles. Design a program that asks the user for the speed of a vehicle ( in miles per hour) and how many hours it has traveled. It should then use a loop to display the distance the vehicle has traveled for each hour of that time period. Here is an example of the output: What is the speed of the vehicle in mph? 40 [ Enter] How many hours has it traveled? …
Member Avatar
Member Avatar
+0 forum 2
how to pass the array value through php in google chart api from my database values.
Member Avatar
Member Avatar
+0 forum 8
Hey everyone, Does anyone know of any good JavaScript 3D charts? I found a Pie chart that works pretty nicely (http://keith-wood.name/gChart.html), but now looking for a 3D bar chart. Thanks, Cassie :)
Member Avatar
Member Avatar
+0 forum 1
hello everyone... i need some good open source Graphs and Charts gui(2d and 3d) for java. Please suggest me some.
Member Avatar
Member Avatar
+0 forum 2
hi! i want to include a pie chart in my report! i have a file called inquiries in sql server 2008. the file contains Inquiry Number,Name,Date,Telephone,Email and status. The status contains information from where the customer got to know about a particular product(i.e newspapers,Friends,T.v etc) i want to generate a pie chart based on each category of the status so that it will show the managers what is there best way in advertising. can anyone guide me in creating this chart cause i have no idea in creating pie charts in crystal reports
Member Avatar
+0 forum 0
I'm trying to figure out the best way to create pie charts using visual studio 2005. Can someone give me some advice? Thanks
Member Avatar
Member Avatar
+0 forum 1
Back around 2004 and 2005, I had embarked on a web project that included the ability for my users to draw on a web page—or at least, that was one of the requirements. At the time, most of my web development had been server-side, with very little JavaScript. Long story short, I ended up shelving the project—not because the project wasn’t a good idea (it was a project planning and collaboration tool), but because the browsers simply weren’t up to it. I explored numerous libraries for drawing on the browsers, but talk about a major headache. The reason for the …
Member Avatar
Member Avatar
+1 forum 3
Hi, i am trying to get create a line chart with using WPF, the chart will show a trend of a data on a time range, so the chart will show the value of several series of data on months interval, this is what im trying to achieve: [ATTACH]20732[/ATTACH] i made that one on excel.. but it is basically what im trying to do, i found several documentation on WPFtoolkit on MSDN, but it seems different from what im using, the methods, the attributes, and some others. another problem is the time range, i dont know what is the time …
Member Avatar
Member Avatar
+0 forum 3
Hello All. This is my first post. I would really appreciate if you can help me in a project I have to complete as soon as possible anyway, the thing is this: I have a bunch of numerical data in any format (say an excel page with 3D vectors, or a text file with the same 3D (x,y,z) vectors) and I have to represent them in graphical form (as for example arrows). What tool do you think I should use? I know this is not exactly about c++but couldnt find an appropriate place Thanks a lot in advance Kansai
Member Avatar
Member Avatar
+0 forum 4
I need to move a chart from one sheet to another in an Excel workbook, and I am having issues with different versions of Windows and Excel. Here is the code I am currently using: (excelApp is declared correctly) [code]excelApp.Workbooks("Book 1").Sheets("Sheet 1").ChartObjects(1).Chart.Location(2, "Chart 2")[/code] This works perfectly and consistently with Windows 7 and Microsoft Office 2007, but fails whenever I try it with Windows XP and Office XP, or Windows XP and Office 2003. I need it to work with the last two setups, so any help would be greatly appreciated. Thanks, Jordan
Member Avatar
+0 forum 0
Here in the UK, we take our video gaming pretty seriously. No more than at this time of year when more games are bought than at any other time. So the annual xmas sales charts are always much anticipated as a barometer of just what is winning the hearts, minds and wallets of gamers. To be honest, this year it looked as if all bets were off as far as which game would be top of the pops. Not least because Call of Duty: World At War has been sitting pretty in the number one position for no less than …
Member Avatar
+0 forum 0
The End.
|
{
"url": "https://www.daniweb.com/tags/charts",
"source_domain": "www.daniweb.com",
"snapshot_id": "crawl=CC-MAIN-2019-18",
"warc_metadata": {
"Content-Length": "67606",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WARWE5EVXGEFS5CJZNL3JDHZ3DX3HB5O",
"WARC-Concurrent-To": "<urn:uuid:89b33959-1a01-4397-91c9-87059a82e585>",
"WARC-Date": "2019-04-23T21:58:49Z",
"WARC-IP-Address": "198.23.117.137",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SWKPGBUDEHXKBVBHO5CRUIYS73KKBVIF",
"WARC-Record-ID": "<urn:uuid:ed82cb84-1be0-4788-9470-d1a4a478414b>",
"WARC-Target-URI": "https://www.daniweb.com/tags/charts",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e0bdd59d-19f8-48dc-9b78-0a4bdca38096>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-179-91-4.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,
555,
556,
570,
584,
595,
596,
1675,
1676,
1690,
1701,
1702,
2215,
2216,
2230,
2244,
2255,
2256,
2341,
2342,
2356,
2370,
2381,
2382,
2584,
2585,
2599,
2613,
2624,
2625,
2739,
2740,
2754,
2768,
2779,
2780,
3324,
3325,
3339,
3350,
3351,
3476,
3477,
3491,
3505,
3516,
3517,
4083,
4084,
4098,
4112,
4123,
4124,
4652,
4653,
4667,
4681,
4692,
4693,
5197,
5198,
5212,
5226,
5237,
5238,
5826,
5827,
5841,
5852,
5853,
6357,
6358,
6372,
6383,
6384
],
"line_end_idx": [
555,
556,
570,
584,
595,
596,
1675,
1676,
1690,
1701,
1702,
2215,
2216,
2230,
2244,
2255,
2256,
2341,
2342,
2356,
2370,
2381,
2382,
2584,
2585,
2599,
2613,
2624,
2625,
2739,
2740,
2754,
2768,
2779,
2780,
3324,
3325,
3339,
3350,
3351,
3476,
3477,
3491,
3505,
3516,
3517,
4083,
4084,
4098,
4112,
4123,
4124,
4652,
4653,
4667,
4681,
4692,
4693,
5197,
5198,
5212,
5226,
5237,
5238,
5826,
5827,
5841,
5852,
5853,
6357,
6358,
6372,
6383,
6384,
6392
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6392,
"ccnet_original_nlines": 74,
"rps_doc_curly_bracket": 0.00015644999803043902,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3549276292324066,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02343212068080902,
"rps_doc_frac_lines_end_with_ellipsis": 0.06666667014360428,
"rps_doc_frac_no_alph_words": 0.2453480362892151,
"rps_doc_frac_unique_words": 0.419260710477829,
"rps_doc_mean_word_length": 4.813229560852051,
"rps_doc_num_sentences": 83,
"rps_doc_symbol_to_word_ratio": 0.004135080147534609,
"rps_doc_unigram_entropy": 5.449047088623047,
"rps_doc_word_count": 1028,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0725545734167099,
"rps_doc_frac_chars_dupe_6grams": 0.06851252913475037,
"rps_doc_frac_chars_dupe_7grams": 0.031527891755104065,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.053354889154434204,
"rps_doc_frac_chars_top_3gram": 0.028900569304823875,
"rps_doc_frac_chars_top_4gram": 0.04001617059111595,
"rps_doc_books_importance": -546.2271118164062,
"rps_doc_books_importance_length_correction": -546.2271118164062,
"rps_doc_openwebtext_importance": -299.60528564453125,
"rps_doc_openwebtext_importance_length_correction": -299.60528564453125,
"rps_doc_wikipedia_importance": -203.3863067626953,
"rps_doc_wikipedia_importance_length_correction": -203.3863067626953
},
"fasttext": {
"dclm": 0.06393610686063766,
"english": 0.8809080123901367,
"fineweb_edu_approx": 1.2245807647705078,
"eai_general_math": 0.36610859632492065,
"eai_open_web_math": 0.296186625957489,
"eai_web_code": 0.015137259848415852
}
}
|
{
"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.0151",
"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": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,481,955,569,874,637,000
|
Home Scoring and other IT questions
Format of EBUScore Player Files
My scoring program can read and convert ScoreBridge Player files.
I wish to add the ability to read and convert EBUScore Player files to the program.
Can anyone tell me the format of the EBUScore Player files, or send me an example of one, so that I can reverse engineer it.
Many thanks
Tony
Comments
• They can be exported as csv files. Do you want something other than that?
• I think we are talking at cross purposes here, Gordon.
I don't have EBUScore installed on my PC and so I don't know the format in which its Player records are kept, what fields are in each record, what order they are in, how they are separated.
The information I am looking for is something like this. In each record:-
Field 1: Forename as string,
Field 2: Surname as string,
Field 3: EBU Number as string or Integer,
etc etc.
and how the fields are separated: by a comma or some other method.
Better still would be an example EBUScore file with a few records of fictitious players such as Joe Bloggs, Tom Jones and Harry Smith. I would only need 4 or 5 records in such a file.
Once I have this info, I can read the EBUScore Player file and write software to convert it. I don't care whether it's a CSV file, text file or in some other format.
If I had EBUScore on my PC I could create a dummy Player file and then analyse it. I believe it costs £50 to get a license for a non-affiliated club - but I'm only a Club Member, not a Club, so I can't get it for free. I'll pay the £50 if I have to.
• Hi Tony,
I'll contact you directly on Monday and I can provide the information you need.
Jonathan
Sign In or Register to comment.
|
{
"url": "https://forums.ebu.co.uk/discussion/1444/format-of-ebuscore-player-files",
"source_domain": "forums.ebu.co.uk",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "44406",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5XN3R6EBZLGLT2AWBADUZNFDGZM2X5UX",
"WARC-Concurrent-To": "<urn:uuid:67a5fa43-8a36-41ae-a9cd-cd1caede9f57>",
"WARC-Date": "2024-04-23T13:57:12Z",
"WARC-IP-Address": "108.128.220.142",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:C2GR2ZJWFF3RVVU24KKXMU7N65AKBL2U",
"WARC-Record-ID": "<urn:uuid:ce8eda78-ef05-4451-a944-2fd8033e37be>",
"WARC-Target-URI": "https://forums.ebu.co.uk/discussion/1444/format-of-ebuscore-player-files",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fc7c2512-8f7e-4c41-9d2e-8f085c15d883>"
},
"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 (info@commoncrawl.org)\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,
36,
37,
69,
70,
136,
137,
221,
222,
347,
348,
360,
361,
366,
367,
376,
377,
455,
456,
515,
516,
710,
711,
789,
822,
854,
900,
913,
984,
985,
1173,
1174,
1344,
1345,
1599,
1600,
1613,
1614,
1698,
1699,
1712,
1713
],
"line_end_idx": [
36,
37,
69,
70,
136,
137,
221,
222,
347,
348,
360,
361,
366,
367,
376,
377,
455,
456,
515,
516,
710,
711,
789,
822,
854,
900,
913,
984,
985,
1173,
1174,
1344,
1345,
1599,
1600,
1613,
1614,
1698,
1699,
1712,
1713,
1744
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1744,
"ccnet_original_nlines": 41,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4360313415527344,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06266319006681442,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15926893055438995,
"rps_doc_frac_unique_words": 0.48606809973716736,
"rps_doc_mean_word_length": 4.021671772003174,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.728327751159668,
"rps_doc_word_count": 323,
"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.04311008006334305,
"rps_doc_frac_chars_top_3gram": 0.0438799113035202,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -200.60562133789062,
"rps_doc_books_importance_length_correction": -191.1196746826172,
"rps_doc_openwebtext_importance": -85.92315673828125,
"rps_doc_openwebtext_importance_length_correction": -85.92315673828125,
"rps_doc_wikipedia_importance": -73.97144317626953,
"rps_doc_wikipedia_importance_length_correction": -68.58893585205078
},
"fasttext": {
"dclm": 0.11254662275314331,
"english": 0.9588250517845154,
"fineweb_edu_approx": 1.2248492240905762,
"eai_general_math": 0.7554208636283875,
"eai_open_web_math": 0.21402978897094727,
"eai_web_code": 0.13631415367126465
}
}
|
{
"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": "796.330285",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": "Sports and Athletics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,919,470,813,091,642,000
|
Xonotic Forums
Sintel and using their source - Printable Version
+- Xonotic Forums (https://forums.xonotic.org)
+-- Forum: Creating & Contributing (https://forums.xonotic.org/forumdisplay.php?fid=10)
+--- Forum: Xonotic - Editing and Concept Art (https://forums.xonotic.org/forumdisplay.php?fid=11)
+--- Thread: Sintel and using their source (/showthread.php?tid=1066)
Sintel and using their source - merlijn - 10-03-2010
Recently the great people at the Blender Foundation have released their latest open source creation: Sintel. This is definitely a masterpiece and I highly recommend watching it if you have a spare 15 minutes.
For Xonotic this project is interesting, as they've released all their content under an (almost) GPL compatible license. This means that we can start to pick some things and convert them to be used in the game. Currently the sources for their movie are only distributed through the DVD box they sell, but I expect these to be spread on the internet soon enough. I will definitely be ordering the DVD, so if wanted I can supply the sources too.
To be fair, I have very little clue of what actually needs to be done to make these blend files work in Xonotic, so feel free to provide feedback on this. I will just give you the legal speech that is required.
Usage in unofficial maps
You may freely use their sources for whatever you want, the only thing you must do is provide attribution to the Blender Foundation as per their license.
Usage in official maps
Contrary to unofficial maps, all content in Xonotic _MUST_ be GPL (or compatible). Legally speaking the attribution requirement is not fully GPL compatible, however we can contact the authors and request them to drop this requirement for a few of their sources so we may legally include them. Obviously we will give proper credit for their hard work, but we cannot legally require this from anyone who obtains the files under a GPL license from us.
So if you use these sources, please give us a list of which files you have used. We need this to request an exception to the attribution requirement for these specific files, we have no guarantee that they will accept our request - but it is much more likely to be accepted if we only ask for a few files and not everything.
RE: Sintel and using their source - Exitium - 10-04-2010
I'm sure people are also interested in Blender Foundation's previous movies (and their source code): Elephants Dream and Big Buck Bunny. Especially Elephants Dream might be and an interesting source of elements.
RE: Sintel and using their source - unfa - 10-04-2010
Aren't those meshes too highpoly for a game?
RE: Sintel and using their source - merlijn - 10-04-2010
(10-04-2010, 10:15 AM)unfa Wrote: Aren't those meshes too highpoly for a game?
They probably are, but generally turning the quality down still saves a huge amount of work as opposed to recreating from scratch.
RE: Sintel and using their source - unfa - 10-04-2010
(10-04-2010, 01:38 PM)merlijn Wrote: They probably are, but generally turning the quality down still saves a huge amount of work as opposed to recreating from scratch.
It still might be quite a lot work Wink But yeah, it's propably better than nothing Smile
RE: Sintel and using their source - Minkovsky - 10-05-2010
Yeah. Merge polys, keep it shapely, decimate vertices, then unwrap again, test if works...
RE: Sintel and using their source - rainerzufalldererste - 10-06-2010
merlijn - Administrator
...wtf??? we have another admin? didn't know it :O
RE: Sintel and using their source - Mr. Bougo - 10-07-2010
http://forums.xonotic.org/showteam.php
RE: Sintel and using their source - nowego4 - 10-07-2010
Yeah, I can see it now...
Big Buck Bunny Running around with a Nex vaporizing everybody... Big Grin
RE: Sintel and using their source - rainerzufalldererste - 10-07-2010
What about selling (yes... I used the word "selling") a xonotic DVD and the money you pay is a donation ( + DVD price)?
RE: Sintel and using their source - jaykay - 10-07-2010
has nothing to do with the topic, and the donation is a payment which is afaik incompatible with the gpl. the only possible way is to distribute a dvd for the price of a blank dvd. seriously, nobody would buy it.
RE: Sintel and using their source - rainerzufalldererste - 10-08-2010
Blender does that, too (sintel/Big buck bunny/...)
RE: Sintel and using their source - merlijn - 10-08-2010
This is definitely off-topic for this thread. Having that said it is perfectly legal to sell GPL software - just that you must comply with the terms of the GPL, which means also supplying the source for free.
Accepting donations is perfectly legal too, we just don't have the infrastructure yet to accept them. Also we have no clue what we should actually do with any money we get in.
RE: Sintel and using their source - rainerzufalldererste - 10-08-2010
(10-08-2010, 05:14 AM)merlijn Wrote: This is definitely off-topic for this thread. Having that said it is perfectly legal to sell GPL software - just that you must comply with the terms of the GPL, which means also supplying the source for free.
Accepting donations is perfectly legal too, we just don't have the infrastructure yet to accept them. Also we have no clue what we should actually do with any money we get in.
ok thank you for answering this OffTopic thing Wink
|
{
"url": "https://forums.xonotic.org/printthread.php?tid=1066",
"source_domain": "forums.xonotic.org",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "11941",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UHYW4L3SG255ZAWRSWRFNUS7ACYKDOSP",
"WARC-Concurrent-To": "<urn:uuid:e96e6f11-59ee-4ba1-9db2-1b2c7049ed95>",
"WARC-Date": "2024-06-22T18:30:07Z",
"WARC-IP-Address": "202.61.247.89",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:HF65MMQK53JFQDSIXW36KGUCZH3HGGGB",
"WARC-Record-ID": "<urn:uuid:9e0c5082-9701-46ba-87a1-9fd021663029>",
"WARC-Target-URI": "https://forums.xonotic.org/printthread.php?tid=1066",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f061e3df-db3d-4290-a393-848e27f68cfa>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-81\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,
65,
66,
113,
201,
300,
370,
371,
372,
373,
426,
427,
636,
637,
1081,
1082,
1293,
1294,
1319,
1473,
1474,
1497,
1946,
1947,
2272,
2273,
2274,
2331,
2332,
2544,
2545,
2546,
2600,
2601,
2646,
2647,
2648,
2705,
2706,
2785,
2786,
2917,
2918,
2919,
2973,
2974,
3142,
3143,
3233,
3234,
3235,
3294,
3295,
3386,
3387,
3388,
3458,
3459,
3483,
3484,
3535,
3536,
3537,
3596,
3597,
3636,
3637,
3638,
3695,
3696,
3722,
3723,
3797,
3798,
3799,
3869,
3870,
3990,
3991,
3992,
4048,
4049,
4262,
4263,
4264,
4334,
4335,
4386,
4387,
4388,
4445,
4446,
4655,
4656,
4832,
4833,
4834,
4904,
4905,
5151,
5152,
5328,
5329
],
"line_end_idx": [
15,
65,
66,
113,
201,
300,
370,
371,
372,
373,
426,
427,
636,
637,
1081,
1082,
1293,
1294,
1319,
1473,
1474,
1497,
1946,
1947,
2272,
2273,
2274,
2331,
2332,
2544,
2545,
2546,
2600,
2601,
2646,
2647,
2648,
2705,
2706,
2785,
2786,
2917,
2918,
2919,
2973,
2974,
3142,
3143,
3233,
3234,
3235,
3294,
3295,
3386,
3387,
3388,
3458,
3459,
3483,
3484,
3535,
3536,
3537,
3596,
3597,
3636,
3637,
3638,
3695,
3696,
3722,
3723,
3797,
3798,
3799,
3869,
3870,
3990,
3991,
3992,
4048,
4049,
4262,
4263,
4264,
4334,
4335,
4386,
4387,
4388,
4445,
4446,
4655,
4656,
4832,
4833,
4834,
4904,
4905,
5151,
5152,
5328,
5329,
5380
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5380,
"ccnet_original_nlines": 103,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38879311084747314,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0336206890642643,
"rps_doc_frac_lines_end_with_ellipsis": 0.01923076994717121,
"rps_doc_frac_no_alph_words": 0.2508620619773865,
"rps_doc_frac_unique_words": 0.36576786637306213,
"rps_doc_mean_word_length": 4.878077507019043,
"rps_doc_num_sentences": 58,
"rps_doc_symbol_to_word_ratio": 0.005172410048544407,
"rps_doc_unigram_entropy": 5.1910810470581055,
"rps_doc_word_count": 853,
"rps_doc_frac_chars_dupe_10grams": 0.19850997626781464,
"rps_doc_frac_chars_dupe_5grams": 0.35159817337989807,
"rps_doc_frac_chars_dupe_6grams": 0.33958181738853455,
"rps_doc_frac_chars_dupe_7grams": 0.299447238445282,
"rps_doc_frac_chars_dupe_8grams": 0.2605142891407013,
"rps_doc_frac_chars_dupe_9grams": 0.19850997626781464,
"rps_doc_frac_chars_top_2gram": 0.044941119849681854,
"rps_doc_frac_chars_top_3gram": 0.05383320897817612,
"rps_doc_frac_chars_top_4gram": 0.07305935770273209,
"rps_doc_books_importance": -395.736328125,
"rps_doc_books_importance_length_correction": -395.736328125,
"rps_doc_openwebtext_importance": -229.4569549560547,
"rps_doc_openwebtext_importance_length_correction": -229.4569549560547,
"rps_doc_wikipedia_importance": -178.10366821289062,
"rps_doc_wikipedia_importance_length_correction": -178.10366821289062
},
"fasttext": {
"dclm": 0.20461851358413696,
"english": 0.9299193024635315,
"fineweb_edu_approx": 1.626153588294983,
"eai_general_math": 0.39347755908966064,
"eai_open_web_math": 0.19265156984329224,
"eai_web_code": 0.041915059089660645
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,038,431,434,722,663,000
|
File indexing completed on 2024-06-09 09:27:47
0001 /***************************************************************************
0002 * Copyright (C) 2005 by David Saxton *
0003 * david@bluehaze.org *
0004 * *
0005 * This program is free software; you can redistribute it and/or modify *
0006 * it under the terms of the GNU General Public License as published by *
0007 * the Free Software Foundation; either version 2 of the License, or *
0008 * (at your option) any later version. *
0009 ***************************************************************************/
0010
0011 #include "chassiscircular2.h"
0012
0013 #include "libraryitem.h"
0014 #include "mechanicsitem.h"
0015 #include "mechanicsdocument.h"
0016
0017 #include <KLocalizedString>
0018 #include <QPainter>
0019 #include <QPainterPath>
0020
0021 #include <algorithm>
0022 #include <cmath>
0023
0024 double normalizeAngle(double angle);
0025
0026 Item *ChassisCircular2::construct(ItemDocument *itemDocument, bool newItem, const char *id)
0027 {
0028 return new ChassisCircular2(static_cast<MechanicsDocument *>(itemDocument), newItem, id);
0029 }
0030
0031 LibraryItem *ChassisCircular2::libraryItem()
0032 {
0033 return new LibraryItem(QStringList(QString("mech/chassis_circular_2")), i18n("Circular 2-Wheel Chassis"), i18n("Chassis'"), "chassis.png", LibraryItem::lit_mechanical, ChassisCircular2::construct);
0034 }
0035
0036 ChassisCircular2::ChassisCircular2(MechanicsDocument *mechanicsDocument, bool newItem, const char *id)
0037 : MechanicsItem(mechanicsDocument, newItem, id ? id : "chassis_circular_2")
0038 {
0039 m_name = i18n("Circular 2-Wheel Chassis");
0040
0041 m_theta1 = 0.0;
0042 m_theta2 = 0.0;
0043
0044 // Q3PointArray pa; // 2018.08.14 - ported to PainterPath
0045 // pa.makeEllipse( -25, -25, 50, 50 );
0046 QPainterPath path;
0047 path.addEllipse(-25, -25, 50, 50);
0048 QPolygon pa = path.toFillPolygon().toPolygon();
0049
0050 QTransform m(4, 0, 0, 4, 0, 0);
0051 // m.setTransformationMode( QMatrix::Areas ); // TODO find a replacement
0052 pa = m.map(pa);
0053 setItemPoints(pa);
0054
0055 itemResized();
0056 }
0057
0058 ChassisCircular2::~ChassisCircular2()
0059 {
0060 }
0061
0062 void ChassisCircular2::itemResized()
0063 {
0064 const double w = sizeRect().width();
0065 const double h = sizeRect().height();
0066
0067 m_wheel1Pos = QRect(int(w / 5), int(h / 6), int(w / 4), int(h / 8));
0068 m_wheel2Pos = QRect(int(w / 5), int(5 * h / 6 - h / 8), int(w / 4), int(h / 8));
0069 }
0070
0071 void ChassisCircular2::advance(int phase)
0072 {
0073 if (phase != 1)
0074 return;
0075
0076 double speed1 = 60.; // pixels per second
0077 double speed2 = 160.; // pixels per second
0078
0079 m_theta1 = normalizeAngle(m_theta1 + (speed1 / 1000.) / m_wheel1Pos.width());
0080 m_theta2 = normalizeAngle(m_theta2 + (speed2 / 1000.) / m_wheel2Pos.width());
0081
0082 const double d1 = speed1 / 1000.;
0083 const double d2 = speed2 / 1000.;
0084 const double sep = m_wheel2Pos.center().y() - m_wheel1Pos.center().y();
0085
0086 double dtheta = std::atan((d2 - d1) / sep); // Change in orientation of chassis
0087 double moveAngle = absolutePosition().angle() + dtheta / 2;
0088 rotateBy(dtheta);
0089 moveBy(((d1 + d2) / 2.) * std::cos(moveAngle), ((d1 + d2) / 2.) * std::sin(moveAngle));
0090 }
0091
0092 void ChassisCircular2::drawShape(QPainter &p)
0093 {
0094 const double _x = int(sizeRect().x() + x());
0095 const double _y = int(sizeRect().y() + y());
0096 const double w = sizeRect().width();
0097 const double h = sizeRect().height();
0098
0099 initPainter(p);
0100 p.setBrush(QColor(255, 246, 210));
0101 QRect circleRect = sizeRect();
0102 circleRect.moveLeft(int(circleRect.left() + x()));
0103 circleRect.moveTop(int(circleRect.top() + y()));
0104 p.drawEllipse(circleRect);
0105
0106 // Draw wheels
0107 // TODO get this info from m_wheel1Pos and m_wheel2Pos
0108 const double X = _x + (w / 5); // Wheel's left pos
0109 const double H = h / 8; // Wheel's height
0110 const double y1 = _y + (h / 6); // Wheel 1 y-pos
0111 const double y2 = _y + (5 * h / 6) - H; // Wheel 2 y-pos
0112
0113 p.setPen(Qt::NoPen);
0114 const double stripeWidth = 5;
0115 const double offset2 = 1 + int(m_theta1 * m_wheel1Pos.width()) % int(2 * stripeWidth);
0116 const double offset1 = 1 + int(m_theta2 * m_wheel2Pos.width()) % int(2 * stripeWidth);
0117 p.setBrush(QColor(255, 232, 182));
0118 for (double i = -1; i < std::ceil(m_wheel1Pos.width() / stripeWidth); ++i) {
0119 p.setClipRect(QRect(int(_x + m_wheel1Pos.x() + 2), int(_y + m_wheel1Pos.y() + 2), int(m_wheel1Pos.width() - 4), int(m_wheel1Pos.height() - 4)),
0120 /* QPainter::CoordPainter */
0121 Qt::ReplaceClip // TODO original Qt::UniteClip
0122 );
0123 p.drawRect(int(offset1 + X + i * stripeWidth * 2), int(y1 + 1), int(stripeWidth), int(H - 2));
0124
0125 p.setClipRect(QRect(int(_x + m_wheel2Pos.x() + 2), int(_y + m_wheel2Pos.y() + 2), int(m_wheel2Pos.width() - 4), int(m_wheel2Pos.height() - 4)),
0126 /* QPainter::CoordPainter */
0127 Qt::ReplaceClip // TODO original Qt::UniteClip
0128 );
0129 p.drawRect(int(offset2 + X + i * stripeWidth * 2), int(y2 + 1), int(stripeWidth), int(H - 2));
0130 }
0131 p.setClipping(false);
0132
0133 p.setPen(Qt::black);
0134 p.setBrush(Qt::NoBrush);
0135 p.drawRoundedRect(int(X), int(y1), int(w / 4), int(H), 25, 50, Qt::RelativeSize);
0136 p.drawRoundedRect(int(X), int(y2), int(w / 4), int(H), 25, 50, Qt::RelativeSize);
0137
0138 deinitPainter(p);
0139 }
|
{
"url": "https://lxr.kde.org/source/sdk/ktechlab/src/mechanics/chassiscircular2.cpp?v=stable-kf6-qt6",
"source_domain": "lxr.kde.org",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "37080",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TFCGBGAYZFV6II3H7FPU6JA26BEM7OZQ",
"WARC-Concurrent-To": "<urn:uuid:2468ab6a-e191-4447-b85d-ba2473a17058>",
"WARC-Date": "2024-06-14T22:11:33Z",
"WARC-IP-Address": "185.85.125.73",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BIPUCEJFHMH6OBGS4AW3BDCRZJYCLAZG",
"WARC-Record-ID": "<urn:uuid:7b8d1b15-196e-4353-8a1d-b05ce02e2acf>",
"WARC-Target-URI": "https://lxr.kde.org/source/sdk/ktechlab/src/mechanics/chassiscircular2.cpp?v=stable-kf6-qt6",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0316036b-0629-4db8-83a7-cf3a89f19d83>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-228\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,
47,
48,
130,
212,
294,
376,
458,
540,
622,
704,
787,
793,
828,
834,
864,
896,
932,
938,
971,
996,
1025,
1031,
1057,
1079,
1085,
1127,
1133,
1230,
1237,
1336,
1343,
1349,
1399,
1406,
1613,
1620,
1626,
1734,
1819,
1826,
1878,
1884,
1909,
1934,
1940,
2010,
2058,
2086,
2130,
2187,
2193,
2234,
2316,
2341,
2369,
2375,
2399,
2406,
2412,
2455,
2462,
2469,
2475,
2517,
2524,
2570,
2617,
2623,
2701,
2791,
2798,
2804,
2851,
2858,
2883,
2904,
2910,
2962,
3014,
3020,
3107,
3194,
3200,
3243,
3286,
3367,
3373,
3462,
3531,
3558,
3655,
3662,
3668,
3719,
3726,
3780,
3834,
3880,
3927,
3933,
3958,
4002,
4042,
4102,
4160,
4196,
4202,
4226,
4290,
4359,
4426,
4492,
4558,
4564,
4594,
4633,
4729,
4825,
4869,
4955,
5112,
5168,
5242,
5258,
5366,
5372,
5529,
5585,
5659,
5675,
5783,
5794,
5825,
5831,
5861,
5895,
5986,
6077,
6083,
6110
],
"line_end_idx": [
47,
48,
130,
212,
294,
376,
458,
540,
622,
704,
787,
793,
828,
834,
864,
896,
932,
938,
971,
996,
1025,
1031,
1057,
1079,
1085,
1127,
1133,
1230,
1237,
1336,
1343,
1349,
1399,
1406,
1613,
1620,
1626,
1734,
1819,
1826,
1878,
1884,
1909,
1934,
1940,
2010,
2058,
2086,
2130,
2187,
2193,
2234,
2316,
2341,
2369,
2375,
2399,
2406,
2412,
2455,
2462,
2469,
2475,
2517,
2524,
2570,
2617,
2623,
2701,
2791,
2798,
2804,
2851,
2858,
2883,
2904,
2910,
2962,
3014,
3020,
3107,
3194,
3200,
3243,
3286,
3367,
3373,
3462,
3531,
3558,
3655,
3662,
3668,
3719,
3726,
3780,
3834,
3880,
3927,
3933,
3958,
4002,
4042,
4102,
4160,
4196,
4202,
4226,
4290,
4359,
4426,
4492,
4558,
4564,
4594,
4633,
4729,
4825,
4869,
4955,
5112,
5168,
5242,
5258,
5366,
5372,
5529,
5585,
5659,
5675,
5783,
5794,
5825,
5831,
5861,
5895,
5986,
6077,
6083,
6110,
6116
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6116,
"ccnet_original_nlines": 140,
"rps_doc_curly_bracket": 0.002616090001538396,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07732733339071274,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012762759812176228,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5998498797416687,
"rps_doc_frac_unique_words": 0.6314879059791565,
"rps_doc_mean_word_length": 6.408304691314697,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0.0067567601799964905,
"rps_doc_unigram_entropy": 5.56666898727417,
"rps_doc_word_count": 578,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.026457879692316055,
"rps_doc_frac_chars_dupe_6grams": 0.01457883045077324,
"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.04751620069146156,
"rps_doc_frac_chars_top_3gram": 0.009719219990074635,
"rps_doc_frac_chars_top_4gram": 0.010799139738082886,
"rps_doc_books_importance": -681.8570556640625,
"rps_doc_books_importance_length_correction": -681.8570556640625,
"rps_doc_openwebtext_importance": -369.8424987792969,
"rps_doc_openwebtext_importance_length_correction": -369.8424987792969,
"rps_doc_wikipedia_importance": -346.4478759765625,
"rps_doc_wikipedia_importance_length_correction": -346.4478759765625
},
"fasttext": {
"dclm": 0.9810281991958618,
"english": 0.18550007045269012,
"fineweb_edu_approx": 1.2910633087158203,
"eai_general_math": 0.8046999573707581,
"eai_open_web_math": 0.25485944747924805,
"eai_web_code": 0.5680508613586426
}
}
|
{
"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.8",
"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": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,531,214,352,874,467,000
|
SQLServerCentral.com / SQL Server 2008 / T-SQL (SS2K8) / Recursive Query / Latest PostsInstantForum.NET v2.9.0SQLServerCentral.comhttp://www.sqlservercentral.com/Forums/notifications@sqlservercentral.comTue, 31 Mar 2015 16:14:27 GMT20RE: Recursive Queryhttp://www.sqlservercentral.com/Forums/Topic1005053-392-1.aspx[quote][b]sridharkannan7 (10/15/2010)[/b][hr]I've a table with data shown as belowDetailsID FollowupID1 02 03 14 25 3if you look at the above data, "3" is a followup of 1 and "5" is a followup of "3"Similarly "4" is a followup of "2"and 1 and 2 are original ids or parent ids.I've to write a query that will retrieve only the parent and the last child of that parent.I used recursion but that retrieves the entire chain. How do I further get only the parent and the last child[/quote]Considering the LOS that some folks gave you on this, allow me to ask... did you ever get an answer for this that worked for you?Sun, 24 Oct 2010 19:50:36 GMTJeff ModenRE: Recursive Queryhttp://www.sqlservercentral.com/Forums/Topic1005053-392-1.aspxUse a nested sets model, then look for leaf nodes. Your bad DDL will only lead to stinking bad DML.Fri, 15 Oct 2010 17:10:32 GMTCELKORE: Recursive Queryhttp://www.sqlservercentral.com/Forums/Topic1005053-392-1.aspxyou can do this;[code="sql"];WITHcteFindMax AS( SELECT ROW_NUMBER() OVER (PARTITION BY DetailsID, FollowupID ORDER BY FollowupID DESC) AS Occurance, * FROM [the name of your table]) SELECT * FROM cteFindMax WHERE Occurance = 1[/code]Fri, 15 Oct 2010 06:54:00 GMTGeoff ARE: Recursive Queryhttp://www.sqlservercentral.com/Forums/Topic1005053-392-1.aspxPost what you've tried already. Can you set up some sample data? One of the links in my sig will show you how to do this.Fri, 15 Oct 2010 06:24:36 GMTChrisM@WorkRecursive Queryhttp://www.sqlservercentral.com/Forums/Topic1005053-392-1.aspxI've a table with data shown as belowDetailsID FollowupID1 02 03 14 25 3if you look at the above data, "3" is a followup of 1 and "5" is a followup of "3"Similarly "4" is a followup of "2"and 1 and 2 are original ids or parent ids.I've to write a query that will retrieve only the parent and the last child of that parent.I used recursion but that retrieves the entire chain. How do I further get only the parent and the last childFri, 15 Oct 2010 05:07:47 GMTsridharkannan7
|
{
"url": "http://www.sqlservercentral.com/Forums/RssFeed392-1005053-0-2.aspx",
"source_domain": "www.sqlservercentral.com",
"snapshot_id": "crawl=CC-MAIN-2015-14",
"warc_metadata": {
"Content-Length": "3628",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WMPPFUKYMZ3XKN35UIOK2XNRAAGRXVYA",
"WARC-Concurrent-To": "<urn:uuid:a8ad8893-2577-463d-9959-6b5e79141a6a>",
"WARC-Date": "2015-03-31T22:14:29Z",
"WARC-IP-Address": "162.13.37.189",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:XQALHC5VBLXZNPLE5AFW4ARW5C72QZKY",
"WARC-Record-ID": "<urn:uuid:65176183-ff93-4681-b026-ac2590e7c971>",
"WARC-Target-URI": "http://www.sqlservercentral.com/Forums/RssFeed392-1005053-0-2.aspx",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5616ce5d-9aa2-4f94-8e5e-0a21c69c1ecb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-168-14-71.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-14\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
2325
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2325,
"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.26408451795578003,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.056338030844926834,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.39084506034851074,
"rps_doc_frac_unique_words": 0.47962382435798645,
"rps_doc_mean_word_length": 5.711598873138428,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0.0017605599714443088,
"rps_doc_unigram_entropy": 4.729039192199707,
"rps_doc_word_count": 319,
"rps_doc_frac_chars_dupe_10grams": 0.3545554280281067,
"rps_doc_frac_chars_dupe_5grams": 0.3545554280281067,
"rps_doc_frac_chars_dupe_6grams": 0.3545554280281067,
"rps_doc_frac_chars_dupe_7grams": 0.3545554280281067,
"rps_doc_frac_chars_dupe_8grams": 0.3545554280281067,
"rps_doc_frac_chars_dupe_9grams": 0.3545554280281067,
"rps_doc_frac_chars_top_2gram": 0.009879250079393387,
"rps_doc_frac_chars_top_3gram": 0.03622392937541008,
"rps_doc_frac_chars_top_4gram": 0.0428101010620594,
"rps_doc_books_importance": -219.84291076660156,
"rps_doc_books_importance_length_correction": -219.84291076660156,
"rps_doc_openwebtext_importance": -158.96524047851562,
"rps_doc_openwebtext_importance_length_correction": -158.96524047851562,
"rps_doc_wikipedia_importance": -88.14436340332031,
"rps_doc_wikipedia_importance_length_correction": -88.14436340332031
},
"fasttext": {
"dclm": 0.14682990312576294,
"english": 0.7505042552947998,
"fineweb_edu_approx": 1.916056513786316,
"eai_general_math": 0.3763260245323181,
"eai_open_web_math": 0.20648646354675293,
"eai_web_code": 0.26464319229125977
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.746",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "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": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-9,170,337,690,887,808,000
|
Usar la API de REST de Correo de Outlook
Microsoft Graph permite a su aplicación obtener acceso autorizado a los datos de Correo de Outlook de un usuario en una cuenta personal o de la organización. Con los permisos de correo adecuados, ya sea de la aplicación o delegados, la aplicación podrá acceder a los datos del correo del usuario que haya iniciado sesión o de cualquier otro usuario en un espacio empresarial. Para obtener más información sobre los tokens de acceso, el registro de aplicaciones y los permisos delegados y de la aplicación, consulte los Conceptos básicos de autenticación y autorización.
La API de Microsoft Graph es compatible con el acceso a los datos del buzón principal y los buzones compartidos de los usuarios. Los datos pueden ser contactos personales, de correo electrónico o de calendario almacenados en un buzón en la nube de Exchange Online como parte de Microsoft 365 o en Exchange local en una implementación híbrida.
La API no permite el acceso a buzones de archivo locales, ni en Exchange Online ni en Exchange Server.
Uso de la API de REST de correo
Se realizan solicitudes de API de correo en nombre de un usuario que puede identificarse por la propiedad de id. de un usuario (un GUID único), la dirección de correo electrónico o el alias de acceso directo me para el usuario que ha iniciado sesión.
Los mensajes de correo electrónico están representados por el recurso message y organizados en una carpeta mailFolder. Los mensajes y las carpetas de correo se identifican por su propiedad de id., que puede obtenerse de las operaciones GET.
Importante
En general, no se debe suponer que los id. message y mailfolder son únicos e inmutables (no cambian) dentro de un buzón. Pueden cambiar tras determinadas acciones como copiar o mover. Puede optar por usar id. inmutables para conservar el mismo id siempre que el mensaje permanezca en el mismo buzón, con unas pocas excepciones como enviar un borrador del mensaje. Para obtener más información, vea duración de los id. inmutables.
Los cuerpos del mensaje se pueden mostrar en formato de texto o HTML.
Puede usar nombres de carpeta conocidos (como Inbox, Drafts, SentItems o DeletedItems) para identificar ciertas carpetas de correo que existen de forma predeterminada para todos los usuarios. Para obtener una lista de los nombres de carpeta conocidos compatibles, vea Tipo de recurso mailFolder.
Por ejemplo, puede obtener los mensajes en la carpeta Elementos enviados de Outlook del usuario que inició la sesión, sin obtener primero el id. de carpeta:
GET /me/mailFolders('SentItems')/messages?$select=sender,subject
Casos de uso comunes
El recurso message expone propiedades como categories, conversationId, flag e importance que corresponden a las funciones disponibles en la interfaz de usuario, lo que permite a las aplicaciones automatizarse o integrarse con la experiencia de usuario integrada de Outlook.
La API de Microsoft Graph también proporciona métodos y acciones que admiten casos de uso común de mensajes.
Casos de uso Recursos de REST Consulte también
Acciones centradas en el usuario
Borrador, leer, responder, reenviar, enviar, actualizar o eliminar los mensajes message Métodos de message
Delegar a otro usuario para enviar mensajes en nombre del propietario del buzón message Configuración de las propiedades de y remitente en un mensaje
Permitir que el usuario vea primero los mensajes más importantes inferenceClassificationOverride Bandeja de entrada Prioritarios
Consultar mensajes y obtenerlos en una carpeta de búsqueda mailSearchFolder Métodos de mailSearchFolder
Obtener el contenido MIME de un mensaje o los datos adjuntos de un mensaje message Obtener Contenido MIME
Enviar mensajes con contenido MIME message Enviar contenido MIME
Agregar, obtener o eliminar datos adjuntos de un mensaje attachment,
fileAttachment,
itemAttachment,
referenceAttachment,
message
Métodos de attachment
Obtener las opciones de idioma y zona horaria de un usuario localeInfo,
timeZoneInformation
supportedLanguages,
supportedTimeZones
Obtener o actualizar la configuración regional, la zona horaria, el horario laboral o la respuesta automática de un usuario mailboxSettings,
automaticRepliesSetting,
localeInfo,
workingHours
Obtener la configuración del buzón del usuario,
Actualizar la configuración del buzón del usuario,
Obtener sugerencias de correo electrónico del estado especial de otros destinatarios, como fuera de la oficina user,
mailTips
Get MailTips
Administración de carpetas y correo
Organizar los mensajes en una jerarquía de carpetas del correo mailFolder Métodos de mailFolder
Clasificar mensajes por categorías outlookCategory Métodos de outlookCategory
Usar reglas de la Bandeja de entrada para automatizar acciones, como el reenvío de mensajes entrantes específicos messageRule Métodos de messageRule
Obtener los encabezados de mensajes de Internet de un mensaje message Permite obtener la propiedad internetMessageHeaders de un mensaje.
Buscar y filtrar mensajes message Parámetros de consulta
Obtener notificaciones de los cambios en los mensajes de una carpeta subscription Trabajar con webhooks en Microsoft Graph
Sincronizar la jerarquía de carpetas del correo o los mensajes message Obtener los cambios incrementales en los mensajes de una carpeta
Desarrollo de aplicaciones
Agregar datos personalizados de aplicaciones como encabezados de mensajes de Internet de un mensaje mensaje Permite agregar datos personalizados a la propiedad internetMessageHeaders del mensaje.
Agregar datos personalizados de aplicaciones a un mensaje mediante el uso de extensiones openTypeExtension,
schemaExtension
Agregar datos personalizados a los recursos mediante extensiones
Datos personalizados de acceso para las propiedades de MAPI de Outlook subexpuestas singleValueLegacyExtendedProperty,
multiValueLegacyExtendedProperty
Información general sobre las propiedades extendidas de Outlook
Novedades
Descubra las nuevas características y actualizaciones para este conjunto de API.
Pasos siguientes
La API de correo puede ofrecer nuevas formas de comunicarse con los usuarios:
¿Necesita más ideas? Vea cómo algunos de nuestros socios utilizan Microsoft Graph.
|
{
"url": "https://docs.microsoft.com/es-es/graph/api/resources/mail-api-overview?view=graph-rest-1.0",
"source_domain": "docs.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "54647",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UG36X2T73XFJA6HFWKWSHK3GDNYNXM5K",
"WARC-Concurrent-To": "<urn:uuid:4c908b88-c646-428d-a0ad-c328cc735044>",
"WARC-Date": "2021-10-20T02:12:26Z",
"WARC-IP-Address": "184.84.77.121",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VA4P3KNJ7AZQC5STMKEVI2YRPSU2LM57",
"WARC-Record-ID": "<urn:uuid:58333da6-4cbc-4f33-90eb-aebd158810cc>",
"WARC-Target-URI": "https://docs.microsoft.com/es-es/graph/api/resources/mail-api-overview?view=graph-rest-1.0",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0dd1e79c-f58c-4b4e-80b4-986a28dd977c>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-40\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
41,
42,
612,
613,
956,
957,
1060,
1061,
1093,
1094,
1345,
1346,
1587,
1588,
1599,
1600,
2030,
2031,
2101,
2102,
2398,
2399,
2556,
2557,
2622,
2623,
2644,
2645,
2919,
2920,
3029,
3030,
3077,
3110,
3217,
3367,
3496,
3600,
3706,
3771,
3840,
3856,
3872,
3893,
3901,
3923,
3995,
4015,
4035,
4054,
4195,
4220,
4232,
4245,
4293,
4344,
4461,
4470,
4483,
4519,
4615,
4693,
4842,
4979,
5036,
5159,
5295,
5322,
5518,
5626,
5642,
5707,
5826,
5859,
5923,
5924,
5934,
5935,
6016,
6017,
6034,
6035,
6113,
6114
],
"line_end_idx": [
41,
42,
612,
613,
956,
957,
1060,
1061,
1093,
1094,
1345,
1346,
1587,
1588,
1599,
1600,
2030,
2031,
2101,
2102,
2398,
2399,
2556,
2557,
2622,
2623,
2644,
2645,
2919,
2920,
3029,
3030,
3077,
3110,
3217,
3367,
3496,
3600,
3706,
3771,
3840,
3856,
3872,
3893,
3901,
3923,
3995,
4015,
4035,
4054,
4195,
4220,
4232,
4245,
4293,
4344,
4461,
4470,
4483,
4519,
4615,
4693,
4842,
4979,
5036,
5159,
5295,
5322,
5518,
5626,
5642,
5707,
5826,
5859,
5923,
5924,
5934,
5935,
6016,
6017,
6034,
6035,
6113,
6114,
6196
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6196,
"ccnet_original_nlines": 84,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07800000160932541,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019999999552965164,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.08699999749660492,
"rps_doc_frac_unique_words": 0.3348017632961273,
"rps_doc_mean_word_length": 5.770925045013428,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.874924659729004,
"rps_doc_word_count": 908,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08969465643167496,
"rps_doc_frac_chars_dupe_6grams": 0.046183209866285324,
"rps_doc_frac_chars_dupe_7grams": 0.016030529513955116,
"rps_doc_frac_chars_dupe_8grams": 0.016030529513955116,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.018320610746741295,
"rps_doc_frac_chars_top_3gram": 0.012595419771969318,
"rps_doc_frac_chars_top_4gram": 0.004198470152914524,
"rps_doc_books_importance": -376.4779052734375,
"rps_doc_books_importance_length_correction": -376.4779052734375,
"rps_doc_openwebtext_importance": -241.05039978027344,
"rps_doc_openwebtext_importance_length_correction": -241.05039978027344,
"rps_doc_wikipedia_importance": -207.4469757080078,
"rps_doc_wikipedia_importance_length_correction": -207.4469757080078
},
"fasttext": {
"dclm": 0.7425488233566284,
"english": 0.0012467199703678489,
"fineweb_edu_approx": 1.1043407917022705,
"eai_general_math": 0.00009321999823441729,
"eai_open_web_math": 0.29021281003952026,
"eai_web_code": 0.3930550217628479
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|