id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
5,332,748,169,534,405,000 | USB memory sticks and Windows XP
Hi,
Since upgrading our student computer labs to Windows XP, USB memory sticks aren't working. For some reason unknown to me, Windows XP tries to assign the drive letter F: to the USB memory stick. We never had the problem with Windows 2000.
The student accounts are restricted, so they can not be given rights to set the drive letter themselves in the drive manager, so, is there a way that you guys know of that I can force Windows XP to automatically set USB flash sticks to, say, drive e:?
Any help would be appreciated.
Regards,
Kobus
North-West university
Vanderbijlpark
South Africa
FolkLoreAsked:
Who is Participating?
Jupiler78Connect With a Mentor Commented:
Wow, very strange
What is in your registry key HKEY_LOCAL_MACHINE\SYSTEM\MountedDevices
for the dosdevices?
0
Jupiler78Commented:
As far as I know there isn't any way, except for inserting the stick and then let someone with more rights change the letter in drive-management or in the registry. But this only works if everybody ahs the same type of USB stick
0
FatherErvinCommented:
Maybe if you install each one yourself logged in as admin, then assign the drive letter to E:\ ? when the students log in, and insert the USB stick, it should be redetected as it was installed?
0
Get expert help—faster!
Need expert help—fast? Use the Help Bell for personalized assistance getting answers to your important questions.
Jupiler78Commented:
FatherErvin, for what I have noticed does Windows see a different device even between 2 USB-sticks of the same company but with different capacity. E.g. 2 sticks of 64Mb and one of 128Mb are different to Windows, so also different drive-letters
0
FolkLoreAuthor Commented:
The problem is that we have over 3000 students, and only like 100 computers. That means that setting the value manually for each student is not only impossible, but also impractical. I hope someone else can come up with some other solution!
0
Jupiler78Commented:
I found this on Microsofts site: http://support.microsoft.com/default.aspx?scid=kb;en-us;297694
Take a look at it and maybe you can take advantage of it.
How does the list of your drive-letters looks like?
0
FatherErvinCommented:
Well, depending on your network drives... maybe you can assign lastdrive=E:\ ??
0
FolkLoreAuthor Commented:
We have C: for the harddisk, G: for the CD-ROM, then several drive letters for the network, including F:, H:, X:, Y:, Z:.
What gets to me is the fact that it can choose D: or E: for the drive letter, why does the silly thing *WANT* to use F:?
I will check out the reference on MS's website you provided, thanks!
Kobus
0
Jupiler78Commented:
And nothing is mapped to D or E ? MS says this would be the reason: an USB device would take the next availeble drive-letter after all physical drives
0
FolkLoreAuthor Commented:
I have read the site, and it will not work for me, because I have no control over how the network drives are mapped. That job is done by the IT department at our main campus when they set up the Novell login scripts, which I am not allowed to change. I saw the note at the end that shows how different this situation is handled between Windows 2000 and Windows XP and that also explains to me why the problem is there, but there is no solution to the problem on that page that I can implement, because I can't change the network drive mappings.
Thanks for your attempts, Jupiler78!
As for your comment, FatherErvin, I will have to check it out, as my network drives start at F:. I'll get back to you on that one, thanks!
Regards,
Kobus
0
FolkLoreAuthor Commented:
Nope, nothing is currently mapped to D: or E:... that is what makes it so confusing for me!
Regards,
Kobus
0
Jupiler78Commented:
OK, I'll keep looking. So I can't say more then good luck
0
FolkLoreAuthor Commented:
Increasing the value of this question by 50.
Thanks,
Kobus
0
rustyrpageCommented:
What about just moving all of the CD-Roms (I know, 50 computers is hard to do that on...but it would work) to D & then automatically & memory device would be put to E (since that is the next letter after the last physical drive).
0
FolkLoreAuthor Commented:
Oh, so what you are saying is that the fact that the CD-ROM is currently located at G: is confusing the system, since there is a physical drive after a mapped network drive?
Ok... this is a huge thing to go and do, but I will check it out with one or two and see if this works.
Thanks for the comment. I will keep you posted.
Regards,
Kobus
0
rustyrpageCommented:
I am pretty sure that is what the issue is....it can't put removable media on drive letters between other hardware drives...it has to do it after the others. I know it's a lot of work to do, but I believe it to be the only solution
0
Jupiler78Commented:
Rustyrpage, you say you are pretty sure what the issue is, but following the MS documentation and your own it has to put removable drive letters after the other, but as far as I know the alphabet, it is ... D: E: F: G: H: and then I would say it should take H: as the problem letter? Or I'm I thinking completely wrong here ?
0
rustyrpageCommented:
I don't know where you are getting that from....it puts the removable drives after the last HARDWARE drive. (ie, hard drive or CD-Rom). So, if he moves the CD-rom to drive D:, then what's the next letter in the alphabet?....E:. So, C = Hard drive, D = CD Rom & E = Removable storage. Then F, G, H etc would then be network drives (that are mapped via login script or something)
0
Jupiler78Commented:
Yes, but at this moment his last HARDWARE DRIVE is G: = CD-ROM so the next one should be H: and not F:
0
rustyrpageCommented:
That is true...it doesn't make sense then...but still he should try it.
Read your own article you found & the quote you put: MS says this would be the reason: an USB device would take the next availeble drive-letter after all physical drives.
It takes the next available after all physical drives. The only thing I can think is that it doesn't see the CD-Rom the same way (as a "Physical" storage drive). However, if you move the CD-Rom to Drive D, then FOR SURE, the next available drive letter is E.
What would hurt in trying that?
0
Jupiler78Commented:
I agree totally with you that he should try that. But I though you knew something more about this exception?
0
rustyrpageCommented:
No...it seems VERY strange what is going on...I have experimented on my computer & every time it does assign the memory card to the next available. For example...I have a 6-in-1 reader...I plug it in...the first drive is letter D (because my CD-RW is letter E), then all the rest come in at F, G, H, I, J....strange, let's see what happens
0
Jupiler78Commented:
Good point we will wait for FolkLore to give the answer to the test
0
FolkLoreAuthor Commented:
I hate to bring this to you, but after testing this extensively with several computers, this problem still is not solved. The CD-ROMs are set back to D: and there are no logical drives after D:, so logically I'd say that the flash disks should be picked up as E:, but for some reason it doesn't work. I have no more ideas, and to the person who can solve this problem, 400 points is awarded...
What we have noticed, however, is that if you insert the flash stick, and keep it there while rebooting the computer and then log in again, the flash disk works fine. It takes over the mapping of the network drive, which is F:...
Regards,
FolkLore
0
FolkLoreAuthor Commented:
Jupiler78,
I haven't forgotten about your suggestion yet. I have been out of office for over a week. When I checked the dosdevices, there were several dos devices, I assume that it was because of the various flash disks that have been put into the machine before.
The letters that were assigned to dos devices were:
C:
D:
E:
G:
H:
I:
When looking in Windows Explorer, Only C: and D: actually shows up, and if I insert my flash disk, it shows E:, and I guess the other 3 are other flash disks that used to be in that machine before.
I deleted all of those "extra" dos mappings and restarted the computer, and will do some further tests. If this solves the problem, I will write a registry script that will delete all those drive letters at startup, and if that works, I will allocate these points to you, as you would have put me on the right track then!
Regards,
Kobus/FolkLore
0
Jupiler78Commented:
Thanx. I really hopes it works, Kobus!
0
FolkLoreAuthor Commented:
Ok... I have written the registry script to delete the dosdevices upon login, and it seems to work with my flash disk. I am just looking to find a few people with different brands and sizes of flash disks to see if it works as well, and then I will close this question.
Kobus/FolkLore
0
Jupiler78Commented:
Ok, let me know
0
FolkLoreAuthor Commented:
Tested it with 3 different flash disks. Now I am going to implement it in the labs. But I can't do it now, because there are classes going on at the moment. In the mean time will test with a few more flashdisks if I can find them! I consider this question closed. Thanks, Jupiler and everyone else who contributed!
Regards,
Kobus/FolkLore
0
Jupiler78Commented:
So it actually worked. Glad I could help
jupiler78
0
Question has a verified solution.
Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.
Have a better answer? Share it in a comment.
All Courses
From novice to tech pro — start learning today. | {
"url": "https://www.experts-exchange.com/questions/21147815/USB-memory-sticks-and-Windows-XP.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2018-22",
"warc_metadata": {
"Content-Length": "231221",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2WFGXF6NZ6RHECGTHI4A5WUE7PFQ7INM",
"WARC-Concurrent-To": "<urn:uuid:c390bb6d-e367-43ee-b202-cc6d1fb1f44e>",
"WARC-Date": "2018-05-27T18:05:02Z",
"WARC-IP-Address": "104.20.169.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2WACRNCMGCB6DAZBYZ4FVMOBIOSSSM4Q",
"WARC-Record-ID": "<urn:uuid:90f277cc-fc90-480c-b259-babc5aa6babd>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/21147815/USB-memory-sticks-and-Windows-XP.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:55e56b84-0977-4ba1-924b-98ebba18e1c0>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-16-224-244.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
33,
34,
38,
39,
277,
278,
530,
531,
562,
563,
572,
573,
579,
601,
616,
629,
644,
666,
668,
710,
728,
729,
799,
800,
820,
822,
824,
844,
1074,
1076,
1078,
1100,
1294,
1296,
1320,
1321,
1435,
1436,
1438,
1458,
1703,
1705,
1707,
1733,
1974,
1976,
1978,
1998,
2094,
2095,
2153,
2154,
2206,
2208,
2210,
2232,
2312,
2314,
2316,
2342,
2464,
2465,
2586,
2587,
2656,
2657,
2663,
2665,
2667,
2687,
2838,
2840,
2842,
2868,
3413,
3414,
3451,
3452,
3592,
3593,
3602,
3603,
3609,
3611,
3613,
3639,
3731,
3732,
3741,
3742,
3748,
3750,
3752,
3772,
3830,
3832,
3834,
3860,
3905,
3906,
3914,
3915,
3921,
3923,
3925,
3946,
4176,
4178,
4180,
4206,
4380,
4381,
4485,
4486,
4534,
4535,
4544,
4545,
4551,
4553,
4555,
4576,
4809,
4811,
4813,
4833,
5159,
5161,
5163,
5184,
5567,
5569,
5571,
5591,
5694,
5696,
5698,
5719,
5791,
5792,
5966,
5967,
6230,
6231,
6263,
6265,
6267,
6287,
6396,
6398,
6400,
6421,
6762,
6764,
6766,
6786,
6854,
6856,
6858,
6884,
7278,
7279,
7509,
7510,
7519,
7520,
7529,
7531,
7533,
7559,
7570,
7571,
7824,
7825,
7877,
7878,
7881,
7884,
7887,
7890,
7893,
7896,
7897,
8095,
8096,
8418,
8419,
8428,
8429,
8444,
8445,
8447,
8449,
8469,
8508,
8510,
8512,
8538,
8808,
8809,
8824,
8826,
8828,
8848,
8864,
8866,
8868,
8894,
9209,
9210,
9219,
9220,
9235,
9237,
9239,
9259,
9300,
9301,
9311,
9313,
9347,
9348,
9449,
9450,
9495,
9496,
9508,
9509
],
"line_end_idx": [
33,
34,
38,
39,
277,
278,
530,
531,
562,
563,
572,
573,
579,
601,
616,
629,
644,
666,
668,
710,
728,
729,
799,
800,
820,
822,
824,
844,
1074,
1076,
1078,
1100,
1294,
1296,
1320,
1321,
1435,
1436,
1438,
1458,
1703,
1705,
1707,
1733,
1974,
1976,
1978,
1998,
2094,
2095,
2153,
2154,
2206,
2208,
2210,
2232,
2312,
2314,
2316,
2342,
2464,
2465,
2586,
2587,
2656,
2657,
2663,
2665,
2667,
2687,
2838,
2840,
2842,
2868,
3413,
3414,
3451,
3452,
3592,
3593,
3602,
3603,
3609,
3611,
3613,
3639,
3731,
3732,
3741,
3742,
3748,
3750,
3752,
3772,
3830,
3832,
3834,
3860,
3905,
3906,
3914,
3915,
3921,
3923,
3925,
3946,
4176,
4178,
4180,
4206,
4380,
4381,
4485,
4486,
4534,
4535,
4544,
4545,
4551,
4553,
4555,
4576,
4809,
4811,
4813,
4833,
5159,
5161,
5163,
5184,
5567,
5569,
5571,
5591,
5694,
5696,
5698,
5719,
5791,
5792,
5966,
5967,
6230,
6231,
6263,
6265,
6267,
6287,
6396,
6398,
6400,
6421,
6762,
6764,
6766,
6786,
6854,
6856,
6858,
6884,
7278,
7279,
7509,
7510,
7519,
7520,
7529,
7531,
7533,
7559,
7570,
7571,
7824,
7825,
7877,
7878,
7881,
7884,
7887,
7890,
7893,
7896,
7897,
8095,
8096,
8418,
8419,
8428,
8429,
8444,
8445,
8447,
8449,
8469,
8508,
8510,
8512,
8538,
8808,
8809,
8824,
8826,
8828,
8848,
8864,
8866,
8868,
8894,
9209,
9210,
9219,
9220,
9235,
9237,
9239,
9259,
9300,
9301,
9311,
9313,
9347,
9348,
9449,
9450,
9495,
9496,
9508,
9509,
9556
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 9556,
"ccnet_original_nlines": 228,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43620607256889343,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07655271887779236,
"rps_doc_frac_lines_end_with_ellipsis": 0.008733619935810566,
"rps_doc_frac_no_alph_words": 0.1882522851228714,
"rps_doc_frac_unique_words": 0.29199278354644775,
"rps_doc_mean_word_length": 4.420228958129883,
"rps_doc_num_sentences": 106,
"rps_doc_symbol_to_word_ratio": 0.009629270061850548,
"rps_doc_unigram_entropy": 5.430129051208496,
"rps_doc_word_count": 1661,
"rps_doc_frac_chars_dupe_10grams": 0.025878509506583214,
"rps_doc_frac_chars_dupe_5grams": 0.03786433860659599,
"rps_doc_frac_chars_dupe_6grams": 0.03132661059498787,
"rps_doc_frac_chars_dupe_7grams": 0.025878509506583214,
"rps_doc_frac_chars_dupe_8grams": 0.025878509506583214,
"rps_doc_frac_chars_dupe_9grams": 0.025878509506583214,
"rps_doc_frac_chars_top_2gram": 0.02846636064350605,
"rps_doc_frac_chars_top_3gram": 0.03268864005804062,
"rps_doc_frac_chars_top_4gram": 0.008989379741251469,
"rps_doc_books_importance": -825.824462890625,
"rps_doc_books_importance_length_correction": -825.824462890625,
"rps_doc_openwebtext_importance": -585.7532348632812,
"rps_doc_openwebtext_importance_length_correction": -585.7532348632812,
"rps_doc_wikipedia_importance": -338.4363708496094,
"rps_doc_wikipedia_importance_length_correction": -338.4363708496094
},
"fasttext": {
"dclm": 0.4992451071739197,
"english": 0.9555677771568298,
"fineweb_edu_approx": 1.4474488496780396,
"eai_general_math": 0.38045811653137207,
"eai_open_web_math": 0.4516061544418335,
"eai_web_code": 0.016824839636683464
}
} | {
"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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-2,851,775,740,957,096,400 | th 259 - Python Tips: How to Avoid Indentation Errors in Python [Duplicate]
Python Tips: How to Avoid Indentation Errors in Python [Duplicate]
Posted on
th?q=Indentation Error In Python [Duplicate] - Python Tips: How to Avoid Indentation Errors in Python [Duplicate]
If you’re a Python developer, you know how crucial indentation is in the language. Even the slightest mistake in your code can cause syntax errors that may take hours to debug. Let’s face it, indentation errors can be quite frustrating! Are you tired of consistently encountering indentation errors while coding in Python? Well, worry no more!
In this article, we will be sharing tips on how to avoid indentation errors in Python. Our team of experienced Python developers have put together some effective methods that will help you write better code without worrying about indentation issues. Whether you’re a beginner or a seasoned programmer, these tips will come in handy to help you save time and get that clean Python code you’ve always wanted.
By reading through this article, you will learn some of the best practices for writing clean, concise, and readable code in Python. You’ll also get to know the common mistakes to avoid when indenting in Python. So, are you ready to boost your Python coding skills by mastering its indentation rules? Don’t wait any longer! Take the first step by reading our full article and become an expert in avoiding indentation errors in Python!
th?q=Indentation%20Error%20In%20Python%20%5BDuplicate%5D - Python Tips: How to Avoid Indentation Errors in Python [Duplicate]
“Indentation Error In Python [Duplicate]” ~ bbaz
Introduction
Python is one of the most widely used programming languages in the world. It is popular among developers due to its simplicity, flexibility and ease of use. However, even experienced Python developers can struggle with indentation errors which can be time-consuming and frustrating. In this article, we will share some tips on how to avoid these errors so that you can write clean, concise and readable code.
The Importance of Indentation in Python
Indentation plays a critical role in the syntax of Python. It is used to indicate the structure of code blocks, such as loops and conditional statements. Without proper indentation, the code may not compile or run properly, leading to issues that are difficult to debug.
Common Indentation Errors
There are several common indentation errors that Python developers may encounter, such as mixing tabs and spaces or inconsistent indentation within the same code block. These errors can be avoided by adhering to a consistent indentation style throughout your code.
Best Practices for Writing Python Code
There are some best practices that you can follow to ensure that your Python code is easy to read, maintain and debug. These include using descriptive function and variable names, commenting your code, and following the PEP 8 style guide for Python code.
Descriptive Function and Variable Names
Using descriptive names for your functions and variables can make your code easier to understand and reduce the likelihood of errors. For example, instead of using generic names like a or temp, you should use descriptive names like customer_name or invoice_total.
Commenting Your Code
Adding comments to your code can be extremely helpful, especially when working on complex projects. Comments explain the purpose of the code, any special considerations or limitations, and any potential issues that may arise. This can save you time and effort when debugging your code.
Following PEP 8 Style Guide
The PEP 8 style guide provides a set of guidelines for writing clean and professional Python code. Following these guidelines can make your code more readable and consistent, and can help you avoid common mistakes like inconsistent indentation.
Methods to Avoid Indentation Errors in Python
Now that we have covered some best practices for writing clean Python code, let’s explore some methods that can help you avoid indentation errors. These include using text editors or IDEs with automatic indentation features, checking your code for indentation errors using linting tools, and using context managers such as with statements.
Text Editors and IDEs with Automatic Indentation
Many text editors and integrated development environments (IDEs) have built-in features that can help you avoid indentation errors. For example, some text editors will automatically indent your code as you type, while others will highlight indentation errors in real-time.
Linting Tools
Linting tools like Pylint or Flake8 can analyze your Python code for syntax and style errors, including indentation errors. These tools can be incorporated into your text editor or IDE, allowing you to catch issues before you even run your code.
Context Managers
Context managers, such as the with statement, are a powerful tool for managing resources in your Python code. They can also help you avoid indentation errors by ensuring that code within a block is properly indented.
Conclusion
In conclusion, indentation errors can be a frustrating and time-consuming problem for Python developers. However, by following some best practices and utilizing tools like text editors or linting tools, you can reduce the likelihood of these errors occurring. By mastering Python’s indentation rules, you can write clean, concise, and readable code that will impress your peers and make debugging a breeze.
Best Practices Methods to Avoid Indentation Error
Using descriptive function and variable names Text editors and IDEs with automatic indentation
Commenting your code Linting tools
Following PEP 8 style guide Context managers
Dear readers,
As you have finished reading the article on Python Tips: How to Avoid Indentation Errors in Python, we hope that you have found it informative and helpful. Here, we have discussed various ways to avoid indentation errors and improve your coding abilities in Python programming language.
Python is a widely used programming language, and it’s essential to be aware of the syntax and its rules. Therefore, we recommend keeping these tips in mind whenever you code in Python. It will not only save time but also prevent unnecessary errors.
Thanks for taking the time to read our blog post. We hope it has clarified some of the doubts you had before reading it. Please feel free to share your thoughts and feedback with us in the comments section below. We appreciate your support and look forward to providing more insightful Python-related content soon!
Here are some common questions that people also ask about avoiding indentation errors in Python:
1. Why do indentation errors occur in Python?
2. Indentation errors occur in Python when the indentation of a block of code is inconsistent. This can happen when tabs and spaces are mixed, or when there are not enough or too many spaces or tabs in a line.
3. How can I avoid indentation errors in Python?
4. To avoid indentation errors in Python, you should always use either tabs or spaces consistently throughout your code. It’s generally recommended to use four spaces for each level of indentation.
5. What tools can I use to check my code for indentation errors?
6. There are several tools you can use to check your Python code for indentation errors, such as Pylint, Pyflakes, and Flake8. These tools will analyze your code and provide you with feedback on any issues they find, including indentation errors.
7. What should I do if I encounter an indentation error in my code?
8. If you encounter an indentation error in your Python code, you should carefully review the affected code block and ensure that the indentation is consistent. You may need to adjust the spacing or tabs used in the affected lines to correct the error.
9. Are there any best practices for avoiding indentation errors in Python?
10. Yes, there are several best practices you can follow to avoid indentation errors in Python. These include using a consistent indentation style throughout your code, using a text editor or IDE that helps you identify indentation errors, and running your code through a linter or static code analysis tool to catch any issues before you deploy your code. | {
"url": "https://en.sourcecodeaplikasi.info/python-tips-how-to-avoid-indentation-errors-in-python-duplicate/",
"source_domain": "en.sourcecodeaplikasi.info",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "60584",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4CXD6DP3RTAZZSIMWSBQP5WMY6QY4X5M",
"WARC-Concurrent-To": "<urn:uuid:1c2353bc-6260-4397-a353-125da2c2e4ab>",
"WARC-Date": "2024-05-28T23:59:00Z",
"WARC-IP-Address": "162.0.209.218",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PS5WGP5JIM2A5Y4RPX3LNFIQCSONKO7B",
"WARC-Record-ID": "<urn:uuid:500004ef-d4cf-461c-90de-f0ec9a54dcc6>",
"WARC-Target-URI": "https://en.sourcecodeaplikasi.info/python-tips-how-to-avoid-indentation-errors-in-python-duplicate/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0a35ce78-0228-464b-9c1f-4c5edc698e8a>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-76\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,
76,
77,
144,
145,
155,
269,
270,
614,
615,
1022,
1023,
1457,
1458,
1584,
1633,
1634,
1647,
1648,
2057,
2058,
2098,
2099,
2370,
2371,
2397,
2398,
2663,
2664,
2703,
2704,
2959,
2960,
3000,
3001,
3265,
3266,
3287,
3288,
3574,
3575,
3603,
3604,
3849,
3850,
3896,
3897,
4237,
4238,
4287,
4288,
4561,
4562,
4576,
4577,
4823,
4824,
4841,
4842,
5059,
5060,
5071,
5072,
5479,
5480,
5530,
5625,
5660,
5705,
5706,
5720,
5721,
6008,
6009,
6259,
6260,
6575,
6576,
6673,
6674,
6722,
6934,
6935,
6986,
7186,
7187,
7254,
7503,
7504,
7574,
7829,
7830,
7907
],
"line_end_idx": [
76,
77,
144,
145,
155,
269,
270,
614,
615,
1022,
1023,
1457,
1458,
1584,
1633,
1634,
1647,
1648,
2057,
2058,
2098,
2099,
2370,
2371,
2397,
2398,
2663,
2664,
2703,
2704,
2959,
2960,
3000,
3001,
3265,
3266,
3287,
3288,
3574,
3575,
3603,
3604,
3849,
3850,
3896,
3897,
4237,
4238,
4287,
4288,
4561,
4562,
4576,
4577,
4823,
4824,
4841,
4842,
5059,
5060,
5071,
5072,
5479,
5480,
5530,
5625,
5660,
5705,
5706,
5720,
5721,
6008,
6009,
6259,
6260,
6575,
6576,
6673,
6674,
6722,
6934,
6935,
6986,
7186,
7187,
7254,
7503,
7504,
7574,
7829,
7830,
7907,
8265
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8265,
"ccnet_original_nlines": 92,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3835526406764984,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007236840203404427,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13026316463947296,
"rps_doc_frac_unique_words": 0.2947448492050171,
"rps_doc_mean_word_length": 5.114242076873779,
"rps_doc_num_sentences": 78,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.1452789306640625,
"rps_doc_word_count": 1313,
"rps_doc_frac_chars_dupe_10grams": 0.03469844162464142,
"rps_doc_frac_chars_dupe_5grams": 0.1995532363653183,
"rps_doc_frac_chars_dupe_6grams": 0.12077438831329346,
"rps_doc_frac_chars_dupe_7grams": 0.09456440806388855,
"rps_doc_frac_chars_dupe_8grams": 0.05271780118346214,
"rps_doc_frac_chars_dupe_9grams": 0.04139985144138336,
"rps_doc_frac_chars_top_2gram": 0.08101265877485275,
"rps_doc_frac_chars_top_3gram": 0.04586746171116829,
"rps_doc_frac_chars_top_4gram": 0.04839910939335823,
"rps_doc_books_importance": -530.13818359375,
"rps_doc_books_importance_length_correction": -530.13818359375,
"rps_doc_openwebtext_importance": -291.81781005859375,
"rps_doc_openwebtext_importance_length_correction": -291.81781005859375,
"rps_doc_wikipedia_importance": -226.69284057617188,
"rps_doc_wikipedia_importance_length_correction": -226.69284057617188
},
"fasttext": {
"dclm": 0.843768298625946,
"english": 0.887948751449585,
"fineweb_edu_approx": 2.9610214233398438,
"eai_general_math": 0.4694805145263672,
"eai_open_web_math": 0.13767629861831665,
"eai_web_code": 0.8610787987709045
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
669,993,148,136,748,500 | How Can Ai Bots Increase It Helpdesk Support Efficiency
How Can AI Bots Increase IT Helpdesk Support Efficiency?
In the rapidly evolving digital landscape, enterprises are constantly facing challenges to balance the act of minimizing costs and driving efficiencies.
In the enterprise, IT helpdesk has become an indispensable part of business operations. It is playing a critical role in supporting business users with uninterrupted technology services.
Without IT helpdesk, employees would keep running into level 1 general issues that could affect their productivity.
However IT helpdesk efficiency is affected by a plethora of factors. These include:
• Having to attend to low-value tickets.
• Ongoing resolution of basic issues.
• Employees approaching IT support team for trivial issues such as password reset and subsequently having to wait long hours till the issue gets resolved.
Changing workplace dynamics are bringing in a growing range of variable affecting IT helpdesk support.
UNDERSTANDING CHATBOTS
Basically, chatbots are simple AI programs that interact with users through the conversational interface. The main concepts that are driving the development of chatbots are artificial intelligence and machine learning.
Chatbots are revolutionizing the way B2E, B2B, B2C and C2C interactions work. They are designed in such a way that they get better and better by understanding the user based on the inputs the user provides, thereby saving a lot of money and time for organizations.
“By 2020, at least 80% of new enterprise application releases will make reasonably strong use of chatbots for conversational, AI-rich applications” – Gartner.
Chatbots also have the capability to extract data from user/FAQ guides which help employees resolve issues without having to refer to a guidebook. Employees can get answers to their questions using regular messaging channels like Skype, Skype for business etc.
BENEFITS OF IT HELPDESK WITH CHATBOTS
Using AI in IT helpdesk will enhance human support in real-time to meet the demands of employees and increase productivity. Here are a few ways that chatbots can increase your IT helpdesk’s efficiency:
ACCORDING TO GARTNER, “BY 2019, IT SERVICE DESKS UTILIZING MACHINE LEARNING ENHANCED TECHNOLOGIES WILL FREE UP TO 30% OF SUPPORT CAPACITY.”
ASSISTING EMPLOYEES:
IT helpdesk support team helps in providing information regarding products and services of the organization, troubleshooting, answering FAQs and IT policies, whenever employee raises a request. Addressing these regular and repeated activities could affect their productivity and in turn affect the cost to the company.
Introducing chatbots in IT helpdesk brings in a perfect value add of productivity and cost efficiency.
Using chatbots in IT helpdesk, helps organizations to address level 1 issues(regular and repeated) activities, manage tickets and provide self-service options. This helps in increasing the overall staff efficiency and ensures best support capabilities.
It addresses level 1 IT support issues by a quick chat using conversational UI. Chatbot provides options like quick troubleshooting, spread awareness about IT policies & initiatives, FAQ’s etc., using which employees can solve their general issues easily.
24/7 AVAILABILITY:
Extending support after office hours is always a challenge in the enterprise environment. When an issue arises after office hours or during downtime, solving it gets tough. So, these issues are added to queue till the support staff gets time to address them which leads to a slowdown in productivity.
Introducing chatbots in the IT helpdesk system helps in overcoming these problems and resolving issues effectively. They provide a unique range of options to solve the issues immediately. One doesn’t need to wait for the support staff for the resolution. Employees working late would always have a virtual support staff member addressing issues on time.
IT helpdesk chatbot also provides different troubleshooting scenarios which come handy even if the support staff isn’t available immediately.
24/7 availability of a virtual IT helpdesk support staff brings in a superior value-add to the existing IT helpdesk. Talk to us to know more.
INTEGRATE WITH LEGACY IT SYSTEMS (ITSM PLATFORMS):
According to HDI: “As a rule of thumb, if an end user spends more than 10 minutes in a self-service portal, they cost the organization more money than calling the service desk.
With AI technology such as smart machines making their way into enterprise world, AI is, like it or not, going to be a dominant solution in any ITSM system.
There simply aren’t enough resources for analysts to get personally involved with so many requests and tickets. For better or worse, human intervention for every request or one to one incident will not be sustainable. We will see numerous organizations use chatbots with AI abilities as a way to deal with.
Do employees need to call the IT helpdesk or fill the lengthy forms online to address their issues? Chatbots change these circumstances.
With the integration of chatbots, ITSM can be easier, faster, and convenient too.
An AI-powered chatbot is a key value for ITSM framework. It has the capability to integrate with many of the legacy ITSM tools like ServiceNow, Freshdesk or Jira. With these integrations, Chatbot will also have the capability to search in the respective ITSM tool knowledge bases to answer the end user questions.
MODERNIZING INCIDENT MANAGEMENT:
Some of the IT helpdesk staff are often found working on categorizing/ routing incidents. Addressing these incidents manually is not only time-consuming but also error-prone. Indeed, even the most experienced IT support staff find it difficult to categorize a wide range of incidents raised at a given point of time. Due to this, most of the repeated issues stand in the queue and wait for its turn to get resolved.
Chatbot in IT helpdesk provide employees with quick links about troubleshooting technique using the conversation UI. If the issue raised is among the repetitive tasks a chatbot is trained to solve, employees will be provided with the resolving techniques. If not, chatbot pops up an option of registering the ticket in their legacy incident management system.
Chatbot helps the support staff in gathering the data from multiple systems to check the previous incident records of the employee for faster resolution and help an employee to keep track the status of the ticket.
Additionally, chatbot also helps the support team by generating a brief report on the number of tickets raised on a particular day. It gives detailed insights about tickets which are opened/ in the queue/ assigned. It also provides an option to search all open/high priority tickets for specific support agent and set up an alert for the support team.
SELF SERVICE:
For most of the issues, time is the main issue, even if it is a simple task like password reset. Employees tend to raise a complaint in IT helpdesk and wait for their turn to get access to their logins.
If the support staff is busy in fixing an issue, they may not be able to manage any incoming requests, even if it is a high priority. Due to this, employee work time gets underutilized, in turn affecting their productivity.
These issues can be better addressed by integrating chatbots into IT helpdesk applications. Chatbots create a self-service interface where an employee can instantly get access to the credentials within no time. During this process, employee validates their identity using Multi-Factor Authentication (MFA) and get the issue resolved without any helpdesk support staff interference. Thereby, the employee can work uninterruptedly by resolving his issues without any dependency on IT team and make room for support staff to work efficiently on other high priority issues.
LOW MTTR (MEAN TIME TO RESOLUTION):
Mean Time to resolution depicts the health of the IT helpdesk support in an organization.
Mean Time to Resolution (MTTR) is the time between an incident being submitted and the time taken to resolve it. Tickets will be raised continuously and support staff may or maynot be available to address them in the expected time.
Service degradations and service interruptions can fundamentally affect both IT and business activities. IT support team should precisely measure incident response time to control service quality, outages and the cost to the company.
By integrating AI-powered chatbots in IT helpdesk, most of the repetitive tasks or issues will be addressed by the chatbot using self-service options/ troubleshooting techniques. This reduces the number of tickets waiting in the queue influencing the overall MTTR. Lower MTTR is the key factor in showcasing the efficiency of the IT helpdesk service.
The more the tickets received and the lesser the time it takes to resolve, there is an upsurge in the business productivity and eventually its bottom-line.
REDUCED COST PER TICKET:
For every organization, cost, or precisely unit cost, is basically important. Cost per ticket is a measure of how effectively an IT helpdesk service conducts work and leads its business.
“A RECENT HDI STUDY FOUND THAT THE AVERAGE COST PER SERVICE DESK TICKET, IN NORTH AMERICA (NA) IS $15.56. COST PER TICKET INCREASES SIGNIFICANTLY EACH TIME THE INCIDENT IS ESCALATED.”
Moreover, there are likewise indirect expenses for IT support directors/chiefs, equipment, facilities and training etc., that must be figured into the cost per ticket metric.
If chatbots are introduced in IT helpdesk, general issues get resolved and reduce the number of tickets which in turn lower the MTTR. The faster the MTTR, the lower its cost per ticket.
Minor/general issues will be resolved by chatbots using troubleshooting techniques and self-service options which help support personals not to keep running into general issues. They get engaged in resolving major issues which help them increase their productivity and cut the cost per ticket by working only on issues which are not addressed by chatbots.
TICKET ACTIVITY PERFORMANCE REPORTS:
IT helpdesk receive issues from different departments of the organization. If an employee raises an issue in the IT help desk application, the support staff or personnel will address the issue and continue to resolve other issues which are in the queue.
IT helpdesk cannot make a concise view where a similar kind of issues are occurring repeatedly. Resolving these frequent issues daily decrease the efficiency of the support staff.
Introducing chatbots in IT helpdesk helps in generating performance reports on the number of tickets raised, the number of tickets resolved, generate time-sheet and provide a report on frequent occurring issues.
By this report, the IT helpdesk personnel or organization can invest in the resource to reduce frequently occurring issues and helps in increasing work efficiency of the staff and increase productivity to the company.
MONITOR YOUR AGENT’S PERFORMANCE:
Monitoring IT infrastructures often involves tedious tasks multiple interactions and gathering reports from different legacy systems. This allows managers to identify problems, maintain quality standards and improve the overall experience.
Introducing chatbot in such a scenario paves a way to get the reports by simply having a quick chat with the chatbot. Chatbot can be integrated with AD/user profile servers/performance review system to track the overall progress of the employees and scale the productivity.
It can generate reports of the individual performance on daily/weekly/monthly basis and keep updating the status to the management team.
HUMAN HAND-OFF:
An AI-powered chatbot operates turn-by-turn discussion with the employee. Chatbots recognize keywords provided by an employee in the chat conversation and respond by matching queries with pre-set messages in its knowledge base and assist employees quickly.
Chatbots, unlike humans, don’t always guess correctly, and invalid responses will frustrate the user. So, to avoid all these users are provided with clear and smooth transition to human agents.
If the chatbot is not trained to answer a specific question, user will have an option to interact with human agents and address their issue.
Indeed, even after an operator is locked in, the bot remains as a background facilitator of the discussion.
CONCLUSION
Chatbots have started to emerge into business consciousness and indeed acting as a major business productivity tool.
Gartner predicts that by 2019, 40% of enterprises will be actively using chatbots to facilitate business processes using natural-language interactions.
AI-powered chatbots can unplug IT bottlenecks and resolve the most repetitive questions effortlessly. Support staff can stay focused on the high priority tasks than time-consuming and mundane tasks.
If you’d like to learn more about this topic, please feel free to get in touch with one of our experts for a personalized consultation.
Ebook 300x245
FREE EBOOK
a guide to choosing an enterprise bot builder platform
Insights
Subscribe to our monthly newsletter to get the latest updates directly to your mailbox!
Copyright 2020 Acuvate. All rights reserved | {
"url": "https://botcore.ai/blog/can-ai-bots-increase-helpdesk-support-efficiency/",
"source_domain": "botcore.ai",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "130017",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PRESOFGHFECAHKEKPOCEIY36GTUMZRWH",
"WARC-Concurrent-To": "<urn:uuid:b25e8b6d-156e-411b-b960-e7062fadf9f2>",
"WARC-Date": "2021-01-16T10:54:06Z",
"WARC-IP-Address": "162.144.49.205",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PJ5KZVHRQHQHUCI2ET7ETAD2MKNBZ2UY",
"WARC-Record-ID": "<urn:uuid:2eea7463-7b67-4779-aa6d-97564de107ca>",
"WARC-Target-URI": "https://botcore.ai/blog/can-ai-bots-increase-helpdesk-support-efficiency/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:90d485df-618f-4098-9200-58920552a3eb>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-233.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,
56,
57,
114,
115,
268,
269,
456,
457,
573,
574,
658,
659,
702,
703,
743,
744,
901,
902,
1005,
1006,
1029,
1030,
1249,
1250,
1515,
1516,
1675,
1676,
1937,
1938,
1976,
1977,
2179,
2180,
2320,
2321,
2342,
2343,
2662,
2663,
2766,
2767,
3020,
3021,
3277,
3278,
3297,
3298,
3599,
3600,
3954,
3955,
4097,
4098,
4240,
4241,
4292,
4293,
4470,
4471,
4628,
4629,
4937,
4938,
5075,
5076,
5158,
5159,
5473,
5474,
5507,
5508,
5924,
5925,
6285,
6286,
6500,
6501,
6853,
6854,
6868,
6869,
7072,
7073,
7297,
7298,
7868,
7869,
7905,
7906,
7996,
7997,
8229,
8230,
8464,
8465,
8816,
8817,
8973,
8974,
8999,
9000,
9187,
9188,
9372,
9373,
9548,
9549,
9735,
9736,
10092,
10093,
10130,
10131,
10385,
10386,
10566,
10567,
10779,
10780,
10998,
10999,
11033,
11034,
11274,
11275,
11549,
11550,
11687,
11688,
11704,
11705,
11962,
11963,
12157,
12158,
12299,
12300,
12408,
12409,
12420,
12421,
12538,
12539,
12691,
12692,
12891,
12892,
13028,
13029,
13030,
13048,
13063,
13122,
13123,
13136,
13137,
13229,
13230
],
"line_end_idx": [
56,
57,
114,
115,
268,
269,
456,
457,
573,
574,
658,
659,
702,
703,
743,
744,
901,
902,
1005,
1006,
1029,
1030,
1249,
1250,
1515,
1516,
1675,
1676,
1937,
1938,
1976,
1977,
2179,
2180,
2320,
2321,
2342,
2343,
2662,
2663,
2766,
2767,
3020,
3021,
3277,
3278,
3297,
3298,
3599,
3600,
3954,
3955,
4097,
4098,
4240,
4241,
4292,
4293,
4470,
4471,
4628,
4629,
4937,
4938,
5075,
5076,
5158,
5159,
5473,
5474,
5507,
5508,
5924,
5925,
6285,
6286,
6500,
6501,
6853,
6854,
6868,
6869,
7072,
7073,
7297,
7298,
7868,
7869,
7905,
7906,
7996,
7997,
8229,
8230,
8464,
8465,
8816,
8817,
8973,
8974,
8999,
9000,
9187,
9188,
9372,
9373,
9548,
9549,
9735,
9736,
10092,
10093,
10130,
10131,
10385,
10386,
10566,
10567,
10779,
10780,
10998,
10999,
11033,
11034,
11274,
11275,
11549,
11550,
11687,
11688,
11704,
11705,
11962,
11963,
12157,
12158,
12299,
12300,
12408,
12409,
12420,
12421,
12538,
12539,
12691,
12692,
12891,
12892,
13028,
13029,
13030,
13048,
13063,
13122,
13123,
13136,
13137,
13229,
13230,
13277
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 13277,
"ccnet_original_nlines": 159,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3558100163936615,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07124681770801544,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11959288269281387,
"rps_doc_frac_unique_words": 0.3283000588417053,
"rps_doc_mean_word_length": 5.2907938957214355,
"rps_doc_num_sentences": 112,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.609185218811035,
"rps_doc_word_count": 2053,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.031670041382312775,
"rps_doc_frac_chars_dupe_6grams": 0.013441359624266624,
"rps_doc_frac_chars_dupe_7grams": 0.008654019795358181,
"rps_doc_frac_chars_dupe_8grams": 0.008654019795358181,
"rps_doc_frac_chars_dupe_9grams": 0.008654019795358181,
"rps_doc_frac_chars_top_2gram": 0.026698580011725426,
"rps_doc_frac_chars_top_3gram": 0.008838149718940258,
"rps_doc_frac_chars_top_4gram": 0.008285770192742348,
"rps_doc_books_importance": -994.2656860351562,
"rps_doc_books_importance_length_correction": -994.2656860351562,
"rps_doc_openwebtext_importance": -649.4566040039062,
"rps_doc_openwebtext_importance_length_correction": -649.4566040039062,
"rps_doc_wikipedia_importance": -583.200439453125,
"rps_doc_wikipedia_importance_length_correction": -583.200439453125
},
"fasttext": {
"dclm": 0.027529239654541016,
"english": 0.933319628238678,
"fineweb_edu_approx": 1.4996057748794556,
"eai_general_math": 0.10836505889892578,
"eai_open_web_math": 0.13075202703475952,
"eai_web_code": 0.07308536767959595
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.40385",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-1,031,693,683,668,446,800 | First of all, if I rotate a span in a td or th, it doesn't rotate. I have to make it either position absolute or display:block to rotate it. absolute position is not an option for me so I went ahead with display:block.
here is my code : http://jsfiddle.net/bilalfazlani/95V5G/
I am using following css
.thetable th span {
transform: rotate(270deg);
display: block;
}
If you take a look output, you'll notice that although spans are being rotated to 270deg, they still consume the original space and not actual space.
I hope I am able to explain my problem correctly.
Recommended Answers
It looks to me like it's doing exactly whats asked of it.
if you rotate your phone 270deg, it doesn't change shape, and neither will a tea tray, or a slice of bread, or a mouse mat, or a printed piece of html!
To achieve what I think you do …
Jump to Post
All 2 Replies
It looks to me like it's doing exactly whats asked of it.
if you rotate your phone 270deg, it doesn't change shape, and neither will a tea tray, or a slice of bread, or a mouse mat, or a printed piece of html!
To achieve what I think you do you will have to individually print and rotate each word, and set them out somehow with divs, very complicated though.
It is supposed to rotate as per your code. Have you tried web-kits and moz-kit to make it compatible with the browsers? Maybe you're viewing it in a browser that does not support CSS3 properties. As with the block, well tables elements like td tr don't work on their own without any object placed within them.
Be a part of the DaniWeb community
We're a friendly, industry-focused community of 1.20 million developers, IT pros, digital marketers, and technology enthusiasts learning and sharing knowledge. | {
"url": "https://www.daniweb.com/digital-media/ui-ux-design/threads/454137/css-transform-rotate-reserves-the-original-space-and-not-actual-space",
"source_domain": "www.daniweb.com",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "61957",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EEEIR2BERDJWVYAVCLSBV5IPLZVZ2M3V",
"WARC-Concurrent-To": "<urn:uuid:9f5550cf-a15f-4fbd-84d5-36a55813c2ea>",
"WARC-Date": "2021-01-20T00:14:06Z",
"WARC-IP-Address": "104.22.5.5",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IDLLF2ASTBQQHVOYXDOH2TINIDWOLQYP",
"WARC-Record-ID": "<urn:uuid:7f74320c-6280-4edf-89ed-64d6f1740d67>",
"WARC-Target-URI": "https://www.daniweb.com/digital-media/ui-ux-design/threads/454137/css-transform-rotate-reserves-the-original-space-and-not-actual-space",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3c696f1f-9211-4295-8d18-7a53d987cb00>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-33.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,
219,
220,
278,
279,
304,
305,
325,
356,
376,
378,
379,
529,
530,
580,
581,
601,
602,
660,
812,
845,
846,
859,
860,
874,
875,
933,
1085,
1235,
1236,
1546,
1547,
1582,
1583
],
"line_end_idx": [
219,
220,
278,
279,
304,
305,
325,
356,
376,
378,
379,
529,
530,
580,
581,
601,
602,
660,
812,
845,
846,
859,
860,
874,
875,
933,
1085,
1235,
1236,
1546,
1547,
1582,
1583,
1742
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1742,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0.0011481100227683783,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42748090624809265,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027989819645881653,
"rps_doc_frac_lines_end_with_ellipsis": 0.029411759227514267,
"rps_doc_frac_no_alph_words": 0.17557251453399658,
"rps_doc_frac_unique_words": 0.5292207598686218,
"rps_doc_mean_word_length": 4.360389709472656,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0.0025445299688726664,
"rps_doc_unigram_entropy": 4.755520343780518,
"rps_doc_word_count": 308,
"rps_doc_frac_chars_dupe_10grams": 0.27103498578071594,
"rps_doc_frac_chars_dupe_5grams": 0.27103498578071594,
"rps_doc_frac_chars_dupe_6grams": 0.27103498578071594,
"rps_doc_frac_chars_dupe_7grams": 0.27103498578071594,
"rps_doc_frac_chars_dupe_8grams": 0.27103498578071594,
"rps_doc_frac_chars_dupe_9grams": 0.27103498578071594,
"rps_doc_frac_chars_top_2gram": 0.013402829878032207,
"rps_doc_frac_chars_top_3gram": 0.011913630180060863,
"rps_doc_frac_chars_top_4gram": 0.016381239518523216,
"rps_doc_books_importance": -196.652099609375,
"rps_doc_books_importance_length_correction": -187.02488708496094,
"rps_doc_openwebtext_importance": -127.01519775390625,
"rps_doc_openwebtext_importance_length_correction": -127.01519775390625,
"rps_doc_wikipedia_importance": -94.63362884521484,
"rps_doc_wikipedia_importance_length_correction": -89.05307006835938
},
"fasttext": {
"dclm": 0.24338215589523315,
"english": 0.9405620694160461,
"fineweb_edu_approx": 1.6194819211959839,
"eai_general_math": 0.39496803283691406,
"eai_open_web_math": 0.14885997772216797,
"eai_web_code": 0.11534994840621948
}
} | {
"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": "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": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-5,821,127,327,847,193,000 | Help - Search - Members - Calendar
Full Version: Alternative Rom's For 3100 ?
OESF Forums > Distros, Development, and Model Specific Forums > Model Specific Forums > C1000/3x00 General discussions
ilgo
Well, i just wondered which of the available ROM's do actually install & run on a C31000.?
benplaut
as far as i know, none at the moment...
you're stuck with the Sharp ROM, for now sad.gif
if you don't want your 3100 because of this technicality, i'll be glad to take it off your hands biggrin.gif
Mickeyl
Until Sharp releases the source code and the updater.sh script, it's probably a bit risky to try porting one of the alternative images to the C3100.
Then again, if you're adventurous you could cook a C3000-kernel with the modified C3100-CMDLINE and try if it boots. If so, then you probably can use the complete C3000 distribution for your C3100 as well.
crstophr
Tetsu(sp?) has a kernel out for the 3100. It's a beta and recovering from it would require a nand restore... but it works fine for me.
I'm toying with the idea of trying to repack a cacko image to fit onto my Z. It seems like if you could redistribute the allocation of space with links or something it would work.
--Chris
QUOTE(Mickeyl @ Jul 19 2005, 12:46 AM)
Until Sharp releases the source code and the updater.sh script, it's probably a bit risky to try porting one of the alternative images to the C3100.
Then again, if you're adventurous you could cook a C3000-kernel with the modified C3100-CMDLINE and try if it boots. If so, then you probably can use the complete C3000 distribution for your C3100 as well.
*
CoreDump
QUOTE(Mickeyl @ Jul 19 2005, 12:46 AM)
Until Sharp releases the source code and the updater.sh script, it's probably a bit risky to try porting one of the alternative images to the C3100.
Then again, if you're adventurous you could cook a C3000-kernel with the modified C3100-CMDLINE and try if it boots. If so, then you probably can use the complete C3000 distribution for your C3100 as well.
*
IMHO using the Akita (SL-C1000) distribution as base would make more sense. You'd have a sweet 128MB of flash for your OS and the HDD for storage.
Mickeyl
We need to see how that works out in practice. The Borzoi is pretty similar to either the Spitz or the Akita and I'd rather not add a dedicated machine type for it if the difference is just the amount of flash (see c7x0).
crstophr
QUOTE(Mickeyl @ Jul 20 2005, 12:40 AM)
We need to see how that works out in practice. The Borzoi is pretty similar to either the Spitz or the Akita and I'd rather not add a dedicated machine type for it if the difference is just the amount of flash (see c7x0).
*
If I understand tetsu's site as it translates into english. The kernel he has for the 3100 is the C1000 kernel with the only addition being changing a constant in the source.
QUOTE
They are 2005/7/8 SL-C3100 private v18b-pre3. V18a suitable ones of the SL-C1000/C3000 were built from the source of the C1000. (Note) because the source cord/code for the SL-3100 is not open from the SHARP, to reset to the origin, it is necessary to restore NAND backup. Please do not use the person who cannot understand this meaning.
Here is the key line from the patch that makes the C1000 source into C3100 source.
QUOTE
(The new) the patch which makes Yamada's SL-C1000 source compulsorily C3100 correspondence (2005/7/8)
#define CONFIG_ARCH_PXA_AKITA
This is the kernel I'm currently running on my 3100 with no problems. I think it is fair to say the hardware is so similar it just doesn't matter. (mplayer iwmmx/bvvd runs great on the 3100 with this BTW.) I don't see why we really need to wait for sharp to release the code.
The big problem is that the flash is partitioned differently from the 1000/3000/3100.
Does cacko provide the patched kernel source tarball for his 1.23 3000 beta or C1000 beta? I'd be thrilled to help setup a rom for the 3100 and I should be able to handle the kernel compile. It should be quite possible to have one 1000/3000/3100 code base and just apply a simple patch to switch between them.
--Chris
This is a "lo-fi" version of our main content. To view the full version with more information, formatting and images, please click here.
Invision Power Board © 2001-2014 Invision Power Services, Inc. | {
"url": "http://www.oesf.org/forum/lofiversion/index.php/t13937.html",
"source_domain": "www.oesf.org",
"snapshot_id": "crawl=CC-MAIN-2014-42",
"warc_metadata": {
"Content-Length": "9188",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AXVA576YQTMJP47UXH3TE5VZ53T3IXTG",
"WARC-Concurrent-To": "<urn:uuid:0ff18ea2-af81-4c07-8d19-f10fbffc4584>",
"WARC-Date": "2014-11-01T05:35:21Z",
"WARC-IP-Address": "152.19.134.41",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:G7O32HFQXFPKQCZMXZOPSFZFQVHKBTS6",
"WARC-Record-ID": "<urn:uuid:a5db57f9-c156-40e2-8c8b-24378d27ac02>",
"WARC-Target-URI": "http://www.oesf.org/forum/lofiversion/index.php/t13937.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:10d1488c-4e8e-4404-95ca-5ac16aacc05e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-16-133-185.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-42\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for October 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
35,
78,
197,
202,
293,
302,
342,
343,
392,
393,
394,
395,
504,
512,
661,
662,
868,
877,
1012,
1013,
1193,
1194,
1202,
1203,
1204,
1205,
1206,
1245,
1394,
1395,
1601,
1603,
1612,
1651,
1800,
1801,
2007,
2009,
2010,
2011,
2158,
2166,
2388,
2397,
2436,
2658,
2660,
2661,
2662,
2837,
2838,
2844,
3181,
3182,
3183,
3266,
3267,
3273,
3376,
3377,
3407,
3408,
3409,
3685,
3686,
3772,
3773,
4083,
4084,
4092,
4229
],
"line_end_idx": [
35,
78,
197,
202,
293,
302,
342,
343,
392,
393,
394,
395,
504,
512,
661,
662,
868,
877,
1012,
1013,
1193,
1194,
1202,
1203,
1204,
1205,
1206,
1245,
1394,
1395,
1601,
1603,
1612,
1651,
1800,
1801,
2007,
2009,
2010,
2011,
2158,
2166,
2388,
2397,
2436,
2658,
2660,
2661,
2662,
2837,
2838,
2844,
3181,
3182,
3183,
3266,
3267,
3273,
3376,
3377,
3407,
3408,
3409,
3685,
3686,
3772,
3773,
4083,
4084,
4092,
4229,
4291
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4291,
"ccnet_original_nlines": 71,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4153686463832855,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06749740242958069,
"rps_doc_frac_lines_end_with_ellipsis": 0.01388888992369175,
"rps_doc_frac_no_alph_words": 0.20456905663013458,
"rps_doc_frac_unique_words": 0.39300134778022766,
"rps_doc_mean_word_length": 4.487214088439941,
"rps_doc_num_sentences": 48,
"rps_doc_symbol_to_word_ratio": 0.0031152600422501564,
"rps_doc_unigram_entropy": 5.097574710845947,
"rps_doc_word_count": 743,
"rps_doc_frac_chars_dupe_10grams": 0.3746250569820404,
"rps_doc_frac_chars_dupe_5grams": 0.3746250569820404,
"rps_doc_frac_chars_dupe_6grams": 0.3746250569820404,
"rps_doc_frac_chars_dupe_7grams": 0.3746250569820404,
"rps_doc_frac_chars_dupe_8grams": 0.3746250569820404,
"rps_doc_frac_chars_dupe_9grams": 0.3746250569820404,
"rps_doc_frac_chars_top_2gram": 0.008998200297355652,
"rps_doc_frac_chars_top_3gram": 0.016196759417653084,
"rps_doc_frac_chars_top_4gram": 0.01889622025191784,
"rps_doc_books_importance": -340.2409973144531,
"rps_doc_books_importance_length_correction": -340.2409973144531,
"rps_doc_openwebtext_importance": -218.51182556152344,
"rps_doc_openwebtext_importance_length_correction": -218.51182556152344,
"rps_doc_wikipedia_importance": -153.71356201171875,
"rps_doc_wikipedia_importance_length_correction": -153.71356201171875
},
"fasttext": {
"dclm": 0.08013545721769333,
"english": 0.9159261584281921,
"fineweb_edu_approx": 1.277649164199829,
"eai_general_math": 0.8065567016601562,
"eai_open_web_math": 0.3230859637260437,
"eai_web_code": 0.2772730588912964
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
468,382,300,346,437,440 | Forum: Ruby Ruby Plugins
Announcement (2017-05-07): www.ruby-forum.com is now read-only since I unfortunately do not have the time to support and maintain the forum any more. Please see rubyonrails.org/community and ruby-lang.org/en/community for other Rails- und Ruby-related community platforms.
425cab08658a06567879717de154552c?d=identicon&s=25 Ari Brown (Guest)
on 2007-05-07 02:27
(Received via mailing list)
hey
this question is probably - no, definitely - really dumb. You all
are probably laughing yourselves sick. But....
I know you can write different parts of applications in different
languages, so can you write different plugins in different languags?
thanks,
ari
--------------------------------------------|
If you're not living on the edge,
then you're just wasting space.
4dea430d31b993abaf41cd9b54f8128d?d=identicon&s=25 Avdi Grimm (avdi)
on 2007-05-07 03:42
(Received via mailing list)
On 5/6/07, Ari Brown <[email protected]> wrote:
> I know you can write different parts of applications in different
> languages, so can you write different plugins in different languags?
What do you mean by "plugin"? The term "plugin" has no single defined
meaning in the Ruby language,
1c0cd550766a3ee3e4a9c495926e4603?d=identicon&s=25 John Joyce (Guest)
on 2007-05-07 08:58
(Received via mailing list)
On May 7, 2007, at 10:42 AM, Avdi Grimm wrote:
> On 5/6/07, Ari Brown <[email protected]> wrote:
>> I know you can write different parts of applications in different
>> languages, so can you write different plugins in different languags?
>
> What do you mean by "plugin"? The term "plugin" has no single defined
> meaning in the Ruby language,
>
> --
> Avdi
>
You mean write a plugin for an application? but you want to know if
you can write it in Ruby (instead of some other language)?
Of course it is possible. It just depends on details. What
application is it you want to make plugins for? Does it have a public
plugin API?
If so, what language is the API for? If it's not Ruby (probably not)
you could use a bridge...
425cab08658a06567879717de154552c?d=identicon&s=25 Ari Brown (Guest)
on 2007-05-08 00:51
(Received via mailing list)
On May 6, 2007, at 9:42 PM, Avdi Grimm wrote:
> On 5/6/07, Ari Brown <[email protected]> wrote:
>> I know you can write different parts of applications in different
>> languages, so can you write different plugins in different languags?
>
> What do you mean by "plugin"? The term "plugin" has no single defined
> meaning in the Ruby language,
An add-on to applications, such as TikiWiki and the like.
--------------------------------------------|
If you're not living on the edge,
then you're just wasting space.
This topic is locked and can not be replied to. | {
"url": "https://www.ruby-forum.com/topic/107200",
"source_domain": "www.ruby-forum.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "21442",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SNJYZ65BKBJ3S4VFR2CNGRRDYWYUU7ZO",
"WARC-Concurrent-To": "<urn:uuid:0cec0e94-75e4-4d79-b14f-86ccfd7287aa>",
"WARC-Date": "2018-02-23T14:51:01Z",
"WARC-IP-Address": "78.46.249.179",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PAJGMVBWSQU7EE5EALYHCXOYQ7YBZTF7",
"WARC-Record-ID": "<urn:uuid:ea15906a-adf3-46bb-a7ee-0e04e22a1f4c>",
"WARC-Target-URI": "https://www.ruby-forum.com/topic/107200",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:de2c0b81-b134-442e-a194-9ec782555cc9>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-168-252-115.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
25,
26,
299,
367,
387,
415,
419,
487,
534,
535,
601,
670,
671,
679,
683,
729,
763,
795,
863,
883,
911,
958,
1026,
1097,
1098,
1169,
1199,
1268,
1288,
1316,
1363,
1364,
1413,
1482,
1554,
1556,
1629,
1661,
1663,
1668,
1675,
1677,
1745,
1805,
1864,
1934,
1946,
2015,
2041,
2109,
2129,
2157,
2203,
2204,
2253,
2322,
2394,
2396,
2469,
2501,
2502,
2560,
2606,
2640,
2672
],
"line_end_idx": [
25,
26,
299,
367,
387,
415,
419,
487,
534,
535,
601,
670,
671,
679,
683,
729,
763,
795,
863,
883,
911,
958,
1026,
1097,
1098,
1169,
1199,
1268,
1288,
1316,
1363,
1364,
1413,
1482,
1554,
1556,
1629,
1661,
1663,
1668,
1675,
1677,
1745,
1805,
1864,
1934,
1946,
2015,
2041,
2109,
2129,
2157,
2203,
2204,
2253,
2322,
2394,
2396,
2469,
2501,
2502,
2560,
2606,
2640,
2672,
2719
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2719,
"ccnet_original_nlines": 65,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3269537389278412,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014354069717228413,
"rps_doc_frac_lines_end_with_ellipsis": 0.030303029343485832,
"rps_doc_frac_no_alph_words": 0.34609249234199524,
"rps_doc_frac_unique_words": 0.3562341034412384,
"rps_doc_mean_word_length": 5.12722635269165,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0.0031897900626063347,
"rps_doc_unigram_entropy": 4.569756984710693,
"rps_doc_word_count": 393,
"rps_doc_frac_chars_dupe_10grams": 0.448138952255249,
"rps_doc_frac_chars_dupe_5grams": 0.5454094409942627,
"rps_doc_frac_chars_dupe_6grams": 0.47493797540664673,
"rps_doc_frac_chars_dupe_7grams": 0.448138952255249,
"rps_doc_frac_chars_dupe_8grams": 0.448138952255249,
"rps_doc_frac_chars_dupe_9grams": 0.448138952255249,
"rps_doc_frac_chars_top_2gram": 0.055583130568265915,
"rps_doc_frac_chars_top_3gram": 0.027295289561152458,
"rps_doc_frac_chars_top_4gram": 0.043672461062669754,
"rps_doc_books_importance": -294.9222412109375,
"rps_doc_books_importance_length_correction": -294.9222412109375,
"rps_doc_openwebtext_importance": -197.5927276611328,
"rps_doc_openwebtext_importance_length_correction": -197.5927276611328,
"rps_doc_wikipedia_importance": -130.09149169921875,
"rps_doc_wikipedia_importance_length_correction": -130.09149169921875
},
"fasttext": {
"dclm": 0.02669019065797329,
"english": 0.8896796703338623,
"fineweb_edu_approx": 2.4850432872772217,
"eai_general_math": 0.6215301156044006,
"eai_open_web_math": 0.3255261182785034,
"eai_web_code": 0.0008171200170181692
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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 |
3,013,413,473,607,397,400 | 您好，游客！
您好，新朋友。点击以下按钮加入我们！
Why only Chrome is supported
About: Tinychat Enhancement Suite (TES)
最后编辑于 May 2018 脚本讨论 Chrome
Basically, Tinychat serves a different site to Firefox.
Details: on Chrome, Tinychat's CSS is in a <style> element within each shadow DOM container. This means I can easily inject my own CSS. On Firefox, however, the CSS is in the head element and applied to the shadow DOM in a manner that I've been unable to figure out.
评论
登录注册后才能评论。 | {
"url": "https://greasyfork.org/zh-CN/forum/discussion/34781/why-only-chrome-is-supported",
"source_domain": "greasyfork.org",
"snapshot_id": "crawl=CC-MAIN-2019-22",
"warc_metadata": {
"Content-Length": "31029",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VHYGANTS5PCFS5HQVPTZ3XJU6JL7VD23",
"WARC-Concurrent-To": "<urn:uuid:73d0a581-2025-49d5-9f8e-66475ed8573e>",
"WARC-Date": "2019-05-20T04:27:44Z",
"WARC-IP-Address": "45.33.37.174",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:P4LBNVZFIZFBWUC56GMFMEJDG5KLAANK",
"WARC-Record-ID": "<urn:uuid:355debe2-c6b9-4d13-a84c-321cdf098c48>",
"WARC-Target-URI": "https://greasyfork.org/zh-CN/forum/discussion/34781/why-only-chrome-is-supported",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ad9a7870-b659-4c15-ac4f-fa5dc3a77439>"
},
"warc_info": "isPartOf: CC-MAIN-2019-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-152-225-239.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,
7,
8,
27,
28,
57,
58,
98,
125,
126,
182,
183,
450,
451,
454,
455
],
"line_end_idx": [
7,
8,
27,
28,
57,
58,
98,
125,
126,
182,
183,
450,
451,
454,
455,
465
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 465,
"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.2788461446762085,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07692307978868484,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3076923191547394,
"rps_doc_frac_unique_words": 0.7402597665786743,
"rps_doc_mean_word_length": 4.753246784210205,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.9361610412597656,
"rps_doc_word_count": 77,
"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.027322400361299515,
"rps_doc_frac_chars_top_3gram": 0.0382513701915741,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -39.249149322509766,
"rps_doc_books_importance_length_correction": -42.47633743286133,
"rps_doc_openwebtext_importance": -27.483306884765625,
"rps_doc_openwebtext_importance_length_correction": -30.710494995117188,
"rps_doc_wikipedia_importance": -19.518108367919922,
"rps_doc_wikipedia_importance_length_correction": -22.745296478271484
},
"fasttext": {
"dclm": 0.24123650789260864,
"english": 0.8202919363975525,
"fineweb_edu_approx": 1.463425874710083,
"eai_general_math": 0.03110063076019287,
"eai_open_web_math": 0.11057425290346146,
"eai_web_code": 0.03915030136704445
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,122,288,688,197,108,000 | Choose how in-scope links open your PWA with Declarative Link Capturing
Published on Updated on
Caution
Declarative Link Capturing was part of the capabilities project. The engineering team has decided that Declarative Link Capturing will not launch with its current design. Instead, the feature has been redesigned as described in Control how your app is launched. If your app implements the Declarative Link Capturing API, you should transition to the replacement Launch Handler API.
What is Declarative Link Capturing?
Clicking links on the web can sometimes be a pleasant surprise. For example, clicking a web page link to YouTube on a mobile device opens the YouTube iOS or Android app, if it is installed. But when you install the YouTube PWA on a desktop computer and click a link, it opens in a browser tab.
But it gets more complex. What if the link appears not in a website, but in a chat message that you receive in one of Google's chat apps? On desktop operating systems, which have the notion of separate app windows, if the app is open already, should a new window or tab be created for each link click? When you think about it, there are many ways links and navigations can be captured, including, but not limited to, the following:
Declarative Link Capturing is a proposal for a web app manifest property called "capture_links" that lets developers determine declaratively what should happen when the browser is asked to navigate to a URL that is within the application's navigation scope, from a context outside of the navigation scope. This proposal does not apply if the user is already within the navigation scope (for instance, if the user has a browser tab open that is within scope, and clicks an internal link).
Key Term
The navigation scope of a web app manifest is the "scope" item of a processed manifest. The navigation scope restricts the set of URLs to which an application context can be navigated while the manifest is applied. If the "scope" member is not present in the manifest, it defaults to the parent path of the "start_url" member.
Some special conditions like middle-clicking a link (or right-clicking and then "open in new tab") would typically not trigger the link capturing behavior. Whether a link is target=_self or target=_blank does not matter, so that links clicked in a browser window (or window of a different PWA) would be opened in the PWA even if they would normally cause a navigation within the same tab.
Suggested use cases
Examples of sites that may use this API include:
• PWAs that want to open a window, rather than a browser tab, when the user clicks on a link to them. In a desktop environment, it often makes sense to have multiple application windows open at a time.
• Single-window PWAs where the developer prefers to only have a single instance of the app open at any time, with new navigations focusing the existing instance. Sub-use cases include:
• Apps for which it make sense to have only one instance running (e.g., a music player, a game).
• Apps that include multi-document management within a single instance (e.g., an HTML-implemented tab strip).
Enabling via about://flags
To experiment with Declarative Link Capturing locally, without an origin trial token, enable the #enable-desktop-pwas-link-capturing flag in about://flags.
How to use Declarative Link Capturing?
Developers can declaratively determine how links should be captured by leveraging the additional web app manifest field "capture_links". It takes a string or a an array of strings as its value. If an array of strings is given, the user agent chooses the first supported item in the list, defaulting to "none". The following values are supported:
• "none" (the default): No link capturing; links clicked leading to this PWA scope navigate as normal without opening a PWA window.
• "new-client": Each clicked link opens a new PWA window at that URL.
• "existing-client-navigate": The clicked link opens in an existing PWA window, if one is available, or in a new window if it is not. If more than one PWA window exists, the browser may choose one arbitrarily. This behaves like "new-client" if no window is currently open. 🚨 Careful! This option potentially leads to data loss, as pages can be arbitrarily navigated away from. Sites should be aware that they are opting into such behavior by choosing this option. This option works best for "read-only" sites that do not hold user data in memory, such as music players. If the page being navigated away from has a beforeunload event, the user would see the prompt before the navigation completes.
There is discussion about adding options that do not open a window at all, but instead fire a launch event in a chosen foreground window or the service worker. See the launch event explainer for details, and, more specifically, the sections on existing-client-event and service-worker.
Demo
The demo for Declarative Link Capturing actually consists of two demos that interact together:
1. https://continuous-harvest-tomato.glitch.me/
2. https://hill-glitter-tree.glitch.me/
The screencast below shows how the two interact. They show two different behaviors, "new-client" and "existing-client-navigate". Be sure to test the apps in different states, running in a tab or as an installed PWA, to see the difference in behavior.
Security and permissions
The Chromium team designed and implemented Declarative Link Capturing using the core principles defined in Controlling Access to Powerful Web Platform Features, including user control, transparency, and ergonomics. This API allows sites new additional control options. First, being able to automatically open installed apps in a window. This uses existing UI but makes it possible for the site to automatically trigger it. Second, the capability to focus an existing window on its own domain and fire an event containing the clicked URL. This is intended to allow the site to navigate an existing window to a new page, overriding the default HTML navigation flow.
Migrate to Launch Handler API
The Declarative Link Capturing API origin trial expired on March 30, 2022 for Chromium 97 and below. It will be replaced by a set of new features and APIs in Chromium 98 and above, which includes user-enabled link capturing and Launch Handler API.
In Chromium 98, automatic link capturing is now a user opt-in behavior rather than granted at install time to a web app. To enable link capturing, a user needs to launch an installed app from the browser using Open with and choose Remember my choice.
Example of an installed app's 'Open with' setting with the 'Remember my choice' option enabled.
Alternatively, users can switch link capturing on or off for a specific web app in the app management settings page.
Example of an installed app's settings page.
Link capturing is a ChromeOS-only feature for now; support for Windows, macOS, and Linux is in progress.
Launch Handler API
The control of an incoming navigation is migrated to Launch Handler API, which allows web apps to decide how a web app launches in various situations such as link capturing, share target or file handling, etc. To migrate from the Declarative Link Capturing API to the Launch Handler API:
1. Register your site for the Launch Handler origin trial and place the origin trial key into your web app.
2. Add a "launch_handler" entry to your site's manifest.
• To use "capture_links": "new-client", add:"launch_handler": { "route_to": "new-client" }.
• To use "capture_links": "existing-client-navigate", add: "launch_handler": { "route_to": "existing-client-navigate" }.
• To use "capture_links": "existing-client-event" (which was never implemented in the Declarative Link Capturing origin trial), add: "launch_handler": { "route_to": "existing-client-retain" }. With this option, pages in your app scope will no longer navigate automatically when a link navigation is captured. You must handle the LaunchParams in JavaScript by calling window.launchQueue.setConsumer() to enable navigation.
The capture_links field and Declarative Link Capturing origin trial registration are good until March 30, 2022. This will ensure users on Chromium 97 and below can still launch the web app at a captured link.
For more details, check out Control how your app is launched.
Feedback
The Chromium team wants to hear about your experiences with Declarative Link Capturing.
Tell us about the API design
Is there something about the API that does not work like you expected? Or are there missing methods or properties that you need to implement your idea? Have a question or comment on the security model? File a spec issue on the corresponding GitHub repo, or add your thoughts to an existing issue.
Report a problem with the implementation
Did you find a bug with Chromium's implementation? Or is the implementation different from the spec? File a bug at new.crbug.com. Be sure to include as much detail as you can, simple instructions for reproducing, and enter UI>Browser>WebAppInstalls in the Components box. Glitch works great for sharing quick and easy repros.
Show support for the API
Are you planning to use Declarative Link Capturing? Your public support helps the Chromium team prioritize features and shows other browser vendors how critical it is to support them.
Send a tweet to @ChromiumDev using the hashtag #DeclarativeLinkCapturing and let us know where and how you are using it.
Helpful links
Acknowledgements
Declarative Link Capturing was specified by Matt Giuca with input from Alan Cutter and Dominick Ng. The API was implemented by Alan Cutter. This article was reviewed by Joe Medley, Matt Giuca, Alan Cutter, and Shunya Shishido. Hero image by Zulmaury Saavedra on Unsplash.
Updated on Improve article
We serve cookies on this site to analyze traffic, remember your preferences, and optimize your experience. | {
"url": "https://developer.chrome.com/docs/web-platform/declarative-link-capturing/",
"source_domain": "developer.chrome.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "97371",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HWZLDIMNC7R42JHMCVVFKXBRXCXCXUD5",
"WARC-Concurrent-To": "<urn:uuid:9cf6cf6f-45b4-4d49-8048-f8c654896b9f>",
"WARC-Date": "2022-12-05T22:26:52Z",
"WARC-IP-Address": "172.253.115.141",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:T5QBFZDVKNQHDPFSNTF5B2BJ2VEW3ZR4",
"WARC-Record-ID": "<urn:uuid:152bba69-ec6e-4d46-b27e-0efc10dad089>",
"WARC-Target-URI": "https://developer.chrome.com/docs/web-platform/declarative-link-capturing/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a34d6598-fdd2-4e77-8c79-7f3ed1d448bc>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-51\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,
72,
73,
97,
98,
106,
107,
489,
490,
526,
527,
821,
822,
1254,
1255,
1743,
1744,
1753,
1754,
2081,
2082,
2471,
2472,
2492,
2493,
2542,
2543,
2747,
2934,
3035,
3149,
3150,
3177,
3178,
3334,
3335,
3374,
3375,
3721,
3722,
3856,
3928,
4627,
4628,
4914,
4915,
4920,
4921,
5016,
5017,
5067,
5109,
5110,
5361,
5362,
5387,
5388,
6052,
6053,
6083,
6084,
6332,
6333,
6584,
6585,
6681,
6682,
6799,
6800,
6845,
6846,
6951,
6952,
6971,
6972,
7260,
7261,
7371,
7372,
7431,
7432,
7528,
7653,
8079,
8080,
8289,
8290,
8352,
8353,
8362,
8363,
8451,
8452,
8481,
8482,
8779,
8780,
8821,
8822,
9148,
9149,
9174,
9175,
9359,
9360,
9481,
9482,
9496,
9497,
9514,
9515,
9787,
9788,
9815,
9816
],
"line_end_idx": [
72,
73,
97,
98,
106,
107,
489,
490,
526,
527,
821,
822,
1254,
1255,
1743,
1744,
1753,
1754,
2081,
2082,
2471,
2472,
2492,
2493,
2542,
2543,
2747,
2934,
3035,
3149,
3150,
3177,
3178,
3334,
3335,
3374,
3375,
3721,
3722,
3856,
3928,
4627,
4628,
4914,
4915,
4920,
4921,
5016,
5017,
5067,
5109,
5110,
5361,
5362,
5387,
5388,
6052,
6053,
6083,
6084,
6332,
6333,
6584,
6585,
6681,
6682,
6799,
6800,
6845,
6846,
6951,
6952,
6971,
6972,
7260,
7261,
7371,
7372,
7431,
7432,
7528,
7653,
8079,
8080,
8289,
8290,
8352,
8353,
8362,
8363,
8451,
8452,
8481,
8482,
8779,
8780,
8821,
8822,
9148,
9149,
9174,
9175,
9359,
9360,
9481,
9482,
9496,
9497,
9514,
9515,
9787,
9788,
9815,
9816,
9922
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 9922,
"ccnet_original_nlines": 114,
"rps_doc_curly_bracket": 0.000604719971306622,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3667007088661194,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016343209892511368,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1710929572582245,
"rps_doc_frac_unique_words": 0.3299620747566223,
"rps_doc_mean_word_length": 4.980404376983643,
"rps_doc_num_sentences": 102,
"rps_doc_symbol_to_word_ratio": 0.0010214500362053514,
"rps_doc_unigram_entropy": 5.470327377319336,
"rps_doc_word_count": 1582,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0406142883002758,
"rps_doc_frac_chars_dupe_6grams": 0.006853660102933645,
"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.04124889150261879,
"rps_doc_frac_chars_top_3gram": 0.05178321897983551,
"rps_doc_frac_chars_top_4gram": 0.01370732020586729,
"rps_doc_books_importance": -932.8602294921875,
"rps_doc_books_importance_length_correction": -932.8602294921875,
"rps_doc_openwebtext_importance": -513.2099609375,
"rps_doc_openwebtext_importance_length_correction": -513.2099609375,
"rps_doc_wikipedia_importance": -393.5010681152344,
"rps_doc_wikipedia_importance_length_correction": -393.5010681152344
},
"fasttext": {
"dclm": 0.1355409026145935,
"english": 0.8975221514701843,
"fineweb_edu_approx": 1.8194392919540405,
"eai_general_math": 0.10407394170761108,
"eai_open_web_math": 0.07331138849258423,
"eai_web_code": 0.8332802653312683
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "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,565,440,155,458,520,000 | dtrti2.f (3) - Linux Manuals
NAME
dtrti2.f -
SYNOPSIS
Functions/Subroutines
subroutine dtrti2 (UPLO, DIAG, N, A, LDA, INFO)
DTRTI2 computes the inverse of a triangular matrix (unblocked algorithm).
Function/Subroutine Documentation
subroutine dtrti2 (characterUPLO, characterDIAG, integerN, double precision, dimension( lda, * )A, integerLDA, integerINFO)
DTRTI2 computes the inverse of a triangular matrix (unblocked algorithm).
Purpose:
DTRTI2 computes the inverse of a real upper or lower triangular
matrix.
This is the Level 2 BLAS version of the algorithm.
Parameters:
UPLO
UPLO is CHARACTER*1
Specifies whether the matrix A is upper or lower triangular.
= 'U': Upper triangular
= 'L': Lower triangular
DIAG
DIAG is CHARACTER*1
Specifies whether or not the matrix A is unit triangular.
= 'N': Non-unit triangular
= 'U': Unit triangular
N
N is INTEGER
The order of the matrix A. N >= 0.
A
A is DOUBLE PRECISION array, dimension (LDA,N)
On entry, the triangular matrix A. If UPLO = 'U', the
leading n by n upper triangular part of the array A contains
the upper triangular matrix, and the strictly lower
triangular part of A is not referenced. If UPLO = 'L', the
leading n by n lower triangular part of the array A contains
the lower triangular matrix, and the strictly upper
triangular part of A is not referenced. If DIAG = 'U', the
diagonal elements of A are also not referenced and are
assumed to be 1.
On exit, the (triangular) inverse of the original matrix, in
the same storage format.
LDA
LDA is INTEGER
The leading dimension of the array A. LDA >= max(1,N).
INFO
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -k, the k-th argument had an illegal value
Author:
Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
Date:
September 2012
Definition at line 111 of file dtrti2.f.
Author
Generated automatically by Doxygen for LAPACK from the source code. | {
"url": "https://www.systutorials.com/docs/linux/man/3-dtrti2.f/",
"source_domain": "www.systutorials.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "25740",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M75GO4XCZ2OYUENYOJ4ULAMMD6B7MMCP",
"WARC-Concurrent-To": "<urn:uuid:09b73b09-e73d-4970-9ebc-9655593dd320>",
"WARC-Date": "2023-06-09T04:15:09Z",
"WARC-IP-Address": "104.21.34.36",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CZD3NHV64JUVPJYRG342RPOYJJ2Z4YMW",
"WARC-Record-ID": "<urn:uuid:885ca996-ee0c-4cac-942b-70ac692225d1>",
"WARC-Target-URI": "https://www.systutorials.com/docs/linux/man/3-dtrti2.f/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:67d9b75b-b53d-4699-a27b-d76f7b54163d>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-239\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
29,
30,
35,
36,
47,
48,
57,
58,
59,
81,
82,
83,
131,
205,
206,
240,
241,
365,
366,
440,
441,
450,
451,
516,
525,
526,
578,
579,
580,
582,
583,
595,
596,
601,
602,
632,
703,
738,
773,
774,
775,
780,
781,
811,
879,
917,
951,
952,
953,
955,
956,
979,
1025,
1026,
1027,
1029,
1030,
1087,
1152,
1223,
1285,
1355,
1426,
1488,
1558,
1623,
1650,
1651,
1722,
1757,
1758,
1759,
1763,
1764,
1789,
1855,
1856,
1857,
1862,
1863,
1889,
1920,
1988,
1989,
1990,
1992,
1993,
2001,
2002,
2021,
2022,
2051,
2052,
2077,
2078,
2087,
2088,
2094,
2095,
2110,
2111,
2152,
2153,
2160,
2161
],
"line_end_idx": [
29,
30,
35,
36,
47,
48,
57,
58,
59,
81,
82,
83,
131,
205,
206,
240,
241,
365,
366,
440,
441,
450,
451,
516,
525,
526,
578,
579,
580,
582,
583,
595,
596,
601,
602,
632,
703,
738,
773,
774,
775,
780,
781,
811,
879,
917,
951,
952,
953,
955,
956,
979,
1025,
1026,
1027,
1029,
1030,
1087,
1152,
1223,
1285,
1355,
1426,
1488,
1558,
1623,
1650,
1651,
1722,
1757,
1758,
1759,
1763,
1764,
1789,
1855,
1856,
1857,
1862,
1863,
1889,
1920,
1988,
1989,
1990,
1992,
1993,
2001,
2002,
2021,
2022,
2051,
2052,
2077,
2078,
2087,
2088,
2094,
2095,
2110,
2111,
2152,
2153,
2160,
2161,
2228
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2228,
"ccnet_original_nlines": 105,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22946859896183014,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.14492754638195038,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.27294686436653137,
"rps_doc_frac_unique_words": 0.3866666555404663,
"rps_doc_mean_word_length": 4.893333435058594,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.220690727233887,
"rps_doc_word_count": 300,
"rps_doc_frac_chars_dupe_10grams": 0.08310627192258835,
"rps_doc_frac_chars_dupe_5grams": 0.2568119764328003,
"rps_doc_frac_chars_dupe_6grams": 0.1968664973974228,
"rps_doc_frac_chars_dupe_7grams": 0.17847411334514618,
"rps_doc_frac_chars_dupe_8grams": 0.17847411334514618,
"rps_doc_frac_chars_dupe_9grams": 0.08310627192258835,
"rps_doc_frac_chars_top_2gram": 0.012261579744517803,
"rps_doc_frac_chars_top_3gram": 0.04359672963619232,
"rps_doc_frac_chars_top_4gram": 0.04904631897807121,
"rps_doc_books_importance": -232.982177734375,
"rps_doc_books_importance_length_correction": -232.982177734375,
"rps_doc_openwebtext_importance": -110.96410369873047,
"rps_doc_openwebtext_importance_length_correction": -110.96410369873047,
"rps_doc_wikipedia_importance": -87.34479522705078,
"rps_doc_wikipedia_importance_length_correction": -87.34479522705078
},
"fasttext": {
"dclm": 0.45981889963150024,
"english": 0.7648513913154602,
"fineweb_edu_approx": 2.991788625717163,
"eai_general_math": 0.9875861406326294,
"eai_open_web_math": 0.6017009615898132,
"eai_web_code": 0.6248190402984619
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "512.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-3,156,519,461,994,198,500 | This page describes an older version of the product. The latest stable version is 16.1.1.
Aggregators
With many systems such as pricing systems, risk management, trading and other analytic and business intelligence applications you may need to perform an aggregation activity across data stored within the data grid when generating reports or when running some business process. Such activity can leverage data stored in memory and will be much faster than performing it with a database. XAP provides common functionality to perform aggregations across the space. There is no need to retrieve the entire data set from the space to the client side , iterate the result set and perform the aggregation. This would be an expensive activity as it might return large amount of data into the client application.
Built-in Aggregators allow you to perform the entire aggregation activity at the space side avoiding any data retrieval back to the client side. Only the result of each aggregation activity performed with each partition is returned back to the client side where all the results are reduced and returned to the client application. Such aggregation activity utilize the partitioned nature of the data-grid allowing each partition to execute the aggregation with its local data in parallel, where all the partitions intermediate results are fully aggregated at the client side using the relevant reducer implementation.
How Aggregators Works?
Aggregators are executed by iterating the internal data grid structure that maintains the space objects. There is no materialization of the original user data grid object when performing this iteration (scan). This allows relatively fast scan. There is no need to index the aggregated fields (paths) - only the fields (paths) used to execute the query used to generate the result set scanned to calculate the aggregation. Future XAP releases may use indexes to perform the aggregation.
Supported Aggregators
XAP comes with several built-in Aggregators you may use. The aggregation process executed across all data grid partitions when using a partitioned data grid , or across the proxy master replica when using a replicated data grid. You may rout the aggregation into a specific partition.
Name Description
Min Returns the minimum value for a set of data grid entries for a given field (path) based on a given query.
Max Returns the maximum value for a set of data grid entries for a given field (path) based on a given query.
Average Returns the average value for a given set of data grid entries for a given field (path) based on a given query.
Sum Returns the sum value for a set of data grid entries for a given field (path) based on a given query.
MaxEntry Returns the Entry (space object) with the maximum value for a set of data grid entries for a given field (path) based on a given query.
MinEntry Returns the Entry (space object) with the minimum value for a set of data grid entries for a given field (path) based on a given query.
Interoperability
Aggregators may be performed on any data generated by any type of client. For example - A call for Aggregation from a Java application may be performed on space objects that were written into the space using .NET application using the XAP.NET API or C++ application using the XAP C++ API. Same for a call from .NET Aggregation API for data written into the space via a Java application.
Usage
using GigaSpaces.Core.Linq;
...
var queryable = from p in spaceProxy.Query<Person>("Country='UK' OR Country='U.S.A'") select p;
// retrieve the maximum value stored in the field "Age"
int maxAgeInSpace = queryable.Max(p => p.Age);
// retrieve the minimum value stored in the field "Age"
int minAgeInSpace = queryable.Min(p => p.Age);
// Sum the "Age" field on all space objects.
int combinedAgeInSpace = queryable.Sum(p => p.Age);
// Sum's the "Age" field on all space objects then divides by the number of space objects.
double averageAge = queryable.Average(p => p.Age);
// Retrieve the space object with the highest value for the field "Age".
Person oldestPersonInSpace = queryable.MaxEntry(p => p.Age);
// Retrieve the space object with the lowest value for the field "Age".
Person youngestPersonInSpace = queryable.MinEntry(p => p.Age);
[SpaceClass]
public class Person
{
[SpaceID(AutoGenerate = true)]
public string Id { get; set; }
public string Name { get; set; }
[SpaceIndex]
public string Country { get; set; }
public int Age { get; set; }
}
Group Aggregation
The following examples show how to group data in various ways:
using GigaSpaces.Core.Linq;
...
/* group by a single property with default select */
var query = from p in spaceProxy.Query<Person>()
group p by p.Gender into g
select g;
/* group by a single property with single select */
var query = from p in spaceProxy.Query<Person>()
group p by p.Gender into g
select g.Sum(p => p.Age);
/* group by single property with multi select */
var query = from p in spaceProxy.Query<Person>()
group p by p.Gender into g
select new { Max = g.Max(p => p.Age), Gender = g.Key, Min = g.Min(p => p.Age) };
/* group by multiple properties with default select */
var query = from p in spaceProxy.Query<Person>()
group p by new { p.Gender, p.Country } into g
select g;
/* group by multiple properties with single select */
var query = from p in spaceProxy.Query<Person>()
group p by new {p.Gender, p.Country} into g
select g.Sum(p => p.Age);
/* group by multiple properties with multiple select */
var query = from p in spaceProxy.Query<Person>()
group p by new { p.Gender, p.Country } into g
select new { Max = g.Max(p => p.Age), TheKey = g.Key, Min = g.Min(p => p.Age) };
Compound Aggregation
Compound aggregation will execute multiple aggregation operations across the space returning all of the result sets at once. When multiple aggregates are needed the compound aggregation API is significantly faster than calling each individual aggregate.
SqlQuery<Person> query = new SqlQuery<Person>("Country=? OR Country=?");
query.SetParameter(1,"UK");
query.SetParameter(2,"U.S.A");
var aggregationSet = new AggregationSet();
aggregationSet.MaxEntry("Age");
aggregationSet.MinEntry("Age");
aggregationSet.Sum("Age");
aggregationSet.Average("Age");
aggregationSet.MinValue("Age");
aggregationSet.MaxValue("Age");
var result = spaceProxy.Aggregate(sqlQuery, aggregationSet);
var oldest = (Person)result.Results[0];
var youngest = (Person)result.Results[1];
var sum = (int)result.Results[2];
var average = (double)result.Results[3];
var min = (int)result.Results[4];
var max = (int)result.Results[5];
Aggregate Embedded Fields
Aggregation against the members of embedded space classes is supported by supplying the field path while invoking the desired aggregate function.
using GigaSpaces.Core.Linq;
var queryable = from p in spaceProxy.Query<Person>() where p.Country == "UK" || p.Country=="U.S.A" select p;
// retrieve the maximum value stored in the field "Age"
var result = queryable.Max(p => p.Demographics.Age);
[SpaceClass]
public class Person
{
[SpaceID(AutoGenerate = true)]
public string Id { get; set; }
public string Name { get; set; }
public string State { get; set; }
public Demographics Demographics { get; set; }
}
[Serializable]
public class Demographics
{
public int Age { get; set; }
public char Gender { get; set; }
} | {
"url": "https://docs.gigaspaces.com/xap/10.0/dev-dotnet/aggregators.html",
"source_domain": "docs.gigaspaces.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "84508",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QLEAINA7CS7VPKO352TZLZGBV3E5JTSH",
"WARC-Concurrent-To": "<urn:uuid:f42e7f91-c78a-47ba-838b-b699fda3dea6>",
"WARC-Date": "2022-05-27T02:16:36Z",
"WARC-IP-Address": "205.251.251.56",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MD4QZAWJO7EMZ57NLM3SREZYZ5OADLMR",
"WARC-Record-ID": "<urn:uuid:2c78a052-e381-46de-b053-9db74c48f2e0>",
"WARC-Target-URI": "https://docs.gigaspaces.com/xap/10.0/dev-dotnet/aggregators.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a17661c1-673c-4314-81b4-cc12e4e98a6e>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-24\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,
90,
91,
103,
104,
105,
809,
810,
1427,
1428,
1451,
1452,
1938,
1939,
1961,
1962,
2247,
2248,
2249,
2266,
2376,
2486,
2606,
2712,
2857,
3002,
3003,
3020,
3021,
3408,
3409,
3415,
3416,
3444,
3445,
3449,
3545,
3601,
3648,
3704,
3751,
3796,
3848,
3939,
3990,
4063,
4124,
4196,
4259,
4272,
4292,
4294,
4329,
4364,
4365,
4402,
4403,
4420,
4460,
4461,
4494,
4496,
4497,
4498,
4516,
4517,
4580,
4581,
4609,
4610,
4614,
4667,
4716,
4760,
4787,
4788,
4840,
4889,
4933,
4976,
4977,
5026,
5075,
5119,
5217,
5218,
5273,
5322,
5385,
5412,
5413,
5467,
5516,
5577,
5620,
5621,
5677,
5726,
5789,
5887,
5888,
5889,
5910,
5911,
6165,
6166,
6167,
6240,
6268,
6299,
6300,
6343,
6375,
6407,
6434,
6465,
6497,
6529,
6530,
6591,
6592,
6632,
6674,
6708,
6749,
6783,
6817,
6818,
6844,
6845,
6991,
6992,
7020,
7021,
7022,
7131,
7187,
7240,
7253,
7273,
7275,
7310,
7345,
7382,
7420,
7471,
7473,
7488,
7514,
7516,
7549,
7550,
7587
],
"line_end_idx": [
90,
91,
103,
104,
105,
809,
810,
1427,
1428,
1451,
1452,
1938,
1939,
1961,
1962,
2247,
2248,
2249,
2266,
2376,
2486,
2606,
2712,
2857,
3002,
3003,
3020,
3021,
3408,
3409,
3415,
3416,
3444,
3445,
3449,
3545,
3601,
3648,
3704,
3751,
3796,
3848,
3939,
3990,
4063,
4124,
4196,
4259,
4272,
4292,
4294,
4329,
4364,
4365,
4402,
4403,
4420,
4460,
4461,
4494,
4496,
4497,
4498,
4516,
4517,
4580,
4581,
4609,
4610,
4614,
4667,
4716,
4760,
4787,
4788,
4840,
4889,
4933,
4976,
4977,
5026,
5075,
5119,
5217,
5218,
5273,
5322,
5385,
5412,
5413,
5467,
5516,
5577,
5620,
5621,
5677,
5726,
5789,
5887,
5888,
5889,
5910,
5911,
6165,
6166,
6167,
6240,
6268,
6299,
6300,
6343,
6375,
6407,
6434,
6465,
6497,
6529,
6530,
6591,
6592,
6632,
6674,
6708,
6749,
6783,
6817,
6818,
6844,
6845,
6991,
6992,
7020,
7021,
7022,
7131,
7187,
7240,
7253,
7273,
7275,
7310,
7345,
7382,
7420,
7471,
7473,
7488,
7514,
7516,
7549,
7550,
7587,
7588
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7588,
"ccnet_original_nlines": 152,
"rps_doc_curly_bracket": 0.004744329955428839,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2847178280353546,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018389349803328514,
"rps_doc_frac_lines_end_with_ellipsis": 0.013071900233626366,
"rps_doc_frac_no_alph_words": 0.2694990634918213,
"rps_doc_frac_unique_words": 0.29474708437919617,
"rps_doc_mean_word_length": 5.469844341278076,
"rps_doc_num_sentences": 120,
"rps_doc_symbol_to_word_ratio": 0.0012682300293818116,
"rps_doc_unigram_entropy": 5.067562580108643,
"rps_doc_word_count": 1028,
"rps_doc_frac_chars_dupe_10grams": 0.21091943979263306,
"rps_doc_frac_chars_dupe_5grams": 0.3236706256866455,
"rps_doc_frac_chars_dupe_6grams": 0.30197402834892273,
"rps_doc_frac_chars_dupe_7grams": 0.2745865285396576,
"rps_doc_frac_chars_dupe_8grams": 0.21091943979263306,
"rps_doc_frac_chars_dupe_9grams": 0.21091943979263306,
"rps_doc_frac_chars_top_2gram": 0.009247729554772377,
"rps_doc_frac_chars_top_3gram": 0.009959099814295769,
"rps_doc_frac_chars_top_4gram": 0.03485684096813202,
"rps_doc_books_importance": -902.7490844726562,
"rps_doc_books_importance_length_correction": -902.7490844726562,
"rps_doc_openwebtext_importance": -590.4576416015625,
"rps_doc_openwebtext_importance_length_correction": -590.4576416015625,
"rps_doc_wikipedia_importance": -519.91259765625,
"rps_doc_wikipedia_importance_length_correction": -519.91259765625
},
"fasttext": {
"dclm": 0.5014998912811279,
"english": 0.7780573964118958,
"fineweb_edu_approx": 2.605821371078491,
"eai_general_math": 0.8173776268959045,
"eai_open_web_math": 0.09676414728164673,
"eai_web_code": 0.9897059202194214
}
} | {
"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": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
3,866,340,865,614,491,600 | 1. Please be advised of a few specific rules and guidelines for this section.
RELEASED Sleeker Glitch! 2020-10-30
Like glitch but... s m o o t h
1. Saint Apollyon
Saint Apollyon Phantasmal Quasar
Saint Apollyon submitted a new mod:
Sleeker Glitch! - Like glitch but... s m o o t h
Read more about this mod...
2. CHABeavotto
CHABeavotto Orbital Explorer
Can we have a...workshop version ?
3. Saint Apollyon
Saint Apollyon Phantasmal Quasar
In due time
...In all seriousness, I'll try to get it on the workshop soon-ish. I recently had to deal with harddrive corruption, and while all my modding stuff is untouched, I essentially had to do a fresh windows install, so it might be a bit before I get my barings again.
4. CHABeavotto
CHABeavotto Orbital Explorer
sorry about that...I hope you won't lose too much...
5. kodamant
kodamant Void-Bound Voyager
ok so i tried to install this mod, but for some reason, and its not this mod, infact its a workshop mod, i dont know which one though as the only way to remove the titty lights is to run the game outside of steam so the workshop mods dont load, does anyone know of a workshop mod that gives the glitch a body similar to this, but with titty lights, i do not want the titty lights. i dont not want titty lights i want s m o o t h . so i require a s s i s t a n c e
6. Saint Apollyon
Saint Apollyon Phantasmal Quasar
The only mod I can think of on the workshop that would add titty lights would be "Get Rid of That Underwear", or some similar mod, probably. Only solutions I can think of where you could keep both mods is either get a local version of the mod with the titty lights and delete the glitch-altering files, or unpack this one and change the load order so it loads after it.
7. Saint Apollyon
Saint Apollyon Phantasmal Quasar
8. TotalyNotMeta
TotalyNotMeta Space Hobo
Unless you ain't working on this anymore, then a vanilla heads variant would be nice.
9. Saint Apollyon
Saint Apollyon Phantasmal Quasar
That can be arranged
Edit: Actually, if you're using this version, you can just go to the humanoid folder and delete the head/emotes files and you'll have the vanilla heads back with the rest of the reskin still intact.
Share This Page | {
"url": "https://community.playstarbound.com/threads/sleeker-glitch.161680/",
"source_domain": "community.playstarbound.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "48253",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:J23F52JGGK5M3VS3NUFHEXFWRZZ26WEZ",
"WARC-Concurrent-To": "<urn:uuid:9f4008d2-c224-4333-b69f-78ce0ddd4f8d>",
"WARC-Date": "2022-06-25T17:01:52Z",
"WARC-IP-Address": "159.65.51.80",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AITFMIUAQPMQ3OKHERIZMNIS6Q6PVUZ3",
"WARC-Record-ID": "<urn:uuid:0cb14b08-2e2f-48d7-ab28-94c400bfec5b>",
"WARC-Target-URI": "https://community.playstarbound.com/threads/sleeker-glitch.161680/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aef9e860-2488-4b04-bebf-50c622fc52fc>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-252\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,
80,
81,
117,
118,
149,
150,
170,
171,
208,
209,
249,
250,
303,
304,
336,
342,
359,
360,
393,
394,
433,
439,
459,
460,
497,
498,
514,
515,
783,
789,
806,
807,
840,
841,
898,
904,
918,
919,
951,
952,
1420,
1426,
1446,
1447,
1484,
1485,
1859,
1865,
1885,
1886,
1923,
1924,
1943,
1944,
1973,
1974,
2064,
2070,
2090,
2091,
2128,
2129,
2154,
2155,
2358,
2364,
2365
],
"line_end_idx": [
80,
81,
117,
118,
149,
150,
170,
171,
208,
209,
249,
250,
303,
304,
336,
342,
359,
360,
393,
394,
433,
439,
459,
460,
497,
498,
514,
515,
783,
789,
806,
807,
840,
841,
898,
904,
918,
919,
951,
952,
1420,
1426,
1446,
1447,
1484,
1485,
1859,
1865,
1885,
1886,
1923,
1924,
1943,
1944,
1973,
1974,
2064,
2070,
2090,
2091,
2128,
2129,
2154,
2155,
2358,
2364,
2365,
2380
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2380,
"ccnet_original_nlines": 67,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 6,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4444444477558136,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01677148975431919,
"rps_doc_frac_lines_end_with_ellipsis": 0.029411759227514267,
"rps_doc_frac_no_alph_words": 0.15513627231121063,
"rps_doc_frac_unique_words": 0.46650123596191406,
"rps_doc_mean_word_length": 4.270471572875977,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.014675050042569637,
"rps_doc_unigram_entropy": 4.846893310546875,
"rps_doc_word_count": 403,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1475886106491089,
"rps_doc_frac_chars_dupe_6grams": 0.1475886106491089,
"rps_doc_frac_chars_dupe_7grams": 0.0220801904797554,
"rps_doc_frac_chars_dupe_8grams": 0.0220801904797554,
"rps_doc_frac_chars_dupe_9grams": 0.0220801904797554,
"rps_doc_frac_chars_top_2gram": 0.08309122920036316,
"rps_doc_frac_chars_top_3gram": 0.052295178174972534,
"rps_doc_frac_chars_top_4gram": 0.07553748041391373,
"rps_doc_books_importance": -185.92730712890625,
"rps_doc_books_importance_length_correction": -185.92730712890625,
"rps_doc_openwebtext_importance": -124.12712097167969,
"rps_doc_openwebtext_importance_length_correction": -124.12712097167969,
"rps_doc_wikipedia_importance": -80.16228485107422,
"rps_doc_wikipedia_importance_length_correction": -80.16228485107422
},
"fasttext": {
"dclm": 0.0777352973818779,
"english": 0.8861600160598755,
"fineweb_edu_approx": 0.8332611322402954,
"eai_general_math": 0.15738272666931152,
"eai_open_web_math": 0.5639054775238037,
"eai_web_code": 0.0052931299433112144
}
} | {
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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 |
-525,426,049,386,934,460 | Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
PerlMonks
Re^4: The science fiction writer who most personifies Perl is:
by Bloodnok (Vicar)
on Jul 12, 2010 at 16:21 UTC ( #849038=note: print w/ replies, xml ) Need Help??
in reply to Re^3: The science fiction writer who most personifies Perl is:
in thread The science fiction writer who most personifies Perl is:
Methinx you've forgotten another source of todays' films : all too frequently, they are intolerably poor (with a few exceptions) remakes of classic films.
A user level that continues to overstate my experience :-))
• Comment on Re^4: The science fiction writer who most personifies Perl is:
Replies are listed 'Best First'.
Re^5: The science fiction writer who most personifies Perl is:
by Xiong (Hermit) on Jul 21, 2010 at 10:01 UTC
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://849038]
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (3)
As of 2016-07-23 12:49 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
What is your favorite alternate name for a (specific) keyboard key?
Results (220 votes). Check out past polls. | {
"url": "http://www.perlmonks.org/?node_id=849038",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "20845",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F5A7XQVQRD6RXJOI6RSYWOCABS4SMRNB",
"WARC-Concurrent-To": "<urn:uuid:a8634dbc-6c27-4d77-9ad4-de8dc32eb041>",
"WARC-Date": "2016-07-23T12:50:05Z",
"WARC-IP-Address": "66.39.54.27",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:MR6B7CHUSDRD2UVFDFTD64YVQ3DFOEHE",
"WARC-Record-ID": "<urn:uuid:6fab1026-58f1-4c10-83ab-2b9e373a983f>",
"WARC-Target-URI": "http://www.perlmonks.org/?node_id=849038",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d818e8d5-e9e9-4309-8265-cc4e2961cffa>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-27-174.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-30\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for July 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
63,
88,
90,
102,
103,
166,
167,
187,
268,
269,
270,
345,
412,
413,
568,
569,
629,
707,
708,
741,
804,
851,
852,
860,
870,
880,
881,
901,
919,
932,
945,
975,
980,
992,
1029,
1030,
1068,
1081,
1154,
1181,
1191,
1204,
1216,
1227,
1245,
1317,
1318,
1319,
1320,
1321,
1322,
1323,
1324,
1325,
1326,
1327,
1328,
1329,
1330,
1331,
1332,
1333,
1334,
1335
],
"line_end_idx": [
63,
88,
90,
102,
103,
166,
167,
187,
268,
269,
270,
345,
412,
413,
568,
569,
629,
707,
708,
741,
804,
851,
852,
860,
870,
880,
881,
901,
919,
932,
945,
975,
980,
992,
1029,
1030,
1068,
1081,
1154,
1181,
1191,
1204,
1216,
1227,
1245,
1317,
1318,
1319,
1320,
1321,
1322,
1323,
1324,
1325,
1326,
1327,
1328,
1329,
1330,
1331,
1332,
1333,
1334,
1335,
1381
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1381,
"ccnet_original_nlines": 64,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2259136140346527,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023255810141563416,
"rps_doc_frac_lines_end_with_ellipsis": 0.015384620055556297,
"rps_doc_frac_no_alph_words": 0.3122923672199249,
"rps_doc_frac_unique_words": 0.6511628031730652,
"rps_doc_mean_word_length": 4.80930233001709,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0.006644519977271557,
"rps_doc_unigram_entropy": 4.705664157867432,
"rps_doc_word_count": 215,
"rps_doc_frac_chars_dupe_10grams": 0.1460348218679428,
"rps_doc_frac_chars_dupe_5grams": 0.23694391548633575,
"rps_doc_frac_chars_dupe_6grams": 0.23694391548633575,
"rps_doc_frac_chars_dupe_7grams": 0.23694391548633575,
"rps_doc_frac_chars_dupe_8grams": 0.23694391548633575,
"rps_doc_frac_chars_dupe_9grams": 0.23694391548633575,
"rps_doc_frac_chars_top_2gram": 0.04835589975118637,
"rps_doc_frac_chars_top_3gram": 0.08220502734184265,
"rps_doc_frac_chars_top_4gram": 0.11121857166290283,
"rps_doc_books_importance": -150.92991638183594,
"rps_doc_books_importance_length_correction": -150.9252471923828,
"rps_doc_openwebtext_importance": -93.70360565185547,
"rps_doc_openwebtext_importance_length_correction": -93.70360565185547,
"rps_doc_wikipedia_importance": -74.63583374023438,
"rps_doc_wikipedia_importance_length_correction": -73.3331069946289
},
"fasttext": {
"dclm": 0.057187799364328384,
"english": 0.8860130310058594,
"fineweb_edu_approx": 1.7060914039611816,
"eai_general_math": 0.00006484999903477728,
"eai_open_web_math": 0.09925960749387741,
"eai_web_code": -0.000009059999683813658
}
} | {
"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": "791.4372",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-7,161,454,030,172,301,000 | PeopleTools
Solve problems - It's Free
Create your account in seconds
Email address
Username
Between 5 and 30 characters. No spaces please
Password
Notify me of new activity in this group:
Keep me informed of the latest:
By clicking "Join Now", you agree to Toolbox for Technology terms of use, and have read and understand our privacy policy.
How to Improve AE With CI Performance
Hi All,
I am new to Component interface bulk data loading into my records which we can integrated to send message to other environment.
Here we have already developed one CI which was taking data from RNA_ASSIGN_CI,RNA_ORDER_CI and RNA_EMP_AUTO_TERM and do some validations like if assignments open then close the assignment and order and close the employee for within given time period and so on some validations.
My CI Structure like:
1) Import data from CI which are already developed as i mentioned above.
2) Do some basic validation like assignments and orders, if a talent have more than one assignment then need to check the order and assignments and terminate the talent.
3) Import all data stage table temporary rowset to CI.
4) Do perform CI logic(If not get &CI, not save &CI if-else etc.)
5) And through the entire logic a temporary rowset also can be created for getting desired target record which we can use for report (RNA_PRCS_AUTO_TERM)
In this we don't any temporary tables that can boost up the performance.
Please suggest to me in how the ways to increase the performance. Pasted code here for reference.
Local ApiObject &oSession, &oRnaEmployeeCi, &oRnaOrderReq, &oRnaAssgnCi;
Local ApiObject &oEmpJobDataCollection;
Local date &EFFDT;
Local string &EMPLID, &ACTION, &ACTION_REASON, &ASSIGN_ERROR, &ASSIGN_NO_ORDER_ERROR, &ORDER_ERROR;
Local number &EMPL_RCD, &NO_OF_ROWS;
Local Record &PRCS_AUTO_TERM, &RPT_AUTO_TERM, &UPD_PRCS_AUTO, &ASSIGNMENT_EMP_REC, &ASSIGNMENT_REC, &ORDER_REC;
Local SQL &PRCS_AUTO_TERM_SQL, &RPT_AUTO_TERM_SQL, &ORDER_SQL, &ASSIGNMENT_EMP_SQL, &ASSIGNMENT_SQL;
Local Rowset &ORDER_ROWSET, &ASSIGNMENT_EMP_ROWSET, &ASSIGNMENT_ROWSET;
Function errorHandler()
Local ApiObject &oPSMessageCollection, &oPSMessage;
Local number &i;
Local string &sErrMsgSetNum, &sErrMsgNum, &sErrMsgText, &sErrType;
&oPSMessageCollection = &oSession.PSMessages;
&error = ""; /*javed M*/
For &i = 1 To &oPSMessageCollection.Count
&oPSMessage = &oPSMessageCollection.Item(&i);
&sErrMsgSetNum = &oPSMessage.MessageSetNumber;
&sErrMsgNum = &oPSMessage.MessageNumber;
&sErrMsgText = &oPSMessage.Text;
MessageBox(0, "", 0, 0, &sErrType | " (" | &sErrMsgSetNum | "," | &sErrMsgNum | ") - " | &sErrMsgText);
&error = &error | Char(9) | &sErrMsgText; /*javed M*/
End-For;
rem ***** Delete the Messages from the collection *****;
&oPSMessageCollection.DeleteAll();
End-Function;
&Separator = Char(9); /* TAB Delimitter*/
&DELIMITER = Char(39); /* " ' " Delimiter'*/
&DOUBLE_QUOTES = Char(34); /* Double Quotes Delimiter'*/
&UPD_PRCS_AUTO = CreateRecord(Record.RNA_PRCS_ATERM);
&PRCS_AUTO_TERM = CreateRecord(Record.RNA_PRCS_ATERM);
&RPT_AUTO_TERM = CreateRecord(Record.RNA_PRCS_ATERM);
&ASSIGNMENT_EMP_REC = CreateRecord(Record.ASSIGNMENT);
&ASSIGNMENT_REC = CreateRecord(Record.ASSIGNMENT);
&ORDER_REC = CreateRecord(Record.ORDER);
&ASSIGNMENT_EMP_ROWSET = CreateRowset(Record.ASSIGNMENT);
&ASSIGNMENT_ROWSET = CreateRowset(Record.ASSIGNMENT);
&ORDER_ROWSET = CreateRowset(Record.ORDER);
&PROCESS_INSTANCE = RNA_EMPATRM_AET.PROCESS_INSTANCE;
&PRCS_AUTO_TERM_SQL = CreateSQL("%Selectall(:1) WHERE RNA_STATUS = :2 AND PROCESS_INSTANCE = :3", &PRCS_AUTO_TERM, "N", &PROCESS_INSTANCE); /*javed m*/
While &PRCS_AUTO_TERM_SQL.Fetch(&PRCS_AUTO_TERM)
&ASSIGN_ERROR = "N";
&ORDER_ERROR = "N";
&ASSIGN_NO_ORDER_ERROR = "N";
&EMPLID = &PRCS_AUTO_TERM.EMPLID.Value;
&EFFDT = &PRCS_AUTO_TERM.EFFDT.Value;
&EMPL_RCD = &PRCS_AUTO_TERM.EMPL_RCD.Value;
&ACTION = &PRCS_AUTO_TERM.ACTION.Value;
&ACTION_REASON = &PRCS_AUTO_TERM.ACTION_REASON.Value;
&STATUS = &PRCS_AUTO_TERM.STATUS.Value;
&MSGNUM = &PRCS_AUTO_TERM.IBTRANSACTIONID.Value;
MessageBox(0, "", 0, 0, "Processing Employee : " | &EMPLID);
&ASSIGNMENT_SQL = CreateSQL("%Selectall(:1) where EMPLID = :2 AND ASSIGN_STATUS = :3", &ASSIGNMENT_REC, &EMPLID, "A");
While &ASSIGNMENT_SQL.Fetch(&ASSIGNMENT_REC)
&BU = &ASSIGNMENT_REC.BUSINESS_UNIT.Value;
&ORDER_ID = &ASSIGNMENT_REC.ORDER_ID.Value;
&ASSIGNMENT_ID = &ASSIGNMENT_REC.ASSIGNMENT_ID.Value;
SQLExec("SELECT COUNT(ASSIGNMENT_ID) FROM %TABLE(:1) where ORDER_ID = :2 AND ASSIGN_STATUS = :3", &ASSIGNMENT_EMP_REC, &ORDER_ID, "A", &NO_OF_ROWS);
MessageBox(0, "", 0, 0, "Active Assignment Count for : " | &EMPLID | " is : " | &NO_OF_ROWS);
If &NO_OF_ROWS > 0 Then
If &NO_OF_ROWS = 1 Then
MessageBox(0, "", 0, 0, "Only one Active Assignment Exists for :" | "BU:" | &BU | "Orderid:" | &ORDER_ID | " Assignment:" | &ASSIGNMENT_ID);
MessageBox(0, "", 0, 0, "Closing Assignment :" | "BU:" | &BU | "Orderid:" | &ORDER_ID | " Assignment:" | &ASSIGNMENT_ID | "Emplid: " | &EMPLID);
rem ***** Get current PeopleSoft Session *****;
&oSession = %Session;
rem ***** Set the PeopleSoft Session Error Message Mode *****;
rem ***** 0 - None *****;
rem ***** 1 - PSMessage Collection only (default) *****;
rem ***** 2 - Message Box only *****;
rem ***** 3 - Both collection and message box *****;
&oSession.PSMessagesMode = 1;
rem ***** Get the Component Interface *****;
&oRnaAssgnCi = &oSession.GetCompIntfc(CompIntfc.RNA_ASSGN_CI);
If &oRnaAssgnCi = Null Then
&ASSIGN_ERROR = "Y";
errorHandler();
End-If;
rem ***** Set the Component Interface Mode *****;
&oRnaAssgnCi.InteractiveMode = False;
&oRnaAssgnCi.GetHistoryItems = True;
&oRnaAssgnCi.EditHistoryItems = True;
rem ***** Set Component Interface Get/Create Keys *****;
&oRnaAssgnCi.BUSINESS_UNIT = &BU;
&oRnaAssgnCi.ORDER_ID = &ORDER_ID;
&oRnaAssgnCi.ASSIGNMENT_ID = &ASSIGNMENT_ID;
&oRnaAssgnCi.EMPLID = &EMPLID;
rem ***** Execute Get *****;
If Not &oRnaAssgnCi.Get() Then
rem ***** No rows exist for the specified keys.*****;
rem errorHandler();
&UPD_PRCS_AUTO.IBTRANSACTIONID.Value = &MSGNUM;
&UPD_PRCS_AUTO.EMPLID.Value = &EMPLID;
&UPD_PRCS_AUTO.EMPL_RCD.Value = &EMPL_RCD;
&UPD_PRCS_AUTO.EFFDT.Value = &EFFDT;
&Prcs_Success = &UPD_PRCS_AUTO.SelectByKey();
If &Prcs_Success Then
&UPD_PRCS_AUTO.RNA_STATUS.Value = "E";
&UPD_PRCS_AUTO.DESCR254.Value = " Assignment " | &ASSIGNMENT_ID | " Not Found";
&UPD_PRCS_AUTO.Update();
End-If;
&ASSIGN_ERROR = "Y";
Else
rem ***** Begin: Get/Set Component Interface Properties *****;
&oRnaAssgnCi.ASSIGN_STATUS = "C";
&oRnaAssgnCi.END_ACTUAL_DATE = &EFFDT;
&oRnaAssgnCi.END_ACTUAL_REASON = "SC";
rem ***** Execute Save *****;
If Not &oRnaAssgnCi.Save() Then;
&UPD_PRCS_AUTO.IBTRANSACTIONID.Value = &MSGNUM;
&UPD_PRCS_AUTO.EMPLID.Value = &EMPLID;
&UPD_PRCS_AUTO.EMPL_RCD.Value = &EMPL_RCD;
&UPD_PRCS_AUTO.EFFDT.Value = &EFFDT;
&Prcs_Success = &UPD_PRCS_AUTO.SelectByKey();
&ASSIGN_ERROR = "Y";
errorHandler();
If &Prcs_Success Then
&UPD_PRCS_AUTO.RNA_STATUS.Value = "E";
If All(&error) Then
&UPD_PRCS_AUTO.DESCR254.Value = "Order Id : " | &ORDER_ID | &Separator | "Assignment Id : " | &ASSIGNMENT_ID | &Separator | &error; /*javed M*/
Else
&UPD_PRCS_AUTO.DESCR254.Value = " Assignment CI Error";
End-If;
&UPD_PRCS_AUTO.Update();
End-If;
End-If;
&SECONDS = 2;
&delay_time = AddToDateTime(%Datetime, 0, 0, 0, 0, 0, &SECONDS);
While True
If %Datetime > &delay_time Then
Break;
End-If;
End-While;
rem ***** Execute Cancel *****;
&oRnaAssgnCi.Cancel();
End-If;
If &ASSIGN_ERROR = "N" Then
&ORDER_STATUS = "C";
&ORDER_SQL = CreateSQL("%Selectall(:1) where BUSINESS_UNIT = :2 AND ORDER_ID = :3 AND ORDER_STATUS = :4", &ORDER_REC, &BU, &ORDER_ID, "A");
While &ORDER_SQL.Fetch(&ORDER_REC)
&ORDER_STATUS = &ORDER_REC.ORDER_STATUS.Value;
End-While;
If &ORDER_STATUS <> "C" Then
MessageBox(0, "", 0, 0, "Closing Order : " | "BU: " | &BU | "Orderid: " | &ORDER_ID);
rem ***** Get current PeopleSoft Session *****;
&oSession = %Session;
rem ***** Set the PeopleSoft Session Error Message Mode *****;
rem ***** 0 - None *****;
rem ***** 1 - PSMessage Collection only (default) *****;
rem ***** 2 - Message Box only *****;
rem ***** 3 - Both collection and message box *****;
&oSession.PSMessagesMode = 1;
rem ***** Get the Component Interface *****;
&oRnaOrderReq = &oSession.GetCompIntfc(CompIntfc.RNA_ORDER_CI);
If &oRnaOrderReq = Null Then
&ORDER_ERROR = "Y";
errorHandler();
End-If;
rem ***** Set the Component Interface Mode *****;
&oRnaOrderReq.InteractiveMode = False;
&oRnaOrderReq.GetHistoryItems = True;
&oRnaOrderReq.EditHistoryItems = True;
rem ***** Set Component Interface Get/Create Keys *****;
&oRnaOrderReq.BUSINESS_UNIT = &BU;
&oRnaOrderReq.ORDER_ID = &ORDER_ID;
rem ***** Execute Get *****;
If Not &oRnaOrderReq.Get() Then
rem ***** No rows exist for the specified keys.*****;
rem errorHandler();
&UPD_PRCS_AUTO.IBTRANSACTIONID.Value = &MSGNUM;
&UPD_PRCS_AUTO.EMPLID.Value = &EMPLID;
&UPD_PRCS_AUTO.EMPL_RCD.Value = &EMPL_RCD;
&UPD_PRCS_AUTO.EFFDT.Value = &EFFDT;
&Prcs_Success = &UPD_PRCS_AUTO.SelectByKey();
If &Prcs_Success Then
&UPD_PRCS_AUTO.RNA_STATUS.Value = "E";
&UPD_PRCS_AUTO.DESCR254.Value = " Order " | &ORDER_ID | " Not Found";
&UPD_PRCS_AUTO.Update();
End-If;
&ORDER_ERROR = "Y";
Else
rem ***** Begin: Get/Set Component Interface Properties *****;
&oRnaOrderReq.ORDER_STATUS = "C";
&oRnaOrderReq.END_ACTUAL_DATE = &EFFDT;
&oRnaOrderReq.END_ACTUAL_REASON = "SC";
rem ***** Execute Save *****;
If Not &oRnaOrderReq.Save() Then;
&UPD_PRCS_AUTO.IBTRANSACTIONID.Value = &MSGNUM;
&UPD_PRCS_AUTO.EMPLID.Value = &EMPLID;
&UPD_PRCS_AUTO.EMPL_RCD.Value = &EMPL_RCD;
&UPD_PRCS_AUTO.EFFDT.Value = &EFFDT;
&Prcs_Success = &UPD_PRCS_AUTO.SelectByKey();
&ORDER_ERROR = "Y";
errorHandler();
If &Prcs_Success Then
&UPD_PRCS_AUTO.RNA_STATUS.Value = "E";
If All(&error) Then
&UPD_PRCS_AUTO.DESCR254.Value = "Order Id : " | &ORDER_ID | &Separator | &error; /*javed M*/
Else
&UPD_PRCS_AUTO.DESCR254.Value = " Order CI Error";
End-If;
&UPD_PRCS_AUTO.Update();
End-If;
End-If;
&SECONDS = 2;
&delay_time = AddToDateTime(%Datetime, 0, 0, 0, 0, 0, &SECONDS);
While True
If %Datetime > &delay_time Then
Break;
End-If;
End-While;
End-If;
rem ***** Execute Cancel *****;
&oRnaOrderReq.Cancel()
End-If;
End-If;
Else
MessageBox(0, "", 0, 0, "More than one active Assignment Exists:" | "BU:" | &BU | "Orderid:" | &ORDER_ID | " Assignment:" | &ASSIGNMENT_ID | "Emplid: " | &EMPLID);
rem ***** Get current PeopleSoft Session *****;
&oSession = %Session;
rem ***** Set the PeopleSoft Session Error Message Mode *****;
rem ***** 0 - None *****;
rem ***** 1 - PSMessage Collection only (default) *****;
rem ***** 2 - Message Box only *****;
rem ***** 3 - Both collection and message box *****;
&oSession.PSMessagesMode = 1;
rem ***** Get the Component Interface *****;
&oRnaAssgnCi = &oSession.GetCompIntfc(CompIntfc.RNA_ASSGN_CI);
If &oRnaAssgnCi = Null Then
&ASSIGN_NO_ORDER_ERROR = "Y";
errorHandler();
End-If;
rem ***** Set the Component Interface Mode *****;
&oRnaAssgnCi.InteractiveMode = False;
&oRnaAssgnCi.GetHistoryItems = True;
&oRnaAssgnCi.EditHistoryItems = True;
rem ***** Set Component Interface Get/Create Keys *****;
&oRnaAssgnCi.BUSINESS_UNIT = &BU;
&oRnaAssgnCi.ORDER_ID = &ORDER_ID;
&oRnaAssgnCi.ASSIGNMENT_ID = &ASSIGNMENT_ID;
&oRnaAssgnCi.EMPLID = &EMPLID;
rem ***** Execute Get *****;
If Not &oRnaAssgnCi.Get() Then
rem ***** No rows exist for the specified keys.*****;
rem errorHandler();
&UPD_PRCS_AUTO.IBTRANSACTIONID.Value = &MSGNUM;
&UPD_PRCS_AUTO.EMPLID.Value = &EMPLID;
&UPD_PRCS_AUTO.EMPL_RCD.Value = &EMPL_RCD;
&UPD_PRCS_AUTO.EFFDT.Value = &EFFDT;
&Prcs_Success = &UPD_PRCS_AUTO.SelectByKey();
If &Prcs_Success Then
&UPD_PRCS_AUTO.RNA_STATUS.Value = "E";
&UPD_PRCS_AUTO.DESCR254.Value = " Assignment " | &ASSIGNMENT_ID | " Not Found";
&UPD_PRCS_AUTO.Update();
End-If;
&ASSIGN_NO_ORDER_ERROR = "Y";
Else
rem ***** Begin: Get/Set Component Interface Properties *****;
&oRnaAssgnCi.ASSIGN_STATUS = "C";
&oRnaAssgnCi.END_ACTUAL_DATE = &EFFDT;
&oRnaAssgnCi.END_ACTUAL_REASON = "SC";
rem ***** Execute Save *****;
If Not &oRnaAssgnCi.Save() Then;
&UPD_PRCS_AUTO.IBTRANSACTIONID.Value = &MSGNUM;
&UPD_PRCS_AUTO.EMPLID.Value = &EMPLID;
&UPD_PRCS_AUTO.EMPL_RCD.Value = &EMPL_RCD;
&UPD_PRCS_AUTO.EFFDT.Value = &EFFDT;
&Prcs_Success = &UPD_PRCS_AUTO.SelectByKey();
&ASSIGN_NO_ORDER_ERROR = "Y";
errorHandler();
If &Prcs_Success Then
&UPD_PRCS_AUTO.RNA_STATUS.Value = "E";
If All(&error) Then
&UPD_PRCS_AUTO.DESCR254.Value = "Order Id : " | &ORDER_ID | &Separator | "Assignment Id : " | &ASSIGNMENT_ID | &Separator | &error; /*Javed M*/
Else
&UPD_PRCS_AUTO.DESCR254.Value = " Assignment CI Error";
End-If;
&UPD_PRCS_AUTO.Update();
End-If;
End-If;
&SECONDS = 2;
&delay_time = AddToDateTime(%Datetime, 0, 0, 0, 0, 0, &SECONDS);
While True
If %Datetime > &delay_time Then
Break;
End-If;
End-While;
End-If;
rem ***** Execute Cancel *****;
&oRnaAssgnCi.Cancel();
End-If;
End-If;
End-While;
MessageBox(0, "", 0, 0, "ASSIGN_ERROR : " | &ASSIGN_ERROR | " ORDER_ERROR : " | &ORDER_ERROR | " &ASSIGN_NO_ORDER_ERROR : " | &ASSIGN_NO_ORDER_ERROR);
If &ASSIGN_ERROR = "N" And
&ORDER_ERROR = "N" And
&ASSIGN_NO_ORDER_ERROR = "N" Then
rem ***** Get current PeopleSoft Session *****;
&oSession = %Session;
rem ***** Set the PeopleSoft Session Error Message Mode *****;
rem ***** 0 - None *****;
rem ***** 1 - PSMessage Collection only (default) *****;
rem ***** 2 - Message Box only *****;
rem ***** 3 - Both collection and message box *****;
&oSession.PSMessagesMode = 1;
rem ***** Get the Component Interface *****;
&oRnaEmployeeCi = &oSession.GetCompIntfc(CompIntfc.RNA_EMP_AUTO_T ERM);
If &oRnaEmployeeCi = Null Then
errorHandler();
End-If;
rem ***** Set the Component Interface Mode *****;
&oRnaEmployeeCi.InteractiveMode = False;
&oRnaEmployeeCi.GetHistoryItems = True;
&oRnaEmployeeCi.EditHistoryItems = True;
rem ***** Set Component Interface Get/Create Keys *****;
&oRnaEmployeeCi.EMPLID = &EMPLID;
rem ***** Execute Get *****;
If Not &oRnaEmployeeCi.Get() Then
rem ***** No rows exist for the specified keys.*****;
REM errorHandler();
MessageBox(0, "", 0, 0, "ERROR:" | "Emplid:" | &EMPLID | "Not Found");
&UPD_PRCS_AUTO.IBTRANSACTIONID.Value = &MSGNUM;
&UPD_PRCS_AUTO.EMPLID.Value = &EMPLID;
&UPD_PRCS_AUTO.EMPL_RCD.Value = &EMPL_RCD;
&UPD_PRCS_AUTO.EFFDT.Value = &EFFDT;
&Prcs_Success = &UPD_PRCS_AUTO.SelectByKey();
If &Prcs_Success Then
&UPD_PRCS_AUTO.RNA_STATUS.Value = "E";
&UPD_PRCS_AUTO.DESCR254.Value = "Emplid Not Found";
&UPD_PRCS_AUTO.Update();
End-If;
Else
rem ***** Begin: Get/Set Component Interface Properties *****;
If &oRnaEmployeeCi.PER_STATUS <> "E" Then
MessageBox(0, "", 0, 0, "ERROR:Applicants not Allowed, " | "Emplid:" | &EMPLID);
&UPD_PRCS_AUTO.IBTRANSACTIONID.Value = &MSGNUM;
&UPD_PRCS_AUTO.EMPLID.Value = &EMPLID;
&UPD_PRCS_AUTO.EMPL_RCD.Value = &EMPL_RCD;
&UPD_PRCS_AUTO.EFFDT.Value = &EFFDT;
&Prcs_Success = &UPD_PRCS_AUTO.SelectByKey();
If &Prcs_Success Then
&UPD_PRCS_AUTO.RNA_STATUS.Value = "E";
&UPD_PRCS_AUTO.DESCR254.Value = "Applicants can not be Terminated";
&UPD_PRCS_AUTO.Update();
End-If;
Else
rem ***** Set/Get EMP_JOB_DATA Collection Field Properties -- Parent: PS_ROOT Collection *****;
Local ApiObject &EmpJobDataCollection, &EmpJobDataItem, &LastEmpJobDataItem;
&EmpJobDataCollection = &oRnaEmployeeCi.EMP_JOB_DATA;
&EFFDT_Str = String(&EFFDT);
&LastEmpJobDataItem = &EmpJobDataCollection.GetEffectiveItem(&EFF DT_Str, 1);
If &LastEmpJobDataItem.EMPL_STATUS = "T" Then
MessageBox(0, "", 0, 0, "Already Terminated " | "Emplid:" | &EMPLID);
&UPD_PRCS_AUTO.IBTRANSACTIONID.Value = &MSGNUM;
&UPD_PRCS_AUTO.EMPLID.Value = &EMPLID;
&UPD_PRCS_AUTO.EMPL_RCD.Value = &EMPL_RCD;
&UPD_PRCS_AUTO.EFFDT.Value = &EFFDT;
&Prcs_Success = &UPD_PRCS_AUTO.SelectByKey();
If &Prcs_Success Then
&UPD_PRCS_AUTO.RNA_STATUS.Value = "C";
&UPD_PRCS_AUTO.DESCR254.Value = "Already Terminated";
&UPD_PRCS_AUTO.Update();
End-If;
Else
If &LastEmpJobDataItem.EFFDT = &EFFDT And
&LastEmpJobDataItem.ACTION = &ACTION And
&LastEmpJobDataItem.ACTION_REASON = &ACTION_REASON Then
REM No Row Insert, Already Inserted in Previous run ;
MessageBox(0, "", 0, 0, "Row Already Exists: " | "Msgnum: " | &MSGNUM | "Emplid: " | &EMPLID | " Effdt: " | &EFFDT | " Action: " | &ACTION | " ActionReason: " | &ACTION_REASON);
&UPD_PRCS_AUTO.IBTRANSACTIONID.Value = &MSGNUM;
&UPD_PRCS_AUTO.EMPLID.Value = &EMPLID;
&UPD_PRCS_AUTO.EMPL_RCD.Value = &EMPL_RCD;
&UPD_PRCS_AUTO.EFFDT.Value = &EFFDT;
&Prcs_Success = &UPD_PRCS_AUTO.SelectByKey();
If &Prcs_Success Then
&UPD_PRCS_AUTO.RNA_STATUS.Value = "C";
&UPD_PRCS_AUTO.DESCR254.Value = "Already Terminated";
&UPD_PRCS_AUTO.Update();
End-If;
Else
&InsertRow = &EmpJobDataCollection.GetEffectiveItemNum(& EFFDT_Str, 1);
&EmpJobDataItem = &EmpJobDataCollection.InsertItem(&InsertRow );
&EmpJobDataItem.EFFDT = &EFFDT;
&EmpJobDataItem.ACTION = &ACTION;
&EmpJobDataItem.ACTION_REASON = &ACTION_REASON;
&EmpJobDataItem.EMPL_STATUS = "T";
rem ***** End: Get/Set Component Interface Properties *****;
rem MessageBox(0, "", 0, 0, "Msgnum: " | &MSGNUM | "Emplid: " | &EMPLID | " Effdt: " | &EFFDT | " Action: " | &ACTION | " ActionReason: " | &ACTION_REASON );
rem ***** Execute Save *****;
If Not &oRnaEmployeeCi.Save() Then
REM MessageBox(0, "", 0, 0, "CI Save Msgnum: " | &MSGNUM | "Emplid: " | &EMPLID | " Effdt: " | &EFFDT | "EMPL_RCD: " | &EMPL_RCD);
&UPD_PRCS_AUTO.IBTRANSACTIONID.Value = &MSGNUM;
&UPD_PRCS_AUTO.EMPLID.Value = &EMPLID;
&UPD_PRCS_AUTO.EMPL_RCD.Value = &EMPL_RCD;
&UPD_PRCS_AUTO.EFFDT.Value = &EFFDT;
&Prcs_Success = &UPD_PRCS_AUTO.SelectByKey();
errorHandler();
If &Prcs_Success Then
&UPD_PRCS_AUTO.RNA_STATUS.Value = "E";
If All(&error) Then
&UPD_PRCS_AUTO.DESCR254.Value = &error; /*Javed M*/
Else
&UPD_PRCS_AUTO.DESCR254.Value = "Employee CI Error";
End-If;
&UPD_PRCS_AUTO.Update();
End-If;
Else
REM Add Delay After Each Save to Make Sure it is fully processed ;
&UPD_PRCS_AUTO.IBTRANSACTIONID.Value = &MSGNUM;
&UPD_PRCS_AUTO.EMPLID.Value = &EMPLID;
&UPD_PRCS_AUTO.EMPL_RCD.Value = &EMPL_RCD;
&UPD_PRCS_AUTO.EFFDT.Value = &EFFDT;
&Prcs_Success = &UPD_PRCS_AUTO.SelectByKey();
If &Prcs_Success Then
&UPD_PRCS_AUTO.RNA_STATUS.Value = "C";
&UPD_PRCS_AUTO.DESCR254.Value = "Termination Complete";
&UPD_PRCS_AUTO.Update();
End-If;
&SECONDS = 2;
&delay_time = AddToDateTime(%Datetime, 0, 0, 0, 0, 0, &SECONDS);
While True
If %Datetime > &delay_time Then
Break;
End-If;
End-While;
End-If;
End-If;
End-If;
End-If;
rem ***** Execute Cancel *****;
&oRnaEmployeeCi.Cancel();
End-If;
End-If;
End-While;
Thanks
This thread has been closed due to inactivity.
Start a new thread here
AdChoices
TRUSTe Privacy Certification | {
"url": "http://peoplesoft.ittoolbox.com/groups/technical-functional/peopletools-l/how-to-improve-ae-with-ci-performance-5809672",
"source_domain": "peoplesoft.ittoolbox.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "146754",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D5UUKD5UWZPMNP5HBH5PO2XQP36UGNLT",
"WARC-Concurrent-To": "<urn:uuid:3b34e87f-fae2-4f05-b148-3b251397d667>",
"WARC-Date": "2017-10-24T11:25:14Z",
"WARC-IP-Address": "65.158.47.43",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:7JSMQ3E3QSSS4XLCFV3E4UVPIHVANZFA",
"WARC-Record-ID": "<urn:uuid:7c081d90-3bb2-4548-b0e3-9eeabbcd4a61>",
"WARC-Target-URI": "http://peoplesoft.ittoolbox.com/groups/technical-functional/peopletools-l/how-to-improve-ae-with-ci-performance-5809672",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ca86fceb-6b59-44a0-8713-782993afdd8e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-136-183-252.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,
12,
13,
40,
41,
72,
86,
95,
96,
142,
151,
192,
224,
347,
348,
386,
387,
395,
523,
524,
803,
804,
826,
899,
1069,
1124,
1190,
1344,
1345,
1418,
1419,
1517,
1518,
1519,
1592,
1632,
1651,
1751,
1788,
1900,
2001,
2073,
2074,
2098,
2150,
2167,
2234,
2280,
2305,
2347,
2393,
2440,
2481,
2514,
2515,
2619,
2673,
2682,
2683,
2740,
2775,
2789,
2790,
2832,
2877,
2934,
2988,
3043,
3097,
3152,
3203,
3244,
3245,
3303,
3357,
3401,
3402,
3456,
3457,
3609,
3610,
3611,
3660,
3661,
3682,
3702,
3732,
3772,
3810,
3854,
3894,
3948,
3988,
4037,
4038,
4099,
4100,
4219,
4220,
4265,
4266,
4309,
4353,
4407,
4408,
4409,
4558,
4559,
4560,
4654,
4655,
4656,
4680,
4681,
4705,
4706,
4847,
4848,
4993,
4994,
5042,
5064,
5065,
5128,
5154,
5211,
5249,
5302,
5332,
5333,
5378,
5441,
5469,
5470,
5491,
5507,
5515,
5516,
5566,
5604,
5641,
5679,
5680,
5737,
5771,
5806,
5851,
5882,
5883,
5912,
5943,
5997,
6017,
6065,
6104,
6147,
6184,
6185,
6231,
6253,
6292,
6372,
6397,
6405,
6426,
6431,
6432,
6495,
6529,
6568,
6607,
6608,
6609,
6639,
6672,
6673,
6721,
6760,
6803,
6840,
6841,
6887,
6908,
6924,
6946,
6985,
7005,
7149,
7154,
7210,
7218,
7243,
7251,
7252,
7260,
7261,
7275,
7340,
7351,
7383,
7390,
7398,
7409,
7410,
7442,
7465,
7473,
7474,
7502,
7523,
7524,
7664,
7665,
7700,
7701,
7748,
7759,
7760,
7789,
7790,
7876,
7877,
7925,
7947,
7948,
8011,
8037,
8094,
8132,
8185,
8215,
8216,
8261,
8325,
8326,
8355,
8356,
8376,
8392,
8400,
8401,
8451,
8490,
8528,
8567,
8568,
8625,
8660,
8696,
8697,
8726,
8758,
8759,
8813,
8833,
8881,
8920,
8963,
9000,
9001,
9047,
9069,
9108,
9178,
9203,
9211,
9231,
9236,
9237,
9300,
9334,
9374,
9414,
9415,
9445,
9479,
9480,
9528,
9567,
9610,
9647,
9648,
9694,
9714,
9730,
9752,
9791,
9811,
9904,
9909,
9960,
9968,
9993,
10001,
10009,
10010,
10024,
10089,
10100,
10132,
10139,
10147,
10158,
10166,
10198,
10221,
10229,
10237,
10238,
10239,
10240,
10245,
10409,
10410,
10458,
10480,
10481,
10544,
10570,
10627,
10665,
10718,
10748,
10749,
10794,
10857,
10885,
10915,
10931,
10939,
10940,
10990,
11028,
11065,
11103,
11104,
11161,
11195,
11230,
11275,
11306,
11307,
11336,
11367,
11421,
11441,
11489,
11528,
11571,
11608,
11609,
11655,
11677,
11716,
11796,
11821,
11829,
11859,
11864,
11865,
11928,
11962,
12001,
12040,
12041,
12042,
12072,
12105,
12106,
12154,
12193,
12236,
12273,
12274,
12320,
12350,
12366,
12388,
12427,
12447,
12591,
12596,
12652,
12660,
12685,
12693,
12694,
12695,
12703,
12704,
12718,
12783,
12794,
12826,
12833,
12841,
12852,
12860,
12861,
12893,
12916,
12924,
12932,
12933,
12944,
12945,
13096,
13097,
13124,
13147,
13181,
13229,
13251,
13252,
13315,
13341,
13398,
13436,
13489,
13519,
13520,
13565,
13637,
13668,
13684,
13692,
13742,
13783,
13823,
13864,
13865,
13922,
13956,
13957,
13986,
14020,
14074,
14094,
14165,
14213,
14252,
14295,
14332,
14333,
14379,
14401,
14440,
14492,
14517,
14525,
14526,
14531,
14594,
14636,
14717,
14765,
14804,
14847,
14884,
14885,
14931,
14953,
14992,
15060,
15085,
15093,
15098,
15194,
15271,
15325,
15354,
15432,
15433,
15479,
15549,
15597,
15636,
15679,
15716,
15717,
15763,
15785,
15824,
15878,
15903,
15911,
15916,
15917,
15918,
15919,
15961,
16002,
16058,
16059,
16113,
16291,
16339,
16378,
16421,
16458,
16459,
16505,
16527,
16566,
16620,
16645,
16653,
16658,
16730,
16795,
16827,
16861,
16909,
16944,
16945,
17006,
17164,
17194,
17229,
17360,
17408,
17447,
17490,
17527,
17528,
17574,
17590,
17612,
17651,
17671,
17723,
17728,
17781,
17789,
17814,
17822,
17827,
17894,
17942,
17981,
18024,
18061,
18062,
18108,
18130,
18169,
18225,
18250,
18258,
18272,
18337,
18348,
18380,
18387,
18395,
18406,
18414,
18422,
18430,
18438,
18439,
18471,
18497,
18505,
18513,
18514,
18525,
18526,
18533,
18580,
18604,
18605,
18615,
18616
],
"line_end_idx": [
12,
13,
40,
41,
72,
86,
95,
96,
142,
151,
192,
224,
347,
348,
386,
387,
395,
523,
524,
803,
804,
826,
899,
1069,
1124,
1190,
1344,
1345,
1418,
1419,
1517,
1518,
1519,
1592,
1632,
1651,
1751,
1788,
1900,
2001,
2073,
2074,
2098,
2150,
2167,
2234,
2280,
2305,
2347,
2393,
2440,
2481,
2514,
2515,
2619,
2673,
2682,
2683,
2740,
2775,
2789,
2790,
2832,
2877,
2934,
2988,
3043,
3097,
3152,
3203,
3244,
3245,
3303,
3357,
3401,
3402,
3456,
3457,
3609,
3610,
3611,
3660,
3661,
3682,
3702,
3732,
3772,
3810,
3854,
3894,
3948,
3988,
4037,
4038,
4099,
4100,
4219,
4220,
4265,
4266,
4309,
4353,
4407,
4408,
4409,
4558,
4559,
4560,
4654,
4655,
4656,
4680,
4681,
4705,
4706,
4847,
4848,
4993,
4994,
5042,
5064,
5065,
5128,
5154,
5211,
5249,
5302,
5332,
5333,
5378,
5441,
5469,
5470,
5491,
5507,
5515,
5516,
5566,
5604,
5641,
5679,
5680,
5737,
5771,
5806,
5851,
5882,
5883,
5912,
5943,
5997,
6017,
6065,
6104,
6147,
6184,
6185,
6231,
6253,
6292,
6372,
6397,
6405,
6426,
6431,
6432,
6495,
6529,
6568,
6607,
6608,
6609,
6639,
6672,
6673,
6721,
6760,
6803,
6840,
6841,
6887,
6908,
6924,
6946,
6985,
7005,
7149,
7154,
7210,
7218,
7243,
7251,
7252,
7260,
7261,
7275,
7340,
7351,
7383,
7390,
7398,
7409,
7410,
7442,
7465,
7473,
7474,
7502,
7523,
7524,
7664,
7665,
7700,
7701,
7748,
7759,
7760,
7789,
7790,
7876,
7877,
7925,
7947,
7948,
8011,
8037,
8094,
8132,
8185,
8215,
8216,
8261,
8325,
8326,
8355,
8356,
8376,
8392,
8400,
8401,
8451,
8490,
8528,
8567,
8568,
8625,
8660,
8696,
8697,
8726,
8758,
8759,
8813,
8833,
8881,
8920,
8963,
9000,
9001,
9047,
9069,
9108,
9178,
9203,
9211,
9231,
9236,
9237,
9300,
9334,
9374,
9414,
9415,
9445,
9479,
9480,
9528,
9567,
9610,
9647,
9648,
9694,
9714,
9730,
9752,
9791,
9811,
9904,
9909,
9960,
9968,
9993,
10001,
10009,
10010,
10024,
10089,
10100,
10132,
10139,
10147,
10158,
10166,
10198,
10221,
10229,
10237,
10238,
10239,
10240,
10245,
10409,
10410,
10458,
10480,
10481,
10544,
10570,
10627,
10665,
10718,
10748,
10749,
10794,
10857,
10885,
10915,
10931,
10939,
10940,
10990,
11028,
11065,
11103,
11104,
11161,
11195,
11230,
11275,
11306,
11307,
11336,
11367,
11421,
11441,
11489,
11528,
11571,
11608,
11609,
11655,
11677,
11716,
11796,
11821,
11829,
11859,
11864,
11865,
11928,
11962,
12001,
12040,
12041,
12042,
12072,
12105,
12106,
12154,
12193,
12236,
12273,
12274,
12320,
12350,
12366,
12388,
12427,
12447,
12591,
12596,
12652,
12660,
12685,
12693,
12694,
12695,
12703,
12704,
12718,
12783,
12794,
12826,
12833,
12841,
12852,
12860,
12861,
12893,
12916,
12924,
12932,
12933,
12944,
12945,
13096,
13097,
13124,
13147,
13181,
13229,
13251,
13252,
13315,
13341,
13398,
13436,
13489,
13519,
13520,
13565,
13637,
13668,
13684,
13692,
13742,
13783,
13823,
13864,
13865,
13922,
13956,
13957,
13986,
14020,
14074,
14094,
14165,
14213,
14252,
14295,
14332,
14333,
14379,
14401,
14440,
14492,
14517,
14525,
14526,
14531,
14594,
14636,
14717,
14765,
14804,
14847,
14884,
14885,
14931,
14953,
14992,
15060,
15085,
15093,
15098,
15194,
15271,
15325,
15354,
15432,
15433,
15479,
15549,
15597,
15636,
15679,
15716,
15717,
15763,
15785,
15824,
15878,
15903,
15911,
15916,
15917,
15918,
15919,
15961,
16002,
16058,
16059,
16113,
16291,
16339,
16378,
16421,
16458,
16459,
16505,
16527,
16566,
16620,
16645,
16653,
16658,
16730,
16795,
16827,
16861,
16909,
16944,
16945,
17006,
17164,
17194,
17229,
17360,
17408,
17447,
17490,
17527,
17528,
17574,
17590,
17612,
17651,
17671,
17723,
17728,
17781,
17789,
17814,
17822,
17827,
17894,
17942,
17981,
18024,
18061,
18062,
18108,
18130,
18169,
18225,
18250,
18258,
18272,
18337,
18348,
18380,
18387,
18395,
18406,
18414,
18422,
18430,
18438,
18439,
18471,
18497,
18505,
18513,
18514,
18525,
18526,
18533,
18580,
18604,
18605,
18615,
18616,
18645
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 18645,
"ccnet_original_nlines": 573,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04527844861149788,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.1348668336868286,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5329297780990601,
"rps_doc_frac_unique_words": 0.2522907853126526,
"rps_doc_mean_word_length": 7.886377334594727,
"rps_doc_num_sentences": 304,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.2769269943237305,
"rps_doc_word_count": 1637,
"rps_doc_frac_chars_dupe_10grams": 0.4843532145023346,
"rps_doc_frac_chars_dupe_5grams": 0.5308288335800171,
"rps_doc_frac_chars_dupe_6grams": 0.5176607370376587,
"rps_doc_frac_chars_dupe_7grams": 0.5054221749305725,
"rps_doc_frac_chars_dupe_8grams": 0.4955073595046997,
"rps_doc_frac_chars_dupe_9grams": 0.4881487190723419,
"rps_doc_frac_chars_top_2gram": 0.004647559951990843,
"rps_doc_frac_chars_top_3gram": 0.014097600243985653,
"rps_doc_frac_chars_top_4gram": 0.06041828170418739,
"rps_doc_books_importance": -1889.9376220703125,
"rps_doc_books_importance_length_correction": -1889.9376220703125,
"rps_doc_openwebtext_importance": -960.3101806640625,
"rps_doc_openwebtext_importance_length_correction": -960.3101806640625,
"rps_doc_wikipedia_importance": -982.0775146484375,
"rps_doc_wikipedia_importance_length_correction": -982.0775146484375
},
"fasttext": {
"dclm": 0.9020799398422241,
"english": 0.40821659564971924,
"fineweb_edu_approx": 3.41586971282959,
"eai_general_math": 0.5417597889900208,
"eai_open_web_math": 0.15913182497024536,
"eai_web_code": 0.9481456279754639
}
} | {
"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.3",
"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": "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": "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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
4,533,083,632,118,699,500 | #1
1. No Profile Picture
Registered User
Devshed Newbie (0 - 499 posts)
Join Date
Jan 2013
Posts
5
Rep Power
0
Is a subquery the solution?
Hi all,
I am very new to mySQL and hope that somebody can help me.
In 1 of my tables (tblPersons) there are (amongst others) the following fields:
prsID, prsFirstName, prsPrefix, prsLastName, prsCountry, prsBirthDate and prsNatRef.
I need to find out which combinations of prsFirstName, prsPrefix, prsLastName, prsCountry occur more than once.
The (I think) 1st step is fairly easy:
Code:
SELECT prsFirstName, prsPrefix, prsLastName, prsCountry, COUNT(prsLastName)
FROM tblPersons
WHERE COUNT(prsLastName) > 1
GROUP BY prsFirstName, prsPrefix, prsLastName, prsCountry
This (part of the) query gives me all names that occur more than once.
The next step is to get the remaining fields connected to these records.
Is it possible to do this with 1 query?
Might using a subquery be the answer?And how should I do that?
Thanks in advance
Hein
2. #2
3. SQL Consultant
Devshed Supreme Being (6500+ posts)
Join Date
Feb 2003
Location
Toronto Canada
Posts
27,585
Rep Power
4287
yes, it's possible to do this with one query, and yes, using the query you posted (with corrections for syntax errors) as a subquery is the answer
Code:
SELECT tblPersons.*
FROM ( SELECT prsFirstName
, prsPrefix
, prsLastName
, prsCountry
FROM tblPersons
GROUP
BY prsFirstName
, prsPrefix
, prsLastName
, prsCountry
HAVING COUNT(*) > 1 ) AS dupes
INNER
JOIN tblPersons.prsFirstName = dupes.prsFirstName
ON tblPersons.prsPrefix = dupes.prsPrefix
AND tblPersons.prsLastName = dupes.prsLastName
AND tblPersons.prsCountry = dupes.prsCountry
rudy.ca | @rudydotca
Buy my SitePoint book: Simply SQL
4. #3
5. No Profile Picture
Registered User
Devshed Newbie (0 - 499 posts)
Join Date
Jan 2013
Posts
5
Rep Power
0
Brilliant! Thank you Rudy!
I am glad to see that my thought about using a subquery was correct (I have so far no experience using this kind of query but in my search for the answer I came across it and it seemed right).
If I copy and paste your code into my database it gives an error on line 14: JOIN tblPersons.prsFirstName = dupes.prsFirstName
apparently the "." from dupes.prsFirstName causes a problem. It gets red underlined. (mySQL only gives the location of the error, no extra information is given)
Is it possible to correct this?
If I may I would like to ask you another question. Just as a learning experience:
what is the theory or thought behind putting the subquery in the From statement. It looks as if you are creating a temporary table which gets joined to tblPersons in the last bit of your code?
Anyway: hopefully the dupes.prsFirstName can be corrected.
maybe as an extra bit of information: I am using mySQL Workbench
Thanks Hein
6. #4
7. SQL Consultant
Devshed Supreme Being (6500+ posts)
Join Date
Feb 2003
Location
Toronto Canada
Posts
27,585
Rep Power
4287
AAAACK!! sorry for the syntax error
less haste, more speed
Code:
SELECT tblPersons.*
FROM ( SELECT prsFirstName
, prsPrefix
, prsLastName
, prsCountry
FROM tblPersons
GROUP
BY prsFirstName
, prsPrefix
, prsLastName
, prsCountry
HAVING COUNT(*) > 1 ) AS dupes
INNER
JOIN tblPersons
ON tblPersons.prsFirstName = dupes.prsFirstName
AND tblPersons.prsPrefix = dupes.prsPrefix
AND tblPersons.prsLastName = dupes.prsLastName
AND tblPersons.prsCountry = dupes.prsCountry
Originally Posted by Sport
what is the theory or thought behind putting the subquery in the From statement. It looks as if you are creating a temporary table which gets joined to tblPersons in the last bit of your code?
exactly right
a subquery in the FROM clause is called a derived table or inline view
it works just like a temporary table, except it isn't really a temporary table
rudy.ca | @rudydotca
Buy my SitePoint book: Simply SQL
8. #5
9. No Profile Picture
Registered User
Devshed Newbie (0 - 499 posts)
Join Date
Jan 2013
Posts
5
Rep Power
0
Rudy,
It works perfectly! Thank you, also for the learning experience.
This will improve my queries that I hope to write in the future big-time
Thanks again for your help!
Hein
IMN logo majestic logo threadwatch logo seochat tools logo | {
"url": "http://forums.devshed.com/mysql-help-4/subquery-solution-938425.html",
"source_domain": "forums.devshed.com",
"snapshot_id": "crawl=CC-MAIN-2016-40",
"warc_metadata": {
"Content-Length": "65660",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O4WUWH6EMQX2VQ27JYUGYWRHWFKERMRK",
"WARC-Concurrent-To": "<urn:uuid:15be8b7f-5be7-4cef-ab70-236786f72204>",
"WARC-Date": "2016-09-26T13:58:15Z",
"WARC-IP-Address": "72.10.193.116",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:Q6APVKRCAPWC4IILN7GQXWMXAFBNLMJD",
"WARC-Record-ID": "<urn:uuid:28d0d0fd-2bd2-474a-a012-9c8423c4351c>",
"WARC-Target-URI": "http://forums.devshed.com/mysql-help-4/subquery-solution-938425.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:adf7049e-bc4f-45b0-9bdb-6a390286316e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-143-35-109.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-40\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for September 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
7,
31,
51,
86,
87,
101,
114,
124,
130,
144,
150,
151,
183,
184,
185,
197,
198,
261,
262,
346,
435,
436,
552,
553,
596,
606,
687,
708,
742,
804,
879,
956,
957,
1001,
1068,
1069,
1091,
1100,
1108,
1128,
1168,
1169,
1183,
1196,
1209,
1228,
1238,
1249,
1263,
1272,
1423,
1433,
1457,
1490,
1520,
1552,
1583,
1615,
1635,
1668,
1698,
1730,
1762,
1807,
1817,
1875,
1932,
1989,
2043,
2068,
2106,
2114,
2138,
2158,
2193,
2194,
2208,
2221,
2231,
2237,
2251,
2257,
2288,
2289,
2486,
2487,
2618,
2619,
2784,
2820,
2821,
2907,
3104,
3105,
3168,
3169,
3238,
3239,
3255,
3263,
3283,
3323,
3324,
3338,
3351,
3364,
3383,
3393,
3404,
3418,
3427,
3467,
3468,
3495,
3505,
3529,
3562,
3592,
3624,
3655,
3687,
3707,
3740,
3770,
3802,
3834,
3879,
3889,
3911,
3969,
4026,
4083,
4137,
4168,
4365,
4383,
4384,
4459,
4460,
4543,
4544,
4569,
4607,
4615,
4639,
4659,
4694,
4695,
4709,
4722,
4732,
4738,
4752,
4758,
4768,
4769,
4838,
4915,
4916,
4948,
4957,
4958
],
"line_end_idx": [
7,
31,
51,
86,
87,
101,
114,
124,
130,
144,
150,
151,
183,
184,
185,
197,
198,
261,
262,
346,
435,
436,
552,
553,
596,
606,
687,
708,
742,
804,
879,
956,
957,
1001,
1068,
1069,
1091,
1100,
1108,
1128,
1168,
1169,
1183,
1196,
1209,
1228,
1238,
1249,
1263,
1272,
1423,
1433,
1457,
1490,
1520,
1552,
1583,
1615,
1635,
1668,
1698,
1730,
1762,
1807,
1817,
1875,
1932,
1989,
2043,
2068,
2106,
2114,
2138,
2158,
2193,
2194,
2208,
2221,
2231,
2237,
2251,
2257,
2288,
2289,
2486,
2487,
2618,
2619,
2784,
2820,
2821,
2907,
3104,
3105,
3168,
3169,
3238,
3239,
3255,
3263,
3283,
3323,
3324,
3338,
3351,
3364,
3383,
3393,
3404,
3418,
3427,
3467,
3468,
3495,
3505,
3529,
3562,
3592,
3624,
3655,
3687,
3707,
3740,
3770,
3802,
3834,
3879,
3889,
3911,
3969,
4026,
4083,
4137,
4168,
4365,
4383,
4384,
4459,
4460,
4543,
4544,
4569,
4607,
4615,
4639,
4659,
4694,
4695,
4709,
4722,
4732,
4738,
4752,
4758,
4768,
4769,
4838,
4915,
4916,
4948,
4957,
4958,
5016
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5016,
"ccnet_original_nlines": 162,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28250589966773987,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0661938488483429,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2541371285915375,
"rps_doc_frac_unique_words": 0.3839009404182434,
"rps_doc_mean_word_length": 5.091331481933594,
"rps_doc_num_sentences": 60,
"rps_doc_symbol_to_word_ratio": 0.0059101697988808155,
"rps_doc_unigram_entropy": 5.155287742614746,
"rps_doc_word_count": 646,
"rps_doc_frac_chars_dupe_10grams": 0.32836729288101196,
"rps_doc_frac_chars_dupe_5grams": 0.4752204418182373,
"rps_doc_frac_chars_dupe_6grams": 0.4363028407096863,
"rps_doc_frac_chars_dupe_7grams": 0.4214046895503998,
"rps_doc_frac_chars_dupe_8grams": 0.4214046895503998,
"rps_doc_frac_chars_dupe_9grams": 0.32836729288101196,
"rps_doc_frac_chars_top_2gram": 0.05107935890555382,
"rps_doc_frac_chars_top_3gram": 0.07783520966768265,
"rps_doc_frac_chars_top_4gram": 0.10215871036052704,
"rps_doc_books_importance": -343.6417541503906,
"rps_doc_books_importance_length_correction": -343.6417541503906,
"rps_doc_openwebtext_importance": -246.75559997558594,
"rps_doc_openwebtext_importance_length_correction": -246.75559997558594,
"rps_doc_wikipedia_importance": -210.14825439453125,
"rps_doc_wikipedia_importance_length_correction": -210.14825439453125
},
"fasttext": {
"dclm": 0.045611921697854996,
"english": 0.8025727868080139,
"fineweb_edu_approx": 1.2868647575378418,
"eai_general_math": 0.05104804039001465,
"eai_open_web_math": 0.3988901376724243,
"eai_web_code": 0.007376430090516806
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.746",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,515,982,263,076,513,000 | Table Of Contents
UDP Open Connection (G Dataflow)
Version:
Last Modified: March 15, 2017
Opens a UDP socket on the port or service name you provide. Close the socket with the UDP Close Connection node. Use the UDP Multicast Open node instead of this one to open connections capable of reading and writing.
Programming Patterns
connector_pane_image
datatype_icon
net address
Network address to listen on. Specifying an address is useful if you have more than one network card, such as two Ethernet cards, and want to listen only on the card with the specified address. If you do not specify a network address, this node listens on all network addresses. Use the String to IP Address node to obtain the IP network address of the current computer.
This input supports scalar strings and unsigned 32-bit integers.
Default: 0
datatype_icon
port
The local port with which you want to create a UDP socket.
datatype_icon
service name
Name you want to assign to the service. The node creates a known reference for the port number. If you specify a service name, this node registers the service name and the port number with the NI Service Locator.
datatype_icon
timeout ms
Time, in milliseconds, that the node waits to complete before reporting a timeout error. A value of -1 indicates to wait indefinitely.
Default: 25,000 ms
datatype_icon
error in
Error conditions that occur before this node runs.
The node responds to this input according to standard error behavior.
Standard Error Behavior
Many nodes provide an error in input and an error out output so that the node can respond to and communicate errors that occur while code is running. The value of error in specifies whether an error occurred before the node runs. Most nodes respond to values of error in in a standard, predictable way.
error in does not contain an error error in contains an error
If no error occurred before the node runs, the node begins execution normally.
If no error occurs while the node runs, it returns no error. If an error does occur while the node runs, it returns that error information as error out.
If an error occurred before the node runs, the node does not execute. Instead, it returns the error in value as error out.
Default: No error
datatype_icon
connection ID
A network connection refnum that uniquely identifies the connection. Use this value to refer to this connection in subsequent node calls.
datatype_icon
actual port
Port number the node used. If the input port is not zero, the output port number equals the input port number. Wire 0 to the port input to dynamically choose an available UDP port the operating system determines is valid for use. As defined by the Internet Assigned Numbers Authority (IANA), valid port numbers are between the range of 49152 through 65535. Well Known Ports are between the range of 0 through 1023 and Registered Ports are between the range of 1024 through 49151. Not all operating systems follow the IANA standard. For example, Windows returns dynamic ports between the range of 1024 through 5000.
datatype_icon
error out
Error information.
The node produces this output according to standard error behavior.
Standard Error Behavior
Many nodes provide an error in input and an error out output so that the node can respond to and communicate errors that occur while code is running. The value of error in specifies whether an error occurred before the node runs. Most nodes respond to values of error in in a standard, predictable way.
error in does not contain an error error in contains an error
If no error occurred before the node runs, the node begins execution normally.
If no error occurs while the node runs, it returns no error. If an error does occur while the node runs, it returns that error information as error out.
If an error occurred before the node runs, the node does not execute. Instead, it returns the error in value as error out.
Where This Node Can Run:
Desktop OS: Windows
FPGA: This product does not support FPGA devices
Recently Viewed Topics | {
"url": "http://www.ni.com/documentation/en/labview/1.0/node-ref/udp-open-connection/",
"source_domain": "www.ni.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "44186",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DKBXO377YYPBDTKX7VPQLCRFO3RW3EBN",
"WARC-Concurrent-To": "<urn:uuid:e39a6eee-56d6-4353-89dc-706c69dac68a>",
"WARC-Date": "2017-12-14T08:51:09Z",
"WARC-IP-Address": "23.196.59.4",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7RBCPCS43DUZOQI2MYR6KA34OISIMEP7",
"WARC-Record-ID": "<urn:uuid:8256f896-96eb-4023-8ad1-47f330c6221f>",
"WARC-Target-URI": "http://www.ni.com/documentation/en/labview/1.0/node-ref/udp-open-connection/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:767ef862-9cd3-4a99-b77f-77d74453a6e8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-147-2-186.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,
18,
19,
52,
53,
62,
96,
97,
318,
319,
344,
369,
387,
388,
404,
405,
780,
781,
850,
851,
866,
867,
885,
886,
895,
896,
959,
960,
978,
979,
996,
997,
1214,
1215,
1233,
1234,
1249,
1250,
1389,
1390,
1413,
1414,
1432,
1433,
1446,
1447,
1502,
1503,
1577,
1578,
1606,
1607,
1914,
1915,
1981,
2064,
2065,
2222,
2223,
2350,
2351,
2373,
2374,
2392,
2393,
2411,
2412,
2554,
2555,
2573,
2574,
2590,
2591,
3210,
3211,
3229,
3230,
3244,
3245,
3268,
3269,
3341,
3342,
3370,
3371,
3678,
3679,
3745,
3828,
3829,
3986,
3987,
4114,
4115,
4144,
4145,
4169,
4170,
4223,
4224,
4225
],
"line_end_idx": [
18,
19,
52,
53,
62,
96,
97,
318,
319,
344,
369,
387,
388,
404,
405,
780,
781,
850,
851,
866,
867,
885,
886,
895,
896,
959,
960,
978,
979,
996,
997,
1214,
1215,
1233,
1234,
1249,
1250,
1389,
1390,
1413,
1414,
1432,
1433,
1446,
1447,
1502,
1503,
1577,
1578,
1606,
1607,
1914,
1915,
1981,
2064,
2065,
2222,
2223,
2350,
2351,
2373,
2374,
2392,
2393,
2411,
2412,
2554,
2555,
2573,
2574,
2590,
2591,
3210,
3211,
3229,
3230,
3244,
3245,
3268,
3269,
3341,
3342,
3370,
3371,
3678,
3679,
3745,
3828,
3829,
3986,
3987,
4114,
4115,
4144,
4145,
4169,
4170,
4223,
4224,
4225,
4251
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4251,
"ccnet_original_nlines": 100,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37483617663383484,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023591089993715286,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12450852245092392,
"rps_doc_frac_unique_words": 0.303519070148468,
"rps_doc_mean_word_length": 4.739002704620361,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.649989604949951,
"rps_doc_word_count": 682,
"rps_doc_frac_chars_dupe_10grams": 0.38799506425857544,
"rps_doc_frac_chars_dupe_5grams": 0.4217202961444855,
"rps_doc_frac_chars_dupe_6grams": 0.4155321717262268,
"rps_doc_frac_chars_dupe_7grams": 0.38799506425857544,
"rps_doc_frac_chars_dupe_8grams": 0.38799506425857544,
"rps_doc_frac_chars_dupe_9grams": 0.38799506425857544,
"rps_doc_frac_chars_top_2gram": 0.04548266902565956,
"rps_doc_frac_chars_top_3gram": 0.03403465077280998,
"rps_doc_frac_chars_top_4gram": 0.04084157943725586,
"rps_doc_books_importance": -303.5530090332031,
"rps_doc_books_importance_length_correction": -303.5530090332031,
"rps_doc_openwebtext_importance": -177.5986785888672,
"rps_doc_openwebtext_importance_length_correction": -177.5986785888672,
"rps_doc_wikipedia_importance": -121.5058364868164,
"rps_doc_wikipedia_importance_length_correction": -121.5058364868164
},
"fasttext": {
"dclm": 0.047434210777282715,
"english": 0.818375289440155,
"fineweb_edu_approx": 2.5396742820739746,
"eai_general_math": 0.6556800603866577,
"eai_open_web_math": 0.4392692446708679,
"eai_web_code": 0.15476858615875244
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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 |
-1,396,171,725,842,268,700 | The OpenNET Project / Index page
[ ÎÏ×ÏÓÔÉ /+++ | ÆÏÒÕÍ | ÔÅÇÉ | ]
ðÏÉÓË: ëÁÔÁÌÏÇ ÄÏËÕÍÅÎÔÁÃÉÉ
Next Previous Contents
4. Toolbox required
4.1 Hardware requirement
You need a Linux Box (486 or, better, a Pentium 100+ with 16MB+ ram), the Wireless network card, an antenna (see par 2.2). You need the same on the other end (with Win9x or WinNT, if you prefer...) cause you have to simulate a communication!
4.2 Software requirement
You need:
1. recent stable kernel sources (2.2.x)
2. recent stable pcmcia sources (pcmcia-cs) if you bought a pcmcia card
3. Wireless network driver: if you don't have it you can download it from the vendor web site or the card manufacturer web site. If you don't find it you can search at Jean Tourrilhes Wireless Howto.
If you don't find even here you probably have to wait or to convert a Windows driver to a Linux driver!! (good luck!).
After that, you have to recompile your kernel, recompile your pcmcia source (if need by the Wireless card), finally recompile your Wireless driver. That is the generic situation, maybe for some card you have to perform step 3 only or 1 and 3, it depends on specific driver.
Next Previous Contents
ðÁÒÔΣÒÙ:
PostgresPro
Inferno Solutions
Hosting by Hoster.ru
èÏÓÔÉÎÇ:
úÁËÌÁÄËÉ ÎÁ ÓÁÊÔÅ
ðÒÏÓÌÅÄÉÔØ ÚÁ ÓÔÒÁÎÉÃÅÊ
Created 1996-2024 by Maxim Chirkov
äÏÂÁ×ÉÔØ, ðÏÄÄÅÒÖÁÔØ, ÷ÅÂÍÁÓÔÅÒÕ | {
"url": "https://periscope.opennet.ru/docs/HOWTO/Wireless-HOWTO-4.html",
"source_domain": "periscope.opennet.ru",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "9290",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TYKFLYNS65VNBOFSSWEFV5DTG5VABO4S",
"WARC-Concurrent-To": "<urn:uuid:f7eb7e9a-1f2a-4dbb-8411-f0215cad0631>",
"WARC-Date": "2024-08-07T12:15:16Z",
"WARC-IP-Address": "217.65.3.21",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WA2CDR3V3DWRZWEG4JTYVGNX7XYN6Z7P",
"WARC-Record-ID": "<urn:uuid:869299cc-08d6-4017-9f79-71b082ab104b>",
"WARC-Target-URI": "https://periscope.opennet.ru/docs/HOWTO/Wireless-HOWTO-4.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8b5e8cd2-caac-48c5-b788-38819b48611f>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-170\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,
33,
34,
68,
69,
98,
99,
122,
123,
143,
144,
169,
170,
412,
413,
438,
439,
449,
450,
492,
566,
768,
769,
888,
889,
1163,
1164,
1165,
1188,
1189,
1190,
1200,
1212,
1230,
1251,
1260,
1261,
1279,
1303,
1338
],
"line_end_idx": [
33,
34,
68,
69,
98,
99,
122,
123,
143,
144,
169,
170,
412,
413,
438,
439,
449,
450,
492,
566,
768,
769,
888,
889,
1163,
1164,
1165,
1188,
1189,
1190,
1200,
1212,
1230,
1251,
1260,
1261,
1279,
1303,
1338,
1370
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1370,
"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.28859061002731323,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0436241589486599,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.34228187799453735,
"rps_doc_frac_unique_words": 0.5882353186607361,
"rps_doc_mean_word_length": 5.230769157409668,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0.003355700056999922,
"rps_doc_unigram_entropy": 4.575137138366699,
"rps_doc_word_count": 221,
"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.021626299247145653,
"rps_doc_frac_chars_top_3gram": 0.023356400430202484,
"rps_doc_frac_chars_top_4gram": 0.022491350769996643,
"rps_doc_books_importance": -120.25003051757812,
"rps_doc_books_importance_length_correction": -120.24927520751953,
"rps_doc_openwebtext_importance": -77.02017974853516,
"rps_doc_openwebtext_importance_length_correction": -77.02017974853516,
"rps_doc_wikipedia_importance": -65.5625,
"rps_doc_wikipedia_importance_length_correction": -65.09757232666016
},
"fasttext": {
"dclm": 0.12340986728668213,
"english": 0.7948781251907349,
"fineweb_edu_approx": 1.6204092502593994,
"eai_general_math": 0.3792102336883545,
"eai_open_web_math": 0.46147865056991577,
"eai_web_code": 0.009882809594273567
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.02856",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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 |
7,671,413,014,639,686,000 |
[Logo]
Forums Register Login
JSP Tag
What is the advantage of using JSP tag then writing Java code in <% %>
and which has got better performance
Regards,
Pradeep
The Primary benefits are related to maintainability and usability. If you code a piece of functionality into a tag then you can very easily reuse this across multiple pages and even multiple web applications. This is much harder with scriptlets.
Scriptlets create messy pages. You dont have any separation of concerns, with the display and logic mixed up together, this results in a maintainance headache. This is further compounded when pages are designed by non java programmers (Graphic Designers etc). It is easy to teach such people how to use a given tag, but much harder (and pointless) to teach them Java.
As for performance, there is little or nothing in it. At the end of the day a tag equates to simple method calls when a JSP is translated to a servlet, in exactly the same as a scriptlet would be translated. A potential performance gain that can be had by using tags relates to the fact that tag instances can be pooled by the web container. This means expensive object creation could potentially be done once only....
A good book that discusses these points in detail is Professional JSP Tag Libraries by Simon Brown.
Hope this helps..
Cheers
Sam
Wink, wink, nudge, nudge, say no more ... https://richsoil.com/cards
All times above are in ranch (not your local) time.
The current ranch time is
Nov 24, 2017 22:31:45. | {
"url": "https://coderanch.com/t/281803/java/JSP-Tag?nonMobile=false",
"source_domain": "coderanch.com",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "11257",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GDKV5D5XE46PLZ4A5VT5L26CIYQX44XN",
"WARC-Concurrent-To": "<urn:uuid:a3f6130b-b0d4-475b-8118-ae1f8de4df4b>",
"WARC-Date": "2017-11-25T05:31:45Z",
"WARC-IP-Address": "204.144.184.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2XEFEYKN233Y3ITYMJI5TL3XKSZVLZHP",
"WARC-Record-ID": "<urn:uuid:08e8b0d4-bd8a-421e-9961-96c3a74da22a>",
"WARC-Target-URI": "https://coderanch.com/t/281803/java/JSP-Tag?nonMobile=false",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:92459902-0e75-4d8e-a92f-a73ec2515e2e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-65-89.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,
1,
2,
3,
10,
32,
40,
111,
148,
149,
158,
166,
412,
780,
1199,
1299,
1317,
1324,
1328,
1397,
1398,
1399,
1400,
1452,
1478
],
"line_end_idx": [
1,
2,
3,
10,
32,
40,
111,
148,
149,
158,
166,
412,
780,
1199,
1299,
1317,
1324,
1328,
1397,
1398,
1399,
1400,
1452,
1478,
1500
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1500,
"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.40199336409568787,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01993354968726635,
"rps_doc_frac_lines_end_with_ellipsis": 0.03999999910593033,
"rps_doc_frac_no_alph_words": 0.15282392501831055,
"rps_doc_frac_unique_words": 0.6313725709915161,
"rps_doc_mean_word_length": 4.643137454986572,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.006644519977271557,
"rps_doc_unigram_entropy": 4.810156345367432,
"rps_doc_word_count": 255,
"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.015202700160443783,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -158.10336303710938,
"rps_doc_books_importance_length_correction": -149.16348266601562,
"rps_doc_openwebtext_importance": -85.60657501220703,
"rps_doc_openwebtext_importance_length_correction": -85.60657501220703,
"rps_doc_wikipedia_importance": -68.96780395507812,
"rps_doc_wikipedia_importance_length_correction": -57.105918884277344
},
"fasttext": {
"dclm": 0.028918270021677017,
"english": 0.9328379034996033,
"fineweb_edu_approx": 2.3589234352111816,
"eai_general_math": 0.28973519802093506,
"eai_open_web_math": 0.30092912912368774,
"eai_web_code": 0.14436990022659302
}
} | {
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-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 |
-320,450,416,048,907,460 |
Обращаем Ваше внимание: Министерство образования и науки рекомендует в 2017/2018 учебном году включать в программы воспитания и социализации образовательные события, приуроченные к году экологии (2017 год объявлен годом экологии и особо охраняемых природных территорий в Российской Федерации).
Учителям 1-11 классов и воспитателям дошкольных ОУ вместе с ребятами рекомендуем принять участие в международном конкурсе «Законы экологии», приуроченном к году экологии. Участники конкурса проверят свои знания правил поведения на природе, узнают интересные факты о животных и растениях, занесённых в Красную книгу России. Все ученики будут награждены красочными наградными материалами, а учителя получат бесплатные свидетельства о подготовке участников и призёров международного конкурса. ПОДАТЬ ЗАЯВКУ НА КОНКУРС.
Главная / Информатика / Презентация к открытому уроку информатики «Метод координат»
Презентация к открытому уроку информатики «Метод координат»
Скачать материал
Название документа Автор.docx
Автор: Морозова Ольга Васильевна
Должность: учитель информатики
Категория: высшая
Образовательное учреждение: МБОУ «Средняя общеобразовательная школа № 12» г.Яровое Алтайского края
E-mail: [email protected]
Тема урока: Метод координат.
Предмет: Информатика.
Класс: 5
Ключевые слова: открытый урок, прямоугольная система координат, Р.Декарт, координаты, презентация к уроку.
Название документа Презентация.pptx
Метод ко ор ди нат
Метод координат.
«Лучше один раз увидеть, чем сто раз услышать»
Игра в шахматы: Пешки: F6 , ?... Конь ? 8 7 6...
РЕНЕ ДЕКАРТ (1596-1650)
0 Х Y I четверть II четверть III четверть IV четверть 0 Y Х 1 1 единичный от...
А (6,8)
Х У 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 (2,5) (7,3) (6,7) Определите координаты точ...
10 5 1 7 3 1 3 5 7 10 1 1(1,3) 2 4(9,8) 3 4 5 6 3(8,4) 2(3,5) 5(5,10) 6(10,5)...
Соедините точки: 1-2-3-4-5-6-7-8-9-10-11-12-13 -14 -15 - 1 1 (4,0) 2 (4,1) 3 ...
Соедините точки: 1-2-3-4-5-6-7-8-9-10-11-12-13 -14 -15 - 1 1 2 3 1 2 3 4 5 6 ...
Рабочая тетрадь С.34 № 34 (взаимопроверка)
1 2 3 4 5 6 7 8 9 10 11
Физминутка
Следим глазами
Домашняя работа. 1.Нарисовать рисунок. 2.Игра «Морской бой». Желаю успехов!!!
Самостоятельная работа
Что нового узнали? Каким методом пользовались? Как называется система координ...
1 из 24
Описание презентации по отдельным слайдам:
№ слайда 1
Описание слайда:
№ слайда 2 Метод ко ор ди нат
Описание слайда:
Метод ко ор ди нат
№ слайда 3 Метод координат.
Описание слайда:
Метод координат.
№ слайда 4 «Лучше один раз увидеть, чем сто раз услышать»
Описание слайда:
«Лучше один раз увидеть, чем сто раз услышать»
№ слайда 5 Игра в шахматы: Пешки: F6 , ?... Конь ? 8 7 6
Описание слайда:
Игра в шахматы: Пешки: F6 , ?... Конь ? 8 7 6 5 4 3 2 1 A B C D E F G H
№ слайда 6 РЕНЕ ДЕКАРТ (1596-1650)
Описание слайда:
РЕНЕ ДЕКАРТ (1596-1650)
№ слайда 7 0 Х Y I четверть II четверть III четверть IV четверть 0 Y Х 1 1 единичный отрез
Описание слайда:
0 Х Y I четверть II четверть III четверть IV четверть 0 Y Х 1 1 единичный отрезок Прямоугольная система координат
№ слайда 8 А (6,8)
Описание слайда:
А (6,8)
№ слайда 9 Х У 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 (2,5) (7,3) (6,7) Определите координаты точек
Описание слайда:
Х У 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 (2,5) (7,3) (6,7) Определите координаты точек 0
№ слайда 10 10 5 1 7 3 1 3 5 7 10 1 1(1,3) 2 4(9,8) 3 4 5 6 3(8,4) 2(3,5) 5(5,10) 6(10,5) 0
Описание слайда:
10 5 1 7 3 1 3 5 7 10 1 1(1,3) 2 4(9,8) 3 4 5 6 3(8,4) 2(3,5) 5(5,10) 6(10,5) 0 0 X Y
№ слайда 11 Соедините точки: 1-2-3-4-5-6-7-8-9-10-11-12-13 -14 -15 - 1 1 (4,0) 2 (4,1) 3 (7,
Описание слайда:
Соедините точки: 1-2-3-4-5-6-7-8-9-10-11-12-13 -14 -15 - 1 1 (4,0) 2 (4,1) 3 (7,1) 4 (12,8) 5 (7,11) 6 (7,7) 8 (4,14) 7(0,14) 9 (5,15) 10 (8,13) 11 (7,12) 12 (13,8) 13 (8,1) 14 (11,1) 15 (11,0) Что это? (самопроверка)
№ слайда 12 Соедините точки: 1-2-3-4-5-6-7-8-9-10-11-12-13 -14 -15 - 1 1 2 3 1 2 3 4 5 6 7 8
Описание слайда:
Соедините точки: 1-2-3-4-5-6-7-8-9-10-11-12-13 -14 -15 - 1 1 2 3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 11 11 12 13 12 13 14 14 15 16 1 (4,0) 2 (4,1) 3 (7,1) 4 (12,8) 5 (7,11) 6 (7,7) 8 (4,14) 7(0,14) 9 (5,15) 10 (8,13) 11 (7,12) 12 (13,8) 13 (8,1) 14 (11,1) 15 (11,0) Что это?
№ слайда 13 Рабочая тетрадь С.34 № 34 (взаимопроверка)
Описание слайда:
Рабочая тетрадь С.34 № 34 (взаимопроверка)
№ слайда 14 1 2 3 4 5 6 7 8 9 10 11
Описание слайда:
1 2 3 4 5 6 7 8 9 10 11
№ слайда 15 Физминутка
Описание слайда:
Физминутка
№ слайда 16 Следим глазами
Описание слайда:
Следим глазами
№ слайда 17
Описание слайда:
№ слайда 18
Описание слайда:
№ слайда 19
Описание слайда:
№ слайда 20
Описание слайда:
№ слайда 21
Описание слайда:
№ слайда 22 Домашняя работа. 1.Нарисовать рисунок. 2.Игра «Морской бой». Желаю успехов!!!
Описание слайда:
Домашняя работа. 1.Нарисовать рисунок. 2.Игра «Морской бой». Желаю успехов!!!
№ слайда 23 Самостоятельная работа
Описание слайда:
Самостоятельная работа
№ слайда 24 Что нового узнали? Каким методом пользовались? Как называется система координат?
Описание слайда:
Что нового узнали? Каким методом пользовались? Как называется система координат? В честь какого математика она называется? Как называется горизонтальная и вертикальная ось? Сколько координат имеет точка? Что пишется на первом месте, на втором?? Итог урока
Презентация к открытому уроку информатики «Метод координат»
Скачать материал
• Информатика
Описание:
Информация может быть представлена с помощью чисел. Чтобы связать числа и точки, используют системы координат. Обозначение местоположения объектов с помощью координат используется довольно часто. В данной презентации приведены примеры построения точек по заданным координатам.
moroz.jpg
Здесь представлен лишь фрагмент презентации. Полный вариант содержит 24 слайда, который можно скачать.
Самые низкие цены на курсы переподготовки
Специально для учителей, воспитателей и других работников системы образования действуют 50% скидки при обучении на курсах профессиональной переподготовки.
После окончания обучения выдаётся диплом о профессиональной переподготовке установленного образца с присвоением квалификации (признаётся при прохождении аттестации по всей России).
Обучение проходит заочно прямо на сайте проекта "Инфоурок", но в дипломе форма обучения не указывается.
Начало обучения ближайшей группы: 25 октября. Оплата возможна в беспроцентную рассрочку (10% в начале обучения и 90% в конце обучения)!
Подайте заявку на интересующий Вас курс сейчас: https://infourok.ru
Скачать материал
Автор Морозова Ольга Васильевна
Дата добавления 09.03.2013
Раздел Информатика
Подраздел
Просмотров 3658
Номер материала 853
Скачать свидетельство о публикации
Оставьте свой комментарий:
Введите символы, которые изображены на картинке:
Получить новый код
* Обязательные для заполнения.
Комментарии:
↓ Показать еще коментарии ↓ | {
"url": "https://www.metod-kopilka.ru/page-4-1-1-30.html",
"source_domain": "www.metod-kopilka.ru",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "70788",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:E3DYWDZ2AF3FD7CKLRKSO3NMMJ4ERHJR",
"WARC-Concurrent-To": "<urn:uuid:1d94f762-d245-4e38-8de2-947c3815a221>",
"WARC-Date": "2017-10-21T01:30:22Z",
"WARC-IP-Address": "178.63.85.137",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JPUSUJDCFARTXN5VES3VZKUWLKAOEFJF",
"WARC-Record-ID": "<urn:uuid:0fbe3e0f-e6ca-48db-ba1d-07651d8e253c>",
"WARC-Target-URI": "https://www.metod-kopilka.ru/page-4-1-1-30.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:041873de-25a9-4e87-bd75-2a87495e80bc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-203-171-252.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,
295,
296,
812,
896,
897,
957,
958,
975,
976,
1006,
1007,
1040,
1041,
1072,
1073,
1091,
1092,
1191,
1192,
1218,
1219,
1220,
1221,
1250,
1251,
1273,
1274,
1283,
1284,
1391,
1392,
1393,
1394,
1395,
1396,
1432,
1433,
1453,
1470,
1518,
1599,
1623,
1703,
1712,
1793,
1874,
1955,
2036,
2079,
2104,
2116,
2131,
2209,
2232,
2313,
2321,
2322,
2365,
2366,
2377,
2394,
2395,
2426,
2443,
2444,
2463,
2464,
2492,
2509,
2510,
2527,
2528,
2587,
2604,
2605,
2652,
2653,
2744,
2761,
2762,
2962,
2963,
2998,
3015,
3016,
3040,
3041,
3132,
3149,
3150,
3264,
3265,
3285,
3302,
3303,
3311,
3312,
3403,
3420,
3421,
3503,
3504,
3596,
3613,
3614,
3700,
3701,
3794,
3811,
3812,
4030,
4031,
4124,
4141,
4142,
4453,
4454,
4509,
4526,
4527,
4570,
4571,
4608,
4625,
4626,
4650,
4651,
4675,
4692,
4693,
4704,
4705,
4732,
4749,
4750,
4765,
4766,
4778,
4795,
4796,
4808,
4825,
4826,
4838,
4855,
4856,
4868,
4885,
4886,
4898,
4915,
4916,
5006,
5023,
5024,
5102,
5103,
5138,
5155,
5156,
5179,
5180,
5273,
5290,
5291,
5547,
5548,
5608,
5625,
5641,
5651,
5652,
5929,
5930,
5931,
5932,
5942,
5943,
5944,
5945,
5946,
6049,
6050,
6051,
6052,
6094,
6095,
6250,
6251,
6432,
6433,
6537,
6538,
6674,
6675,
6743,
6744,
6761,
6793,
6820,
6839,
6849,
6865,
6885,
6920,
6921,
6948,
6949,
6998,
6999,
7018,
7049,
7050,
7051,
7064,
7065
],
"line_end_idx": [
1,
295,
296,
812,
896,
897,
957,
958,
975,
976,
1006,
1007,
1040,
1041,
1072,
1073,
1091,
1092,
1191,
1192,
1218,
1219,
1220,
1221,
1250,
1251,
1273,
1274,
1283,
1284,
1391,
1392,
1393,
1394,
1395,
1396,
1432,
1433,
1453,
1470,
1518,
1599,
1623,
1703,
1712,
1793,
1874,
1955,
2036,
2079,
2104,
2116,
2131,
2209,
2232,
2313,
2321,
2322,
2365,
2366,
2377,
2394,
2395,
2426,
2443,
2444,
2463,
2464,
2492,
2509,
2510,
2527,
2528,
2587,
2604,
2605,
2652,
2653,
2744,
2761,
2762,
2962,
2963,
2998,
3015,
3016,
3040,
3041,
3132,
3149,
3150,
3264,
3265,
3285,
3302,
3303,
3311,
3312,
3403,
3420,
3421,
3503,
3504,
3596,
3613,
3614,
3700,
3701,
3794,
3811,
3812,
4030,
4031,
4124,
4141,
4142,
4453,
4454,
4509,
4526,
4527,
4570,
4571,
4608,
4625,
4626,
4650,
4651,
4675,
4692,
4693,
4704,
4705,
4732,
4749,
4750,
4765,
4766,
4778,
4795,
4796,
4808,
4825,
4826,
4838,
4855,
4856,
4868,
4885,
4886,
4898,
4915,
4916,
5006,
5023,
5024,
5102,
5103,
5138,
5155,
5156,
5179,
5180,
5273,
5290,
5291,
5547,
5548,
5608,
5625,
5641,
5651,
5652,
5929,
5930,
5931,
5932,
5942,
5943,
5944,
5945,
5946,
6049,
6050,
6051,
6052,
6094,
6095,
6250,
6251,
6432,
6433,
6537,
6538,
6674,
6675,
6743,
6744,
6761,
6793,
6820,
6839,
6849,
6865,
6885,
6920,
6921,
6948,
6949,
6998,
6999,
7018,
7049,
7050,
7051,
7064,
7065,
7092
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7092,
"ccnet_original_nlines": 217,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03659909963607788,
"rps_doc_frac_lines_end_with_ellipsis": 0.03211009129881859,
"rps_doc_frac_no_alph_words": 0.9757882952690125,
"rps_doc_frac_unique_words": 0.36675700545310974,
"rps_doc_mean_word_length": 4.74345064163208,
"rps_doc_num_sentences": 81,
"rps_doc_symbol_to_word_ratio": 0.0056306300684809685,
"rps_doc_unigram_entropy": 5.308280944824219,
"rps_doc_word_count": 1107,
"rps_doc_frac_chars_dupe_10grams": 0.1936773955821991,
"rps_doc_frac_chars_dupe_5grams": 0.3481241762638092,
"rps_doc_frac_chars_dupe_6grams": 0.3401256799697876,
"rps_doc_frac_chars_dupe_7grams": 0.32070082426071167,
"rps_doc_frac_chars_dupe_8grams": 0.3090839684009552,
"rps_doc_frac_chars_dupe_9grams": 0.2873738408088684,
"rps_doc_frac_chars_top_2gram": 0.036564458161592484,
"rps_doc_frac_chars_top_3gram": 0.009712439961731434,
"rps_doc_frac_chars_top_4gram": 0.012188149616122246,
"rps_doc_books_importance": -1036.2042236328125,
"rps_doc_books_importance_length_correction": -1036.2042236328125,
"rps_doc_openwebtext_importance": -570.4511108398438,
"rps_doc_openwebtext_importance_length_correction": -570.4511108398438,
"rps_doc_wikipedia_importance": -494.4150695800781,
"rps_doc_wikipedia_importance_length_correction": -494.4150695800781
},
"fasttext": {
"dclm": 0.08260869979858398,
"english": 0.00007044000085443258,
"fineweb_edu_approx": 0.9100321531295776,
"eai_general_math": 0.000026580000849207863,
"eai_open_web_math": 0.7051324248313904,
"eai_web_code": 0.6028143167495728
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "516.15",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "372.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Elementary and Kindergarten"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
7,955,028,811,465,202,000 | Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
PerlMonks
Auto-reaping of duplicates
by RhetTbull (Curate)
on Oct 20, 2001 at 00:19 UTC ( #120136=monkdiscuss: print w/ replies, xml ) Need Help??
In light of the recent rash of duplicate posts I started thinking about autoreaping of duplicate nodes. It seems to be that it wouldn't be too hard that when a node is submitted to have it automatically diff'd against all recent (e.g. < 1 hr) posts by the same author (or maybe last 5 posts or something) and rejected if it's a duplicate. The node could be automagically reaped and would save the editors and moderators a bit of time as well as solve the problem (as happened in the example above) where there are different threads to the different duplicate posts.
Comment on Auto-reaping of duplicates
(crazyinsomniac) Re: Auto-reaping of duplicates
by crazyinsomniac (Prior) on Oct 20, 2001 at 00:30 UTC
Either automagically delete the reaped nodes, or at least prevent replies to the potential duplicates (as well as consideration), until a wise editor can determine what to do.
We have plenty of developers now, and hopefully one of them will see this, and submit a patch...
update: apparently I, among others, am a part of the pmdev as opposed the developers group, go figure... ;D
___crazyinsomniac_______________________________________
Disclaimer: Don't blame. It came from inside the void
perl -e "$q=$_;map({chr unpack qq;H*;,$_}split(q;;,q*H*));print;$q/$q;"
Re: Auto-reaping of duplicates
by tommyw (Hermit) on Oct 20, 2001 at 00:41 UTC
I'm sure this must have been suggested before, but I wasn't watching then...
When a comment form is generated, included a "magic number" as a hidden field. The only condition being that the number is unique. Then track those numbers which are submitted.
Depending on performance implications, either note the generation of the number, and strike it when the comment is submitted (and generate an error if the number is not found due to previously being struck), or simply record all those numbers submitted (and generate an error if the number has been previously seen). In either mechanism, flush entries from the cache after a certain time to keep it down to size.
Re: Auto-reaping of duplicates
by demerphq (Chancellor) on Oct 20, 2001 at 16:42 UTC
Well, if its exact duplicates you're worried about then why not set up a unique index that contained the MD5 checksum of a post and prevent them from ever being allowed in the DB in the first place? That would be pretty simple to calculate and very fast, and pretty low memory overhead as well (OTOH I havent looking into the Everything code). If it was configured to quietly ignore the dupes I would guess it would be an easy fix.
Yves
--
You are not ready to use symrefs unless you already know why they are bad. -- tadmc (CLPM)
It's important to remember that MD5 produces a hash of the content. Just because two items produce the same checksum, doesn't mean their content is identical (if it did, then we would never need the infinite supply of monkeys, as there would only be 2^128 possible texts). It's almost a certainty, but not quite. It'd certainly be highly embarassing to block somebody's 5 page thesis, because it happened to have the same MD5 checksum as an already existing "me too!" post.
So MD5 can be used as a first cut for uniqueness, but still has to be followed up with a more precise check if the checksums do turn out to be the same. Just in case...
only be 2^128 possible texts
only? Only!? Do you have any idea how big 2^128 is?
2^128 = 340,282,366,920,938,463,463,374,607,431,768,211,456 > 3*10^38
Which is bigger than the number of cups of water in all the oceans (6*10^21)
Bigger than the distance from one end of the universe to the other in inches...(2*10^28)
Bigger than the volume of the sun in cubic inches...(8*10^31)
Bigger than the area of the galaxy in square miles...(3*10^35)
Approaching the number of atoms in our atmosphere.....(2*10^44)
(from bignum)
Perhaps a secondary check is in order, but I'd hardly use 'only' when talking about 2^128 hash buckets.
Update:
Ok, lets play with the numbers some more:
Let's assume perlmonks has 300,000 nodes (3*105 ) and has 3*1038 buckets in its hashing algorithm. The ratio of nodes/buckets is 3*105 : 3*1038 or 1 : 1033.
Now, consider this lottery where you pick six different numbers from 1-49. Get all six right and you win the jackpot. As the page above notes, the chances of winning with one ticket are:
1 : 13,983,816 ( (49*48*47*46*45*44)/(6*5*4*3*2*1) ) or about:
1 : 107
Lets buy one ticket a week for four weeks... odds of winning *all* four lotteries with our four tickets are: 1 : (107)4 or 1 : 1028 .
That *still* doesn't get you there... after winning your four lotteries, we'll take you to one of the new huge NFL stadiums being built, and you have to gamble all your winnings on picking a specific, randomly-chosen seat (1 : 105)
So the chances of my next post colliding with a node already in the database (1:1033 ) are about the same as you winning four lotteries on four tickets, then picking the single correct seat out of a gigantic stadium (1 : 1028*105)
-Blake
Well I have quite a bit of trouble believing that two posts, with different authors and different names would generate the same MD5. I suppose its possible but I guess the post would have to be very very long indeed. I seriously doubt that its possible to get the same MD5 from different data when the data is small, especially as small as a post would be. But then I dont know the full workings of MD5...
Of course however, the extra check is cheap so why not...
:-)
Yves
--
You are not ready to use symrefs unless you already know why they are bad. -- tadmc (CLPM)
Re: Auto-reaping of duplicates
by Zecho (Hermit) on Oct 24, 2001 at 05:36 UTC
5+ delete votes with 0 edit or keep votes = autoreap! would be my suggestion.
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: monkdiscuss [id://120136]
Approved by root
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (5)
As of 2015-02-28 08:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
On my keyboard, Caps lock is:
Results (460 votes), past polls | {
"url": "http://www.perlmonks.org/?node_id=120136",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2015-11",
"warc_metadata": {
"Content-Length": "27509",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PIR3MI2U7YH2U3VX56RSDF4FUVFIOYKZ",
"WARC-Concurrent-To": "<urn:uuid:1c4d9318-9bb2-404d-8d39-d6b0ff9d01e0>",
"WARC-Date": "2015-02-28T08:12:26Z",
"WARC-IP-Address": "216.92.34.251",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:H2TM44ZOYSV4FW6AY4Q56TNEKFODQYNW",
"WARC-Record-ID": "<urn:uuid:b47e45d8-8571-4995-b64a-158ad09cf46d>",
"WARC-Target-URI": "http://www.perlmonks.org/?node_id=120136",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a9796b56-6847-4142-a7ce-7181b1952c7c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-28-5-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-11\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for February 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
63,
97,
129,
131,
143,
144,
171,
172,
194,
282,
283,
849,
850,
888,
936,
991,
1171,
1172,
1273,
1274,
1386,
1387,
1393,
1454,
1512,
1513,
1589,
1590,
1621,
1669,
1670,
1751,
1752,
1933,
1934,
2351,
2352,
2383,
2437,
2873,
2874,
2883,
2890,
2985,
2986,
3466,
3467,
3642,
3643,
3682,
3683,
3743,
3821,
3822,
3907,
4004,
4074,
4145,
4217,
4218,
4240,
4241,
4353,
4354,
4370,
4420,
4421,
4586,
4587,
4782,
4783,
4854,
4870,
4871,
5013,
5014,
5254,
5255,
5494,
5495,
5510,
5511,
5925,
5926,
5992,
5993,
6005,
6006,
6019,
6030,
6129,
6130,
6161,
6208,
6290,
6291,
6299,
6309,
6319,
6320,
6340,
6358,
6371,
6384,
6421,
6438,
6443,
6455,
6492,
6493,
6531,
6544,
6580,
6607,
6617,
6630,
6642,
6653,
6671,
6672,
6706,
6707,
6708,
6709,
6710,
6711,
6712,
6713,
6714
],
"line_end_idx": [
63,
97,
129,
131,
143,
144,
171,
172,
194,
282,
283,
849,
850,
888,
936,
991,
1171,
1172,
1273,
1274,
1386,
1387,
1393,
1454,
1512,
1513,
1589,
1590,
1621,
1669,
1670,
1751,
1752,
1933,
1934,
2351,
2352,
2383,
2437,
2873,
2874,
2883,
2890,
2985,
2986,
3466,
3467,
3642,
3643,
3682,
3683,
3743,
3821,
3822,
3907,
4004,
4074,
4145,
4217,
4218,
4240,
4241,
4353,
4354,
4370,
4420,
4421,
4586,
4587,
4782,
4783,
4854,
4870,
4871,
5013,
5014,
5254,
5255,
5494,
5495,
5510,
5511,
5925,
5926,
5992,
5993,
6005,
6006,
6019,
6030,
6129,
6130,
6161,
6208,
6290,
6291,
6299,
6309,
6319,
6320,
6340,
6358,
6371,
6384,
6421,
6438,
6443,
6455,
6492,
6493,
6531,
6544,
6580,
6607,
6617,
6630,
6642,
6653,
6671,
6672,
6706,
6707,
6708,
6709,
6710,
6711,
6712,
6713,
6714,
6749
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6749,
"ccnet_original_nlines": 129,
"rps_doc_curly_bracket": 0.00029634000384248793,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38053691387176514,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024161070585250854,
"rps_doc_frac_lines_end_with_ellipsis": 0.046153850853443146,
"rps_doc_frac_no_alph_words": 0.28724831342697144,
"rps_doc_frac_unique_words": 0.43981480598449707,
"rps_doc_mean_word_length": 4.521296501159668,
"rps_doc_num_sentences": 63,
"rps_doc_symbol_to_word_ratio": 0.009395970031619072,
"rps_doc_unigram_entropy": 5.580007553100586,
"rps_doc_word_count": 1080,
"rps_doc_frac_chars_dupe_10grams": 0.029490070417523384,
"rps_doc_frac_chars_dupe_5grams": 0.08724144846200943,
"rps_doc_frac_chars_dupe_6grams": 0.045054271817207336,
"rps_doc_frac_chars_dupe_7grams": 0.045054271817207336,
"rps_doc_frac_chars_dupe_8grams": 0.045054271817207336,
"rps_doc_frac_chars_dupe_9grams": 0.029490070417523384,
"rps_doc_frac_chars_top_2gram": 0.008191689848899841,
"rps_doc_frac_chars_top_3gram": 0.02826130948960781,
"rps_doc_frac_chars_top_4gram": 0.02559901960194111,
"rps_doc_books_importance": -644.5104370117188,
"rps_doc_books_importance_length_correction": -644.5104370117188,
"rps_doc_openwebtext_importance": -368.76885986328125,
"rps_doc_openwebtext_importance_length_correction": -368.76885986328125,
"rps_doc_wikipedia_importance": -275.2445373535156,
"rps_doc_wikipedia_importance_length_correction": -275.2445373535156
},
"fasttext": {
"dclm": 0.14856988191604614,
"english": 0.930024266242981,
"fineweb_edu_approx": 1.6166207790374756,
"eai_general_math": 0.4987531900405884,
"eai_open_web_math": 0.3310043215751648,
"eai_web_code": 0.03725308179855347
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
8,209,212,952,710,274,000 | Advertisement
Online Test Banks
Score higher
See Online Test Banks
eLearning
Learning anything is easy
Browse Online Courses
Mobile Apps
Learning on the go
Explore Mobile Apps
Dummies Store
Shop for books and more
Start Shopping
Geometry Basics
View:
Sorted by:
What Is a Geometry Proof?
A geometry proof — like any mathematical proof — is an argument that begins with known facts, proceeds from there through a series of logical deductions, and ends with the thing you’re trying to prove. [more…]
Getting to Know the Five Simplest Geometric Objects
The study of geometry begins with the definitions of the five simplest geometric objects — point, line, segment, ray, and angle — as well as two extra definitions [more…]
Getting to Know Points
Although individual points have no features, when you group them, you can create several different types of points: collinear, non-collinear, coplanar, and non-coplanar. Each type merits an explanation [more…]
Getting to Know Lines
There are different types of lines (or segments or rays) or pairs of lines (or segments or rays). You can identify single lines based on the direction they’re pointing [more…]
Getting to Know Planes
When two geometric planes interact with each other, it is in one of two ways: as parallel planes or as intersecting planes. Here are the definitions for these two types of relationships between a pair [more…]
Getting to Know Angles
Angles are one of the basic building blocks of triangles and other polygons. There are five types of angles: acute, right, obtuse, straight, and reflex. You see angles on virtually every page of any geometry [more…]
Getting to Know Angle Pairs
Adjacent angles and vertical angles always share a common vertex, so they’re literally joined at the hip. Complementary and supplementary angles can share a vertex, but they don’t have to. Here are the [more…]
How to Measure Line Segments
To find the measure or size of a segment, you simply measure its length. What else could you measure? After all, length is the only feature a segment has. You’ve got your short, your medium, and your long [more…]
How to Measure Angles
Measuring angles is pretty simple: the size of an angle is based on how wide the angle is open. Here are some points and mental pictures that will help you to understand how angle measurement works. [more…]
Adding and Subtracting Segments and Angles
Adding and subtracting segments and angles isn’t exactly rocket science. But it is important because this geometric arithmetic comes up in proofs and other geometry problems. Here’s how it works: [more…]
Geometry Symbols You Should Know
Using geometry symbols will save time and space when writing proofs, properties, and figuring formulas. The most commonly used geometry symbols and their meanings are shown below. [more…]
Bisecting and Trisecting Segments
Bisection and trisection involve cutting something into two or three equal parts. If you’re a fan of bicycles and tricycles and bifocals and trifocals — not to mention the biathlon and the triathlon, bifurcation [more…]
Bisecting and Trisecting Angles
The terms angle bisection and angle trisection describe two ways in which you can divide up an angle equally into two (or three) smaller, congruent angles. Their definitions are often used in proofs. [more…]
Geometry Formulas You Should Know
Below are several of the most important geometry formulas, theorems, properties, and so on that you use for solving various problems. If you get stumped while working on a problem and can’t come up with [more…]
Advertisement
Sign Up for RSS Feeds
Education & Languages
Win $500. Easy. Enter to win now.
Inside Dummies.com
Dummies.com Sweepstakes
Win $500. Easy. Enter to win now! | {
"url": "http://www.dummies.com/how-to/education-languages/math/Geometry/Basics.html",
"source_domain": "www.dummies.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "47688",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FVAVI5BVVCLLO4UKZYGL437ZEDY63JR3",
"WARC-Concurrent-To": "<urn:uuid:14ee6e71-a706-499e-97b6-8827d759e213>",
"WARC-Date": "2013-12-13T14:16:09Z",
"WARC-IP-Address": "208.215.179.139",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5H67HJ3BA42KD3RRYTYMJBZC33Y4B4WY",
"WARC-Record-ID": "<urn:uuid:984eafef-c5fc-4420-861b-e96762f4d35c>",
"WARC-Target-URI": "http://www.dummies.com/how-to/education-languages/math/Geometry/Basics.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:63d9a44a-51e0-4ffb-8a25-b626e824bca7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
14,
32,
45,
67,
77,
103,
125,
137,
156,
176,
190,
214,
229,
230,
246,
247,
255,
268,
269,
295,
296,
506,
507,
559,
560,
731,
732,
755,
756,
966,
967,
989,
990,
1166,
1167,
1190,
1191,
1400,
1401,
1424,
1425,
1641,
1642,
1670,
1671,
1881,
1882,
1911,
1912,
2125,
2126,
2148,
2149,
2356,
2357,
2400,
2401,
2605,
2606,
2639,
2640,
2828,
2829,
2863,
2864,
3084,
3085,
3117,
3118,
3326,
3327,
3361,
3362,
3573,
3574,
3588,
3589,
3611,
3612,
3634,
3668,
3669,
3688,
3689,
3713,
3714
],
"line_end_idx": [
14,
32,
45,
67,
77,
103,
125,
137,
156,
176,
190,
214,
229,
230,
246,
247,
255,
268,
269,
295,
296,
506,
507,
559,
560,
731,
732,
755,
756,
966,
967,
989,
990,
1166,
1167,
1190,
1191,
1400,
1401,
1424,
1425,
1641,
1642,
1670,
1671,
1881,
1882,
1911,
1912,
2125,
2126,
2148,
2149,
2356,
2357,
2400,
2401,
2605,
2606,
2639,
2640,
2828,
2829,
2863,
2864,
3084,
3085,
3117,
3118,
3326,
3327,
3361,
3362,
3573,
3574,
3588,
3589,
3611,
3612,
3634,
3668,
3669,
3688,
3689,
3713,
3714,
3747
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3747,
"ccnet_original_nlines": 86,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3835616409778595,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0027397300582379103,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16438356041908264,
"rps_doc_frac_unique_words": 0.45860928297042847,
"rps_doc_mean_word_length": 4.963576316833496,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.019178079441189766,
"rps_doc_unigram_entropy": 5.156276702880859,
"rps_doc_word_count": 604,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07605069875717163,
"rps_doc_frac_chars_dupe_6grams": 0.05537024885416031,
"rps_doc_frac_chars_dupe_7grams": 0.01534355990588665,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.024016009643673897,
"rps_doc_frac_chars_top_3gram": 0.028018679469823837,
"rps_doc_frac_chars_top_4gram": 0.03602401912212372,
"rps_doc_books_importance": -359.3097839355469,
"rps_doc_books_importance_length_correction": -359.3097839355469,
"rps_doc_openwebtext_importance": -193.29832458496094,
"rps_doc_openwebtext_importance_length_correction": -193.29832458496094,
"rps_doc_wikipedia_importance": -157.0908203125,
"rps_doc_wikipedia_importance_length_correction": -157.0908203125
},
"fasttext": {
"dclm": 0.018891390413045883,
"english": 0.9113515019416809,
"fineweb_edu_approx": 2.891322135925293,
"eai_general_math": 0.8194747567176819,
"eai_open_web_math": 0.3369268774986267,
"eai_web_code": 0.04120659828186035
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "516.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "372.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Elementary and Kindergarten"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
64,456,649,578,987,630 | agile software development
(redirected from Agile Project Management)
agile software development
An umbrella term for a variety of best practices in creating applications and information systems. These methods have proven to be more effective in dealing with changing requirements during the development phase, which always seem to occur. Also called "lean programming," the agile methods emphasize teamwork, customer involvement and, most significantly, the creation of small or partial pieces of the total system that are tested in a user environment. For example, an application with 25 features might be prototyped with only five or six thoroughly completed before adding more, and so on.
The "Agile Manifesto" was created in 2001 by 17 people involved with Scrum, XP and other software development methods, and the Agile Alliance (www.agilealliance.org) was founded to promote the agile philosophy. Contrast with waterfall development. See Scrum, XP and iterative development.
The Agile Manifesto
Following is a summary of the philosophy behind the Manifesto (for details on all twelve of its principles, visit www.agilemanifesto.org). It states that although the items on the right have value, the items on the left (in bold) have more value.
Individuals and interactions over processes and tools.
Working software over comprehensive documentation.
Customer collaboration over contract negotiations.
Responding to change over following a plan.
References in periodicals archive ?
Agile working methods and agile project management enhance speed and efficiency.
Exhibit 2 Steps in the Agile Project Management Process Step Description Completion Define core roles Capabilities Name individuals to matched to role.
Brilliant Agile Project Management, FT Press; 1 edition (January 1, 2016).
The last couple of years have seen an increase in discussions within the IT and management accounting communities comparing traditional (waterfall) project management and agile project management. Since analytics projects are similar to software and IT projects, those working on analytics projects tend to prefer agile project management to the traditional method.
N-Accelerates sophisticated process provides clients with a faster and more accurate response, whilst enabling fee-earners to quickly produce automated documents employing a rapid and iterative development process modelled after the agile project management skillset.
The team is developing and deploying the prototype using Agile project management processes.
Agile project management involves flexibility and continuous project process improvement using a team approach.
It also has new chapters on stakeholder management, agile project management, program management, project governance, and change management, along with revised chapters and some eliminated chapters.
This paper focuses on identifying the approaches and implementation of the Agile project management framework within a distributed working team context and also the reasons why this system philosophy and methodology represents a solution for applications and IT projects design.
* Agile Project Management: A Comprehensive Guide: www.cio.com/ article/3156998/agile-development/ agile-project-management-a-begin ners-guide.html
Due to the growing popularity of Agile project management approaches like Scrum, the implementation of Agile is a natural fit for project management and capstone courses, which are common in computing curricula (e.g., Laplante, 2006; Morien, 2004; Ramakrishnan, 2009).
Roadmunk is a web app that makes it easy to create visual road maps and Gannt charts, while Jira is a feature-rich Agile project management tool built by Atlassian.
Full browser ? | {
"url": "https://encyclopedia2.thefreedictionary.com/Agile+Project+Management",
"source_domain": "encyclopedia2.thefreedictionary.com",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "47932",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RBBURQG2E42APP2XXRDXOOBBEM2M4WZ5",
"WARC-Concurrent-To": "<urn:uuid:19f5a882-fc60-408e-a580-35ac1bf0f3ec>",
"WARC-Date": "2019-11-13T05:11:23Z",
"WARC-IP-Address": "91.204.210.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6ZTSYC5HYMSUEVDDEE5WURQT2Z4WOBP7",
"WARC-Record-ID": "<urn:uuid:70e4901c-da0d-4745-a88e-11f5f6daaa0c>",
"WARC-Target-URI": "https://encyclopedia2.thefreedictionary.com/Agile+Project+Management",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c5806de5-1099-4ffc-902d-4615ba68d0b3>"
},
"warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-215.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,
27,
28,
71,
72,
99,
100,
696,
697,
986,
987,
1007,
1254,
1255,
1310,
1311,
1362,
1363,
1414,
1415,
1459,
1495,
1576,
1728,
1803,
2169,
2437,
2530,
2642,
2841,
3120,
3268,
3537,
3702,
3703
],
"line_end_idx": [
27,
28,
71,
72,
99,
100,
696,
697,
986,
987,
1007,
1254,
1255,
1310,
1311,
1362,
1363,
1414,
1415,
1459,
1495,
1576,
1728,
1803,
2169,
2437,
2530,
2642,
2841,
3120,
3268,
3537,
3702,
3703,
3717
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3717,
"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.2981072664260864,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012618299573659897,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1687697172164917,
"rps_doc_frac_unique_words": 0.52601158618927,
"rps_doc_mean_word_length": 5.944123268127441,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.033730506896973,
"rps_doc_word_count": 519,
"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.08816856145858765,
"rps_doc_frac_chars_top_3gram": 0.09983792901039124,
"rps_doc_frac_chars_top_4gram": 0.024311179295182228,
"rps_doc_books_importance": -287.38623046875,
"rps_doc_books_importance_length_correction": -287.38623046875,
"rps_doc_openwebtext_importance": -193.1561737060547,
"rps_doc_openwebtext_importance_length_correction": -193.1561737060547,
"rps_doc_wikipedia_importance": -139.20611572265625,
"rps_doc_wikipedia_importance_length_correction": -139.20611572265625
},
"fasttext": {
"dclm": 0.030111730098724365,
"english": 0.9042431116104126,
"fineweb_edu_approx": 1.9441195726394653,
"eai_general_math": 0.2356141209602356,
"eai_open_web_math": 0.12595343589782715,
"eai_web_code": 0.21176475286483765
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.403",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,546,099,551,681,855,000 | [[email protected]: Re: [GHC] #1218: Add sortNub and sortNubBy to Data.List]
Bertram Felgenhauer bertram.felgenhauer at googlemail.com
Wed Mar 21 06:48:13 EDT 2007
Duncan Coutts wrote:
> So can anyone break this hypothesis?
>
> nub . sort = map head . group . sort
Just make Eq and Ord instances that are completely unrelated, say
data Foo = Foo Int Int deriving Show
instance Eq Foo where
Foo a _ == Foo b _ = a == b
instance Ord Foo where
Foo _ a `compare` Foo _ b = a `compare` b
example = [Foo 0 1, Foo 0 2, Foo 1 1]
With these instances
nub . sort
does something well-defined; sort only uses `compare` and nub only uses
(==). Note that Data.List.sort actually provides a stable sort. I don't
know if that's specified anywhere, but it's true for both Data.List and
for the Haskell report implementation of sort.
The rule
> nub . sort = map head . group . sort
on the other hand relies on a correspondence between Eq and Ord and
breaks:
> nub . sort $ example
[Foo 0 1,Foo 1 1]
> map head . group . sort $ example
[Foo 0 1,Foo 1 1,Foo 0 2]
More precisely the rule works iff a <= b && b <= c && a == c
implies a == b.
I'm not sure whether mismatching Eq and Ord [*] instances should be a
programmer error, but if so this needs to be stated somewhere. Right
now, Data.List has no such restriction.
Bertram
[*] Ideally, the correspondance should be that
(a == b) == (a <= b && b <= a)
More information about the Libraries mailing list | {
"url": "https://mail.haskell.org/pipermail/libraries/2007-March/007201.html",
"source_domain": "mail.haskell.org",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "4327",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2Q72XV6WWGNMOPXIUHSN2MQ625DGIISY",
"WARC-Concurrent-To": "<urn:uuid:648d166a-f5af-4f2d-a80b-e8ec73bfd640>",
"WARC-Date": "2016-10-25T16:43:07Z",
"WARC-IP-Address": "23.253.242.70",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BNN7EZQBJ3UQRMSNDB7AQMSNTSHE4CDP",
"WARC-Record-ID": "<urn:uuid:89709a24-8f60-4e54-9ce5-bccb789baac9>",
"WARC-Target-URI": "https://mail.haskell.org/pipermail/libraries/2007-March/007201.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:878e7d7b-36f3-4824-9c18-5211839972e4>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-6-4.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-44\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for October 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
75,
76,
134,
163,
164,
165,
186,
225,
228,
269,
270,
336,
337,
378,
379,
405,
441,
442,
469,
519,
520,
562,
563,
584,
585,
600,
601,
673,
745,
817,
864,
865,
874,
875,
916,
917,
985,
993,
994,
1021,
1043,
1083,
1113,
1114,
1176,
1193,
1194,
1264,
1333,
1373,
1374,
1382,
1383,
1430,
1463,
1464,
1465
],
"line_end_idx": [
75,
76,
134,
163,
164,
165,
186,
225,
228,
269,
270,
336,
337,
378,
379,
405,
441,
442,
469,
519,
520,
562,
563,
584,
585,
600,
601,
673,
745,
817,
864,
865,
874,
875,
916,
917,
985,
993,
994,
1021,
1043,
1083,
1113,
1114,
1176,
1193,
1194,
1264,
1333,
1373,
1374,
1382,
1383,
1430,
1463,
1464,
1465,
1514
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1514,
"ccnet_original_nlines": 57,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28611111640930176,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01111111044883728,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3472222089767456,
"rps_doc_frac_unique_words": 0.5378151535987854,
"rps_doc_mean_word_length": 4.315125942230225,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0.0027777799405157566,
"rps_doc_unigram_entropy": 4.493450164794922,
"rps_doc_word_count": 238,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08373904973268509,
"rps_doc_frac_chars_dupe_6grams": 0.08373904973268509,
"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.009737100452184677,
"rps_doc_frac_chars_top_3gram": 0.035053551197052,
"rps_doc_frac_chars_top_4gram": 0.046738069504499435,
"rps_doc_books_importance": -166.55052185058594,
"rps_doc_books_importance_length_correction": -156.56332397460938,
"rps_doc_openwebtext_importance": -126.6613540649414,
"rps_doc_openwebtext_importance_length_correction": -126.6613540649414,
"rps_doc_wikipedia_importance": -85.04745483398438,
"rps_doc_wikipedia_importance_length_correction": -72.54154968261719
},
"fasttext": {
"dclm": 0.3870769143104553,
"english": 0.8049314022064209,
"fineweb_edu_approx": 2.12231183052063,
"eai_general_math": 0.8910760283470154,
"eai_open_web_math": 0.3175812363624573,
"eai_web_code": 0.6107226014137268
}
} | {
"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": "4",
"label": "Analyze"
},
"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": "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": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-7,005,360,481,887,131,000 | www.flickr.com
« Skype Changing Social Networks | Main | Slashdot »
26488 + 40% vs Yesterday
A recent comment on my blog asked why the hype about Skype? "Aside from quality, why is everyone going crazy over Skype. I have used yahoo, netmeeting, and dialpad with success." I've tried them all too. What's inspired me to keep plugging away and digging deeper on Skype is it's base architecture. All the other systems use some form of centralized directory. Centralized directories create control and incur costs. Decentralized directory systems and input systems appear to create new markets. eBay never decided what should be auctioned, only how to auction it. eBay facilitates connectivity between buyer and sellers - flow and thus trade. I suspect if Skype or an open source substitute comes along it too will facilitate connectivity and create new markets around new very low cost voice exchanges.
If nothing else Skype is changing perspective on VoIP. Today I see 26488 users up +40% from the 18869 I saw yesterday about the same time. A good part of my practice has been scenarios for the last few years. While Skype should not be "news" to telecoms, MS or Yahoo for it's potential. I'd like to know how many have really thought it through and if even aware. Then what action and scenarios are they using to challenge their strategic thinking. Will US Telecoms be the next RIAA?
This link below to a comment sums up why it sounds good to me. It also suggests a solution is required for directory security. Can someone track this down and verify one way or the other? True or False?
An interesting editorial, but you might be wrong. My take on Skype is that it is using P2P technologies for the "white pages" portion of the VoIP network, not just in peers communicating directly. Super-peers store portions of these white-pages. Just as super-peers in Kazaa store indexes to music files stored on other peer machines, these super-peers store indexes to the phone numbers of other peers. They aren't clear if they are using this approach, but it's my take when they say "the network works just like Kazaa". This is also an unsecure approach, which is probably why they aren't publicizing it in detail. These super-peers could "lie" and reroute calls to the wrong peer, just as super-peers in Kazaa can "lie" about what music files are stored where. When you tell the system to find the phone number for 510-938-2222, it probably actually initiates a "search" on the network of super-peers to resolve to the actual peer that has this number, just as it would "search" for madonna.mp3.
This is an important approach, by the way, because if we don't need to maintain massive white pages servers then we can significantly reduce the capital needed to build such a network. In fact, we can reduce it down to such a marginal cost that businesses aren't needed to build these networks at all. The network, including the white pages, self-organizes out of the peers themselves. This network can then be used to build VoIP apps, virtual hard-drives, etc. I have been working on an open-source project named P2P Sockets that is attempting to achieve this; check it out at p2psockets.jxta.org. One significant issue that needs to be solved before this approach is tenable is that these white pages need to be secure even though they are also decentralized and human-friendly.
Comment at Rebels Without Cause
I really enjoyed this post from Jibbering Musings below. He's right. Skype is not a IM replacement. My words were probably sloppy earlier. However I remain convinced that it is a threat to the MSN AIM etc systems as all of them provide and have that centralized server. Some of the other points he makes... just reinforces to me the business opportunities that will emerge from a winner in the decentralized VoIP space. I think voice is also a bigger motivation for adoption than text. This voice solution may lead more people to trying IM.
I don't agree, Skype is a one at a time (currently one to one) communication mechanism. You can only talk to one person at a time, and whilst you're in that conversation you're out of communication with everyone else, even if they develop an answerphone system, you'll still have to listen to each message. Speech is a very slow medium of communication, and it requires full attention. You can't talk on skype whilst in your office, or in the middle of cooking a meal, or doing any other task that takes you away from your computer momentarily. (I have a bluetooth headset which solves some of the problems - but popping to the toilet, or to the door, or somewhere out of bluetooth range is still impossible)
refer Jibbering Musings.for more
More Skype enthusiasm:
CNet. State regulators attempt to control VoIP phone services (Vonage). Here is a more informative bit of analysis from Jeff Pulver. LOL. Let them try that with Skype. [refer J Robb]
Hope my Skype Blog Button left now works
So, you can Skype me TDavid of www.makeyougohmm.com answers my request for a Skype me link. Heres his explanation and the HTML tag and heres my Skype me link. Youll need to download and install Skype. On the this looks like a viral winner... [refer Ratcliffe]
Recent Comments
My Furl
Archives
Creative Commons License
This weblog is licensed under a Creative Commons License.
Powered by
Movable Type 3.32 | {
"url": "http://www.henshall.com/blog/archives/000378.html",
"source_domain": "www.henshall.com",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "36447",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:62H535ORK6OL6TXQFIMESR4MEOCI7NDZ",
"WARC-Concurrent-To": "<urn:uuid:cccec467-a5b8-4d3c-8e93-c2399c7bd5cb>",
"WARC-Date": "2018-12-11T16:44:03Z",
"WARC-IP-Address": "72.34.35.43",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:NIJ67NGYV6LTFEJLLQYWAZPHSXPOA345",
"WARC-Record-ID": "<urn:uuid:f38a0cc1-64d4-497f-ab50-ed16ab47744a>",
"WARC-Target-URI": "http://www.henshall.com/blog/archives/000378.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:27dd7666-69c0-4ece-bdd1-a3ce85738ab6>"
},
"warc_info": "isPartOf: CC-MAIN-2018-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-179-113-199.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,
15,
16,
69,
70,
95,
96,
903,
904,
1387,
1388,
1591,
1592,
1593,
2593,
2594,
3375,
3407,
3408,
3409,
3950,
3951,
4660,
4693,
4694,
4717,
4718,
4906,
4907,
4948,
4949,
5209,
5210,
5226,
5227,
5235,
5236,
5245,
5246,
5271,
5329,
5340
],
"line_end_idx": [
15,
16,
69,
70,
95,
96,
903,
904,
1387,
1388,
1591,
1592,
1593,
2593,
2594,
3375,
3407,
3408,
3409,
3950,
3951,
4660,
4693,
4694,
4717,
4718,
4906,
4907,
4948,
4949,
5209,
5210,
5226,
5227,
5235,
5236,
5245,
5246,
5271,
5329,
5340,
5357
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5357,
"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.4310189485549927,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023444540798664093,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1550946831703186,
"rps_doc_frac_unique_words": 0.4676179885864258,
"rps_doc_mean_word_length": 4.6663007736206055,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0.0018034300301223993,
"rps_doc_unigram_entropy": 5.546231746673584,
"rps_doc_word_count": 911,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.010820980183780193,
"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.007057160139083862,
"rps_doc_frac_chars_top_3gram": 0.004234299995005131,
"rps_doc_frac_chars_top_4gram": 0.008468599990010262,
"rps_doc_books_importance": -419.6917724609375,
"rps_doc_books_importance_length_correction": -419.6917724609375,
"rps_doc_openwebtext_importance": -275.3443603515625,
"rps_doc_openwebtext_importance_length_correction": -275.3443603515625,
"rps_doc_wikipedia_importance": -276.3189392089844,
"rps_doc_wikipedia_importance_length_correction": -276.3189392089844
},
"fasttext": {
"dclm": 0.11703736335039139,
"english": 0.9480710029602051,
"fineweb_edu_approx": 1.956055760383606,
"eai_general_math": 0.43163633346557617,
"eai_open_web_math": 0.2740902900695801,
"eai_web_code": 0.09644203633069992
}
} | {
"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": "384.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Commerce and Communication and traffic",
"level_3": "Telecommunication"
}
}
},
"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": "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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
3,204,485,090,224,973,000 |
Resources Contact Us Home
Browse by: INVENTOR PATENT HOLDER PATENT NUMBER DATE
Generating one or more block addresses based on an identifier of a hierarchical data structure
7185020 Generating one or more block addresses based on an identifier of a hierarchical data structure
Patent Drawings:Drawing: 7185020-2 Drawing: 7185020-3 Drawing: 7185020-4
« 1 »
(3 images)
Inventor: Bhatti
Date Issued: February 27, 2007
Application: 10/676,220
Filed: October 1, 2003
Inventors: Bhatti; Shahzad H. (Boise, ID)
Assignee: Hewlett-Packard Development Company, L.P. (Houston, TX)
Primary Examiner: Kim; Hong
Assistant Examiner:
Attorney Or Agent:
U.S. Class: 707/103R; 711/170; 711/206
Field Of Search: 707/205; 707/103R; 707/509; 711/170; 711/206
International Class: G06F 17/00; G06F 7/00
U.S Patent Documents: 6098190; 6212097; 6449607; 6502108; 6532335; 2002/0077803
Foreign Patent Documents: 1 265 152; 05020154
Other References: The Norton Utilities Version 5.0 Disk Explorer, The Peter Norton Computing, Inc., 1990, pp. 28-54. cited by examiner.
Abstract: A storage system includes a storage medium containing blocks identified by block addresses. The storage medium stores hierarchical data structures, each hierarchical data structure containing plural levels of data objects. Each hierarchical data structure is stored in a respective group of blocks. In response to a request containing an identifier of at least one of the hierarchical data structures, a controller generates one or more block addresses based on the identifier. The controller accesses one or more blocks indicated by the one or more block addresses.
Claim: What is claimed is:
1. A storage system comprising: a storage medium containing blocks identified by block addresses, the storage medium to store data in hierarchical data structures, eachhierarchical data structure containing plural levels of data objects, and each hierarchical data structure stored in a respective group of the blocks; a storage location to store a table having plural entries, each of the plural entries mapping acorresponding identifier of a hierarchical data structure to a respective range of block addresses; and a controller to: in response to a request containing an identifier of at least one of the hierarchical data structures, generate one or more blockaddresses based on the identifier in the request by accessing the table; and access one or more blocks indicated by the one or more block addresses.
2. The storage system of claim 1, wherein each hierarchical data structure includes at least one leaf object, a root object, and at least one intermediate object coupled between the leaf object and the root object.
3. The storage system of claim 1, wherein the storage location is part of the controller.
4. The storage system of claim 1, wherein the storage location is part of the storage medium.
5. The storage system of claim 1, wherein the request comprises one of a read and write request.
6. The storage system of claim 1, wherein the request comprises another identifier to identify one of the data objects in the hierarchical data structure.
7. The storage system of claim 6, wherein the request comprises one or plural pointers to point to one or more locations within the data object identified by the another identifier.
8. The storage system of claim 1, wherein each hierarchical data structure comprises data objects sharing a common characteristic.
9. The storage system of claim 8, wherein each hierarchical data structure comprises a root data object and additional data objects at lower levels of the hierarchical data object.
10. The storage system of claim 1, wherein at least one of the data objects is associated with a function invocable by the request to perform a predefined task.
11. The storage system of claim 10, wherein at least one of the data objects is associated with an attribute accessible by the request.
12. The storage system of claim 1, wherein at least some of the data objects are associated with respective functions invocable by one or more requests to perform predefined tasks.
13. The storage system of claim 12, wherein the at least some of the data objects are associated with attributes defining characteristics of respective data objects.
14. A method of accessing data, comprising: storing, by a storage system, data in hierarchical data structures, each hierarchical data structure containing plural levels of data objects; storing a table of identifiers mapped to correspondingranges of block addresses in the storage system; receiving, at the storage system from a host system, a request containing an identifier of one of the hierarchical data structures; and converting, based on accessing the table by the storage system, theidentifier in the request to one or more block addresses to specify corresponding blocks in a storage medium, wherein receiving the request comprises receiving the request in which the identifier is not translated by the host system.
15. The method of claim 14, wherein receiving the request comprises receiving the request that further includes another identifier to identify one of the data objects in the one hierarchical data structure.
16. An article comprising at least one computer-readable storage medium containing instructions that when executed by a processor cause a storage system to: store data in hierarchical data structures, each hierarchical data structure containingplural levels of data objects, and each hierarchical data structure stored in a respective group of blocks of a storage medium in the storage system; store a table of identifiers mapped to corresponding ranges of block addresses in the storage system; receive, from a host system, a request containing an identifier of one of the hierarchical data structures, wherein the identifier in the request is not translated by the host system; and convert, by accessing the table, the identifier in the request toone or more block addresses to specify corresponding blocks in the storage medium of the storage system.
17. The article claim 16, wherein the instructions when executed cause the storage system to further store functions associated with data objects of the hierarchical data structure, each function to perform a predefined task on a respectivedata object.
18. The article of claim 17, wherein the instructions when executed cause the storage system to further: receive a second request; and invoke at least one function associated with at least one of the data objects in response to the secondrequest.
19. The article of claim 18, wherein the instructions when executed cause the storage system to further: store attributes associated with the data objects; receive a third request; and access attributes associated with at least one of thedata objects in response to the third request.
20. The article of claim 16, wherein receiving the request comprises receiving a request containing a second identifier to identify one of the data objects in the one hierarchical data structure.
Description: BACKGROUND
In modern computer systems, storage devices are used to store data and program instructions. Examples of storage devices include integrated circuit (IC) storage devices (such as dynamic or static random access memories, flash memories, andelectrically erasable and programmable read-only memories), hard disk drives, floppy disk drives, optical drives, and other types of storage devices.
The storage medium of certain types of storage devices are partitioned into predefined blocks for storing data. Such storage devices are referred to as "blocked storage devices." In one example, the blocks of a disk-based storage device includesectors. The blocks of a storage medium are addressed by physical block addresses, which are usually mapped to logical block addresses for use in a host computer. In response to a request (read or write) from an application program, the file system ina host computer generates commands (read or write commands) containing logical block addresses. The read or write commands are sent by the file system through a storage device adapter in the host computer to a device controller in the storage device. The device controller performs the appropriate conversion of the logical block addresses to physical block addresses, which are then used to access corresponding blocks in the storage device.
Most files generated by a host computer system are too large to be stored within a single block of a storage device. Examples of such files include files containing formatted documents, files containing audio data, files containing video data,files containing multimedia data, and so forth. Large files are fragmented for storing in multiple blocks in the blocked storage device. Once fragmented into blocks, the characteristic of the original file (formatted document file, video file, audiofile, and so forth) is lost. From the perspective of the storage device, each block of data is just a collection of bits, with the storage device unable to recognize whether such bits are part of a formatted document file, video file, audio file, orothers. Such an arrangement reduces the features and flexibility of conventional storage devices.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of an example arrangement of a computer system.
FIGS. 2 and 3 are schematic diagrams of object-based hierarchical data structures, according to some embodiments.
FIGS. 4 and 5 illustrate write and read commands, respectively, according to some embodiments of the invention for accessing (writing or reading) the object-based hierarchical data structures of FIGS. 2 and 3.
DETAILED DESCRIPTION
FIG. 1 illustrates an example computer system that includes a host system 100 and a storage system 102. The host system 100 includes an application client 104 (as well as other software modules, not shown) that are executable on a centralprocessing unit (CPU) 116. The CPU 116 is coupled to a memory 118 and peripheral devices 120.
The storage system 102 can be part of the host system 100, or the storage system 102 can be attached or coupled to the host system 100 through a link (e.g., a port, network, and so forth). The application client 104 in the host system 100accesses the storage system 102 through an object-based interface 106, which includes several layers of components. The number of layers of components of the object-based interface 106 is less than the number of layers found in conventional interfacesto storage systems. Conventional interfaces typically include the following layers: file system, device driver, port adapter, and device controller. A request (generated by an application program in a host system) for data in a storage system has to beprocessed by each of the layers of such conventional interface, which typically translate addresses from one format to another (e.g., translation of file identifiers to logical block addresses, and translation of logical block addresses to physical blockaddresses). Such processing of access requests is costly in terms of consumed system resources and increased processing time.
In accordance with some embodiments of the invention, the object-based interface 106 employs a smaller number of layers of components, which perform less processing of access requests for data in the storage system 102. The object-basedinterface 106 allows the application client 104 to send object-based requests (read requests, write requests, and other requests) to a device controller 108 in the storage system 102. Each object-based request causes the device controller to perform anaccess of data objects stored in the storage system 102. The arrangement of FIG. 1 depicts a client-server model, in which requests from the application client 104 are processed by a device server 109 in the device controller 108.
The storage system 102 recognizes data at the object level so that the object-based requests from the application client 104 do not have to be converted by the host system 100 to read or write commands that specify block addresses for identifyingblocks of the storage system 102. As a result, the processing of access requests in the host system 100 is reduced to enhance host system computation efficiency.
The object-based data structure employed by the storage system 102 for storing data is a hierarchical data structure that has multiple levels of data objects. The data objects of each hierarchical data structure (also referred to as an "objecthierarchy") are related by some common characteristic (e.g., formatted document data, music data, video data, and so forth). Multiple object hierarchies 116 are stored in the storage medium 110 to represent different groups of data. Each data object ofan object hierarchy 116 represents one of a directory, a file, or other data structure. As shown in FIG. 1, plural object hierarchies 116 are stored in a storage medium 110 of the storage system 102. As used here, the term "storage medium" refers toone or plural storage elements, such as integrated circuit storage devices, disk-based magnetic or optical storage devices, and others. The storage medium 110 is partitioned into blocks that are identified by logical block addresses. Each objecthierarchy 116 is stored in a respective set of blocks.
To access an object hierarchy, an object-based request specifies a unique object-hierarchy identifier (OHID) that is associated with the object hierarchy 116. The OHID included in the object-based request is not translated by the object-basedinterface 106 in the host system 100 to block addresses associated with blocks of the storage medium 110. Instead, the translation between OHID and block addresses is performed by the device server 109 in the device controller 108. The device server109 can be firmware or software executable on a processing core of the device controller 108. The processing core can be in the form of a microcontroller, processor, and so forth.
The device controller 108 also includes a memory 112 that stores an OHID-LBA (logical block address) table 114. The OHID-LBA table 114 is a conversion table to enable translation between an OHID and a range (or other group) of logical blockaddresses corresponding to the OHID. In the example shown in FIG. 1, the first row of the table 114 includes an OHID having value ID0, which is associated with a range of logical block addresses that identify the blocks containing the object hierarchyidentified by ID0. Similarly, the second row of the table 114 contains an OHID of value ID1, which is associated with another range of logical block addresses to represent the storage locations in the storage medium 110 that contain the object hierarchyidentified by ID1. In other embodiments, OHIDs are translated to physical block addresses instead of logical block addresses. More generally, OHIDs are translated to some group of one or more addresses to identify blocks of the storage medium 110.
In one implementation, the memory 112 for storing the OHID-LBA table 114 is part of the device controller 108. The memory 112 can be a non-volatile memory (such as flash memory or electrically erasable and programmable read-only memory), dynamicmemory (such as dynamic random access random memory, static random access memory, and so forth), or any other type of storage device. Alternatively, the memory 112 can be a predefined region of the storage medium 110 that is separate from the devicecontroller 108.
The object-based interface 106 according to one implementation includes an operating system and a host adapter to enable communication between software modules (e.g., the application client 104) in the host system 100 and the device controller108 in the storage system 102. Alternatively, the device controller 108 can be part of the host system 100 such that the host adapter can be omitted. By performing the OHID-to-logical block address (and vice versa) translation at the device controller108, host system resources such as the CPU 116 do not have to be allocated to perform storage access processing. Another benefit offered by storing data in the object hierarchies is that characteristics of data stored in the storage system 102 aremaintained. For example, the storage system 102 is aware of the type of data contained in each object hierarchy 116, such as whether the object hierarchy 116 contains music data, video data, formatted document data, or other type of data.
In addition, attributes and functions can be associated with each object hierarchy 116 as well as with each data object in the object hierarchy. Attributes include information that describes features associated with a data object in the objecthierarchy 116. For example, if a data object contains a music file, the attributes associated with data object can identify the author of the music file, the date the music file was released, and other information that may be of interest. Functionsinclude any executable software routines or modules that are invocable (can be invoked) to perform specific tasks in response to a data access. For example, if a given data object contains a movie file, then the associated functions may include aroutine to play the movie, a routine to rewind the movie, and a routine to fast forward the movie. The functions are invoked to perform the desired tasks. By associating attributes and functions with each data object, flexibility in the storage,access, and manipulation of data is enhanced.
FIG. 2 shows an example object hierarchy 116 that can be stored in the storage 110 of FIG. 1. The object hierarchy 116 includes a root data object 200, which is associated with an OHID. The OHID contained in an access request from theapplication client 104 refers to the root data object 200 of the object hierarchy 116. The root data object 200 is at the highest level of the object hierarchy 116. The object hierarchy 116 can further include one or plural additional levels of dataobjects. The object hierarchy in the example shown in FIG. 2 includes three additional levels of data objects. The data objects to which lower level data objects are not attached are referred to as leaf data objects 202. Leaf data objects 202 arecoupled by intermediate data objects 204 to the root data object 200. As shown in the example of FIG. 2, attributes and functions are also associated with at least some of the data objects 200, 202, and 204.
FIG. 3 shows a more specific example of an object hierarchy 116A, which contains a root data object 210 that indicates that the data stored in the object hierarchy 116A is music data. The object hierarchy 116A includes the following intermediatedata objects: data object 212 to indicate storage of blues music, data object 214 to indicate storage of jazz music, and data object 216 to indicate storage of a rock music. The intermediate data objects 212, 214, and 216 are analogous to directories. The leaf data objects 220 in the object hierarchy 116A contain the actual music files associated with each category of music (blues, jazz, and rock). In addition, another intermediate data object 218 is present in the object hierarchy 116A. The dataobject 218 is connected below the blues data object 212. The data object 218 represents an album that is associated with a particular artist. Coupled to the album data object 218 are leaf data objects 222 containing the music files of that particularalbum.
FIGS. 4 and 5 illustrate example formats of a write request 300 and a read request 350, respectively, that are used for accessing object hierarchies 116 stored in the storage system 102. The specific formats of the write and read requests areprovided as examples. In other implementations, the write and read requests have other formats.
The write request 300 includes multiple bytes of information, including an operation code (having hexadecimal value 00 or some other predetermined value to indicate a write). A variable indicator 304 indicates that the length of the writerequest is variable. An OHID field 306 contains the object hierarchy identifier of the object hierarchy that is to be accessed by the write request to perform the write. A sub-hierarchy identifier (SOHID) 308 more specifically identifies a data objectin the object hierarchy 116. The SOHID 308 identifies one of the data objects in the object hierarchy 116. More than one SOHID can be specified in the write request.
In one embodiment, the object hierarchy 116 has a fixed hierarchy, where the depth (number of levels) and breadth (number of data objects at each level) are fixed. With a fixed hierarchy, a matrix can be used to identify selected data objects inthe hierarchy. Each location in the matrix (which is the SOHID) corresponds to a specific data object. Selection of a data object is performed by setting the value of the matrix location to a given value (such as a binary "1" value).
In another implementation, the object hierarchy 116 is a dynamic hierarchy, where the depth and breadth are not predefined but rather can vary. With the dynamic hierarchy, a linked list of SOHIDs is used to identify corresponding data objects. In response to receiving a write request containing an OHID and an SOHID, the device server 109 (FIG. 1) traverses the linked list corresponding to the OHID to find the specified SOHID and the data object corresponding to the SOHID.
The write request 300 also includes a most significant byte (MSB) hierarchy pointer 310 and a least significant byte (LSB) hierarchy pointer 312. The hierarchy pointers are effectively offsets to point to the particular portion within a dataobject to which the write is to be performed. The write request 300 also includes fields 314 to access attributes and functions associated with the data objects. The remaining fields of the write request 300 include the data to be written to theportion pointed to by the MSB hierarchy pointer 310 and the LSB hierarchy pointer 312.
The read request 350 shown in FIG. 5 includes an operation code 352, which in this case has the hexadecimal value 01, or some other predefined value, to indicate a read. A variable indicator 354 indicates that the read request 350 has a variablelength, and an OHID field 356 indicates the object hierarchy targeted by the read request.
The read request 350 also includes a field 358 containing one or plural sub-hierarchy identifier(s) to identify the data object(s) to read from in the target object hierarchy. The MSB and LSB hierarchy pointers in fields 360 and 362,respectively, specify the pointer(s) of portions of the selected data object(s) that are to be retrieved. Optionally, an entire data object may be retrieved (instead of just a portion of the data object), in which case the MSB and LSB hierarchy pointercan be omitted. The read request also includes fields 364 to enable access of attributes and functions associated with the data objects of an object hierarchy.
In addition to the write request and read request referred to above, other requests can also be issued by the application client 104 (FIG. 1). One such other request is an inquiry request that is submitted to the device server 109 to retrievepredetermined information associated with each object hierarchy. For example, the inquiry request can cause retrieval of the sub-hierarchy identifier information, such as the matrix and linked list referred to above.
As noted above, the device server 109 (FIG. 1) can be implemented in firmware or software, or the combination of firmware and software. The software or firmware is executed on a control unit or processor in the storage system 102 (FIG. 1). Thecontrol unit or processor includes a microprocessor, microcontroller, processor module or subsystem (including one or more microprocessors or microcontrollers), or other control or computing devices. As used here, a "controller" refers to hardware,firmware, software, or a combination thereof. A "controller" can refer to a single component or to plural components (whether software, firmware, or hardware).
Data and instructions (of the software or firnware) are stored on one or more machine-readable storage media. The storage media include different forms of memory including semiconductor memory devices such as dynamic or static random accessmemories (DRAMs or SRAMs), erasable and programmable read-only memories (EPROMs), electrically erasable and programmable read-only memories (EEPROMs) and flash memories; magnetic disks such as fixed, floppy and removable disks; other magnetic mediaincluding tape; and optical media such as compact disks (CDs) or digital video disks (DVDs).
In the foregoing description, numerous details are set forth to provide an understanding of the present invention. However, it will be understood by those skilled in the art that the present invention may be practiced without these details. While the invention has been disclosed with respect to a limited number of embodiments, those skilled in the art will appreciate numerous modifications and variations therefrom. It is intended that the appended claims cover such modifications andvariations as fall within the true spirit and scope of the invention.
* * * * *
Recently Added Patents
Address generation unit for accessing a multi-dimensional data structure in a desired pattern
3D IC method and device
Magnetic detection of small entities
Non-volatile memory array and device using erase markers
Cover opening and closing unit and image forming apparatus including the same
Power-on reset circuit
Preamplifier-to-channel communication in a storage device
Randomly Featured Patents
Electromagnetic heating devices, particularly for ram air turbines
Mobile communication system and operation control method thereof
Method and apparatus for providing peer authentication for a transport layer session
Catheter with integral anchoring means
Method and device for determining and dampening juddering vibrations of a drivetrain
Bedside piece of furniture
Apparatus and methods for adjustably supporting probes
Controller
Screw
Bacterial eliminator
| {
"url": "http://www.patentgenius.com/patent/7185020.html",
"source_domain": "www.patentgenius.com",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "42346",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5Y52PLCXVIFOXVWQ6OR3AWTU2NNXBAL7",
"WARC-Concurrent-To": "<urn:uuid:ce33237a-81e8-4534-a1c9-85f835c7aa9e>",
"WARC-Date": "2015-05-29T06:33:21Z",
"WARC-IP-Address": "76.76.19.57",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:3XQVPFQL3REMNPHQYRSTPXKOGYFIIUFG",
"WARC-Record-ID": "<urn:uuid:049b5070-59c8-43c5-ba0f-94a8556aaf41>",
"WARC-Target-URI": "http://www.patentgenius.com/patent/7185020.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3ffa2b56-06a0-4db9-a53b-e035ff92efca>"
},
"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,
2,
4,
30,
83,
85,
87,
182,
285,
368,
374,
375,
386,
387,
404,
435,
459,
482,
524,
590,
618,
638,
657,
696,
758,
801,
881,
927,
1063,
1064,
1065,
1066,
1067,
1068,
1069,
1070,
1071,
1072,
1649,
1676,
1677,
2490,
2491,
2706,
2707,
2797,
2798,
2892,
2893,
2990,
2991,
3146,
3147,
3329,
3330,
3461,
3462,
3643,
3644,
3805,
3806,
3942,
3943,
4124,
4125,
4291,
4292,
5019,
5020,
5227,
5228,
6082,
6083,
6336,
6337,
6584,
6585,
6870,
6871,
7067,
7091,
7092,
7481,
7482,
8420,
8421,
9260,
9261,
9295,
9296,
9370,
9371,
9485,
9486,
9696,
9697,
9718,
9719,
10051,
10052,
11173,
11174,
11893,
11894,
12302,
12303,
13347,
13348,
14019,
14020,
15012,
15013,
15523,
15524,
16504,
16505,
17533,
17534,
18471,
18472,
19475,
19476,
19814,
19815,
20470,
20471,
20950,
20951,
21428,
21429,
22002,
22003,
22339,
22340,
22985,
22986,
23445,
23446,
24097,
24098,
24679,
24680,
25237,
25238,
25248,
25250,
25252,
25277,
25371,
25395,
25432,
25489,
25567,
25590,
25648,
25676,
25743,
25808,
25893,
25932,
26017,
26044,
26099,
26110,
26116,
26137
],
"line_end_idx": [
2,
4,
30,
83,
85,
87,
182,
285,
368,
374,
375,
386,
387,
404,
435,
459,
482,
524,
590,
618,
638,
657,
696,
758,
801,
881,
927,
1063,
1064,
1065,
1066,
1067,
1068,
1069,
1070,
1071,
1072,
1649,
1676,
1677,
2490,
2491,
2706,
2707,
2797,
2798,
2892,
2893,
2990,
2991,
3146,
3147,
3329,
3330,
3461,
3462,
3643,
3644,
3805,
3806,
3942,
3943,
4124,
4125,
4291,
4292,
5019,
5020,
5227,
5228,
6082,
6083,
6336,
6337,
6584,
6585,
6870,
6871,
7067,
7091,
7092,
7481,
7482,
8420,
8421,
9260,
9261,
9295,
9296,
9370,
9371,
9485,
9486,
9696,
9697,
9718,
9719,
10051,
10052,
11173,
11174,
11893,
11894,
12302,
12303,
13347,
13348,
14019,
14020,
15012,
15013,
15523,
15524,
16504,
16505,
17533,
17534,
18471,
18472,
19475,
19476,
19814,
19815,
20470,
20471,
20950,
20951,
21428,
21429,
22002,
22003,
22339,
22340,
22985,
22986,
23445,
23446,
24097,
24098,
24679,
24680,
25237,
25238,
25248,
25250,
25252,
25277,
25371,
25395,
25432,
25489,
25567,
25590,
25648,
25676,
25743,
25808,
25893,
25932,
26017,
26044,
26099,
26110,
26116,
26137,
26138
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 26138,
"ccnet_original_nlines": 165,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34896811842918396,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02168021909892559,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18198874592781067,
"rps_doc_frac_unique_words": 0.18573515117168427,
"rps_doc_mean_word_length": 5.183787822723389,
"rps_doc_num_sentences": 208,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.34500789642334,
"rps_doc_word_count": 4108,
"rps_doc_frac_chars_dupe_10grams": 0.09410659968852997,
"rps_doc_frac_chars_dupe_5grams": 0.2741488516330719,
"rps_doc_frac_chars_dupe_6grams": 0.19314393401145935,
"rps_doc_frac_chars_dupe_7grams": 0.14980041980743408,
"rps_doc_frac_chars_dupe_8grams": 0.12571026384830475,
"rps_doc_frac_chars_dupe_9grams": 0.1084761694073677,
"rps_doc_frac_chars_top_2gram": 0.026297250762581825,
"rps_doc_frac_chars_top_3gram": 0.02704860083758831,
"rps_doc_frac_chars_top_4gram": 0.013383420184254646,
"rps_doc_books_importance": -2268.217529296875,
"rps_doc_books_importance_length_correction": -2268.217529296875,
"rps_doc_openwebtext_importance": -1453.4443359375,
"rps_doc_openwebtext_importance_length_correction": -1453.4443359375,
"rps_doc_wikipedia_importance": -1250.941650390625,
"rps_doc_wikipedia_importance_length_correction": -1250.941650390625
},
"fasttext": {
"dclm": 0.2741122841835022,
"english": 0.8780982494354248,
"fineweb_edu_approx": 3.0905086994171143,
"eai_general_math": 0.3423590064048767,
"eai_open_web_math": 0.03664267063140869,
"eai_web_code": 0.4768522381782532
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.62",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "11",
"label": "Legal/Regulatory"
},
"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": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
8,679,382,421,447,582,000 | (* Help emacs fontification -*-caml-*- *) let irrefl s ord = forall (x IN s). not ((x,x) IN ord) let trans s ord = forall (x IN s) (y IN s) (z IN s). (((x,y) IN ord) && ((y,z) IN ord)) --> ((x,z) IN ord) (*val cross : forall 'a. 'a set -> 'a set -> ('a * 'a) set*) let cross S T = { (s,t) | forall (s IN S) (t IN T) | true} indreln {isabelle} forall r x y. r (x, y) ==> tc' r (x, y) and forall r x y. (exist z. tc' r (x,z) && tc' r (z,y)) ==> tc' r (x,y) val tc : forall 'a. ('a * 'a) set -> ('a * 'a) set let {isabelle} tc r = let r' = fun (x,y) -> ((x,y) IN r) in { (x,y) | forall ((x,y) IN r) | tc' r' (x,y) } let rec {ocaml} tc r = let one_step = { (x,z) | forall ((x,y) IN r) ((y',z) IN r) | y = y' } in if one_step subset r then r else tc (one_step union r) sub [hol] tc = tc let restrict_relation_set rel s = (rel) inter (cross s s) let strict_preorder s ord = irrefl s (ord) && trans s (ord) let relation_over s rel = forall ((a,b) IN rel). a IN s && b IN s (*domain rel s subset s && range rel subset s*) let inj_on f A = (forall (x IN A). (forall (y IN A). (f x = f y) --> (x = y))) let total_order_over s ord = relation_over s ord && (forall (x IN s) (y IN s). (x,y) IN ord || (y,x) IN ord || (x = y)) let strict_total_order_over s ord = strict_preorder s ord && total_order_over s ord let adjacent_less_than ord s x y = (x,y) IN ord && not (exist (z IN s). (x,z) IN ord && (z,y) IN ord) let adjacent_less_than_such_that pred ord s x y = pred x && (x,y) IN ord && not (exist (z IN s). pred z && (x,z) IN ord && (z,y) IN ord) (*************************************************** *) (*************************************************** *) type action_id = num type thread_id = num type location = num type value = num type memory_order = Mo_seq_cst | Mo_relaxed | Mo_release | Mo_acquire | Mo_consume | Mo_acq_rel type action = | Lock of action_id * thread_id * location | Unlock of action_id * thread_id * location | Atomic_load of action_id * thread_id * memory_order * location * value | Atomic_store of action_id * thread_id * memory_order * location * value | Atomic_rmw of action_id * thread_id * memory_order * location * value * value | Load of action_id * thread_id * location * value | Store of action_id * thread_id * location * value | Fence of action_id * thread_id * memory_order let action_id_of a = match a with | Lock aid _ _ -> aid | Unlock aid _ _ -> aid | Atomic_load aid _ _ _ _ -> aid | Atomic_store aid _ _ _ _ -> aid | Atomic_rmw aid _ _ _ _ _ -> aid | Load aid _ _ _ -> aid | Store aid _ _ _ -> aid | Fence aid _ _ -> aid end let thread_id_of a = match a with Lock _ tid _ -> tid | Unlock _ tid _ -> tid | Atomic_load _ tid _ _ _ -> tid | Atomic_store _ tid _ _ _ -> tid | Atomic_rmw _ tid _ _ _ _ -> tid | Load _ tid _ _ -> tid | Store _ tid _ _ -> tid | Fence _ tid _ -> tid end let memory_order_of a = match a with Atomic_load _ _ mo _ _ -> Some mo | Atomic_store _ _ mo _ _ -> Some mo | Atomic_rmw _ _ mo _ _ _ -> Some mo | Fence _ _ mo -> Some mo | _ -> None end let location_of a = match a with Lock _ _ l -> Some l | Unlock _ _ l -> Some l | Atomic_load _ _ _ l _ -> Some l | Atomic_store _ _ _ l _ -> Some l | Atomic_rmw _ _ _ l _ _ -> Some l | Load _ _ l _ -> Some l | Store _ _ l _ -> Some l | Fence _ _ _ -> None end let value_read_by a = match a with Atomic_load _ _ _ _ v -> Some v | Atomic_rmw _ _ _ _ v _ -> Some v | Load _ _ _ v -> Some v | _ -> None end let value_written_by a = match a with Atomic_store _ _ _ _ v -> Some v | Atomic_rmw _ _ _ _ _ v -> Some v | Store _ _ _ v -> Some v | _ -> None end let is_lock a = match a with Lock _ _ _ -> true | _ -> false end let is_unlock a = match a with Unlock _ _ _ -> true | _ -> false end let is_atomic_load a = match a with Atomic_load _ _ _ _ _ -> true | _ -> false end let is_atomic_store a = match a with Atomic_store _ _ _ _ _ -> true | _ -> false end let is_atomic_rmw a = match a with Atomic_rmw _ _ _ _ _ _ -> true | _ -> false end let is_load a = match a with Load _ _ _ _ -> true | _ -> false end let is_store a = match a with Store _ _ _ _ -> true | _ -> false end let is_fence a = match a with Fence _ _ _ -> true | _ -> false end (**************************************** *) let is_lock_or_unlock a = is_lock a || is_unlock a let is_atomic_action a = is_atomic_load a || is_atomic_store a || is_atomic_rmw a let is_load_or_store a = is_load a || is_store a let is_read a = is_load a || is_atomic_load a || is_atomic_rmw a let is_write a = is_store a || is_atomic_store a || is_atomic_rmw a let is_acquire a = match memory_order_of a with Some Mo_acquire -> is_read a || is_fence a | Some Mo_acq_rel -> is_read a || is_fence a | Some Mo_seq_cst -> is_read a || is_fence a | Some Mo_consume -> is_fence a | None -> is_lock a | _ -> false end let is_consume a = is_read a && (memory_order_of a = Some Mo_consume) let is_release a = match memory_order_of a with Some Mo_release -> is_write a || is_fence a | Some Mo_acq_rel -> is_write a || is_fence a | Some Mo_seq_cst -> is_write a || is_fence a | None -> is_unlock a | _ -> false end let is_seq_cst a = (memory_order_of a = Some Mo_seq_cst) (**************************************** *) type location_kind = Mutex | Non_atomic | Atomic let actions_respect_location_kinds actions lk = forall (a IN actions). match location_of a with Some l -> match lk l with Mutex -> is_lock_or_unlock a | Non_atomic -> is_load_or_store a | Atomic -> is_load_or_store a || is_atomic_action a end | None -> true end let is_at_location_kind lk a lk0 = match location_of a with Some l -> (lk l = lk0) | None -> false end let is_at_mutex_location lk a = is_at_location_kind lk a Mutex let is_at_non_atomic_location lk a = is_at_location_kind lk a Non_atomic let is_at_atomic_location lk a = is_at_location_kind lk a Atomic (**************************************** *) let same_thread a b = (thread_id_of a = thread_id_of b) let threadwise_relation_over s rel = relation_over s rel && (forall (x IN rel). same_thread (fst x) (snd x)) let same_location a b = (location_of a = location_of b) let locations_of actions = { l | forall (Some l IN { (location_of a) | forall (a IN actions) | true }) | true} let well_formed_action a = match a with Atomic_load _ _ mem_ord _ _ -> mem_ord = Mo_relaxed || mem_ord = Mo_acquire || mem_ord = Mo_seq_cst || mem_ord = Mo_consume | Atomic_store _ _ mem_ord _ _ -> mem_ord = Mo_relaxed || mem_ord = Mo_release || mem_ord = Mo_seq_cst | Atomic_rmw _ _ mem_ord _ _ _ -> mem_ord = Mo_relaxed || mem_ord = Mo_release || mem_ord = Mo_acquire || mem_ord = Mo_acq_rel || mem_ord = Mo_seq_cst || mem_ord = Mo_consume | _ -> true end (*********************************************** *) (*********************************************** *) (*********************************************** *) let well_formed_threads actions threads lk sb asw dd cd = inj_on action_id_of (actions) && (forall (a IN actions). well_formed_action a) && threadwise_relation_over actions sb && threadwise_relation_over actions dd && threadwise_relation_over actions cd && strict_preorder actions sb && strict_preorder actions dd && strict_preorder actions cd && (forall (a IN actions). thread_id_of a IN threads) && actions_respect_location_kinds actions lk && dd subset sb && relation_over actions asw let well_formed_reads_from_mapping actions lk rf = relation_over actions rf && ( forall (a1 IN actions) (a2 IN actions) (b IN actions). ((a1,b) IN rf && (a2,b) IN rf) --> (a1 = a2) ) && ( forall (a IN actions) (b IN actions). (a,b) IN rf --> same_location a b && ( value_read_by b = value_written_by a ) && not (a = b) && not (is_fence a) && not (is_fence b) && ( is_at_mutex_location lk a --> false ) && ( is_at_non_atomic_location lk a --> is_store a && is_load b ) && ( is_at_atomic_location lk a --> (is_atomic_store a || is_atomic_rmw a || is_store a) && (is_atomic_load b || is_atomic_rmw b || is_load b) ) ) let all_lock_or_unlock_actions_at lopt aset = {a | forall (a IN aset) | is_lock_or_unlock a && (location_of a = lopt)} let consistent_locks actions lk sc = forall (l IN locations_of actions). (lk l = Mutex) --> ( let lock_unlock_actions = all_lock_or_unlock_actions_at (Some l) actions in let lock_order = restrict_relation_set sc lock_unlock_actions in (*: 30.4.1:5 - The implementation shall serialize those (lock and unlock) operations. :*) strict_total_order_over lock_unlock_actions lock_order && (*: 30.4.1:1 A thread owns a mutex from the time it successfully calls one of the lock functions until it calls unlock.:*) (*: 30.4.1:20 Requires: The calling thread shall own the mutex. :*) (*: 30.4.1:21 Effects: Releases the calling threads ownership of the mutex.:*) ( forall (au IN lock_unlock_actions). is_unlock au --> ( exist (al IN lock_unlock_actions). adjacent_less_than lock_order actions al au && same_thread al au && is_lock al ) ) && (*: 30.4.1:7 Effects: Blocks the calling thread until ownership of the mutex can be obtained for the calling thread.:*) (*: 30.4.1:8 Postcondition: The calling thread owns the mutex. :*) ( forall (al IN lock_unlock_actions). is_lock al --> ( forall (au IN lock_unlock_actions). adjacent_less_than lock_order actions au al --> is_unlock au ) ) ) let rs_element rs_head a = same_thread a rs_head || is_atomic_rmw a let release_sequence actions lk mo a_rel b = is_at_atomic_location lk b && is_release a_rel && ( (b = a_rel) || ( rs_element a_rel b && (a_rel,b) IN mo && (forall (c IN actions). ((a_rel,c) IN mo && (c,b) IN mo) --> rs_element a_rel c) ) ) let release_sequence_set actions lk mo = { (a,b) | forall (a IN actions) (b IN actions) | release_sequence actions lk mo a b} let hypothetical_release_sequence actions lk mo a b = is_at_atomic_location lk b && ( (b = a) || ( rs_element a b && (a,b) IN mo && (forall (c IN actions). ((a,c) IN mo && (c,b) IN mo) --> rs_element a c) ) ) let hypothetical_release_sequence_set actions lk mo = { (a,b) | forall (a IN actions) (b IN actions) | hypothetical_release_sequence actions lk mo a b} let synchronizes_with actions sb asw rf sc rs hrs a b = (* thread sync *) (a,b) IN asw || ( same_location a b && a IN actions && b IN actions && ( (* mutex sync *) (is_unlock a && is_lock b && (a,b) IN sc) || (* rel/acq sync *) ( is_release a && is_acquire b && not (same_thread a b) && (exist (c IN actions). (a,c) IN rs && (c,b) IN rf ) ) || (* fence sync *) ( is_fence a && is_release a && is_fence b && is_acquire b && ( exist (x IN actions) (y IN actions). same_location x y && is_atomic_action x && is_atomic_action y && is_write x && (a,x) IN sb && (y,b) IN sb && ( exist (z IN actions). (x,z) IN hrs && (z,y) IN rf) ) ) || ( is_fence a && is_release a && is_atomic_action b && is_acquire b && ( exist (x IN actions). same_location x b && is_atomic_action x && is_write x && (a,x) IN sb && ( exist (z IN actions). (x,z) IN hrs && (z,b) IN rf ) ) ) || ( is_atomic_action a && is_release a && is_fence b && is_acquire b && ( exist (x IN actions). same_location a x && is_atomic_action x && (x,b) IN sb && ( exist (z IN actions). (a,z) IN rs && (z,x) IN rf ) ) ) ) ) let synchronizes_with_set actions sb asw rf sc rs hrs = { (a,b) | forall (a IN actions) (b IN actions) | synchronizes_with actions sb asw rf sc rs hrs a b} let carries_a_dependency_to_set actions sb dd rf = tc ( (rf inter sb) union dd ) let dependency_ordered_before actions rf rs cad a d = a IN actions && d IN actions && ( exist (b IN actions). is_release a && is_consume b && (exist (e IN actions). (a,e) IN rs && (e,b) IN rf) && ( (b,d) IN cad || (b = d) ) ) let dependency_ordered_before_set actions rf rs cad = { (a,b) | forall (a IN actions) (b IN actions) | dependency_ordered_before actions rf rs cad a b} let compose R1 R2 = { (w,z) | forall ((w,x) IN R1) ((y,z) IN R2) | (x = y) } let inter_thread_happens_before actions sb sw dob = let r = sw union dob union (compose sw sb) in tc (r union (compose sb r)) let consistent_inter_thread_happens_before actions ithb = irrefl actions ithb let happens_before actions sb ithb = sb union ithb let all_sc_actions actions = {a | forall (a IN actions) | is_seq_cst a || is_lock a || is_unlock a} let consistent_sc_order actions mo sc hb = let sc_happens_before = restrict_relation_set hb (all_sc_actions actions) in let sc_mod_order = restrict_relation_set mo (all_sc_actions actions) in strict_total_order_over (all_sc_actions actions) sc && sc_happens_before subset sc && sc_mod_order subset sc let consistent_modification_order actions lk sb sc mo hb = (forall (a IN actions) (b IN actions). (a,b) IN mo --> (same_location a b && is_write a && is_write b)) && ( forall (l IN locations_of actions). match lk l with Atomic -> ( let actions_at_l = {a | forall (a IN actions) | location_of a = Some l} in let writes_at_l = {a | forall (a IN actions_at_l) | is_write a} in strict_total_order_over writes_at_l (restrict_relation_set mo actions_at_l) && (* hb is a subset of mo at l *) restrict_relation_set hb writes_at_l subset mo && (* SC fences impose mo *) (restrict_relation_set (compose (compose sb (restrict_relation_set sc {a | forall (a IN actions) | is_fence a})) sb ) writes_at_l) subset mo) | _ -> ( let actions_at_l = {a | forall (a IN actions) | location_of a = Some l} in Set.is_empty (restrict_relation_set mo actions_at_l) ) end ) let visible_side_effect actions hb a b = (a,b) IN hb && is_write a && is_read b && same_location a b && not ( exist (c IN actions). not (c = a) && not (c = b) && is_write c && same_location c b && (a,c) IN hb && (c,b) IN hb) let visible_side_effect_set actions sb hb = { (a,b) | forall ((a,b) IN hb) | visible_side_effect actions hb a b} let visible_sequence_of_side_effects_tail actions mo hb vsse_head b = { c | forall (c IN actions) | (vsse_head,c) IN mo && not ((b,c) IN hb) && ( forall (a IN actions). ((vsse_head,a) IN mo && (a,c) IN mo) --> not ((b,a) IN hb) ) } let visible_sequence_of_side_effects actions lk mo hb vsse_head b = (b , if is_at_atomic_location lk b then {vsse_head} union visible_sequence_of_side_effects_tail actions mo hb vsse_head b else {}) let visible_sequences_of_side_effects_set actions lk mo hb vse = { visible_sequence_of_side_effects actions lk mo hb vsse_head b | forall (vsse_head IN actions) (b IN actions) | is_at_atomic_location lk b && is_read b && ((vsse_head,b) IN vse) } let consistent_non_atomic_read_values actions lk rf vse = forall (b IN actions). (is_read b && is_at_non_atomic_location lk b) --> ( if (exist (a_vse IN actions). (a_vse,b) IN vse) then (exist (a_vse IN actions). (a_vse,b) IN vse && (a_vse,b) IN rf) else not (exist (a IN actions). (a,b) IN rf) ) let consistent_atomic_read_values actions lk rf vsses = forall (b IN actions). (is_read b && is_at_atomic_location lk b) --> ( if (exist ((b',v) IN vsses). b = b') then ( exist ((b',v) IN vsses). b = b' && (exist (c IN v). (c,b) IN rf) ) else not (exist (a IN actions). (a,b) IN rf) ) let coherent_memory_use actions lk rf mo hb = (* CoRR *) ( forall ((x,a) IN rf) ((y,b) IN rf). ((a,b) IN hb && same_location a b && is_at_atomic_location lk b) --> ((x = y) || (x,y) IN mo) ) && (* CoWR *) ( forall ((a,b) IN hb) (c IN actions). ((c,b) IN rf && is_write a && same_location a b && is_at_atomic_location lk b) --> ((c = a) || (a,c) IN mo) ) && (* CoRW *) ( forall ((a,b) IN hb) (c IN actions). ((c,a) IN rf && is_write b && same_location a b && is_at_atomic_location lk a) --> ((c,b) IN mo) ) let rmw_atomicity actions rf mo = forall ((a,b) IN rf). is_atomic_rmw b --> adjacent_less_than mo actions a b let sc_reads_restricted actions rf sc mo hb = forall ((a,b) IN rf). is_seq_cst b --> ( adjacent_less_than_such_that (fun c -> is_write c && same_location b c) sc actions a b ) || ( not (is_seq_cst a) && ( forall (x IN actions). (adjacent_less_than_such_that (fun c -> is_write c && same_location b c) sc actions x b) --> not ((a,x) IN hb) ) ) let sc_fences_heeded actions sb rf sc mo = (* fence restriction 29.3p5 *) ( forall ((a,x) IN sb) ((y,b) IN sb) (z IN actions). ( is_atomic_action a && is_write a && is_fence x && is_seq_cst x && is_fence y && is_seq_cst y && is_atomic_action b && same_location a b && (x,y) IN sc && (z,b) IN rf) --> ((z = a) || (a,z) IN mo) ) && (* fence restriction 29.3p3 *) ( forall (a IN actions) ((x,b) IN sb) (y IN actions). ( is_write a && is_fence x && is_seq_cst x && is_atomic_action b && same_location a b && adjacent_less_than sc actions a x && (y,b) IN rf) --> ((y = a) || (a,y) IN mo) ) && (* fence restriction 29.3p4 *) ( forall ((a,x) IN sb) ((y,b) IN rf). ((is_atomic_action a && is_write a && is_fence x && is_seq_cst x && is_atomic_action b && same_location a b && (x,y) IN sc) --> ((y = a) || (a,y) IN mo) ) ) let consistent_reads_from_mapping actions lk sb rf sc mo hb vse vsses = consistent_non_atomic_read_values actions lk rf vse && consistent_atomic_read_values actions lk rf vsses && coherent_memory_use actions lk rf mo hb && rmw_atomicity actions rf mo && sc_reads_restricted actions rf sc mo hb && sc_fences_heeded actions sb rf sc mo let all_data_dependency_of actions rf cad = tc (rf union cad) let consistent_control_dependency actions threads lk sb asw dd cd rf cad = irrefl (tc (cd union all_data_dependency_of actions rf cad)) let consistent_execution actions threads lk sb asw dd cd rf mo sc = well_formed_threads actions threads lk sb asw dd cd && consistent_locks actions lk sc && ( let rs = release_sequence_set actions lk mo in let hrs = hypothetical_release_sequence_set actions lk mo in let sw = synchronizes_with_set actions sb asw rf sc rs hrs in let cad = carries_a_dependency_to_set actions sb dd rf in let dob = dependency_ordered_before_set actions rf rs cad in let ithb = inter_thread_happens_before actions sb sw dob in let hb = happens_before actions sb ithb in let vse = visible_side_effect_set actions sb hb in let vsses = visible_sequences_of_side_effects_set actions lk mo hb vse in consistent_inter_thread_happens_before actions ithb && consistent_sc_order actions mo sc hb && consistent_modification_order actions lk sb sc mo hb && well_formed_reads_from_mapping actions lk rf && consistent_reads_from_mapping actions lk sb rf sc mo hb vse vsses) let indeterminate_reads actions rf = {b | forall (b IN actions) | is_read b && not (exist (a IN actions). (a,b) IN rf)} let unsequenced_races actions sb = { (a,b) | forall (a IN actions) (b IN actions) | not (a = b) && same_location a b && (is_write a || is_write b) && same_thread a b && not ((a,b) IN sb || (b,a) IN sb) } let data_races actions hb = { (a,b) | forall (a IN actions) (b IN actions) | not (a = b) && same_location a b && (is_write a || is_write b) && not (same_thread a b) && not (is_atomic_action a && is_atomic_action b) && not ((a,b) IN hb || (b,a) IN hb) } let data_races' actions threads lk sb asw dd cd rf mo sc = let rs = release_sequence_set actions lk mo in let hrs = hypothetical_release_sequence_set actions lk mo in let sw = synchronizes_with_set actions sb asw rf sc rs hrs in let cad = carries_a_dependency_to_set actions sb dd rf in let dob = dependency_ordered_before_set actions rf rs cad in let ithb = inter_thread_happens_before actions sb sw dob in let hb = happens_before actions sb ithb in data_races actions hb (* let full_cpp_memory_model opsem (p : 'program) = let executions = { (actions,threads,lk,sb,asw,dd,cd,rf,mo,sc) | opsem p actions threads lk sb asw dd cd && consistent_execution actions threads lk sb asw dd cd rf mo sc } in if (exist (ex IN executions) actions threads lk sb asw dd cd rf mo sc. (ex = (actions,threads,lk,sb,asw,dd,cd,rf,mo,sc)) --> not (indeterminate_reads actions rf = {}) && not (unsequenced_races actions sb = {}) && not (data_races' actions threads lk sb asw dd cd rf mo sc = {}) ) then {} else executions *) (* SECTION *) (* less vsse's *) let no_vsse_consistent_atomic_read_values actions lk rf hb vse = (* need to be careful that we cant read from a write that the read happens before *) forall (b IN actions). (is_read b && is_at_atomic_location lk b) --> ( if (exist (a_vse IN actions). (a_vse,b) IN vse) then (exist (a IN actions). ((a,b) IN rf) && not ((b,a) IN hb)) else not (exist (a IN actions). (a,b) IN rf) ) let no_vsse_consistent_reads_from_mapping actions lk sb rf sc mo hb vse = consistent_non_atomic_read_values actions lk rf vse && no_vsse_consistent_atomic_read_values actions lk rf hb vse && coherent_memory_use actions lk rf mo hb && rmw_atomicity actions rf mo && sc_reads_restricted actions rf sc mo hb && sc_fences_heeded actions sb rf sc mo let no_vsse_consistent_execution actions threads lk sb asw dd cd rf mo sc = well_formed_threads actions threads lk sb asw dd cd && consistent_locks actions lk sc && ( let rs = release_sequence_set actions lk mo in let hrs = hypothetical_release_sequence_set actions lk mo in let sw = synchronizes_with_set actions sb asw rf sc rs hrs in let cad = carries_a_dependency_to_set actions sb dd rf in let dob = dependency_ordered_before_set actions rf rs cad in let ithb = inter_thread_happens_before actions sb sw dob in let hb = happens_before actions sb ithb in let vse = visible_side_effect_set actions sb hb in consistent_inter_thread_happens_before actions ithb && consistent_sc_order actions mo sc hb && consistent_modification_order actions lk sb sc mo hb && no_vsse_consistent_reads_from_mapping actions lk sb rf sc mo hb vse && well_formed_reads_from_mapping actions lk rf ) (* let no_vsse_cpp_memory_model opsem (p : 'program) = let executions = { (actions,threads,lk,sb,asw,dd,cd,rf,mo,sc) | opsem p actions threads lk sb asw dd cd && no_vsse_consistent_execution actions threads lk sb asw dd cd rf mo sc } in if (exist (ex IN executions) actions threads lk sb asw dd cd rf mo sc. (ex = (actions,threads,lk,sb,asw,dd,cd,rf,mo,sc)) --> not (indeterminate_reads actions rf = {}) && not (unsequenced_races actions sb = {}) && not (data_races' actions threads lk sb asw dd cd rf mo sc = {}) ) then {} else executions *) (* SECTION *) (* less consume *) (* check there are no consume actions *) let no_vsse_consume_happens_before actions sb sw = tc (sb union sw) let no_vsse_consume_consistent_happens_before actions hb = irrefl actions hb let no_vsse_consume_consistent_execution actions threads lk sb asw dd cd rf mo sc = well_formed_threads actions threads lk sb asw dd cd && consistent_locks actions lk sc && ( let rs = release_sequence_set actions lk mo in let hrs = hypothetical_release_sequence_set actions lk mo in let sw = synchronizes_with_set actions sb asw rf sc rs hrs in let hb = no_vsse_consume_happens_before actions sb sw in let vse = visible_side_effect_set actions sb hb in no_vsse_consume_consistent_happens_before actions hb && consistent_sc_order actions mo sc hb && consistent_modification_order actions lk sb sc mo hb && no_vsse_consistent_reads_from_mapping actions lk sb rf sc mo hb vse && well_formed_reads_from_mapping actions lk rf ) let no_vsse_consume_data_races' actions threads lk sb asw dd cd rf mo sc = let rs = release_sequence_set actions lk mo in let hrs = hypothetical_release_sequence_set actions lk mo in let sw = synchronizes_with_set actions sb asw rf sc rs hrs in let hb = no_vsse_consume_happens_before actions sb sw in data_races actions hb (* let no_vsse_consume_cpp_memory_model opsem (p : 'program) = let executions = { (actions,threads,lk,sb,asw,dd,cd,rf,mo,sc) | opsem p actions threads lk sb asw dd cd && no_vsse_consume_consistent_execution actions threads lk sb asw dd cd rf mo sc } in if (exist (ex IN executions) actions threads lk sb asw dd cd rf mo sc. (ex = (actions,threads,lk,sb,asw,dd,cd,rf,mo,sc)) --> not (indeterminate_reads actions rf = {}) && not (unsequenced_races actions sb = {}) && not (no_vsse_consume_data_races' actions threads lk sb asw dd cd rf mo sc = {}) ) then {} else executions *) (* SECTION *) (* less relaxed *) (* release sequences can go? *) let no_vsse_consume_relaxed_synchronizes_with actions sb asw rf sc a b = (* thread sync *) (a,b) IN asw || ( same_location a b && a IN actions && b IN actions && ( (* mutex sync *) (is_unlock a && is_lock b && (a,b) IN sc) || (* rel/acq sync *) ( is_release a && is_acquire b && not (same_thread a b) && (a,b) IN rf ) ) ) let no_vsse_consume_relaxed_synchronizes_with_set actions sb asw rf sc = { (a,b) | forall (a IN actions) (b IN actions) | no_vsse_consume_relaxed_synchronizes_with actions sb asw rf sc a b} let no_vsse_consume_relaxed_consistent_execution actions threads lk sb asw dd cd rf mo sc = well_formed_threads actions threads lk sb asw dd cd && consistent_locks actions lk sc && ( let sw = no_vsse_consume_relaxed_synchronizes_with_set actions sb asw rf sc in let hb = no_vsse_consume_happens_before actions sb sw in let vse = visible_side_effect_set actions sb hb in no_vsse_consume_consistent_happens_before actions hb && consistent_sc_order actions mo sc hb && consistent_modification_order actions lk sb sc mo hb && no_vsse_consistent_reads_from_mapping actions lk sb rf sc mo hb vse && well_formed_reads_from_mapping actions lk rf ) let no_vsse_consume_relaxed_data_races' actions threads lk sb asw dd cd rf mo sc = let sw = no_vsse_consume_relaxed_synchronizes_with_set actions sb asw rf sc in let hb = no_vsse_consume_happens_before actions sb sw in data_races actions hb (* let no_vsse_consume_relaxed_cpp_memory_model opsem (p : 'program) = let executions = { (actions,threads,lk,sb,asw,dd,cd,rf,mo,sc) | opsem p actions threads lk sb asw dd cd && no_vsse_consume_relaxed_consistent_execution actions threads lk sb asw dd cd rf mo sc } in if (exist (ex IN executions) actions threads lk sb asw dd cd rf mo sc. (ex = (actions,threads,lk,sb,asw,dd,cd,rf,mo,sc)) --> not (indeterminate_reads actions rf = {}) && not (unsequenced_races actions sb = {}) && not (no_vsse_consume_relaxed_data_races' actions threads lk sb asw dd cd rf mo sc = {}) ) then {} else executions *) (* SECTION *) (* SC *) let consistent_total_order actions sb asw tot = strict_total_order_over actions tot && sb subset tot && asw subset tot let tot_consistent_reads_from_mapping actions lk rf tot = (forall (b IN actions). (is_read b) --> ( let writes_at_same_location = { a | forall (a IN actions) | (same_location a b) && is_write a} in ( if (exist (a IN actions). adjacent_less_than (restrict_relation_set tot (writes_at_same_location union {b})) actions a b) then (exist (a IN actions). ((a,b) IN rf) && adjacent_less_than (restrict_relation_set tot (writes_at_same_location union {b})) actions a b) else not (exist (a IN actions). (a,b) IN rf) ) ) ) let tot_consistent_execution actions threads lk sb asw dd cd rf tot = well_formed_threads actions threads lk sb asw dd cd && consistent_locks actions lk tot && consistent_total_order actions sb asw tot && tot_consistent_reads_from_mapping actions lk rf tot && well_formed_reads_from_mapping actions lk rf let tot_hb_data_races actions sb asw rf tot = let sc = tot inter { (a,b) | forall (a IN actions) (b IN actions) | is_seq_cst a && is_seq_cst b} in let mo = tot inter { (a,b) | forall (a IN actions) (b IN actions) | (same_location a b) && is_write a && is_write b} in let sw = no_vsse_consume_relaxed_synchronizes_with_set actions sb asw rf sc in let hb = no_vsse_consume_happens_before actions sb sw in data_races actions hb let tot_data_races actions tot = { (a,b) | forall (a IN actions) (b IN actions) | not (a = b) && same_location a b && (is_write a || is_write b) && not (same_thread a b) && not (is_atomic_action a && is_atomic_action b) && (adjacent_less_than tot actions a b || adjacent_less_than tot actions b a) } (* Two memory operations conflict if they access the same memory location, and at least one of them is a store, atomic store, or atomic read-modify-write operation. In a sequentially consistent execution, two memory operations from different threads form a type 1 data race if they conflict, at least one of them is a data operation, and they are adjacent in | {
"url": "http://www.cl.cam.ac.uk/~pes20/cppppc/atomic.lem",
"source_domain": "www.cl.cam.ac.uk",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "32585",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BBCXJA642JEGER7VHAEYUNEBJIFVWOUO",
"WARC-Concurrent-To": "<urn:uuid:c6091ae5-4676-485d-ba41-1aa9f5eea099>",
"WARC-Date": "2016-10-28T23:36:52Z",
"WARC-IP-Address": "128.232.0.20",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4IIWN63QNIAUGOPSHBRSIO5NGR5Q26CT",
"WARC-Record-ID": "<urn:uuid:1aa7985d-633f-4fe1-a4ef-f358e101ae63>",
"WARC-Target-URI": "http://www.cl.cam.ac.uk/~pes20/cppppc/atomic.lem",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6785d80c-9def-44e6-8d64-6d95f9057f6b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-142-188-19.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-44\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for October 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0
],
"line_end_idx": [
27759
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 27759,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.003890630090609193,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1988527625799179,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.036966219544410706,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.37683236598968506,
"rps_doc_frac_unique_words": 0.09631422907114029,
"rps_doc_mean_word_length": 4.907990455627441,
"rps_doc_num_sentences": 95,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.5679612159729,
"rps_doc_word_count": 3717,
"rps_doc_frac_chars_dupe_10grams": 0.36233076453208923,
"rps_doc_frac_chars_dupe_5grams": 0.594913125038147,
"rps_doc_frac_chars_dupe_6grams": 0.512854278087616,
"rps_doc_frac_chars_dupe_7grams": 0.4340294897556305,
"rps_doc_frac_chars_dupe_8grams": 0.41308996081352234,
"rps_doc_frac_chars_dupe_9grams": 0.3828865885734558,
"rps_doc_frac_chars_top_2gram": 0.039960529655218124,
"rps_doc_frac_chars_top_3gram": 0.018637290224432945,
"rps_doc_frac_chars_top_4gram": 0.03058706969022751,
"rps_doc_books_importance": -3359.083984375,
"rps_doc_books_importance_length_correction": -3359.083984375,
"rps_doc_openwebtext_importance": -1787.013427734375,
"rps_doc_openwebtext_importance_length_correction": -1787.013427734375,
"rps_doc_wikipedia_importance": -1239.2864990234375,
"rps_doc_wikipedia_importance_length_correction": -1239.2864990234375
},
"fasttext": {
"dclm": 0.9796549081802368,
"english": 0.5719847679138184,
"fineweb_edu_approx": 2.3939638137817383,
"eai_general_math": 0.8320175409317017,
"eai_open_web_math": 0.4984785318374634,
"eai_web_code": 0.7943809628486633
}
} | {
"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": "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": "2",
"label": "Academic/Research"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-4,136,739,717,149,580,300 | 1
I'm kind of stuck with a problem that I'm having. Among others, I have this tables in my DB:
Product (int productId, ...otherProductInfo)
Customer (int customerId, ...otherCustomerInfo)
SoldToData ( int productId, int customerId)
I want to get top ten selling products using Entity Framework in MVC2. How can I do that?
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// Following thekip's and Pr0fess0rX's advices, this is what I have done so far, and it seems to be working:
using (Entities db = new Entities())
{
var groupedProducts = (from p in db.Products
join s in db.SoldToData
on p.productId equals s.productId
group p by p.id
into ProductGroup
orderby ProductGroup.Count() descending
select ProductGroup).Take(10).ToList();
List<Products> products = new List<Products>();
products.AddRange(groupedProducts.Select(gp => gp.First()));
}
Is this the proper way?
1
• Following thekip's and Pr0fess0rX's advices, this is what I have done so far, and it seems to be working: using (Entities db = new Entities()) { var groupedProducts = (from p in db.Products join s in db.SoldToData on p.productId equals s.productId group p by p.id into ProductGroup orderby ProductGroup.Count() descending select ProductGroup).Take(10).ToList(); List<Products> products = new List<Products>(); products.AddRange(groupedProducts.Select(gp => gp.First())); } Is this the proper way? – Slavisa Jun 6 '11 at 12:11
4
If you have an IQueryable to query the datasource you could use orderby etc for ordering followed by Take(10)?
4
• Hey thekip. Thank you for a quick reply. I haven't used IQueryable yet. I've just gave it a quick look. Can you give me some example? – Slavisa Jun 6 '11 at 11:12
• How do you get a single row from your database? For example how do you get a product by it's ID? when using entity framework (or any other ORM) I would certainly use IQueryable for accessing my database. – thekip Jun 6 '11 at 11:20
• using (Entities db = new Entities()) { var product = (from p in db.Product where p.productId==id select a).Single(); } – Slavisa Jun 6 '11 at 11:29
• Well assuming you have this, you can join this on SoldToData. You can group by SoldToData, Order by the count, Take 10 to take the first 10 (top selling) products – thekip Jun 6 '11 at 11:32
1
1. Join both products and customer
2. Group them and get the count of products per customer
3. Order descending by the count.
4. Take top 10 of the times
5. Get the name of the result products (top 10)
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "https://stackoverflow.com/questions/6250987/fetch-top-n-rows-of-the-table-in-entity-framework",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "183359",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5PFQAYOMK574NB5NXNGJSQ4N7U6BSQGQ",
"WARC-Concurrent-To": "<urn:uuid:5088b1b2-0165-4b7d-b4fe-851702b1b3e3>",
"WARC-Date": "2021-07-28T20:34:22Z",
"WARC-IP-Address": "151.101.65.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BD3MRKKELVL7OHNINSM7IB55EGDE7WX5",
"WARC-Record-ID": "<urn:uuid:5ce13351-2fc5-413f-a68e-070f7db349cb>",
"WARC-Target-URI": "https://stackoverflow.com/questions/6250987/fetch-top-n-rows-of-the-table-in-entity-framework",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:572bf80a-571b-4ac9-8a09-981601c2b6ff>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-176.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,
96,
97,
142,
190,
234,
235,
325,
326,
613,
614,
651,
653,
702,
750,
812,
852,
898,
966,
1034,
1087,
1153,
1155,
1156,
1180,
1181,
1183,
1713,
1715,
1716,
1827,
1828,
1830,
1997,
2233,
2385,
2580,
2582,
2619,
2678,
2714,
2744,
2794,
2795,
2807,
2808,
2908,
2909
],
"line_end_idx": [
2,
3,
96,
97,
142,
190,
234,
235,
325,
326,
613,
614,
651,
653,
702,
750,
812,
852,
898,
966,
1034,
1087,
1153,
1155,
1156,
1180,
1181,
1183,
1713,
1715,
1716,
1827,
1828,
1830,
1997,
2233,
2385,
2580,
2582,
2619,
2678,
2714,
2744,
2794,
2795,
2807,
2808,
2908,
2909,
2999
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2999,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0.002000669948756695,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3176661431789398,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022690439596772194,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3160453736782074,
"rps_doc_frac_unique_words": 0.4340527653694153,
"rps_doc_mean_word_length": 4.776978492736816,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0.0032414901070296764,
"rps_doc_unigram_entropy": 4.949452877044678,
"rps_doc_word_count": 417,
"rps_doc_frac_chars_dupe_10grams": 0.3815261125564575,
"rps_doc_frac_chars_dupe_5grams": 0.4472891688346863,
"rps_doc_frac_chars_dupe_6grams": 0.4352409541606903,
"rps_doc_frac_chars_dupe_7grams": 0.3815261125564575,
"rps_doc_frac_chars_dupe_8grams": 0.3815261125564575,
"rps_doc_frac_chars_dupe_9grams": 0.3815261125564575,
"rps_doc_frac_chars_top_2gram": 0.01004016026854515,
"rps_doc_frac_chars_top_3gram": 0.015060240402817726,
"rps_doc_frac_chars_top_4gram": 0.0200803205370903,
"rps_doc_books_importance": -185.9217987060547,
"rps_doc_books_importance_length_correction": -185.9217987060547,
"rps_doc_openwebtext_importance": -122.87081146240234,
"rps_doc_openwebtext_importance_length_correction": -122.87081146240234,
"rps_doc_wikipedia_importance": -75.4131851196289,
"rps_doc_wikipedia_importance_length_correction": -75.4131851196289
},
"fasttext": {
"dclm": 0.07935070991516113,
"english": 0.795240581035614,
"fineweb_edu_approx": 0.8722698092460632,
"eai_general_math": 0.003951789811253548,
"eai_open_web_math": 0.05459744110703468,
"eai_web_code": 0.0004498999915085733
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,287,098,098,911,836,000 | Edit Article
wikiHow to Design a Blog Game
Have you ever wanted to play or make a blog game (non-virtual game made on blogs) but it got shut down or is inactive; maybe the people there aren't friendly to you? A blog game is a game (most commonly found on Wordpress blogs) that you need to click on subpages, comment to buy stuff, and more! Here's how to make your own cool blog game! Written specifically for wordpress.
Steps
1. 1
Decide whether you want to make it on your own current site or if you want to make the game have its own blog.
2. 2
Once decided, go to the hosting blog and make a new page. Name it "Play", "Log On", "Start", or whatever you choose!
3. 3
Create three main subpages: "Play", "Make an Account", and "Support". You can even add a developer's mini-blog, but many people prefer making the blog's "Home" page the developer's blog.
4. 4
Keep making subpages (like "Town" could have "Bank" or a fashion store in it) with pictures of the content in it. People should be able to comment to buy stuff for their account.
5. 5
Do NOT include anything that people under age 18 through 0 months should not see, such as: Talk about drugs, talk about sexual stuff, etc.
6. 6
Once you're finished, have one or two people beta-test it to see if it's any good or if the pictures are REALLY showing up. They'll see the game from the PLAYER'S point of view, not yours, the creator's point of view!
7. 7
Copyright your work and decide whether you should have SOME of your content copyright-free or not, or if people interested in making their own versions of your content can get permission from you.
8. 8
Once you're done, spread the word! Let everyone know it's there and have a grand opening "party" in the game, giving away a few items not available in the game's stores.
9. 9
If it's virtual and automatic then it's better!
Community Q&A
Ask a Question
200 characters left
Submit
Tips
• You can have players submit their own content so that you can improve it and make it available for sale in the game. Approve of only the ones you like and/or the ones that fit the game well!
• Try to make the game absolutely, 100% free. If you HAVE to make it cost money, try making a special membership. Members can then go to special rooms that non-members can't, members can also get more clothing, furniture for their houses, own more property, and more!
• If you're young and have siblings your age or only a year or two younger, you can have them make accounts on your game. If they like it they'll keep playing and suggest some really cool ideas! Give them unlimited everything, and also give yourself unlimited everything.
Warnings
• Don't take anything from other people/sites unless you have gotten official permission from the person you wish to copy or take from!
• Don't be rude or mean to other people and give them limited options; this will make everyone ELSE leave your game!
• Don't add any mods unless they're REALLY close to you and you know they can't go off easily. One big mistake they've made before? Don't trust them!
Things You'll Need
• A Wordpress blog
• A paint program; free ones are recommended. (MS Paint, Paint.net, GIMP, etc.)
• Creativity
• Patience
• Will!
Made Recently
Loading...
Did you try these steps?
Upload a picture for other readers to see.
Upload error
Awesome picture! Tell us more about it? Click here to share your story.
Article Info
Categories: Blog Basics
Thanks to all authors for creating a page that has been read 3,118 times.
Is this article up to date?
| {
"url": "https://www.wikihow.com/Design-a-Blog-Game",
"source_domain": "www.wikihow.com",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "165716",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:J4NP53N5JHAIRDS344VM6UDF27FHFTMB",
"WARC-Concurrent-To": "<urn:uuid:25d62c86-9899-405e-bbf7-8c7a82a7a5f3>",
"WARC-Date": "2017-11-23T00:18:04Z",
"WARC-IP-Address": "151.101.34.110",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:IIGGEGAZJABI4IGZSV4TXXC7IKAMXIFL",
"WARC-Record-ID": "<urn:uuid:ee3c6766-b16a-4538-9033-2d26d6294f98>",
"WARC-Target-URI": "https://www.wikihow.com/Design-a-Blog-Game",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9fc73542-de9f-4744-8157-6b044d46bc81>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-62-138.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-47\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for November 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
13,
14,
44,
45,
46,
423,
424,
430,
431,
438,
553,
560,
681,
688,
879,
886,
1069,
1076,
1219,
1226,
1448,
1455,
1656,
1663,
1837,
1844,
1896,
1897,
1911,
1912,
1927,
1947,
1954,
1955,
1964,
1965,
2162,
2434,
2710,
2711,
2724,
2725,
2865,
2986,
3140,
3141,
3164,
3165,
3188,
3272,
3289,
3304,
3316,
3317,
3335,
3336,
3351,
3380,
3427,
3444,
3520,
3521,
3538,
3539,
3567,
3568,
3646,
3647,
3679
],
"line_end_idx": [
13,
14,
44,
45,
46,
423,
424,
430,
431,
438,
553,
560,
681,
688,
879,
886,
1069,
1076,
1219,
1226,
1448,
1455,
1656,
1663,
1837,
1844,
1896,
1897,
1911,
1912,
1927,
1947,
1954,
1955,
1964,
1965,
2162,
2434,
2710,
2711,
2724,
2725,
2865,
2986,
3140,
3141,
3164,
3165,
3188,
3272,
3289,
3304,
3316,
3317,
3335,
3336,
3351,
3380,
3427,
3444,
3520,
3521,
3538,
3539,
3567,
3568,
3646,
3647,
3679,
3684
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3684,
"ccnet_original_nlines": 69,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42284324765205383,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018225999549031258,
"rps_doc_frac_lines_end_with_ellipsis": 0.014285709708929062,
"rps_doc_frac_no_alph_words": 0.21749696135520935,
"rps_doc_frac_unique_words": 0.45412132143974304,
"rps_doc_mean_word_length": 4.220839977264404,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0.0012150700204074383,
"rps_doc_unigram_entropy": 5.2219133377075195,
"rps_doc_word_count": 643,
"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.015475310385227203,
"rps_doc_frac_chars_top_3gram": 0.009948420338332653,
"rps_doc_frac_chars_top_4gram": 0.012527629733085632,
"rps_doc_books_importance": -314.9853515625,
"rps_doc_books_importance_length_correction": -314.9853515625,
"rps_doc_openwebtext_importance": -158.76739501953125,
"rps_doc_openwebtext_importance_length_correction": -158.76739501953125,
"rps_doc_wikipedia_importance": -111.15760040283203,
"rps_doc_wikipedia_importance_length_correction": -111.15760040283203
},
"fasttext": {
"dclm": 0.031139139086008072,
"english": 0.9529593586921692,
"fineweb_edu_approx": 1.4561914205551147,
"eai_general_math": 0.0021654400043189526,
"eai_open_web_math": 0.04900943860411644,
"eai_web_code": 0.00029110998730175197
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
6,697,440,418,602,149,000 | 136673 Letture
Programmare Android: creare applicazioni partendo da zero con Android SDK ed Eclipse
I telefonini si sono trasformati, da tempo, in dispositivi evoluti capaci di mettere a disposizione dell'utente una nutrita schiera di applicazioni per l'assolvimento dei compiti più disparati. Android è uno dei sistemi operativi per device mobili oggi più diffuso ed utilizzato: numerosi produttori (tra i tanti nomi ci sono, per esempio, Acer, HTC, LG, Motorola, Samsung e Sony Ericsson) hanno deciso di installarlo sui propri dispositivi via a via presentati sul mercato, sia che si tratti di smartphone che di tablet. Android si propone come una piattaforma "aperta" basata sul kernel Linux ed in grado di eseguire applicazioni attraverso la cosiddetta Dalvik virtual machine, una macchina virtuale Java adattata per l'impiego sui dispositivi mobili.
Appannaggio dei programmatori, Google provvede a rilasciare un pacchetto SDK aggiornato che intregra gli strumenti di sviluppo, le librerie, un emulatore, la documentazione ed alcuni progetti d'esempio. Grazie al pacchetto SDK, disponibile nelle versioni per le piattaforme Windows, Linux e Mac OS X, è possibile quindi interagire con un "dispositivo virtuale" che si comporterà come uno dei device Android disponibili sul mercato.
Per iniziare a programmare applicazioni Android, quindi, due sono i requisiti software indispensabili:
1) Il pacchetto Java Development Kit (JDK), prelevabile da questa pagina (sito web di Oracle).
2) L'Android SDK, il prodotto che consente di realizzare applicazioni per il sistema operativo mobile targato Google contenente il debugger, le librerie, un emulatore, il codice d'esempio e la documentazione. Il pacchetto SDK è scaricabile gratuitamente da questa pagina.
L'utilizzo della virtual machine è necessario per fare in modo che il codice generato possa garantire delle prestazioni comparabili a linguaggi compilati quali C e C++. La macchina virtuale che, su ciascun dispositivo Android, si occupa di eseguire il bytecode si chiama appunto Dalvik VM. L'uomo chiave che ne ha curato lo sviluppo si chiama Dan Bornstein ed il nome della macchina virtuale deriva da quello di un villaggio di pescatori islandese, nel quale vivano alcuni suoi parenti. La virtual machine Dalvik si occupa di recuperare tutte le varie classi Java necessarie per il funzionamento di un'applicazione e di combinarle in uno o più file con estensione .dex (Dalvik Executables). Durante la generazione di tali elementi, le informazioni duplicate vengono riunite assieme in modo da ridurre drasticamente lo spazio necessario rispetto ai comuni file Java in formato .jar.
"Cuore" di Android è il kernel Linux che è responsabile della gestione dei driver di periferica, dell'accesso alle risorse, della gestione energetica e di altre funzionalità. La maggioranza delle applicazioni sviluppate per Android sono comunque realizzata in Java e vengono tutte eseguite ricorrendo alla virtual machine Dalvik.
Al livello successivo della "pila", sopra al kernel Linux, vi sono un certo numero di librerie C/C++ quali OpenGL, WebKit, FreeType, SSL, SQLite e Media. Le librerie Media sono basate su OpenCore e sono responsabili della registrazione e della riproduzioni di flussi audio e video. Un'ulteriore libreria, denominata Surface Manager si occupa di controllare l'accesso al sottosistema grafico e supporta la modellazione 2D e 3D.
La nota libreria WebKit, in comune con Apple Safari e Google Chrome, gestisce il motore per la navigazione sul web mntre SQLite è il conosciuto database relazionale opensource.
Dopo l'installazione del pacchetto Java JDK
Quando si installa Java è bene tenere presenti alcuni punti fondamentali. In primo luogo, la piattaforma Java deve essere mantenuta sempre aggiornata per evitare che eventuali vulnerabilità possano essere sfruttate, da parte di aggressori, per causare danni. In seconda battuta, se non si fosse interessati ad eseguire le applet Java dal browser web, sarebbe opportuno disattivare questa possibilità.
A tal proposito, suggeriamo di documentarvi facendo riferimento all'articolo Java è sicuro? Come difendersi dalle minacce più recenti.
Installazione di Android SDK
Dopo aver prelevato il pacchetto SDK di Android da questa pagina, è necessario estrarne il contenuto in una cartella di propria scelta, sul disco fisso (ad esempio, C:\Android SDK).
Si otterranno così due sottocartelle: eclipse e sdk. La prima directory contiene l'ambiente di sviluppo (IDE) Eclipse (fino a qualche tempo fa doveva essere scaricato ed installato separatamente) mentre la seconda il pacchetto di sviluppo Android vero e proprio.
È possibile programmare per Android utilizzando anche, semplicemente, un editor di testo (i.e. Notepad++) ma la procedura apparirà sicuramente più macchinosa. Per evitare di complicarsi la vita, quindi, è possibile fruire dell'Android Development Tools (ADT), un plugin per Eclipse IDE che consente di "aprire" l'ambiente di sviluppo integrato multilinguaggio e multipiattaforma alla realizzazione di applicazioni per il sistema operativo di Google. Tutto è già integrato nel pacchetto "ADT bundle" di Android.
L'SDK di Android contiene tutta una serie di strumenti e di pacchetti. Per impostazione predefinita, al primo utilizzo dell'SDK risultano abilitati solamente gli strumenti ossia gli eseguibili e i file di supporto indispensabili per l'avvio dei programmi. I pacchetti sono invece i file che si riferiscono ad una specifica versione di Android (dalla 1.5 alla 3.1) oppure i cosiddetti ad-on. Questi ultimi sono componenti aggiuntivi quali le API di Google Maps. Il cosiddetto SDK Manager è uno speciale strumento che consente di gestire le versioni dell'Android SDK correntemente installate sul sistema in uso.
Avvio dell'SDK Manager
Per avviare l'SDK Manager da ambiente Windows, è sufficiente fare doppio clic sul file SDK Manager.exe.
Prima di avviare l'SDK Manager, bisognerà accertarsi di aver installato il pacchetto JDK di Java altrimenti l'applicazione non verrà eseguita (apparirà per una frazione di secondo solo una finestra a sfondo nero).
L'SDK Manager mostrerà tutti i componenti utilizzabili per realizzare le proprie applicazioni per la piattaforma Android. Qui, si possono spuntare le caselle corrispondenti alle versioni di Android per le quali si prevede di sviluppare le proprie applicazioni.
Ogni versione del sistema operativo Android è contraddistinta da un numero progressivo di versione della corrispondente API. Nel caso di Android 2.3.3 si leggerà, ad esempio, API 10; nel caso di Android 3.0, API 11; per Android 4.0, API 14 e così via.
Oltre a spuntare le caselle corrispondenti alle versioni del sistema operativo d'interesse, si dovrà attivare anche la casella Extras:
Cliccando su Install packages ed, ancora, su Install, l'SDK Manager di Google avvierà il download dei pacchetti richiesti per poi proseguire con la loro installazione sul sistema locale.
Peccato che mentre viene installato un componente, l'SDK Manager non si avvantaggi procedendo al download di quelli successivi.
Ad installazione ultimata, l'SDK Manager chiederà di operare un riavvio dell'ADB (Android Debug Bridge): bisognerà rispondere in modo affermativo.
La prima esecuzione dell'ambiente di sviluppo Eclipse
A questo punto è tutto pronto per iniziare a programmare per Android: accedendo alla cartella eclipse quindi facendo doppio clic sul file eseguibile eclipse.exe, si avvierà l'ambiente di sviluppo integrato Eclipse.
Alla prima esecuzione di Elicpse, verrà richiesta la creazione di un workspace: si tratta della cartella nella quale si prevede di memorizzare tutti i propri progetti. È possibile accettare la directory proposta in modo predefinito oppure specificarne un'altra.
Alla comparsa della successiva finestra Contribute usage statistics si può scegliere oppure No a seconda che si voglia oppure si preferisca non contribuire al miglioramento dell'Android SDK mediante l'invio periodico, a Google, di dati statistici.
È interessante notare come l'SDK Manager sia avviabile anche dalla versione di Eclipse integrata nell'Android SDK: basta cliccare sul menù Window quindi selezionare la voce Android SDK Manager:
Cliccando sul menù Help, su About ADT quindi sul pulsante Installation details ed infine sulla scheda Plug-ins, si noterà come i plugin ADT (Android Development Tools) che sino a qualche tempo fa dovevano essere aggiunti in modo manuale, risultino già preinstallati.
Il plugin ADT di Android estende le funzionalità dell'IDE Eclipse in modo tale da fare in modo che attraverso tale ambiente di sviluppo sia possibile realizzare nuovi progetti Android, accedere agli strumenti che consentono di accedere ad emulatori e dispositivi Android, compilare ed effettuare il debug di applicazioni Android, esportare le applicazioni Android sotto forma di pacchetti APK ed, infine, creare i certificati digitali per firmare le applicazioni in formato APK.
1. Avatar
Diego2
27/02/2014 18:10:06
Grazie per il lavoro e le chiare spiegazioni :) Ti domando: perché non aggiungi ulteriori capitoli sulla programmazione per android? Ciao e grazie di nuovo :)
Programmare Android: creare applicazioni partendo da zero con Android SDK ed Eclipse - IlSoftware.it | {
"url": "https://www.ilsoftware.it/articoli.asp?tag=Programmare-Android-creare-applicazioni-partendo-da-zero-con-Android-SDK-ed-Eclipse_9399",
"source_domain": "www.ilsoftware.it",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "57474",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PBTG4ZHVUXM5UGOOAZIXC2T3NCJ3A5CY",
"WARC-Concurrent-To": "<urn:uuid:26c60d2a-55ca-4f0e-809c-a1bc615ba655>",
"WARC-Date": "2017-10-24T03:52:40Z",
"WARC-IP-Address": "62.149.197.5",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:L26NL33DRSM4SWZ5BPQXWBETPDBLO7KC",
"WARC-Record-ID": "<urn:uuid:e55d61e7-27f8-4d76-9d34-f37cd1e588e5>",
"WARC-Target-URI": "https://www.ilsoftware.it/articoli.asp?tag=Programmare-Android-creare-applicazioni-partendo-da-zero-con-Android-SDK-ed-Eclipse_9399",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3e60c2d2-9403-4900-8433-41231c629442>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-169-92-149.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,
15,
16,
101,
102,
857,
1289,
1290,
1393,
1394,
1395,
1490,
1491,
1763,
1764,
2646,
2647,
2977,
3404,
3581,
3582,
3626,
3627,
4028,
4163,
4164,
4165,
4194,
4195,
4377,
4640,
4641,
5152,
5153,
5763,
5764,
5765,
5788,
5789,
5893,
5894,
6108,
6109,
6370,
6622,
6757,
6758,
6945,
7073,
7220,
7221,
7222,
7276,
7277,
7492,
7493,
7755,
7756,
8004,
8005,
8199,
8200,
8467,
8946,
8947,
8948,
8960,
8971,
8995,
9158
],
"line_end_idx": [
15,
16,
101,
102,
857,
1289,
1290,
1393,
1394,
1395,
1490,
1491,
1763,
1764,
2646,
2647,
2977,
3404,
3581,
3582,
3626,
3627,
4028,
4163,
4164,
4165,
4194,
4195,
4377,
4640,
4641,
5152,
5153,
5763,
5764,
5765,
5788,
5789,
5893,
5894,
6108,
6109,
6370,
6622,
6757,
6758,
6945,
7073,
7220,
7221,
7222,
7276,
7277,
7492,
7493,
7755,
7756,
8004,
8005,
8199,
8200,
8467,
8946,
8947,
8948,
8960,
8971,
8995,
9158,
9258
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 9258,
"ccnet_original_nlines": 69,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08438818901777267,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04159132018685341,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17118746042251587,
"rps_doc_frac_unique_words": 0.45334312319755554,
"rps_doc_mean_word_length": 5.616458415985107,
"rps_doc_num_sentences": 66,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.7675886154174805,
"rps_doc_word_count": 1361,
"rps_doc_frac_chars_dupe_10grams": 0.018838299438357353,
"rps_doc_frac_chars_dupe_5grams": 0.0387231782078743,
"rps_doc_frac_chars_dupe_6grams": 0.030088959261775017,
"rps_doc_frac_chars_dupe_7grams": 0.018838299438357353,
"rps_doc_frac_chars_dupe_8grams": 0.018838299438357353,
"rps_doc_frac_chars_dupe_9grams": 0.018838299438357353,
"rps_doc_frac_chars_top_2gram": 0.011773940175771713,
"rps_doc_frac_chars_top_3gram": 0.005494509823620319,
"rps_doc_frac_chars_top_4gram": 0.009419149719178677,
"rps_doc_books_importance": -669.7415771484375,
"rps_doc_books_importance_length_correction": -669.7415771484375,
"rps_doc_openwebtext_importance": -344.08819580078125,
"rps_doc_openwebtext_importance_length_correction": -344.08819580078125,
"rps_doc_wikipedia_importance": -169.270751953125,
"rps_doc_wikipedia_importance_length_correction": -169.270751953125
},
"fasttext": {
"dclm": 0.5719983577728271,
"english": 0.001539899967610836,
"fineweb_edu_approx": 1.0635349750518799,
"eai_general_math": 0.000004170000011072261,
"eai_open_web_math": 0.5971269607543945,
"eai_web_code": 0.47645312547683716
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-5,850,911,151,116,027,000 | boxyroom /vendor/plugins/state_machine/test/unit/event_test.rb
Language Ruby Lines 744
MD5 Hash 03fe93a30499a54e8aaa99474aaa3392 Estimated Cost $15,415 (why?)
Repository https://bitbucket.org/systech3/boxyroom.git View Raw File View Project SPDX
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
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
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
require File.expand_path(File.dirname(__FILE__) + '/../test_helper')
class EventByDefaultTest < Test::Unit::TestCase
def setup
@klass = Class.new
@machine = StateMachine::Machine.new(@klass)
@event = StateMachine::Event.new(@machine, :ignite)
@object = @klass.new
end
def test_should_have_a_machine
assert_equal @machine, @event.machine
end
def test_should_have_a_name
assert_equal :ignite, @event.name
end
def test_should_have_a_qualified_name
assert_equal :ignite, @event.qualified_name
end
def test_should_not_have_any_guards
assert @event.guards.empty?
end
def test_should_have_no_known_states
assert @event.known_states.empty?
end
def test_should_not_be_able_to_fire
assert [email protected]_fire?(@object)
end
def test_should_not_have_a_transition
assert_nil @event.transition_for(@object)
end
def test_should_define_a_predicate
assert @object.respond_to?(:can_ignite?)
end
def test_should_define_a_transition_accessor
assert @object.respond_to?(:ignite_transition)
end
def test_should_define_an_action
assert @object.respond_to?(:ignite)
end
def test_should_define_a_bang_action
assert @object.respond_to?(:ignite!)
end
end
class EventTest < Test::Unit::TestCase
def setup
@machine = StateMachine::Machine.new(Class.new)
@event = StateMachine::Event.new(@machine, :ignite)
@event.transition :parked => :idling
end
def test_should_allow_changing_machine
new_machine = StateMachine::Machine.new(Class.new)
@event.machine = new_machine
assert_equal new_machine, @event.machine
end
def test_should_provide_matcher_helpers_during_initialization
matchers = []
@event.instance_eval do
matchers = [all, any, same]
end
assert_equal [StateMachine::AllMatcher.instance, StateMachine::AllMatcher.instance, StateMachine::LoopbackMatcher.instance], matchers
end
def test_should_use_pretty_inspect
assert_match "#<StateMachine::Event name=:ignite transitions=[:parked => :idling]>", @event.inspect
end
end
class EventWithConflictingHelpersTest < Test::Unit::TestCase
def setup
@klass = Class.new do
def can_ignite?
0
end
def ignite_transition
0
end
def ignite
0
end
def ignite!
0
end
end
@machine = StateMachine::Machine.new(@klass)
@state = StateMachine::Event.new(@machine, :ignite)
@object = @klass.new
end
def test_should_not_redefine_predicate
assert_equal 0, @object.can_ignite?
end
def test_should_not_redefine_transition_accessor
assert_equal 0, @object.ignite_transition
end
def test_should_not_redefine_action
assert_equal 0, @object.ignite
end
def test_should_not_redefine_bang_action
assert_equal 0, @object.ignite!
end
def test_should_allow_super_chaining
@klass.class_eval do
def can_ignite?
super ? 1 : 0
end
def ignite_transition
super ? 1 : 0
end
def ignite
super ? 1 : 0
end
def ignite!
begin
super
1
rescue Exception => ex
0
end
end
end
assert_equal 0, @object.can_ignite?
assert_equal 0, @object.ignite_transition
assert_equal 0, @object.ignite
assert_equal 1, @object.ignite!
end
end
class EventWithNamespaceTest < Test::Unit::TestCase
def setup
@klass = Class.new
@machine = StateMachine::Machine.new(@klass, :namespace => 'alarm')
@event = StateMachine::Event.new(@machine, :enable)
@object = @klass.new
end
def test_should_have_a_name
assert_equal :enable, @event.name
end
def test_should_have_a_qualified_name
assert_equal :enable_alarm, @event.qualified_name
end
def test_should_namespace_predicate
assert @object.respond_to?(:can_enable_alarm?)
end
def test_should_namespace_transition_accessor
assert @object.respond_to?(:enable_alarm_transition)
end
def test_should_namespace_action
assert @object.respond_to?(:enable_alarm)
end
def test_should_namespace_bang_action
assert @object.respond_to?(:enable_alarm!)
end
end
class EventTransitionsTest < Test::Unit::TestCase
def setup
@machine = StateMachine::Machine.new(Class.new)
@event = StateMachine::Event.new(@machine, :ignite)
end
def test_should_not_raise_exception_if_implicit_option_specified
assert_nothing_raised {@event.transition(:invalid => :valid)}
end
def test_should_not_allow_on_option
exception = assert_raise(ArgumentError) {@event.transition(:on => :ignite)}
assert_equal 'Invalid key(s): on', exception.message
end
def test_should_automatically_set_on_option
guard = @event.transition(:to => :idling)
assert_instance_of StateMachine::WhitelistMatcher, guard.event_requirement
assert_equal [:ignite], guard.event_requirement.values
end
def test_should_not_allow_except_to_option
exception = assert_raise(ArgumentError) {@event.transition(:except_to => :parked)}
assert_equal 'Invalid key(s): except_to', exception.message
end
def test_should_not_allow_except_on_option
exception = assert_raise(ArgumentError) {@event.transition(:except_on => :ignite)}
assert_equal 'Invalid key(s): except_on', exception.message
end
def test_should_allow_transitioning_without_a_to_state
assert_nothing_raised {@event.transition(:from => :parked)}
end
def test_should_allow_transitioning_without_a_from_state
assert_nothing_raised {@event.transition(:to => :idling)}
end
def test_should_allow_except_from_option
assert_nothing_raised {@event.transition(:except_from => :idling)}
end
def test_should_allow_transitioning_from_a_single_state
assert @event.transition(:parked => :idling)
end
def test_should_allow_transitioning_from_multiple_states
assert @event.transition([:parked, :idling] => :idling)
end
def test_should_have_transitions
guard = @event.transition(:to => :idling)
assert_equal [guard], @event.guards
end
end
class EventAfterBeingCopiedTest < Test::Unit::TestCase
def setup
@machine = StateMachine::Machine.new(Class.new)
@event = StateMachine::Event.new(@machine, :ignite)
@copied_event = @event.dup
end
def test_should_not_have_the_same_collection_of_guards
assert_not_same @event.guards, @copied_event.guards
end
def test_should_not_have_the_same_collection_of_known_states
assert_not_same @event.known_states, @copied_event.known_states
end
end
class EventWithoutTransitionsTest < Test::Unit::TestCase
def setup
@klass = Class.new
@machine = StateMachine::Machine.new(@klass)
@event = StateMachine::Event.new(@machine, :ignite)
@object = @klass.new
end
def test_should_not_be_able_to_fire
assert [email protected]_fire?(@object)
end
def test_should_not_have_a_transition
assert_nil @event.transition_for(@object)
end
def test_should_not_fire
assert [email protected](@object)
end
def test_should_not_change_the_current_state
@event.fire(@object)
assert_nil @object.state
end
end
class EventWithTransitionsTest < Test::Unit::TestCase
def setup
@klass = Class.new
@machine = StateMachine::Machine.new(@klass)
@event = StateMachine::Event.new(@machine, :ignite)
@event.transition(:parked => :idling)
@event.transition(:first_gear => :idling)
end
def test_should_include_all_transition_states_in_known_states
assert_equal [:parked, :idling, :first_gear], @event.known_states
end
def test_should_include_new_transition_states_after_calling_known_states
@event.known_states
@event.transition(:stalled => :idling)
assert_equal [:parked, :idling, :first_gear, :stalled], @event.known_states
end
def test_should_use_pretty_inspect
assert_match "#<StateMachine::Event name=:ignite transitions=[:parked => :idling, :first_gear => :idling]>", @event.inspect
end
end
class EventWithoutMatchingTransitionsTest < Test::Unit::TestCase
def setup
@klass = Class.new
@machine = StateMachine::Machine.new(@klass)
@machine.state :parked, :idling
@event = StateMachine::Event.new(@machine, :ignite)
@event.transition(:parked => :idling)
@object = @klass.new
@object.state = 'idling'
end
def test_should_not_be_able_to_fire
assert [email protected]_fire?(@object)
end
def test_should_not_have_a_transition
assert_nil @event.transition_for(@object)
end
def test_should_not_fire
assert [email protected](@object)
end
def test_should_not_change_the_current_state
@event.fire(@object)
assert_equal 'idling', @object.state
end
end
class EventWithMatchingDisabledTransitionsTest < Test::Unit::TestCase
def setup
StateMachine::Integrations.const_set('Custom', Module.new do
def invalidate(object, attribute, message, values = [])
(object.errors ||= []) << generate_message(message, values)
end
def reset(object)
object.errors = []
end
end)
@klass = Class.new do
attr_accessor :errors
end
@machine = StateMachine::Machine.new(@klass, :integration => :custom)
@machine.state :parked, :idling
@event = StateMachine::Event.new(@machine, :ignite)
@event.transition(:parked => :idling, :if => lambda {false})
@object = @klass.new
@object.state = 'parked'
end
def test_should_not_be_able_to_fire
assert [email protected]_fire?(@object)
end
def test_should_not_have_a_transition
assert_nil @event.transition_for(@object)
end
def test_should_not_fire
assert [email protected](@object)
end
def test_should_not_change_the_current_state
@event.fire(@object)
assert_equal 'parked', @object.state
end
def test_should_invalidate_the_state
@event.fire(@object)
assert_equal ['cannot transition via "ignite"'], @object.errors
end
def test_should_reset_existing_error
@object.errors = ['invalid']
@event.fire(@object)
assert_equal ['cannot transition via "ignite"'], @object.errors
end
def teardown
StateMachine::Integrations.send(:remove_const, 'Custom')
end
end
class EventWithMatchingEnabledTransitionsTest < Test::Unit::TestCase
def setup
StateMachine::Integrations.const_set('Custom', Module.new do
def invalidate(object, attribute, message, values = [])
(object.errors ||= []) << generate_message(message, values)
end
def reset(object)
object.errors = []
end
end)
@klass = Class.new do
attr_accessor :errors
end
@machine = StateMachine::Machine.new(@klass, :integration => :custom)
@machine.state :parked, :idling
@machine.event :ignite
@event = StateMachine::Event.new(@machine, :ignite)
@event.transition(:parked => :idling)
@object = @klass.new
@object.state = 'parked'
end
def test_should_be_able_to_fire
assert @event.can_fire?(@object)
end
def test_should_have_a_transition
transition = @event.transition_for(@object)
assert_not_nil transition
assert_equal 'parked', transition.from
assert_equal 'idling', transition.to
assert_equal :ignite, transition.event
end
def test_should_fire
assert @event.fire(@object)
end
def test_should_change_the_current_state
@event.fire(@object)
assert_equal 'idling', @object.state
end
def test_should_reset_existing_error
@object.errors = ['invalid']
@event.fire(@object)
assert_equal [], @object.errors
end
def test_should_not_invalidate_the_state
@event.fire(@object)
assert_equal [], @object.errors
end
def teardown
StateMachine::Integrations.send(:remove_const, 'Custom')
end
end
class EventWithTransitionWithoutToStateTest < Test::Unit::TestCase
def setup
@klass = Class.new
@machine = StateMachine::Machine.new(@klass)
@machine.state :parked
@machine.event :park
@event = StateMachine::Event.new(@machine, :park)
@event.transition(:from => :parked)
@object = @klass.new
@object.state = 'parked'
end
def test_should_be_able_to_fire
assert @event.can_fire?(@object)
end
def test_should_have_a_transition
transition = @event.transition_for(@object)
assert_not_nil transition
assert_equal 'parked', transition.from
assert_equal 'parked', transition.to
assert_equal :park, transition.event
end
def test_should_fire
assert @event.fire(@object)
end
def test_should_not_change_the_current_state
@event.fire(@object)
assert_equal 'parked', @object.state
end
end
class EventWithTransitionWithNilToStateTest < Test::Unit::TestCase
def setup
@klass = Class.new
@machine = StateMachine::Machine.new(@klass)
@machine.state nil, :idling
@machine.event :park
@event = StateMachine::Event.new(@machine, :park)
@event.transition(:idling => nil)
@object = @klass.new
@object.state = 'idling'
end
def test_should_be_able_to_fire
assert @event.can_fire?(@object)
end
def test_should_have_a_transition
transition = @event.transition_for(@object)
assert_not_nil transition
assert_equal 'idling', transition.from
assert_equal nil, transition.to
assert_equal :park, transition.event
end
def test_should_fire
assert @event.fire(@object)
end
def test_should_not_change_the_current_state
@event.fire(@object)
assert_equal nil, @object.state
end
end
class EventWithMultipleTransitionsTest < Test::Unit::TestCase
def setup
@klass = Class.new
@machine = StateMachine::Machine.new(@klass)
@machine.state :parked, :idling
@machine.event :ignite
@event = StateMachine::Event.new(@machine, :ignite)
@event.transition(:idling => :idling)
@event.transition(:parked => :idling) # This one should get used
@event.transition(:parked => :parked)
@object = @klass.new
@object.state = 'parked'
end
def test_should_be_able_to_fire
assert @event.can_fire?(@object)
end
def test_should_have_a_transition
transition = @event.transition_for(@object)
assert_not_nil transition
assert_equal 'parked', transition.from
assert_equal 'idling', transition.to
assert_equal :ignite, transition.event
end
def test_should_allow_specific_transition_selection_using_from
transition = @event.transition_for(@object, :from => :idling)
assert_not_nil transition
assert_equal 'idling', transition.from
assert_equal 'idling', transition.to
assert_equal :ignite, transition.event
end
def test_should_allow_specific_transition_selection_using_to
transition = @event.transition_for(@object, :from => :parked, :to => :parked)
assert_not_nil transition
assert_equal 'parked', transition.from
assert_equal 'parked', transition.to
assert_equal :ignite, transition.event
end
def test_should_allow_specific_transition_selection_using_on
transition = @event.transition_for(@object, :on => :park)
assert_nil transition
transition = @event.transition_for(@object, :on => :ignite)
assert_not_nil transition
end
def test_should_fire
assert @event.fire(@object)
end
def test_should_change_the_current_state
@event.fire(@object)
assert_equal 'idling', @object.state
end
end
class EventWithMachineActionTest < Test::Unit::TestCase
def setup
@klass = Class.new do
attr_reader :saved
def save
@saved = true
end
end
@machine = StateMachine::Machine.new(@klass, :action => :save)
@machine.state :parked, :idling
@machine.events << @event = StateMachine::Event.new(@machine, :ignite)
@event.transition(:parked => :idling)
@object = @klass.new
@object.state = 'parked'
end
def test_should_run_action_on_fire
@event.fire(@object)
assert @object.saved
end
def test_should_not_run_action_if_configured_to_skip
@event.fire(@object, false)
assert [email protected]
end
end
class EventWithInvalidCurrentStateTest < Test::Unit::TestCase
def setup
@klass = Class.new
@machine = StateMachine::Machine.new(@klass)
@machine.state :parked, :idling
@machine.event :ignite
@event = StateMachine::Event.new(@machine, :ignite)
@event.transition(:parked => :idling)
@object = @klass.new
@object.state = 'invalid'
end
def test_should_raise_exception_when_checking_availability
exception = assert_raise(ArgumentError) { @event.can_fire?(@object) }
assert_equal '"invalid" is not a known state value', exception.message
end
def test_should_raise_exception_when_finding_transition
exception = assert_raise(ArgumentError) { @event.transition_for(@object) }
assert_equal '"invalid" is not a known state value', exception.message
end
def test_should_raise_exception_when_firing
exception = assert_raise(ArgumentError) { @event.fire(@object) }
assert_equal '"invalid" is not a known state value', exception.message
end
end
class EventWithMarshallingTest < Test::Unit::TestCase
def setup
@klass = Class.new do
def save
true
end
end
self.class.const_set('Example', @klass)
@machine = StateMachine::Machine.new(@klass, :action => :save)
@machine.state :parked, :idling
@machine.events << @event = StateMachine::Event.new(@machine, :ignite)
@event.transition(:parked => :idling)
@object = @klass.new
@object.state = 'parked'
end
def test_should_marshal_during_before_callbacks
@machine.before_transition {|object, transition| Marshal.dump(object)}
assert_nothing_raised { @event.fire(@object) }
end
def test_should_marshal_during_action
@klass.class_eval do
def save
Marshal.dump(self)
end
end
assert_nothing_raised { @event.fire(@object) }
end
def test_should_marshal_during_after_callbacks
@machine.after_transition {|object, transition| Marshal.dump(object)}
assert_nothing_raised { @event.fire(@object) }
end
def teardown
self.class.send(:remove_const, 'Example')
end
end
begin
# Load library
require 'rubygems'
require 'graphviz'
class EventDrawingTest < Test::Unit::TestCase
def setup
states = [:parked, :idling, :first_gear]
@machine = StateMachine::Machine.new(Class.new, :initial => :parked)
@machine.other_states(*states)
graph = GraphViz.new('G')
states.each {|state| graph.add_node(state.to_s)}
@event = StateMachine::Event.new(@machine , :park)
@event.transition :parked => :idling
@event.transition :first_gear => :parked
@event.transition :except_from => :parked, :to => :parked
@edges = @event.draw(graph)
end
def test_should_generate_edges_for_each_transition
assert_equal 4, @edges.size
end
def test_should_use_event_name_for_edge_label
assert_equal 'park', @edges.first['label']
end
end
rescue LoadError
$stderr.puts 'Skipping GraphViz StateMachine::Event tests. `gem install ruby-graphviz` and try again.'
end
Back to Top | {
"url": "https://searchcode.com/file/33420547/vendor/plugins/state_machine/test/unit/event_test.rb",
"source_domain": "searchcode.com",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "65036",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JVW5OQRNAPHYRXLK2H4STRWLF6E7UVUZ",
"WARC-Concurrent-To": "<urn:uuid:01d309b2-e2c7-4402-8080-e33c598584bf>",
"WARC-Date": "2017-08-19T05:40:04Z",
"WARC-IP-Address": "78.47.90.135",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DZ6Q5X4ASGF47UITPZOVK6SI2CC53VRD",
"WARC-Record-ID": "<urn:uuid:cadfbd3f-cf75-4069-b3c0-da195cc24700>",
"WARC-Target-URI": "https://searchcode.com/file/33420547/vendor/plugins/state_machine/test/unit/event_test.rb",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1f840a1c-0254-4bd2-9eeb-5e5be254c92c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-164-4-247.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,
63,
64,
88,
160,
247,
251,
255,
259,
263,
267,
271,
275,
279,
283,
287,
291,
295,
299,
303,
307,
311,
315,
319,
323,
327,
331,
335,
339,
343,
347,
351,
355,
359,
363,
367,
371,
375,
379,
383,
387,
391,
395,
399,
403,
407,
411,
415,
419,
423,
427,
431,
435,
439,
443,
447,
451,
455,
459,
463,
467,
471,
475,
479,
483,
487,
491,
495,
499,
503,
507,
511,
515,
519,
523,
527,
531,
535,
539,
543,
547,
551,
555,
559,
563,
567,
571,
575,
579,
583,
587,
591,
595,
599,
603,
607,
611,
615,
619,
623,
627,
631,
635,
639,
643,
647,
651,
655,
659,
663,
667,
671,
675,
679,
683,
687,
691,
695,
699,
703,
707,
711,
715,
719,
723,
727,
731,
735,
739,
743,
747,
751,
755,
759,
763,
767,
771,
775,
779,
783,
787,
791,
795,
799,
803,
807,
811,
815,
819,
823,
827,
831,
835,
839,
843,
847,
851,
855,
859,
863,
867,
871,
875,
879,
883,
887,
891,
895,
899,
903,
907,
911,
915,
919,
923,
927,
931,
935,
939,
943,
947,
951,
955,
959,
963,
967,
971,
975,
979,
983,
987,
991,
995,
999,
1003,
1007,
1011,
1015,
1019,
1023,
1027,
1031,
1035,
1039,
1043,
1047,
1051,
1055,
1059,
1063,
1067,
1071,
1075,
1079,
1083,
1087,
1091,
1095,
1099,
1103,
1107,
1111,
1115,
1119,
1123,
1127,
1131,
1135,
1139,
1143,
1147,
1151,
1155,
1159,
1163,
1167,
1171,
1175,
1179,
1183,
1187,
1191,
1195,
1199,
1203,
1207,
1211,
1215,
1219,
1223,
1227,
1231,
1235,
1239,
1243,
1247,
1251,
1255,
1259,
1263,
1267,
1271,
1275,
1279,
1283,
1287,
1291,
1295,
1299,
1303,
1307,
1311,
1315,
1319,
1323,
1327,
1331,
1335,
1339,
1343,
1347,
1351,
1355,
1359,
1363,
1367,
1371,
1375,
1379,
1383,
1387,
1391,
1395,
1399,
1403,
1407,
1411,
1415,
1419,
1423,
1427,
1431,
1435,
1439,
1443,
1447,
1451,
1455,
1459,
1463,
1467,
1471,
1475,
1479,
1483,
1487,
1491,
1495,
1499,
1503,
1507,
1511,
1515,
1519,
1523,
1527,
1531,
1535,
1539,
1543,
1547,
1551,
1555,
1559,
1563,
1567,
1571,
1575,
1579,
1583,
1587,
1591,
1595,
1599,
1603,
1607,
1611,
1615,
1619,
1623,
1627,
1631,
1635,
1639,
1643,
1647,
1651,
1655,
1659,
1663,
1667,
1671,
1675,
1679,
1683,
1687,
1691,
1695,
1699,
1703,
1707,
1711,
1715,
1719,
1723,
1727,
1731,
1735,
1739,
1743,
1747,
1751,
1755,
1759,
1763,
1767,
1771,
1775,
1779,
1783,
1787,
1791,
1795,
1799,
1803,
1807,
1811,
1815,
1819,
1823,
1827,
1831,
1835,
1839,
1843,
1847,
1851,
1855,
1859,
1863,
1867,
1871,
1875,
1879,
1883,
1887,
1891,
1895,
1899,
1903,
1907,
1911,
1915,
1919,
1923,
1927,
1931,
1935,
1939,
1943,
1947,
1951,
1955,
1959,
1963,
1967,
1971,
1975,
1979,
1983,
1987,
1991,
1995,
1999,
2003,
2007,
2011,
2015,
2019,
2023,
2027,
2031,
2035,
2039,
2043,
2047,
2051,
2055,
2059,
2063,
2067,
2071,
2075,
2079,
2083,
2087,
2091,
2095,
2099,
2103,
2107,
2111,
2115,
2119,
2123,
2127,
2131,
2135,
2139,
2143,
2147,
2151,
2155,
2159,
2163,
2167,
2171,
2175,
2179,
2183,
2187,
2191,
2195,
2199,
2203,
2207,
2211,
2215,
2219,
2223,
2227,
2231,
2235,
2239,
2243,
2247,
2251,
2255,
2259,
2263,
2267,
2271,
2275,
2279,
2283,
2287,
2291,
2295,
2299,
2303,
2307,
2311,
2315,
2319,
2323,
2327,
2331,
2335,
2339,
2343,
2347,
2351,
2355,
2359,
2363,
2367,
2371,
2375,
2379,
2383,
2387,
2391,
2395,
2399,
2403,
2407,
2411,
2415,
2419,
2423,
2427,
2431,
2435,
2439,
2443,
2447,
2451,
2455,
2459,
2463,
2467,
2471,
2475,
2479,
2483,
2487,
2491,
2495,
2499,
2503,
2507,
2511,
2515,
2519,
2523,
2527,
2531,
2535,
2539,
2543,
2547,
2551,
2555,
2559,
2563,
2567,
2571,
2575,
2579,
2583,
2587,
2591,
2595,
2599,
2603,
2607,
2611,
2615,
2619,
2623,
2627,
2631,
2635,
2639,
2643,
2647,
2651,
2655,
2659,
2663,
2667,
2671,
2675,
2679,
2683,
2687,
2691,
2695,
2699,
2703,
2707,
2711,
2715,
2719,
2723,
2727,
2731,
2735,
2739,
2743,
2747,
2751,
2755,
2759,
2763,
2767,
2771,
2775,
2779,
2783,
2787,
2791,
2795,
2799,
2803,
2807,
2811,
2815,
2819,
2823,
2827,
2831,
2835,
2839,
2843,
2847,
2851,
2855,
2859,
2863,
2867,
2871,
2875,
2879,
2883,
2887,
2891,
2895,
2899,
2903,
2907,
2911,
2915,
2919,
2923,
2927,
2931,
2935,
2939,
2943,
2947,
2951,
2955,
2959,
2963,
2967,
2971,
2975,
2979,
2983,
2987,
2991,
2995,
2999,
3003,
3007,
3011,
3015,
3019,
3023,
3027,
3031,
3035,
3039,
3043,
3047,
3051,
3055,
3059,
3063,
3067,
3071,
3075,
3079,
3083,
3087,
3091,
3095,
3099,
3103,
3107,
3111,
3115,
3119,
3123,
3127,
3131,
3135,
3139,
3143,
3147,
3151,
3155,
3159,
3163,
3167,
3171,
3175,
3179,
3183,
3187,
3191,
3195,
3199,
3203,
3207,
3211,
3215,
3219,
3288,
3289,
3337,
3349,
3372,
3421,
3477,
3482,
3507,
3513,
3516,
3549,
3591,
3597,
3600,
3630,
3668,
3674,
3677,
3717,
3765,
3771,
3774,
3812,
3844,
3850,
3853,
3892,
3930,
3936,
3939,
3977,
4015,
4021,
4024,
4064,
4110,
4116,
4119,
4156,
4201,
4207,
4210,
4257,
4308,
4314,
4317,
4352,
4392,
4398,
4401,
4440,
4481,
4487,
4491,
4492,
4531,
4543,
4595,
4651,
4692,
4698,
4701,
4742,
4797,
4830,
4875,
4881,
4884,
4948,
4966,
4971,
4999,
5033,
5041,
5046,
5184,
5190,
5193,
5230,
5334,
5340,
5344,
5345,
5406,
5418,
5444,
5466,
5476,
5486,
5493,
5521,
5531,
5541,
5548,
5565,
5575,
5585,
5592,
5610,
5620,
5630,
5638,
5687,
5743,
5768,
5774,
5777,
5818,
5858,
5864,
5867,
5918,
5964,
5970,
5973,
6011,
6046,
6052,
6055,
6098,
6134,
6140,
6143,
6182,
6207,
6229,
6251,
6261,
6268,
6296,
6318,
6328,
6335,
6352,
6374,
6384,
6391,
6409,
6423,
6439,
6451,
6482,
6494,
6506,
6516,
6524,
6529,
6569,
6615,
6650,
6686,
6692,
6696,
6697,
6749,
6761,
6784,
6856,
6912,
6937,
6943,
6946,
6976,
7014,
7020,
7023,
7063,
7117,
7123,
7126,
7164,
7215,
7221,
7224,
7272,
7329,
7335,
7338,
7373,
7419,
7425,
7428,
7468,
7515,
7521,
7525,
7526,
7576,
7588,
7640,
7696,
7702,
7705,
7772,
7838,
7844,
7847,
7885,
7965,
8022,
8028,
8031,
8077,
8123,
8202,
8261,
8267,
8270,
8315,
8402,
8466,
8472,
8475,
8520,
8607,
8671,
8677,
8680,
8737,
8801,
8807,
8810,
8869,
8931,
8937,
8940,
8983,
9054,
9060,
9063,
9121,
9170,
9176,
9179,
9238,
9298,
9304,
9307,
9342,
9388,
9428,
9434,
9438,
9439,
9494,
9506,
9558,
9614,
9645,
9651,
9654,
9711,
9767,
9773,
9776,
9839,
9907,
9913,
9917,
9918,
9975,
9987,
10010,
10059,
10115,
10140,
10146,
10149,
10187,
10225,
10231,
10234,
10274,
10320,
10326,
10329,
10356,
10389,
10395,
10398,
10445,
10470,
10499,
10505,
10509,
10510,
10564,
10576,
10599,
10648,
10704,
10746,
10792,
10798,
10801,
10865,
10935,
10941,
10944,
11019,
11043,
11086,
11091,
11171,
11177,
11180,
11217,
11345,
11351,
11355,
11356,
11421,
11433,
11456,
11505,
11541,
11546,
11602,
11644,
11649,
11674,
11703,
11709,
11712,
11750,
11788,
11794,
11797,
11837,
11883,
11889,
11892,
11919,
11952,
11958,
11961,
12008,
12033,
12074,
12080,
12084,
12085,
12155,
12167,
12232,
12294,
12362,
12372,
12379,
12403,
12430,
12440,
12449,
12454,
12480,
12508,
12516,
12521,
12595,
12631,
12636,
12692,
12757,
12762,
12787,
12816,
12822,
12825,
12863,
12901,
12907,
12910,
12950,
12996,
13002,
13005,
13032,
13065,
13071,
13074,
13121,
13146,
13187,
13193,
13196,
13235,
13260,
13328,
13334,
13337,
13376,
13409,
13414,
13439,
13507,
13513,
13516,
13531,
13592,
13598,
13602,
13603,
13672,
13684,
13749,
13811,
13879,
13889,
13896,
13920,
13947,
13957,
13966,
13971,
13997,
14025,
14033,
14038,
14112,
14148,
14175,
14180,
14236,
14278,
14283,
14308,
14337,
14343,
14346,
14380,
14417,
14423,
14426,
14462,
14510,
14540,
14583,
14624,
14667,
14673,
14676,
14699,
14731,
14737,
14740,
14783,
14808,
14849,
14855,
14858,
14897,
14930,
14935,
14960,
14996,
15002,
15005,
15048,
15073,
15109,
15115,
15118,
15133,
15194,
15200,
15204,
15205,
15272,
15284,
15307,
15356,
15383,
15408,
15413,
15467,
15507,
15512,
15537,
15566,
15572,
15575,
15609,
15646,
15652,
15655,
15691,
15739,
15769,
15812,
15853,
15894,
15900,
15903,
15926,
15958,
15964,
15967,
16014,
16039,
16080,
16086,
16090,
16091,
16158,
16170,
16193,
16242,
16274,
16299,
16304,
16358,
16396,
16401,
16426,
16455,
16461,
16464,
16498,
16535,
16541,
16544,
16580,
16628,
16658,
16701,
16737,
16778,
16784,
16787,
16810,
16842,
16848,
16851,
16898,
16923,
16959,
16965,
16969,
16970,
17032,
17044,
17067,
17116,
17152,
17179,
17184,
17240,
17282,
17351,
17393,
17398,
17423,
17452,
17458,
17461,
17495,
17532,
17538,
17541,
17577,
17625,
17655,
17698,
17739,
17782,
17788,
17791,
17856,
17922,
17927,
17957,
18000,
18041,
18084,
18090,
18093,
18156,
18238,
18243,
18273,
18316,
18357,
18400,
18406,
18409,
18472,
18534,
18560,
18565,
18629,
18659,
18665,
18668,
18691,
18723,
18729,
18732,
18775,
18800,
18841,
18847,
18851,
18852,
18908,
18920,
18946,
18971,
18978,
18993,
19015,
19025,
19033,
19038,
19105,
19141,
19146,
19221,
19263,
19268,
19293,
19322,
19328,
19331,
19368,
19393,
19418,
19424,
19427,
19482,
19514,
19540,
19546,
19550,
19551,
19613,
19625,
19648,
19697,
19733,
19760,
19765,
19821,
19863,
19868,
19893,
19923,
19929,
19932,
19993,
20067,
20142,
20148,
20151,
20209,
20288,
20363,
20369,
20372,
20418,
20487,
20562,
20568,
20572,
20573,
20627,
20639,
20665,
20680,
20693,
20703,
20711,
20755,
20760,
20827,
20863,
20868,
20943,
20985,
20990,
21015,
21044,
21050,
21053,
21103,
21178,
21229,
21235,
21238,
21278,
21303,
21318,
21345,
21355,
21363,
21368,
21419,
21425,
21428,
21477,
21551,
21602,
21608,
21611,
21626,
21672,
21678,
21682,
21683,
21689,
21706,
21727,
21748,
21751,
21799,
21813,
21860,
21867,
21942,
21979,
21986,
22018,
22073,
22080,
22137,
22180,
22227,
22291,
22298,
22332,
22340,
22345,
22400,
22434,
22442,
22447,
22497,
22546,
22554,
22560,
22577,
22682,
22686
],
"line_end_idx": [
63,
64,
88,
160,
247,
251,
255,
259,
263,
267,
271,
275,
279,
283,
287,
291,
295,
299,
303,
307,
311,
315,
319,
323,
327,
331,
335,
339,
343,
347,
351,
355,
359,
363,
367,
371,
375,
379,
383,
387,
391,
395,
399,
403,
407,
411,
415,
419,
423,
427,
431,
435,
439,
443,
447,
451,
455,
459,
463,
467,
471,
475,
479,
483,
487,
491,
495,
499,
503,
507,
511,
515,
519,
523,
527,
531,
535,
539,
543,
547,
551,
555,
559,
563,
567,
571,
575,
579,
583,
587,
591,
595,
599,
603,
607,
611,
615,
619,
623,
627,
631,
635,
639,
643,
647,
651,
655,
659,
663,
667,
671,
675,
679,
683,
687,
691,
695,
699,
703,
707,
711,
715,
719,
723,
727,
731,
735,
739,
743,
747,
751,
755,
759,
763,
767,
771,
775,
779,
783,
787,
791,
795,
799,
803,
807,
811,
815,
819,
823,
827,
831,
835,
839,
843,
847,
851,
855,
859,
863,
867,
871,
875,
879,
883,
887,
891,
895,
899,
903,
907,
911,
915,
919,
923,
927,
931,
935,
939,
943,
947,
951,
955,
959,
963,
967,
971,
975,
979,
983,
987,
991,
995,
999,
1003,
1007,
1011,
1015,
1019,
1023,
1027,
1031,
1035,
1039,
1043,
1047,
1051,
1055,
1059,
1063,
1067,
1071,
1075,
1079,
1083,
1087,
1091,
1095,
1099,
1103,
1107,
1111,
1115,
1119,
1123,
1127,
1131,
1135,
1139,
1143,
1147,
1151,
1155,
1159,
1163,
1167,
1171,
1175,
1179,
1183,
1187,
1191,
1195,
1199,
1203,
1207,
1211,
1215,
1219,
1223,
1227,
1231,
1235,
1239,
1243,
1247,
1251,
1255,
1259,
1263,
1267,
1271,
1275,
1279,
1283,
1287,
1291,
1295,
1299,
1303,
1307,
1311,
1315,
1319,
1323,
1327,
1331,
1335,
1339,
1343,
1347,
1351,
1355,
1359,
1363,
1367,
1371,
1375,
1379,
1383,
1387,
1391,
1395,
1399,
1403,
1407,
1411,
1415,
1419,
1423,
1427,
1431,
1435,
1439,
1443,
1447,
1451,
1455,
1459,
1463,
1467,
1471,
1475,
1479,
1483,
1487,
1491,
1495,
1499,
1503,
1507,
1511,
1515,
1519,
1523,
1527,
1531,
1535,
1539,
1543,
1547,
1551,
1555,
1559,
1563,
1567,
1571,
1575,
1579,
1583,
1587,
1591,
1595,
1599,
1603,
1607,
1611,
1615,
1619,
1623,
1627,
1631,
1635,
1639,
1643,
1647,
1651,
1655,
1659,
1663,
1667,
1671,
1675,
1679,
1683,
1687,
1691,
1695,
1699,
1703,
1707,
1711,
1715,
1719,
1723,
1727,
1731,
1735,
1739,
1743,
1747,
1751,
1755,
1759,
1763,
1767,
1771,
1775,
1779,
1783,
1787,
1791,
1795,
1799,
1803,
1807,
1811,
1815,
1819,
1823,
1827,
1831,
1835,
1839,
1843,
1847,
1851,
1855,
1859,
1863,
1867,
1871,
1875,
1879,
1883,
1887,
1891,
1895,
1899,
1903,
1907,
1911,
1915,
1919,
1923,
1927,
1931,
1935,
1939,
1943,
1947,
1951,
1955,
1959,
1963,
1967,
1971,
1975,
1979,
1983,
1987,
1991,
1995,
1999,
2003,
2007,
2011,
2015,
2019,
2023,
2027,
2031,
2035,
2039,
2043,
2047,
2051,
2055,
2059,
2063,
2067,
2071,
2075,
2079,
2083,
2087,
2091,
2095,
2099,
2103,
2107,
2111,
2115,
2119,
2123,
2127,
2131,
2135,
2139,
2143,
2147,
2151,
2155,
2159,
2163,
2167,
2171,
2175,
2179,
2183,
2187,
2191,
2195,
2199,
2203,
2207,
2211,
2215,
2219,
2223,
2227,
2231,
2235,
2239,
2243,
2247,
2251,
2255,
2259,
2263,
2267,
2271,
2275,
2279,
2283,
2287,
2291,
2295,
2299,
2303,
2307,
2311,
2315,
2319,
2323,
2327,
2331,
2335,
2339,
2343,
2347,
2351,
2355,
2359,
2363,
2367,
2371,
2375,
2379,
2383,
2387,
2391,
2395,
2399,
2403,
2407,
2411,
2415,
2419,
2423,
2427,
2431,
2435,
2439,
2443,
2447,
2451,
2455,
2459,
2463,
2467,
2471,
2475,
2479,
2483,
2487,
2491,
2495,
2499,
2503,
2507,
2511,
2515,
2519,
2523,
2527,
2531,
2535,
2539,
2543,
2547,
2551,
2555,
2559,
2563,
2567,
2571,
2575,
2579,
2583,
2587,
2591,
2595,
2599,
2603,
2607,
2611,
2615,
2619,
2623,
2627,
2631,
2635,
2639,
2643,
2647,
2651,
2655,
2659,
2663,
2667,
2671,
2675,
2679,
2683,
2687,
2691,
2695,
2699,
2703,
2707,
2711,
2715,
2719,
2723,
2727,
2731,
2735,
2739,
2743,
2747,
2751,
2755,
2759,
2763,
2767,
2771,
2775,
2779,
2783,
2787,
2791,
2795,
2799,
2803,
2807,
2811,
2815,
2819,
2823,
2827,
2831,
2835,
2839,
2843,
2847,
2851,
2855,
2859,
2863,
2867,
2871,
2875,
2879,
2883,
2887,
2891,
2895,
2899,
2903,
2907,
2911,
2915,
2919,
2923,
2927,
2931,
2935,
2939,
2943,
2947,
2951,
2955,
2959,
2963,
2967,
2971,
2975,
2979,
2983,
2987,
2991,
2995,
2999,
3003,
3007,
3011,
3015,
3019,
3023,
3027,
3031,
3035,
3039,
3043,
3047,
3051,
3055,
3059,
3063,
3067,
3071,
3075,
3079,
3083,
3087,
3091,
3095,
3099,
3103,
3107,
3111,
3115,
3119,
3123,
3127,
3131,
3135,
3139,
3143,
3147,
3151,
3155,
3159,
3163,
3167,
3171,
3175,
3179,
3183,
3187,
3191,
3195,
3199,
3203,
3207,
3211,
3215,
3219,
3288,
3289,
3337,
3349,
3372,
3421,
3477,
3482,
3507,
3513,
3516,
3549,
3591,
3597,
3600,
3630,
3668,
3674,
3677,
3717,
3765,
3771,
3774,
3812,
3844,
3850,
3853,
3892,
3930,
3936,
3939,
3977,
4015,
4021,
4024,
4064,
4110,
4116,
4119,
4156,
4201,
4207,
4210,
4257,
4308,
4314,
4317,
4352,
4392,
4398,
4401,
4440,
4481,
4487,
4491,
4492,
4531,
4543,
4595,
4651,
4692,
4698,
4701,
4742,
4797,
4830,
4875,
4881,
4884,
4948,
4966,
4971,
4999,
5033,
5041,
5046,
5184,
5190,
5193,
5230,
5334,
5340,
5344,
5345,
5406,
5418,
5444,
5466,
5476,
5486,
5493,
5521,
5531,
5541,
5548,
5565,
5575,
5585,
5592,
5610,
5620,
5630,
5638,
5687,
5743,
5768,
5774,
5777,
5818,
5858,
5864,
5867,
5918,
5964,
5970,
5973,
6011,
6046,
6052,
6055,
6098,
6134,
6140,
6143,
6182,
6207,
6229,
6251,
6261,
6268,
6296,
6318,
6328,
6335,
6352,
6374,
6384,
6391,
6409,
6423,
6439,
6451,
6482,
6494,
6506,
6516,
6524,
6529,
6569,
6615,
6650,
6686,
6692,
6696,
6697,
6749,
6761,
6784,
6856,
6912,
6937,
6943,
6946,
6976,
7014,
7020,
7023,
7063,
7117,
7123,
7126,
7164,
7215,
7221,
7224,
7272,
7329,
7335,
7338,
7373,
7419,
7425,
7428,
7468,
7515,
7521,
7525,
7526,
7576,
7588,
7640,
7696,
7702,
7705,
7772,
7838,
7844,
7847,
7885,
7965,
8022,
8028,
8031,
8077,
8123,
8202,
8261,
8267,
8270,
8315,
8402,
8466,
8472,
8475,
8520,
8607,
8671,
8677,
8680,
8737,
8801,
8807,
8810,
8869,
8931,
8937,
8940,
8983,
9054,
9060,
9063,
9121,
9170,
9176,
9179,
9238,
9298,
9304,
9307,
9342,
9388,
9428,
9434,
9438,
9439,
9494,
9506,
9558,
9614,
9645,
9651,
9654,
9711,
9767,
9773,
9776,
9839,
9907,
9913,
9917,
9918,
9975,
9987,
10010,
10059,
10115,
10140,
10146,
10149,
10187,
10225,
10231,
10234,
10274,
10320,
10326,
10329,
10356,
10389,
10395,
10398,
10445,
10470,
10499,
10505,
10509,
10510,
10564,
10576,
10599,
10648,
10704,
10746,
10792,
10798,
10801,
10865,
10935,
10941,
10944,
11019,
11043,
11086,
11091,
11171,
11177,
11180,
11217,
11345,
11351,
11355,
11356,
11421,
11433,
11456,
11505,
11541,
11546,
11602,
11644,
11649,
11674,
11703,
11709,
11712,
11750,
11788,
11794,
11797,
11837,
11883,
11889,
11892,
11919,
11952,
11958,
11961,
12008,
12033,
12074,
12080,
12084,
12085,
12155,
12167,
12232,
12294,
12362,
12372,
12379,
12403,
12430,
12440,
12449,
12454,
12480,
12508,
12516,
12521,
12595,
12631,
12636,
12692,
12757,
12762,
12787,
12816,
12822,
12825,
12863,
12901,
12907,
12910,
12950,
12996,
13002,
13005,
13032,
13065,
13071,
13074,
13121,
13146,
13187,
13193,
13196,
13235,
13260,
13328,
13334,
13337,
13376,
13409,
13414,
13439,
13507,
13513,
13516,
13531,
13592,
13598,
13602,
13603,
13672,
13684,
13749,
13811,
13879,
13889,
13896,
13920,
13947,
13957,
13966,
13971,
13997,
14025,
14033,
14038,
14112,
14148,
14175,
14180,
14236,
14278,
14283,
14308,
14337,
14343,
14346,
14380,
14417,
14423,
14426,
14462,
14510,
14540,
14583,
14624,
14667,
14673,
14676,
14699,
14731,
14737,
14740,
14783,
14808,
14849,
14855,
14858,
14897,
14930,
14935,
14960,
14996,
15002,
15005,
15048,
15073,
15109,
15115,
15118,
15133,
15194,
15200,
15204,
15205,
15272,
15284,
15307,
15356,
15383,
15408,
15413,
15467,
15507,
15512,
15537,
15566,
15572,
15575,
15609,
15646,
15652,
15655,
15691,
15739,
15769,
15812,
15853,
15894,
15900,
15903,
15926,
15958,
15964,
15967,
16014,
16039,
16080,
16086,
16090,
16091,
16158,
16170,
16193,
16242,
16274,
16299,
16304,
16358,
16396,
16401,
16426,
16455,
16461,
16464,
16498,
16535,
16541,
16544,
16580,
16628,
16658,
16701,
16737,
16778,
16784,
16787,
16810,
16842,
16848,
16851,
16898,
16923,
16959,
16965,
16969,
16970,
17032,
17044,
17067,
17116,
17152,
17179,
17184,
17240,
17282,
17351,
17393,
17398,
17423,
17452,
17458,
17461,
17495,
17532,
17538,
17541,
17577,
17625,
17655,
17698,
17739,
17782,
17788,
17791,
17856,
17922,
17927,
17957,
18000,
18041,
18084,
18090,
18093,
18156,
18238,
18243,
18273,
18316,
18357,
18400,
18406,
18409,
18472,
18534,
18560,
18565,
18629,
18659,
18665,
18668,
18691,
18723,
18729,
18732,
18775,
18800,
18841,
18847,
18851,
18852,
18908,
18920,
18946,
18971,
18978,
18993,
19015,
19025,
19033,
19038,
19105,
19141,
19146,
19221,
19263,
19268,
19293,
19322,
19328,
19331,
19368,
19393,
19418,
19424,
19427,
19482,
19514,
19540,
19546,
19550,
19551,
19613,
19625,
19648,
19697,
19733,
19760,
19765,
19821,
19863,
19868,
19893,
19923,
19929,
19932,
19993,
20067,
20142,
20148,
20151,
20209,
20288,
20363,
20369,
20372,
20418,
20487,
20562,
20568,
20572,
20573,
20627,
20639,
20665,
20680,
20693,
20703,
20711,
20755,
20760,
20827,
20863,
20868,
20943,
20985,
20990,
21015,
21044,
21050,
21053,
21103,
21178,
21229,
21235,
21238,
21278,
21303,
21318,
21345,
21355,
21363,
21368,
21419,
21425,
21428,
21477,
21551,
21602,
21608,
21611,
21626,
21672,
21678,
21682,
21683,
21689,
21706,
21727,
21748,
21751,
21799,
21813,
21860,
21867,
21942,
21979,
21986,
22018,
22073,
22080,
22137,
22180,
22227,
22291,
22298,
22332,
22340,
22345,
22400,
22434,
22442,
22447,
22497,
22546,
22554,
22560,
22577,
22682,
22686,
22697
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 22697,
"ccnet_original_nlines": 1491,
"rps_doc_curly_bracket": 0.0014979999978095293,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.03794309124350548,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0009985000360757113,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5586619973182678,
"rps_doc_frac_unique_words": 0.5134865045547485,
"rps_doc_mean_word_length": 7.672327518463135,
"rps_doc_num_sentences": 335,
"rps_doc_symbol_to_word_ratio": 0.0009985000360757113,
"rps_doc_unigram_entropy": 5.928030967712402,
"rps_doc_word_count": 2002,
"rps_doc_frac_chars_dupe_10grams": 0.28268229961395264,
"rps_doc_frac_chars_dupe_5grams": 0.4432942569255829,
"rps_doc_frac_chars_dupe_6grams": 0.4167317748069763,
"rps_doc_frac_chars_dupe_7grams": 0.3955729305744171,
"rps_doc_frac_chars_dupe_8grams": 0.3656249940395355,
"rps_doc_frac_chars_dupe_9grams": 0.3186849057674408,
"rps_doc_frac_chars_top_2gram": 0.03789062052965164,
"rps_doc_frac_chars_top_3gram": 0.02812499925494194,
"rps_doc_frac_chars_top_4gram": 0.02265625074505806,
"rps_doc_books_importance": -2336.669677734375,
"rps_doc_books_importance_length_correction": -2336.669677734375,
"rps_doc_openwebtext_importance": -1490.3043212890625,
"rps_doc_openwebtext_importance_length_correction": -1490.3043212890625,
"rps_doc_wikipedia_importance": -999.6859741210938,
"rps_doc_wikipedia_importance_length_correction": -999.6859741210938
},
"fasttext": {
"dclm": 0.9922959804534912,
"english": 0.3742203712463379,
"fineweb_edu_approx": 3.3359110355377197,
"eai_general_math": 0.9738696813583374,
"eai_open_web_math": 0.024368049576878548,
"eai_web_code": 0.2844240069389343
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-2,454,436,040,988,463,600 | cancel
Showing results for
Show only | Search instead for
Did you mean:
Go to solution
GoDaddy and WordPress not user friendly
I've had two domains registered through GoDaddy for years. I decided to rebuild one of my sites and host it with GoDaddy. I have a blog with WordPress and decided to use WP to build my site here. What I am finding is that it is extremely difficult to navigate and edit my pages and so on. I am not new to building websites so it is not a skill deficiency. Is there a tutorial of some sort that show how to find these edit tools, etc.? I want to add and delete pages, put in text, insert images, etc. Thank you in advance for any guidance.
1 ACCEPTED SOLUTION
Hi @Sarah93003,
@Nate made a very good point in that Wordpress.com is wordpress automattic's way. Every hosting company has their own base-installation packages for WordPress. Having used MANY, GoDaddy's is a good, solid installation.
Did you have multiple sites at WordPress.Com? When you see that interface its somewhat similar to a "multi-site" installation.
As you move away from WordPress.Com you'll want a good simple, theme and builder. May I suggest BeaverBuilder or WP-Astra. I use it extensively and I've added an inline editor to make it even easier. It is also a GoDaddy recommended theme/plugin. Also explore Divi -- its called a mega-theme.
By getting an inexpensive, paid premium theme you'll find many, many more features readily available and won't get into the mushwah (thanks @Sherig !)of plugin-compatibility and searching for the "right" plug-in. You might find a niche' theme that's perfect.
With regard to hosting, when you were at wordpress.com you were on a "managed" hosting platform. Everything done for you, but done 100% wordpress.com's way. In your transition to GoDaddy may I suggest one of the managed plans here. Once again, you won't have to worry about Linux!! There is a HUGE difference between cPanel hosting and Managed Hosting.
Hope this helps,
James
Not Just Pretty Sites, Pretty Doggone Smart Sites
View solution in original post
14 REPLIES 14
Super User III
WordPress is extensively documented.
https://codex.wordpress.org/Main_Page
You can also refer to your favorite search or video sharing site to find guides and tutorials for your skill level.
Thank you Nate for the reply but it doesn't address my issue. As previously mentioned I have a blog on Wordpress and I'm familiar with using WP. I don't know if GoDaddy is using a light version or what the deal is but basically when I log into my GoDaddy account it is not easy to even find when to do to create and edit afterward. Once I do find the dashboard to my website, the features are very, very limited as to what I can edit. When I have used hosting packages elsewhere, such as Network Solutions, or Host Gator, the website tools were much, much better. I would expect a simpler approach that what I have encountered so far. I've spent 3-4 hours just clicking around trying to build a simple website. I'm at the point that I think I may have made a mistake choosing GoDaddy to host a website.
It is just not clear where you are having an issue.
You can login to WordPress by clicking WP Admin where you manage the Hosting, or directly at yourdomain.com/wp-admin
Once there you can add a new page by clicking Pages and then Add new.
@Sarah93003
You did not make a mistake choosing GoDaddy, I have at least 8 WordPress sites hosted on my GoDaddy account. But your description of your problem (frustration) is not clear. You say you have experience with a WordPress 'blog'. Is that on WordPress.com or one you built yourself with components from WordPress.org? There is a difference. If you had GoDaddy install the basic WordPress site for you, then it has minimal plugins and themes and you will need to add the rest yourself. But you can do that from the WP admin panel. You don't need to log in to the GoDaddy to do that. If you could be more specific about the problem, perhaps we could help you.
Maury
Thank you Maury for your reply. The blog I mentioned I have is with WordPress.com. It's pretty straight forward in editing, adding photos, backgrounds, etc.
With GoDaddy, I did choose Wordpress since I was familiar with it. At first I was taken aback since it mentions Linux, but I didn't see any other options. It gave me the choice to install WP, and I did. I use a MacBook Air and don't see WP actually installed on my machine so my assumption is that it was installed on my account some how.
My frustration begins when I first access my account on GoDaddy and it isn't obvious where I go next. It takes a bit of fishing around to eventually get to something I assume is WP since I see the logo. Not much is available on the dashboard so I click on the link to my website and the changes I can make are very limited.
WordPress.com is a service that is simplified for beginners to make a website, but it can be too limited for more advanced users. WordPress.org is software installed into a hosting account which gives you more power and flexibility with the website.
Have you been able to login to the WordPress dashboard, where it's yourdomain.com/wp-admin in the address bar?
This should have many of the things you're familiar with; Posts, Pages, Comments, etc. With having more control over the website you'll need to choose the options you want. Under the Plugins tab you can find and select what functionality you need the website to have.
Hi @Sarah93003,
@Nate made a very good point in that Wordpress.com is wordpress automattic's way. Every hosting company has their own base-installation packages for WordPress. Having used MANY, GoDaddy's is a good, solid installation.
Did you have multiple sites at WordPress.Com? When you see that interface its somewhat similar to a "multi-site" installation.
As you move away from WordPress.Com you'll want a good simple, theme and builder. May I suggest BeaverBuilder or WP-Astra. I use it extensively and I've added an inline editor to make it even easier. It is also a GoDaddy recommended theme/plugin. Also explore Divi -- its called a mega-theme.
By getting an inexpensive, paid premium theme you'll find many, many more features readily available and won't get into the mushwah (thanks @Sherig !)of plugin-compatibility and searching for the "right" plug-in. You might find a niche' theme that's perfect.
With regard to hosting, when you were at wordpress.com you were on a "managed" hosting platform. Everything done for you, but done 100% wordpress.com's way. In your transition to GoDaddy may I suggest one of the managed plans here. Once again, you won't have to worry about Linux!! There is a HUGE difference between cPanel hosting and Managed Hosting.
Hope this helps,
James
Not Just Pretty Sites, Pretty Doggone Smart Sites
View solution in original post
Thank you for the input James. Today, I'm back exploring to find the tools, etc. I accessed via C-Panel and see where I can begin to edit blocks of text, etc. I'm assuming that is where I am to begin. I am not familiar with Linux and assume it has to do with GoDaddy and not my laptop. I am working from a MacBook Air. My website is www.MosriteCelebrity.com and if visited you'll see it only has the home page and very little text from me. I'm designing in my mind how I want this to be. My website is devoted to a particular family of Mosrite guitars that were originally built in California. The founder passed away in 1994 and all records were lost in two separate factory fires. In short, my website is the result of 10+ of research and documenting the surviving examples of these guitars.
My original website had over 2500 photos and about 20 separate pages. Since it was lost about 5 years ago (the website host) I've added many more photos and information. That is the essence of the site I am trying to build.
Thanks,
Sarah
@Sarah,
Perhaps it will help you if I describe the kind of process I go thru when I design a site for a new 'client'. I put 'client' in quote marks because all of my work if for non-profits and grassroots political groups. My company, Zayda Productions (Zayda means Grandfather) is also 'non-profit' because I wouldn't know how to make one if I wanted to. It's my new 'hobby' since I retired.
The very first question is 'what kind of site do you want?' or 'What is the story you are trying to tell?' Reading the history of you site I would guess you want a combination of a blog and a photo gallery. I don't see that you are selling merchandise or collecting donations, etc. So this will be a rather simple content to deal with. Then I want to know who and how large your audience will be and how often you will be updating the site with new information.
On the technical side, now that WordPress, including the database, is installed on your hosting server, you can pretty much forget about the cPanel. Most of your work will be done from the admin panel in WordPress itself. In other words, you will login to your site from <yoursitename>/wp-admin. Adding new plugin modules, changing or modifying themes, adding new pages and posts, adding widgets to the sidebar or footer and building your picture gallery can all be done from the WP admin panel.There are any number of sites where you can read lists of recommended plugins; for example, WPBeginner.com and WPMUDev.org. You can get a list of plugins at WordPress.org by typing in a keyword like 'photo gallery'. One caveat: for any plugin, look at the number of installs and the date of the last update to be sure it is well supported and up to date. For site security, you always want to keep your WP core, plugins and themes up to date. Trust me, they change fairly frequently, but the admin panel will show you when there are updates to the items you are using. Also, be aware that many free plugins offer 'premium' add-ons for purchase. So check the free version to see what features are included and which you have to pay for.
As for the theme you choose, be sure it is 'responsive'. i.e. that it adjusts to fit mobile devices as well as desktop screens. Unless GoDaddy is managing your site, you are not limited to their selection of themes. The Escapade theme you are using seems to be designed for product sales rather than story telling. You might find one more to your liking from the 3200 free themes available on WP. One of the nice features of WP is that you can install several themes at the same time on your site and then preview them to see how they fit with your site.
If you have more questions, don't hesitate to ask.
Maury
Thank you Maury for the lengthy response. I greatly appreciate everything that everyone has shared. The audience I'm reaching out to are people looking for accurate information regarding the Mosrite Celebrity family of guitars. These were the hollow body guitars made from 1965 to 1976. They are wonderful guitars and many have survived over the years and are still phenomenal after 50+ years. I get contacted by people from all over the world. They are seeking information and sometimes looking for parts to restore their guitar. I don't plan to have a commerce element. I do need to have separate pages because I go through the history, each individual model in great detail, evolution of various components, collateral material, amplifiers, and more. I'm not sure if blog will suffice. The photographs will be on every page and I'll likely have a gallery of each guitar by serial number.
I'm not sure how to tell if the template I choose is responsive. Is there a clue in there someplace? I'm not sure how to access the 3200 templates that you mention.
Thanks,
Sarah
Hi @Sarah93003,
Quick answer tonight. Even when the theme author says it is responsive, I always link to my website on my smartphone and look at the result to see if I like the way the elements have been rearranged.for the vertical orientation of the phone. Wouldn't hurt to check it on a tablet too if you have one. As for the repository of 3200 themes on WordPress.org they are at: https://wordpress.org/themes/
I'm not a real guitar aficionado but I did buy an Ariana for $22 at a Washington's birthday sale and tried to learn to play back in the 70's. You brought back a lot of memories. I bought hardware from Linda Ronstadt's father in Tucson, AZ in the 60's and I still have her Stone Ponies album. We were at the Cellar Door in Georgetown (Washington, DC) to hear John Denver the night he and Bill Danoff wrote Country Roads. Joan Baez lives just up the road from me in Woodside and I built a website for a woman who once lived in a tree house up on Struggle Mountain with Joan and her husband David Harris. Yeah, you brought back a lot of memories.
Maury
@Sarah93003 Linux is the operating system and cPanel is like the 'System Preferences'. So for example you wouldn't need to know the ins and outs of macOS to work on a spread sheet.
Once you are logged into your WordPress install (yourdomain.com/wp-admin) a lot of stuff can be accomplished in the point and click interface, it is up to you if you want to dig deeper with custom coding and more advanced features like that.
You can browse and install themes right inside of WordPress by clicking Appearance > Themes from the menu on the left, and then click the Add New button at the top. Here you'll find categories like Popular and New, you can use the Filter to narrow it down or use the Search themes feature. Plug-ins (which add functionality) can be found and added similarly by selecting Plugins > Add new from the menu.
There are plugins that you can use instead of the default WordPress editors (like BeaverBuilder or WP-Astra @JMPepper suggested earlier). There are many others to choose from, like integrating with Social Media, many different management, SEO, and security tools etc. But don't get too carried away, try to keep it down to just what you need to make the site you want. And as @mauryg suggested, always make sure to check the ratings and reviews and ensure to only install what is actively being updated to avoid obsolete software.
It'll probably be easier to see it in action, at the 13 min mark of this video I've found they go over the WordPress Dashboard:
https://www.youtube.com/watch?v=G2UvmRWTFVo&t=780s
There are many other videos about WordPress on there too that show just about anything you want to know about WordPress.
Hi @Sarah93003,
Both @mauryg and @Nate have good ideas and suggestions. Because of the way that wordpress.com operates, we cannot (that I know of) install a "migration" plugin to move your site. However, one thing you can do is export content and at least import your post/pages from your wordpress.com site.
Here is a pretty good article with some step-by-step instructions.
https://www.sitepoint.com/migrating-from-wordpress-com/
What theme are you using by the way?
Love your site concept. I actually have several guitar tattoos! I got a custom built from Ed Roman who had a huge respect for Mosrite.
PM is you'd like some more help on specifics for your site! I'll be glad to do what I can to help to keep the music playing!
Hope this helps!
James
Not Just Pretty Sites, Pretty Doggone Smart Sites
@Sarah93003Let us know if you decide to stick with the transition. It can be a bit of a learning curve going from WordPress.com to WordPress.org but once you have it all setup you may actually like it better. But if you're not interested in any of the features and are happier with your previous workflow it may not be worth the effort. | {
"url": "https://uk.godaddy.com/community/Using-WordPress/GoDaddy-and-WordPress-not-user-friendly/td-p/107357",
"source_domain": "uk.godaddy.com",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "480496",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XKQWRTDSLAWPKA7NRLR2Q6BDNVPFZEXM",
"WARC-Concurrent-To": "<urn:uuid:882c7b1c-1a93-468f-9111-b78d4e2b8559>",
"WARC-Date": "2020-10-23T03:36:56Z",
"WARC-IP-Address": "104.102.197.45",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MOS6IV5STN4QYTWS4QDX3GV6C5ZXZEWV",
"WARC-Record-ID": "<urn:uuid:3236e821-4086-47ce-9152-21ae1af3129a>",
"WARC-Target-URI": "https://uk.godaddy.com/community/Using-WordPress/GoDaddy-and-WordPress-not-user-friendly/td-p/107357",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e62323a2-6e7d-48cc-bc57-1946cd5995fc>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-236.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
7,
28,
62,
77,
92,
93,
133,
134,
680,
681,
701,
702,
718,
719,
721,
722,
945,
946,
948,
949,
1077,
1078,
1080,
1081,
1380,
1381,
1383,
1384,
1644,
1645,
1647,
1648,
2005,
2006,
2008,
2009,
2026,
2027,
2033,
2034,
2084,
2085,
2116,
2117,
2131,
2146,
2147,
2184,
2185,
2223,
2224,
2226,
2227,
2343,
2344,
3154,
3155,
3207,
3208,
3210,
3211,
3328,
3329,
3331,
3332,
3402,
3403,
3415,
3416,
4070,
4071,
4077,
4078,
4239,
4240,
4242,
4243,
4587,
4588,
4590,
4591,
4917,
4918,
5169,
5170,
5172,
5173,
5284,
5285,
5287,
5288,
5558,
5559,
5575,
5576,
5578,
5579,
5802,
5803,
5805,
5806,
5934,
5935,
5937,
5938,
6237,
6238,
6240,
6241,
6501,
6502,
6504,
6505,
6862,
6863,
6865,
6866,
6883,
6884,
6890,
6891,
6941,
6942,
6973,
6974,
7778,
7779,
7781,
7782,
8009,
8010,
8012,
8013,
8021,
8022,
8028,
8029,
8037,
8038,
8423,
8424,
8887,
8888,
10120,
10121,
10677,
10678,
10729,
10730,
10736,
10737,
11638,
11639,
11641,
11642,
11809,
11810,
11812,
11813,
11821,
11822,
11829,
11830,
11846,
11847,
12246,
12247,
12891,
12892,
12898,
12899,
12901,
12902,
13085,
13086,
13088,
13089,
13331,
13332,
13334,
13335,
13741,
13742,
13744,
13745,
14279,
14280,
14282,
14283,
14411,
14412,
14463,
14464,
14585,
14586,
14602,
14603,
14605,
14606,
14903,
14904,
14906,
14907,
14976,
14977,
15035,
15036,
15038,
15039,
15078,
15079,
15081,
15082,
15220,
15221,
15223,
15224,
15350,
15351,
15353,
15354,
15371,
15372,
15378,
15379,
15381,
15382,
15432,
15433
],
"line_end_idx": [
7,
28,
62,
77,
92,
93,
133,
134,
680,
681,
701,
702,
718,
719,
721,
722,
945,
946,
948,
949,
1077,
1078,
1080,
1081,
1380,
1381,
1383,
1384,
1644,
1645,
1647,
1648,
2005,
2006,
2008,
2009,
2026,
2027,
2033,
2034,
2084,
2085,
2116,
2117,
2131,
2146,
2147,
2184,
2185,
2223,
2224,
2226,
2227,
2343,
2344,
3154,
3155,
3207,
3208,
3210,
3211,
3328,
3329,
3331,
3332,
3402,
3403,
3415,
3416,
4070,
4071,
4077,
4078,
4239,
4240,
4242,
4243,
4587,
4588,
4590,
4591,
4917,
4918,
5169,
5170,
5172,
5173,
5284,
5285,
5287,
5288,
5558,
5559,
5575,
5576,
5578,
5579,
5802,
5803,
5805,
5806,
5934,
5935,
5937,
5938,
6237,
6238,
6240,
6241,
6501,
6502,
6504,
6505,
6862,
6863,
6865,
6866,
6883,
6884,
6890,
6891,
6941,
6942,
6973,
6974,
7778,
7779,
7781,
7782,
8009,
8010,
8012,
8013,
8021,
8022,
8028,
8029,
8037,
8038,
8423,
8424,
8887,
8888,
10120,
10121,
10677,
10678,
10729,
10730,
10736,
10737,
11638,
11639,
11641,
11642,
11809,
11810,
11812,
11813,
11821,
11822,
11829,
11830,
11846,
11847,
12246,
12247,
12891,
12892,
12898,
12899,
12901,
12902,
13085,
13086,
13088,
13089,
13331,
13332,
13334,
13335,
13741,
13742,
13744,
13745,
14279,
14280,
14282,
14283,
14411,
14412,
14463,
14464,
14585,
14586,
14602,
14603,
14605,
14606,
14903,
14904,
14906,
14907,
14976,
14977,
15035,
15036,
15038,
15039,
15078,
15079,
15081,
15082,
15220,
15221,
15223,
15224,
15350,
15351,
15353,
15354,
15371,
15372,
15378,
15379,
15381,
15382,
15432,
15433,
15771
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 15771,
"ccnet_original_nlines": 229,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44368499517440796,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.033878158777952194,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15482911467552185,
"rps_doc_frac_unique_words": 0.2840867340564728,
"rps_doc_mean_word_length": 4.492098331451416,
"rps_doc_num_sentences": 210,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.7022247314453125,
"rps_doc_word_count": 2721,
"rps_doc_frac_chars_dupe_10grams": 0.182688370347023,
"rps_doc_frac_chars_dupe_5grams": 0.1929968148469925,
"rps_doc_frac_chars_dupe_6grams": 0.1872698962688446,
"rps_doc_frac_chars_dupe_7grams": 0.1872698962688446,
"rps_doc_frac_chars_dupe_8grams": 0.182688370347023,
"rps_doc_frac_chars_dupe_9grams": 0.182688370347023,
"rps_doc_frac_chars_top_2gram": 0.006381410174071789,
"rps_doc_frac_chars_top_3gram": 0.003599769901484251,
"rps_doc_frac_chars_top_4gram": 0.004417899996042252,
"rps_doc_books_importance": -1488.0513916015625,
"rps_doc_books_importance_length_correction": -1488.0513916015625,
"rps_doc_openwebtext_importance": -784.37451171875,
"rps_doc_openwebtext_importance_length_correction": -784.37451171875,
"rps_doc_wikipedia_importance": -395.7695007324219,
"rps_doc_wikipedia_importance_length_correction": -395.7695007324219
},
"fasttext": {
"dclm": 0.02807736024260521,
"english": 0.9431567788124084,
"fineweb_edu_approx": 1.1859517097473145,
"eai_general_math": 0.053327739238739014,
"eai_open_web_math": 0.10658466815948486,
"eai_web_code": 0.016107020899653435
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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 |
-792,654,365,657,727,400 | Inbox Vision
Inbox Vision allows marketers to view their emails from the perspective of various email clients and mobile devices. Access Inbox Vision from the email editor by clicking the Preview and Test button. It also allows you to spam test from the Spam Test tab.
Test Your Email
To test your email message in Inbox Vision, click Preview and Test within the email composer. Braze then sends an HTML version of your email to various email clients used across the globe, which may take between two and ten minutes to complete.
Braze will then display screenshots of a sample, rendered HTML on desktops, mobile devices, and tablets. The devices in which screenshots are displayed are scrollable, to allow for better viewing.
If you run an Inbox Vision test, you will also receive a code analysis and spam testing results.
inboxvision1
Code Analysis
Code analysis is a way for Braze to highlight issues that may exist with your HTML, showing the number of occurrences of each issue and providing insight into which HTML elements are not supported. This information found on the Inbox Vision preview page by selecting the list icon in the upper left-hand corner.
inboxvision2 inboxvision3
Spam Testing
Spam testing attempts to predict whether your email will land in spam folders or in your customers’ inboxes. Spam testing runs across major spam filters, such as IronPort, SpamAssassin, and Barracuda, as well as major ISP filters such as Gmail.com and Outlook.com.
FAQ
What does the reprocess screenshot button do?
Very rarely, you will encounter that some screenshots for certain email clients are not clear. The reprocess screenshot button will create another screenshot.
Why does the email preview not appear but my code analysis does for the same client?
Taking a screenshot takes longer than code analysis since we wait till the email arrives in the inbox before taking the screenshot. As a result, sometimes the code analysis will show up faster than the preview for a particular email client.
Can I trust the accuracy of your email test results?
All of our tests are run through actual email clients. We work hard to ensure that all renderings are as accurate as possible. If you consistently see an issue with an email client, please open a support ticket.
Why is my email is not rendering?
In general, if your email content relies on templating info such as user profile information, it will not work with Inbox Vision. This is because Braze templates in an empty user when we send emails using this feature.
WAS THIS PAGE HELPFUL?
New Stuff! | {
"url": "https://www.braze.com/docs/user_guide/message_building_by_channel/email/inbox_vision/",
"source_domain": "www.braze.com",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "189259",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KWFOHE4QETZXZ7OKNEMUDHSHG3UO56I5",
"WARC-Concurrent-To": "<urn:uuid:17853011-b653-4850-8e03-9f0e0a0163f5>",
"WARC-Date": "2021-01-17T18:42:24Z",
"WARC-IP-Address": "151.101.1.208",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7ZTVYLHBWFGW2PXHUYJBUDH2KAJSYXOA",
"WARC-Record-ID": "<urn:uuid:f1ade111-2d6b-4fb1-8533-e58f69574eae>",
"WARC-Target-URI": "https://www.braze.com/docs/user_guide/message_building_by_channel/email/inbox_vision/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:50e8e806-61d4-4802-9c6f-40d724dd4269>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-33.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
13,
14,
270,
271,
287,
288,
533,
534,
731,
732,
829,
830,
843,
844,
858,
859,
1171,
1172,
1198,
1199,
1212,
1213,
1478,
1479,
1483,
1484,
1530,
1531,
1690,
1691,
1776,
1777,
2018,
2019,
2072,
2073,
2285,
2286,
2320,
2321,
2540,
2541,
2564
],
"line_end_idx": [
13,
14,
270,
271,
287,
288,
533,
534,
731,
732,
829,
830,
843,
844,
858,
859,
1171,
1172,
1198,
1199,
1212,
1213,
1478,
1479,
1483,
1484,
1530,
1531,
1690,
1691,
1776,
1777,
2018,
2019,
2072,
2073,
2285,
2286,
2320,
2321,
2540,
2541,
2564,
2574
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2574,
"ccnet_original_nlines": 43,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39375001192092896,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022916670888662338,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10000000149011612,
"rps_doc_frac_unique_words": 0.4731934666633606,
"rps_doc_mean_word_length": 4.843822956085205,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.902348518371582,
"rps_doc_word_count": 429,
"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.03705485910177231,
"rps_doc_frac_chars_top_3gram": 0.0182868093252182,
"rps_doc_frac_chars_top_4gram": 0.026948990300297737,
"rps_doc_books_importance": -204.7732696533203,
"rps_doc_books_importance_length_correction": -204.7732696533203,
"rps_doc_openwebtext_importance": -123.97428131103516,
"rps_doc_openwebtext_importance_length_correction": -123.97428131103516,
"rps_doc_wikipedia_importance": -64.38601684570312,
"rps_doc_wikipedia_importance_length_correction": -64.38601684570312
},
"fasttext": {
"dclm": 0.08130239695310593,
"english": 0.9022954702377319,
"fineweb_edu_approx": 1.4693797826766968,
"eai_general_math": 0.01317816972732544,
"eai_open_web_math": 0.029101429507136345,
"eai_web_code": 0.0633205771446228
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.87",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "9",
"label": "FAQ"
}
},
"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,985,527,289,776,355,000 | General discussion
Locked
Access, Insert jpg in Memo field
By hyperpc ·
I was told in a training session that a stand alone graphic such as a jpg could be inserted into a memo (data type) field, and that it took a string command code to do it. I have checked all my books (and the books she recommended) and have not been able to find out how to do that.
Anyone?
This conversation is currently closed to new comments.
6 total posts (Page 1 of 1)
| Thread display: Collapse - | Expand +
All Comments
Collapse -
Access, Insert jpg in Memo field
by hyperpc In reply to Access, Insert jpg in Mem ...
Point value changed by question poster.
Collapse -
Access, Insert jpg in Memo field
by roc180 In reply to Access, Insert jpg in Mem ...
I have done something similiar but I used the OLE Object data type. I have heard of storing the binary code of a bitmap in a memo field but not for a jpg. If you want I can send you an example of pasting a file into a table and then retrieving it. Let me know.
Good Luck
Neal Martinelli
Collapse -
Access, Insert jpg in Memo field
by hyperpc In reply to Access, Insert jpg in Mem ...
The question was auto-closed by TechRepublic
Collapse -
Access, Insert jpg in Memo field
by mbarker734 In reply to Access, Insert jpg in Mem ...
The only infomation a memo field will display is text. If you want to diplay a different .jpg image on each form you can do the following:
The table field is OLE object. The box on your form for containing the .jpg picture is a Unbound Object Frame.
Use the Insert Object dialog box.
Select Create New, then select an
appropriate photo editor (I use Microsoft Photo Editor 3.0). This editor should be
capable of working with .jpg files. Opening the existing file in the editor and then
closing the editor should place the appropriate .jpg file on your form.
In the Format properties for you picture field on your form Size = Stretch. This will
cause the .jpg file to be scaled to fit the area of the Unbound Object Frame.
Is this process clumsy? ?? YES. Can you shorten the process? ? only slightly.
The clumsiness comes from allowing the versatility of the type of file you can insert
into the Unbound Object Frame.
First: Right clicking in the Unbound Object Frame of your form will produce a drop
down box with Insert Object as an option. Steps removed none just more
convenient than the menu bar.
Second: You can install the following code on an event of the Unbound Object
Frame (I like DoubleClick).
DoCmd.RunCommand acCmdInsertObject
Steps removed 1.
Or if you do not like using and event in the Unbound Object Frame you can create a
Command Button with the following code.
Me!MyPicture.Setfocus
DoCmd.RunCommand acCmdInsertObject
Steps removed still only 1. Again, if you discount the one time coding step.
Personally I would opt for the command button, thus leaving the Unbound Object
Frame events for other things such as Double Click opening a true viewing
program for the .jpg file. Doing this will provide you with the ability to zoom and
scroll around on the .jpg file if you desired.
Good luck,
Mark
Collapse -
Access, Insert jpg in Memo field
by hyperpc In reply to Access, Insert jpg in Mem ...
The question was auto-closed by TechRepublic
Collapse -
Access, Insert jpg in Memo field
by hyperpc In reply to Access, Insert jpg in Mem ...
This question was auto closed due to inactivity
Back to Software Forum
6 total posts (Page 1 of 1)
Related Forums | {
"url": "https://www.techrepublic.com/forums/discussions/access-insert-jpg-in-memo-field/",
"source_domain": "www.techrepublic.com",
"snapshot_id": "crawl=CC-MAIN-2018-39",
"warc_metadata": {
"Content-Length": "295572",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TROLS3WDYPKKFOJTASULIBDSWJEP5RUD",
"WARC-Concurrent-To": "<urn:uuid:fbe91857-36f5-436f-9e9c-3d1f6a960c10>",
"WARC-Date": "2018-09-19T12:01:51Z",
"WARC-IP-Address": "23.218.118.223",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TR2LTDVRSXBHCOSEMUWDNOHG3HRNMH26",
"WARC-Record-ID": "<urn:uuid:bb25e6dd-0f94-495e-9269-7d73276ee3bc>",
"WARC-Target-URI": "https://www.techrepublic.com/forums/discussions/access-insert-jpg-in-memo-field/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2ad3379f-8b8c-4025-b298-0c2e47ad5bfc>"
},
"warc_info": "isPartOf: CC-MAIN-2018-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-143-252-163.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,
19,
20,
27,
28,
61,
62,
75,
358,
359,
367,
368,
423,
424,
454,
494,
495,
508,
509,
520,
521,
554,
555,
608,
609,
649,
650,
661,
662,
695,
696,
748,
749,
1010,
1011,
1021,
1022,
1038,
1039,
1050,
1051,
1084,
1085,
1138,
1139,
1184,
1185,
1196,
1197,
1230,
1231,
1287,
1288,
1427,
1428,
1539,
1540,
1574,
1575,
1609,
1692,
1777,
1849,
1850,
1936,
2014,
2092,
2178,
2209,
2210,
2293,
2364,
2394,
2395,
2472,
2500,
2501,
2536,
2537,
2554,
2555,
2638,
2678,
2679,
2701,
2736,
2737,
2814,
2815,
2894,
2968,
3052,
3099,
3100,
3111,
3112,
3117,
3118,
3129,
3130,
3163,
3164,
3217,
3218,
3263,
3264,
3275,
3276,
3309,
3310,
3363,
3364,
3412,
3413,
3436,
3466,
3467
],
"line_end_idx": [
19,
20,
27,
28,
61,
62,
75,
358,
359,
367,
368,
423,
424,
454,
494,
495,
508,
509,
520,
521,
554,
555,
608,
609,
649,
650,
661,
662,
695,
696,
748,
749,
1010,
1011,
1021,
1022,
1038,
1039,
1050,
1051,
1084,
1085,
1138,
1139,
1184,
1185,
1196,
1197,
1230,
1231,
1287,
1288,
1427,
1428,
1539,
1540,
1574,
1575,
1609,
1692,
1777,
1849,
1850,
1936,
2014,
2092,
2178,
2209,
2210,
2293,
2364,
2394,
2395,
2472,
2500,
2501,
2536,
2537,
2554,
2555,
2638,
2678,
2679,
2701,
2736,
2737,
2814,
2815,
2894,
2968,
3052,
3099,
3100,
3111,
3112,
3117,
3118,
3129,
3130,
3163,
3164,
3217,
3218,
3263,
3264,
3275,
3276,
3309,
3310,
3363,
3364,
3412,
3413,
3436,
3466,
3467,
3481
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3481,
"ccnet_original_nlines": 116,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3511236011981964,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016853930428624153,
"rps_doc_frac_lines_end_with_ellipsis": 0.05128204822540283,
"rps_doc_frac_no_alph_words": 0.15168538689613342,
"rps_doc_frac_unique_words": 0.375,
"rps_doc_mean_word_length": 4.424342155456543,
"rps_doc_num_sentences": 51,
"rps_doc_symbol_to_word_ratio": 0.00842696987092495,
"rps_doc_unigram_entropy": 4.8436737060546875,
"rps_doc_word_count": 608,
"rps_doc_frac_chars_dupe_10grams": 0.14869888126850128,
"rps_doc_frac_chars_dupe_5grams": 0.2460966557264328,
"rps_doc_frac_chars_dupe_6grams": 0.2118959128856659,
"rps_doc_frac_chars_dupe_7grams": 0.2118959128856659,
"rps_doc_frac_chars_dupe_8grams": 0.19776952266693115,
"rps_doc_frac_chars_dupe_9grams": 0.16059480607509613,
"rps_doc_frac_chars_top_2gram": 0.05799257010221481,
"rps_doc_frac_chars_top_3gram": 0.07249070703983307,
"rps_doc_frac_chars_top_4gram": 0.08215612918138504,
"rps_doc_books_importance": -266.5260314941406,
"rps_doc_books_importance_length_correction": -266.5260314941406,
"rps_doc_openwebtext_importance": -127.70980834960938,
"rps_doc_openwebtext_importance_length_correction": -127.70980834960938,
"rps_doc_wikipedia_importance": -41.93292236328125,
"rps_doc_wikipedia_importance_length_correction": -41.93292236328125
},
"fasttext": {
"dclm": 0.02146225981414318,
"english": 0.8847478032112122,
"fineweb_edu_approx": 1.9456562995910645,
"eai_general_math": 0.3627881407737732,
"eai_open_web_math": 0.322005033493042,
"eai_web_code": 0.020701110363006592
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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 |
-8,644,114,580,333,266,000 | CQL for Cassandra 2.0
TRACING
Enables or disables request tracing.
Synopsis
( TRACING ON ) | OFF
Synopsis Legend
• Uppercase means literal
• Lowercase means not literal
• Italics mean optional
• The pipe (|) symbol means OR or AND/OR
• Ellipsis (...) means repeatable
• Orange ( and ) means not literal, indicates scope
A semicolon that terminates CQL statements is not included in the synopsis.
Description
To turn tracing read/write requests on or off, use the TRACING command. After turning on tracing, database activity creates output that can help you understand Cassandra internal operations and troubleshoot performance problems. For example, using the tracing tutorial you can see how different consistency levels affect operations.
For 24 hours, Cassandra saves the tracing information in sessions and events tables in the system_traces keyspace, which you query when using probabilistic tracing (see nodetool setprobability):
CREATE TABLE sessions (
session_id uuid PRIMARY KEY,
coordinator inet,
duration int,
parameters map<text, text>,
request text,
started_at timestamp
);
CREATE TABLE events (
session_id uuid,
event_id timeuuid,
activity text,
source inet,
source_elapsed int,
thread text,
PRIMARY KEY (session_id, event_id)
);
The source_elapsed column stores the elapsed time in microseconds before the event occurred on the source node. To keep tracing information, copy the data in sessions and event tables to another location.
To keep tracing information, copy the data in sessions and event tables to another location. Alternatively, use the tracing session id to retrieve session information using SHOW SESSION. Tracing session information expires after one day.
Tracing a write request
This example shows tracing activity on a 3-node cluster created by ccm on Mac OSX. Using a keyspace that has a replication factor of 3 and an employee table similar to the one in Creating a table, the tracing shows:
• The coordinator identifies the target nodes for replication of the row.
• Writes the row to the commitlog and memtable.
• Confirms completion of the request.
TRACING ON;
INSERT INTO emp (empID, deptID, first_name, last_name)
VALUES (104, 15, 'jane', 'smith');
Cassandra provides a description of each step it takes to satisfy the request, the names of nodes that are affected, the time for each step, and the total time for the request.
Tracing session: 740b9c10-3506-11e2-0000-fe8ebeead9ff
activity | timestamp | source | source_elapsed
-------------------------------------+--------------+-----------+----------------
execute_cql3_query | 16:41:00,754 | 127.0.0.1 | 0
Parsing statement | 16:41:00,754 | 127.0.0.1 | 48
Preparing statement | 16:41:00,755 | 127.0.0.1 | 658
Determining replicas for mutation | 16:41:00,755 | 127.0.0.1 | 979
Message received from /127.0.0.1 | 16:41:00,756 | 127.0.0.3 | 37
Acquiring switchLock read lock | 16:41:00,756 | 127.0.0.1 | 1848
Sending message to /127.0.0.3 | 16:41:00,756 | 127.0.0.1 | 1853
Appending to commitlog | 16:41:00,756 | 127.0.0.1 | 1891
Sending message to /127.0.0.2 | 16:41:00,756 | 127.0.0.1 | 1911
Adding to emp memtable | 16:41:00,756 | 127.0.0.1 | 1997
Acquiring switchLock read lock | 16:41:00,757 | 127.0.0.3 | 395
Message received from /127.0.0.1 | 16:41:00,757 | 127.0.0.2 | 42
Appending to commitlog | 16:41:00,757 | 127.0.0.3 | 432
Acquiring switchLock read lock | 16:41:00,757 | 127.0.0.2 | 168
Adding to emp memtable | 16:41:00,757 | 127.0.0.3 | 522
Appending to commitlog | 16:41:00,757 | 127.0.0.2 | 211
Adding to emp memtable | 16:41:00,757 | 127.0.0.2 | 359
Enqueuing response to /127.0.0.1 | 16:41:00,758 | 127.0.0.3 | 1282
Enqueuing response to /127.0.0.1 | 16:41:00,758 | 127.0.0.2 | 1024
Sending message to /127.0.0.1 | 16:41:00,758 | 127.0.0.3 | 1469
Sending message to /127.0.0.1 | 16:41:00,758 | 127.0.0.2 | 1179
Message received from /127.0.0.2 | 16:41:00,765 | 127.0.0.1 | 10966
Message received from /127.0.0.3 | 16:41:00,765 | 127.0.0.1 | 10966
Processing response from /127.0.0.2 | 16:41:00,765 | 127.0.0.1 | 11063
Processing response from /127.0.0.3 | 16:41:00,765 | 127.0.0.1 | 11066
Request complete | 16:41:00,765 | 127.0.0.1 | 11139
Tracing a sequential scan
Due to the log structured design of Cassandra, a single row is spread across multiple SSTables. Reading one row involves reading pieces from multiple SSTables, as shown by this trace of a request to read the employee table, which was pre-loaded with 10 rows of data.
SELECT * FROM emp;
Output is:
empid | deptid | first_name | last_name
-------+--------+------------+-----------
110 | 16 | naoko | murai
105 | 15 | john | smith
111 | 15 | jane | thath
113 | 15 | lisa | amato
112 | 20 | mike | burns
107 | 15 | sukhit | ran
108 | 16 | tom | brown
109 | 18 | ann | green
104 | 15 | jane | smith
106 | 15 | bob | jones
(10 rows)
The tracing output of this read request looks something like this (a few rows have been truncated to fit on this page):
Tracing session: bf5163e0-350f-11e2-0000-fe8ebeead9ff
activity | timestamp | source | source_elapsed
-------------------------------------------------+--------------+-----------+----------------
execute_cql3_query | 17:47:32,511 | 127.0.0.1 | 0
Parsing statement | 17:47:32,511 | 127.0.0.1 | 47
Preparing statement | 17:47:32,511 | 127.0.0.1 | 249
Determining replicas to query | 17:47:32,511 | 127.0.0.1 | 383
Sending message to /127.0.0.2 | 17:47:32,512 | 127.0.0.1 | 883
Message received from /127.0.0.1 | 17:47:32,512 | 127.0.0.2 | 33
Executing seq scan across 0 sstables for . . . | 17:47:32,513 | 127.0.0.2 | 670
Read 1 live cells and 0 tombstoned | 17:47:32,513 | 127.0.0.2 | 964
Read 1 live cells and 0 tombstoned | 17:47:32,514 | 127.0.0.2 | 1268
Read 1 live cells and 0 tombstoned | 17:47:32,514 | 127.0.0.2 | 1502
Read 1 live cells and 0 tombstoned | 17:47:32,514 | 127.0.0.2 | 1673
Scanned 4 rows and matched 4 | 17:47:32,514 | 127.0.0.2 | 1721
Enqueuing response to /127.0.0.1 | 17:47:32,514 | 127.0.0.2 | 1742
Sending message to /127.0.0.1 | 17:47:32,514 | 127.0.0.2 | 1852
Message received from /127.0.0.2 | 17:47:32,515 | 127.0.0.1 | 3776
Processing response from /127.0.0.2 | 17:47:32,515 | 127.0.0.1 | 3900
Sending message to /127.0.0.2 | 17:47:32,665 | 127.0.0.1 | 153535
Message received from /127.0.0.1 | 17:47:32,665 | 127.0.0.2 | 44
Executing seq scan across 0 sstables for . . . | 17:47:32,666 | 127.0.0.2 | 1068
Read 1 live cells and 0 tombstoned | 17:47:32,667 | 127.0.0.2 | 1454
Read 1 live cells and 0 tombstoned | 17:47:32,667 | 127.0.0.2 | 1640
Scanned 2 rows and matched 2 | 17:47:32,667 | 127.0.0.2 | 1694
Enqueuing response to /127.0.0.1 | 17:47:32,667 | 127.0.0.2 | 1722
Sending message to /127.0.0.1 | 17:47:32,667 | 127.0.0.2 | 1825
Message received from /127.0.0.2 | 17:47:32,668 | 127.0.0.1 | 156454
Processing response from /127.0.0.2 | 17:47:32,668 | 127.0.0.1 | 156610
Executing seq scan across 0 sstables for . . . | 17:47:32,669 | 127.0.0.1 | 157387
Read 1 live cells and 0 tombstoned | 17:47:32,669 | 127.0.0.1 | 157729
Read 1 live cells and 0 tombstoned | 17:47:32,669 | 127.0.0.1 | 157904
Read 1 live cells and 0 tombstoned | 17:47:32,669 | 127.0.0.1 | 158054
Read 1 live cells and 0 tombstoned | 17:47:32,669 | 127.0.0.1 | 158217
Scanned 4 rows and matched 4 | 17:47:32,669 | 127.0.0.1 | 158270
Request complete | 17:47:32,670 | 127.0.0.1 | 159525
The sequential scan across the cluster shows:
• The first scan found 4 rows on node 2.
• The second scan found 2 more rows found on node 2.
• The third scan found the 4 rows on node 1.
Show/hide | {
"url": "http://datastax.com/documentation/cql/3.1/cql/cql_reference/tracing_r.html",
"source_domain": "datastax.com",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "20456",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VTAORW43ZHBZXMRMN5CBLJYFEWEKIHWH",
"WARC-Concurrent-To": "<urn:uuid:03ac5976-adeb-4f08-b0d6-532510e1ade0>",
"WARC-Date": "2014-07-25T18:42:52Z",
"WARC-IP-Address": "184.106.55.49",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4UCVJCL3K7QQNSMVHMH5REXB6STK2SBW",
"WARC-Record-ID": "<urn:uuid:737bcfee-4cf0-48e3-bf83-08fa6dbb42a3>",
"WARC-Target-URI": "http://datastax.com/documentation/cql/3.1/cql/cql_reference/tracing_r.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e2b54cb1-f0a0-4a94-850c-7379524698da>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-131-23.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-23\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for July 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
22,
23,
31,
32,
69,
70,
79,
80,
101,
102,
118,
119,
147,
179,
205,
248,
284,
338,
339,
415,
416,
428,
429,
762,
763,
958,
959,
983,
1014,
1034,
1050,
1080,
1096,
1119,
1122,
1123,
1145,
1163,
1183,
1199,
1213,
1234,
1248,
1284,
1287,
1288,
1493,
1494,
1732,
1733,
1757,
1758,
1974,
1975,
2051,
2101,
2141,
2153,
2154,
2209,
2246,
2247,
2424,
2425,
2479,
2480,
2561,
2643,
2724,
2805,
2886,
2967,
3048,
3129,
3210,
3291,
3372,
3453,
3534,
3615,
3696,
3777,
3858,
3939,
4020,
4101,
4182,
4263,
4344,
4425,
4506,
4587,
4668,
4749,
4750,
4776,
4777,
5044,
5045,
5064,
5065,
5076,
5077,
5117,
5159,
5200,
5241,
5282,
5323,
5364,
5405,
5446,
5487,
5528,
5569,
5573,
5583,
5584,
5704,
5705,
5759,
5760,
5853,
5947,
6040,
6133,
6226,
6319,
6412,
6505,
6598,
6691,
6784,
6877,
6970,
7063,
7156,
7249,
7342,
7435,
7528,
7621,
7714,
7807,
7900,
7993,
8086,
8179,
8272,
8365,
8458,
8551,
8644,
8737,
8830,
8923,
9016,
9017,
9063,
9064,
9107,
9162,
9209
],
"line_end_idx": [
22,
23,
31,
32,
69,
70,
79,
80,
101,
102,
118,
119,
147,
179,
205,
248,
284,
338,
339,
415,
416,
428,
429,
762,
763,
958,
959,
983,
1014,
1034,
1050,
1080,
1096,
1119,
1122,
1123,
1145,
1163,
1183,
1199,
1213,
1234,
1248,
1284,
1287,
1288,
1493,
1494,
1732,
1733,
1757,
1758,
1974,
1975,
2051,
2101,
2141,
2153,
2154,
2209,
2246,
2247,
2424,
2425,
2479,
2480,
2561,
2643,
2724,
2805,
2886,
2967,
3048,
3129,
3210,
3291,
3372,
3453,
3534,
3615,
3696,
3777,
3858,
3939,
4020,
4101,
4182,
4263,
4344,
4425,
4506,
4587,
4668,
4749,
4750,
4776,
4777,
5044,
5045,
5064,
5065,
5076,
5077,
5117,
5159,
5200,
5241,
5282,
5323,
5364,
5405,
5446,
5487,
5528,
5569,
5573,
5583,
5584,
5704,
5705,
5759,
5760,
5853,
5947,
6040,
6133,
6226,
6319,
6412,
6505,
6598,
6691,
6784,
6877,
6970,
7063,
7156,
7249,
7342,
7435,
7528,
7621,
7714,
7807,
7900,
7993,
8086,
8179,
8272,
8365,
8458,
8551,
8644,
8737,
8830,
8923,
9016,
9017,
9063,
9064,
9107,
9162,
9209,
9218
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 9218,
"ccnet_original_nlines": 163,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09480401128530502,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013217870146036148,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6777575016021729,
"rps_doc_frac_unique_words": 0.36316871643066406,
"rps_doc_mean_word_length": 5.426954746246338,
"rps_doc_num_sentences": 275,
"rps_doc_symbol_to_word_ratio": 0.0004557899956125766,
"rps_doc_unigram_entropy": 5.247352123260498,
"rps_doc_word_count": 972,
"rps_doc_frac_chars_dupe_10grams": 0.028815170750021935,
"rps_doc_frac_chars_dupe_5grams": 0.20834122598171234,
"rps_doc_frac_chars_dupe_6grams": 0.135545015335083,
"rps_doc_frac_chars_dupe_7grams": 0.12682464718818665,
"rps_doc_frac_chars_dupe_8grams": 0.10218009352684021,
"rps_doc_frac_chars_dupe_9grams": 0.10218009352684021,
"rps_doc_frac_chars_top_2gram": 0.009478669613599777,
"rps_doc_frac_chars_top_3gram": 0.017061609774827957,
"rps_doc_frac_chars_top_4gram": 0.026540279388427734,
"rps_doc_books_importance": -460.2152404785156,
"rps_doc_books_importance_length_correction": -460.2152404785156,
"rps_doc_openwebtext_importance": -310.5301513671875,
"rps_doc_openwebtext_importance_length_correction": -310.5301513671875,
"rps_doc_wikipedia_importance": -5.111742973327637,
"rps_doc_wikipedia_importance_length_correction": -5.111742973327637
},
"fasttext": {
"dclm": 0.10889589786529541,
"english": 0.7650003433227539,
"fineweb_edu_approx": 1.6751108169555664,
"eai_general_math": 0.011279639787971973,
"eai_open_web_math": 0.07038456201553345,
"eai_web_code": 0.8055325746536255
}
} | {
"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": "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": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-3,820,030,399,896,314,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.
I've decided to learn D, and I'm wondering which standard library I should use. Should I use Phobos or Tango? What are the pros and cons of each?
share|improve this question
Also, take a look here: <stackoverflow.com/questions/289087/…; – dirkgently Mar 28 '09 at 22:36
8 Answers 8
up vote 5 down vote accepted
Tango. It's more object-oriented where appropriate, it includes containers (like STL or Java Collections), it's got an active development team, it has more momentum (it may soon be incorporated into the official compiler), and it's got real documentation, including Learn to Tango with D.
It looks like Tango may soon be incorporated into Walter's releases.
share|improve this answer
32
While this comment was true in 2009 when this post was written, it is no longer the case. Tango doesn't even exist for D2 and now has very little mommentum. The development of phobos has opened greatly and it is receiving a lot of love. – JoeCoder Jun 29 '11 at 18:03
If you need to use D2 then phobos is what you should use for now but tango for D2 is in development.
tangobos allows to use tango and phobos together at the same time. In D2 both work together anyway as they both make use of the separate druntime.
share|improve this answer
I've had little experience with both (kinda ..)
Phobos is more flat and python-like, but quite incomplete.
Tango is more Java-like, it makes simple things complicated.
I personally prefer to go with phobos, unless you need a library that depends on Tango (such as DWT).
share|improve this answer
1
One thing I hate about Tango is that it made itself incompatible with Phobos – hasenj Mar 28 '09 at 23:13
Tango is currently outdated. It only works with the old version of D. In my opinion, Phobos is the only way forward.
I wasn't following d when all of the split library arguments were going on, but from what I can tell, a lot of the reasons for Tango disappeared when D2 was released.
There is a small effort aimed at reviving Tango, but in my opinion having a split in the standard library only hurts D as a whole.
Also barring some major event, Phobos is virtually guaranteed to be supported on every release of D. Even if Tango gets ported to D2 successfully, it could easily be abandoned again.
share|improve this answer
Phobos 1* vs Tango
share|improve this answer
I've added human readable title to the link – J.F. Sebastian Mar 28 '09 at 22:51
@FeepingCreature, might I suggest adding that document somewhere on Wiki4D, or as a page in the "D Programming Language" Google group? – he_the_great Mar 29 '09 at 22:17
From Dispelling Common D Myths:
Phobos is D's standard lib, period. Tango is now an optional but Phobos-compatible third party library. That's all there is to it.
share|improve this answer
If you use D2, use Phobos
If you use D1, use Tango.
And you must learn D2, so use Phobos. Easy, not ?
Note : Phobos for D2 it's much powerfull and bigger that for D1.
share|improve this answer
In my opinion, (having never actually used Boost), Tango is more like Boost, and Phobos is more elegant. As was stated above, using Phobos is much like Python.
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/693672/d-standard-library",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "100925",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VUZLL4DEXYQWS7CBMRPQGPK2VSR356KB",
"WARC-Concurrent-To": "<urn:uuid:d0c51e55-4772-418e-a0f3-d4f4ec94bc69>",
"WARC-Date": "2014-12-21T04:47:01Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FRZPUBNJ7F3KJD64RJRI7TVXY2G4ZGQ2",
"WARC-Record-ID": "<urn:uuid:95cc6151-699d-4ca1-a989-ba48c6c22c2c>",
"WARC-Target-URI": "http://stackoverflow.com/questions/693672/d-standard-library",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:307d4d3d-1624-4aec-a4a3-c6a68dfa7a2a>"
},
"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,
25,
157,
158,
304,
305,
333,
338,
435,
436,
448,
449,
478,
479,
768,
769,
838,
839,
865,
870,
1139,
1140,
1241,
1242,
1389,
1390,
1416,
1417,
1465,
1466,
1525,
1526,
1587,
1588,
1690,
1691,
1717,
1721,
1828,
1829,
1946,
1947,
2114,
2115,
2246,
2247,
2430,
2431,
2457,
2458,
2477,
2478,
2504,
2509,
2591,
2596,
2767,
2768,
2800,
2801,
2932,
2933,
2959,
2960,
2986,
2987,
3013,
3014,
3064,
3065,
3130,
3131,
3157,
3158,
3318,
3319,
3345,
3346,
3358,
3359,
3361,
3369,
3370,
3448,
3449
],
"line_end_idx": [
25,
157,
158,
304,
305,
333,
338,
435,
436,
448,
449,
478,
479,
768,
769,
838,
839,
865,
870,
1139,
1140,
1241,
1242,
1389,
1390,
1416,
1417,
1465,
1466,
1525,
1526,
1587,
1588,
1690,
1691,
1717,
1721,
1828,
1829,
1946,
1947,
2114,
2115,
2246,
2247,
2430,
2431,
2457,
2458,
2477,
2478,
2504,
2509,
2591,
2596,
2767,
2768,
2800,
2801,
2932,
2933,
2959,
2960,
2986,
2987,
3013,
3014,
3064,
3065,
3130,
3131,
3157,
3158,
3318,
3319,
3345,
3346,
3358,
3359,
3361,
3369,
3370,
3448,
3449,
3539
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3539,
"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.3914174437522888,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04421326145529747,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21196359395980835,
"rps_doc_frac_unique_words": 0.4834437072277069,
"rps_doc_mean_word_length": 4.528145790100098,
"rps_doc_num_sentences": 41,
"rps_doc_symbol_to_word_ratio": 0.001300389994867146,
"rps_doc_unigram_entropy": 5.199815273284912,
"rps_doc_word_count": 604,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.018281539902091026,
"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.0526508204638958,
"rps_doc_frac_chars_top_3gram": 0.06435100734233856,
"rps_doc_frac_chars_top_4gram": 0.009872029535472393,
"rps_doc_books_importance": -367.40753173828125,
"rps_doc_books_importance_length_correction": -367.40753173828125,
"rps_doc_openwebtext_importance": -238.70904541015625,
"rps_doc_openwebtext_importance_length_correction": -238.70904541015625,
"rps_doc_wikipedia_importance": -159.35121154785156,
"rps_doc_wikipedia_importance_length_correction": -159.35121154785156
},
"fasttext": {
"dclm": 0.23538511991500854,
"english": 0.9435777068138123,
"fineweb_edu_approx": 1.6025664806365967,
"eai_general_math": 0.0016118299681693316,
"eai_open_web_math": 0.18738865852355957,
"eai_web_code": 0.00009154999861493707
}
} | {
"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": "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": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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 |
8,775,344,760,035,702,000 | Author Topic: Star Citizen Citizenship (Read 862141 times)
Flashwit
• Full Member
• ***
• Posts: 121
Re: Sad Citizens
« Reply #120 on: May 09, 2017, 11:13:33 AM »
Am I the only one who finds it hilarious that /r/ds thinks I'm OSC; and if so, that means I've been owning them completely all week? :vince:
He wrote two masterpieces this morning about the potential legal situation for CIG (Sandi's in it).
WHY CIG IS LEGALLY FUCKED (PT1, PT2)
And since he showed up and dragged Jester86 (/r/ds mod) into his thread and gave him a 10K word lashing (PT1, PT2) about his toxic Reddit, /r/ds has been in complete meltdown mode.
This was a lovely takedown when they claimed that I called Sandi a prostitute. They claim to be "archiving", but nobody could find a single instance of me saying it. Weird, that.
That guy is brutal. When I grow up, I want to be just like him. :glomp:
I am having to look up what anti-SLAAP is.
It sounds to me like some cosmetic surgery procedure for women worried about the size of their beef curtains
He spelled it wrong as it's actually anti-SLAPP (as in anti-Strategic Lawsuit Against Public Participation). SLAPP lawsuits are generally used by corporations against little guys to pressure them into shutting the hell up about any complaints they have about the corporation. They generally aren't lawsuits that the corporation expects to win, but the idea is that the legal costs are negligible to them while being extortionate for the little guy.
So the little guy will be forced into shutting the hell up because they cannot afford the legal costs, even on the minimal chance that they lose the (generally) frivolous lawsuits that are filed to silence them. It was actually a SLAPP suit that led to the creation of the well-known 'Streisand Effect'.
dsmart
• Supreme Cmdr
• Administrator
• Hero Member
• *****
• Posts: 4915
• Smart Speak Blog
Re: Sad Citizens
« Reply #121 on: May 09, 2017, 01:06:13 PM »
I interrupt this program, to bring you more LOLS (1, 2) from OSC.
Quote
Quick word on the money. Last night while I was continuing my research, I was browsing the project website. I went to the store, looked around, made some notes etc. Then a very disturbing feeling came over me. Say you are a backer who has paid $250 to a company for them to create a game. You see a mouse pad or t-shirt for sale. You buy it. How many backers were able to deduce that they had paid money to CIG, who then used some of that money to manufacture goods at low cost, which they then sold back to the backer at a premium. I am going to leave you with that picture in your mind.
There's a t-shirt!! :laugh:
Star Citizen isn't a game. It's a TV show about a bunch of characters making a game. It's basically "This is Spinal Tap" - except people think the band is real.
dsmart
• Supreme Cmdr
• Administrator
• Hero Member
• *****
• Posts: 4915
• Smart Speak Blog
Re: Sad Citizens
« Reply #122 on: May 09, 2017, 01:37:12 PM »
LOL!! Listen to Twerk17 compare the Eve and ED communities to Star Citizen's community. It starts around 1:12
Star Citizen isn't a game. It's a TV show about a bunch of characters making a game. It's basically "This is Spinal Tap" - except people think the band is real.
dsmart
• Supreme Cmdr
• Administrator
• Hero Member
• *****
• Posts: 4915
• Smart Speak Blog
Re: Sad Citizens
« Reply #123 on: May 09, 2017, 02:08:50 PM »
Am I the only one who finds it hilarious that /r/ds thinks I'm OSC; and if so, that means I've been owning them completely all week? :vince:
He wrote two masterpieces this morning about the potential legal situation for CIG (Sandi's in it).
WHY CIG IS LEGALLY FUCKED (PT1, PT2)
And since he showed up and dragged Jester86 (/r/ds mod) into his thread and gave him a 10K word lashing (PT1, PT2) about his toxic Reddit, /r/ds has been in complete meltdown mode.
This was a lovely takedown when they claimed that I called Sandi a prostitute. They claim to be "archiving", but nobody could find a single instance of me saying it. Weird, that.
That guy is brutal. When I grow up, I want to be just like him. :glomp:
Some of OldSchoolCmdr (OCG) latest hits.
1) He keeps asking Shitizens for evidence of all the things they are claiming. He has had several exchanges with this one guy, but man, this one was hilarious.
Quote
That's not evidence. You haven't provided any. You have failed, at every instance, to provide any evidence of anything that you have claimed.
If I were interrogating or deposing you, I think you would start sweating first, even as the feelings of despair creates knots in your stomach, and cramp your feet. You will then shift in your seat, to ease the discomfort, and reach for the glass of water you've almost finished, despite being only 5 mins into a gruesome 2 hr long session. You will stutter, and stammer, and repeat questions, as your brain finds every ploy to think on your feet. Then at the point you decide that you've been wasting everyone's time, it will occur to you that everything you just said on the record, not only cause you more harm, but you never produced any evidence to back up anything you claimed. That's when the crying usually starts. Followed by the 3rd or 4th bathroom break.
2) They keep accusing me - without evidence - of saying mean things about Sandi. When one guy ask "Alright. So as long as she isn't willing to indulge him in court, he gets to claim whatever he wants as per usual.", this was his response (PT1, PT2).
3) Some guy watched my Periscope video over the weekend and somehow concluded that my priorities had changed. Of course he went to misrepresent my actual statements. This was the response by OSC. Part of that, he wrote up a list of FOUR things that I had been right about since 2015. These are things that Shitizens keep ignoring btw; even as they create a lengthy bogus list about my failed (my favorite is the "90 days to collapse one") predictions. Yes, they're morons.
Quote
5) that he was right about a lot of things back in 2015.
(a) the money: they would need $150m. 2 years later they are at $148m and game still not done
(b) the engine: they didn't have the tech or the right engine. 2 years later they switched to LumberYard
(c) refunds: they were not doing no-questions-asked refunds as they should. they started doing it 2 years later after one person tested his theory about the TOS which they later changed to strengthen that aspect
(d) schedule: which they started doing 2 yrs later
Also, we had an exchange when he was asking me about Jester86 (mod of /r/ds) regarding his comment here. He had posted it here, but the /r/StarCitizen/ mod removed (here's why) it because he said OSC was re-posting something on my behalf. Here is the full text. Goons had also made an image before it was removed.
Quote
Quote
Hi /u/jester86
Sorry to tag you, but I will never post in your Reddit, and I didn't want to send you a message because you had posted about this in public. I felt that you would want his response to your comment in the public domain as well.
Anyway, I had some exchanges with Dr. Smart, and he confirms what you said to me. He gave me the all clear to share his comment. Below is quoted verbatim; I only removed a word I would not want to use here.
Quote
i) I don't always agree with how the Reddit is moderated sometimes, but the mods (mostly that Jester86 guy) have been diligent in removing objectionable material. Sure he is biased, but I don't believe that he is intentionally condoning what those guys have devolved the Reddit into; and I think that it would be unfair to pin it all on him. Those guys are completely unhinged, and it's a full time job to keep them in line. I read your two page posts to him, and though you didn't specifically go after him, I thought your closing paragraph (forgotten what page it was on) was a bit harsh. He has never attacked me, nor treated me with any disrespect. Disdain and annoyance? Maybe. He responds to my messages, we argue sometimes, but that's the gist of it. The last time we had an argument was about 3-4 weeks ago when he found out that my attorneys and I had opened an active dialog/complaint with Reddit upper echelons, and we were already discussing the Reddit with them. Yes, he is overseeing a toxic Reddit, but he's right, he didn't create it. He inherited it and without him, I believe that the creator would either close it, or let it devolve (which would get it shutdown by Reddit) into a worse problem. Think about what happened in Libya when Ghadafi was killed, or Iraq when Saddam was killed.
ii) Is it an attack sub (I call it a hate-Redd), well, you be the judge. But by the same token, I don't want to see it closed. They have a right to voice their opinion as much as they want; and the collection of what's there, as you yourself have written, falls right in the middle of harassment territory. So the Reddit is serving precisely the purpose for which it was intended: archiving their on-going harassment (via a proxy war they are fighting for RSI). That being, a collection of toxic Star Citizens (aka ******) showing the true nature of the most vocal part of the community. It's like herding cats. We know where they are - all the time. And when this train-wreck finally goes off the last rail, that's where we are going to be drinking their tears from. So closing that Reddit would rob me and my Goon friends, of that hilarity. It will also remove legacy data which may come in handy in any lawsuit stemming from this train-wreck. Also we have a code of conduct. I feed them scraps via my social media feed once in awhile; they "archive" it, then feed their angst, ego, and fetishes, for a few hundred posts. On good days, I can yield over 150 posts just by Tweeting nonsense (in 140 chars or less) just to wind them up while sitting on the toilet. Sometimes if I am busy or write something elsewhere (e.g. on my forum, SomethingAwful or Frontier Dev), they can get a lunch buffet which lasts them a few days. A really good one (e.g. if I point out the technical challenges of the project, or say something about their erstwhile Messiah) tends to yield several threads and 350+ posts.
iii) I saw a thread in which Jester86 is looking to turn off comments. Aside from the fact that the OP clearly proves that they are in a harassment campaign because they would rather "I shut up about their stupid game", I think it's a bad idea (see above). What I think he should do is, identify the top (there are 9-13 of them) abusers, then put them all on auto-mod. Most of the other guys (think of the weaklings in a prison, walking around holding the pocket of their master) are just there for the lols. My crazy Goon friends (who are no angels btw. some tend to get carried away, and ruin everything) usually pick these guys off, make them weep (we can tell), which then brings in the big guns (the real targets). Are they mocking me? Hell yeah! Do I care? Well, you've seen me on Usenet - what do you think? That stuff tends not to faze me. It's when they dox me, bring my family and personal affairs/life into things, that I tend to take the gloves off and go postal. All their accusations of doxing, stalking etc are nonsense. It just feeds their angst. I know all the ones who are in the US, but my goal is not to spend legal bills on idiots who will just cry into a bowl the first time they received a court order. I have bigger fish to fry; and that bbq is coming sooner than they think.
Star Citizen isn't a game. It's a TV show about a bunch of characters making a game. It's basically "This is Spinal Tap" - except people think the band is real.
StanTheMan
• Hero Member
• *****
• Posts: 676
Re: Sad Citizens
« Reply #124 on: May 10, 2017, 05:48:01 AM »
They seem to have given up replying now.
Game Set and Match I say !
dsmart
• Supreme Cmdr
• Administrator
• Hero Member
• *****
• Posts: 4915
• Smart Speak Blog
Re: Sad Citizens
« Reply #125 on: May 10, 2017, 07:48:35 AM »
They seem to have given up replying now.
It appears so. I guess getting consistently owned has its downsides. I particularly liked this latest post from last night where one of those clowns was trying to deny facts surrounding all the key things that I have been correct about.
Star Citizen isn't a game. It's a TV show about a bunch of characters making a game. It's basically "This is Spinal Tap" - except people think the band is real.
dsmart
• Supreme Cmdr
• Administrator
• Hero Member
• *****
• Posts: 4915
• Smart Speak Blog
Re: Sad Citizens
« Reply #126 on: May 11, 2017, 03:55:56 PM »
OSC is back with another masterful post. This time, taking on the money issue.
FYI: In case you missed his recent take on the toxic community, as per the NYT article.
Star Citizen isn't a game. It's a TV show about a bunch of characters making a game. It's basically "This is Spinal Tap" - except people think the band is real.
dsmart
• Supreme Cmdr
• Administrator
• Hero Member
• *****
• Posts: 4915
• Smart Speak Blog
Re: Sad Citizens
« Reply #127 on: May 13, 2017, 06:28:57 AM »
So last night Redditor OldSchoolCmdr who has been a thorn in the sides of toxic Star Citizen backers these past two weeks made a fantabulous post (image) about the project financials.
Whatever happened, shortly after his Reddit account disappeared. Though we don't know this to be true, word is that the /r/StarCitizen mods probably got him shadowbanned by their Reddit admin friends. Either that, or as Shitizens are known to do, they probably mass reported his thread and his account got auto-shadowbanned by a Reddit bot.
They did the same thing to me when I encroached on their Reddit hug box. Trevor Noblitt (/u/Dolvak/) when he was a mod of /r/StarCitizen, got a Reddit admin to shadowban (it no longer is) my account for dubious (apparently posting a LinkedIn url is doxing now) reasons. It wasn't long before he was caught in a scandal, and forced to step aside as mod due to shady business between him, INN (a Star Citizen shillizen site) where he used to "write", and CIG. He is one of the guys who, along with the existing mods in /r/StarCitizen and /r/DerekSmart, put that Reddit under the control of some CIG community members who they have a long standing relationship with. This is why most of the Star Citizen backers are mindful of the fact that their Reddit is under the control by of CIG by proxy. The same way that some of those same mods are also mods and purveyors of profit in /r/StarCitizen_Trades where Star Citizen ships are bought and sold.
For the past two weeks, some Star Citizen backers have been speculating that he was either my alt, or the alt of a Goon. I can safely say that, as much as I would love to take credit for the hilarious consternation that he's caused those delusional toxic clowns, I'm not him. And AFAIK, none of the Goons have taken credit. In fact, the only Goon that we know of who can match me for voluminous (aka effort posts) writings, Gorf, has been MIA for months now, saying that he was sick of the Star Citizen fiasco.
The hilarious thing is that some of those Shitizen clowns have been tying themselves in knots coming up with all kinds of reasons why they think he's my alt. Bear in mind that those guys are so nuts that any time they see a dissenting post they claim it's either me or a Goon using an alt.
I don't, never have, never will use alts. People who have known me since Usenet, know this about me. Using alts didn't earn me my Internet Warlord medals and stripes. Accusing an opposing person of being an alt, is the oldest deflection trick in the social media book of discourse.
Their primary reasons behind their claims of OSC being me?
1) He writes effort posts like I do
2) He sometimes references my blogs and writings, and appears to believe them
3) That he can put together an entire coherent paragraph
4) My writing "style". apparently using (1,2,3) nomenclature for cited sources, a staple of Reddit, Wikipedia and most comment systems, is so unique that anyone who uses it, is me
5) I write about his posts
Yes, it's all so hilarious.
The fact that he never uses hyperbole, sticks to facts and evidence in his posts etc, are all safely ignored of course. And he was always polite, and never lost his cool - no matter how fast and furious the attacks were. Don't take my word for it, go look at his posts. Now that his Reddit user profile is gone, you can't see all of them in one place, but his posts are easy to find in the only three threads he has posted in since he appeared on Reddit two weeks ago.
May 12th, 2017, Let's Talk Financial Accountability
May 10th, 2017, Videogame Raised $148 Million From Fans
May 1st, 2017, Potential Backer With Questions
Remember when I said it was hilarious?
Anyway, I have reached out to him via Lockbin (where he first contacted me two weeks ago) to ask if he heard from Reddit about why his account was shadowbanned. I will post when I know more. Hopefully it was just Shitizens up to their suppression tactics again, and this was just a bot that banned his account.
« Last Edit: May 14, 2017, 07:41:51 AM by dsmart »
Star Citizen isn't a game. It's a TV show about a bunch of characters making a game. It's basically "This is Spinal Tap" - except people think the band is real.
Lir
• Newbie
• *
• Posts: 34
Re: Sad Citizens
« Reply #128 on: May 13, 2017, 06:42:06 AM »
Bah; let them make OSC beeing you if that is all they can come up with. These stupids will never understand anything outside their SC bubble , what I find more worrying is in the case the admins really shadowbanned him based on presumptions...
dsmart
• Supreme Cmdr
• Administrator
• Hero Member
• *****
• Posts: 4915
• Smart Speak Blog
Re: Sad Citizens
« Reply #129 on: May 14, 2017, 07:54:55 AM »
Bah; let them make OSC beeing you if that is all they can come up with. These stupids will never understand anything outside their SC bubble , what I find more worrying is in the case the admins really shadowbanned him based on presumptions...
I heard back from him. He says he is shadowbanned and that he contacted the mods since Fri; but nobody has responded to him. Even /u/qwints who used to engage in his subjects. Which means that this was definitely something that the mods did.
Meanwhile, /u/Jester86 who is the mod of /r/ds/ had this to say about it:
Quote
A brand new account with minimal karma can be flagged as a spam bot if nearly all their comments are flagged as spam. I'm not saying that's what happened, or even possible in this case, but if someone posts exclusively on one sub and the mods go through their entire history to flag everything as spam a shadowban can be imposed automatically.
Meanwhile, the Star Citizen community outrage over CCu fees continues. This one is eye-opening.
Star Citizen isn't a game. It's a TV show about a bunch of characters making a game. It's basically "This is Spinal Tap" - except people think the band is real.
Mr M
• Newbie
• *
• Posts: 1
Re: Sad Citizens
« Reply #130 on: May 14, 2017, 08:09:10 AM »
I see the citizens have updated their game development graph...
So I thought I'd join in the fun ;)
Lir
• Newbie
• *
• Posts: 34
Re: Sad Citizens
« Reply #131 on: May 14, 2017, 08:15:37 AM »
There was an interesting graph posted few times ago, that included the pre-alpha comparison times. SC was the ever going prealpha compared to everyother, making the whole development time a joke.
dsmart
• Supreme Cmdr
• Administrator
• Hero Member
• *****
• Posts: 4915
• Smart Speak Blog
Re: Sad Citizens
« Reply #132 on: May 14, 2017, 08:46:55 AM »
Yeah, they use those graphs as if CIG is already a seasoned dev with shipped games. They're fucking morons.
Star Citizen isn't a game. It's a TV show about a bunch of characters making a game. It's basically "This is Spinal Tap" - except people think the band is real.
dsmart
• Supreme Cmdr
• Administrator
• Hero Member
• *****
• Posts: 4915
• Smart Speak Blog
Re: Citizen. Get a Refund
« Reply #133 on: May 14, 2017, 08:47:46 AM »
Star Citizen isn't a game. It's a TV show about a bunch of characters making a game. It's basically "This is Spinal Tap" - except people think the band is real.
dsmart
• Supreme Cmdr
• Administrator
• Hero Member
• *****
• Posts: 4915
• Smart Speak Blog
Re: Sad Citizens
« Reply #134 on: May 14, 2017, 09:38:39 AM »
I heard back from him. He says he is shadowbanned and that he contacted the mods since Fri; but nobody has responded to him. Even /u/qwints who used to engage in his subjects. Which means that this was definitely something that the mods did.
Looks like OSC is back, but in a different Reddit
Star Citizen - Let's Talk Financial Accountability
Star Citizen isn't a game. It's a TV show about a bunch of characters making a game. It's basically "This is Spinal Tap" - except people think the band is real.
SMF spam blocked by CleanTalk | {
"url": "http://www.dereksmart.com/forum/index.php?topic=15.msg1569",
"source_domain": "www.dereksmart.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "86815",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7V2FR7W5HIUDQOET5WYAQBOFFPJSS4E5",
"WARC-Concurrent-To": "<urn:uuid:bf4a7eef-1852-49c7-9d56-b251b1d6df53>",
"WARC-Date": "2023-02-03T10:22:16Z",
"WARC-IP-Address": "104.21.54.53",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:EP6TTLNZYKX7FTZVSMJOCBW2RS4OGWGW",
"WARC-Record-ID": "<urn:uuid:47c82f41-eaa5-4dd1-a5a5-9f2e4832369a>",
"WARC-Target-URI": "http://www.dereksmart.com/forum/index.php?topic=15.msg1569",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eaccb7ce-24eb-4a58-bf35-24d0fd3c6bce>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-28\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
60,
61,
70,
71,
87,
95,
110,
127,
172,
314,
315,
415,
416,
453,
454,
635,
636,
815,
816,
889,
890,
933,
934,
1043,
1044,
1493,
1494,
1798,
1799,
1806,
1807,
1824,
1842,
1858,
1868,
1884,
1907,
1924,
1969,
2035,
2036,
2042,
2631,
2632,
2661,
2662,
2823,
2824,
2831,
2832,
2849,
2867,
2883,
2893,
2909,
2932,
2949,
2994,
3104,
3105,
3266,
3267,
3274,
3275,
3292,
3310,
3326,
3336,
3352,
3375,
3392,
3437,
3579,
3580,
3680,
3681,
3718,
3719,
3900,
3901,
4080,
4081,
4154,
4155,
4196,
4197,
4357,
4358,
4364,
4506,
5272,
5273,
5523,
5524,
5997,
5998,
6004,
6061,
6062,
6156,
6157,
6262,
6263,
6475,
6476,
6527,
6528,
6842,
6843,
6844,
6845,
6851,
6857,
6872,
6873,
7100,
7101,
7308,
7314,
8624,
8625,
10229,
10230,
11534,
11695,
11696,
11707,
11708,
11724,
11734,
11749,
11766,
11811,
11852,
11853,
11880,
11881,
11882,
11889,
11890,
11907,
11925,
11941,
11951,
11967,
11990,
12007,
12052,
12093,
12094,
12331,
12332,
12493,
12494,
12501,
12502,
12519,
12537,
12553,
12563,
12579,
12602,
12619,
12664,
12743,
12744,
12832,
12993,
12994,
13001,
13002,
13019,
13037,
13053,
13063,
13079,
13102,
13119,
13164,
13348,
13349,
13690,
13691,
14634,
14635,
15146,
15147,
15438,
15439,
15721,
15722,
15782,
15783,
15819,
15897,
15954,
16134,
16161,
16162,
16190,
16191,
16660,
16661,
16713,
16769,
16816,
16817,
16856,
16857,
17168,
17219,
17380,
17381,
17385,
17386,
17397,
17403,
17417,
17434,
17479,
17723,
17724,
17731,
17732,
17749,
17767,
17783,
17793,
17809,
17832,
17849,
17894,
18138,
18139,
18381,
18382,
18456,
18457,
18463,
18807,
18808,
18904,
18905,
18906,
19067,
19068,
19073,
19074,
19085,
19091,
19104,
19121,
19166,
19230,
19231,
19232,
19233,
19269,
19270,
19271,
19275,
19276,
19287,
19293,
19307,
19324,
19369,
19565,
19566,
19573,
19574,
19591,
19609,
19625,
19635,
19651,
19674,
19691,
19736,
19844,
20005,
20006,
20013,
20014,
20031,
20049,
20065,
20075,
20091,
20114,
20140,
20185,
20346,
20347,
20354,
20355,
20372,
20390,
20406,
20416,
20432,
20455,
20472,
20517,
20759,
20760,
20810,
20811,
20862,
20863,
21024,
21025,
21027,
21028
],
"line_end_idx": [
60,
61,
70,
71,
87,
95,
110,
127,
172,
314,
315,
415,
416,
453,
454,
635,
636,
815,
816,
889,
890,
933,
934,
1043,
1044,
1493,
1494,
1798,
1799,
1806,
1807,
1824,
1842,
1858,
1868,
1884,
1907,
1924,
1969,
2035,
2036,
2042,
2631,
2632,
2661,
2662,
2823,
2824,
2831,
2832,
2849,
2867,
2883,
2893,
2909,
2932,
2949,
2994,
3104,
3105,
3266,
3267,
3274,
3275,
3292,
3310,
3326,
3336,
3352,
3375,
3392,
3437,
3579,
3580,
3680,
3681,
3718,
3719,
3900,
3901,
4080,
4081,
4154,
4155,
4196,
4197,
4357,
4358,
4364,
4506,
5272,
5273,
5523,
5524,
5997,
5998,
6004,
6061,
6062,
6156,
6157,
6262,
6263,
6475,
6476,
6527,
6528,
6842,
6843,
6844,
6845,
6851,
6857,
6872,
6873,
7100,
7101,
7308,
7314,
8624,
8625,
10229,
10230,
11534,
11695,
11696,
11707,
11708,
11724,
11734,
11749,
11766,
11811,
11852,
11853,
11880,
11881,
11882,
11889,
11890,
11907,
11925,
11941,
11951,
11967,
11990,
12007,
12052,
12093,
12094,
12331,
12332,
12493,
12494,
12501,
12502,
12519,
12537,
12553,
12563,
12579,
12602,
12619,
12664,
12743,
12744,
12832,
12993,
12994,
13001,
13002,
13019,
13037,
13053,
13063,
13079,
13102,
13119,
13164,
13348,
13349,
13690,
13691,
14634,
14635,
15146,
15147,
15438,
15439,
15721,
15722,
15782,
15783,
15819,
15897,
15954,
16134,
16161,
16162,
16190,
16191,
16660,
16661,
16713,
16769,
16816,
16817,
16856,
16857,
17168,
17219,
17380,
17381,
17385,
17386,
17397,
17403,
17417,
17434,
17479,
17723,
17724,
17731,
17732,
17749,
17767,
17783,
17793,
17809,
17832,
17849,
17894,
18138,
18139,
18381,
18382,
18456,
18457,
18463,
18807,
18808,
18904,
18905,
18906,
19067,
19068,
19073,
19074,
19085,
19091,
19104,
19121,
19166,
19230,
19231,
19232,
19233,
19269,
19270,
19271,
19275,
19276,
19287,
19293,
19307,
19324,
19369,
19565,
19566,
19573,
19574,
19591,
19609,
19625,
19635,
19651,
19674,
19691,
19736,
19844,
20005,
20006,
20013,
20014,
20031,
20049,
20065,
20075,
20091,
20114,
20140,
20185,
20346,
20347,
20354,
20355,
20372,
20390,
20406,
20416,
20432,
20455,
20472,
20517,
20759,
20760,
20810,
20811,
20862,
20863,
21024,
21025,
21027,
21028,
21057
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 21057,
"ccnet_original_nlines": 314,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4015040695667267,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.033632759004831314,
"rps_doc_frac_lines_end_with_ellipsis": 0.009523809887468815,
"rps_doc_frac_no_alph_words": 0.22289533913135529,
"rps_doc_frac_unique_words": 0.2727987468242645,
"rps_doc_mean_word_length": 4.197851181030273,
"rps_doc_num_sentences": 211,
"rps_doc_symbol_to_word_ratio": 0.0037601799704134464,
"rps_doc_unigram_entropy": 5.975067138671875,
"rps_doc_word_count": 3816,
"rps_doc_frac_chars_dupe_10grams": 0.25463512539863586,
"rps_doc_frac_chars_dupe_5grams": 0.26281291246414185,
"rps_doc_frac_chars_dupe_6grams": 0.25575879216194153,
"rps_doc_frac_chars_dupe_7grams": 0.25463512539863586,
"rps_doc_frac_chars_dupe_8grams": 0.25463512539863586,
"rps_doc_frac_chars_dupe_9grams": 0.25463512539863586,
"rps_doc_frac_chars_top_2gram": 0.006554719991981983,
"rps_doc_frac_chars_top_3gram": 0.009988140314817429,
"rps_doc_frac_chars_top_4gram": 0.012235470116138458,
"rps_doc_books_importance": -2603.968505859375,
"rps_doc_books_importance_length_correction": -2603.968505859375,
"rps_doc_openwebtext_importance": -1358.1234130859375,
"rps_doc_openwebtext_importance_length_correction": -1358.1234130859375,
"rps_doc_wikipedia_importance": -1004.0414428710938,
"rps_doc_wikipedia_importance_length_correction": -1004.0414428710938
},
"fasttext": {
"dclm": 0.06566309928894043,
"english": 0.9773933291435242,
"fineweb_edu_approx": 1.0705578327178955,
"eai_general_math": 0.014443520456552505,
"eai_open_web_math": 0.30031394958496094,
"eai_web_code": 0.0004282600129954517
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "343.73",
"labels": {
"level_1": "Social sciences",
"level_2": "Law",
"level_3": "Criminal law"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"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 |
3,334,089,357,956,779,500 | 【Android】プログレスダイアログの表示2
プログレスダイアログの表示方法です。
ボタンを押すと、下記のようなダイアログを表示します。
プログレスダイアログ
●ソースコード
「R.layout.main」にボタンを配置し、
「android:onClick=”BtnClick”」を設定し使用するソースです。
private ProgressDialog progressDialog1;
private ProgressThread1 progressThread1;
static final int PROGRESS_DIALOG1 = 0;
public class TestDialog extends Activity {
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.main);
}
//ボタンクリックイベント（XMLにandroid:onClickを記述）
public void BtnClick(View v) {
if(v.getId() == R.id.button0)
{
showDialog(PROGRESS_DIALOG1);
}
}
@Override
protected Dialog onCreateDialog(int id) {
// ダイアログが複数ある場合にidを使用する
if (id == PROGRESS_DIALOG1) {
//プログレスダイアログ表示
progressDialog1 = new ProgressDialog(this);
progressDialog1.setProgressStyle(ProgressDialog.STYLE_HORIZONTAL);
progressDialog1.setMax(100);
progressDialog1.setMessage("処理中です...");
progressDialog1.setButton("Cancel", new DialogInterface.OnClickListener(){
public void onClick(DialogInterface dialog, int whichButton) {
dismissDialog(PROGRESS_DIALOG1);
progressThread1.setState(ProgressThread1.STATE_DONE);
}
});
return progressDialog2;
}
}
@Override
protected void onPrepareDialog(int id, Dialog dialog) {
super.onPrepareDialog(id, dialog);
if (id == 0) {
progressThread1 = new ProgressThread1(handler1);
progressThread1.start();
}
}
private final Handler handler1 = new Handler() {
@Override
public void handleMessage(Message msg) {
int total = msg.getData().getInt("total");
progressDialog1.setProgress(total);
if (total >= 100){
TextView textview1 = (TextView)findViewById(R.id.textview1);
textview1.setText("成功しました！");
dismissDialog(PROGRESS_DIALOG1);
progressThread1.setState(ProgressThread1.STATE_DONE);
}
}
};
private class ProgressThread1 extends Thread {
Handler mHandler;
final static int STATE_DONE = 0;
final static int STATE_RUNNING = 1;
int mState;
int total;
ProgressThread1(Handler h) {
mHandler = h;
}
public void run() {
mState = STATE_RUNNING;
total = 0;
while (mState == STATE_RUNNING) {
try {
Thread.sleep(100);
}
catch (InterruptedException e) {
Log.e("ERROR", "Thread Interrupted");
}
Message msg = mHandler.obtainMessage();
Bundle b = new Bundle();
b.putInt("total", total);
msg.setData(b);
mHandler.sendMessage(msg);
total++;
}
}
public void setState(int state) {
mState = state;
}
}
}
スポンサード リンク
return top | {
"url": "http://android.popotoo.com/dialog/349/",
"source_domain": "android.popotoo.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "24597",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3HX65DDU725I4YUK6KTOSWDVA75GTGIR",
"WARC-Concurrent-To": "<urn:uuid:28477e83-8fa9-4fe0-83f0-cc84d3f85d28>",
"WARC-Date": "2018-02-24T10:01:30Z",
"WARC-IP-Address": "49.212.198.28",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:73NUTN4CXUSYOMACZQARXXEAEPWUYHKF",
"WARC-Record-ID": "<urn:uuid:fd90972d-b5cf-47f0-9771-0cbe838e7fae>",
"WARC-Target-URI": "http://android.popotoo.com/dialog/349/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:444de1bc-6c5d-457f-990f-52f731927a46>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-141-213-112.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
24,
25,
44,
71,
72,
83,
84,
92,
93,
118,
161,
162,
163,
203,
244,
245,
284,
285,
328,
339,
390,
428,
461,
464,
465,
504,
536,
568,
572,
605,
609,
612,
613,
624,
667,
668,
694,
726,
744,
791,
861,
893,
936,
1014,
1081,
1119,
1178,
1184,
1191,
1192,
1219,
1223,
1226,
1227,
1238,
1295,
1332,
1333,
1350,
1402,
1432,
1436,
1439,
1440,
1490,
1502,
1545,
1546,
1592,
1631,
1656,
1721,
1755,
1756,
1793,
1851,
1856,
1860,
1864,
1865,
1913,
1933,
1968,
2006,
2020,
2033,
2034,
2065,
2082,
2086,
2087,
2109,
2136,
2150,
2187,
2197,
2221,
2227,
2264,
2307,
2313,
2357,
2386,
2416,
2436,
2467,
2480,
2485,
2489,
2490,
2526,
2545,
2549,
2552,
2554,
2555,
2566,
2567,
2568
],
"line_end_idx": [
24,
25,
44,
71,
72,
83,
84,
92,
93,
118,
161,
162,
163,
203,
244,
245,
284,
285,
328,
339,
390,
428,
461,
464,
465,
504,
536,
568,
572,
605,
609,
612,
613,
624,
667,
668,
694,
726,
744,
791,
861,
893,
936,
1014,
1081,
1119,
1178,
1184,
1191,
1192,
1219,
1223,
1226,
1227,
1238,
1295,
1332,
1333,
1350,
1402,
1432,
1436,
1439,
1440,
1490,
1502,
1545,
1546,
1592,
1631,
1656,
1721,
1755,
1756,
1793,
1851,
1856,
1860,
1864,
1865,
1913,
1933,
1968,
2006,
2020,
2033,
2034,
2065,
2082,
2086,
2087,
2109,
2136,
2150,
2187,
2197,
2221,
2227,
2264,
2307,
2313,
2357,
2386,
2416,
2436,
2467,
2480,
2485,
2489,
2490,
2526,
2545,
2549,
2552,
2554,
2555,
2566,
2567,
2568,
2578
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2578,
"ccnet_original_nlines": 119,
"rps_doc_curly_bracket": 0.01551590021699667,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04535637050867081,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03671706095337868,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5161986947059631,
"rps_doc_frac_unique_words": 0.5664739608764648,
"rps_doc_mean_word_length": 10.757225036621094,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0.0021598299499601126,
"rps_doc_unigram_entropy": 4.3331217765808105,
"rps_doc_word_count": 173,
"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.03224072977900505,
"rps_doc_frac_chars_top_3gram": 0.01934443973004818,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -209.44776916503906,
"rps_doc_books_importance_length_correction": -209.44776916503906,
"rps_doc_openwebtext_importance": -131.07077026367188,
"rps_doc_openwebtext_importance_length_correction": -131.07077026367188,
"rps_doc_wikipedia_importance": -129.19491577148438,
"rps_doc_wikipedia_importance_length_correction": -129.19491577148438
},
"fasttext": {
"dclm": 0.9923568964004517,
"english": 0.13209831714630127,
"fineweb_edu_approx": 2.982313632965088,
"eai_general_math": 0.1435006856918335,
"eai_open_web_math": 0.014241640456020832,
"eai_web_code": 0.9833200573921204
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-7,339,154,242,403,103,000 | YOUR TEST RESULTS
Start Speed Test Again
IP: 54.156.54.104
A slow Internet connection might not be your fault. Even the fastest broadband connections can be stifled by any number of factors. If you work from home or rely on it for your business, it can be devastating. Fortunately, most of the things that can cause your connection problems can be solved from the comfort of your own home.
1. Computer Worms
The Internet is a dangerous place - this is well known. People are less likely to click on anything with flashing lights or pornography simply due to the risk of getting a computer virus. Internet or Computer worms are particularly vicious, as they can spread and infect every computer on the network if left unchecked. These works can end up congesting your Internet speed, consuming it for their creator's purposes.
The solution lies in an anti-virus program. Keep it up to date and run it regularly or when you feel that your system has been infected.
2. Router Settings
An improperly configured router can result in drastically reduced Internet speed. Check the router's manual and consult with your ISP to find out what your router's settings should be. Keep track of any changes you make to undo any settings that end up making things worse.
3. Your Browser
Internet Explorer is a serviceable browser, but it is far from ideal. People who spend their time online a lot should use a different browser, such as Google Chrome or Mozilla Firefox. See which one works for you best. Firefox, for example, is a memory hog, while Chrome is particularly light and can work on computers with a limited amount of RAM.
4. Signal Interference
If you're connected to your network via Wi-Fi, signal interference might be responsible for your sluggish Internet speeds. Just about anything can interfere with the signal. Other wireless networks, cordless phones, and even mirrors can all cause interference.
You can either move your router to a better position to see if it helps, or rearrange the way certain pieces of furniture are placed. You may also have to consider that there is no way to fix it, aside from connecting your computer to the router via an Ethernet cable, as thick walls may be the source of the interference.
5. Equipment Failure
Your slow Internet speed might be a result of faulty equipment. It might look like its working because you're still connected, but the faults in your router or modem will cause dropped connections, resulting in slower browsing and disconnections.
Try to isolate the problem. For example, you can try to connect your computer via Ethernet cable to see if the router is the problem. You can also try borrowing a modem to either confirm or remove it as the issue. Once you've found out what's causing the issue, you can either have the offending product repaired or replaced.
6. Programs Running in the Background
Check your computer for programs running in the background that could be responsible for your slow Internet connection. Peer to peer programs, for example, are notorious for running as fast as they can, congesting your network in the process. If you want them running while you surf the Internet, you can set limits on their download and upload speeds to give you more leeway in terms of internet speed.
7. Your Internet Service Provider
A lot of the problems that can come up regarding your Internet speed may actually come from your provider. If you can't figure out what's causing your sluggish speed, you should talk to your ISP. Ask if they're having technical difficulties or if they changed their settings. Worst case you can scratch them off as the cause of your Internet woes.
8. Your Computer
Your computer might be the cause of your problems. If your computer cannot cope with your Internet speed, it will slow it down. You need to make sure that it is well maintained and up-to-date in terms of drivers and peripherals.
One of these should solve your Internet woes. If not, consult with professional. There may be something wrong that only a technician can detect and repair. It is best to do it soon, in case it is a problem that will only get worse with time. | {
"url": "http://www.espeedcheck.com/?cid=5049",
"source_domain": "www.espeedcheck.com",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "26882",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3SI4TUVZX2K6UJZXQD2ZDD4GTTW6JV2E",
"WARC-Concurrent-To": "<urn:uuid:9977d779-72d3-4673-bf68-ad178c6673c2>",
"WARC-Date": "2017-08-24T04:47:17Z",
"WARC-IP-Address": "184.173.138.111",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:CVGCKWOX653O4N6CSTIMUYYP3MK5HGNI",
"WARC-Record-ID": "<urn:uuid:5d553f01-7fa1-4d5a-b170-c01873cab061>",
"WARC-Target-URI": "http://www.espeedcheck.com/?cid=5049",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ab4c324f-ae21-4c9d-9e66-2abf1de3d3d8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-164-105-194.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,
18,
19,
20,
21,
22,
23,
46,
64,
65,
396,
397,
415,
416,
834,
835,
972,
973,
992,
993,
1267,
1268,
1284,
1285,
1634,
1635,
1658,
1659,
1920,
1921,
2244,
2245,
2266,
2267,
2514,
2515,
2841,
2842,
2880,
2881,
3285,
3286,
3320,
3321,
3669,
3670,
3687,
3688,
3917,
3918
],
"line_end_idx": [
18,
19,
20,
21,
22,
23,
46,
64,
65,
396,
397,
415,
416,
834,
835,
972,
973,
992,
993,
1267,
1268,
1284,
1285,
1634,
1635,
1658,
1659,
1920,
1921,
2244,
2245,
2266,
2267,
2514,
2515,
2841,
2842,
2880,
2881,
3285,
3286,
3320,
3321,
3669,
3670,
3687,
3688,
3917,
3918,
4159
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4159,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4788391888141632,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010882710106670856,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1305924952030182,
"rps_doc_frac_unique_words": 0.4285714328289032,
"rps_doc_mean_word_length": 4.654061794281006,
"rps_doc_num_sentences": 53,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.147896766662598,
"rps_doc_word_count": 714,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01805596984922886,
"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.02166716940701008,
"rps_doc_frac_chars_top_3gram": 0.015347580425441265,
"rps_doc_frac_chars_top_4gram": 0.01203732006251812,
"rps_doc_books_importance": -318.7952575683594,
"rps_doc_books_importance_length_correction": -318.7952575683594,
"rps_doc_openwebtext_importance": -172.3619842529297,
"rps_doc_openwebtext_importance_length_correction": -172.3619842529297,
"rps_doc_wikipedia_importance": -145.43011474609375,
"rps_doc_wikipedia_importance_length_correction": -145.43011474609375
},
"fasttext": {
"dclm": 0.1630631685256958,
"english": 0.9451859593391418,
"fineweb_edu_approx": 2.5936226844787598,
"eai_general_math": 0.1842067837715149,
"eai_open_web_math": 0.23002105951309204,
"eai_web_code": 0.16659343242645264
}
} | {
"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.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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "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 |
-7,834,203,813,433,387,000 | aboutsummaryrefslogtreecommitdiffstats
path: root/asterisk-1.6.1.13-rc1-summary.txt
diff options
context:
space:
mode:
Diffstat (limited to 'asterisk-1.6.1.13-rc1-summary.txt')
-rw-r--r--asterisk-1.6.1.13-rc1-summary.txt410
1 files changed, 410 insertions, 0 deletions
diff --git a/asterisk-1.6.1.13-rc1-summary.txt b/asterisk-1.6.1.13-rc1-summary.txt
new file mode 100644
index 000000000..639264a91
--- /dev/null
+++ b/asterisk-1.6.1.13-rc1-summary.txt
@@ -0,0 +1,410 @@
+ Release Summary
+
+ asterisk-1.6.1.13-rc1
+
+ Date: 2010-01-08
+
+ <[email protected]>
+
+ ----------------------------------------------------------------------
+
+ Table of Contents
+
+ 1. Summary
+ 2. Contributors
+ 3. Closed Issues
+ 4. Other Changes
+ 5. Diffstat
+
+ ----------------------------------------------------------------------
+
+ Summary
+
+ [Back to Top]
+
+ This release includes only bug fixes. The changes included were made only
+ to address problems that have been identified in this release series.
+ Users should be able to safely upgrade to this version if this release
+ series is already in use. Users considering upgrading from a previous
+ release series are strongly encouraged to review the UPGRADE.txt document
+ as well as the CHANGES document for information about upgrading to this
+ release series.
+
+ The data in this summary reflects changes that have been made since the
+ previous release, asterisk-1.6.1.12.
+
+ ----------------------------------------------------------------------
+
+ Contributors
+
+ [Back to Top]
+
+ This table lists the people who have submitted code, those that have
+ tested patches, as well as those that reported issues on the issue tracker
+ that were resolved in this release. For coders, the number is how many of
+ their patches (of any size) were committed into this release. For testers,
+ the number is the number of times their name was listed as assisting with
+ testing a patch. Finally, for reporters, the number is the number of
+ issues that they reported that were closed by commits that went into this
+ release.
+
+ Coders Testers Reporters
+ 19 tilghman 2 wdoekes 3 wdoekes
+ 4 dvossel 1 alecdavis 1 aatef
+ 3 jpeeler 1 aragon 1 alecdavis
+ 2 dant 1 atis 1 alexrecarey
+ 2 russell 1 corruptor 1 aragon
+ 2 seanbright 1 dvossel 1 asgaroth
+ 2 wdoekes 1 haakon 1 atis
+ 1 alecdavis 1 nickilo 1 bcnit
+ 1 dimas 1 rickead2000 1 bklang
+ 1 haakon 1 seanbright 1 corruptor
+ 1 kpfleming 1 sergee 1 galeras
+ 1 nickilo 1 shanermn 1 haakon
+ 1 oej 1 tilghman 1 jensvb
+ 1 ppyy 1 wonderg 1 jlaroff
+ 1 Rzadzins 1 yeshuawatso 1 john8675309
+ 1 telecos82 1 Kashif Raza
+ 1 tzafrir 1 ManChicken
+ 1 nickilo
+ 1 omolenkamp
+ 1 qwell
+ 1 rickead2000
+ 1 RoadKill
+ 1 Rzadzins
+ 1 semond
+ 1 sergee
+ 1 shanermn
+ 1 telecos82
+ 1 yeshuawatso
+
+ ----------------------------------------------------------------------
+
+ Closed Issues
+
+ [Back to Top]
+
+ This is a list of all issues from the issue tracker that were closed by
+ changes that went into this release.
+
+ Category: Addons/res_config_mysql
+
+ #16533: [patch] Realtime is broken, blank strings aren't valid any more
+ Revision: 237412
+ Reporter: sergee
+ Testers: sergee
+ Coders: tilghman
+
+ Category: Applications/app_meetme
+
+ #15725: [patch][regression] set talker detection (T) does not work unless
+ set talker optimization (o) is enabled.
+ Revision: 238183
+ Reporter: shanermn
+ Testers: shanermn
+ Coders: dimas
+
+ #16509: [patch] meetme can support only 6341 rooms
+ Revision: 236512
+ Reporter: Kashif Raza
+ Testers: seanbright
+ Coders: seanbright
+
+ Category: Applications/app_mp3
+
+ #16531: [regression] chan_local audio crash
+ Revision: 238012
+ Reporter: john8675309
+ Coders: russell
+
+ Category: Applications/app_queue
+
+ #16078: [patch] length of queue name is static
+ Revision: 238363
+ Reporter: RoadKill
+ Testers: dvossel
+ Coders: ppyy
+
+ #16168: Hold Time report (reportholdtime) issue
+ Revision: 237922
+ Reporter: nickilo
+ Testers: nickilo, wonderg
+ Coders: nickilo
+
+ #16385: [patch] app_queue segfaults if realtime field uniqueid is NULL
+ Revision: 237329
+ Reporter: haakon
+ Testers: haakon
+ Coders: haakon, dvossel
+
+ Category: Applications/app_stack
+
+ #16510: [patch] Local values not set within gosub
+ Revision: 236302
+ Reporter: atis
+ Testers: atis
+ Coders: tilghman
+
+ Category: Applications/app_voicemail
+
+ #16515: depreciated minmessage still referred to in warning
+ Revision: 236669
+ Reporter: ManChicken
+ Coders: tilghman
+
+ Category: CDR/General
+
+ #16180: [patch] CDR dispositions BUSY and FAILED are reported as NO ANSWER
+ Revision: 235663
+ Reporter: aatef
+ Coders: jpeeler
+
+ Category: Channels/chan_dahdi
+
+ #16389: [patch] busydetect incorrectly hangs up incoming call due to
+ incoming DTMF seen as busy pattern.
+ Revision: 235776
+ Reporter: alecdavis
+ Testers: alecdavis
+ Coders: alecdavis
+
+ Category: Channels/chan_iax2
+
+ #16565: crash: in "scheduled_destroy" at chan_iax2.c:1511
+ Revision: 238430
+ Reporter: jensvb
+ Coders: dvossel
+
+ Category: Channels/chan_sip/General
+
+ #16295: [patch] handle_incoming() incorrectly sets p->method to SIP_ACK
+ Revision: 236065
+ Reporter: omolenkamp
+ Coders: dvossel
+
+ #16459: [patch] Change in sip show channels display format allowing more
+ digits for CID
+ Revision: 238407
+ Reporter: Rzadzins
+ Coders: Rzadzins
+
+ Category: Channels/chan_sip/Subscriptions
+
+ #16093: SIP subscriptions are lost after a reload
+ Revision: 237841
+ Reporter: jlaroff
+ Coders: dvossel
+
+ Category: Core/Channels
+
+ #15609: [patch] WARNING[23025]: channel.c:952 __ast_queue_frame:
+ Exceptionally long voice queue length queuing to Local
+ Revision: 236984
+ Reporter: aragon
+ Testers: aragon
+ Coders: tilghman
+
+ Category: Core/General
+
+ #16407: [patch] potential buffer overflow in say_date_with_format()
+ Revision: 237576
+ Reporter: qwell
+ Coders: tilghman
+
+ #16427: [patch] remainder ast_expr2 func misspelt as reminder
+ Revision: 236715
+ Reporter: wdoekes
+ Testers: wdoekes
+ Coders: wdoekes
+
+ #16434: [patch] Background() when called from AGI script no longer gives
+ digit code when interrupted
+ Revision: 237408
+ Reporter: rickead2000
+ Testers: rickead2000
+ Coders: tilghman
+
+ #16452: [patch] Lots of crashes after upgrading to latest 1.6.0.20-rc1
+ Revision: 236803
+ Reporter: corruptor
+ Testers: corruptor
+ Coders: tilghman
+
+ Category: Core/PBX
+
+ #16479: "sip show peers" returns notice
+ Revision: 237724
+ Reporter: alexrecarey
+ Coders: russell
+
+ Category: Features/Parking
+
+ #16234: [patch] Call parking via AMI causes announcment and ringback to
+ caller channel
+ Revision: 235825
+ Reporter: yeshuawatso
+ Testers: yeshuawatso
+ Coders: tilghman
+
+ Category: Functions/func_cdr
+
+ #16289: [patch] core show function CDR reports wrong disposition values
+ Revision: 238233
+ Reporter: wdoekes
+ Coders: tilghman
+
+ Category: General
+
+ #16251: Symbol referencing errors (MIN/MAX in channel.o/udptl.o)
+ Revision: 238497
+ Reporter: asgaroth
+ Coders: tilghman
+
+ Category: PBX/General
+
+ #16528: [patch] Bridge application fails when both channels have a similar
+ name
+ Revision: 238136
+ Reporter: telecos82
+ Coders: telecos82
+
+ Category: PBX/pbx_config
+
+ #16482: [patch] Serious problem with pattern matching (regression in
+ #15421)
+ Revision: 237496
+ Reporter: wdoekes
+ Testers: wdoekes, tilghman
+ Coders: wdoekes, tilghman
+
+ Category: Resources/res_agi
+
+ #16297: [patch] Timeout in SPEECH RECOGNIZE not working.
+ Revision: 237325
+ Reporter: semond
+ Coders: jpeeler
+
+ #16504: Segfault in res_agi with no second paramter to EXEC
+ Revision: 236188
+ Reporter: bklang
+ Coders: tilghman
+
+ Category: Resources/res_monitor
+
+ #16376: [patch] Incorrect path passed to MONITOR_EXEC application after
+ 'Monitor()' call finishes.
+ Revision: 235943
+ Reporter: bcnit
+ Coders: dant
+
+ #16377: res_monitor.c chan->monitor->filename_base has duplicated path
+ Revision: 235943
+ Reporter: galeras
+ Coders: dant
+
+ ----------------------------------------------------------------------
+
+ Commits Not Associated with an Issue
+
+ [Back to Top]
+
+ This is a list of all changes that went into this release that did not
+ directly close an issue from the issue tracker. The commits may have been
+ marked as being related to an issue. If that is the case, the issue
+ numbers are listed here, as well.
+
+ +------------------------------------------------------------------------+
+ | Revision | Author | Summary | Issues |
+ | | | | Referenced |
+ |----------+------------+-----------------------------------+------------|
+ | | | Point to the typical missing | |
+ | 235575 | tilghman | package, not the cryptic "termcap | |
+ | | | support". | |
+ |----------+------------+-----------------------------------+------------|
+ | 235658 | tilghman | Revise verbiage, per | |
+ | | | #asterisk-dev discussion | |
+ |----------+------------+-----------------------------------+------------|
+ | 236360 | kpfleming | update to latest releases with | |
+ | | | zero uid/gid | |
+ |----------+------------+-----------------------------------+------------|
+ | | | Turn on colors in the daemon, | |
+ | 236436 | tilghman | since there's many requests for | |
+ | | | it on Ubuntu. | |
+ |----------+------------+-----------------------------------+------------|
+ | | | Try a test compile to see if | |
+ | 236634 | seanbright | PTHREAD_ONCE_INIT requires extra | |
+ | | | braces. | |
+ |----------+------------+-----------------------------------+------------|
+ | | | When the field is blank, don't | |
+ | 236851 | tilghman | warn about the field being unable | |
+ | | | to be coerced, just skip the | |
+ | | | column. | |
+ |----------+------------+-----------------------------------+------------|
+ | 236904 | jpeeler | One more LOW_MEMORY compile fix. | |
+ |----------+------------+-----------------------------------+------------|
+ | 237138 | oej | Release memory of the contact acl | |
+ | | | before unloading module | |
+ |----------+------------+-----------------------------------+------------|
+ | | | It's also possible for the Local | |
+ | 237321 | tilghman | channel to directly execute an | |
+ | | | Application. | |
+ |----------+------------+-----------------------------------+------------|
+ | 237416 | tilghman | Oops, didn't compile (thanks, | |
+ | | | kpfleming) | |
+ |----------+------------+-----------------------------------+------------|
+ | 237967 | tilghman | One duplicate setting here (dead | |
+ | | | code). | |
+ |----------+------------+-----------------------------------+------------|
+ | | | Document the usefulness of | |
+ | 238351 | tzafrir | explicit udp:// in the register | |
+ | | | string | |
+ +------------------------------------------------------------------------+
+
+ ----------------------------------------------------------------------
+
+ Diffstat Results
+
+ [Back to Top]
+
+ This is a summary of the changes to the source code that went into this
+ release that was generated using the diffstat utility.
+
+ apps/app_meetme.c | 66 ++++++++++++++++++++------------------
+ apps/app_mp3.c | 6 ++-
+ apps/app_queue.c | 14 ++++----
+ apps/app_stack.c | 4 +-
+ apps/app_voicemail.c | 2 -
+ cdr/cdr_adaptive_odbc.c | 40 +++++++++++++++++------
+ channels/chan_alsa.c | 3 -
+ channels/chan_console.c | 7 ----
+ channels/chan_iax2.c | 2 -
+ channels/chan_local.c | 4 +-
+ channels/chan_oss.c | 7 ----
+ channels/chan_sip.c | 54 +++++++++++++++++++------------
+ channels/chan_usbradio.c | 7 ----
+ configs/sip.conf.sample | 8 ++++
+ configure.ac | 22 ++++++++++++
+ contrib/init.d/rc.debian.asterisk | 11 +++++-
+ funcs/func_cdr.c | 9 ++---
+ include/asterisk/autoconfig.h.in | 54 +++++++++++++------------------
+ include/asterisk/cdr.h | 10 ++---
+ include/asterisk/channel.h | 4 ++
+ include/asterisk/threadstorage.h | 10 ++++-
+ include/asterisk/utils.h | 5 ++
+ main/ast_expr2.c | 8 ++--
+ main/ast_expr2.y | 8 ++--
+ main/channel.c | 4 +-
+ main/config.c | 4 ++
+ main/dsp.c | 18 ++++++----
+ main/features.c | 18 ++++------
+ main/pbx.c | 56 +++++++++++++++++---------------
+ main/poll.c | 8 ----
+ main/say.c | 52 ++++++++++++++---------------
+ main/utils.c | 4 +-
+ res/res_agi.c | 16 ++++++---
+ res/res_monitor.c | 4 +-
+ sounds/Makefile | 4 +-
+ utils/ael_main.c | 2 +
+ 36 files changed, 317 insertions(+), 238 deletions(-)
+
+ ---------------------------------------------------------------------- | {
"url": "https://cgit.osmocom.org/dect/asterisk/diff/asterisk-1.6.1.13-rc1-summary.txt?h=v1.4.10.1&id=17c68862e4a436b883518824af55f88cb24b0a39",
"source_domain": "cgit.osmocom.org",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "31532",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:R65ZOK3CWOU7AELRBWIW7GML56ITPU4T",
"WARC-Concurrent-To": "<urn:uuid:ecb035b1-0047-4c21-ab1f-c8f847abe388>",
"WARC-Date": "2022-01-18T20:10:38Z",
"WARC-IP-Address": "78.46.96.155",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6IG6S52MXM5MK2HPRYUUVKZPOHA6ILCR",
"WARC-Record-ID": "<urn:uuid:e035e4a2-562c-4b18-9815-ebe621738b3a>",
"WARC-Target-URI": "https://cgit.osmocom.org/dect/asterisk/diff/asterisk-1.6.1.13-rc1-summary.txt?h=v1.4.10.1&id=17c68862e4a436b883518824af55f88cb24b0a39",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bd9934dd-22cc-4c4f-acde-29c748db3032>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-239\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,
39,
84,
97,
106,
113,
119,
177,
224,
269,
352,
373,
400,
414,
454,
472,
490,
492,
516,
518,
537,
539,
567,
569,
642,
644,
664,
666,
679,
697,
716,
735,
749,
751,
824,
826,
836,
838,
854,
856,
932,
1004,
1077,
1149,
1225,
1299,
1317,
1319,
1393,
1432,
1434,
1507,
1509,
1524,
1526,
1542,
1544,
1615,
1692,
1768,
1845,
1921,
1992,
2068,
2079,
2081,
2108,
2142,
2174,
2207,
2237,
2270,
2306,
2334,
2366,
2399,
2435,
2468,
2500,
2528,
2557,
2598,
2626,
2651,
2663,
2678,
2688,
2704,
2717,
2730,
2741,
2752,
2765,
2779,
2795,
2797,
2870,
2872,
2888,
2890,
2906,
2908,
2982,
3021,
3023,
3059,
3061,
3135,
3154,
3173,
3191,
3210,
3212,
3248,
3250,
3326,
3368,
3387,
3408,
3428,
3444,
3446,
3499,
3518,
3542,
3564,
3585,
3587,
3620,
3622,
3668,
3687,
3711,
3729,
3731,
3766,
3768,
3817,
3836,
3857,
3876,
3891,
3893,
3943,
3962,
3982,
4010,
4028,
4030,
4103,
4122,
4141,
4159,
4185,
4187,
4222,
4224,
4276,
4295,
4312,
4328,
4347,
4349,
4388,
4390,
4452,
4471,
4494,
4513,
4515,
4539,
4541,
4618,
4637,
4655,
4673,
4675,
4707,
4709,
4780,
4818,
4837,
4859,
4880,
4900,
4902,
4933,
4935,
4995,
5014,
5033,
5051,
5053,
5091,
5093,
5167,
5186,
5209,
5227,
5229,
5304,
5321,
5340,
5361,
5380,
5382,
5426,
5428,
5480,
5499,
5519,
5537,
5539,
5565,
5567,
5634,
5691,
5710,
5729,
5747,
5766,
5768,
5793,
5795,
5865,
5884,
5902,
5921,
5923,
5987,
6006,
6026,
6045,
6063,
6065,
6140,
6170,
6189,
6213,
6236,
6255,
6257,
6330,
6349,
6371,
6392,
6411,
6413,
6434,
6436,
6478,
6497,
6521,
6539,
6541,
6570,
6572,
6646,
6663,
6682,
6706,
6729,
6748,
6750,
6781,
6783,
6857,
6876,
6896,
6915,
6917,
6937,
6939,
7006,
7025,
7046,
7065,
7067,
7091,
7093,
7170,
7177,
7196,
7218,
7238,
7240,
7267,
7269,
7340,
7350,
7369,
7389,
7418,
7446,
7448,
7478,
7480,
7539,
7558,
7577,
7595,
7597,
7659,
7678,
7697,
7716,
7718,
7752,
7754,
7828,
7857,
7876,
7894,
7909,
7911,
7984,
8003,
8023,
8038,
8040,
8113,
8115,
8154,
8156,
8172,
8174,
8247,
8323,
8393,
8429,
8431,
8508,
8551,
8574,
8651,
8692,
8754,
8776,
8853,
8902,
8939,
9016,
9076,
9101,
9178,
9220,
9280,
9306,
9383,
9424,
9487,
9507,
9584,
9627,
9689,
9730,
9750,
9827,
9887,
9964,
10021,
10057,
10134,
10179,
10238,
10263,
10340,
10398,
10421,
10498,
10559,
10578,
10655,
10694,
10753,
10772,
10849,
10851,
10924,
10926,
10945,
10947,
10963,
10965,
11039,
11096,
11098,
11162,
11187,
11220,
11246,
11275,
11330,
11359,
11394,
11423,
11454,
11485,
11544,
11580,
11615,
11648,
11696,
11725,
11797,
11833,
11869,
11915,
11949,
11977,
12005,
12029,
12052,
12081,
12115,
12166,
12189,
12237,
12259,
12290,
12317,
12342,
12367,
12423,
12425
],
"line_end_idx": [
39,
84,
97,
106,
113,
119,
177,
224,
269,
352,
373,
400,
414,
454,
472,
490,
492,
516,
518,
537,
539,
567,
569,
642,
644,
664,
666,
679,
697,
716,
735,
749,
751,
824,
826,
836,
838,
854,
856,
932,
1004,
1077,
1149,
1225,
1299,
1317,
1319,
1393,
1432,
1434,
1507,
1509,
1524,
1526,
1542,
1544,
1615,
1692,
1768,
1845,
1921,
1992,
2068,
2079,
2081,
2108,
2142,
2174,
2207,
2237,
2270,
2306,
2334,
2366,
2399,
2435,
2468,
2500,
2528,
2557,
2598,
2626,
2651,
2663,
2678,
2688,
2704,
2717,
2730,
2741,
2752,
2765,
2779,
2795,
2797,
2870,
2872,
2888,
2890,
2906,
2908,
2982,
3021,
3023,
3059,
3061,
3135,
3154,
3173,
3191,
3210,
3212,
3248,
3250,
3326,
3368,
3387,
3408,
3428,
3444,
3446,
3499,
3518,
3542,
3564,
3585,
3587,
3620,
3622,
3668,
3687,
3711,
3729,
3731,
3766,
3768,
3817,
3836,
3857,
3876,
3891,
3893,
3943,
3962,
3982,
4010,
4028,
4030,
4103,
4122,
4141,
4159,
4185,
4187,
4222,
4224,
4276,
4295,
4312,
4328,
4347,
4349,
4388,
4390,
4452,
4471,
4494,
4513,
4515,
4539,
4541,
4618,
4637,
4655,
4673,
4675,
4707,
4709,
4780,
4818,
4837,
4859,
4880,
4900,
4902,
4933,
4935,
4995,
5014,
5033,
5051,
5053,
5091,
5093,
5167,
5186,
5209,
5227,
5229,
5304,
5321,
5340,
5361,
5380,
5382,
5426,
5428,
5480,
5499,
5519,
5537,
5539,
5565,
5567,
5634,
5691,
5710,
5729,
5747,
5766,
5768,
5793,
5795,
5865,
5884,
5902,
5921,
5923,
5987,
6006,
6026,
6045,
6063,
6065,
6140,
6170,
6189,
6213,
6236,
6255,
6257,
6330,
6349,
6371,
6392,
6411,
6413,
6434,
6436,
6478,
6497,
6521,
6539,
6541,
6570,
6572,
6646,
6663,
6682,
6706,
6729,
6748,
6750,
6781,
6783,
6857,
6876,
6896,
6915,
6917,
6937,
6939,
7006,
7025,
7046,
7065,
7067,
7091,
7093,
7170,
7177,
7196,
7218,
7238,
7240,
7267,
7269,
7340,
7350,
7369,
7389,
7418,
7446,
7448,
7478,
7480,
7539,
7558,
7577,
7595,
7597,
7659,
7678,
7697,
7716,
7718,
7752,
7754,
7828,
7857,
7876,
7894,
7909,
7911,
7984,
8003,
8023,
8038,
8040,
8113,
8115,
8154,
8156,
8172,
8174,
8247,
8323,
8393,
8429,
8431,
8508,
8551,
8574,
8651,
8692,
8754,
8776,
8853,
8902,
8939,
9016,
9076,
9101,
9178,
9220,
9280,
9306,
9383,
9424,
9487,
9507,
9584,
9627,
9689,
9730,
9750,
9827,
9887,
9964,
10021,
10057,
10134,
10179,
10238,
10263,
10340,
10398,
10421,
10498,
10559,
10578,
10655,
10694,
10753,
10772,
10849,
10851,
10924,
10926,
10945,
10947,
10963,
10965,
11039,
11096,
11098,
11162,
11187,
11220,
11246,
11275,
11330,
11359,
11394,
11423,
11454,
11485,
11544,
11580,
11615,
11648,
11696,
11725,
11797,
11833,
11869,
11915,
11949,
11977,
12005,
12029,
12052,
12081,
12115,
12166,
12189,
12237,
12259,
12290,
12317,
12342,
12367,
12423,
12425,
12497
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 12497,
"ccnet_original_nlines": 424,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12575757503509521,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010984850116074085,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5420454740524292,
"rps_doc_frac_unique_words": 0.45980706810951233,
"rps_doc_mean_word_length": 6.047427654266357,
"rps_doc_num_sentences": 111,
"rps_doc_symbol_to_word_ratio": 0.012121209874749184,
"rps_doc_unigram_entropy": 5.692259311676025,
"rps_doc_word_count": 1244,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03588993847370148,
"rps_doc_frac_chars_dupe_6grams": 0.026718059554696083,
"rps_doc_frac_chars_dupe_7grams": 0.00664628017693758,
"rps_doc_frac_chars_dupe_8grams": 0.00664628017693758,
"rps_doc_frac_chars_dupe_9grams": 0.00664628017693758,
"rps_doc_frac_chars_top_2gram": 0.02047055959701538,
"rps_doc_frac_chars_top_3gram": 0.026319289579987526,
"rps_doc_frac_chars_top_4gram": 0.008640170097351074,
"rps_doc_books_importance": -819.0949096679688,
"rps_doc_books_importance_length_correction": -819.0949096679688,
"rps_doc_openwebtext_importance": -706.59912109375,
"rps_doc_openwebtext_importance_length_correction": -706.59912109375,
"rps_doc_wikipedia_importance": -400.7064514160156,
"rps_doc_wikipedia_importance_length_correction": -400.7064514160156
},
"fasttext": {
"dclm": 1.000008463859558,
"english": 0.6758796572685242,
"fineweb_edu_approx": 0.724635899066925,
"eai_general_math": 0.24944639205932617,
"eai_open_web_math": 0.37618494033813477,
"eai_web_code": 0.4618728756904602
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
2,595,780,389,889,163,300 | tag:blogger.com,1999:blog-4088979.post114541680652020644..comments2017-02-18T04:56:16.449-05:00Comments on TaoSecurity: Best Comment of the YearRichard Bejtlichhttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-4088979.post-1145743705106752622006-04-22T18:08:00.000-04:002006-04-22T18:08:00.000-04:00One vein of thougth here:Security vulns, and rootk...One vein of thougth here:<BR/><BR/>Security vulns, and rootkits -- how they effect people and the question of if they should be published is not a question that the security community is one qualified to even answer. Every person in this debate so far has a angle on the debate. <BR/><BR/>The real question is for those who study economics. Now, lets get on with the real [email protected]:blogger.com,1999:blog-4088979.post-1145493439054895502006-04-19T20:37:00.000-04:002006-04-19T20:37:00.000-04:00Two veins of thought here:1) McAfee has no busines...Two veins of thought here:<BR/><BR/>1) McAfee has no business addressing things like this book or rootkits.com. Stick to your products. Whenever a commercial vendor comes out like this making statements and other stirring remarks that the sky is falling, it always strikes me as deeply self-serving. Gee, if we panic everyone, will we sell more product? *sigh*<BR/><BR/>2) How can you defend against something or someone that you do not know about, or how they operate? Security people need to know how malicious programs and users work so that they can most efficiently defend and protect assets.<BR/><BR/>This is not a new concept, in fact, look to the ages-old industry of physical security. You can even turn on the Discovery Channel most afternoons and be entertained with It Takes a Thief, a show that has reformed thieves (supposedly) breaking into people's homes to illustrate exactly what a thief would do. They then enact safeguards to protect against thieves, and then try once more to break in to show how the safeguards worked.<BR/><BR/>This is an awesome show, although early versions seemed pretty mean as they didn't show that they told people they were breaking in (and you see the subsequent heart-breaking panic as they feel violated...).<BR/><BR/>Is this show teaching people how to be better thieves?<BR/><BR/>In addition, most of the people on the show are aware their security is not up to date, but they really believe they have "enough" to stop thieves...until shown otherwise just how easy it still is.<BR/><BR/>If we cannot learn attacks and how to do them so that we can defend against them, then also how are we to even show that our work is effective? Do we invite hackers to hack in and test? Contests? Pray and see? No, you learn how to do it, and then you test, and test again.<BR/><BR/>Books like these are necessary, and as much as some people have panic attacks about them, this is a growing and burgeoning industry, and there is no reason to cry over something that WILL happen and continue to expand.<BR/><BR/>--LonerVamp (someday I'll actually sign up)[email protected]:blogger.com,1999:blog-4088979.post-1145434103523238242006-04-19T04:08:00.000-04:002006-04-19T04:08:00.000-04:00Did you see that Greg wasn't too thrilled either?h...Did you see that Greg wasn't too thrilled either?<BR/><BR/><A HREF="http://www.rootkit.com/blog.php?newsid=477" REL="nofollow">http://www.rootkit.com/blog.php?newsid=477</A>Ryan Russellhttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-4088979.post-1145425125434925962006-04-19T01:38:00.000-04:002006-04-19T01:38:00.000-04:00I already posted a comment to the relevant entry, ...I already posted a comment to the relevant entry, but here is one more insight. McAfee's AV product caused a major headache for its customers a short time ago. The AV engine was deleting key files on customers' systems due to poorly written virus definitions. Is it possible that McAfee is deflecting people's attention from its own severe gaffe by slandering an innocent third party. It may also be that McAfee used the rootkit.com code in its virus definitions and didn't perform any QA testing before rolling out the new definitions. So, they are blaming the hand that fed them when it is their own fault. Since I don't know what signature was involved or where it came from, this is only speculation. A URL is here:<BR/>http://www.computerweekly.com/Articles/2006/03/28/215039/McAfeeanti-virusglitchleavesfirmsstrugglingtorestoresystems.htm<BR/><BR/>Johnjbmoorehttp://www.blogger.com/profile/[email protected] | {
"url": "http://taosecurity.blogspot.com/feeds/114541680652020644/comments/default",
"source_domain": "taosecurity.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "11505",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TZOQKULKVJ3H56UOPAZ56KTQFYL4TXM4",
"WARC-Concurrent-To": "<urn:uuid:bcd80846-47a4-430a-9c5b-bce4f1020954>",
"WARC-Date": "2017-02-23T16:09:07Z",
"WARC-IP-Address": "216.58.217.97",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:AZYDBMJ5A7BR73PAIRXHR7M3WBMX3PAY",
"WARC-Record-ID": "<urn:uuid:f18f4907-9363-40a3-8b5f-aef28cd8a3c2>",
"WARC-Target-URI": "http://taosecurity.blogspot.com/feeds/114541680652020644/comments/default",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a82294cb-8bdf-4bbc-a2a8-9628a17c88d8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-09\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0
],
"line_end_idx": [
4627
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4627,
"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.3339500427246094,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.046253468841314316,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3237742781639099,
"rps_doc_frac_unique_words": 0.5093696713447571,
"rps_doc_mean_word_length": 6.260647296905518,
"rps_doc_num_sentences": 81,
"rps_doc_symbol_to_word_ratio": 0.00555041991174221,
"rps_doc_unigram_entropy": 5.26494026184082,
"rps_doc_word_count": 587,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.037551019340753555,
"rps_doc_frac_chars_dupe_6grams": 0.037551019340753555,
"rps_doc_frac_chars_dupe_7grams": 0.037551019340753555,
"rps_doc_frac_chars_dupe_8grams": 0.02122448943555355,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.004081630147993565,
"rps_doc_frac_chars_top_3gram": 0.007074830122292042,
"rps_doc_frac_chars_top_4gram": 0.007619049865752459,
"rps_doc_books_importance": -438.0127868652344,
"rps_doc_books_importance_length_correction": -438.0127868652344,
"rps_doc_openwebtext_importance": -224.61781311035156,
"rps_doc_openwebtext_importance_length_correction": -224.61781311035156,
"rps_doc_wikipedia_importance": -169.3553466796875,
"rps_doc_wikipedia_importance_length_correction": -169.3553466796875
},
"fasttext": {
"dclm": 0.48816388845443726,
"english": 0.9081645607948303,
"fineweb_edu_approx": 1.8517709970474243,
"eai_general_math": 0.48474591970443726,
"eai_open_web_math": 0.43744975328445435,
"eai_web_code": 0.11844539642333984
}
} | {
"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": "338.4",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Industries, Prices, and Microeconomics"
}
}
},
"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": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-6,788,535,715,926,545,000 | What is meta? ×
Meta Stack Exchange is where users like you discuss bugs, features, and support issues that affect the software powering all 128 Stack Exchange communities.
TLDR version: If I wanted to, I could spoil everyone's flag weight by marking all flags I see as invalid. Nobody would earn flag weight, and I wouldn't lose anything either. This is IMNSHO broken.
I have seen Jeff's take on disputed flags, but I disagree with him:
This pits flaggers "against" each other, which is not at all in the spirit of the thing. In order for one flagger to "win" (gain flag weight), the other has to "lose" (lose flag weight). In my view everyone who flags, with extremely rare exceptions, is making the site better and I almost never reject a flag.
Why does anyone have to lose flag weight? This doesn't make sense in at least two scenarios:
1. UserA correctly flags an answer as "not an answer." UserB flags the flag as invalid. Moderator comes in and deletes the answer. No flag weight is awarded to UserA, even though they were right.
2. UserA incorrectly flags answer as "not an answer." UserB (correctly) flags the flag as invalid. Moderator decides UserA's flag is incorrect. UserB doesn't earn flag weight, nor does UserA lose flag weight.
It's not uncommon to have flags at two different points in the post lifecycle that are both correct. That is, an answer will be (correctly) flagged as "not an answer", then the OP will go back and edit in detail to make it a better answer. Now someone (correctly) flags it as "previous flags invalid". Both flags are correct!
In that case, just allow both flags to be deemed helpful!
We've considered a few alternatives (make mods dismiss each flag individually, add a third "indeterminate" outcome button) but they all seem worse than this simple solution.
IMO this is not a good solution. It makes flagging flags as invalid not only useless, but harmful. If the original flag was correct, this prevents the original flagger from earning FW. If it wasn't, it will prevent them from losing FW - both of which were the original intended consequences.
I think flag weight should be awarded to the user(s) the moderators agree with, without penalizing the user(s) who put in the wrong flag, if Jeff thinks this "pits flaggers against each other."
share|improve this question
1
Interesting. Anyone cares to explain why they disagree? – NullUserException อ_อ Oct 20 '11 at 5:09
3
Disputed flags are pretty rare (5 percent or less of all flags). In almost all cases where they do occur, the "deemed invalid" flag is either correct on it's face, or it's an edge case and the "deemed invalid" flag is still correct. If a flag is deemed incorrect, the flaggers disagree and therefore nullify each other's flag weight change. In short, I like the way it works now. – Robert Harvey Oct 20 '11 at 5:40
2
IME the original flagger (especially LQ and NARQ/NAA flags) is wrong most of the time when there is a subsequent Invalid Flag raised. I've seen quite a few LQ and NARQ flags where I wonder what the flagger was thinking - the question/answer might not be the best but it is still a question/answer, and voting down would have been more appropriate rather than flagging. – slugster Oct 20 '11 at 5:41
2
@slugster In which case the "invalid flag" flag is valid. – NullUserException อ_อ Oct 20 '11 at 6:18
3
When you have disputed flags, there is always a flag that's right. – NullUserException อ_อ Oct 20 '11 at 15:07
2
no longer relevant imho declining – waffles Jan 20 '12 at 8:22
add comment
1 Answer 1
I think you have a point here - I'd actually given up on marking things with the "invalid flag" not long after gaining access to it.
I tried using "invalid flag" a few times on LQ/NAA flags that seemed way off base (the ones where it should have been a downvote because it was a plausible answer, albeit wrong/misplaced). They all came back as "disputed" though which made me assume I was making a mistake in my flagging so I stopped using them.
A while later it dawned on me that getting "invalid flag"s returned as disputed was probably "by-design", but I haven't actually used them since because it just doesn't feel like they actually help anyone.
share|improve this answer
They help the moderators. A lot. – Robert Harvey Oct 20 '11 at 20:57
4
@RobertHarvey - that's interesting to hear, my perception of it was definitely that they didn't really do much. Now I've got the gold badge for flagging I'm free to be useful rather than just wondering about the impact on weight. The combination of no flag weight and odd feedback definitely doesn't go well with the flagging badges for producing useful behaviour then. – Flexo Oct 20 '11 at 22:04
add comment
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged . | {
"url": "http://meta.stackexchange.com/questions/109790/disputed-flags-should-still-give-flag-weight-to-users-who-made-the-right-call/109808",
"source_domain": "meta.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "73483",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JUFQTWLYBH7B6UPAYXOUBLTRROXB7LWV",
"WARC-Concurrent-To": "<urn:uuid:173b451a-e65a-4a0a-87cd-c83ee886ae09>",
"WARC-Date": "2014-07-23T10:10:26Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:6GDN3IBT6AEW2IFSROUTFUNYIA4OHNVF",
"WARC-Record-ID": "<urn:uuid:fceb555c-105d-46c2-b2aa-e86ef1e67f4c>",
"WARC-Target-URI": "http://meta.stackexchange.com/questions/109790/disputed-flags-should-still-give-flag-weight-to-users-who-made-the-right-call/109808",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4dbd2e93-2e8c-42b6-a95c-747b6c87d2d3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-131-23.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-23\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for July 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
16,
173,
174,
371,
372,
373,
441,
442,
752,
753,
846,
847,
1045,
1046,
1257,
1258,
1259,
1585,
1586,
1644,
1645,
1646,
1820,
1821,
2113,
2114,
2308,
2309,
2337,
2341,
2441,
2445,
2861,
2865,
3265,
3269,
3371,
3375,
3487,
3491,
3496,
3560,
3572,
3573,
3584,
3585,
3718,
3719,
4032,
4033,
4239,
4240,
4266,
4271,
4341,
4345,
4744,
4756,
4757,
4798,
4799
],
"line_end_idx": [
16,
173,
174,
371,
372,
373,
441,
442,
752,
753,
846,
847,
1045,
1046,
1257,
1258,
1259,
1585,
1586,
1644,
1645,
1646,
1820,
1821,
2113,
2114,
2308,
2309,
2337,
2341,
2441,
2445,
2861,
2865,
3265,
3269,
3371,
3375,
3487,
3491,
3496,
3560,
3572,
3573,
3584,
3585,
3718,
3719,
4032,
4033,
4239,
4240,
4266,
4271,
4341,
4345,
4744,
4756,
4757,
4798,
4799,
4865
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4865,
"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.39365673065185547,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03264924883842468,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2238806039094925,
"rps_doc_frac_unique_words": 0.41322314739227295,
"rps_doc_mean_word_length": 4.439197063446045,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.327315807342529,
"rps_doc_word_count": 847,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09228722751140594,
"rps_doc_frac_chars_dupe_6grams": 0.08058510720729828,
"rps_doc_frac_chars_dupe_7grams": 0.034840431064367294,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.029255319386720657,
"rps_doc_frac_chars_top_3gram": 0.013031910173594952,
"rps_doc_frac_chars_top_4gram": 0.016755320131778717,
"rps_doc_books_importance": -446.41619873046875,
"rps_doc_books_importance_length_correction": -446.41619873046875,
"rps_doc_openwebtext_importance": -276.9443664550781,
"rps_doc_openwebtext_importance_length_correction": -276.9443664550781,
"rps_doc_wikipedia_importance": -216.67337036132812,
"rps_doc_wikipedia_importance_length_correction": -216.67337036132812
},
"fasttext": {
"dclm": 0.7977379560470581,
"english": 0.9541727900505066,
"fineweb_edu_approx": 1.9196362495422363,
"eai_general_math": 0.36567360162734985,
"eai_open_web_math": 0.2943982481956482,
"eai_web_code": 0.012928839772939682
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "302.22",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-6,807,485,659,124,086,000 | openpam_get_option.c [plain text]
/*-
* Copyright (c) 2002-2003 Networks Associates Technology, Inc.
* Copyright (c) 2004-2007 Dag-Erling Smørgrav
* All rights reserved.
*
* This software was developed for the FreeBSD Project by ThinkSec AS and
* Network Associates Laboratories, the Security Research Division of
* Network Associates, Inc. under DARPA/SPAWAR contract N66001-01-C-8035
* ("CBOSS"), as part of the DARPA CHATS research program.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote
* products derived from this software without specific prior written
* permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* $Id: openpam_get_option.c 408 2007-12-21 11:36:24Z des $
*/
#include <sys/param.h>
#include <string.h>
#include <security/pam_appl.h>
#include <security/openpam.h>
#include "openpam_impl.h"
/*
* OpenPAM extension
*
* Returns the value of a module option
*/
const char *
openpam_get_option(pam_handle_t *pamh,
const char *option)
{
pam_chain_t *cur;
size_t len;
int i;
ENTERS(option);
if (pamh == NULL || pamh->current == NULL || option == NULL)
RETURNS(NULL);
cur = pamh->current;
len = strlen(option);
for (i = 0; i < cur->optc; ++i) {
if (strncmp(cur->optv[i], option, len) == 0) {
if (cur->optv[i][len] == '\0')
RETURNS(&cur->optv[i][len]);
else if (cur->optv[i][len] == '=')
RETURNS(&cur->optv[i][len + 1]);
}
}
RETURNS(NULL);
}
/**
* The =openpam_get_option function returns the value of the specified
* option in the context of the currently executing service module, or
* =NULL if the option is not set or no module is currently executing.
*
* >openpam_set_option
*/ | {
"url": "http://opensource.apple.com/source/OpenPAM/OpenPAM-11.1/openpam/lib/openpam_get_option.c",
"source_domain": "opensource.apple.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "5347",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AER2SFY4ALFD4OCHSZA4RPY7NBQ5FKJS",
"WARC-Concurrent-To": "<urn:uuid:8b35eda0-3cc9-4a98-9620-e178f6ac80f1>",
"WARC-Date": "2013-12-06T16:29:23Z",
"WARC-IP-Address": "17.251.224.50",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:XBM3EGFEG7XYXH476LYAZ4XDMNMXBVZF",
"WARC-Record-ID": "<urn:uuid:190018a5-f53e-4765-89d9-54bdfc85ede7>",
"WARC-Target-URI": "http://opensource.apple.com/source/OpenPAM/OpenPAM-11.1/openpam/lib/openpam_get_option.c",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:761b15c5-6449-4a08-843e-e1b31e43d352>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
36,
37,
38,
42,
106,
153,
177,
180,
254,
324,
398,
457,
460,
530,
600,
612,
681,
749,
821,
895,
970,
1037,
1110,
1128,
1131,
1205,
1278,
1356,
1431,
1509,
1584,
1657,
1735,
1812,
1886,
1902,
1905,
1965,
1969,
1970,
1993,
1994,
2014,
2015,
2046,
2076,
2077,
2103,
2104,
2107,
2128,
2131,
2171,
2175,
2176,
2189,
2228,
2249,
2251,
2270,
2283,
2291,
2292,
2309,
2371,
2388,
2410,
2433,
2468,
2517,
2551,
2584,
2622,
2659,
2663,
2666,
2682,
2684,
2685,
2689,
2760,
2831,
2902,
2905,
2928
],
"line_end_idx": [
36,
37,
38,
42,
106,
153,
177,
180,
254,
324,
398,
457,
460,
530,
600,
612,
681,
749,
821,
895,
970,
1037,
1110,
1128,
1131,
1205,
1278,
1356,
1431,
1509,
1584,
1657,
1735,
1812,
1886,
1902,
1905,
1965,
1969,
1970,
1993,
1994,
2014,
2015,
2046,
2076,
2077,
2103,
2104,
2107,
2128,
2131,
2171,
2175,
2176,
2189,
2228,
2249,
2251,
2270,
2283,
2291,
2292,
2309,
2371,
2388,
2410,
2433,
2468,
2517,
2551,
2584,
2622,
2659,
2663,
2666,
2682,
2684,
2685,
2689,
2760,
2831,
2902,
2905,
2928,
2931
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2931,
"ccnet_original_nlines": 85,
"rps_doc_curly_bracket": 0.0020470800809562206,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.16771160066127777,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.21003134548664093,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3808777332305908,
"rps_doc_frac_unique_words": 0.531335175037384,
"rps_doc_mean_word_length": 5.719346046447754,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0.007836990058422089,
"rps_doc_unigram_entropy": 4.899299621582031,
"rps_doc_word_count": 367,
"rps_doc_frac_chars_dupe_10grams": 0.06479275971651077,
"rps_doc_frac_chars_dupe_5grams": 0.0876607894897461,
"rps_doc_frac_chars_dupe_6grams": 0.06479275971651077,
"rps_doc_frac_chars_dupe_7grams": 0.06479275971651077,
"rps_doc_frac_chars_dupe_8grams": 0.06479275971651077,
"rps_doc_frac_chars_dupe_9grams": 0.06479275971651077,
"rps_doc_frac_chars_top_2gram": 0.01429251953959465,
"rps_doc_frac_chars_top_3gram": 0.016198189929127693,
"rps_doc_frac_chars_top_4gram": 0.021915199235081673,
"rps_doc_books_importance": -278.55987548828125,
"rps_doc_books_importance_length_correction": -278.55987548828125,
"rps_doc_openwebtext_importance": -159.6981201171875,
"rps_doc_openwebtext_importance_length_correction": -159.6981201171875,
"rps_doc_wikipedia_importance": -83.93978118896484,
"rps_doc_wikipedia_importance_length_correction": -83.93978118896484
},
"fasttext": {
"dclm": 0.9243078231811523,
"english": 0.635315477848053,
"fineweb_edu_approx": 0.7945461273193359,
"eai_general_math": 0.7849957346916199,
"eai_open_web_math": 0.34354597330093384,
"eai_web_code": 0.11844885349273682
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,667,232,073,496,649,000 | Home → Security →
What to Do If You Click on a Phishing Link [2022]
Written by, Dimitar F
Updated April, 29, 2022
Did you know that there was a 50% increase in cyber attacks in 2021?
Human errors play a huge part in phishing attacks. In this article, I’ll explain what to do if you click on a phishing link, how phishing works, the types and signs of phishing attacks, and FAQ.
Let’s dive right in.
How Does Phishing Work?
In cyber security, phishing falls under the category of a social engineering attack. Cybercriminals and hackers typically use it to steal user data like bank details, credit card numbers, and login credentials.
A phishing scam involves the attacker posing as a trustworthy person, entity, or reliable source. They use this to trick victims into opening a phishing email, text message, or instant message, and clicking on a malicious link.
Usually, one click on a bad link is all it takes to fall for a phishing attack. That can prompt malware installation on your device, reveal your sensitive data, or block your systems or files as part of a larger ransomware attack.
For individuals, a phishing scam can lead to:
• Identity theft
• Credit card fraud
• Data loss
• Loss of funds
• Blackmail
For corporations and governments, phishing attacks are typically a part of larger malicious plans.
Phishing allows attackers to:
• Bypass security
• Gain access to private networks and sensitive data
• Distribute malware
• Launch DDoS attacks
• Steal money
• Compromise employees
And these are just some of the issues. Companies risk losing revenue, sensitive data, consumer trust, brand reputation, and market share.
According to IBM, a data breach cost businesses $4.24 million on average in 2021, increasing from $3.86 million in the previous year. These numbers are expected to grow by 10% year on year.
In Ironscales’ survey, 80% of respondents experienced more email phishing attacks since the beginning of the COVID-19 pandemic, making this the biggest threat to small and large businesses.
Verizon’s 2021 DBIR confirms that a whopping 36% of all data breaches involved phishing, an 11% increase since 2020.
Like most scams, a typical phishing attack involves urgency and fear, often pressuring the user to take action. For example, you may receive an email regarding password expiry, account upgrade, or an invoice for goods you never ordered.
Other times the email may seemingly come from your HR department, government tax agency, or claim that “suspicious/unusual activity has been detected on your account.” Ultimately, these emails lure you into opening a link for details, making changes, reimbursements, or cancelling orders.
The link may redirect you to a bogus website, which is replicated to look just like an authentic page from the trusted sender. This fake website may ask you to fill in your credentials, share bank details or credit card information, which the attacker then uses to their advantage.
Other times, the link may automatically download and/or install malware on your computer or browser, giving the attacker access to files and networks or allowing them to deploy a larger attack.
Types of Phishing Attacks
Cybercriminals and hackers are constantly coming up with new ways to reach the IT systems of individuals and businesses. They continually learn, evolve, and improve their malicious techniques and practices.
Phishing scams fall into several categories. Let’s look at each of them.
Email Phishing
Email phishing, also known as deception phishing, is the most common phishing attack. In it, the attacker impersonates a trusted person or entity and sends emails to victims.
They leverage clever social engineering tactics to create urgency and fear, so the victim clicks on the malicious email link. This leads to a malicious download or a bogus website, where the attacker lures the victim to share sensitive information.
Vishing
Voice phishing or “vishing” uses a phone call or “voice” to create urgency and fear. So, the victim takes certain actions that work against them and in favour of the attacker. Other times, the calls extract sensitive information from the victim.
For example, you may get a fake phone call from someone pretending to be from the Internal Revenue Service (IRS). They create urgency and stress by calling during the tax season and fear saying they want to conduct an audit. Then, they ask you for your social security number to run the audit.
The dangerous combination of stress, fear, and urgency often leads the victims to give out sensitive information that results in heavy losses.
Smishing
Smishing is phishing over text messages or SMS. It applies the same social engineering tactics, but the platform or technology differs. The attacker sends texts that compel you to take action or click a malicious link that redirects you to a bogus website or installs malware on your device.
Whaling
Whaling is a type of corporate phishing whereby the target is an influential and affluent executive like a CEO or a “whale.”
Hackers or cybercriminals target and research a high-ranking business executive through public records, social media, or the company website to gather as much intel on the target as possible.
They impersonate the target through a similar, seemingly authentic email address. They may use this address to ask the company, or a lower-ranking employee, to share sensitive information, transfer money, or open a malicious link.
Spear Phishing
Spear phishing is similar to whaling, but instead of targeting and impersonating high-level executives, the attacker impersonates an employee. They target you with well-researched, real employee names, job designations, and phone numbers to extract information or deploy malware.
Attackers trick you into believing that their email request is an internal company request, leading you to take action or reveal the information they want.
Clone Phishing
Clone phishing is also an email phishing attack where the attacker impersonates a service provider, vendor, or company that you or a business has previously used. They conduct research to find out what brands, businesses, or services the victim regularly engages with or has engaged with in the past.
The attacker then sends targeted emails that mimic or “clone” the email address and format of one of those services. Ultimately, they get you to click a malicious link and share sensitive information or download malware.
Signs of a Phishing Attack
No one wants to be a phishing scam victim, but sometimes attackers can be so convincing that they fool even the best of us. Fortunately, most phishing attacks are identifiable if you know what to look for.
Here are a few key signs of a phishing attack that will help you identify a malicious actor trying to take advantage of you.
Spelling and Grammar Mistakes
This is one of the most common signs of a phishing email. If a professional email contains spelling mistakes and incorrect grammar, you’re likely being scammed.
Most authentic marketers, businesses, and services have tools for strict spelling and grammar checks for outbound emails. They never want to sound unprofessional or incompetent; hence, you’d expect them to send emails without spelling or grammar mistakes. Of course, no one is perfect, and a tiny mistake is always possible. But if you see multiple errors, you can be sure that it’s a phishing email.
Urgency and Fear (or Threats)
Urgency and fear are the primary social engineering tactics phishing scammers use. It’s their modus operandi. Often, they’ll also resort to threats in the form of negative consequences if you fail to comply.
Such emails or messages should always raise red flags, and you should treat them with suspicion. If an email creates a sense of urgency or demands immediate action, you need to examine the content for other phishing signs.
If you cannot find any signs, the best strategy is to directly call the company, authority, or individual on their official lines and ask about the email.
Suspicious Domain Name / Link / URL
A great way to identify potential phishing attacks is to look for discrepancies or eccentricities in the links and domain names. For example, when you see a link in an email, hover your mouse cursor over the link to verify the URL that pops up without clicking.
If the sender alleges to be from a service like Netflix or Venmo, but the URL doesn’t include the official website, like netlix.com or venmo.com, that’s a giveaway that the link is malicious. As a rule of thumb, if the link URL doesn’t match the alleged sender, refrain from clicking it.
Other times, the attacker will use clever tricks to make it look like the URL is authentic. For example, they may share the entire link, which seems legit, but they’ll hyperlink it to a malicious page. You can check this by hovering your cursor over the full link and verifying that it’s authentic and matching.
Attackers may also include seemingly identical URLs using “letterlike symbols.” For example, the link may be netflíx.com, which looks exactly like netflix.com at first glance. But if you look closer, the letter “i” in the first one has a dash instead of a dot.
While trusted services and authorities like ICANN ensure similar domain names aren’t available to anyone, attackers often use a combination of such techniques to get away with similar-looking URLs.
Suspicious Attachments
Just like malicious links or URLs, attachments in phishing emails can often wreak havoc. Always be cautious about opening attachments from unknown or suspicious sources. If they have a suspicious extension like .exe, .zip, or .scr, you should run them through a virus scan before opening.
Requests From an Unknown Sender to Follow a Link
Since phishing emails are unsolicited, attackers often use “hooks” to lure you in and get you to click. You may get a request from an unknown sender asking you to follow a link. That’s a big sign of a phishing attack.
They may say you’ve won a prize, vacation, or a discount, to get you to reply with sensitive information, follow a malicious link, or open an attachment. Don’t be tempted by such phishing practices.
Suppose you haven’t initiated the conversation by signing up or opting in to receive such offers, newsletters, marketing materials, or information. In that case, there’s a very high chance that the email is a phishing scam.
Changes in Communication (With Family, Colleagues)
You can often spot a phishing attack through changes in communication, tone, or greetings. If a relative, friend, or colleague emails you, and you notice that the language or conversation isn’t quite right, you should be wary.
For example, you should watch out if a friend becomes a little too formal or a colleague is suddenly friendlier. Other times, you may notice that the conversation is inconsistent with previous interactions. Either the context has changed, or the tone or greeting is very different.
For example, if you receive an email from a colleague that starts with “Dear Collin,” but that colleague has never used such a greeting before, that’s an immediate phishing sign. Whenever you get a message or email that seems strange, it’s best to be cautious and look for other red flags.
Nothing Happens After Clicking a Link — A Sign That Malware Is Being Installed
You may overlook the signs if you’re convinced that the sender of the email or message is authentic and the contents are legitimate.
Suppose you get an email from a colleague, and they’ve shared a link for something work-related. You may not think twice if this colleague regularly sends you links for work. But if you click on the link and nothing happens, that’s a sign of a malicious link. Whether from a known or unknown sender, if a link does nothing, it’s most likely downloading malware on your device.
a man coding on a laptop
What to Do If You Click on a Phishing Link
So, you clicked on a phishing link. While awareness of phishing signs is a great way to prevent scams, social engineering attacks can sometimes fool you.
So, what to do if you accidentally click on a phishing link?
Don’t Enter Your Username or Password
If the malicious link redirects you to a website or landing page, it’ll likely ask you to enter your personal details, login credentials, banking information, credit card details, or sensitive information. Whatever you do, don’t provide any of that. It’ll directly go to the attacker, and they can use it against you almost immediately.
Skilled cybercriminals and hackers often use automation tools to take action before you can rectify your mistake.
Disconnect Your Device From the Internet
If the malicious link or attachment starts to download malware on your device, the best thing to do is disconnect that device from the internet immediately. This will ensure that the download is stopped from the source.
Of course, sometimes downloads are small and quick, meaning you may not be able to stop them in time. Still, disconnecting your device from the internet ensures that the downloaded malware cannot access your sensitive data or trigger further malicious activity through the internet.
It cuts off the attackers’ access and isolates your device from other devices on your network, preventing the malware from spreading.
Backup Your Device
If the attacker is after your data, you need to backup your device once you disconnect it from the internet. You’ll need to back up on a physical storage device, as the cloud isn’t an option without the internet.
This backup will ensure that the attacker or their malware doesn’t restrict, delete, or tamper with your device’s existing data. It’s especially useful if the phishing scam is part of a larger ransomware attack. But there’s no guarantee that you’ll be able to overcome the phishing attack or fully backup your data after clicking a malicious link.
Run the Security Check
Most devices already have a built-in security scanner or existing antivirus software, and your device likely has one. Once you click on a malicious link or attachment, running a security check is crucial.
You can use the built-in scanner of your device, or you can opt for a better third-party scanner or software. Either way, a security check is crucial to locate the malware, remove it, or prevent it from causing further harm.
Change and Create a Strong Password
Often, you may not realize a breach has occurred or know what sensitive data has been leaked from your device after clicking a malicious phishing link. It’s better to err on the side of caution and change all your passwords immediately after clicking on a phishing link.
This includes the passwords for all your devices, accounts, and subscriptions. Also, you need to make sure that you’re using strong passwords that the attacker cannot crack using any leaked information from your device.
Consider using a trusted password manager with a built-in password generator. These password managers can help you create strong and unique passwords for all your accounts while ensuring they’re stored safely on their encrypted platforms.
Set up a Fraud Alert
Setting up a fraud alert is perhaps the best way to prevent phishing attackers from taking advantage of your identity and finances. If you click on a malicious link, immediately call and alert any of the three nationwide credit rating agencies or bureaus — Experian, Equifax, or TransUnion.
As soon as you ask for a fraud alert with these agencies, they’ll alert the other two. All three will set up a fraud alert in your file, safeguarding you against any financial harm from identity theft or credit theft.
What About Phishing Attacks on Smartphones?
Phishing attacks on smartphones aren’t different from phishing attacks on any other device. But most smartphone attacks are smishing and vishing attacks, which rely on the same social engineering tactics to bypass security and gain access.
Fortunately, only 1% of all phishing attacks occur via phones, which may seem insignificant, but it’s still enough to remain vigilant. If, however, you click on a phishing link or attachment via your smartphone, here’s what you should do.
What Should Android Users Do?
There’s little difference between phishing attacks on smartphones and other devices. However, Android devices are more prone to malware and viruses, putting you and your smartphone at risk.
You should follow the previously mentioned steps for your Android device. Don’t enter credentials, disconnect the internet, backup the device, run a security check, change passwords, and set up a fraud alert.
Also, you should look for any suspicious files in your smartphone, delete them, and run a malware scan or security check using a trusted antivirus Android software. These are specifically designed to scan Android devices.
What Should iPhone Users Do?
iOS users are luckier in the security department because Apple’s built-in protection prevents data exposure unless you use an app or open a website. So, if you feel something isn’t right or looks suspicious, just stop engaging with the link or page.
If you click on a malicious phishing link on your iPhone, it’s best to try to identify your targeted accounts and change their passwords accordingly. You should never give away sensitive information, credentials, or access to third parties, even on an iPhone.
If something goes wrong, set up a fraud alert and take your iPhone to the nearest Apple Store for support.
Conclusion
Hopefully, by now, you know enough about how phishing attacks work, their types, and what you should do if you click on a phishing link.
The rapidly increasing number of data breaches globally is alarming. Unfortunately, it’ll only worsen as more people and businesses shift online. Scams like phishing attacks pose a significant threat to individuals and businesses, but they’re not entirely out of our control.
By identifying signs of phishing attacks, we can easily prevent malicious actors from taking advantage. Of course, cyber security awareness is paramount for avoiding social engineering attacks like phishing in homes and businesses.
FAQ
What if I clicked on a phishing link but did not enter details?
If you clicked on a phishing link and did not enter details, you’re likely not in much trouble. Still, you need to exit the page immediately, disconnect your device from the internet, backup the device, run a security check or malware scan, change your passwords just in case, and set up a fraud alert if you suspect malicious activity.
What happens if you accidentally click on a phishing link on iPhone?
Apple’s built-in protection prevents your data from being exposed unless you use an app or open a website. If you accidentally click on a phishing link on your iPhone, you just need to stop engaging with the link immediately.
Never give away sensitive information, credentials, or access to third parties on your iPhone. If you suspect something, check your iPhone and try to identify any targeted accounts to change their passwords. If something goes wrong, set up a fraud alert and take your iPhone to the nearest Apple Store for support.
What to do if you click on a phishing link on Android?
If you click on a phishing link on Android, don’t enter your credentials or sensitive data, disconnect your device from the internet, backup the device, and run a security check or malware scan using a trusted antivirus Android software.
You should also change your passwords and set up a fraud alert with any of the three major credit rating agencies. | {
"url": "https://buyorbye.com.au/security/what-to-do-if-you-click-on-a-phishing-link/",
"source_domain": "buyorbye.com.au",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "75349",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZWMIV6O7OKNOCWPU6WLJDF55Z4OAJ5CO",
"WARC-Concurrent-To": "<urn:uuid:1182a752-567f-459d-8c6f-b3270eab15a2>",
"WARC-Date": "2022-08-16T19:47:31Z",
"WARC-IP-Address": "13.211.60.142",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YSN25ELHZ35Q4WHGTRDQLEJMIIGDFQWY",
"WARC-Record-ID": "<urn:uuid:54c3d598-701a-44ad-b8b0-a7cba5ca6ce5>",
"WARC-Target-URI": "https://buyorbye.com.au/security/what-to-do-if-you-click-on-a-phishing-link/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:99d422a5-c5b4-4433-88e1-6279ea1a3ab3>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-112\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,
18,
19,
69,
70,
92,
93,
117,
118,
187,
188,
383,
384,
405,
406,
430,
431,
642,
643,
871,
872,
1103,
1104,
1150,
1151,
1170,
1192,
1206,
1224,
1238,
1239,
1338,
1339,
1369,
1370,
1390,
1445,
1468,
1492,
1508,
1533,
1534,
1672,
1673,
1863,
1864,
2054,
2055,
2173,
2174,
2411,
2412,
2701,
2702,
2984,
2985,
3179,
3180,
3206,
3207,
3414,
3415,
3488,
3489,
3504,
3505,
3680,
3681,
3930,
3931,
3939,
3940,
4186,
4187,
4481,
4482,
4625,
4626,
4635,
4636,
4928,
4929,
4937,
4938,
5064,
5065,
5257,
5258,
5489,
5490,
5505,
5506,
5786,
5787,
5943,
5944,
5959,
5960,
6261,
6262,
6483,
6484,
6511,
6512,
6718,
6719,
6844,
6845,
6875,
6876,
7038,
7039,
7440,
7441,
7471,
7472,
7680,
7681,
7904,
7905,
8060,
8061,
8097,
8098,
8360,
8361,
8649,
8650,
8962,
8963,
9224,
9225,
9423,
9424,
9447,
9448,
9737,
9738,
9787,
9788,
10007,
10008,
10207,
10208,
10432,
10433,
10484,
10485,
10712,
10713,
10995,
10996,
11286,
11287,
11366,
11367,
11501,
11502,
11879,
11880,
11905,
11906,
11949,
11950,
12104,
12105,
12166,
12167,
12205,
12206,
12544,
12545,
12659,
12660,
12701,
12702,
12922,
12923,
13206,
13207,
13342,
13343,
13362,
13363,
13576,
13577,
13925,
13926,
13949,
13950,
14155,
14156,
14381,
14382,
14418,
14419,
14690,
14691,
14911,
14912,
15151,
15152,
15174,
15175,
15466,
15467,
15685,
15686,
15730,
15731,
15971,
15972,
16211,
16212,
16242,
16243,
16433,
16434,
16643,
16644,
16866,
16867,
16896,
16897,
17147,
17148,
17408,
17409,
17516,
17517,
17528,
17529,
17666,
17667,
17943,
17944,
18176,
18177,
18181,
18182,
18246,
18247,
18584,
18585,
18654,
18655,
18881,
18882,
19197,
19198,
19253,
19254,
19492,
19493
],
"line_end_idx": [
18,
19,
69,
70,
92,
93,
117,
118,
187,
188,
383,
384,
405,
406,
430,
431,
642,
643,
871,
872,
1103,
1104,
1150,
1151,
1170,
1192,
1206,
1224,
1238,
1239,
1338,
1339,
1369,
1370,
1390,
1445,
1468,
1492,
1508,
1533,
1534,
1672,
1673,
1863,
1864,
2054,
2055,
2173,
2174,
2411,
2412,
2701,
2702,
2984,
2985,
3179,
3180,
3206,
3207,
3414,
3415,
3488,
3489,
3504,
3505,
3680,
3681,
3930,
3931,
3939,
3940,
4186,
4187,
4481,
4482,
4625,
4626,
4635,
4636,
4928,
4929,
4937,
4938,
5064,
5065,
5257,
5258,
5489,
5490,
5505,
5506,
5786,
5787,
5943,
5944,
5959,
5960,
6261,
6262,
6483,
6484,
6511,
6512,
6718,
6719,
6844,
6845,
6875,
6876,
7038,
7039,
7440,
7441,
7471,
7472,
7680,
7681,
7904,
7905,
8060,
8061,
8097,
8098,
8360,
8361,
8649,
8650,
8962,
8963,
9224,
9225,
9423,
9424,
9447,
9448,
9737,
9738,
9787,
9788,
10007,
10008,
10207,
10208,
10432,
10433,
10484,
10485,
10712,
10713,
10995,
10996,
11286,
11287,
11366,
11367,
11501,
11502,
11879,
11880,
11905,
11906,
11949,
11950,
12104,
12105,
12166,
12167,
12205,
12206,
12544,
12545,
12659,
12660,
12701,
12702,
12922,
12923,
13206,
13207,
13342,
13343,
13362,
13363,
13576,
13577,
13925,
13926,
13949,
13950,
14155,
14156,
14381,
14382,
14418,
14419,
14690,
14691,
14911,
14912,
15151,
15152,
15174,
15175,
15466,
15467,
15685,
15686,
15730,
15731,
15971,
15972,
16211,
16212,
16242,
16243,
16433,
16434,
16643,
16644,
16866,
16867,
16896,
16897,
17147,
17148,
17408,
17409,
17516,
17517,
17528,
17529,
17666,
17667,
17943,
17944,
18176,
18177,
18181,
18182,
18246,
18247,
18584,
18585,
18654,
18655,
18881,
18882,
19197,
19198,
19253,
19254,
19492,
19493,
19607
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 19607,
"ccnet_original_nlines": 253,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41021591424942017,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005792520008981228,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14165349304676056,
"rps_doc_frac_unique_words": 0.2673298120498657,
"rps_doc_mean_word_length": 4.9123406410217285,
"rps_doc_num_sentences": 178,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.719132900238037,
"rps_doc_word_count": 3217,
"rps_doc_frac_chars_dupe_10grams": 0.027463139966130257,
"rps_doc_frac_chars_dupe_5grams": 0.11187749356031418,
"rps_doc_frac_chars_dupe_6grams": 0.0846041887998581,
"rps_doc_frac_chars_dupe_7grams": 0.06365880370140076,
"rps_doc_frac_chars_dupe_8grams": 0.05739416927099228,
"rps_doc_frac_chars_dupe_9grams": 0.049167878925800323,
"rps_doc_frac_chars_top_2gram": 0.014807320199906826,
"rps_doc_frac_chars_top_3gram": 0.007087260019034147,
"rps_doc_frac_chars_top_4gram": 0.013288619928061962,
"rps_doc_books_importance": -1695.630126953125,
"rps_doc_books_importance_length_correction": -1695.630126953125,
"rps_doc_openwebtext_importance": -1083.698974609375,
"rps_doc_openwebtext_importance_length_correction": -1083.698974609375,
"rps_doc_wikipedia_importance": -781.5665283203125,
"rps_doc_wikipedia_importance_length_correction": -781.5665283203125
},
"fasttext": {
"dclm": 0.12728625535964966,
"english": 0.9139442443847656,
"fineweb_edu_approx": 2.6211416721343994,
"eai_general_math": 0.05347288027405739,
"eai_open_web_math": 0.12916719913482666,
"eai_web_code": 0.1061750128865242
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "363.25",
"labels": {
"level_1": "Social sciences",
"level_2": "Social service and Societies",
"level_3": "Political activists"
}
}
},
"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": "9",
"label": "FAQ"
}
},
"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 |
6,342,170,520,619,675,000 | Opened 7 years ago
Closed 6 years ago
#8417 closed bug (worksforme)
dialog overlay blocks root html page element's scrollbar in Gecko browsers
Reported by: schyzoo Owned by:
Priority: minor Milestone: 1.10.0
Component: ui.dialog Version: 1.8.21
Keywords: Cc:
Blocked by: Blocking:
Description
When one uses dialog with it's overlay feature (modal dialog), it blocks ability to scroll the whole page with it's scrollbar. I mentioned this behavior on Google Chrome (ver. 19.0.1084.56 m) and Safari 4 (530.17), but not in FF, IE or OPERA. It looks like all browsers, but those using WebKit (and, maybe, KHTML) engine, dont allow scripts to prevent default event handler for the root HTML element scrollbar. It's not that big problem, but still is inconsistency.
These lines in dialog's script file cause behavior in question:
setTimeout(function() {
// handle $(el).dialog().dialog('close') (see #4065)
if ($.ui.sg_dialog.overlay.instances.length) {
$(document).bind($.ui.sg_dialog.overlay.events, function(event) {
// stop events if the z-index of the target is < the z-index of the overlay
// we cannot return true when we don't want to cancel the event (#3523)
if ($(event.target).zIndex() < $.ui.sg_dialog.overlay.maxZ) {
return false;
}
});
}
}, 1);
Change History (2)
comment:1 Changed 6 years ago by Scott González
Milestone: 1.9.01.10.0
comment:2 Changed 6 years ago by drewkimrey
Resolution: worksforme
Status: newclosed
I was unable to recreate this issue within Chrome. I created the following http://jsfiddle.net/aNxZZ/1/ and tested against this instance. video below: http://screencast.com/t/ySTdpbscndc
Note: See TracTickets for help on using tickets. | {
"url": "https://bugs.jqueryui.com/ticket/8417",
"source_domain": "bugs.jqueryui.com",
"snapshot_id": "crawl=CC-MAIN-2019-13",
"warc_metadata": {
"Content-Length": "21193",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7GXMUBLT2LIO6T7C4H73K35VQVOZOKSF",
"WARC-Concurrent-To": "<urn:uuid:3309d880-9f57-46ac-88f3-701116c3a3dd>",
"WARC-Date": "2019-03-24T15:00:35Z",
"WARC-IP-Address": "45.55.2.32",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:P3SHIYLUIHBJHBMVHPCPWJ5GDQP575NB",
"WARC-Record-ID": "<urn:uuid:74aeb2be-a526-453f-a38b-ffdaec0a0e68>",
"WARC-Target-URI": "https://bugs.jqueryui.com/ticket/8417",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ccc4a441-ee06-415a-947d-a0e69c3b5b08>"
},
"warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-33-242-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,
19,
20,
39,
40,
70,
71,
146,
147,
178,
212,
249,
263,
285,
286,
298,
299,
765,
766,
830,
831,
855,
909,
957,
1025,
1104,
1179,
1244,
1262,
1267,
1273,
1276,
1283,
1284,
1303,
1304,
1352,
1353,
1376,
1377,
1421,
1422,
1445,
1463,
1464,
1651,
1652
],
"line_end_idx": [
19,
20,
39,
40,
70,
71,
146,
147,
178,
212,
249,
263,
285,
286,
298,
299,
765,
766,
830,
831,
855,
909,
957,
1025,
1104,
1179,
1244,
1262,
1267,
1273,
1276,
1283,
1284,
1303,
1304,
1352,
1353,
1376,
1377,
1421,
1422,
1445,
1463,
1464,
1651,
1652,
1700
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1700,
"ccnet_original_nlines": 46,
"rps_doc_curly_bracket": 0.004705879837274551,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21393035352230072,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019900500774383545,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.38805970549583435,
"rps_doc_frac_unique_words": 0.6946902871131897,
"rps_doc_mean_word_length": 5.592920303344727,
"rps_doc_num_sentences": 41,
"rps_doc_symbol_to_word_ratio": 0.007462690118700266,
"rps_doc_unigram_entropy": 4.907855987548828,
"rps_doc_word_count": 226,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02848101034760475,
"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.02531646005809307,
"rps_doc_frac_chars_top_3gram": 0.021360760554671288,
"rps_doc_frac_chars_top_4gram": 0.022151900455355644,
"rps_doc_books_importance": -154.67486572265625,
"rps_doc_books_importance_length_correction": -142.6155548095703,
"rps_doc_openwebtext_importance": -89.14348602294922,
"rps_doc_openwebtext_importance_length_correction": -89.14348602294922,
"rps_doc_wikipedia_importance": -66.77627563476562,
"rps_doc_wikipedia_importance_length_correction": -57.55712127685547
},
"fasttext": {
"dclm": 0.03819739818572998,
"english": 0.741965651512146,
"fineweb_edu_approx": 1.5624581575393677,
"eai_general_math": 0.13505572080612183,
"eai_open_web_math": 0.07043421268463135,
"eai_web_code": 0.01131260022521019
}
} | {
"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": "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": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
4,456,579,069,767,449,000 | Two main urban problems that IoT and AI can solve
/ Industrial IoT / Connected Industry / Two main urban problems that IoT and AI can solve
IoT and smart cities
Two main urban problems that IoT and AI can solve
Having visited more than 40 countries, 200 cities and lived in six countries in the last 10 years as well as working in the disruptive Internet of Things (IoT) space, the subject of how to solve urban problems and make cities smarter and more citizen friendly is of particular interest to me for both professional and personal reasons.
More than half of the world’s population now live in cities — and the figure will rise to more than two thirds by 2050, according to a United Nations forecast. Growing numbers of city residents put pressure on energy and water resources, transport networks, environment, national healthcare budgets as well as many more aspects of the city. In the last few weeks I have been thinking about the most important problems that the most cities around the world may face, but they can be solved or reduced by Internet of Things and artificial intelligence (AI) enabled solutions. By IoT we simply mean when objects are connected to the Internet and exchange data.
From my everyday professional experience — reading reports, speaking with council representatives, attending smart city conferences, but also from personal exposure to cities as a global citizen and traveler — I identified at least three big problems that many big cities try to deal with. The good news is that the power of technology, especially the IoT and AI, can improve all of them. In this article will discuss about mobility challenges and air pollution.
Urban Problems that IoT and AI can solve
1. Mobility challenges — How to improve citizens’ lives and bring them closer
Urbanization and growing population in most cities are causing more and more problems for the movement of the citizens in their city. Commuting or driving to work and home has become a hassle; congestion in the EU is often located in and around urban areas and costs nearly EUR 100 billion, or 1 % of the EU’s GDP, annually as estimated by the European Commission.
The mobility challenges are plenty and not limited just to traffic congestion. They are also about efficiently connecting (time, cost, effort) different neighborhoods with public means of transport, helping citizens and professionals at the last mile journey, giving access to the critical stations (train, airport, buses) with multiple means and from multiple regions, offering a variety of options to the people to move around (including bicycle), offering of parking slots, and many more. It is also about understanding how citizens move every day in order for city officials to plan accordingly the location of stations, bike routes and traffic lights, as well as to optimise the schedule of each city activity without disturbing others.
Today, thanks to the use of IoT and AI-enabled solutions, cities can be improved and solve — or at least reduce — some of the main urban transportation issues. Here are some examples:
• Optimize availability of public parking slots through real time parking sensors that can show to the drivers where the nearest parking is without going around blindly. Finding parking in less time can reduce both traffic jam and air pollution
• Understand how and when people are moving in the city, from where to where and what is their profile. A city authority which can have this knowledge is able to take much better planning decisions based on data and facts. Some ways to achieve this are by analyzing the anonymous and aggregated mobile data from consumer phones. If this data is combined with other data generated by connected city furniture, then the insights are priceless. Smart city furniture could be connected lights, smart benches, connected traffic lights, and connected street lighting while other city assets could be connected bikes and buses, connected buses and rubbish bins. The analysis of all this combined data can generate insights and automations that we could never think otherwise.
• Plan maintenance and improvements in the road and public transport network efficiently based on the collected data by the IoT enabled assets. For example, big halls on a street can be identified by the data generated from smart bikes/lights due to the shaking sensors. No need to send employees to check or ask citizens to report it (usually after accidents). At the same time, the schedule of when a local authority is appropriate to send the workers to cover the halls can be planned based on the available data from the sensors around that street, so traffic interruptions can be avoided.
Of course, there are even more smart city IoT applications that can improve the mobility in the city. Saying this, improving mobility can improve also air quality. Based on European Commission statistics, urban mobility accounts for 40% of all CO2 emissions of road transport and up to 70% of other pollutants from transport. Take a look at the future transportation challenges.
More about What are Intelligent Buildings?
2. Air pollution — how to do urban planning and reduce air pollution
Urbanization has enormous environmental consequences too. Despite the efforts of some mayors to handle the level of air pollution in their cities, in most cases the quality of the air that we breathe in the cities is deteriorating due to a variety of reasons; the increasing population in urban places, rising car usage, limitations in parking, as well as factories operations.
Apart from the obvious damaging consequences to our health, there is also significant negative impact on the economy of each country. For example, last year alone the costs of air pollution to the National Health Service (NHS) and social care in England were estimated to be £157 million. The latest findings, published in a report from PHE, warn these costs could reach as much as £18.6 billion by 2035 unless action is taken. The researchers explain that these figures are based on costs related to GP doctor visits, medical prescriptions, hospital treatment and social care due to long-term health conditions, and do not take into account economic impacts due to lost productivity. Unfortunately, the economic cost and health impact is tremendous in every country that suffers from similar problems.
With the power of IoT and AI, cities have the ability to understand at a granular level and in real time the biggest air pollution problems, the cause, who is affected and what it means for the citizens. With all these real-time insights the city administrators can take informative decisions about how to tackle the problems and how to prioritize their investments. I am sure in the future we will even see real-time decision making and actions in order to improve the air in the polluted neighborhoods. Today there are a variety of air quality sensors that can be placed in public means of transport, smart furniture such as smart lights, smart benches or anything else that can be connected, such as rubbish bins, bus stations, or bikes. Some environmental information is publicly available, and some can be provided to the local councils in low or no cost on exchange to something else (i.e. license to use city space or add sensors on city furniture). Apparently, if the data from the sensors that measure the air quality is combined with anonymous mobile data from the network of mobile operators, such as of O2, then the insights can be really valuable, as described above. Cities can plan to create new pedestrian streets, new biking routes, electric vehicle chargers or parking spaces based on the air quality levels. Thus, both the combined data from sensors and mobile phones is critical.
In other words, the councils instead of taking decisions based on historic data or opinions, now coupled with expert perspectives they have all the tools to optimize their decisions based on real-time data or even to automate processes based on specific incidents. In addition, now the cities are capable to customize their actions on neighborhood level and take different measures for each neighborhood, instead of acting in the same way for big areas of the city or even for the whole city. Each neighborhood may have different problems and may require different action plans.
The third problem is home care for elderly and vulnerable people. You can read more about this here.
Smart city challenges, partnerships and ecosystems
If we want to see all these solutions at scale, then the type of cooperation between public authorities and private companies has to change. In the past, the traditional relationship was: buyer = public authorities and one-time supplier = private company. This relationship cannot offer sustainable solutions and partnerships today.
A new approach to the city problems (and not only) need to be followed and this is development of a strong ecosystem of partners, meaning many different suppliers with complementary services and skills that are ready to invest resources in order to innovate together with the city, learn together from the pilots and later to scale. This ecosystem needs to include stakeholders from different backgrounds, such as local authorities, local universities, private or public associations, startups and some key corporates. Needless to say, the citizens, as value receivers, need to be involved and kept updated about the ideas, plans and projects in their city, while offering them the opportunities to share feedback and recommendations.
Each stakeholder needs to be able to add incremental value to a specific part of the value chain. One company cannot offer everything, and cities shouldn’t trust all the solutions to one supplier. Partnerships and co-innovation are the magic words in order a city to be able to plan, pilot and scale a IoT smart city solution. Some good city ecosystem examples we can see in the UK are in cities such as Bristol, Manchester and Bournemouth.
New business models to solve urban problems using IoT and AI
Lastly, while IoT changes relationships and build ecosystems, there is a clear need too for new business models, so they can fund all these projects and move them beyond pilots. As we know, most of the cities cannot afford expensive CAPEX (upfront) investments for each new solution they want to deploy. Business models that charge per month or per year (OPEX) are preferable, offering everything ‘as a service’. In addition, revenue sharing concepts or result based charge are ideas that are discussed a lot nowadays and I am sure we will see them applied more and more often.
To sum up, cities are just scratching the surface of what can be done with data and the opportunities of positive urban transformation by the use of technology are plenty. Citizen engagement and attention to data and citizen privacy are required though, because otherwise the irresponsible use of technology or use of technology just for the sake of using it can destroy the benefits that we envision for our cities. Innovative partnerships and business models combined with social and environmental responsibility are necessary in order to make the roadmap to smart cities economically, socially and environmentally sustainable in the 21st century.
More about Planning Smart Cities
Originally this article was published here.
Dimitrios SpiliopoulosThis article was written by Dimitrios Spiliopoulos. He is passionate about the IoT and new technologies, and has earned an MBA degree from the top-tier IE Business School in Madrid. Currently working as a contractor for the IoT team of Telefonica in London, he previously worked for the global IoT team of Vodafone. Dimitrios is a mentor at several IoT programs, such as IoT Startupbootcamp and IoTUK. | {
"url": "https://www.iiot-world.com/smart-cities-buildings-infrastructure/smart-cities/two-main-urban-problems-that-iot-and-ai-can-solve/",
"source_domain": "www.iiot-world.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "114739",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EXF47YE2VSNEMVOEA4ZJRYJ2EUAHXOWW",
"WARC-Concurrent-To": "<urn:uuid:5271ce91-b1f9-44c2-ba30-2c2cfd109faa>",
"WARC-Date": "2024-05-28T20:35:49Z",
"WARC-IP-Address": "148.72.22.16",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:H5WDRHTYRNW6ZQ6WNGKK46OEZ56ZZSZK",
"WARC-Record-ID": "<urn:uuid:b201bd54-f5fa-44d5-a199-561476203b3e>",
"WARC-Target-URI": "https://www.iiot-world.com/smart-cities-buildings-infrastructure/smart-cities/two-main-urban-problems-that-iot-and-ai-can-solve/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6d858b90-e595-459e-92b4-68a8a469e4fe>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-80\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,
50,
51,
150,
171,
172,
222,
223,
559,
560,
1218,
1219,
1682,
1683,
1724,
1725,
1803,
1804,
2169,
2170,
2912,
2913,
3097,
3098,
3345,
4116,
4712,
4713,
5092,
5093,
5136,
5137,
5206,
5207,
5585,
5586,
6389,
6390,
7790,
7791,
8370,
8371,
8472,
8473,
8524,
8525,
8858,
8859,
9594,
9595,
10036,
10037,
10098,
10099,
10677,
10678,
11328,
11329,
11362,
11363,
11407,
11408,
11410,
11411
],
"line_end_idx": [
50,
51,
150,
171,
172,
222,
223,
559,
560,
1218,
1219,
1682,
1683,
1724,
1725,
1803,
1804,
2169,
2170,
2912,
2913,
3097,
3098,
3345,
4116,
4712,
4713,
5092,
5093,
5136,
5137,
5206,
5207,
5585,
5586,
6389,
6390,
7790,
7791,
8370,
8371,
8472,
8473,
8524,
8525,
8858,
8859,
9594,
9595,
10036,
10037,
10098,
10099,
10677,
10678,
11328,
11329,
11362,
11363,
11407,
11408,
11410,
11411,
11835
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 11835,
"ccnet_original_nlines": 63,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43100276589393616,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013339470140635967,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1140754371881485,
"rps_doc_frac_unique_words": 0.35485535860061646,
"rps_doc_mean_word_length": 4.972107410430908,
"rps_doc_num_sentences": 77,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.65751838684082,
"rps_doc_word_count": 1936,
"rps_doc_frac_chars_dupe_10grams": 0.012466239742934704,
"rps_doc_frac_chars_dupe_5grams": 0.01589445024728775,
"rps_doc_frac_chars_dupe_6grams": 0.01589445024728775,
"rps_doc_frac_chars_dupe_7grams": 0.01589445024728775,
"rps_doc_frac_chars_dupe_8grams": 0.01589445024728775,
"rps_doc_frac_chars_dupe_9grams": 0.012466239742934704,
"rps_doc_frac_chars_top_2gram": 0.00727197015658021,
"rps_doc_frac_chars_top_3gram": 0.005817580036818981,
"rps_doc_frac_chars_top_4gram": 0.00571369007229805,
"rps_doc_books_importance": -983.0878295898438,
"rps_doc_books_importance_length_correction": -983.0878295898438,
"rps_doc_openwebtext_importance": -462.2820129394531,
"rps_doc_openwebtext_importance_length_correction": -462.2820129394531,
"rps_doc_wikipedia_importance": -228.0093536376953,
"rps_doc_wikipedia_importance_length_correction": -228.0093536376953
},
"fasttext": {
"dclm": 0.07972949743270874,
"english": 0.9573776721954346,
"fineweb_edu_approx": 2.676236152648926,
"eai_general_math": 0.11089456081390381,
"eai_open_web_math": 0.10277693718671799,
"eai_web_code": 0.011243999935686588
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "307.76",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social sciences — Research, Social sciences — Study and teaching, and Cities and towns"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "1",
"label": "News/Editorial"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "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 |
1,410,918,497,316,099,000 | Take the tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
What i gotExpectedI want to make a form using Primefaces Mobile with jsf2.0 and primefaces-3.0.M2, but after deploying in jboss server and running it on browser(desktop), the look and feel is not so great. Am i missing some jar files?? Also is there any emulator where i can check and run the mobile webpages. I am using the showcase example at http://www.primefaces.org/showcase-labs/mobile/index.jsf
share|improve this question
1
First official release of PrimeFaces Mobile 0.9 is due 23 Nov along with it's user guide. It just needs primefaces-mobile.jar and primefaces.jar(RC1-SNAPSHOT right now). Mobile is a separate project now. – Cagatay Civici Nov 22 '11 at 16:20
add comment
2 Answers
up vote 1 down vote accepted
If your mobile/no mobile applications are separated, you have to insert in your faces-config.xml the following line
<application>
<default-render-kit-id>PRIMEFACES_MOBILE</default-render-kit-id>
</application>
if your mobile/no mobile views are in the same application you have to
write a viewhandler by overriding calculateRenderKitId API and decide when to display the page in mobile mode. This approach is suggested if your mobile and non-mobile pages are in same application and you need to switch renderkits on-the-fly (from Primefaces Mobile Documentation).
Here a simple ViewHandler class that uses the Spring Mobile functionalities to switch between mobile and non-mobile pages.
import javax.faces.application.ViewHandler;
import javax.faces.application.ViewHandlerWrapper;
import javax.faces.context.FacesContext;
import javax.servlet.http.HttpServletRequest;
import org.springframework.mobile.device.Device;
import org.springframework.mobile.device.DeviceUtils;
import org.springframework.mobile.device.site.SitePreference;
import org.springframework.mobile.device.site.SitePreferenceUtils;
/**
* @author <a href="mailto:gesuino.napoli">Gesuino Napoli</a>
*
*/
public class MobileViewHandler extends ViewHandlerWrapper {
private ViewHandler wrapped;
public MobileViewHandler(ViewHandler wrapped) {
this.wrapped = wrapped;
}
@Override
public ViewHandler getWrapped() {
return this.wrapped;
}
@Override
public String calculateRenderKitId(FacesContext context) {
HttpServletRequest request = (HttpServletRequest) FacesContext.getCurrentInstance().getExternalContext().getRequest();
Device device = DeviceUtils.getRequiredCurrentDevice(request);
SitePreference sitePreference = SitePreferenceUtils.getCurrentSitePreference(request);
if (device.isMobile() || sitePreference == SitePreference.MOBILE) {
return "PRIMEFACES_MOBILE";
}
return this.wrapped.calculateRenderKitId(context);
}
}
Then register the ViewHandler into the faces-config.xml
<application>
<!-- <default-render-kit-id>PRIMEFACES_MOBILE</default-render-kit-id> -->
<view-handler>com.acme.myproject.web.util.viewhandler.MobileViewHandler</view-handler>
....
</application>
If you want to test your application with an android emulator you can download and installate the sdk-android
1. Install Android SDK
2. Install ADT Eclipse plugin
3. Create an Android Virtual Device (AVD)
To do this follow this link: http://developer.android.com/sdk/index.html.
Then, follow this post to "Getting Your Android Emulator to Read Virtual Hosts on your Development Machine" - http://dillieodigital.wordpress.com/2012/03/19/soup-to-nuts-getting-your-android-emulator-to-read-virtual-hosts-on-your-development-machine/
share|improve this answer
add comment
Firstly, all you need is the Primefaces jar, but since the M4 version is out you should update your classpath(be careful that if you use Netbeans, the library removing it's a little sloppy, double check that you have only one library-M4 in the lib folder).
Also, please post your code here, and be careful to use the new namespaces:
xmlns:p="http://primefaces.org/ui"
xmlns:pm="http://primefaces.org/mobile"
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/8227766/what-are-the-jar-files-required-for-running-primefaces-mobile",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "67965",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NYLP2HALIBLCYAHCMR6MR5XXHXQKSS7I",
"WARC-Concurrent-To": "<urn:uuid:ad7d94f4-a6d1-4f5a-b181-33b687d0c758>",
"WARC-Date": "2013-12-21T01:39:25Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:YJJIPCHCG3E4KOSE3JPLES34U3F3GVBI",
"WARC-Record-ID": "<urn:uuid:be39f7fd-d2fa-4de4-a68b-872d83b5a68e>",
"WARC-Target-URI": "http://stackoverflow.com/questions/8227766/what-are-the-jar-files-required-for-running-primefaces-mobile",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:09e2cdea-628e-4c5e-b68d-7ef530d29767>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
16,
148,
149,
551,
552,
580,
584,
826,
838,
839,
849,
850,
879,
880,
996,
997,
1011,
1080,
1095,
1096,
1167,
1168,
1451,
1452,
1575,
1576,
1620,
1671,
1712,
1758,
1759,
1808,
1862,
1924,
1991,
1992,
1996,
2058,
2061,
2065,
2125,
2126,
2159,
2160,
2212,
2240,
2246,
2247,
2261,
2299,
2328,
2334,
2335,
2349,
2412,
2539,
2610,
2705,
2781,
2821,
2831,
2890,
2896,
2898,
2899,
2955,
2956,
2970,
3052,
3147,
3152,
3167,
3168,
3278,
3279,
3304,
3336,
3380,
3381,
3455,
3456,
3707,
3708,
3734,
3746,
3747,
4004,
4005,
4081,
4082,
4117,
4157,
4183,
4195,
4196,
4208,
4209,
4211,
4219,
4220,
4298,
4299
],
"line_end_idx": [
16,
148,
149,
551,
552,
580,
584,
826,
838,
839,
849,
850,
879,
880,
996,
997,
1011,
1080,
1095,
1096,
1167,
1168,
1451,
1452,
1575,
1576,
1620,
1671,
1712,
1758,
1759,
1808,
1862,
1924,
1991,
1992,
1996,
2058,
2061,
2065,
2125,
2126,
2159,
2160,
2212,
2240,
2246,
2247,
2261,
2299,
2328,
2334,
2335,
2349,
2412,
2539,
2610,
2705,
2781,
2821,
2831,
2890,
2896,
2898,
2899,
2955,
2956,
2970,
3052,
3147,
3152,
3167,
3168,
3278,
3279,
3304,
3336,
3380,
3381,
3455,
3456,
3707,
3708,
3734,
3746,
3747,
4004,
4005,
4081,
4082,
4117,
4157,
4183,
4195,
4196,
4208,
4209,
4211,
4219,
4220,
4298,
4299,
4389
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4389,
"ccnet_original_nlines": 102,
"rps_doc_curly_bracket": 0.0022784199099987745,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23190045356750488,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01583709940314293,
"rps_doc_frac_lines_end_with_ellipsis": 0.009708739817142487,
"rps_doc_frac_no_alph_words": 0.32466062903404236,
"rps_doc_frac_unique_words": 0.5612903237342834,
"rps_doc_mean_word_length": 7.335484027862549,
"rps_doc_num_sentences": 87,
"rps_doc_symbol_to_word_ratio": 0.0011312200222164392,
"rps_doc_unigram_entropy": 5.196837425231934,
"rps_doc_word_count": 465,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.018762830644845963,
"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.014072120189666748,
"rps_doc_frac_chars_top_3gram": 0.008208739571273327,
"rps_doc_frac_chars_top_4gram": 0.011726769618690014,
"rps_doc_books_importance": -475.87005615234375,
"rps_doc_books_importance_length_correction": -475.87005615234375,
"rps_doc_openwebtext_importance": -257.21209716796875,
"rps_doc_openwebtext_importance_length_correction": -257.21209716796875,
"rps_doc_wikipedia_importance": -191.81857299804688,
"rps_doc_wikipedia_importance_length_correction": -191.81857299804688
},
"fasttext": {
"dclm": 0.25382477045059204,
"english": 0.6140540242195129,
"fineweb_edu_approx": 1.3843079805374146,
"eai_general_math": 0.0008798200287856162,
"eai_open_web_math": 0.08820313215255737,
"eai_web_code": 0.00048804000834934413
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-1,049,379,826,329,987,600 | Creating Delight in Website Design and Development
In the realm of web and mobile app development, there exists a critical differentiator that sets outstanding creations apart from the mundane – the art of creating something truly memorable and delightful to use. This elusive quality might manifest as a touch of humor, a visually striking interface design, or an interaction that brings a smile to the user’s face. It’s important to note that achieving this delightful user experience is both subjective and challenging to define, and that’s precisely the point.
Before we delve deeper into the concept of delight, it’s imperative to establish two foundational pillars: usability and accessibility. These two benchmarks must be met before the pursuit of delight can begin. Furthermore, any delightful element introduced must seamlessly integrate into the overarching design framework. For instance, if you’re crafting a high-end banking application, humor may not be the most appropriate choice. Similarly, if the interaction in question will be used repeatedly, adding an overly complex set of interface elements solely for aesthetic purposes would hinder usability. The key lies in harmonizing delight with usability, ensuring that it enhances the user experience without sacrificing functionality.
The Essence of Delight
The true magic of creating delight in website design and development unfolds when the targeted element aligns with the website or app’s overall objectives. If your goal is to infuse fun into an application, it should also reinforce the brand’s identity. If your brand exudes a sense of fun and cleverness, integrating humor becomes a winning strategy. Another fertile ground for delight is when an element communicates data, such as a chart or graph. Animations, too, play a pivotal role as they can inform users on how to interact with the interface effectively. They load, educate, and gracefully recede into the background, facilitating a seamless user experience.
The Impact of Delight
Introducing moments of delight into your website or app can yield remarkable results. It not only makes your creation more memorable but also fosters a deeper connection between users and your platform. This, in turn, cultivates goodwill and may even serve as a buffer, mitigating any concerns users may have or seeking forgiveness if other aspects of the design fall short of expectations.
When users encounter a delightful surprise within your website or app, it creates a lasting impression. It transforms a mere interaction into a memorable experience, leaving a positive mark on the user’s perception of your brand. Over time, this can translate into increased customer loyalty and brand advocacy.
The Art of Delightful Design
To harness the power of delight in design effectively, it’s crucial to understand your target audience. What brings them joy, amusement, or satisfaction? Tailoring the delightful elements to resonate with your user base ensures a more impactful response.
Additionally, constant testing and user feedback are invaluable. These iterative processes help refine the delightful elements, ensuring they continue to meet user expectations and preferences. What delights users today may evolve over time, so staying attuned to these shifts is essential.
Some Examples
Google Doodles:
Google frequently replaces its logo with creative and interactive animations or illustrations to celebrate holidays, historical events, and famous figures. These delightful doodles often surprise and engage users when they visit the Google homepage.
Duolingo’s Language Learning Gamification:
Duolingo, a language-learning platform, incorporates gamification elements into its interface. Users earn points, unlock achievements, and compete with friends, adding an element of fun and delight to the otherwise challenging task of language learning.
Spotify’s Personalized Playlists:
Spotify’s algorithms generate personalized playlists for users based on their listening habits. Discovering new music that aligns with your tastes can be a delightful experience and keeps users engaged with the platform.
Twitter’s Like Animation:
When users ‘like’ a tweet on Twitter, a heart icon pops up and explodes into a burst of tiny hearts. This small animation adds a touch of delight to the act of liking a post and provides instant feedback to the user.
Airbnb’s Host Bios:
Airbnb allows hosts to create personalized bios for their listings. Some hosts go the extra mile by including humorous anecdotes, local recommendations, or interesting stories about their properties. These personal touches can delight potential guests and make the accommodation stand out.
These examples demonstrate how delight can be strategically integrated into website design and functionality, enhancing the overall user experience and making interactions more enjoyable.
The Masters
Paying homage and researching Don Norman’s groundbreaking work on emotional design and Aaron Walter’s insights on designing for emotion is essential in today’s digital landscape. Norman’s emphasis on creating products that evoke positive emotions aligns with Walter’s focus on crafting user experiences that resonate emotionally. By combining their principles, designers can create websites and apps that not only function well but also leave a lasting and delightful impact on users’ hearts and minds.
Make ’em Smile
The ability to create moments of delight is a game-changer. It transforms your creation from a mere tool into a memorable experience that resonates with users on a profound level. By aligning these delightful elements with your brand and user expectations, you can forge stronger connections and leave a lasting imprint in the digital realm.
While creating moments of delight is a powerful strategy, it must be approached with balance and sensitivity. Overindulgence in whimsy or extravagance can overwhelm users and detract from the core functionality. Therefore, it’s essential to strike the right equilibrium between delight and usability.
So, when embarking on your next web or mobile app project, remember that usability and accessibility are the foundation, but it’s the touch of delight that can truly set you apart.
0 Comments
Submit a Comment
Your email address will not be published. Required fields are marked *
More News & Articles
The Essential Guide to Getting Started on Freelance Writing
The Essential Guide to Getting Started on Freelance Writing
Explore the lucrative and fulfilling world of freelance writing with our essential guide. Learn about specialties like blogging, social media, article, and technical writing. Build a portfolio, find work, set up your business, and discover the potential earnings. Embrace the freedom of working from home and follow tips for success in your dream career.
Securing Your Website: A DevOps Security Checklist
Securing Your Website: A DevOps Security Checklist
Learn how to secure your website with a comprehensive DevOps checklist. Dive into SSL/TLS encryption, password practices, and more. Discover the power of Content Security Policy and safeguard your online presence effectively.
EMAIL NEWSLETTER | {
"url": "https://unmatchedstyle.com/news/creating-delight-in-website-design-and-development.php",
"source_domain": "unmatchedstyle.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "282914",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EISGWX5CPMRWRIBHUJBDD7LZTZNJVDZU",
"WARC-Concurrent-To": "<urn:uuid:61b4de7b-f620-4683-aad0-cd701197c833>",
"WARC-Date": "2024-05-30T16:19:36Z",
"WARC-IP-Address": "151.101.130.159",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZFYTCZ5WBVOMTUT3C4Q5ED6UUAHZGTP7",
"WARC-Record-ID": "<urn:uuid:43b22451-7722-4976-9e9f-7b44c4cfd049>",
"WARC-Target-URI": "https://unmatchedstyle.com/news/creating-delight-in-website-design-and-development.php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c77e890f-97de-40e8-9fd8-8cd509b5698d>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-217\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
51,
52,
566,
567,
1305,
1306,
1329,
1330,
1998,
1999,
2021,
2022,
2413,
2414,
2726,
2727,
2756,
2757,
3012,
3013,
3304,
3305,
3319,
3320,
3336,
3337,
3587,
3588,
3631,
3632,
3886,
3887,
3921,
3922,
4143,
4144,
4170,
4171,
4388,
4389,
4409,
4410,
4700,
4701,
4889,
4890,
4902,
4903,
5406,
5407,
5422,
5423,
5765,
5766,
6067,
6068,
6249,
6250,
6261,
6262,
6279,
6280,
6351,
6352,
6373,
6374,
6434,
6435,
6495,
6496,
6851,
6852,
6903,
6904,
6955,
6956,
7182,
7183
],
"line_end_idx": [
51,
52,
566,
567,
1305,
1306,
1329,
1330,
1998,
1999,
2021,
2022,
2413,
2414,
2726,
2727,
2756,
2757,
3012,
3013,
3304,
3305,
3319,
3320,
3336,
3337,
3587,
3588,
3631,
3632,
3886,
3887,
3921,
3922,
4143,
4144,
4170,
4171,
4388,
4389,
4409,
4410,
4700,
4701,
4889,
4890,
4902,
4903,
5406,
5407,
5422,
5423,
5765,
5766,
6067,
6068,
6249,
6250,
6261,
6262,
6279,
6280,
6351,
6352,
6373,
6374,
6434,
6435,
6495,
6496,
6851,
6852,
6903,
6904,
6955,
6956,
7182,
7183,
7199
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7199,
"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.3466453552246094,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004792329855263233,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12380191683769226,
"rps_doc_frac_unique_words": 0.4748603403568268,
"rps_doc_mean_word_length": 5.546555042266846,
"rps_doc_num_sentences": 58,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.5990071296691895,
"rps_doc_word_count": 1074,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05271109938621521,
"rps_doc_frac_chars_dupe_6grams": 0.04633205011487007,
"rps_doc_frac_chars_dupe_7grams": 0.04633205011487007,
"rps_doc_frac_chars_dupe_8grams": 0.01712271012365818,
"rps_doc_frac_chars_dupe_9grams": 0.01712271012365818,
"rps_doc_frac_chars_top_2gram": 0.015108279883861542,
"rps_doc_frac_chars_top_3gram": 0.008057749830186367,
"rps_doc_frac_chars_top_4gram": 0.008057749830186367,
"rps_doc_books_importance": -477.9503173828125,
"rps_doc_books_importance_length_correction": -477.9503173828125,
"rps_doc_openwebtext_importance": -260.9559020996094,
"rps_doc_openwebtext_importance_length_correction": -260.9559020996094,
"rps_doc_wikipedia_importance": -205.64329528808594,
"rps_doc_wikipedia_importance_length_correction": -205.64329528808594
},
"fasttext": {
"dclm": 0.08584100008010864,
"english": 0.890182375907898,
"fineweb_edu_approx": 1.675004482269287,
"eai_general_math": 0.002480860101059079,
"eai_open_web_math": 0.05121726170182228,
"eai_web_code": 0.026094909757375717
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-1,540,230,180,807,943,400 |
A
Hyperlink auf eine URL einfügen.
Kindelemente
A, Action, B, Barcode, Br, Clip, Color, Fontface, ForAll, Frame, HSpace, I, Image, Loop, NoBreak, Span, Sub, Sup, Switch, U, URL, Value
Elternelemente
A, B, Case, Color, Fontface, ForAll, I, Li, Loop, NoBreak, Otherwise, Overlay, Paragraph, PlaceObject, Span, U, URL, Until, While
Attribute
bordercolor (Text, optional, seit Version 4.15.7)
Setze die Rahmenfarbe des links (nur Adobe Acrobat)
description (Text, optional, seit Version 4.19.12)
Ein alternativer Text für Barrierefreiheit
embedded (Text, optional, seit Version 4.15.11)
Link zu einer eingebetteten Datei. Um eine andere Seite als die erste Seite zu öffnen, setze das page-Attribute auf die Seitenzahl. Um eine named destination anzusteuern, nutze das link-Attribut.
href (Text, optional)
Das Ziel des Hyperlinks. Beispiel: https://www.speedata.de
link (Text, optional, seit Version 3.3.8)
Das Ziel des Dokumentlinks. Beispiel: article123. Ziele werden mit Action/Mark erzeugt. Bei Links auf eingebettete Dateien, kann das link-Attribut den Namen des Ziels beinhalten.
page (Zahl, optional, seit Version 4.3.5)
Link zu einer (logischen) Seitenzahl. Bei Links auf eingebettete Dateien, kann das page-Attribut die Seitenzahl des Ziels beinhalten.
Beispiel
Erzeugt einen Link in einem Dokument auf ein angehängtes Dokument. Wird nur von wenigen PDF Anzeigeprogrammen unterstützt.
<Layout xmlns="urn:speedata.de:2009/publisher/en"
xmlns:sd="urn:speedata:2009/publisher/functions/en">
<AttachFile type="application/pdf"
filename="document.pdf"
description="An important document" />
<Record element="data">
<PlaceObject>
<Textblock>
<Paragraph>
<A embedded="document.pdf" page="5">
<Value>See the page 5 of the document.</Value>
</A>
</Paragraph>
</Textblock>
</PlaceObject>
</Record>
</Layout>
Erzeugt einen normalen Hyperlink auf eine URL:
<PlaceObject>
<Textblock>
<Paragraph>
<Value>Siehe die </Value>
<A href="https://www.speedata.de"><Value>Homepage</Value></A>
<Value> für weitere Information.</Value>
</Paragraph>
</Textblock>
</PlaceObject>
Siehe auch
Das Kapitel Textformatierung. | {
"url": "https://doc.speedata.de/publisher/de/befehlsreferenz/a/",
"source_domain": "doc.speedata.de",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "33772",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZPATY334TLUZM3COFXC3UK3CIIFXBTXJ",
"WARC-Concurrent-To": "<urn:uuid:29e4d1e4-17e9-4123-997d-2a130bb0c8b9>",
"WARC-Date": "2024-09-17T13:15:32Z",
"WARC-IP-Address": "167.235.33.232",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Q6SF7DBE7A4BHNVYKFW4G64UOMP7SLX7",
"WARC-Record-ID": "<urn:uuid:7a218234-088b-404b-9fe4-6f993dcbcd5d>",
"WARC-Target-URI": "https://doc.speedata.de/publisher/de/befehlsreferenz/a/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f89f1217-2999-4cac-835c-f649c1127aeb>"
},
"warc_info": "isPartOf: CC-MAIN-2024-38\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-98\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,
1,
3,
4,
37,
38,
51,
52,
188,
189,
204,
205,
335,
336,
346,
347,
397,
398,
450,
451,
502,
503,
546,
547,
595,
596,
792,
793,
815,
816,
875,
876,
918,
919,
1098,
1099,
1141,
1142,
1276,
1277,
1286,
1287,
1410,
1411,
1461,
1522,
1523,
1560,
1598,
1651,
1677,
1695,
1713,
1733,
1780,
1839,
1854,
1875,
1894,
1913,
1925,
1935,
1936,
1983,
1984,
1998,
2012,
2028,
2060,
2128,
2175,
2192,
2207,
2222,
2223,
2234,
2235
],
"line_end_idx": [
1,
3,
4,
37,
38,
51,
52,
188,
189,
204,
205,
335,
336,
346,
347,
397,
398,
450,
451,
502,
503,
546,
547,
595,
596,
792,
793,
815,
816,
875,
876,
918,
919,
1098,
1099,
1141,
1142,
1276,
1277,
1286,
1287,
1410,
1411,
1461,
1522,
1523,
1560,
1598,
1651,
1677,
1695,
1713,
1733,
1780,
1839,
1854,
1875,
1894,
1913,
1925,
1935,
1936,
1983,
1984,
1998,
2012,
2028,
2060,
2128,
2175,
2192,
2207,
2222,
2223,
2234,
2235,
2264
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2264,
"ccnet_original_nlines": 76,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.008130080066621304,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03658536821603775,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4288617968559265,
"rps_doc_frac_unique_words": 0.5766128897666931,
"rps_doc_mean_word_length": 6.560483932495117,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.747954368591309,
"rps_doc_word_count": 248,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04548247903585434,
"rps_doc_frac_chars_dupe_6grams": 0.04548247903585434,
"rps_doc_frac_chars_dupe_7grams": 0.04548247903585434,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03687769174575806,
"rps_doc_frac_chars_top_3gram": 0.05838967114686966,
"rps_doc_frac_chars_top_4gram": 0.056545790284872055,
"rps_doc_books_importance": -216.88406372070312,
"rps_doc_books_importance_length_correction": -216.88406372070312,
"rps_doc_openwebtext_importance": -146.27655029296875,
"rps_doc_openwebtext_importance_length_correction": -146.27655029296875,
"rps_doc_wikipedia_importance": -111.37522888183594,
"rps_doc_wikipedia_importance_length_correction": -111.37522888183594
},
"fasttext": {
"dclm": 0.8255617618560791,
"english": 0.015300789847970009,
"fineweb_edu_approx": 2.3452024459838867,
"eai_general_math": 0.009128089994192123,
"eai_open_web_math": 0.10773265361785889,
"eai_web_code": 0.3554179072380066
}
} | {
"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.7",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-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,287,644,965,651,319,300 |
Forgot your password?
typodupeerror
Comment: Re:Is there an open-source alternative? (Score 1) 69
by Phil Hands (#44313009) Attached to: BitTorrent Sync Beta Released
git-annex (and git-annex assistant for those that don't like CLI):
https://git-annex.branchable.com/assistant/
https://git-annex.branchable.com/
does lots more than just sync you files, and can do that with proper encryption (GPG) to a load of cloud providers, or to your own servers, or without needing a server at all. I could go on, but it would be better to just follow the links.
+ - Rhombus Tech A10 EOMA-68 CPU Card schematics completed->
Submitted by
lkcl
lkcl writes "Rhombus Tech's first CPU Card is nearing completion and availability: the schematics have been completed by Wits-Tech. Although it appears strange to be using a 1ghz Cortex A8 for the first CPU Card, not only is the mass-volume price of the A10 lower than other offerings; not only does the A10 classify as "good enough" (in combination with 1gb of RAM); but Allwinner Tech is one of the very rare China-based SoC companies willing to collaborate with Software (Libre) developers without an enforced (GPL-violating) NDA in place. Overall, it's the very first step in the right direction for collaboration between Software (Libre) developers and mass-volume PRC Factories. There will be more (faster, better) EOMA-68 CPU Cards: this one is just the first."
Link to Original Source
Comment: Let's just blacklist all these stupid new TLDs (Score 1) 116
by Phil Hands (#40312411) Attached to: ICANN Reveals New TLD Application List
It strikes me that I'm extremely unlikely to be interested in domains below many (or any) of the listed TLDs (having glanced down the list) so why not teach the silly sods a lesson by blackisting them in bind by default, and thus make ICANN get the blame they deserve for peddling this nonsense.
Comment: Daily Mail is moronic (Score 5, Insightful) 116
by Phil Hands (#34789418) Attached to: BBC Astronomer Misses Meteor During Live Show
The last time I had the misfortune to have my brain polluted by a Daily Mail story was when sitting bored in a physio's waiting room.
Flipping the rag open at random, I see a headline something like:
87% of Britons now members of a persecuted minority
this little nugget of wisdom had apparently been assembled by taking the percentages of various "minorities" and adding them all together.
The groups included:
51% Women
*cough* minority?
and then:
12% Single Mothers
[SubEd Are you sure we can simply add that number to the Women?] [Ed: yeah, no problem]
Comment: make 4 kids share 1, and they teach themselves (Score 2, Interesting) 152
by Phil Hands (#34035288) Attached to: Some Aussie High Schools Moving To Two Devices Per Child
as proven by Sugata Mitra (of Hole in the Wall project fame), if you get rid of the teachers and provide one computer per 4 children, and let the kids collaborate, they teach one another
http://www.ted.com/talks/sugata_mitra_the_child_driven_education.html
The quote from Arthur C Clark is particularly telling: Any teacher that can be replaced by a computer should be replaced by a computer.
Comment: s/Denmark/Venezuela/ (Score 4, Informative) 138
by Phil Hands (#23740297) Attached to: ISO Puts OOXML On Hold
There are four appeals, but Denmark's not one of them -- Venezuela is though.
Denmark are just part of the general howl of protest from people who've looked at the heap of excrement that is DIS 29500 and found it wanting, and/or were in one of the many countries where the behaviour of their National Bodies has made it clear that their local Microsoft lackeys have been interfering with what should be a process focussed on technical merit, not on whether personal gain can be maximised.
Quickies
+ - Kilogram prototype mysteriously loses weight
Submitted by
mernil
mernil writes "The 118-year-old cylinder that is the international prototype for the metric mass, kept tightly under lock and key outside Paris, is mysteriously losing weight — if ever so slightly. Physicist Richard Davis of the International Bureau of Weights and Measures in Sevres, southwest of Paris, says the reference kilo appears to have lost 50 micrograms compared with the average of dozens of copies. "The mystery is that they were all made of the same material, and many were made at the same time and kept under the same conditions, and yet the masses among them are slowly drifting apart," he said. "We don't really have a good hypothesis for it.""
Life is difficult because it is non-linear.
Working... | {
"url": "http://slashdot.org/~Phil+Hands/tags/slownewsday",
"source_domain": "slashdot.org",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "81372",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:P3CHC6JJ3KZBLXLBDBUBUFWHY73COPSF",
"WARC-Concurrent-To": "<urn:uuid:942032f7-a40f-466e-8d74-1ef2d5e612b0>",
"WARC-Date": "2014-04-20T20:34:13Z",
"WARC-IP-Address": "216.34.181.45",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:UIVU4NMRQHMRZX7AJJ6SC3ADME2FYN5O",
"WARC-Record-ID": "<urn:uuid:643e6c86-e896-4ca0-91f5-f1fa4cff0db8>",
"WARC-Target-URI": "http://slashdot.org/~Phil+Hands/tags/slownewsday",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:881521ec-3d89-4429-949d-ab3097104246>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-147-4-33.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-15\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for April 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
2,
3,
4,
5,
27,
41,
42,
104,
105,
174,
175,
242,
243,
291,
329,
330,
570,
571,
632,
633,
646,
651,
1420,
1444,
1445,
1515,
1516,
1594,
1595,
1891,
1892,
1949,
1950,
2035,
2036,
2170,
2171,
2237,
2238,
2294,
2295,
2434,
2435,
2456,
2457,
2471,
2472,
2490,
2491,
2501,
2502,
2525,
2526,
2614,
2615,
2698,
2699,
2795,
2796,
2983,
2984,
3054,
3055,
3191,
3192,
3249,
3250,
3312,
3390,
3391,
3802,
3811,
3812,
3861,
3862,
3875,
3882,
4544,
4545,
4589,
4590
],
"line_end_idx": [
2,
3,
4,
5,
27,
41,
42,
104,
105,
174,
175,
242,
243,
291,
329,
330,
570,
571,
632,
633,
646,
651,
1420,
1444,
1445,
1515,
1516,
1594,
1595,
1891,
1892,
1949,
1950,
2035,
2036,
2170,
2171,
2237,
2238,
2294,
2295,
2434,
2435,
2456,
2457,
2471,
2472,
2490,
2491,
2501,
2502,
2525,
2526,
2614,
2615,
2698,
2699,
2795,
2796,
2983,
2984,
3054,
3055,
3191,
3192,
3249,
3250,
3312,
3390,
3391,
3802,
3811,
3812,
3861,
3862,
3875,
3882,
4544,
4545,
4589,
4590,
4600
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4600,
"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.38090240955352783,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029380900785326958,
"rps_doc_frac_lines_end_with_ellipsis": 0.012195119634270668,
"rps_doc_frac_no_alph_words": 0.20881426334381104,
"rps_doc_frac_unique_words": 0.5635135173797607,
"rps_doc_mean_word_length": 4.86081075668335,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.006295910105109215,
"rps_doc_unigram_entropy": 5.579152584075928,
"rps_doc_word_count": 740,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01167639996856451,
"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.011120379902422428,
"rps_doc_frac_chars_top_3gram": 0.015290520153939724,
"rps_doc_frac_chars_top_4gram": 0.007784259971231222,
"rps_doc_books_importance": -391.5843505859375,
"rps_doc_books_importance_length_correction": -391.5843505859375,
"rps_doc_openwebtext_importance": -228.10107421875,
"rps_doc_openwebtext_importance_length_correction": -228.10107421875,
"rps_doc_wikipedia_importance": -181.9552459716797,
"rps_doc_wikipedia_importance_length_correction": -181.9552459716797
},
"fasttext": {
"dclm": 0.035630758851766586,
"english": 0.9519930481910706,
"fineweb_edu_approx": 2.000736713409424,
"eai_general_math": 0.1450909972190857,
"eai_open_web_math": 0.5436651706695557,
"eai_web_code": 0.012559530325233936
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0951",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "371.392",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Teachers, Teaching, and School management and organization"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
4,273,360,646,876,288,000 | Scippy
SCIP
Solving Constraint Integer Programs
objvardata.h
Go to the documentation of this file.
1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
2 /* */
3 /* This file is part of the program and library */
4 /* SCIP --- Solving Constraint Integer Programs */
5 /* */
6 /* Copyright (C) 2002-2015 Konrad-Zuse-Zentrum */
7 /* fuer Informationstechnik Berlin */
8 /* */
9 /* SCIP is distributed under the terms of the ZIB Academic License. */
10 /* */
11 /* You should have received a copy of the ZIB Academic License. */
12 /* along with SCIP; see the file COPYING. If not email to [email protected]. */
13 /* */
14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
15
16 /**@file objvardata.h
17 * @brief C++ wrapper for user variable data
18 * @author Tobias Achterberg
19 */
20
21 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
22
23 #ifndef __SCIP_OBJVARDATA_H__
24 #define __SCIP_OBJVARDATA_H__
25
26
27 #include <cassert>
28
29 #include "scip/scip.h"
30 #include "objscip/objcloneable.h"
31
32 namespace scip
33 {
34
35 /** @brief C++ wrapper for user variable data
36 *
37 * This class defines the interface for user variable data implemented in C++. Each variable can be equipped with a
38 * variable data class. This data can be accessed via the function SCIPgetObjVardata() at any time after it is created
39 * and before it is deleted.
40 *
41 * - \ref type_var.h "Corresponding C interface"
42 */
44 {
45 public:
46 /** default constructor */
48 {
49 }
50
51 /** destructor */
52 virtual ~ObjVardata()
53 {
54 }
55
56 /** destructor of user variable data to free original user data (called when original variable is freed)
57 *
58 * If the "deleteobject" flag in the SCIPcreateObjVar() method was set to TRUE, this method is not needed,
59 * because all the work to delete the user variable data can be done in the destructor of the user variable
60 * data object. If the "deleteobject" flag was set to FALSE, and the user variable data object stays alive
61 * after the SCIP variable is freed, this method should delete all the variable specific data that is no
62 * longer needed.
63 */
65 SCIP* scip, /**< SCIP data structure */
66 SCIP_VAR* var /**< original variable, the data to free is belonging to */
67 )
68 { /*lint --e{715}*/
69 return SCIP_OKAY;
70 }
71
72 /** creates user data of transformed variable by transforming the original user variable data
73 * (called after variable was transformed)
74 *
75 * The user has two possibilities to implement this method:
76 * 1. Return the pointer to the original variable data object (this) as pointer to the transformed variable data
77 * object. The user may modify some internal attributes, but he has to make sure, that these modifications are
78 * reversed in the scip_deltrans() method, such that the original variable data is restored. In this case,
79 * he should set *deleteobject to FALSE, because the variable data must not be destructed by SCIP after the
80 * solving process is terminated.
81 * 2. Call the copy constructor of the variable data object and return the created copy as transformed variable
82 * data object. In this case, he probably wants to set *deleteobject to TRUE, thus letting SCIP call the
83 * destructor of the object if the transformed variable data is no longer needed.
84 */
86 SCIP* scip, /**< SCIP data structure */
87 SCIP_VAR* var, /**< transformed variable, the data to create is belonging to */
88 ObjVardata** objvardata, /**< pointer to store the transformed variable data object */
89 SCIP_Bool* deleteobject /**< pointer to store whether SCIP should delete the object after solving */
90 )
91 { /*lint --e{715}*/
92 assert(objvardata != NULL);
93 assert(deleteobject != NULL);
94
95 /* the default implementation just copies the pointer to the variable data object;
96 * SCIP must not destruct the transformed variable data object, because the original variable data must stay alive
97 */
98 *objvardata = this;
99 *deleteobject = FALSE;
100
101 return SCIP_OKAY;
102 }
103
104 /** destructor of user variable data to free transformed user data (called when transformed variable is freed)
105 *
106 * If the "*deleteobject" flag in the scip_trans() method was set to TRUE, this method is not needed,
107 * because all the work to delete the user variable data can be done in the destructor of the user variable
108 * data object. If the "*deleteobject" flag was set to FALSE, and the user variable data object stays alive
109 * after the SCIP variable is freed, this method should delete all the variable specific data that is no
110 * longer needed.
111 */
113 SCIP* scip, /**< SCIP data structure */
114 SCIP_VAR* var /**< transformed variable, the data to free is belonging to */
115 )
116 { /*lint --e{715}*/
117 return SCIP_OKAY;
118 }
119
120 /** copies variable data of source SCIP variable for the target SCIP variable
121 *
122 * This method should copy the variable data of the source SCIP and create a target variable data for target
123 * variable. This callback is optional. If the copying process was successful, the target variable gets this variable
124 * data assigned. In case the result pointer is set to SCIP_DIDNOTRUN, the target variable will have no variable data at
125 * all.
126 *
127 * The variable map and the constraint map can be used via the function SCIPgetVarCopy() and SCIPgetConsCopy(),
128 * respectively, to get for certain variables and constraints of the source SCIP the counter parts in the target
129 * SCIP. You should be very carefully in using these two methods since they could lead to infinite loop.
130 *
131 * possible return values for *result:
132 * - SCIP_DIDNOTRUN : the copying process was not performed
133 * - SCIP_SUCCESS : the copying process was successfully performed
134 */
136 SCIP* scip, /**< SCIP data structure */
137 SCIP* sourcescip, /**< source SCIP main data structure */
138 SCIP_VAR* sourcevar, /**< variable of the source SCIP */
139 SCIP_HASHMAP* varmap, /**< a hashmap which stores the mapping of source variables to corresponding
140 * target variables */
141 SCIP_HASHMAP* consmap, /**< a hashmap which stores the mapping of source contraints to corresponding
142 * target constraints */
143 SCIP_VAR* targetvar, /**< variable of the (targert) SCIP (targetvar is the copy of sourcevar) */
144 ObjVardata** objvardata, /**< pointer to store the copied variable data object */
145 SCIP_RESULT* result /**< pointer to store the result of the call */
146 )
147 { /*lint --e{715}*/
148 (*objvardata) = 0;
149 (*result) = SCIP_DIDNOTRUN;
150 return SCIP_OKAY;
151 }
152 };
153
154 } /* namespace scip */
155
156
157
158 /** create and capture problem variable and associates the given variable data with the variable;
159 * if variable is of integral type, fractional bounds are automatically rounded
160 */
161 extern
163 SCIP* scip, /**< SCIP data structure */
164 SCIP_VAR** var, /**< pointer to variable object */
165 const char* name, /**< name of variable, or NULL for automatic name creation */
166 SCIP_Real lb, /**< lower bound of variable */
167 SCIP_Real ub, /**< upper bound of variable */
168 SCIP_Real obj, /**< objective function value */
169 SCIP_VARTYPE vartype, /**< type of variable */
170 SCIP_Bool initial, /**< should var's column be present in the initial root LP? */
171 SCIP_Bool removable, /**< is var's column removable from the LP (due to aging or cleanup)? */
172 scip::ObjVardata* objvardata, /**< user variable data object */
173 SCIP_Bool deleteobject /**< should the user variable data object be deleted when variable is freed? */
174 );
175
176 /** gets user variable data object for given problem variable
177 * Warning! This method should only be called after a variable was created with SCIPcreateObjVar().
178 * Otherwise, a segmentation fault may arise, or an undefined pointer is returned.
179 */
180 extern
182 SCIP* scip, /**< SCIP data structure */
183 SCIP_VAR* var /**< problem variable */
184 );
185
186 #endif
enum SCIP_Result SCIP_RESULT
Definition: type_result.h:51
virtual SCIP_RETCODE scip_deltrans(SCIP *scip, SCIP_VAR *var)
Definition: objvardata.h:112
#define NULL
Definition: lpi_spx.cpp:130
struct SCIP_HashMap SCIP_HASHMAP
Definition: type_misc.h:78
#define FALSE
Definition: def.h:53
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:53
virtual ~ObjVardata()
Definition: objvardata.h:52
definition of base class for all clonable classes
scip::ObjVardata * SCIPgetObjVardata(SCIP *scip, SCIP_VAR *var)
struct Scip SCIP
Definition: type_scip.h:30
#define SCIP_Bool
Definition: def.h:50
virtual SCIP_RETCODE scip_delorig(SCIP *scip, SCIP_VAR *var)
Definition: objvardata.h:64
struct SCIP_Var SCIP_VAR
Definition: type_var.h:95
virtual SCIP_RETCODE scip_trans(SCIP *scip, SCIP_VAR *var, ObjVardata **objvardata, SCIP_Bool *deleteobject)
Definition: objvardata.h:85
C++ wrapper for user variable data.
Definition: objvardata.h:43
#define SCIP_Real
Definition: def.h:124
enum SCIP_Vartype SCIP_VARTYPE
Definition: type_var.h:58
SCIP_RETCODE SCIPcreateObjVar(SCIP *scip, SCIP_VAR **var, const char *name, SCIP_Real lb, SCIP_Real ub, SCIP_Real obj, SCIP_VARTYPE vartype, SCIP_Bool initial, SCIP_Bool removable, scip::ObjVardata *objvardata, SCIP_Bool deleteobject)
virtual SCIP_RETCODE scip_copy(SCIP *scip, SCIP *sourcescip, SCIP_VAR *sourcevar, SCIP_HASHMAP *varmap, SCIP_HASHMAP *consmap, SCIP_VAR *targetvar, ObjVardata **objvardata, SCIP_RESULT *result)
Definition: objvardata.h:135
SCIP callable library. | {
"url": "https://scipopt.org/doc-3.2.0/html/objvardata_8h_source.php",
"source_domain": "scipopt.org",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "51762",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:N3ER2KLIPHI4BF4ZQ5MFTLHT5YDJYQUN",
"WARC-Concurrent-To": "<urn:uuid:02a0d204-d853-4332-b979-ef9af8514c1f>",
"WARC-Date": "2024-09-13T15:07:22Z",
"WARC-IP-Address": "130.73.131.233",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:XZPDWWBOWEMBMXP2E47IGZQFO34NWQWD",
"WARC-Record-ID": "<urn:uuid:0a0e088b-9ee5-472a-b2c4-18bec8b4e3ac>",
"WARC-Target-URI": "https://scipopt.org/doc-3.2.0/html/objvardata_8h_source.php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c2f4f9e6-2fc7-4ab5-9456-ef76977f8131>"
},
"warc_info": "isPartOf: CC-MAIN-2024-38\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-55\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
7,
8,
13,
14,
50,
51,
64,
102,
184,
192,
245,
298,
306,
358,
398,
406,
479,
488,
558,
635,
644,
727,
731,
756,
804,
836,
843,
847,
974,
978,
1011,
1044,
1048,
1052,
1074,
1078,
1104,
1141,
1145,
1163,
1168,
1172,
1221,
1227,
1346,
1468,
1500,
1506,
1558,
1565,
1570,
1581,
1612,
1618,
1624,
1628,
1650,
1676,
1682,
1688,
1692,
1801,
1807,
1917,
2028,
2138,
2246,
2267,
2274,
2318,
2396,
2402,
2426,
2448,
2454,
2458,
2556,
2602,
2608,
2671,
2787,
2901,
3011,
3122,
3159,
3274,
3382,
3467,
3474,
3518,
3602,
3693,
3798,
3804,
3828,
3860,
3894,
3898,
3985,
4103,
4110,
4134,
4161,
4166,
4189,
4196,
4201,
4317,
4324,
4430,
4542,
4654,
4763,
4785,
4793,
4838,
4920,
4927,
4952,
4975,
4982,
4987,
5070,
5077,
5190,
5312,
5437,
5449,
5456,
5572,
5689,
5798,
5805,
5848,
5912,
5983,
5991,
6036,
6099,
6161,
6265,
6292,
6398,
6427,
6529,
6616,
6689,
6696,
6721,
6745,
6778,
6801,
6808,
6815,
6820,
6847,
6852,
6857,
6862,
6964,
7048,
7056,
7067,
7112,
7168,
7253,
7304,
7355,
7408,
7460,
7547,
7646,
7715,
7823,
7831,
7836,
7902,
8006,
8093,
8101,
8112,
8157,
8201,
8209,
8214,
8225,
8254,
8283,
8345,
8374,
8387,
8415,
8448,
8475,
8489,
8510,
8541,
8571,
8593,
8621,
8671,
8735,
8752,
8779,
8797,
8818,
8879,
8907,
8932,
8958,
9067,
9095,
9131,
9159,
9177,
9199,
9230,
9256,
9491,
9685,
9714
],
"line_end_idx": [
7,
8,
13,
14,
50,
51,
64,
102,
184,
192,
245,
298,
306,
358,
398,
406,
479,
488,
558,
635,
644,
727,
731,
756,
804,
836,
843,
847,
974,
978,
1011,
1044,
1048,
1052,
1074,
1078,
1104,
1141,
1145,
1163,
1168,
1172,
1221,
1227,
1346,
1468,
1500,
1506,
1558,
1565,
1570,
1581,
1612,
1618,
1624,
1628,
1650,
1676,
1682,
1688,
1692,
1801,
1807,
1917,
2028,
2138,
2246,
2267,
2274,
2318,
2396,
2402,
2426,
2448,
2454,
2458,
2556,
2602,
2608,
2671,
2787,
2901,
3011,
3122,
3159,
3274,
3382,
3467,
3474,
3518,
3602,
3693,
3798,
3804,
3828,
3860,
3894,
3898,
3985,
4103,
4110,
4134,
4161,
4166,
4189,
4196,
4201,
4317,
4324,
4430,
4542,
4654,
4763,
4785,
4793,
4838,
4920,
4927,
4952,
4975,
4982,
4987,
5070,
5077,
5190,
5312,
5437,
5449,
5456,
5572,
5689,
5798,
5805,
5848,
5912,
5983,
5991,
6036,
6099,
6161,
6265,
6292,
6398,
6427,
6529,
6616,
6689,
6696,
6721,
6745,
6778,
6801,
6808,
6815,
6820,
6847,
6852,
6857,
6862,
6964,
7048,
7056,
7067,
7112,
7168,
7253,
7304,
7355,
7408,
7460,
7547,
7646,
7715,
7823,
7831,
7836,
7902,
8006,
8093,
8101,
8112,
8157,
8201,
8209,
8214,
8225,
8254,
8283,
8345,
8374,
8387,
8415,
8448,
8475,
8489,
8510,
8541,
8571,
8593,
8621,
8671,
8735,
8752,
8779,
8797,
8818,
8879,
8907,
8932,
8958,
9067,
9095,
9131,
9159,
9177,
9199,
9230,
9256,
9491,
9685,
9714,
9736
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 9736,
"ccnet_original_nlines": 221,
"rps_doc_curly_bracket": 0.002465080004185438,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19431987404823303,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05231688916683197,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.41056302189826965,
"rps_doc_frac_unique_words": 0.36726999282836914,
"rps_doc_mean_word_length": 5.254148006439209,
"rps_doc_num_sentences": 57,
"rps_doc_symbol_to_word_ratio": 0.004982559941709042,
"rps_doc_unigram_entropy": 5.324909687042236,
"rps_doc_word_count": 1326,
"rps_doc_frac_chars_dupe_10grams": 0.08296254277229309,
"rps_doc_frac_chars_dupe_5grams": 0.2035309374332428,
"rps_doc_frac_chars_dupe_6grams": 0.15271997451782227,
"rps_doc_frac_chars_dupe_7grams": 0.13075928390026093,
"rps_doc_frac_chars_dupe_8grams": 0.10334434360265732,
"rps_doc_frac_chars_dupe_9grams": 0.08296254277229309,
"rps_doc_frac_chars_top_2gram": 0.05339457094669342,
"rps_doc_frac_chars_top_3gram": 0.03215156868100166,
"rps_doc_frac_chars_top_4gram": 0.013779249973595142,
"rps_doc_books_importance": -762.8377685546875,
"rps_doc_books_importance_length_correction": -762.8377685546875,
"rps_doc_openwebtext_importance": -429.46783447265625,
"rps_doc_openwebtext_importance_length_correction": -429.46783447265625,
"rps_doc_wikipedia_importance": -345.71673583984375,
"rps_doc_wikipedia_importance_length_correction": -345.71673583984375
},
"fasttext": {
"dclm": 0.8173182606697083,
"english": 0.5686599016189575,
"fineweb_edu_approx": 2.5120632648468018,
"eai_general_math": 0.7987568974494934,
"eai_open_web_math": 0.37853920459747314,
"eai_web_code": 0.8986406922340393
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "519.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
5,949,996,774,851,725,000 | LIS
2019-5-21
51nod is good.
Edit distance
2019-5-6
I started to learn "Edit distance" though I still can't understand "LCS" enough.We will always encounter some trenches that cannot be crossed. At this time, we need to go around and wait until we are strong enough to solve this problem. This will never be the reason for us to stop.
LCS
2019-5-2
DP is too difficult for me. | {
"url": "https://cndrew.cn/tags/51nod/",
"source_domain": "cndrew.cn",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "36706",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O6JIHTQVL3GPLRRLSZUEDFMXEOZEARTO",
"WARC-Concurrent-To": "<urn:uuid:8ae4c44b-4d62-462c-9f61-ae8454b688f3>",
"WARC-Date": "2021-10-19T15:39:15Z",
"WARC-IP-Address": "185.199.108.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:23DKXP5JHB4HVG4UQTAQQ4RJDZTDVSEH",
"WARC-Record-ID": "<urn:uuid:654b4454-4840-461d-86e7-d2d9a8fca135>",
"WARC-Target-URI": "https://cndrew.cn/tags/51nod/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:10d6a0d4-99a4-4d03-9442-e8582acbaff8>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-180\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
4,
5,
15,
16,
31,
32,
33,
47,
48,
57,
58,
341,
342,
343,
347,
348,
357,
358
],
"line_end_idx": [
4,
5,
15,
16,
31,
32,
33,
47,
48,
57,
58,
341,
342,
343,
347,
348,
357,
358,
385
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 385,
"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.3978494703769684,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06451612710952759,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.29032257199287415,
"rps_doc_frac_unique_words": 0.7910447716712952,
"rps_doc_mean_word_length": 4.343283653259277,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.8865184783935547,
"rps_doc_word_count": 67,
"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.0824742317199707,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -35.496665954589844,
"rps_doc_books_importance_length_correction": -35.496665954589844,
"rps_doc_openwebtext_importance": -22.270784378051758,
"rps_doc_openwebtext_importance_length_correction": -22.270784378051758,
"rps_doc_wikipedia_importance": -6.967419624328613,
"rps_doc_wikipedia_importance_length_correction": -6.967419624328613
},
"fasttext": {
"dclm": 0.5947100520133972,
"english": 0.9724622368812561,
"fineweb_edu_approx": 1.1801159381866455,
"eai_general_math": 0.7869475483894348,
"eai_open_web_math": 0.3348020911216736,
"eai_web_code": 0.18134158849716187
}
} | {
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
5,610,842,508,446,078,000 | Over a million developers have joined DZone.
{{announcement.body}}
{{announcement.title}}
Super Fast Estimates of Levenshtein Distance
DZone's Guide to
Super Fast Estimates of Levenshtein Distance
If your application requires a precise LD value, this heuristic isn’t for you, but the estimates are typically within about 0.05 of the true distance, which is more than enough accuracy for some tasks.
· Big Data Zone ·
Free Resource
Hortonworks Sandbox for HDP and HDF is your chance to get started on learning, developing, testing and trying out new features. Each download comes preconfigured with interactive tutorials, sample data and developments from the Apache community.
This simple heuristic estimates the Levenshtein Distance (LD) of large sequences as much as tens of thousands of times faster than computing the true LD. In exchange for a certain loss of precision, this extends the size range over which LD is practical by a factor of a few hundred X, making it useful for comparing large text documents such as articles, Web pages, and books.
I612H
Equally importantly, the estimates are computed from relatively small signatures, which means that it is not necessary to have the documents to be compared on hand at the time the estimate is computed.
The signatures can also be used to estimate approximately where and how the sequences differ. This allows finer distinctions to be made about near duplication, for instance, is one document embedded in the other, or are many small difference sprinkled throughout?
If your application requires a precise LD value, this heuristic isn’t for you, but the estimates are typically within about 0.05 of the true distance, which is more than enough accuracy for such tasks as:
• Confirming suspected near-duplication.
• Estimating how much two document vary.
• Filtering through large numbers of documents to look for a near-match to some substantial block of text.
If anyone else implements this, I’d love to hear about your results.
Levenshtein Distance
If you’ve read this far, you probably already know what LD is, so I’ll only give a brief reminder here of what it does, and nothing about how it works. You can find all that in Wikipedia if you are interested, but you don’t need to understand how LD itself is computed to see how the heuristic works.
Quickly, LD is a measure of the similarity of two sequences. Sometimes it is called “edit distance” because the LD of two strings is the number of single-character edits that it would take to turn the first string into the second. For example, the LD of CAT and HAT is one, because changing the C to an H turns CAT into HAT. CATS and CAT also have an LD of one, because dropping the S does the trick. CATS and HAT have an LD of two.
The Problem
The algorithm for computing LD is fast enough for small strings, but its run-time grows in proportion to the product of the lengths of the two strings. This may not sound too bad, but this table shows how quadratic growth works out for text documents of increasing size. These results are for single threaded processing and do not include reading the documents from disk, which would overwhelm processing time for small strings. For scale, 10K characters could be a medium sized Web page, 50K an eight-page article and 1M characters, a book. This article is about 17,500 characters.
Length Size Increase Time Runtime Increase Per Sec
100 1 100μ sec. 1 20,000
10K 100 0.5 sec. 10,000 2
50K 500 12.5 sec 25,000 0.125
1M 10,000 16.6 min. 100,000,000 0.001
My machine actually won’t compute LD on pairs of 50K strings because it runs out of memory at somewhere above 30K or so. One MB files are 33X as large, putting them completely beyond the pale.
The Estimating Heuristic
The idea behind the estimating heuristic is simple. We approximate the LD of a pair of strings by compressing them, taking the LD of the compressed signatures, and multiplying the result by the compression rate.
The compression method used is extreme and not reversible—you’ll typically compress the inputs by a factor of between 50x to 250x or more for text. Using a middle value of 150X, a 20KB document yields a signature of about 133 characters. LD runs faster on the signatures by a factor that is the square of the compression rate, so, in this case, it is about 150×150=22,500 times faster than computing the true value. The basic trade-off is that smaller signatures are faster but less accurate.
What Might This Be Good For?
Here’s an example. Web crawlers gather billions of pages from across the Web so that they can be indexed. The pages often exist in multiple nearly identical versions, so for both economy of processing and so that users don’t get back many links to the same document, the near-duplicates need to be identified and ignored.
This is surprisingly difficult to do. This paper explains how Google does it, but what is of interest here is that the algorithm has a 25% false positive rate. This is bad because a match means a document has already been indexed, and can be ignored. As it would be prohibitively costly to pull all the apparent matches from across the Web to verify that they are near-duplicates, it is necessary to settle for either failing to index a lot of documents or compromising on how many redundant results are indexed. The technique described here could verify the matches at a cost that is negligible compared to the total effort per page crawled.
Other Uses
The usefulness of the signatures is not strictly limited to estimating LD. The differences in the signatures are located in approximately the same relative positions as the differences in the original documents. Either alone or in combination with the LD, this can tell you a lot about the relationship between two similar documents without the need to examine the documents themselves. For instance, If two signatures differ at the beginning and the end, it is probable that the same block of text is simply embedded in two different pages.
If the differences are sprinkled throughout, but the LD is too small to be consistent with random files, then they are probably different versions of the same document. An good example of this showed up in tests when comparing a modern translation of Dante’s Inferno to several thousand random books from the Gutenberg book set. Mutilated versions of the original had been added to the test set. No spurious matches were identified, but legitimate matches included some surprises. The algorithm recognized the similarity of:
• The original text.
• The mutilated versions.
• The three volume set including Paradiso and Purgatorio.
• The versions of the poem with diacritics included (which results in numerous small changes on every line.)
• A different translation from the Italian done a century earlier.
How Does It Work?
The trick is the compression algorithm, which requires two properties.
• The signature of a string must be the same whether it is compressed by itself or compressed embedded in a larger document.
• The compressed signature must be much smaller than the original.
The first of these is actually impossible, but you can relax it a little to say the signature of a string will be the same except for a limited number of characters at either end.
To derive the signatures, we choose a two values, C and N.
• C is the approximate compression rate. The larger this number, the smaller the signatures. The right choice depends on your goals. If C is too large, too much information will be lost. If it is too small, LD will execute slowly and the signatures will be bulky to store. Values anywhere from 25 to 250 are typical for text.
• N is a neighborhood size. Compression will operate on size-N substrings of the input, beginning with each successive character in the string. The larger the N, the more sensitive the heuristic is to small differences. An N of 6 to 20 usually gets good results for text.
We also choose any convenient alphabet of output characters for the signatures. The set of printable ASCII characters is a good choice because it allows you to inspect the signatures easily. The larger the cardinality of the output alphabet, the higher the entropy of the strings (which is good) but allowing non-alphanumerics can lead to surprises if they happen to be special characters in some processing context. For illustration purposes, we will use the alphanumeric ASCII chars and assume they are stored in a 62 element array of characters called OUTPUT_CHARS.
Signature generation is simple. I won’t include any optimizations here, just the basic idea.
1. P, the current position in the input, is initially zero.
2. Compute H(P), which is the hash of the N-character substring of the input that starts at position P.
3. If H(P) modulo C is not equal to zero (or some other arbitrarily chosen value between 0 and C-1)
• Generate no output.
• If not at the end, increment P and return to step 1.
• If you are at the end, quit.
4. Otherwise, output a single pseudo-random character chosen from OUTPUT_CHARS in such a way that the choice is highly random, but a given H will always result in the same character. For concreteness, let’s say we emit the character in OUTPUT_CHARS that is at the index H(P) modulo OUTPUT_CHARS.length().
5. If you are not at the end, increment P and go to step 1.
6. Otherwise, quit.
That’s all there is to generating signatures. The value for N should be big enough that H(p) gives diverse values, but not so big that a tiny difference will bleed out over a large expanse of the text; sizes from six to 20 seem to work fine.
The effect of C is not only to shrink the strings by ignoring all but 1/c of the H values, but to ensure that most minor differences are suppressed.
Some Real Examples
Below are the first 100 characters of signatures generated for 25 Gutenberg books. The first dozen bytes have recognizable similarities across all signatures, but are exactly alike in only two. This is because every Gutenberg book starts with a big slab of semi-standard boilerplate disclaimers, copyright information etc. that is never exactly the same, and also contains a small amount of information about the specific book.
Notice also that there are several pairs of lines that are almost identical to each other—the last two, for instance. These are identical for the first 30 or so characters, then get slightly more different towards the end. That’s because they are the same book, with almost identical boilerplate, but one has the diacritical marks and the other doesn’t. This creates a few once character differences per line, but the signature generation washes most of them out, resulting in fairly similar signatures.
RQNXXjCAovG2QEv29jR35fsCX5uZuaAfQIAouECef7jauXC2VGNTQ2NeKAZfAuA5o72GC9VR9xsXZ9Ijb5vXI7fmZy7N7Tm7e7I5
3eRAx9RQNVeoC9Ze9o37RKE5e9eGqVjGC9oERe9b9KZmuuev3NqaabCaV9oIuG7G2yX22C9K2fbNXajGIVx9GesoNmERTE5CbXuX
9RQNeQm9jTK3E7C3Zm93Zbb7TVTjjyQxfbjeqRbamEmvCqCsjGmso9oC9sTGAqZ7RNTsXfN7oQRV7NXX7GXEj2yVqbmj7EGQomvK
x9RQNVsfEjbX7aKyoVaNI7yojuQu5TuK3fNKZXaQXy9fEbxajeVC9xuC3uNxy7RT3xIubjXvf7baXVeX2QAqvQbKZQ2ZNRs5yjGy
x9RQNV9sEX7x9jEIfXKIjbKC2CassqasouV5RT3Kv3aVsEmGoo9uxeGCvI279fTA2INmGmseuAe9uRqITmQjbyZ3uaQV35AuKou9
Ax9RQNEAR5x9GI2Aa95ZRex9QIQEu9XQQ7eG7TuqNqjj5KK5A93VxbGoayaayCEqEXGAaICfx9bVGIaaCK9aCqyCfNmaCCqQuNVu
Ax9RQNuefX9jxeXq2jAe53TIomKZsjZuEZxmKxsau2Z7yCmouVAufjoeK2GeN7Ix7Tb9oxye3XTToqK2ZC3aj3K2Vf35XjQ9y9VX
x9RQNXxEu9KGj99TqCCVA2CGExNRTe9NZAIfZTuajG3vjIa2A25qAb7qmVq2abeNANVGuIaEKEC7IGG5feEoeTy3ZAAQKVqNxvCR
RQNaTNs9j3aoGa9fG2bNVZyE3CTaZfaRo7TCajyIvxeGZ35eqNIsyT3mCG5oeQ7ZfXxCCT9v7AAo23veEombVaTjjbG3bXousN5Q
x9RQNV59KGjT9AfCvssfyKEs5fEfQEIabGvv3o9V9syeQa7o7veKaTxa3Q3V9smKVoquCNvff7aaRNCEGbXjxTIe7EEZNEsb9Zu3
RQNVm39jVm5mu9eRsbQ3Vqf5K29aKCyayxsjqGZKfbX9xy5x9aauCR9TuKE2a3RuCNNmQmmTjmGVuT3GTeEuCm3eVvvmyRKRafyx
x9RQNZa9KGjZjKK7AQ53CGTGEyERyATVbRRyGNNaETGZVbuNVXC73bTAmvVoxV3qaaKaE7yomTN9ZVNVCsfGjNyIyAV2ICxVsGZV
RQ5ym939KGjTVsfvNCsGxX2vKNVN9yqZE95EfxvGq3E5AVvjoITI59CVve7ZZv22sNXsI7A5fabEKase9ysQEN579NAXAbuINejZ
yKAx9RQZ9ZIxQGI5q2ZsjmIRXEfsZINx95soxXAuXyCQCoQN7oTojNVyK3fo3qbusKmqxmyyo7VA2TusEE5f9Z9sTEXxNAfmjyqv
9RQRqQZ9KGjqyqbbqIfRAKumeseoEoqTEfCyE3XXXIR3G5TA7AImmyqVV597v9uZoZvsK5ZCQ9Zj7q975CAausjGvKq99bsfGTCZ
9RQ29juK2X7a7bxvmRyGVZQ75sTaZqCIbxfRX5ReGbeRvjmRsCKTbReuGR5Rq7sZV3VAxaxZXxQ5ybqjqm75q3VaRRmXumIXCsju
9RQRX9jZZIXZKKevNfvmIVRoVuxqxVaCQaoEoTNvv2X9AvqqofQe739N7sV5X5XRIo2TRffqNGIyK9jXa9RaE7jRq5T3jQbfxvC2
RQTeEI9j7AsCQVVC5fZAyAyAxxoG9Xa9mGIR3b2ZAyQRNqof9IvxbVZ339oGVAyaCXbKmo5yf3Z7RZas55VxTsI22efjbufasNGQ
Ax9RQ5bvqj9jf5Io5NG377o73RKm5A7yGxb7Ne5Qv5vv9muqQTx2uR7E3bjbGyyQ7RvoQa2omyj2joKGo9uxjeAbGufRCGuyQuG2
9RQ3aQKK9jyQjIC73m5RX75AoauXeKx2mQIT5aqxxxuVsTfuAGq72sACG3asGQRNN5GsN2NEjbu3yNvKsoXuj7mqVKXKqIfvKbXq
9RQ3aK9jyQjIC73m5RX75AoauXeKx2mQIT5aqxxxuVsTfuAGq72sACG3asGQRNN5GsN2NEjbu3yNvKsoT3v7mZEaNQX2a7NZxs7j
j72Ax9RQEj3jKu9yZ9sEVf2qZEx7E9yCfxj5vfs5ZRIIfxI2fXNAVqXmvKuRse37VQvbyVfqbQe332jqeINfNNmNXGCqNeCevbym
Ax9RQE3jKu9myZ9EV2qKEsEC7f5X5Txv5KZsfmCT23fNQGmGKuQe7VQvyV7fqb32jqeIIfNNmTGCNNe3vbqQ3bqZ5RfC3byKyKjR
9RQba9jybjjsVjQqqIVba5yCjEANaIATIQma5N92AmAK5XjZ953XfvsQN7GEZ5uqay55EZ2R3NCA2NsXERsEaoVZG75xKq5s5Ts3
9RQba9jybjjsVjQqqIVba5yCjEANaIATIQm592AmAK5XjZ953XfvsQN7GEZ5uqay55EZ2R3NCA2NsXERsEaoVZG75xKq5s5Ts3je
For some applications, you need to know the expected LD of random strings of text of a given length. For instance, if you are trying spot distantly related texts, a result that is only sligthly lower than expected can be significant. The expected-LD function must be calibrated empirically because real text is far from random, and deviates from randomness in an application-dependent way.
Depending upon your goals, you can use a variety of criteria to interpret the LD value. In the Web crawler example, you might want to subtract the difference in length of the two signatures (adjusted by the expected-LD function) from the LD, then compute the ratio of the remaining quantity and the length of the smaller string. Any ratio above some arbitrarily chosen constant would constitute confirmation of near duplication.
How Well Does It Work?
These results are from a brain-dead simple implementation along the lines described above. The first table below shows the signature size and the processing rate for two different file sizes and a range of values of C. I ran them on a 2015 MacBook Pro. Any of these compression factors could be reasonable depending on the application.
C File Size Signature Size LD estimates/sec
25 4,865 181 8,000
50 4,865 98 30,300
100 4,865 59 90,909
200 4,865 28 250,000
25 27,478 940 280
50 27,478 514 1,048
100 27,478 305 2,932
200 27,478 195 11,627
The table below gives some example accuracy estimates with C set to 100. Texts include unrelated documents, identical documents, and originally identical documents subjected to a lot of changes. You can get a good idea of the actual similarity of the file by looking at the original LD values. Comparing the estimate of LD to the true value tells you how well it is working.
Text File Sizes Sig Sizes LD sig LD actual Est Err
Unrelated 27,478/23,932 366/419 366 20,706 24,002 0.1200
Identical 27,620/27,620 305/305 0 0 0 0.0
Mangled 4,865/2,404 34/61 27 2,461 2,153 0.0632
50/173 lines deleted 4,865/2,474 27/61 34 2,391 2,711 0.065
A few changes 4,865/4,801 59/61 3 64 239 0.036
Cross Computing
If you compare a file to a version of itself that has been cut into several big blocks and rearranged, the true edit distance will be misleadingly high (i.e. the files will seem dissimilar) because LD works at the single-character level.
This behavior can be improved upon by cutting each signature into blocks of a fixed size, and cross-comparing the blocks to find the best match for each block in one signature to some block in the other. If the first signature has M blocks and the second has N, this is a total of N * M block comparisons.
That sounds like a lot, but the size of the blocks shrinks in inverse proportion, resulting in a commensurate decrease in the cost of each comparison. Therefore, the total cost is about the same as it would be for a straight-up LD computation on the intact signatures.
The caveat is that the accuracy goes down somewhat as the number of blocks increases.
This can be used in several ways, for example:
• You can get a better idea of the total similarity of two files by summing the lowest LD obtained for each block in one of the signatures.
• The results can be focussed by allowing disregarding of some number of blocks, e.g., consider only the best K blocks, where K is the number of blocks in the smaller signature, minus two.
Scanning at Multiple Compression Rates
Large compression rates result in small signatures and a much faster LD estimate, but the smaller the signature, the more information is lost, and the less accurate is the result.
You can have your cake and eat it too by computing more than one signature for a given document. Small signatures can be compared first to separate the sheep from the goats quickly, and the larger signatures compared only for pairs for which the first test indicates a reasonably high degree of similarity.
Entropy
The per-character entropy of the 32K Gutenberg documents averages 4.45637 bits, but with some variance. The majority of the documents score fairly close to 4.5, but a few have entropy greater than 5.1 or less than 4.0.
The average entropy of the signatures at any level of compression tested is only slightly higher than the entropy of the raw text. This tells you that the compression is tracking the raw text pretty closely in terms of predictability of characters. That’s a good thing.
The average entropy goes down slightly as the compression increases, ranging from 4.93989 for 50X compression to 4.87675 for 350X. This means that the signatures are getting slightly less meaningful as the compression rate gets high, but not by a great amount.
Interestingly, however, within a given compression rate, the entropy of a text rarely diverges from the average by more than a few 100’th of a bit. In contrast, the entropy of the raw documents varies by as much as a bit per character. This indicates that the compression is pretty good at washing out the non-textual anomalies that cause files to deviate from the entropy typical of text. This makes sense because the anomalies that reduce entropy are typically repetitions, only a few of which will happen to result in output characters.
The following table gives the average per-character entropy for the raw files and for signatures computed for 32,000 documents using compression factors of 50, 100, 150, 200, 250, 300, and 350. The raw files are mostly between 50K and 400K characters long, but can be as small as 10K and as large as 1100K
Raw c=50 c=100 c=150 c=200 c=250 c=300 c=350
4.45637 4.93989 4.92783 4.92138 4.91678 4.89277 4.89741 4.87674
Alternatives
It is worth noting that there are other ways to make computing LD faster, notably the enhancement by Ukkonen, which is linear time with respect to the input sizes, and increases in runtime non-linearly only with the size of the LD of the documents. (The details are a little more complex, but that’s the idea.)
This is very useful, but it’s worth keeping in mind that the estimate presented here has a head-start of a factor of c on Ukkonen’s linear-time performance. This will usually more than offset any speed advantage of Ukkoonen even when applied to near duplicates, and should almost always be much faster for document pairs with large differences.
If your application will not be able to amortize the linear-time cost of reading the strings, Ukkonen may be a reasonable choice, but its best use might be applying it to the signatures rather than on the original document. The performance on the signatures would be no worse than simple LD for the case of very different documents, and radically better for the case where the documents are very similar (which is likely to be the most common case.)
Hortonworks Community Connection (HCC) is an online collaboration destination for developers, DevOps, customers and partners to get answers to questions, collaborate on technical articles and share code examples from GitHub. Join the discussion.
Topics:
small ,computing ,faster ,values ,estimate ,value
Published at DZone with permission of
Opinions expressed by DZone contributors are their own.
{{ parent.title || parent.header.title}}
{{ parent.tldr }}
{{ parent.urlSource.name }} | {
"url": "https://dzone.com/articles/super-fast-estimates-of-levenshtein-distance",
"source_domain": "dzone.com",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "159903",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EOLISKZIVRGACNJB4ZBR2IGI3VW3Q2Y3",
"WARC-Concurrent-To": "<urn:uuid:09638381-b6d3-443f-a277-456f784b264c>",
"WARC-Date": "2018-11-15T21:03:22Z",
"WARC-IP-Address": "34.198.176.72",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HJ7UDSW5LLPSU4JZWND56FM5PLH2YDT3",
"WARC-Record-ID": "<urn:uuid:a51c3e9e-e7c6-4e94-b22f-ea9c1627f6c7>",
"WARC-Target-URI": "https://dzone.com/articles/super-fast-estimates-of-levenshtein-distance",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:893d4695-0883-4367-b36c-e1a35d9c1bdd>"
},
"warc_info": "isPartOf: CC-MAIN-2018-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-237-21-139.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,
45,
67,
90,
91,
136,
137,
154,
155,
200,
201,
403,
404,
422,
436,
437,
683,
684,
1062,
1063,
1069,
1070,
1272,
1273,
1537,
1538,
1743,
1744,
1787,
1830,
1939,
1940,
2009,
2010,
2031,
2032,
2333,
2334,
2769,
2770,
2782,
2783,
3367,
3368,
3419,
3444,
3470,
3500,
3538,
3539,
3732,
3733,
3758,
3759,
3971,
3972,
4465,
4466,
4495,
4496,
4819,
4820,
5463,
5464,
5475,
5476,
6018,
6019,
6545,
6546,
6569,
6597,
6657,
6768,
6837,
6838,
6856,
6857,
6928,
6929,
7056,
7125,
7126,
7306,
7307,
7366,
7367,
7695,
7970,
7971,
8540,
8541,
8634,
8635,
8697,
8803,
8905,
8931,
8990,
9025,
9332,
9394,
9416,
9417,
9659,
9660,
9809,
9810,
9829,
9830,
10258,
10259,
10764,
10765,
10866,
10967,
11068,
11169,
11270,
11371,
11472,
11573,
11674,
11775,
11876,
11977,
12078,
12179,
12280,
12381,
12482,
12583,
12684,
12785,
12886,
12987,
13088,
13189,
13290,
13291,
13681,
13682,
14112,
14113,
14136,
14137,
14475,
14476,
14520,
14539,
14558,
14578,
14599,
14617,
14637,
14658,
14680,
14681,
15056,
15057,
15108,
15165,
15207,
15255,
15315,
15362,
15363,
15379,
15380,
15618,
15619,
15926,
15927,
16197,
16198,
16284,
16285,
16332,
16333,
16475,
16666,
16667,
16706,
16707,
16887,
16888,
17196,
17197,
17205,
17206,
17425,
17426,
17696,
17697,
17958,
17959,
18499,
18500,
18806,
18807,
18852,
18916,
18917,
18930,
18931,
19244,
19245,
19590,
19591,
20042,
20043,
20290,
20291,
20299,
20349,
20350,
20388,
20389,
20445,
20446,
20487,
20488,
20506,
20507
],
"line_end_idx": [
45,
67,
90,
91,
136,
137,
154,
155,
200,
201,
403,
404,
422,
436,
437,
683,
684,
1062,
1063,
1069,
1070,
1272,
1273,
1537,
1538,
1743,
1744,
1787,
1830,
1939,
1940,
2009,
2010,
2031,
2032,
2333,
2334,
2769,
2770,
2782,
2783,
3367,
3368,
3419,
3444,
3470,
3500,
3538,
3539,
3732,
3733,
3758,
3759,
3971,
3972,
4465,
4466,
4495,
4496,
4819,
4820,
5463,
5464,
5475,
5476,
6018,
6019,
6545,
6546,
6569,
6597,
6657,
6768,
6837,
6838,
6856,
6857,
6928,
6929,
7056,
7125,
7126,
7306,
7307,
7366,
7367,
7695,
7970,
7971,
8540,
8541,
8634,
8635,
8697,
8803,
8905,
8931,
8990,
9025,
9332,
9394,
9416,
9417,
9659,
9660,
9809,
9810,
9829,
9830,
10258,
10259,
10764,
10765,
10866,
10967,
11068,
11169,
11270,
11371,
11472,
11573,
11674,
11775,
11876,
11977,
12078,
12179,
12280,
12381,
12482,
12583,
12684,
12785,
12886,
12987,
13088,
13189,
13290,
13291,
13681,
13682,
14112,
14113,
14136,
14137,
14475,
14476,
14520,
14539,
14558,
14578,
14599,
14617,
14637,
14658,
14680,
14681,
15056,
15057,
15108,
15165,
15207,
15255,
15315,
15362,
15363,
15379,
15380,
15618,
15619,
15926,
15927,
16197,
16198,
16284,
16285,
16332,
16333,
16475,
16666,
16667,
16706,
16707,
16887,
16888,
17196,
17197,
17205,
17206,
17425,
17426,
17696,
17697,
17958,
17959,
18499,
18500,
18806,
18807,
18852,
18916,
18917,
18930,
18931,
19244,
19245,
19590,
19591,
20042,
20043,
20290,
20291,
20299,
20349,
20350,
20388,
20389,
20445,
20446,
20487,
20488,
20506,
20507,
20534
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 20534,
"ccnet_original_nlines": 223,
"rps_doc_curly_bracket": 0.0009739900124259293,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4136069118976593,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03239741176366806,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1954643577337265,
"rps_doc_frac_unique_words": 0.3087226450443268,
"rps_doc_mean_word_length": 5.499509811401367,
"rps_doc_num_sentences": 193,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.8059515953063965,
"rps_doc_word_count": 3061,
"rps_doc_frac_chars_dupe_10grams": 0.018296310678124428,
"rps_doc_frac_chars_dupe_5grams": 0.03611737862229347,
"rps_doc_frac_chars_dupe_6grams": 0.029464179649949074,
"rps_doc_frac_chars_dupe_7grams": 0.021147679537534714,
"rps_doc_frac_chars_dupe_8grams": 0.018296310678124428,
"rps_doc_frac_chars_dupe_9grams": 0.018296310678124428,
"rps_doc_frac_chars_top_2gram": 0.009801589883863926,
"rps_doc_frac_chars_top_3gram": 0.0020791299175471067,
"rps_doc_frac_chars_top_4gram": 0.0026731600519269705,
"rps_doc_books_importance": -1931.8592529296875,
"rps_doc_books_importance_length_correction": -1931.8592529296875,
"rps_doc_openwebtext_importance": -813.4501953125,
"rps_doc_openwebtext_importance_length_correction": -813.4501953125,
"rps_doc_wikipedia_importance": -546.2949829101562,
"rps_doc_wikipedia_importance_length_correction": -546.2949829101562
},
"fasttext": {
"dclm": 0.40788334608078003,
"english": 0.8750098347663879,
"fineweb_edu_approx": 2.5720314979553223,
"eai_general_math": 0.9818969964981079,
"eai_open_web_math": 0.6354072093963623,
"eai_web_code": 0.7497903108596802
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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 |
-8,510,566,587,437,388,000 | Remove K9-MacOptimizer from your operating system
Also Known As: K9-MacOptimizer potentially unwanted application
Type: Mac Virus
Distribution: Low
Damage level: Medium
How to remove "K9-MacOptimizer" from Mac computers
What is "K9-MacOptimizer"?
K9-MacOptimizer is software endorsed as an optimizer for the Mac operating system. It is supposedly capable of freeing-up space on the hard drive by removing "junk" and temporary files, securely deleting sensitive and confidential data, etc. K9-MacOptimizer is classified as a Potentially Unwanted Application (PUA) due to its dubious distribution methods. I.e., most users are tricked into installing this app, and it is often distributed together with other software. This deceptive marketing method of pre-packing regular content with PUAs is called "bundling".
K9-MacOptimizer scam
When installed, K9-MacOptimizer runs a system scan and detects various 'issues'. When users attempt to remove these issues, they find that they are required to purchase the activation key. I.e., in effect, purchase K9-MacOptimizer. PUAs can never be trusted. In most cases, these applications are untrusted and nonoperational. Even if purchased, they are unable to perform the advertised functions. Note that apps such as K9-MacOptimizer are often distributed together with other PUAs (e.g. browser hijackers and/or adware). In fact, unwanted applications cause numerous problems and are a threat to device and user safety. PUAs generate redirects to sale-oriented, untrustworthy, compromised, and even malicious websites. Additionally, they run intrusive advertisement campaigns. By implementing various tools, they enable third party graphical content to be displayed on any site. In this way, they deliver ads (pop-ups, banners, surveys, coupons, etc.), which diminish the browsing experience by overlaying web page content and limiting browsing performance. Some PUAs have data tracking abilities. They monitor browsing activity (URLs visited, pages viewed, search engine history, etc.) and gather personal information (IP addresses, geolocations, and personal details). This private data is then shared with third parties (potentially, cyber criminals) seeking to misuse it for financial gain. To summarize, PUAs can cause browser and system infiltration/infections and lead to serious privacy issues, financial loss, and even identity theft. To ensure device integrity and user safety, remove all dubious applications and browser extensions/plug-ins immediately.
Threat Summary:
Name K9-MacOptimizer potentially unwanted application
Threat Type PUP (potentially unwanted program), PUA (potentially unwanted application), Mac malware, Mac virus
Detection Names Avast (MacOS:Tuneupmac-B [Tool]), BitDefender (Gen:Variant.Application.MAC.OSX.MCPlus.1), Emsisoft (Gen:Variant.Application.MAC.OSX.MCPlus.1 (B)), ESET-NOD32 (A Variant Of OSX/TuneupMyMac.B Potentially Unwanted), Full list of detections (VirusTotal)
Symptoms Your Mac becomes slower than normal, you see unwanted pop-up ads, you are redirected to dubious websites.
Distribution methods Deceptive pop-up ads, free software installers (bundling), fake flash player installers, torrent file downloads.
Damage Internet browser tracking (potential privacy issues), display of unwanted ads, redirects to dubious websites, loss of private information.
Malware Removal (Mac)
To eliminate possible malware infections, scan your Mac with legitimate antivirus software. Our security researchers recommend using Combo Cleaner.
▼ Download Combo Cleaner for Mac
To use full-featured product, you have to purchase a license for Combo Cleaner. Limited three days free trial available.
Most PUAs share certain traits, and those apps released by the same developers might even be identical. Mac Speedup Pro, MacOptimizer, and Mac Space Reviver are just some examples of applications similar to K9-MacOptimizer. They typically seem legitimate and offer various features, ranging from system cleaners and optimizers to content providers (e.g. TV, movie, radio, music, etc.). While these features may sound useful and beneficial, they are used to lure people to install. The advertised features are usually nonfunctional. The only purpose of PUAs is to generate revenue for the designers, whilst regular users receive nothing. Rather than delivering any value, PUAs cause redirects, deliver ad campaigns, and track vulnerable data.
How did potentially unwanted applications install on my computer?
Some PUAs, such as K9-MacOptimizer, have "official" websites, on which they are often advertised as "free" and "useful" software. As well as these deceptive sites, unwanted applications also proliferate through scam pages, which warn users of so-called 'threats' detected on their systems and endorse bogus tools for their removal. PUAs also proliferate via the download/install set-ups of other programs. This deceptive marketing technique ("bundling") is very popular amongst developers of unwanted and malicious content. Rushing download/installation processes (e.g. ignoring terms, skipping steps and sections, using pre-set options, etc.) endangers devices with potential system infiltration and infections. Intrusive advertisements are also known to proliferate PUAs. Once clicked, they execute scripts designed to make these rogue downloads/installs.
How to avoid installation of potentially unwanted applications
You are advised to research software and content to verify its legitimacy, before downloading/installing. Only trustworthy and verified download channels should be used. Peer-to-Peer sharing networks, unofficial and free file-hosting websites, third party downloaders, and similar sources are often untrustworthy and should not be used. Download and installation processes should be treated with caution. Read the terms, explore possible options, use the "Custom/Advanced" settings, and opt-out of downloading/installing additional apps, tools, features, etc. Intrusive advertisements usually seem legitimate and harmless, however, they often redirect to dubious web pages (e.g. gambling, pornography, adult-dating, etc.). If you encounter these ads/redirects, check the device and remove all suspicious applications and/or browser extensions/plug-ins without delay. If your computer is already infected with PUAs, we recommend running a scan with Combo Cleaner Antivirus for macOS to automatically eliminate them.
Screenshot of "K9-MacOptimizer" installer:
K9-MacOptimizer installer
Website promoting "K9-MacOptimizer":
K9-MacOptimizer promoter
Appearance of "K9-MacOptimizer" scam (GIF):
Appearance of K9-MacOptimizer scam (GIF)
Instant automatic Mac malware removal: Manual threat removal might be a lengthy and complicated process that requires advanced computer skills. Combo Cleaner is a professional automatic malware removal tool that is recommended to get rid of Mac malware. Download it by clicking the button below:
▼ DOWNLOAD Combo Cleaner for Mac By downloading any software listed on this website you agree to our Privacy Policy and Terms of Use. To use full-featured product, you have to purchase a license for Combo Cleaner. Limited three days free trial available.
Quick menu:
Video showing how to remove K9-MacOptimizer unwanted application using Combo Cleaner:
Potentially unwanted applications removal:
Remove potentially unwanted applications from your "Applications" folder:
mac browser hijacker removal from applications folder
Click the Finder icon. In the Finder window, select "Applications". In the applications folder, look for "MPlayerX","NicePlayer", or other suspicious applications and drag them to the Trash. After removing the potentially unwanted application(s) that cause online ads, scan your Mac for any remaining unwanted components.
Remove k9-macoptimizer potentially unwanted application related files and folders:
Finder go to folder command
Click the Finder icon, from the menu bar. Choose Go, and click Go to Folder...
step1Check for adware-generated files in the /Library/LaunchAgents folder:
removing adware from launch agents folder step 1
In the Go to Folder... bar, type: /Library/LaunchAgents
removing adware from launch agents folder step 2
In the “LaunchAgents” folder, look for any recently-added suspicious files and move them to the Trash. Examples of files generated by adware - “installmac.AppRemoval.plist”, “myppes.download.plist”, “mykotlerino.ltvbit.plist”, “kuklorest.update.plist”, etc. Adware commonly installs several files with the same string.
step2Check for adware generated files in the /Library/Application Support folder:
removing adware from application support folder step 1
In the Go to Folder... bar, type: /Library/Application Support
removing adware from application support folder step 2
In the “Application Support” folder, look for any recently-added suspicious folders. For example, “MplayerX” or “NicePlayer”, and move these folders to the Trash.
step3Check for adware-generated files in the ~/Library/LaunchAgents folder:
removing adware from ~launch agents folder step 1
In the Go to Folder bar, type: ~/Library/LaunchAgents
removing adware from ~launch agents folder step 2
In the “LaunchAgents” folder, look for any recently-added suspicious files and move them to the Trash. Examples of files generated by adware - “installmac.AppRemoval.plist”, “myppes.download.plist”, “mykotlerino.ltvbit.plist”, “kuklorest.update.plist”, etc. Adware commonly installs several files with the same string.
step4Check for adware-generated files in the /Library/LaunchDaemons folder:
removing adware from launch daemons folder step 1
In the Go to Folder... bar, type: /Library/LaunchDaemons
removing adware from launch daemons folder step 2
In the “LaunchDaemons” folder, look for recently-added suspicious files. For example “com.aoudad.net-preferences.plist”, “com.myppes.net-preferences.plist”, "com.kuklorest.net-preferences.plist”, “com.avickUpd.plist”, etc., and move them to the Trash.
step 5 Scan your Mac with Combo Cleaner:
If you have followed all the steps in the correct order you Mac should be clean of infections. To be sure your system is not infected run a scan with Combo Cleaner Antivirus. Download it HERE. After downloading the file double click combocleaner.dmg installer, in the opened window drag and drop Combo Cleaner icon on top of the Applications icon. Now open your launchpad and click on the Combo Cleaner icon. Wait until Combo Cleaner updates it's virus definition database and click "Start Combo Scan" button.
scan-with-combo-cleaner-1
Combo Cleaner will scan your Mac for malware infections. If the antivirus scan displays "no threats found" - this means that you can continue with the removal guide, otherwise it's recommended to remove any found infections before continuing.
scan-with-combo-cleaner-2
After removing files and folders generated by the adware, continue to remove rogue extensions from your Internet browsers.
K9-MacOptimizer potentially unwanted application removal from Internet browsers:
safari browser iconRemove malicious extensions from Safari:
Remove k9-macoptimizer potentially unwanted application related Safari extensions:
safari browser preferences
Open Safari browser, from the menu bar, select "Safari" and click "Preferences...".
safari extensions window
In the preferences window, select "Extensions" and look for any recently-installed suspicious extensions. When located, click the "Uninstall" button next to it/them. Note that you can safely uninstall all extensions from your Safari browser - none are crucial for normal browser operation.
• If you continue to have problems with browser redirects and unwanted advertisements - Reset Safari.
firefox browser iconRemove malicious plug-ins from Mozilla Firefox:
Remove k9-macoptimizer potentially unwanted application related Mozilla Firefox add-ons:
accessing mozilla firefox add-ons
Open your Mozilla Firefox browser. At the top right corner of the screen, click the "Open Menu" (three horizontal lines) button. From the opened menu, choose "Add-ons".
removing malicious add-ons from mozilla firefox
Choose the "Extensions" tab and look for any recently-installed suspicious add-ons. When located, click the "Remove" button next to it/them. Note that you can safely uninstall all extensions from your Mozilla Firefox browser - none are crucial for normal browser operation.
• If you continue to have problems with browser redirects and unwanted advertisements - Reset Mozilla Firefox.
chrome-browser-iconRemove malicious extensions from Google Chrome:
Remove k9-macoptimizer potentially unwanted application related Google Chrome add-ons:
removing malicious google chrome extensions step 1
Open Google Chrome and click the "Chrome menu" (three horizontal lines) button located in the top-right corner of the browser window. From the drop-down menu, choose "More Tools" and select "Extensions".
removing malicious Google Chrome extensions step 2
In the "Extensions" window, look for any recently-installed suspicious add-ons. When located, click the "Trash" button next to it/them. Note that you can safely uninstall all extensions from your Google Chrome browser - none are crucial for normal browser operation.
• If you continue to have problems with browser redirects and unwanted advertisements - Reset Google Chrome.
About the author:
Tomas Meskauskas
Tomas Meskauskas - expert security researcher, professional malware analyst.
I am passionate about computer security and technology. I have an experience of over 10 years working in various companies related to computer technical issue solving and Internet security. I have been working as an author and editor for pcrisk.com since 2010. Follow me on Twitter and LinkedIn to stay informed about the latest online security threats. Contact Tomas Meskauskas.
PCrisk security portal is brought by a company RCS LT. Joined forces of security researchers help educate computer users about the latest online security threats. More information about the company RCS LT.
Our malware removal guides are free. However, if you want to support us you can send us a donation.
Malware activity
Global malware activity level today:
Medium threat activity
Increased attack rate of infections detected within the last 24 hours.
QR Code
K9-MacOptimizer potentially unwanted application QR code
A QR code (Quick Response Code) is a machine-readable code which stores URLs and other information. This code can be read using a camera on a smartphone or a tablet. Scan this QR code to have an easy access removal guide of K9-MacOptimizer potentially unwanted application on your mobile device.
We Recommend:
Get rid of Mac malware infections today:
▼ REMOVE IT NOW
Download Combo Cleaner for Mac
Platform: macOS
Editors' Rating for Combo Cleaner:
Editors ratingOutstanding!
[Back to Top]
To use full-featured product, you have to purchase a license for Combo Cleaner. Limited three days free trial available. | {
"url": "https://www.pcrisk.com/removal-guides/16088-k9-macoptimizer-unwanted-application-mac",
"source_domain": "www.pcrisk.com",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "79079",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ICC6YOLAEWMYL667XHD4ZBMW4SQSDRFU",
"WARC-Concurrent-To": "<urn:uuid:f411e5cb-6e07-4c4f-b507-013ebc09d0a7>",
"WARC-Date": "2020-08-12T19:13:05Z",
"WARC-IP-Address": "104.20.17.14",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TIFMBNWFK4KKMQC6MNBA46SQO6RAY4X5",
"WARC-Record-ID": "<urn:uuid:10afdb18-6e46-4922-a923-7337cfef287a>",
"WARC-Target-URI": "https://www.pcrisk.com/removal-guides/16088-k9-macoptimizer-unwanted-application-mac",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:78173981-4a61-44f4-8ccd-6687241df049>"
},
"warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-210.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,
50,
51,
115,
131,
149,
170,
171,
222,
223,
250,
251,
816,
817,
838,
839,
2508,
2509,
2525,
2579,
2690,
2956,
3071,
3205,
3351,
3373,
3374,
3522,
3555,
3676,
3677,
4419,
4420,
4486,
4487,
5345,
5346,
5409,
5410,
6425,
6426,
6469,
6470,
6496,
6497,
6534,
6535,
6560,
6561,
6605,
6606,
6647,
6648,
6944,
7199,
7200,
7212,
7213,
7299,
7300,
7343,
7344,
7418,
7419,
7473,
7474,
7796,
7797,
7880,
7881,
7909,
7910,
7989,
7990,
8065,
8066,
8115,
8116,
8172,
8173,
8222,
8541,
8542,
8624,
8625,
8680,
8681,
8744,
8745,
8800,
8963,
8964,
9040,
9041,
9091,
9092,
9093,
9147,
9148,
9198,
9199,
9518,
9519,
9595,
9596,
9646,
9703,
9704,
9754,
10006,
10007,
10048,
10049,
10559,
10560,
10586,
10587,
10830,
10831,
10857,
10858,
10981,
10982,
11063,
11064,
11124,
11125,
11208,
11209,
11236,
11237,
11321,
11322,
11347,
11348,
11638,
11639,
11743,
11744,
11812,
11813,
11902,
11903,
11937,
11938,
12107,
12108,
12156,
12157,
12431,
12432,
12545,
12546,
12613,
12614,
12701,
12702,
12753,
12754,
12958,
12959,
13010,
13011,
13278,
13279,
13390,
13391,
13409,
13410,
13427,
13428,
13505,
13506,
13886,
13887,
14093,
14094,
14194,
14195,
14212,
14213,
14250,
14251,
14274,
14275,
14346,
14347,
14355,
14412,
14708,
14722,
14723,
14764,
14765,
14781,
14812,
14813,
14829,
14830,
14865,
14892,
14893,
14907,
14908
],
"line_end_idx": [
50,
51,
115,
131,
149,
170,
171,
222,
223,
250,
251,
816,
817,
838,
839,
2508,
2509,
2525,
2579,
2690,
2956,
3071,
3205,
3351,
3373,
3374,
3522,
3555,
3676,
3677,
4419,
4420,
4486,
4487,
5345,
5346,
5409,
5410,
6425,
6426,
6469,
6470,
6496,
6497,
6534,
6535,
6560,
6561,
6605,
6606,
6647,
6648,
6944,
7199,
7200,
7212,
7213,
7299,
7300,
7343,
7344,
7418,
7419,
7473,
7474,
7796,
7797,
7880,
7881,
7909,
7910,
7989,
7990,
8065,
8066,
8115,
8116,
8172,
8173,
8222,
8541,
8542,
8624,
8625,
8680,
8681,
8744,
8745,
8800,
8963,
8964,
9040,
9041,
9091,
9092,
9093,
9147,
9148,
9198,
9199,
9518,
9519,
9595,
9596,
9646,
9703,
9704,
9754,
10006,
10007,
10048,
10049,
10559,
10560,
10586,
10587,
10830,
10831,
10857,
10858,
10981,
10982,
11063,
11064,
11124,
11125,
11208,
11209,
11236,
11237,
11321,
11322,
11347,
11348,
11638,
11639,
11743,
11744,
11812,
11813,
11902,
11903,
11937,
11938,
12107,
12108,
12156,
12157,
12431,
12432,
12545,
12546,
12613,
12614,
12701,
12702,
12753,
12754,
12958,
12959,
13010,
13011,
13278,
13279,
13390,
13391,
13409,
13410,
13427,
13428,
13505,
13506,
13886,
13887,
14093,
14094,
14194,
14195,
14212,
14213,
14250,
14251,
14274,
14275,
14346,
14347,
14355,
14412,
14708,
14722,
14723,
14764,
14765,
14781,
14812,
14813,
14829,
14830,
14865,
14892,
14893,
14907,
14908,
15028
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 15028,
"ccnet_original_nlines": 203,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24875445663928986,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021352309733629227,
"rps_doc_frac_lines_end_with_ellipsis": 0.004901960026472807,
"rps_doc_frac_no_alph_words": 0.2199288308620453,
"rps_doc_frac_unique_words": 0.31599417328834534,
"rps_doc_mean_word_length": 5.951871871948242,
"rps_doc_num_sentences": 178,
"rps_doc_symbol_to_word_ratio": 0.0017793599981814623,
"rps_doc_unigram_entropy": 5.7712016105651855,
"rps_doc_word_count": 2057,
"rps_doc_frac_chars_dupe_10grams": 0.1584578901529312,
"rps_doc_frac_chars_dupe_5grams": 0.24462957680225372,
"rps_doc_frac_chars_dupe_6grams": 0.22012579441070557,
"rps_doc_frac_chars_dupe_7grams": 0.1710365116596222,
"rps_doc_frac_chars_dupe_8grams": 0.1584578901529312,
"rps_doc_frac_chars_dupe_9grams": 0.1584578901529312,
"rps_doc_frac_chars_top_2gram": 0.0077595398761332035,
"rps_doc_frac_chars_top_3gram": 0.026954179629683495,
"rps_doc_frac_chars_top_4gram": 0.032345011830329895,
"rps_doc_books_importance": -1221.9307861328125,
"rps_doc_books_importance_length_correction": -1221.9307861328125,
"rps_doc_openwebtext_importance": -690.8941650390625,
"rps_doc_openwebtext_importance_length_correction": -690.8941650390625,
"rps_doc_wikipedia_importance": -387.72998046875,
"rps_doc_wikipedia_importance_length_correction": -387.72998046875
},
"fasttext": {
"dclm": 0.02077407017350197,
"english": 0.8641322255134583,
"fineweb_edu_approx": 1.955698013305664,
"eai_general_math": 0.03509842976927757,
"eai_open_web_math": 0.076740562915802,
"eai_web_code": 0.043861210346221924
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-2,365,338,677,108,425,000 | Description
Do executes the "games.quests.list" call. Exactly one of *QuestListResponse or error will be non-nil. Any non-2xx status code is an error. Response headers are in either *QuestListResponse.ServerResponse.Header or (if a response was returned at all) in error.(*googleapi.Error).Header. Use googleapi.IsNotModified to check whether the returned error was because http.StatusNotModified was returned.
Do is referenced in 1 repository
github.com/google/google-api-go-client
Definition
})
return gensupport.SendRequest(c.ctx_, c.s.client, req)
}
// Do executes the "games.players.get" call.
// Exactly one of *Player or error will be non-nil. Any non-2xx status
// code is an error. Response headers are in either
// *Player.ServerResponse.Header or (if a response was returned at all)
// in error.(*googleapi.Error).Header. Use googleapi.IsNotModified to
// check whether the returned error was because http.StatusNotModified
// was returned.
func (c *PlayersGetCall) Do(opts ...googleapi.CallOption) (*Player, error) {
gensupport.SetOptions(c.urlParams_, opts...)
res, err := c.doRequest("json")
if res != nil && res.StatusCode == http.StatusNotModified {
if res.Body != nil {
res.Body.Close()
}
return nil, &googleapi.Error{
Code: res.StatusCode,
Header: res.Header,
}
}
if err != nil {
return nil, err
}
defer googleapi.CloseBody(res)
if err := googleapi.CheckResponse(res); err != nil {
return nil, err
}
ret := &Player{
ServerResponse: googleapi.ServerResponse{
Header: res.Header,
HTTPStatusCode: res.StatusCode,
},
}
target := &ret
if err := json.NewDecoder(res.Body).Decode(target); err != nil {
return nil, err
}
return ret, nil
// {
// "description": "Retrieves the Player resource with the given ID. To retrieve the player for the currently authenticated user, set playerId to me.",
// "httpMethod": "GET",
// "id": "games.players.get",
// "parameterOrder": [
// "playerId"
// ],
// "parameters": {
// "consistencyToken": {
// "description": "The last-seen mutation timestamp.",
// "format": "int64",
// "location": "query",
// "type": "string"
// },
// "language": {
// "description": "The preferred language to use for strings returned by this method.",
// "location": "query",
// "type": "string"
// },
// "playerId": {
// "description": "A player ID. A value of me may be used in place of the authenticated player's ID.",
// "location": "path",
// "required": true,
// "type": "string"
// }
// },
// "path": "players/{playerId}",
// "response": {
// "$ref": "Player"
// },
// "scopes": [
// "https://www.googleapis.com/auth/games",
// "https://www.googleapis.com/auth/plus.login"
// ]
// }
}
// method id "games.players.list": | {
"url": "https://sourcegraph.com/github.com/google/google-api-go-client/-/info/GoPackage/github.com/google/google-api-go-client/games/v1/-/QuestsListCall/Do",
"source_domain": "sourcegraph.com",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "24874",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XHHXESCXWAKNKIGSKWGOPZQMTOGRKLKC",
"WARC-Concurrent-To": "<urn:uuid:3d9ac479-1689-497b-8a43-4106d9399ed8>",
"WARC-Date": "2016-10-25T18:29:47Z",
"WARC-IP-Address": "104.25.19.30",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:QVN572RWQGRZ3DOGI4IQKFZB2ZYXQ33X",
"WARC-Record-ID": "<urn:uuid:550e4caf-dba2-4393-91cd-f3afeefde379>",
"WARC-Target-URI": "https://sourcegraph.com/github.com/google/google-api-go-client/-/info/GoPackage/github.com/google/google-api-go-client/games/v1/-/QuestsListCall/Do",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7a801528-382c-429f-8a2a-78988f9279ff>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-6-4.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-44\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for October 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
12,
13,
412,
413,
446,
447,
486,
487,
498,
499,
503,
559,
561,
562,
607,
678,
730,
802,
872,
943,
960,
1037,
1083,
1116,
1177,
1200,
1220,
1224,
1256,
1283,
1306,
1310,
1313,
1330,
1348,
1351,
1383,
1437,
1455,
1458,
1475,
1519,
1550,
1585,
1590,
1593,
1609,
1675,
1693,
1696,
1713,
1719,
1873,
1900,
1933,
1959,
1978,
1987,
2009,
2039,
2101,
2130,
2161,
2188,
2199,
2221,
2316,
2347,
2374,
2385,
2407,
2517,
2547,
2575,
2602,
2612,
2621,
2657,
2677,
2702,
2711,
2729,
2778,
2831,
2839,
2845,
2846,
2848,
2849
],
"line_end_idx": [
12,
13,
412,
413,
446,
447,
486,
487,
498,
499,
503,
559,
561,
562,
607,
678,
730,
802,
872,
943,
960,
1037,
1083,
1116,
1177,
1200,
1220,
1224,
1256,
1283,
1306,
1310,
1313,
1330,
1348,
1351,
1383,
1437,
1455,
1458,
1475,
1519,
1550,
1585,
1590,
1593,
1609,
1675,
1693,
1696,
1713,
1719,
1873,
1900,
1933,
1959,
1978,
1987,
2009,
2039,
2101,
2130,
2161,
2188,
2199,
2221,
2316,
2347,
2374,
2385,
2407,
2517,
2547,
2575,
2602,
2612,
2621,
2657,
2677,
2702,
2711,
2729,
2778,
2831,
2839,
2845,
2846,
2848,
2849,
2883
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2883,
"ccnet_original_nlines": 89,
"rps_doc_curly_bracket": 0.011793269775807858,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.14887218177318573,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009022559970617294,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4751879572868347,
"rps_doc_frac_unique_words": 0.4632352888584137,
"rps_doc_mean_word_length": 6.790441036224365,
"rps_doc_num_sentences": 76,
"rps_doc_symbol_to_word_ratio": 0.0030075199902057648,
"rps_doc_unigram_entropy": 4.549683094024658,
"rps_doc_word_count": 272,
"rps_doc_frac_chars_dupe_10grams": 0.2447211742401123,
"rps_doc_frac_chars_dupe_5grams": 0.273957759141922,
"rps_doc_frac_chars_dupe_6grams": 0.2447211742401123,
"rps_doc_frac_chars_dupe_7grams": 0.2447211742401123,
"rps_doc_frac_chars_dupe_8grams": 0.2447211742401123,
"rps_doc_frac_chars_dupe_9grams": 0.2447211742401123,
"rps_doc_frac_chars_top_2gram": 0.02382241003215313,
"rps_doc_frac_chars_top_3gram": 0.01949107088148594,
"rps_doc_frac_chars_top_4gram": 0.02436383068561554,
"rps_doc_books_importance": -295.4462890625,
"rps_doc_books_importance_length_correction": -295.4462890625,
"rps_doc_openwebtext_importance": -141.70994567871094,
"rps_doc_openwebtext_importance_length_correction": -141.70994567871094,
"rps_doc_wikipedia_importance": -68.1656494140625,
"rps_doc_wikipedia_importance_length_correction": -68.1656494140625
},
"fasttext": {
"dclm": 0.7011657357215881,
"english": 0.4488781988620758,
"fineweb_edu_approx": 2.229893684387207,
"eai_general_math": 0.22916793823242188,
"eai_open_web_math": 0.012408610433340073,
"eai_web_code": 0.9339064359664917
}
} | {
"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.01",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-5,211,127,753,116,491,000 | Help transferring files from my hp pavilion laptop to my new iMac
Discussion in 'Mac Basics and Help' started by Xonnie316, Oct 15, 2009.
1. Xonnie316 macrumors member
Joined:
Oct 14, 2009
Location:
Melbourne, Australia
#1
Hey Mac Rumors Forum Members!
My previous computer was an HP Pavilion laptop, in which died on me few months ago. The graphics card died and it was built into the motherboard, so I had to replace the whole motherboard. A) Money wise it wasn't worthed B) It was 2 years old.
Now the laptop still works, just doesn't show anything on the screen, but in the background its actually working. So the files from the hard drive are still there. The only way I used to get the screen viewable was by connecting my laptop to another monitor and go into safe mode. The laptop has 2 hard drives. And the files weren't on the primary but on the secondary built-in hard drive. The operating system I was using was Windows Vista.
I've just bought a new iMac, and wish to try find a way were I can transfer the files into my iMac.
Thanks to anyone who will be able to give me any suggestions!
2. Anonymous Freak macrumors 601
Anonymous Freak
Joined:
Dec 12, 2002
Location:
Cascadia
#2
You could physically remove the hard drive, and put it in a USB drive enclosure.
Or, if you can get it up and running with display in any way ('Safe Mode with networking' would be best.) you could turn on file sharing, and connect over the network.
3. Kevster89 macrumors regular
Kevster89
Joined:
Oct 14, 2008
#3
Since you just recently purchased your iMac, you will still have complimentary iMac support even if you did not purchase Apple Care.
Apple Genius Bar support staff will gladly help you with this. This is a common issue that they assist a number of Apple customers with on a daily basis. They do this sort of "Windows to OS X" file transfer quite frequently. Do you have an Apple store nearby? All Apple stores include a Genius Bar with staff that go through extensive training at Apple HQ in Cupertino, CA.
4. Xonnie316 thread starter macrumors member
Joined:
Oct 14, 2009
Location:
Melbourne, Australia
#4
I think thats the best option for me to do at the moment.
I'll head off to Melbourne's Apple Store in Chadstone.
Perfect! Thanks guys.
5. JediMeister macrumors 68040
Joined:
Oct 9, 2008
#5
The Apple Store usually uses software called Move2Mac. If you are a more of a do-it-yourself-er, you can buy it to do the transfer on your own without needing to lug two computers in with you.
Share This Page | {
"url": "https://forums.macrumors.com/threads/help-transferring-files-from-my-hp-pavilion-laptop-to-my-new-imac.803668/",
"source_domain": "forums.macrumors.com",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "149801",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HEVMMII5OUHBAHOHGFN6PKYBSGXVROF6",
"WARC-Concurrent-To": "<urn:uuid:36cfd274-09c3-4176-9074-2b65c06d3ef8>",
"WARC-Date": "2017-09-20T14:00:15Z",
"WARC-IP-Address": "162.254.116.248",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NKTUDPPT6TQ6SKMJI5NZE5UDNULFAXGZ",
"WARC-Record-ID": "<urn:uuid:1a972336-d416-4324-bf39-11387c30f352>",
"WARC-Target-URI": "https://forums.macrumors.com/threads/help-transferring-files-from-my-hp-pavilion-laptop-to-my-new-imac.803668/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:648777e5-c0d7-4cfd-9e2a-33d5604603cd>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-64-45.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,
66,
67,
139,
140,
172,
173,
185,
202,
216,
241,
248,
282,
283,
531,
532,
978,
979,
1083,
1084,
1150,
1156,
1191,
1192,
1212,
1213,
1225,
1242,
1256,
1269,
1276,
1361,
1362,
1534,
1540,
1573,
1574,
1588,
1589,
1601,
1618,
1625,
1762,
1763,
2141,
2147,
2194,
2195,
2207,
2224,
2238,
2263,
2270,
2332,
2333,
2392,
2393,
2419,
2425,
2458,
2459,
2471,
2487,
2494,
2691,
2697,
2698
],
"line_end_idx": [
66,
67,
139,
140,
172,
173,
185,
202,
216,
241,
248,
282,
283,
531,
532,
978,
979,
1083,
1084,
1150,
1156,
1191,
1192,
1212,
1213,
1225,
1242,
1256,
1269,
1276,
1361,
1362,
1534,
1540,
1573,
1574,
1588,
1589,
1601,
1618,
1625,
1762,
1763,
2141,
2147,
2194,
2195,
2207,
2224,
2238,
2263,
2270,
2332,
2333,
2392,
2393,
2419,
2425,
2458,
2459,
2471,
2487,
2494,
2691,
2697,
2698,
2713
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2713,
"ccnet_original_nlines": 66,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37362638115882874,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02747252956032753,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2014652043581009,
"rps_doc_frac_unique_words": 0.5243362784385681,
"rps_doc_mean_word_length": 4.3672566413879395,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0.009157509543001652,
"rps_doc_unigram_entropy": 5.126213550567627,
"rps_doc_word_count": 452,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.056737590581178665,
"rps_doc_frac_chars_dupe_6grams": 0.056737590581178665,
"rps_doc_frac_chars_dupe_7grams": 0.056737590581178665,
"rps_doc_frac_chars_dupe_8grams": 0.056737590581178665,
"rps_doc_frac_chars_dupe_9grams": 0.056737590581178665,
"rps_doc_frac_chars_top_2gram": 0.018237080425024033,
"rps_doc_frac_chars_top_3gram": 0.016717329621315002,
"rps_doc_frac_chars_top_4gram": 0.024316109716892242,
"rps_doc_books_importance": -266.5514831542969,
"rps_doc_books_importance_length_correction": -266.5514831542969,
"rps_doc_openwebtext_importance": -134.61453247070312,
"rps_doc_openwebtext_importance_length_correction": -134.61453247070312,
"rps_doc_wikipedia_importance": -93.33450317382812,
"rps_doc_wikipedia_importance_length_correction": -93.33450317382812
},
"fasttext": {
"dclm": 0.05388069152832031,
"english": 0.9674416780471802,
"fineweb_edu_approx": 1.2483994960784912,
"eai_general_math": 0.008056280203163624,
"eai_open_web_math": 0.08686739206314087,
"eai_web_code": 0.00020915000641252846
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
502,420,061,867,012,600 | 上野竜生です。問117の答えを発表します。
問117 [信州大学]
(1)\(\displaystyle \int_0^1 x^4(1-x)^4 dx \)を求めよ。
(2)\(\displaystyle \int_0^1 \frac{x^4(1-x)^4}{1+x^2} dx \)を求めよ。
(3)\(\displaystyle \frac{1}{1260} < \frac{22}{7} - \pi < \frac{1}{630} \)を示せ。
答え
(1)\( x^4(1-x)^4=x^8- 4x^7 + 6x^6- 4x^5 +x^4 \)なので
\(\displaystyle \int_0^1 (x^8-4x^7+6x^6-4x^5+x^4 ) dx \\ = \displaystyle \left[ \frac{1}{9}x^9- \frac{1}{2}x^8 + \frac{6}{7}x^7 - \frac{2}{3}x^6 + \frac{1}{5}x^5 \right]_0^1 \\ =\displaystyle \frac{1}{9}-\frac{1}{2}+\frac{6}{7}-\frac{2}{3}+\frac{1}{5} \\ =\displaystyle \frac{70-315+540-420+126}{630} = \frac{1}{630} \)
(2)割り算を実行すると
\(\displaystyle \frac{x^8- 4x^7 + 6x^6- 4x^5 +x^4}{1+x^2} \\ = \displaystyle (x^6 -4x^5 +5x^4 -4x^2+4)-\frac{4}{1+x^2} \)
よって
\(\displaystyle \int_0^1 (x^6 -4x^5 +5x^4 -4x^2+4)-\frac{4}{1+x^2} dx \\ = \displaystyle \left[ \frac{1}{7}x^7 - \frac{2}{3}x^6 + x^5 - \frac{4}{3}x^3+4x \right]_0^1 - 4\cdot \frac{\pi}{4} \\ = \displaystyle \frac{1}{7}-\frac{2}{3}+1-\frac{4}{3}+4-\pi \\ \displaystyle = \frac{22}{7}-\pi \)
(3)0≦x≦1のとき
\(\displaystyle \frac{1}{2} \leq \frac{1}{1+x^2} \leq 1 \)
よって
\(\displaystyle \frac{x^4 (1-x)^4}{2} \leq \frac{x^4(1-x)^4}{1+x^2} \leq x^4(1-x)^4 \)
これを0から1まで積分すると
\(\displaystyle \frac{1}{1260} < \frac{22}{7}- \pi < \frac{1}{630} \)
解説を読んで数学がわかった「つもり」になりましたか？数学は読んでいるうちはわかったつもりになりますが演習をこなさないと実力になりません。そのためには問題集で問題を解く練習も必要です。オススメの参考書を厳選しました
<高校数学> <大学数学> さらにオススメの塾、特にオンラインの塾についてまとめてみました。自分一人だけでは自信のない人はこちらも参考にすると成績が上がります。 | {
"url": "https://math-juken.com/quiz/a117/",
"source_domain": "math-juken.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "82451",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TYGG4A7PVHJAIQ3S4LV3KE4OKRF5CB6F",
"WARC-Concurrent-To": "<urn:uuid:92325873-ac85-457d-b034-56215ae717e2>",
"WARC-Date": "2022-05-25T22:24:51Z",
"WARC-IP-Address": "183.90.240.44",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YJPGMD4JQGBB45ZEJ7G6UHINYQ64YRIK",
"WARC-Record-ID": "<urn:uuid:a747b0ad-158c-406b-9ed9-e04214af5c03>",
"WARC-Target-URI": "https://math-juken.com/quiz/a117/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eaf7b141-d3f0-479a-bbe9-eb7bb64286f2>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-200\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
22,
23,
35,
36,
86,
150,
228,
229,
231,
232,
235,
236,
287,
607,
608,
621,
743,
747,
1038,
1039,
1051,
1110,
1114,
1201,
1216,
1286,
1287,
1289,
1290,
1292,
1293,
1400,
1401
],
"line_end_idx": [
22,
23,
35,
36,
86,
150,
228,
229,
231,
232,
235,
236,
287,
607,
608,
621,
743,
747,
1038,
1039,
1051,
1110,
1114,
1201,
1216,
1286,
1287,
1289,
1290,
1292,
1293,
1400,
1401,
1481
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1481,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0.09182983636856079,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06031746044754982,
"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.803174614906311,
"rps_doc_frac_unique_words": 0.5882353186607361,
"rps_doc_mean_word_length": 8.921568870544434,
"rps_doc_num_sentences": 1,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.8308393955230713,
"rps_doc_word_count": 102,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.015384620055556297,
"rps_doc_frac_chars_top_3gram": 0.03956044092774391,
"rps_doc_frac_chars_top_4gram": 0.05714286118745804,
"rps_doc_books_importance": -243.16455078125,
"rps_doc_books_importance_length_correction": -235.85475158691406,
"rps_doc_openwebtext_importance": -207.44651794433594,
"rps_doc_openwebtext_importance_length_correction": -207.44651794433594,
"rps_doc_wikipedia_importance": -96.27458190917969,
"rps_doc_wikipedia_importance_length_correction": -85.49588012695312
},
"fasttext": {
"dclm": 0.9999896287918091,
"english": 0.06248177960515022,
"fineweb_edu_approx": 3.1850643157958984,
"eai_general_math": 0.9542489051818848,
"eai_open_web_math": 1.0000100135803223,
"eai_web_code": 0.25956857204437256
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "515.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
},
"secondary": {
"code": "512.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
6,750,859,177,225,205,000 | Configuration File : icCube-notification.xml
icCube allows for being notified about various internal activities. For example, administrators may be notified via eMail that a schema has been re-loaded or updated. This service is configured via the icCube-notification.xml file.
Configuration Overview
Notifications are configured via a list of notification listeners. Each listener is filtering notifications (e.g., errors vs warnings) to be dispatched to a given transport service (e.g., eMail).
Here is an example of configuration that is reporting all internal errors to the icCube support (hopefully none.) Note that up-to-date information is available in the configuration file delivered with icCube:
<icCubeNotificationConfiguration>
<listener>
<filter>
<type>INTERNAL_ERROR</type>
</filter>
<transporter>
<id>icCube Support</id>
<service>eMail</service>
<param>
<name>from</name>
<value>[email protected]</value>
</param>
<param>
<name>to</name>
<value>[email protected]</value>
</param>
</transporter>
</listener>
</icCubeNotificationConfiguration>
Filter
Each listener can define a filter to decide which notification is going to be dispatched; no filter meaning all notifications are accepted by this listener. Three fields are available:
• level : the severity level of the notification (INFO, WARNING, ERROR)
• type : e.g., INTERNAL_ERROR, SCHEMA_FULL_LOAD, SCHEMA_UNLOAD, etc...
• schema : the name of the schema the notification is attached to
Each field accepts JAVA regular expressions. For example, the following filter is accepting warning and error notifications:
<filter>
<level>WARNING|ERROR</level>
</filter>
This filter is accepting all warnings about schema life cycle activity:
<filter>
<level>WARNING.*</level>
<type>SCHEMA.*</type>
</filter>
Message Types
The following types of notifications are available and can be used in the type field of the filters:
INTERNAL_ERROR
An unexpected error within the system (typically reported to icCube support).
LICENSE_EXPIRY_WARNING
The license is about to expire ( 30 - 15 - 1 day warnings ).
SERVER_READY
The icCube server has been successfully started and is ready.
SCHEMA_FULL_LOAD
A full schema load (vs. incremental load).
SCHEMA_INCREMENTAL_LOAD
A schema has been successfully updated (vs. full load).
SCHEMA_INCREMENTAL_LOAD_DEACTIVATED
A schema update (vs. full load) has done nothing due to incremental load being de-activated
since a previous incremental load on error.
SCHEMA_INCREMENTAL_LOAD_ERROR
A schema has been unsuccessfully incremental loaded (the schema is in an uncertain state).
SCHEMA_FULL_LOAD_ERROR
A schema has been unsuccessfully fully loaded.
SCHEMA_LOAD_ERROR
A schema has been unsuccessfully loaded (could not determine if incremental load or full load).
SCHEMA_LOAD_CANCELLED
A schema load request has been cancelled.
SCHEMA_UNLOAD
A schema has been successfully unloaded.
SCHEMA_PARTITIONS_UNLOADED
Schema: unload partitions successful.
SCHEMA_PARTITIONS_LOADED
Schema: load partitions successful.
SCHEMA_PARTITIONS_LOAD_FAILED
Schema: load partitions on error: the schema state is still consistent
(e.g., SELECT error, authorization error, etc...).
SCHEMA_PARTITIONS_LOAD_ERROR
Schema: load partitions on error: the state of the schema is uncertain.
ALERT
An alert has been triggered and is positive.
Transport Services
Along with its filter, a listener is deciding which transport service is going to deliver the notifications. icCube is currently providing an eMail service (via the configuration of a outgoing SMTP server); have a look to the next paragraph to see how to implement your own service. The following is demonstrating how to configure a GMail SMTP server via SSL. The icCube implementation is based on JavaMail 1.4.5 and accept all the parameters as defined by this standard; the icCube.username and password are the (optional) credentials required to connect to your SMTP server:
<transportService>
<id>eMail</id>
<service-class>crazydev.iccube.notification.transporter.email.OlapNotificationEmailJavaMailService</service-class>
<param>
<name>icCube.username</name>
<value>...</value>
</param>
<param>
<name>icCube.password</name>
<value>...</value>
</param>
<param>
<name>mail.smtp.host</name>
<value>smtp.gmail.com</value>
</param>
<param>
<name>mail.smtp.socketFactory.port</name>
<value>465</value>
</param>
<param>
<name>mail.smtp.socketFactory.class</name>
<value>javax.net.ssl.SSLSocketFactory</value>
</param>
<param>
<name>mail.smtp.auth</name>
<value>true</value>
</param>
<param>
<name>mail.smtp.port</name>
<value>465</value>
</param>
</transportService>
User Defined Transport Service
The configuration of the notification service is fully generic and you can provide your own transport services. For that purpose you need to provide a JAVA class that implements the interface crazydev.iccube.notification.transporter.OlapNotificationTransportService and specify this class name in the service-class configuration field of the transportService. As an example, the following code is implementing a transport service that keeps notifications in memory:
public class InMemoryTransportService implements OlapNotificationTransportService
{
private final List<OlapNotification> notifications = new ArrayList<OlapNotification>();
private String id;
public TransportService()
{
}
@Override
public String getId()
{
return this.id;
}
@Override
public void configure(OlapNotificationTransportServiceDefinition configuration)
throws OlapNotificationServiceException
{
this.id = configuration.getId();
}
@Override
public OlapNotificationServiceTransporter transporter(OlapNotificationTransporterDefinition configuration)
throws OlapNotificationServiceException
{
return new Transporter(this, configuration.getId());
}
public void handleNotification(OlapNotification notification)
{
notifications.add(notification);
}
}
public class Transporter extends OlapNotificationServiceTransporter
{
private final InMemoryTransportService service;
private final String id;
public Transporter(InMemoryTransportService service, String id)
{
this.service = service;
this.id = id;
}
@Override
public String getId()
{
return id;
}
@Override
public String asLogInfo()
{
return id;
}
@Override
public void handleNotification(OlapNotification notification)
{
service.handleNotification(notification);
}
}
and the configuration of a listener dispatching all the notifications to this transport service is as follows:
<listener>
<transporter>
<id>Test</id>
<service>In Memory</service>
</transporter>
</listener>
<transportService>
<id>In Memory</id>
<service-class>InMemoryTransportService</service-class>
</transportService>
Next chapter : Environment Variables. | {
"url": "https://www.iccube.com/support/documentation/user_guide/configuring_iccube/iccube_notification_xml.php",
"source_domain": "www.iccube.com",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "78394",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JOG2JNU53FNBZOP4C73KBM4EL5JBBZJN",
"WARC-Concurrent-To": "<urn:uuid:242a6223-d439-4905-99ac-e48696f347c0>",
"WARC-Date": "2020-08-15T15:51:28Z",
"WARC-IP-Address": "104.199.62.58",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:QGTIMBXJW25DWN3TRPFQMEKHDIUOVEWK",
"WARC-Record-ID": "<urn:uuid:7d6587b0-cd18-463c-8847-d6a7957b0dc5>",
"WARC-Target-URI": "https://www.iccube.com/support/documentation/user_guide/configuring_iccube/iccube_notification_xml.php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:741f2ec8-a2f0-4912-b6a1-d9d3dcf256d6>"
},
"warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-39.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,
45,
46,
278,
279,
302,
303,
499,
500,
709,
710,
711,
745,
746,
761,
762,
779,
819,
837,
838,
860,
861,
897,
898,
935,
936,
956,
990,
1043,
1064,
1065,
1085,
1117,
1167,
1188,
1189,
1212,
1213,
1229,
1230,
1265,
1270,
1271,
1278,
1279,
1464,
1465,
1539,
1612,
1680,
1681,
1806,
1807,
1808,
1817,
1850,
1860,
1865,
1866,
1938,
1939,
1940,
1949,
1978,
2004,
2014,
2019,
2020,
2034,
2035,
2136,
2137,
2138,
2153,
2233,
2234,
2257,
2320,
2321,
2334,
2398,
2399,
2416,
2461,
2462,
2486,
2544,
2545,
2581,
2675,
2721,
2722,
2752,
2845,
2846,
2869,
2918,
2919,
2937,
3035,
3036,
3058,
3102,
3103,
3117,
3160,
3161,
3188,
3228,
3229,
3254,
3292,
3293,
3323,
3396,
3449,
3450,
3479,
3553,
3554,
3560,
3607,
3612,
3613,
3632,
3633,
4210,
4211,
4230,
4231,
4250,
4251,
4370,
4371,
4383,
4420,
4447,
4460,
4461,
4473,
4510,
4537,
4550,
4551,
4552,
4564,
4600,
4638,
4651,
4652,
4664,
4714,
4741,
4754,
4755,
4767,
4818,
4872,
4885,
4886,
4898,
4934,
4962,
4975,
4976,
4988,
5024,
5051,
5064,
5065,
5085,
5090,
5091,
5122,
5123,
5589,
5590,
5672,
5674,
5766,
5767,
5790,
5791,
5821,
5827,
5833,
5834,
5848,
5874,
5880,
5904,
5910,
5911,
5925,
6009,
6057,
6063,
6104,
6110,
6111,
6125,
6236,
6284,
6290,
6351,
6357,
6358,
6424,
6430,
6471,
6477,
6479,
6480,
6548,
6550,
6602,
6603,
6632,
6633,
6701,
6707,
6739,
6761,
6767,
6768,
6782,
6808,
6814,
6833,
6839,
6840,
6854,
6884,
6890,
6909,
6915,
6916,
6930,
6996,
7002,
7052,
7058,
7059,
7061,
7066,
7067,
7178,
7179,
7180,
7191,
7192,
7210,
7211,
7233,
7270,
7271,
7290,
7291,
7303,
7304,
7323,
7324,
7347,
7407,
7408,
7428,
7433,
7434
],
"line_end_idx": [
45,
46,
278,
279,
302,
303,
499,
500,
709,
710,
711,
745,
746,
761,
762,
779,
819,
837,
838,
860,
861,
897,
898,
935,
936,
956,
990,
1043,
1064,
1065,
1085,
1117,
1167,
1188,
1189,
1212,
1213,
1229,
1230,
1265,
1270,
1271,
1278,
1279,
1464,
1465,
1539,
1612,
1680,
1681,
1806,
1807,
1808,
1817,
1850,
1860,
1865,
1866,
1938,
1939,
1940,
1949,
1978,
2004,
2014,
2019,
2020,
2034,
2035,
2136,
2137,
2138,
2153,
2233,
2234,
2257,
2320,
2321,
2334,
2398,
2399,
2416,
2461,
2462,
2486,
2544,
2545,
2581,
2675,
2721,
2722,
2752,
2845,
2846,
2869,
2918,
2919,
2937,
3035,
3036,
3058,
3102,
3103,
3117,
3160,
3161,
3188,
3228,
3229,
3254,
3292,
3293,
3323,
3396,
3449,
3450,
3479,
3553,
3554,
3560,
3607,
3612,
3613,
3632,
3633,
4210,
4211,
4230,
4231,
4250,
4251,
4370,
4371,
4383,
4420,
4447,
4460,
4461,
4473,
4510,
4537,
4550,
4551,
4552,
4564,
4600,
4638,
4651,
4652,
4664,
4714,
4741,
4754,
4755,
4767,
4818,
4872,
4885,
4886,
4898,
4934,
4962,
4975,
4976,
4988,
5024,
5051,
5064,
5065,
5085,
5090,
5091,
5122,
5123,
5589,
5590,
5672,
5674,
5766,
5767,
5790,
5791,
5821,
5827,
5833,
5834,
5848,
5874,
5880,
5904,
5910,
5911,
5925,
6009,
6057,
6063,
6104,
6110,
6111,
6125,
6236,
6284,
6290,
6351,
6357,
6358,
6424,
6430,
6471,
6477,
6479,
6480,
6548,
6550,
6602,
6603,
6632,
6633,
6701,
6707,
6739,
6761,
6767,
6768,
6782,
6808,
6814,
6833,
6839,
6840,
6854,
6884,
6890,
6909,
6915,
6916,
6930,
6996,
7002,
7052,
7058,
7059,
7061,
7066,
7067,
7178,
7179,
7180,
7191,
7192,
7210,
7211,
7233,
7270,
7271,
7290,
7291,
7303,
7304,
7323,
7324,
7347,
7407,
7408,
7428,
7433,
7434,
7471
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7471,
"ccnet_original_nlines": 267,
"rps_doc_curly_bracket": 0.0029447199776768684,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23459716141223907,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03317536041140556,
"rps_doc_frac_lines_end_with_ellipsis": 0.0037313399370759726,
"rps_doc_frac_no_alph_words": 0.33491310477256775,
"rps_doc_frac_unique_words": 0.3936464190483093,
"rps_doc_mean_word_length": 7.407458782196045,
"rps_doc_num_sentences": 89,
"rps_doc_symbol_to_word_ratio": 0.003159560030326247,
"rps_doc_unigram_entropy": 5.11225700378418,
"rps_doc_word_count": 724,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04810740053653717,
"rps_doc_frac_chars_dupe_6grams": 0.011187770403921604,
"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.011747159995138645,
"rps_doc_frac_chars_top_3gram": 0.011187770403921604,
"rps_doc_frac_chars_top_4gram": 0.01566288061439991,
"rps_doc_books_importance": -628.775146484375,
"rps_doc_books_importance_length_correction": -628.775146484375,
"rps_doc_openwebtext_importance": -403.4930725097656,
"rps_doc_openwebtext_importance_length_correction": -403.4930725097656,
"rps_doc_wikipedia_importance": -397.7822570800781,
"rps_doc_wikipedia_importance_length_correction": -397.7822570800781
},
"fasttext": {
"dclm": 0.08747190237045288,
"english": 0.6835458874702454,
"fineweb_edu_approx": 1.5908225774765015,
"eai_general_math": 0.17218291759490967,
"eai_open_web_math": 0.054541051387786865,
"eai_web_code": 0.8815345764160156
}
} | {
"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": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
1,122,771,746,114,527,600 | Can I create a Dynamic Variable name that increment with each loop of a for/each
This topic contains 3 replies, has 2 voices, and was last updated by Profile photo of Ed O'Connor Ed O’Connor 9 months, 1 week ago.
• Author
Posts
• #39285
Profile photo of Ed O'Connor
Ed O’Connor
Participant
I am trying to wrap my head around something and could use some assistance.
I have a variable that has x amount of server names in it via a AD query
$Nodes = Get-ADComputer -SearchBase "OU=DSC Managed Nodes,OU=SERVERS,OU=NYC,OU=Americas,DC=lab2,DC=test,DC=com" -Filter * | Select-Object Name
What I want to do next is run a command against each of those nodes and have the output for each node put into it's own separate variable
$DSCStatus = Foreach ($Node in $Nodes.name)
{
Try
{
Test-DSCConfiguration -computername $Node –detailed -ErrorAction STOP | select-object PSComputerName,InDesiredState,@{ Name = "Resources In Desired State" ; Expression = {$_.ResourcesInDesiredState}},@{ Name = "Resources Not In Desired State" ; Expression = {$_.ResourcesNotInDesiredState}}
}
Catch
{
$_
}
}
My question how can I take the code above and have the results of the try/catch put into a separate variable for each server?
So I would be looking for on the first cycle (first node) through it puts the output into something like $Data1, then on the second cycle (second node) it puts the output into something like $Data2, and so on with each $DataX incrementing with each cycle.
This would need to by dynamic as computers will be added to the OU and need to be accounted for without having to modify the script each time.
Thanks in advance for some guidance.
• #39287
Profile photo of Dan Potter
Dan Potter
Participant
new-variable -name "data$int" -value $something
like so.
(1..10) | % {new-variable -Name "data$_" -value $_ }
get-variable
• #39289
Profile photo of Dan Potter
Dan Potter
Participant
You could use -outvariable as well.
$user = 'me';get-aduser me -OutVariable $user
• #39302
Profile photo of Ed O'Connor
Ed O’Connor
Participant
Thank you Dan, this helps.
You must be logged in to reply to this topic. | {
"url": "https://powershell.org/forums/topic/can-i-create-a-dynamic-variable-name-that-increment-with-each-loop-of-a-foreach/",
"source_domain": "powershell.org",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "50909",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZWU6ON2JJ5B627J6SK2SRYCS4IBNZVPF",
"WARC-Concurrent-To": "<urn:uuid:37300537-1da5-4c3a-89bb-bdf9d41e8a3d>",
"WARC-Date": "2017-02-27T00:02:18Z",
"WARC-IP-Address": "45.79.184.180",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:JUVI4EY5HGK7XU2TZTXZFKETIHGQCMYS",
"WARC-Record-ID": "<urn:uuid:9b46dc8f-73bb-45e4-8ecb-af6c52c43733>",
"WARC-Target-URI": "https://powershell.org/forums/topic/can-i-create-a-dynamic-variable-name-that-increment-with-each-loop-of-a-foreach/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7d259c9d-293f-4f1a-9072-2a18dc4317aa>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-09\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
81,
82,
214,
215,
226,
236,
247,
280,
296,
312,
313,
393,
394,
471,
472,
619,
624,
625,
767,
768,
817,
847,
884,
918,
1246,
1280,
1319,
1353,
1392,
1426,
1448,
1453,
1454,
1584,
1585,
1845,
1846,
1993,
1994,
2035,
2036,
2047,
2079,
2094,
2110,
2111,
2163,
2164,
2177,
2178,
2235,
2252,
2253,
2264,
2296,
2311,
2327,
2328,
2368,
2369,
2419,
2420,
2431,
2464,
2480,
2496,
2497,
2528,
2529
],
"line_end_idx": [
81,
82,
214,
215,
226,
236,
247,
280,
296,
312,
313,
393,
394,
471,
472,
619,
624,
625,
767,
768,
817,
847,
884,
918,
1246,
1280,
1319,
1353,
1392,
1426,
1448,
1453,
1454,
1584,
1585,
1845,
1846,
1993,
1994,
2035,
2036,
2047,
2079,
2094,
2110,
2111,
2163,
2164,
2177,
2178,
2235,
2252,
2253,
2264,
2296,
2311,
2327,
2328,
2368,
2369,
2419,
2420,
2431,
2464,
2480,
2496,
2497,
2528,
2529,
2574
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2574,
"ccnet_original_nlines": 69,
"rps_doc_curly_bracket": 0.006216010078787804,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3136456310749054,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05091650038957596,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2993890047073364,
"rps_doc_frac_unique_words": 0.5154321193695068,
"rps_doc_mean_word_length": 4.984568119049072,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0.008146639913320541,
"rps_doc_unigram_entropy": 4.847090721130371,
"rps_doc_word_count": 324,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1678018569946289,
"rps_doc_frac_chars_dupe_6grams": 0.1678018569946289,
"rps_doc_frac_chars_dupe_7grams": 0.1678018569946289,
"rps_doc_frac_chars_dupe_8grams": 0.10773994028568268,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.037151701748371124,
"rps_doc_frac_chars_top_3gram": 0.04334364831447601,
"rps_doc_frac_chars_top_4gram": 0.02972136065363884,
"rps_doc_books_importance": -202.8124237060547,
"rps_doc_books_importance_length_correction": -202.8124237060547,
"rps_doc_openwebtext_importance": -97.78717041015625,
"rps_doc_openwebtext_importance_length_correction": -97.78717041015625,
"rps_doc_wikipedia_importance": -100.37410736083984,
"rps_doc_wikipedia_importance_length_correction": -100.37410736083984
},
"fasttext": {
"dclm": 0.7409394383430481,
"english": 0.8712502717971802,
"fineweb_edu_approx": 1.8096235990524292,
"eai_general_math": 0.35357457399368286,
"eai_open_web_math": 0.14339762926101685,
"eai_web_code": 0.23369717597961426
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "6",
"label": "Indeterminate"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,723,375,808,369,944,000 | Freemarker is a Java based template engine, a generic tool to generate text output (anything from HTML to autogenerated source code) based on templates. It's a Java package, a class library for Java programmers. It's not an application for end-users in itself, but something that programmers can ...
learn more… | top users | synonyms
62
votes
5answers
64k views
Freemarker iterating over hashmap keys
Freemarker has two collection datatypes, lists and hashmaps Is there a way to iterate over hashmap keys just as we do with lists? So if I have a var with data lets say: user : { name : "user" ...
77
votes
7answers
26k views
Why would I use a templating engine? jsp include and jstl vs tiles, freemarker, velocity, sitemesh
I'm about to choose to way to organize my view (with spring-mvc, but that shouldn't matter much) There are 6 options as far as I see (though they are not mutually exclusive): Tiles Sitemesh ...
41
votes
5answers
26k views
Velocity vs. FreeMarker [closed]
Velocity or FreeMarker? They look pretty much the same, even the syntax? What to use? Or when to use what?
10
votes
2answers
8k views
Freemarker: How to iterate through the Map using enums as keys
The following code does not work because Freemarker seems to cast the value of the expression inside [] to String and then to use it as a key, which is not what is actually expected. Preparing a ...
59
votes
12answers
47k views
Template Engines for Spring Framework [closed]
I've taken quite a shine to the Spring Framework and would like to get into it a bit more. I have noticed that aside from plain vanilla JSPs there are various template engines for use with Spring MVC, ...
97
votes
4answers
117k views
How to check if a variable exists in a FreeMarker template?
I have a Freemarker template which contains a bunch of placeholders for which values are supplied when the template is processed. I want to conditionally include part of the template if the userName ...
8
votes
1answer
10k views
Multiple View resolvers in spring mvc
I want to use multiple view resolvers in my web app based on spring mvc Can anyone tell me how do I achieve that. I want to use both JSP and freemarker in my app. Please suggest some approaches or ...
19
votes
3answers
16k views
How to handle exceptions thrown while rendering a view in Spring MVC?
I have a Spring MVC application which uses FreeMarker as View technology (But maybe the view technology doesn't really matter for my question). I need to intercept all exceptions which may get thrown ...
22
votes
3answers
16k views
Setting freemarker template from classpath
I have a web application that I need to manually obtain a Freemarker template - the template is obtained via a class in a library project, but the actual tpl file is contained in the web application ...
32
votes
2answers
28k views
How do I call java methods on an object from a FreeMarker template?
Is it possible to call a method that takes parameters from a Freemarker template? I have an object model that I'm trying to render with Freemarker into a web page. One of the objects has a method to ...
11
votes
2answers
34k views
A url resource that is a dot (%2E)
I have a resource that is a . This means my url looks like this: http://myapp/index/. And i need to add query parameters so that it looks like this: http://myapp/index/.?type=xml I use Freemarker for ...
7
votes
3answers
9k views
FileNotFoundException when loading freemarker template in java
I get a file not found exception while loading a freemarker template even though the template is actually present in the path. Update: This is running as a webservice. It will return an xml to the ...
28
votes
7answers
29k views
best template engine in java [closed]
I am looking for a template engine with iteration, bifurcation, markup alike and that takes a string for template input rather a file. That's because I have my own way to supply the input template, ...
12
votes
3answers
10k views
Load FreeMarker templates from database
I would like to store my FreeMarker templates in a database table that looks something like: template_name | template_content --------------------------------- hello |Hello ${user} goodbye ...
26
votes
4answers
9k views
IntelliJ not recognizing a particular file correctly, instead its stuck as a text file
There is a freemarker file (ftl) in my IntelliJ project that is incorrectly recognized as a text file. There are many of the same type that are correct. I am aware of the "Mark as text" option. This ...
18
votes
1answer
16k views
Getting template text from FreeMarker in Spring app
In my Spring app, I'd like to use FreeMarker to generate the text of emails that will be sent by my application. The generated text will never be returned to the view so I don't need to configure a ...
25
votes
2answers
10k views
How to get the request context in a freemaker template in spring
How to get the request context path in freemarker template when using with spring. My view resolver is like this <bean id="freeMarkerViewResolver" ...
8
votes
5answers
7k views
Default escaping in Freemarker
In Freemarker templates we can use the escape directive to automatically apply an escaping to all interpolations inside the included block: <#escape x as x?html> <#-- name is escaped as ...
9
votes
4answers
13k views
Simulate null parameters in Freemarker macros
I'm building a site using Freemarker and have started heavily using macros. I know in Freemarker 2.3 that passing a null value into a macro as a parameter is equivalent to not passing a parameter at ...
6
votes
1answer
16k views
accept-charset=“UTF-8” parameter doesnt do anything, when used in form
I am using accept-charset="utf-8" attribute in form and found that the when do a form post with non-ascii, the headers have different accept charset option in the request header. Is there anything i ...
4
votes
0answers
4k views
spring security 3.2.0 csrf token not working in freemarker template
After uprading to Spring Security 3.2.0 and configuring the xml, the _csrf token is not working. Fundamentals: Spring 4.0.1 Spring Security 3.2.0. Freemarker Template Language Step 1 - the spring ...
2
votes
2answers
9k views
Remove selected event from the Calendar
I am using JQuery Full Calendar along with Spring MVC. Hello, I have made a demo like that. Target: I need when the user clicks on an event s/he already inserted,a dialog box appears and gives ...
2
votes
5answers
14k views
Setting the content-type of a response in Struts2
So, I'm using freemarker templates with Struts2 to formulate my responses. However, since I'm trying to use taconite as well, I need the response to be sent with the content type of "text/xml". I ...
6
votes
2answers
6k views
get queryString of a URL on FreeMarker
learning FTL here. I'm trying to get add a query string on my FTL page, like http://localhost/search, i'd like to add a query string on the URL, say http://localhost/search?bing so that user could ...
6
votes
4answers
4k views
In freemarker is it possible to check to see if a file exists before including it?
We are trying to build a system in freemarker where extension files can be optionally added to replace blocks of the standard template. We have gotten to this point <#attempt> ...
2
votes
2answers
12k views
First steps with freemarker with spring mvc
So I have Index action in my HomeController.java class. I have my freemarker templates in: /web-inf/ftl/test.ftl How can I load the template? I have this in my appname-servlet.xml: <bean ...
11
votes
4answers
4k views
Will not closing a stringwriter cause a leak?
I realize that in java the GC will eventually cleanup objects, but I'm asking if it is bad practice to not close your string writer, currently I am doing this: private static String ...
9
votes
1answer
4k views
ClassNotFoundException FreeMarkerConfigurationFactory
I have a big web application that uses FreeMarker. When I recently updated to Spring 3.2.4 and ran the web app via jetty or tomcat I get the following exception: ...
7
votes
2answers
13k views
Iterating over map in Freemarker [duplicate]
Possible Duplicate: Freemarker iterating over hashmap keys I have a Hash Map which contain item ids as a key and Item objects as a value. Following is the pseudo code - allItems : { 12: ...
5
votes
1answer
1k views
does freemarker support show all variable in data-model?
I want to see all variables in freemarker data-model, just like struts2 debug tag to show value stack. Is there a way for freemarker to do this ?
5
votes
1answer
3k views
How to make Netbeans' templates that creates more than 1 file?
One of the most awesome features of Netbeans is to generate code using some FreeMarker templates. I have some questions about it, I hope someone here can help me. How can I make a template on ...
4
votes
2answers
5k views
Dropdown box - from Spring MVC model / context to form using freemarker
This should be very basic but I can't find anything about it in the web, just bits and pieces that I don't seem able to fit together.. We're using Spring MVC with freemarker. Now I want to add a form ...
3
votes
1answer
332 views
get value of the string stored in a variable, whose name stored as string in another variable
<#assign blah = "foo"> <#assign foo = "awesome"> Can we render "awesome" without referencing foo ? I tried something like ${${blah}} But it isn't working, any ideas ?
3
votes
2answers
7k views
Import one FTL file inside another FTL file
I have created one DIV inside a FTL file and that DIV contain form now say i have another FTL file and i want to use first FTL's div inside second FTL file is this possible deepak.ftl <div ...
2
votes
3answers
293 views
Spring-Boot with JSP Tag Libs in embedded Tomcat
I am currently migrating a Spring MVC Webapp (xml-config to java-config, tomcat to embedded tomcat via spring-boot). The webapp uses freemarker as templating engine and JSP Taglibs. Now when I call a ...
1
vote
1answer
6k views
freemarkers skip assertNonNull InvalidReferenceException
I render a list of Objects with freemarker: <ul> <#list publication as item> <li><b>${item.key}</b> : ${item.value}</li> </#list> </ul> ...
1
vote
4answers
4k views
Freemarker encoding - question marks in the place of accented characters
I am trying to print accented characters with Freemarker, but in the place of accented characters, I get only question marks. I have verified, that following statement holds: "UTF-8" == ...
0
votes
1answer
238 views
Validation and Freemarker
We have to do validation on the page, in the case of empty fields to display a message. It's my class, the method of the controller and settings of messages. I can't to get on the page Freemarker ...
0
votes
4answers
141 views
How do I filter <li> under a<ul> having a particular id?
<ul class="apple" id="A"> <li> <li> ..... ...... ...... </ul> <ul ...
0
votes
1answer
1k views
Freemarker: Dynamic interpolation of sub variables
I am trying to create a FreeMarker macro that can return the interpolation of a concatenation of a string and the input variable: <#macro findValue var> <#if (.vars["foo." + var]) ??> ...
0
votes
1answer
1k views
Issue when executing asynchronous tasks using ExecutorService
I had asked a question earlier regarding ExecutorService and Apache Velocity initialization. To give a quick recap -- I have a Java EE frontend which accepts user requests and then for each of these ...
0
votes
1answer
2k views
Getting template text from FreeMarker in Struts2 app
I would like to generate email inside a Struts2 application, using Freemarker. As I am also using Freemarker for my view, I would like to "reuse" the same config. There is already a similar question ...
9
votes
4answers
10k views
JSP vs Freemarker [closed]
Does JSP provide more flexibility then Freemarker or is it other way around? My back-end involves Servlets. Can anyone suggest which one is used under what circumstances? Thank you in advance.
4
votes
4answers
2k views
Sandboxing Java / Groovy / Freemarker Code - Preventing execution of specific methods
I'm developing a system that allows developers to upload custom groovy scripts and freemarker templates. I can provide a certain level of security at a very high level with the default Java security ...
15
votes
1answer
24k views
Freemarker assign list length to local variable
The following freemarker code causes an exception <#assign i= it.getList().size()> <#list it.getList() as elem> <#if i==1> <li>${elem.name}</li> ...
8
votes
2answers
3k views
Better template language needed [closed]
Yes, I know that this has been asked before. But most of the questions were two years ago, and there's got to be a better answer today. I need a template language for rendering HTML. Requirements: ...
8
votes
2answers
9k views
Freemarker print date in template
I am trying to print the current date when the template is activated. I have read that I have to pass a new Date() Java object to the template, but I don't know how to do that or where to put it in ...
6
votes
1answer
3k views
JSP tags in a Freemarker template
I want to use some custom tags in a freemarker template which is easy enough as I can include the JspSupportServlet in my web.xml file and include the folowing line in the template. <#assign ...
18
votes
4answers
9k views
Use ternary operator in freemarker?
I just want to do it like this: <a href="${ a? 'a.htm' : 'b.htm'}"> Best regards.
8
votes
3answers
5k views
What are different ways to handle error in FreeMarker template?
How to suppress FreeMarker template error? I am looking here: http://freemarker.sourceforge.net/docs/pgui_config_errorhandling.html But I do not understand how to ... | {
"url": "http://stackoverflow.com/questions/tagged/freemarker?sort=frequent&pagesize=15",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2016-22",
"warc_metadata": {
"Content-Length": "189610",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:I5AH2EGPVS6RMQY4FJKTSEV64PEGOH7R",
"WARC-Concurrent-To": "<urn:uuid:18197ba0-9eb7-42d1-885f-e5cd5f423e56>",
"WARC-Date": "2016-05-26T20:38:24Z",
"WARC-IP-Address": "104.16.37.249",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BXZCV2FECTITS3ZMRQKPFDQ6BMFNNTUD",
"WARC-Record-ID": "<urn:uuid:94f7a3d3-1077-4dae-b8f5-96e178a0387a>",
"WARC-Target-URI": "http://stackoverflow.com/questions/tagged/freemarker?sort=frequent&pagesize=15",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a56ef21a-8751-4e34-a784-0929b52b40be>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-217-139.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
300,
301,
336,
337,
340,
346,
355,
365,
366,
405,
406,
602,
605,
611,
620,
630,
631,
730,
731,
925,
928,
934,
943,
953,
954,
987,
988,
1095,
1098,
1104,
1113,
1122,
1123,
1186,
1187,
1386,
1389,
1395,
1405,
1415,
1416,
1463,
1464,
1669,
1672,
1678,
1687,
1698,
1699,
1759,
1760,
1963,
1965,
1971,
1979,
1989,
1990,
2028,
2029,
2230,
2233,
2239,
2248,
2258,
2259,
2329,
2330,
2534,
2537,
2543,
2552,
2562,
2563,
2606,
2607,
2810,
2813,
2819,
2828,
2838,
2839,
2907,
2908,
3111,
3114,
3120,
3129,
3139,
3140,
3175,
3176,
3380,
3382,
3388,
3397,
3406,
3407,
3470,
3471,
3672,
3675,
3681,
3690,
3700,
3701,
3739,
3740,
3942,
3945,
3951,
3960,
3970,
3971,
4011,
4012,
4205,
4208,
4214,
4223,
4232,
4233,
4320,
4321,
4524,
4527,
4533,
4541,
4551,
4552,
4604,
4605,
4807,
4810,
4816,
4825,
4835,
4836,
4901,
4902,
5053,
5055,
5061,
5070,
5079,
5080,
5111,
5112,
5302,
5304,
5310,
5319,
5329,
5330,
5376,
5377,
5580,
5582,
5588,
5596,
5606,
5607,
5678,
5679,
5882,
5884,
5890,
5899,
5908,
5909,
5977,
5978,
6178,
6180,
6186,
6195,
6204,
6205,
6245,
6246,
6443,
6445,
6451,
6460,
6470,
6471,
6521,
6522,
6722,
6724,
6730,
6739,
6748,
6749,
6788,
6789,
6990,
6992,
6998,
7007,
7016,
7017,
7100,
7101,
7281,
7283,
7289,
7298,
7308,
7309,
7353,
7354,
7545,
7548,
7554,
7563,
7572,
7573,
7619,
7620,
7806,
7808,
7814,
7822,
7831,
7832,
7886,
7887,
8053,
8055,
8061,
8070,
8080,
8081,
8126,
8127,
8317,
8319,
8325,
8333,
8342,
8343,
8400,
8401,
8547,
8549,
8555,
8563,
8572,
8573,
8636,
8637,
8833,
8835,
8841,
8850,
8859,
8860,
8932,
8933,
9137,
9139,
9145,
9153,
9163,
9164,
9258,
9259,
9426,
9428,
9434,
9443,
9452,
9453,
9497,
9498,
9691,
9693,
9699,
9708,
9718,
9719,
9768,
9769,
9973,
9975,
9980,
9988,
9997,
9998,
10055,
10056,
10196,
10198,
10203,
10212,
10221,
10222,
10295,
10296,
10486,
10488,
10494,
10502,
10512,
10513,
10539,
10540,
10740,
10742,
10748,
10757,
10767,
10768,
10825,
10826,
10896,
10898,
10904,
10912,
10921,
10922,
10973,
10974,
11162,
11164,
11170,
11178,
11187,
11188,
11250,
11251,
11454,
11456,
11462,
11470,
11479,
11480,
11533,
11534,
11737,
11739,
11745,
11754,
11764,
11765,
11792,
11793,
11986,
11988,
11994,
12003,
12012,
12013,
12099,
12100,
12303,
12306,
12312,
12320,
12330,
12331,
12379,
12380,
12529,
12531,
12537,
12546,
12555,
12556,
12597,
12598,
12799,
12801,
12807,
12816,
12825,
12826,
12860,
12861,
13063,
13065,
13071,
13079,
13088,
13089,
13123,
13124,
13319,
13322,
13328,
13337,
13346,
13347,
13383,
13384,
13466,
13468,
13474,
13483,
13492,
13493,
13557,
13558
],
"line_end_idx": [
300,
301,
336,
337,
340,
346,
355,
365,
366,
405,
406,
602,
605,
611,
620,
630,
631,
730,
731,
925,
928,
934,
943,
953,
954,
987,
988,
1095,
1098,
1104,
1113,
1122,
1123,
1186,
1187,
1386,
1389,
1395,
1405,
1415,
1416,
1463,
1464,
1669,
1672,
1678,
1687,
1698,
1699,
1759,
1760,
1963,
1965,
1971,
1979,
1989,
1990,
2028,
2029,
2230,
2233,
2239,
2248,
2258,
2259,
2329,
2330,
2534,
2537,
2543,
2552,
2562,
2563,
2606,
2607,
2810,
2813,
2819,
2828,
2838,
2839,
2907,
2908,
3111,
3114,
3120,
3129,
3139,
3140,
3175,
3176,
3380,
3382,
3388,
3397,
3406,
3407,
3470,
3471,
3672,
3675,
3681,
3690,
3700,
3701,
3739,
3740,
3942,
3945,
3951,
3960,
3970,
3971,
4011,
4012,
4205,
4208,
4214,
4223,
4232,
4233,
4320,
4321,
4524,
4527,
4533,
4541,
4551,
4552,
4604,
4605,
4807,
4810,
4816,
4825,
4835,
4836,
4901,
4902,
5053,
5055,
5061,
5070,
5079,
5080,
5111,
5112,
5302,
5304,
5310,
5319,
5329,
5330,
5376,
5377,
5580,
5582,
5588,
5596,
5606,
5607,
5678,
5679,
5882,
5884,
5890,
5899,
5908,
5909,
5977,
5978,
6178,
6180,
6186,
6195,
6204,
6205,
6245,
6246,
6443,
6445,
6451,
6460,
6470,
6471,
6521,
6522,
6722,
6724,
6730,
6739,
6748,
6749,
6788,
6789,
6990,
6992,
6998,
7007,
7016,
7017,
7100,
7101,
7281,
7283,
7289,
7298,
7308,
7309,
7353,
7354,
7545,
7548,
7554,
7563,
7572,
7573,
7619,
7620,
7806,
7808,
7814,
7822,
7831,
7832,
7886,
7887,
8053,
8055,
8061,
8070,
8080,
8081,
8126,
8127,
8317,
8319,
8325,
8333,
8342,
8343,
8400,
8401,
8547,
8549,
8555,
8563,
8572,
8573,
8636,
8637,
8833,
8835,
8841,
8850,
8859,
8860,
8932,
8933,
9137,
9139,
9145,
9153,
9163,
9164,
9258,
9259,
9426,
9428,
9434,
9443,
9452,
9453,
9497,
9498,
9691,
9693,
9699,
9708,
9718,
9719,
9768,
9769,
9973,
9975,
9980,
9988,
9997,
9998,
10055,
10056,
10196,
10198,
10203,
10212,
10221,
10222,
10295,
10296,
10486,
10488,
10494,
10502,
10512,
10513,
10539,
10540,
10740,
10742,
10748,
10757,
10767,
10768,
10825,
10826,
10896,
10898,
10904,
10912,
10921,
10922,
10973,
10974,
11162,
11164,
11170,
11178,
11187,
11188,
11250,
11251,
11454,
11456,
11462,
11470,
11479,
11480,
11533,
11534,
11737,
11739,
11745,
11754,
11764,
11765,
11792,
11793,
11986,
11988,
11994,
12003,
12012,
12013,
12099,
12100,
12303,
12306,
12312,
12320,
12330,
12331,
12379,
12380,
12529,
12531,
12537,
12546,
12555,
12556,
12597,
12598,
12799,
12801,
12807,
12816,
12825,
12826,
12860,
12861,
13063,
13065,
13071,
13079,
13088,
13089,
13123,
13124,
13319,
13322,
13328,
13337,
13346,
13347,
13383,
13384,
13466,
13468,
13474,
13483,
13492,
13493,
13557,
13558,
13724
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 13724,
"ccnet_original_nlines": 403,
"rps_doc_curly_bracket": 0.0011658399598672986,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35254359245300293,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0423336885869503,
"rps_doc_frac_lines_end_with_ellipsis": 0.11386138945817947,
"rps_doc_frac_no_alph_words": 0.18356457352638245,
"rps_doc_frac_unique_words": 0.30453944206237793,
"rps_doc_mean_word_length": 4.676949977874756,
"rps_doc_num_sentences": 159,
"rps_doc_symbol_to_word_ratio": 0.02312343940138817,
"rps_doc_unigram_entropy": 5.592095375061035,
"rps_doc_word_count": 2269,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04692801088094711,
"rps_doc_frac_chars_dupe_6grams": 0.018092729151248932,
"rps_doc_frac_chars_dupe_7grams": 0.013381079770624638,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.009894460439682007,
"rps_doc_frac_chars_top_3gram": 0.004523179959505796,
"rps_doc_frac_chars_top_4gram": 0.0037693199701607227,
"rps_doc_books_importance": -1260.240234375,
"rps_doc_books_importance_length_correction": -1260.240234375,
"rps_doc_openwebtext_importance": -569.781005859375,
"rps_doc_openwebtext_importance_length_correction": -569.781005859375,
"rps_doc_wikipedia_importance": -451.951904296875,
"rps_doc_wikipedia_importance_length_correction": -451.951904296875
},
"fasttext": {
"dclm": 0.04448800906538963,
"english": 0.8843500018119812,
"fineweb_edu_approx": 1.2338858842849731,
"eai_general_math": 0.04441237077116966,
"eai_open_web_math": 0.11365944147109985,
"eai_web_code": 0.07019466161727905
}
} | {
"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": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,007,425,593,596,402,000 | />
X
Tech
Why you can trust ZDNET : ZDNET independently tests and researches products to bring you our best recommendations and advice. When you buy through our links, we may earn a commission. Our process
'ZDNET Recommends': What exactly does it mean?
ZDNET's recommendations are based on many hours of testing, research, and comparison shopping. We gather data from the best available sources, including vendor and retailer listings as well as other relevant and independent reviews sites. And we pore over customer reviews to find out what matters to real people who already own and use the products and services we’re assessing.
When you click through from our site to a retailer and buy a product or service, we may earn affiliate commissions. This helps support our work, but does not affect what we cover or how, and it does not affect the price you pay. Neither ZDNET nor the author are compensated for these independent reviews. Indeed, we follow strict guidelines that ensure our editorial content is never influenced by advertisers.
ZDNET's editorial team writes on behalf of you, our reader. Our goal is to deliver the most accurate information and the most knowledgeable advice possible in order to help you make smarter buying decisions on tech gear and a wide array of products and services. Our editors thoroughly review and fact-check every article to ensure that our content meets the highest standards. If we have made an error or published misleading information, we will correct or clarify the article. If you see inaccuracies in our content, please report the mistake via this form.
Close
How to upgrade Opera connections from HTTP to HTTPS
To keep your browser navigation as safe as possible, you should force connections to use HTTPS. Find out how to enable this feature in the Opera browser.
Written by Jack Wallen, Contributing Writer on
Reviewed by Min Shin
Web browser closeup on LCD screen with glowing padlock icon
iStockphoto/Getty Images
You've certainly heard of HTTP. Every web address starts with HTTP. Once upon a time, you had to type the HTTP for addresses. Now, you can just type www.zdnet.com and everything works as expected anyway.
And you've probably noticed that there's also HTTPS, which is the secure version of HTTP, as it encrypts data between the browser and the site. It should go without saying that the secure protocol is the better option. I'd go so far as to say it should be the only option.
Now, on the other side of things, you have the server that hosts the websites. Those websites should be set up such that they are served via HTTPS.
In most cases, you'll find that should be true of many of the sites you visit. Some sites are built for both HTTP and HTTPS and will accept either protocol from your browser. Smarter sites will accept both but automatically upgrade the connection from HTTP to HTTPS.
Also: How to create Opera VPN bypass rules to access the content you need
Not all sites are of the smarter type. When that is the case, it's up to the web browser to make the shift. Users might not know to type https://www.example.com, and may just type www.example.com in their address bar. If www.example.com isn't configured to automatically make that upgrade, the browser will use the HTTP protocol. If the site is configured to automatically upgrade the connection, the browser will use the HTTPS protocol. One is secure and one is not.
Because you can't trust every site to be configured properly, you'll want to force your browser to make the upgrade instead. In the Opera web browser, this is done by enabling a single feature, and I'm going to show you how.
A word of warning: If you have devices (such as routers and printers) on your network that aren't configured for HTTPS, they may not be reachable with this feature enabled. Fortunately, you can easily enable or disable the feature in case you need to access an HTTP site.
How to upgrade Opera connections from HTTP to HTTPS
1. Open Opera Settings
The first thing to do is open the Opera Settings window.
Also: How to use Opera's new Pinboard feature (and why you should)
Open the Opera browser and then click the red O in the upper left corner of the browser window. From the pop-up menu, click Settings.
The Opera menu.
Access Opera Settings through the O menu.
Jack Wallen/ZDNET
2. Access Security
In the resulting window, click "Privacy & security" in the left navigation. In the next window, click Security in the right pane.
The Opera Privacy & security window.
"Always use secure connections" is found under Security.
Jack Wallen/ZDNET
3. Enable 'Always use secure connections'
In the Security section, click the ON/OFF switch for "Always use secure connection" until it's in the ON position.
The Always use HTTPS entry in Security.
Enabling "Always use HTTPS" is but a click away.
Jack Wallen/ZDNET
You can now close the Settings tab. At this point, any site you visit will be forced into using HTTPS. If a site isn't configured for HTTPS, you might find it won't display in Opera. Should that happen, you can go back and disable the feature, visit the site, and (once you're done) re-enable the feature.
Also: Opera Workspaces is tab management perfection
Unfortunately, there's no way to add exemptions for sites, as the feature is all or none. But even when you do come across those rare sites that don't support HTTPS, the inconvenience of using this feature is worth it.
Editorial standards | {
"url": "https://www.zdnet.com/article/how-to-upgrade-opera-connections-from-http-to-https/",
"source_domain": "www.zdnet.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "612454",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FYV3MLCNIAGTD5IOCGTQJWY3PIJAUGWW",
"WARC-Concurrent-To": "<urn:uuid:a45dce1d-5505-4a9a-94a1-6b948c09fe82>",
"WARC-Date": "2023-09-24T12:12:52Z",
"WARC-IP-Address": "146.75.34.154",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5MDJR4YZYYHUJTD7YKRKZ3BME6A23LFL",
"WARC-Record-ID": "<urn:uuid:01103148-7c89-46cb-a2b3-e92bce188c36>",
"WARC-Target-URI": "https://www.zdnet.com/article/how-to-upgrade-opera-connections-from-http-to-https/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0b93267e-1cf4-44ea-9357-594c27f497b9>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-154\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
3,
5,
10,
206,
207,
254,
255,
635,
636,
1047,
1048,
1609,
1610,
1616,
1617,
1669,
1670,
1824,
1871,
1892,
1952,
1977,
1978,
2182,
2183,
2457,
2458,
2607,
2608,
2875,
2876,
2950,
2951,
3419,
3420,
3645,
3646,
3918,
3919,
3971,
3972,
3995,
3996,
4054,
4055,
4122,
4123,
4257,
4258,
4274,
4275,
4317,
4318,
4336,
4337,
4356,
4357,
4487,
4488,
4525,
4526,
4583,
4584,
4602,
4603,
4645,
4646,
4762,
4763,
4803,
4804,
4853,
4854,
4872,
4873,
5180,
5181,
5233,
5234,
5453,
5454
],
"line_end_idx": [
3,
5,
10,
206,
207,
254,
255,
635,
636,
1047,
1048,
1609,
1610,
1616,
1617,
1669,
1670,
1824,
1871,
1892,
1952,
1977,
1978,
2182,
2183,
2457,
2458,
2607,
2608,
2875,
2876,
2950,
2951,
3419,
3420,
3645,
3646,
3918,
3919,
3971,
3972,
3995,
3996,
4054,
4055,
4122,
4123,
4257,
4258,
4274,
4275,
4317,
4318,
4336,
4337,
4356,
4357,
4487,
4488,
4525,
4526,
4583,
4584,
4602,
4603,
4645,
4646,
4762,
4763,
4803,
4804,
4853,
4854,
4872,
4873,
5180,
5181,
5233,
5234,
5453,
5454,
5473
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5473,
"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.4171833395957947,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03897254168987274,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14880424737930298,
"rps_doc_frac_unique_words": 0.39308854937553406,
"rps_doc_mean_word_length": 4.68034553527832,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.275822162628174,
"rps_doc_word_count": 926,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02907245047390461,
"rps_doc_frac_chars_dupe_6grams": 0.019843099638819695,
"rps_doc_frac_chars_dupe_7grams": 0.019843099638819695,
"rps_doc_frac_chars_dupe_8grams": 0.019843099638819695,
"rps_doc_frac_chars_dupe_9grams": 0.019843099638819695,
"rps_doc_frac_chars_top_2gram": 0.010383020155131817,
"rps_doc_frac_chars_top_3gram": 0.006922009866684675,
"rps_doc_frac_chars_top_4gram": 0.010383020155131817,
"rps_doc_books_importance": -522.4569091796875,
"rps_doc_books_importance_length_correction": -522.4569091796875,
"rps_doc_openwebtext_importance": -271.10675048828125,
"rps_doc_openwebtext_importance_length_correction": -271.10675048828125,
"rps_doc_wikipedia_importance": -137.176025390625,
"rps_doc_wikipedia_importance_length_correction": -137.176025390625
},
"fasttext": {
"dclm": 0.019284779205918312,
"english": 0.9254416823387146,
"fineweb_edu_approx": 1.5437698364257812,
"eai_general_math": 0.054530199617147446,
"eai_open_web_math": 0.04845451936125755,
"eai_web_code": 0.23886561393737793
}
} | {
"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.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-1,842,049,983,945,540,600 | InterProcessConnection and NamedPipe
Hi,
I’m trying to communicate between different plugins and I’m not sure if I’m using NamedPips correctly.
I have a two different plugins, let’s call them master and slave.
There’s only one instance of the master plugin, but several instances of the slave plugin.
The slave holds a SharedResourcePointer to keep all the slaves in sync.
I SharedResourcePointer inherits from InterPluginComm, so I just need a simple two way communication:
class InterPluginComm : InterprocessConnection
{
public:
InterPluginComm()
{
auto created = createPipe ("Communication", 500, true);
auto connected = connectToPipe ("Communication", 500);
}
Problem A: The created is true but connected is always be false.
In the master the pluginprocessor inherits from InterPluginComm.
Problem B: Even if the slave did already create the pipe the master will create it again.
Any ideas?
Thanks | {
"url": "https://forum.juce.com/t/interprocessconnection-and-namedpipe/35975",
"source_domain": "forum.juce.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "20978",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7FU7WOEKZJ74QXLBZI55NNKICNCIOFWW",
"WARC-Concurrent-To": "<urn:uuid:145f89b1-1a7a-4ad1-9b3a-8d204eea8afd>",
"WARC-Date": "2022-08-16T21:39:57Z",
"WARC-IP-Address": "184.105.176.47",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KZPJDE3WNCIZC6S7J4COAYHAZBRCDNMI",
"WARC-Record-ID": "<urn:uuid:bc76b9c8-fa11-4229-aef0-c28d8dd884d1>",
"WARC-Target-URI": "https://forum.juce.com/t/interprocessconnection-and-namedpipe/35975",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:606e5882-1b34-46bc-aa83-a4a64164f46b>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-12\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,
37,
38,
42,
145,
146,
212,
303,
304,
376,
478,
479,
526,
528,
536,
554,
556,
616,
675,
677,
678,
743,
744,
809,
810,
900,
901,
912
],
"line_end_idx": [
37,
38,
42,
145,
146,
212,
303,
304,
376,
478,
479,
526,
528,
536,
554,
556,
616,
675,
677,
678,
743,
744,
809,
810,
900,
901,
912,
918
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 918,
"ccnet_original_nlines": 27,
"rps_doc_curly_bracket": 0.003267969936132431,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3550295829772949,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.047337278723716736,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21893490850925446,
"rps_doc_frac_unique_words": 0.6124030947685242,
"rps_doc_mean_word_length": 5.666666507720947,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.181501865386963,
"rps_doc_word_count": 129,
"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.03693569824099541,
"rps_doc_frac_chars_top_3gram": 0.07387141138315201,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -71.44790649414062,
"rps_doc_books_importance_length_correction": -71.44790649414062,
"rps_doc_openwebtext_importance": -40.751834869384766,
"rps_doc_openwebtext_importance_length_correction": -29.85631561279297,
"rps_doc_wikipedia_importance": -28.58226203918457,
"rps_doc_wikipedia_importance_length_correction": -28.58226203918457
},
"fasttext": {
"dclm": 0.07598186284303665,
"english": 0.8209647536277771,
"fineweb_edu_approx": 2.1545605659484863,
"eai_general_math": 0.9390007257461548,
"eai_open_web_math": 0.08505147695541382,
"eai_web_code": 0.5254504680633545
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
71,488,962,960,731,280 | Measuring xquery reqest
Hi all,
I’m measuring the performance of our tamino server, and I don’t see exactly what do these values mean:
TotalCommunicationDuration
TaminoServerDuration
My result:
5092 [main] DEBUG com.softwareag.tamino.db.api.logging - Timekeeper[operation=xquery, totalOperationDuration=4831, totalCommunicationDuration=4399, taminoServerDuration=445, xmlParseDuration=363]
So, communication is 4399 millisec.
What does exactly this mean? Network problem? When I use a much smaller database, result is quick.
So what does ‘totalCommunicationDuration’ involve (apart from serverduration)?
Thanks in advance
Zsolt
And the result XML document is about 27k, not a big one.
Hi
Tamino Server Duration - is the time taken for processing the request in the Tamino XML Server.
TotalCommunicationDuration - is the time taken from submitting the request to Tamino
until the response document is completely received. This also implies that TotalCommunicationDuration
includes the value for TaminoServerDuration.
Regards, Sri
Hello
Yes, I understand that. It’s in the documentation.
I’d like to know some more details about the communication duration.
TaminoServerDuration = processing query, result is ready to be written to the response stream
TaminoCommunicationDuration = sending result to the client
In my case, TaminoCommunicationDuration depends on the size of the database. When database is big, communication duration time increases (result is the same xml document, just selected from a bigger db).
That’s the point, I don’t understand.
What has any impact on the communicationDuration (apart from network configuration)?
Thank you for your answer.
Zsolt | {
"url": "https://tech.forums.softwareag.com/t/measuring-xquery-reqest/74745",
"source_domain": "tech.forums.softwareag.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "43430",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D3OGYNB5KBKQYSLIGYWNPWXLCINUWU56",
"WARC-Concurrent-To": "<urn:uuid:e72dfa8f-3a4c-4a25-82be-22e522ea25a2>",
"WARC-Date": "2022-01-18T20:04:31Z",
"WARC-IP-Address": "64.71.144.202",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TVFHZRO3KR3NSM2URQF7P3PKRCUX34J5",
"WARC-Record-ID": "<urn:uuid:56aac560-1d49-4864-afad-f8389aa8aeda>",
"WARC-Target-URI": "https://tech.forums.softwareag.com/t/measuring-xquery-reqest/74745",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e43044c0-823f-4088-8455-67901a6da327>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-78\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
24,
25,
33,
34,
137,
138,
165,
186,
187,
198,
199,
395,
396,
432,
433,
532,
533,
612,
613,
631,
632,
638,
639,
696,
697,
700,
701,
797,
882,
984,
1029,
1030,
1043,
1044,
1050,
1051,
1102,
1103,
1172,
1173,
1267,
1268,
1327,
1328,
1532,
1533,
1571,
1572,
1657,
1658,
1685,
1686
],
"line_end_idx": [
24,
25,
33,
34,
137,
138,
165,
186,
187,
198,
199,
395,
396,
432,
433,
532,
533,
612,
613,
631,
632,
638,
639,
696,
697,
700,
701,
797,
882,
984,
1029,
1030,
1043,
1044,
1050,
1051,
1102,
1103,
1172,
1173,
1267,
1268,
1327,
1328,
1532,
1533,
1571,
1572,
1657,
1658,
1685,
1686,
1691
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1691,
"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.32236841320991516,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029605260118842125,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23355263471603394,
"rps_doc_frac_unique_words": 0.5675675868988037,
"rps_doc_mean_word_length": 6.2207207679748535,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.550258636474609,
"rps_doc_word_count": 222,
"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.017378710210323334,
"rps_doc_frac_chars_top_3gram": 0.013034029863774776,
"rps_doc_frac_chars_top_4gram": 0.020275160670280457,
"rps_doc_books_importance": -127.14381408691406,
"rps_doc_books_importance_length_correction": -114.69741821289062,
"rps_doc_openwebtext_importance": -61.45159912109375,
"rps_doc_openwebtext_importance_length_correction": -61.45159912109375,
"rps_doc_wikipedia_importance": -28.484180450439453,
"rps_doc_wikipedia_importance_length_correction": -18.618688583374023
},
"fasttext": {
"dclm": 0.5021660923957825,
"english": 0.8590461611747742,
"fineweb_edu_approx": 1.3020163774490356,
"eai_general_math": 0.8217254877090454,
"eai_open_web_math": 0.3556252121925354,
"eai_web_code": 0.0918305516242981
}
} | {
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
3,660,932,049,218,219,500 | Dismiss
Announcing Stack Overflow Documentation
We started with Q&A. Technical documentation is next, and we need your help.
Whether you're a beginner or an experienced developer, you can contribute.
Sign up and start helping → Learn more about Documentation →
So there's a table of links on the web page, and I need the element indices. I know the names of the links. I tried the selenium.getElementIndex().intValue() command, hoping for an integer index.
But the getElementIndex() function requires a String locator as parameter. Not sure what to pass, since the only information about that element that I have is its name. Also, what kind of value does the getElementIndex() return?
share|improve this question
Here's the javadoc for Selenium.getElementIndex().
It will return an Number which is the index of the element selected and takes a String locator which is used to locate the element you're interested in on the HTML page and can be a number of things eg: -
• the id of the element
• some xPath
• etc
More details here.
share|improve this answer
This code will return the index of an element relative to it's parent. Only siblings with the same tag will be counted
int getElementIndex(WebElement element) {
WebElement parent = element.findElement(By.xpath(".."));
List<WebElement> siblings = parent.findElements(By.xpath("./" + element.getTagName()));
int i=0;
for (WebElement sibling : siblings) {
if (element.equals(sibling)) {
return i;
} else {
i++;
}
}
throw new NotFoundException(); // Should never happen
}
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/11753155/how-to-get-element-index-on-the-basis-of-its-text-using-java-and-selenium",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "76614",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZBBWNLEDXH3MZ6VSS7J7Q2GN3TRIZZQG",
"WARC-Concurrent-To": "<urn:uuid:0303c21f-468a-4d5c-bb66-e1d60be9a57f>",
"WARC-Date": "2016-07-29T02:38:20Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:K3FO4VI4Z3WLLZAQMXSYYPNB6UUQ35P2",
"WARC-Record-ID": "<urn:uuid:5e3b2999-a598-46c4-89cd-6ff6019b779c>",
"WARC-Target-URI": "http://stackoverflow.com/questions/11753155/how-to-get-element-index-on-the-basis-of-its-text-using-java-and-selenium",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c88bad66-58b7-4c17-be5d-267ca6b5cb8e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-27-174.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-30\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for July 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
8,
48,
49,
126,
127,
202,
203,
264,
265,
461,
690,
691,
719,
720,
771,
772,
977,
978,
1004,
1019,
1027,
1028,
1047,
1048,
1074,
1075,
1194,
1195,
1237,
1298,
1390,
1403,
1445,
1484,
1506,
1523,
1540,
1550,
1556,
1614,
1616,
1642,
1643,
1655,
1656,
1658,
1666,
1667,
1745,
1746
],
"line_end_idx": [
8,
48,
49,
126,
127,
202,
203,
264,
265,
461,
690,
691,
719,
720,
771,
772,
977,
978,
1004,
1019,
1027,
1028,
1047,
1048,
1074,
1075,
1194,
1195,
1237,
1298,
1390,
1403,
1445,
1484,
1506,
1523,
1540,
1550,
1556,
1614,
1616,
1642,
1643,
1655,
1656,
1658,
1666,
1667,
1745,
1746,
1836
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1836,
"ccnet_original_nlines": 50,
"rps_doc_curly_bracket": 0.004357299767434597,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3581267297267914,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019283749163150787,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23140496015548706,
"rps_doc_frac_unique_words": 0.5730769038200378,
"rps_doc_mean_word_length": 5.234615325927734,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.70255184173584,
"rps_doc_word_count": 260,
"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.02939015068113804,
"rps_doc_frac_chars_top_3gram": 0.02057310938835144,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -167.0694580078125,
"rps_doc_books_importance_length_correction": -166.06356811523438,
"rps_doc_openwebtext_importance": -102.22856903076172,
"rps_doc_openwebtext_importance_length_correction": -102.22856903076172,
"rps_doc_wikipedia_importance": -88.2472152709961,
"rps_doc_wikipedia_importance_length_correction": -88.24520874023438
},
"fasttext": {
"dclm": 0.26129239797592163,
"english": 0.7758264541625977,
"fineweb_edu_approx": 1.4536858797073364,
"eai_general_math": 0.000027539999791770242,
"eai_open_web_math": 0.08519936352968216,
"eai_web_code": 0.0002614900004118681
}
} | {
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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 |
-586,976,291,959,605,100 | Open demo account
MQH File
Back to topics list | 1 2 To post a new topic, please log in or register
avatar
130
Brygada 2010.04.06 10:37
Can anybody direct me to a link
that teaches how to create mqh file?
Or at least give me some simple example.
I did not find it in mql documentation.
Thanks for any possible help.
avatar
2025
gordon 2010.04.06 10:58 #
File > New > select 'Include (*.MQH)' > Next > name the file > Finish.
For your last example (https://forum.mql4.com/31046), you would have the following in your mqh file:
#import "GBSend.ex4"
double OutPutBid(double A, double B);
#import
And then instead of adding that to your main file, you would only need to add a #include statement to this mqh file (the file should be in the 'include' folder).
avatar
130
Brygada 2010.04.06 22:25 #
So, as I understand, the library SimpleLibrary.mqh
#property library
double OutPutBid(double A, double B)
{
double C;
C= A+B;
GlobalVariableSet("AAA",C);
return(C);
}
imports to SimpleMQH.mq4
#import "SimpleLibrary.ex4"
double OutPutBid(double A, double B);
#import
);
I do not see the sense why to import library to mqh and then to EA. What is the role of mqh file?
avatar
2568
Roger 2010.04.06 22:59 #
In your terminal directory
c:\Program Files\MetaTrader 4\experts\include\stderror.mqh
Someimes you don't need make a library, just a definition.
avatar
130
Brygada 2010.04.06 23:23 #
Roger wrote >>
In your terminal directory
c:\Program Files\MetaTrader 4\experts\include\stderror.mqh
Someimes you don't need make a library, just a definition.
So, what is the point of having mqh aside from library.
What is the role of mqh file?
When I start new mqh file, I see it lets
import DLLs and Libraries.
When I use in the EA
#import "stderror.mqh"
#import
How can I see these errors in the EA?
Thanks.
avatar
2568
Roger 2010.04.06 23:37 #
avatar
118
kennyhubbard 2010.04.06 23:41 #
An MQH file allows you to build your code in modular form. There are many routines that you may wish to use over and over. You can keep them in a separate files and still have it operate as part of you main EA without having to cut and paste it in each time.
I have found that it allows me to be far more organised in my coding. I sometimes have up to 5 MQH files in an EA if it is a complex project. I would have a files for just my variables, another for the bulk of the initialisation functions(4/5 digit brokers/Magic Number assignment, etc) and yet another that detects my trade entry and another that deals with trade execution and another that deals with trade exits and another that contains all the error management.
This is an extreme example, but while building a complex EA, it is sometimes usefull to just click a tab at the top of the Metaeditor and jump straight to the section I wish to deal with rather than scroll up and down through hundreds of lines of code.
I will probably condense most of it into one MQH at the end of the day and have a neat concise EA that simply calls the various routines from the MQH.
avatar
130
Brygada 2010.04.07 00:46 #
Thank you, guys.
May i ask you how can i display errors (of stderror.mq4) in this simple EA
#import "stderror.mqh"
#import
int init()
{
return(0);
}
int deinit()
{
return(0);
}
int start()
{
//Condition
Comment("Error ");
return(0);
}
Thank you.
avatar
130
Brygada 2010.04.07 03:17 #
Anybody can help, please?
avatar
2025
gordon 2010.04.07 04:38 #
Brygada:
May i ask you how can i display errors (of stderror.mq4) in this simple EA
GetLastError() function returns error code of last occurred error (https://docs.mql4.com/check/GetLastError). The error codes are defined in stderror.mqh, or u can see them here -> https://docs.mql4.com/constants/errors.
You can use ErrorDescription() function from stdlib.mqh to display a description of the error.
avatar
2025
gordon 2010.04.07 04:42 #
Brygada:
I do not see the sense why to import library to mqh and then to EA. What is the role of mqh file?
In the example above there is really no point. But imagine u had 20 functions in the library. U use only some of those in your current project, and u have 3 other projects that uses some or all of the functions. Wouldn't it be much easier to add a single #include statement to each project instead of adding the prototypes of 20 functions... It's more convenient.
Back to topics list | 1 2
To add comments, please log in or register
| {
"url": "https://forum.mql4.com/31074",
"source_domain": "forum.mql4.com",
"snapshot_id": "crawl=CC-MAIN-2016-22",
"warc_metadata": {
"Content-Length": "41770",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6XHYRAEJ6NJASNRCH7F6KCATD6QBIKDP",
"WARC-Concurrent-To": "<urn:uuid:38804d5c-698c-40b4-a3d1-4959b673caac>",
"WARC-Date": "2016-05-30T18:21:32Z",
"WARC-IP-Address": "78.140.180.31",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FQM2SAMHT6NKLQIZ22E5NQNZ6R6AKOHL",
"WARC-Record-ID": "<urn:uuid:3271983d-f41e-4657-8ebb-ef2b57a62cc9>",
"WARC-Target-URI": "https://forum.mql4.com/31074",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e8d8840f-73c8-442d-bcf7-39148548685b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-217-139.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
18,
19,
28,
29,
103,
110,
114,
139,
141,
142,
174,
211,
252,
292,
322,
323,
325,
332,
337,
363,
365,
436,
437,
538,
559,
600,
609,
771,
773,
780,
784,
811,
813,
864,
882,
919,
921,
931,
939,
967,
978,
980,
1005,
1033,
1071,
1079,
1082,
1083,
1084,
1085,
1086,
1087,
1088,
1186,
1193,
1198,
1223,
1225,
1226,
1253,
1312,
1313,
1372,
1373,
1375,
1382,
1386,
1413,
1415,
1430,
1431,
1458,
1517,
1518,
1577,
1578,
1634,
1664,
1705,
1732,
1753,
1776,
1784,
1822,
1830,
1832,
1839,
1844,
1869,
1871,
1878,
1882,
1914,
1916,
1917,
2176,
2177,
2644,
2645,
2898,
2899,
3050,
3051,
3053,
3060,
3064,
3091,
3093,
3110,
3185,
3208,
3216,
3217,
3228,
3230,
3241,
3243,
3256,
3258,
3269,
3271,
3283,
3285,
3299,
3320,
3331,
3333,
3344,
3351,
3355,
3382,
3384,
3410,
3417,
3422,
3448,
3450,
3459,
3534,
3535,
3756,
3757,
3852,
3853,
3855,
3862,
3867,
3893,
3895,
3904,
4002,
4003,
4367,
4368,
4370,
4400,
4401,
4444,
4445,
4447
],
"line_end_idx": [
18,
19,
28,
29,
103,
110,
114,
139,
141,
142,
174,
211,
252,
292,
322,
323,
325,
332,
337,
363,
365,
436,
437,
538,
559,
600,
609,
771,
773,
780,
784,
811,
813,
864,
882,
919,
921,
931,
939,
967,
978,
980,
1005,
1033,
1071,
1079,
1082,
1083,
1084,
1085,
1086,
1087,
1088,
1186,
1193,
1198,
1223,
1225,
1226,
1253,
1312,
1313,
1372,
1373,
1375,
1382,
1386,
1413,
1415,
1430,
1431,
1458,
1517,
1518,
1577,
1578,
1634,
1664,
1705,
1732,
1753,
1776,
1784,
1822,
1830,
1832,
1839,
1844,
1869,
1871,
1878,
1882,
1914,
1916,
1917,
2176,
2177,
2644,
2645,
2898,
2899,
3050,
3051,
3053,
3060,
3064,
3091,
3093,
3110,
3185,
3208,
3216,
3217,
3228,
3230,
3241,
3243,
3256,
3258,
3269,
3271,
3283,
3285,
3299,
3320,
3331,
3333,
3344,
3351,
3355,
3382,
3384,
3410,
3417,
3422,
3448,
3450,
3459,
3534,
3535,
3756,
3757,
3852,
3853,
3855,
3862,
3867,
3893,
3895,
3904,
4002,
4003,
4367,
4368,
4370,
4400,
4401,
4444,
4445,
4447,
4448
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4448,
"ccnet_original_nlines": 160,
"rps_doc_curly_bracket": 0.0017985600279644132,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3358924984931946,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0412667915225029,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.29462572932243347,
"rps_doc_frac_unique_words": 0.38767123222351074,
"rps_doc_mean_word_length": 4.5821919441223145,
"rps_doc_num_sentences": 78,
"rps_doc_symbol_to_word_ratio": 0.021113239228725433,
"rps_doc_unigram_entropy": 5.117691993713379,
"rps_doc_word_count": 730,
"rps_doc_frac_chars_dupe_10grams": 0.1482810229063034,
"rps_doc_frac_chars_dupe_5grams": 0.22571000456809998,
"rps_doc_frac_chars_dupe_6grams": 0.20448429882526398,
"rps_doc_frac_chars_dupe_7grams": 0.16681614518165588,
"rps_doc_frac_chars_dupe_8grams": 0.1482810229063034,
"rps_doc_frac_chars_dupe_9grams": 0.1482810229063034,
"rps_doc_frac_chars_top_2gram": 0.018834080547094345,
"rps_doc_frac_chars_top_3gram": 0.02391628921031952,
"rps_doc_frac_chars_top_4gram": 0.021524660289287567,
"rps_doc_books_importance": -471.993896484375,
"rps_doc_books_importance_length_correction": -471.993896484375,
"rps_doc_openwebtext_importance": -270.00616455078125,
"rps_doc_openwebtext_importance_length_correction": -270.00616455078125,
"rps_doc_wikipedia_importance": -236.0553741455078,
"rps_doc_wikipedia_importance_length_correction": -236.0553741455078
},
"fasttext": {
"dclm": 0.18348610401153564,
"english": 0.8254180550575256,
"fineweb_edu_approx": 1.997073769569397,
"eai_general_math": 0.3247082233428955,
"eai_open_web_math": 0.3442313075065613,
"eai_web_code": 0.013113380409777164
}
} | {
"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.0285",
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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 |
-3,094,878,178,976,672,300 | Mr. Abbey bought 8 plates and 12 drinking cuos from a shop. a plate cosr him ¢5 more than a drinking cup. if he spent ¢940 altogether, how m
Question
Mr. Abbey bought 8 plates and 12 drinking cuos from a shop. a plate cosr him ¢5 more than a drinking cup. if he spent ¢940 altogether, how much did a plate and a drinking cup cost?
in progress 0
Thu Giang 2 months 2021-07-27T17:44:53+00:00 1 Answers 5 views 0
Answers ( )
0
2021-07-27T17:46:37+00:00
Answer:
plate cost 50
cup cost 45
Step-by-step explanation:
(8×(X+5)) + (12×X) =940
x=45
therefore
plate cost 50
cup cost 45
Leave an answer
Browse
Giải phương trình 1 ẩn: x + 2 - 2(x + 1) = -x . Hỏi x = ? ( ) | {
"url": "https://documen.tv/question/mr-abbey-bought-8-plates-and-12-drinking-cuos-from-a-shop-a-plate-cosr-him-5-more-than-a-drinkin-23383374-72/",
"source_domain": "documen.tv",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "78721",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5NLQITPQP2AE3Q3QFVAETTV575KU6UHB",
"WARC-Concurrent-To": "<urn:uuid:94335ff1-24a9-4d88-8d69-6e93b77c3b67>",
"WARC-Date": "2021-10-16T14:34:43Z",
"WARC-IP-Address": "103.57.223.32",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EQ3SOOJNSQWWZCF3BRSQILTZYZT6SLVS",
"WARC-Record-ID": "<urn:uuid:ddba8bc7-5fe9-4b19-bb1a-b3676f6bc0bd>",
"WARC-Target-URI": "https://documen.tv/question/mr-abbey-bought-8-plates-and-12-drinking-cuos-from-a-shop-a-plate-cosr-him-5-more-than-a-drinkin-23383374-72/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9398e3ea-d606-4c74-8c30-48c431dc0705>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-184\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,
141,
142,
151,
152,
334,
335,
349,
414,
415,
427,
428,
434,
464,
465,
477,
478,
496,
497,
513,
514,
544,
545,
573,
574,
583,
584,
598,
599,
617,
618,
634,
635,
651,
652,
659,
660
],
"line_end_idx": [
141,
142,
151,
152,
334,
335,
349,
414,
415,
427,
428,
434,
464,
465,
477,
478,
496,
497,
513,
514,
544,
545,
573,
574,
583,
584,
598,
599,
617,
618,
634,
635,
651,
652,
659,
660,
721
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 721,
"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.1927083283662796,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02083333022892475,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.484375,
"rps_doc_frac_unique_words": 0.5378151535987854,
"rps_doc_mean_word_length": 4.092436790466309,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.987837791442871,
"rps_doc_word_count": 119,
"rps_doc_frac_chars_dupe_10grams": 0.4394250512123108,
"rps_doc_frac_chars_dupe_5grams": 0.521560549736023,
"rps_doc_frac_chars_dupe_6grams": 0.521560549736023,
"rps_doc_frac_chars_dupe_7grams": 0.4394250512123108,
"rps_doc_frac_chars_dupe_8grams": 0.4394250512123108,
"rps_doc_frac_chars_dupe_9grams": 0.4394250512123108,
"rps_doc_frac_chars_top_2gram": 0.036960989236831665,
"rps_doc_frac_chars_top_3gram": 0.07392197102308273,
"rps_doc_frac_chars_top_4gram": 0.0574948713183403,
"rps_doc_books_importance": -83.42667388916016,
"rps_doc_books_importance_length_correction": -83.47732543945312,
"rps_doc_openwebtext_importance": -46.89337921142578,
"rps_doc_openwebtext_importance_length_correction": -46.944034576416016,
"rps_doc_wikipedia_importance": -21.494260787963867,
"rps_doc_wikipedia_importance_length_correction": -21.544918060302734
},
"fasttext": {
"dclm": 0.685110867023468,
"english": 0.8656768798828125,
"fineweb_edu_approx": 1.3511428833007812,
"eai_general_math": 0.0559917688369751,
"eai_open_web_math": 0.07365400344133377,
"eai_web_code": 0.00007629000174347311
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"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": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
952,950,271,596,959,100 | Sunday, October 1, 2017
Until today, I hosted all my private Git repositories on my own Git server using Bonobo Git Server on an in-house Windows server.
I have been wanting to move this to GitHub for a while, because:
• I would have both my public and my private repositories in the same place (the public repositories were there already).
• GitHub is nicer and has a lot more features.
• Easier access when "on the road" with my laptop.
• I wouldn't have to run and maintain the Bonobo Git server anymore.
My only reason for not doing so, was that there was no easy way to backup the repositories hosted at GitHub.
My source code is one of my most valuable assets (think only of the hours of labor behind it), and I simply cannot afford to loose it.
GitHub might loose my data (like it happened to GitLab earlier this year), they may get hacked and go down for an extended period of time, or they might suddenly go out of business. Who knows. For me to use them, I need to have an automated and reliable backup system.
With my Bonobo Git Server, I simply backed up the data directories using standard Windows backup software.
You might argue that my local repositories already serve as backups of those on GitHub. The problem with this is that I have around 45 repositories that I work on at different times on different computers in different physical locations. I cannot manually keep track of what is updated where, and I don't want to have to worry about this. That is why I need ONE central repository of repositories - where all my latest bits are - and which is automatically backed up to some other service / location.
So to solve this, I have created the software "GitHub backup for Windows" (published as open source on GitHub of course) which automatically backups up all your GitHub repositories to a Windows computer. See more details in the README file.
And now all my Git repositories - public and private - are finally on GitHub :-)
PS: I know that similar tools / scripts exist for Python and "Bash"(?) already. But I use Windows, and I don't know Python or Bash. So for me, a Windows tool makes more sense.
Share: Facebook / LinkedIn / Google+ / Twitter
Copyright © 2006-2017 Jesper G. Høy | {
"url": "http://jesperhoy.com/p35/windows-software-to-automatically-backup-all-your-github-repositories",
"source_domain": "jesperhoy.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "15641",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IWNCLBVUQD47HODQDNB6FJUOKZTYEMQF",
"WARC-Concurrent-To": "<urn:uuid:c3f39cfc-5601-405f-b3e5-a759a4595413>",
"WARC-Date": "2017-10-19T01:56:06Z",
"WARC-IP-Address": "108.61.210.155",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:C5JAMVYV5BWRDN3QU7IRFLLT6T5MEFHM",
"WARC-Record-ID": "<urn:uuid:d3c6ae07-11ce-4e00-a75b-99d58e5b2f83>",
"WARC-Target-URI": "http://jesperhoy.com/p35/windows-software-to-automatically-backup-all-your-github-repositories",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:49015cc8-8b3c-4d5c-b851-11273987b456>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-170-163-85.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,
24,
25,
155,
156,
221,
222,
346,
395,
448,
519,
520,
629,
630,
765,
766,
1035,
1036,
1143,
1144,
1645,
1646,
1887,
1888,
1969,
1970,
2146,
2147,
2201
],
"line_end_idx": [
24,
25,
155,
156,
221,
222,
346,
395,
448,
519,
520,
629,
630,
765,
766,
1035,
1036,
1143,
1144,
1645,
1646,
1887,
1888,
1969,
1970,
2146,
2147,
2201,
2236
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2236,
"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.43103447556495667,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.043103449046611786,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16163793206214905,
"rps_doc_frac_unique_words": 0.4974619448184967,
"rps_doc_mean_word_length": 4.398477077484131,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.877847671508789,
"rps_doc_word_count": 394,
"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.020773230120539665,
"rps_doc_frac_chars_top_3gram": 0.025966530665755272,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -183.17703247070312,
"rps_doc_books_importance_length_correction": -183.17703247070312,
"rps_doc_openwebtext_importance": -96.68852996826172,
"rps_doc_openwebtext_importance_length_correction": -96.68852996826172,
"rps_doc_wikipedia_importance": -75.6197738647461,
"rps_doc_wikipedia_importance_length_correction": -75.6197738647461
},
"fasttext": {
"dclm": 0.018377359956502914,
"english": 0.9480493664741516,
"fineweb_edu_approx": 1.2847740650177002,
"eai_general_math": 0.5979337692260742,
"eai_open_web_math": 0.21551436185836792,
"eai_web_code": 0.6803852915763855
}
} | {
"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.778",
"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": "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": "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 |
3,494,127,598,227,203,600 | Categories
JAVA DATEBASE
Technology Network Community
Oracle Database
Fusion Middleware
Development Tools
Java
Desktop
Server & Storage Systems
Enterprise Management
Berkeley DB Family
Cloud Computing
Big Data
Business Intelligence
Architecture
Migration and Modernization
E-Business Suite
Siebel
PeopleSoft Enterprise
JD Edwards World
Industries
JD Edwards EnterpriseOne
User Productivity Kit Pro (UPK) and Tutor
Governance, Risk & Compliance (GRC)
Master Data Management (MDM)
Oracle CRM On Demand
On Demand: SaaS and Managed Applications
AutoVue Enterprise Visualization
Primavera
ATG
Agile PLM
Endeca Experience Management
Fusion Applications
Archived Forums
Tags
General Questions
TNS-12560: TNS:protocol adapter error
So, here's my problem: I've been told to go play with Oracle Designer 10g so that I can tutor some developers on how to test forms that they create (I don't know anything about Designer; everything I've done to this point has dealt exclusively with the Oracle Database Server and Oracle Application Server). It seems like only one repository can be installed on a database at a time, and in my mucking around I really don't want to blow away our developers' work, so I decided I'd install a new instance of a 10.1.0.3 database on my RHEL3 box and create a new Designer repository that I can screw around with. Installing the database appeared to go smoothely... now I need to talk to it. I can `ping` the box that the database is on just fine, but if I try a `tnsping` to the database instance, I receive: TNS-12560: TNS:protocol adapter error Naturally, attempting to connect to the database instance produces: ORA-12560: TNS:protocol adapter error I'm not really sure where to start troubleshooting this one. Thus far, I have done the following: Made sure the listener is up. Made sure the database is up. Made sure the database instance appears in `lsnrctl status` with a READY status. Triple-checked the syntax of my tnsnames.ora file. `tnsping` does correct identify the connect string to the database, and it does have the correct parentheses. Connected to the database locally (`sqlplus username@database` from the machine with "database"). Connected to another database from the new server (`sqlplus username@anotherDatabase` from the machine with "database"). Attempted to turn on tracing on the client machine: # sqlnet.ora Network Configuration File: $ORACLE_HOME/network/admin/sqlnet.ora # Generated by Oracle configuration tools. NAMES.DIRECTORY_PATH= (TNSNAMES, EZCONNECT) TRACE_LEVEL_CLIENT = USER ...to no avail, I might add (haven't been able to locate the trace file, or it isn't being created). Does anyone have any thoughts as to why I'm seeing this error? Is there even the slightest hope that someone will answer when threads only stay on the first page of postings for about 30 minutes on this forum?
Hi Pls post contents of your TNS and Listener files. Rgds Adnan
Database server's listener.ora: # listener.ora Network Configuration File: /opt/oracle/jersalem/network/admin/listener.ora # Generated by Oracle configuration tools. # trace levels 0=NONE 4=USER 10=ADMIN 16=SUPPORT SID_LIST_LISTENER = (SID_LIST = (SID_DESC = (SID_NAME = PLSExtProc) (ORACLE_HOME = /opt/oracle/jersalem) (PROGRAM = extproc) ) ) LISTENER = (DESCRIPTION_LIST = (DESCRIPTION = (ADDRESS_LIST = (ADDRESS = (PROTOCOL = IPC)(KEY = EXTPROC)) ) (ADDRESS_LIST = (ADDRESS = (PROTOCOL = TCP)(HOST = localhost)(PORT = 1521)) ) ) ) Database server's tnsnames.ora: # tnsnames.ora Network Configuration File: /opt/oracle/jersalem/network/admin/tnsnames.ora # Generated by Oracle configuration tools. JERSALEM = (DESCRIPTION = (ADDRESS = (PROTOCOL = TCP)(HOST = host.domain.com)(PORT = 1521)) (CONNECT_DATA = (SERVER = DEDICATED) (SERVICE_NAME = jersalem.host.domain.com) ) ) EXTPROC_CONNECTION_DATA = (DESCRIPTION = (ADDRESS_LIST = (ADDRESS = (PROTOCOL = IPC)(KEY = EXTPROC)) ) (CONNECT_DATA = (SID = PLSExtProc) (PRESENTATION = RO) ) ) Client's sqlnet.ora: # sqlnet.ora Network Configuration File: D:\oracle\devsuite-101202\network\admin\sqlnet.ora # Generated by Oracle configuration tools. SQLNET.AUTHENTICATION_SERVICES= (NTS) NAMES.DIRECTORY_PATH = (TNSNAMES) Client's tnsnames.ora: # tnsnames.ora Network Configuration File: D:\oracle\devsuite-101202\network\admin\tnsnames.ora # Generated by Oracle configuration tools. EXTPROC_CONNECTION_DATA = (DESCRIPTION = (ADDRESS_LIST = (ADDRESS = (PROTOCOL = TCP)(HOST = windowshostname.domain.com)(PORT = 1521)) ) (CONNECT_DATA = (SID = PLSExtProc) ) ) JERSALEM = (DESCRIPTION = (ADDRESS = (PROTOCOL = TCP)(HOST = host.domain.com)(PORT = 1521)) (CONNECT_DATA = (SERVER = DEDICATED) (SERVICE_NAME = jersalem.host.domain.com) ) )
...I've been down this road of troubleshooting with several other Oracle-certified coworkers already, however, so I doubt the contents of the $ORACLE_HOME/network/admin directories are to blame.
Is there even the slightest hope that someone will answer when threads only stay on the first page of postings for about 30 minutes on this forum? Umm, maybe. Some of us do read beyond the first page... It seems to me that your database server's listner.ora file is only configured for handling EXTPROC calls. Don't you need the GLOBAL_DB or at least some other SID name in there as well? That would explain why you can connect locally but not remotely. Cheers, APC
Well, we've been using a working 10.1.0.3 server's files as a template when we've been making changes. The working server is able to receive connections from anywhere. Working server's listener.ora # listener.ora Network Configuration File: /opt/oracle/oasdev/network/admin/listener.ora # Generated by Oracle configuration tools. SID_LIST_LISTENER = (SID_LIST = (SID_DESC = (SID_NAME = PLSExtProc) (ORACLE_HOME = /opt/oracle/oasdev) (PROGRAM = extproc) ) ) LISTENER = (DESCRIPTION_LIST = (DESCRIPTION = (ADDRESS_LIST = (ADDRESS = (PROTOCOL = IPC)(KEY = EXTPROC)) ) (ADDRESS_LIST = (ADDRESS = (PROTOCOL = TCP)(HOST = oasdev)(PORT = 1521)) ) ) ) This looks almost identical to the listener.ora on the 10.1.0.3 server, and has never been edited by human hands (except, of course, for my muddling with this copy to present the file nicely in HTML). In other words, this file was generated for us by the Oracle Installer, and it works perfectly for every client we've tried to connect to it with. This is where my Oracle-certified coworkers became confused. Why would we be seeing connection errors on one machine but not the other? Why only with Oracle software? Neither machine is using iptables or any other firewall. The only way in which the machines differ is that Oasdev is 64-bit RHEL3 (Taroon) and Jersalem is 32-bit CentOS 4.1 (Final). They are otherwise 100% identical - they were even assembled into the same model number of case.
I think your problem is in the use of localhost in the listener.ora, you need to have the server name. Compare the "working" server with the other one. localhost is generally 127.0.0.1 which is the wrong IP address. Database server listener.ora LISTENER = (DESCRIPTION_LIST = (DESCRIPTION = (ADDRESS_LIST = (ADDRESS = (PROTOCOL = IPC)(KEY = EXTPROC)) ) (ADDRESS_LIST = (ADDRESS = (PROTOCOL = TCP)(HOST = localhost)(PORT = 1521)) ) ) ) Working server listener.ora LISTENER = (DESCRIPTION_LIST = (DESCRIPTION = (ADDRESS_LIST = (ADDRESS = (PROTOCOL = IPC)(KEY = EXTPROC)) ) (ADDRESS_LIST = (ADDRESS = (PROTOCOL = TCP)(HOST = oasdev)(PORT = 1521)) ) ) ) HTH John
Jeez. I've been fighting this issue on and off for a few weeks. I pretty much tried all the recommendations in this string already. I entered a TAR forwarding all my client and server traces. Oracle worked with me several days. The short of it was that they determined that the client was performing correctly but that the listener was not receiving the connection request so it must be the server or network. My server and Linux (RH 2.6.9-22.0.1.ELsmp) admins have checked and rechecked, removed all security, etc to try to resolve this. No luck to date. So I'm sitting here with a new server and a new Oracle install. In short, all dressed up and no place to go! Frustration level: Meltdown My recent TAR 4846448.993 - TNSPING FAILS (TNS-12560, TNS-00538 BETWEEN WIN XP CLIENTS AND LINUX DB SERVER. if you want Oracle to refer to anything to support your claims!
Hmm... yeah, that could cause problems. I fixed that and restarted the listener, to no avail. Just to be sure, I did `ping hostname` from the server to make sure that the IP was resolving correctly (and not to 127.0.0.1 again). Then I restarted both the listener and the database server, just in case Oracle had some undocumented relations (don't get me started on what Oracle doesn't document...), and I'm still not able to make a connection from my Windows client to the Linux server. The error message isn't even changing... (grr...) Oh yeah, one other note: I'm not just seeing connection difficulties between this server and Windows XP installations. I can't make any Oracle software connect to this server from anywhere (but can still SSH, SFTP, ICMP-ECHO, etc), including other CentOS, RHEL3, Mandriva, and Solaris, and Windows 2000 platforms. There may be other networking issues gumming up the process, but I've been similarly assured that there's no reason this thing shouldn't be talking back to everybody.
Same here. All Oracle client connections from any Windows XP, 2000, and Linux box fails with the 12560. All other connectivity SSH, etc like you listed works great. My underlying TNSPING trace records a primary transport protocol error of 538. For me this error happens when a trying to create and use a socket after a "tcp.validnode_checking not turned on" entry. Try adding a TNSPING trace on your client SQLNET.ORA if you haven't already. Set the trace level to 16. I'm still trying to figure out how to decode this error. An old Oracle note 117976,1 says to reference /usr/include/sys/errno.h. I don't see anything in there I can use however.
I have the same problem with 10g on a XP machine when I try to use sqlplus /nolog to start the database. I always get the adapter error. I have to start it using window's services and I can only log in from sql*plus. thanks. ben
Hi, I'm also facing this error from last few days.I'm not gettitng any solution even though I've created a tar for it.I've installed 9.2.0.6 on linux RHEL4. Both listener and database are running fine on the server,but when I'm doing tnsping from the client XP it's not working and giving the error TNS-12560.Please provide the solution at the earliest.
My problem is solved!! Issue a telnet <host> <port> and see if the attempt fails. If it does, that means the Oracle port (1521 in my case) is blocked. Go into the Security Level Configuration on your Linux server. In Other Ports, specifically enter <port>:tcp, (example 1521:tcp. When I did this, my connectivity issues vaporized! Hopefully yours does as well... Now I'm going to buy myself a well deserved cup of coffee! Also in celebration, I will now demonstrate the proper way to perform a cartwheel for my coworkers:-) Dale
omg ...who's bright idea was it to put a "firewall" on top of a perfectly good iptables install/config? (Well, that solves my problems... now I feel really incompetent...)
Hi, I'm installing 8i on my windows 2000 server.While creating database during the installation it's throwing the error ORA-12560 TNS:protocol adapter error.Please guide.
Related Links
Duplicated entries in a valid unique index
cannot download from download.oracle.com
How does oracle client works with oracle database?
Putting different tables with large amounts of data together
Cold backup recovery - ORA-01092
RMAN Backup
imp backup
Can't find patch for uprade oracle 10g Application ser 10.1.2.3 to 10.1.3.3
Need light on concept : Index
is it a good choice
dbms_sqltune - table does not exist
memory requirements for query
Oracle Streams and Oracle Replication
Archivelog Issue
Don't Miss the Session of Lewis..in HYDERABAD
cannot download oracle! | {
"url": "http://www.oracle-java.com/article/4025569/TNS-12560:+TNS:protocol+adapter+error",
"source_domain": "www.oracle-java.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "29972",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FN5XE7EQEOYWECUWIECHJYI72UNA3QDS",
"WARC-Concurrent-To": "<urn:uuid:eb3517f0-2da9-47a9-9c11-5d017626676c>",
"WARC-Date": "2013-12-06T04:29:07Z",
"WARC-IP-Address": "108.171.202.68",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:SJIW7NH7CWFK7MNXGLQJ44T6HTBJIVIF",
"WARC-Record-ID": "<urn:uuid:8c112efb-fdb8-4f5f-80c4-e02fe0390947>",
"WARC-Target-URI": "http://www.oracle-java.com/article/4025569/TNS-12560:+TNS:protocol+adapter+error",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5a8d8ec2-ec62-4468-adab-b31eb906d580>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
11,
12,
26,
55,
71,
89,
107,
112,
120,
145,
167,
186,
202,
211,
233,
246,
274,
291,
298,
320,
337,
348,
373,
415,
451,
480,
501,
542,
575,
585,
589,
599,
628,
648,
664,
665,
667,
668,
669,
670,
675,
676,
694,
695,
696,
734,
735,
736,
2868,
2869,
2933,
2934,
4935,
4936,
5131,
5132,
5609,
5610,
7137,
7138,
7905,
7906,
8783,
8784,
9807,
9808,
10464,
10465,
10696,
10697,
11056,
11057,
11595,
11596,
11769,
11770,
11946,
11947,
11948,
11962,
11963,
12006,
12047,
12098,
12159,
12192,
12204,
12215,
12291,
12321,
12341,
12377,
12407,
12445,
12462,
12508
],
"line_end_idx": [
11,
12,
26,
55,
71,
89,
107,
112,
120,
145,
167,
186,
202,
211,
233,
246,
274,
291,
298,
320,
337,
348,
373,
415,
451,
480,
501,
542,
575,
585,
589,
599,
628,
648,
664,
665,
667,
668,
669,
670,
675,
676,
694,
695,
696,
734,
735,
736,
2868,
2869,
2933,
2934,
4935,
4936,
5131,
5132,
5609,
5610,
7137,
7138,
7905,
7906,
8783,
8784,
9807,
9808,
10464,
10465,
10696,
10697,
11056,
11057,
11595,
11596,
11769,
11770,
11946,
11947,
11948,
11962,
11963,
12006,
12047,
12098,
12159,
12192,
12204,
12215,
12291,
12321,
12341,
12377,
12407,
12445,
12462,
12508,
12531
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 12531,
"ccnet_original_nlines": 96,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2856600880622864,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.09484066814184189,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2955235242843628,
"rps_doc_frac_unique_words": 0.3787878751754761,
"rps_doc_mean_word_length": 5.434731960296631,
"rps_doc_num_sentences": 178,
"rps_doc_symbol_to_word_ratio": 0.009484070353209972,
"rps_doc_unigram_entropy": 5.799509048461914,
"rps_doc_word_count": 1716,
"rps_doc_frac_chars_dupe_10grams": 0.11001501232385635,
"rps_doc_frac_chars_dupe_5grams": 0.19011366367340088,
"rps_doc_frac_chars_dupe_6grams": 0.14368431270122528,
"rps_doc_frac_chars_dupe_7grams": 0.11001501232385635,
"rps_doc_frac_chars_dupe_8grams": 0.11001501232385635,
"rps_doc_frac_chars_dupe_9grams": 0.11001501232385635,
"rps_doc_frac_chars_top_2gram": 0.019300879910588264,
"rps_doc_frac_chars_top_3gram": 0.027879050001502037,
"rps_doc_frac_chars_top_4gram": 0.019300879910588264,
"rps_doc_books_importance": -1199.690185546875,
"rps_doc_books_importance_length_correction": -1199.690185546875,
"rps_doc_openwebtext_importance": -549.0101928710938,
"rps_doc_openwebtext_importance_length_correction": -549.0101928710938,
"rps_doc_wikipedia_importance": -468.154052734375,
"rps_doc_wikipedia_importance_length_correction": -468.154052734375
},
"fasttext": {
"dclm": 0.21790659427642822,
"english": 0.8907431364059448,
"fineweb_edu_approx": 1.8074841499328613,
"eai_general_math": 0.744066596031189,
"eai_open_web_math": 0.2241634726524353,
"eai_web_code": 0.5795203447341919
}
} | {
"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": "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": "-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": "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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-7,184,175,459,301,047,000 | Ansible: Idempotent Playbooks
Image for post
Image for post
Ansible enables infrastructure as code. It has been a valuable tool for my infrastructure@home project, helping me to setup the programs Consul and Nomad, to provide DNS for nodes and services, and an Nginx endpoint. Although this infrastructure was completely replaced by Kubernetes, Ansible is a tool that stayed and provides continuous support for system maintenance tasks.
Having worked with Ansible for a longer time, my scripts now reside in one well-structured directory. From here, I can run individual tasks as well as running the complete site.yml to apply one consistent configuration state to all systems. It is also helpful to consider uninstallers that will remove unwanted configuration or software. And to achieve idempotency of your playbook, it is important to truly understand the Ansible modules that you are using. All of these is detailed in this article.
This article originally appeared at my blog.
Effective Directory Layout
All ansible code is contained within one single directory. At the time of writing this article, this directory looks like this:
├── ansible.cfg
├── host_vars
│ ├── raspi-3-1.yml
│ ├── ...
├── group_vars
├── roles
│ ├── consul
│ ├── docker-arch
│ ├── docker-arm
│ ├── nfs-client
│ ├── nfs-server
│ └── nomad
├── scripts
│ ├── consul
│ ├── nomad
│ ├── configs
│ ├── jobs
│ ├── system
│ ├── update_packages.yaml
│ ├── tutorial
│ └── uninstall
├── hosts
└── site.yml
The directory is structured according to these principles:
• Global config files in directory root: The ansible config files ansible.cfg and the inventory hosts.
• Global playbook: The playbook site.yml is an idempotent playbook that, when executed, configures all nodes with all the infrastructure systems that I have. Effectively it installs all the roles on all nodes and patches the nodes to the newest OS packages.
• Global vars: The group_vars directory contains global variables, especially the IP addresses for the Nomad, Consul and NFS servers. In the host_vars directory, I include a file for each node that determines its Nomad/Consul/NFS role as being master or agent.
• Separating roles and scripts: The roles directory contains playbooks that install infrastructure systems. These are the ansible roles I explained in earlier articles. In scripts are commands that are executed regularly, things like updating the nodes or restarting processes on the nodes. I also include the deployments of Nomad jobs, including config files for programs, inside the script directory.
Uninstaller
Ansible is concerned with providing repayable, consistent configuration for systems. But sometimes you need to undo these changes. If it’s just uninstalling software with the respective package management software, this is an easy task. But what about other configuration: Custom service files, configuration files, added configuration lines to central system files like /etc/mount or /etc/ssh/sshs_config?
There is no uninstaller in Ansible, but every change you make can be undone. Write this uninstaller yourself! Write it as soon as you are finished with the installation part, because its fresh on your mind and you can test it with your system.
I structure the playbooks into an install and uninstall block. These blocks are invoked by passing the uninstall=true parameter to the run.
Here is a shortened example for installing dnsmasq.
- block:
- name: Install dnsmasq
apt:
name: dnsmasq
state: present
- name: Configure dnsmasq
lineinfile:
path: /etc/dnsmasq.d/10_consul
create: true
line: server=/consul/192.168.2.201#8600
regexp: consul
state: present
when: uninstall is not defined
- block:
- name: Uninstall
apt:
name: dnsmasq
state: absent
- file:
path: /etc/dnsmasq.d
state: absent
when: uninstall is defined and uninstall
When this playbook is run as ansible-playbook ... -e "{uninstall: true}, the output is as follows:
ansible-playbook site.yml --limit=raspi-3-1 --tags dns -e "{uninstall: true}"
PLAY [Configure DNS] ***********************************************************************************************************************TASK [dns : Install dnsmasq] ***************************************************************************************************************
skipping: [raspi-3-1]
TASK [dns : Configure dnsmasq] *************************************************************************************************************
skipping: [raspi-3-1]
TASK [dns : Restart dnsmasq] ***************************************************************************************************************
skipping: [raspi-3-1]
TASK [dns : Uninstall] *********************************************************************************************************************
changed: [raspi-3-1]
TASK [dns : file] **************************************************************************************************************************
changed: [raspi-3-1]
Idempotent Playbooks
When a playbook is executed to configure a system, the system should always have the same, well defined state. If a playbook consists of 10 steps, and the system deviates in step 4 from the desired state, then only this particular step should be applied.
By its nature, Ansible tasks will only change the system if there is something to do. Most Ansible modules provide this idempotency. But some modules can be used in a way that breaks this pattern. I cannot cover all modules, but want to highlight this point with one example: The module Line in File.
Let’s consider the setup of mounting an NFS volume. On the clients, you need to add an entry to etc/fstab for telling the system where the NFS server is. The first version of this change is this:
- name: Create fstab entry
lineinfile:
path: /etc/fstab
line: '{{ nfs_dir_server_ip }}:{{ nfs_dir_mnt_path }} {{ nfs_dir_mnt_path }} nfs defaults,soft,bg,noauto,rsize=32768,wsize=32768,noatime 0 0'
state: present
The particular output is dependent on three variables. If one of the variables change, and the playbook is executed again, it will create a new entry into /etc/fstab. The mounts will not work!
You want only one entry for NFS shares in this file. And for this, you can use the additional regexp parameter. The second version of this playbook uses the regexp parameter to only and ever add one line to /etc/fstab. This simple change makes the playbook idempotent.
- name: Create fstab entry
lineinfile:
path: /etc/fstab
line: '{{ nfs_dir_server_ip }}:{{ nfs_dir_mnt_path }} {{ nfs_dir_mnt_path }} nfs defaults,soft,bg,noauto,rsize=32768,wsize=32768,noatime 0 0'
regex: 'nfs defaults,soft,bg,noauto'
state: present
Whenever you use a module, take care to use it idempotently.
Conclusion
During continuous use of Ansible, my collection of individual scripts evolved into one effective directory structure. Knowing exactly where to put which playbook, variables or configuration files is essential. Also, when writing a playbook, always add an uninstaller so you can undo changes to the system. Finally, be sure to write idempotent playbooks so that repetitive playbook execution always results in one well defined, consistent system state.
Written by
IT Project Manager & Developer
Get the Medium app
A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store | {
"url": "https://admantium.medium.com/ansible-idempotent-playbooks-a89bb0e012c9?readmore=1&source=---------7----------------------------",
"source_domain": "admantium.medium.com",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "151670",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GHBUQHA55Y3WQW3VJ76HUVQ5UEJ4FTYE",
"WARC-Concurrent-To": "<urn:uuid:988f47ce-79da-403c-bf8e-3197c4ff77de>",
"WARC-Date": "2021-01-17T00:39:44Z",
"WARC-IP-Address": "104.17.31.52",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Y23EN7QKEVI4IV6IBV2SFMAOOJQ4PI3J",
"WARC-Record-ID": "<urn:uuid:6d97d406-6678-4c61-bf62-f07a2ff61708>",
"WARC-Target-URI": "https://admantium.medium.com/ansible-idempotent-playbooks-a89bb0e012c9?readmore=1&source=---------7----------------------------",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2f1298c9-a70a-47a6-8adf-fa25f0161b40>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-59.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,
30,
31,
46,
61,
62,
439,
440,
941,
942,
987,
988,
1015,
1016,
1144,
1145,
1161,
1175,
1195,
1205,
1220,
1230,
1243,
1261,
1278,
1295,
1312,
1324,
1336,
1349,
1361,
1375,
1386,
1399,
1426,
1441,
1457,
1467,
1480,
1481,
1540,
1541,
1646,
1906,
2169,
2574,
2575,
2587,
2588,
2995,
2996,
3240,
3241,
3381,
3382,
3434,
3435,
3444,
3468,
3473,
3487,
3502,
3528,
3540,
3571,
3584,
3624,
3639,
3654,
3685,
3694,
3712,
3717,
3731,
3745,
3753,
3774,
3788,
3829,
3830,
3929,
3930,
4008,
4289,
4311,
4452,
4474,
4615,
4637,
4778,
4799,
4940,
4961,
4962,
4983,
4984,
5239,
5240,
5541,
5542,
5738,
5739,
5766,
5778,
5795,
5937,
5952,
5953,
6146,
6147,
6416,
6417,
6444,
6456,
6473,
6615,
6652,
6667,
6668,
6729,
6730,
6741,
6742,
7194,
7195,
7206,
7207,
7238,
7239,
7258,
7259,
7360
],
"line_end_idx": [
30,
31,
46,
61,
62,
439,
440,
941,
942,
987,
988,
1015,
1016,
1144,
1145,
1161,
1175,
1195,
1205,
1220,
1230,
1243,
1261,
1278,
1295,
1312,
1324,
1336,
1349,
1361,
1375,
1386,
1399,
1426,
1441,
1457,
1467,
1480,
1481,
1540,
1541,
1646,
1906,
2169,
2574,
2575,
2587,
2588,
2995,
2996,
3240,
3241,
3381,
3382,
3434,
3435,
3444,
3468,
3473,
3487,
3502,
3528,
3540,
3571,
3584,
3624,
3639,
3654,
3685,
3694,
3712,
3717,
3731,
3745,
3753,
3774,
3788,
3829,
3830,
3929,
3930,
4008,
4289,
4311,
4452,
4474,
4615,
4637,
4778,
4799,
4940,
4961,
4962,
4983,
4984,
5239,
5240,
5541,
5542,
5738,
5739,
5766,
5778,
5795,
5937,
5952,
5953,
6146,
6147,
6416,
6417,
6444,
6456,
6473,
6615,
6652,
6667,
6668,
6729,
6730,
6741,
6742,
7194,
7195,
7206,
7207,
7238,
7239,
7258,
7259,
7360,
7461
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7461,
"ccnet_original_nlines": 131,
"rps_doc_curly_bracket": 0.0037528499960899353,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.299496054649353,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017998559400439262,
"rps_doc_frac_lines_end_with_ellipsis": 0.007575760129839182,
"rps_doc_frac_no_alph_words": 0.2620590329170227,
"rps_doc_frac_unique_words": 0.35777124762535095,
"rps_doc_mean_word_length": 5.218963623046875,
"rps_doc_num_sentences": 65,
"rps_doc_symbol_to_word_ratio": 0.0021598299499601126,
"rps_doc_unigram_entropy": 5.345696926116943,
"rps_doc_word_count": 1023,
"rps_doc_frac_chars_dupe_10grams": 0.051695071160793304,
"rps_doc_frac_chars_dupe_5grams": 0.08447275310754776,
"rps_doc_frac_chars_dupe_6grams": 0.06293313205242157,
"rps_doc_frac_chars_dupe_7grams": 0.06293313205242157,
"rps_doc_frac_chars_dupe_8grams": 0.06293313205242157,
"rps_doc_frac_chars_dupe_9grams": 0.06293313205242157,
"rps_doc_frac_chars_top_2gram": 0.010488860309123993,
"rps_doc_frac_chars_top_3gram": 0.010488860309123993,
"rps_doc_frac_chars_top_4gram": 0.014609480276703835,
"rps_doc_books_importance": -640.9100952148438,
"rps_doc_books_importance_length_correction": -640.9100952148438,
"rps_doc_openwebtext_importance": -363.4335021972656,
"rps_doc_openwebtext_importance_length_correction": -363.4335021972656,
"rps_doc_wikipedia_importance": -254.34422302246094,
"rps_doc_wikipedia_importance_length_correction": -254.34422302246094
},
"fasttext": {
"dclm": 0.019247889518737793,
"english": 0.8040231466293335,
"fineweb_edu_approx": 1.8596998453140259,
"eai_general_math": 0.5018725991249084,
"eai_open_web_math": 0.12514334917068481,
"eai_web_code": 0.7694613337516785
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
1,227,298,065,574,516,700 | 文房四宝是中国传统的文房用品之一，包括笔、墨、纸、砚。随着互联网技术的发展和人们对传统文化的热爱，文房四宝网站也应运而生。本文将从定义、分类、举例和比较等方面，客观、专业、清晰和系统地介绍文房四宝网站开发的相关知识。
文房四宝网站开发
在定义方面，文房四宝网站是指以笔、墨、纸、砚为主题，提供相关产品、知识、文化和服务的网站。这类网站通过展示与文房四宝有关的资讯、商品推荐、学习教程等内容，吸引用户关注和参与。
根据功能和目标受众的不同，文房四宝网站可以分为多个类别。一类是文房四宝在线商城，专门销售各类笔、墨、纸、砚及相关用品。这类网站提供方便快捷的购物平台，方便用户购买到优质的文房用品。
另一类是文房四宝知识平台，主要提供与文房用品相关的知识、历史、文化等内容。这类网站可以介绍不同类型的笔、墨、纸、砚的特点和使用方法，教授书法技巧，分享文房四宝的文化价值。网站上可以介绍不同品牌的毛笔，比较它们的特点和适用场景，帮助用户选择合适的笔。
还有一类是文房四宝社交平台，目的是为文房爱好者提供交流、分享和互动的平台。这类网站可以设立论坛、博客、社交媒体账号等，方便用户发表笔墨纸砚相关的文章、作品或心得，并与其他用户进行交流和互动。
文房四宝网站开发也面临着一些挑战和机遇。开发者需要与文房用品供应商合作，确保网站上展示的产品质量和真实性。需要采集和整理大量的文房相关知识和文化资料，保证网站内容的权威性和丰富性。还需要注意用户体验和界面设计，使网站易于浏览和操作。
文房四宝网站开发是应对互联网时代传统文化发展的需求，为用户提供方便快捷的购物渠道、丰富多样的知识学习和交流平台。随着人们对传统文化的重视和热爱程度的提高，文房四宝网站将会越来越受到关注和喜爱。
网站开发文本模版
一、网站开发的重要性
互联网已经成为人们生活中不可或缺的一部分。无论是企业还是个人，都离不开互联网的支持和帮助。而要在互联网上拥有自己的一片天地，就必须进行网站开发。网站开发可以理解为建造一个属于自己的“网络房子”，它可以展示你的信息、商品或服务，为你赚取利润，增加知名度。虽然网站开发听起来很高大上，但它可以通过一个简单易懂的比方来理解。
二、网站开发就像建造一栋房子
1. 地基构建（网站的基础）
在建造一栋房子时，地基是非常重要的。它支撑整座房子的结构，决定了房子是否能够稳固耐用。同样，网站开发的第一步也是要构建一个稳固的地基。这就是选择适合的网站开发平台或框架，确保网站的稳定性和可扩展性。
2. 结构搭建（网站的框架）
房子的框架决定了房子的形状和结构。同样，网站的框架也是非常重要的。它决定了网站的整体布局和功能模块的安排。在网站开发中，我们需要设计一个合理的页面布局，并确定各个页面之间的导航关系，确保用户能够方便地浏览和使用网站。
3. 外观装饰（网站的界面设计）
房子的外观装饰决定了房子的美观程度，能否吸引人的眼球。同样，网站的界面设计也是非常重要的。一个好看并且符合用户口味的网站界面可以提高用户的满意度和留存率。在网站开发中，我们需要选择合适的颜色、排版、图标等元素，并将其合理地融入到网站中，以提高用户体验。
4. 功能实现（网站的核心）
房子的核心是给人提供一个温馨舒适的居住环境。同样，网站的核心是提供特定的功能和服务。在网站开发中，我们可以通过编写代码来实现网站的各种功能，例如用户注册、登录、购物等，以满足用户的需求。
5. 优化改进（网站的提升）
房子建好后，难免会有一些问题出现，例如漏雨、漏风等。同样，网站建好后也可能存在一些问题，例如加载速度慢、兼容性差等。在网站开发完成后，我们需要不断进行优化改进，以提高网站的性能和用户体验。
三、结语
通过上面的比方，我们可以更加直观地了解网站开发的过程和重要性。一个成功的网站就像一栋经过精心设计和施工的房子，不仅能够吸引用户的眼球，还能够提供丰富的功能和优质的服务。无论是企业还是个人，都应该重视网站开发，通过合理的规划和设计，打造一个能够满足用户需求的网站。我们才能在竞争激烈的互联网市场中占据一席之地。
淘宝网站开发方案
标题：探讨淘宝网站开发方案，开启电商创业新篇章
在电子商务行业中，淘宝网站开发方案是一个至关重要的话题。随着互联网的快速发展，越来越多的人开始选择在线购物，而淘宝作为中国最大的电子商务平台，无疑是开展电商业务的首选之一。本文将深入探讨淘宝网站开发方案，为读者呈现一个具体的指南，帮助创业者们在这个竞争激烈的市场中取得成功。
文章内容及结构：
一、淘宝网站开发方案概述
1.1 淘宝网站的背景和发展现状
1.2 淘宝网站开发的重要性及优势
二、淘宝网站开发的流程与策略
2.1 需求分析与产品定位
2.2 网站架构设计与界面优化
2.3 功能开发与数据库设计
2.4 测试与上线
三、淘宝网站开发中需要注意的关键问题
3.1 用户体验与界面设计
3.2 安全性与数据保护
3.3 移动端适配与响应式设计
四、成功案例分析与启示
4.1 京东与拼多多的发展经验
4.2 阿里巴巴的电商生态圈建设
五、总结与展望
5.1 淘宝网站开发方案的价值与意义
5.2 未来电商市场的发展趋势
5.3 对创业者的建议与思考
正文：
一、淘宝网站开发方案概述
1.1 淘宝网站的背景和发展现状
淘宝作为中国最大的电子商务平台，已经成为绝大部分电商创业者的首选。它为卖家提供了丰富的电商工具和优质的用户资源，能够帮助创业者快速搭建属于自己的电商平台。
1.2 淘宝网站开发的重要性及优势
淘宝网站开发方案能够为创业者提供一个稳定、安全、易用的电商平台，从而帮助他们快速打开市场。与自主开发相比，使用淘宝网站开发方案有着更低的成本和更快的上线速度。
二、淘宝网站开发的流程与策略
2.1 需求分析与产品定位
在开发淘宝网站之前，创业者需要进行充分的市场调研，了解潜在用户的需求和竞争对手的情况。并基于这些信息，明确自己的产品定位，找准自己的发展方向。
2.2 网站架构设计与界面优化
一个稳定且易于维护的网站架构是成功的基础。创业者需要在设计阶段考虑到网站的扩展性和性能优化，以提升用户的访问体验。合理的界面设计也能够吸引更多用户。
2.3 功能开发与数据库设计
根据需求分析，创业者需要开发相应的功能模块，并设计合理的数据库结构，以提供高效的数据存储和检索。
2.4 测试与上线
在开发完成后，创业者需要进行全面的测试，确保网站的稳定性和安全性。通过严格的测试流程，消除潜在的错误和漏洞。将网站正式上线，迎接用户的访问。
三、淘宝网站开发中需要注意的关键问题
3.1 用户体验与界面设计
用户体验是电商网站成功的关键之一，创业者需要将用户置于重要位置，提供友好的界面和便捷的操作方式。
3.2 安全性与数据保护
网络安全是当前互联网行业面临的重要问题，创业者需要加强网站的安全保护，防止黑客攻击和数据泄露。
3.3 移动端适配与响应式设计
随着移动互联网的普及，移动端访问已成为电商的重要渠道。创业者需要注意移动端适配和响应式设计，以提供一致的用户体验。
四、成功案例分析与启示
4.1 京东与拼多多的发展经验
京东和拼多多作为淘宝的竞争对手，也取得了巨大的成功。他们在用户体验、物流配送和社交电商等方面的创新，给创业者们提供了宝贵的经验。
4.2 阿里巴巴的电商生态圈建设
阿里巴巴通过建立完善的电商生态圈，为创业者提供了全方位的支持和资源，这也是淘宝网站开发方案的优势之一。
五、总结与展望
5.1 淘宝网站开发方案的价值与意义
淘宝网站开发方案为创业者提供了快速开展电商业务的机会，降低了创业门槛，拓宽了创业者的发展空间。
5.2 未来电商市场的发展趋势
随着科技的不断进步和用户消费习惯的变化，电商市场将会呈现出更多的发展机遇。创业者需要紧跟时代潮流，善于创新，才能在激烈的市场竞争中脱颖而出。
5.3 对创业者的建议与思考
在选择淘宝网站开发方案时，创业者需要根据自身的情况和市场需求，合理规划网站的发展策略。注重用户体验和市场营销，持续优化和推广自己的电商平台。
通过对淘宝网站开发方案的探讨，我们了解到了淘宝网站开发的重要性和流程，同时也看到了淘宝网站开发方案的优势和关键问题。在电商行业竞争激烈的当下，创业者们需要抓住机遇，选择合适的开发方案，加强用户体验和安全保护，才能在市场中取得成功。相信通过不断学习和改进，创业者们一定能够开创属于自己的电商新篇章。 | {
"url": "http://www.yuntai.net/wzkf/2962.html",
"source_domain": "www.yuntai.net",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "80312",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:X5MDRWHVHPRRJW6XQ2DQVFRIWPNAWWHO",
"WARC-Concurrent-To": "<urn:uuid:d512ad78-2337-492c-bd68-f44824c8a458>",
"WARC-Date": "2024-02-24T05:45:47Z",
"WARC-IP-Address": "47.243.139.36",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:N5CFUPQJ7ZMCV7GXCAPTV55LRCIV5QEC",
"WARC-Record-ID": "<urn:uuid:681c3a51-24a2-49e4-8a60-b4c253cc2ad2>",
"WARC-Target-URI": "http://www.yuntai.net/wzkf/2962.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dcef8139-1a58-481f-ad76-432b8c966e9a>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-208\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
109,
110,
119,
120,
208,
209,
300,
301,
426,
427,
523,
524,
641,
642,
739,
740,
749,
750,
761,
762,
922,
923,
938,
939,
954,
955,
1055,
1056,
1071,
1072,
1181,
1182,
1199,
1200,
1327,
1328,
1343,
1344,
1438,
1439,
1454,
1455,
1550,
1551,
1556,
1557,
1712,
1713,
1722,
1723,
1747,
1748,
1886,
1887,
1896,
1897,
1910,
1911,
1928,
1929,
1947,
1948,
1963,
1964,
1978,
1979,
1995,
1996,
2011,
2012,
2022,
2023,
2042,
2043,
2057,
2058,
2071,
2072,
2088,
2089,
2101,
2102,
2118,
2119,
2136,
2137,
2145,
2146,
2165,
2166,
2182,
2183,
2198,
2199,
2203,
2204,
2217,
2218,
2235,
2236,
2314,
2315,
2333,
2334,
2414,
2415,
2430,
2431,
2445,
2446,
2518,
2519,
2535,
2536,
2611,
2612,
2627,
2628,
2677,
2678,
2688,
2689,
2760,
2761,
2780,
2781,
2795,
2796,
2845,
2846,
2859,
2860,
2908,
2909,
2925,
2926,
2984,
2985,
2997,
2998,
3014,
3015,
3080,
3081,
3098,
3099,
3151,
3152,
3160,
3161,
3180,
3181,
3229,
3230,
3246,
3247,
3318,
3319,
3334,
3335,
3406,
3407
],
"line_end_idx": [
109,
110,
119,
120,
208,
209,
300,
301,
426,
427,
523,
524,
641,
642,
739,
740,
749,
750,
761,
762,
922,
923,
938,
939,
954,
955,
1055,
1056,
1071,
1072,
1181,
1182,
1199,
1200,
1327,
1328,
1343,
1344,
1438,
1439,
1454,
1455,
1550,
1551,
1556,
1557,
1712,
1713,
1722,
1723,
1747,
1748,
1886,
1887,
1896,
1897,
1910,
1911,
1928,
1929,
1947,
1948,
1963,
1964,
1978,
1979,
1995,
1996,
2011,
2012,
2022,
2023,
2042,
2043,
2057,
2058,
2071,
2072,
2088,
2089,
2101,
2102,
2118,
2119,
2136,
2137,
2145,
2146,
2165,
2166,
2182,
2183,
2198,
2199,
2203,
2204,
2217,
2218,
2235,
2236,
2314,
2315,
2333,
2334,
2414,
2415,
2430,
2431,
2445,
2446,
2518,
2519,
2535,
2536,
2611,
2612,
2627,
2628,
2677,
2678,
2688,
2689,
2760,
2761,
2780,
2781,
2795,
2796,
2845,
2846,
2859,
2860,
2908,
2909,
2925,
2926,
2984,
2985,
2997,
2998,
3014,
3015,
3080,
3081,
3098,
3099,
3151,
3152,
3160,
3161,
3180,
3181,
3229,
3230,
3246,
3247,
3318,
3319,
3334,
3335,
3406,
3407,
3555
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3555,
"ccnet_original_nlines": 162,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 1,
"rps_doc_frac_unique_words": 0.7130434513092041,
"rps_doc_mean_word_length": 28.930435180664062,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.347126007080078,
"rps_doc_word_count": 115,
"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.008415989577770233,
"rps_doc_frac_chars_top_3gram": 0.01562969945371151,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -178.29733276367188,
"rps_doc_books_importance_length_correction": -178.29733276367188,
"rps_doc_openwebtext_importance": -205.40724182128906,
"rps_doc_openwebtext_importance_length_correction": -205.40724182128906,
"rps_doc_wikipedia_importance": -249.47280883789062,
"rps_doc_wikipedia_importance_length_correction": -249.47280883789062
},
"fasttext": {
"dclm": 0.9882001876831055,
"english": 0.0009875299874693155,
"fineweb_edu_approx": 1.4591888189315796,
"eai_general_math": 0.04984604939818382,
"eai_open_web_math": 0.0408739410340786,
"eai_web_code": 0.9728946089744568
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "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": "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,999,102,583,398,813,000 | This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
perl 5.003_07: Configure
[perl5.git] / INSTALL
CommitLineData
8e07c86e
AD
1=head1 NAME
2
3Install - Build and Installation guide for perl5.
4
5=head1 SYNOPSIS
6
7f678428 7The basic steps to build and install perl5 on a Unix system are:
8e07c86e
AD
8
9 rm -f config.sh
10 sh Configure
11 make
12 make test
13 make install
14
15Each of these is explained in further detail below.
16
7f678428 17For information on non-Unix systems, see the section on
18L<"Porting Information">, below.
19
c3edaffb 20=head1 DESCRIPTION
21
edb1cbcb 22You should probably at least skim through this entire document before
23proceeding. Special notes specific to this release are identified
24by B<NOTE>.
25
c3edaffb 26This document is written in pod format as an easy way to indicate its
27structure. The pod format is described in pod/perlpod.pod, but you can
28read it as is with any pager or editor.
29
eed2e782 30If you're building Perl on a non-Unix system, you should also read
31the README file specific to your operating system, since this may
32provide additional or different instructions for building Perl.
33
c3edaffb 34=head1 Space Requirements.
eed2e782 35
c3edaffb 36The complete perl5 source tree takes up about 7 MB of disk space.
37The complete tree after completing C<make> takes roughly
3815 MB, though the actual total is likely to be quite
39system-dependent. The installation directories need something
40on the order of 7 MB, though again that value is system-dependent.
8e07c86e
AD
41
42=head1 Start with a Fresh Distribution.
43
edb1cbcb 44If you have built perl before, you should clean out the build directory
45with the command
46
47 make realclean
c3edaffb 48
8e07c86e
AD
49The results of a Configure run are stored in the config.sh file. If
50you are upgrading from a previous version of perl, or if you change
51systems or compilers or make other significant changes, or if you are
52experiencing difficulties building perl, you should probably I<not>
53re-use your old config.sh. Simply remove it or rename it, e.g.
54
55 mv config.sh config.sh.old
4633a7c4 56
8e07c86e
AD
57Then run Configure.
58
59=head1 Run Configure.
60
61Configure will figure out various things about your system. Some
62things Configure will figure out for itself, other things it will ask
63you about. To accept the default, just press C<RETURN>. The default
64is almost always ok.
65
66After it runs, Configure will perform variable substitution on all the
67F<*.SH> files and offer to run B<make depend>.
68
69Configure supports a number of useful options. Run B<Configure -h>
70to get a listing. To compile with gcc, for example, you can run
71
72 sh Configure -Dcc=gcc
73
74This is the preferred way to specify gcc (or another alternative
75compiler) so that the hints files can set appropriate defaults.
76
4633a7c4
LW
77If you want to use your old config.sh but override some of the items
78with command line options, you need to use B<Configure -O>.
79
8e07c86e
AD
80If you are willing to accept all the defaults, and you want terse
81output, you can run
82
83 sh Configure -des
84
85By default, for most systems, perl will be installed in
86/usr/local/{bin, lib, man}. You can specify a different 'prefix' for
87the default installation directory, when Configure prompts you or by
88using the Configure command line option -Dprefix='/some/directory',
89e.g.
90
25f94b33 91 sh Configure -Dprefix=/opt/perl
4633a7c4
LW
92
93If your prefix contains the string "perl", then the directories
94are simplified. For example, if you use prefix=/opt/perl,
95then Configure will suggest /opt/perl/lib instead of
96/usr/local/lib/perl5/.
8e07c86e
AD
97
98By default, Configure will compile perl to use dynamic loading, if
99your system supports it. If you want to force perl to be compiled
56c6f531
JH
100statically, you can either choose this when Configure prompts you or
101you can use the Configure command line option -Uusedl.
8e07c86e 102
24b3df7f 103=head2 Extensions
104
edb1cbcb 105By default, Configure will offer to build every extension which appears
106to be supported. For example, Configure will offer to build GDBM_File
107only if it is able to find the gdbm library. (See examples below.)
56c6f531 108DynaLoader, Fcntl, FileHandle and IO are always built by default.
edb1cbcb 109Configure does not contain code to test for POSIX compliance, so POSIX
110is always built by default as well. If you wish to skip POSIX, you can
111set the Configure variable useposix=false either in a hint file or from
c3edaffb 112the Configure command line. Similarly, the Opcode extension is always
edb1cbcb 113built by default, but you can skip it by setting the Configure variable
c3edaffb 114useopcode=false either in a hint file for from the command line.
24b3df7f 115
56c6f531
JH
116Even if you do not have dynamic loading, you must still build the
117DynaLoader extension; you should just build the stub dl_none.xs
118version. (Configure will suggest this as the default.)
119
24b3df7f 120In summary, here are the Configure command-line variables you can set
121to turn off each extension:
122
123 DB_File i_db
56c6f531 124 DynaLoader (Must always be included as a static extension)
24b3df7f 125 Fcntl (Always included by default)
edb1cbcb 126 FileHandle (Always included by default)
24b3df7f 127 GDBM_File i_gdbm
9d67150a 128 IO (Always included by default)
24b3df7f 129 NDBM_File i_ndbm
130 ODBM_File i_dbm
131 POSIX useposix
132 SDBM_File (Always included by default)
c3edaffb 133 Opcode useopcode
24b3df7f 134 Socket d_socket
135
136Thus to skip the NDBM_File extension, you can use
137
138 sh Configure -Ui_ndbm
139
140Again, this is taken care of automatically if you don't have the ndbm
141library.
142
143Of course, you may always run Configure interactively and select only
144the Extensions you want.
145
146Finally, if you have dynamic loading (most modern Unix systems do)
147remember that these extensions do not increase the size of your perl
148executable, nor do they impact start-up time, so you probably might as
149well build all the ones that will work on your system.
150
8e07c86e
AD
151=head2 GNU-style configure
152
153If you prefer the GNU-style B<configure> command line interface, you can
154use the supplied B<configure> command, e.g.
155
156 CC=gcc ./configure
157
158The B<configure> script emulates several of the more common configure
159options. Try
160
161 ./configure --help
162
163for a listing.
164
165Cross compiling is currently not supported.
166
167=head2 Including locally-installed libraries
168
4633a7c4
LW
169Perl5 comes with interfaces to number of database extensions, including
170dbm, ndbm, gdbm, and Berkeley db. For each extension, if
171Configure can find the appropriate header files and libraries, it will
172automatically include that extension. The gdbm and db libraries
173are B<not> included with perl. See the library documentation for
174how to obtain the libraries.
8e07c86e
AD
175
176I<Note:> If your database header (.h) files are not in a
177directory normally searched by your C compiler, then you will need to
178include the appropriate B<-I/your/directory> option when prompted by
179Configure. If your database library (.a) files are not in a directory
180normally searched by your C compiler and linker, then you will need to
181include the appropriate B<-L/your/directory> option when prompted by
182Configure. See the examples below.
183
184=head2 Examples
185
186=over 4
187
188=item gdbm in /usr/local.
189
190Suppose you have gdbm and want Configure to find it and build the
191GDBM_File extension. This examples assumes you have F<gdbm.h>
192installed in F</usr/local/include/gdbm.h> and F<libgdbm.a> installed in
193F</usr/local/lib/libgdbm.a>. Configure should figure all the
194necessary steps out automatically.
195
196Specifically, when Configure prompts you for flags for
197your C compiler, you should include C<-I/usr/local/include>.
198
199When Configure prompts you for linker flags, you should include
200C<-L/usr/local/lib>.
201
202If you are using dynamic loading, then when Configure prompts you for
203linker flags for dynamic loading, you should again include
204C<-L/usr/local/lib>.
205
206Again, this should all happen automatically. If you want to accept the
207defaults for all the questions and have Configure print out only terse
208messages, then you can just run
209
210 sh Configure -des
211
212and Configure should include the GDBM_File extension automatically.
213
214This should actually work if you have gdbm installed in any of
215(/usr/local, /opt/local, /usr/gnu, /opt/gnu, /usr/GNU, or /opt/GNU).
216
217=item gdbm in /usr/you
218
219Suppose you have gdbm installed in some place other than /usr/local/,
220but you still want Configure to find it. To be specific, assume you
221have F</usr/you/include/gdbm.h> and F</usr/you/lib/libgdbm.a>. You
222still have to add B<-I/usr/you/include> to cc flags, but you have to take
223an extra step to help Configure find F<libgdbm.a>. Specifically, when
224Configure prompts you for library directories, you have to add
225F</usr/you/lib> to the list.
226
227It is possible to specify this from the command line too (all on one
228line):
229
230 sh Configure -des \
231 -Dlocincpth="/usr/you/include" \
232 -Dloclibpth="/usr/you/lib"
233
234C<locincpth> is a space-separated list of include directories to search.
235Configure will automatically add the appropriate B<-I> directives.
236
237C<loclibpth> is a space-separated list of library directories to search.
238Configure will automatically add the appropriate B<-L> directives. If
239you have some libraries under F</usr/local/> and others under
240F</usr/you>, then you have to include both, namely
241
242 sh Configure -des \
243 -Dlocincpth="/usr/you/include /usr/local/include" \
244 -Dloclibpth="/usr/you/lib /usr/local/lib"
245
246=back
247
4633a7c4
LW
248=head2 Installation Directories.
249
250The installation directories can all be changed by answering the
251appropriate questions in Configure. For convenience, all the
252installation questions are near the beginning of Configure.
253
254By default, Configure uses the following directories for
255library files (archname is a string like sun4-sunos, determined
256by Configure)
257
258 /usr/local/lib/perl5/archname/5.002
259 /usr/local/lib/perl5/
24b3df7f 260 /usr/local/lib/perl5/site_perl/archname
261 /usr/local/lib/perl5/site_perl
4633a7c4
LW
262
263and the following directories for manual pages:
264
265 /usr/local/man/man1
266 /usr/local/lib/perl5/man/man3
267
268(Actually, Configure recognizes the SVR3-style
269/usr/local/man/l_man/man1 directories, if present, and uses those
270instead.) The module man pages are stuck in that strange spot so that
271they don't collide with other man pages stored in /usr/local/man/man3,
272and so that Perl's man pages don't hide system man pages. On some
273systems, B<man less> would end up calling up Perl's less.pm module man
274page, rather than the B<less> program.
275
276If you specify a prefix that contains the string "perl", then the
277directory structure is simplified. For example, if you Configure
278with -Dprefix=/opt/perl, then the defaults are
279
280 /opt/perl/lib/archname/5.002
281 /opt/perl/lib
282 /opt/perl/lib/site_perl/archname
283 /opt/perl/lib/site_perl
284
285 /opt/perl/man/man1
286 /opt/perl/man/man3
287
288The perl executable will search the libraries in the order given
289above.
290
291The directories site_perl and site_perl/archname are empty, but are
292intended to be used for installing local or site-wide extensions. Perl
293will automatically look in these directories. Previously, most sites
294just put their local extensions in with the standard distribution.
295
296In order to support using things like #!/usr/local/bin/perl5.002 after
297a later version is released, architecture-dependent libraries are
298stored in a version-specific directory, such as
299/usr/local/lib/perl5/archname/5.002/. In 5.000 and 5.001, these files
300were just stored in /usr/local/lib/perl5/archname/. If you will not be
301using 5.001 binaries, you can delete the standard extensions from the
302/usr/local/lib/perl5/archname/ directory. Locally-added extensions can
303be moved to the site_perl and site_perl/archname directories.
304
305Again, these are just the defaults, and can be changed as you run
306Configure.
307
8e07c86e
AD
308=head2 Changing the installation directory
309
310Configure distinguishes between the directory in which perl (and its
311associated files) should be installed and the directory in which it
312will eventually reside. For most sites, these two are the same; for
313sites that use AFS, this distinction is handled automatically.
314However, sites that use software such as B<depot> to manage software
315packages may also wish to install perl into a different directory and
316use that management software to move perl to its final destination.
317This section describes how to do this. Someday, Configure may support
318an option C<-Dinstallprefix=/foo> to simplify this.
319
320Suppose you want to install perl under the F</tmp/perl5> directory.
321You can edit F<config.sh> and change all the install* variables to
322point to F</tmp/perl5> instead of F</usr/local/wherever>. You could
323also set them all from the Configure command line. Or, you can
324automate this process by placing the following lines in a file
325F<config.over> B<before> you run Configure (replace /tmp/perl5 by a
326directory of your choice):
327
328 installprefix=/tmp/perl5
329 test -d $installprefix || mkdir $installprefix
330 test -d $installprefix/bin || mkdir $installprefix/bin
331 installarchlib=`echo $installarchlib | sed "s!$prefix!$installprefix!"`
332 installbin=`echo $installbin | sed "s!$prefix!$installprefix!"`
333 installman1dir=`echo $installman1dir | sed "s!$prefix!$installprefix!"`
334 installman3dir=`echo $installman3dir | sed "s!$prefix!$installprefix!"`
335 installprivlib=`echo $installprivlib | sed "s!$prefix!$installprefix!"`
336 installscript=`echo $installscript | sed "s!$prefix!$installprefix!"`
337 installsitelib=`echo $installsitelib | sed "s!$prefix!$installprefix!"`
4633a7c4 338 installsitearch=`echo $installsitearch | sed "s!$prefix!$installprefix!"`
8e07c86e
AD
339
340Then, you can Configure and install in the usual way:
341
25f94b33 342 sh Configure -des
8e07c86e
AD
343 make
344 make test
345 make install
346
347=head2 Creating an installable tar archive
348
349If you need to install perl on many identical systems, it is
350convenient to compile it once and create an archive that can be
351installed on multiple systems. Here's one way to do that:
352
353 # Set up config.over to install perl into a different directory,
354 # e.g. /tmp/perl5 (see previous part).
25f94b33 355 sh Configure -des
8e07c86e
AD
356 make
357 make test
358 make install
359 cd /tmp/perl5
360 tar cvf ../perl5-archive.tar .
361 # Then, on each machine where you want to install perl,
362 cd /usr/local # Or wherever you specified as $prefix
363 tar xvf perl5-archive.tar
364
9d67150a 365=head2 Building a shared libperl.so Perl library.
c3edaffb 366
367Currently, for most systems, the main perl executable is built by
368linking the "perl library" libperl.a with perlmain.o, your static
369extensions (usually just DynaLoader.a) and various extra libraries,
370such as -lm.
371
9d67150a 372On some systems that support dynamic loading, it may be possible to
373replace libperl.a with a shared libperl.so. If you anticipate building
c3edaffb 374several different perl binaries (e.g. by embedding libperl into
375different programs, or by using the optional compiler extension), then
9d67150a 376you might wish to build a shared libperl.so so that all your binaries
c3edaffb 377can share the same library.
378
379The disadvantages are that there may be a significant performance
9d67150a 380penalty associated with the shared libperl.so, and that the overall
c3edaffb 381meachanism is still rather fragile with respect to different versions
382and upgrades.
383
384In terms of performance, on my test system (Solaris 2.5_x86) the perl
9d67150a 385test suite took roughly 15% longer to run with the shared libperl.so.
c3edaffb 386Your system and typical applications may well give quite different
387results.
388
389The default name for the shared library is typically something like
9d67150a 390libperl.so.3.2 (for perl5.003_02) or libperl.so.302 or simply
391libperl.so. Configure tries to guess a sensible naming convention
c3edaffb 392based on your C library name. Since the library gets installed in a
393version-specific architecture-dependent directory, the exact name
394isn't very important anyway, as long as your linker is happy.
395
396For some systems (mostly SVR4), building a shared libperl is required
397for dynamic loading to work, and hence is already the default.
398
399You can elect to build a shared libperl by
400
401 sh Configure -Duseshrplib
402
403To actually build perl, you must add the current working directory to your
404LD_LIBRARY_PATH environtment variable before running make. You can do
405this with
406
407 LD_LIBRARY_PATH=`pwd`:$LD_LIBRARY_PATH; export LD_LIBRARY_PATH
408
409for Bourne-style shells, or
410
411 setenv LD_LIBRARY_PATH `pwd`
412
413for Csh-style shells. You *MUST* do this before running make.
414Folks running NeXT OPENSTEP must substitute DYLD_LIBRARY_PATH for
415LD_LIBRARY_PATH above.
416
9d67150a 417There is also an potential problem with the shared perl library if you
418want to have more than one "flavor" of the same version of perl (e.g.
419with and without -DDEBUGGING). For example, suppose you build and
420install a standard perl5.004 with a shared library. Then, suppose you
421try to build perl5.004 with -DDEBUGGING enabled, but everything else
422the same, including all the installation directories. How can you
423ensure that your newly built perl will link with your newly built
7f678428 424libperl.so.4 rather with the installed libperl.so.4? The answer is
9d67150a 425that you might not be able to. The installation directory is encoded
56c6f531
JH
426in the perl binary with the LD_RUN_PATH environment variable (or
427equivalent ld command-line option). On Solaris, you can override that
428with LD_LIBRARY_PATH; on Linux you can't.
9d67150a 429
430The only reliable answer is that you should specify a different
431directory for the architecture-dependent library for your -DDEBUGGING
432version of perl. You can do this with by changing all the *archlib*
433variables in config.sh, namely archlib, archlib_exp, and
434installarchlib, to point to your new architecture-dependent library.
435
c3edaffb 436=head2 Selecting File IO mechanisms
437
9d67150a 438Previous versions of perl used the standard IO mechanisms as defined in
c3edaffb 439<stdio.h>. Versions 5.003_02 and later of perl allow alternate IO
440mechanisms via a "PerlIO" abstraction, but the stdio mechanism is still
441the default and is the only supported mechanism.
442
443This PerlIO abstraction can be enabled either on the Configure command
444line with
445
446 sh Configure -Duseperlio
447
448or interactively at the appropriate Configure prompt.
449
450If you choose to use the PerlIO abstraction layer, there are two
451(experimental) possibilities for the underlying IO calls. These have been
452tested to some extent on some platforms, but are not guaranteed to work
453everywhere.
454
455=over 4
456
457=item 1.
458
459AT&T's "sfio". This has superior performance to <stdio.h> in many
460cases, and is extensible by the use of "disipline" modules. Sfio
461currently only builds on a subset of the UNIX platforms perl supports.
462Because the data structures are completely different from stdio, perl
463extension modules or external libraries may not work. This
464configuration exists to allow these issues to be worked on.
465
466This option requires the 'sfio' package to have been built and installed.
467A (fairly old) version of sfio is in CPAN, and work is in progress to make
468it more easily buildable by adding Configure support.
469
470You select this option by
471
472 sh Configure -Duseperlio -Dusesfio
473
474If you have already selected -Duseperlio, and if Configure detects
475that you have sfio, then sfio will be the default suggested by
476Configure.
477
478=item 2.
479
480Normal stdio IO, but with all IO going through calls to the PerlIO
481abstraction layer. This configuration can be used to check that perl and
482extension modules have been correctly converted to use the PerlIO
483abstraction.
484
56c6f531 485This configuration should work on all platforms (but might not).
c3edaffb 486
487You select this option via :
488
489 sh Configure -Duseperlio -Uusesfio
490
491If you have already selected -Duseperlio, and if Configure does not
492detect sfio, then this will be the default suggested by Configure.
493
494=back
495
8e07c86e
AD
496=head2 What if it doesn't work?
497
498=over 4
499
25f94b33
AD
500=item Running Configure Interactively
501
502If Configure runs into trouble, remember that you can always run
503Configure interactively so that you can check (and correct) its
504guesses.
505
506All the installation questions have been moved to the top, so you don't
507have to wait for them. Once you've handled them (and your C compiler &
c3edaffb 508flags) you can type C<&-d> at the next Configure prompt and Configure
25f94b33
AD
509will use the defaults from then on.
510
511If you find yourself trying obscure command line incantations and
512config.over tricks, I recommend you run Configure interactively
513instead. You'll probably save yourself time in the long run.
514
8e07c86e
AD
515=item Hint files.
516
517The perl distribution includes a number of system-specific hints files
518in the hints/ directory. If one of them matches your system, Configure
519will offer to use that hint file.
520
521Several of the hint files contain additional important information.
522If you have any problems, it is a good idea to read the relevant hint
523file for further information. See F<hints/solaris_2.sh> for an
524extensive example.
525
edb1cbcb 526=item *** WHOA THERE!!! ***
527
528Occasionally, Configure makes a wrong guess. For example, on SunOS
5294.1.3, Configure incorrectly concludes that tzname[] is in the
530standard C library. The hint file is set up to correct for this. You
531will see a message:
532
533 *** WHOA THERE!!! ***
534 The recommended value for $d_tzname on this machine was "undef"!
535 Keep the recommended value? [y]
536
537You should always keep the recommended value unless, after reading the
538relevant section of the hint file, you are sure you want to try
539overriding it.
540
541If you are re-using an old config.sh, the word "previous" will be
542used instead of "recommended". Again, you will almost always want
543to keep the previous value, unless you have changed something on your
544system.
545
546For example, suppose you have added libgdbm.a to your system
547and you decide to reconfigure perl to use GDBM_File. When you run
548Configure again, you will need to add -lgdbm to the list of libraries.
549Now, Configure will find your gdbm library and will issue a message:
550
551 *** WHOA THERE!!! ***
552 The previous value for $i_gdbm on this machine was "undef"!
553 Keep the previous value? [y]
554
555In this case, you do I<not> want to keep the previous value, so you
c3edaffb 556should answer 'n'. (You'll also have to manually add GDBM_File to
edb1cbcb 557the list of dynamic extensions to build.)
558
8e07c86e
AD
559=item Changing Compilers
560
561If you change compilers or make other significant changes, you should
562probably I<not> re-use your old config.sh. Simply remove it or
563rename it, e.g. mv config.sh config.sh.old. Then rerun Configure
564with the options you want to use.
565
566This is a common source of problems. If you change from B<cc> to
567B<gcc>, you should almost always remove your old config.sh.
568
c3edaffb 569=item Propagating your changes to config.sh
8e07c86e 570
56c6f531 571If you make any changes to F<config.sh>, you should propagate
9d67150a 572them to all the .SH files by running B<sh Configure -S>. You will
573then have to rebuild by running
574
575 make depend
576 make
8e07c86e
AD
577
578=item config.over
579
580You can also supply a shell script config.over to over-ride Configure's
581guesses. It will get loaded up at the very end, just before config.sh
582is created. You have to be careful with this, however, as Configure
d52d4e46 583does no checking that your changes make sense. See the section on
7f678428 584L<"Changing the installation directory"> for an example.
8e07c86e
AD
585
586=item config.h
587
588Many of the system dependencies are contained in F<config.h>.
589F<Configure> builds F<config.h> by running the F<config_h.SH> script.
590The values for the variables are taken from F<config.sh>.
591
592If there are any problems, you can edit F<config.h> directly. Beware,
593though, that the next time you run B<Configure>, your changes will be
594lost.
595
596=item cflags
597
598If you have any additional changes to make to the C compiler command
599line, they can be made in F<cflags.SH>. For instance, to turn off the
600optimizer on F<toke.c>, find the line in the switch structure for
601F<toke.c> and put the command C<optimize='-g'> before the C<;;>. You
602can also edit F<cflags> directly, but beware that your changes will be
603lost the next time you run B<Configure>.
604
605To change the C flags for all the files, edit F<config.sh>
606and change either C<$ccflags> or C<$optimize>,
25f94b33 607and then re-run B<sh Configure -S ; make depend>.
8e07c86e
AD
608
609=item No sh.
610
611If you don't have sh, you'll have to copy the sample file config_H to
612config.h and edit the config.h to reflect your system's peculiarities.
613You'll probably also have to extensively modify the extension building
614mechanism.
615
c3edaffb 616=item Porting information
617
618Specific information for the OS/2, Plan9, and VMS ports are in the
619corresponing subdirectories. Additional information, including
620a glossary of all those config.sh variables, is in the Porting
621subdirectory.
622
7f678428 623Ports for other systems may also be available. You should check out
624L<"http:/www.perl.com/CPAN/ports"> for current information on ports to
625various other operating systems.
626
8e07c86e
AD
627=back
628
629=head1 make depend
630
631This will look for all the includes.
632The output is stored in F<makefile>. The only difference between
633F<Makefile> and F<makefile> is the dependencies at the bottom of
634F<makefile>. If you have to make any changes, you should edit
635F<makefile>, not F<Makefile> since the Unix B<make> command reads
c3edaffb 636F<makefile> first. (On non-Unix systems, the output may be stored in
637a different file. Check the value of $firstmakefile in your config.sh
638if in doubt.)
8e07c86e
AD
639
640Configure will offer to do this step for you, so it isn't listed
641explicitly above.
642
643=head1 make
644
645This will attempt to make perl in the current directory.
646
647If you can't compile successfully, try some of the following ideas.
7f678428 648If none of them help, and careful reading of the error message and
649the relevant manual pages on your system doesn't help, you can
650send a message to either the comp.lang.perl.misc newsgroup or to
[email protected] with an accurate description of your problem.
652Please include the I<output> of the B<./myconfig> shell script
653that comes with the distribution.
654
655[The B<perlbug> program that comes with the perl distribution is
656useful for sending in such reports, but you need to have
657perl compiled and installed before you can use it.]
8e07c86e
AD
658
659=over 4
660
661=item *
662
663If you used a hint file, try reading the comments in the hint file
664for further tips and information.
665
666=item *
667
c3edaffb 668If you can successfully build F<miniperl>, but the process crashes
669during the building of extensions, you should run
670
671 make minitest
672
673to test your version of miniperl.
674
675=item *
676
677If you get duplicates upon linking for malloc et al, say -DHIDEMYMALLOC.
678
7f678428 679=item varargs
c3edaffb 680
681If you get varargs problems with gcc, be sure that gcc is installed
682correctly. When using gcc, you should probably have i_stdarg='define'
683and i_varargs='undef' in config.sh. The problem is usually solved by
684running fixincludes correctly. If you do change config.sh, don't
7f678428 685forget to propagate your changes (see
686L<"Propagating your changes to config.sh"> below).
687See also the L<"vsprintf"> item below.
c3edaffb 688
689=item *
690
691If you get error messages such as the following (the exact line
692numbers will vary in different versions of perl):
693
694 util.c: In function `Perl_croak':
695 util.c:962: number of arguments doesn't match prototype
696 proto.h:45: prototype declaration
697
698it might well be a symptom of the gcc "varargs problem". See the
7f678428 699previous L<"varargs"> item.
c3edaffb 700
9d67150a 701=item Solaris and SunOS dynamic loading
c3edaffb 702
703If you have problems with dynamic loading using gcc on SunOS or
704Solaris, and you are using GNU as and GNU ld, you may need to add
705B<-B/bin/> (for SunOS) or B<-B/usr/ccs/bin/> (for Solaris) to your
706$ccflags, $ldflags, and $lddlflags so that the system's versions of as
707and ld are used. Alternatively, you can use the GCC_EXEC_PREFIX
708environment variable to ensure that Sun's as and ld are used. Consult
709your gcc documentation for further information on the B<-B> option and
710the GCC_EXEC_PREFIX variable.
711
9d67150a 712=item ld.so.1: ./perl: fatal: relocation error:
713
714If you get this message on SunOS or Solaris, and you're using gcc,
7f678428 715it's probably the GNU as or GNU ld problem in the previous item
716L<"Solaris and SunOS dynamic loading">.
9d67150a 717
c3edaffb 718=item *
719
720If you run into dynamic loading problems, check your setting of
721the LD_LIBRARY_PATH environment variable. Perl should build
722fine with LD_LIBRARY_PATH unset, though that may depend on details
723of your local set-up.
724
725=item dlopen: stub interception failed
726
727The primary cause of the 'dlopen: stub interception failed' message is
728that the LD_LIBRARY_PATH environment variable includes a directory
729which is a symlink to /usr/lib (such as /lib).
730
731The reason this causes a problem is quite subtle. The file libdl.so.1.0
732actually *only* contains functions which generate 'stub interception
733failed' errors! The runtime linker intercepts links to
734"/usr/lib/libdl.so.1.0" and links in internal implementation of those
735functions instead. [Thanks to Tim Bunce for this explanation.]
736
737=item *
738
739If Configure seems to be having trouble finding library functions,
740try not using nm extraction. You can do this from the command line
741with
742
743 sh Configure -Uusenm
744
745or by answering the nm extraction question interactively.
746If you have previously run Configure, you should I<not> reuse your old
747config.sh.
748
7f678428 749=item vsprintf
c3edaffb 750
751If you run into problems with vsprintf in compiling util.c, the
752problem is probably that Configure failed to detect your system's
753version of vsprintf(). Check whether your system has vprintf().
754(Virtually all modern Unix systems do.) Then, check the variable
755d_vprintf in config.sh. If your system has vprintf, it should be:
756
757 d_vprintf='define'
758
759If Configure guessed wrong, it is likely that Configure guessed wrong
760on a number of other common functions too. You are probably better off
761re-running Configure without using nm extraction (see previous item).
762
763=item *
764
9d67150a 765If you can't compile successfully, try turning off your compiler's
766optimizier. Edit config.sh and change the line
767
768 optimize='-O'
769
770to something like
771
772 optimize=' '
773
774then propagate your changes with B<sh Configure -S> and rebuild
775with B<make depend; make>.
776
777=item *
778
56c6f531
JH
779If you still can't compile successfully, try adding a C<-DCRIPPLED_CC>
780flag. (Just because you get no errors doesn't mean it compiled right!)
781This simplifies some complicated expressions for compilers that get
782indigestion easily.
9d67150a 783
784=item Missing functions
785
786If you have missing routines, you probably need to add some library or
787other, or you need to undefine some feature that Configure thought was
788there but is defective or incomplete. Look through config.h for
789likely suspects.
8e07c86e
AD
790
791=item *
792
793Some compilers will not compile or optimize the larger files without
794some extra switches to use larger jump offsets or allocate larger
795internal tables. You can customize the switches for each file in
796F<cflags>. It's okay to insert rules for specific files into
797F<makefile> since a default rule only takes effect in the absence of a
798specific rule.
799
7f678428 800=item Missing dbmclose
8e07c86e 801
c3edaffb 802SCO prior to 3.2.4 may be missing dbmclose(). An upgrade to 3.2.4
803that includes libdbm.nfs (which includes dbmclose()) may be available.
8e07c86e 804
7f678428 805=item Warning (will try anyway): No library found for -lposix
806
807If you see such a message during the building of an extension, but
808the extension passes its tests anyway (see L<"make test"> below),
809then don't worry about the warning message. The extension
810Makefile.PL goes looking for various libraries needed on various
811systems; few systems will need all the possible libries listed.
812For example, a system may have -lcposix or -lposix, but it's
813unlikely to have both, so most users will see warnings for the one
814they don't have. The message 'will try anyway' is intended to
815reassure you that the process is continuing.
816
817On the other hand, if you are building GDBM_File and you get the
818message
819
820 Warning (will try anyway): No library found for -lgdbm
821
822then it's likely you're going to run into trouble somewhere along
823the line, since it's hard to see how you can use the GDBM_File
824extension without the -lgdbm library.
825
826It is true that, in principle, Configure could have figured all of
827this out, but Configure and the extension building process are not
828quite that tightly coordinated.
829
8e07c86e
AD
830=item *
831
832Some additional things that have been reported for either perl4 or perl5:
833
834Genix may need to use libc rather than libc_s, or #undef VARARGS.
835
836NCR Tower 32 (OS 2.01.01) may need -W2,-Sl,2000 and #undef MKDIR.
837
838UTS may need one or more of B<-DCRIPPLED_CC>, B<-K> or B<-g>, and undef LSTAT.
839
840If you get syntax errors on '(', try -DCRIPPLED_CC.
841
842Machines with half-implemented dbm routines will need to #undef I_ODBM
843
8e07c86e
AD
844=back
845
846=head1 make test
847
848This will run the regression tests on the perl you just made. If it
849doesn't say "All tests successful" then something went wrong. See the
850file F<t/README> in the F<t> subdirectory. Note that you can't run it
c3edaffb 851in background if this disables opening of /dev/tty.
852
853If B<make test> bombs out, just B<cd> to the F<t> directory and run
854B<TEST> by hand to see if it makes any difference. If individual tests
855bomb, you can run them by hand, e.g.,
8e07c86e
AD
856
857 ./perl op/groups.t
858
c3edaffb 859You can also read the individual tests to see if there are any helpful
860comments that apply to your system.
861
edb1cbcb 862B<Note>: one possible reason for errors is that some external programs
c07a80fd 863may be broken due to the combination of your environment and the way
c3edaffb 864C<make test> exercises them. For example, this may happen if you have
865one or more of these environment variables set: C<LC_ALL LC_CTYPE
56c6f531
JH
866LC_COLLATE LANG>. In some versions of UNIX, the non-English locales
867are known to cause programs to exhibit mysterious errors. If you have
868any of the above environment variables set, please try
869C<setenv LC_ALL C> (for C shell) or <LC_ALL=C;export LC_ALL>
870(for Bourne or Korn shell) from the command line and then retry C<make test>.
871If the tests then succeed, you may have a broken program that is confusing the
872testing. Please run the troublesome test by hand as shown above and
873see whether you can locate the program. Look for things like: C<exec,
874`backquoted command`, system, open("|...")> or C<open("...|")>.
c07a80fd 875All these mean that Perl is trying to run some external program.
eed2e782 876
8e07c86e
AD
877=head1 INSTALLING PERL5
878
879=head1 make install
880
881This will put perl into the public directory you specified to
882B<Configure>; by default this is F</usr/local/bin>. It will also try
883to put the man pages in a reasonable place. It will not nroff the man
884page, however. You may need to be root to run B<make install>. If you
885are not root, you must own the directories in question and you should
886ignore any messages about chown not working.
887
c3edaffb 888You may see some harmless error messages and warnings from pod2man.
889You may safely ignore them. (Yes, they should be fixed, but they
890didn't seem important enough to warrant holding up the entire release.)
a5f75d66 891
8e07c86e
AD
892If you want to see exactly what will happen without installing
893anything, you can run
4633a7c4 894
8e07c86e
AD
895 ./perl installperl -n
896 ./perl installman -n
897
898B<make install> will install the following:
899
900 perl,
901 perl5.nnn where nnn is the current release number. This
902 will be a link to perl.
903 suidperl,
904 sperl5.nnn If you requested setuid emulation.
905 a2p awk-to-perl translator
906 cppstdin This is used by perl -P, if your cc -E can't
907 read from stdin.
908 c2ph, pstruct Scripts for handling C structures in header files.
909 s2p sed-to-perl translator
910 find2perl find-to-perl translator
911 h2xs Converts C .h header files to Perl extensions.
24b3df7f 912 perlbug Tool to report bugs in Perl.
8e07c86e
AD
913 perldoc Tool to read perl's pod documentation.
914 pod2html, Converters from perl's pod documentation format
915 pod2latex, and to other useful formats.
916 pod2man
917
918 library files in $privlib and $archlib specified to
919 Configure, usually under /usr/local/lib/perl5/.
920 man pages in the location specified to Configure, usually
921 something like /usr/local/man/man1.
922 module in the location specified to Configure, usually
923 man pages under /usr/local/lib/perl5/man/man3.
924 pod/*.pod in $privlib/pod/.
925
4633a7c4
LW
926Installperl will also create the library directories $siteperl and
927$sitearch listed in config.sh. Usually, these are something like
24b3df7f 928 /usr/local/lib/perl5/site_perl/
929 /usr/local/lib/perl5/site_perl/$archname
4633a7c4
LW
930where $archname is something like sun4-sunos. These directories
931will be used for installing extensions.
932
56c6f531
JH
933Perl's *.h header files and the libperl.a library are also installed
934under $archlib so that any user may later build new extensions, run the
935optional Perl compiler, or embed the perl interpreter into another
936program even if the Perl source is no longer available.
8e07c86e
AD
937
938Most of the documentation in the pod/ directory is also available
939in HTML and LaTeX format. Type
940
941 cd pod; make html; cd ..
942
943to generate the html versions, and
944
945 cd pod; make tex; cd ..
946
947to generate the LaTeX versions.
948
eed2e782 949=head1 cd /usr/include; h2ph *.h sys/*.h
950
951Some of the perl library files need to be able to obtain information from
952the system header files. This command will convert the most commonly used
953header files in F</usr/include> into files that can be easily interpreted
954by perl. These files will be placed in architectural library directory
955you specified to B<Configure>; by default this is
956F</usr/local/lib/perl5/ARCH/VERSION>, where B<ARCH> is your architecture
957(such as C<sun4-solaris>) and B<VERSION> is the version of perl you are
958building (for example, C<5.003>).
959
960B<NOTE:> Due to differences in the C and perl languages, the conversion of
c3edaffb 961the header files in not perfect. You may have to hand edit some of the
eed2e782 962converted files to get them to parse correctly. For example, it breaks
963spectacularly on type casting and certain structures.
c3edaffb 964
4633a7c4
LW
965=head1 Coexistence with earlier versions of perl5.
966
eed2e782 967You can safely install the current version of perl5 and still run scripts
56c6f531 968under the old binaries for versions 5.003 and later ONLY. Instead of
eed2e782 969starting your script with #!/usr/local/bin/perl, just start it with
56c6f531
JH
970#!/usr/local/bin/perl5.003 (or whatever version you want to run.)
971If you want to retain a version of perl5 prior to perl5.003, you'll
eed2e782 972need to install the current version in a separate directory tree,
973since some of the architecture-independent library files have changed
974in incompatible ways.
4633a7c4
LW
975
976The architecture-dependent files are stored in a version-specific
977directory (such as F</usr/local/lib/perl5/sun4-sunos/5.002>) so that
978they are still accessible. I<Note:> perl5.000 and perl5.001 did not
979put their architecture-dependent libraries in a version-specific
980directory. They are simply in F</usr/local/lib/perl5/$archname>. If
981you will not be using 5.000 or 5.001, you may safely remove those
982files.
983
984The standard library files in F</usr/local/lib/perl5>
c3edaffb 985should be usable by all versions of perl5.
4633a7c4 986
d52d4e46 987Most extensions will probably not need to be recompiled to use with a newer
4633a7c4
LW
988version of perl. If you do run into problems, and you want to continue
989to use the old version of perl along with your extension, simply move
990those extension files to the appropriate version directory, such as
991F</usr/local/lib/perl/archname/5.002>. Then perl5.002 will find your
992files in the 5.002 directory, and newer versions of perl will find your
993newer extension in the site_perl directory.
994
d52d4e46 995Some users may prefer to keep all versions of perl in completely
996separate directories. One convenient way to do this is by
997using a separate prefix for each version, such as
998
999 sh Configure -Dprefix=/opt/perl5.002
1000
1001and adding /opt/perl5.002/bin to the shell PATH variable. Such users
1002may also wish to add a symbolic link /usr/local/bin/perl so that
1003scripts can still start with #!/usr/local/bin/perl.
1004
edb1cbcb 1005B<NOTE>: Starting with 5.002_01, all functions in the perl C source
1006code are protected by default by the prefix Perl_ (or perl_) so that
1007you may link with third-party libraries without fear of namespace
56c6f531
JH
1008collisons. This breaks compatability with
1009version 5.002, so once you install 5.002_01 (or higher) you will
edb1cbcb 1010need to re-build and install all of your dynamically loadable
1011extensions. (The standard extensions supplied with Perl are handled
1012automatically). You can turn off this namespace protection by adding
56c6f531
JH
1013-DNO_EMBED to your ccflags variable in config.sh.
1014
1015In the future, we certainly hope that most extensions won't need to be
1016recompiled for use with a newer version of perl.
edb1cbcb 1017
8e07c86e
AD
1018=head1 Coexistence with perl4
1019
1020You can safely install perl5 even if you want to keep perl4 around.
1021
1022By default, the perl5 libraries go into F</usr/local/lib/perl5/>, so
1023they don't override the perl4 libraries in F</usr/local/lib/perl/>.
1024
1025In your /usr/local/bin directory, you should have a binary named
1026F<perl4.036>. That will not be touched by the perl5 installation
1027process. Most perl4 scripts should run just fine under perl5.
1028However, if you have any scripts that require perl4, you can replace
1029the C<#!> line at the top of them by C<#!/usr/local/bin/perl4.036>
edb1cbcb 1030(or whatever the appropriate pathname is). See pod/perltrap.pod
1031for possible problems running perl4 scripts under perl5.
8e07c86e
AD
1032
1033=head1 DOCUMENTATION
1034
1035Read the manual entries before running perl. The main documentation is
1036in the pod/ subdirectory and should have been installed during the
1037build process. Type B<man perl> to get started. Alternatively, you
1038can type B<perldoc perl> to use the supplied B<perldoc> script. This
1039is sometimes useful for finding things in the library modules.
1040
1041=head1 AUTHOR
1042
1043Andy Dougherty <[email protected]>, borrowing I<very> heavily
1044from the original README by Larry Wall.
1045
a5f75d66 1046=head1 LAST MODIFIED
24b3df7f 1047
56c6f531 10488 October 1996 | {
"url": "https://perl5.git.perl.org/perl5.git/blame/a4f3eea9be6bcf3c1a2f99ac49d0585bf5fe8789:/INSTALL",
"source_domain": "perl5.git.perl.org",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "273481",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PT5BPXC4DA35TO72PJRA766WFGKORMZK",
"WARC-Concurrent-To": "<urn:uuid:16594452-484e-4859-b708-428d3b0df846>",
"WARC-Date": "2023-02-04T21:44:33Z",
"WARC-IP-Address": "188.166.18.220",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:RFMRFM2CGV22YQDXGZ4IPTIYVJW6POSN",
"WARC-Record-ID": "<urn:uuid:42d67622-b441-4831-9a21-5cb2207ef35a>",
"WARC-Target-URI": "https://perl5.git.perl.org/perl5.git/blame/a4f3eea9be6bcf3c1a2f99ac49d0585bf5fe8789:/INSTALL",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d63784fe-65a2-4a27-aa4c-0e0eea6bba41>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-163\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,
98,
123,
145,
160,
169,
172,
185,
187,
238,
240,
257,
259,
334,
343,
346,
348,
366,
382,
390,
403,
419,
422,
476,
479,
546,
581,
584,
614,
617,
698,
766,
780,
783,
864,
937,
979,
982,
1060,
1128,
1194,
1197,
1235,
1247,
1324,
1383,
1438,
1502,
1571,
1580,
1583,
1586,
1628,
1631,
1714,
1733,
1736,
1754,
1766,
1775,
1778,
1848,
1918,
1990,
2060,
2125,
2128,
2158,
2170,
2179,
2182,
2204,
2207,
2231,
2234,
2301,
2373,
2443,
2466,
2469,
2542,
2591,
2594,
2663,
2729,
2732,
2757,
2760,
2827,
2893,
2896,
2905,
2908,
2979,
3041,
3044,
3053,
3056,
3124,
3146,
3149,
3170,
3173,
3231,
3302,
3373,
3443,
3450,
3453,
3497,
3506,
3509,
3512,
3578,
3638,
3693,
3718,
3727,
3730,
3733,
3802,
3870,
3879,
3882,
3954,
4012,
4025,
4055,
4059,
4143,
4216,
4286,
4364,
4447,
4521,
4596,
4678,
4762,
4839,
4852,
4861,
4864,
4933,
5000,
5058,
5062,
5144,
5175,
5179,
5196,
5268,
5316,
5369,
5399,
5444,
5474,
5494,
5513,
5556,
5586,
5615,
5619,
5672,
5676,
5702,
5706,
5779,
5791,
5795,
5868,
5896,
5900,
5970,
6042,
6116,
6174,
6178,
6187,
6190,
6220,
6224,
6300,
6347,
6351,
6374,
6378,
6451,
6467,
6471,
6494,
6498,
6516,
6520,
6567,
6571,
6619,
6623,
6632,
6635,
6710,
6770,
6844,
6911,
6979,
7011,
7020,
7023,
7027,
7087,
7160,
7232,
7305,
7379,
7451,
7489,
7493,
7512,
7516,
7527,
7531,
7560,
7564,
7633,
7698,
7773,
7837,
7875,
7879,
7937,
8001,
8005,
8072,
8096,
8100,
8173,
8235,
8259,
8263,
8337,
8411,
8446,
8450,
8472,
8476,
8547,
8551,
8617,
8689,
8693,
8719,
8723,
8796,
8867,
8937,
9014,
9087,
9153,
9185,
9189,
9261,
9271,
9275,
9299,
9336,
9367,
9371,
9447,
9517,
9521,
9597,
9670,
9735,
9789,
9793,
9817,
9873,
9919,
9923,
9932,
9936,
9945,
9948,
9984,
9988,
10056,
10120,
10183,
10187,
10247,
10314,
10331,
10335,
10375,
10401,
10454,
10489,
10498,
10501,
10505,
10556,
10560,
10584,
10618,
10622,
10672,
10741,
10814,
10888,
10957,
11031,
11073,
11077,
11146,
11214,
11264,
11268,
11301,
11319,
11356,
11384,
11388,
11411,
11434,
11438,
11506,
11516,
11520,
11591,
11665,
11737,
11807,
11811,
11885,
11954,
12005,
12078,
12152,
12225,
12299,
12364,
12368,
12437,
12451,
12455,
12464,
12467,
12513,
12517,
12589,
12660,
12731,
12797,
12869,
12942,
13013,
13086,
13141,
13145,
13216,
13286,
13357,
13423,
13489,
13560,
13590,
13594,
13623,
13674,
13733,
13809,
13877,
13953,
14029,
14105,
14179,
14255,
14342,
14351,
14354,
14358,
14415,
14419,
14450,
14459,
14462,
14471,
14485,
14502,
14506,
14552,
14556,
14620,
14687,
14748,
14752,
14821,
14864,
14895,
14904,
14907,
14916,
14930,
14947,
14965,
15000,
15060,
15117,
15147,
15151,
15213,
15226,
15295,
15364,
15435,
15451,
15455,
15535,
15609,
15685,
15759,
15841,
15881,
15885,
15954,
16034,
16116,
16133,
16137,
16210,
16292,
16371,
16383,
16387,
16458,
16532,
16601,
16681,
16750,
16815,
16819,
16892,
16958,
16962,
17008,
17012,
17042,
17046,
17124,
17197,
17210,
17214,
17281,
17285,
17316,
17320,
17353,
17357,
17422,
17491,
17517,
17521,
17604,
17677,
17746,
17819,
17891,
17960,
18029,
18108,
18189,
18198,
18201,
18269,
18342,
18387,
18400,
18467,
18540,
18611,
18671,
18743,
18747,
18795,
18799,
18883,
18961,
19036,
19088,
19092,
19166,
19179,
19183,
19212,
19216,
19273,
19277,
19345,
19422,
19497,
19512,
19516,
19527,
19531,
19543,
19547,
19616,
19684,
19758,
19831,
19893,
19956,
19960,
20037,
20115,
20172,
20176,
20205,
20209,
20248,
20252,
20322,
20388,
20402,
20406,
20418,
20422,
20492,
20568,
20637,
20653,
20657,
20734,
20747,
20779,
20783,
20822,
20826,
20897,
20967,
20971,
20980,
20984,
20993,
20996,
21031,
21035,
21046,
21050,
21059,
21062,
21103,
21107,
21175,
21242,
21254,
21258,
21333,
21407,
21489,
21498,
21501,
21540,
21544,
21613,
21680,
21744,
21748,
21757,
21760,
21781,
21785,
21859,
21933,
21970,
21974,
22045,
22118,
22184,
22206,
22210,
22250,
22254,
22324,
22390,
22462,
22485,
22489,
22515,
22584,
22620,
22624,
22698,
22765,
22783,
22787,
22856,
22925,
22998,
23009,
23013,
23077,
23146,
23220,
23292,
23296,
23322,
23386,
23419,
23423,
23494,
23572,
23626,
23630,
23639,
23642,
23670,
23674,
23747,
23813,
23881,
23918,
23922,
23990,
24053,
24057,
24113,
24126,
24200,
24278,
24313,
24317,
24333,
24342,
24351,
24354,
24358,
24379,
24383,
24458,
24531,
24602,
24680,
24749,
24758,
24761,
24765,
24783,
24787,
24852,
24925,
24986,
24990,
25063,
25136,
25145,
25149,
25165,
25169,
25241,
25314,
25383,
25455,
25529,
25573,
25577,
25639,
25689,
25751,
25760,
25763,
25767,
25783,
25787,
25860,
25934,
26008,
26022,
26026,
26064,
26068,
26138,
26204,
26270,
26287,
26291,
26371,
26445,
26481,
26485,
26494,
26497,
26506,
26510,
26532,
26536,
26576,
26644,
26712,
26777,
26846,
26927,
27000,
27017,
27026,
27029,
27033,
27101,
27122,
27126,
27141,
27145,
27205,
27209,
27280,
27359,
27425,
27493,
27559,
27625,
27662,
27666,
27734,
27794,
27849,
27858,
27861,
27865,
27876,
27880,
27891,
27895,
27965,
28002,
28006,
28017,
28021,
28100,
28153,
28157,
28175,
28179,
28216,
28220,
28231,
28235,
28311,
28315,
28341,
28354,
28425,
28498,
28570,
28638,
28688,
28742,
28784,
28797,
28808,
28812,
28879,
28932,
28936,
28974,
29034,
29072,
29076,
29144,
29184,
29197,
29249,
29262,
29329,
29398,
29468,
29542,
29609,
29682,
29756,
29789,
29793,
29853,
29857,
29927,
30003,
30046,
30059,
30079,
30083,
30150,
30213,
30283,
30308,
30312,
30354,
30358,
30432,
30502,
30552,
30556,
30631,
30703,
30761,
30834,
30900,
30904,
30915,
30919,
30989,
31059,
31067,
31071,
31096,
31100,
31161,
31235,
31249,
31253,
31280,
31293,
31360,
31429,
31496,
31564,
31633,
31637,
31660,
31664,
31737,
31811,
31884,
31888,
31899,
31903,
31982,
32032,
32036,
32054,
32058,
32079,
32083,
32100,
32104,
32171,
32201,
32205,
32216,
32220,
32229,
32232,
32306,
32380,
32451,
32474,
32487,
32514,
32518,
32592,
32666,
32733,
32753,
32762,
32765,
32769,
32780,
32784,
32856,
32925,
32993,
33057,
33131,
33149,
33153,
33188,
33201,
33279,
33353,
33366,
33440,
33444,
33514,
33583,
33644,
33712,
33779,
33843,
33913,
33978,
34026,
34030,
34098,
34109,
34113,
34172,
34176,
34245,
34311,
34352,
34356,
34426,
34496,
34531,
34535,
34544,
34547,
34558,
34562,
34639,
34643,
34712,
34716,
34785,
34789,
34871,
34875,
34930,
34934,
35008,
35012,
35021,
35024,
35033,
35037,
35057,
35061,
35132,
35205,
35278,
35342,
35346,
35417,
35491,
35532,
35541,
35544,
35548,
35571,
35575,
35658,
35697,
35701,
35784,
35865,
35947,
36016,
36025,
36028,
36099,
36172,
36230,
36294,
36375,
36457,
36528,
36601,
36668,
36745,
36758,
36767,
36770,
36797,
36801,
36824,
36828,
36893,
36965,
37038,
37111,
37184,
37232,
37236,
37316,
37384,
37459,
37472,
37481,
37484,
37550,
37575,
37588,
37597,
37600,
37626,
37651,
37655,
37702,
37706,
37716,
37776,
37804,
37818,
37868,
37899,
37957,
37978,
38047,
38078,
38116,
38172,
38222,
38231,
38234,
38285,
38347,
38391,
38403,
38407,
38463,
38515,
38577,
38617,
38676,
38727,
38759,
38763,
38772,
38775,
38845,
38913,
38958,
39003,
39012,
39015,
39082,
39125,
39129,
39138,
39141,
39213,
39288,
39358,
39417,
39426,
39429,
39433,
39502,
39536,
39540,
39569,
39573,
39611,
39615,
39643,
39647,
39682,
39686,
39739,
39743,
39820,
39897,
39974,
40048,
40101,
40177,
40252,
40289,
40293,
40371,
40454,
40537,
40594,
40607,
40616,
40619,
40673,
40677,
40763,
40844,
40924,
40933,
40936,
41005,
41076,
41154,
41227,
41252,
41261,
41264,
41268,
41337,
41409,
41480,
41548,
41619,
41688,
41698,
41702,
41759,
41814,
41827,
41915,
41924,
41927,
42001,
42074,
42145,
42217,
42292,
42339,
42343,
42420,
42481,
42534,
42538,
42579,
42584,
42657,
42726,
42782,
42787,
42868,
42941,
43011,
43020,
43023,
43069,
43138,
43213,
43285,
43358,
43367,
43370,
43424,
43429,
43504,
43557,
43571,
43580,
43583,
43617,
43622,
43694,
43699,
43772,
43844,
43849,
43918,
43987,
44053,
44126,
44197,
44274,
44335,
44344,
44347,
44352,
44377,
44382,
44457,
44528,
44599,
44672,
44739,
44744,
44762,
44767,
44845,
44889,
44894,
44928,
44942
],
"line_end_idx": [
98,
123,
145,
160,
169,
172,
185,
187,
238,
240,
257,
259,
334,
343,
346,
348,
366,
382,
390,
403,
419,
422,
476,
479,
546,
581,
584,
614,
617,
698,
766,
780,
783,
864,
937,
979,
982,
1060,
1128,
1194,
1197,
1235,
1247,
1324,
1383,
1438,
1502,
1571,
1580,
1583,
1586,
1628,
1631,
1714,
1733,
1736,
1754,
1766,
1775,
1778,
1848,
1918,
1990,
2060,
2125,
2128,
2158,
2170,
2179,
2182,
2204,
2207,
2231,
2234,
2301,
2373,
2443,
2466,
2469,
2542,
2591,
2594,
2663,
2729,
2732,
2757,
2760,
2827,
2893,
2896,
2905,
2908,
2979,
3041,
3044,
3053,
3056,
3124,
3146,
3149,
3170,
3173,
3231,
3302,
3373,
3443,
3450,
3453,
3497,
3506,
3509,
3512,
3578,
3638,
3693,
3718,
3727,
3730,
3733,
3802,
3870,
3879,
3882,
3954,
4012,
4025,
4055,
4059,
4143,
4216,
4286,
4364,
4447,
4521,
4596,
4678,
4762,
4839,
4852,
4861,
4864,
4933,
5000,
5058,
5062,
5144,
5175,
5179,
5196,
5268,
5316,
5369,
5399,
5444,
5474,
5494,
5513,
5556,
5586,
5615,
5619,
5672,
5676,
5702,
5706,
5779,
5791,
5795,
5868,
5896,
5900,
5970,
6042,
6116,
6174,
6178,
6187,
6190,
6220,
6224,
6300,
6347,
6351,
6374,
6378,
6451,
6467,
6471,
6494,
6498,
6516,
6520,
6567,
6571,
6619,
6623,
6632,
6635,
6710,
6770,
6844,
6911,
6979,
7011,
7020,
7023,
7027,
7087,
7160,
7232,
7305,
7379,
7451,
7489,
7493,
7512,
7516,
7527,
7531,
7560,
7564,
7633,
7698,
7773,
7837,
7875,
7879,
7937,
8001,
8005,
8072,
8096,
8100,
8173,
8235,
8259,
8263,
8337,
8411,
8446,
8450,
8472,
8476,
8547,
8551,
8617,
8689,
8693,
8719,
8723,
8796,
8867,
8937,
9014,
9087,
9153,
9185,
9189,
9261,
9271,
9275,
9299,
9336,
9367,
9371,
9447,
9517,
9521,
9597,
9670,
9735,
9789,
9793,
9817,
9873,
9919,
9923,
9932,
9936,
9945,
9948,
9984,
9988,
10056,
10120,
10183,
10187,
10247,
10314,
10331,
10335,
10375,
10401,
10454,
10489,
10498,
10501,
10505,
10556,
10560,
10584,
10618,
10622,
10672,
10741,
10814,
10888,
10957,
11031,
11073,
11077,
11146,
11214,
11264,
11268,
11301,
11319,
11356,
11384,
11388,
11411,
11434,
11438,
11506,
11516,
11520,
11591,
11665,
11737,
11807,
11811,
11885,
11954,
12005,
12078,
12152,
12225,
12299,
12364,
12368,
12437,
12451,
12455,
12464,
12467,
12513,
12517,
12589,
12660,
12731,
12797,
12869,
12942,
13013,
13086,
13141,
13145,
13216,
13286,
13357,
13423,
13489,
13560,
13590,
13594,
13623,
13674,
13733,
13809,
13877,
13953,
14029,
14105,
14179,
14255,
14342,
14351,
14354,
14358,
14415,
14419,
14450,
14459,
14462,
14471,
14485,
14502,
14506,
14552,
14556,
14620,
14687,
14748,
14752,
14821,
14864,
14895,
14904,
14907,
14916,
14930,
14947,
14965,
15000,
15060,
15117,
15147,
15151,
15213,
15226,
15295,
15364,
15435,
15451,
15455,
15535,
15609,
15685,
15759,
15841,
15881,
15885,
15954,
16034,
16116,
16133,
16137,
16210,
16292,
16371,
16383,
16387,
16458,
16532,
16601,
16681,
16750,
16815,
16819,
16892,
16958,
16962,
17008,
17012,
17042,
17046,
17124,
17197,
17210,
17214,
17281,
17285,
17316,
17320,
17353,
17357,
17422,
17491,
17517,
17521,
17604,
17677,
17746,
17819,
17891,
17960,
18029,
18108,
18189,
18198,
18201,
18269,
18342,
18387,
18400,
18467,
18540,
18611,
18671,
18743,
18747,
18795,
18799,
18883,
18961,
19036,
19088,
19092,
19166,
19179,
19183,
19212,
19216,
19273,
19277,
19345,
19422,
19497,
19512,
19516,
19527,
19531,
19543,
19547,
19616,
19684,
19758,
19831,
19893,
19956,
19960,
20037,
20115,
20172,
20176,
20205,
20209,
20248,
20252,
20322,
20388,
20402,
20406,
20418,
20422,
20492,
20568,
20637,
20653,
20657,
20734,
20747,
20779,
20783,
20822,
20826,
20897,
20967,
20971,
20980,
20984,
20993,
20996,
21031,
21035,
21046,
21050,
21059,
21062,
21103,
21107,
21175,
21242,
21254,
21258,
21333,
21407,
21489,
21498,
21501,
21540,
21544,
21613,
21680,
21744,
21748,
21757,
21760,
21781,
21785,
21859,
21933,
21970,
21974,
22045,
22118,
22184,
22206,
22210,
22250,
22254,
22324,
22390,
22462,
22485,
22489,
22515,
22584,
22620,
22624,
22698,
22765,
22783,
22787,
22856,
22925,
22998,
23009,
23013,
23077,
23146,
23220,
23292,
23296,
23322,
23386,
23419,
23423,
23494,
23572,
23626,
23630,
23639,
23642,
23670,
23674,
23747,
23813,
23881,
23918,
23922,
23990,
24053,
24057,
24113,
24126,
24200,
24278,
24313,
24317,
24333,
24342,
24351,
24354,
24358,
24379,
24383,
24458,
24531,
24602,
24680,
24749,
24758,
24761,
24765,
24783,
24787,
24852,
24925,
24986,
24990,
25063,
25136,
25145,
25149,
25165,
25169,
25241,
25314,
25383,
25455,
25529,
25573,
25577,
25639,
25689,
25751,
25760,
25763,
25767,
25783,
25787,
25860,
25934,
26008,
26022,
26026,
26064,
26068,
26138,
26204,
26270,
26287,
26291,
26371,
26445,
26481,
26485,
26494,
26497,
26506,
26510,
26532,
26536,
26576,
26644,
26712,
26777,
26846,
26927,
27000,
27017,
27026,
27029,
27033,
27101,
27122,
27126,
27141,
27145,
27205,
27209,
27280,
27359,
27425,
27493,
27559,
27625,
27662,
27666,
27734,
27794,
27849,
27858,
27861,
27865,
27876,
27880,
27891,
27895,
27965,
28002,
28006,
28017,
28021,
28100,
28153,
28157,
28175,
28179,
28216,
28220,
28231,
28235,
28311,
28315,
28341,
28354,
28425,
28498,
28570,
28638,
28688,
28742,
28784,
28797,
28808,
28812,
28879,
28932,
28936,
28974,
29034,
29072,
29076,
29144,
29184,
29197,
29249,
29262,
29329,
29398,
29468,
29542,
29609,
29682,
29756,
29789,
29793,
29853,
29857,
29927,
30003,
30046,
30059,
30079,
30083,
30150,
30213,
30283,
30308,
30312,
30354,
30358,
30432,
30502,
30552,
30556,
30631,
30703,
30761,
30834,
30900,
30904,
30915,
30919,
30989,
31059,
31067,
31071,
31096,
31100,
31161,
31235,
31249,
31253,
31280,
31293,
31360,
31429,
31496,
31564,
31633,
31637,
31660,
31664,
31737,
31811,
31884,
31888,
31899,
31903,
31982,
32032,
32036,
32054,
32058,
32079,
32083,
32100,
32104,
32171,
32201,
32205,
32216,
32220,
32229,
32232,
32306,
32380,
32451,
32474,
32487,
32514,
32518,
32592,
32666,
32733,
32753,
32762,
32765,
32769,
32780,
32784,
32856,
32925,
32993,
33057,
33131,
33149,
33153,
33188,
33201,
33279,
33353,
33366,
33440,
33444,
33514,
33583,
33644,
33712,
33779,
33843,
33913,
33978,
34026,
34030,
34098,
34109,
34113,
34172,
34176,
34245,
34311,
34352,
34356,
34426,
34496,
34531,
34535,
34544,
34547,
34558,
34562,
34639,
34643,
34712,
34716,
34785,
34789,
34871,
34875,
34930,
34934,
35008,
35012,
35021,
35024,
35033,
35037,
35057,
35061,
35132,
35205,
35278,
35342,
35346,
35417,
35491,
35532,
35541,
35544,
35548,
35571,
35575,
35658,
35697,
35701,
35784,
35865,
35947,
36016,
36025,
36028,
36099,
36172,
36230,
36294,
36375,
36457,
36528,
36601,
36668,
36745,
36758,
36767,
36770,
36797,
36801,
36824,
36828,
36893,
36965,
37038,
37111,
37184,
37232,
37236,
37316,
37384,
37459,
37472,
37481,
37484,
37550,
37575,
37588,
37597,
37600,
37626,
37651,
37655,
37702,
37706,
37716,
37776,
37804,
37818,
37868,
37899,
37957,
37978,
38047,
38078,
38116,
38172,
38222,
38231,
38234,
38285,
38347,
38391,
38403,
38407,
38463,
38515,
38577,
38617,
38676,
38727,
38759,
38763,
38772,
38775,
38845,
38913,
38958,
39003,
39012,
39015,
39082,
39125,
39129,
39138,
39141,
39213,
39288,
39358,
39417,
39426,
39429,
39433,
39502,
39536,
39540,
39569,
39573,
39611,
39615,
39643,
39647,
39682,
39686,
39739,
39743,
39820,
39897,
39974,
40048,
40101,
40177,
40252,
40289,
40293,
40371,
40454,
40537,
40594,
40607,
40616,
40619,
40673,
40677,
40763,
40844,
40924,
40933,
40936,
41005,
41076,
41154,
41227,
41252,
41261,
41264,
41268,
41337,
41409,
41480,
41548,
41619,
41688,
41698,
41702,
41759,
41814,
41827,
41915,
41924,
41927,
42001,
42074,
42145,
42217,
42292,
42339,
42343,
42420,
42481,
42534,
42538,
42579,
42584,
42657,
42726,
42782,
42787,
42868,
42941,
43011,
43020,
43023,
43069,
43138,
43213,
43285,
43358,
43367,
43370,
43424,
43429,
43504,
43557,
43571,
43580,
43583,
43617,
43622,
43694,
43699,
43772,
43844,
43849,
43918,
43987,
44053,
44126,
44197,
44274,
44335,
44344,
44347,
44352,
44377,
44382,
44457,
44528,
44599,
44672,
44739,
44744,
44762,
44767,
44845,
44889,
44894,
44928,
44942,
44969
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 44969,
"ccnet_original_nlines": 1159,
"rps_doc_curly_bracket": 0.00004447999890544452,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30885806679725647,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.036499470472335815,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2627534568309784,
"rps_doc_frac_unique_words": 0.33850282430648804,
"rps_doc_mean_word_length": 5.355800628662109,
"rps_doc_num_sentences": 557,
"rps_doc_symbol_to_word_ratio": 0.0016008500242605805,
"rps_doc_unigram_entropy": 6.530759334564209,
"rps_doc_word_count": 6706,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.042209599167108536,
"rps_doc_frac_chars_dupe_6grams": 0.017262499779462814,
"rps_doc_frac_chars_dupe_7grams": 0.010580239817500114,
"rps_doc_frac_chars_dupe_8grams": 0.004621900152415037,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.009188110008835793,
"rps_doc_frac_chars_top_3gram": 0.00300702010281384,
"rps_doc_frac_chars_top_4gram": 0.0025615300983190536,
"rps_doc_books_importance": -3252.852783203125,
"rps_doc_books_importance_length_correction": -3252.852783203125,
"rps_doc_openwebtext_importance": -2012.7442626953125,
"rps_doc_openwebtext_importance_length_correction": -2012.7442626953125,
"rps_doc_wikipedia_importance": -1460.5860595703125,
"rps_doc_wikipedia_importance_length_correction": -1460.5860595703125
},
"fasttext": {
"dclm": 0.12720024585723877,
"english": 0.7739995718002319,
"fineweb_edu_approx": 2.052670955657959,
"eai_general_math": 0.8299916982650757,
"eai_open_web_math": 0.4494019150733948,
"eai_web_code": 0.8253263831138611
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "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,538,394,162,961,472,000 | Hacker News new | comments | show | ask | jobs | submit login
It is, at least, about making Ruby more concurrent. Rubinius eliminates the global interpreter lock, which helps, but Ruby's execution model is still very much thread-oriented; Ruby's fibers are very slow, and are not good enough for Node-style concurrency.
It is also about wiping the slate clean. Ruby still has some ugly stuff inherited from Perl (globals for regex results, or the use of unreadable "magical" globals such as $:). There are many areas where years of experience can help us design a better language.
>Ruby still has some ugly stuff inherited from Perl (globals for regex results, or the use of unreadable "magical" globals such as $:)
And Ruby also has some pretty stuff inherited from Perl like postfix statements & first class regex so it wouldn't be good to strip out all of Perl's influences! Gosh even Ruby's blocks are (partly) inspired by Perl's list block functions...
array.map {|n| n * 2}
map {$_ * 2} @array;
However I do agree that Ruby's magical global variables should be removed because they're not dynamically scoped like in Perl.
NB. It should be noted that not all Ruby magical variables even come from Perl. For eg. $: doesn't and thankfully Perls $= does something quite different to Rubys! - https://news.ycombinator.com/item?id=5072925
To me, that is more like Ruby 3.0, or a similar languages with another name.
How will this turn out? Matz will approve it? If yes why not make Rubinius the default implementation?
If not, then ?
Guidelines | FAQ | Support | API | Security | Lists | Bookmarklet | DMCA | Apply to YC | Contact
Search: | {
"url": "https://news.ycombinator.com/item?id=6557113",
"source_domain": "news.ycombinator.com",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "7632",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2RPAY2S4IZQZQFJFYVAAZWQ6YSKEFRVH",
"WARC-Concurrent-To": "<urn:uuid:57c3d7a9-b183-429c-bbbe-63faa23dc471>",
"WARC-Date": "2017-01-23T07:05:20Z",
"WARC-IP-Address": "104.20.44.44",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:CNU4CMSY6UYRCYPMUFPB2ZTW4Y2XO3S6",
"WARC-Record-ID": "<urn:uuid:6bd91662-eeb7-4854-812a-79caa0782c3c>",
"WARC-Target-URI": "https://news.ycombinator.com/item?id=6557113",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6b707ea5-c8a0-4f64-90fa-4935071a3c94>"
},
"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,
62,
63,
321,
322,
583,
584,
585,
586,
587,
722,
723,
965,
966,
990,
991,
1014,
1141,
1142,
1353,
1354,
1355,
1432,
1433,
1536,
1537,
1552,
1553,
1554,
1555,
1556,
1653,
1654
],
"line_end_idx": [
62,
63,
321,
322,
583,
584,
585,
586,
587,
722,
723,
965,
966,
990,
991,
1014,
1141,
1142,
1353,
1354,
1355,
1432,
1433,
1536,
1537,
1552,
1553,
1554,
1555,
1556,
1653,
1654,
1661
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1661,
"ccnet_original_nlines": 32,
"rps_doc_curly_bracket": 0.002408189931884408,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3571428656578064,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016483519226312637,
"rps_doc_frac_lines_end_with_ellipsis": 0.030303029343485832,
"rps_doc_frac_no_alph_words": 0.25,
"rps_doc_frac_unique_words": 0.6293436288833618,
"rps_doc_mean_word_length": 4.8532819747924805,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0.002747250022366643,
"rps_doc_unigram_entropy": 4.912879467010498,
"rps_doc_word_count": 259,
"rps_doc_frac_chars_dupe_10grams": 0.1654733568429947,
"rps_doc_frac_chars_dupe_5grams": 0.1654733568429947,
"rps_doc_frac_chars_dupe_6grams": 0.1654733568429947,
"rps_doc_frac_chars_dupe_7grams": 0.1654733568429947,
"rps_doc_frac_chars_dupe_8grams": 0.1654733568429947,
"rps_doc_frac_chars_dupe_9grams": 0.1654733568429947,
"rps_doc_frac_chars_top_2gram": 0.025457439944148064,
"rps_doc_frac_chars_top_3gram": 0.04295942932367325,
"rps_doc_frac_chars_top_4gram": 0.0525059700012207,
"rps_doc_books_importance": -172.78102111816406,
"rps_doc_books_importance_length_correction": -159.39166259765625,
"rps_doc_openwebtext_importance": -89.34928131103516,
"rps_doc_openwebtext_importance_length_correction": -89.34928131103516,
"rps_doc_wikipedia_importance": -71.39578247070312,
"rps_doc_wikipedia_importance_length_correction": -59.722999572753906
},
"fasttext": {
"dclm": 0.24637305736541748,
"english": 0.9302541613578796,
"fineweb_edu_approx": 1.4553238153457642,
"eai_general_math": 0.030511079356074333,
"eai_open_web_math": 0.12136858701705933,
"eai_web_code": 0.29343992471694946
}
} | {
"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": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "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 |
-4,329,375,315,191,341,600 | HDIO(4I) Ioctl Requests HDIO(4I)
hdio
SMD and IPI disk control operations
#include <sys/hdio.h>
Note — the SMC and IPI drivers have been discontinued. dkio(4I) is now the preferred method for retrieving disk information.
The SMD and IPI disk drivers supplied with this release support a set of ioctl(2) requests for diagnostics and bad sector information. Basic to these ioctl(2) requests are the definitions in <sys/hdio.h>.
The argument is a pointer to a hdk_type structure (described below). This ioctl(2) gets specific information from the hard disk.
The argument is a pointer to a hdk_type structure (described below). This ioctl(2) sets specific information about the hard disk.
/*
* Used for drive info
*/
struct hdk_type {
ushort_t hdkt_hsect; /* hard sector count (read only) */
ushort_t hdkt_promrev; /* prom revision (read only) */
uchar_t hdkt_drtype; /* drive type (ctlr specific) */
uchar_t hdkt_drstat; /* drive status (ctlr specific, ro) */
};
The argument is a pointer to a hdk_badmap structure (described below). This ioctl(2) is used to get the bad sector map from the disk.
The argument is a pointer to a hdk_badmap structure (described below). This ioctl(2) is used to set the bad sector map on the disk.
/*
* Used for bad sector map
*/
struct hdk_badmap {
caddr_t hdkb_bufaddr; /* address of user's map buffer */
};
The argument is a pointer to a hdk_diag structure (described below). This ioctl(2) gets the most recent command that failed along with the sector and error number from the hard disk.
/*
* Used for disk diagnostics
*/
struct hdk_diag {
ushort_t hdkd_errcmd; /* most recent command in error */
daddr_t hdkd_errsect; /* most recent sector in error */
uchar_t hdkd_errno; /* most recent error number */
uchar_t hdkd_severe; /* severity of most recent error */
};
ioctl(2), dkio(4I)
October 23, 2017 OmniOS | {
"url": "https://man.omnios.org/man4i/hdio",
"source_domain": "man.omnios.org",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "5777",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:52JC7NZTXQS5ROHO7O5F2DZKW6HCYYR6",
"WARC-Concurrent-To": "<urn:uuid:20713874-c3bc-474a-83d2-df8199c3dc9e>",
"WARC-Date": "2022-09-29T08:42:59Z",
"WARC-IP-Address": "129.132.2.8",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QDPLJVXFF6OLKDSU7B3ZFNT3QFA6OX74",
"WARC-Record-ID": "<urn:uuid:e48ad1ef-6f85-4f9a-a9d9-262801654175>",
"WARC-Target-URI": "https://man.omnios.org/man4i/hdio",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:23aed367-737f-4bb9-ae13-faaa1dbbc816>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-188\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
33,
34,
39,
75,
76,
98,
99,
224,
225,
430,
431,
560,
690,
693,
716,
720,
738,
800,
858,
917,
982,
985,
1119,
1251,
1254,
1281,
1285,
1305,
1363,
1366,
1549,
1552,
1581,
1585,
1603,
1661,
1718,
1772,
1831,
1834,
1835,
1854
],
"line_end_idx": [
33,
34,
39,
75,
76,
98,
99,
224,
225,
430,
431,
560,
690,
693,
716,
720,
738,
800,
858,
917,
982,
985,
1119,
1251,
1254,
1281,
1285,
1305,
1363,
1366,
1549,
1552,
1581,
1585,
1603,
1661,
1718,
1772,
1831,
1834,
1835,
1854,
1877
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1877,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0.0031965901143848896,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24358974397182465,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03076923079788685,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2948717772960663,
"rps_doc_frac_unique_words": 0.3903345763683319,
"rps_doc_mean_word_length": 5.10780668258667,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.002564100082963705,
"rps_doc_unigram_entropy": 4.301031112670898,
"rps_doc_word_count": 269,
"rps_doc_frac_chars_dupe_10grams": 0.20087336003780365,
"rps_doc_frac_chars_dupe_5grams": 0.28020378947257996,
"rps_doc_frac_chars_dupe_6grams": 0.2540028989315033,
"rps_doc_frac_chars_dupe_7grams": 0.2241630256175995,
"rps_doc_frac_chars_dupe_8grams": 0.2066957801580429,
"rps_doc_frac_chars_dupe_9grams": 0.20087336003780365,
"rps_doc_frac_chars_top_2gram": 0.04002910852432251,
"rps_doc_frac_chars_top_3gram": 0.047307129949331284,
"rps_doc_frac_chars_top_4gram": 0.05094613879919052,
"rps_doc_books_importance": -167.1211395263672,
"rps_doc_books_importance_length_correction": -167.1139373779297,
"rps_doc_openwebtext_importance": -93.21105194091797,
"rps_doc_openwebtext_importance_length_correction": -93.21105194091797,
"rps_doc_wikipedia_importance": -61.606876373291016,
"rps_doc_wikipedia_importance_length_correction": -61.60687255859375
},
"fasttext": {
"dclm": 0.03629833087325096,
"english": 0.688136100769043,
"fineweb_edu_approx": 1.9655883312225342,
"eai_general_math": 0.22882217168807983,
"eai_open_web_math": 0.7928627729415894,
"eai_web_code": 0.1319335699081421
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.62",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
3,936,518,684,169,722,000 | Posts Tagged ‘game’
Python Tactics – Documentation 5/20/14
Posted on: May 20th, 2014 by Adam No Comments
So here’s a fun little project I’m working on–Python Tactics (very tentative title). In short, it’s a turn-based tactics game that I’m developing in Python using Maya as an engine.
The Idea
Near the beginning of my internship at EA Tiburon, I knew that I would be working on various tools and scripts that would be written in Python and C#. At that time, I hadn’t written any Python for about a month or two, and I hadn’t used C# for a few years, so I wanted to start a little side project to help me get back into it. I thought maybe I could make chess or something grid-based, but I wasn’t sure what yet. A couple of days later, I randomly wondered if it was possible to use animated images (.gif’s or image sequences or something) in Maya’s GUI. That thought along with the grid idea lead me to decide on making a tactics game. I briefly thought about making the whole game in Maya’s GUI (displaying the game board, the characters, the animations, etc.), but then I thought it would be neat if I could use 3D models in the viewport in addition to using some GUI windows as the actual user interface.
At the same time, I was thinking how cool it would be if Maya, this robust tool for creating 3D models, could also be used as an engine to run a game. I always thought it was a bummer that artists created their assets in one program, where they may look and work perfectly, but then had to import them into an engine which might display and treat the assets differently than the program they were created in, requiring the artists to go back and fix the assets. I observed that this often led to artists not ever wanting to touch the engine because 1) they would often observe something was wrong, meaning they had to do more work and 2) they didn’t how why something was wrong because the engine wasn’t a program they were required to be familiar with. This obviously led to frustration. Who can blame them? It’s an awful feeling when you think you’re done with something only to find out that you’re not, especially when you don’t know how to actually finish your work. What if the 3D creation tool and the engine were one and the same? What if the artists could use all of their creation tools in the engine? They would already know how to fix things, and their assets would look and work exactly as expected–what you’d see is what you’d get! Cool stuff.
I had been using mostly Python at the time, so I decided to start writing in that and then port it over to C# later. My hope was this would give me some good practice in both languages as well as practice in writing code that was as language independent as possible.
So that’s where the idea came from–essentially just a combination of “Huh, I wonder if you can do this,” and “Hey, wouldn’t this be cool?”
Structuring the Code
One thing I wanted to practice was dividing and structuring my code into different, appropriate groups. Mainly, I wanted to get some more practice effectively using classes and inheritance. The concepts were not at all new to me, but I had never really used classes together before, especially those that inherited from one another, and when I had, it was never really anything extensive. The first thing that immediately came to mind was characters. No wait! Entities… Yes… *wrings hands together* Entities would be perfect for this kind of thing. I came up with two types of entities–characters and obstacles. For both characters and obstacles, I would need to know where in 3D space (and on the grid) these would be. I would also need the ability to move both characters and obstacles. These attributes and functions would go in the Entity class, and both the Character and Obstacle classes would inherit from Entity. Each of those classes–Character and Obstacle–were broken down into more classes and those classes into yet more classes. In order to avoid becoming unnecessarily wordy, I’ll just use a diagram:
Classes lower in the diagram inherit from the higher ones they’re connected to.
So that’s the meat of my starting material. All of those classes are in an Entities module. I have a few other modules. EventController controls handling selections/mouse actions, starting the game, and controlling turns. GUIBuilder takes care of setting up, displaying, and editing the two GUI windows as the game goes on. TheGrid contains a GridSpaceVert class that holds information about a vertex, a GridSpace class that holds information about an individual square on the grid, and the TheGrid class that can create the game board/grid (comprised of many GridSpace instances), can clear the board, can resize the board, and can get/set information about the grid’s spaces and any entities on those spaces. Finally, I have a CubeBattle module that I’m using to import everything, create instances, and put the whole thing in motion.
These classes, while well organized (I think), are probably nowhere near done. However, so far I’ve been able to appropriately group every new piece of code I’ve thought of into one of the modules, so I’m pretty pleased with that. So far…
Problems and Obstacles I’ve Encountered
The first real obstacle I ran into was trying to get things to happen when I made a new selection. I knew that I needed, for example, the soldier cube to move to the space I clicked on. I knew how to move it, that was a simple matter of setting its position to the center of the square I clicked on, but how could I move it when I clicked on that square? I did quite a lot of research on the topic. For a while I thought that I would have to get into some C++(?) in order to anything event-based. I also found some information on Maya’s dragger context command and thought I might be able to use that. Thankfully, I eventually found my Holy Grail: script jobs. Script jobs run when certain events are triggered in Maya, and one just so happens to run whenever a new selection is made. Perfect! This was exactly what I needed! Whenever a new selection was made, I could run code based on what that selection was. In this case, I could detect if a square was selected in the character’s range, and, if it was during the character’s movement phase, move the geometry to that square.
I ran into a few more problems related to this (turning the script jobs off, using more than one script job for different tasks, etc.), but I eventually worked them all out. The next big problem was getting the Mario sprite in the GUI window to animate. The first thing I tried was simply setting the GUI’s image as a .gif. Unfortunately (but not surprisingly), this did not work. I also tried using a video as the GUI image’s source, but that too did not work (again not surprising). My next thought was that I would have to have different images and change the GUI image’s source over time, but how would I do that? I looked through the script jobs to see if there was one that could help me, but didn’t see one that could. They all run when an event is triggered, not simply over time in the background (or so I thought). I then tried mucking with moving the timeline and having that control the GUI image’s animation. I soon learned that I was unable to run code while the timeline was playing. Too bad… That would have been nice when the time came to implement 3D character animations. Oh well… I kept looking and looking, and I couldn’t find any answers or even helpful information. Finally, one day, I was looking back through the script jobs, and I noticed there was an “idle” event. I looked into it a bit and realized that this was exactly what I needed! When Maya wasn’t performing any other tasks, it was idle (duh :P), and it would call an idle event script job! With this, I was able to keep track of time, and switch the GUI image’s source to the next image in the sequence over time. Problem solved (b^_^)b
Future Plans
As you can see in the video, the game already runs at a basic level. Characters have turns in which they can move and attack, they can die, and the game can end. I’m in the process of deciding what exactly I want to implement next. I’m still not sure, but I do have some things I want to implement eventually (in no particular order):
• 3D characters and animations
• different elevations on the board
• a more robust GUI (which would be anything at this point :P)
• special attacks/moves for different character classes
• more character classes
• support for an infinite number of entities on the board (I think I already have this, but I haven’t really tested it yet)
So that’s where I am so far. I’ll keep updating as I get more done 😀 | {
"url": "http://ajsgrayson.com/tag/game/",
"source_domain": "ajsgrayson.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "44934",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KA5VD5BMPOQA24HWSOCOE4AWW5AQAIM5",
"WARC-Concurrent-To": "<urn:uuid:57af9cb5-d641-41d7-ad56-4aa8c3fe48c7>",
"WARC-Date": "2023-12-11T10:01:47Z",
"WARC-IP-Address": "50.63.8.12",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BBYQS5APQQHXFPURGBZ6EIG2ALE2QCFL",
"WARC-Record-ID": "<urn:uuid:c992cb9f-cdd7-423f-95b4-7fa5bb332fa6>",
"WARC-Target-URI": "http://ajsgrayson.com/tag/game/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:448e945f-9db9-4d3d-ae4d-222cbc8f1342>"
},
"warc_info": "isPartOf: CC-MAIN-2023-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-172\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
20,
21,
60,
61,
107,
108,
290,
291,
300,
301,
1219,
1220,
2487,
2488,
2756,
2757,
2896,
2897,
2899,
2900,
2921,
2922,
4049,
4050,
4130,
4131,
4974,
4975,
5216,
5217,
5219,
5220,
5260,
5261,
6352,
6353,
7994,
7995,
7997,
7998,
8011,
8012,
8350,
8351,
8384,
8422,
8487,
8545,
8572,
8698,
8699,
8701,
8702
],
"line_end_idx": [
20,
21,
60,
61,
107,
108,
290,
291,
300,
301,
1219,
1220,
2487,
2488,
2756,
2757,
2896,
2897,
2899,
2900,
2921,
2922,
4049,
4050,
4130,
4131,
4974,
4975,
5216,
5217,
5219,
5220,
5260,
5261,
6352,
6353,
7994,
7995,
7997,
7998,
8011,
8012,
8350,
8351,
8384,
8422,
8487,
8545,
8572,
8698,
8699,
8701,
8702,
8771
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8771,
"ccnet_original_nlines": 53,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.47460317611694336,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05714286118745804,
"rps_doc_frac_lines_end_with_ellipsis": 0.018518520519137383,
"rps_doc_frac_no_alph_words": 0.14656084775924683,
"rps_doc_frac_unique_words": 0.33014050126075745,
"rps_doc_mean_word_length": 4.388888835906982,
"rps_doc_num_sentences": 80,
"rps_doc_symbol_to_word_ratio": 0.0042328000999987125,
"rps_doc_unigram_entropy": 5.495334625244141,
"rps_doc_word_count": 1566,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.020660560578107834,
"rps_doc_frac_chars_dupe_6grams": 0.007274840027093887,
"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.007274840027093887,
"rps_doc_frac_chars_top_3gram": 0.007565840147435665,
"rps_doc_frac_chars_top_4gram": 0.008293320424854755,
"rps_doc_books_importance": -865.8784790039062,
"rps_doc_books_importance_length_correction": -865.8784790039062,
"rps_doc_openwebtext_importance": -400.0814208984375,
"rps_doc_openwebtext_importance_length_correction": -400.0814208984375,
"rps_doc_wikipedia_importance": -378.60772705078125,
"rps_doc_wikipedia_importance_length_correction": -378.60772705078125
},
"fasttext": {
"dclm": 0.11224508285522461,
"english": 0.9692175984382629,
"fineweb_edu_approx": 1.9083306789398193,
"eai_general_math": 0.6952256560325623,
"eai_open_web_math": 0.2871692180633545,
"eai_web_code": 0.30247962474823
}
} | {
"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": "4",
"label": "Analyze"
}
},
"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": "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 |
-489,097,949,313,497,300 | Number of business days between 2 dates
You can return the number of business days between two dates by using the NETWORKDAYS.INTL function.
This function will include both the "start_date" and the "end_date" so you need to minus 1.
This function will ignore Saturdays and Sundays by default.
A
1=TODAY() = Thursday 01 December 2022
2=NOW() = Thursday 01 December 2022 06:02:29
3=NETWORKDAYS.INTL(A1,A1) = 1
4=NETWORKDAYS.INTL(A1,A1)-1 = 0
5=NETWORKDAYS.INTL(A1,A1+1)-1 = 1
6=NETWORKDAYS.INTL(A1,A1+2)-1 = 1
7=NETWORKDAYS.INTL(A1,A1+3)-1 = 1
8=NETWORKDAYS.INTL(A1,A1+4)-1 = 2
9=NETWORKDAYS.INTL(A1,A1+5)-1 = 3
10=NETWORKDAYS.INTL(A1,A1+6)-1 = 4
11=NETWORKDAYS.INTL("01/01/2020","20/01/2020")-1 = 13
1 - Displays the current date. Custom format "dddd dd mmmm yyyy".
2 - Displays the current date and time. Custom format "dddd dd mmmm yyyy hh:mm:ss".
3 - Displays the number of business days between that date and 1 day after.
4 - Displays the number of business days between that date and 2 days after.
Cell "A10" displays the number of business days between 1 January 2020 and 20 January 2020.
Built-in Functions
TODAY - The date serial number representing today's date.
NOW - The date serial number of the current system date and time.
NETWORKDAYS.INTL - The total number of working days between two dates excluding weekends and holidays.
Related Formulas
Add business days to a date
Number of business days in a particular month
Number of business days left in the current month
Number of business days left in the current year
Number of business days that have passed in the current month
© 2022 Better Solutions Limited. All Rights Reserved. © 2022 Better Solutions Limited Top | {
"url": "https://bettersolutions.com/excel/formulas/number-of-business-days-between-2-dates.htm",
"source_domain": "bettersolutions.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "20754",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:V4DWC3LKZM4AQ5JAFHADKIW4TT37TAOU",
"WARC-Concurrent-To": "<urn:uuid:3482ce21-e3d2-45d2-a800-521d91bbf11c>",
"WARC-Date": "2022-12-07T13:24:30Z",
"WARC-IP-Address": "160.153.155.173",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:P33KDZBKLCKI6PZDRTTZZALK33U74M7M",
"WARC-Record-ID": "<urn:uuid:0b7add59-b1ff-4faf-80b6-23cff0a5a832>",
"WARC-Target-URI": "https://bettersolutions.com/excel/formulas/number-of-business-days-between-2-dates.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b8d97322-4e1e-45dd-9333-09eb4cc81fb0>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-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,
40,
41,
142,
234,
294,
295,
296,
299,
337,
382,
412,
444,
478,
512,
546,
580,
614,
649,
703,
704,
770,
854,
930,
1007,
1099,
1100,
1101,
1120,
1121,
1179,
1245,
1348,
1349,
1350,
1367,
1368,
1396,
1442,
1492,
1541,
1603,
1604,
1605
],
"line_end_idx": [
40,
41,
142,
234,
294,
295,
296,
299,
337,
382,
412,
444,
478,
512,
546,
580,
614,
649,
703,
704,
770,
854,
930,
1007,
1099,
1100,
1101,
1120,
1121,
1179,
1245,
1348,
1349,
1350,
1367,
1368,
1396,
1442,
1492,
1541,
1603,
1604,
1605,
1694
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1694,
"ccnet_original_nlines": 43,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.16183574497699738,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.10628019273281097,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.41304346919059753,
"rps_doc_frac_unique_words": 0.42561984062194824,
"rps_doc_mean_word_length": 5.355371952056885,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.216511249542236,
"rps_doc_word_count": 242,
"rps_doc_frac_chars_dupe_10grams": 0.07561728358268738,
"rps_doc_frac_chars_dupe_5grams": 0.29398149251937866,
"rps_doc_frac_chars_dupe_6grams": 0.23148147761821747,
"rps_doc_frac_chars_dupe_7grams": 0.16820988059043884,
"rps_doc_frac_chars_dupe_8grams": 0.1388888955116272,
"rps_doc_frac_chars_dupe_9grams": 0.1388888955116272,
"rps_doc_frac_chars_top_2gram": 0.06790123134851456,
"rps_doc_frac_chars_top_3gram": 0.1111111119389534,
"rps_doc_frac_chars_top_4gram": 0.1388888955116272,
"rps_doc_books_importance": -168.52598571777344,
"rps_doc_books_importance_length_correction": -156.20330810546875,
"rps_doc_openwebtext_importance": -120.7253646850586,
"rps_doc_openwebtext_importance_length_correction": -120.7253646850586,
"rps_doc_wikipedia_importance": -120.54048919677734,
"rps_doc_wikipedia_importance_length_correction": -110.88513946533203
},
"fasttext": {
"dclm": 0.17265534400939941,
"english": 0.8151397705078125,
"fineweb_edu_approx": 0.9862773418426514,
"eai_general_math": 0.0053027900867164135,
"eai_open_web_math": 0.000977040035650134,
"eai_web_code": 0.08804398775100708
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "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": "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 |
604,298,530,561,020,500 | Ant is a software tool for automating software build processes. ANT IS BELONG TO Apache group.
learn more… | top users | synonyms
0
votes
0answers
15 views
How can I include two languages in build.xml of Apache ant builder
I want my ant builder to build both Scala and Java. How can I include both the languages in my lang field and includes field? What delimiter needs to be used? The target currently looks like this: ...
1
vote
0answers
46 views
ExtJS 5 Build Error (ExBuild: Failed to compress input)
I have some build errors when try to build my ExtJS application (My OS is Windows 7) app.framework.version=5.0.0.970 app.cmd.version=5.0.0.160 Building failed with an exception: ...
0
votes
0answers
17 views
Formatted Output in Antbuilder
ant = new AntBuilder()4.ant.project.getBuildListeners().each{ it.setOutputPrintStream(new PrintStream(x)) } ant.echo("goes to my output stream") I know I can use the above code to write my ...
0
votes
2answers
80 views
Error with target in building by build.xml
I have opened a project which has build.xml and ivy.xml in eclipse env. after I applied Run As..>Ant Built by right click build.xml, I faced this error: BUILD FAILED Target "retrieve" does not ...
0
votes
1answer
18 views
Execute play from Ant script
I'm looking for a way to run play dist through an Ant build script. I've looked into using the exec task but it is not working for me. Here is what I tried: <target name="deploy"> <exec ...
0
votes
0answers
58 views
Can I include fileset attributes when using Gradle's addToAntBuilder?
I'm trying to call an Ant script from Gradle and I'm using FileCollection#addToAntBuilder to add a fileset to the Ant configuration. Specifically, I'm trying to call the fx:deploy task from JavaFX's ...
0
votes
1answer
31 views
Build failed while executing Ant script
I have an ant script: <?xml version="1.0" encoding="UTF-8"?> <project name="AntTest" basedir="." default="clean"> <property name="src.dir" value="src"/> <property ...
0
votes
0answers
78 views
Creating multiple JARs using ant build
I am working on android uiautomator, I want break my .dex into multiple child .dex according to number of package available into src folder. Current android .dx tool create only one .dex file of all ...
0
votes
2answers
119 views
Groovy AntBuilder Execute task in Background
Could use your help: Trying to execute an ant task in Groovy so that it doesn't wait for the response from the script (i.e. run in background) I've tried the following two ways with no success ...
0
votes
0answers
46 views
Java - Launch4j, Build failure
I am trying to create an executable file from my project but unfortunately I have this failure: Buildfile: C:\02_DEV\R_5_2_3\DiagraDB\build.xml compile: [javac] Compiling 1 source file ...
2
votes
0answers
283 views
com.android.dex.DexException: Multiple dex files define while ant build
I know that there are a lot of posts about this exception but non of them seemed to be helpful. I have deleted all the bin and gen folders, i have removed all library dependencies and added them ...
1
vote
3answers
36 views
Is it possible to run a program by downloading the source folder in eclipse?
I was curious if it is possible to run a project in a different desktop by just downloading the source folder and setting it as the workspace? If possible, how can I run it? When I try, an ...
0
votes
1answer
117 views
Android ANT Build - Lots of Mopub errors
I'm trying to create a script to automate the signed exportation of my android apps (to avoid manual work when I release an update to all my apps). I've followed this tutorial: ...
0
votes
1answer
88 views
Where is the documentation for Gradle's AntBuilder?
I'm porting an Ant build.xml to Gradle. I wanted to use Gradle's AntBuilder to do something like task mytask << { ant { jar(..) { ... } } } I am having some trouble with the syntax ...
0
votes
1answer
214 views
How to build a build.xml file to run a bat file or shell script
I have a bat file and shell script which performs the same operation. Now i have create a ant build.xml file which would execute the shell script or bat file. How should i write my build.xml or how ...
0
votes
1answer
82 views
Change metadata and artifact Repository names with p2 and Ant builder from build.xml file
I want to change the name of my resulting repositories when running a Ant build for a deplayable feature from: "repository name='file://buildRepo - artifacts' t.." to a more friendly one. i have ...
1
vote
1answer
185 views
Specify Groovy AntBuilder execution directory
I can execute a pom.xml with goals using AntBuilder like so. def ant = new AntBuilder() ant.sequential { exec(executable:'mvn') { arg(value:'clean') arg(value:'install') } } ...
1
vote
2answers
277 views
AntBuilder ant echo task to append text to a file
I am running ant task in a groovy file and below is the snippet of it: def user="USER" project.ant.echo(file:"/a/b/c/test.properties", message:"user=${user}", append="true") I am trying to append ...
0
votes
4answers
683 views
Parsing xml property to ant-build.xml file
I have a xml file "versionreferance.xml". below is the coding <?xml version="1.0" encoding="utf-8"?> <!-- Update "revision" value to -1 when the next build is intended to have its revision ...
0
votes
1answer
92 views
Confusion with ant regex at the time of filename selector
I am trying to select all jars from the current directory. I am getting confused between: **/*.jar *.jar I assumed *.jar will work the same as **/*.jar. However the following examples are working ...
1
vote
0answers
141 views
Inherit classpath id in master build.xml
I have a base build.xml in that contains: <path id="master-classpath-common-lib" > <fileset dir="${master.classpath}/lib"> <include name="*.jar"/> </fileset> ...
0
votes
2answers
495 views
Building .exe file with database connectivity jars [closed]
Can anyone tell me how to build the .exe file by including the library jar files for database connection? I have a standalone application and I am using the launch 4j .exe builder.
2
votes
1answer
82 views
Reduce code repetition in Groovy closures
In a piece of Gradle build script, the amount of code i'm repeating is increasing. All tasks have a big part in common, except for a few lines: task copyZipFile() { doLast { def ...
1
vote
1answer
399 views
Groovy AntBuilder scp catch exception
I need to copy some files using scp from a remote host. If the file is not there I need to display a message. The problem I have, is that I cannot catch a FileNotFound Exception. All I have is a ...
0
votes
1answer
101 views
HTML5 Boilerplate ant build subdirectory
I have config in project .properties file.pages =dashboard/**/*.html in dashboard/index.html i have <!-- //-beg- concat_js --> <script src="../js/plugins.js"></script> ...
0
votes
1answer
39 views
Is this a valid path?
I have an Ant Build script to build my project. It is so large that it takes 40 minutes to run. Instead of running it 40 minutes and failing, I'd thought I'd ask the StackOverflow community first. ...
1
vote
1answer
551 views
Scan directories in groovy with ant builder file scanner
I want to use fileScanner of AntBuilder to go over directories. My code looks like: scanner = new AntBuilder().fileScanner { fileset(dir:sourcedir, casesensitive:false) { ...
0
votes
0answers
189 views
How to configure groovydocs properly?
I'm trying to generate groovydocs but can't seem to get it set it up correctly. I researched for a long time and tried to piece together everyone's hints and ways throughout the web but nothing seems ...
0
votes
1answer
101 views
Groovy: Antbuilder fileset is not created (launched from Jenkins)
I have following code in my script: def ant_fs = (new AntBuilder()) def fs = ant_fs.fileset( dir: <path> ) fs.each{ println( "Fileset item: $it" ) } When I launch it from Maven (mvn ... ...
1
vote
0answers
331 views
antbuilder pass fileset as closure
I use Groovy and Antbuilder to copy some files during deployment on my test server. I want to log all files selected to copying. Now I do the following: ant.sequential{ def fsExes = (new ...
16
votes
2answers
2k views
Can't build multiple Android dex files with Ant from external jars
I'm developing an Android app that requires multiple libraries (for Facebook, Google Maps v2 and Quickblox among others), resulting in a method amount overflow that goes over the 64K limit: Unable to ...
1
vote
0answers
126 views
Groovy-Ant Preserve File Structure in Zip Archive
I am working with Ant in Groovy, and I want to operate on all files in a directory that match certain criteria. I have the following: def fileSet = ant.fileset(dir: srcDir, id: "files", includes: ...
3
votes
1answer
607 views
Enable verbose output from groovy's AntBuilder
Is there a way to turn debug/verbose output on for groovy's AntBuilder? In other words, I want to enable more detailed output like one would get with ant -verbose from the command line. I know about ...
0
votes
1answer
760 views
Zip specific files with AntBuilder
I need to zip a collection of files from different location into one zip, keeping their initial relations. For example, I need only a1 and b2 from the following folder structure Top -- A -- a1 ...
3
votes
2answers
76 views
Are there any tools which can automate rebuilding of the project when ever there is a change in some part of code?
I use Eclipse IDE for my java projects and there are times in which I need to change some constants and test the effect of it. But on change of the code I have to rebuild it which generally takes me ...
0
votes
1answer
2k views
Zip files/Directories in Groovy with AntBuilder
I am trying to zip files and directories in Groovy using AntBuilder. I have the following code: def ant = new AntBuilder() ant.zip(basedir: "./Testing", destfile:"${file}.zip",includes:file.name) ...
0
votes
2answers
416 views
Ant Script to Automate the build process
I Want to automate the ANT build process for deploying the applicaiton. I want to write a ANT script which will recurringly should look for the build.xml files in the folder and run them, if the ...
0
votes
2answers
876 views
Ant rpm build fails due to unknown option '-bs'
build.xml <?xml version="1.0"?> <project default="main" basedir="."> <echo message="pulling in property files" /> <property file="axis_bujava.properties" /> <echo ...
0
votes
1answer
623 views
ant build fails with Basedir error in windows platform
I am trying to set up my project on my laptop which runs on windows 7. I am not able to build the project, it throws an error BUILD FAILED C:\Projects\apsrtc-oprs\src\build.xml:118: Basedir ...
-1
votes
1answer
974 views
How to create a build.xml file for this folder strucure [closed]
I have, build/classes - compiled java codes libs - some jar files src - java codes WebContent - all the .jsp files, WEB-INF/lib and META-INF i create some build files but they did ...
0
votes
2answers
304 views
gradle - multiple module project - ant wrong execution dir
I've a multiple module projecy managed by gradle. The directory structure is as follows: monitoring client server When I invoke 'gradle war' on monitoring level I obtain the following ...
0
votes
1answer
609 views
Run nested task in custom task
I have written my own ANT task to perform some function. However, I need this task to invoke a java task as a nest task. So I have the following code in my build file: <mytask ... > <java ...
0
votes
1answer
476 views
How to pass arguments to ant.java() method in Groovy
I am trying to convert an ant <java> task to groovy. I am using the following code: def ant = new AntBuilder(); ant.java(classpath:'jar_file_path', classname:'Main', fork:'true') I also have ...
1
vote
1answer
424 views
How to make a war file with ant in groovy?
I have following script which is aim to make a war file. def ant = new AntBuilder() ant.ant(antfile:'build.xml', dir:APP_ROOT, target:'war') unfortunately I am getting following error when groovy ...
2
votes
1answer
367 views
Ant, Groovy, GWT Invoking GWT compile with AntBuilder
Hi I'm working my way through creating a groovy script to automate building and packaging a gwt application. AntBuilder is bundled as part of Groovy and I really like the concept. It really does ...
7
votes
1answer
7k views
Proguard tells me 'Please correct the above warnings first.'. How to address references of external jars?
How can I address the warnings? Log says [proguard] Note: duplicate definition of library class... ... [proguard] Note: there were 370 duplicate class definitions. [proguard] Initializing... ...
1
vote
1answer
486 views
How to display all resources included in a Groovy AntBuilder classpath?
I am using Groovy's AntBuilder to build a Java project. An error is occurring where classes are missing that really look like they should be included. I want to print out every JAR/WAR that's ... | {
"url": "http://stackoverflow.com/questions/tagged/antbuilder",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-06",
"warc_metadata": {
"Content-Length": "170009",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:I2J7SFYPJ3GC6VW4KKX77ZYGFXBNUWSA",
"WARC-Concurrent-To": "<urn:uuid:76bc3060-ae44-46ac-aa51-c0e65de0d9b5>",
"WARC-Date": "2015-01-30T15:10:37Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:J5G7YOE7FHERBDET4HC5DIHWDHZGY7YL",
"WARC-Record-ID": "<urn:uuid:1ce0cb1a-a03b-4534-a124-34eb20b6e92c>",
"WARC-Target-URI": "http://stackoverflow.com/questions/tagged/antbuilder",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:23740a4e-7d76-46c4-b0cd-d086ade1ed7d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-212-252.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-06\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for January 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,
95,
96,
131,
132,
134,
140,
149,
158,
159,
226,
227,
428,
430,
435,
444,
453,
454,
510,
511,
693,
695,
701,
710,
719,
720,
751,
752,
945,
947,
953,
962,
971,
972,
1015,
1016,
1213,
1215,
1221,
1229,
1238,
1239,
1268,
1269,
1459,
1461,
1467,
1476,
1485,
1486,
1556,
1557,
1760,
1762,
1768,
1776,
1785,
1786,
1826,
1827,
1994,
1996,
2002,
2011,
2020,
2021,
2060,
2061,
2264,
2266,
2272,
2281,
2291,
2292,
2337,
2338,
2535,
2537,
2543,
2552,
2561,
2562,
2593,
2594,
2783,
2785,
2791,
2800,
2810,
2811,
2883,
2884,
3083,
3085,
3090,
3099,
3108,
3109,
3186,
3187,
3380,
3382,
3388,
3396,
3406,
3407,
3448,
3449,
3630,
3632,
3638,
3646,
3655,
3656,
3708,
3709,
3894,
3896,
3902,
3910,
3920,
3921,
3985,
3986,
4188,
4190,
4196,
4204,
4213,
4214,
4304,
4305,
4504,
4506,
4511,
4519,
4529,
4530,
4576,
4577,
4755,
4757,
4762,
4771,
4781,
4782,
4832,
4833,
5033,
5035,
5041,
5050,
5060,
5061,
5104,
5105,
5298,
5300,
5306,
5314,
5323,
5324,
5382,
5383,
5583,
5585,
5590,
5599,
5609,
5610,
5651,
5652,
5814,
5816,
5822,
5831,
5841,
5842,
5902,
5903,
6084,
6086,
6092,
6100,
6109,
6110,
6152,
6153,
6335,
6337,
6342,
6350,
6360,
6361,
6399,
6400,
6599,
6601,
6607,
6615,
6625,
6626,
6667,
6668,
6840,
6842,
6848,
6856,
6865,
6866,
6888,
6889,
7090,
7092,
7097,
7105,
7115,
7116,
7173,
7174,
7349,
7351,
7357,
7366,
7376,
7377,
7415,
7416,
7620,
7622,
7628,
7636,
7646,
7647,
7713,
7714,
7904,
7906,
7911,
7920,
7930,
7931,
7966,
7967,
8158,
8161,
8167,
8176,
8185,
8186,
8253,
8254,
8458,
8460,
8465,
8474,
8484,
8485,
8535,
8536,
8736,
8738,
8744,
8752,
8762,
8763,
8810,
8811,
9014,
9016,
9022,
9030,
9040,
9041,
9076,
9077,
9274,
9276,
9282,
9291,
9300,
9301,
9416,
9417,
9620,
9622,
9628,
9636,
9645,
9646,
9694,
9695,
9895,
9897,
9903,
9912,
9922,
9923,
9964,
9965,
10164,
10166,
10172,
10181,
10191,
10192,
10240,
10241,
10408,
10410,
10416,
10424,
10434,
10435,
10490,
10491,
10685,
10688,
10694,
10702,
10712,
10713,
10778,
10779,
10963,
10965,
10971,
10980,
10990,
10991,
11050,
11051,
11239,
11241,
11247,
11255,
11265,
11266,
11297,
11298,
11490,
11492,
11498,
11506,
11516,
11517,
11570,
11571,
11766,
11768,
11773,
11781,
11791,
11792,
11835,
11836,
12036,
12038,
12044,
12052,
12062,
12063,
12117,
12118,
12317,
12319,
12325,
12333,
12342,
12343,
12449,
12450,
12645,
12647,
12652,
12660,
12670,
12671,
12743,
12744
],
"line_end_idx": [
95,
96,
131,
132,
134,
140,
149,
158,
159,
226,
227,
428,
430,
435,
444,
453,
454,
510,
511,
693,
695,
701,
710,
719,
720,
751,
752,
945,
947,
953,
962,
971,
972,
1015,
1016,
1213,
1215,
1221,
1229,
1238,
1239,
1268,
1269,
1459,
1461,
1467,
1476,
1485,
1486,
1556,
1557,
1760,
1762,
1768,
1776,
1785,
1786,
1826,
1827,
1994,
1996,
2002,
2011,
2020,
2021,
2060,
2061,
2264,
2266,
2272,
2281,
2291,
2292,
2337,
2338,
2535,
2537,
2543,
2552,
2561,
2562,
2593,
2594,
2783,
2785,
2791,
2800,
2810,
2811,
2883,
2884,
3083,
3085,
3090,
3099,
3108,
3109,
3186,
3187,
3380,
3382,
3388,
3396,
3406,
3407,
3448,
3449,
3630,
3632,
3638,
3646,
3655,
3656,
3708,
3709,
3894,
3896,
3902,
3910,
3920,
3921,
3985,
3986,
4188,
4190,
4196,
4204,
4213,
4214,
4304,
4305,
4504,
4506,
4511,
4519,
4529,
4530,
4576,
4577,
4755,
4757,
4762,
4771,
4781,
4782,
4832,
4833,
5033,
5035,
5041,
5050,
5060,
5061,
5104,
5105,
5298,
5300,
5306,
5314,
5323,
5324,
5382,
5383,
5583,
5585,
5590,
5599,
5609,
5610,
5651,
5652,
5814,
5816,
5822,
5831,
5841,
5842,
5902,
5903,
6084,
6086,
6092,
6100,
6109,
6110,
6152,
6153,
6335,
6337,
6342,
6350,
6360,
6361,
6399,
6400,
6599,
6601,
6607,
6615,
6625,
6626,
6667,
6668,
6840,
6842,
6848,
6856,
6865,
6866,
6888,
6889,
7090,
7092,
7097,
7105,
7115,
7116,
7173,
7174,
7349,
7351,
7357,
7366,
7376,
7377,
7415,
7416,
7620,
7622,
7628,
7636,
7646,
7647,
7713,
7714,
7904,
7906,
7911,
7920,
7930,
7931,
7966,
7967,
8158,
8161,
8167,
8176,
8185,
8186,
8253,
8254,
8458,
8460,
8465,
8474,
8484,
8485,
8535,
8536,
8736,
8738,
8744,
8752,
8762,
8763,
8810,
8811,
9014,
9016,
9022,
9030,
9040,
9041,
9076,
9077,
9274,
9276,
9282,
9291,
9300,
9301,
9416,
9417,
9620,
9622,
9628,
9636,
9645,
9646,
9694,
9695,
9895,
9897,
9903,
9912,
9922,
9923,
9964,
9965,
10164,
10166,
10172,
10181,
10191,
10192,
10240,
10241,
10408,
10410,
10416,
10424,
10434,
10435,
10490,
10491,
10685,
10688,
10694,
10702,
10712,
10713,
10778,
10779,
10963,
10965,
10971,
10980,
10990,
10991,
11050,
11051,
11239,
11241,
11247,
11255,
11265,
11266,
11297,
11298,
11490,
11492,
11498,
11506,
11516,
11517,
11570,
11571,
11766,
11768,
11773,
11781,
11791,
11792,
11835,
11836,
12036,
12038,
12044,
12052,
12062,
12063,
12117,
12118,
12317,
12319,
12325,
12333,
12342,
12343,
12449,
12450,
12645,
12647,
12652,
12660,
12670,
12671,
12743,
12744,
12939
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 12939,
"ccnet_original_nlines": 379,
"rps_doc_curly_bracket": 0.0019321399740874767,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2879656255245209,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04584527015686035,
"rps_doc_frac_lines_end_with_ellipsis": 0.12105263024568558,
"rps_doc_frac_no_alph_words": 0.23782235383987427,
"rps_doc_frac_unique_words": 0.3178294599056244,
"rps_doc_mean_word_length": 4.780523300170898,
"rps_doc_num_sentences": 206,
"rps_doc_symbol_to_word_ratio": 0.019340969622135162,
"rps_doc_unigram_entropy": 5.562078475952148,
"rps_doc_word_count": 2064,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01682375930249691,
"rps_doc_frac_chars_dupe_6grams": 0.007094350177794695,
"rps_doc_frac_chars_dupe_7grams": 0.007094350177794695,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.017026450484991074,
"rps_doc_frac_chars_top_3gram": 0.019762849435210228,
"rps_doc_frac_chars_top_4gram": 0.006688959896564484,
"rps_doc_books_importance": -988.9230346679688,
"rps_doc_books_importance_length_correction": -988.9230346679688,
"rps_doc_openwebtext_importance": -541.9246826171875,
"rps_doc_openwebtext_importance_length_correction": -541.9246826171875,
"rps_doc_wikipedia_importance": -370.038330078125,
"rps_doc_wikipedia_importance_length_correction": -370.038330078125
},
"fasttext": {
"dclm": 0.1219605803489685,
"english": 0.8793893456459045,
"fineweb_edu_approx": 1.329580307006836,
"eai_general_math": 0.01665366068482399,
"eai_open_web_math": 0.2445273995399475,
"eai_web_code": 0.018807049840688705
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-5,549,952,679,141,183,000 | 8
Is there any information available about the Levin protocol?
It seems to be used for the peer to peer communication.
Things like:
1. The working of the protocol?
2. What are the benefits? Why was it chosen for Monero?
3. Is it used in any other product?
6
I did find the following information:
• Some information about the history you can find here.
• It is part of the so called 'epee' library.
• The creator is a Russian programmer called Andrey N. Sabelnikov, who seems to be well known for creating a botnet.
• The original code is located on Github.
• It doesn't seem to be used anywhere else besides some cryptocurrencies with a similar background as Monero.
• On the site of the Boolberry cryptocurrency you can find some design information.
| improve this answer | |
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "https://monero.stackexchange.com/questions/2615/is-there-information-available-about-the-levin-protocol?noredirect=1",
"source_domain": "monero.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "140598",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7ENVL2Y4OVEBCBI7VLUIG5JRCYDLBP64",
"WARC-Concurrent-To": "<urn:uuid:115cffe2-2531-4e0c-ab06-1bdacfb75140>",
"WARC-Date": "2020-05-29T14:46:49Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2MO6BYBY2T7VWSQYGN54MXIVJLXHCWB3",
"WARC-Record-ID": "<urn:uuid:1ffbd5d4-6dda-4a66-a3aa-c6e8230f0006>",
"WARC-Target-URI": "https://monero.stackexchange.com/questions/2615/is-there-information-available-about-the-levin-protocol?noredirect=1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b8fb640c-7ace-4f6a-84e3-53499b5535c5>"
},
"warc_info": "isPartOf: CC-MAIN-2020-24\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-182.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
3,
64,
120,
121,
134,
135,
169,
227,
265,
267,
268,
306,
307,
365,
413,
532,
576,
688,
774,
800,
801,
813,
814,
914,
915
],
"line_end_idx": [
2,
3,
64,
120,
121,
134,
135,
169,
227,
265,
267,
268,
306,
307,
365,
413,
532,
576,
688,
774,
800,
801,
813,
814,
914,
915,
1005
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1005,
"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.40291261672973633,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009708739817142487,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20388349890708923,
"rps_doc_frac_unique_words": 0.6242774724960327,
"rps_doc_mean_word_length": 4.4739885330200195,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.422147274017334,
"rps_doc_word_count": 173,
"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.015503879636526108,
"rps_doc_frac_chars_top_3gram": 0.023255810141563416,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -79.03345489501953,
"rps_doc_books_importance_length_correction": -79.03345489501953,
"rps_doc_openwebtext_importance": -34.960845947265625,
"rps_doc_openwebtext_importance_length_correction": -20.94972801208496,
"rps_doc_wikipedia_importance": -28.77126121520996,
"rps_doc_wikipedia_importance_length_correction": -28.77126121520996
},
"fasttext": {
"dclm": 0.7056649327278137,
"english": 0.9478875994682312,
"fineweb_edu_approx": 1.871726155281067,
"eai_general_math": -0.000003929999820684316,
"eai_open_web_math": 0.06173253059387207,
"eai_web_code": -0.000010009999641624745
}
} | {
"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": "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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-6,059,661,049,450,990,000 | My windows 7 Home Basic runs about 109 process.
Hello everybody I have recently bought a sony vaio vpceh35en core i3 2.30 GHz 2 GB of ram 320 GB HDD. Operating system : Windows 7 home basic 64 -bit and its runs about 109 process. Can somebody tell me how can I fix it I have tred many things to fix it but nothing works. I have scanned no viruses is there in my laptop. So this is the problem, please tell me if someone know solution to this problem. my mail : [email protected]
3 answers Last reply
More about windows home basic runs 109 process
1. May just be the Win processes, have you scanned for Malware? Try MalwareBytes....also, you need more DRAM, 2GB isn't enough
2. Hello my computer has 3 user name is this is a problem that cause 109 process to run. A process run 6 process called 'chrome *32'. I need a major help.
3. IF you ran MalwareBytes and it didn't find anything then sounds like you need a reinstall of Win
Ask a new question
Read More
Windows 7 | {
"url": "http://www.tomshardware.com/forum/id-1721612/windows-home-basic-runs-109-process.html",
"source_domain": "www.tomshardware.com",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "62375",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QY7XBRS6GXP5ATQ2IVJQOCWOQFE7ANLB",
"WARC-Concurrent-To": "<urn:uuid:6f111ff5-ab73-4b28-ac78-df96e715a1a2>",
"WARC-Date": "2017-01-17T02:16:08Z",
"WARC-IP-Address": "23.15.7.96",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5FBQRDPJ72ZPX2YZYNZ6VARWXPAV7AFN",
"WARC-Record-ID": "<urn:uuid:b29a890b-8f6b-4f86-9130-1e30df5e1609>",
"WARC-Target-URI": "http://www.tomshardware.com/forum/id-1721612/windows-home-basic-runs-109-process.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:76ac3690-5987-4b84-8eb2-76e6db60d7e9>"
},
"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,
48,
49,
484,
505,
552,
681,
838,
940,
959,
960,
970,
971
],
"line_end_idx": [
48,
49,
484,
505,
552,
681,
838,
940,
959,
960,
970,
971,
980
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 980,
"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.35779815912246704,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05504586920142174,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21559633314609528,
"rps_doc_frac_unique_words": 0.6195652484893799,
"rps_doc_mean_word_length": 4.09782600402832,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.004587159957736731,
"rps_doc_unigram_entropy": 4.553101539611816,
"rps_doc_word_count": 184,
"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.05305039882659912,
"rps_doc_frac_chars_top_3gram": 0.03183024004101753,
"rps_doc_frac_chars_top_4gram": 0.04509283974766731,
"rps_doc_books_importance": -101.5450210571289,
"rps_doc_books_importance_length_correction": -101.5450210571289,
"rps_doc_openwebtext_importance": -64.14801788330078,
"rps_doc_openwebtext_importance_length_correction": -50.23141860961914,
"rps_doc_wikipedia_importance": -52.756710052490234,
"rps_doc_wikipedia_importance_length_correction": -52.756710052490234
},
"fasttext": {
"dclm": 0.05452531948685646,
"english": 0.9434197545051575,
"fineweb_edu_approx": 1.0430688858032227,
"eai_general_math": 0.2656550407409668,
"eai_open_web_math": 0.222878098487854,
"eai_web_code": 0.015894830226898193
}
} | {
"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": "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": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,664,374,239,785,318,000 | YAML格式的文件在Jekyll的时候接触到，Jekyll的配置文件就是YAML。Jekyll本身由Ruby写成，而Ruby本身和YAML有着方方面面的联系，Ruby的配置文件约定是YAML。同时，YAML还是Ruby的文本序列化格式。
YAML是一个可读性高，用来表达资料序列的文件格式。YAML是”YAML Ain’t a Markup Language”（YAML不是一种标记语言）的缩写1 。在开发的这种语言时，YAML 的意思其实是：”Yet Another Markup Language”（仍是一种标记语言），但为了强调这种语言以数据做为中心，而不是以标记语言为重点，而用反向缩略语重新命名。
空格缩进和JSON选项
YAML文件格式主要集中于空格与缩进的概念，它用于指出数据的层次结构 – 而不是使用XML嵌套标记或JSON的大括号（{}）和方括号（[]），实际上，它是JSON的一个超集，因此，在使用的时候，你可能需要采用JSON风格的语法来跳出空格流，它的创始人将其形容为“为所有编程语言提供人性化的数据序列化标准2”，其重点是人性化。
世上有很多的数据结构，但是都可以归结到三种最基本的结构(primitives)：mappings (hashes/dictionaries), sequences (arrays/lists) and scalars (strings/numbers). 有了这三种基本结构，绝大部分的编程语言都能够使用YAML了。
YAML 可以被用来作为：configuration files （配置文件）， log files（日志文件），interprocess messaging（进程间通信），cross-language data sharing（跨语言数据交换），object persistence（对象持久化）和debugging of complex data structures（复杂数据结构的调试）。当数据能够容易的被读懂的时候，任何事情都会变得简单。
YAML 的目标
The design goals for YAML are3, in decreasing priority:
1. YAML is easily readable by humans.
2. YAML data is portable between programming languages.
3. YAML matches the native data structures of agile languages.
4. YAML has a consistent model to support generic tools.
5. YAML supports one-pass processing.
6. YAML is expressive and extensible.
7. YAML is easy to implement and use.
YAML结构组件
YAML的结构：hash，list 和 block literal
YAML举例，一般扩展名为.yaml，也可以为.yml，比如：John.yml
name: John Smith
age: 37
spouse:
name: Jane Smith
age: 25
children:
- name: Jimmy Smith
age: 15
- name: Jenny Smith
age 12
语义介绍：John今年37岁，有一个幸福的四口之家。两个孩子Jimmy 和Jenny活泼可爱。妻子Jane年轻美貌。
值得注意的是字符串不一定需要双引号，当然如果强行添加双引号也可以。比如 "name: "John Smith" 同样也是可以的。
sequence
也可以叫做 list/array ，数组，列表，清单等等
使用-表示list
- Mark McGwire
- Sammy Sosa
- Ken Griffey
同样可以使用中括号来在行内表示：inline format, using [] ,
[Mark McGwire, Sammy Sosa, Ken Griffey]
二维数组，或者数组中包含数组可以写成
- [name , hr, avg ]
- [Mark McGwire, 65, 0.278]
- [Sammy Sosa , 63, 0.288]
map
或者叫做 hash/dictionary ，键值对,散列,哈希，字典等等。使用:表示，以:分割key:value
hr: 65 # Home runs
avg: 0.278 # Batting average
rbi: 147 # Runs Batted In
使用大括号来在行内表示inline format, using {} ,
{hr: 65, avg: 0.278, rbi: 147}
hash中包含hash可以写成这样：
Mark McGwire: {hr: 65, avg: 0.278}
Sammy Sosa: {
hr: 63,
avg: 0.288
}
散列的key值可以不为字符串，比如
0.25: a float key
key的值也可以多行，使用 ? 表示key 的开始：
? |
This is a key
that has multiple lines
: and this is its value
list和hash相互包含
hash内包含数组：
american:
- Boston Red Sox
- Detroit Tigers
- New York Yankees
national:
- New York Mets
- Chicago Cubs
- Atlanta Braves
数组内包含hash：
- # one hr
name: Mark McGwire
hr: 65
avg: 0.278
-
name: Sammy Sosa
hr: 63
avg: 0.288
block literal（文字块）
使用|表示文字块,YAML中字符串不需要包含在引号之内。
literal_block: |
This entire block of text will be the value of the 'literal_block' key, with line breaks being preserved.
The literal continues until de-dented, and the leading indentation is stripped.
another_block: >
This is another block of text
YAML VS XML & JSON
正如你从前面例子中清楚地看到那样，YAML没有XML那么啰嗦了，大部分YAML文件内容就是真实的数据，没有了无穷尽的打开和关闭标记列表，在XML中，这些标记往往比它们描述的数据还大，YAML更适合你需要手工维护的数据文件类型。
YAML没有提供方案或DTD概念，因此无法验证文件格式是否符合你的预期，XML的啰嗦也有它的价值，但总的说来是因为XML的成熟使它具有大量额外的工具来验证它的格式，而YAML还没有。
JSON也适合与任何数据，它主要面向提高性能和文件尺寸的大小，因为它几乎不使用空格和关闭标签，然而，JSON文件的内容增加了复杂性，它的关闭标识就象下地狱一样，这就是JavaFx代码（它基于JSON）中可见的最痛苦的了，在数据文件中，使用UI结构使结果更复杂，其复杂程度几乎使文件变得无法理解。
掺和了{}结构和[]清单，使得手工维护大型的JSON风格的文件变得相当困难，YAML使用它的空格缩进方法巧妙地解决了这个问题，当然，无论何时，你都可以切换到JSON风格的语法（如在底层节点）。
YAML Validation
作为一种格式，必然是人为规定，也必然存在格式检查工具，下面就是俩： | {
"url": "https://blog.einverne.info/post/2015/08/yaml.html",
"source_domain": "blog.einverne.info",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "77777",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RJP2BFTWW3N7Z5HK6L4QIQJQUDHL7DDB",
"WARC-Concurrent-To": "<urn:uuid:36fbf367-c5fa-4cde-a332-289d7c956d33>",
"WARC-Date": "2019-12-08T10:09:49Z",
"WARC-IP-Address": "104.248.63.248",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DDD2RP7NLNE5IDZUKY6DDWIRPDVP6UXI",
"WARC-Record-ID": "<urn:uuid:34255012-63e3-4f00-bbe8-b23e9e7240e8>",
"WARC-Target-URI": "https://blog.einverne.info/post/2015/08/yaml.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c6e868e8-f347-457f-adb9-d8ca2f04ada8>"
},
"warc_info": "isPartOf: CC-MAIN-2019-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-206.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,
119,
120,
305,
306,
318,
319,
482,
483,
642,
643,
868,
869,
878,
879,
935,
936,
976,
1034,
1099,
1158,
1198,
1238,
1278,
1279,
1288,
1289,
1323,
1324,
1364,
1365,
1382,
1390,
1398,
1417,
1427,
1437,
1459,
1468,
1490,
1498,
1499,
1558,
1559,
1624,
1625,
1634,
1635,
1664,
1665,
1675,
1676,
1691,
1704,
1718,
1719,
1761,
1762,
1802,
1803,
1822,
1823,
1851,
1879,
1907,
1908,
1912,
1913,
1970,
1971,
1994,
2023,
2051,
2052,
2089,
2090,
2121,
2122,
2141,
2142,
2177,
2191,
2200,
2212,
2216,
2217,
2235,
2236,
2254,
2255,
2282,
2283,
2287,
2303,
2329,
2353,
2354,
2368,
2369,
2380,
2381,
2391,
2410,
2429,
2450,
2460,
2478,
2495,
2514,
2515,
2526,
2527,
2538,
2559,
2570,
2584,
2586,
2605,
2616,
2630,
2631,
2650,
2651,
2680,
2681,
2698,
2806,
2888,
2905,
2937,
2938,
2957,
2958,
3072,
3073,
3165,
3166,
3314,
3315,
3412,
3413,
3429,
3430
],
"line_end_idx": [
119,
120,
305,
306,
318,
319,
482,
483,
642,
643,
868,
869,
878,
879,
935,
936,
976,
1034,
1099,
1158,
1198,
1238,
1278,
1279,
1288,
1289,
1323,
1324,
1364,
1365,
1382,
1390,
1398,
1417,
1427,
1437,
1459,
1468,
1490,
1498,
1499,
1558,
1559,
1624,
1625,
1634,
1635,
1664,
1665,
1675,
1676,
1691,
1704,
1718,
1719,
1761,
1762,
1802,
1803,
1822,
1823,
1851,
1879,
1907,
1908,
1912,
1913,
1970,
1971,
1994,
2023,
2051,
2052,
2089,
2090,
2121,
2122,
2141,
2142,
2177,
2191,
2200,
2212,
2216,
2217,
2235,
2236,
2254,
2255,
2282,
2283,
2287,
2303,
2329,
2353,
2354,
2368,
2369,
2380,
2381,
2391,
2410,
2429,
2450,
2460,
2478,
2495,
2514,
2515,
2526,
2527,
2538,
2559,
2570,
2584,
2586,
2605,
2616,
2630,
2631,
2650,
2651,
2680,
2681,
2698,
2806,
2888,
2905,
2937,
2938,
2957,
2958,
3072,
3073,
3165,
3166,
3314,
3315,
3412,
3413,
3429,
3430,
3463
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3463,
"ccnet_original_nlines": 142,
"rps_doc_curly_bracket": 0.003465200075879693,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08403360843658447,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06302520632743835,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5532212853431702,
"rps_doc_frac_unique_words": 0.6202531456947327,
"rps_doc_mean_word_length": 8.901898384094238,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0.0056022400967776775,
"rps_doc_unigram_entropy": 4.990357875823975,
"rps_doc_word_count": 316,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.051190901547670364,
"rps_doc_frac_chars_dupe_6grams": 0.051190901547670364,
"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.01955207996070385,
"rps_doc_frac_chars_top_3gram": 0.007465340197086334,
"rps_doc_frac_chars_top_4gram": 0.011731250211596489,
"rps_doc_books_importance": -250.7665252685547,
"rps_doc_books_importance_length_correction": -250.7665252685547,
"rps_doc_openwebtext_importance": -168.01197814941406,
"rps_doc_openwebtext_importance_length_correction": -168.01197814941406,
"rps_doc_wikipedia_importance": -69.73682403564453,
"rps_doc_wikipedia_importance_length_correction": -69.73682403564453
},
"fasttext": {
"dclm": 0.338489294052124,
"english": 0.05958157032728195,
"fineweb_edu_approx": 1.5845094919204712,
"eai_general_math": 0.10929852724075317,
"eai_open_web_math": 0.20685267448425293,
"eai_web_code": 0.5603917241096497
}
} | {
"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.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
4,598,568,169,528,607,000 | How to Use an MP3 Player
How to Use an MP3 Player
23:24 05/05/2024
For all their easy-to-use touchscreens and bright, shiny icons, MP3 players can be user-unfriendly. From syncing your device to your computer, to ripping CDs and copying over music files, you can master your MP3 player by learning how to...
How to Channel
How to Channel
01:15 27/04/2024
With practice, channeling transmissions from the unseen world of the subconscious can be a moving and powerful experience. Whether you want to deepen your insight into your own nature, or you want to reach outward for communications from...
Will I Be With My Family in Heaven?
Will I Be With My Family in Heaven?
01:15 27/04/2024
The truth about marriage and family in the afterlife The Bible indicates that all followers of Jesus will be together in Heaven and be able to recognize one another. Still, how can believers be absolutely certain that they'll know their...
How to Celebrate Your Parents' Anniversary at Home
How to Celebrate Your Parents' Anniversary at Home
01:14 27/04/2024
If you are trying to find a way to celebrate your parents' anniversary at home, you're in luck. You have a number of options open to you. You could plan a big party with friends and family or just create a quiet dinner at home. If you're a...
How to Maintain a Jellyfish Tank
How to Maintain a Jellyfish Tank
01:14 27/04/2024
Jellyfish can make great pets. To keep them healthy and happy, you will need to maintain their tank. Ensure their water is clean, deionized, and at an appropriate temperature and salinity. Change the water and clean the tank regularly....
How to Lead a Successful Youth Ministry
How to Lead a Successful Youth Ministry
01:14 27/04/2024
Youth Ministries are often the pillar of any Christian church's continuity. If you can't set teenage hearts on fire with love of God, they may go on to lead less fulfilling lives (or worse, be tempted into sinful ways). This being a...
How to Celebrate Hanukkah
How to Celebrate Hanukkah
01:13 27/04/2024
Hanukkah, is a Jewish holiday, also known as the Jewish "festival of lights" as its focus is on lighting the eight Chanukah candles during the eight days of the festival. Although not one of the more serious holy days of the Jewish...
How to Say Grace
How to Say Grace
01:13 27/04/2024
Saying a simple prayer before a meal can be an excellent way to center yourself and appreciate your blessings, whether you're alone or in a large group. Saying grace doesn't need to be an elaborate recitation. You can learn personal...
How to Exercise While Watching TV
How to Exercise While Watching TV
01:13 27/04/2024
Don't have time to go to the gym but still want to lose weight and/or tone your muscles? Do you get bored easily when you're working out? Don't fret - you can put those muscles to work even as your eyes are glued to your favorite soap...
How to Find Your Subnet Mask: The Complete Guide
How to Find Your Subnet Mask: The Complete Guide
01:12 27/04/2024
Do you need to find or change the subnet mask for your computer, phone, or tablet? If you're using a device that has a static (permanent) IP address that must be configured manually, making sure the subnet mask is correct is crucial when... | {
"url": "https://diri-au.org/tag/trung-tam",
"source_domain": "diri-au.org",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "39160",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QTNZCU4F255ZR33G4XJ6VEJTKU67W7MM",
"WARC-Concurrent-To": "<urn:uuid:c961fb06-7ee5-4597-850c-0c2eb465ea4f>",
"WARC-Date": "2024-07-20T19:58:20Z",
"WARC-IP-Address": "103.38.236.65",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:Z3OOIJ47Q42IVJKZYQVXHQ7FSDUSFB74",
"WARC-Record-ID": "<urn:uuid:d12d002f-b280-4722-ab92-0379941451a5>",
"WARC-Target-URI": "https://diri-au.org/tag/trung-tam",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:59e95cf3-eed3-4bd0-b7cc-b2dcb913cee1>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-147\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,
25,
26,
51,
52,
70,
71,
312,
327,
328,
343,
344,
362,
363,
604,
640,
641,
677,
678,
696,
697,
937,
988,
989,
1040,
1041,
1059,
1060,
1303,
1336,
1337,
1370,
1371,
1389,
1390,
1629,
1669,
1670,
1710,
1711,
1729,
1730,
1966,
1992,
1993,
2019,
2020,
2038,
2039,
2274,
2291,
2292,
2309,
2310,
2328,
2329,
2565,
2599,
2600,
2634,
2635,
2653,
2654,
2892,
2941,
2942,
2991,
2992,
3010,
3011
],
"line_end_idx": [
25,
26,
51,
52,
70,
71,
312,
327,
328,
343,
344,
362,
363,
604,
640,
641,
677,
678,
696,
697,
937,
988,
989,
1040,
1041,
1059,
1060,
1303,
1336,
1337,
1370,
1371,
1389,
1390,
1629,
1669,
1670,
1710,
1711,
1729,
1730,
1966,
1992,
1993,
2019,
2020,
2038,
2039,
2274,
2291,
2292,
2309,
2310,
2328,
2329,
2565,
2599,
2600,
2634,
2635,
2653,
2654,
2892,
2941,
2942,
2991,
2992,
3010,
3011,
3251
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3251,
"ccnet_original_nlines": 69,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3785310685634613,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012711860239505768,
"rps_doc_frac_lines_end_with_ellipsis": 0.1428571343421936,
"rps_doc_frac_no_alph_words": 0.21751411259174347,
"rps_doc_frac_unique_words": 0.4615384638309479,
"rps_doc_mean_word_length": 4.5187835693359375,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.014124290086328983,
"rps_doc_unigram_entropy": 5.019576072692871,
"rps_doc_word_count": 559,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.18566903471946716,
"rps_doc_frac_chars_dupe_6grams": 0.18566903471946716,
"rps_doc_frac_chars_dupe_7grams": 0.12707838416099548,
"rps_doc_frac_chars_dupe_8grams": 0.08551069349050522,
"rps_doc_frac_chars_dupe_9grams": 0.030878860503435135,
"rps_doc_frac_chars_top_2gram": 0.03760886937379837,
"rps_doc_frac_chars_top_3gram": 0.022169439122080803,
"rps_doc_frac_chars_top_4gram": 0.026128269731998444,
"rps_doc_books_importance": -286.4779052734375,
"rps_doc_books_importance_length_correction": -286.4779052734375,
"rps_doc_openwebtext_importance": -159.97772216796875,
"rps_doc_openwebtext_importance_length_correction": -159.97772216796875,
"rps_doc_wikipedia_importance": -105.75666809082031,
"rps_doc_wikipedia_importance_length_correction": -105.75666809082031
},
"fasttext": {
"dclm": 0.05705130100250244,
"english": 0.9345560073852539,
"fineweb_edu_approx": 1.9649324417114258,
"eai_general_math": 0.001591620035469532,
"eai_open_web_math": 0.09509950876235962,
"eai_web_code": 0.00020248000510036945
}
} | {
"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": "291",
"labels": {
"level_1": "Religion",
"level_2": "Religions",
"level_3": "Mythology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"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,500,732,837,178,899,000 | How to drag the annotation
Dragging process can be applied over annotation and dragging can be controlled by the annotation and its parent node or connector.
To learn about annotation constraints, refer to the Annotation Constraints.
Dragging the annotation
Dragging of annotation can be enabled by using the Constraints property of AnnotationEditorViewModel class and setting its value as AnnotationConstraints.Draggable.
<!--Initialize the Annotation Collection-->
<syncfusion:AnnotationCollection>
<!--Initialize the annotation with draggable constraint-->
<syncfusion:AnnotationEditorViewModel Content="Annotation" Constraints="Draggable"/>
</syncfusion:AnnotationCollection>
//Initialize the Annotation Collection
Annotations = new ObservableCollection<IAnnotation>()
{
new AnnotationEditorViewModel()
{
Content = "Annotation",
//Initialize the constraint as draggable
Constraints = AnnotationConstraints.Draggable
}
}
Interaction
How to restrict the dragging area
Diagram allows you to specify the amount of dragging area around the annotation by enabling the Constraints as AnnotationConstraints.DragLimit and dragging area can be specified by using the DragLimit property. You cannot drag the annotation behind this drag limit value. Default value is (10, 10, 10, 10).
<!--Initialize the AnnotationCollection-->
<syncfusion:AnnotationCollection>
<!--Initialize the annotation with drag limit value-->
<syncfusion:AnnotationEditorViewModel Content="Annotation"
Constraints="Draggable,DragLimit"
DragLimit="40,80,40,40"/>
</syncfusion:AnnotationCollection>
//Initialize the AnnotationCollection
Annotations = new ObservableCollection<IAnnotation>()
{
new AnnotationEditorViewModel()
{
Content = "Annotation",
//Initialize the drag limit constraint
Constraints = AnnotationConstraints.Draggable | AnnotationConstraints.DragLimit,
//Initialize the drag limit value
DragLimit = new Thickness(40,80,40,40),
}
}
Property Value Output
DragLimit (10,10,10,10) NoWrap
(40,80,40,40) Wrap | {
"url": "https://help.syncfusion.com/wpf/diagram/annotation/interaction/dragging",
"source_domain": "help.syncfusion.com",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "29324",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YSEXGOSNGGEJHB3FL3NNQSU2VWYF6C4T",
"WARC-Concurrent-To": "<urn:uuid:3f98e2dc-1a6d-4421-9de2-d8fc66603ebc>",
"WARC-Date": "2020-10-26T17:16:18Z",
"WARC-IP-Address": "40.121.84.190",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SZJBPAUXS4UNEBQA3HDPEATTEV43TU5M",
"WARC-Record-ID": "<urn:uuid:51ba76de-bcb3-425c-a9a5-58cfa6e5f8a7>",
"WARC-Target-URI": "https://help.syncfusion.com/wpf/diagram/annotation/interaction/dragging",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e7e61090-d1f9-4646-888c-bea74efa8bb4>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-239.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
27,
28,
159,
235,
236,
260,
261,
426,
427,
471,
505,
568,
657,
692,
731,
785,
787,
823,
829,
861,
910,
965,
971,
973,
974,
986,
987,
1021,
1022,
1329,
1330,
1373,
1407,
1466,
1530,
1607,
1675,
1710,
1748,
1802,
1804,
1840,
1846,
1878,
1925,
2014,
2056,
2104,
2110,
2112,
2134,
2165
],
"line_end_idx": [
27,
28,
159,
235,
236,
260,
261,
426,
427,
471,
505,
568,
657,
692,
731,
785,
787,
823,
829,
861,
910,
965,
971,
973,
974,
986,
987,
1021,
1022,
1329,
1330,
1373,
1407,
1466,
1530,
1607,
1675,
1710,
1748,
1802,
1804,
1840,
1846,
1878,
1925,
2014,
2056,
2104,
2110,
2112,
2134,
2165,
2185
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2185,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0.0036613300908356905,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2249240130186081,
"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.3677811622619629,
"rps_doc_frac_unique_words": 0.38265305757522583,
"rps_doc_mean_word_length": 8.295918464660645,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.916538715362549,
"rps_doc_word_count": 196,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.19680197536945343,
"rps_doc_frac_chars_dupe_6grams": 0.12669126689434052,
"rps_doc_frac_chars_dupe_7grams": 0.12669126689434052,
"rps_doc_frac_chars_dupe_8grams": 0.12669126689434052,
"rps_doc_frac_chars_dupe_9grams": 0.12669126689434052,
"rps_doc_frac_chars_top_2gram": 0.07995080202817917,
"rps_doc_frac_chars_top_3gram": 0.056580569595098495,
"rps_doc_frac_chars_top_4gram": 0.09778597950935364,
"rps_doc_books_importance": -147.58729553222656,
"rps_doc_books_importance_length_correction": -147.58729553222656,
"rps_doc_openwebtext_importance": -98.27269744873047,
"rps_doc_openwebtext_importance_length_correction": -98.27269744873047,
"rps_doc_wikipedia_importance": -63.520938873291016,
"rps_doc_wikipedia_importance_length_correction": -63.520938873291016
},
"fasttext": {
"dclm": 0.17476916313171387,
"english": 0.5877453684806824,
"fineweb_edu_approx": 2.6025869846343994,
"eai_general_math": 0.5059473514556885,
"eai_open_web_math": 0.416814386844635,
"eai_web_code": 0.6570838689804077
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-4,733,004,453,001,651,000 |
Some quick Azure observations
Here’s a couple of quick observations and reminders that came to mind while doing some recent work to convert a legacy application from being hosted on a customer’s VPS up into Azure.
Working with Azure places a large emphasis on your DNS registrar of choice
Your domain names are important, you want to protect them and choose a good registrar. Your #1 criteria should probably be security (which I something I’ve talked about before), but you also want a good and flexible user interface.
A number of registrars have UIs that try to hide the complexities of how domain names work from their customers. They don’t provide full zone editing capabilities and instead they focus on making the most common operations simple. This can cause trouble with Azure, as the chances are that depending on what you’re doing, you may need access to the full array of record types.
There are some awful registrar sites out there – when you have to use them to change one or two A name records once every few years then it’s not a big deal to get what you need done quickly and get out of there, but when you need to use that same UI to create a wider range of records (including Azure’s auth records) for multiple application components on multiple domains and then do the same again for a test environment then that same UI can become very frustrating to use.
For all the domains I manage I use a service that gives me full control, unfortunately sometimes you’re forced to use the customer’s registrar, and somehow I’ve got a couple of customers who don’t put a powerful UI on their shopping list when choosing where to host their domains.
Azure really forces you to pay attention to your deployment practices
Web.config transforms have been around for a while, but even when you’re actively using them it can be surprisingly easy to slip into the habit of editing a file on the server for some changes, or not having every single thing handled properly.
That obviously gets a lot harder with Azure, and your transforms become a lot more important. You want absolute certainty that they’re doing what you think they are, because it can be a bit of a painful process if you need to use the FTP credentials to verify whether your app has a problem or if it’s just a slightly messed up transform variable.
Of course, it’s a really good thing that you’re forced to do this, but you need to plan time for it into your project – it can’t be something that’s tidied up after the project when you have time as you can’t deploy without having them sorted.
Won’t someone think of the Timezones
Services such as Azure Web Sites and SQL Azure are all set to use UTC. If your app uses DateTime.Now in C# or GETDATE() in SQL then stop and think about how it’s going to behave when you push it up into Azure.
Remember that working with timezones is hard!
Posted on Thursday, April 02, 2015 1:52 PM |
Like this? Share it!
No comments posted yet.
Post a comment
Please add 5 and 6 and type the answer here:
Remember me?
Ensure the word in this box says 'orange': | {
"url": "http://rosshawkins.net/archive/2015/04/02/some-quick-azure-observations.aspx",
"source_domain": "rosshawkins.net",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "69474",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:S3V4IAO5EWKJNCYNU7E6S6CZUKWJLT5T",
"WARC-Concurrent-To": "<urn:uuid:65703b5b-d5f1-4f82-b4d4-7a4ba986a776>",
"WARC-Date": "2018-03-22T05:51:05Z",
"WARC-IP-Address": "120.138.28.63",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KBZILFCFXOMN227QEB35SQMOCKS4PRUW",
"WARC-Record-ID": "<urn:uuid:0469a6f4-6fdf-4efb-ae81-6b3c00afbab1>",
"WARC-Target-URI": "http://rosshawkins.net/archive/2015/04/02/some-quick-azure-observations.aspx",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a0b90763-ae08-412a-b230-660b93395171>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-229-201-209.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
1,
31,
32,
216,
217,
292,
293,
525,
526,
903,
904,
1383,
1384,
1665,
1666,
1736,
1737,
1982,
1983,
2331,
2332,
2576,
2577,
2614,
2615,
2825,
2826,
2872,
2873,
2918,
2919,
2940,
2941,
2965,
2966,
2981,
3026,
3039
],
"line_end_idx": [
1,
31,
32,
216,
217,
292,
293,
525,
526,
903,
904,
1383,
1384,
1665,
1666,
1736,
1737,
1982,
1983,
2331,
2332,
2576,
2577,
2614,
2615,
2825,
2826,
2872,
2873,
2918,
2919,
2940,
2941,
2965,
2966,
2981,
3026,
3039,
3081
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3081,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5232198238372803,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029411759227514267,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11919505149126053,
"rps_doc_frac_unique_words": 0.5036101341247559,
"rps_doc_mean_word_length": 4.438628196716309,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0.0030959800351411104,
"rps_doc_unigram_entropy": 5.205159664154053,
"rps_doc_word_count": 554,
"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.01220007985830307,
"rps_doc_frac_chars_top_3gram": 0.010980069637298584,
"rps_doc_frac_chars_top_4gram": 0.009760069660842419,
"rps_doc_books_importance": -326.6152648925781,
"rps_doc_books_importance_length_correction": -326.6152648925781,
"rps_doc_openwebtext_importance": -192.91192626953125,
"rps_doc_openwebtext_importance_length_correction": -192.91192626953125,
"rps_doc_wikipedia_importance": -136.1154327392578,
"rps_doc_wikipedia_importance_length_correction": -136.1154327392578
},
"fasttext": {
"dclm": 0.026400210335850716,
"english": 0.9354856610298157,
"fineweb_edu_approx": 1.5532535314559937,
"eai_general_math": 0.12147772312164307,
"eai_open_web_math": 0.21283680200576782,
"eai_web_code": 0.043168600648641586
}
} | {
"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.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-2,603,052,639,457,862,000 | Posted By
michellebracken on 08/18/11
Tagged
Versions (?)
HTML Hack for IE
/ Published in: CSS
Another way to target IE specifically is to use the HTML * hack. Internet Explorer allows you to use something other than the html element as the root of your document. By placing an * in front of html in your CSS (*html) you can target IE only as other browsers will ignore the declaration.
IE will use 600px for the width of the content div, while other browsers use 580px. The above works for IE6 and below. When not in standards mode, but in quirks mode this will work on IE7 as well. You can also target IE7 (in quirks mode) specifically with
1. 1 div#content {width: 580px}
2. 2 * html body div#content {width: 600px}
3.
4. 1 *+html body div#content {width: 620px}
Report this snippet
You need to login to post a comment. | {
"url": "http://snipplr.com/view/57934/",
"source_domain": "snipplr.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "16610",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EC3XPYJKA7QD2HTLLZAHTGB7G3TKLLRP",
"WARC-Concurrent-To": "<urn:uuid:0eaf2fb5-d006-4a10-bb66-6a87ce135492>",
"WARC-Date": "2013-12-20T07:41:20Z",
"WARC-IP-Address": "108.162.201.43",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4FD5V7PZBOABKQBGLE7DYNO4HWVMEML5",
"WARC-Record-ID": "<urn:uuid:7977cd3c-0717-463f-a8f0-36e173e2e55c>",
"WARC-Target-URI": "http://snipplr.com/view/57934/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6d5fa97d-fc4f-4a4d-a93d-ffb88dc33a2b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
10,
11,
39,
40,
41,
48,
49,
50,
63,
64,
81,
82,
83,
104,
106,
107,
399,
400,
656,
657,
691,
737,
744,
790,
791,
813,
814
],
"line_end_idx": [
10,
11,
39,
40,
41,
48,
49,
50,
63,
64,
81,
82,
83,
104,
106,
107,
399,
400,
656,
657,
691,
737,
744,
790,
791,
813,
814,
850
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 850,
"ccnet_original_nlines": 27,
"rps_doc_curly_bracket": 0.007058820221573114,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3368421196937561,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.057894740253686905,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2526315748691559,
"rps_doc_frac_unique_words": 0.5510203838348389,
"rps_doc_mean_word_length": 4.278911590576172,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0.015789469704031944,
"rps_doc_unigram_entropy": 4.183098316192627,
"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.07154212892055511,
"rps_doc_frac_chars_top_3gram": 0.038155801594257355,
"rps_doc_frac_chars_top_4gram": 0.07313196361064911,
"rps_doc_books_importance": -76.64549255371094,
"rps_doc_books_importance_length_correction": -76.64549255371094,
"rps_doc_openwebtext_importance": -41.002586364746094,
"rps_doc_openwebtext_importance_length_correction": -38.18564987182617,
"rps_doc_wikipedia_importance": -43.039093017578125,
"rps_doc_wikipedia_importance_length_correction": -43.039093017578125
},
"fasttext": {
"dclm": 0.24518758058547974,
"english": 0.7651713490486145,
"fineweb_edu_approx": 1.879393458366394,
"eai_general_math": 0.08798056840896606,
"eai_open_web_math": 0.35379189252853394,
"eai_web_code": 0.0011898300144821405
}
} | {
"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": "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,682,630,236,878,522,000 | Debug.Log Extensions
Documentation (1.1.9)
◆ Ensure() [5/5]
static bool Debug.Ensure ( bool condition,
int channel,
string message,
Object context = null
)
static
If condition is false logs to the Console on the given channel an error message and returns false.
If condition is true returns true without logging anything.
An error is only logged the first time during a session that the condition evaluates to false to avoid flooding the log file.
This can be useful for checking that the arguments passed to a function are valid and only executing a block of code if so.
In release builds an error will only be logged if the UNITY_ASSERTIONS symbol is defined.
private float Divide(float dividend, float divisor)
{
return Debug.Ensure(divisor != 0f) ? dividend / divisor : 0f;
}
static bool Ensure(bool condition, Object context=null)
If condition is false logs to the Console an error message and returns false.
Definition: Debug.cs:3838
Extended version of the built-in Debug class with additional methods to ease debugging while developi...
Definition: Debug.cs:34
Returns
true if condition was true; otherwise, false.
Parameters
conditionCondition you expect to be true.
channelThe channel to which the message belongs if logged.
messageMessage to display if condition is false.
contextObject to which the assertion applies. | {
"url": "http://docs.sisus.co/debug-log-extensions/class_debug_ab3dcca94bf81ffd8e07f24f1685a9e90.html",
"source_domain": "docs.sisus.co",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "8478",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:V5M7BNMT2M6ATHQKU74BGAYYO42WGALQ",
"WARC-Concurrent-To": "<urn:uuid:9f189466-02d1-4eca-bbe8-ecd35c05a9b0>",
"WARC-Date": "2021-10-17T23:16:06Z",
"WARC-IP-Address": "107.189.2.150",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:NA33JEWKTDHSSJERD5Q5ECO6QDTXT7LS",
"WARC-Record-ID": "<urn:uuid:8ddcae28-0eaf-46a5-bce9-9ec05a4a90c5>",
"WARC-Target-URI": "http://docs.sisus.co/debug-log-extensions/class_debug_ab3dcca94bf81ffd8e07f24f1685a9e90.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4990006d-0050-404f-8c01-425092f73749>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-191\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,
21,
43,
44,
61,
62,
106,
120,
137,
161,
163,
170,
171,
270,
271,
331,
332,
458,
459,
583,
584,
674,
675,
727,
729,
791,
793,
849,
927,
953,
1058,
1082,
1090,
1136,
1147,
1189,
1248,
1297
],
"line_end_idx": [
21,
43,
44,
61,
62,
106,
120,
137,
161,
163,
170,
171,
270,
271,
331,
332,
458,
459,
583,
584,
674,
675,
727,
729,
791,
793,
849,
927,
953,
1058,
1082,
1090,
1136,
1147,
1189,
1248,
1297,
1342
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1342,
"ccnet_original_nlines": 37,
"rps_doc_curly_bracket": 0.0014903099508956075,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26691728830337524,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003759399987757206,
"rps_doc_frac_lines_end_with_ellipsis": 0.02631578966975212,
"rps_doc_frac_no_alph_words": 0.23308271169662476,
"rps_doc_frac_unique_words": 0.5583756566047668,
"rps_doc_mean_word_length": 5.406091213226318,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0.003759399987757206,
"rps_doc_unigram_entropy": 4.3751349449157715,
"rps_doc_word_count": 197,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1183098629117012,
"rps_doc_frac_chars_dupe_6grams": 0.1183098629117012,
"rps_doc_frac_chars_dupe_7grams": 0.06384976953268051,
"rps_doc_frac_chars_dupe_8grams": 0.06384976953268051,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.051643189042806625,
"rps_doc_frac_chars_top_3gram": 0.04882628843188286,
"rps_doc_frac_chars_top_4gram": 0.0507042296230793,
"rps_doc_books_importance": -118.99992370605469,
"rps_doc_books_importance_length_correction": -118.99991607666016,
"rps_doc_openwebtext_importance": -80.29385375976562,
"rps_doc_openwebtext_importance_length_correction": -80.29385375976562,
"rps_doc_wikipedia_importance": -55.444705963134766,
"rps_doc_wikipedia_importance_length_correction": -55.43624496459961
},
"fasttext": {
"dclm": 0.3437678813934326,
"english": 0.670175313949585,
"fineweb_edu_approx": 1.393129587173462,
"eai_general_math": 0.8646819591522217,
"eai_open_web_math": 0.054077450186014175,
"eai_web_code": 0.8810563683509827
}
} | {
"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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
7,171,025,546,178,615,000 | Ask Singapore Homework?
Upload a photo of a Singapore homework and someone will email you the solution for free.
Question
primary 6 | Maths
One Answer Below
Anyone can contribute an answer, even non-tutors.
Answer This Question
Mahirah Squad
Mahirah Squad
primary 6 chevron_right Maths
I dont know how to do! Pls help me!
Date Posted: 2 years ago
Views: 204
See 1 Answer
done {{ upvoteCount }} Upvotes
clear {{ downvoteCount * -1 }} Downvotes
Denise
Denise's answer
4 answers (Tutor Details)
1st
a) Find the difference between Sunday and Monday first.
Then to calculate the %, divide the difference by the rainfall for Sunday which is 11m and times 100% to find the overall percentage increase.
b) Find the difference between Tuesday and Monday.
Divide the difference by the rainfall for Monday which is 13 m and times 100% to find the overall percentage decrease. | {
"url": "https://ask.manytutors.com/questions/2259",
"source_domain": "ask.manytutors.com",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "31923",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D2OSPYFTC5IBNIILUSEOATHK2EAP4NDA",
"WARC-Concurrent-To": "<urn:uuid:4d28c100-1dd2-4b60-b4e2-dfe3f6c9d088>",
"WARC-Date": "2019-10-15T16:24:07Z",
"WARC-IP-Address": "104.18.47.138",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AEJTXSQ7LSY3RZTSWFNZUIPGZ43RQ23R",
"WARC-Record-ID": "<urn:uuid:1921e021-b338-400e-9d44-e5ccc81df501>",
"WARC-Target-URI": "https://ask.manytutors.com/questions/2259",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4aba52bd-ef34-42f5-acc6-cf88e59bbb49>"
},
"warc_info": "isPartOf: CC-MAIN-2019-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-201.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,
24,
25,
114,
115,
116,
117,
126,
127,
145,
162,
163,
213,
214,
235,
249,
263,
264,
294,
295,
331,
332,
357,
368,
369,
382,
383,
414,
455,
462,
478,
504,
508,
564,
707,
708,
759
],
"line_end_idx": [
24,
25,
114,
115,
116,
117,
126,
127,
145,
162,
163,
213,
214,
235,
249,
263,
264,
294,
295,
331,
332,
357,
368,
369,
382,
383,
414,
455,
462,
478,
504,
508,
564,
707,
708,
759,
877
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 877,
"ccnet_original_nlines": 36,
"rps_doc_curly_bracket": 0.009122010320425034,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3117647171020508,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005882349796593189,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2235294133424759,
"rps_doc_frac_unique_words": 0.6285714507102966,
"rps_doc_mean_word_length": 4.885714054107666,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.274719715118408,
"rps_doc_word_count": 140,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.21052631735801697,
"rps_doc_frac_chars_dupe_6grams": 0.21052631735801697,
"rps_doc_frac_chars_dupe_7grams": 0.21052631735801697,
"rps_doc_frac_chars_dupe_8grams": 0.10818713158369064,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04093566909432411,
"rps_doc_frac_chars_top_3gram": 0.049707598984241486,
"rps_doc_frac_chars_top_4gram": 0.07017543911933899,
"rps_doc_books_importance": -86.08831024169922,
"rps_doc_books_importance_length_correction": -86.08831024169922,
"rps_doc_openwebtext_importance": -53.85938262939453,
"rps_doc_openwebtext_importance_length_correction": -47.24302291870117,
"rps_doc_wikipedia_importance": -39.43132019042969,
"rps_doc_wikipedia_importance_length_correction": -39.43132019042969
},
"fasttext": {
"dclm": 0.9933421015739441,
"english": 0.9067296385765076,
"fineweb_edu_approx": 1.5465288162231445,
"eai_general_math": 0.1498171091079712,
"eai_open_web_math": 0.16133517026901245,
"eai_web_code": 0.00001264000002265675
}
} | {
"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": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
9,161,802,365,818,576,000 | How to Create a New Folder in cPanel File Manager
Using folders enables you to organise and structure your files more effectively and makes it easier to manage your website.
Creating a new folder is a simple process when you use the cPanel File Manager. Just follow these steps.
1. Log in to your cPanel account.
2. Scroll to the Files section and click on File Manager.
3. To start creating a folder, click on the ‘+ Folder’ icon in the tools ribbon at the top left side of the page.
4. When you click +Folder a pop-up form will appear.
5. On the form, type the name you want for the folder on the top line and add its destination on the bottom line.
6. When you have inputted the details, click the Create New Folder button.
7. The new folder will now be created in your specified location.
Creed Hosting can help you to create New Folder .Please write at [email protected]
Related Articles | {
"url": "https://www.creedhosting.com/kb/knowledgebase/how-to-create-a-new-folder-in-cpanel-file-manager/",
"source_domain": "www.creedhosting.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "70761",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H3U4NAT5ITFGZ6IBTZHBPBR4DLM7LN4F",
"WARC-Concurrent-To": "<urn:uuid:bc5bf796-424c-4af5-991d-838847ae751d>",
"WARC-Date": "2021-07-24T07:27:31Z",
"WARC-IP-Address": "37.58.63.160",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FX7GEGYILGE6CGAL2NWWMSL6OIE4LTYZ",
"WARC-Record-ID": "<urn:uuid:1ba30b52-0b28-4046-9319-977262bb441a>",
"WARC-Target-URI": "https://www.creedhosting.com/kb/knowledgebase/how-to-create-a-new-folder-in-cpanel-file-manager/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:261399db-8623-4d85-bdf6-bb06f1d61fac>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-212.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,
50,
51,
175,
176,
281,
282,
316,
317,
375,
376,
490,
491,
544,
545,
659,
660,
735,
736,
802,
803,
891,
892
],
"line_end_idx": [
50,
51,
175,
176,
281,
282,
316,
317,
375,
376,
490,
491,
544,
545,
659,
660,
735,
736,
802,
803,
891,
892,
908
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 908,
"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.3711340129375458,
"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.17525772750377655,
"rps_doc_frac_unique_words": 0.5636363625526428,
"rps_doc_mean_word_length": 4.278788089752197,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.19406795501709,
"rps_doc_word_count": 165,
"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.06373938173055649,
"rps_doc_frac_chars_top_3gram": 0.028328610584139824,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -88.90359497070312,
"rps_doc_books_importance_length_correction": -88.90359497070312,
"rps_doc_openwebtext_importance": -39.62221145629883,
"rps_doc_openwebtext_importance_length_correction": -29.59873390197754,
"rps_doc_wikipedia_importance": -44.30905532836914,
"rps_doc_wikipedia_importance_length_correction": -44.30905532836914
},
"fasttext": {
"dclm": 0.04702550172805786,
"english": 0.7998704314231873,
"fineweb_edu_approx": 1.4765095710754395,
"eai_general_math": 0.1515926718711853,
"eai_open_web_math": 0.22856217622756958,
"eai_web_code": 0.002713379915803671
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
6,257,365,490,681,370,000 | sqrt
sqrt(x)
Return $\sqrt{x}$. Throws DomainError for negative Real arguments. Use complex negative arguments instead. The prefix operator is equivalent to sqrt.
Examples
julia> sqrt(-log(1.0f0))
-0.0f0
julia> sqrt(4)
2.0
See Also
abs2, beta, binomial, ceil, cell, cross, ctranspose, ctranspose!, cummin, cumprod, cumprod!, cumsum, cumsum!, cumsum_kbn, div, divrem, eigfact, eigfact!, eigmin, eps, erf, erfc, erfcinv, erfcx, erfi, erfinv, exp, exp10, exp2, expm1, exponent, factor, factorial, factorize, floor, gcd, invmod, log, log10, log1p, log2, logspace, max, min, mod, mod1, modf, next, nextpow, nextprod, num, primes, primesmask, prod, realmin, sqrt, sum!, sumabs, sumabs!, sumabs2, sumabs2!,
User Contributed Notes
Add a Note
The format of note supported is markdown, use triple backtick to start and end a code block.
*Required Field
Details
Checking you are not a robot: | {
"url": "http://jlhub.com/julia/manual/en/function/sqrt",
"source_domain": "jlhub.com",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "7732",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6NUD2JSJHGCYLXENRAJ2NZ3UQQTNZYCD",
"WARC-Concurrent-To": "<urn:uuid:37966e7f-2db9-49f8-af14-8982c2902ad1>",
"WARC-Date": "2018-07-18T18:21:27Z",
"WARC-IP-Address": "178.79.191.230",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:JACHNA2H5HGT76POFC4EEPBO772YSSL6",
"WARC-Record-ID": "<urn:uuid:54b311f1-4685-40d1-b328-98f1e5ac302d>",
"WARC-Target-URI": "http://jlhub.com/julia/manual/en/function/sqrt",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2e282531-967e-4318-9de3-81157bfa1606>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-141-37-174.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,
5,
6,
14,
15,
165,
166,
175,
176,
201,
208,
223,
227,
228,
237,
238,
706,
707,
730,
731,
742,
743,
836,
837,
853,
861,
862
],
"line_end_idx": [
5,
6,
14,
15,
165,
166,
175,
176,
201,
208,
223,
227,
228,
237,
238,
706,
707,
730,
731,
742,
743,
836,
837,
853,
861,
862,
891
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 891,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0.002244669944047928,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0833333283662796,
"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.41203704476356506,
"rps_doc_frac_unique_words": 0.846774160861969,
"rps_doc_mean_word_length": 5.322580814361572,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.599425792694092,
"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,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -113.7626724243164,
"rps_doc_books_importance_length_correction": -113.7626724243164,
"rps_doc_openwebtext_importance": -67.41897583007812,
"rps_doc_openwebtext_importance_length_correction": -59.13107681274414,
"rps_doc_wikipedia_importance": -29.804441452026367,
"rps_doc_wikipedia_importance_length_correction": -29.804441452026367
},
"fasttext": {
"dclm": 0.10059834271669388,
"english": 0.49304401874542236,
"fineweb_edu_approx": 1.9067939519882202,
"eai_general_math": 0.1533413529396057,
"eai_open_web_math": 0.17748552560806274,
"eai_web_code": 0.5319942235946655
}
} | {
"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": "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": "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 |
-6,101,352,285,938,954,000 | Export (0) Print
Expand All
Stack Class
Represents a simple last-in-first-out (LIFO) non-generic collection of objects.
System.Object
System.Collections.Stack
Namespace: System.Collections
Assembly: mscorlib (in mscorlib.dll)
'Declaration
<SerializableAttribute> _
<DebuggerDisplayAttribute("Count = {Count}")> _
<ComVisibleAttribute(True)> _
Public Class Stack _
Implements ICollection, IEnumerable, ICloneable
The Stack type exposes the following members.
NameDescription
Public methodSupported by the XNA FrameworkStackInitializes a new instance of the Stack class that is empty and has the default initial capacity.
Public methodSupported by the XNA FrameworkStack(ICollection)Initializes a new instance of the Stack class that contains elements copied from the specified collection and has the same initial capacity as the number of elements copied.
Public methodSupported by the XNA FrameworkStack(Int32)Initializes a new instance of the Stack class that is empty and has the specified initial capacity or the default initial capacity, whichever is greater.
Top
NameDescription
Public propertySupported by the XNA FrameworkCountGets the number of elements contained in the Stack.
Public propertySupported by the XNA FrameworkIsSynchronizedGets a value indicating whether access to the Stack is synchronized (thread safe).
Public propertySupported by the XNA FrameworkSyncRootGets an object that can be used to synchronize access to the Stack.
Top
NameDescription
Public methodSupported by the XNA FrameworkClearRemoves all objects from the Stack.
Public methodSupported by the XNA FrameworkCloneCreates a shallow copy of the Stack.
Public methodSupported by the XNA FrameworkContainsDetermines whether an element is in the Stack.
Public methodSupported by the XNA FrameworkCopyToCopies the Stack to an existing one-dimensional Array, starting at the specified array index.
Public methodSupported by the XNA FrameworkEquals(Object)Determines whether the specified object is equal to the current object. (Inherited from Object.)
Protected methodSupported by the XNA FrameworkFinalizeAllows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.)
Public methodSupported by the XNA FrameworkGetEnumeratorReturns an IEnumerator for the Stack.
Public methodSupported by the XNA FrameworkGetHashCodeServes as the default hash function. (Inherited from Object.)
Public methodSupported by the XNA FrameworkGetTypeGets the Type of the current instance. (Inherited from Object.)
Protected methodSupported by the XNA FrameworkMemberwiseCloneCreates a shallow copy of the current Object. (Inherited from Object.)
Public methodSupported by the XNA FrameworkPeekReturns the object at the top of the Stack without removing it.
Public methodSupported by the XNA FrameworkPopRemoves and returns the object at the top of the Stack.
Public methodSupported by the XNA FrameworkPushInserts an object at the top of the Stack.
Public methodStatic memberSupported by the XNA FrameworkSynchronizedReturns a synchronized (thread safe) wrapper for the Stack.
Public methodSupported by the XNA FrameworkToArrayCopies the Stack to a new array.
Public methodSupported by the XNA FrameworkToStringReturns a string that represents the current object. (Inherited from Object.)
Top
NameDescription
Public Extension MethodAsParallelOverloaded. Enables parallelization of a query. (Defined by ParallelEnumerable.)
Public Extension MethodAsParallelOverloaded. (Defined by ParallelEnumerable.)
Public Extension MethodAsQueryableOverloaded. Converts an IEnumerable to an IQueryable. (Defined by Queryable.)
Public Extension MethodAsQueryableOverloaded. (Defined by Queryable.)
Public Extension MethodSupported by the XNA FrameworkCast(Of TResult)Overloaded. Casts the elements of an IEnumerable to the specified type. (Defined by Enumerable.)
Public Extension MethodSupported by the XNA FrameworkCast(Of TResult)Overloaded. (Defined by Enumerable.)
Public Extension MethodSupported by the XNA FrameworkOfType(Of TResult)Overloaded. Filters the elements of an IEnumerable based on a specified type. (Defined by Enumerable.)
Public Extension MethodSupported by the XNA FrameworkOfType(Of TResult)Overloaded. (Defined by Enumerable.)
Top
For the generic version of this collection, see System.Collections.Generic.Stack(Of T).
Stack is implemented as a circular buffer.
The capacity of a Stack is the number of elements the Stack can hold. As elements are added to a Stack, the capacity is automatically increased as required through reallocation.
If Count is less than the capacity of the stack, Push is an O(1) operation. If the capacity needs to be increased to accommodate the new element, Push becomes an O(n) operation, where n is Count. Pop is an O(1) operation.
Stack accepts Nothing as a valid value and allows duplicate elements.
The following example shows how to create and add values to a Stack and how to print out its values.
Imports System
Imports System.Collections
Imports Microsoft.VisualBasic
Public Class SamplesStack
Public Shared Sub Main()
' Creates and initializes a new Stack.
Dim myStack As New Stack()
myStack.Push("Hello")
myStack.Push("World")
myStack.Push("!")
' Displays the properties and values of the Stack.
Console.WriteLine("myStack")
Console.WriteLine(ControlChars.Tab & "Count: {0}", myStack.Count)
Console.Write(ControlChars.Tab & "Values:")
PrintValues(myStack)
End Sub
Public Shared Sub PrintValues(myCollection As IEnumerable)
Dim obj As [Object]
For Each obj In myCollection
Console.Write(" {0}", obj)
Next obj
Console.WriteLine()
End Sub 'PrintValues
End Class
' This code produces the following output.
' myStack
' Count: 3
' Values: ! World Hello
.NET Framework
Supported in: 4.5.3, 4, 3.5, 3.0, 2.0, 1.1, 1.0
.NET Framework Client Profile
Supported in: 4, 3.5 SP1
Windows 8.1, Windows Server 2012 R2, Windows 8, Windows Server 2012, Windows 7, Windows Vista SP2, Windows Server 2008 (Server Core Role not supported), Windows Server 2008 R2 (Server Core Role supported with SP1 or later; Itanium not supported)
The .NET Framework does not support all versions of every platform. For a list of the supported versions, see .NET Framework System Requirements.
Public static (Shared in Visual Basic) members of this type are thread safe. Any instance members are not guaranteed to be thread safe.
To guarantee the thread safety of the Stack, all operations must be done through the wrapper returned by the Synchronized method.
Enumerating through a collection is intrinsically not a thread-safe procedure. Even when a collection is synchronized, other threads can still modify the collection, which causes the enumerator to throw an exception. To guarantee thread safety during enumeration, you can either lock the collection during the entire enumeration or catch the exceptions resulting from changes made by other threads.
Show:
© 2014 Microsoft | {
"url": "http://msdn.microsoft.com/en-us/library/System.Collections.Stack.aspx?cs-save-lang=1&cs-lang=vb",
"source_domain": "msdn.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2014-49",
"warc_metadata": {
"Content-Length": "78287",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SECANLD4Y73HXVBJNWYYSXY2RY7GZFQU",
"WARC-Concurrent-To": "<urn:uuid:0925063c-ee79-4abe-a8ec-9cd2d52c3e2e>",
"WARC-Date": "2014-11-26T00:22:33Z",
"WARC-IP-Address": "65.54.226.189",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:3PSA6XWVVKXXIH4YKY7FV3RJY3XKVNF6",
"WARC-Record-ID": "<urn:uuid:e1ad129e-c2fe-4689-a082-162354637c88>",
"WARC-Target-URI": "http://msdn.microsoft.com/en-us/library/System.Collections.Stack.aspx?cs-save-lang=1&cs-lang=vb",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3a25adde-427f-42ad-8dda-d4afa68fe183>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-23-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-49\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for November 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
17,
28,
29,
41,
42,
122,
123,
137,
164,
165,
196,
234,
235,
248,
274,
322,
352,
373,
422,
423,
469,
470,
488,
634,
869,
1078,
1082,
1083,
1101,
1203,
1345,
1466,
1470,
1471,
1489,
1573,
1658,
1756,
1899,
2053,
2257,
2351,
2467,
2581,
2713,
2824,
2926,
3016,
3144,
3227,
3356,
3360,
3361,
3379,
3493,
3571,
3683,
3753,
3919,
4025,
4199,
4307,
4311,
4312,
4400,
4401,
4444,
4445,
4623,
4624,
4846,
4847,
4917,
4918,
5019,
5020,
5035,
5062,
5092,
5093,
5123,
5124,
5153,
5154,
5202,
5237,
5267,
5297,
5323,
5324,
5383,
5420,
5497,
5549,
5578,
5591,
5592,
5655,
5683,
5721,
5763,
5780,
5808,
5833,
5834,
5845,
5846,
5890,
5891,
5902,
5922,
5959,
5960,
5975,
5976,
6024,
6025,
6055,
6056,
6081,
6082,
6328,
6329,
6475,
6476,
6612,
6613,
6743,
6744,
7143,
7144,
7150
],
"line_end_idx": [
17,
28,
29,
41,
42,
122,
123,
137,
164,
165,
196,
234,
235,
248,
274,
322,
352,
373,
422,
423,
469,
470,
488,
634,
869,
1078,
1082,
1083,
1101,
1203,
1345,
1466,
1470,
1471,
1489,
1573,
1658,
1756,
1899,
2053,
2257,
2351,
2467,
2581,
2713,
2824,
2926,
3016,
3144,
3227,
3356,
3360,
3361,
3379,
3493,
3571,
3683,
3753,
3919,
4025,
4199,
4307,
4311,
4312,
4400,
4401,
4444,
4445,
4623,
4624,
4846,
4847,
4917,
4918,
5019,
5020,
5035,
5062,
5092,
5093,
5123,
5124,
5153,
5154,
5202,
5237,
5267,
5297,
5323,
5324,
5383,
5420,
5497,
5549,
5578,
5591,
5592,
5655,
5683,
5721,
5763,
5780,
5808,
5833,
5834,
5845,
5846,
5890,
5891,
5902,
5922,
5959,
5960,
5975,
5976,
6024,
6025,
6055,
6056,
6081,
6082,
6328,
6329,
6475,
6476,
6612,
6613,
6743,
6744,
7143,
7144,
7150,
7166
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7166,
"ccnet_original_nlines": 132,
"rps_doc_curly_bracket": 0.0008372900192625821,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28883495926856995,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03236246109008789,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22815534472465515,
"rps_doc_frac_unique_words": 0.3365800976753235,
"rps_doc_mean_word_length": 6.181818008422852,
"rps_doc_num_sentences": 107,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.898000240325928,
"rps_doc_word_count": 924,
"rps_doc_frac_chars_dupe_10grams": 0.06285014003515244,
"rps_doc_frac_chars_dupe_5grams": 0.2888655364513397,
"rps_doc_frac_chars_dupe_6grams": 0.20990896224975586,
"rps_doc_frac_chars_dupe_7grams": 0.18277311325073242,
"rps_doc_frac_chars_dupe_8grams": 0.16981792449951172,
"rps_doc_frac_chars_dupe_9grams": 0.06285014003515244,
"rps_doc_frac_chars_top_2gram": 0.023634450510144234,
"rps_doc_frac_chars_top_3gram": 0.03641457110643387,
"rps_doc_frac_chars_top_4gram": 0.08858542889356613,
"rps_doc_books_importance": -492.9985046386719,
"rps_doc_books_importance_length_correction": -492.9985046386719,
"rps_doc_openwebtext_importance": -242.3397216796875,
"rps_doc_openwebtext_importance_length_correction": -242.3397216796875,
"rps_doc_wikipedia_importance": -163.22706604003906,
"rps_doc_wikipedia_importance_length_correction": -163.22706604003906
},
"fasttext": {
"dclm": 0.038855139166116714,
"english": 0.7708249092102051,
"fineweb_edu_approx": 2.207961082458496,
"eai_general_math": 0.08407419919967651,
"eai_open_web_math": 0.1932227611541748,
"eai_web_code": 0.02212565951049328
}
} | {
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
3,200,851,701,761,143,300 | From e5abcd66b1913f8a5655d209510981f766b64ccf Mon Sep 17 00:00:00 2001 From: Egor Date: Sat, 23 Feb 2019 12:51:38 +0000 Subject: [PATCH] Improve hashtags and `rel` attribute --- lib/auto_linker/builder.ex | 41 ++++++++++++++++++-------- lib/auto_linker/parser.ex | 3 +- test/auto_linker_test.exs | 59 ++++++++++++++++++++++++++++++++------ 3 files changed, 81 insertions(+), 22 deletions(-) diff --git a/lib/auto_linker/builder.ex b/lib/auto_linker/builder.ex index a46ccf4..cb2d18e 100644 --- a/lib/auto_linker/builder.ex +++ b/lib/auto_linker/builder.ex @@ -7,11 +7,13 @@ defmodule AutoLinker.Builder do Create a link. """ def create_link(url, opts) do + url = add_scheme(url) + [] |> build_attrs(url, opts, :rel) |> build_attrs(url, opts, :target) |> build_attrs(url, opts, :class) - |> build_attrs(url, opts, :scheme) + |> build_attrs(url, opts, :href) |> format_url(url, opts) end @@ -23,6 +25,13 @@ defmodule AutoLinker.Builder do |> format_markdown(text, opts) end + defp build_attrs(attrs, uri, %{rel: get_rel}, :rel) when is_function(get_rel, 1) do + case get_rel.(uri) do + nil -> attrs + rel -> [{:rel, rel} | attrs] + end + end + defp build_attrs(attrs, _, opts, :rel) do if rel = Map.get(opts, :rel, "noopener noreferrer"), do: [{:rel, rel} | attrs], else: attrs end @@ -35,12 +44,14 @@ defmodule AutoLinker.Builder do if cls = Map.get(opts, :class, "auto-linker"), do: [{:class, cls} | attrs], else: attrs end - defp build_attrs(attrs, url, _opts, :scheme) do - if String.starts_with?(url, ["http://", "https://"]), - do: [{:href, url} | attrs], - else: [{:href, "http://" <> url} | attrs] + defp build_attrs(attrs, url, _opts, :href) do + [{:href, url} | attrs] end + defp add_scheme("http://" <> _ = url), do: url + defp add_scheme("https://" <> _ = url), do: url + defp add_scheme(url), do: "http://" <> url + defp format_url(attrs, url, opts) do url = url @@ -117,10 +128,11 @@ defmodule AutoLinker.Builder do url = mention_prefix <> name - [href: url] + [] |> build_attrs(url, opts, :rel) |> build_attrs(url, opts, :target) |> build_attrs(url, opts, :class) + |> build_attrs(url, opts, :href) |> format_mention(name, opts) end @@ -129,43 +141,48 @@ defmodule AutoLinker.Builder do url = hashtag_prefix <> tag - [href: url] + [] |> build_attrs(url, opts, :rel) |> build_attrs(url, opts, :target) |> build_attrs(url, opts, :class) + |> build_attrs(url, opts, :href) |> format_hashtag(tag, opts) end def create_email_link(email, opts) do [] |> build_attrs(email, opts, :class) + |> build_attrs("mailto:#{email}", opts, :href) |> format_email(email, opts) end def create_extra_link(uri, opts) do [] |> build_attrs(uri, opts, :class) + |> build_attrs(uri, opts, :rel) + |> build_attrs(uri, opts, :target) + |> build_attrs(uri, opts, :href) |> format_extra(uri, opts) end def format_mention(attrs, name, _opts) do attrs = format_attrs(attrs) - "@" <> name <> "" + "@#{name}" end def format_hashtag(attrs, tag, _opts) do attrs = format_attrs(attrs) - "#" <> tag <> "" + "##{tag}" end def format_email(attrs, email, _opts) do attrs = format_attrs(attrs) - ~s(#{email}) + ~s(#{email}) end def format_extra(attrs, uri, _opts) do - attrs = format_attributes(attrs) - ~s(#{uri}) + attrs = format_attrs(attrs) + ~s(#{uri}) end defp format_attributes(attrs) do diff --git a/lib/auto_linker/parser.ex b/lib/auto_linker/parser.ex index c675bb1..c37f56c 100644 --- a/lib/auto_linker/parser.ex +++ b/lib/auto_linker/parser.ex @@ -25,7 +25,6 @@ defmodule AutoLinker.Parser do ~s{, work (555) 555-5555} """ - # @invalid_url ~r/\.\.+/ @invalid_url ~r/(\.\.+)|(^(\d+\.){1,2}\d+$)/ @match_url ~r{^[\w\.-]+(?:\.[\w\.-]+)+[\w\-\._~%:/?#[\]@!\$&'\(\)\*\+,;=.]+$} @@ -45,7 +44,7 @@ defmodule AutoLinker.Parser do # https://www.w3.org/TR/html5/forms.html#valid-e-mail-address @match_email ~r/^[a-zA-Z0-9.!#$%&'*+\/=?^_`{|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*$/u - @match_hashtag ~r/^(?\#\w+)/u + @match_hashtag ~r/^(?\#[[:word:]_]*[[:alpha:]_·][[:word:]_·]*)/u @prefix_extra [ "magnet:?", diff --git a/test/auto_linker_test.exs b/test/auto_linker_test.exs index ad26d81..9bd0719 100644 --- a/test/auto_linker_test.exs +++ b/test/auto_linker_test.exs @@ -33,7 +33,7 @@ defmodule AutoLinkerTest do "hello google.com https://ddg.com 888 888-8888 [email protected] [google.com](http://google.com) irc:///mIRC" expected = - "hello google.com ddg.com 888 888-8888 [email protected] google.com irc:///mIRC" + "hello google.com ddg.com 888 888-8888 [email protected] google.com irc:///mIRC" assert AutoLinker.link(text, phone: true, @@ -47,6 +47,22 @@ defmodule AutoLinkerTest do ) == expected end + test "rel as function" do + text = "google.com" + + expected = "google.com" + + custom_rel = fn url -> + url |> String.split(".") |> List.last() + end + + assert AutoLinker.link(text, + class: false, + new_window: false, + rel: custom_rel + ) == expected + end + describe "custom handlers" do test "mentions handler" do text = "hello @user, @valid_user and @invalid_user" @@ -106,7 +122,7 @@ defmodule AutoLinkerTest do end expected = - "Hello again, @@user.<script></script>\nThis is on another :moominmamma: line. #2hu #epic #phantasmagoric" + "Hello again, @@user.<script></script>\nThis is on another :moominmamma: line. #2hu #epic #phantasmagoric" assert AutoLinker.link(text, mention: true, @@ -120,7 +136,7 @@ defmodule AutoLinkerTest do describe "mentions" do test "simple mentions" do expected = - ~s{hello @user and @anotherUser.} + ~s{hello @user and @anotherUser.} assert AutoLinker.link("hello @user and @anotherUser.", mention: true, @@ -132,7 +148,7 @@ defmodule AutoLinkerTest do text = "hey @[email protected]" expected = - "hey @[email protected]" + "hey @[email protected]" assert AutoLinker.link(text, mention: true, @@ -144,7 +160,7 @@ defmodule AutoLinkerTest do describe "hashtag links" do test "hashtag" do expected = - " one #2two three #four." + " one #2two three #four." assert AutoLinker.link(" one #2two three #four.", hashtag: true, @@ -152,6 +168,33 @@ defmodule AutoLinkerTest do ) == expected end + test "must have non-numbers" do + expected = "#1ok #42 #7" + + assert AutoLinker.link("#1ok #42 #7", + hashtag: true, + hashtag_prefix: "/t/", + class: false, + rel: false, + new_window: false + ) == expected + end + + test "support French" do + text = "#administrateur·rice·s #ingénieur·e·s" + + expected = + "#administrateur·rice·s #ingénieur·e·s" + + assert AutoLinker.link(text, + hashtag: true, + hashtag_prefix: "/t/", + class: false, + rel: false, + new_window: false + ) == expected + end + test "do not turn urls with hashes into hashtags" do text = "google.com#test #test google.com/#test #tag" @@ -262,7 +305,7 @@ defmodule AutoLinkerTest do expected = "xmpp:[email protected]" - assert AutoLinker.link(text, extra: true) == expected + assert AutoLinker.link(text, extra: true, new_window: false, rel: false) == expected end test "email" do @@ -278,7 +321,7 @@ defmodule AutoLinkerTest do expected = "magnet:?xt=urn:btih:a4104a9d2f5615601c429fe8bab8177c47c05c84&dn=ubuntu-18.04.1.0-live-server-amd64.iso&tr=http%3A%2F%2Ftorrent.ubuntu.com%3A6969%2Fannounce&tr=http%3A%2F%2Fipv6.torrent.ubuntu.com%3A6969%2Fannounce" - assert AutoLinker.link(text, extra: true) == expected + assert AutoLinker.link(text, extra: true, new_window: false, rel: false) == expected end test "dweb" do @@ -288,7 +331,7 @@ defmodule AutoLinkerTest do expected = "dweb://584faa05d394190ab1a3f0240607f9bf2b7e2bd9968830a11cf77db0cea36a21+v1.0.0/path/to/file.txt" - assert AutoLinker.link(text, extra: true) == expected + assert AutoLinker.link(text, extra: true, new_window: false, rel: false) == expected end end -- 2.21.0 | {
"url": "https://git.pleroma.social/pleroma/linkify/commit/e5abcd66b1913f8a5655d209510981f766b64ccf.patch",
"source_domain": "git.pleroma.social",
"snapshot_id": "crawl=CC-MAIN-2019-39",
"warc_metadata": {
"Content-Length": "12571",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:POCUJ2WEKSW3HOKPLA735SCLGBO54QQS",
"WARC-Concurrent-To": "<urn:uuid:71a2e998-8075-4ea2-8bca-fdd8456ebd1c>",
"WARC-Date": "2019-09-16T04:26:06Z",
"WARC-IP-Address": "163.237.218.133",
"WARC-Identified-Payload-Type": "application/mbox",
"WARC-Payload-Digest": "sha1:SYBQOE6WWXZLDHCB3OOFPQFFRVZFYTFK",
"WARC-Record-ID": "<urn:uuid:830a4bad-f849-4f35-a231-b4fdfa057cd4>",
"WARC-Target-URI": "https://git.pleroma.social/pleroma/linkify/commit/e5abcd66b1913f8a5655d209510981f766b64ccf.patch",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5968fb0e-f492-4eab-92f7-e7a27b308a10>"
},
"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 ([email protected])\r\nhostname: ip-10-67-67-252.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
],
"line_end_idx": [
7674
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7674,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.005733650177717209,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08866076171398163,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0069995298981666565,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5706952810287476,
"rps_doc_frac_unique_words": 0.3505007326602936,
"rps_doc_mean_word_length": 7.208869934082031,
"rps_doc_num_sentences": 113,
"rps_doc_symbol_to_word_ratio": 0.019598690792918205,
"rps_doc_unigram_entropy": 4.783002853393555,
"rps_doc_word_count": 699,
"rps_doc_frac_chars_dupe_10grams": 0.17801150679588318,
"rps_doc_frac_chars_dupe_5grams": 0.21690812706947327,
"rps_doc_frac_chars_dupe_6grams": 0.21690812706947327,
"rps_doc_frac_chars_dupe_7grams": 0.20103195309638977,
"rps_doc_frac_chars_dupe_8grams": 0.20103195309638977,
"rps_doc_frac_chars_dupe_9grams": 0.17801150679588318,
"rps_doc_frac_chars_top_2gram": 0.04385790973901749,
"rps_doc_frac_chars_top_3gram": 0.049613021314144135,
"rps_doc_frac_chars_top_4gram": 0.03929350897669792,
"rps_doc_books_importance": -851.5675048828125,
"rps_doc_books_importance_length_correction": -851.5675048828125,
"rps_doc_openwebtext_importance": -483.6327209472656,
"rps_doc_openwebtext_importance_length_correction": -483.6327209472656,
"rps_doc_wikipedia_importance": -318.8268127441406,
"rps_doc_wikipedia_importance_length_correction": -318.8268127441406
},
"fasttext": {
"dclm": 0.9995682835578918,
"english": 0.28117868304252625,
"fineweb_edu_approx": 3.1150012016296387,
"eai_general_math": 0.3697250485420227,
"eai_open_web_math": 0.8097978830337524,
"eai_web_code": 0.0029266499914228916
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "25",
"label": "Other/Unclassified"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
7,849,405,792,326,244,000 | he Most Important Skill For A Hacker
Short Bytes: There is no denying the fact that programming is the fundamental hacking skill. The more you program, the better hacker you become. This article is dedicated to the beginners who aspire to become a hacker and attain the qualities needed for it.
If you search the web and look for the definition of term ‘hacker’, it’ll show you things having to do with technical knowledge and skills to solve impossible problems. Well, in the real world, being a hacker means a lot more. Hackers belong to a community that traces its roots back to the first ARPAnet experiments and the invention of the internet. They were the ones who built the world wide web and continue to make this world a better place.
If you want to become a hacker, you must understand the meaning of hacker culture. It deals with applying the hacker attitude to other things. In this series, I’ll be telling you about different qualities a hacker should possess and the skill he/she should learn.
Programming is the fundamental hacking skill!
Programming is the basic skill that a hacker should possess and master. If you don’t know any programming languages, start by learning a basic language like Python or Java. These powerful and well-documented languages could be learned easily.
If I specifically talk about Python, it’s a great language to start with. Despite being suitable for beginners, it’s very powerful, and flexible. One should try learning C, the core language of Unix, if the person intends to dive deep into the world of programming.
To become a good hacker, you need to have a certain level of knowledge of several languages to play with code injection and poisoning servers/domains in a much better way.
However, if you want to target some specific areas of hacking, you must choose the programming languages wisely. If you are interested in web application security, I’ll advise you to take up PHP and JavaScript. If you are willing to deal with network hacking and pentesting, it’s important to learn root level programming languages like C.
Why programming is the most important skill for hackers?
Mastering a programming language allows you to be self-dependent and gives you the knowledge of working of programs to exploit them easily. Even though exploit development is mainly done in the assembly language in debuggers, learning the functioning of a program could be very useful.
It’ll help you to write your own exploits in C/C++ and ditch the frameworks like Metasploit. Learning programming also gives you the power to create your own custom malware, making it difficult for an antivirus software to detect.
Most of the hacking tools are freely available and open source. So, if you’ve mastered the art of programming, using hacking tools and making them better is an easy task.
So, before you start with the basics of hacking, learn to code and create a solid foundation.
Here are some helpful programming courses to get started —
• Python
• Java
• JavaScript
LEAVE A REPLY
Please enter your comment!
Please enter your name here | {
"url": "https://thcb.in/why-programming-is-the-most-important-skill-for-a-hacker/",
"source_domain": "thcb.in",
"snapshot_id": "crawl=CC-MAIN-2019-09",
"warc_metadata": {
"Content-Length": "239073",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RAIXJLC6BO4EKMDZPU7J5PIW3PUO5A33",
"WARC-Concurrent-To": "<urn:uuid:007bb3d9-40ea-43f6-a098-9b72dacbe1fd>",
"WARC-Date": "2019-02-23T15:47:44Z",
"WARC-IP-Address": "107.180.51.6",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZHJH244XK4XRGGT53DVXVN4YPKOFCNGQ",
"WARC-Record-ID": "<urn:uuid:63edf0ac-a70b-4b91-b859-a9e9766ebc91>",
"WARC-Target-URI": "https://thcb.in/why-programming-is-the-most-important-skill-for-a-hacker/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cb006679-bc08-426d-89e4-0d3f293e6996>"
},
"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 ([email protected])\r\nhostname: ip-10-165-183-132.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,
37,
38,
296,
297,
745,
746,
1010,
1011,
1057,
1058,
1301,
1302,
1568,
1569,
1741,
1742,
2082,
2083,
2140,
2141,
2427,
2428,
2659,
2660,
2831,
2832,
2926,
2927,
2986,
2987,
2998,
3007,
3022,
3023,
3037,
3038,
3065
],
"line_end_idx": [
37,
38,
296,
297,
745,
746,
1010,
1011,
1057,
1058,
1301,
1302,
1568,
1569,
1741,
1742,
2082,
2083,
2140,
2141,
2427,
2428,
2659,
2660,
2831,
2832,
2926,
2927,
2986,
2987,
2998,
3007,
3022,
3023,
3037,
3038,
3065,
3092
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3092,
"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.4344941973686218,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019900500774383545,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12271972745656967,
"rps_doc_frac_unique_words": 0.46628132462501526,
"rps_doc_mean_word_length": 4.797688007354736,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.923987865447998,
"rps_doc_word_count": 519,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.049799200147390366,
"rps_doc_frac_chars_dupe_6grams": 0.03132529929280281,
"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.016867469996213913,
"rps_doc_frac_chars_top_3gram": 0.025702809914946556,
"rps_doc_frac_chars_top_4gram": 0.016867469996213913,
"rps_doc_books_importance": -248.04908752441406,
"rps_doc_books_importance_length_correction": -248.04908752441406,
"rps_doc_openwebtext_importance": -178.52853393554688,
"rps_doc_openwebtext_importance_length_correction": -178.52853393554688,
"rps_doc_wikipedia_importance": -120.53059387207031,
"rps_doc_wikipedia_importance_length_correction": -120.53059387207031
},
"fasttext": {
"dclm": 0.29925966262817383,
"english": 0.9200446605682373,
"fineweb_edu_approx": 2.917015314102173,
"eai_general_math": 0.24615931510925293,
"eai_open_web_math": 0.16055762767791748,
"eai_web_code": 0.06436812877655029
}
} | {
"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": "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": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
1,897,079,996,376,063,700 | Most Anticipated Gadgets – Coming Soon!
– Nisha Yadav, 3rd Year, MC
Want to try out trending clothes and accessories virtually, before buying them?
starting
Wait no more! Samsung has launched the industry’s first Mirror and Transparent OLED panels at the Retail Asia Expo 2015 in Hong Kong on 9th June 2015. When compared to the other mirror LCDs, it has self-luminance (doesn’t require back-lighting), is clearer, sharper, has vibrant colours, higher contrast and faster response time. To include gestures and voice control, it contains Intel developed Real Sense 3D-rotatable viewing systems.
starting ..
If reading about this huge step taken by Samsung towards the advancement in technology interests you, read further to know about more such news.
1. The Dash
Earphones like never before!1 dash
Features: Wireless earbuds for listening to songs plus an embedded 4GB/1000-song music player, microphone and a fitness tracker (bio sensing).
Release: Shipping from July 2015
Estimated Price: $299
1. Project Ara
Afraid of getting the one-slip-away mosaic-wallpaper on your smart phone’s screen? Or ever wished if you could somehow make the camera in your existing phone better, without having to buy a whole new set?2 project-ara
Features: Allows Modular upgradation – users will be able to replace the phone parts they want.
Release: August 2015
Product company: Google, Motorola
Estimated Price: The basic piece or ‘Gray phone’ will cost $50.
1. Smart Rear-view Mirrors
Features: LCD Screen enhances the visibility in even different weather conditions, allows toggling of view (as per the driver’s preference).3 nissan's rear view
Product Company: Cadillac, Nissan
Release: August 2015
4.Zwipe MasterCard4 zwipe
Say no to the worries of periodically changing your ATM-Pin and then memorising it, to prevent unauthorised excess.
Features: World’s first contactless card with a fingerprint sensor, stores securely, the users’ biometric data, allows safe payments with a quick fingerprint scan.
Product Company: MasterCard
1. iPhone 7
Well who is not excited about the latest iPhone?
5 iphone
Features: Side-mounted wrap-around display, Sapphire glass for the display and Liquidmetal for the chassis, Force Touch screen technology, with metal alloy dubbed Liquidmetal.
Release: September 2015
Product Company: Apple
Estimated Price: between $649 to $849
1. Oculus Rift virtual reality headset
An attendee wears an Oculus VR Inc. Rift Development Kit 2 headset to play a video game during the E3 Electronic Entertainment Expo in Los Angeles, California, U.S., on Wednesday, June 11, 2014. E3, a trade show for computer and video games, draws professionals to experience the future of interactive entertainment as well as to see new technologies and never-before-seen products. Photographer: Patrick T. Fallon/Bloomberg via Getty Images
An attendee wears an Oculus VR Inc. Rift Development Kit 2 headset to play a video game during the E3 Electronic Entertainment Expo in Los Angeles, California, U.S., on Wednesday, June 11, 2014. E3, a trade show for computer and video games, draws professionals to experience the future of interactive entertainment as well as to see new technologies and never-before-seen products. Photographer: Patrick T. Fallon/Bloomberg via Getty Images
Want to control gaming movements with a tilt of your head? Be it gaming, tourism or the entertainment world, Virtual reality is creating a market of its own.
Features: head-mounted virtual-reality display which will give the user a full 360-degree view of the virtual world they inhabit, allows interaction with objects in the game by simple hand and body movements, lightweight in terms of power and physical size.
Release: Early 2016
Owned by: Facebook
Estimated Price: $1000(approx.)
Advertisements
Advice to Fuchchas!
Prateek Singhal, 2nd year, EEE. your-brain-on-college-hi
So, while the fuchchas have finally begun feeling like a part of this college, after having gotten through their first sem, the final year seniors have begun anticipating what they’ll do after this last semester – when the “real” life begins. The fuchchas gave their first end semester exams (don’t worry, it’s a horrible experience for everyone), and the seniors are getting ready to give their last end sems (which is more of a formality anyway).
So to all the fuchchas: I ask you to recall the experiences of your first semester. Was it just as amazing as you expected? Did you learn a new skill or discover a natural talent in yourself that you never knew you had? Did you join any of themyriad societies and teams that the university has to offer? But most importantly, did you remember to have fun?
As a fuchcha, you tend to fall into one of the following categories – the aficionados, and the procrastinators.
Now, the aficionados, or the enthusiasts, are the fuchchas who are pretty much everywhere – you can see them attending every orientation, turning up for every exam and interview, and basically being so active with the extra-curricular that you wonder when they take time out to study.
However, most of the aficionados feel the brunt of academics in their second year, and then they have to make the difficult choice – which societies to leave, and which ones to keep. And it is only the rare few that can still manage to retain the same momentum in the second year that they did in the first.
Then come the procrastinators. They are the ones who have registered for the interviews, but are a bit occupied (read:-“lazy”-) to turn up for them. They think that the first year should be kept for lounging around, and they can always join societies in their second year.
The procrastinators, however, are truly in for a surprise. They thought that the experienced they earned in their first year would help them cruise through most of the recruitment tests and interviews with ease, and it might have, too, had the curriculum itself not been so exhausting as to leave a student drained. Also, taking on the added responsibility of joining a society is out of question for many seniors, especially if their first year’s academic performance was not upto the mark. And it is the initial period after joining a society that you have to put in maximum effort, for after a year or so into the society, it’s usually smooth sailing for you as you can designate the work to YOUR juniors!
My point is, don’t be an aficionado and definitely not a procrastinator either; strike a balance between the two! Don’t waste your first year by thinking you’ll start in the second year because believe us, the second will hardly be any easier than the first. Also, try as you might, you’ll have to let go of one or more things you like to do anyway. For as the ultra-legendary Joker said, “That’s the point. You’ll have to choose.”
So that’s about it, my dear fuchchas. Some words of wisdom from a not-so-wise senior! Just choose your own philosophy and stick to it. Don’t get influenced by the next guy. Remember the words of Oscar Wilde – “put all your genius into your life and put only your talent into your works!”
Denizens of the Metro Ladies Coach
Namrata Yadav, 3rd year, EE
metro2
The Seat Hunter
It’s an art, how you can squeeze a seat out of nothing, either by being super sweet, “Please adjust karlo!” or being super imposing with just a hand gesture and then claiming the full seat inch by inch and forcing the original occupant to stand up instead. Chanakya Neeti, anyone?
The Phone Talkers
By the end of the journey, you can deduce their boyfriend’s eating habits- “ Babu, khana kha liya? Kya khaya? Kab khaya?” how two-faced their friends really are, “She stabbed me in the back and I thought we were best friends!” or how stupid their co-workers are, “ She tries to get the men do the work for her and then flaunts it everywhere.” Their whole life is an open book.
The Fashion Critic
Your dressing style is scanned, processed, analyzed and judged the moment you walk in front of them. And, if you like to associate adjectives like “simple” and “sober” with yourself, you should consider leaving the country rather than sitting opposite them.
The Gate Blockers
Apparently the concept of clearing the gate area at a new station is totally extraterrestrial for most Indians who will stand right in front of the gate till someone knocks them down, after which they will unleash a colourful vocabulary and tasteful expressions to the unsuspecting world.
Pearls of Wisdom
It’s everyone’s worst fear, to sit beside an inquisitive and talkative Auntiji, who wants nothing more from life than to set a stray teenage girl back on the righteous path. Amen. With words of wisdom on subjects you would have heard of only in Hindi serials, metro ride for them is life’s next big adventure.
The Studious Type
Think you’ll catch up on some last minute revision or finish your practical file? Or read a novel to pass the time? Then you have to cope up with “passive readers” and that girl in high heels and perfect make-up who can’t imagine how people can have such uninteresting hobbies.
Babies and Kids
Girls fawn over them. Until they bawl their lungs out or spin around the bars, try to grab your hair or phone, stare at you as if you stole their candy or in general, display childish behaviour of any kind. Otherwise, they are cute, little angels.
And their Embarrassed Mothers
Well, what can they do if their child rolls over the floor of the train, screaming bloody murder because they didn’t let him/her race down the metro? They get sympathetic smiles from their co-passengers, or cold smiles and sneers if their child isn’t even cute.
Talking to a Mobile Phone
Prerna Batra, 3rd year, BT.
Well, I am not talking about my conversation with someone else via my Smartphone, but about my conversation with my very own mobile phone. I was gazing at something, which can make my heart beat ten times faster once it gets missing for a few seconds or falls by more than one meter. I had pampered it like my baby, having bought phone covers for it of all colours. (Do I myself wear wardrobes of that variety, I wondered. Who cares? I am in DTU not DU). Sometimes being the last one to enter the house and forgetting to lock my door during the night, I have surely been ignorant about my house’s security but have never compromised on my phone’s security. The moment the lock code is revealed to anarticle-2325652-19D1A11F000005DC-60_468x286yone, be it my best friend, within seconds, the lock code is changed. Well, I don’t run after guys, but I can run a few kilometers after the one who snatched my phone. I have never cared whether the birthday guy/ girl has washed his hands beforecutting the cake or whether bacteria enter into my mouth along with the cake particles when he/she puts the cake into my mouth. But if you have to touch my phone, make sure your hands are washed. Yes, soap is a compulsion. I may make my mother wait a few minutes after she calls me. But once my phone makes a noise, within seconds I am onto it. I can survive a day without foodand water. But without my phone: never!
With these thoughts, I turned to my phone and started talking to it thinking it must be loving me back for all the care and love I bestow upon it. To my utter surprise, it was quite rude to me. I asked the reason for such a behavior. “Not one but many” it said. His friends: my computer, my wrist watch, my calendar, PSP, radio have all been sent far away from it. It worked day and night constantly charging and discharging itself. All my mischief, my “not studying”, my wrong doings had fetched bitter words from my mom and dad for the delicate darling. It even challenged that there is lesser competition for getting into IITs and IIMs and more in the world of mobile phones. No one is perfect, but one imperfection in the mobile phone labels it as “dabba”. I gossip all around, keeping nothing inside. But the phone has to save it all without sharing it with anyone. The phone has no holiday or rest day until it is brutally injured or is dead. Giving an ear to all this, I felt bad for it, kissed it and said “Life is hard dear”.
The whatsapp buzzed: it was the DTU Times group discussing about the blog edition.
I returned to my inconsiderate mode.
Life Without Whatsapp
images (1) You are having a conversation with someone. Make that trying to. Why? Because that person isn’t looking at you, or listening to you. They keep looking at their phone, smiling, typing, and then looking back at you; so you start again but before you can utter a single word, the phone is buzzing away again. You want to throttle that person. To death.
strap
You don’t have whatsapp. Your friends complain that they have to buy a message card only for you as you still live in the dark ages. If you ever miss an important group update, it’s your fault, we posted it on whatsapp. You might have the best screen resolution, RAM, video/audio, they are all useless if you can’t install whatsapp. Just imagine what would happen if the “last seen at” feature was replaced by “last seen with”. RIP world.
So, if you are deserted on a remote island and not having a net card isn’t your top worry, congratulations! You might be one of the last few sane people on earth. | {
"url": "https://dtutimes.wordpress.com/tag/iphone/",
"source_domain": "dtutimes.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "96401",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:66PRCT5CU2H67IN64W5DTGWWILI7HMQS",
"WARC-Concurrent-To": "<urn:uuid:6bbf9b7e-d952-42c6-ac2c-3f6fb815a3b3>",
"WARC-Date": "2018-10-18T14:23:29Z",
"WARC-IP-Address": "192.0.78.12",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GKVIKMHW5X4665BHIPGXK7MAXKEHSVU3",
"WARC-Record-ID": "<urn:uuid:1ea4bf24-fe2c-4d96-a86c-d4c98b1e9505>",
"WARC-Target-URI": "https://dtutimes.wordpress.com/tag/iphone/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0b9ad72b-f14c-4fdc-8b26-23bc72ce8a22>"
},
"warc_info": "isPartOf: CC-MAIN-2018-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-102-177-5.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,
40,
41,
69,
70,
150,
151,
160,
161,
599,
600,
612,
613,
758,
759,
773,
774,
809,
810,
953,
954,
987,
988,
1010,
1011,
1028,
1029,
1247,
1248,
1344,
1345,
1366,
1367,
1401,
1402,
1466,
1467,
1496,
1497,
1658,
1659,
1693,
1694,
1716,
1717,
1743,
1744,
1860,
1861,
2025,
2026,
2054,
2055,
2069,
2070,
2119,
2120,
2129,
2130,
2306,
2307,
2331,
2332,
2355,
2356,
2394,
2395,
2436,
2437,
2883,
3329,
3330,
3488,
3489,
3747,
3748,
3768,
3769,
3788,
3789,
3821,
3822,
3837,
3838,
3858,
3859,
3916,
3917,
4366,
4367,
4723,
4724,
4836,
4837,
5122,
5123,
5431,
5432,
5705,
5706,
6415,
6416,
6848,
6849,
7137,
7138,
7173,
7174,
7202,
7203,
7210,
7211,
7227,
7228,
7509,
7510,
7528,
7529,
7906,
7907,
7926,
7927,
8185,
8186,
8204,
8205,
8494,
8495,
8512,
8513,
8823,
8824,
8842,
8843,
9121,
9122,
9138,
9139,
9387,
9388,
9418,
9419,
9681,
9682,
9708,
9709,
9737,
9738,
11142,
11143,
12178,
12261,
12298,
12299,
12301,
12302,
12324,
12325,
12691,
12692,
12698,
12699,
13138,
13139
],
"line_end_idx": [
40,
41,
69,
70,
150,
151,
160,
161,
599,
600,
612,
613,
758,
759,
773,
774,
809,
810,
953,
954,
987,
988,
1010,
1011,
1028,
1029,
1247,
1248,
1344,
1345,
1366,
1367,
1401,
1402,
1466,
1467,
1496,
1497,
1658,
1659,
1693,
1694,
1716,
1717,
1743,
1744,
1860,
1861,
2025,
2026,
2054,
2055,
2069,
2070,
2119,
2120,
2129,
2130,
2306,
2307,
2331,
2332,
2355,
2356,
2394,
2395,
2436,
2437,
2883,
3329,
3330,
3488,
3489,
3747,
3748,
3768,
3769,
3788,
3789,
3821,
3822,
3837,
3838,
3858,
3859,
3916,
3917,
4366,
4367,
4723,
4724,
4836,
4837,
5122,
5123,
5431,
5432,
5705,
5706,
6415,
6416,
6848,
6849,
7137,
7138,
7173,
7174,
7202,
7203,
7210,
7211,
7227,
7228,
7509,
7510,
7528,
7529,
7906,
7907,
7926,
7927,
8185,
8186,
8204,
8205,
8494,
8495,
8512,
8513,
8823,
8824,
8842,
8843,
9121,
9122,
9138,
9139,
9387,
9388,
9418,
9419,
9681,
9682,
9708,
9709,
9737,
9738,
11142,
11143,
12178,
12261,
12298,
12299,
12301,
12302,
12324,
12325,
12691,
12692,
12698,
12699,
13138,
13139,
13301
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 13301,
"ccnet_original_nlines": 163,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42202165722846985,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01805054023861885,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16931408643722534,
"rps_doc_frac_unique_words": 0.42256638407707214,
"rps_doc_mean_word_length": 4.6699113845825195,
"rps_doc_num_sentences": 141,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 6.061878204345703,
"rps_doc_word_count": 2260,
"rps_doc_frac_chars_dupe_10grams": 0.06765207648277283,
"rps_doc_frac_chars_dupe_5grams": 0.06765207648277283,
"rps_doc_frac_chars_dupe_6grams": 0.06765207648277283,
"rps_doc_frac_chars_dupe_7grams": 0.06765207648277283,
"rps_doc_frac_chars_dupe_8grams": 0.06765207648277283,
"rps_doc_frac_chars_dupe_9grams": 0.06765207648277283,
"rps_doc_frac_chars_top_2gram": 0.004263789858669043,
"rps_doc_frac_chars_top_3gram": 0.002558270003646612,
"rps_doc_frac_chars_top_4gram": 0.0032215300016105175,
"rps_doc_books_importance": -996.0841064453125,
"rps_doc_books_importance_length_correction": -996.0841064453125,
"rps_doc_openwebtext_importance": -681.5231323242188,
"rps_doc_openwebtext_importance_length_correction": -681.5231323242188,
"rps_doc_wikipedia_importance": -588.55419921875,
"rps_doc_wikipedia_importance_length_correction": -588.55419921875
},
"fasttext": {
"dclm": 0.019475219771265984,
"english": 0.9433170557022095,
"fineweb_edu_approx": 1.3755481243133545,
"eai_general_math": 0.012722549960017204,
"eai_open_web_math": 0.11511051654815674,
"eai_web_code": 0.005634009838104248
}
} | {
"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": "378.195",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Higher and Universities and colleges"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "12",
"label": "Listicle"
}
},
"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 |
6,947,443,834,073,214,000 | Lessons for Slack from an elder… Trello
Ultimately pretty minor nitpicks, but… for the record…
Stange things not explained in Slack (slack.com):
========================
1. Why is “private group” not just called a “private channel”. It is confusing to have 2 different names for the same thing (besides the privacy).
I know…. channel sounds public. Group sounds *almost* private, but needs “Private” to be clear. So I get that. This is annoying to me. I’ll get over it.
2. Why can you convert a channel to private (a private group), but not the other way around? I suspect it is because it would be awkward to change the privacy to public AFTER people have already been discussing in private, but why not explain that in the UI? The UI makes it seem like it is a technical issue, but I am sure it is just a workflow restraint they are enforcing. Which is fine, but they could be clearer about that.
3. Why when you change a channel to private do the things shared stay public? That makes no sense.
4. Why when you archive a channel (or private group), does the membership need to vanish? That is also extremely annoying. It is important information to know who is/was in a group.
UI says:
“Archive this group… If you don’t think it will be used any more and you want to clean up, archive it. The group can be unarchived later (but everyone will have been removed).”
5. Why is the UI so slow on the website? That is kinda a game-breaker.
Lessons for Slack from Trello
==============
1. Trello is fast
2. Trello list/board Membership maintained even when archiving
3. Can just go to trello.com, don’t have to go to [teamname].trello.com like in slack (which doesn’t know how to redirect to the subdomain where you are logged in. Annoying!)
Lessons FOR Trello from Slack
======================
1. In Slack you can see stuff in archived channels/groups pretty easily (without un-archiving them).
In Trello, the only way to see archived “lists” is to un-archive them (“Send to Board”). This is highly annoying!
Leave a comment
Filed under computers, work
Comments are closed. | {
"url": "https://ehaugsjaa.wordpress.com/2015/05/24/lessons-for-slack-from-an-elder-trello/",
"source_domain": "ehaugsjaa.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "92317",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NYPEX256MN4IQ6PZJFJHAN6KU5Y4ZHEI",
"WARC-Concurrent-To": "<urn:uuid:48bbe81c-5675-4d5c-a5b4-a398e99e8a70>",
"WARC-Date": "2020-08-04T17:21:12Z",
"WARC-IP-Address": "192.0.78.13",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HZJ6S6MHQTNMKOYVSI34MQFIYTEIO6KE",
"WARC-Record-ID": "<urn:uuid:bb311d05-35aa-4e6b-85bc-5225006ac372>",
"WARC-Target-URI": "https://ehaugsjaa.wordpress.com/2015/05/24/lessons-for-slack-from-an-elder-trello/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fe4865e0-6b74-42b2-a6ec-9383c97c0499>"
},
"warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-110.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,
40,
41,
96,
97,
147,
172,
319,
472,
473,
902,
903,
1002,
1003,
1185,
1186,
1195,
1372,
1373,
1444,
1445,
1475,
1490,
1508,
1571,
1746,
1747,
1777,
1800,
1901,
2015,
2016,
2032,
2033,
2061,
2062
],
"line_end_idx": [
40,
41,
96,
97,
147,
172,
319,
472,
473,
902,
903,
1002,
1003,
1185,
1186,
1195,
1372,
1373,
1444,
1445,
1475,
1490,
1508,
1571,
1746,
1747,
1777,
1800,
1901,
2015,
2016,
2032,
2033,
2061,
2062,
2082
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2082,
"ccnet_original_nlines": 35,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42391303181648254,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02391304075717926,
"rps_doc_frac_lines_end_with_ellipsis": 0.0277777798473835,
"rps_doc_frac_no_alph_words": 0.21521739661693573,
"rps_doc_frac_unique_words": 0.4957983195781708,
"rps_doc_mean_word_length": 4.4033613204956055,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.010869570076465607,
"rps_doc_unigram_entropy": 4.769155502319336,
"rps_doc_word_count": 357,
"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.012722649611532688,
"rps_doc_frac_chars_top_3gram": 0.019083969295024872,
"rps_doc_frac_chars_top_4gram": 0.024173030629754066,
"rps_doc_books_importance": -215.64854431152344,
"rps_doc_books_importance_length_correction": -215.64854431152344,
"rps_doc_openwebtext_importance": -110.85293579101562,
"rps_doc_openwebtext_importance_length_correction": -110.85293579101562,
"rps_doc_wikipedia_importance": -73.80670928955078,
"rps_doc_wikipedia_importance_length_correction": -73.80670928955078
},
"fasttext": {
"dclm": 0.9693103432655334,
"english": 0.9469311833381653,
"fineweb_edu_approx": 1.6505721807479858,
"eai_general_math": 0.6327719688415527,
"eai_open_web_math": 0.4097192883491516,
"eai_web_code": 0.06483995914459229
}
} | {
"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": "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": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
2,698,283,909,606,574,600 | Ruby Issue Tracking System: Issues https://bugs.ruby-lang.org/ https://bugs.ruby-lang.org/favicon.ico?1600223844 2020-09-15T20:34:44Z Ruby Issue Tracking System Redmine Ruby master - Feature #17171 (Open): Why is the visibility of constants not affected by `private`? https://bugs.ruby-lang.org/issues/17171 2020-09-15T20:34:44Z marcandre (Marc-Andre Lafortune) [email protected] <pre><code class="ruby syntaxhl"><span class="k">class</span> <span class="nc">Foo</span> <span class="k">def</span> <span class="nf">call_me</span> <span class="c1"># ...</span> <span class="k">end</span> <span class="kp">private</span> <span class="no">SOME_DATA</span> <span class="o">=</span> <span class="sx">%i[...]</span><span class="p">.</span><span class="nf">freeze</span> <span class="c1"># is public, why not private?</span> <span class="k">def</span> <span class="nf">calc_stuff</span> <span class="c1"># is private, ok.</span> <span class="c1"># ...</span> <span class="k">end</span> <span class="k">end</span> <span class="sb">```ruby It's probably a naive question, but why shouldn't `</span><span class="no">SOME_DATA</span><span class="sb">`'s visibility be private? When writing gems, more often than not the constants that I write are not meant for public consumption. I find it redundant (and tiresome) to explicitly write `</span><span class="n">private_constant</span> <span class="ss">:SOME_DATA</span><span class="sb">`. </span></code></pre> Ruby master - Misc #17154 (Open): Update Pathname Documentation to Clarify Expected Behavior https://bugs.ruby-lang.org/issues/17154 2020-09-05T02:29:29Z resperat (Ralph Esperat) <p>I would like to suggest adding a sentence to the documentation for <a href="https://ruby-doc.org/stdlib-2.7.1/libdoc/pathname/rdoc/Pathname.html" class="external">Pathname</a> to make clear the unusual behavior of <code>Pathname#+</code> when an absolute path is included in the arguments. In such a situation, <code>Pathname#+</code> drops the paths prior to the last absolute path which I understand to be the intended behavior, but it is not obviously intended, only showing up tangentially as an example in the documentation. </p> <pre>p3 = p1 + "/etc/passwd" # Pathname:/etc/passwd </pre> <p>The Pathname documentation states that " <strong>All functionality</strong> from File, FileTest, and some from Dir and FileUtils is included, <strong>in an unsurprising way</strong> ..." and later when referring to core methods such as <code>Pathname#+</code> "These methods are <strong>effectively manipulating a String</strong> , because that's all a path is." However, similar uses of both <a href="https://ruby-doc.org/core-2.7.1/File.html" class="external">File</a> and <a href="https://ruby-doc.org/core-2.7.1/String.html" class="external">String</a> would produce the expected result of including all of the arguments:</p> <pre>s1 = "/usr" s2 = s1 + "/etc/passwd" # "/usr/etc/passwd" f1 = File.new("/usr" + "/etc/passwd") # (No such file or directory @ rb_sysopen - /usr/etc/passwd) </pre> <p>A bug report was previously filed to "fix" this functionality (<a class="issue tracker-1 status-6 priority-4 priority-default closed" title="Status: Rejected" href="https://bugs.ruby-lang.org/issues/15564">Bug #15564: Pathname#+(pathpart) returns pathpart when pathpart is absolute</a>), not understanding it to be intentional. Other common help websites such as <a href="https://stackoverflow.com/questions/12464361/concatenating-absolute-paths-with-the-pathname-class" class="external">Stack Overflow</a> also show users who do not expect this behavior from this method. Adding a statement to the documentation for the <a href="https://ruby-doc.org/stdlib-2.7.1/libdoc/pathname/rdoc/Pathname.html#method-i-2B" class="external">Pathname#+</a> method will make it clear to users exactly what to expect and that this is the intended behavior. I would suggest simply the following, the first sentence of which is already present:</p> <p><code>Appends a pathname fragment to self to produce a new Pathname object. If an absolute path is provided as any of the arguments, discards all arguments prior to the last absolute path provided.</code></p> <p>I appreciate your consideration of this request.</p> <p>ruby -v: ruby 2.7.1p83 (2020-03-31 revision a0c7c23c9c) [x86_64-linux]</p> Ruby master - Bug #17124 (Open): Wrong "ambiguous first argument" warning https://bugs.ruby-lang.org/issues/17124 2020-08-18T20:02:54Z marcandre (Marc-Andre Lafortune) [email protected] <pre><code class="sh syntaxhl"><span class="nv">$ </span>ruby <span class="nt">-v</span> <span class="nt">-e</span> <span class="s2">"x='a'; x.match? /[a-z]/"</span> ruby 2.8.0dev <span class="o">(</span>2020-07-30T14:07:06Z master 352895b751<span class="o">)</span> <span class="o">[</span>x86_64-darwin18] <span class="nt">-e</span>:1: warning: ambiguous first argument<span class="p">;</span> put parentheses or a space even after <span class="sb">`</span>/<span class="s1">' operator </span></code></pre> <p>There is no <code>/</code> operator in there and there is also no ambiguity as adding a space after the first <code>/</code> is a syntax error.</p> <p>Is it possible to remove the warning altogether when the argument is lexed as a regexp?</p> <p>The message could use a rewording too, maybe "ambiguous first argument; put parentheses around argument or add a space after `/' operator"</p> Ruby master - Bug #17101 (Open): YAML.load_file: Massive slowdown under Ruby 2.7 vs. Ruby 2.4 https://bugs.ruby-lang.org/issues/17101 2020-08-03T15:19:24Z fitmap (Justin Peal) [email protected] <p>When use Ruby 2.4, the following program runs fast, After ungrade to Ruby 2.7, the same program runs very very slow. Please unzip the attach first for test.</p> <p>require 'yaml'<br> YAML.load_file('qlnv_h_h.yaml')</p> Ruby master - Feature #16975 (Open): Warn when value from environment is being ignored by `Dir.t... https://bugs.ruby-lang.org/issues/16975 2020-06-21T14:22:26Z deivid (David Rodríguez) <p>Currently, if you set <code>ENV["TMPDIR"]</code> to a value that doesn't meet <code>Dir.tmpdir</code> criteria to become the temporary folder, the environment variable is silently ignored and the next variable in the chain is checked.</p> <p>This makes issues quite hard to debug, because the temporary folder can get silently set to a value you don't expect.</p> <p>An example of this is: <a href="https://github.com/rubygems/rubygems/issues/3649">https://github.com/rubygems/rubygems/issues/3649</a>.</p> <p>And I believe some failures I run into in <a href="https://github.com/ruby/ruby/pull/3211">https://github.com/ruby/ruby/pull/3211</a> were caused by the same issue.</p> <p>Would it be useful to replace the following "silent rescue" to introduce a warning when it's hit?</p> <p><a href="https://github.com/ruby/tmpdir/blob/b08fec48d5cef93ea3dbaa604c9e0b833f086dae/lib/tmpdir.rb#L30">https://github.com/ruby/tmpdir/blob/b08fec48d5cef93ea3dbaa604c9e0b833f086dae/lib/tmpdir.rb#L30</a></p> <p>I'm happy to create a PR if this is accepted.</p> Ruby master - Feature #16971 (Open): weak_ref&.some_method should behave like object&.some_method https://bugs.ruby-lang.org/issues/16971 2020-06-19T15:07:55Z kwerle (Kurt Werle) [email protected] <p>The following patterns mean basically the same thing and should behave the same:</p> <pre><code class="ruby syntaxhl"><span class="n">weak_ref</span> <span class="o">=</span> <span class="no">WeakRef</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="n">some_object</span><span class="p">)</span> <span class="o">...</span> <span class="n">weak_ref</span><span class="p">.</span><span class="nf">some_method</span> <span class="k">if</span> <span class="n">weak_ref</span><span class="p">.</span><span class="nf">weakref_alive?</span><span class="p">()</span> <span class="n">some_object</span><span class="p">.</span><span class="nf">some_method</span> <span class="k">if</span> <span class="n">some_object</span><span class="p">.</span><span class="nf">present?</span> </code></pre> <p>The some_object predicate got cleaned up by using &.some_method. It would be super clean if WeakRef did the same.</p> <pre><code class="ruby syntaxhl"><span class="n">weak_ref</span> <span class="o">=</span> <span class="no">WeakRef</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="n">some_object</span><span class="p">)</span> <span class="o">...</span> <span class="n">weak_ref</span><span class="o">&</span><span class="p">.</span><span class="nf">some_method</span> <span class="c1"># should not raise WeakRef::RefError</span> </code></pre> Ruby master - Bug #16959 (Open): Weakmap has specs and third-party usage despite being a private API https://bugs.ruby-lang.org/issues/16959 2020-06-12T22:09:15Z headius (Charles Nutter) [email protected] <p>Weakmap is still described as an internal API, and the documentation points users at WeakRef as the official public API:</p> <p><a href="https://github.com/ruby/ruby/blob/1fb16dbb6e28b9f32f92554d29e646e088b21a98/gc.c#L11928-L11936">https://github.com/ruby/ruby/blob/1fb16dbb6e28b9f32f92554d29e646e088b21a98/gc.c#L11928-L11936</a></p> <p>However there are now specs for its current set of features, even though those features have never been discussed or approved as a public API:</p> <p><a href="https://github.com/ruby/spec/tree/dd8437628a6f2de5b74b338d4960682bb1590a60/core/objectspace/weakmap">https://github.com/ruby/spec/tree/dd8437628a6f2de5b74b338d4960682bb1590a60/core/objectspace/weakmap</a></p> <p>And we are starting to see it being used by the community:</p> <ul> <li><a href="https://github.com/jruby/jruby/issues/6267">https://github.com/jruby/jruby/issues/6267</a></li> <li><a href="https://github.com/rsim/oracle-enhanced/issues/2027">https://github.com/rsim/oracle-enhanced/issues/2027</a> </li> <li><a href="https://github.com/rails/rails/pull/39121">https://github.com/rails/rails/pull/39121</a></li> </ul> <p>One of two things needs to happen:</p> <ul> <li>Weakmap is made a public API after some discussion. It would be an official public feature only in 2.8/3.0 or higher.</li> <li><del>The specs are be removed and Weakmap remains a private API not to be used by the community. I suspect the addition of the specs led to folks starting to use this private API.</del></li> </ul> <p>(edit: The Rails PR was merged after the specs, but the change is actually a year old, as mentioned below. In any case there's plenty of in-the-wild uses of WeakMap that go back even further.)</p> <p>Personally, I'm in much more in favor of making WeakRef support all the features necessary to implement Weakmap in pure Ruby, rather than the other way around:</p> <p><a href="https://bugs.ruby-lang.org/issues/6309">https://bugs.ruby-lang.org/issues/6309</a></p> <p>But whatever happens it needs to happen soon, since this use case is now a merged feature in Rails master.</p> Ruby master - Bug #16953 (Open): Windows bash bin files removed in master https://bugs.ruby-lang.org/issues/16953 2020-06-11T18:36:28Z MSP-Greg (Greg L) <p>Master is not creating bash bin files for Windows builds, only files with extensions cmd or bat.</p> <p>Although running Ruby from a bash shell in Windows is probably uncommon, some repo's CI can only be run from a bash shell. A good example is Bundler. With a correctly setup bash shell, it passes with Ruby 2.4 thru master. See <a href="https://github.com/MSP-Greg/rubygems/actions/runs/131762536">https://github.com/MSP-Greg/rubygems/actions/runs/131762536</a></p> <p>At present, I'm adding the files to ruby-loco's mingw & mswin builds (and also changing <code>#!/usr/bin/env ruby</code> to <code>#! ruby</code>), but having them installed natively would be helpful.</p> Ruby master - Misc #16911 (Open): Travis: unstable non-x86_64 jobs https://bugs.ruby-lang.org/issues/16911 2020-05-25T12:01:52Z jaruga (Jun Aruga) <p>I would like to open this ticket to track and fix the issues for Travis non-x86_64 jobs, as I saw the following commits now.</p> <p>Travis s390x-linux is too unstable<br> <a href="https://github.com/ruby/ruby/commit/f72bec2cea313f7a72a6f907f3dd64f766e917f6">https://github.com/ruby/ruby/commit/f72bec2cea313f7a72a6f907f3dd64f766e917f6</a></p> <blockquote> <p>It has caused errors by ENOSPC like<br> <a href="https://travis-ci.org/github/ruby/ruby/jobs/682520961">https://travis-ci.org/github/ruby/ruby/jobs/682520961</a> too often.</p> <p>I cleared all cache of Travis yesterday, but it didn't help it. Until<br> somebody figures out how to fix it, let me exclude it from CI status<br> reports to avoid false alerts.</p> </blockquote> <p>Sorry not to response about the issue soon.<br> It seems the Travis non-x86_64 common issue is reported on the following Travis issue ticket.<br> And I will am asking it to fix the issue on the ticket now.</p> <p>S390x Adding APT Sources - No usable temporary directory found - /tmp ENOSPC<br> <a href="https://travis-ci.community/t/8635">https://travis-ci.community/t/8635</a></p> <blockquote> <p>The “No space left on device” resp. “Disk quota exceeded” affects all the non-intel platforms (arm64, s390x, ppc64le), presumably because they share some common infrastructure code and hence also the bugs in that. </p> </blockquote> Ruby master - Bug #16889 (Open): TracePoint.enable { ... } also activates the TracePoint for othe... https://bugs.ruby-lang.org/issues/16889 2020-05-14T13:37:01Z Eregon (Benoit Daloze) <pre><code class="ruby syntaxhl"><span class="n">threads</span> <span class="o">=</span> <span class="p">[]</span> <span class="n">inspects</span> <span class="o">=</span> <span class="p">[]</span> <span class="n">trace</span> <span class="o">=</span> <span class="no">TracePoint</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="ss">:line</span><span class="p">)</span> <span class="k">do</span> <span class="o">|</span><span class="n">tp</span><span class="o">|</span> <span class="n">threads</span> <span class="o"><<</span> <span class="no">Thread</span><span class="p">.</span><span class="nf">current</span> <span class="n">inspects</span> <span class="o"><<</span> <span class="n">tp</span><span class="p">.</span><span class="nf">inspect</span> <span class="k">end</span> <span class="n">done</span> <span class="o">=</span> <span class="kp">false</span> <span class="n">thread</span> <span class="o">=</span> <span class="no">Thread</span><span class="p">.</span><span class="nf">new</span> <span class="k">do</span> <span class="no">Thread</span><span class="p">.</span><span class="nf">pass</span> <span class="k">until</span> <span class="n">done</span> <span class="k">end</span> <span class="n">trace</span><span class="p">.</span><span class="nf">enable</span> <span class="k">do</span> <span class="n">line_event</span> <span class="o">=</span> <span class="kp">true</span> <span class="n">done</span> <span class="o">=</span> <span class="kp">true</span> <span class="nb">sleep</span> <span class="mi">1</span> <span class="k">end</span> <span class="n">thread</span><span class="p">.</span><span class="nf">join</span> <span class="c1"># Expected only within enable block (lines 14-16)</span> <span class="nb">puts</span> <span class="n">inspects</span> <span class="c1"># Expected just 1</span> <span class="nb">p</span> <span class="n">threads</span><span class="p">.</span><span class="nf">uniq</span> </code></pre> <p>Results in:</p> <pre>$ ruby tpbug.rb ruby tpbug.rb #<TracePoint:[email protected]:14> #<TracePoint:[email protected]:15> #<TracePoint:[email protected]:16> #<TracePoint:[email protected]:10> [#<Thread:0x00005571134e3340 run>, #<Thread:[email protected]:9 dead>] </pre> <p>But I expected:</p> <pre>#<TracePoint:[email protected]:14> #<TracePoint:[email protected]:15> #<TracePoint:[email protected]:16> [#<Thread:0x00005571134e3340 run>] </pre> <p>Because the RDoc says:</p> <pre>If a block is given, the trace will only be enabled within the scope of the block. </pre> <p>For background I'm trying to improve the TracePoint specs in ruby/spec, but they are proving quite unreliable due to this.</p> <p><a class="user active" href="https://bugs.ruby-lang.org/users/17">ko1 (Koichi Sasada)</a> Thoughts?</p> Ruby master - Feature #16755 (Open): warning: `if' at the end of line without an expression https://bugs.ruby-lang.org/issues/16755 2020-04-03T14:47:11Z mpapis (Michal Papis) [email protected] <p>I'm using this notation in a lot of scripts:</p> <pre><code class="ruby syntaxhl"><span class="k">if</span> <span class="kp">true</span> <span class="k">then</span> <span class="nb">puts</span> <span class="ss">:a</span> <span class="k">else</span> <span class="nb">puts</span> <span class="ss">:b</span> <span class="k">end</span> </code></pre> <p>Using ruby 2.6.5 I'm getting expected response:</p> <pre><code class="shell syntaxhl"><span class="o">(</span>0<span class="o">)</span> 2.6.5 mpapis@mpapis-linux:~/tmp>ruby <span class="nt">-w</span> test.rb a </code></pre> <p>Using ruby 2.7.1 I'm getting extra warning:</p> <pre><code class="shell syntaxhl"><span class="o">(</span>0<span class="o">)</span> 2.7.1 mpapis@mpapis-linux:~/tmp>ruby <span class="nt">-w</span> test.rb test.rb:1: warning: <span class="sb">`</span><span class="k">if</span><span class="s1">' at the end of line without an expression a </span></code></pre> <p>I've tracked it to the following git commits:</p> <ul> <li>ba35c14325ebbf1da8f200df83c45ee9937ff8a1</li> <li>c303854e134043d905baff2385add44cc2c28756</li> <li>26316cc350109ba71d42f944f3b976985627c042</li> <li>e91e3274bebc803b97971ad0a6f4ee3a8c646a60</li> <li>a087e027bf7cf0fbb825f1d55668f85ab1f3c9e6</li> <li>30a74aaef00a99364f5423439ac44babf5066dc0</li> </ul> Ruby master - Feature #16684 (Open): Use the word "to" instead of "from" in backtrace https://bugs.ruby-lang.org/issues/16684 2020-03-10T16:00:53Z sawa (Tsuyoshi Sawada) <p>The most-recent-call-last order of backtrace introduced by <a class="issue tracker-2 status-5 priority-4 priority-default closed" title="Feature: Add option to print backtrace in reverse order (stack frames first and error last) (Closed)" href="https://bugs.ruby-lang.org/issues/8661">#8661</a>:</p> <pre><code class="ruby syntaxhl"><span class="k">def</span> <span class="nf">a</span><span class="p">;</span> <span class="k">raise</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">b</span><span class="p">;</span> <span class="n">a</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">c</span><span class="p">;</span> <span class="n">b</span> <span class="k">end</span> <span class="n">c</span> </code></pre> <p><strong>Current</strong></p> <pre>Traceback (most recent call last): 3: from foo.rb:4:in `<main>' 2: from foo.rb:3:in `c' 1: from foo.rb:2:in `b' foo.rb:1:in `a': unhandled exception </pre> <p>is intuitive to me, and I hope it is retained. However, there are people complaining that it is confusing. I believe the unnaturalness is (at least partly) due to the fact that the word "from" is used, which made sense when backtrace was displayed in most-recent-call-first order,</p> <pre>foo.rb:1:in `a': unhandled exception 1: from foo.rb:2:in `b' 2: from foo.rb:3:in `c' 3: from foo.rb:4:in `<main>' </pre> <p>but not any more. Here, my understanding is that "from" means that the previous line was called <strong>from</strong> that line.</p> <p>I propose that, so long as the most-recent-call-last order is adopted, the word "to" should be used rather than "from", which would mean that the previous line leads <strong>to</strong> that line:</p> <p><strong>Proposed 1</strong></p> <pre>Traceback (most recent call last): 3: to foo.rb:4:in `<main>' 2: to foo.rb:3:in `c' 1: to foo.rb:2:in `b' foo.rb:1:in `a': unhandled exception </pre> <p>Or, as an alternative, if it looks unnatural to have "to" in the first line, and to lack one before the message line, we may put it at the end of a line:</p> <p><strong>Proposed 2</strong></p> <pre>Traceback (most recent call last) 3: foo.rb:4:in `<main>' to: 2: foo.rb:3:in `c' to: 1: foo.rb:2:in `b' to: foo.rb:1:in `a': unhandled exception </pre> <p>By using different words, it would become easier to understand the display order at a glance, and even by just looking at a single line.</p> Ruby master - Feature #16673 (Open): total_timeout for Net::HTTP https://bugs.ruby-lang.org/issues/16673 2020-03-05T00:16:59Z mohamedhafez (Mohamed Hafez) <p><code>Net::HTTP</code> allows setting <code>open_timeout</code> and <code>read_timeout</code>, but sometimes I just want to make sure an API call will finish within a set amount of time, and am not concerned with how long opening the connection takes and reading the connection takes individually, as long as the total is beneath a certain amount. Yes, one could set <code>open_timeout</code> + <code>read_timeout</code> to be equal to the maximum time they are willing to wait, but then for example if opening the socket happens almost immediately, I may get a read timeout when I am still willing to wait a bit longer (this is the case for the service I run, where we hit an external API that occasionally takes 60s to respond, and am trying to catch some of those longer running requests. it also occasionally takes over 5 seconds to open a connection, so I can't make open_timeout minimal either). In other languages, setting a total timeout is possible, like for example Java's <code>HttpRequest</code>.</p> <p>My intern <a class="user active" href="https://bugs.ruby-lang.org/users/35721">LevonAr (Levon Arabyan )</a> is willing to work on this, and put in a <code>total_timeout</code> option in a way that doesn't interfere with the current functioning of open_timeout and read_timeout. Would a patch to put in this feature be accepted?</p> Ruby master - Bug #16623 (Open): Windows ENV encoding https://bugs.ruby-lang.org/issues/16623 2020-02-10T23:39:52Z MSP-Greg (Greg L) <p>Actions has some issues with Windows CI, most related to the console encoding. I thought I'd start with the spec tests and see what was failing.</p> <p>On a standard Windows 10 desktop, console encoding is IBM437. ENV.keys and ENV.values are all encoded IBM437.</p> <p>When the console is switched to UTF-8, ENV.keys and ENV.values are all encoded ASCII-8BIT.</p> <p>I verified this using both cmd and PowerShell consoles, using both mingw and mswin builds.</p> <p>On cmd console, <code>chcp</code> changes Ruby's external & locale encodings, the PowerShell command that mimics it is <code>[Console]::InputEncoding</code>.</p> Ruby master - Misc #16507 (Open): =~ vs include? or match? https://bugs.ruby-lang.org/issues/16507 2020-01-12T23:27:07Z MSP-Greg (Greg L) <p>While working on getting the mswin build working on Actions, I thought adding mswin? and ci? methods to Minitest::Unit::Guard in tool/lib/minitest/unit.rb would be helpful.</p> <p>Currently some tests are failing that are guarded/skipped based on ENV['APPVEYOR']. For ci?, I'd combine Travis, AppVeyor, & Actions.</p> <p>There are quite a few instances where =~ is used for a boolean return. Would it be considered appropriate to replace those calls with include? or match? </p> Ruby master - Feature #16471 (Open): Two feature requests for WeakRef: get original object, callb... https://bugs.ruby-lang.org/issues/16471 2020-01-01T19:16:52Z Snappingturtle (Mike O'Sullivan) <p>I'd like to request two features for <code>WeakRef</code>. I'll explain what I want, then provide a real world use case.</p> <p>First, add the ability to pull the original object out of the <code>WeakRef</code> object, something like this:</p> <pre><code class="ruby syntaxhl"><span class="n">myhash</span> <span class="o">=</span> <span class="p">{}</span> <span class="n">myhash</span> <span class="o">=</span> <span class="no">WeakRef</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="n">myhash</span><span class="p">)</span> <span class="n">myhash</span> <span class="o">=</span> <span class="n">myhash</span><span class="p">.</span><span class="nf">original_object</span><span class="p">()</span> </code></pre> <p>Second, add a callback feature for when a WeakRef's object is being purged by GC. It would work something like this:</p> <pre><code class="ruby syntaxhl"><span class="n">wr</span> <span class="o">=</span> <span class="no">WeakRef</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="n">myobject</span><span class="p">)</span> <span class="n">wr</span><span class="p">.</span><span class="nf">on_garbage</span><span class="p">()</span> <span class="k">do</span> <span class="o">|</span><span class="n">wr</span><span class="o">|</span> <span class="nb">puts</span> <span class="s1">'trashing'</span> <span class="k">end</span> <span class="c1"># time goes by...</span> <span class="c1"># myobject goes out of scope</span> <span class="c1"># outputs "trashing"</span> </code></pre> <p>Here's the specific use case I would want it for. I'm developing a database system which includes a class called <code>Node</code>. A <code>Node</code> object holds a reference to a database handle and the primary key of a record in that database. It also has methods for getting and setting values in that record. So a simplified version looks something like this:</p> <pre><code class="ruby syntaxhl"><span class="k">class</span> <span class="nc">Node</span> <span class="nb">attr_reader</span> <span class="ss">:dbh</span> <span class="nb">attr_reader</span> <span class="ss">:pk</span> <span class="k">def</span> <span class="nf">initialize</span><span class="p">(</span><span class="n">dbh</span><span class="p">,</span> <span class="n">pk</span><span class="p">)</span> <span class="vi">@dbh</span> <span class="o">=</span> <span class="n">dbh</span> <span class="vi">@pk</span> <span class="o">=</span> <span class="n">pk</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">set</span><span class="p">(</span><span class="n">fieldname</span><span class="p">,</span> <span class="n">value</span><span class="p">)</span> <span class="c1"># a bunch of SQL to set the value</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">get</span><span class="p">(</span><span class="n">fieldname</span><span class="p">)</span> <span class="c1"># a bunch of SQL to get the value</span> <span class="k">end</span> <span class="k">end</span> <span class="n">node</span> <span class="o">=</span> <span class="no">Node</span><span class="p">.</span><span class="nf">new</span> <span class="n">dbh</span><span class="p">,</span> <span class="s1">'abc'</span> <span class="n">node</span><span class="p">.</span><span class="nf">set</span> <span class="s1">'name'</span><span class="p">,</span> <span class="s1">'Fred'</span> </code></pre> <p>The database object will have a node method, so you would usually get nodes like this:</p> <pre><code class="ruby syntaxhl"><span class="n">node</span> <span class="o">=</span> <span class="n">dbh</span><span class="p">.</span><span class="nf">node</span><span class="p">(</span><span class="s1">'abc'</span><span class="p">)</span> </code></pre> <p>Make sense so far? It's a pretty simple concept. It works, but I'd like to make a small improvement. (Whether or not it's actually an improvement is a judgement call... I expect some disagreement on this point. But work with me here.)</p> <p>I'd like the database object to keep a cache of <code>Node</code> objects. However, the database doesn't keep those node objects alive: they can fall out of scope and get purged by the GC. However, if that cache is never purged of dead objects, it just grows bigger and bigger. I could occasionally just run a routine to work through the cache and purge dead references, but that seems very inefficient. It would be better to just have them purged as they die.</p> <p>So I could implement it something like this:</p> <pre><code class="ruby syntaxhl"><span class="k">class</span> <span class="nc">DataBase</span> <span class="nb">attr_reader</span> <span class="ss">:cache</span> <span class="k">def</span> <span class="nf">initialize</span> <span class="vi">@cache</span> <span class="o">=</span> <span class="p">{}</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">node</span><span class="p">(</span><span class="n">pk</span><span class="p">)</span> <span class="k">if</span> <span class="vi">@cache</span><span class="p">[</span><span class="n">pk</span><span class="p">]</span> <span class="c1"># Here's where we need to get at the original object</span> <span class="k">return</span> <span class="vi">@cache</span><span class="p">[</span><span class="n">pk</span><span class="p">].</span><span class="nf">original_object</span> <span class="k">else</span> <span class="n">new_node</span> <span class="o">=</span> <span class="no">Node</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="nb">self</span><span class="p">,</span> <span class="n">pk</span><span class="p">)</span> <span class="vi">@cache</span><span class="p">[</span><span class="n">pk</span><span class="p">]</span> <span class="o">=</span> <span class="no">WeakRef</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="n">new_node</span><span class="p">)</span> <span class="c1"># Here's where we set the callback</span> <span class="vi">@cache</span><span class="p">[</span><span class="n">pk</span><span class="p">].</span><span class="nf">on_garbage</span> <span class="k">do</span> <span class="o">|</span><span class="n">wr</span><span class="o">|</span> <span class="n">wr</span><span class="p">.</span><span class="nf">db</span><span class="p">.</span><span class="nf">cache</span><span class="p">.</span><span class="nf">delete</span> <span class="n">wr</span><span class="p">.</span><span class="nf">pk</span> <span class="k">end</span> <span class="k">return</span> <span class="n">new_node</span> <span class="k">end</span> <span class="k">end</span> <span class="k">end</span> </code></pre> <p>So when a <code>Node</code> object is garbage collected, it's deleted from the cache. The cache stays clean of dead objects.</p> <p>I'll be interested to hear what you think of this idea and how difficult it would be to implement it.</p> Ruby master - Misc #16464 (Open): Which core objects should support deconstruct/deconstruct_keys? https://bugs.ruby-lang.org/issues/16464 2019-12-28T13:04:07Z zverok (Victor Shepelev) [email protected] <p>Now, when pattern matching is out, I believe it is worth discussing which core and standard library objects should be matchable "out of the box".</p> <p>My proposals, as of now, are:</p> <p><strong>1. <code>Object#deconstruct</code>, returning <code>[self]</code>.</strong></p> <p>Justification:</p> <pre><code class="ruby syntaxhl"><span class="c1"># this works:</span> <span class="mi">1</span> <span class="k">in</span> <span class="no">Integer</span> <span class="c1"># this works:</span> <span class="mi">1</span> <span class="k">in</span> <span class="o">..</span><span class="mi">0</span> <span class="c1"># this does NOT:</span> <span class="mi">1</span> <span class="k">in</span> <span class="no">Integer</span><span class="p">(</span><span class="o">..</span><span class="mi">0</span><span class="p">)</span> <span class="c1"># NoMatchingPatternError (1)</span> </code></pre> <p>I believe the latter example looks pretty logical (and can be used in some flexible methods like "if it is a positive integer, it is index in the array, if it is negative integer, it is backward index, and if it is float, it should be calculated as a mean of nearby elements")</p> <p><strong>2. <code>Time#deconstruct_keys</code></strong></p> <p>Justification is obvious:</p> <pre><code class="ruby syntaxhl"><span class="k">case</span> <span class="n">created_at</span> <span class="k">when</span> <span class="ss">year: </span><span class="mi">2019</span><span class="p">,</span> <span class="ss">month: </span><span class="mi">11</span><span class="o">..</span><span class="mi">12</span> <span class="o">=></span> <span class="n">m</span><span class="p">,</span> <span class="ss">day: </span><span class="nb">p</span> <span class="s2">"Created at </span><span class="si">#{</span><span class="n">day</span><span class="si">}</span><span class="s2">.</span><span class="si">#{</span><span class="n">m</span><span class="si">}</span><span class="s2"> this year"</span> <span class="k">else</span> <span class="c1"># ...</span> <span class="k">end</span> </code></pre> <p>(Probably the same for <code>Date</code> and <code>DateTime</code>)</p> <p><strong>3. <code>Set#deconstruct</code></strong></p> <p>Seems "logical" as set is a sequence, but I can't think of a good realistic example :)</p> Ruby master - Misc #16396 (Open): What is the reason for this behaviour of Find.find? https://bugs.ruby-lang.org/issues/16396 2019-12-03T13:03:26Z stiuna (Juan Gregorio) [email protected] <p>When I have a script at <code>D:\Downloads\Ruby 2.5.3\rbL\comp\codeShort.rb</code> with few other files in the same folder, the following searches only the folder where the <code>.rb</code> script is located:</p> <pre><code class="ruby syntaxhl"><span class="no">Find</span><span class="p">.</span><span class="nf">find</span><span class="p">(</span><span class="s1">'D:'</span><span class="p">)</span> </code></pre> <p>When I have a script at <code>D:\Downloads\Ruby 2.5.3\rbL\codeShort.rb</code> with many other files in the same folder, the same code as above searches the entire disk D.</p> <p>To search the entire disk D in the first case, I did this:</p> <pre><code class="ruby syntaxhl"><span class="no">Find</span><span class="p">.</span><span class="nf">find</span><span class="p">(</span><span class="s1">'D:/'</span><span class="p">)</span> </code></pre> <p>But I don't understand why the two cases behave differently with the same instruction just because they script are in different directories.</p> Ruby master - Bug #16383 (Open): TracePoint does not report calls to attribute reader methods https://bugs.ruby-lang.org/issues/16383 2019-11-30T03:17:18Z AndyMaleh (Andy Maleh) <p>TracePoint does not report calls to attribute reader methods (e.g. methods defined using <code>attr_accessor</code> or <code>attr_reader</code>.)</p> <p><strong>Code sample to demonstrate:</strong></p> <pre><code class="ruby syntaxhl"><span class="k">class</span> <span class="nc">Person</span> <span class="nb">attr_accessor</span> <span class="ss">:first_name</span> <span class="nb">attr_accessor</span> <span class="ss">:last_name</span> <span class="k">def</span> <span class="nf">name</span> <span class="s2">"</span><span class="si">#{</span><span class="nb">self</span><span class="p">.</span><span class="nf">last_name</span><span class="si">}</span><span class="s2">, </span><span class="si">#{</span><span class="nb">self</span><span class="p">.</span><span class="nf">first_name</span><span class="si">}</span><span class="s2">"</span> <span class="k">end</span> <span class="k">end</span> <span class="n">person</span> <span class="o">=</span> <span class="no">Person</span><span class="p">.</span><span class="nf">new</span> <span class="n">person</span><span class="p">.</span><span class="nf">first_name</span> <span class="o">=</span> <span class="s1">'Josh'</span> <span class="n">person</span><span class="p">.</span><span class="nf">last_name</span> <span class="o">=</span> <span class="s1">'McGibbon'</span> <span class="n">trace</span> <span class="o">=</span> <span class="no">TracePoint</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="ss">:call</span><span class="p">)</span> <span class="k">do</span> <span class="o">|</span><span class="n">tp</span><span class="o">|</span> <span class="nb">p</span> <span class="p">[</span><span class="n">tp</span><span class="p">.</span><span class="nf">path</span><span class="p">,</span> <span class="n">tp</span><span class="p">.</span><span class="nf">lineno</span><span class="p">,</span> <span class="n">tp</span><span class="p">.</span><span class="nf">defined_class</span><span class="p">,</span> <span class="n">tp</span><span class="p">.</span><span class="nf">event</span><span class="p">,</span> <span class="n">tp</span><span class="p">.</span><span class="nf">method_id</span><span class="p">]</span> <span class="k">end</span> <span class="n">trace</span><span class="p">.</span><span class="nf">enable</span> <span class="n">person</span><span class="p">.</span><span class="nf">name</span> <span class="n">trace</span><span class="p">.</span><span class="nf">disable</span> <span class="k">class</span> <span class="nc">Person</span> <span class="nb">attr_writer</span> <span class="ss">:first_name</span> <span class="nb">attr_writer</span> <span class="ss">:last_name</span> <span class="k">def</span> <span class="nf">name</span> <span class="s2">"</span><span class="si">#{</span><span class="nb">self</span><span class="p">.</span><span class="nf">last_name</span><span class="si">}</span><span class="s2">, </span><span class="si">#{</span><span class="nb">self</span><span class="p">.</span><span class="nf">first_name</span><span class="si">}</span><span class="s2">"</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">first_name</span> <span class="vi">@first_name</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">last_name</span> <span class="vi">@last_name</span> <span class="k">end</span> <span class="k">end</span> <span class="n">person</span> <span class="o">=</span> <span class="no">Person</span><span class="p">.</span><span class="nf">new</span> <span class="n">person</span><span class="p">.</span><span class="nf">first_name</span> <span class="o">=</span> <span class="s1">'Josh'</span> <span class="n">person</span><span class="p">.</span><span class="nf">last_name</span> <span class="o">=</span> <span class="s1">'McGibbon'</span> <span class="n">trace</span> <span class="o">=</span> <span class="no">TracePoint</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="ss">:call</span><span class="p">)</span> <span class="k">do</span> <span class="o">|</span><span class="n">tp</span><span class="o">|</span> <span class="nb">p</span> <span class="p">[</span><span class="n">tp</span><span class="p">.</span><span class="nf">path</span><span class="p">,</span> <span class="n">tp</span><span class="p">.</span><span class="nf">lineno</span><span class="p">,</span> <span class="n">tp</span><span class="p">.</span><span class="nf">defined_class</span><span class="p">,</span> <span class="n">tp</span><span class="p">.</span><span class="nf">event</span><span class="p">,</span> <span class="n">tp</span><span class="p">.</span><span class="nf">method_id</span><span class="p">]</span> <span class="k">end</span> <span class="n">trace</span><span class="p">.</span><span class="nf">enable</span> <span class="n">person</span><span class="p">.</span><span class="nf">name</span> <span class="n">trace</span><span class="p">.</span><span class="nf">disable</span> </code></pre> <p><strong>Output:</strong></p> <pre>["trace_point_issue.rb", 4, Person, :call, :name] ["trace_point_issue.rb", 22, Person, :call, :name] ["trace_point_issue.rb", 28, Person, :call, :last_name] ["trace_point_issue.rb", 25, Person, :call, :first_name] </pre> <p>Please note how <code>:last_name</code> and <code>:first_name</code> show up only the second time <code>Person#name</code> is called. In other words, they show up when defined as actual methods using <code>def</code> keyword, but not when defined via <code>attr_accessor</code>.</p> <p><strong>Expected Output:</strong></p> <pre>["trace_point_issue.rb", 22, Person, :call, :name] ["trace_point_issue.rb", 28, Person, :call, :last_name] ["trace_point_issue.rb", 25, Person, :call, :first_name] ["trace_point_issue.rb", 22, Person, :call, :name] ["trace_point_issue.rb", 28, Person, :call, :last_name] ["trace_point_issue.rb", 25, Person, :call, :first_name] </pre> <p>Your help in fixing or explaining this issue is greatly appreciated.</p> <p>My goal is to monitor all method calls when invoking a certain method (Person#name in this case) in order to attach observers to them dynamically for desktop UI data-binding use in my open-source project Glimmer: <a href="https://github.com/AndyObtiva/glimmer">https://github.com/AndyObtiva/glimmer</a></p> <p>Cheers,</p> <p>Andy Maleh</p> Ruby master - Bug #16334 (Open): Wrong line numbers for multiline method chains https://bugs.ruby-lang.org/issues/16334 2019-11-08T15:15:45Z ViugiNick (Nickolay Viuginov) <p>I faced a strange distribution of line numbers in bytecode for multiline expressions like this:</p> <pre>class Test def method1 self end def method2 self end def method3 true end end def hello Test.new #bp here .method1 #bp here .method2 #bp here .method3 #bp here end </pre> <p>2.3.7 bytecode:</p> <pre>== disasm: #<ISeq:hello@/home/viuignick/.RubyMine2019.2/config/scratches/scratch.rb> 0000 trace 8 ( 14) 0002 trace 1 ( 18) 0004 getinlinecache 11, <is:0> ( 15) 0007 getconstant :Test 0009 setinlinecache <is:0> 0011 opt_send_without_block <callinfo!mid:new, argc:0, ARGS_SIMPLE>, <callcache>( 16) 0014 opt_send_without_block <callinfo!mid:method1, argc:0, ARGS_SIMPLE>, <callcache>( 17) 0017 opt_send_without_block <callinfo!mid:method2, argc:0, ARGS_SIMPLE>, <callcache>( 18) 0020 opt_send_without_block <callinfo!mid:method3, argc:0, ARGS_SIMPLE>, <callcache> 0023 trace 16 ( 19) 0025 leave ( 18) </pre> <p>As you can see there is no trace line-event instuction for line №15, because of that debuggers will not stop there. Furthermore call of the method <code>new</code> is on the line #16(actually 15), method method1 is on the line 17(actually 16), method2 is on the line 18 (actually 19)</p> <p>2.5.4 bytecode</p> <pre>0000 getinlinecache 7, <is:0> ( 15)[LiCa] 0003 getconstant :Test 0005 setinlinecache <is:0> 0007 opt_send_without_block <callinfo!mid:new, argc:0, ARGS_SIMPLE>, <callcache>( 16) 0010 opt_send_without_block <callinfo!mid:method1, argc:0, ARGS_SIMPLE>, <callcache>( 17) 0013 opt_send_without_block <callinfo!mid:method2, argc:0, ARGS_SIMPLE>, <callcache>( 18) 0016 opt_send_without_block <callinfo!mid:method3, argc:0, ARGS_SIMPLE>, <callcache> 0019 leave ( 19)[Re] </pre> <p>The same situation to 2.5.*</p> <p>for ruby versions > 2.5.0 work fine:</p> <pre>== disasm: #<ISeq:hello@/home/viuignick/.RubyMine2019.2/config/scratches/scratch.rb:14 (14,0)-(19,3)> (catch: FALSE) 0000 opt_getinlinecache 7, <is:0> ( 15)[LiCa] 0003 getconstant :Test 0005 opt_setinlinecache <is:0> 0007 opt_send_without_block <callinfo!mid:new, argc:0, ARGS_SIMPLE>, <callcache> 0010 opt_send_without_block <callinfo!mid:method1, argc:0, ARGS_SIMPLE>, <callcache>( 16) 0013 opt_send_without_block <callinfo!mid:method2, argc:0, ARGS_SIMPLE>, <callcache>( 17) 0016 opt_send_without_block <callinfo!mid:method3, argc:0, ARGS_SIMPLE>, <callcache>( 18) 0019 leave ( 19)[Re] </pre> Ruby master - Bug #16277 (Open): UNIXServer#listen fails with Errno::EADDRINUSE error under Windo... https://bugs.ruby-lang.org/issues/16277 2019-10-23T20:20:26Z bradland (Brad Landers) [email protected] <p>When running the following script under Windows 10 / WSL Ubuntu 18.04, an Errno::EADDRINUSE error is thrown. Expected result is that the script would run and simply exit.</p> <pre><code class="ruby syntaxhl"><span class="c1">#!/usr/bin/env ruby</span> <span class="c1"># This script establishes a UNIX server socket.</span> <span class="c1"># </span> <span class="c1"># Expected result: Script should run and immediately exit.</span> <span class="c1"># </span> <span class="c1"># Actual result: Script fails with Errno::EADDRINUSE error.</span> <span class="c1"># </span> <span class="c1"># Environment: Windows 10 Pro, WSL, Ubuntu 18.04.2, ruby 2.6.5p114 (2019-10-01 revision 67812) [x86_64-linux-gnu]</span> <span class="c1"># </span> <span class="c1"># To reproduce: Create a tmp folder, copy this script there, and execute.</span> <span class="nb">require</span> <span class="s1">'socket'</span> <span class="n">path</span> <span class="o">=</span> <span class="no">File</span><span class="p">.</span><span class="nf">expand_path</span><span class="p">(</span><span class="s1">'listen.sock'</span><span class="p">)</span> <span class="n">backlog</span> <span class="o">=</span> <span class="mi">5</span> <span class="n">s</span> <span class="o">=</span> <span class="no">UNIXServer</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="n">path</span><span class="p">)</span> <span class="k">if</span> <span class="n">backlog</span> <span class="n">s</span><span class="p">.</span><span class="nf">listen</span> <span class="n">backlog</span> <span class="k">else</span> <span class="n">s</span><span class="p">.</span><span class="nf">listen</span> <span class="k">end</span> <span class="no">File</span><span class="p">.</span><span class="nf">delete</span><span class="p">(</span><span class="n">path</span><span class="p">)</span> <span class="k">if</span> <span class="no">File</span><span class="p">.</span><span class="nf">exists?</span><span class="p">(</span><span class="n">path</span><span class="p">)</span> </code></pre> <p>The bug was discoverd as part of Puma (gem) issue #1521: <a href="https://github.com/puma/puma/issues/1521">https://github.com/puma/puma/issues/1521</a>.</p> Ruby master - Feature #16233 (Open): winruby UTF8 Fallback for no CodePage https://bugs.ruby-lang.org/issues/16233 2019-10-03T07:29:36Z gabuscus (Gabriel Nagy) <p>This is to deal specifically with setting the Region to Arabic which<br> sets the codepage to 720. This codepage isn't recognised by Ruby which<br> causes it to fail during initialisation when setting up LOCALE.</p> <p>This patch to Ruby is necessary to handle languages/regions on windows<br> where the codepage is not supported by Ruby such as Arabic which uses <br> codepage 720.<br> If the codepage is not found, the Locale falls back to UTF8.</p> <p>This is a well known Ruby/Ruby on Rails issue which is described at<br> <a href="https://stackoverflow.com/questions/22815542/rails4-unknown-encoding-name-cp720">https://stackoverflow.com/questions/22815542/rails4-unknown-encoding-name-cp720</a></p> <p>Opened PR: <a href="https://github.com/ruby/ruby/pull/2518">https://github.com/ruby/ruby/pull/2518</a></p> Ruby master - Misc #16188 (Open): What are the performance implications of the new keyword argume... https://bugs.ruby-lang.org/issues/16188 2019-09-29T18:27:43Z Eregon (Benoit Daloze) <p>In <a class="issue tracker-2 status-5 priority-4 priority-default closed" title="Feature: "Real" keyword argument (Closed)" href="https://bugs.ruby-lang.org/issues/14183">#14183</a>, keyword arguments became further separated from positional arguments.</p> <p>Contrary to the original design though, keyword and positional arguments are not fully separated for methods not accepting keyword arguments.<br> Example: <code>foo(key: :value)</code> will <code>def foo(hash)</code> will pass a positional argument.<br> This is of course better for compatibility, but I wonder what are the performance implications.</p> <p>The block argument is completely separate in all versions, so no need to concern ourselves about that.</p> <p>In Ruby <= 2.6:</p> <ul> <li>The caller never needs to know about the callee's arguments, it can just take all arguments and pass them as an array. The last argument might be used to extract keyword, but this is all done at the callee side.</li> <li>Splitting kwargs composed of Symbol and non-Symbol keys can be fairly expensive, but it is a rare occurrence. If inlining the callee and kwargs are all passed as a literal Hash at the call site, there shouldn't be any overhead compared to positional arguments once JIT'ed.</li> </ul> <p>In Ruby 2.7:</p> <ul> <li>The caller needs to pass positional and keyword arguments separately, at least when calling a method accepting kwargs. But, if it calls a methods not accepting kwargs, then the "kwargs" (e.g. <code>foo(key: :value)</code>) should be treated just like a final Hash positional argument.</li> <li>(If we had complete separation, then we could always pass positional and keyword arguments separately, so the caller could once again ignore the callee)</li> </ul> <p>How is the logic implemented in MRI for 2.7?</p> <p>Specializing the caller for a given callee is a well-known technique.<br> However, it becomes more difficult if different methods are called from the same callsite (polymorphic call), especially if one accepts kwargs and another does not.<br> In that case, I think we will see a performance cost to this approach, by having to pass arguments differently based on the method to be called.</p> <p>What about delegation using <code>ruby2_keywords</code>?<br> Which checks does that add (compared to 2.6) in the merged approach with the Hash flag?</p> Ruby master - Misc #16157 (Open): What is the correct and *portable* way to do generic delegation? https://bugs.ruby-lang.org/issues/16157 2019-09-09T14:10:42Z Dan0042 (Daniel DeLorme) <p>With the keyword argument changes in 2.7 we must now specify keyword arguments explicitly when doing generic delegation. But this change is not compatible with 2.6, where it adds an empty hash to the argument list of methods that do not need/accept keyword arguments.</p> <p>To illustrate the problem:</p> <pre><code class="ruby syntaxhl"><span class="k">class</span> <span class="nc">ProxyWithoutKW</span> <span class="o"><</span> <span class="no">BasicObject</span> <span class="k">def</span> <span class="nf">initialize</span><span class="p">(</span><span class="n">target</span><span class="p">)</span> <span class="vi">@target</span> <span class="o">=</span> <span class="n">target</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">method_missing</span><span class="p">(</span><span class="o">*</span><span class="n">a</span><span class="p">,</span> <span class="o">&</span><span class="n">b</span><span class="p">)</span> <span class="vi">@target</span><span class="p">.</span><span class="nf">send</span><span class="p">(</span><span class="o">*</span><span class="n">a</span><span class="p">,</span> <span class="o">&</span><span class="n">b</span><span class="p">)</span> <span class="k">end</span> <span class="k">end</span> <span class="k">class</span> <span class="nc">ProxyWithKW</span> <span class="o"><</span> <span class="no">BasicObject</span> <span class="k">def</span> <span class="nf">initialize</span><span class="p">(</span><span class="n">target</span><span class="p">)</span> <span class="vi">@target</span> <span class="o">=</span> <span class="n">target</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">method_missing</span><span class="p">(</span><span class="o">*</span><span class="n">a</span><span class="p">,</span> <span class="o">**</span><span class="n">o</span><span class="p">,</span> <span class="o">&</span><span class="n">b</span><span class="p">)</span> <span class="vi">@target</span><span class="p">.</span><span class="nf">send</span><span class="p">(</span><span class="o">*</span><span class="n">a</span><span class="p">,</span> <span class="o">**</span><span class="n">o</span><span class="p">,</span> <span class="o">&</span><span class="n">b</span><span class="p">)</span> <span class="k">end</span> <span class="k">end</span> <span class="k">class</span> <span class="nc">Test</span> <span class="k">def</span> <span class="nf">args</span><span class="p">(</span><span class="o">*</span><span class="n">a</span><span class="p">)</span> <span class="n">a</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">arg</span><span class="p">(</span><span class="n">a</span><span class="p">)</span> <span class="n">a</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">opts</span><span class="p">(</span><span class="o">**</span><span class="n">o</span><span class="p">)</span> <span class="n">o</span> <span class="k">end</span> <span class="k">end</span> <span class="c1"># 2.6 2.7 3.0</span> <span class="no">ProxyWithoutKW</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="no">Test</span><span class="p">.</span><span class="nf">new</span><span class="p">).</span><span class="nf">args</span><span class="p">(</span><span class="mi">42</span><span class="p">)</span> <span class="c1"># [42] [42] [42] ok</span> <span class="no">ProxyWithoutKW</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="no">Test</span><span class="p">.</span><span class="nf">new</span><span class="p">).</span><span class="nf">arg</span><span class="p">(</span><span class="mi">42</span><span class="p">)</span> <span class="c1"># 42 42 42 ok</span> <span class="no">ProxyWithoutKW</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="no">Test</span><span class="p">.</span><span class="nf">new</span><span class="p">).</span><span class="nf">opts</span><span class="p">(</span><span class="ss">k: </span><span class="mi">42</span><span class="p">)</span> <span class="c1"># {:k=>42} {:k=>42} +warn [{:k=>42}] incompatible with >= 2.7</span> <span class="no">ProxyWithKW</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="no">Test</span><span class="p">.</span><span class="nf">new</span><span class="p">).</span><span class="nf">args</span><span class="p">(</span><span class="mi">42</span><span class="p">)</span> <span class="c1"># [42, {}] [42] [42] incompatible with <= 2.6</span> <span class="no">ProxyWithKW</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="no">Test</span><span class="p">.</span><span class="nf">new</span><span class="p">).</span><span class="nf">arg</span><span class="p">(</span><span class="mi">42</span><span class="p">)</span> <span class="c1"># error 42 42 incompatible with <= 2.6</span> <span class="no">ProxyWithKW</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="no">Test</span><span class="p">.</span><span class="nf">new</span><span class="p">).</span><span class="nf">opts</span><span class="p">(</span><span class="ss">k: </span><span class="mi">42</span><span class="p">)</span> <span class="c1"># {:k=>42} {:k=>42} +warn {:k=>42} must ignore warning? cannot use pass_positional_hash in 2.6</span> </code></pre> <p>I don't know how to solve this, so I'm asking for the <strong>official</strong> correct way to write portable delegation code. And by <strong>portable</strong> I mean code that can be used in gems that target ruby 2.6 and above.</p> Ruby master - Feature #16128 (Open): Would it be possible for ruby to warn about case/when menu o... https://bugs.ruby-lang.org/issues/16128 2019-08-25T15:52:14Z shevegen (Robert A. Heiler) [email protected] <p>I was not sure whether the following behaviour is a bug or not, so I filed this under "feature", mostly because<br> this may change existing behaviour; and even if I think the current behaviour in this context may not make a<br> lot of sense, perhaps there are caveats; or it may be too insignificant to want to change.</p> <p>Anyway, without further ado, I will next show the ruby code that can be used to reproduce the issue/behaviour<br> that I refer to:</p> <pre><code class="ruby syntaxhl"><span class="k">class</span> <span class="nc">Foo</span> <span class="k">def</span> <span class="nf">initialize</span> <span class="n">menu</span><span class="p">(</span><span class="ss">:random_colour</span><span class="p">)</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">menu</span><span class="p">(</span><span class="n">i</span><span class="p">)</span> <span class="k">case</span> <span class="n">i</span><span class="p">.</span><span class="nf">to_s</span> <span class="k">when</span> <span class="sr">/^-?-?random(-|_)?colou?r$/i</span><span class="p">,</span> <span class="sr">/rcolour$/i</span><span class="p">,</span> <span class="s1">'RCOL'</span><span class="p">,</span> <span class="n">print_foobar</span> <span class="k">end</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">print_foobar</span> <span class="nb">print</span> <span class="s1">'foobar'</span> <span class="k">end</span> <span class="k">end</span> <span class="no">Foo</span><span class="p">.</span><span class="nf">new</span> </code></pre> <p>To those who may not immediately see the problem - it is the last ',' character<br> in the case/when menu, right after the string 'RCOL'.</p> <p>The above snippet was part of a much larger class/codebase, so I narrowed it<br> down to this smaller example.</p> <p>If you run this code, you will see no output. The reason is due to the ','.</p> <p>If you remove the ',', then you get the desired output - the invocation of<br> the method called print_foobar() which will print 'foobar'.</p> <p>I discovered this strange behaviour by accident in a much larger case/when<br> menu (my case/when menu interfaces can be excessively long, I admit this).</p> <p>Sometimes I re-arrange the case menu, and then I may forget the ',' there,<br> so I paste the ',' with the line, which sometimes leads to above situation,<br> which tends to confuse me. I am quite used to this at this point, so <br> discovering the problem does not take me long - but I was wondering whether<br> this current behaviour is useful for anything?</p> <p>Because if not then perhaps there could be a warning by ruby, possibly by<br> the did-you-mean gem, or by ruby directly even without the did-you-mean<br> gem (although I think this may fit the did-you-mean gem). I have, however<br> had, decided to first report this to ruby core anyway, because perhaps I<br> am missing something obvious that may explain the behaviour. Or perhaps it<br> is difficult to distuingish what the next lines should be. But I assume<br> that the ruby parser assumes another case/when statement here, after the<br> ',', so does not treat the above as an error or problematic behaviour.</p> <p>Perhaps the above can still be reported based on additional information,<br> such as correct indent level? I indent uniformly and consistently, so<br> the above could provide additional cues what the ruby user at hand may<br> have wanted to see - as in the example above, I don't think the trailing<br> ',' is useful; it was just a typo. I am not sure how easy it is to distinguish<br> this case between cases where the user wanted to have a ','.</p> <p>I am not sure how easy it would be to change the behaviour of ruby in <br> this regard, or if it is wanted, or if it takes too much time, but I thought<br> it is better to report it anyway - others can give their opinion in this<br> case. Thanks!</p> Ruby master - Feature #15854 (Open): Tracing instance variable assignment https://bugs.ruby-lang.org/issues/15854 2019-05-16T06:34:55Z igaiga (Kuniaki IGARASHI) [email protected] <p>I suggest a feature "tracing instance variable assignment". It's useful for debugging.</p> <p>Use case:</p> <p>In Rails, we use instance variables in views and controllers. When we got a bug caused by instance variable unintentional values, if we traced instance variable assignment timing, it would be good informations.</p> <p>And in Rails views, there are no source codes of self class. That's built dynamically.</p> <p>Current behavior (Ruby2.6):</p> <p>In Ruby 2.6, only if there is a source code file to assign instance variable, we can trace instance variable assignment by following code (check_instance_variable_assignment.rb). But it's difficult if the assignment codes are defined dynamically. For example, in Rails view.</p> <p>(And in another story, global variables assignment are traced by Kernel#trace_var.)</p> <p>check_instance_variable_assignment.rb</p> <pre><code class="ruby syntaxhl"><span class="k">def</span> <span class="nf">trace_start</span> <span class="no">TracePoint</span><span class="p">.</span><span class="nf">trace</span><span class="p">(</span><span class="ss">:line</span><span class="p">)</span> <span class="k">do</span> <span class="o">|</span><span class="n">tp</span><span class="o">|</span> <span class="n">target_class_name</span> <span class="o">=</span> <span class="s2">"Foo"</span> <span class="n">target_instance_variable_name</span> <span class="o">=</span> <span class="s2">"@bar"</span> <span class="n">line</span> <span class="o">=</span> <span class="no">File</span><span class="p">.</span><span class="nf">open</span><span class="p">(</span><span class="n">tp</span><span class="p">.</span><span class="nf">path</span><span class="p">,</span> <span class="s2">"r"</span><span class="p">){</span><span class="o">|</span><span class="n">f</span><span class="o">|</span> <span class="n">f</span><span class="p">.</span><span class="nf">readlines</span><span class="p">[</span><span class="n">tp</span><span class="p">.</span><span class="nf">lineno</span> <span class="o">-</span> <span class="mi">1</span><span class="p">]</span> <span class="p">}</span> <span class="n">node</span> <span class="o">=</span> <span class="no">RubyVM</span><span class="o">::</span><span class="no">AbstractSyntaxTree</span><span class="p">.</span><span class="nf">parse</span><span class="p">(</span><span class="n">line</span><span class="p">).</span><span class="nf">children</span><span class="p">.</span><span class="nf">last</span> <span class="c1"># check instance variable assignment</span> <span class="k">next</span> <span class="k">unless</span> <span class="n">node</span><span class="p">.</span><span class="nf">type</span> <span class="o">==</span> <span class="ss">:IASGN</span> <span class="c1"># check class name</span> <span class="n">target_class</span> <span class="o">=</span> <span class="no">Kernel</span><span class="p">.</span><span class="nf">const_get</span><span class="p">(</span><span class="n">target_class_name</span><span class="p">)</span> <span class="k">next</span> <span class="k">unless</span> <span class="n">tp</span><span class="p">.</span><span class="nf">self</span><span class="p">.</span><span class="nf">is_a?</span><span class="p">(</span><span class="n">target_class</span><span class="p">)</span> <span class="c1"># check variable name</span> <span class="n">instance_variable_name</span> <span class="o">=</span> <span class="n">node</span><span class="p">.</span><span class="nf">children</span><span class="p">.</span><span class="nf">first</span> <span class="k">next</span> <span class="k">unless</span> <span class="n">instance_variable_name</span> <span class="o">==</span> <span class="n">target_instance_variable_name</span><span class="p">.</span><span class="nf">to_sym</span> <span class="nb">puts</span> <span class="s2">"</span><span class="si">#{</span><span class="n">target_class_name</span><span class="si">}</span><span class="s2"> </span><span class="si">#{</span><span class="n">target_instance_variable_name</span><span class="si">}</span><span class="s2"> is assigned in </span><span class="si">#{</span><span class="n">tp</span><span class="p">.</span><span class="nf">path</span><span class="si">}</span><span class="s2">:</span><span class="si">#{</span><span class="n">tp</span><span class="p">.</span><span class="nf">lineno</span><span class="si">}</span><span class="s2"> </span><span class="si">#{</span><span class="n">tp</span><span class="p">.</span><span class="nf">defined_class</span><span class="si">}</span><span class="s2"> </span><span class="si">#{</span><span class="n">tp</span><span class="p">.</span><span class="nf">method_id</span><span class="si">}</span><span class="s2">"</span> <span class="k">end</span> <span class="k">end</span> <span class="k">class</span> <span class="nc">Foo</span> <span class="k">def</span> <span class="nf">bar</span> <span class="vi">@bar</span> <span class="o">=</span> <span class="s2">"text"</span> <span class="k">end</span> <span class="k">end</span> <span class="n">trace_start</span> <span class="no">Foo</span><span class="p">.</span><span class="nf">new</span><span class="p">.</span><span class="nf">bar</span> <span class="c1">#=> Foo @bar is assigned in check_instance_variable_assignment.rb:25 Foo bar</span> </code></pre> <p>Suggesting feature example:</p> <p>Add new arguments for TracePoint.new method like :line and :call to trace instance variables assignment.</p> <ul> <li>:iasgn (IASGN name from RubyVM::AbstractSyntaxTree::Node)</li> <li>:casgn (CVASGN (or CASGN?) name from RubyVM::AbstractSyntaxTree::Node. I think class variables tracing is useful too.)</li> </ul> <p>And get informations</p> <ul> <li>class name (It might be get by trace_point.self)</li> <li>variable name ("@foo", "@@foo")</li> </ul> <p>A sample code to use the feature:</p> <p>tp_iasgn.rb</p> <pre><code class="ruby syntaxhl"><span class="no">TracePoint</span><span class="p">.</span><span class="nf">trace</span><span class="p">(</span><span class="ss">:iasgn</span><span class="p">)</span> <span class="k">do</span> <span class="o">|</span><span class="n">tp</span><span class="o">|</span> <span class="n">target_class_name</span> <span class="o">=</span> <span class="s2">"Foo"</span> <span class="n">target_instance_variable_name</span> <span class="o">=</span> <span class="s2">"@bar"</span> <span class="c1"># check class name</span> <span class="n">target_class</span> <span class="o">=</span> <span class="no">Kernel</span><span class="p">.</span><span class="nf">const_get</span><span class="p">(</span><span class="n">target_class_name</span><span class="p">)</span> <span class="k">next</span> <span class="k">unless</span> <span class="n">tp</span><span class="p">.</span><span class="nf">self</span><span class="p">.</span><span class="nf">is_a?</span><span class="p">(</span><span class="n">target_class</span><span class="p">)</span> <span class="c1"># check variable name</span> <span class="k">next</span> <span class="k">unless</span> <span class="n">target_instance_variable_name</span> <span class="o">==</span> <span class="n">tp</span><span class="p">.</span><span class="nf">variable_name</span> <span class="nb">puts</span> <span class="s2">"</span><span class="si">#{</span><span class="n">target_class_name</span><span class="si">}</span><span class="s2"> </span><span class="si">#{</span><span class="n">target_instance_variable_name</span><span class="si">}</span><span class="s2"> is assigned in </span><span class="si">#{</span><span class="n">tp</span><span class="p">.</span><span class="nf">path</span><span class="si">}</span><span class="s2">:</span><span class="si">#{</span><span class="n">tp</span><span class="p">.</span><span class="nf">lineno</span><span class="si">}</span><span class="s2"> </span><span class="si">#{</span><span class="n">tp</span><span class="p">.</span><span class="nf">method_id</span><span class="si">}</span><span class="s2"> </span><span class="si">#{</span><span class="n">tp</span><span class="p">.</span><span class="nf">defined_class</span><span class="si">}</span><span class="s2">"</span> <span class="nb">puts</span> <span class="nb">caller</span> <span class="c1"># even in dynamic code case, we can get caller informations.</span> <span class="k">end</span> </code></pre> Ruby master - Feature #15817 (Open): Warnings for undef_method and remove_method on initialize() https://bugs.ruby-lang.org/issues/15817 2019-05-02T09:11:49Z shevegen (Robert A. Heiler) [email protected] <p>Title: Warnings for undef_method and remove_method on initialize()</p> <p>Right now ruby warns you if you remove or undefine initialize, at the least if you<br> run in verbose mode e. g. the -w flag.</p> <p>Example for such a warning:</p> <pre>gtk_combo_box.rb:17: warning: undefining `initialize' may cause serious problems </pre> <p>What am I trying to do here, that caused this warning to appear, actually?</p> <p>I am modifying some of the ruby-gtk code to extend the core gtk widgets with some<br> "shortcuts", that is, functionality that I may use in order to write less code when<br> I write ruby-gtk specific code.</p> <p>Part of this means that I have to modify how initialize works for some of these<br> widgets; in particular enabling support for some Symbols via blocks given to the<br> initializer (I happily use/abuse Symbols that way; ruby-gtk has also added a few<br> Symbols in the last few years, in particular to avoid having to type long CONSTANT<br> names when it is not necessary - see Kouhei Sutou's continued efforts here).</p> <p>In order to do this, and modify these gtk-widgets, I thus modify initialize - and<br> ruby gives me warnings here.</p> <p>The first warning I actually got was:</p> <p>"warning: method redefined; discarding old initialize"</p> <p>Ok, fair enough. So my idea was ... "I'll simply remove the old initialize, and<br> then set a new one, aka my own variant. That way I won't get the warning anymore."</p> <p>I then tried to use both remove_method, and undef_method, and while initialize is<br> removed, ruby still warns me, e. g. with the "may cause serious problems" issue.<br> This was the reason (and moment) for creating the issue request here.</p> <p>I should say that I always run all my ruby code with warning flags enabled, set in<br> the shebang-header in a .rb file. I find it very useful that ruby tells me if<br> there may be something wrong in general. However had, in this particular case, I<br> actually consider ruby warning me to be a feature that I would prefer to not have,<br> in that particular instance. The reason is that I am actually specifically telling<br> ruby to get rid of the old initialize, so it is a bit surprising to me that ruby<br> warns me. Here the assumption may be that the ruby user did not know what was done,<br> and although I am still quite clueless, I actually think that in this case I knew<br> what I wanted to do - that is, getting rid of the old initialize, then setting a<br> new initialize. (Perhaps ruby could detect such a case, where the ruby users removes<br> the old initialize, then specifically defines a new one; this may solve the issue<br> here, but I have no idea how feasible this may be, or how much work. Just mentioning<br> it really.)</p> <p>We can say that my approach is not a good one; this may well be, but the primary question<br> is whether ruby should warn/notify us in such a case either way.</p> <p>I think you can find arguments for both cases, e. g. that ruby warns us (some people may<br> want this, even in this case) when it comes to undef_method/remove_method on initialize <br> only - but it may also equally be the case that the ruby user at hands knows what she/he/it<br> is doing. And I believe that in the latter case ruby should NOT warn about this. Obviously<br> ruby then would need a way to distinguish between these two cases:</p> <p>a) the case where the user wants to see a warning, because it may be helpful or for any other reason<br> b) the case where the user does not want to see the warning, for whatever reason</p> <p>This makes the issue request here a bit complicated, because while I actually think that<br> ruby should not warn in regards to undef_method/remove_method, there are also perfectly<br> valid use cases for the latter, where ruby should warn. One use case can be when people<br> dynamically add/remove methods and may "accidentally" - and automatically - remove initialize,<br> so in this case it would be a GOOD thing that ruby warns them. But in other cases, such as in<br> the use case described here, I would rather prefer to not have ruby print anything about this<br> to me.</p> <p>There are workarounds of course - for example, I can temporarily silence on $VERBOSE, and then<br> re-set it to the old value. I do this in other gems.</p> <p>There may be other workarounds - perhaps working on a new copy of initialize and then replacing<br> the old one differently (not sure if these work ... perhaps with some variant of the *eval-family).<br> All of which is fine - my primary reason here is that I believe it should be simple for the<br> ruby user to tell ruby to not warn about a specific error at hand, e. g. in all the cases where<br> the user knows the problem domain (and thus does not need the warning at hand).</p> <p>I have no really good general suggestion in how to improve this aspect here, because it may be<br> better to make warnings in ruby more flexible in general. Perhaps even on a per module/class<br> "namespace" - a bit similar to refinements, but with a simple(r) API and a simple(r) concept.</p> <p>I don't have a good proposal here either, so this is just a little bit of feedback really. (If<br> there are more similar comments about warnings in ruby in general, please feel free to close<br> the issue here and gather discussions in any other tracker issue if you feel this to be better.)</p> <p>To further explain the above issue - my use case was primarily motivated in order to silence the<br> first warning. It took me a little bit by surprise that my course of action then led to another<br> warning, which sort of defeated my original intent of silencing the other warning, since I now<br> had a new warning issued on the commandline. :)</p> <p>Hopefully I could describe the intent/idea behind the suggestion. It is of course nothing that<br> is hugely important, since it is just a warning and the code works fine, but I kind of like <br> seeing no warnings on the commandline actually (don't know why but I dislike seeing warnings<br> when I can avoid them).</p> <p>PS: I think for the particular issue at hand, I will do the old trick with temporarily modifying<br> $VERBOSE. It feels a bit hackish, but it also kind of works, and I can then silence the specific<br> warning at hand, e. g. "wrap" the offending code part between $VERBOSE or two method calls that<br> modify $VERBOSE; so perhaps a more general solution may be to be able to modify $VERBOSE through<br> method calls in general, though I don't know if this would make the code too slow, or where this<br> method should reside (Kernel? Not sure) - I just think it may be nicer to read, API-wise, to have<br> a method rather than have to modify $VERBOSE. But that is just an opinion really; the more<br> important thing is that modifying $VERBOSE does work, so the functionality already exists<br> for us to use as-is.</p> Ruby master - Feature #15781 (Open): Unify Method List Introspection? https://bugs.ruby-lang.org/issues/15781 2019-04-21T20:43:58Z rbjl (Jan Lelis) [email protected] <p>Although Ruby has many core methods for retrieving the list of methods available to an object, or to the instances of a class, I believe they have gotten a little confusing (<a href="https://idiosyncratic-ruby.com/25-meta-methodology.html" class="external">also see</a>):</p> <ul> <li><code>Object#methods</code> and <code>Module#instance_methods</code> do not include <strong>private</strong> methods (at the same time they do include <strong>protected</strong> ones). There is already <code>Object#public_methods</code> (and <code>Object#protected_methods</code>) for distinguishing visibility scope , but no way to get <em>all</em> methods of an object.</li> <li>There is the inconsistency that in most cases the argument being passed to <code>*_methods</code> methods let's you decide if you want to consider the inheritance chain, or not - But the prominent exception is <code>Object#methods</code> which instead toggles inheritance to singleton only! (for which we also have <code>Object#singleton_methods</code>)</li> <li>There is no direct API for getting a list of private singleton methods</li> </ul> <p>Now that we have keyword arguments, we could provide a single API for listing methods. One way of doing so could be the <a href="https://github.com/janlelis/object_shadow#method-introspection" class="external">Object#shadow's methods method</a>. Having a keyword arguments based API would allow users to specify the dimensions of their requests better - should it:</p> <ul> <li>return the object's methods, or methods of its instances?</li> <li>return only methods of a specific visibility scope?</li> <li>return only methods of a specific inheritance level (e.g. only singleton, or all the way down to <code>BasicObject</code>)?</li> </ul> <p>What do you think about having one unified way for retrieving an object's method list?</p> Ruby master - Bug #15764 (Open): Whitespace and control characters should not be permitted in tokens https://bugs.ruby-lang.org/issues/15764 2019-04-11T20:59:47Z BatmanAoD (Kyle Strand) [email protected] <p>As of Ruby 2.5.1p57, it appears that all valid Unicode code-points above 128 are permitted in tokens. This includes whitespace and control characters.</p> <p>This was demonstrated here: <a href="https://gist.github.com/qrohlf/7045823">https://gist.github.com/qrohlf/7045823</a></p> <p>I have attached the raw download from the above gist.</p> <p>The issue has been discussed on StackOverflow: <a href="https://stackoverflow.com/q/34455427/1858225">https://stackoverflow.com/q/34455427/1858225</a></p> <p>I would say this is arguably a bug, but I am marking this ticket as a "feature" since the current behavior could be considered by-design.</p> Ruby master - Bug #15718 (Open): YAML raises error when dumping strings with UTF32 encoding https://bugs.ruby-lang.org/issues/15718 2019-03-20T20:21:55Z marcandre (Marc-Andre Lafortune) [email protected] <pre><code class="shell syntaxhl">ruby <span class="nt">-r</span> yaml <span class="nt">-e</span> <span class="s2">"p YAML.dump( ''.force_encoding('UTF-32LE') )"</span> Traceback <span class="o">(</span>most recent call last<span class="o">)</span>: 4: from <span class="nt">-e</span>:1:in <span class="sb">`</span><main><span class="s1">' 3: from /Users/work/.rvm/rubies/ruby-2.6.1/lib/ruby/2.6.0/psych.rb:513:in `dump'</span> 2: from /Users/work/.rvm/rubies/ruby-2.6.1/lib/ruby/2.6.0/psych/visitors/yaml_tree.rb:118:in <span class="sb">`</span>push<span class="s1">' 1: from /Users/work/.rvm/rubies/ruby-2.6.1/lib/ruby/2.6.0/psych/visitors/yaml_tree.rb:136:in `accept'</span> /Users/work/.rvm/rubies/ruby-2.6.1/lib/ruby/2.6.0/psych/visitors/yaml_tree.rb:298:in <span class="sb">`</span>visit_String<span class="s1">': incompatible encoding regexp match (US-ASCII regexp with UTF-32LE string) (Encoding::CompatibilityError) </span></code></pre> <p>Surprisingly, this works in Ruby 2.4.x, but not in 2.2, 2.3, 2.5 nor 2.6!</p> Ruby master - Bug #15655 (Open): Unable to handle Russian dirname on Windows https://bugs.ruby-lang.org/issues/15655 2019-03-11T10:08:55Z ashmaroli (Ashwin Maroli) <p>I'm unable to work in a directory with a Russian name.<br> Running <code>bundle exec ...</code> returns an error from Bundler saying that it couldn't locate the Gemfile (which is present)</p> <pre><code class="shell syntaxhl"><span class="c"># print current directory</span> <span class="o">></span> <span class="nb">echo</span> %CD% <span class="o">=></span> D:<span class="se">\Е</span>вгений <span class="c"># print contents at root</span> <span class="o">></span> <span class="nb">ls</span> <span class="o">=></span> 404.html Gemfile _config.yml _posts about.markdown index.markdown <span class="c"># List dependencies via Bundler</span> <span class="o">></span> bundle show <span class="o">=></span> Could not locate Gemfile or .bundle/ directory <span class="c"># Debug in IRB</span> <span class="o">></span> irb irb<span class="o">(</span>main<span class="o">)</span>:001:0> Dir.pwd <span class="o">=></span> <span class="s2">"D:/???????"</span> </code></pre> Ruby master - Bug #15634 (Open): TracePoint seems to be skipping some methods. https://bugs.ruby-lang.org/issues/15634 2019-03-04T09:56:37Z ioquatix (Samuel Williams) [email protected] <pre><code class="ruby syntaxhl"><span class="n">trace_point</span> <span class="o">=</span> <span class="no">TracePoint</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="ss">:call</span><span class="p">,</span> <span class="ss">:return</span><span class="p">,</span> <span class="ss">:line</span><span class="p">,</span> <span class="ss">:c_call</span><span class="p">,</span> <span class="ss">:c_return</span><span class="p">,</span> <span class="ss">:b_call</span><span class="p">,</span> <span class="ss">:b_return</span><span class="p">)</span> <span class="k">do</span> <span class="o">|</span><span class="n">trace</span><span class="o">|</span> <span class="nb">puts</span> <span class="p">[</span><span class="n">trace</span><span class="p">.</span><span class="nf">path</span><span class="p">,</span> <span class="n">trace</span><span class="p">.</span><span class="nf">lineno</span><span class="p">].</span><span class="nf">join</span><span class="p">(</span><span class="s2">":"</span><span class="p">)</span> <span class="k">end</span> <span class="n">trace_point</span><span class="p">.</span><span class="nf">enable</span> <span class="n">values</span> <span class="o">=</span> <span class="p">{</span><span class="ss">foo: </span><span class="mi">10</span><span class="p">}</span> <span class="k">def</span> <span class="nf">shell_escape</span><span class="p">(</span><span class="n">x</span><span class="p">)</span> <span class="n">x</span> <span class="k">end</span> <span class="n">values</span><span class="p">.</span><span class="nf">map</span><span class="p">{</span><span class="o">|</span><span class="n">key</span><span class="p">,</span> <span class="n">value</span><span class="o">|</span> <span class="p">[</span> <span class="n">key</span><span class="p">.</span><span class="nf">to_s</span><span class="p">.</span><span class="nf">upcase</span><span class="p">,</span> <span class="n">shell_escape</span><span class="p">(</span><span class="n">value</span><span class="p">)</span> <span class="c1"># TracePoint is never triggered for this line.</span> <span class="p">]}</span> </code></pre> Ruby master - Misc #15568 (Open): TracePoint(:raise)#parameters raises RuntimeError https://bugs.ruby-lang.org/issues/15568 2019-01-26T21:10:29Z baweaver (Brandon Weaver) [email protected] <p>Currently trying to get the <code>trace.parameters</code> of a method in a <code>raise</code> event will lead to a RuntimeError. I would contend that it should not, and that it would be perfectly valid to ask for the parameters in the case of an exception.</p> <p>The reason I do this is to see the arguments at the time of exception:</p> <pre>def extract_args(trace) trace.parameters.map(&:last).to_h do |name| [name, trace.binding.eval(name.to_s)] end end </pre> <p>I've noticed that I can technically "cheat" and get these same values like this:</p> <pre>def extract_args(trace) trace.binding.eval('local_variables').to_h do |name| [name, trace.binding.eval(name.to_s)] end end </pre> <p>Having the ability to get the parameters in a <code>raise</code> context would be very useful for debugging.</p> <p>I'm tempted to also suggest <code>TracePoint#local_variables</code> as it would provide additional context in a more exposed way than <code>TracePoint#binding.eval('local_variables')</code></p> Ruby master - Feature #15554 (Open): warn/error passing a block to a method which never use a block https://bugs.ruby-lang.org/issues/15554 2019-01-22T04:48:10Z ko1 (Koichi Sasada) <a name="Abstract"></a> <h1 >Abstract<a href="#Abstract" class="wiki-anchor">¶</a></h1> <p>Warn or raise an ArgumentError if block is passed to a method which does not use a block.<br> In other words, detect "block user methods" implicitly and only "block user methods" can accept a block.</p> <a name="Background"></a> <h1 >Background<a href="#Background" class="wiki-anchor">¶</a></h1> <p>Sometimes, we pass a block to a method which ignores the passed block accidentally.</p> <pre>def my_open(name) open(name) end # user hopes it works as Kernel#open which invokes a block with opened file. my_open(name){|f| important_work_with f } # but simply ignored... </pre> <p>To solve this issue, this feature request propose showing warnings or raising an exception on such case.</p> <p>Last developer's meeting, matz proposed <code>&nil</code> which declares this method never receive a block. It is explicit, but it is tough to add this <code>&nil</code> parameter declaration to all of methods (do you want to add it to <code>def []=(i, e, &nil)</code>?).<br> (I agree <code>&nil</code> is valuable on some situations)</p> <a name="Spec"></a> <h1 >Spec<a href="#Spec" class="wiki-anchor">¶</a></h1> <a name="Define-use-a-block-methods"></a> <h2 >Define "use a block" methods<a href="#Define-use-a-block-methods" class="wiki-anchor">¶</a></h2> <p>We need to define which method accepts a block and which method does not.</p> <ul> <li>(1) method has a block parameter (<code>&b</code>)</li> <li>(2) method body has `yield'</li> <li>(3) method body has <code>super</code> (ZSUPER in internal terminology) or <code>super(...)</code></li> <li>(4) method body has singleton method (optional)</li> </ul> <p>(1) and (2) is very clear. I need to explain about (3) and (4).</p> <p>(3). <code>super</code> (ZSUPER) passes all parameters as arguments. So there is no surprise that which can accept <code>block</code>.<br> However <code>super(...)</code> also passes a block if no explicit block passing (like <code>super(){}</code> or <code>super(&b)</code>) are written.<br> I'm not sure we need to continue this strange specification, but to keep compatibility depending this spec, I add this rule.</p> <p>(4). surprisingly, the following code invoke a block:</p> <pre>def foo class << Object.new yield end end foo{ p :ok } #=> :ok </pre> <p>I'm also not sure we need to keep this spec, but to allow this spec, I added (4) rule.<br> Strictly speaking, it is not required, but we don't keep the link from singleton class ISeq to lexical parent iseq now, so I added it.</p> <a name="Exceptional-cases"></a> <h2 >Exceptional cases<a href="#Exceptional-cases" class="wiki-anchor">¶</a></h2> <p>A method called by <code>super</code> doesn<code>t warn warning even if this method doesn't use a block.<br> The rule (3) can pass blocks easily and there are many methods don</code>t use a block.</p> <p>So my patch ignores callings by <code>super</code>.</p> <a name="corner-cases"></a> <h2 >corner cases<a href="#corner-cases" class="wiki-anchor">¶</a></h2> <p>There are several cases to use block without (1)-(4) rules.</p> <a name="Procnewproclambda-without-a-block"></a> <h3 ><code>Proc.new/proc/lambda</code> without a block<a href="#Procnewproclambda-without-a-block" class="wiki-anchor">¶</a></h3> <p>Now it was deprecated in r66772 (<a class="changeset" title="proc.c: proc without block * proc.c (proc_new): promoted lambda/proc/Proc.new with no block in..." href="https://bugs.ruby-lang.org/projects/ruby-master/repository/git/revisions/9f1fb0a17febc59356d58cef5e98db61a3c03550">9f1fb0a17febc59356d58cef5e98db61a3c03550</a>).<br> Related discussion: [Bug <a class="issue tracker-1 status-6 priority-4 priority-default closed" title="Bug: Proc.new with no block shouldn't always warn (Rejected)" href="https://bugs.ruby-lang.org/issues/15539">#15539</a>]</p> <a name="block_given"></a> <h3 ><code>block_given?</code><a href="#block_given" class="wiki-anchor">¶</a></h3> <p><code>block_given?</code> expects block, but I believe we use it with <code>yield</code> or a block parameter.<br> If you know the usecase without them, please tell us.</p> <a name="yield-in-eval"></a> <h3 ><code>yield</code> in <code>eval</code><a href="#yield-in-eval" class="wiki-anchor">¶</a></h3> <p>We can't know <code>yield</code> (or (3), (4) rule) in an <code>eval</code> evaluating string at calling time.</p> <pre>def foo eval('yield`) end foo{} # at calling time, # we can't know the method foo can accept a block or not. </pre> <p>So I added a warning to use <code>yield</code> in <code>eval</code> like that: <code>test.rb:4: warning: use yield in eval will not be supported in Ruby 3.</code></p> <p>Workaround is use a block parameter explicitly.</p> <pre>def foo &b eval('b.call') end foo{ p :ok } </pre> <a name="Implementation"></a> <h1 >Implementation<a href="#Implementation" class="wiki-anchor">¶</a></h1> <p>Strategy is:</p> <ul> <li>[compile time] introduce <code>iseq::has_yield</code> field and check it if the iseq (or child iseq) contains <code>yield</code> (or something)</li> <li>[calling time] if block is given, check <code>iseq::has_yield</code> flag and show warning (or raise an exception)</li> </ul> <p><a href="https://gist.github.com/ko1/c9148ad0224bf5befa3cc76ed2220c0b">https://gist.github.com/ko1/c9148ad0224bf5befa3cc76ed2220c0b</a></p> <p>On this patch, now it raises an error to make it easy to detect.<br> It is easy to switch to show the warning.</p> <a name="Evaluation-and-discussion"></a> <h1 >Evaluation and discussion<a href="#Evaluation-and-discussion" class="wiki-anchor">¶</a></h1> <p>I tried to avoid ruby's tests.</p> <p><a href="https://gist.github.com/ko1/37483e7940cdc4390bf8eb0001883786">https://gist.github.com/ko1/37483e7940cdc4390bf8eb0001883786</a></p> <p>Here is a patch.</p> <p>There are several patterns to avoid warnings.</p> <a name="tests-for-block_given-Procnew-and-similar-without-block"></a> <h2 >tests for <code>block_given?</code>, <code>Proc.new</code> (and similar) without block<a href="#tests-for-block_given-Procnew-and-similar-without-block" class="wiki-anchor">¶</a></h2> <p>Add a dummy block parameter.<br> It is test-specific issue.</p> <a name="empty-each"></a> <h2 >empty <code>each</code><a href="#empty-each" class="wiki-anchor">¶</a></h2> <p>Some tests add <code>each</code> methods do not <code>yield</code>, like: <code>def each; end</code>.<br> Maybe test-specific issue, and adding a dummy block parameter.</p> <a name="Subtyping-duck-typing"></a> <h2 >Subtyping / duck typing<a href="#Subtyping-duck-typing" class="wiki-anchor">¶</a></h2> <p><a href="https://github.com/ruby/ruby/blob/c01a5ee85e2d6a7128cccafb143bfa694284ca87/lib/optparse.rb#L698">https://github.com/ruby/ruby/blob/c01a5ee85e2d6a7128cccafb143bfa694284ca87/lib/optparse.rb#L698</a></p> <p>This <code>parse</code> method doesn't use <code>yield</code>, but other sub-type's <code>parse</code> methods use.</p> <a name="super-with-new-method"></a> <h2 ><code>super</code> with <code>new</code> method<a href="#super-with-new-method" class="wiki-anchor">¶</a></h2> <p><a href="https://gist.github.com/ko1/37483e7940cdc4390bf8eb0001883786#file-tests-patch-L61">https://gist.github.com/ko1/37483e7940cdc4390bf8eb0001883786#file-tests-patch-L61</a></p> <p>This method override <code>Class#new</code> method and introduce a hook with block (yield a block in this hook code).</p> <p><a href="https://github.com/ruby/ruby/blob/trunk/lib/rubygems/package/tar_writer.rb#L81">https://github.com/ruby/ruby/blob/trunk/lib/rubygems/package/tar_writer.rb#L81</a></p> <p>In this method, call <code>super</code> and it also passing a block. However, called <code>initialize</code> doesn't use a block.</p> <a name="Change-robustness"></a> <h2 >Change robustness<a href="#Change-robustness" class="wiki-anchor">¶</a></h2> <p>This change reduce robustness for API change.</p> <p><code>Delegator</code> requires to support <code>__getobj__</code> for client classes.<br> Now <code>__getobj__</code> should accept block but most of <code>__getobj__</code> clients do not call given block.</p> <p><a href="https://github.com/ruby/ruby/blob/trunk/lib/delegate.rb#L80">https://github.com/ruby/ruby/blob/trunk/lib/delegate.rb#L80</a></p> <p>This is because of delegator.rb's API change.</p> <p><a href="https://gist.github.com/ko1/37483e7940cdc4390bf8eb0001883786#file-tests-patch-L86">https://gist.github.com/ko1/37483e7940cdc4390bf8eb0001883786#file-tests-patch-L86</a></p> <p>Nobu says calling block is not required (ignoring a block is no problem) so it is not a bug for delegator client classes.</p> <a name="Found-issues"></a> <h2 >Found issues.<a href="#Found-issues" class="wiki-anchor">¶</a></h2> <pre>[ 2945/20449] Rinda::TestRingServer#test_do_reply = 0.00 s 1) Error: Rinda::TestRingServer#test_do_reply: ArgumentError: passing block to the method "with_timeout" (defined at /home/ko1/src/ruby/trunk/test/rinda/test_rinda.rb:787) is never used. /home/ko1/src/ruby/trunk/test/rinda/test_rinda.rb:635:in `test_do_reply' [ 2946/20449] Rinda::TestRingServer#test_do_reply_local = 0.00 s 2) Error: Rinda::TestRingServer#test_do_reply_local: ArgumentError: passing block to the method "with_timeout" (defined at /home/ko1/src/ruby/trunk/test/rinda/test_rinda.rb:787) is never used. /home/ko1/src/ruby/trunk/test/rinda/test_rinda.rb:657:in `test_do_reply_local' [10024/20449] TestGemRequestSetGemDependencyAPI#test_platform_mswin = 0.01 s 3) Error: TestGemRequestSetGemDependencyAPI#test_platform_mswin: ArgumentError: passing block to the method "util_set_arch" (defined at /home/ko1/src/ruby/trunk/lib/rubygems/test_case.rb:1053) is never used. /home/ko1/src/ruby/trunk/test/rubygems/test_gem_request_set_gem_dependency_api.rb:655:in `test_platform_mswin' [10025/20449] TestGemRequestSetGemDependencyAPI#test_platforms = 0.01 s 4) Error: TestGemRequestSetGemDependencyAPI#test_platforms: ArgumentError: passing block to the method "util_set_arch" (defined at /home/ko1/src/ruby/trunk/lib/rubygems/test_case.rb:1053) is never used. /home/ko1/src/ruby/trunk/test/rubygems/test_gem_request_set_gem_dependency_api.rb:711:in `test_platforms' </pre> <p>These 4 detection show the problem. <code>with_timeout</code> method (used in Rinda test) and <code>util_set_arch</code> method (used in Rubygems test) simply ignore the given block.<br> So these tests are simply ignored.</p> <p>I reported them. (<a href="https://github.com/rubygems/rubygems/issues/2601">https://github.com/rubygems/rubygems/issues/2601</a>)</p> <a name="raise-an-error-or-show-a-warning"></a> <h2 >raise an error or show a warning?<a href="#raise-an-error-or-show-a-warning" class="wiki-anchor">¶</a></h2> <p>At least, Ruby 2.7 should show warning for this kind of violation with <code>-w</code>.<br> How about for Ruby3?</p> Ruby master - Feature #15413 (Open): unmarkable C stack (3rd stack) https://bugs.ruby-lang.org/issues/15413 2018-12-14T21:32:15Z normalperson (Eric Wong) [email protected] <p>The current machine (C) stack can get pretty big for some C functions<br> (rb_ensure, rb_f_select/rb_thread_fd_select/...). This is harmful when we stop<br> a fiber/thread and all that stack becomes eligible for marking.</p> <p>We should experiment a bump allocator for temporary allocations which<br> behaves like the stack, but does not get marked by GC. VALUEs will continue<br> to be allocated on normal C stack, but non-VALUE stuff can go to the<br> unmarkable machine stack.</p> <p>Maybe we call it "UMMS" for Un-Markable Machine Stack</p> <p>We cannot remove marking of the current C stack for compatibility;<br> but we can transition existing C code to use UMMS.</p> <p>I probably won't be around to work on it for 2.7, unfortunately.</p> Ruby master - Bug #15247 (Open): Windows - TEMP folder, non 8.3 & drive, fails & errors in test-a... https://bugs.ruby-lang.org/issues/15247 2018-10-23T17:02:28Z MSP-Greg (Greg L) <p>While working with Azure pipelines, two issues came up related to the TEMP folder.</p> <p>1. The standard Windows TEMP folder is located in a user directory. The user for pipeplines is 'buildguest', which is greater than 8 characters, and hence, its short and long paths differ. When I created a new user account locally on Windows 10, both ENV['TEMP'] and ENV['TMP'] were set to the short path.</p> <p>This is causes two failures in <code>test/rdoc/test_rdoc_rdoc.rb</code> and one failure in <code>test_dir.rb</code>, the failures are listed in the attached file temp_short-long.txt.</p> <p>2. Azure pipelines has the normal TEMP folder on drive C:, but, unlike Appveyor, the repo is placed on drive D:. This causes one failure in <code>test/rdoc/test_rdoc_options.rb</code>, and two errors from the same file, but in the std-Lib file <code>pathname.rb</code>. See attached file temp_drive.txt.</p> <p>I'm not really sure what I think the solution for this is, as the issue is really due to Windows setting ENV['TEMP'] and ENV['TMP'] to short paths. I do recall the same issues happened on my old multi-drive desktop system. At the time, there were more significant issues with build/test, so I reconfigured the env for that...</p> Ruby master - Feature #15031 (Open): T_RANGE for testing whether object is a Range https://bugs.ruby-lang.org/issues/15031 2018-08-27T05:28:28Z v0dro (Sameer Deshmukh) [email protected] <p>Range is an in-built type of Ruby and it would be better for C extension<br> writers if there existed a constant <code>T_RANGE</code> that could be directly used<br> for checking whether a <code>VALUE</code> is a <code>Range</code>.</p> <p>Currently we need to write <code>CLASS_OF(obj) == rb_cRange</code> in order to make this<br> happen. Having a <code>T_RANGE</code> would help in making C code more idiomatic and fast<br> in some cases.</p> <p>That way, one can write <code>RB_TYPE_P(obj, T_RANGE)</code>.</p> Ruby master - Bug #14889 (Open): TracePoint for :line never seems to trigger on argument list. Ma... https://bugs.ruby-lang.org/issues/14889 2018-07-01T12:12:33Z ioquatix (Samuel Williams) [email protected] <p>I have the following code.</p> <pre> 30 1| def print_summary( 31 0| output = $stdout 32 | ) </pre> <p>In the margin is the line number followed by the number of hits according to <code>:line</code> trace point.</p> <p>I feel like line 31 should also trigger a line trace point. It's an argument, but it must be executed.</p> <p>Maybe a different trace point? <code>:argument</code>?</p> Ruby master - Misc #14825 (Open): When redefining `attr_xx` methods the visibility becomes `public` https://bugs.ruby-lang.org/issues/14825 2018-06-05T05:57:56Z y-yagi (Yuji Yaginuma) <p>Hi. </p> <p>If redefine <code>attr_xx</code> methods, the original visibility is lost and all visibility is public. </p> <pre><code class="ruby syntaxhl"><span class="c1"># attr.rb</span> <span class="k">module</span> <span class="nn">ClassMethods</span> <span class="k">def</span> <span class="nf">attr_reader</span><span class="p">(</span><span class="o">*</span><span class="p">)</span> <span class="k">super</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">attr_writer</span><span class="p">(</span><span class="o">*</span><span class="p">)</span> <span class="k">super</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">attr_accessor</span><span class="p">(</span><span class="o">*</span><span class="p">)</span> <span class="k">super</span> <span class="k">end</span> <span class="k">end</span> <span class="k">class</span> <span class="nc">Foo</span> <span class="kp">extend</span> <span class="no">ClassMethods</span> <span class="k">class</span> <span class="o"><<</span> <span class="nb">self</span> <span class="k">def</span> <span class="nf">method_visibility</span><span class="p">(</span><span class="nb">method</span><span class="p">)</span> <span class="k">case</span> <span class="k">when</span> <span class="nb">private_method_defined?</span><span class="p">(</span><span class="nb">method</span><span class="p">)</span> <span class="ss">:private</span> <span class="k">when</span> <span class="nb">protected_method_defined?</span><span class="p">(</span><span class="nb">method</span><span class="p">)</span> <span class="ss">:protected</span> <span class="k">else</span> <span class="ss">:public</span> <span class="k">end</span> <span class="k">end</span> <span class="k">end</span> <span class="nb">attr_reader</span> <span class="ss">:pub</span> <span class="kp">protected</span> <span class="nb">attr_reader</span> <span class="ss">:prot</span> <span class="k">alias</span> <span class="n">protalias</span> <span class="n">prot</span> <span class="kp">alias_method</span> <span class="ss">:protaliasmethod</span><span class="p">,</span> <span class="ss">:prot</span> <span class="kp">private</span> <span class="nb">attr_reader</span> <span class="ss">:priv</span> <span class="k">alias</span> <span class="n">privalias</span> <span class="n">priv</span> <span class="kp">alias_method</span> <span class="ss">:privaliasmethod</span><span class="p">,</span> <span class="ss">:priv</span> <span class="k">end</span> <span class="n">f</span> <span class="o">=</span> <span class="no">Foo</span><span class="p">.</span><span class="nf">new</span> <span class="nb">puts</span> <span class="s2">"Public"</span> <span class="n">f</span><span class="p">.</span><span class="nf">pub</span> <span class="nb">puts</span> <span class="nb">puts</span> <span class="s2">"Protected"</span> <span class="nb">puts</span> <span class="s2">"prot: </span><span class="si">#{</span><span class="no">Foo</span><span class="p">.</span><span class="nf">method_visibility</span><span class="p">(</span><span class="ss">:prot</span><span class="p">)</span><span class="si">}</span><span class="s2">"</span> <span class="nb">puts</span> <span class="s2">"protalias: </span><span class="si">#{</span><span class="no">Foo</span><span class="p">.</span><span class="nf">method_visibility</span><span class="p">(</span><span class="ss">:protalias</span><span class="p">)</span><span class="si">}</span><span class="s2">"</span> <span class="nb">puts</span> <span class="s2">"protaliasmethod </span><span class="si">#{</span><span class="no">Foo</span><span class="p">.</span><span class="nf">method_visibility</span><span class="p">(</span><span class="ss">:protaliasmethod</span><span class="p">)</span><span class="si">}</span><span class="s2">"</span> <span class="nb">puts</span> <span class="nb">puts</span> <span class="s2">"Private"</span> <span class="nb">puts</span> <span class="s2">"priv: </span><span class="si">#{</span><span class="no">Foo</span><span class="p">.</span><span class="nf">method_visibility</span><span class="p">(</span><span class="ss">:priv</span><span class="p">)</span><span class="si">}</span><span class="s2">"</span> <span class="nb">puts</span> <span class="s2">"privalias: </span><span class="si">#{</span><span class="no">Foo</span><span class="p">.</span><span class="nf">method_visibility</span><span class="p">(</span><span class="ss">:privalias</span><span class="p">)</span><span class="si">}</span><span class="s2">"</span> <span class="nb">puts</span> <span class="s2">"privaliasmethod: </span><span class="si">#{</span><span class="no">Foo</span><span class="p">.</span><span class="nf">method_visibility</span><span class="p">(</span><span class="ss">:privaliasmethod</span><span class="p">)</span><span class="si">}</span><span class="s2">"</span> </code></pre><pre>$ ruby -v attr.rb ruby 2.5.1p57 (2018-03-29 revision 63029) [x86_64-linux] Public Protected prot: public protalias: public protaliasmethod public Private priv: public privalias: public privaliasmethod: public </pre> <p>Is this intentional?</p> Ruby master - Feature #14800 (Open): Zlib::GzipReader#read does not support 2nd argument https://bugs.ruby-lang.org/issues/14800 2018-05-31T14:32:52Z okkez (okkez _) <p><code>Zlib::GzipReader#read</code> does not support 2nd argument for output buffer.<br> It is not same as <code>IO#read</code> and <code>StringIO#read</code>.</p> <p>It is useful for duck typing to copy both plain files and gzipped files. </p> <p>See also</p> <ul> <li><a href="https://docs.ruby-lang.org/en/2.5.0/Zlib/GzipReader.html#method-i-read">https://docs.ruby-lang.org/en/2.5.0/Zlib/GzipReader.html#method-i-read</a></li> <li><a href="https://docs.ruby-lang.org/en/2.5.0/IO.html#method-i-read">https://docs.ruby-lang.org/en/2.5.0/IO.html#method-i-read</a></li> <li><a href="https://docs.ruby-lang.org/en/2.5.0/StringIO.html#method-i-read">https://docs.ruby-lang.org/en/2.5.0/StringIO.html#method-i-read</a></li> </ul> Ruby master - Bug #14726 (Open): wrong message when superclass is not a Class https://bugs.ruby-lang.org/issues/14726 2018-05-01T01:49:16Z usa (Usaku NAKAMURA) [email protected] <p>クラス定義の際に親クラスとして<code>Class</code>でないものを与えると<code>TypeError</code>になりますが、その際にエラーメッセージに与えられたもののクラス名が表示されるため、メッセージだけ見ると何が間違ってるのかわけがわからなくなっています。</p> <pre><code class="ruby syntaxhl"><span class="k">class</span> <span class="nc">C1</span><span class="p">;</span> <span class="k">end</span> <span class="k">class</span> <span class="nc">C2</span> <span class="o"><</span> <span class="no">C1</span><span class="p">.</span><span class="nf">new</span><span class="p">;</span> <span class="k">end</span> <span class="c1">#=> TypeError (superclass must be a Class (C1 given))</span> </code></pre> <p>ここはクラス名ではなく与えられたオブジェクトそのものを表示すべきではないでしょうか？</p> <pre><code class="diff syntaxhl"><span class="gh">Index: class.c =================================================================== </span><span class="gd">--- class.c (revision 63310) </span><span class="gi">+++ class.c (working copy) </span><span class="p">@@ -221,7 +221,7 @@</span> { if (!RB_TYPE_P(super, T_CLASS)) { rb_raise(rb_eTypeError, "superclass must be a Class (%"PRIsVALUE" given)", <span class="gd">- rb_obj_class(super)); </span><span class="gi">+ super); </span> } if (RBASIC(super)->flags & FL_SINGLETON) { rb_raise(rb_eTypeError, "can't make subclass of singleton class"); <span class="gh">Index: vm_insnhelper.c =================================================================== </span><span class="gd">--- vm_insnhelper.c (revision 63310) </span><span class="gi">+++ vm_insnhelper.c (working copy) </span><span class="p">@@ -3150,7 +3150,7 @@</span> if (VM_DEFINECLASS_HAS_SUPERCLASS_P(flags) && !RB_TYPE_P(super, T_CLASS)) { rb_raise(rb_eTypeError, "superclass must be a Class (%"PRIsVALUE" given)", <span class="gd">- rb_obj_class(super)); </span><span class="gi">+ super); </span> } vm_check_if_namespace(cbase); </code></pre> Ruby master - Feature #14723 (Open): [WIP] sleepy GC https://bugs.ruby-lang.org/issues/14723 2018-04-29T03:57:07Z normalperson (Eric Wong) [email protected] <p>The idea is to use "idle time" when process is otherwise sleeping<br> and using no CPU time to perform GC. It makes sense because real<br> world traffic sees idle time due to network latency and waiting<br> for user input.</p> <p>Right now, it's Linux-only. Future patches will affect other sleeping<br> functions:</p> <p>IO.select, Kernel#sleep, Thread#join, Process.waitpid, etc...</p> <p>I don't know if this patch can be implemented for win32, right<br> now it's just dummy functions and that will be somebody elses<br> job. But all pthreads platforms should eventually benefit.</p> <p>Before this patch, the entropy-dependent script below takes 95MB<br> consistently on my system. Now, depending on the amount of<br> entropy on my system, it takes anywhere from 43MB to 75MB.</p> <p>I'm using /dev/urandom to simulate real-world network latency<br> variations. There is no improvement when using /dev/zero<br> because the process is never idle.</p> <p>require 'net/http'<br> require 'digest/md5'<br> Thread.abort_on_exception = true<br> s = TCPServer.new('127.0.0.1', 0)<br> len = 1024 * 1024 * 1024<br> th = Thread.new do<br> c = s.accept<br> c.readpartial(16384)<br> c.write("HTTP/1.0 200 OK\r\nContent-Length: #{len}\r\n\r\n")<br> IO.copy_stream('/dev/urandom', c, len)<br> c.close<br> end</p> <p>addr = s.addr<br> Net::HTTP.start(addr[3], addr[1]) do |http|<br> http.request_get('/') do |res|<br> dig = Digest::MD5.new<br> res.read_body { |buf|<br> dig.update(buf)<br> }<br> puts dig.hexdigest<br> end<br> end</p> <p>The above script is also dependent on net/protocol using<br> read_nonblock. Ordinary IO objects will need IO#nonblock=true<br> to see benefits (because they never hit rb_wait_for_single_fd)</p> <ul> <li>gc.c (rb_gc_inprogress): new function (rb_gc_step): ditto</li> <li>internal.h: declare prototypes for new gc.c functions</li> <li>thread_pthread.c (gvl_contended_p): new function</li> <li>thread_win32.c (gvl_contended_p): ditto (dummy)</li> <li>thread.c (rb_wait_for_single_fd w/ ppoll): use new functions to perform GC while GVL is uncontended and GC is lazy sweeping or incremental marking [ruby-core:86265] ```</li> </ul> <p>2 part patch broken out<br> <a href="https://80x24.org/spew/[email protected]/raw">https://80x24.org/spew/[email protected]/raw</a><br> <a href="https://80x24.org/spew/[email protected]/raw">https://80x24.org/spew/[email protected]/raw</a></p> <p>Also on my "sleepy-gc" git branch @ git://80x24.org/ruby.git</p> Ruby master - Feature #14718 (Open): Use jemalloc by default? https://bugs.ruby-lang.org/issues/14718 2018-04-27T16:14:10Z mperham (Mike Perham) [email protected] <p>I know Sam opened <a class="issue tracker-2 status-5 priority-4 priority-default closed" title="Feature: Ship Ruby for Linux with jemalloc out-of-the-box (Closed)" href="https://bugs.ruby-lang.org/issues/9113">#9113</a> 4 years ago to suggest this but I'm revisiting the topic to see if there's any movement here for Ruby 2.6 or 2.7. I supply a major piece of Ruby infrastructure (Sidekiq) and I keep hearing over and over how Ruby is terrible with memory, a huge memory hog with their Rails apps. My users switch to jemalloc and a miracle occurs: their memory usage drops massively. Some data points:</p> <p><a href="https://twitter.com/brandonhilkert/status/987400365627801601">https://twitter.com/brandonhilkert/status/987400365627801601</a><br> <a href="https://twitter.com/d_jones/status/989866391787335680">https://twitter.com/d_jones/status/989866391787335680</a><br> <a href="https://github.com/mperham/sidekiq/issues/3824#issuecomment-383072469">https://github.com/mperham/sidekiq/issues/3824#issuecomment-383072469</a></p> <p>Redis moved to jemalloc many years ago and it solved all of their memory issues too. Their conclusion: the glibc allocator "sucks really really hard". <a href="http://oldblog.antirez.com/post/everything-about-redis-24.html">http://oldblog.antirez.com/post/everything-about-redis-24.html</a></p> <p>This is a real pain point for the entire Rails community and would improve Ruby's reputation immensely if we can solve this problem.</p> Ruby master - Bug #14640 (Open): [win32] File.realpath treats a relative path with a drive letter... https://bugs.ruby-lang.org/issues/14640 2018-03-28T16:18:34Z nobu (Nobuyoshi Nakada) [email protected] <p>When <code>t</code> exists in the current directory under the drive C:,</p> <pre><code class="ruby syntaxhl"><span class="no">File</span><span class="p">.</span><span class="nf">realpath</span><span class="p">(</span><span class="s2">"c:t"</span><span class="p">)</span> <span class="c1">#=> No such file or directory @ realpath_rec - c:/t (Errno::ENOENT)</span> </code></pre> <p>whereas <code>File.expand_path</code> returns <code>Dir.pwd + "/t"</code>.</p> Ruby master - Feature #14625 (Open): yield_self accepts an argument, calling to_proc https://bugs.ruby-lang.org/issues/14625 2018-03-23T08:04:36Z irohiroki (Hiroki Yoshioka) <p>Currently, yield_self doesn't accept any argument other than a block.</p> <p>But there are situations where I would like to pass a method object to yield_self. <br> e.g.</p> <pre><code class="ruby syntaxhl"><span class="n">result</span> <span class="o">=</span> <span class="n">collection</span> <span class="p">.</span><span class="nf">yield_self</span><span class="p">(</span><span class="o">&</span><span class="nb">method</span><span class="p">(</span><span class="ss">:filter1</span><span class="p">))</span> <span class="p">.</span><span class="nf">yield_self</span><span class="p">(</span><span class="o">&</span><span class="nb">method</span><span class="p">(</span><span class="ss">:filter2</span><span class="p">))</span> </code></pre> <p>Of course, we can get the same result with</p> <pre><code class="ruby syntaxhl"><span class="n">result</span> <span class="o">=</span> <span class="n">filter2</span><span class="p">(</span><span class="n">filter1</span><span class="p">(</span><span class="n">collection</span><span class="p">))</span> </code></pre> <p>but the order of reading/writing doesn't match the order of thinking.</p> <p>My request is for yield_self to accept a proc-ish object and call to_proc on it so that we can write the code as shown below, which is more readable.</p> <pre><code class="ruby syntaxhl"><span class="n">result</span> <span class="o">=</span> <span class="n">collection</span> <span class="p">.</span><span class="nf">yield_self</span><span class="p">(</span><span class="nb">method</span> <span class="ss">:filter1</span><span class="p">)</span> <span class="p">.</span><span class="nf">yield_self</span><span class="p">(</span><span class="nb">method</span> <span class="ss">:filter2</span><span class="p">)</span> </code></pre> Ruby master - Feature #14602 (Open): Version of dig that raises error if a key is not present https://bugs.ruby-lang.org/issues/14602 2018-03-13T18:29:57Z amcaplan (Ariel Caplan) [email protected] <p>Currently, if I have a hash like this:</p> <pre><code class="ruby syntaxhl"><span class="p">{</span> <span class="ss">:name</span> <span class="o">=></span> <span class="p">{</span> <span class="ss">:first</span> <span class="o">=></span> <span class="s2">"Ariel"</span><span class="p">,</span> <span class="ss">:last</span> <span class="o">=></span> <span class="s2">"Caplan"</span> <span class="p">}</span> <span class="p">}</span> </code></pre> <p>and I want to navigate confidently and raise a KeyError if something is missing, I can do:</p> <pre><code class="ruby syntaxhl"><span class="nb">hash</span><span class="p">.</span><span class="nf">fetch</span><span class="p">(</span><span class="ss">:name</span><span class="p">).</span><span class="nf">fetch</span><span class="p">(</span><span class="ss">:first</span><span class="p">)</span> </code></pre> <p>Unfortunately, the length of the name, combined with the need to repeat the method name every time, means most programmers are more likely to do this:</p> <pre><code class="ruby syntaxhl"><span class="nb">hash</span><span class="p">[</span><span class="ss">:name</span><span class="p">][</span><span class="ss">:first</span><span class="p">]</span> </code></pre> <p>which leads to many unexpected errors.</p> <p>The Hash#dig method made it easy to access methods safely from a nested hash; I'd like to have something similar for access without error protection, and I'd think the most natural name would be Hash#dig!. It would work like this:</p> <pre><code class="ruby syntaxhl"><span class="nb">hash</span> <span class="o">=</span> <span class="p">{</span> <span class="ss">:name</span> <span class="o">=></span> <span class="p">{</span> <span class="ss">:first</span> <span class="o">=></span> <span class="s2">"Ariel"</span><span class="p">,</span> <span class="ss">:last</span> <span class="o">=></span> <span class="s2">"Caplan"</span> <span class="p">}</span> <span class="p">}</span> <span class="nb">hash</span><span class="p">.</span><span class="nf">dig!</span><span class="p">(</span><span class="ss">:name</span><span class="p">,</span> <span class="ss">:first</span><span class="p">)</span> <span class="c1"># => Ariel</span> <span class="nb">hash</span><span class="p">.</span><span class="nf">dig!</span><span class="p">(</span><span class="ss">:name</span><span class="p">,</span> <span class="ss">:middle</span><span class="p">)</span> <span class="c1"># raises KeyError (key not found: :middle)</span> <span class="nb">hash</span><span class="p">.</span><span class="nf">dig!</span><span class="p">(</span><span class="ss">:name</span><span class="p">,</span> <span class="ss">:first</span><span class="p">,</span> <span class="ss">:foo</span><span class="p">)</span> <span class="c1"># raises TypeError (String does not have #dig! method)</span> </code></pre> Ruby master - Bug #14582 (Open): Unable to use `method__entry` and `method_return` tracing probes... https://bugs.ruby-lang.org/issues/14582 2018-03-07T06:23:00Z guilhermereiscampos (Guilherme Reis Campos) [email protected] <p>Hi,</p> <p>I am trying to use dtrace/systemtap probes and not being able to use it after the 2.5. The 2.4 version works fine. I was hoping this was fixed on 2.6-preview, but apparently not (just downloaded dev and tested).</p> <p>I tried on OSX using dtrace and also on ubuntu (vagrant). </p> <pre># test.rb class Foo def bar 100.times { "Bar" } end end foo = Foo.new foo.bar # test.stp probe process("/home/vagrant/.rbenv/versions/2.4.0/bin/ruby").mark("method__entry") # you will need to change this to your ruby path of your version. { printf("%s => %s.%s in %s:%d\n", thread_indent(1), kernel_string($arg1),kernel_string($arg2),kernel_string($arg3),$arg4); } probe process("/home/vagrant/.rbenv/versions/2.4.0/bin/ruby").mark("method__return") { printf("%s <= %s.%s in %s:%d\n", thread_indent(-1), kernel_string($arg1),kernel_string($arg2),kernel_string($arg3),$arg4); } </pre> <p>dtrace was something similar to it.</p> <p>I was expecting to see this output:</p> <pre># lots of calls # .... # then: 4090 ruby(9667): <= Gem::Specification.unresolved_deps in /home/vagrant/.rbenv/versions/2.4.0/lib/ruby/2.4.0/rubygems/specification.rb:1298 4095 ruby(9667): => MonitorMixin.mon_exit in /home/vagrant/.rbenv/versions/2.4.0/lib/ruby/2.4.0/monitor.rb:197 4100 ruby(9667): => MonitorMixin.mon_check_owner in /home/vagrant/.rbenv/versions/2.4.0/lib/ruby/2.4.0/monitor.rb:247 4104 ruby(9667): <= MonitorMixin.mon_check_owner in /home/vagrant/.rbenv/versions/2.4.0/lib/ruby/2.4.0/monitor.rb:251 4109 ruby(9667): <= MonitorMixin.mon_exit in /home/vagrant/.rbenv/versions/2.4.0/lib/ruby/2.4.0/monitor.rb:204 4283 ruby(9667): <= Kernel.require in /home/vagrant/.rbenv/versions/2.4.0/lib/ruby/2.4.0/rubygems/core_ext/kernel_require.rb:55 4303 ruby(9667): <= Kernel.require in /home/vagrant/.rbenv/versions/2.4.0/lib/ruby/2.4.0/rubygems/core_ext/kernel_require.rb:55 0 ruby(9667): => Foo.bar in test.rb:3 16 ruby(9667): <= Foo.bar in test.rb:5 </pre> <p>(The output above is 2.4)</p> <p>my ruby (all versions that I tested) was install with rb-env:</p> <pre>RUBY_CONFIGURE_OPTS='--enable-dtrace --disable-install-doc' rbenv install 2.5.0 </pre> <p>I am happy to provide details if required. I'd also be happy to fix it if I have guidance.</p> <p>Thanks,</p> Ruby master - Bug #14570 (Open): Wired behavior of File.expand_path() on Windows https://bugs.ruby-lang.org/issues/14570 2018-03-02T21:31:19Z larskanis (Lars Kanis) <p><code>File.realpath</code> returns the path with the same upper/lower case characters as the input parameter. But <code>File.expand_path</code> is different. It adjusts the last part of the path (and only this) to the upper/lower case characters given from the file system.</p> <pre>require "fileutils" FileUtils.mkdir_p("TestDir/abC/Xyz") File.expand_path("testdir") # => "C:/Users/lars/TestDir" File.expand_path("testdir/abc") # => "C:/Users/lars/testdir/abC" File.expand_path("testdir/abc/XYZ") # => "C:/Users/lars/testdir/abc/Xyz" File.realpath("testdir") # => "C:/Users/lars/testdir" File.realpath("testdir/abc") # => "C:/Users/lars/testdir/abc" File.realpath("testdir/abc/XYZ") # => "C:/Users/lars/testdir/abc/XYZ" </pre> <p>The file system on Windows is case insensitive. So this is not really a bug, but it's inconsistent and unexpected. I would expect that <code>File.expand_path</code> returns a path with upper/lowercase either entirely retrieved from the input parameter or from the file system, but not a mixture of both. I would also expect that <code>File.realpath</code> and <code>File.expand_path</code> have the same semantics in this regard.</p> <p>Same behavior on <code>ruby 2.2.2p95 (2015-04-13 revision 50295) [x64-mingw32]</code></p> Ruby master - Feature #14411 (Open): URI#secure? https://bugs.ruby-lang.org/issues/14411 2018-01-27T14:52:52Z artur86 (Artur *) <p>I wonder if some predicate method (say #secure?) could be added to URI::Generic class. Currently the only way to query if uri is secure is:</p> <pre><code class="ruby syntaxhl"><span class="n">uri</span><span class="p">.</span><span class="nf">instance_of?</span><span class="p">(</span><span class="no">URI</span><span class="o">::</span><span class="no">HTTPS</span><span class="p">)</span> </code></pre> <p>Inspired by this question: <a href="https://stackoverflow.com/questions/2212735/ruby-checking-if-uri-is-https">https://stackoverflow.com/questions/2212735/ruby-checking-if-uri-is-https</a></p> Ruby master - Bug #14367 (Open): Wrong interpretation of backslash C in regexp literals https://bugs.ruby-lang.org/issues/14367 2018-01-17T08:18:46Z shyouhei (Shyouhei Urabe) [email protected] <p>Following ruby code returns nil.</p> <pre><code class="sh syntaxhl">% <span class="nv">LC_ALL</span><span class="o">=</span>C ruby <span class="nt">-ve</span> <span class="s1">'p(/\c\xFF/ =~ "\c\xFF")'</span> ruby 2.6.0dev <span class="o">(</span>2018-01-16 trunk 61875<span class="o">)</span> <span class="o">[</span>x86_64-darwin15] nil </code></pre> <p>Is this intentional?</p> Ruby master - Feature #14348 (Open): win32ole: enable using coclass-es with multiple IDispatch im... https://bugs.ruby-lang.org/issues/14348 2018-01-10T11:34:49Z graywolf (Gray Wolf) <p>Currently win32ole requires coclass to directly implement (one) IDispatch. That<br> works fine for</p> <pre>coclass Good { [default] interface GoodIface2; interface GoodIface1; }; interface GoodIface1 : IDispatch { // snip }; interface GoodIface2 : GoodIface1 { // snip }; </pre> <p>however, it fails to work for the following</p> <pre>coclass Bad { [default] interface BadIface1; interface BadIface2; }; interface BadIface1 : IDispatch { // snip }; interface BadIface2 : IDispatch { // snip }; </pre> <p>I suspect it's because when you ask for <code>IDispatch</code> of <code>Bad</code>, it doesn't know<br> which one to give you (but I'm no COM expert so correct me if I'm wrong).</p> <p>Now, please let's not discuss if classes like that are good idea or not (I<br> think they are not), fact is they do exists and simple patch allows using them<br> with ruby's win32ole.</p> <p>Attached patch adds new <code>iface</code> keyword argument which let's you pick interface<br> to acquire (it must still implement <code>IDispatch</code>). Documentation also says that<br> you <em>very</em> likely do <em>NOT</em> need to use this argument.</p> <p>Usage in my particular case would look like this:</p> <pre>LIBNAME = 'xxx' TYPELIB = WIN32OLE_TYPELIB.new(LIBNAME) lic = 'xxxx' foo = WIN32OLE.new( TYPELIB.ole_type.find { |t| t.name == 'Foo' }, nil, license: lic, iface: '{00000000-0000-0000-0000-000000000000}' ) foo.Bar(1, 2, 'foobar') </pre> <p>as you can see, except for the need to specify the interface, it works exactly<br> same as normal classes.</p> <p>Please consider for merge <code>^_^</code></p> Ruby master - Feature #14225 (Open): untaint hash key strings https://bugs.ruby-lang.org/issues/14225 2017-12-23T02:08:40Z normalperson (Eric Wong) [email protected] <p>Since we are working on deprecating and removing $SAFE for [Feature <a class="issue tracker-2 status-6 priority-4 priority-default closed" title="Feature: $SAFE should be removed (Rejected)" href="https://bugs.ruby-lang.org/issues/5455">#5455</a>],<br> I propose untainting all string keys used for hashes in Ruby 2.6.</p> <p>It will make implementing <a href="fstring dedupe of hash keys" class="external">Feature #13725</a> easier.</p> <p>Furthermore, Perl (which I assume is the influence for tainting in Ruby) does<br> not taint hash keys. In fact, perlsec(1) manpage states:<br> "Hash keys are never tainted"<br> cf. <a href="http://perldoc.perl.org/perlsec.html">http://perldoc.perl.org/perlsec.html</a></p> Ruby master - Misc #14190 (Open): What are the semantics of $SAFE? https://bugs.ruby-lang.org/issues/14190 2017-12-15T16:29:10Z Eregon (Benoit Daloze) <p>$SAFE is documented in many places as thread-local, but it seems more than that.<br> For example:</p> <pre># a.rb $SAFE=1 p $SAFE require "#{Dir.pwd.untaint}/b.rb" # b.rb p [:in_b, $SAFE] </pre> <p>gives:</p> <pre>$ ruby -r./a -e 'p $SAFE' 1 [:in_b, 0] 0 </pre> <p>So in b and in -e, $SAFE is 0.<br> Is it file-based somehow?</p> <p>I was trying to understand what<br> <a href="https://github.com/ruby/ruby/blob/7c4306e6e9c3c4a255f4ad20134c1832dbe45ba2/test/rubygems/test_gem.rb#L9-L13">https://github.com/ruby/ruby/blob/7c4306e6e9c3c4a255f4ad20134c1832dbe45ba2/test/rubygems/test_gem.rb#L9-L13</a><br> is supposed to do.<br> Does it make sense? What does it do?<br> It seems the test_* methods in that file actually read $SAFE as 0, not 1.</p> Ruby master - Bug #14137 (Open): Windows / MinGW - Regexp - Character Properties - General Category https://bugs.ruby-lang.org/issues/14137 2017-11-28T15:38:56Z MSP-Greg (Greg L) <p>While testing RDoc on Appveyor, and the recently 'added' literals.kpeg file, I had several errors across Ruby versions 2.2 thru trunk.</p> <p>It seems that the <code>\p{}</code> constructs listed <a href="https://msp-greg.github.io/ruby_trunk/file.regexp.html#label-Character+Properties" class="external">here</a> under 'General Category' generate an <code>invalid character property name {**}</code> error for many of the listed constructs.</p> <p>Conversely, the constructs listed previously (eg \p{Alpha}, \p{Lower}, \p{Space}, etc) seem to work.</p> <p>I briefly looked at the regexp tests, and they don't seem to test these.</p> <p>Are these unavailable on Windows?</p> Ruby master - Feature #14079 (Open): Validate argument list without calling method https://bugs.ruby-lang.org/issues/14079 2017-11-04T18:25:54Z nate00 (Nate Sullivan) <p>I would find it useful to check whether a list of arguments matches a method signature, but without calling the method.</p> <p>I'd like to check the arguments list using a method called, for example, <code>respond_to_arguments?</code>. Here's an example:</p> <pre><code class="ruby syntaxhl"><span class="k">class</span> <span class="nc">Foobar</span> <span class="k">def</span> <span class="nc">self</span><span class="o">.</span><span class="nf">baz</span><span class="p">(</span><span class="n">str</span><span class="p">)</span> <span class="k">end</span> <span class="k">end</span> <span class="c1"># Foobar.baz accepts 1 argument, not 0 or 2:</span> <span class="no">Foobar</span><span class="p">.</span><span class="nf">respond_to_arguments?</span><span class="p">(</span><span class="ss">:baz</span><span class="p">,</span> <span class="s2">"one"</span><span class="p">,</span> <span class="s2">"two"</span><span class="p">)</span> <span class="c1"># => false</span> <span class="no">Foobar</span><span class="p">.</span><span class="nf">respond_to_arguments?</span><span class="p">(</span><span class="ss">:baz</span><span class="p">,</span> <span class="s2">"one"</span><span class="p">)</span> <span class="c1"># => true</span> <span class="no">Foobar</span><span class="p">.</span><span class="nf">respond_to_arguments?</span><span class="p">(</span><span class="ss">:baz</span><span class="p">)</span> <span class="c1"># => false</span> <span class="c1"># Indeed, we get an ArgumentError if we pass 0 or 2 arguments:</span> <span class="no">Foobar</span><span class="p">.</span><span class="nf">baz</span><span class="p">(</span><span class="s2">"one"</span><span class="p">,</span> <span class="s2">"two"</span><span class="p">)</span> <span class="c1"># raises ArgumentError</span> <span class="no">Foobar</span><span class="p">.</span><span class="nf">baz</span><span class="p">(</span><span class="s2">"one"</span><span class="p">)</span> <span class="c1"># success!</span> <span class="no">Foobar</span><span class="p">.</span><span class="nf">baz</span> <span class="c1"># raises ArgumentError</span> </code></pre> <p>My use case is a background job processing system. It works like this: I call <code>MyWorker.perform_async</code> with some arguments; the arguments are serialized and put into a queue; and then a background worker takes those arguments from the queue, deserializes them and passes them to <code>MyWorker.perform</code>. If I passed invalid arguments, I don't know they were invalid until the background worker tries to call <code>perform</code>. But I'd like to know immediately when I call <code>perform_async</code>.</p> <p>Perhaps a <code>respond_to_arguments_missing?</code> method would be required also.</p> <p>Maybe <code>respond_to_arguments?</code> is a bad name. You could reasonably assume that it takes the same optional second parameter as <code>respond_to?</code> (i.e., <code>include_all</code>), but my proposal doesn't support an optional second parameter.</p> <p>Thank you for your consideration!</p> Ruby master - Misc #14037 (Open): Writing doxygen document comments to static functions https://bugs.ruby-lang.org/issues/14037 2017-10-21T07:46:19Z sonots (Naotoshi Seo) [email protected] <p>I often feel that C API documents are lacked in C source codes, especially for <code>static</code> functions.</p> <p>With <a href="https://bugs.ruby-lang.org/issues/904">https://bugs.ruby-lang.org/issues/904</a>, <code>make install-capi</code> target was introduced to generate c api documents using Doxygen.<br> However, I feel that it is not utilized among C Ruby developers.</p> <p>I propose to turn <code>EXTRACT_STATIC = YES</code> flag of Doxygen to YES, and write document comments for static functions as much as possible.</p> Ruby master - Feature #13881 (Open): Use getcontext/setcontext on OS X https://bugs.ruby-lang.org/issues/13881 2017-09-08T09:10:50Z naruse (Yui NARUSE) [email protected] <p>getcontext/setcontext is first appeared on OS X 10.5 but deprecated on 10.6.<br> It seems because POSIX removed them from recent specs.</p> <p>IEEE Std 1003.1, 2004 Edition says makecontext's use of function declarators with empty parentheses<br> is an obsolescent feature.<br> <a href="http://pubs.opengroup.org/onlinepubs/009695399/functions/makecontext.html">http://pubs.opengroup.org/onlinepubs/009695399/functions/makecontext.html</a></p> <p>Then POSIX.1-2008 removed those functions.</p> <p>But OS X 10.13 still has them maybe because some essential applications uses them for co-routines.<br> Therefore we can use them for performance.</p> <pre>diff --git a/configure.in b/configure.in index 08e109317f..3e75eb3cf2 100644 --- a/configure.in +++ b/configure.in @@ -1142,8 +1142,6 @@ AS_CASE(["$target_os"], ac_cv_header_syscall_h=no ]) AS_IF([test $macosx_10_5 = yes], [ - ac_cv_func_getcontext=no - ac_cv_func_setcontext=no ], [ AC_DEFINE(BROKEN_SETREUID, 1) AC_DEFINE(BROKEN_SETREGID, 1) diff --git a/cont.c b/cont.c index c86095775c..f94883ef02 100644 --- a/cont.c +++ b/cont.c @@ -65,7 +65,15 @@ #ifndef _WIN32 #include <unistd.h> #include <sys/mman.h> -#include <ucontext.h> +# ifdef __APPLE__ +/* avoid deprecated maks on ucontext.h */ +int getcontext(ucontext_t *); +void makecontext(ucontext_t *, void (*)(), int, ...); +int setcontext(const ucontext_t *); +int swapcontext(ucontext_t * __restrict, const ucontext_t * __restrict); +# else +# include <ucontext.h> +# endif #endif #define RB_PAGE_SIZE (pagesize) #define RB_PAGE_MASK (~(RB_PAGE_SIZE - 1)) </pre> Ruby master - Feature #13763 (Open): Trigger "unused variable warning" for unused variables in pa... https://bugs.ruby-lang.org/issues/13763 2017-07-24T12:16:29Z rovf (Ronald Fischer) [email protected] <p>Consider the following program nowa.rb:</p> <pre>def foo(a) end %w(x).each {|y|} foo(1) z=5 </pre> <p>If I syntax-check it with <em>ruby -cw nowa.rb</em> I get the following warning:</p> <pre>nowa.rb:5: warning: assigned but unused variable - z </pre> <p>Ruby complains about z, but does not complain about a and y, even though these are also variables which receive a value which never is used. I suggest to issue a warning in these cases too.</p> <p>Tested with: ruby 2.3.3p222 (2016-11-21 revision 56859) [x86_64-cygwin]</p> Ruby master - Bug #13644 (Open): Windows - Setting Time.now https://bugs.ruby-lang.org/issues/13644 2017-06-09T03:00:12Z MSP-Greg (Greg L) <p>While reviewing a MinGW build <code>test-all</code> failure in <a href="https://github.com/ruby/ruby/blob/trunk/test/logger/test_logdevice.rb#L687-L727" class="external">TestLogDevice#test_shifting_midnight_exist_file</a>, I determined the cause. The test in question (and other tests that seem to have newer/better exception handling) sets <code>Time.now</code>.</p> <p>The thread <a href="https://stackoverflow.com/questions/650849/change-system-date-programmatically" class="external">StackOverflow - Change system date programmatically</a> seems to imply that in some instances/configurations, changing the system time on Windows systems requires elevated permissions.</p> <p>I tested on both a mswin build (<code>ruby 2.5.0dev (2017-05-27 trunk 58922) [x64-mswin64_140]</code>) and a MinGW build (<code>ruby 2.5.0dev (2017-06-08 trunk 59046) [x64-mingw32]</code>), and both responded to:</p> <pre><code class="ruby syntaxhl"><span class="no">Time</span><span class="p">.</span><span class="nf">now</span> <span class="o">=</span> <span class="no">Time</span><span class="p">.</span><span class="nf">mktime</span><span class="p">(</span><span class="mi">2017</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">)</span> </code></pre> <p>with the following eror:</p> <pre>undefined method `now=' for Time:Class (NoMethodError) </pre> <p>Both also had <code>false = Time.respond_to?(:now=)</code>.</p> <p>So, I'm confused as to how this test passes on mswin. Regardless, the test requires a skip to bypass it and allow MinGW test-all to pass.</p> <p>I thought I'd file an issue before doing a PR. I'm building and testing on Win7. Finally, if anyone has time, where is the method <code>now=</code> defined?</p> Ruby master - Bug #13392 (Open): TracePoint doesn't work correct with monkey patches / aliased me... https://bugs.ruby-lang.org/issues/13392 2017-03-31T20:39:09Z areman01 (André Kullmann) <p><strong>Command</strong></p> <pre><code class="ruby syntaxhl"><span class="n">ruby</span> <span class="n">tracepoint_bug</span><span class="p">.</span><span class="nf">rb</span> </code></pre> <p><strong>Output</strong></p> <pre>ruby-2.4.1-p111 (x86_64-linux) tracepoint_bug_ext.rb:4 call to_s tracepoint_bug_ext.rb:5 c_call to_s tracepoint_bug_ext.rb:5 c_return to_s racepoint_bug.rb:12 return to_s </pre> <p>Why the <strong>call event</strong> on <em>to_s</em> is in file <em>tracepoint_bug_ext.rb</em> and the <strong>return event</strong> in file <em>tracepoint_bug.rb</em>? I think it's a bug. In jruby, for example, the call and the return event are both fired in the tracepoint_bug_ext.rb file. </p> Ruby master - Misc #13154 (Open): URI::Generic, == operator, normalize! https://bugs.ruby-lang.org/issues/13154 2017-01-24T11:45:20Z deman_killer (Dmitry Sk) <p>This two URI means the same:</p> <pre>uri1 = URI::parse '/1/2/3' uri2 = URI::parse 'file:///1/2/3' `` but `uri1 == uri2` return **false** it is cause of normalize! implementation that compare scheme this way: </pre> <p>if scheme && scheme != scheme.downcase<br> set_scheme(self.scheme.downcase)<br> end</p> <pre>But nil scheme actually equivalent to file </pre> Ruby master - Bug #13094 (Open): Zlib::GzipReader eof?がfalseなのにgetsでnilが返ってくる https://bugs.ruby-lang.org/issues/13094 2017-01-02T03:35:46Z iehn (Hironao TSUTSUMIDA) <p>下記のように、eof?がfalseであればgetsでnilが返ってくることはないことを期待してるとエラーが起きてしまいます。<br> zlibでeof?は非推奨でしょうか？</p> <pre><code class="ruby syntaxhl"><span class="nb">require</span> <span class="s1">'zlib'</span> <span class="n">o</span> <span class="o">=</span> <span class="p">(</span><span class="s1">'!'</span><span class="o">..</span><span class="s1">'~'</span><span class="p">).</span><span class="nf">to_a</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">225</span> <span class="mi">1000</span><span class="p">.</span><span class="nf">times</span> <span class="k">do</span> <span class="no">Zlib</span><span class="o">::</span><span class="no">GzipWriter</span><span class="p">.</span><span class="nf">open</span><span class="p">(</span><span class="s1">'./s.gz'</span><span class="p">)</span> <span class="k">do</span> <span class="o">|</span><span class="n">gz</span><span class="o">|</span> <span class="n">i</span><span class="p">.</span><span class="nf">times</span> <span class="k">do</span> <span class="n">gz</span><span class="p">.</span><span class="nf">write</span><span class="p">(</span><span class="n">o</span><span class="p">.</span><span class="nf">sample</span><span class="p">(</span><span class="mi">10</span><span class="p">)</span><span class="o">*</span><span class="s2">""</span><span class="o">+</span><span class="s2">"</span><span class="se">\n</span><span class="s2">"</span><span class="p">)</span> <span class="k">end</span> <span class="k">end</span> <span class="no">Zlib</span><span class="o">::</span><span class="no">GzipReader</span><span class="p">.</span><span class="nf">open</span><span class="p">(</span><span class="s2">"./s.gz"</span><span class="p">)</span> <span class="p">{</span> <span class="o">|</span><span class="n">gz</span><span class="o">|</span> <span class="nb">puts</span> <span class="n">gz</span><span class="p">.</span><span class="nf">gets</span><span class="p">.</span><span class="nf">chomp!</span> <span class="k">until</span> <span class="n">gz</span><span class="p">.</span><span class="nf">eof?</span> <span class="p">}</span> <span class="nb">puts</span> <span class="s2">"</span><span class="si">#{</span><span class="n">i</span><span class="si">}</span><span class="s2">, </span><span class="si">#{</span><span class="no">File</span><span class="p">.</span><span class="nf">size</span><span class="p">(</span><span class="s1">'./s.gz'</span><span class="p">)</span><span class="si">}</span><span class="s2">"</span> <span class="k">if</span> <span class="no">File</span><span class="p">.</span><span class="nf">size</span><span class="p">(</span><span class="s1">'./s.gz'</span><span class="p">)</span> <span class="o">></span> <span class="mi">2058</span> <span class="n">i</span> <span class="o">-=</span> <span class="mi">1</span> <span class="k">else</span> <span class="n">i</span> <span class="o">+=</span> <span class="mi">1</span> <span class="k">end</span> <span class="k">end</span> </code></pre><pre><code class="ruby syntaxhl"><span class="o">-</span><span class="p">:</span><span class="mi">10</span><span class="ss">:in</span> <span class="sb">`block (2 levels) in <main>': undefined method `</span><span class="nb">chomp!</span><span class="s1">' for nil:NilClass (NoMethodError) from -:10:in `open'</span> <span class="n">from</span> <span class="o">-</span><span class="p">:</span><span class="mi">10</span><span class="ss">:in</span> <span class="sb">`block in <main>' from -:4:in `</span><span class="n">times</span><span class="s1">' from -:4:in `<main>'</span> </code></pre> Ruby master - Feature #12928 (Open): Use socket conect_timeout in net stdlib for open_timeout https://bugs.ruby-lang.org/issues/12928 2016-11-13T10:32:38Z xiewenwei (xie wenwei) [email protected] <p>Current net/http and net/pop use Timeout.timeout to tigger open_timeout event.<br> Timeout.timeout is slow. It will create and destroy a thread every time.<br> Timeout.timeout is also dangerous. see [[[http://www.mikeperham.com/2015/05/08/timeout-rubys-most-dangerous-api/]]]</p> <p>It is more effective and safe to use socket timeout to accomplish this. <br> Follow is the changes need to do.</p> <ol> <li>Replace TCPSocket.open with Socket.new</li> <li>Use socket.connect_nonblock and IO.select to connect and trigger timeout event.</li> </ol> <p>The pull request is here:<br> [[[https://github.com/ruby/ruby/pull/1480]]]</p> Ruby master - Bug #12852 (Open): URI.parse can't handle non-ascii URIs https://bugs.ruby-lang.org/issues/12852 2016-10-18T20:10:50Z olivierlacan (Olivier Lacan) [email protected] <p>Given a return URL path like: <code>/search?utf8=\u{2713}&q=foo</code>, <code>URI.parse</code> raises the following exception: </p> <pre><code class="ruby syntaxhl"><span class="no">URI</span><span class="p">.</span><span class="nf">parse</span> <span class="s2">"/search?utf8=</span><span class="se">\u</span><span class="s2">{2713}&q=foo"</span> <span class="no">URI</span><span class="o">::</span><span class="no">InvalidURIError</span><span class="p">:</span> <span class="no">URI</span> <span class="n">must</span> <span class="n">be</span> <span class="n">ascii</span> <span class="n">only</span> <span class="s2">"/search?utf8=</span><span class="se">\u</span><span class="s2">{2713}&q=foo"</span> </code></pre> <p>This <code>\u{2713}</code> character is commonly used by web frameworks like Rails to enforce UTF-8 in forms: <a href="https://github.com/rails/rails/blob/92703a9ea5d8b96f30e0b706b801c9185ef14f0e/actionview/lib/action_view/helpers/form_tag_helper.rb#L823-L830">https://github.com/rails/rails/blob/92703a9ea5d8b96f30e0b706b801c9185ef14f0e/actionview/lib/action_view/helpers/form_tag_helper.rb#L823-L830</a></p> <pre><code class="ruby syntaxhl"><span class="s2">"</span><span class="se">\u</span><span class="s2">{2713}"</span> <span class="o">=></span> <span class="s2">"✓"</span> </code></pre> <p>Is it unreasonable to expect non-ascii portion of URIs to be handled by URI.parse? The way to circumvent this issue is to call URI.encode on the URI string prior to passing it to URI.parse:</p> <pre><code class="ruby syntaxhl"><span class="no">URI</span><span class="p">.</span><span class="nf">parse</span> <span class="no">URI</span><span class="p">.</span><span class="nf">encode</span><span class="p">(</span><span class="s2">"/search?utf8=</span><span class="se">\u</span><span class="s2">{2713}&q=foo"</span><span class="p">)</span> <span class="o">=></span> <span class="c1">#<URI::Generic /search?utf8=%E2%9C%93&q=foo></span> </code></pre> <p>By comparison, a library like Addressable parses this URI without issue.</p> <pre>require "addressable/uri" => #<Addressable::URI:0x3feffa84158c URI:/search?utf8=✓&q=foo> </pre> <p>This is how Addressable implements parsing:<br> <a href="https://github.com/sporkmonger/addressable/blob/a15b7045a09911bcc47b106200554809c879a5f6/lib/addressable/uri.rb#L75-L145">https://github.com/sporkmonger/addressable/blob/a15b7045a09911bcc47b106200554809c879a5f6/lib/addressable/uri.rb#L75-L145</a></p> <p>PS: Tried under MRI 2.3.1 and 2.4.0-preview1</p> Ruby master - Feature #12650 (Open): Use UTF-8 encoding for ENV on Windows https://bugs.ruby-lang.org/issues/12650 2016-08-03T00:53:42Z davispuh (Dāvis Mosāns) <p>Windows environment variables supports Unicode (same wide WinAPI) and so there's no reason to limit ourselves to any codepage.<br> Currently ENV would use locale's encoding (console's codepage) which obviously won't work correctly for characters outside of those codepages.</p> <p>I've attached a patch which implements this and fixes bug <a class="issue tracker-1 status-1 priority-4 priority-default" title="Bug: ENV data yield ASCII-8BIT encoded strings under Windows with unicode username (Open)" href="https://bugs.ruby-lang.org/issues/9715">#9715</a></p> Ruby master - Feature #12625 (Open): TypeError.assert, ArgumentError.assert https://bugs.ruby-lang.org/issues/12625 2016-07-24T23:36:24Z eike.rb (Eike Dierks) [email protected] <p>I am well aware that ruby is not typed (and so for a good reason)</p> <p>But sometimes it makes sense to check the types (or values) of arguments upfront.<br> (It actually helps to narrow down your arguments to the known)</p> <p>I'd like to suggest an extension to all the Error types.<br> (I should obviously come up with a gem first, but you get me)</p> <p>I frequently write (in the prologue)<br> raise TypeError.new(...) unless SomeClass === arg</p> <p>I suggest to extend TypeError so that I could write instead:<br> TypeError.assert(msg)(SomeClass, arg)<br> and i'd expect that to raise the exception in the calling frame (which can be done via the binding?)</p> <p>We might want to do the same for ArgumentError:<br> ArgumentError.assert(msg){|arg| arg.nil?}<br> ArgumentError.assert('too low'){|arg| arg<0}</p> <p>But obviously, this api is just a first shot.</p> <p>I'm with you: we can't check args at compile time.<br> But checking args at runtime<br> should be done via well known verses.</p> <p>added bonus:<br> we might want to make that a domain language.<br> We could attach the argument checking rules to the method.</p> <p>This might help in generating automated testing rules.</p> <hr> <p>No one wants types.<br> but annotating types helps a lot.</p> <p>It helps in documenting the code.<br> It helps in making the code more foolproof.</p> <pre>def foo(arg) TypeError.assert(String, arg) # should raise in the foo frame if arg is not of type String ... end </pre> Ruby master - Feature #12589 (Open): VM performance improvement proposal https://bugs.ruby-lang.org/issues/12589 2016-07-18T03:24:41Z vmakarov (Vladimir Makarov) <p>Hello. I'd like to start a big MRI project but I don't want to<br> disrupt somebody else plans. Therefore I'd like to have MRI<br> developer's opinion on the proposed project or information if somebody<br> is already working on an analogous project.</p> <p>Basically I want to improve overall MRI VM performance:</p> <ul> <li><p>First of all, I'd like to change VM insns and move from<br> <strong>stack-based</strong> insns to <strong>register transfer</strong> ones. The idea behind<br> it is to decrease VM dispatch overhead as approximately 2 times<br> less RTL insns are necessary than stack based insns for the same<br> program (for Ruby it is probably even less as a typical Ruby program<br> contains a lot of method calls and the arguments are passed through<br> the stack).</p> <p>But <em>decreasing memory traffic</em> is even more important advantage<br> of RTL insns as an RTL insn can address temporaries (stack) and<br> local variables in any combination. So there is no necessity to<br> put an insn result on the stack and then move it to a local<br> variable or put variable value on the stack and then use it as an<br> insn operand. Insns doing more also provide a bigger scope for C<br> compiler optimizations.</p> <p>The biggest changes will be in files compile.c and insns.def (they<br> will be basically rewritten). <strong>So the project is not a new VM<br> machine. MRI VM is much more than these 2 files.</strong></p> <p>The disadvantage of RTL insns is a bigger insn memory footprint<br> (which can be upto 30% more) although as I wrote there are fewer<br> number of RTL insns.</p> <p>Another disadvantage of RTL insns <em>specifically</em> for Ruby is that<br> insns for call sequences will be basically the same stack based<br> ones but only bigger as they address the stack explicitly.</p></li> <li><p>Secondly, I'd like to <strong>combine some frequent insn sequences</strong> into<br> bigger insns. Again it decreases insn dispatch overhead and<br> memory traffic even more. Also it permits to remove some type<br> checking.</p> <p>The first thing on my mind is a sequence of a compare insn and a<br> branch and using immediate operands besides temporary (stack) and<br> local variables. Also it is not a trivial task for Ruby as the<br> compare can be implemented as a method.</p></li> </ul> <p>I already did some experiments. RTL insns & combining insns permits<br> to speed the following micro-benchmark in more 2 times:</p> <pre>i = 0 while i<30_000_000 # benchmark loop 1 i += 1 end </pre> <p>The generated RTL insns for the benchmark are</p> <pre>== disasm: #<ISeq:<main>@while.rb>====================================== == catch table | catch type: break st: 0007 ed: 0020 sp: 0000 cont: 0020 | catch type: next st: 0007 ed: 0020 sp: 0000 cont: 0005 | catch type: redo st: 0007 ed: 0020 sp: 0000 cont: 0007 |------------------------------------------------------------------------ local table (size: 2, temp: 1, argc: 0 [opts: 0, rest: -1, post: 0, block: -1, kw: -1@-1, kwrest: -1]) [ 2] i 0000 set_local_val 2, 0 ( 1) 0003 jump 13 ( 2) 0005 jump 13 0007 plusi <callcache>, 2, 2, 1, -1 ( 3) 0013 btlti 7, <callcache>, -1, 2, 30000000, -1 ( 2) 0020 local_ret 2, 0 ( 3) </pre> <p>In this experiment I ignored trace insns (that is another story) and a<br> complication that a integer compare insn can be re-implemented as a<br> Ruby method. Insn bflti is combination of LT immediate compare and<br> branch true.</p> <p>A modification of fib benchmark is sped up in 1.35 times:</p> <pre>def fib_m n if n < 1 1 else fib_m(n-1) * fib_m(n-2) end end fib_m(40) </pre> <p>The RTL code of fib_m looks like</p> <pre>== disasm: #<ISeq:[email protected]>========================================== local table (size: 2, temp: 3, argc: 1 [opts: 0, rest: -1, post: 0, block: -1, kw: -1@-1, kwrest: -1]) [ 2] n<Arg> 0000 bflti 10, <callcache>, -1, 2, 1, -1 ( 2) 0007 val_ret 1, 16 0010 minusi <callcache>, -2, 2, 1, -2 ( 5) 0016 simple_call_self <callinfo!mid:fib_m, argc:1, FCALL|ARGS_SIMPLE>, <callcache>, -1 0020 minusi <callcache>, -3, 2, 2, -3 0026 simple_call_self <callinfo!mid:fib_m, argc:1, FCALL|ARGS_SIMPLE>, <callcache>, -2 0030 mult <callcache>, -1, -1, -2, -1 0036 temp_ret -1, 16 </pre> <p>In reality, the improvement of most programs probably will be about<br> 10%. That is because of very dynamic nature of Ruby (a lot of calls,<br> checks for redefinition of basic type operations, checking overflows<br> to switch to GMP numbers). For example, integer addition can not be<br> less than about x86-64 17 insns out of the current 50 insns on the<br> fast path. So even if you make the rest (33) insns 2 times faster,<br> the improvement will be only 30%.</p> <p>A very important part of MRI performance improvement is to make calls<br> fast because there are a lot of them in Ruby but as I read in some<br> Koichi Sasada's presentations he pays a lot of attention to it. So I<br> don't want to touch it.</p> <ul> <li><p>Thirdly. I want to implement the insns as small inline functions<br> for future AOT compiler, of course, if the projects described<br> above are successful. It will permit easy AOT generation of C code<br> which will be basically calls of the functions.</p> <p>I'd like to implement AOT compiler which will generate a Ruby<br> method code, call a C compiler to generate a binary shared code<br> and load it into MRI for subsequent calls. The key is to minimize<br> the compilation time. There are many approaches to do it but I<br> don't want to discuss it right now.</p> <p>C generation is easy and most portable implementation of AOT but<br> in future it is possible to use GCC JIT plugin or LLVM IR to<br> decrease overhead of C scanner/parser.</p> <p>C compiler will see a bigger scope (all method insns) to do<br> optimizations. I think using AOT can give another 10%<br> improvement. It is not that big again because of dynamic nature<br> of Ruby and any C compiler is not smart enough to figure out<br> aliasing for typical generated C program.</p> <p>The life with the performance point of view would be easy if Ruby<br> did not permit to redefine basic operations for basic types,<br> e.g. plus for integer. In this case we could evaluate types of<br> operands and results using some data flow analysis and generate<br> faster specialized insns. Still a gradual typing if it is<br> introduced in future versions of Ruby would help to generate such<br> faster insns.</p></li> </ul> <p>Again I wrote this proposal for discussion as I don't want to be in<br> a position to compete with somebody else ongoing big project. It<br> might be counterproductive for MRI development. Especially I don't<br> want it because the project is big and long and probably will have a<br> lot of tehcnical obstacles and have a possibilty to be a failure.</p> Ruby master - Misc #12567 (Open): Where is parser.bundle ? https://bugs.ruby-lang.org/issues/12567 2016-07-07T18:06:13Z waghanza (Marwan Rabbâa) [email protected] <p>Hello,</p> <p>Ruby 2.3 add native json support.</p> <p>The <code>json</code> <strong>gemspec</strong> files, list :</p> <ul> <li>json.rb</li> <li>json/add/bigdecimal.rb</li> <li>json/add/complex.rb</li> <li>...</li> <li>json/ext/generator.bundle</li> <li>json/ext/parser.bundle</li> </ul> <p>Where can I find / how can I generate those files ?</p> <p>Regards,</p> Ruby master - Feature #12435 (Open): Using connect_nonblock to open TCP connections in Net::HTTP#... https://bugs.ruby-lang.org/issues/12435 2016-05-28T19:57:30Z mohamedhafez (Mohamed Hafez) <p>Hey all, I've got a pull request at <a href="https://github.com/ruby/ruby/pull/1370">https://github.com/ruby/ruby/pull/1370</a> to start using connect_nonblock to open the TCP socket in Net::HTTP#connect, instead of doing a blocking connect that uses Timeout.timeout to look for timeouts. Using connect_nonblock is more efficient since it doesn't involve spinning up a separate thread to watch for timeouts, and also it avoids the race conditions inherent in the use of Timeout.timeout, as detailed in <a href="http://blog.headius.com/2008/02/ruby-threadraise-threadkill-timeoutrb.html">http://blog.headius.com/2008/02/ruby-threadraise-threadkill-timeoutrb.html</a></p> <p>Over the last few versions of ruby there have been analogous fixes accepted to do this for opening an SSL connection in Net::HTTP#connect, so I'm guessing this shouldn't be too controversial, unless there is some issue I'm not aware of that kept the maintainers from implementing this as well...</p> Ruby master - Bug #12261 (Open): Windows: File.dirname with 2+ / or 2+ \\ will return // or \\\\ https://bugs.ruby-lang.org/issues/12261 2016-04-07T19:30:56Z enebo (Thomas Enebo) [email protected] <p>I am working through some File.dirname issues on JRuby and I saw a ruby/spec covering this behavior on windows:</p> <p><code>File.dirname('/////').should == '//'</code></p> <p>Same result if backslashes are used. Is there a reason for this result? It does not seem useful to me but I am not much of a windows user. I would think in this case it would be '/' since I don't see how this is useful for UNC paths in Ruby? If someone could explain it then I will document this at least in JRuby source code :)</p> <p>So far all versions of MRI seem to have this behavior.</p> Ruby master - Bug #12235 (Open): URI.encode issue with square brackets https://bugs.ruby-lang.org/issues/12235 2016-03-31T09:53:06Z lucaspiller (Luca Spiller) <p>URI::Encode doesn't correctly handle square brackets in the path of a URL:</p> <pre>> URI.encode('http://example.com/resource[1].doc') => "http://example.com/resource[1].doc" </pre> <p>It should return "<a href="http://example.com/resource%5B1%5D.doc">http://example.com/resource%5B1%5D.doc</a>".</p> <p>As per <a href="http://tools.ietf.org/html/rfc3986#appendix-D.1" class="external">RFC3986</a>, square brackets are only valid in the host part, not the path part.</p> <p>URI.parse correctly raises an error if a URL has square brackets in the path, which means URI::encode can return something that is rejected by URI.parse:</p> <pre>> URi.parse('http://example.com/resource[1].doc') URI::InvalidURIError: bad URI(is not URI?): http://example.com/resource[1].doc > URI.parse(URI::encode('http://example.com/resource[1].doc')) URI::InvalidURIError: bad URI(is not URI?): http://example.com/resource[1].doc </pre> <p>Tested on Ruby 2.1.5 and 2.3.0 on OS X and Linux.</p> Ruby master - Misc #12124 (Open): Use Automake https://bugs.ruby-lang.org/issues/12124 2016-02-28T08:24:49Z cjcollier (C.J. Collier) <p>It looks like there is a lot of duplicate code that could be removed by making use of automake.</p> <p>Are there any reasons why this should not be done?</p> <p>I've got some patches up for review here:</p> <p><a href="https://github.com/ruby/ruby/compare/trunk...LLC-Technologies-Collier:trunk?expand=1">https://github.com/ruby/ruby/compare/trunk...LLC-Technologies-Collier:trunk?expand=1</a></p> Ruby master - Feature #12114 (Open): $VERBOSE = true is being ignored https://bugs.ruby-lang.org/issues/12114 2016-02-26T11:18:06Z rovf (Ronald Fischer) [email protected] <p>This programm correctly complains about "assigned but unused variable - p"</p> <pre><code class="ruby syntaxhl"><span class="c1">#!/usr/bin/ruby -w</span> <span class="nb">p</span><span class="o">=</span><span class="mi">1</span> </code></pre> <p>However, this one doesn't</p> <pre><code class="ruby syntaxhl"><span class="c1">#!/usr/bin/ruby</span> <span class="k">BEGIN</span> <span class="p">{</span><span class="vg">$VERBOSE</span> <span class="o">=</span> <span class="kp">true</span><span class="p">}</span> <span class="nb">p</span><span class="o">=</span><span class="mi">1</span> </code></pre> <p>Setting <code>$VERBOSE</code> to true in a <code>BEGIN</code> block should have the same effect as providing it on the command line, but this is obviously not the case.</p> Ruby master - Feature #12086 (Open): using: option for instance_eval etc. https://bugs.ruby-lang.org/issues/12086 2016-02-19T07:34:02Z shugo (Shugo Maeda) <p>Currently refinements can be activated only in toplevel or class/module definitions.<br> If they can be activated in block-level, it's useful to implement internal DSLs.</p> <p>How about to add a new option using: for Kernel#instance_eval and Moule#{class,module}_eval?</p> <pre><code class="ruby syntaxhl"><span class="k">module</span> <span class="nn">FixnumDivExt</span> <span class="n">refine</span> <span class="no">Fixnum</span> <span class="k">do</span> <span class="k">def</span> <span class="nf">/</span><span class="p">(</span><span class="n">other</span><span class="p">)</span> <span class="n">quo</span><span class="p">(</span><span class="n">other</span><span class="p">)</span> <span class="k">end</span> <span class="k">end</span> <span class="k">end</span> <span class="nb">p</span> <span class="mi">1</span> <span class="o">/</span> <span class="mi">2</span> <span class="c1">#=> 0</span> <span class="nb">instance_eval</span><span class="p">(</span><span class="ss">using: </span><span class="no">FixnumDivExt</span><span class="p">)</span> <span class="k">do</span> <span class="nb">p</span> <span class="mi">1</span> <span class="o">/</span> <span class="mi">2</span> <span class="c1">#=> (1/2)</span> <span class="k">end</span> <span class="nb">p</span> <span class="mi">1</span> <span class="o">/</span> <span class="mi">2</span> <span class="c1">#=> 0</span> </code></pre> <p>Proof-of-concept implementation is available at <a href="https://github.com/shugo/ruby/tree/eval_using">https://github.com/shugo/ruby/tree/eval_using</a>.</p> <p>In my previous proposal before Ruby 2.0, refinements used in a class or module are<br> implicitly activated by instance_eval and class_eval, but now I think it's better to<br> explicitly specify refinements to be activated.</p> <p>Considerations:</p> <ul> <li>In the PoC implementation, refined methods are not cached inline, and thus it decreases the performance of refined method call. If there is a way to guarantee that blocks never be evaluated in different environments, refined methods can be cached inline.</li> <li>{instance,class,module}_exec cannot be extended in the same way, because they take arbitrary arguments and there's no way to distinguish an option hash from the last argument hash.</li> </ul> Ruby master - Feature #11781 (Open): Would it be possible to alias .prepend() towards .unshift() ... https://bugs.ruby-lang.org/issues/11781 2015-12-07T10:12:22Z shevegen (Robert A. Heiler) [email protected] <p>Hello.</p> <p>For Strings we can do:</p> <pre>abc = 'world!' abc[0,0] = 'Hello ' abc # => "Hello world!" </pre> <p>For Arrays we can do:</p> <pre>abc = ['world!'] abc[0,0] = 'Hello ' abc # => ["Hello ", "world!"] </pre> <p>This is nice.</p> <p>For Strings we can also use .prepend() to add to the beginning.</p> <p>For Arrays, we have to use .unshift().</p> <p>I have a hard time remembering .unshift though, .prepend() seems<br> to be easier for me to remember.</p> <p>I'd like to use both .prepend for Strings and Arrays; right now<br> I have to use different names. I could alias prepend to unshift<br> for class Array, but then I'd have to carry these modifications<br> into my projects, which is not so good - I would prefer to just<br> stick to what MRI is doing.</p> <p>Could we have the alias .prepend() for class Array, meaning <br> .unshift() too? That way I could use .prepend() for both Arrays<br> and Strings.</p> <p>Thanks for reading!</p> Ruby master - Feature #11690 (Open): Update Hash during multiple assignment https://bugs.ruby-lang.org/issues/11690 2015-11-15T16:30:53Z danielpclark (Daniel P. Clark) [email protected] <p>Given that we can assign multiple variables at once</p> <pre><code class="ruby syntaxhl"><span class="n">a</span><span class="p">,</span><span class="n">b</span><span class="p">,</span><span class="n">c</span> <span class="o">=</span> <span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span> </code></pre> <p>It would be nice to be able to update a Hash during multiple assignment rather than replacing it. Currently</p> <pre><code class="ruby syntaxhl"><span class="n">x</span> <span class="o">=</span> <span class="p">{</span><span class="ss">a: </span><span class="mi">1</span><span class="p">,</span> <span class="ss">b: </span><span class="mi">2</span><span class="p">}</span> <span class="n">x</span><span class="p">,</span> <span class="n">y</span> <span class="p">,</span><span class="n">z</span> <span class="o">=</span> <span class="p">{</span><span class="ss">c: </span><span class="mi">3</span><span class="p">},</span> <span class="mi">6</span><span class="p">,</span> <span class="mi">7</span> <span class="n">x</span> <span class="c1"># => {c: 3}</span> </code></pre> <p>What I propose is adding <code>Hash#update=</code> to permit updating during multiple assignment.</p> <pre><code class="ruby syntaxhl"><span class="k">class</span> <span class="nc">Hash</span> <span class="k">def</span> <span class="nf">update</span><span class="o">=</span><span class="p">(</span><span class="n">h</span><span class="p">)</span> <span class="n">update</span><span class="p">(</span><span class="n">h</span><span class="p">)</span> <span class="k">end</span> <span class="k">end</span> <span class="n">x</span> <span class="o">=</span> <span class="p">{</span><span class="ss">a: </span><span class="mi">1</span><span class="p">,</span> <span class="ss">b: </span><span class="mi">2</span><span class="p">}</span> <span class="n">x</span><span class="p">.</span><span class="nf">update</span><span class="p">,</span> <span class="n">y</span> <span class="p">,</span><span class="n">z</span> <span class="o">=</span> <span class="p">{</span><span class="ss">c: </span><span class="mi">3</span><span class="p">},</span> <span class="mi">6</span><span class="p">,</span> <span class="mi">7</span> <span class="n">x</span> <span class="c1"># => {a: 1, b: 2, c: 3}</span> </code></pre> <p>This would be most useful in scenarios where a method or proc return multiple values. When the method returns the values we don't normally know the key outside where the hash assignment is.</p> <pre><code class="ruby syntaxhl"><span class="n">example</span> <span class="o">=</span> <span class="nb">proc</span> <span class="p">{</span> <span class="p">[{</span><span class="ss">:hi</span> <span class="o">=></span> <span class="ss">:hello</span><span class="p">},</span> <span class="mi">5</span><span class="p">]</span> <span class="p">}</span> <span class="nb">hash</span> <span class="o">=</span> <span class="p">{}</span> <span class="c1"># Currently in Ruby with an Unknown key multiple assignment isn't an option</span> <span class="nb">hash</span><span class="p">[</span><span class="sc">??</span><span class="p">?</span><span class="sc">?]</span><span class="p">,</span> <span class="n">current</span> <span class="o">=</span> <span class="n">example</span><span class="p">.</span><span class="nf">call</span> <span class="c1"># We currently have to two step it</span> <span class="n">result</span><span class="p">,</span> <span class="n">current</span> <span class="o">=</span> <span class="n">example</span><span class="p">.</span><span class="nf">call</span> <span class="nb">hash</span><span class="p">.</span><span class="nf">update</span><span class="p">(</span><span class="n">result</span><span class="p">)</span> </code></pre> <p>But with <code>Hash#update=</code> we don't have to know the key.</p> Ruby master - Misc #10983 (Open): Why blocks make Ruby methods 439% slower ? https://bugs.ruby-lang.org/issues/10983 2015-03-19T09:03:44Z Sega100500 (Сергей Е) [email protected] <p><a href="https://www.omniref.com/ruby/2.2.0/symbols/Proc/yield#annotation=4087638&line=711&hn=1">https://www.omniref.com/ruby/2.2.0/symbols/Proc/yield#annotation=4087638&line=711&hn=1</a></p> <pre><code class="ruby syntaxhl"><span class="nb">require</span> <span class="s1">'benchmark/ips'</span> <span class="k">def</span> <span class="nf">block_call</span><span class="p">(</span><span class="o">&</span><span class="n">block</span><span class="p">)</span> <span class="n">block</span><span class="p">.</span><span class="nf">call</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">just_yield</span> <span class="k">yield</span> <span class="k">end</span> <span class="no">Benchmark</span><span class="p">.</span><span class="nf">ips</span> <span class="k">do</span> <span class="o">|</span><span class="n">x</span><span class="o">|</span> <span class="n">x</span><span class="p">.</span><span class="nf">report</span><span class="p">(</span><span class="s2">"call"</span><span class="p">)</span> <span class="k">do</span> <span class="n">block_call</span> <span class="p">{</span> <span class="mi">1</span> <span class="o">+</span> <span class="mi">1</span> <span class="p">}</span> <span class="k">end</span> <span class="n">x</span><span class="p">.</span><span class="nf">report</span><span class="p">(</span><span class="s2">"just yield"</span><span class="p">)</span> <span class="k">do</span> <span class="n">just_yield</span> <span class="p">{</span> <span class="mi">1</span> <span class="o">+</span> <span class="mi">1</span> <span class="p">}</span> <span class="k">end</span> <span class="n">x</span><span class="p">.</span><span class="nf">compare!</span> <span class="k">end</span> </code></pre> <p>I run on Ruby 2.2.1</p> <pre>Calculating ------------------------------------- call 40.754k i/100ms just yield 69.031k i/100ms ------------------------------------------------- call 814.929k (± 4.0%) i/s - 4.075M just yield 2.871M (±25.1%) i/s - 12.909M Comparison: just yield: 2871127.3 i/s call: 814929.3 i/s - 3.52x slower </pre> Ruby master - Feature #10879 (Open): UnboundMethod#to_proc https://bugs.ruby-lang.org/issues/10879 2015-02-21T19:56:44Z Gondolin (Damien Robert) [email protected] <p>Since unbound methods from modules can now be bound to any object, I use them a lot.<br> I think it would be very natural to be able to convert them to Proc:</p> <pre>module UnboundMethod def to_proc return lambda do |obj,*args,&b| self.bind(obj).call(*args,&b) end end end </pre> <p>This would allow things like</p> <pre>module Foo def foo self+"foo" end end ["bar","baz"].map(&Foo.instance_method(:foo)) => ["barfoo", "bazfoo"] </pre> Ruby master - Misc #10757 (Open): Vagrant environment for MRI contributors https://bugs.ruby-lang.org/issues/10757 2015-01-18T03:47:29Z anthonycrumley (Anthony Crumley) [email protected] <p>This patch includes a Vagrant file that will quickly and easily setup a development environment for MRI contributors. Following are some benefits of having a vagrant setup for contributors.</p> <ul> <li>Increase the number of contributors by making it easier to get started.</li> <li>Easy setup for someone that wants to contribute to the Ruby test suite but does not really want to become a C developer. (This is my personal motivation)</li> <li>A canonical environment to create and work through issues on.</li> </ul> Ruby master - Misc #10755 (Open): Use rb_define_alias instead of rb_define_method for rb_cHash https://bugs.ruby-lang.org/issues/10755 2015-01-18T03:10:08Z gogotanaka (Kazuki Tanaka) [email protected] <p>Hi, there.</p> <p>The main reason for using <code>rb_define_alias</code> is generating more prefer Document and making code more readable. </p> <p>Is there any reason <code>rb_define_method</code> is prefered to <code>rb_define_alias</code>?<br> If so, please let me know :)<br> If not so, I'm gonna do same thing for other part of code.</p> <p>I've sorted some methods in terms of <code>rb_define_alias</code> being very after original.</p> Ruby master - Feature #10728 (Open): Warning for Fixnum#size to use RbConfig::SIZEOF['long'] https://bugs.ruby-lang.org/issues/10728 2015-01-10T11:42:23Z akr (Akira Tanaka) [email protected] <p>How about add a warning for Fixnum#size ?</p> <pre>% ./ruby -e 'p 0.size' -e:1: warning: Use RbConfig::SIZEOF['long'] instead of Fixnum#size 8 </pre> <p>Currently it returns sizeof(long) which is 4 or 8.</p> <p>However it is implementation detail and<br> it may difficult to define it in Ruby implementations other than CRuby.</p> <p>There is a way to obtain sizeof(long): RbConfig::SIZEOF['long']<br> It works since Ruby 2.1.</p> <pre>% ruby -rrbconfig/sizeof -e "p RbConfig::SIZEOF['long']" 8 </pre> <p>So the warning is a migration path to use RbConfig::SIZEOF['long'].</p> <p>Note that this may affect many code. <br> So this issue may irritate many people.<br> fixnum-size-search.txt is a search result in gems.</p> Ruby master - Feature #10589 (Open): [TracePoint API] Make THREAD_{BEGIN, END} events return some... https://bugs.ruby-lang.org/issues/10589 2014-12-11T16:27:00Z deivid (David Rodríguez) <p>Currently the :thread_begin and thread_end events return no context information at all</p> <pre>TracePoint.trace(:thread_begin, :thread_end) do |tp| puts "#{tp.defined_class}::#{tp.method_id}@#{tp.path}:#{tp.lineno}" end t = Thread.new do sleep 1 end t.join </pre> <p>prints just</p> <pre>"Hi thread, ::@:0" "Bye thread, ::@:0" </pre> <p>It'd be nice if they gave at least some file:line context information about the thread.</p> <p>What do you think, <a class="user active" href="https://bugs.ruby-lang.org/users/17">ko1 (Koichi Sasada)</a>? Would this be possible?</p> <p>Thanks a lot</p> Ruby master - Feature #10519 (Open): TLS Renegotiation https://bugs.ruby-lang.org/issues/10519 2014-11-16T12:24:37Z bararchy (Bar Hofesh) [email protected] <p>Hello, </p> <p>It seems that the ability to force renegotiation as a client is missing or not exposed.<br> The ability is implemented in OpenSSL's s_client as the "R" character when the connection is established.<br> It will be great if that can be exposed to ruby's OpenSSL::SSL::SSLSocket</p> <p>Thanks,</p> CommonRuby - Feature #10371 (Open): Use Thread#handle_interrupt in MonitorMixin https://bugs.ruby-lang.org/issues/10371 2014-10-12T06:41:48Z nerdrew (Andrew Lazarus) [email protected] <p>Now that ruby has Thread#handle_interrupt, MonitorMixin can always unlock the mutex even when a timeout exception is raised.</p> <p>Currently, if a timeout exception is raised in MonitorMixin#mon_exit at just the wrong time, the @mon_owner is set to nil, but the @mon_mutex is still locked. ThreadError: deadlock; recursive locking is raised the next time the resource is accessed.</p> Ruby master - Feature #10251 (Open): URI: Support wildcards (globbing) in no_proxy https://bugs.ruby-lang.org/issues/10251 2014-09-17T17:24:01Z justindossey (Justin Dossey) [email protected] <p>The current implementation of URI#find_proxy will only exclude exact matches when processing the no_proxy environment variable.</p> <p>This diverges from the commonly-used no_proxy specification that supports globs (e.g. <em>.example.com, 192.168.</em>). </p> <p>Adding globbing support (perhaps using File.fnmatch) would make URI behave the same as other implementations.</p> Ruby master - Feature #10238 (Open): todo: remove dependency on malloc_usable_size https://bugs.ruby-lang.org/issues/10238 2014-09-14T00:16:28Z normalperson (Eric Wong) [email protected] <p>malloc_usable_size shows up at or near the top of many profiles for me.</p> <p>We should be able to use ruby_sized_xfree in more places; especially<br> if rb_data_type_t->dsize is defined.</p> <p>One possible improvement is to allow the rb_data_type_t->dsize pointer<br> to be a FIXNUM, removing the need for some memsize functions.</p> <p>Furthermore, over-accounting malloc-ed bytes (presumably the reason<br> malloc_usable_size was introduced). should be less harmful nowadays with<br> incremental marking.</p> Ruby master - Feature #10237 (Open): Transform all elements of one Encoding into another Encoding... https://bugs.ruby-lang.org/issues/10237 2014-09-13T22:59:19Z shevegen (Robert A. Heiler) [email protected] <p>I find myself to sometimes have to convert one encoding to the other.</p> <p>For string objects, this is trivial:</p> <p>.encode()<br> .force_encoding()</p> <p>For reading in a file via File.readlines(), this is also <br> simple because of stuff like:</p> <p>File.readlines('test.txt', :encoding => 'ascii-8bit')</p> <p>For Array and Hashes, however, this is a bit annoying for me.</p> <p>I'd love to have an .encode method as well.</p> <p>This method should try to convert all elements on an Array<br> or a Hash to another encoding IF they are a string object.</p> <p>I'd like to be able to treat Array and Hashes in the same<br> way, so that I can e. g. convert a hash dictionary from<br> one encoding to the other quickly.</p> <p>It already is possible of course, with some extra lines<br> of code, but I'd love to have a way to do so with just<br> one method call.</p> <p>:</p> Ruby master - Bug #9930 (Open): unicode filenames somehow don't work https://bugs.ruby-lang.org/issues/9930 2014-06-11T05:11:21Z rogerdpack (Roger Pack) [email protected] <p>Something seems amiss here--I can't seem to pass in a unicode filename and have it used for reading/opening a file:</p> <pre>C:\>type read.rb p ARGV p Dir['*'] p File.binread(ARGV[0]).size c:\>ruby read.rb "( ͡° ͜ʖ ͡°).mp4" ["( ?\xB0 ?? ?\xB0).mp4"] ["( ?\xB0 ?? ?\xB0).mp4"] read.rb:3:in `binread': Invalid argument - ( ?° (Errno::EINVAL) from read.rb:3:in `<main>' </pre> <p>(jruby too, fwiw...)</p> Ruby master - Feature #9909 (Open): why shouldn't constant lookup check the nesting of module's name https://bugs.ruby-lang.org/issues/9909 2014-06-06T14:43:18Z rits (First Last) <p>module A<br> module B<br> end<br> end</p> <p>above, B will have access to A's constants<br> but below, it won't</p> <p>module A::B<br> end</p> <p>is there a reason why the nesting of the name should not be part of the constant resolution algorithm?</p> <p>when adding or reopening (deeply) nested modules/classes the :: syntax would be preferable, but you lose constant resolution</p> Ruby master - Bug #9806 (Open): URI#encode doesn't encode characters '[' and ']'. They should be... https://bugs.ruby-lang.org/issues/9806 2014-05-06T01:29:36Z charlez (Charles Leu) [email protected] <p>The subject says it all.</p> <p>IRB session demonstrating the problem:<br> charlez$ irb<br> head :001 > RUBY_VERSION<br> => "2.2.0"<br> head :002 > require 'uri'<br> => true<br> head :003 > my_str = '[ futsal club ]'<br> => "[ futsal club ]"<br> head :004 > URI.encode(my_str)<br> => "[%20futsal%20club%20]"<br> head :005 ></p> <p>Note: Testing using JavaScript function encodeURI('[ futsal club ]') produces "%5B%20futsal%20club%20%5D" which is the correct result.</p> Ruby master - Misc #9724 (Open): Warnings in Ruby: allow per-file directives to i.e. suppress war... https://bugs.ruby-lang.org/issues/9724 2014-04-10T18:21:31Z shevegen (Robert A. Heiler) [email protected] <p>Hi,</p> <p>A bit of intro.</p> <p>I usually run all my ruby code with -w. I feel that it gives me some more security if the<br> ruby parser does not have to think about ambiguous code.</p> <p>Now this works perfect for my own code - I know what I have written, I know how to fix it,<br> so my code runs fine.</p> <p>Problem is other people who do not use the -w switch, and in doing so their stuff outputs<br> a lot of warnings if I require their project and use them.</p> <p>This is somewhat annoying and there is no real good way to fix it as far as I know.</p> <p>Modifying $VERBOSE and setting it to nil is of no real help because it works globally.<br> But I'd rather want something to be used on a per-file basis.</p> <p>Would it be possible to enable something that could be used on a per file<br> basis? Kernel.no_warnings, or Kernel.be_silent or something like this?</p> Ruby master - Feature #9613 (Open): Warn about unsafe ossl ciphers https://bugs.ruby-lang.org/issues/9613 2014-03-08T03:04:48Z zzak (Zachary Scott) [email protected] <p>As of r45274, we now have sane whitelist of available OpenSSL ciphers. However, this patch breaks backwards compatibility for any apps that use any ciphers not whitelisted.</p> <a name="Solution"></a> <h2 >Solution<a href="#Solution" class="wiki-anchor">¶</a></h2> <ul> <li>Implement a new class: OpenSSL::SSL::Ciphers <ul> <li>This class defines a constant for every whitelisted cipher used by DEFAULT_PARAMS[:ciphers]</li> <li>Any constant not found within this class should raise a warning and report to the user</li> </ul></li> <li>Add an OpenSSL::SSL::Configuration class <ul> <li>Designed to default to no compression, and no sslv2/v3</li> <li>Used by DEFAULT_PARAMS[:options]</li> <li>This class may contain helper methods such as: #compression_enabled?</li> </ul></li> </ul> <a name="Pros"></a> <h2 >Pros<a href="#Pros" class="wiki-anchor">¶</a></h2> <ul> <li>We don't break anything, without warning users first</li> <li>Maintaining future whitelist ciphers is easier</li> <li>Future unsupported/blacklist ciphers are already dismissed</li> <li>Users are able to extend cipher lists to support their needs (by adding a constant to OpenSSL::SSL::Ciphers)</li> </ul> <a name="Concerns"></a> <h2 >Concerns<a href="#Concerns" class="wiki-anchor">¶</a></h2> <p>I have discussed this with Martin, and we'd like to open up this discussion for feedback. We're particularly concerned about backporting r45274 as it breaks compatibility. We should also consider:</p> <ul> <li>Do we backport both patches or just the warning?</li> <li>Should we bother backporting deprecation warnings? <ul> <li>Since r45274 is not a security fix, do we consider this a bug?</li> <li>Rails only introduces deprecation notices in new minor releases (ie: Ruby-2.2.0)</li> </ul></li> <li>r45274 is a major change that could break existing apps, even considering security</li> </ul> CommonRuby - Feature #9401 (Open): Yet another syntax for literal anonymous functions (lambdas) https://bugs.ruby-lang.org/issues/9401 2014-01-12T10:44:54Z alexeymuranov (Alexey Muranov) <p>Please do not be angry at me and just close this proposal if it does not look interesting. It comes from my aesthetic dissatisfaction with the <code>->(x){ ... }</code> literal anonymous function notation and from my amateurish interest in lambda calculus.</p> <p>Here is a yet another syntax for literal anonymous functions (lambdas) that i propose:</p> <pre>f = {\ x => x*x } f[1] # => 1 f[2] # => 4 </pre> <p>It looks a bit like a hash on purpose: i think that a hash is a "function in extension" and a lambda is a "function in intension" (see, for example, in <a href="http://www.classes.cs.uchicago.edu/archive/2004/spring/15300-1/docs/lambda-intro.pdf" class="external">these notes</a>). The backslash stands for "lambda", like in Haskell.</p> Ruby master - Feature #9174 (Open): value receiving block for Hash#has_key? https://bugs.ruby-lang.org/issues/9174 2013-11-29T06:33:11Z rits (First Last) <p>Seems useful to be able to check for presence (as opposed to falsyness) and receive the value </p> <p>class Hash<br> def has_key?(key, &block)<br> val = fetch(key){return false}<br> block.(val) if block<br> true<br> end<br> end</p> <p>if h.has_key? :key do |val|<br> #<br> end; else<br> #<br> end</p> Ruby master - Bug #9009 (Open): Wrong binding when tracing c-calls https://bugs.ruby-lang.org/issues/9009 2013-10-10T03:21:14Z yekka (Nikolay Bozhenov) [email protected] <p>When I use set_trace_func to trace ruby code, I get a wrong binding in<br> case of c-calls. In this case binding.eval("self") is not the receiver<br> of the call. Whereas in case of ruby-calls binding.eval("self") yields<br> the receiver of the call.<br> The underlying problem is that c-calls aren't pushed onto the frame stack.<br> It seems that currently there is no way to find out the receiver of c-call<br> inside tracing function.</p> <p>Example of code:</p> <p>$ cat test.rb<br> class IO<br> def some_method<br> end<br> end</p> <p>puts "true receiver is #{$stdout}\n\n"</p> <p>set_trace_func proc { |event, file, line, id, binding, classname|<br> if event == "call" or event == "c-call"<br> puts "#{event} #{id}:"<br> puts "\tapparent receiver = #{binding.eval("self")}"<br> puts "\tbacktrace:"<br> caller.each { |l| puts "\t\t#{l}" }<br> puts<br> end<br> }</p> <p>$stdout.write "" # c-call<br> $stdout.some_method # ruby-call</p> <p>Execution:</p> <p>$ ruby test.rb <br> true receiver is #<a href="IO:0x00000000bed2a0">IO:0x00000000bed2a0</a></p> <p>c-call write:<br> apparent receiver = main<br> backtrace:<br> test.rb:18:in `'</p> <p>call some_method:<br> apparent receiver = #<a href="IO:0x00000000bed2a0">IO:0x00000000bed2a0</a><br> backtrace:<br> test.rb:2:in <code>some_method'<br> test.rb:19:in</code>'</p> <p>Expected result: </p> <p>true receiver is #<a href="IO:0x00000000bed2a0">IO:0x00000000bed2a0</a></p> <p>c-call write:<br> apparent receiver = #<a href="IO:0x00000000bed2a0">IO:0x00000000bed2a0</a><br> backtrace:<br> somewhere:in <code>write'<br> test.rb:18:in</code>'</p> <p>call some_method:<br> apparent receiver = #<a href="IO:0x00000000bed2a0">IO:0x00000000bed2a0</a><br> backtrace:<br> test.rb:2:in <code>some_method'<br> test.rb:19:in</code>'</p> Ruby master - Feature #8404 (Open): virtual, hooked or read only global variabels for ruby only c... https://bugs.ruby-lang.org/issues/8404 2013-05-14T21:19:29Z Hanmac (Hans Mackowiak) [email protected] <p>currently pure virtual or hooked global variables can only be defined with cFunctions like rb_define_virtual_variable</p> <p>i think it would be cool if this would be possible in Ruby code too</p> CommonRuby - Feature #8272 (Open): Transfer feature tracking to CommonRuby https://bugs.ruby-lang.org/issues/8272 2013-04-16T05:45:34Z headius (Charles Nutter) [email protected] <p>If my proposal in <a class="issue tracker-2 status-2 priority-4 priority-default parent" title="Feature: Proposal for moving to a more visible, formal process for feature requests (Assigned)" href="https://bugs.ruby-lang.org/issues/8271">#8271</a> is accepted, we'll need to:</p> <ol> <li><p>Document in appropriate places that CommonRuby is the place to file and track feature changes. Examples of such places: bugs.ruby-lang.org top-level page, pages for the existing "trunk" and version-specific Redmine projects, ruby-lang.org pages that describe how to file bugs.</p></li> <li><p>Decide how to handle the "feature" flag in the current trackers. This may include solutions like removing it entirely (perhaps infeasible if existing features are not migrated to CommonRuby), adding a warning or error when "feature" is selected to encourage users to file under CommonRuby instead, or automatically putting "feature" issues under CommonRuby at submission time.</p></li> <li><p>(optional) Migrate existing open features to CommonRuby.</p></li> </ol> Ruby master - Feature #8061 (Open): 重複するキーワードをエラーにする https://bugs.ruby-lang.org/issues/8061 2013-03-10T09:53:22Z tadf (tadayoshi funaba) <p>重複するキーワードをエラーにする。</p> <p>def m(a:1, b:2)<br> p [a, b]<br> end</p> <p>m(a:8, a:9)</p> Ruby master - Bug #7840 (Open): -Wdeclaration-after-statement is valid for C/ObjC but not for C++ https://bugs.ruby-lang.org/issues/7840 2013-02-13T22:19:46Z Hanmac (Hans Mackowiak) [email protected] <p>because of the new flags in warnflags i get this following errors:</p> <p>cc1plus: warning: command line option '-Wdeclaration-after-statement' is valid for C/ObjC but not for C++ [enabled by default]<br> cc1plus: warning: command line option '-Wimplicit-function-declaration' is valid for C/ObjC but not for C++ [enabled by default] </p> <p>its because my gems are written in C++ and not in C, so i think this flags should not be used when the variable is used for both C and C++</p> Ruby master - Feature #7788 (Open): YAML Tag Schema Support https://bugs.ruby-lang.org/issues/7788 2013-02-06T05:05:55Z trans (Thomas Sawyer) <p>=begin<br> I have endeavoured to add proper Schema support to Psych (see (()) on Schemas). The primary reasons for supporting schemas are two fold: security and global tag conflict. The first is well known b/c of recent events. The second is less realized, but consider is it same problem as using global variables. Different apps have different tags; two identical local tags may have different meanings and thus cause conflict.</p> <p>The API works like this:</p> <pre>class Foo end foo_schema = YAML::Schema.new do |s| s.tag '!foo', Foo end YAML.load('foo.yml', :schema=>foo_schema) </pre> <p>This code would allow only failsafe and json schema tags (core defaults), plus the specifically defined !foo tag.<br> Also, %TAG prefix is supported:</p> <pre>foo_schema = YAML::Schema.new(:prefix=>{'!'=>'tag:foo.org/'}) do |s| s.tag '!foo', Foo end </pre> <p>This will add tag 'tag:foo.org/foo<code>instead of local</code>!foo` tag.</p> <p>To properly support schema, object's must store the tag with which they were loaded in order to ensure correct round tripping. For this there is <code>tag_uri</code> attribute.<br> (Note: I am not sure if it best to store as instance variable, which it currently is, or to store in global table. Need feedback.)</p> <p>In the process of adding schema support I was able to clean up and generalize loading code. For immutable types and class factories, adding (({ClassName.new_with(coder)})) can be used to instantiate class.</p> <p>Implementation is close to complete, I believe this is all that remains:</p> <ol> <li>ScalarScanner needs to respect schema (basically if failsafe and/or json schemas are not used).</li> <li>Dumping needs to take :schema option to limit it to schema tags.</li> <li>Dumping needs to look to tag_uri for tag by default.</li> <li>There is one bug I have yet to figure out (test_spec_builtin_map).</li> <li>I have questions about Coder, b/c it seems more complex than it needs to be.</li> </ol> <p>I am also considering refactoring Schemas as modules that can be included into other schema. Currently they are classes/objects that can be subclassed or merged via <code>+</code>, e.g.</p> <pre>LEGACY_SCHEMA = CORE_SCHEMA + RUBY_SCHEMA + OBJECT_SCHEMA + SYCK_SCHEMA </pre> <p>Of course, as with any new code, there's sure to be corner cases to work out. Having other pound on it for a while would be very helpful. Oh, and I should also mention I am documenting as much of the code as can.</p> <p>Feel free to ask me any questions for more details about the code. You can find the branch here: <a href="https://github.com/trans/psych/tree/isotag">https://github.com/trans/psych/tree/isotag</a><br> =end</p> | {
"url": "https://bugs.ruby-lang.org/issues.atom?per_page=50&sort=status%2Csubject%3Adesc%2Ctracker",
"source_domain": "bugs.ruby-lang.org",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "266623",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:I4KHH7DIJ5EHZU5ATISFXLU7KEGZZXXN",
"WARC-Concurrent-To": "<urn:uuid:c3c3e071-1c1a-4ad1-84cd-a0c4faf18f47>",
"WARC-Date": "2020-09-23T00:53:41Z",
"WARC-IP-Address": "3.230.235.205",
"WARC-Identified-Payload-Type": "application/atom+xml",
"WARC-Payload-Digest": "sha1:3NIMDYUWRPBAH5PM7IGUZHE5WPMFKGNU",
"WARC-Record-ID": "<urn:uuid:26b93c67-adfe-4965-a16d-d6247d548785>",
"WARC-Target-URI": "https://bugs.ruby-lang.org/issues.atom?per_page=50&sort=status%2Csubject%3Adesc%2Ctracker",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:57ff5b59-83db-4fdf-8f28-5530e0f09170>"
},
"warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-206.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0
],
"line_end_idx": [
191921
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 191921,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.0011567299952730536,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18532030284404755,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018167229369282722,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4315080940723419,
"rps_doc_frac_unique_words": 0.2647210657596588,
"rps_doc_mean_word_length": 7.00077486038208,
"rps_doc_num_sentences": 2116,
"rps_doc_symbol_to_word_ratio": 0.014373269863426685,
"rps_doc_unigram_entropy": 6.983876705169678,
"rps_doc_word_count": 19360,
"rps_doc_frac_chars_dupe_10grams": 0.09407901763916016,
"rps_doc_frac_chars_dupe_5grams": 0.1945844143629074,
"rps_doc_frac_chars_dupe_6grams": 0.15466853976249695,
"rps_doc_frac_chars_dupe_7grams": 0.12603387236595154,
"rps_doc_frac_chars_dupe_8grams": 0.11184564977884293,
"rps_doc_frac_chars_dupe_9grams": 0.09870512783527374,
"rps_doc_frac_chars_top_2gram": 0.018283100798726082,
"rps_doc_frac_chars_top_3gram": 0.010226139798760414,
"rps_doc_frac_chars_top_4gram": 0.005518869962543249,
"rps_doc_books_importance": -22331.453125,
"rps_doc_books_importance_length_correction": -22331.453125,
"rps_doc_openwebtext_importance": -15645.904296875,
"rps_doc_openwebtext_importance_length_correction": -15645.904296875,
"rps_doc_wikipedia_importance": -13767.1376953125,
"rps_doc_wikipedia_importance_length_correction": -13767.1376953125
},
"fasttext": {
"dclm": 0.30520039796829224,
"english": 0.6332420706748962,
"fineweb_edu_approx": 2.0074965953826904,
"eai_general_math": 0.24778884649276733,
"eai_open_web_math": 0.121905617415905,
"eai_web_code": 0.5897432565689087
}
} | {
"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": "4",
"label": "Analyze"
},
"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": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"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": "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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
5,351,124,665,946,730,000 | Michael B. Duff
Lubbock's answer to a question no one asked
links for 2010-12-01
• Basically this goes to show just how futile it is to attempt blocking servers in the internet where it takes a few keystrokes to change a client. It also brings up the point of how much further the US will go in its attempt to shut up the internet and ways to bypass such seizures. An interesting analysis out of TorrentFreaks contemplates a BitTorrent based DNS which would make shutting down sites virtually impossible.
• It seems the days of Wikileaks are over. The Associated Press reports that the website appears to have lost its host. The question now is who will be the next Wikileaks.
(tags: wikileaks)
• Somewhere deep inside, you knew you'd end up paying for this didn't you? Notice how quickly the conversation has gone from "bailing out Greece" to "bailing out Europe."
• Churchill agreed to meet Hitler, who was going to come to see him in his hotel in Munich, and said to the intermediary: "There are a few questions you might like to put to him, which can be the basis of our discussion when we meet." Among them was the following question: "What is the sense of being against a man simply because of his birth? How can any man help how he is born?"
• "Let me tell you something. You can't write like Hunter S. Thompson unless you are perfectly willing to be cremated and have your ashes blown out of a cannon, or better yet have your remains eaten by a cephalopod of some sort. And thus, when all is said and written, we are left with nothing in Griftopia but the facts in each chapter."
• The 'reflexivity' de Grauwe worries about is at least in part a function of the embedded moral hazard of the implied guarantees for bondholders. So far they have been told: 'No matter how foolish the risks you have taken, there are always millions of tax cows we can and will milk on your behalf'.
• When people start to doubt your ability to pay money back, it costs more to borrow it. That means more and more of your current revenue must be spend on debt interest. Expect the European Central Bank to jump in soon and start buying these with printed money, driving the rates down but decreasing the value of the Euro. The trap is slowly closing on them now.
• This scene is a total deconstruction of the Luke Skywalker/Darth Vader battle, done in a way that perfectly captures the postmodern twists you get with modern roleplaying. Every roleplaying campaign in the world ends up like this. You start with carefully crafted archetypes to tell a classic story, then one smartass goes postmodern on you and refuses to play by the rules. Only this time, the NPC has gone pomo and the hero is still trying to play by the rules.
• Assange is now wanted by Interpol in connection with a rape allegation. He is in an "undisclosed location." Given the world's track record at finding notorious fugitives in the last 10 years, I suspect he is the safest person in the world, as long as he's in Pakistan.
• "Secrecy is a form of power. The gaze is a form of power. In a healthy democracy, ordinary citizens should have some measure of both in all aspects of their lives. The WikiLeaks cablegate helps to restore the balance between government and people."
(tags: wikileaks)
• This is actually rather poignant and disturbing, but it makes an excellent point. In most cases, medical recovery is not so much a "positive attitude" as it is just not surrendering to despair while you wait for the science to work. The "positive attitude" stuff makes it sound like you should be all fake smiles and brave faces, denying any real fear or sadness so people will think you're brave. Fuck brave.
Written by Michael B. Duff
December 1, 2010 at 23:01
Posted in Uncategorized
%d bloggers like this: | {
"url": "https://michaelduff.net/2010/12/01/links-for-2010-12-01/",
"source_domain": "michaelduff.net",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "57866",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4QZRCFLOW6KDWI7RXBATLTUNCU2VQNBQ",
"WARC-Concurrent-To": "<urn:uuid:d4bc9c9a-9029-4cb3-9437-93558ac6e9f2>",
"WARC-Date": "2020-09-20T00:45:54Z",
"WARC-IP-Address": "192.0.78.25",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:TWKHHAD46Z5XXDPA4UU5ZVZWRCL5PQP6",
"WARC-Record-ID": "<urn:uuid:095fecb1-515f-4e89-a37f-2e3a9422e5d5>",
"WARC-Target-URI": "https://michaelduff.net/2010/12/01/links-for-2010-12-01/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8655a0cd-2938-4b66-bcae-4144454fbc56>"
},
"warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-112.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,
16,
17,
61,
62,
83,
84,
510,
684,
706,
879,
1264,
1605,
1907,
2272,
2740,
3013,
3266,
3288,
3702,
3703,
3730,
3731,
3757,
3758,
3782,
3783
],
"line_end_idx": [
16,
17,
61,
62,
83,
84,
510,
684,
706,
879,
1264,
1605,
1907,
2272,
2740,
3013,
3266,
3288,
3702,
3703,
3730,
3731,
3757,
3758,
3782,
3783,
3805
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3805,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4682741165161133,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008883249945938587,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1446700543165207,
"rps_doc_frac_unique_words": 0.5439882874488831,
"rps_doc_mean_word_length": 4.376832962036133,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.378393173217773,
"rps_doc_word_count": 682,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02010050043463707,
"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.00670017022639513,
"rps_doc_frac_chars_top_3gram": 0.008040199987590313,
"rps_doc_frac_chars_top_4gram": 0.007370179984718561,
"rps_doc_books_importance": -280.82733154296875,
"rps_doc_books_importance_length_correction": -280.82733154296875,
"rps_doc_openwebtext_importance": -183.60101318359375,
"rps_doc_openwebtext_importance_length_correction": -183.60101318359375,
"rps_doc_wikipedia_importance": -144.1600341796875,
"rps_doc_wikipedia_importance_length_correction": -144.1600341796875
},
"fasttext": {
"dclm": 0.2478334903717041,
"english": 0.9651033878326416,
"fineweb_edu_approx": 1.6579844951629639,
"eai_general_math": 0.23867148160934448,
"eai_open_web_math": 0.29622918367385864,
"eai_web_code": 0.005079450085759163
}
} | {
"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": "323.119",
"labels": {
"level_1": "Social sciences",
"level_2": "Political science",
"level_3": "Human rights, Ethnic relations, Race relations, and Minorities"
}
}
},
"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": "News/Editorial"
}
},
"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": "6",
"label": "Content Listing"
}
},
"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,992,347,303,274,536,000 |
;;; Change Height of user selected Texts similar to Height of selected "example" text
;;; Based on Lee Mak Routine http://www.cadtutor.net/forum/showthread.php?97314-Lisp-to-change-text-height
;;; Modified by Igal Averbuh 2017 (added option to use height of selected "example" text)
(defun c:ct (/ ht ss)
(vl-load-com)
(setq ent (entget (car (entsel "\nClick on Text with needful height:"))))
(setq htt (cdr (assoc 40 ent)))
(if (and (setq ht (cdr (assoc 40 ent)))
(princ "\nSelect Texts to change it Height:")
(setq ss (ssget '((0 . "*TEXT")))))
(foreach x (mapcar 'entget
(vl-remove-if 'listp
(mapcar 'cadr (ssnamex ss))))
(entmod (subst (cons 40 ht) (assoc 40 x) x))))
(princ))
(c:ct)
Advertisements | {
"url": "https://lispbox.wordpress.com/2017/02/13/change-height-of-user-selected-texts-similar-to-height-of-selected-example-text/",
"source_domain": "lispbox.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2017-30",
"warc_metadata": {
"Content-Length": "115310",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SD3CFC5YQEMCW77XM6HKNJRHT2IZGFFJ",
"WARC-Concurrent-To": "<urn:uuid:ad3b89e0-1ac6-4fed-bd03-1f8d91aa54c7>",
"WARC-Date": "2017-07-24T20:41:08Z",
"WARC-IP-Address": "192.0.78.13",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:E7X6BBN37O2PIN4ULSUV4UE34PB4WK5Q",
"WARC-Record-ID": "<urn:uuid:fdfa0fac-080c-4a69-9518-2bd39b8b1309>",
"WARC-Target-URI": "https://lispbox.wordpress.com/2017/02/13/change-height-of-user-selected-texts-similar-to-height-of-selected-example-text/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3c05ef86-102f-493c-9581-d033bd73ac2a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-178-21-169.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 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,
87,
194,
284,
285,
307,
321,
322,
396,
428,
429,
469,
515,
551,
578,
599,
629,
676,
685,
692,
693
],
"line_end_idx": [
1,
87,
194,
284,
285,
307,
321,
322,
396,
428,
429,
469,
515,
551,
578,
599,
629,
676,
685,
692,
693,
707
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 707,
"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.125,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005208330228924751,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4375,
"rps_doc_frac_unique_words": 0.6082473993301392,
"rps_doc_mean_word_length": 5.020618438720703,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.9198031425476074,
"rps_doc_word_count": 97,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1108829602599144,
"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.04928131029009819,
"rps_doc_frac_chars_top_3gram": 0.06570842117071152,
"rps_doc_frac_chars_top_4gram": 0.09445585310459137,
"rps_doc_books_importance": -67.45142364501953,
"rps_doc_books_importance_length_correction": -68.1886215209961,
"rps_doc_openwebtext_importance": -37.132110595703125,
"rps_doc_openwebtext_importance_length_correction": -37.86930465698242,
"rps_doc_wikipedia_importance": -24.406997680664062,
"rps_doc_wikipedia_importance_length_correction": -25.14419174194336
},
"fasttext": {
"dclm": 0.09111232310533524,
"english": 0.6291102766990662,
"fineweb_edu_approx": 1.0524598360061646,
"eai_general_math": 0.10646063089370728,
"eai_open_web_math": 0.8963383436203003,
"eai_web_code": 0.4922807216644287
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
1,226,511,607,903,382,000 | Bypass The UAE Firewall
The United Arab Emirates has, for years now, been blocking websites and censoring content.
Etisalat is the only internet provider for the country and they are very quick to block websites and proxy sites that users can use to reroute their traffic.
Luckily, you can still access blocked sites in the UAE with the use of a VPN!
Short On Time? These VPNs Work Best For The UAE
1. ExpressVPN – Unlimited bandwidth for downloading and streaming.
2. NordVPN – Fast speeds for quick downloads.
3. Ivacy – Cheapest VPN option that also provides fast connection speeds.
1_16a080619e0.638686_2117968436_16a080619e0_large
Hide Your Online Activity From The Government
The UAE has been strict with their control over their citizens online access.
Knowing that the government is trying to keep a close eye on peoples activities online, many users have flocked to VPNs as a means to protect themselves.
If you are using a VPN with Obfuscated servers, like NordVPN, then your activity online will be completely hidden from the government.
Obfuscated servers use techniques such as additional SSL encryption to mask traces of VPN usage in the data packets being sent.
Typically your ISP is able to see that you are using a VPN even though they cannot see what your doing on their network.
By further encrypting the data packets with SSL encryption, the ISP is now unable to see that you are even using a VPN.
This is very useful when in a country like the UAE since they are looking for signs of VPN usage to shut down connections to these VPNs.
Eoivw2PXEAEZOXw
Remote Desktop Your Way To Freedom
Another popular method of getting around the UAE firewall is to remote into another computer outside of their reach.
This is essentially the same thing as using a VPN but without paying for a service to do it.
The problem with this method is that you need to have a pc set up and running in another country in order to do this.
By simply remoting into another computer you can surf the web from that computer remotely.
This bypasses the UAE firewall and you will be browsing as if you are in the other country.
This is the exact process that happens when you use a VPN as you are choosing to connect to one of their hosted servers.
Some citizens who have family and friends overseas have made use of this tactic in order to gain unrestricted access to the web.
Final Words
Restrictive and controlling governments are not going to disappear anytime soon unfortunately.
Tools like VPNs and Remote Desktop offer ways for citizens to access the unrestricted web and view websites that their government has decided to block.
The most important thing in these situations is to make sure that your government is not able to see what you are doing or that you are even using a VPN.
Using Obfuscated servers is easily the best way to go completely undetectable when you are online.
Making sure to use a well respected VPN service like NordVPN will allow you to access Obfuscated servers and is always a safe bet no matter what country you are in. | {
"url": "http://vpnreportcard.com/uae-firewall/",
"source_domain": "vpnreportcard.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "73438",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3FUO5HYXHDWPIBQLQLVKM2APNICFA4AF",
"WARC-Concurrent-To": "<urn:uuid:5c9781ec-34e7-473f-a9d5-166b313167b0>",
"WARC-Date": "2021-12-04T13:05:22Z",
"WARC-IP-Address": "18.232.245.187",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZHZ7Y66NFN4WKNBLNRMJUS7J3DW2JQYJ",
"WARC-Record-ID": "<urn:uuid:1f735f79-90ef-4291-9044-e15c979d12cd>",
"WARC-Target-URI": "http://vpnreportcard.com/uae-firewall/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bcdbb584-8f31-428f-8d8e-4bdc63362556>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-235\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
24,
25,
116,
117,
275,
276,
354,
355,
403,
404,
473,
521,
597,
598,
599,
649,
650,
696,
697,
775,
776,
930,
931,
1066,
1067,
1195,
1196,
1317,
1318,
1438,
1439,
1576,
1577,
1578,
1594,
1595,
1630,
1631,
1748,
1749,
1842,
1843,
1961,
1962,
2053,
2054,
2146,
2147,
2268,
2269,
2398,
2399,
2411,
2412,
2507,
2508,
2660,
2661,
2815,
2816,
2915,
2916
],
"line_end_idx": [
24,
25,
116,
117,
275,
276,
354,
355,
403,
404,
473,
521,
597,
598,
599,
649,
650,
696,
697,
775,
776,
930,
931,
1066,
1067,
1195,
1196,
1317,
1318,
1438,
1439,
1576,
1577,
1578,
1594,
1595,
1630,
1631,
1748,
1749,
1842,
1843,
1961,
1962,
2053,
2054,
2146,
2147,
2268,
2269,
2398,
2399,
2411,
2412,
2507,
2508,
2660,
2661,
2815,
2816,
2915,
2916,
3080
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3080,
"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.5026269555091858,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03852890059351921,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.0753064826130867,
"rps_doc_frac_unique_words": 0.4352720379829407,
"rps_doc_mean_word_length": 4.634146213531494,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.941246509552002,
"rps_doc_word_count": 533,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.036437250673770905,
"rps_doc_frac_chars_dupe_6grams": 0.018623480573296547,
"rps_doc_frac_chars_dupe_7grams": 0.018623480573296547,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.021862350404262543,
"rps_doc_frac_chars_top_3gram": 0.018218619748950005,
"rps_doc_frac_chars_top_4gram": 0.009716600179672241,
"rps_doc_books_importance": -258.43359375,
"rps_doc_books_importance_length_correction": -258.43359375,
"rps_doc_openwebtext_importance": -176.3277587890625,
"rps_doc_openwebtext_importance_length_correction": -176.3277587890625,
"rps_doc_wikipedia_importance": -137.49415588378906,
"rps_doc_wikipedia_importance_length_correction": -137.49415588378906
},
"fasttext": {
"dclm": 0.07813382148742676,
"english": 0.9632641673088074,
"fineweb_edu_approx": 2.0555992126464844,
"eai_general_math": 0.07559818029403687,
"eai_open_web_math": 0.2849205732345581,
"eai_web_code": 0.08734375238418579
}
} | {
"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": "323.4",
"labels": {
"level_1": "Social sciences",
"level_2": "Political science",
"level_3": "Human rights, Ethnic relations, Race relations, and Minorities"
}
}
},
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "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,164,568,230,033,245,000 | 1
I have a CSV with 4 fields (id1,id2,id3,filename) like this:
2,2314,78,/image/1289.jpg
1,19825,179,/image/01288.jpg
2,2585,2281,/image/01287.jpg
3,35879,82,/image/01286.jpg
There is a common URL endpoint for the images like
http://example.com/assets/?mediafile=
The last column is the unique portion of the URL to the image.
I'm trying to download each image, and name of each image is based on the first 3 fields:
id1 is always 1 digit
id2 is really 5 digits with prepending zeros (so 2314 needs to become 02314)
id3 is really 4 digits (78 becomes 0078),
so in total a 10 digit code. So the first image name should be 2023140078.jpg
If I were to download a single file manually, I'd do something like this:
wget -O 2023140078.jpg http://example.com/assets/?mediafile=/image/1289.jpg
Also if I could write back some sort of status or error code to the row or write an error log, would be great.
2
awk -F, '{printf("%d%.5d%.4d %s\n",$1,$2,$3,$4)}' input.csv | while read newfile filename
do
wget -O "${newfile}.jpg" http://example.com/assets/?mediafile=${filename}
done
• After running this for 200,000 rows I realized that not all filenames are unique, and some IDs have several images, how can I fix this? – zevnyc Jan 17 '17 at 20:00
• what you mean by its not unique ? are you ok to add the incremental value in the filename ? eg: 2023140078_1.jpg 2023140078_2.jpg ..... 2023140078_200000.jpg – Kamaraj Jan 18 '17 at 8:28
• Some of the entries have several URLs for the same filename so wget is downloading them all, replacing the first file with the next. Most have only 1 file, but some have several. I'd like for the 1st to stay in the original format and the rest add _1 etc. – zevnyc Jan 18 '17 at 10:25
1
You can set the IFS to a comma and use a while loop to read the 4 variables that uses the file as input:
IFS=','
while read c1 c2 c3 c4; do
wget -O "$(printf "%d%05d%04d.jpg" "$c1" "$c2" "$c3")" "http://example.com/assets/?mediafile=${c4}"
done < file.txt
• if second column has the value of 12345, then the filename will be created with 11 digit – Kamaraj Jan 17 '17 at 6:30
• Sorry, I misread your padding requirements. You can use printf command substitution for that: $ IFS=','; while read c1 c2 c3 c4; do echo wget -O "${c1}$(printf %05d ${c2})$(printf %04d ${c3})" "example.com/assets/?mediafile=${c4}"; done < file.txt – Kyle Jan 17 '17 at 6:31
• You should edit your answer to improve it. Comments are often overlooked and sometimes deleted. And you don't need two printfs; just do $(printf "%d%05d%04d.jpg" "$c1" "$c2" "$c3"). – Scott Jan 17 '17 at 6:43
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "https://unix.stackexchange.com/questions/337940/how-to-wget-images-from-csv-append-url-and-filenames-from-fields",
"source_domain": "unix.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "151387",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UZLMLQDETNWYWF2GEKDLCUV7A74UY6K3",
"WARC-Concurrent-To": "<urn:uuid:d538805c-6f57-43ea-a129-b765e3458a51>",
"WARC-Date": "2019-07-20T03:27:12Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NMXYKJRHHKRNTTLJELBNFUQLGQXVVTMW",
"WARC-Record-ID": "<urn:uuid:d4768c83-6cfa-4ec4-8c45-dd3653c68ac4>",
"WARC-Target-URI": "https://unix.stackexchange.com/questions/337940/how-to-wget-images-from-csv-append-url-and-filenames-from-fields",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8f15d3ce-0abd-468f-b09b-8aebb45d4b47>"
},
"warc_info": "isPartOf: CC-MAIN-2019-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-180-76-105.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,
64,
65,
91,
120,
149,
177,
178,
229,
230,
268,
269,
332,
333,
423,
424,
446,
523,
565,
566,
644,
645,
719,
720,
796,
797,
908,
909,
911,
1002,
1006,
1081,
1086,
1255,
1446,
1735,
1737,
1738,
1843,
1844,
1852,
1879,
1981,
1997,
2119,
2397,
2611,
2612,
2624,
2625,
2725,
2726
],
"line_end_idx": [
2,
3,
64,
65,
91,
120,
149,
177,
178,
229,
230,
268,
269,
332,
333,
423,
424,
446,
523,
565,
566,
644,
645,
719,
720,
796,
797,
908,
909,
911,
1002,
1006,
1081,
1086,
1255,
1446,
1735,
1737,
1738,
1843,
1844,
1852,
1879,
1981,
1997,
2119,
2397,
2611,
2612,
2624,
2625,
2725,
2726,
2816
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2816,
"ccnet_original_nlines": 53,
"rps_doc_curly_bracket": 0.005681820213794708,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3005540072917938,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02770083025097847,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3628808856010437,
"rps_doc_frac_unique_words": 0.5120350122451782,
"rps_doc_mean_word_length": 4.496717929840088,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.0013850399991497397,
"rps_doc_unigram_entropy": 5.113266944885254,
"rps_doc_word_count": 457,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04282237961888313,
"rps_doc_frac_chars_dupe_6grams": 0.021411189809441566,
"rps_doc_frac_chars_dupe_7grams": 0.021411189809441566,
"rps_doc_frac_chars_dupe_8grams": 0.021411189809441566,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.011678829789161682,
"rps_doc_frac_chars_top_3gram": 0.01362529955804348,
"rps_doc_frac_chars_top_4gram": 0.01751825027167797,
"rps_doc_books_importance": -304.5047912597656,
"rps_doc_books_importance_length_correction": -304.5047912597656,
"rps_doc_openwebtext_importance": -189.50621032714844,
"rps_doc_openwebtext_importance_length_correction": -189.50621032714844,
"rps_doc_wikipedia_importance": -137.68515014648438,
"rps_doc_wikipedia_importance_length_correction": -137.68515014648438
},
"fasttext": {
"dclm": 0.26614683866500854,
"english": 0.8272958993911743,
"fineweb_edu_approx": 2.0282046794891357,
"eai_general_math": 0.10155141353607178,
"eai_open_web_math": 0.28402674198150635,
"eai_web_code": 0.0015995500143617392
}
} | {
"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": "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": "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,808,413,103,774,327,000 | Question
Train A running at speed of 45 km/hr crosses a platform having twice the length of train in 12 sec. Train B whose length is 260m crosses same platform in 18 sec, then find the speed of train B ?
A 72 km/hr Correct Answer Incorrect Answer
B 108 km/hr Correct Answer Incorrect Answer
C 142 km/hr Correct Answer Incorrect Answer
D 144 km/hr Correct Answer Incorrect Answer
E 54 km/hr Correct Answer Incorrect Answer
Solution
Let length of train A = x Length of platform = 2x Speed = distance/time ⇒ 45 x 5/18 = (x + 2x)/12 ⇒ x = 50 m = length of train A Length of platform = 50 x 2 = 100m For train B, Speed = distance/time ⇒ (100 + 260)/18 x (18/5) ⇒ 72 km/hr
Relevant for Exams:
× | {
"url": "https://www.ixambee.com/questions/quantitative-aptitude/trains/186915",
"source_domain": "www.ixambee.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "250083",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6SMCZ2PTHPC76KI2NFA6J62IHNRCH6A3",
"WARC-Concurrent-To": "<urn:uuid:9ecea6a9-a795-4a26-8e62-162e7a264d07>",
"WARC-Date": "2023-03-24T16:35:51Z",
"WARC-IP-Address": "45.114.246.142",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FZSUH5XUJFGDYXUX6HHMQJMVKYXKWNVU",
"WARC-Record-ID": "<urn:uuid:78d4d0fc-2d37-436d-8209-6d37b61b43f1>",
"WARC-Target-URI": "https://www.ixambee.com/questions/quantitative-aptitude/trains/186915",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4066bb18-ed37-4b3d-91ff-1a5810063737>"
},
"warc_info": "isPartOf: CC-MAIN-2023-14\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-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,
9,
10,
205,
206,
249,
293,
337,
381,
424,
425,
434,
435,
671,
672,
692,
693
],
"line_end_idx": [
9,
10,
205,
206,
249,
293,
337,
381,
424,
425,
434,
435,
671,
672,
692,
693,
694
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 694,
"ccnet_original_nlines": 16,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.15697674453258514,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06395348906517029,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.34302327036857605,
"rps_doc_frac_unique_words": 0.4444444477558136,
"rps_doc_mean_word_length": 4.095238208770752,
"rps_doc_num_sentences": 3,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.6919167041778564,
"rps_doc_word_count": 126,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.3100775182247162,
"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.07751937955617905,
"rps_doc_frac_chars_top_3gram": 0.16472868621349335,
"rps_doc_frac_chars_top_4gram": 0.25193798542022705,
"rps_doc_books_importance": -114.27116394042969,
"rps_doc_books_importance_length_correction": -117.00286865234375,
"rps_doc_openwebtext_importance": -55.99808883666992,
"rps_doc_openwebtext_importance_length_correction": -58.72979736328125,
"rps_doc_wikipedia_importance": -48.56363296508789,
"rps_doc_wikipedia_importance_length_correction": -51.29534149169922
},
"fasttext": {
"dclm": 0.9687464833259583,
"english": 0.7735141515731812,
"fineweb_edu_approx": 3.10589337348938,
"eai_general_math": 0.944650411605835,
"eai_open_web_math": 0.8415026664733887,
"eai_web_code": 0.00001979000080609694
}
} | {
"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": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-238,135,853,805,679,840 | Ask Your Question
0
forgotten notebook password
asked 2015-03-06 12:42:15 +0200
mike19382 gravatar image
How do I recover (or reset) a forgotten password for the notebook?
edit retag flag offensive close merge delete
1 Answer
Sort by » oldest newest most voted
0
answered 2015-03-06 13:52:30 +0200
Eugene gravatar image
updated 2015-03-06 13:53:02 +0200
If you are an admin and want to reset password for a particular user, you can go to "Settings", "Manage Users" and press "Reset" in the password column. If you need to reset admins password you can do it by launching notebook serter with option reset (see Configure and Start a Notebook Server):
sage: notebook(reset=True)
edit flag offensive delete link more
Comments
Thank you!
mike19382 gravatar imagemike19382 ( 2015-03-06 14:38:37 +0200 )edit
1
@mike19382: you can mark the answer as your accepted answer by clicking the tick mark at the top left of the answer (below the upvote button, the answer's score, and the downvote button). When you have more karma (> 15), you can also upvote questions and answers).
slelievre gravatar imageslelievre ( 2015-03-06 16:08:59 +0200 )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: 2015-03-06 12:42:15 +0200
Seen: 2,267 times
Last updated: Mar 06 '15 | {
"url": "https://ask.sagemath.org/question/26043/forgotten-notebook-password/",
"source_domain": "ask.sagemath.org",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "55163",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3QZNGV4ELMKAY5TSZG2RAORB6N444WJ7",
"WARC-Concurrent-To": "<urn:uuid:0b2721da-7f74-4fc5-98b5-f29d79d72579>",
"WARC-Date": "2024-05-22T15:21:44Z",
"WARC-IP-Address": "194.254.163.53",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:L2PSY7FLPIHLMDJSYVEHLR5AP4FFWEZF",
"WARC-Record-ID": "<urn:uuid:87bcc3f1-e288-41c9-890a-e1e810a27a2a>",
"WARC-Target-URI": "https://ask.sagemath.org/question/26043/forgotten-notebook-password/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b6c19c51-df37-4ae9-a7e9-749738c5023f>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-29\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,
18,
20,
21,
49,
50,
82,
83,
108,
109,
176,
177,
222,
223,
232,
233,
268,
270,
271,
306,
307,
329,
330,
364,
365,
661,
662,
689,
726,
727,
736,
737,
748,
749,
817,
819,
820,
1085,
1086,
1154,
1155,
1167,
1168,
1274,
1275,
1286,
1287,
1302,
1303,
1309,
1310,
1343,
1344,
1362,
1363
],
"line_end_idx": [
18,
20,
21,
49,
50,
82,
83,
108,
109,
176,
177,
222,
223,
232,
233,
268,
270,
271,
306,
307,
329,
330,
364,
365,
661,
662,
689,
726,
727,
736,
737,
748,
749,
817,
819,
820,
1085,
1086,
1154,
1155,
1167,
1168,
1274,
1275,
1286,
1287,
1302,
1303,
1309,
1310,
1343,
1344,
1362,
1363,
1387
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1387,
"ccnet_original_nlines": 54,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22364217042922974,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003194889985024929,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3865814805030823,
"rps_doc_frac_unique_words": 0.5833333134651184,
"rps_doc_mean_word_length": 4.94444465637207,
"rps_doc_num_sentences": 7,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.583673477172852,
"rps_doc_word_count": 216,
"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.02247191034257412,
"rps_doc_frac_chars_top_3gram": 0.03558051958680153,
"rps_doc_frac_chars_top_4gram": 0.04307115823030472,
"rps_doc_books_importance": -103.08473205566406,
"rps_doc_books_importance_length_correction": -103.07259368896484,
"rps_doc_openwebtext_importance": -67.8430404663086,
"rps_doc_openwebtext_importance_length_correction": -67.8430404663086,
"rps_doc_wikipedia_importance": -45.838035583496094,
"rps_doc_wikipedia_importance_length_correction": -43.90883255004883
},
"fasttext": {
"dclm": 0.031522151082754135,
"english": 0.8099616765975952,
"fineweb_edu_approx": 1.7136523723602295,
"eai_general_math": 0.007375480141490698,
"eai_open_web_math": 0.007733230013400316,
"eai_web_code": -0.0000040499999158782884
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-1,592,674,444,271,164,400 | Google V8 Server-Side JavaScript Injection joins the set of web application security vulnerabilities TIME-BASED PHP V8JS INJECTION & NOSQL/SSJS INJECTION Detecting server-side JavaScript (SSJS) injection vulnerabilities using time-based techniques. Article by Felipe Aragon - February 25, 2012 This article, which is an update of an article that we originally published on December 18, 2011, intends to highlight the risk of unvalidated input used to execute server-side JavaScript. As you read this, web developers are starting to learn how to use V8Js (Google's V8 JavaScript engine) in PHP: http://www.php.net/manual/en/v8js.examples.php http://stackoverflow.com/questions/9035567/why-is-a-function-re-definition-faster-than-calling-the-first-one ...or MongoDB, which is a scalable, high-performance, open source NoSQL database that also allows JavaScript to be used in queries: http://www.mongodb.org/ Today, the most common source of PHP security flaws is unvalidated input. They give rise to SQL Injection, XSS, Remote Command Execution, Local and Remote File Inclusion, etc (known as the PHP Top 5 https://www.owasp.org/index.php/PHP_Top_5). With the rising adoption of server-side JavaScript, we can expect server-side JS injection vulnerabilities caused by unvalidated user input to become prevalent, and the techniques for exploiting them, commonplace. At Syhunt, we already started our own collection of techniques for detecting server-side JS injection vulnerabilities. We want to proactively detect them before they are exploited. The Time-Based JS Injection Technique ********************************************** Injecting a custom sleep code is a technique that may be used to spot injection vulnerabilities in web applications using server-side JavaScript execution. This works with any web system that supports server-side JavaScript execution, such as JavaScript web application frameworks and servers like Jaxer (http://jaxer.org/), or PHP with V8Js, or NoSQL engines like MongoDB. Below you can find examples of server-side JavaScript injection vulnerabilities in PHP that could be spotted using the sleep technique. In the past, we used this same sleep code in the client-side to demonstrate how vulnerabilities we found in the A-A-S (Application Access Server) could be exploited (http://www.syhunt.com/?n=Advisories.Aas-multiple). Example 1: PHP V8JS Injection Vulnerabilities (PHP + V8Js) ************* The following requests would make these (or similar) vulnerable web applications sleep for 10 seconds: vulnerable.php?msg=a';d%20=%20new%20Date();do{cd=new%20Date();}while(cd-d<10000);foo='bar Vulnerable Code: $msg = $_GET['msg']; $v8 = new V8Js(); $v8->executeString("var msg = '$msg'; ..SOME CODE.."); vulnerable.php?msg=version());d%20=%20new%20Date();do{cd=new%20Date();}while(cd-d<10000);foo=('bar' Vulnerable Code: $msg = $_GET['msg']; $v8 = new V8Js(); $JS = <<< EOT len = print($msg + "\\n"); ..SOME CODE.. EOT; $v8->executeString($JS, 'basic.js'); Example 2: NoSQL SSJS Injection Vulnerability (PHP + MongoDB) ************* The MongoDB shell provides a sleep() function (see http://api.mongodb.org/js/current/symbols/src/shell_utils.js.html) which makes time-based detection much easier to perform. The following requests would make these (or similar) vulnerable web applications sleep for 10 seconds: vulnerable.php?msg=1';sleep(10000);var%20foo='bar The MongoDB sleep() function works with milliseconds. Alternative technique using a custom sleep code: vulnerable.php?msg=1';d=new%20Date();do{cd=new%20Date();}while(cd-d<10000);foo='bar Vulnerable Code: demo; $id = $_GET['id']; $js = "function() { var id = '$id'; SOME CODE... }"; $response = $db->execute($js); ... ?> Example 3: NoSQL SSJS Injection Vulnerability (PHP + MongoDB) ************* Vulnerable Code: demo; $year = $_GET['year']; $collection = $db->demo; $query = 'function() {var search_year = \'' . $year . '\';' . 'return this.publicationYear == search_year || ' . ' this.filmingYear == search_year || ' . ' this.recordingYear == search_year;}'; $cursor = $collection->find(array('$where' => $query)); ... ?> Example 4: SSJS Injection Vulnerability (PHP + Jaxer) ************* Example of a vulnerable application built using the Jaxer Ajax server and PHP. Vulnerable Code: myPHPVar = '$myVar'; onload = function(){ ..SOME CODE.. }; "; ?> Example 5: Sleep in JavaScript ************* var date = new Date(); do { curDate = new Date(); } while(curDate-date < 10000); // delay time (ms) Additional Information The advent of Big Data and Cloud Computing is driving adoption of NoSQL in the enterprise. Because of this, NoSQL-related vulnerabilities are expected to become much more widespread (http://www.govtech.com/policy-management/9-Cybersecurity-Threat-Predictions-for-2012.html) In July last year, Bryan Sullivan, a senior security researcher at Adobe Systems, demonstrated server-side JavaScript injection vulnerabilities in web applications using MongoDB and other NoSQL database engines. He demonstrated how they could be used to perform Denial of Service, File System, Remote Command Execution, and many other attacks, including the easy extraction of the entire contents of the NoSQL database -- a blind NoSQL injection attack (paper available at https://media.blackhat.com/bh-us-11/Sullivan/BH_US_11_Sullivan_Server_Side_WP.pdf). Solution Always validate user input used in server-side JavaScript commands. | {
"url": "https://dl.packetstormsecurity.net/papers/general/googlev8-inject.txt",
"source_domain": "dl.packetstormsecurity.net",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "6117",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2KZMEOHTKNF4N6ZWK5FHJW5TP5JZWNS2",
"WARC-Concurrent-To": "<urn:uuid:e0bbf9b8-10a6-4ee0-9b90-a425c87ee0a7>",
"WARC-Date": "2022-08-12T12:06:10Z",
"WARC-IP-Address": "198.84.60.200",
"WARC-Identified-Payload-Type": "text/plain",
"WARC-Payload-Digest": "sha1:JM4QWO3IR44U42TLF3TAEQFPUIRIC57R",
"WARC-Record-ID": "<urn:uuid:840aa246-637f-4643-814d-f5a03146c9cd>",
"WARC-Target-URI": "https://dl.packetstormsecurity.net/papers/general/googlev8-inject.txt",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c1039461-8f91-4a6d-b78b-14cffd1d7059>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-66\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
],
"line_end_idx": [
5418
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5418,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.002583980094641447,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18671151995658875,
"rps_doc_ut1_blacklist": 154,
"rps_doc_frac_all_caps_words": 0.04205213859677315,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.35660219192504883,
"rps_doc_frac_unique_words": 0.4431818127632141,
"rps_doc_mean_word_length": 6.599026203155518,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0.0033641699701547623,
"rps_doc_unigram_entropy": 5.175111770629883,
"rps_doc_word_count": 616,
"rps_doc_frac_chars_dupe_10grams": 0.04182042181491852,
"rps_doc_frac_chars_dupe_5grams": 0.11660517007112503,
"rps_doc_frac_chars_dupe_6grams": 0.10036899894475937,
"rps_doc_frac_chars_dupe_7grams": 0.05756457895040512,
"rps_doc_frac_chars_dupe_8grams": 0.04182042181491852,
"rps_doc_frac_chars_dupe_9grams": 0.04182042181491852,
"rps_doc_frac_chars_top_2gram": 0.044280439615249634,
"rps_doc_frac_chars_top_3gram": 0.021402209997177124,
"rps_doc_frac_chars_top_4gram": 0.021402209997177124,
"rps_doc_books_importance": -569.1725463867188,
"rps_doc_books_importance_length_correction": -569.1725463867188,
"rps_doc_openwebtext_importance": -309.2687683105469,
"rps_doc_openwebtext_importance_length_correction": -309.2687683105469,
"rps_doc_wikipedia_importance": -254.4000244140625,
"rps_doc_wikipedia_importance_length_correction": -254.4000244140625
},
"fasttext": {
"dclm": 0.07925444841384888,
"english": 0.751974880695343,
"fineweb_edu_approx": 3.041583299636841,
"eai_general_math": 0.33714979887008667,
"eai_open_web_math": 0.14443552494049072,
"eai_web_code": 0.31843888759613037
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-6,502,462,241,315,850,000 | A python library for accessing the VEML6070 digital UV light sensor from Vishay
Ви не можете вибрати більше 25 тем Теми мають розпочинатися з літери або цифри, можуть містити дефіси (-) і не повинні перевищувати 35 символів.
Christian Nicolai c29e050858
module: add Dependabot config file v2
1 місяць тому
.github fix 1 місяць тому
tests module: add estimated risk level calculation based on UVA light intensity 10 місяці тому
veml6070 module: add estimated risk level calculation based on UVA light intensity 10 місяці тому
.gitignore module: convert to use Pipfile 7 місяці тому
.pylintrc module: ignore some files for linting 2 роки тому
.travis.yml travis: add Python 3.8 4 місяці тому
LICENSE Initial commit 4 роки тому
Pipfile module: convert to use Pipfile 7 місяці тому
README.md module: calculate UVA light intensity correctly for rset != RSET_240K 10 місяці тому
demo.py module: convert to use Pipfile 7 місяці тому
setup.py module: convert to use Pipfile 7 місяці тому
README.md
python-veml6070
Build Status
A Python library for accessing the VEML6070 digital UV light sensor from Vishay via python-smbus using the I2C interface.
Default settings are suitable for Raspberry Pi 2 and 3 and was successfully tested using a breakout.
I created this Python library in style of e.g. python-tsl2591 (of the TSL2591 light sensor) since I found either python code broken for my hardware or code targeted at Arduino.
Usage
Consult the datasheet, the application notes and see demo.py for clues how to use this library.
Not all functions of the chip are supported, especially not the interrupt handling since I had no use for this. Please send pull requests for improvements and bug fixes!
Serious Flaws before September 2019
In September 2019 it was discovered (and fixed) that:
• previously the sensor was never shutdown between measurements which wastes power but still takes measurements successfully
• the UVA light intensity was calculated wrongly (too high) for rset != RSET_240K due to wrong compensation: higher rset leads to higher sampling time leads to higher absolute ADC step counts which should lead to every ADC step indicating a smaller amount of W/(m*m) of UVA power and a higher precision of the final UVA power but it wrongly behaved the opposite way. The integration_time worked correctly all the time.
License
Python files in this repository are released under the MIT license. | {
"url": "https://dev.mycrobase.de/gitea/cn/python-veml6070?lang=uk-UA",
"source_domain": "dev.mycrobase.de",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "32764",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TEVCJRLG5MGFLWOABE5HBO7JR6VZO77W",
"WARC-Concurrent-To": "<urn:uuid:2f4c8b10-8510-4c12-a213-0f037c032fba>",
"WARC-Date": "2020-07-16T01:09:49Z",
"WARC-IP-Address": "5.45.106.133",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NPYMUGDN4OSI7ZPZJOVPIIMEMU4EGE22",
"WARC-Record-ID": "<urn:uuid:bcb4d0ad-5b30-4952-bc16-c6d1c1ccee6e>",
"WARC-Target-URI": "https://dev.mycrobase.de/gitea/cn/python-veml6070?lang=uk-UA",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c4692a21-29c3-47ac-aad2-070c49d0085b>"
},
"warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-211.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
80,
225,
254,
292,
306,
332,
427,
525,
581,
641,
690,
725,
778,
873,
926,
980,
981,
991,
992,
1008,
1009,
1022,
1023,
1145,
1146,
1247,
1248,
1425,
1426,
1432,
1433,
1529,
1530,
1700,
1701,
1737,
1738,
1792,
1793,
1920,
2341,
2342,
2350,
2351
],
"line_end_idx": [
80,
225,
254,
292,
306,
332,
427,
525,
581,
641,
690,
725,
778,
873,
926,
980,
981,
991,
992,
1008,
1009,
1022,
1023,
1145,
1146,
1247,
1248,
1425,
1426,
1432,
1433,
1529,
1530,
1700,
1701,
1737,
1738,
1792,
1793,
1920,
2341,
2342,
2350,
2351,
2418
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2418,
"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.24168513715267181,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05764966830611229,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26607540249824524,
"rps_doc_frac_unique_words": 0.5350649356842041,
"rps_doc_mean_word_length": 5.070129871368408,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.005594730377197,
"rps_doc_word_count": 385,
"rps_doc_frac_chars_dupe_10grams": 0.14446720480918884,
"rps_doc_frac_chars_dupe_5grams": 0.22643442451953888,
"rps_doc_frac_chars_dupe_6grams": 0.22643442451953888,
"rps_doc_frac_chars_dupe_7grams": 0.22643442451953888,
"rps_doc_frac_chars_dupe_8grams": 0.22643442451953888,
"rps_doc_frac_chars_dupe_9grams": 0.18954917788505554,
"rps_doc_frac_chars_top_2gram": 0.04098360985517502,
"rps_doc_frac_chars_top_3gram": 0.034836068749427795,
"rps_doc_frac_chars_top_4gram": 0.036885250359773636,
"rps_doc_books_importance": -152.84278869628906,
"rps_doc_books_importance_length_correction": -152.84278869628906,
"rps_doc_openwebtext_importance": -119.87023162841797,
"rps_doc_openwebtext_importance_length_correction": -119.87023162841797,
"rps_doc_wikipedia_importance": -123.91928100585938,
"rps_doc_wikipedia_importance_length_correction": -123.91928100585938
},
"fasttext": {
"dclm": 0.14970749616622925,
"english": 0.5682844519615173,
"fineweb_edu_approx": 2.393289804458618,
"eai_general_math": 0.5471755266189575,
"eai_open_web_math": 0.3422709107398987,
"eai_web_code": 0.49252766370773315
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285636",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.3815",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "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": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-7,392,046,978,454,660,000 | Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
PerlMonks
slurping __DATA__
by LanceDeeply (Chaplain)
on Aug 08, 2003 at 14:11 UTC ( #282185=perlquestion: print w/replies, xml ) Need Help??
LanceDeeply has asked for the wisdom of the Perl Monks concerning the following question:
I know this code:
my $data = do { local $/; <DATA> };
slurps the __DATA__ section into my scalar $data, but what is perl doing in that do loop?
my $data = do { local $/; # localize RS? <DATA> # evaluate <DATA> in scalar context ? }
what's happenning in there?
Replies are listed 'Best First'.
Re: slurping __DATA__
by jeffa (Bishop) on Aug 08, 2003 at 14:17 UTC
do is "not really a function". It is a block that has a seperate scope from wherever it was called from. This allows you to localize $/ so that when execution leaves our "temporary" scope, $/ will be what it was before it was changed.
If you look up $/ in perlvar, you will see
You may set it to a multi-character
string to match a multi-character terminator, or
to "undef" to read through the end of file.
Finally, <DATA> returns the next line from the filehandle DATA, and since $/ is undefined, the entire contents of the file are returned and "caught" in a scalar.
UPDATE: i should add that this is one of those few cases where local is a good choice. For example,
local $/;
Is essentially the same as
local $/ = undef;
Which is not the same as
$/ = undef;
Even though that last snippet will be contained inside a do block ... $/ will still be undef afterwards. Try this - make two files foo.txt and bar.txt and run this:
jeffa
L-LL-L--L-LL-L--L-LL-L--
-R--R-RR-R--R-RR-R--R-RR
B--B--B--B--B--B--B--B--
H---H---H---H---H---H---
(the triplet paradiddle with high-hat)
Thanks!
I did read perldoc perlvar but I didnt know that local $/; was undef-ing it for the do's block context. I'll have to go brush up on local, 'cause I never use it.
Re: slurping __DATA__
by Zeroth (Beadle) on Aug 08, 2003 at 14:17 UTC
See: perldoc -f do
And read the part about "do BLOCK". That should explain it quite well.
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: perlquestion [id://282185]
Approved by diotalevi
help
Chatterbox?
and all is quiet...
How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (5)
As of 2017-10-22 03:58 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
My fridge is mostly full of:
Results (272 votes). Check out past polls.
Notices? | {
"url": "http://www.perlmonks.org/index.pl?node_id=282185",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "25973",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SVISISZECAOKOZVEL54SFAKKH23YNJJB",
"WARC-Concurrent-To": "<urn:uuid:4b552a42-db83-49c8-bb1b-803a56fe59d8>",
"WARC-Date": "2017-10-22T04:00:10Z",
"WARC-IP-Address": "216.92.34.251",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QZIBVW2DMAOA2IE7MT5NBL5N2TY6LIUP",
"WARC-Record-ID": "<urn:uuid:7e92d857-4597-4758-baaf-135452feb46c>",
"WARC-Target-URI": "http://www.perlmonks.org/index.pl?node_id=282185",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bc8b6652-1558-4b4a-9e69-28a6ee03b1f1>"
},
"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,
63,
82,
84,
96,
97,
115,
116,
142,
230,
320,
321,
339,
340,
376,
466,
467,
555,
583,
584,
617,
639,
686,
925,
926,
973,
974,
1017,
1073,
1124,
1129,
1295,
1296,
1400,
1414,
1445,
1467,
1496,
1512,
1681,
1682,
1692,
1693,
1722,
1751,
1780,
1809,
1852,
1857,
1871,
1872,
2040,
2041,
2063,
2111,
2134,
2209,
2210,
2218,
2228,
2238,
2239,
2259,
2277,
2290,
2303,
2341,
2363,
2368,
2380,
2400,
2401,
2439,
2452,
2488,
2515,
2525,
2538,
2550,
2561,
2579,
2612,
2613,
2614,
2615,
2616,
2617,
2618,
2619,
2620,
2621,
2622,
2623,
2624,
2625,
2626,
2627,
2628,
2629,
2676,
2677
],
"line_end_idx": [
63,
82,
84,
96,
97,
115,
116,
142,
230,
320,
321,
339,
340,
376,
466,
467,
555,
583,
584,
617,
639,
686,
925,
926,
973,
974,
1017,
1073,
1124,
1129,
1295,
1296,
1400,
1414,
1445,
1467,
1496,
1512,
1681,
1682,
1692,
1693,
1722,
1751,
1780,
1809,
1852,
1857,
1871,
1872,
2040,
2041,
2063,
2111,
2134,
2209,
2210,
2218,
2228,
2238,
2239,
2259,
2277,
2290,
2303,
2341,
2363,
2368,
2380,
2400,
2401,
2439,
2452,
2488,
2515,
2525,
2538,
2550,
2561,
2579,
2612,
2613,
2614,
2615,
2616,
2617,
2618,
2619,
2620,
2621,
2622,
2623,
2624,
2625,
2626,
2627,
2628,
2629,
2676,
2677,
2689
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2689,
"ccnet_original_nlines": 100,
"rps_doc_curly_bracket": 0.0014875399647280574,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2996845543384552,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08990535885095596,
"rps_doc_frac_lines_end_with_ellipsis": 0.009900989942252636,
"rps_doc_frac_no_alph_words": 0.3075709939002991,
"rps_doc_frac_unique_words": 0.5641646385192871,
"rps_doc_mean_word_length": 4.4503631591796875,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0.007886439561843872,
"rps_doc_unigram_entropy": 5.112139701843262,
"rps_doc_word_count": 413,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.028835689648985863,
"rps_doc_frac_chars_dupe_6grams": 0.021762790158391,
"rps_doc_frac_chars_dupe_7grams": 0.021762790158391,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.019586509093642235,
"rps_doc_frac_chars_top_3gram": 0.022850919514894485,
"rps_doc_frac_chars_top_4gram": 0.017954299226403236,
"rps_doc_books_importance": -326.03448486328125,
"rps_doc_books_importance_length_correction": -326.03448486328125,
"rps_doc_openwebtext_importance": -197.83700561523438,
"rps_doc_openwebtext_importance_length_correction": -197.83700561523438,
"rps_doc_wikipedia_importance": -137.35488891601562,
"rps_doc_wikipedia_importance_length_correction": -137.35488891601562
},
"fasttext": {
"dclm": 0.12326979637145996,
"english": 0.9048430323600769,
"fineweb_edu_approx": 1.7772986888885498,
"eai_general_math": 0.14212936162948608,
"eai_open_web_math": 0.4047442674636841,
"eai_web_code": 0.0017167299520224333
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.