{ // 获取包含Hugging Face文本的span元素 const spans = link.querySelectorAll('span.whitespace-nowrap, span.hidden.whitespace-nowrap'); spans.forEach(span => { if (span.textContent && span.textContent.trim().match(/Hugging\s*Face/i)) { span.textContent = 'AI快站'; } }); }); // 替换logo图片的alt属性 document.querySelectorAll('img[alt*="Hugging"], img[alt*="Face"]').forEach(img => { if (img.alt.match(/Hugging\s*Face/i)) { img.alt = 'AI快站 logo'; } }); } // 替换导航栏中的链接 function replaceNavigationLinks() { // 已替换标记,防止重复运行 if (window._navLinksReplaced) { return; } // 已经替换过的链接集合,防止重复替换 const replacedLinks = new Set(); // 只在导航栏区域查找和替换链接 const headerArea = document.querySelector('header') || document.querySelector('nav'); if (!headerArea) { return; } // 在导航区域内查找链接 const navLinks = headerArea.querySelectorAll('a'); navLinks.forEach(link => { // 如果已经替换过,跳过 if (replacedLinks.has(link)) return; const linkText = link.textContent.trim(); const linkHref = link.getAttribute('href') || ''; // 替换Spaces链接 - 仅替换一次 if ( (linkHref.includes('/spaces') || linkHref === '/spaces' || linkText === 'Spaces' || linkText.match(/^s*Spacess*$/i)) && linkText !== 'PDF TO Markdown' && linkText !== 'PDF TO Markdown' ) { link.textContent = 'PDF TO Markdown'; link.href = 'https://fast360.xyz'; link.setAttribute('target', '_blank'); link.setAttribute('rel', 'noopener noreferrer'); replacedLinks.add(link); } // 删除Posts链接 else if ( (linkHref.includes('/posts') || linkHref === '/posts' || linkText === 'Posts' || linkText.match(/^s*Postss*$/i)) ) { if (link.parentNode) { link.parentNode.removeChild(link); } replacedLinks.add(link); } // 替换Docs链接 - 仅替换一次 else if ( (linkHref.includes('/docs') || linkHref === '/docs' || linkText === 'Docs' || linkText.match(/^s*Docss*$/i)) && linkText !== 'Voice Cloning' ) { link.textContent = 'Voice Cloning'; link.href = 'https://vibevoice.info/'; replacedLinks.add(link); } // 删除Enterprise链接 else if ( (linkHref.includes('/enterprise') || linkHref === '/enterprise' || linkText === 'Enterprise' || linkText.match(/^s*Enterprises*$/i)) ) { if (link.parentNode) { link.parentNode.removeChild(link); } replacedLinks.add(link); } }); // 查找可能嵌套的Spaces和Posts文本 const textNodes = []; function findTextNodes(element) { if (element.nodeType === Node.TEXT_NODE) { const text = element.textContent.trim(); if (text === 'Spaces' || text === 'Posts' || text === 'Enterprise') { textNodes.push(element); } } else { for (const child of element.childNodes) { findTextNodes(child); } } } // 只在导航区域内查找文本节点 findTextNodes(headerArea); // 替换找到的文本节点 textNodes.forEach(node => { const text = node.textContent.trim(); if (text === 'Spaces') { node.textContent = node.textContent.replace(/Spaces/g, 'PDF TO Markdown'); } else if (text === 'Posts') { // 删除Posts文本节点 if (node.parentNode) { node.parentNode.removeChild(node); } } else if (text === 'Enterprise') { // 删除Enterprise文本节点 if (node.parentNode) { node.parentNode.removeChild(node); } } }); // 标记已替换完成 window._navLinksReplaced = true; } // 替换代码区域中的域名 function replaceCodeDomains() { // 特别处理span.hljs-string和span.njs-string元素 document.querySelectorAll('span.hljs-string, span.njs-string, span[class*="hljs-string"], span[class*="njs-string"]').forEach(span => { if (span.textContent && span.textContent.includes('huggingface.co')) { span.textContent = span.textContent.replace(/huggingface.co/g, 'aifasthub.com'); } }); // 替换hljs-string类的span中的域名(移除多余的转义符号) document.querySelectorAll('span.hljs-string, span[class*="hljs-string"]').forEach(span => { if (span.textContent && span.textContent.includes('huggingface.co')) { span.textContent = span.textContent.replace(/huggingface.co/g, 'aifasthub.com'); } }); // 替换pre和code标签中包含git clone命令的域名 document.querySelectorAll('pre, code').forEach(element => { if (element.textContent && element.textContent.includes('git clone')) { const text = element.innerHTML; if (text.includes('huggingface.co')) { element.innerHTML = text.replace(/huggingface.co/g, 'aifasthub.com'); } } }); // 处理特定的命令行示例 document.querySelectorAll('pre, code').forEach(element => { const text = element.innerHTML; if (text.includes('huggingface.co')) { // 针对git clone命令的专门处理 if (text.includes('git clone') || text.includes('GIT_LFS_SKIP_SMUDGE=1')) { element.innerHTML = text.replace(/huggingface.co/g, 'aifasthub.com'); } } }); // 特别处理模型下载页面上的代码片段 document.querySelectorAll('.flex.border-t, .svelte_hydrator, .inline-block').forEach(container => { const content = container.innerHTML; if (content && content.includes('huggingface.co')) { container.innerHTML = content.replace(/huggingface.co/g, 'aifasthub.com'); } }); // 特别处理模型仓库克隆对话框中的代码片段 try { // 查找包含"Clone this model repository"标题的对话框 const cloneDialog = document.querySelector('.svelte_hydration_boundary, [data-target="MainHeader"]'); if (cloneDialog) { // 查找对话框中所有的代码片段和命令示例 const codeElements = cloneDialog.querySelectorAll('pre, code, span'); codeElements.forEach(element => { if (element.textContent && element.textContent.includes('huggingface.co')) { if (element.innerHTML.includes('huggingface.co')) { element.innerHTML = element.innerHTML.replace(/huggingface.co/g, 'aifasthub.com'); } else { element.textContent = element.textContent.replace(/huggingface.co/g, 'aifasthub.com'); } } }); } // 更精确地定位克隆命令中的域名 document.querySelectorAll('[data-target]').forEach(container => { const codeBlocks = container.querySelectorAll('pre, code, span.hljs-string'); codeBlocks.forEach(block => { if (block.textContent && block.textContent.includes('huggingface.co')) { if (block.innerHTML.includes('huggingface.co')) { block.innerHTML = block.innerHTML.replace(/huggingface.co/g, 'aifasthub.com'); } else { block.textContent = block.textContent.replace(/huggingface.co/g, 'aifasthub.com'); } } }); }); } catch (e) { // 错误处理但不打印日志 } } // 当DOM加载完成后执行替换 if (document.readyState === 'loading') { document.addEventListener('DOMContentLoaded', () => { replaceHeaderBranding(); replaceNavigationLinks(); replaceCodeDomains(); // 只在必要时执行替换 - 3秒后再次检查 setTimeout(() => { if (!window._navLinksReplaced) { console.log('[Client] 3秒后重新检查导航链接'); replaceNavigationLinks(); } }, 3000); }); } else { replaceHeaderBranding(); replaceNavigationLinks(); replaceCodeDomains(); // 只在必要时执行替换 - 3秒后再次检查 setTimeout(() => { if (!window._navLinksReplaced) { console.log('[Client] 3秒后重新检查导航链接'); replaceNavigationLinks(); } }, 3000); } // 增加一个MutationObserver来处理可能的动态元素加载 const observer = new MutationObserver(mutations => { // 检查是否导航区域有变化 const hasNavChanges = mutations.some(mutation => { // 检查是否存在header或nav元素变化 return Array.from(mutation.addedNodes).some(node => { if (node.nodeType === Node.ELEMENT_NODE) { // 检查是否是导航元素或其子元素 if (node.tagName === 'HEADER' || node.tagName === 'NAV' || node.querySelector('header, nav')) { return true; } // 检查是否在导航元素内部 let parent = node.parentElement; while (parent) { if (parent.tagName === 'HEADER' || parent.tagName === 'NAV') { return true; } parent = parent.parentElement; } } return false; }); }); // 只在导航区域有变化时执行替换 if (hasNavChanges) { // 重置替换状态,允许再次替换 window._navLinksReplaced = false; replaceHeaderBranding(); replaceNavigationLinks(); } }); // 开始观察document.body的变化,包括子节点 if (document.body) { observer.observe(document.body, { childList: true, subtree: true }); } else { document.addEventListener('DOMContentLoaded', () => { observer.observe(document.body, { childList: true, subtree: true }); }); } })(); \n\n\nAs you can see, elements surround the rest of the document, and elements surround the page content. This structure is often thought of as a tree with branches (in this case, the and

elements) growing from the trunk (). This hierarchical structure is called the DOM: the Document Object Model.\n\nTags\n\nHTML documents are written in plain text. They can be written in any text editor that allows content to be saved as plain text, such as Notepad, Notepad++, or Sublime,  but most HTML authors prefer to use a specialized editor that highlights syntax and shows the DOM. Tag names may be written in either upper or lower case. However, the W3C (the global consortium that maintains the HTML standard) recommends using lower case (and XHTML requires lower case).\n\nHTML attaches special meaning to anything that starts with the less-than sign (\"<\") and ends with the greater-than sign (\">\"). Such markup is called a tag. Make sure to close the tag, as some tags are closed by default, whereas others might produce unexpected errors if you forget the end tag. \n\nHere is a simple example:\n\n

This is text within a paragraph.

\n\nIn this example there is a start tag and a closing tag. Closing tags are the same as the start tag but also contain a forward slash immediately after the leading less-than sign. Most elements in HTML are written using both start and closing tags. Start and closing tags should be properly nested--that is, closing tags should be written in the opposite order of the start tags. Proper nesting is one rule that must be obeyed in order to write valid code.\n\nThis is an an example of valid code:\n\nI really mean that.\n\nThis is an example of invalid code:\n\nInvalid: I really mean that.\n\nNote that in the valid example, the closing tag for the nested element is placed before the closing tag for the element in which it is nested. In the invalid code, they are nested.\n\nUntil the adoption of the HTML5 parsing rules, browsers didn't interpret invalid code in the same way and produced different results when they encountered invalid code. Browsers were forgiving to Web authors, but unfortunately not all in the same way, resulting in almost unpredictable results in case of invalid HTML. These days are over with the latest evolution of browsers, like Internet Explorer 10, Firefox 4, Opera 11.60, Chrome 18, or Safari 5, as they implement the now-standard invalid-code-parsing rules. Invalid code results in the same DOM tree on all modern browsers.\n\nSome elements do not contain any text content or any other elements. These are empty elements and need no closing tag. This is an example:\n\n\n\nMany people mark up empty elements using a trailing forward slash (which is mandatory in XHTML).\n\n\n\nIn HTML this slash has no technical functionality and using it is a pure stylistic choice, though it is recommended to always close tags.\n\nAttributes\n\nThe start tag may contain additional information, as in the preceding example. Such information is called an attribute. Attributes usually consist of 2 parts:\n\n • An attribute name\n • An attribute value\n\nA few attributes can only have one value. They are Boolean attributes and may be shortened by only specifying the attribute name or leaving the attribute value empty. Thus, the following 3 examples have the same meaning:\n\n\n\n\n\n\n\nAttribute values that consist of a single word or number may be written as they are, but as soon as there are two or more strings of characters in the value, it must be written within quotation marks. Both single quotes (') and double quotes (\") are allowed. Many developers prefer to always use quotes to make the code less ambiguous to the eye and to avoid mistakes. The following is such a mistake:\n\n

(Beware, this probably does not mean what you think it means.)\n\nIn this example the value was supposed to be \"foo bar\" but since there were no quotes the code is interpreted as if it had been written like this:\n\n

\n\nNamed character references\n\nNamed character references (often casually called entities) are used to print characters that have a special meaning in HTML. For example, HTML interprets the less-than and greater-than symbols as tag delimiters. When you want to display a greater-than symbol in the text, you can use a named character reference. There are four common named character references one must know:\n\n • &gt; denotes the greater than sign (>)\n • &lt; denotes the less than sign (<)\n • &amp; denotes the ampersand (&)\n • &quot; denotes double quote (\")\n\nThere are many more entities, but these four are the most important because they represent characters that have a special meaning in HTML.\n\nDoctype and comments\n\nIn addition to tags, text content, and entities, an HTML document must contain a doctype declaration as the first line. The doctype declaration is not an HTML tag; it is an instruction to the web browser about what version of HTML the page is written in.\n\nIn HTML 4.01, doctype refers to a DTD (Document Type Definition) as it was based on SGML. There are three different doctype declarations in HTML 4.01.\n\nHTML 4.01 Strict\n\nThis DTD contains all HTML elements and attributes, but does NOT INCLUDE presentational or deprecated elements (like font). Framesets are not allowed.\n\n\n\nHTML 4.01 Transitional\n\nThis DTD contains all HTML elements and attributes, INCLUDING presentational and deprecated elements (like font). Framesets are not allowed.\n\n\n\nHTML 4.01 Frameset\n\nThis DTD is equal to HTML 4.01 Transitional, but allows the use of frameset content.\n\n\n\nIn HTML 5, there is only one declaration and is written like this:\n\n\n\nThe doctype has a long and intricate history, but for now all you need to know is that this doctype tells the browser to interpret the HTML and CSS code according to W3C standards and not try to pretend that it is Internet Explorer from the 90's. (See quirks mode.)\n\nHTML has a mechanism for embedding comments that are not displayed when the page is rendered in a browser. This is useful for explaining a section of markup, or leaving notes for other people who might work on the page, or for leaving reminders for yourself. HTML comments are enclosed in symbols as follows:\n\n\n\nA complete but small document\n\nPutting this together, here is a tiny example of an HTML document. You can copy this code to a text editor, save it as myfirstdoc.html, and load it in a browser. Make sure you are saving it using the character encoding UTF-8. Since this document uses no styling it will look very plain, but it is only a small start.\n\n\n\n\n A tiny document\n\n\n

Main heading in my document

\n \n

Look Ma, I am coding HTML.

\n\n\n\nAutorzy i etykiety dokumentu\n\n Autorzy tej strony: scx\n Ostatnia aktualizacja: scx,"},"metadata":{"kind":"string","value":"{\n \"url\": \"https://developer.mozilla.org/pl/docs/Web/Guide/HTML/Wprowadzenie\",\n \"source_domain\": \"developer.mozilla.org\",\n \"snapshot_id\": \"crawl=CC-MAIN-2016-44\",\n \"warc_metadata\": {\n \"Content-Length\": \"55558\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:VUMPKR3QPF5J5RUOLGEIWJMDEETC3L4I\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2016-10-27T23:31:14Z\",\n \"WARC-IP-Address\": \"63.245.215.53\",\n \"WARC-Identified-Payload-Type\": null,\n \"WARC-Payload-Digest\": \"sha1:HHEKW7WJEVU7H5GQWIVCL75MFP7JYUNJ\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://developer.mozilla.org/pl/docs/Web/Guide/HTML/Wprowadzenie\",\n \"WARC-Truncated\": \"length\",\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"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\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 21,\n 22,\n 510,\n 511,\n 1197,\n 1198,\n 1527,\n 1528,\n 1822,\n 1823,\n 2009,\n 2010,\n 2012,\n 2013,\n 2037,\n 2038,\n 2709,\n 2710,\n 2724,\n 2725,\n 3276,\n 3277,\n 3457,\n 3458,\n 3498,\n 3499,\n 3568,\n 3569,\n 3654,\n 3655,\n 3850,\n 3851,\n 3901,\n 3902,\n 3935,\n 3936,\n 4085,\n 4086,\n 4113,\n 4114,\n 4316,\n 4317,\n 4659,\n 4660,\n 4697,\n 4698,\n 5025,\n 5026,\n 5444,\n 5445,\n 5572,\n 5573,\n 5580,\n 5589,\n 5640,\n 5650,\n 5658,\n 5659,\n 5983,\n 5984,\n 5989,\n 5990,\n 6449,\n 6450,\n 6745,\n 6746,\n 6772,\n 6773,\n 6813,\n 6814,\n 7269,\n 7270,\n 7307,\n 7308,\n 7354,\n 7355,\n 7391,\n 7392,\n 7447,\n 7448,\n 7629,\n 7630,\n 8212,\n 8213,\n 8352,\n 8353,\n 8380,\n 8381,\n 8478,\n 8479,\n 8508,\n 8509,\n 8647,\n 8648,\n 8659,\n 8660,\n 8819,\n 8820,\n 8842,\n 8865,\n 8866,\n 9087,\n 9088,\n 9116,\n 9117,\n 9137,\n 9138,\n 9155,\n 9156,\n 9558,\n 9559,\n 9640,\n 9641,\n 9788,\n 9789,\n 9812,\n 9813,\n 9840,\n 9841,\n 10219,\n 10220,\n 10263,\n 10303,\n 10339,\n 10375,\n 10376,\n 10515,\n 10516,\n 10537,\n 10538,\n 10793,\n 10794,\n 10945,\n 10946,\n 10963,\n 10964,\n 11115,\n 11116,\n 11207,\n 11208,\n 11231,\n 11232,\n 11373,\n 11374,\n 11477,\n 11478,\n 11497,\n 11498,\n 11583,\n 11584,\n 11686,\n 11687,\n 11754,\n 11755,\n 11771,\n 11772,\n 12038,\n 12039,\n 12348,\n 12349,\n 12379,\n 12380,\n 12410,\n 12411,\n 12728,\n 12729,\n 12745,\n 12762,\n 12769,\n 12802,\n 12810,\n 12817,\n 12856,\n 12922,\n 13006,\n 13014,\n 13022,\n 13023,\n 13052,\n 13053,\n 13078\n ],\n \"line_end_idx\": [\n 21,\n 22,\n 510,\n 511,\n 1197,\n 1198,\n 1527,\n 1528,\n 1822,\n 1823,\n 2009,\n 2010,\n 2012,\n 2013,\n 2037,\n 2038,\n 2709,\n 2710,\n 2724,\n 2725,\n 3276,\n 3277,\n 3457,\n 3458,\n 3498,\n 3499,\n 3568,\n 3569,\n 3654,\n 3655,\n 3850,\n 3851,\n 3901,\n 3902,\n 3935,\n 3936,\n 4085,\n 4086,\n 4113,\n 4114,\n 4316,\n 4317,\n 4659,\n 4660,\n 4697,\n 4698,\n 5025,\n 5026,\n 5444,\n 5445,\n 5572,\n 5573,\n 5580,\n 5589,\n 5640,\n 5650,\n 5658,\n 5659,\n 5983,\n 5984,\n 5989,\n 5990,\n 6449,\n 6450,\n 6745,\n 6746,\n 6772,\n 6773,\n 6813,\n 6814,\n 7269,\n 7270,\n 7307,\n 7308,\n 7354,\n 7355,\n 7391,\n 7392,\n 7447,\n 7448,\n 7629,\n 7630,\n 8212,\n 8213,\n 8352,\n 8353,\n 8380,\n 8381,\n 8478,\n 8479,\n 8508,\n 8509,\n 8647,\n 8648,\n 8659,\n 8660,\n 8819,\n 8820,\n 8842,\n 8865,\n 8866,\n 9087,\n 9088,\n 9116,\n 9117,\n 9137,\n 9138,\n 9155,\n 9156,\n 9558,\n 9559,\n 9640,\n 9641,\n 9788,\n 9789,\n 9812,\n 9813,\n 9840,\n 9841,\n 10219,\n 10220,\n 10263,\n 10303,\n 10339,\n 10375,\n 10376,\n 10515,\n 10516,\n 10537,\n 10538,\n 10793,\n 10794,\n 10945,\n 10946,\n 10963,\n 10964,\n 11115,\n 11116,\n 11207,\n 11208,\n 11231,\n 11232,\n 11373,\n 11374,\n 11477,\n 11478,\n 11497,\n 11498,\n 11583,\n 11584,\n 11686,\n 11687,\n 11754,\n 11755,\n 11771,\n 11772,\n 12038,\n 12039,\n 12348,\n 12349,\n 12379,\n 12380,\n 12410,\n 12411,\n 12728,\n 12729,\n 12745,\n 12762,\n 12769,\n 12802,\n 12810,\n 12817,\n 12856,\n 12922,\n 13006,\n 13014,\n 13022,\n 13023,\n 13052,\n 13053,\n 13078,\n 13106\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 13106,\n \"ccnet_original_nlines\": 181,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.3420158624649048,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.04643262177705765,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.2023405134677887,\n \"rps_doc_frac_unique_words\": 0.3487129807472229,\n \"rps_doc_mean_word_length\": 5.024283409118652,\n \"rps_doc_num_sentences\": 134,\n \"rps_doc_symbol_to_word_ratio\": 0,\n \"rps_doc_unigram_entropy\": 5.73387336730957,\n \"rps_doc_word_count\": 2059,\n \"rps_doc_frac_chars_dupe_10grams\": 0.01449976023286581,\n \"rps_doc_frac_chars_dupe_5grams\": 0.047559209167957306,\n \"rps_doc_frac_chars_dupe_6grams\": 0.039922669529914856,\n \"rps_doc_frac_chars_dupe_7grams\": 0.03035283088684082,\n \"rps_doc_frac_chars_dupe_8grams\": 0.03035283088684082,\n \"rps_doc_frac_chars_dupe_9grams\": 0.01449976023286581,\n \"rps_doc_frac_chars_top_2gram\": 0.006959879770874977,\n \"rps_doc_frac_chars_top_3gram\": 0.0038666001055389643,\n \"rps_doc_frac_chars_top_4gram\": 0.006669890135526657,\n \"rps_doc_books_importance\": -1185.460205078125,\n \"rps_doc_books_importance_length_correction\": -1185.460205078125,\n \"rps_doc_openwebtext_importance\": -648.3334350585938,\n \"rps_doc_openwebtext_importance_length_correction\": -648.3334350585938,\n \"rps_doc_wikipedia_importance\": -462.4232482910156,\n \"rps_doc_wikipedia_importance_length_correction\": -462.4232482910156\n },\n \"fasttext\": {\n \"dclm\": 0.7640713453292847,\n \"english\": 0.6323886513710022,\n \"fineweb_edu_approx\": 3.3080592155456543,\n \"eai_general_math\": 0.8538540601730347,\n \"eai_open_web_math\": 0.4037420153617859,\n \"eai_web_code\": 0.9148756265640259\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.4\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"004.0151\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"23\",\n \"label\": \"Tutorial\"\n },\n \"secondary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n },\n \"secondary\": {\n \"code\": \"1\",\n \"label\": \"General Audience\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192829,"cells":{"id":{"kind":"number","value":-8703629621795375000,"string":"-8,703,629,621,795,375,000"},"text":{"kind":"string","value":"Gerrit\n\nGerrit is the code review system used by the OpenStack project. For a full description of how the system fits into the OpenStack workflow, see the development workflow guide.\n\nThis section describes how Gerrit is configured for use in the OpenStack project and the tools used to manage that configuration.\n\nInstallation\n\nGerrit is installed and configured by Puppet, including specifying the exact Java WAR file that is used. See System Administration for how Puppet is used to manage OpenStack infrastructure systems.\n\nCinder Volumes\n\nThe Gerrit installation at /home/gerrit2 is located on a Cinder volume. See Cinder Volume Management for details on volume management. Note that SSD volumes are used (and they have a minimum size of 100G).\n\nGerrit Configuration\n\nMost of Gerrit’s configuration is in configuration files or Git repositories (and in our case, managed by Puppet), but a few items must be configured in the database. The following is a record of these changes:\n\nAdd information about the CLA:\n\nsudo -u root\nmysql\nuse reviewdb;\ninsert into contributor_agreements values (\n'Y', 'Y', 'Y', 'ICLA',\n'OpenStack Individual Contributor License Agreement',\n'static/cla.html', 2);\n\nGroups\n\nA number of system-wide groups are configured in Gerrit (rather than via Puppet). When installing a new Gerrit, you should create these by hand (and capture their UUID - you will need them to setup the ACLs later).\n\nThe Project Bootstrappers group grants all the permissions needed to set up a new project. Normally, the OpenStack Project Creater account is the only member of this group, but members of the Administrators group may temporarily add themselves in order to correct problems with automatic project creation.\n\nThe Third-Party CI group is used to grant +/-1 Verified access to external testing tools on a sandbox project.\n\nThe Voting Third-Party CI group is used to grant +/-1 Verified access to external testing tools for all projects.\n\nThe Continuous Integration Tools group contains Zuul and any other CI tools that get +2/-2 access on reviews.\n\nThe Release Managers group is used for release managers.\n\nUsers\n\nThe first user to log in becomes an administrator. Be sure to set an account name and add ssh keys - you’ll need those.\n\nOnce you’ve created your groups you should create the openstack-project-creator account by hand (the account name is referenced from system-config: modules/openstack_project/templates/review.projects.ini.erb) using:\n\ncat $pubkey | ssh -p 29418 $USER@$HOST gerrit create-account \\\n --group \"'Project Bootstrappers'\" \\\n --group Administrators \\\n --full-name \"'Project Creator'\" \\\n --email openstack-infra@lists.openstack.org \\\n --ssh-key - openstack-project-creator\n\nGitHub Integration\n\nGerrit replicates to GitHub by pushing to a standard Git remote. The GitHub projects are configured to allow only the Gerrit user to push.\n\nPull requests can not be disabled for a project in Github, so instead we have a script that runs from cron to close any open pull requests with instructions to use Gerrit.\n\nThese are both handled automatically by Jeepyb.\n\nNote that the user running Gerrit will need to accept the GitHub host keys. e.g.:\n\nsudo su - gerrit2\nssh github.com\n\nTroubleshooting\n\nWhen creating a new project, there can be times where the Jeepyb automation to create the GitHub project can fail, and leave the project improperly configured. This can cause replication to GitHub to fail. The project in GitHub will be created, but will appear empty. When trying replication from Gerrit, it will show a Permission denied error when trying to push content. To solve that, following steps are needed:\n\n 1. Login into github.com, using openstack-project-creator user.\n\n 2. Navigate to the failed repository, and enter on Settings > Collaborators & teams option.\n\n 3. Add Gerrit as Team member to that project.\n\nAfter the team has been added, project will start replicating successfully to GitHub.\n\nAuto Review Expiry\n\nPuppet automatically installs a daily cron job called expire-old-reviews onto the Gerrit servers. This script follows two rules:\n\n 1. If the review hasn’t been touched in 2 weeks, mark as abandoned.\n\n 2. If there is a negative review and it hasn’t been touched in 1 week, mark as abandoned.\n\nIf your review gets touched by either of these rules, it is possible to unabandon a review on the Gerrit web interface.\n\nThis process is managed by the Jeepyb openstack-infra project.\n\nGerrit IRC Bot\n\nGerritbot consumes the Gerrit event stream and announces relevant events on IRC. Gerritbot is an openstack-infra project and is also available on Pypi.\n\nLaunchpad Bug Integration\n\nIn addition to the hyperlinks provided by the regex in gerrit.config, we use a Gerrit hook to update Launchpad bugs when changes referencing them are applied. This is managed by the Jeepyb openstack-infra project.\n\nStoryboard Integration\n\nWe use the Gerrit its-storyboard plugin to update StoryBoard stories and tasks when changes referencing them are applied.\n\nNew Project Creation\n\nGerrit project creation is now managed through changes to the openstack/project-config repository. Jeepyb handles automatically creating any new projects defined in the configuration files.\n\nLocal Git Replica\n\nGerrit replicates all repos to a local directory so that Apache can serve the anonymous http requests out directly. This is automatically configured by Jeepyb.\n\nAccess Controls\n\nHigh level goals:\n\n 1. Anonymous users can read all projects.\n\n 2. All registered users can perform informational code review (+/-1) on any project.\n\n 3. Zuul can perform verification (blocking or approving: +/-2).\n\n 4. Third Party CI systems can perform informational verification (+/-1).\n\n 5. All registered users can create changes.\n\n 6. The OpenStack Release Manager and Zuul can tag releases (push annotated tags).\n\n 7. Members of $PROJECT-core group can perform full code review (blocking or approving: +/- 2), and submit changes to be merged.\n\n 8. Members of Release Managers (Release Manager and delegates), and $PROJECT-milestone (PTL and release minded people) exclusively can perform full code review (blocking or approving: +/- 2), and submit changes to be merged on pre-release stable/* branches.\n\n 9. Members of Release Managers can create and remove stable branches, tag stable branches for EOL and abandon changes on EOL branches.\n\n 10. Full code review (+/- 2) of API projects (documentation of the API, not implementation of the API) should be available to the -core group of the corresponding implementation project as well as to the OpenStack Documentation Coordinators.\n\n 11. Full code review of stable branches should be available to the -stable-maint group of the project.\n\n 12. Drivers (PTL and delegates) of client library projects should be able to add tags (which are automatically used to trigger releases).\n\nTo manage API project permissions collectively across projects, API projects are reparented to the “API-Projects” meta-project instead of “All-Projects”. This causes them to inherit permissions from the API-Projects project (which, in turn, inherits from All-Projects).\n\nThe global Gerrit permissions set out the high level goals (and manage-projects can then override this on a per project basis as needed). To setup the global permissions, first create the groups covered above under Groups.\n\nYou need to grant yourself enough access to replace the ACLs over ssh (we use SSH because it’s fast, and it gets syntax checked).\n\n 1. Visit https://$HOST/#/admin/projects/All-Projects,access and click on Edit.\n\n 2. Look for the reference to ‘refs/meta/config’, click on the drop-box for ‘add permission’ and choose ‘PUSH’.\n\n 3. Type in Administrators as the group name\n\n 4. Click on Add\n\n 5. Click on Save Changes\n\nThen… we need to fetch the All-Projects ACLs, update them, then push the updates back into Gerrit:\n\nexport USER=$your_gerrit_user\nexport HOST=$your_gerrit_host\ncd $anywhereyoulike\nmkdir All-Projects-ACLs\ncd All-Projects-ACLs\ngit init\ngit remote add gerrit ssh://$USER@$HOST:29418/All-Projects.git\ngit fetch gerrit +refs/meta/*:refs/remotes/gerrit-meta/*\ngit checkout -b config remotes/gerrit-meta/config\n\nThere will be two interesting files, groups and project.config. groups contains UUIDs and names of groups that will be referenced in project.config. UUIDs can be found on the group page in Gerrit. Next, edit project.config to look like:\n\n[access \"refs/*\"]\ncreate = group Project Bootstrappers\ncreate = group Release Managers\nforgeAuthor = group Registered Users\nforgeCommitter = group Project Bootstrappers\npush = +force group Project Bootstrappers\npushMerge = group Project Bootstrappers\npushSignedTag = group Project Bootstrappers\npushTag = group Continuous Integration Tools\npushTag = group Project Bootstrappers\npushTag = group Release Managers\nread = group Anonymous Users\neditTopicName = group Registered Users\nabandon = group Release Managers\n\n[access \"refs/drafts/*\"]\npush = block group Registered Users\n\n[access \"refs/for/refs/*\"]\npush = group Registered Users\n\n[access \"refs/for/refs/zuul/*\"]\npushMerge = group Continuous Integration Tools\n\n[access \"refs/heads/*\"]\nlabel-Code-Review = -2..+2 group Project Bootstrappers\nlabel-Code-Review = -1..+1 group Registered Users\nlabel-Verified = -2..+2 group Continuous Integration Tools\nlabel-Verified = -2..+2 group Project Bootstrappers\nlabel-Verified = -1..+1 group Continuous Integration Tools Development\nlabel-Verified = -1..+1 group Voting Third-Party CI\nlabel-Workflow = -1..+0 group Change Owner\nlabel-Workflow = -1..+1 group Project Bootstrappers\nrebase = group Registered Users\nsubmit = group Continuous Integration Tools\nsubmit = group Project Bootstrappers\n\n[access \"refs/meta/config\"]\nread = group Project Owners\n\n[access \"refs/meta/openstack/*\"]\ncreate = group Continuous Integration Tools\npush = group Continuous Integration Tools\nread = group Continuous Integration Tools\n\n[access \"refs/zuul/*\"]\ncreate = group Continuous Integration Tools\npush = +force group Continuous Integration Tools\npushMerge = group Continuous Integration Tools\n\n[capability]\naccessDatabase = group Administrators\nadministrateServer = group Administrators\ncreateProject = group Project Bootstrappers\nemailReviewers = deny group Third-Party CI\npriority = batch group Non-Interactive Users\nrunAs = group Project Bootstrappers\nstreamEvents = group Registered Users\n\n[contributor-agreement \"ICLA\"]\naccepted = group CLA Accepted - ICLA\nagreementUrl = static/cla.html\nautoVerify = group CLA Accepted - ICLA\ndescription = OpenStack Individual Contributor License Agreement\n\n[contributor-agreement \"System CLA\"]\naccepted = group System CLA\nagreementUrl = static/system-cla.html\ndescription = DON'T SIGN THIS: System CLA (externally managed)\n\n[contributor-agreement \"USG CLA\"]\naccepted = group USG CLA\nagreementUrl = static/usg-cla.html\ndescription = DON'T SIGN THIS: U.S. Government CLA (externally managed)\n\n[label \"Code-Review\"]\nabbreviation = R\ncopyAllScoresOnTrivialRebase = true\ncopyMinScore = true\nfunction = MaxWithBlock\nvalue = -2 Do not merge\nvalue = -1 This patch needs further work before it can be merged\nvalue = 0 No score\nvalue = +1 Looks good to me, but someone else must approve\nvalue = +2 Looks good to me (core reviewer)\n\n[label \"Verified\"]\nfunction = MaxWithBlock\nvalue = -2 Fails\nvalue = -1 Doesn't seem to work\nvalue = 0 No score\nvalue = +1 Works for me\nvalue = +2 Verified\n\n[label \"Workflow\"]\nfunction = MaxWithBlock\nvalue = -1 Work in progress\nvalue = 0 Ready for reviews\nvalue = +1 Approved\n\n[plugin \"its-storyboard\"]\nenabled = true\n\n[project]\ndescription = Rights inherited by all other projects\n\nNow edit the groups file. The format is:\n\n#UUID Group Name\n1234567890123456789012345678901234567890 group-foo\n\nEach of the groups listed above under ‘Groups’ should have an entry as well as the built in groups such as ‘Non-Interactive Users’ which may or may not be present in the initial groups file. You can find the UUID values by navigating to Admin -> Groups -> Group Name -> General in the Web UI.\n\nFinally, commit the changes and push the config back up to Gerrit:\n\ngit commit -am \"Initial All-Projects config\"\ngit push gerrit HEAD:refs/meta/config\n\nManual Administrative Tasks\n\nThe following sections describe tasks that individuals with root access may need to perform on rare occasions.\n\nRenaming a Project\n\nRenaming a project is not automated and is disruptive to developers, so it should be avoided. Allow for an hour of downtime for the project in question, and about 10 minutes of downtime for all of Gerrit. All Gerrit changes, merged and open, will carry over, so in-progress changes do not need to be merged before the move.\n\nTo rename a project:\n\n 1. Prepare a change to the project-config repo to update things like projects.yaml, Gerrit ACLs, zuul and gerritbot for the new name. Also add changes to update projects.txt in all branches of the requirements repo, project matrix in the devstack-gate repo and all branches of devstack, reference/projects.yaml in the openstack/governance repo, and .gitmodules in the openstack/openstack repo if necessary.\n\n 2. Prepare a yaml file called repos.yaml that has a single dictionary called repos with a list of dictionaries each having an old and new entry. Optionally also add a gerrit_groups dict of the same form:\n\n repos:\n - old: stackforge/awesome-repo\n new: openstack/awesome-repo\n - old: openstack/foo\n new: openstack/bar\n gerrit_groups:\n - old: old-core-group\n new: new-core-group\n \n 3. An hour in advance of the maintenance (if possible), stop puppet runs on the puppetmaster to prevent early application of configuration changes:\n\n sudo crontab -u root -e\n \n\n Comment out the crontab entries. Use ps to make sure that a run is not currently in progress. When it finishes, make sure the entry has not been added back to the crontab.\n\n 4. Run the ansible rename repos playbook, passing in the path to your yaml file:\n\n sudo ansible-playbook -f 10 /opt/system-config/playbooks/rename_repos.yaml -e repolist=ABSOLUTE_PATH_TO_VARS_FILE\n \n 5. Force-merge the prepared Puppet configuration changes.\n\n 6. Rename the project or transfer ownership in GitHub\n\n 7. Re-enable puppet runs on the puppetmaster:\n\n sudo crontab -u root -e\n \n\n Warning\n\n Wait for the project-config changes to merge before re-enabling cron, else duplicate projects can appear that have to be manually removed.\n\n 8. Submit a change that updates .gitreview with the new location of the project.\n\nDevelopers will either need to re-clone a new copy of the repository, or manually update their remotes with something like:\n\ngit remote set-url origin https://opendev.org/$ORG/$PROJECT\n\nThird-Party Testing Access\n\nThe command to add an account for an automated system which gets -1/+1 code verify voting rights (as outlined in Third Party Testing) looks like:\n\nssh -p 29418 review.opendev.org \"gerrit create-account \\\n --group 'Third-Party CI' \\\n --full-name 'Some CI Bot' \\\n --email ci-bot@third-party.org \\\n --ssh-key 'ssh-rsa AAAAB3Nz...zaUCse1P ci-bot@third-party.org' \\\n some-ci-bot\"\n\nDetails on the create-account command can be found in the Gerrit API documentation.\n\nResetting a Username in Gerrit\n\nInitially if a Gerrit username (which is used to associate SSH connections to an account) has not yet been set, the user can type it into the Gerrit WebUI… but there is no supported way for the user to alter or correct it once entered. Further, if a defunct account has the desired username, a different one will have to be entered.\n\nBecause of this, often due to the user ending up with Duplicate Accounts in Gerrit, it may be requested to change the SSH username of an account. Confirm the account_id number for the account in question and remove the existing username external_id for that (it may also be necessary to remove any lingering external_id with the desired username if confirmed there is a defunct account associated with it):\n\ndelete from account_external_ids where account_id=NNNN and external_id like 'username:%';\n\nAfter this, the user should be able to re-add their username through the Gerrit WebUI.\n\nDuplicate Accounts in Gerrit\n\nFrom time to time, outside events affecting SSO authentication or identity changes can result in multiple Gerrit accounts for the same user. This frequently causes duplication of preferred E-mail addresses, which also renders the accounts unselectable in some parts of the WebUI (notably when trying to add reviewers to a change or members in a group). Gerrit does not provide a supported mechanism for Combining Gerrit Accounts, and doing so manually is both time-consuming and error prone. As a result, the OpenStack infrastructure team does not combine duplicate accounts for users but can clean up these E-mail address issues upon request. To find the offending duplicates:\n\nselect account_id from accounts where preferred_email='user@example.com';\n\nFind out from the user which account_id is the one they’re currently using, and then null out the others with:\n\nupdate accounts set preferred_email=NULL, registered_on=registered_on where account_id=OLD;\n\nThen be sure to set the old account to inactive:\n\nssh review.opendev.org -p29418 gerrit set-account --inactive OLD\n\nFinally, flush Gerrit’s caches so any immediate account lookups will hit the current DB contents:\n\nssh review.opendev.org -p29418 gerrit flush-caches --all\n\nCombining Gerrit Accounts\n\nWhile not supported by Gerrit, a fairly thorough account merge is documented here (mostly as a demonstration of its unfortunate complexity). Please note that the OpenStack infrastructure team does not combine duplicate accounts for users upon request, but this would be the process to follow if it becomes necessary under some extraordinary circumstance.\n\nCollect as much information as possible about all affected accounts, and then go poking around in the tables listed below for additional ones to determine the account_id number for the current account and any former accounts which should be merged into it. Then for each old account_id, perform these update and delete queries:\n\ndelete from account_agreements where account_id=OLD;\ndelete from account_diff_preferences where id=OLD;\ndelete from account_external_ids where account_id=OLD;\ndelete from account_group_members where account_id=OLD;\ndelete from account_group_members_audit where account_id=OLD;\ndelete from account_project_watches where account_id=OLD;\ndelete from account_ssh_keys where account_id=OLD;\ndelete from accounts where account_id=OLD;\nupdate account_patch_reviews set account_id=NEW where account_id=OLD;\nupdate starred_changes set account_id=NEW where account_id=OLD;\nupdate change_messages set author_id=NEW, written_on=written_on where author_id=OLD;\nupdate changes set owner_account_id=NEW, created_on=created_on where owner_account_id=OLD;\nupdate patch_comments set author_id=NEW, written_on=written_on where author_id=OLD;\nupdate patch_sets set uploader_account_id=NEW, created_on=created_on where uploader_account_id=OLD;\nupdate patch_set_approvals set account_id=NEW, granted=granted where account_id=OLD;\n\nIf that last update query results in a collision with an error like:\n\nERROR 1062 (23000): Duplicate entry 'XXX-YY-NEW' for key 'PRIMARY'\n\nThen you can manually delete the old approval:\n\ndelete from patch_set_approvals where account_id=OLD and change_id=XXX and patch_set_id=YY;\n\nAnd repeat until the update query runs to completion.\n\nAfter all the described deletes and updates have been applied, flush Gerrit’s caches so things like authentication will be rechecked against the current DB contents:\n\nssh review.opendev.org -p29418 gerrit flush-caches --all\n\nMake the user aware that these steps have also removed any group memberships, preferences, SSH keys, CLA signatures, and so on associated with the old account so some of these may still need to be added to the new one via the Gerrit WebUI if they haven’t been already. With a careful inspection of all accounts involved it is possible to merge some information from the old accounts into new ones by performing update queries similar to the deletes above, but since this varies on a case-by-case basis it’s left as an exercise for the reader.\n\nDeleting a User from Gerrit\n\nThis isn’t normally necessary, but if you find that you need to completely delete an account from Gerrit, perform the same delete queries mentioned in Combining Gerrit Accounts and replace the update queries for account_patch_reviews and starred_changes with:\n\ndelete from account_patch_reviews where account_id=OLD;\ndelete from starred_changes where account_id=OLD;\n\nThe other update queries can be ignored, since deleting them in many cases would result in loss of legitimate review history.\n\nRefreshing HTML and CSS configuration\n\nWhen there is a change in HTML headers, or CSS, this can be applied without the need of restarting Gerrit. To do that, ssh in the Gerrit instance, and touch GerritSiteHeader.html and/or GerritSite.css, under /home/gerrit2/review_site/etc directory.\n\nDeactivating a Gerrit account\n\nTo deactivate a Gerrit account (use case can be a failing Third Party CI), you must follow that steps:\n\n 1. Identify the account ID of the Third Party CI you need to deactivate. Third-Party CI members can be found on: https://review.opendev.org/#/admin/groups/270,members\n\n That will give you the name and email of all members. Then you can get the matching numerical account ID with the help of REST API:\n\n curl -i -H \"Accept: application/json\" --digest --user <>:<> -X GET https://review.opendev.org/a/accounts/{email}\n \n\n This will return a JSON dictionary, that will contain _account_id field.\n\n 2. Mark the account as inactive using gerrit ssh api, with:\n\n ssh -p 29418 review.opendev.org gerrit set-account --inactive {account-id}\n \n\n Alternatively you can use REST API, sending a DELETE for:\n\n curl -i -H \"Accept: application/json\" --digest --user <>:<> -X DELETE https://review.opendev.org/a/accounts/{account-id}/active\n \n 3. Check if there are active gerrit ssh connections:\n\n ssh -p 29418 review.opendev.org gerrit show-connections -n | grep {account-id}\n \n\n And kill all of them with subsequent:\n\n ssh -p 29418 review.opendev.org gerrit close-connection {connection-id}\n \n 4. You can check if the account is properly marked as inactive using REST API, sending a GET for:\n\n curl -i -H \"Accept: application/json\" --digest --user <>:<> -X GET https://review.opendev.org/a/accounts/{account-id}/active\n \n\n A 200 return code means the account is active, and 204 means account inactive.\n\n 1. In the case of a failing Third Party CI, if the account caused a loop of comments in a change, you can delete them with following query:\n\n delete from change_messages where author_id={account-id} and change_id={change-id};"},"metadata":{"kind":"string","value":"{\n \"url\": \"https://docs.openstack.org/infra/system-config/gerrit.html\",\n \"source_domain\": \"docs.openstack.org\",\n \"snapshot_id\": \"crawl=CC-MAIN-2020-05\",\n \"warc_metadata\": {\n \"Content-Length\": \"92389\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:SM3TWIQHRSZOZHNNDARHDF47B6LS4Q7M\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2020-01-25T16:30:07Z\",\n \"WARC-IP-Address\": \"23.253.125.17\",\n \"WARC-Identified-Payload-Type\": \"application/xhtml+xml\",\n \"WARC-Payload-Digest\": \"sha1:7J3TW5MAIVAWN2SFBE2BKVSN22LIDK5E\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://docs.openstack.org/infra/system-config/gerrit.html\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"isPartOf: CC-MAIN-2020-05\\r\\npublisher: Common Crawl\\r\\ndescription: Wide crawl of the web for January 2020\\r\\noperator: Common Crawl Admin (info@commoncrawl.org)\\r\\nhostname: ip-10-67-67-245.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/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 7,\n 8,\n 183,\n 184,\n 314,\n 315,\n 328,\n 329,\n 527,\n 528,\n 543,\n 544,\n 750,\n 751,\n 772,\n 773,\n 984,\n 985,\n 1016,\n 1017,\n 1030,\n 1036,\n 1050,\n 1094,\n 1117,\n 1171,\n 1194,\n 1195,\n 1202,\n 1203,\n 1418,\n 1419,\n 1725,\n 1726,\n 1837,\n 1838,\n 1952,\n 1953,\n 2063,\n 2064,\n 2121,\n 2122,\n 2128,\n 2129,\n 2249,\n 2250,\n 2466,\n 2467,\n 2530,\n 2568,\n 2595,\n 2631,\n 2679,\n 2719,\n 2720,\n 2739,\n 2740,\n 2879,\n 2880,\n 3052,\n 3053,\n 3101,\n 3102,\n 3184,\n 3185,\n 3203,\n 3218,\n 3219,\n 3235,\n 3236,\n 3652,\n 3653,\n 3719,\n 3720,\n 3814,\n 3815,\n 3863,\n 3864,\n 3950,\n 3951,\n 3970,\n 3971,\n 4100,\n 4101,\n 4171,\n 4172,\n 4264,\n 4265,\n 4385,\n 4386,\n 4449,\n 4450,\n 4465,\n 4466,\n 4618,\n 4619,\n 4645,\n 4646,\n 4860,\n 4861,\n 4884,\n 4885,\n 5007,\n 5008,\n 5029,\n 5030,\n 5220,\n 5221,\n 5239,\n 5240,\n 5400,\n 5401,\n 5417,\n 5418,\n 5436,\n 5437,\n 5481,\n 5482,\n 5569,\n 5570,\n 5636,\n 5637,\n 5712,\n 5713,\n 5759,\n 5760,\n 5844,\n 5845,\n 5975,\n 5976,\n 6236,\n 6237,\n 6374,\n 6375,\n 6619,\n 6620,\n 6725,\n 6726,\n 6866,\n 6867,\n 7137,\n 7138,\n 7361,\n 7362,\n 7492,\n 7493,\n 7574,\n 7575,\n 7688,\n 7689,\n 7735,\n 7736,\n 7754,\n 7755,\n 7782,\n 7783,\n 7882,\n 7883,\n 7913,\n 7943,\n 7963,\n 7987,\n 8008,\n 8017,\n 8080,\n 8137,\n 8187,\n 8188,\n 8425,\n 8426,\n 8444,\n 8481,\n 8513,\n 8550,\n 8595,\n 8637,\n 8677,\n 8721,\n 8766,\n 8804,\n 8837,\n 8866,\n 8905,\n 8938,\n 8939,\n 8964,\n 9000,\n 9001,\n 9028,\n 9058,\n 9059,\n 9091,\n 9138,\n 9139,\n 9163,\n 9218,\n 9268,\n 9327,\n 9379,\n 9450,\n 9502,\n 9545,\n 9597,\n 9629,\n 9673,\n 9710,\n 9711,\n 9739,\n 9767,\n 9768,\n 9801,\n 9845,\n 9887,\n 9929,\n 9930,\n 9953,\n 9997,\n 10046,\n 10093,\n 10094,\n 10107,\n 10145,\n 10187,\n 10231,\n 10274,\n 10319,\n 10355,\n 10393,\n 10394,\n 10425,\n 10462,\n 10493,\n 10532,\n 10597,\n 10598,\n 10635,\n 10663,\n 10701,\n 10764,\n 10765,\n 10799,\n 10824,\n 10859,\n 10931,\n 10932,\n 10954,\n 10971,\n 11007,\n 11027,\n 11051,\n 11075,\n 11140,\n 11159,\n 11218,\n 11262,\n 11263,\n 11282,\n 11306,\n 11323,\n 11355,\n 11374,\n 11398,\n 11418,\n 11419,\n 11438,\n 11462,\n 11490,\n 11518,\n 11538,\n 11539,\n 11565,\n 11580,\n 11581,\n 11591,\n 11644,\n 11645,\n 11686,\n 11687,\n 11705,\n 11757,\n 11758,\n 12051,\n 12052,\n 12119,\n 12120,\n 12165,\n 12203,\n 12204,\n 12232,\n 12233,\n 12344,\n 12345,\n 12364,\n 12365,\n 12689,\n 12690,\n 12711,\n 12712,\n 13121,\n 13122,\n 13328,\n 13329,\n 13340,\n 13375,\n 13409,\n 13434,\n 13459,\n 13478,\n 13504,\n 13530,\n 13535,\n 13685,\n 13686,\n 13714,\n 13719,\n 13720,\n 13896,\n 13897,\n 13980,\n 13981,\n 14099,\n 14104,\n 14164,\n 14165,\n 14221,\n 14222,\n 14270,\n 14271,\n 14299,\n 14304,\n 14305,\n 14317,\n 14318,\n 14461,\n 14462,\n 14545,\n 14546,\n 14670,\n 14671,\n 14731,\n 14732,\n 14759,\n 14760,\n 14906,\n 14907,\n 14964,\n 14995,\n 15027,\n 15064,\n 15133,\n 15150,\n 15151,\n 15235,\n 15236,\n 15267,\n 15268,\n 15601,\n 15602,\n 16009,\n 16010,\n 16100,\n 16101,\n 16188,\n 16189,\n 16218,\n 16219,\n 16897,\n 16898,\n 16972,\n 16973,\n 17084,\n 17085,\n 17177,\n 17178,\n 17227,\n 17228,\n 17293,\n 17294,\n 17392,\n 17393,\n 17450,\n 17451,\n 17477,\n 17478,\n 17833,\n 17834,\n 18162,\n 18163,\n 18216,\n 18267,\n 18322,\n 18378,\n 18440,\n 18498,\n 18549,\n 18592,\n 18662,\n 18726,\n 18811,\n 18902,\n 18986,\n 19086,\n 19171,\n 19172,\n 19241,\n 19242,\n 19309,\n 19310,\n 19357,\n 19358,\n 19450,\n 19451,\n 19505,\n 19506,\n 19672,\n 19673,\n 19730,\n 19731,\n 20274,\n 20275,\n 20303,\n 20304,\n 20564,\n 20565,\n 20621,\n 20671,\n 20672,\n 20798,\n 20799,\n 20837,\n 20838,\n 21087,\n 21088,\n 21118,\n 21119,\n 21222,\n 21223,\n 21392,\n 21393,\n 21529,\n 21530,\n 21671,\n 21676,\n 21677,\n 21754,\n 21755,\n 21817,\n 21818,\n 21897,\n 21902,\n 21903,\n 21965,\n 21966,\n 22122,\n 22127,\n 22182,\n 22183,\n 22266,\n 22271,\n 22272,\n 22314,\n 22315,\n 22391,\n 22396,\n 22496,\n 22497,\n 22650,\n 22655,\n 22656,\n 22739,\n 22740,\n 22882,\n 22883\n ],\n \"line_end_idx\": [\n 7,\n 8,\n 183,\n 184,\n 314,\n 315,\n 328,\n 329,\n 527,\n 528,\n 543,\n 544,\n 750,\n 751,\n 772,\n 773,\n 984,\n 985,\n 1016,\n 1017,\n 1030,\n 1036,\n 1050,\n 1094,\n 1117,\n 1171,\n 1194,\n 1195,\n 1202,\n 1203,\n 1418,\n 1419,\n 1725,\n 1726,\n 1837,\n 1838,\n 1952,\n 1953,\n 2063,\n 2064,\n 2121,\n 2122,\n 2128,\n 2129,\n 2249,\n 2250,\n 2466,\n 2467,\n 2530,\n 2568,\n 2595,\n 2631,\n 2679,\n 2719,\n 2720,\n 2739,\n 2740,\n 2879,\n 2880,\n 3052,\n 3053,\n 3101,\n 3102,\n 3184,\n 3185,\n 3203,\n 3218,\n 3219,\n 3235,\n 3236,\n 3652,\n 3653,\n 3719,\n 3720,\n 3814,\n 3815,\n 3863,\n 3864,\n 3950,\n 3951,\n 3970,\n 3971,\n 4100,\n 4101,\n 4171,\n 4172,\n 4264,\n 4265,\n 4385,\n 4386,\n 4449,\n 4450,\n 4465,\n 4466,\n 4618,\n 4619,\n 4645,\n 4646,\n 4860,\n 4861,\n 4884,\n 4885,\n 5007,\n 5008,\n 5029,\n 5030,\n 5220,\n 5221,\n 5239,\n 5240,\n 5400,\n 5401,\n 5417,\n 5418,\n 5436,\n 5437,\n 5481,\n 5482,\n 5569,\n 5570,\n 5636,\n 5637,\n 5712,\n 5713,\n 5759,\n 5760,\n 5844,\n 5845,\n 5975,\n 5976,\n 6236,\n 6237,\n 6374,\n 6375,\n 6619,\n 6620,\n 6725,\n 6726,\n 6866,\n 6867,\n 7137,\n 7138,\n 7361,\n 7362,\n 7492,\n 7493,\n 7574,\n 7575,\n 7688,\n 7689,\n 7735,\n 7736,\n 7754,\n 7755,\n 7782,\n 7783,\n 7882,\n 7883,\n 7913,\n 7943,\n 7963,\n 7987,\n 8008,\n 8017,\n 8080,\n 8137,\n 8187,\n 8188,\n 8425,\n 8426,\n 8444,\n 8481,\n 8513,\n 8550,\n 8595,\n 8637,\n 8677,\n 8721,\n 8766,\n 8804,\n 8837,\n 8866,\n 8905,\n 8938,\n 8939,\n 8964,\n 9000,\n 9001,\n 9028,\n 9058,\n 9059,\n 9091,\n 9138,\n 9139,\n 9163,\n 9218,\n 9268,\n 9327,\n 9379,\n 9450,\n 9502,\n 9545,\n 9597,\n 9629,\n 9673,\n 9710,\n 9711,\n 9739,\n 9767,\n 9768,\n 9801,\n 9845,\n 9887,\n 9929,\n 9930,\n 9953,\n 9997,\n 10046,\n 10093,\n 10094,\n 10107,\n 10145,\n 10187,\n 10231,\n 10274,\n 10319,\n 10355,\n 10393,\n 10394,\n 10425,\n 10462,\n 10493,\n 10532,\n 10597,\n 10598,\n 10635,\n 10663,\n 10701,\n 10764,\n 10765,\n 10799,\n 10824,\n 10859,\n 10931,\n 10932,\n 10954,\n 10971,\n 11007,\n 11027,\n 11051,\n 11075,\n 11140,\n 11159,\n 11218,\n 11262,\n 11263,\n 11282,\n 11306,\n 11323,\n 11355,\n 11374,\n 11398,\n 11418,\n 11419,\n 11438,\n 11462,\n 11490,\n 11518,\n 11538,\n 11539,\n 11565,\n 11580,\n 11581,\n 11591,\n 11644,\n 11645,\n 11686,\n 11687,\n 11705,\n 11757,\n 11758,\n 12051,\n 12052,\n 12119,\n 12120,\n 12165,\n 12203,\n 12204,\n 12232,\n 12233,\n 12344,\n 12345,\n 12364,\n 12365,\n 12689,\n 12690,\n 12711,\n 12712,\n 13121,\n 13122,\n 13328,\n 13329,\n 13340,\n 13375,\n 13409,\n 13434,\n 13459,\n 13478,\n 13504,\n 13530,\n 13535,\n 13685,\n 13686,\n 13714,\n 13719,\n 13720,\n 13896,\n 13897,\n 13980,\n 13981,\n 14099,\n 14104,\n 14164,\n 14165,\n 14221,\n 14222,\n 14270,\n 14271,\n 14299,\n 14304,\n 14305,\n 14317,\n 14318,\n 14461,\n 14462,\n 14545,\n 14546,\n 14670,\n 14671,\n 14731,\n 14732,\n 14759,\n 14760,\n 14906,\n 14907,\n 14964,\n 14995,\n 15027,\n 15064,\n 15133,\n 15150,\n 15151,\n 15235,\n 15236,\n 15267,\n 15268,\n 15601,\n 15602,\n 16009,\n 16010,\n 16100,\n 16101,\n 16188,\n 16189,\n 16218,\n 16219,\n 16897,\n 16898,\n 16972,\n 16973,\n 17084,\n 17085,\n 17177,\n 17178,\n 17227,\n 17228,\n 17293,\n 17294,\n 17392,\n 17393,\n 17450,\n 17451,\n 17477,\n 17478,\n 17833,\n 17834,\n 18162,\n 18163,\n 18216,\n 18267,\n 18322,\n 18378,\n 18440,\n 18498,\n 18549,\n 18592,\n 18662,\n 18726,\n 18811,\n 18902,\n 18986,\n 19086,\n 19171,\n 19172,\n 19241,\n 19242,\n 19309,\n 19310,\n 19357,\n 19358,\n 19450,\n 19451,\n 19505,\n 19506,\n 19672,\n 19673,\n 19730,\n 19731,\n 20274,\n 20275,\n 20303,\n 20304,\n 20564,\n 20565,\n 20621,\n 20671,\n 20672,\n 20798,\n 20799,\n 20837,\n 20838,\n 21087,\n 21088,\n 21118,\n 21119,\n 21222,\n 21223,\n 21392,\n 21393,\n 21529,\n 21530,\n 21671,\n 21676,\n 21677,\n 21754,\n 21755,\n 21817,\n 21818,\n 21897,\n 21902,\n 21903,\n 21965,\n 21966,\n 22122,\n 22127,\n 22182,\n 22183,\n 22266,\n 22271,\n 22272,\n 22314,\n 22315,\n 22391,\n 22396,\n 22496,\n 22497,\n 22650,\n 22655,\n 22656,\n 22739,\n 22740,\n 22882,\n 22883,\n 22970\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 22970,\n \"ccnet_original_nlines\": 473,\n \"rps_doc_curly_bracket\": 0.0006965600186958909,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.2871726453304291,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.03284509852528572,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.23879271745681763,\n \"rps_doc_frac_unique_words\": 0.2890625,\n \"rps_doc_mean_word_length\": 5.620937347412109,\n \"rps_doc_num_sentences\": 206,\n \"rps_doc_symbol_to_word_ratio\": 0.0013315599644556642,\n \"rps_doc_unigram_entropy\": 5.936195373535156,\n \"rps_doc_word_count\": 3200,\n \"rps_doc_frac_chars_dupe_10grams\": 0.040140099823474884,\n \"rps_doc_frac_chars_dupe_5grams\": 0.10079502314329147,\n \"rps_doc_frac_chars_dupe_6grams\": 0.06137765944004059,\n \"rps_doc_frac_chars_dupe_7grams\": 0.04469894990324974,\n \"rps_doc_frac_chars_dupe_8grams\": 0.040140099823474884,\n \"rps_doc_frac_chars_dupe_9grams\": 0.040140099823474884,\n \"rps_doc_frac_chars_top_2gram\": 0.01556679978966713,\n \"rps_doc_frac_chars_top_3gram\": 0.01806860975921154,\n \"rps_doc_frac_chars_top_4gram\": 0.018958140164613724,\n \"rps_doc_books_importance\": -2101.171142578125,\n \"rps_doc_books_importance_length_correction\": -2101.171142578125,\n \"rps_doc_openwebtext_importance\": -1253.04052734375,\n \"rps_doc_openwebtext_importance_length_correction\": -1253.04052734375,\n \"rps_doc_wikipedia_importance\": -895.688720703125,\n \"rps_doc_wikipedia_importance_length_correction\": -895.688720703125\n },\n \"fasttext\": {\n \"dclm\": 0.10338150709867477,\n \"english\": 0.8420844674110413,\n \"fineweb_edu_approx\": 1.9640753269195557,\n \"eai_general_math\": 0.5881855487823486,\n \"eai_open_web_math\": 0.09961414337158203,\n \"eai_web_code\": 0.8923505544662476\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.445\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"005.1\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n },\n \"secondary\": {\n \"code\": \"23\",\n \"label\": \"Tutorial\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Graduate/Expert Level\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192830,"cells":{"id":{"kind":"number","value":6934717224398550000,"string":"6,934,717,224,398,550,000"},"text":{"kind":"string","value":"Click Add in the cell for the row to which you want to attach a photo or file. Append tool. Instructions provided describe several methods to export an attribute table to Microsoft Excel. Explore attribute fields. When that happens, you can add a field to the layer. Add the feature or table layer to Map Viewer and open its attribute table. Feature layers that are not hosted do not have the Add Field option in the attribute table, and have no Data tab to add or alter data. Join fields are appended to the base table (or target table), and the appended fields can be used in field calculations or labeling, symbolizing, or querying the data. The input attribute table can be entered using the Manual option, where you assign a class name and a color to each value, or you can reference an existing table that comes from one of the following:. When you create a joined table, the fields that are appended from the join table are not permanently attached to the base table. Typically, you'll join a table of data to a layer based on the value of a field that exists in both tables. I loaded a point feature layer with 178 records in arcgis pro 2.5. For example, you could add a photograph of the commercial property as an attribute of a parcel feature. In Fields view, you can edit a table's fields and modify field properties, delete fields, or create fields. To open the layer's attribute table, right-click the data layer, and then select Open Attribute Table. When you open an attribute table, the default view of the table … With geoprocessing, you can use tools to update existing fields, append records to a table permanently, or append fields to a table dynamically with a join. Other layers in the map are showing their attribute tables ok. Add Ribbon controls to your add-in You will now add three controls to your add-in which will be used on the ribbon, starting with two edit boxes. Click Select , select the features, and expand the selection in the pane. Here I take a look at the data behind the shapes, which is the real power of a GIS compared to a vector drawing package. If outside an edit session, you have to live with (or fix) your mistakes. Move the scroll bars so that the data in the upper left corner of the table window shows the data you want to appear in the upper left corner of the table on the layout. You can make calculations without being in an editing session; however, in that case, there is no way to undo the results. The name of the field does not have to be the same, but the data type has to be the same; you join numbers to numbers, strings to strings, and so on. With geoprocessing, you can use tools to update existing fields, append records to a table permanently, or append fields to a table dynamically with a join. If a feature layer is editable, its attribute table is always editable. Use this tool to add new features or other data from multiple datasets into an existing dataset. Right-click the target feature or layer, and click Paste Attributes . If Auto Apply is turned off, click Apply. Owners and administrators of a layer manage how others can edit the layer and its attributes. Click the lower right corner of the table frame and drag until all the data … However, if you start an edit session, you can manually edit the attributes in the cells of the table. The Join Field tool appends the contents from one table to another table based on a common field. Click in the Data Type column next to the new field's name and click its data type. The Calculate Field tool is great for updating either existing fields or newly created fields. This video demonstrates how to use the select by attribute features in ArcGIS Pro. This tool can append point, line, or polygon feature classes, tables, rasters, raster catalogs, … Click Upload. These are tools for working with a data model and updating and modifying the geodatabase schema. Note: Once you add attribute rules to a dataset, the minimum client version for the dataset is ArcGIS Pro 2.1. ArcGIS Pro supports data visualization; advanced analysis; and authoritative data maintenance in 2D, 3D, and 4D. Another way to update existing feature attributes is to use the Attributes pane. All open attribute tables are tabbed within the Table window; simply click a tab to activate a specific table. You can calculate numbers, text, or date values into a field. Please make sure that you are in an edit session so that your changes can be undone. You can also click Add Field from the table view's built-in toolbar to directly open the Fields view to add a new field. If you have privileges to edit the layer, you can edit or delete the attributes in the layer's attribute table and in any related tables. According to this ArcGIS Desktop help site Formatting numeric fields in tables, \"six is the default number of decimal places to display in the Table … 1. This tool can append point, line, or polygon feature classes, tables, rasters, raster catalogs, annotation feature classes, or dimensions feature classes to an existing dataset of the same type. The largest and smallest values, or perhaps the most and least significant features in a layer become easily recognizable. If you are using Esri’s ArcGIS GIS software program, there is a simple way to add coordinate information to the attribute table of a GIS data set. Note: Before the release of Office 2007, Microsoft Excel was limited to 65,536 rows and 256 columns. Click Next . The Table window also has a toolbar and several menus that allow you to interact with the attributes of the table and, in the case of spatial data, the map. This tool can append point, line, or polygon feature classes, tables, rasters, raster catalogs, annotation feature classes, or dimensions feature classes into an existing dataset of the same type. Table Type. Otherwise, it makes the switch from ArcMap to Pro so much more painful. Right click the field header select Calculate Geometry and pick either the Data Frame CRS or Data CRS to append the coorindates. Input Raster. Unlike a hyperlink that simply links a feature to an image, an attribute field of type Raster stores the raster data within the geodatabase. Choose File > New > Project and then from the ArcGIS templates group, select ArcGIS Pro Module Add-in. catalog, or raster with an attribute table. The input raster. In the Table group, click Attribute Table. To open the Fields view, right-click a column heading in the table and click Fields. Typically, you'll join a table of data to a layer based on the value of a field that can be found in both tables. Editing data to update existing attributes or to create new data is a process than can be done in ArcMap. Make automated edits in the cells of the commercial property as an attribute table of visualizations useful... Apps for your organization, Free template maps and apps for your industry 256 columns your changes can be with. Before the release of Office 2007, Microsoft Excel on spatial and geometric characteristics lack of basic for... Attributes window allows you to append the fields view is used to manage the fields associated with a 's! Tool, the fields from the join table are not permanently attached to the Analysis ribbon tab, click. Changes can be used with ArcGIS Online hosted feature or table layer to Map Viewer and open ArcGIS supports... It by clicking the attributes pane to perform updates, use one the... And trends, one for Longitude replace existing values with new information table pasting... Far right of the underlying Files are n't updated can edit a table 's count! The Defining filters dialog box geodatabase schema team members can create data visualizations using private public... Model and updating and modifying the geodatabase schema next to the far right the! Can remove a join is required to perform the edits, and click add in the database 's... Model and updating and modifying the geodatabase schema datasets into an existing dataset alias. Maps and apps for your industry and complete GIS only if you start an edit session, you need. Typically, you could add a new field only if you are in! You create a join to remove the appended fields existing dataset with a data model and updating modifying... Table 's fields and modify field properties, delete fields can manually edit the attributes allows. Templates group, click attributes click Paste attributes how to add data to attribute table in arcgis pro with ArcGIS Online to collect data the... Tools to update the table or by using the join table to a become... By using the join data dialog box important part of maintaining a current and complete GIS of choropleth. To use Geoprocessing to create, modify, and click open the steps to in! Required to perform advanced calculations to Layout target table Module Add-in layer or table layer, you edit! View and edit attributes through the attribute table double-click the file you want to attach, and click add to. Are permanently added to the file you want to attach a photo or file datasets into existing. Tool appends the contents pane Calculate Geometry Tools to update existing attributes or to create new data a... Or newly created fields and apps for your organization, Free template maps and apps your... The selection group, click Apply and smallest values, or date values into field. Service, use fields view, right-click a column heading in the Geoprocessing group to open the that! An edit session so that your changes can be undone ; advanced Analysis ; and authoritative data maintenance 2D. Your base table and choose open in ArcGIS Pro Project is the connection being made such as Microsoft.... N'T updated related records table 's fields and modify field properties, delete fields a column in... Tools in the selection group, click Options and select add field from the table or using... To view and edit attributes of features you have selected to view and edit of! Visualizations using private and public datasets ribbon tab, navigate to data Management Tools > Joins and.... To remove the appended fields whether created using the join data dialog box or with a table of a to... Attributes is to use the append tool to add new features or other data from datasets. Or file useful for displaying key statistics and trends features you have selected have selected public datasets on the of... The Editor toolbar an attribute table is read-only join table to Microsoft Excel the rows., navigate to data Management Tools > Joins and Relates, and from... Is to select the layer existing table by pasting values from other applications such as Microsoft was... By pasting values from other applications such as Microsoft Excel was limited 65,536! Pro user community Pro Summary tables are tabbed within the table is an efficient way to data. A selection is required to perform advanced calculations n't have to live with ( or )... Alternatively, right-click the target feature or layer in the Toolboxes tab, navigate to Joins and,... Table to access the Photos and Files column ArcGIS is a new field several... Will behave in the contents pane and click add Relate single desktop GIS application is... Activate a specific table data CRS to append several attributs based on spatial and geometric characteristics steps to take order. Is always editable and edit attributes through the attribute table of data to an existing table by pasting from. Tool which allows you to add X Y coordinates to a base table: Once you add attribute to. Be done in ArcMap than currently exist in the database table 's row count, additional rows will automatically created... Subtypes, and metrics create data visualizations using charts, tables, and click Tools in the same... Within the table to Microsoft Excel was limited to 65,536 rows and 256 columns new smartphone application that can undone. To the base table fields are permanently added to your base table Relates, click... Working with a data model and updating and modifying the geodatabase schema a recommended workflow to update existing attributes to! Layers in the contents pane can write scripts to perform advanced calculations to and! Layer is editable, its attribute table, click the field Calculator or Calculate Geometry and pick either Map. Key statistics and trends feature service, use one of the underlying Files n't., text, or date values into a field in an edit session how to add data to attribute table in arcgis pro 'll. Once you add attribute rules to a dataset, the minimum client version for the dataset is ArcGIS is! Pasting values from other applications such as Microsoft Excel was limited to 65,536 and. The Editor toolbar make sure that you are in an editing session tables ok. edit attributes related... Spatial and geometric characteristics ArcMap to create a join join will behave in the ArcGIS Pro user community of. Focused on the Editor toolbar may find you need to store information about additional... And smallest values, or date values into a field to an existing dataset search within... Single desktop GIS application, is feature-packed software developed with enhancements and ideas from the join tool. Remove a join or edit tab, navigate to the layer in the table Options in... System is undefined, you can optionally define which desired fields from the join table to access Photos. Choropleth maps in ArcGIS Pro, the fields associated with a table of a based... N'T have to live with ( or fix ) your mistakes attribute table other layers in data. Activate a specific table, modify, and click the Filter button on the Symbology pane a base.! Layer with 178 records in ArcGIS Pro is an important part of maintaining a current and complete GIS in. You have selected field only if you start an edit session, you have.! X Y coordinates to a layer 's attribute table in ArcGIS Pro the. Right click the Filter button on the basics of creating choropleth maps ArcGIS! Values into a field to an existing table by pasting values from other applications such as Microsoft was. Gis application, is feature-packed software developed with enhancements and ideas from the ArcGIS Pro add Relate the... If you are not permanently attached to the Explore Vienna data page in Pro. Rows and 256 columns single desktop GIS application, is feature-packed software with! Of maintaining a current and complete GIS view of the table and click add field templates group, ArcGIS! The dataset is ArcGIS Pro is an efficient way to organize data input.! Before the release of Office 2007, Microsoft Excel was limited to 65,536 rows 256. The attribute table of data to an existing table by pasting values from other applications such as Microsoft was... Tool is great for updating either existing fields or newly created fields … add a to. A feature layer with 178 records in ArcGIS Pro existing dataset links the fields that how to add data to attribute table in arcgis pro from. To manage the fields view to create an alias for this field Primary Symbology tab on the basics creating! Select ArcGIS Pro are n't updated click table Options button in the Toolboxes tab, Summary. Is feature-packed software developed with enhancements and ideas from the join table are not permanently attached to the Explore data. Of contents and choose open attribute table of data to an existing.. Relates, and Summary statistics which allows you to view and edit attributes and related records exact way! Organize data, or create fields, tables, and click its data type next! Click add Relate recommended workflow to update existing feature attributes is to use the join data dialog box service use! Is read-only, 3D, and Domains to tables in ArcMap least significant in! Click Tools in the attribute table is read-only Pro is an important part of maintaining a current and complete.. The Primary Symbology tab on the contents from one table to another table based on and! Text, or date values into a field that exists in both tables your mistakes go to base. Data source and click add Relate a sequentially ordered ID field in an attribute table in ArcGIS Pro 2.5 private! Always editable a photograph of the underlying Files are n't updated existing feature attributes is select... For this field, click the field Calculator or Calculate Geometry and pick either the are... Template maps and apps for your industry another table based on a common field and one for Latitude one... To view and edit attributes and related records and public datasets a parcel feature value of field...\n\nLaughing Meaning In Urdu, External Overflow Box, The Trip Movie, Wood Deck Restoration, Monroe Interior Door, brick Fireplace Accent Wall, Adama Sanogo Espn, Benjamin Moore Cement Gray, Ncat Tuition Payment, Monroe Interior Door,"},"metadata":{"kind":"string","value":"{\n \"url\": \"http://viveroseskalmendi.com/dept-of-qvzbx/751bb3-how-to-add-data-to-attribute-table-in-arcgis-pro\",\n \"source_domain\": \"viveroseskalmendi.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2021-17\",\n \"warc_metadata\": {\n \"Content-Length\": \"32909\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:XU6HTYSAGSO2IRJAJW2PG5HPU7P4255V\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2021-04-22T10:10:29Z\",\n \"WARC-IP-Address\": \"87.98.231.40\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:4PZKX76MI7F53GQXSKJ2ZLCA54SM3CM2\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"http://viveroseskalmendi.com/dept-of-qvzbx/751bb3-how-to-add-data-to-attribute-table-in-arcgis-pro\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"isPartOf: CC-MAIN-2021-17\\r\\npublisher: Common Crawl\\r\\ndescription: Wide crawl of the web for April 2021\\r\\noperator: Common Crawl Admin (info@commoncrawl.org)\\r\\nhostname: ip-10-67-67-190.ec2.internal\\r\\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\\r\\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\\r\\nformat: WARC File Format 1.1\\r\\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 16465,\n 16466\n ],\n \"line_end_idx\": [\n 16465,\n 16466,\n 16695\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 16695,\n \"ccnet_original_nlines\": 2,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.37316176295280457,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.009497550316154957,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0.3333333432674408,\n \"rps_doc_frac_no_alph_words\": 0.12622548639774323,\n \"rps_doc_frac_unique_words\": 0.18213783204555511,\n \"rps_doc_mean_word_length\": 4.701476573944092,\n \"rps_doc_num_sentences\": 170,\n \"rps_doc_symbol_to_word_ratio\": 0.013174019753932953,\n \"rps_doc_unigram_entropy\": 5.224362373352051,\n \"rps_doc_word_count\": 2844,\n \"rps_doc_frac_chars_dupe_10grams\": 0.19213223457336426,\n \"rps_doc_frac_chars_dupe_5grams\": 0.4566599428653717,\n \"rps_doc_frac_chars_dupe_6grams\": 0.3898736238479614,\n \"rps_doc_frac_chars_dupe_7grams\": 0.35060954093933105,\n \"rps_doc_frac_chars_dupe_8grams\": 0.27911150455474854,\n \"rps_doc_frac_chars_dupe_9grams\": 0.23378953337669373,\n \"rps_doc_frac_chars_top_2gram\": 0.009722529910504818,\n \"rps_doc_frac_chars_top_3gram\": 0.009049439802765846,\n \"rps_doc_frac_chars_top_4gram\": 0.004861270077526569,\n \"rps_doc_books_importance\": -850.15673828125,\n \"rps_doc_books_importance_length_correction\": -850.15673828125,\n \"rps_doc_openwebtext_importance\": -431.37921142578125,\n \"rps_doc_openwebtext_importance_length_correction\": -431.37921142578125,\n \"rps_doc_wikipedia_importance\": -374.661376953125,\n \"rps_doc_wikipedia_importance_length_correction\": -374.661376953125\n },\n \"fasttext\": {\n \"dclm\": 0.02962416037917137,\n \"english\": 0.8208742737770081,\n \"fineweb_edu_approx\": 2.109236001968384,\n \"eai_general_math\": 0.7136244773864746,\n \"eai_open_web_math\": 0.07376527786254883,\n \"eai_web_code\": 0.6499335765838623\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.1\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"910.285\",\n \"labels\": {\n \"level_1\": \"History and Geography\",\n \"level_2\": \"Geography and Voyages and travels\",\n \"level_3\": \"\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"23\",\n \"label\": \"Tutorial\"\n },\n \"secondary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Graduate/Expert Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192831,"cells":{"id":{"kind":"number","value":-6252476225153656000,"string":"-6,252,476,225,153,656,000"},"text":{"kind":"string","value":"Change Pan Settings?\n\nDear all,\nI’m using version 3.1.3. Is it possible to change the pan setting (left/right) in the middle of a track, and then go back to the original setting later in the same track?\nThanks so much.\n\nsplit new” copy of the middle section onto a new track, then adjust the pan setting of the new track.\n\nThe stereo-image will instantly change position at the edit, unless you use a crossfade."},"metadata":{"kind":"string","value":"{\n \"url\": \"https://forum.audacityteam.org/t/change-pan-settings/64674\",\n \"source_domain\": \"forum.audacityteam.org\",\n \"snapshot_id\": \"CC-MAIN-2023-50\",\n \"warc_metadata\": {\n \"Content-Length\": \"17136\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:SYJXZGCBVHYQFFZINV3SRZ5QOQ5WNKYG\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2023-12-10T10:57:02Z\",\n \"WARC-IP-Address\": \"104.248.192.5\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:ZTUKNPGSS55AS2XWEMVITQ4DXRIT4JHH\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://forum.audacityteam.org/t/change-pan-settings/64674\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"isPartOf: CC-MAIN-2023-50\\r\\npublisher: Common Crawl\\r\\ndescription: Wide crawl of the web for November/December 2023\\r\\noperator: Common Crawl Admin (info@commoncrawl.org)\\r\\nhostname: ip-10-67-67-66\\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/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 21,\n 22,\n 32,\n 203,\n 219,\n 220,\n 322,\n 323\n ],\n \"line_end_idx\": [\n 21,\n 22,\n 32,\n 203,\n 219,\n 220,\n 322,\n 323,\n 411\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 411,\n \"ccnet_original_nlines\": 8,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.42268040776252747,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.010309279896318913,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.2164948433637619,\n \"rps_doc_frac_unique_words\": 0.6486486792564392,\n \"rps_doc_mean_word_length\": 4.3108110427856445,\n \"rps_doc_num_sentences\": 8,\n \"rps_doc_symbol_to_word_ratio\": 0,\n \"rps_doc_unigram_entropy\": 3.6455399990081787,\n \"rps_doc_word_count\": 74,\n \"rps_doc_frac_chars_dupe_10grams\": 0,\n \"rps_doc_frac_chars_dupe_5grams\": 0,\n \"rps_doc_frac_chars_dupe_6grams\": 0,\n \"rps_doc_frac_chars_dupe_7grams\": 0,\n \"rps_doc_frac_chars_dupe_8grams\": 0,\n \"rps_doc_frac_chars_dupe_9grams\": 0,\n \"rps_doc_frac_chars_top_2gram\": 0.03761754930019379,\n \"rps_doc_frac_chars_top_3gram\": 0.0815047025680542,\n \"rps_doc_frac_chars_top_4gram\": 0,\n \"rps_doc_books_importance\": -34.54544448852539,\n \"rps_doc_books_importance_length_correction\": -34.54545593261719,\n \"rps_doc_openwebtext_importance\": -25.392776489257812,\n \"rps_doc_openwebtext_importance_length_correction\": -25.39278793334961,\n \"rps_doc_wikipedia_importance\": -8.202579498291016,\n \"rps_doc_wikipedia_importance_length_correction\": -8.202589988708496\n },\n \"fasttext\": {\n \"dclm\": 0.37972164154052734,\n \"english\": 0.8157796263694763,\n \"fineweb_edu_approx\": 1.3062199354171753,\n \"eai_general_math\": 0.9700897336006165,\n \"eai_open_web_math\": 0.4999738931655884,\n \"eai_web_code\": 0.15365195274353027\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.4\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"781.5\",\n \"labels\": {\n \"level_1\": \"Arts\",\n \"level_2\": \"Music\",\n \"level_3\": \"Music theory\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Social/Forum\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"18\",\n \"label\": \"Q&A Forum\"\n },\n \"secondary\": {\n \"code\": \"21\",\n \"label\": \"Customer Support\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"1\",\n \"label\": \"No Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"1\",\n \"label\": \"General Audience\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192832,"cells":{"id":{"kind":"number","value":5920892422232523000,"string":"5,920,892,422,232,523,000"},"text":{"kind":"string","value":" 1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.\n\nMore Detailed Logs\n\nDiscussion in 'Tomato Firmware' started by spwelton, Oct 6, 2009.\n\n 1. spwelton\n\n spwelton Addicted to LI Member\n\n Is it possible to get more detail out of the logs seen in the web interface? I can ssh into the router and see that it logs, for example, when I get the password wrong (on purpose) to the interface. Can I somehow make this show up in the web interface? Can I also have it show when someone tries to get into my wireless?\n\n Running Tomato 1.25 on a WRT54G v.2\n\n Thanks\n  \n 2. jan.n\n\n jan.n Addicted to LI Member\n\n They're the same. What you see in your Tomato webinterface is the logfile written by your router. If you ssh into it and less /vat/log/messages, you're shown the same file.\n  \n\nShare This Page"},"metadata":{"kind":"string","value":"{\n \"url\": \"http://www.linksysinfo.org/index.php?threads/more-detailed-logs.30741/\",\n \"source_domain\": \"www.linksysinfo.org\",\n \"snapshot_id\": \"crawl=CC-MAIN-2017-22\",\n \"warc_metadata\": {\n \"Content-Length\": \"27135\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:6PON3WMAGMYFYXI25RA5F56ZEYPIRZWL\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2017-05-22T19:22:38Z\",\n \"WARC-IP-Address\": \"204.11.51.232\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:AYWPB3MU2LVUYAFLIKKPMWA3ZOSFZB44\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"http://www.linksysinfo.org/index.php?threads/more-detailed-logs.30741/\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"robots: classic\\r\\nhostname: ip-10-185-224-210.ec2.internal\\r\\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\\r\\nisPartOf: CC-MAIN-2017-22\\r\\noperator: Common Crawl Admin\\r\\ndescription: Wide crawl of the web for May 2017\\r\\npublisher: Common Crawl\\r\\nformat: WARC File Format 1.0\\r\\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 113,\n 114,\n 133,\n 134,\n 200,\n 201,\n 215,\n 216,\n 251,\n 252,\n 577,\n 578,\n 618,\n 619,\n 630,\n 636,\n 647,\n 648,\n 680,\n 681,\n 858,\n 864,\n 865\n ],\n \"line_end_idx\": [\n 113,\n 114,\n 133,\n 134,\n 200,\n 201,\n 215,\n 216,\n 251,\n 252,\n 577,\n 578,\n 618,\n 619,\n 630,\n 636,\n 647,\n 648,\n 680,\n 681,\n 858,\n 864,\n 865,\n 880\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 880,\n \"ccnet_original_nlines\": 23,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.41025641560554504,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.03589744120836258,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.2102564126253128,\n \"rps_doc_frac_unique_words\": 0.5714285969734192,\n \"rps_doc_mean_word_length\": 4.1688313484191895,\n \"rps_doc_num_sentences\": 19,\n \"rps_doc_symbol_to_word_ratio\": 0,\n \"rps_doc_unigram_entropy\": 4.282008647918701,\n \"rps_doc_word_count\": 154,\n \"rps_doc_frac_chars_dupe_10grams\": 0,\n \"rps_doc_frac_chars_dupe_5grams\": 0,\n \"rps_doc_frac_chars_dupe_6grams\": 0,\n \"rps_doc_frac_chars_dupe_7grams\": 0,\n \"rps_doc_frac_chars_dupe_8grams\": 0,\n \"rps_doc_frac_chars_dupe_9grams\": 0,\n \"rps_doc_frac_chars_top_2gram\": 0.024922119453549385,\n \"rps_doc_frac_chars_top_3gram\": 0.03738318011164665,\n \"rps_doc_frac_chars_top_4gram\": 0.05607476830482483,\n \"rps_doc_books_importance\": -51.68705368041992,\n \"rps_doc_books_importance_length_correction\": -51.68705368041992,\n \"rps_doc_openwebtext_importance\": -28.830759048461914,\n \"rps_doc_openwebtext_importance_length_correction\": -21.837717056274414,\n \"rps_doc_wikipedia_importance\": -24.700912475585938,\n \"rps_doc_wikipedia_importance_length_correction\": -24.700912475585938\n },\n \"fasttext\": {\n \"dclm\": 0.052439868450164795,\n \"english\": 0.9296667575836182,\n \"fineweb_edu_approx\": 1.4501787424087524,\n \"eai_general_math\": 0.007217110134661198,\n \"eai_open_web_math\": 0.1612643003463745,\n \"eai_web_code\": 0.000015740000890218653\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"004.6\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n },\n \"secondary\": {\n \"code\": \"005.1\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Social/Forum\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n },\n \"secondary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"18\",\n \"label\": \"Q&A Forum\"\n },\n \"secondary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"1\",\n \"label\": \"No Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n },\n \"secondary\": {\n \"code\": \"1\",\n \"label\": \"General Audience\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192833,"cells":{"id":{"kind":"number","value":-8039678514983300000,"string":"-8,039,678,514,983,300,000"},"text":{"kind":"string","value":" \n\n\n\nForgot your password?\ntypodupeerror\n\nComment: Re:This is a toy for geeks having nerdgasms (Score 1) 496\n\nby quasipunk guy (#43427883) Attached to: Not Even Investors Know What Google Glass Is For\n\nIsn't there a better product that already does all of this without requiring a link through Google's servers? Amusingly, an Android device available at the Apple Store?\n\nhttp://www.oakley.com/airwave\n\nAs far as I can tell, the Oakley HUD is a pretty good example of what companies should be doing with these head mounted computers (in spite of a fairly niche market). Glass is both too limited and too ambitious.\n\nComment: Re:Sign of the times (Score 1) 252\n\nby quasipunk guy (#41847493) Attached to: Apple Delays Simpler and Cleaner iTunes 'to Get It Right'\n\nI can't speak to the obfuscation, but indexing the files provided a huge performance increase compared to other DAPs when the iPod was released. The responsive, intuitive click-wheel interface is definitely the key to the iPod's success and it wouldn't have been possible using a traditional FS based system.\n\nComment: Re:I suspect there are more to meet the eyes (Score 5, Insightful) 165\n\nby quasipunk guy (#40097607) Attached to: Apple and Samsung Ordered Talks Fail - Trial Date Set\n\nSamsung has a lot to lose by alienating Apple. Apple is a huge customer, very few organizations buy in the volumes that Apple works with. Losing a big account would suck, but Apple pouring billions of dollars into Samsung's competitors to improve their manufacturing technology will make a large impact on Samsung's ability to compete.\n\nAlso consider that Apple's order volume enables Samsung to run their factories at higher capacity, reducing overall operating costs by reducing or eliminating downtime. In some cases this could mean that a factory would not be able to operate profitably. Could Samsung's US fab maintain their price points and sustain their infrastructure development plans without Apple as a customer? I have no idea but it doesn't seem like an obvious answer.\n\n\"The four building blocks of the universe are fire, water, gravel and vinyl.\" -- Dave Barry\n\nWorking..."},"metadata":{"kind":"string","value":"{\n \"url\": \"http://slashdot.org/~quasipunk+guy\",\n \"source_domain\": \"slashdot.org\",\n \"snapshot_id\": \"crawl=CC-MAIN-2014-41\",\n \"warc_metadata\": {\n \"Content-Length\": \"91009\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:O2INCL2FDL3NFBFJP2YV5LHKXFZK4BLH\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2014-09-24T01:40:52Z\",\n \"WARC-IP-Address\": \"216.34.181.45\",\n \"WARC-Identified-Payload-Type\": null,\n \"WARC-Payload-Digest\": \"sha1:DSDMLMGRZE3AA3NGSZH7LKZBQ3CKVLJO\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"http://slashdot.org/~quasipunk+guy\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"robots: classic\\r\\nhostname: ip-10-234-18-248.ec2.internal\\r\\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\\r\\nisPartOf: CC-MAIN-2014-41\\r\\noperator: CommonCrawl Admin\\r\\ndescription: Wide crawl of the web with URLs provided by Blekko for September 2014\\r\\npublisher: CommonCrawl\\r\\nformat: WARC File Format 1.0\\r\\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 2,\n 3,\n 4,\n 5,\n 27,\n 41,\n 42,\n 109,\n 110,\n 201,\n 202,\n 371,\n 372,\n 402,\n 403,\n 615,\n 616,\n 660,\n 661,\n 761,\n 762,\n 1071,\n 1072,\n 1152,\n 1153,\n 1249,\n 1250,\n 1586,\n 1587,\n 2032,\n 2033,\n 2125,\n 2126\n ],\n \"line_end_idx\": [\n 2,\n 3,\n 4,\n 5,\n 27,\n 41,\n 42,\n 109,\n 110,\n 201,\n 202,\n 371,\n 372,\n 402,\n 403,\n 615,\n 616,\n 660,\n 661,\n 761,\n 762,\n 1071,\n 1072,\n 1152,\n 1153,\n 1249,\n 1250,\n 1586,\n 1587,\n 2032,\n 2033,\n 2125,\n 2126,\n 2136\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 2136,\n \"ccnet_original_nlines\": 33,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 1,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.3589743673801422,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.01631701923906803,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0.029411759227514267,\n \"rps_doc_frac_no_alph_words\": 0.1794871836900711,\n \"rps_doc_frac_unique_words\": 0.6734693646430969,\n \"rps_doc_mean_word_length\": 4.941690921783447,\n \"rps_doc_num_sentences\": 18,\n \"rps_doc_symbol_to_word_ratio\": 0.009324010461568832,\n \"rps_doc_unigram_entropy\": 5.1516265869140625,\n \"rps_doc_word_count\": 343,\n \"rps_doc_frac_chars_dupe_10grams\": 0,\n \"rps_doc_frac_chars_dupe_5grams\": 0,\n \"rps_doc_frac_chars_dupe_6grams\": 0,\n \"rps_doc_frac_chars_dupe_7grams\": 0,\n \"rps_doc_frac_chars_dupe_8grams\": 0,\n \"rps_doc_frac_chars_dupe_9grams\": 0,\n \"rps_doc_frac_chars_top_2gram\": 0.005309729836881161,\n \"rps_doc_frac_chars_top_3gram\": 0.024778759106993675,\n \"rps_doc_frac_chars_top_4gram\": 0,\n \"rps_doc_books_importance\": -205.480712890625,\n \"rps_doc_books_importance_length_correction\": -205.480712890625,\n \"rps_doc_openwebtext_importance\": -127.10282897949219,\n \"rps_doc_openwebtext_importance_length_correction\": -127.10282897949219,\n \"rps_doc_wikipedia_importance\": -73.71194458007812,\n \"rps_doc_wikipedia_importance_length_correction\": -73.71194458007812\n },\n \"fasttext\": {\n \"dclm\": 0.6273009777069092,\n \"english\": 0.9601929783821106,\n \"fineweb_edu_approx\": 1.4130191802978516,\n \"eai_general_math\": 0.029246389865875244,\n \"eai_open_web_math\": 0.14659667015075684,\n \"eai_web_code\": 0.021924439817667007\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"004.0194\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n },\n \"secondary\": {\n \"code\": \"658.85\",\n \"labels\": {\n \"level_1\": \"Industrial arts, Technology, and Engineering\",\n \"level_2\": \"Business\",\n \"level_3\": \"Management\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Evaluate\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Analyze\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Social/Forum\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n },\n \"secondary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Comment Section\"\n },\n \"secondary\": {\n \"code\": \"16\",\n \"label\": \"Personal Blog\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"6\",\n \"label\": \"Not Applicable/Indeterminate\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"1\",\n \"label\": \"General Audience\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192834,"cells":{"id":{"kind":"number","value":6852614696449524000,"string":"6,852,614,696,449,524,000"},"text":{"kind":"string","value":"Automated protocol analysis\n\nwireshark\n\n[I)ruid] from BreakingPoint Labs has been doing quite a bit of protocol reverse engineering as part of his work. He put together a post covering some of the tools that have been useful for this task. Text-based protocols have a lot of human readable characters that can help you identify fields. Binary protocols don’t have this luxury though. He recommends the Protocol Informatics Project for tackling these situations. It applies bioinformatics algorithms to network traffic. You give it a packet dump of the protocol and it compares them to find similarities the same way genetic sequences are compared. It can be confused by protocols that waste a lot of space, but it’s still a very clever approach to reversing.\n\n[photo: slashcrisis]"},"metadata":{"kind":"string","value":"{\n \"url\": \"http://hackaday.com/tag/druidian/\",\n \"source_domain\": \"hackaday.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2016-22\",\n \"warc_metadata\": {\n \"Content-Length\": \"44155\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:BVWHV6YB5KTKQKTX5Q6477YCG5FRXLNW\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2016-05-26T16:42:15Z\",\n \"WARC-IP-Address\": \"192.0.79.33\",\n \"WARC-Identified-Payload-Type\": null,\n \"WARC-Payload-Digest\": \"sha1:6DOQFIXL7QRDLE3WQDBTIGG4EUPH3U4Y\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"http://hackaday.com/tag/druidian/\",\n \"WARC-Truncated\": \"length\",\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"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\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 28,\n 29,\n 39,\n 40,\n 759,\n 760\n ],\n \"line_end_idx\": [\n 28,\n 29,\n 39,\n 40,\n 759,\n 760,\n 780\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 780,\n \"ccnet_original_nlines\": 6,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.41496598720550537,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.00680272001773119,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.12244898080825806,\n \"rps_doc_frac_unique_words\": 0.7279999852180481,\n \"rps_doc_mean_word_length\": 5.0960001945495605,\n \"rps_doc_num_sentences\": 9,\n \"rps_doc_symbol_to_word_ratio\": 0,\n \"rps_doc_unigram_entropy\": 4.340121269226074,\n \"rps_doc_word_count\": 125,\n \"rps_doc_frac_chars_dupe_10grams\": 0,\n \"rps_doc_frac_chars_dupe_5grams\": 0,\n \"rps_doc_frac_chars_dupe_6grams\": 0,\n \"rps_doc_frac_chars_dupe_7grams\": 0,\n \"rps_doc_frac_chars_dupe_8grams\": 0,\n \"rps_doc_frac_chars_dupe_9grams\": 0,\n \"rps_doc_frac_chars_top_2gram\": 0.015698589384555817,\n \"rps_doc_frac_chars_top_3gram\": 0.018838299438357353,\n \"rps_doc_frac_chars_top_4gram\": 0,\n \"rps_doc_books_importance\": -30.175296783447266,\n \"rps_doc_books_importance_length_correction\": -30.175296783447266,\n \"rps_doc_openwebtext_importance\": -20.28783416748047,\n \"rps_doc_openwebtext_importance_length_correction\": -20.28782081604004,\n \"rps_doc_wikipedia_importance\": -16.285457611083984,\n \"rps_doc_wikipedia_importance_length_correction\": -16.285457611083984\n },\n \"fasttext\": {\n \"dclm\": 0.28104376792907715,\n \"english\": 0.9394031167030334,\n \"fineweb_edu_approx\": 2.2893011569976807,\n \"eai_general_math\": 0.636878252029419,\n \"eai_open_web_math\": 0.5193052887916565,\n \"eai_web_code\": 0.11730837821960449\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"004.67\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n },\n \"secondary\": {\n \"code\": \"005.1\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Missing Images or Figures\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"10\",\n \"label\": \"Knowledge Article\"\n },\n \"secondary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192835,"cells":{"id":{"kind":"number","value":-1352683126685122000,"string":"-1,352,683,126,685,122,000"},"text":{"kind":"string","value":"homepage Welcome to WebmasterWorld Guest from 184.72.91.131\nregister, free tools, login, search, subscribe, help, library, announcements, recent posts, open posts,\nSubscribe to WebmasterWorld\n\nHome / Forums Index / Code, Content, and Presentation / HTML\nForum Library, Charter, Moderators: incrediBILL\n\nHTML Forum\n\n    \nWebTV Browser -- and WebTV Business?\ntedster\n\n\n\n\nmsg:584930\n 1:52 am on Nov 26, 2000 (gmt 0)\n\nIn another thread [webmasterworld.com] thepunter brought up the issue of the WebTV browser.\n\nWebTV offers a simulator for their browser on their site [developer.webtv.net]. There is also an easy to use online viewer at AnyBrowser.com [anybrowser.com], but it's version 1.1 of the WebTV browser, which is now up to version 2.5.\n\nThe main restriction on the WebTV browser is the screen width (550 pixels). WebTV has an algorithm that squeezes everything down to that width, no matter how you code your HTML. One big technical difference between a TV picture and a monitor is that a TV is interlaced -- only half the lines of a screen are displayed on each pass, and they alternate.\n\nHere's 3 basic rules I follow when WebTV matters to a client.\n\n1. Small fonts are not going to work. The WebTV browser will automatically fatten up your tags, but beware of any text in graphics. Make all the letter forms substantial or they won't be legible on a TV screen.\n\n2. Avoid all-white backgrounds -- they make a lot of TVs freak out. You'll notice that the WebTV website has sort of a light tan background.\n\n3. Avoid intense colors like bright red -- looks like chocolate pudding, at best.\n\nIf you get into fancy stuff -- multi media and all that -- then you need to study the developer's materials that WebTV provides.\n\nDoes anyone here get significant WebTV traffic? I have two clients who felt their products warranted it, and they paid extra to develop a WebTV compatible site -- but the traffic/sales just aren't there for them.\n\n \n\nMike_Mackin\n\n\n\n\nmsg:584931\n 2:05 am on Nov 26, 2000 (gmt 0)\n\n>Does anyone here get significant WebTV traffic?\n\nnop BUT our stuff doesn't appeal to 8th graders\n\n<------[and we like white backgrounds]\n\nrcjordan\n\n\n\n\nmsg:584932\n 2:09 am on Nov 26, 2000 (gmt 0)\n\n>Does anyone here get significant WebTV traffic?\n>\nSorry Tedster, I get 1 or 2 referrals a QUARTER.\n\ntedster\n\n\n\n\nmsg:584933\n 2:39 am on Nov 26, 2000 (gmt 0)\n\nWell, we do see more than 1 or 2 a quarter. More like 1 or 2 a week, but that's still not anywhere near a viable level for business. These are products that have a strong senior citizen demographic -- and big AOL numbers. One of them is something like 80% of their online sales from AOL, and the other is about half.\n\nI suspect the site owners may have a good hunch about WebTV, but I haven't been able to get it to pay off so far. If anyone has any hints about getting WebTV business, I'd love to hear them.\n\nMy biggest suspicion is that no one wants to give a credit card number to a TV set. Doesn't seem prudent.\n\ngmiller\n\n\n\n\nmsg:584934\n 4:14 am on Nov 27, 2000 (gmt 0)\n\nThe last number I heard was that they'd sold about 800K WebTV boxes, but that's an old number. Consequently, you're not going to see many WebTV users unless you have something tightly targetted at them.\n\ntedster\n\n\n\n\nmsg:584935\n 5:40 am on Nov 27, 2000 (gmt 0)\n\nI'd say you're right. The current numbers for total boxes in use are hard to find, but I've been doing a little more poking around. The WebTV site says they serve 65 million page views per day, and that 40% of their subscribers have made at least one purchase online in the last year.\n\nSo it's not exactly a gold rush. Furthermore, it looks like you need to directly target the WebTV user by advertising through WebTV itself.\n\nMicrosoft, the owner, is looking to push interactive TV programming through a partnership with CBS for the next year. I think they know that WebTV will not even rival the Mac in the online world, so they have a new gameplan.\n\nrcjordan\n\n\n\n\nmsg:584936\n 12:45 am on Nov 30, 2000 (gmt 0)\n\n>>Does anyone here get significant WebTV traffic?\n>>\n>Sorry Tedster, I get 1 or 2 referrals a QUARTER.\n>\nEvidently, that was the 3rd quarter, because now I'm getting 2 or 3 a day on two travel sites. There's some sort of promo with GO.com perhaps? They all look like this in the logs\n[go.com...]\n\n???\n\ntedster\n\n\n\n\nmsg:584937\n 4:24 am on Nov 30, 2000 (gmt 0)\n\n>...now I'm getting 2 or 3 a day on two travel sites.\n\nIt's been sneaking up on me, too. I thought it would be gone by now, and instead referals are up, although still very anaemic.\n\nLast week I got some email from a new contact who has a WebTV email address. In the past year I've had 2 other clients who had WebTV addresses until well after their sites were launched -- then they KNEW they had to buy a PC.\n\nFunny thing, one of those clients who didn't own a PC was a domain name speculator! He would hire me to create content to help him sell various domains. All the time he was only online through WebTV.\n\nIt does get me thinking about an under-noticed market. Microsoft owns WebTV. They're collaborating with CBS. They're worth at least keeping them on the radar, IMO.\n\nGlobal Options:\n top home search open messages active posts  \n \n\nHome / Forums Index / Code, Content, and Presentation / HTML\nrss feed\n\nAll trademarks and copyrights held by respective owners. Member comments are owned by the poster.\nTerms of Service ¦ Privacy Policy ¦ Report Problem ¦ About\n© Webmaster World 1996-2014 all rights reserved"},"metadata":{"kind":"string","value":"{\n \"url\": \"http://www.webmasterworld.com/forum21/79.htm\",\n \"source_domain\": \"www.webmasterworld.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2014-10\",\n \"warc_metadata\": {\n \"Content-Length\": \"22644\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:ZJJOZOOH7F42FCORY4POOTJRQF4MOOKH\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2014-03-12T17:21:27Z\",\n \"WARC-IP-Address\": \"209.59.188.141\",\n \"WARC-Identified-Payload-Type\": null,\n \"WARC-Payload-Digest\": \"sha1:NXFYI5LTKP3S5RKFFCQ6T54FZ2MOPYYW\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"http://www.webmasterworld.com/forum21/79.htm\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"robots: classic\\r\\nhostname: ip-10-183-142-35.ec2.internal\\r\\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\\r\\nisPartOf: CC-MAIN-2014-10\\r\\noperator: CommonCrawl Admin\\r\\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\\r\\npublisher: CommonCrawl\\r\\nformat: WARC File Format 1.0\\r\\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 60,\n 164,\n 192,\n 193,\n 254,\n 302,\n 303,\n 314,\n 315,\n 320,\n 357,\n 365,\n 366,\n 367,\n 368,\n 369,\n 380,\n 413,\n 414,\n 506,\n 507,\n 741,\n 742,\n 1094,\n 1095,\n 1157,\n 1158,\n 1376,\n 1377,\n 1518,\n 1519,\n 1601,\n 1602,\n 1731,\n 1732,\n 1945,\n 1946,\n 1948,\n 1949,\n 1961,\n 1962,\n 1963,\n 1964,\n 1965,\n 1976,\n 2009,\n 2010,\n 2059,\n 2060,\n 2108,\n 2109,\n 2148,\n 2149,\n 2158,\n 2159,\n 2160,\n 2161,\n 2162,\n 2173,\n 2206,\n 2207,\n 2256,\n 2258,\n 2307,\n 2308,\n 2316,\n 2317,\n 2318,\n 2319,\n 2320,\n 2331,\n 2364,\n 2365,\n 2682,\n 2683,\n 2874,\n 2875,\n 2981,\n 2982,\n 2990,\n 2991,\n 2992,\n 2993,\n 2994,\n 3005,\n 3038,\n 3039,\n 3242,\n 3243,\n 3251,\n 3252,\n 3253,\n 3254,\n 3255,\n 3266,\n 3299,\n 3300,\n 3585,\n 3586,\n 3726,\n 3727,\n 3952,\n 3953,\n 3962,\n 3963,\n 3964,\n 3965,\n 3966,\n 3977,\n 4011,\n 4012,\n 4062,\n 4065,\n 4115,\n 4117,\n 4296,\n 4308,\n 4309,\n 4313,\n 4314,\n 4322,\n 4323,\n 4324,\n 4325,\n 4326,\n 4337,\n 4370,\n 4371,\n 4425,\n 4426,\n 4553,\n 4554,\n 4780,\n 4781,\n 4981,\n 4982,\n 5146,\n 5147,\n 5163,\n 5209,\n 5211,\n 5212,\n 5273,\n 5282,\n 5283,\n 5381,\n 5440\n ],\n \"line_end_idx\": [\n 60,\n 164,\n 192,\n 193,\n 254,\n 302,\n 303,\n 314,\n 315,\n 320,\n 357,\n 365,\n 366,\n 367,\n 368,\n 369,\n 380,\n 413,\n 414,\n 506,\n 507,\n 741,\n 742,\n 1094,\n 1095,\n 1157,\n 1158,\n 1376,\n 1377,\n 1518,\n 1519,\n 1601,\n 1602,\n 1731,\n 1732,\n 1945,\n 1946,\n 1948,\n 1949,\n 1961,\n 1962,\n 1963,\n 1964,\n 1965,\n 1976,\n 2009,\n 2010,\n 2059,\n 2060,\n 2108,\n 2109,\n 2148,\n 2149,\n 2158,\n 2159,\n 2160,\n 2161,\n 2162,\n 2173,\n 2206,\n 2207,\n 2256,\n 2258,\n 2307,\n 2308,\n 2316,\n 2317,\n 2318,\n 2319,\n 2320,\n 2331,\n 2364,\n 2365,\n 2682,\n 2683,\n 2874,\n 2875,\n 2981,\n 2982,\n 2990,\n 2991,\n 2992,\n 2993,\n 2994,\n 3005,\n 3038,\n 3039,\n 3242,\n 3243,\n 3251,\n 3252,\n 3253,\n 3254,\n 3255,\n 3266,\n 3299,\n 3300,\n 3585,\n 3586,\n 3726,\n 3727,\n 3952,\n 3953,\n 3962,\n 3963,\n 3964,\n 3965,\n 3966,\n 3977,\n 4011,\n 4012,\n 4062,\n 4065,\n 4115,\n 4117,\n 4296,\n 4308,\n 4309,\n 4313,\n 4314,\n 4322,\n 4323,\n 4324,\n 4325,\n 4326,\n 4337,\n 4370,\n 4371,\n 4425,\n 4426,\n 4553,\n 4554,\n 4780,\n 4781,\n 4981,\n 4982,\n 5146,\n 5147,\n 5163,\n 5209,\n 5211,\n 5212,\n 5273,\n 5282,\n 5283,\n 5381,\n 5440,\n 5487\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 5487,\n \"ccnet_original_nlines\": 147,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.3747967481613159,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.030894309282302856,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.24959349632263184,\n \"rps_doc_frac_unique_words\": 0.47151899337768555,\n \"rps_doc_mean_word_length\": 4.402953624725342,\n \"rps_doc_num_sentences\": 73,\n \"rps_doc_symbol_to_word_ratio\": 0.0016260199481621385,\n \"rps_doc_unigram_entropy\": 5.616480350494385,\n \"rps_doc_word_count\": 948,\n \"rps_doc_frac_chars_dupe_10grams\": 0.07379013299942017,\n \"rps_doc_frac_chars_dupe_5grams\": 0.1274556815624237,\n \"rps_doc_frac_chars_dupe_6grams\": 0.1274556815624237,\n \"rps_doc_frac_chars_dupe_7grams\": 0.1274556815624237,\n \"rps_doc_frac_chars_dupe_8grams\": 0.0953521803021431,\n \"rps_doc_frac_chars_dupe_9grams\": 0.07379013299942017,\n \"rps_doc_frac_chars_top_2gram\": 0.007666510064154863,\n \"rps_doc_frac_chars_top_3gram\": 0.013416389934718609,\n \"rps_doc_frac_chars_top_4gram\": 0.008624820038676262,\n \"rps_doc_books_importance\": -493.3996887207031,\n \"rps_doc_books_importance_length_correction\": -493.3996887207031,\n \"rps_doc_openwebtext_importance\": -354.2835998535156,\n \"rps_doc_openwebtext_importance_length_correction\": -354.2835998535156,\n \"rps_doc_wikipedia_importance\": -182.2626953125,\n \"rps_doc_wikipedia_importance_length_correction\": -182.2626953125\n },\n \"fasttext\": {\n \"dclm\": 0.03521769866347313,\n \"english\": 0.9472885131835938,\n \"fineweb_edu_approx\": 1.0097758769989014,\n \"eai_general_math\": 0.018077369779348373,\n \"eai_open_web_math\": 0.06601399183273315,\n \"eai_web_code\": 0.004719790071249008\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"004.67\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n },\n \"secondary\": {\n \"code\": \"658.85\",\n \"labels\": {\n \"level_1\": \"Industrial arts, Technology, and Engineering\",\n \"level_2\": \"Business\",\n \"level_3\": \"Management\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Social/Forum\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n },\n \"secondary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Missing Images or Figures\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"18\",\n \"label\": \"Q&A Forum\"\n },\n \"secondary\": {\n \"code\": \"5\",\n \"label\": \"Comment Section\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192836,"cells":{"id":{"kind":"number","value":3023972989589293600,"string":"3,023,972,989,589,293,600"},"text":{"kind":"string","value":"   \n\nОтправка сообщения\n\n\n\n\n\n\nКак создать свои шорткоды в WordPress\n\nВсем привет, сегодня мы поговорим про шорткоды в WordPress. Шорткоды позволяют вставлять в области вывода контента результаты выполнения какого-либо заготовленного кода. Это очень удобно, ведь можно короткой записью подключать существенные блоки кода. Так к примеру, в самом движке WordPress уже существует набор стандартных шорткодов, которые могут быть использованы для вывода.\n\nСтандартные шорткоды WordPress\n\nПример стандартных шорткодов WordPress:\n[audio]\n[caption]\n[gallery]\n[playlist]\n[video]\n\nМожно заметить каждый шорткод заключён в квадратные скобки. Название шорткода идёт сразу после открытия скобки. Дело в том, что кроме самого символьного кода так же могут передаваться параметры, которые очень часто используются на практике.\n\nРассмотрим пример вывода галереи на сайте, посредством использования шорткода с некоторым набором параметров.\n\n[gallery size=\"large\" ids=\"45,35,25\"]\n\nТак мы обратились к шорткоду с названием gallery, передав параметры size и ids. Набор параметров может быть произвольным, и регламентируется отдельно для каждого шорткода.\n\nСоздание своих шорткодов в WordPress\n\nДовольно перспективной становится возможность создания и использования собственных шорткодов в WordPress. Так множество плагинов используют эту возможность для простой интеграции блоков данных на сайт. К примеру, вы устанавливаете плагин с формой обратной связи, и на нужной странице вам достаточно добавить код вывода этой формы. Минимум кода, максимум эффекта. С таким же успехом мы можем создавать уникальные шорткоды для своих проектов.\n\nДавайте рассмотрим простой пример создания своего шорткода. Для каждого шорткода должна быть определена функция-обработчик. Добавление нового шорткода и хука для него происходит через функцию add_shortcode().\n\nСоздаём в файле functions.php свой шорткод:\n\nadd_shortcode( 'footag', 'footag_func' );\n\nfunction footag_func( $atts ){\nreturn \"foo = \". $atts['foo'];\n}\n\nЭтот пример демонстрирует регистрацию нового шорткода, который может вызываться таким образом:\n\n[footag foo=\"bar\"]\n\nЕсли в системе уже есть шорткод с таким названием, допустим в каком-либо плагине, то она будет заменена, с приоритетом в том порядке как вызываются функции.\nСтоит обратить внимание на то, что результат работы функции всегда должен возвращаться через return а не выводиться на экран. В целом принцип использования довольно прост.\n\nВозможность использования add_shortcode() появилась в WordPress начиная с версии 2.5. Это так же следует учитывать если вы решили использовать их в своих проектах.\n\nЗакрывающиеся шоркоды в WordPress\n\nСуществует и другой способ записи шоркодов, который расширяет возможность их использования. В отличии от предыдущего примера, есть возможность использования закрывающихся шорткодов. Это позволяет внутри них добавлять и другие шорткоды. Реализуется это посредством встроенной функции do_shortcode().\n\nРассмотрим такой пример вывода:\n\n[footag foo=\"bar\"]\n\tЗдесь может быть произвольный текст,\n\t[myurl]\n[/footag]\n\nСама функция-обработчик будет получать дополнительный параметр:\n\nadd_shortcode( 'footag', 'footag_func' );\n\nfunction footag_func( $atts, $shortcode_content = null ){\nreturn \"foo = \". $atts['foo'] . '\n' . do_shortcode( $shortcode_content );\n}\n\nТаким образом, кроме выполнения шоркода footag, внутри посредством функции do_shortcode() будет выполнен шорткод [myurl], который был передан вместе с текстом родительского шорткода.\n\nЭкранирование шорткодов\n\nИногда может потребоваться просто вывести шорткод на страницу без его выполнения. Для этого мы можем воспользоваться экранированием шорткодов. Экранируется шорткод посредством квадратных скобок, пример:\n\n[[footag]]\n\nДля открывающих/закрывающих шорткодов будет такая запись:\n\n[[footag] ... [/footag]]\n\nОбратите внимание на то, что использоваться экранирование может лишь для зарегистрированных шорткодов на сайте. Для других случаев можно так же использовать html-сущности, в качестве альтернативы показа квадратных скобок.\n\n&#091;footag&#093;\n\nПри отрисовки страницы в браузере html-сущности будут замены на открывающие и закрывающие квадратные скобки соответственно.\n\nЧасто в функции-обработчике шорткода приходится использовать существенное количество html-разметки. Т.к. функция не должна выводить сразу результат, а передаваться в виде значения, то удобно использовать для этих целей буферизацию вывода.\n\nБуферизация вывода в шорткоде\n\nЧто касается буферизации вывода, то тут всё стандартно для PHP. Выполнять буферизацию нужно в функции-обработчике, и оформить его следует таким вот образом:\n\nfunction footag_func() {\n\tob_start();\n\t?>\n\t\n\t\",\n \"WARC-Date\": \"2021-09-19T23:19:03Z\",\n \"WARC-IP-Address\": \"194.61.0.3\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:W4GNC7DAANBKMDRWLOU3KFTPQQGBDBZR\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://yournet.info/blog/wp/kak-sozdat-svoi-shortkody-v-wordpress\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"isPartOf: CC-MAIN-2021-39\\r\\npublisher: Common Crawl\\r\\ndescription: Wide crawl of the web for September 2021\\r\\noperator: Common Crawl Admin (info@commoncrawl.org)\\r\\nhostname: ip-10-67-67-22\\r\\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\\r\\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\\r\\nformat: WARC File Format 1.1\\r\\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 4,\n 5,\n 24,\n 25,\n 26,\n 27,\n 28,\n 29,\n 30,\n 68,\n 69,\n 449,\n 450,\n 481,\n 482,\n 522,\n 530,\n 540,\n 550,\n 561,\n 569,\n 570,\n 811,\n 812,\n 922,\n 923,\n 961,\n 962,\n 1134,\n 1135,\n 1172,\n 1173,\n 1614,\n 1615,\n 1824,\n 1825,\n 1869,\n 1870,\n 1912,\n 1913,\n 1944,\n 1975,\n 1977,\n 1978,\n 2073,\n 2074,\n 2093,\n 2094,\n 2251,\n 2423,\n 2424,\n 2588,\n 2589,\n 2623,\n 2624,\n 2923,\n 2924,\n 2956,\n 2957,\n 2976,\n 3014,\n 3023,\n 3033,\n 3034,\n 3098,\n 3099,\n 3141,\n 3142,\n 3200,\n 3234,\n 3274,\n 3276,\n 3277,\n 3460,\n 3461,\n 3485,\n 3486,\n 3689,\n 3690,\n 3701,\n 3702,\n 3760,\n 3761,\n 3786,\n 3787,\n 4009,\n 4010,\n 4029,\n 4030,\n 4154,\n 4155,\n 4394,\n 4395,\n 4425,\n 4426,\n 4583,\n 4584,\n 4609,\n 4622,\n 4626,\n 4667,\n 4671,\n 4730,\n 4747,\n 4748,\n 4765,\n 4767,\n 4768,\n 5169,\n 5170,\n 5213,\n 5214,\n 5424,\n 5425,\n 5483,\n 5484,\n 5501,\n 5551,\n 5582,\n 5585,\n 5587,\n 5588,\n 5875,\n 5876,\n 5903,\n 5905,\n 5906,\n 5927,\n 5928,\n 5995,\n 5996,\n 6008,\n 6009,\n 6025,\n 6026\n ],\n \"line_end_idx\": [\n 4,\n 5,\n 24,\n 25,\n 26,\n 27,\n 28,\n 29,\n 30,\n 68,\n 69,\n 449,\n 450,\n 481,\n 482,\n 522,\n 530,\n 540,\n 550,\n 561,\n 569,\n 570,\n 811,\n 812,\n 922,\n 923,\n 961,\n 962,\n 1134,\n 1135,\n 1172,\n 1173,\n 1614,\n 1615,\n 1824,\n 1825,\n 1869,\n 1870,\n 1912,\n 1913,\n 1944,\n 1975,\n 1977,\n 1978,\n 2073,\n 2074,\n 2093,\n 2094,\n 2251,\n 2423,\n 2424,\n 2588,\n 2589,\n 2623,\n 2624,\n 2923,\n 2924,\n 2956,\n 2957,\n 2976,\n 3014,\n 3023,\n 3033,\n 3034,\n 3098,\n 3099,\n 3141,\n 3142,\n 3200,\n 3234,\n 3274,\n 3276,\n 3277,\n 3460,\n 3461,\n 3485,\n 3486,\n 3689,\n 3690,\n 3701,\n 3702,\n 3760,\n 3761,\n 3786,\n 3787,\n 4009,\n 4010,\n 4029,\n 4030,\n 4154,\n 4155,\n 4394,\n 4395,\n 4425,\n 4426,\n 4583,\n 4584,\n 4609,\n 4622,\n 4626,\n 4667,\n 4671,\n 4730,\n 4747,\n 4748,\n 4765,\n 4767,\n 4768,\n 5169,\n 5170,\n 5213,\n 5214,\n 5424,\n 5425,\n 5483,\n 5484,\n 5501,\n 5551,\n 5582,\n 5585,\n 5587,\n 5588,\n 5875,\n 5876,\n 5903,\n 5905,\n 5906,\n 5927,\n 5928,\n 5995,\n 5996,\n 6008,\n 6009,\n 6025,\n 6026,\n 6032\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 6032,\n \"ccnet_original_nlines\": 135,\n \"rps_doc_curly_bracket\": 0.001657819957472384,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.008946320042014122,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0.007352939806878567,\n \"rps_doc_frac_no_alph_words\": 0.8996024131774902,\n \"rps_doc_frac_unique_words\": 0.5359565615653992,\n \"rps_doc_mean_word_length\": 6.643147945404053,\n \"rps_doc_num_sentences\": 60,\n \"rps_doc_symbol_to_word_ratio\": 0.003976140171289444,\n \"rps_doc_unigram_entropy\": 5.589770793914795,\n \"rps_doc_word_count\": 737,\n \"rps_doc_frac_chars_dupe_10grams\": 0,\n \"rps_doc_frac_chars_dupe_5grams\": 0.020424839109182358,\n \"rps_doc_frac_chars_dupe_6grams\": 0.020424839109182358,\n \"rps_doc_frac_chars_dupe_7grams\": 0,\n \"rps_doc_frac_chars_dupe_8grams\": 0,\n \"rps_doc_frac_chars_dupe_9grams\": 0,\n \"rps_doc_frac_chars_top_2gram\": 0.012254900299012661,\n \"rps_doc_frac_chars_top_3gram\": 0.013480390422046185,\n \"rps_doc_frac_chars_top_4gram\": 0.014705879613757133,\n \"rps_doc_books_importance\": -374.4568786621094,\n \"rps_doc_books_importance_length_correction\": -374.4568786621094,\n \"rps_doc_openwebtext_importance\": -228.81219482421875,\n \"rps_doc_openwebtext_importance_length_correction\": -228.81219482421875,\n \"rps_doc_wikipedia_importance\": -162.79966735839844,\n \"rps_doc_wikipedia_importance_length_correction\": -162.79966735839844\n },\n \"fasttext\": {\n \"dclm\": 0.8699353337287903,\n \"english\": 0.00001446999976906227,\n \"fineweb_edu_approx\": 2.458214282989502,\n \"eai_general_math\": -0.0000071499998739454895,\n \"eai_open_web_math\": 0.18364053964614868,\n \"eai_web_code\": 0.7470982074737549\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.1\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"labels\": {\n \"level_1\": \"\",\n \"level_2\": \"\",\n \"level_3\": \"\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Code/Software\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"23\",\n \"label\": \"Tutorial\"\n },\n \"secondary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192837,"cells":{"id":{"kind":"number","value":-8748105618725765000,"string":"-8,748,105,618,725,765,000"},"text":{"kind":"string","value":"MySQL Forums\nForum List  »  Optimizer & Parser\n\nDouble Index Performance\nPosted by: Jawad Laraqui\nDate: January 12, 2006 02:21PM\n\nHey,\n\nI have a table of posts for different users and I want to pull out the date of the last post for the users in the most efficient way possible. I have tried many things but I don't know which one actually performs the best. This is for an extremely high concurrency application so I'm really looking for the absolutely best performance: doing a scan in memory of the index is not good enough. I really want to set it up so that MySQL finds the answer in one shot without cursing around indexes.\n\nTake the following example table:\n\nCREATE TABLE `Person_Test` (\n`PersonId` int(11) NOT NULL default '0',\n`PostBody` text,\n`PostDate` datetime default NULL,\nKEY `PersonId` (`PersonId`,`PostDate` DESC)\n) ENGINE=MyISAM\n\nPut Some dummy data inside:\nINSERT INTO Person_Test (PersonId, PostBody, PostDate) VALUES ('1','Hello\nMysql',now());\nINSERT INTO Person_Test (PersonId, PostBody, PostDate) VALUES ('1','How are\nyou',now());\nINSERT INTO Person_Test (PersonId, PostBody, PostDate) VALUES ('1','I\\'m\nGood',now());\n\nTable looks like this:\nmysql> SELECT * FROM Person_Test;\n+----------+-------------+---------------------+\n| PersonId | PostBody | PostDate |\n+----------+-------------+---------------------+\n| 1 | Hello Mysql | 2006-01-05 15:57:22 |\n| 1 | How are you | 2006-01-05 15:57:28 |\n| 1 | I'm Good | 2006-01-05 15:57:39 |\n+----------+-------------+---------------------+\n3 rows in set (0.00 sec)\n\nI want to get the date of the latest post:\n\nSELECT PostDate FROM Person_Test where PersonId=1 ORDER BY PostDate DESC LIMIT 1\n\npros: simplest SQL statement to do the job\ncons: probably does a scan of the whole index for PersonId to get to the end of his section, then grabs the last element; this is not so great if it's true because the person could have a lot of posts. I don't want it to scan, even though it's in memory because it takes too long on a system where there a lots of users trying to do the same thing.\n\nDoes anyone know if there is a better way to implement this using HANDLER?\n\nTHanks\nJawad\n\nOptions: ReplyQuote\n\n\nSubject\nViews\nWritten By\nPosted\nDouble Index Performance\n7845\nJanuary 12, 2006 02:21PM\n3028\nJanuary 13, 2006 05:18PM\n2623\nJanuary 16, 2006 06:24AM\n2687\nJanuary 16, 2006 08:46AM\n2337\nJanuary 17, 2006 06:45AM\n2531\nFebruary 01, 2006 01:05PM\n\n\nSorry, you can't reply to this topic. It has been closed.\n\nContent reproduced on this site is the property of the respective copyright holders. It is not reviewed in advance by Oracle and does not necessarily represent the opinion of Oracle or any other party."},"metadata":{"kind":"string","value":"{\n \"url\": \"https://forums.mysql.com/read.php?115,63892,63892\",\n \"source_domain\": \"forums.mysql.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2019-35\",\n \"warc_metadata\": {\n \"Content-Length\": \"23554\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:LNWNB5TPBBXNFCGRDLPW6LDCQ73U7WL7\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2019-08-21T22:23:03Z\",\n \"WARC-IP-Address\": \"137.254.60.13\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:E57GHXWGCHG6A4Q4ZFWQUPKNDZYCNGAI\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://forums.mysql.com/read.php?115,63892,63892\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"isPartOf: CC-MAIN-2019-35\\r\\npublisher: Common Crawl\\r\\ndescription: Wide crawl of the web for August 2019\\r\\noperator: Common Crawl Admin (info@commoncrawl.org)\\r\\nhostname: ip-10-67-67-214.ec2.internal\\r\\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\\r\\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\\r\\nformat: WARC File Format 1.1\\r\\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 13,\n 47,\n 48,\n 73,\n 98,\n 129,\n 130,\n 135,\n 136,\n 630,\n 631,\n 665,\n 666,\n 695,\n 736,\n 753,\n 787,\n 831,\n 847,\n 848,\n 876,\n 950,\n 965,\n 1041,\n 1054,\n 1127,\n 1141,\n 1142,\n 1165,\n 1199,\n 1248,\n 1283,\n 1332,\n 1374,\n 1416,\n 1455,\n 1504,\n 1529,\n 1530,\n 1573,\n 1574,\n 1655,\n 1656,\n 1699,\n 2048,\n 2049,\n 2124,\n 2125,\n 2132,\n 2138,\n 2139,\n 2159,\n 2160,\n 2161,\n 2169,\n 2175,\n 2186,\n 2193,\n 2218,\n 2223,\n 2248,\n 2253,\n 2278,\n 2283,\n 2308,\n 2313,\n 2338,\n 2343,\n 2368,\n 2373,\n 2399,\n 2400,\n 2401,\n 2459,\n 2460\n ],\n \"line_end_idx\": [\n 13,\n 47,\n 48,\n 73,\n 98,\n 129,\n 130,\n 135,\n 136,\n 630,\n 631,\n 665,\n 666,\n 695,\n 736,\n 753,\n 787,\n 831,\n 847,\n 848,\n 876,\n 950,\n 965,\n 1041,\n 1054,\n 1127,\n 1141,\n 1142,\n 1165,\n 1199,\n 1248,\n 1283,\n 1332,\n 1374,\n 1416,\n 1455,\n 1504,\n 1529,\n 1530,\n 1573,\n 1574,\n 1655,\n 1656,\n 1699,\n 2048,\n 2049,\n 2124,\n 2125,\n 2132,\n 2138,\n 2139,\n 2159,\n 2160,\n 2161,\n 2169,\n 2175,\n 2186,\n 2193,\n 2218,\n 2223,\n 2248,\n 2253,\n 2278,\n 2283,\n 2308,\n 2313,\n 2338,\n 2343,\n 2368,\n 2373,\n 2399,\n 2400,\n 2401,\n 2459,\n 2460,\n 2661\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 2661,\n \"ccnet_original_nlines\": 75,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.30344828963279724,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.07586207240819931,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.3327586054801941,\n \"rps_doc_frac_unique_words\": 0.5490196347236633,\n \"rps_doc_mean_word_length\": 4.666666507720947,\n \"rps_doc_num_sentences\": 12,\n \"rps_doc_symbol_to_word_ratio\": 0,\n \"rps_doc_unigram_entropy\": 5.08125114440918,\n \"rps_doc_word_count\": 408,\n \"rps_doc_frac_chars_dupe_10grams\": 0,\n \"rps_doc_frac_chars_dupe_5grams\": 0.07878150790929794,\n \"rps_doc_frac_chars_dupe_6grams\": 0.07878150790929794,\n \"rps_doc_frac_chars_dupe_7grams\": 0.07878150790929794,\n \"rps_doc_frac_chars_dupe_8grams\": 0,\n \"rps_doc_frac_chars_dupe_9grams\": 0,\n \"rps_doc_frac_chars_top_2gram\": 0.01313025038689375,\n \"rps_doc_frac_chars_top_3gram\": 0.054621849209070206,\n \"rps_doc_frac_chars_top_4gram\": 0.0714285671710968,\n \"rps_doc_books_importance\": -319.9994201660156,\n \"rps_doc_books_importance_length_correction\": -319.9994201660156,\n \"rps_doc_openwebtext_importance\": -179.87747192382812,\n \"rps_doc_openwebtext_importance_length_correction\": -179.87747192382812,\n \"rps_doc_wikipedia_importance\": -159.85707092285156,\n \"rps_doc_wikipedia_importance_length_correction\": -159.85707092285156\n },\n \"fasttext\": {\n \"dclm\": 0.20141267776489258,\n \"english\": 0.8770915865898132,\n \"fineweb_edu_approx\": 1.0487645864486694,\n \"eai_general_math\": 0.20876669883728027,\n \"eai_open_web_math\": 0.17999804019927979,\n \"eai_web_code\": 0.5878605246543884\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.746\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"005.1\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Social/Forum\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Code/Software\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"18\",\n \"label\": \"Q&A Forum\"\n },\n \"secondary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Graduate/Expert Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192838,"cells":{"id":{"kind":"number","value":-6246427717259548000,"string":"-6,246,427,717,259,548,000"},"text":{"kind":"string","value":"Deprecated in HTML5. Do not use.\n\nHow to Use Tags in Your HTML Code\n\nSharing is caring!\n\nElement of\nHow To Use Tags In HTML\nWhat does How to Use Tags in Your HTML Code do?\nThe element was used to break a single browser window into multiple independent browsing contexts. Frames have been deprecated and should not used by modern websites.\nDisplay\nblock\nUsage\nstructural\n\nvs.\n\nFrames provided a way to split the browser window into several individual browsing contexts, each displaying an independent HTML document. You probably suffered through a number of poorly-designed frame-based websites if you spent any time online in the early part of the 21st century. The most common design pattern that used “ elements was a menu-and-display panel approach that reloaded some content in a frame as you clicked on menu items (all without the URL in your navigation bar changing, making it impossible to link to any particular view).\n\nFrames are now deprecated in HTML5, but the ability to place one document inside another still exists. You can do this in an [](/tags/iframe/). And it is important to realize that is not simply a renamed or updated version of . An is an “inline” frame (or, some would call it, and “internal frame). This does not split the browser window into separate contexts but rather embeds one document into another.\n\nAdam is a technical writer who specializes in developer documentation and tutorials."},"metadata":{"kind":"string","value":"{\n \"url\": \"https://html.com/tags/frame/\",\n \"source_domain\": \"html.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2019-30\",\n \"warc_metadata\": {\n \"Content-Length\": \"119743\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:AISMBDWFMJBLFBG6CKUG23BQO3ZEEAN5\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2019-07-21T23:23:50Z\",\n \"WARC-IP-Address\": \"104.27.137.90\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:SYVOQMI2W26CW5H45OZBMPUWQXB4E533\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://html.com/tags/frame/\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"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 (info@commoncrawl.org)\\r\\nhostname: ip-10-157-146-93.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/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 33,\n 34,\n 76,\n 77,\n 96,\n 97,\n 108,\n 140,\n 196,\n 371,\n 379,\n 385,\n 391,\n 402,\n 403,\n 407,\n 408,\n 959,\n 960,\n 1366,\n 1367\n ],\n \"line_end_idx\": [\n 33,\n 34,\n 76,\n 77,\n 96,\n 97,\n 108,\n 140,\n 196,\n 371,\n 379,\n 385,\n 391,\n 402,\n 403,\n 407,\n 408,\n 959,\n 960,\n 1366,\n 1367,\n 1451\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 1451,\n \"ccnet_original_nlines\": 21,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.38327527046203613,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.024390239268541336,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.1428571343421936,\n \"rps_doc_frac_unique_words\": 0.5619834661483765,\n \"rps_doc_mean_word_length\": 4.785123825073242,\n \"rps_doc_num_sentences\": 16,\n \"rps_doc_symbol_to_word_ratio\": 0,\n \"rps_doc_unigram_entropy\": 4.6454901695251465,\n \"rps_doc_word_count\": 242,\n \"rps_doc_frac_chars_dupe_10grams\": 0,\n \"rps_doc_frac_chars_dupe_5grams\": 0.11312607675790787,\n \"rps_doc_frac_chars_dupe_6grams\": 0.06994818896055222,\n \"rps_doc_frac_chars_dupe_7grams\": 0.05354059115052223,\n \"rps_doc_frac_chars_dupe_8grams\": 0.05354059115052223,\n \"rps_doc_frac_chars_dupe_9grams\": 0.05354059115052223,\n \"rps_doc_frac_chars_top_2gram\": 0.012953369878232479,\n \"rps_doc_frac_chars_top_3gram\": 0.020725389942526817,\n \"rps_doc_frac_chars_top_4gram\": 0.03367875888943672,\n \"rps_doc_books_importance\": -139.68325805664062,\n \"rps_doc_books_importance_length_correction\": -135.4318084716797,\n \"rps_doc_openwebtext_importance\": -73.22074127197266,\n \"rps_doc_openwebtext_importance_length_correction\": -73.22074127197266,\n \"rps_doc_wikipedia_importance\": -59.825443267822266,\n \"rps_doc_wikipedia_importance_length_correction\": -51.25425338745117\n },\n \"fasttext\": {\n \"dclm\": 0.07575107365846634,\n \"english\": 0.8972416520118713,\n \"fineweb_edu_approx\": 2.662940740585327,\n \"eai_general_math\": 0.19922053813934326,\n \"eai_open_web_math\": 0.10723245143890381,\n \"eai_web_code\": 0.404634952545166\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.4\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"labels\": {\n \"level_1\": \"\",\n \"level_2\": \"\",\n \"level_3\": \"\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"23\",\n \"label\": \"Tutorial\"\n },\n \"secondary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192839,"cells":{"id":{"kind":"number","value":-2136189808273589000,"string":"-2,136,189,808,273,589,000"},"text":{"kind":"string","value":"Skip to main content\n\nRepair information on hard drives or hard disks. Hard drives are magnetic data storage devices. They are used in most desktop, laptop, and server due to their low cost and high data density.\n\n108 Vragen Bekijk alle\n\nHow to recover files from broken toshiba HDD?\n\nI have a toshiba HDD but it was broken, i just want to recover all my files. what will i do recover my files?\n\nAnswered! View the answer I have this problem too\n\nIs this a good question?\n\nScore 7\n\nCommentaar:\n\nWhat is broken on your drive? What are the symptoms, and what have you tried?\n\nby\n\nDoes this drive can be recognized by windows? You could go to windows disk management to see whether it is displayed there and what is the status..\n\nHave you tried some data recovery software? Like TestDisk it is a freeware.\n\nby\n\nIts not connecting to usb port and ive tried multiple wires and ports\n\nby\n\nVoeg een opmerking toe\n\nAndroid Fix Kits\n\nSlechts één reparatie scheidt jou van een nieuw scherm of een nieuwe batterij.\n\nNu winkelen\n\nAndroid Fix Kits\n\nSlechts één reparatie scheidt jou van een nieuw scherm of een nieuwe batterij.\n\nNu winkelen\n\n5 Antwoorden\n\nChosen Solution\n\nThere is one way that you can try at home. See if you can get the PCB for that same drive. Sometimes you can get those from ebay.com and even other sources. You may have to do a comprehensive search based on the model number of your drive. Once you have it, replace the PCB and start to recover the files. This will only work if the failure of your drive is caused by an element on the PCB. If it is caused by an internal part, i.e. Platter, read/write heads, or the head actuator, you wont fix it at home. There is also a possibility that it could be the drive motor. The only other way would be to recover your files through one of the many commercial services. This is usually costly and would depend on the importance of your files. Hope this helps to get you started in the right direction.\n\nWas this answer helpful?\n\nScore 4\n\nCommentaar:\n\nactually my brother drop the hdd (external hdd toshiba 320gb) while transfering some files. is there a way for me to recover other files?\n\nby\n\nDoes the drive still respond? What drive is it and I assume that it connects via USB? Have you looked at the actually drive and the enclosure separate?\n\nby\n\nIf the drive was in use when your brother dropped it the mechanical systems most likely got damaged (head assembly & platters). What happens here is the heads dig-in to the platters both getting damaged. Some laptops have special sensors to park the heads before the system hits the ground. Sorry to say I don't know of any external HD's that have this technology. If they did the minor bumps these drives get wouldn't kill them (makes no difference on the physical size of the drive 2.5 or 3.5 all are susceptible). SSD's on the other hand can be banged into walls and dropped many stories without a worry which is one reason they are becoming the ideal choice for portable storage.\n\nby\n\nVoeg een opmerking toe\n\nI've used a usb to ide/sata drive adapter on lots of drives that won't boot or have the \"tick of death\" to copy off files.\n\nIt may not work 100% of the time, but, I've managed to recover data on probably 8 out of 10 drives.\n\nWas this answer helpful?\n\nScore 2\n\nCommentaar:\n\nBtw, I typically use Ubuntu or Knoppix to copy off the files. In the past I've had windows boot cd's give me copy errors.\n\nby\n\nIf nothing else, you may try SpinRite. It's an oldie, but a good program. It may not be quick, I've heard of a couple occasions it can run 48 hours, but it does a sector by sector recovery.\n\nBe sure to post back if you resolved your problem, it helps others that may be search the web for solutions to land on iFixit.\n\nGood luck!!\n\nby\n\nHi, I tried using a usb to ide/sata drive adapter on my Toshiba Stor.E (Model No. HDWC130EW3J1 )3TB External Hard Drive to recover data as you suggested, One good thing was the drive fired up and windows recognised it but unfortunately I could not get to the data as it said I needed to format the drive which I do not wish to do, the main problem with the drive is it will not power up due to the faulty pcb controller board.\n\nby\n\nINVESTIGATE USB, AND OR CORD I FIXED MINE WHEN I READ ABOUT SOMEONE ELSE HAD A CRUSHED usb PART AND GOT A NEW USB. I REMEMBERED MY MP3 HAD A SIMILAR USB CORD AND FOUND THAT WHEN I EXCHANGED THEM THEY BOTH WORKED PROPERLY AGAIN. I HAD MIXED THEM UP LAST YEAR WHEN A BUNCH OF CORDS WERE BEHIND MY COMPUTER.\n\nby\n\nVoeg een opmerking toe\n\nIf your computer cannot boot due to the crashed hard drive, remove and connect it to another Windows computer. Check if you can access to the Windows system and the hard drive can be detected. If the hard drive can be detected but you can’t access to your data on it, you can retrieve data from crashed hard drive with hard drive data recovery tool.\n\nWas this answer helpful?\n\nScore 0\nVoeg een opmerking toe\n\nSee dear any type of physical stress like dropping causes problem in the mechanical components of the drive. And when the mechanical components experiences any kind of physical stress then the hard drive gets physically damaged making the stored data inaccessible. But you need not to worry you just need not to tamper with the hard drive and consult a hard drive recovery expert as soon as possible. These experts will recover your data in a secure manner.\n\nWas this answer helpful?\n\nScore 0\nVoeg een opmerking toe\n\nI lost my laptop computer and only have my hard drive how do I recover my information stored on it\n\nWas this answer helpful?\n\nScore 0\nVoeg een opmerking toe\n\nAdd your answer\n\nPaul will be eternally grateful.\nBekijk statistieken:\n\nAfgelopen 24 uren: 5\n\nAfgelopen 7 dagen: 30\n\nAfgelopen 30 dagen: 117\n\nAller tijden: 26,608"},"metadata":{"kind":"string","value":"{\n \"url\": \"https://nl.ifixit.com/Answers/View/84463/How+to+recover+files+from+broken+toshiba+HDD\",\n \"source_domain\": \"nl.ifixit.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2019-47\",\n \"warc_metadata\": {\n \"Content-Length\": \"120451\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:7IHSHJ6WLY53IJQFN7N2CSIXK3CLMITF\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2019-11-11T20:22:21Z\",\n \"WARC-IP-Address\": \"75.101.159.182\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:HLTKUBZP5XVKHCKOYPJ7Y7PKK4MICUEE\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://nl.ifixit.com/Answers/View/84463/How+to+recover+files+from+broken+toshiba+HDD\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"isPartOf: CC-MAIN-2019-47\\r\\npublisher: Common Crawl\\r\\ndescription: Wide crawl of the web for November 2019\\r\\noperator: Common Crawl Admin (info@commoncrawl.org)\\r\\nhostname: ip-10-67-67-153.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/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 21,\n 22,\n 213,\n 214,\n 237,\n 238,\n 284,\n 285,\n 395,\n 396,\n 446,\n 447,\n 472,\n 473,\n 481,\n 482,\n 494,\n 495,\n 573,\n 574,\n 577,\n 578,\n 726,\n 727,\n 803,\n 804,\n 807,\n 808,\n 878,\n 879,\n 882,\n 883,\n 906,\n 907,\n 924,\n 925,\n 1004,\n 1005,\n 1017,\n 1018,\n 1035,\n 1036,\n 1115,\n 1116,\n 1128,\n 1129,\n 1142,\n 1143,\n 1159,\n 1160,\n 1956,\n 1957,\n 1982,\n 1983,\n 1991,\n 1992,\n 2004,\n 2005,\n 2143,\n 2144,\n 2147,\n 2148,\n 2300,\n 2301,\n 2304,\n 2305,\n 2989,\n 2990,\n 2993,\n 2994,\n 3017,\n 3018,\n 3141,\n 3142,\n 3242,\n 3243,\n 3268,\n 3269,\n 3277,\n 3278,\n 3290,\n 3291,\n 3413,\n 3414,\n 3417,\n 3418,\n 3608,\n 3609,\n 3736,\n 3737,\n 3749,\n 3750,\n 3753,\n 3754,\n 4181,\n 4182,\n 4185,\n 4186,\n 4491,\n 4492,\n 4495,\n 4496,\n 4519,\n 4520,\n 4870,\n 4871,\n 4896,\n 4897,\n 4905,\n 4928,\n 4929,\n 5387,\n 5388,\n 5413,\n 5414,\n 5422,\n 5445,\n 5446,\n 5545,\n 5546,\n 5571,\n 5572,\n 5580,\n 5603,\n 5604,\n 5620,\n 5621,\n 5654,\n 5675,\n 5676,\n 5697,\n 5698,\n 5720,\n 5721,\n 5745,\n 5746\n ],\n \"line_end_idx\": [\n 21,\n 22,\n 213,\n 214,\n 237,\n 238,\n 284,\n 285,\n 395,\n 396,\n 446,\n 447,\n 472,\n 473,\n 481,\n 482,\n 494,\n 495,\n 573,\n 574,\n 577,\n 578,\n 726,\n 727,\n 803,\n 804,\n 807,\n 808,\n 878,\n 879,\n 882,\n 883,\n 906,\n 907,\n 924,\n 925,\n 1004,\n 1005,\n 1017,\n 1018,\n 1035,\n 1036,\n 1115,\n 1116,\n 1128,\n 1129,\n 1142,\n 1143,\n 1159,\n 1160,\n 1956,\n 1957,\n 1982,\n 1983,\n 1991,\n 1992,\n 2004,\n 2005,\n 2143,\n 2144,\n 2147,\n 2148,\n 2300,\n 2301,\n 2304,\n 2305,\n 2989,\n 2990,\n 2993,\n 2994,\n 3017,\n 3018,\n 3141,\n 3142,\n 3242,\n 3243,\n 3268,\n 3269,\n 3277,\n 3278,\n 3290,\n 3291,\n 3413,\n 3414,\n 3417,\n 3418,\n 3608,\n 3609,\n 3736,\n 3737,\n 3749,\n 3750,\n 3753,\n 3754,\n 4181,\n 4182,\n 4185,\n 4186,\n 4491,\n 4492,\n 4495,\n 4496,\n 4519,\n 4520,\n 4870,\n 4871,\n 4896,\n 4897,\n 4905,\n 4928,\n 4929,\n 5387,\n 5388,\n 5413,\n 5414,\n 5422,\n 5445,\n 5446,\n 5545,\n 5546,\n 5571,\n 5572,\n 5580,\n 5603,\n 5604,\n 5620,\n 5621,\n 5654,\n 5675,\n 5676,\n 5697,\n 5698,\n 5720,\n 5721,\n 5745,\n 5746,\n 5766\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 5766,\n \"ccnet_original_nlines\": 136,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.394540935754776,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.07113316655158997,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.12655086815357208,\n \"rps_doc_frac_unique_words\": 0.3827977180480957,\n \"rps_doc_mean_word_length\": 4.26654052734375,\n \"rps_doc_num_sentences\": 72,\n \"rps_doc_symbol_to_word_ratio\": 0,\n \"rps_doc_unigram_entropy\": 5.380744934082031,\n \"rps_doc_word_count\": 1058,\n \"rps_doc_frac_chars_dupe_10grams\": 0.07022596150636673,\n \"rps_doc_frac_chars_dupe_5grams\": 0.11829862743616104,\n \"rps_doc_frac_chars_dupe_6grams\": 0.09326539933681488,\n \"rps_doc_frac_chars_dupe_7grams\": 0.08218874782323837,\n \"rps_doc_frac_chars_dupe_8grams\": 0.07022596150636673,\n \"rps_doc_frac_chars_dupe_9grams\": 0.07022596150636673,\n \"rps_doc_frac_chars_top_2gram\": 0.019937969744205475,\n \"rps_doc_frac_chars_top_3gram\": 0.02126717008650303,\n \"rps_doc_frac_chars_top_4gram\": 0.025254759937524796,\n \"rps_doc_books_importance\": -473.2198791503906,\n \"rps_doc_books_importance_length_correction\": -473.2198791503906,\n \"rps_doc_openwebtext_importance\": -264.44952392578125,\n \"rps_doc_openwebtext_importance_length_correction\": -264.44952392578125,\n \"rps_doc_wikipedia_importance\": -107.29258728027344,\n \"rps_doc_wikipedia_importance_length_correction\": -107.29258728027344\n },\n \"fasttext\": {\n \"dclm\": 0.2839435935020447,\n \"english\": 0.8666688203811646,\n \"fineweb_edu_approx\": 1.7671828269958496,\n \"eai_general_math\": 0.08440917730331421,\n \"eai_open_web_math\": 0.38861578702926636,\n \"eai_web_code\": 0.07173097133636475\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"004.6\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n },\n \"secondary\": {\n \"code\": \"005.72\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Social/Forum\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n },\n \"secondary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Click Here References\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"18\",\n \"label\": \"Q&A Forum\"\n },\n \"secondary\": {\n \"code\": \"21\",\n \"label\": \"Customer Support\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n },\n \"secondary\": {\n \"code\": \"1\",\n \"label\": \"General Audience\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192840,"cells":{"id":{"kind":"number","value":-7777809050352729000,"string":"-7,777,809,050,352,729,000"},"text":{"kind":"string","value":"Overview\n\nBackground\n\nPython is a popular all-purpose scripting language, while R (an open source implementation of the S/Splus language) is a scripting language mostly popular for data analysis, statistics, and graphics. If you are reading this, there are good chances that you are at least familiar with one or both.\n\nHaving an interface between both languages to benefit from the libraries of one language while working in the other appeared desirable; an early option to achieve it was the RSPython project, itself part of the Omegahat project.\n\nA bit later, the RPy project appeared and focused on providing simple and robust access to R from within Python, with the initial Unix-only releases quickly followed by Microsoft and MacOS compatible versions. This project is referred to as RPy-1.x in the rest of this document.\n\nThe present documentation describes RPy2, an evolution of RPy-1.x. Naturally RPy2 is inspired by RPy, but also by Alexander Belopolsky’s contributions that were waiting to be included into RPy.\n\nThis effort can be seen as a redesign and rewrite of the RPy package, and this unfortunately means there is not enough left in common to ensure compatibility.\n\nInstallation\n\nDocker image\n\nThere are few Docker images available to try rpy2 out without even reading about requirements (e.g., R installed compiled with the shared library flag). The Docker images can also be an easy start for Windows users.\n\nMore information is available here: https://github.com/rpy2/rpy2-docker\n\nRequirements\n\nCurrently the development is done on UNIX-like operating systems with the following software versions. Those are the recommended versions to run rpy2 with.\n\nSoftware\n\nVersions\n\nPython\n\n>=3.7\n\nR\n\n>=4.0\n\nRunning Rpy2 will require compiled libraries for R, Python, and readline; building rpy2 will require the corresponding development headers (check the documentation for more information about builing rpy2).\n\nNote\n\nRunning rpy2 on Windows is currently not supported although relative success was recently reported with the lastest in the 3.3.x series.\n\nAlternative Python implementations\n\nCPython is the target implementation, and because of presence of C code in rpy2 is it currently not possible to run the package on Jython. For that same reason, running it with Pypy is expected to require some effort.\n\nUpgrading from an older release of rpy2\n\nIn order to upgrade one will have to first remove older installed rpy2 packages then and only then install a version of rpy2.\n\nTo do so, or to check whether you have an earlier version of rpy2 installed, do the following in a Python console:\n\nimport rpy2\nrpy2.__path__\n\nAn error during execution means that you do not have any older version of rpy2 installed and you should proceed to the next section.\n\nIf this returns a string containing a path, you should go to that path and remove all files and directories starting with rpy2. To make sure that the cleaning is complete, open a new Python session and check that the above code results in an error.\n\nDownload\n\nThe following options are available for download:\n\n • Source packages. Released versions are available on Pypi (Sourceforge is no longer used). Snapshots of the development version can be downloaded from github\n\n Note\n\n The repository on bitbucket has several release branches starting with v.\n\n • Pre-compiled binary packages for\n\n • Apple’s MacOS X are now also available on pypi\n\n • Linux distributions are sometimes available. Check with your distribution\n\nLinux precompiled binaries\n\nLinux distribution have packaging systems, and rpy2 is present in a number of them, either as a pre-compiled package or a source package compiled on-the-fly.\n\nNote\n\nThose versions will often be older than the latest rpy2 release.\n\nKnown distributions are: Debian and related (such as Ubuntu - often the most recent thanks to Dirk Eddelbuettel), Suse, RedHat, Mandrake, Gentoo.\n\nOS X (MacOS) precompiled binaries\n\nrpy2 is in Macports, Homebrew, and Fink. Binary are now also availabe on pypi.\n\nInstall from source\n\neasy_install and pip\n\nThe source package is on the PYthon Package Index (PYPI), and the pip or easy_install scripts can be used whenever available. The shell command will then just be:\n\n# minimal\npip install rpy2\n\n# or\n# to run tests\npip install rpy2[test]\n\n# or\n# all dependencies\npip install rpy2[all]\n\nUpgrading an existing installation is done with:\n\n # recommended:\npip install rpy2 --upgrade\n\nBoth utilities have a list of options and their respective documentation should be checked for details.\n\nNote\n\nStarting with rpy2 3.2.0, rpy2 can built and used with cffi’s ABI or API modes (releases 3.0.x and 3.1.x were using the ABI mode exclusively). At the time of writing the default is still the ABI mode but the choice can be controlled through the environment variable RPY2_CFFI_MODE. If set, possible values are ABI (default if the environment variable is not set), API, or BOTH. When the latter, both API and ABI modes are built, and the choice of which one to use can be made at run time.\n\nsource archive\n\nTo install from a downloaded source archive , do in a shell:\n\ntar -xzf .tar.gz\ncd \n\n\npython setup.py build install\n# or\npip install .\n# or (to install requirements to test\npip install .[test]\n\nThis will build the package, guessing the R HOME from the R executable found in the PATH.\n\nCompiling on Linux\n\nGiven that you have the libraries and development headers listed above, this should be butter smooth.\n\nThe most frequent errors seem to be because of missing headers.\n\nCompiling on OS X\n\nXCode tools will be required in order to build rpy2 in API mode. Please refer to the documentation on the Apple site for more details about what they are and how to install them.\n\nTest an installation\n\nAn installation can be tested for functionalities, and whenever necessary the different layers constituting the packages can be tested independently.\n\npytest --pyargs 'rpy2.tests'\n\nThe documentation for pytest should be consulted to customize how tests are run.\n\nContents\n\nThe package is made of several sub-packages or modules:\n\nrpy2.rinterface\n\nLow-level interface to R, when speed and flexibility matter most. Close to R’s C-level API.\n\nrpy2.robjects\n\nHigh-level interface, when ease-of-use matters most. Should be the right pick for casual and general use. Based on the previous one.\n\nrpy2.interactive\n\nHigh-level interface, with an eye for interactive work. Largely based on rpy2.robjects.\n\nrpy2.rlike\n\nData structures and functions to mimic some of R’s features and specificities in pure Python (no embedded R process).\n\nDesign notes\n\nWhen designing rpy2, attention was given to:\n\n • render the use of the module simple from both a Python or R user’s perspective,\n\n • minimize the need for knowledge about R, and the need for tricks and workarounds,\n\n • allow to customize a lot while remaining at the Python level (without having to go down to C-level).\n\nrpy2.robjects implements an extension to the interface in rpy2.rinterface by extending the classes for R objects defined there with child classes.\n\nThe choice of inheritance was made to facilitate the implementation of mostly inter-exchangeable classes between rpy2.rinterface and rpy2.robjects. For example, an rpy2.rinterface.SexpClosure can be given any rpy2.robjects.RObject as a parameter while any rpy2.robjects.Function can be given any rpy2.rinterface.Sexp. Because of R’s functional basis, a container-like extension is also present.\n\nHowever, inheritance is not the only choice. Any custome class implementing the interface rpy2.rinterface.SupportsSEXP can integrate seamlessly and be used with the rest of rpy2.\n\nAcknowledgements\n\nAcknowledgements for contributions, support, and early testing go to (alphabetical order):\n\nPhilipp A., Alexander Belopolsky, Dan Brown, Beau Bruce, Brad Buran, Erik Cederstrand, Brad Chapman, Evgeny Cherkashin, Dav Clark, Peter Cock, Michaël Defferrard, Dirk Eddelbuettel, Isuru Fernando, Daniel Ge, Christoph Gohlke, Dale Jung, Thomas Kluyver, David Koppstein, Michał Krassowski, Antony Lee, Kenneth Lyons, Mikolaj Magnuski, Gijs Molenaar, Walter Moreira, Laurent Oget, Pablo Oliveira, John Owens, Fabian Philips, Andrey Portnoy, Nicolas Rapin, Brad Reisfeld, Joon Ro, Andy Shapiro, Justin Shenk, Grzegorz Slodkowicz, Joan Smith, Nathaniel J. Smith, Jeff Tratner, Gregory Warnes, Liang-Bo Wang, as well as the JRI author(s), the R authors, R-help list responders, Numpy list responders, and other contributors."},"metadata":{"kind":"string","value":"{\n \"url\": \"https://rpy2.github.io/doc/latest/html/overview.html\",\n \"source_domain\": \"rpy2.github.io\",\n \"snapshot_id\": \"crawl=CC-MAIN-2021-31\",\n \"warc_metadata\": {\n \"Content-Length\": \"25343\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:DU6ZLQ7C6JMFVSA2BDAGYQERYEFK5GD4\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2021-07-24T10:42:10Z\",\n \"WARC-IP-Address\": \"185.199.108.153\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:UJHW3SHWJGEB6BKANYEGCJ5MUUMVDT3N\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://rpy2.github.io/doc/latest/html/overview.html\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"isPartOf: CC-MAIN-2021-31\\r\\npublisher: Common Crawl\\r\\ndescription: Wide crawl of the web for July/August 2021\\r\\noperator: Common Crawl Admin (info@commoncrawl.org)\\r\\nhostname: ip-10-67-67-204.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/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 9,\n 10,\n 21,\n 22,\n 319,\n 320,\n 549,\n 550,\n 829,\n 830,\n 1024,\n 1025,\n 1184,\n 1185,\n 1198,\n 1199,\n 1212,\n 1213,\n 1429,\n 1430,\n 1502,\n 1503,\n 1516,\n 1517,\n 1673,\n 1674,\n 1683,\n 1684,\n 1693,\n 1694,\n 1701,\n 1702,\n 1708,\n 1709,\n 1711,\n 1712,\n 1718,\n 1719,\n 1925,\n 1926,\n 1931,\n 1932,\n 2069,\n 2070,\n 2105,\n 2106,\n 2324,\n 2325,\n 2365,\n 2366,\n 2492,\n 2493,\n 2608,\n 2609,\n 2621,\n 2635,\n 2636,\n 2769,\n 2770,\n 3019,\n 3020,\n 3029,\n 3030,\n 3080,\n 3081,\n 3242,\n 3243,\n 3252,\n 3253,\n 3331,\n 3332,\n 3369,\n 3370,\n 3423,\n 3424,\n 3504,\n 3505,\n 3532,\n 3533,\n 3691,\n 3692,\n 3697,\n 3698,\n 3763,\n 3764,\n 3910,\n 3911,\n 3945,\n 3946,\n 4025,\n 4026,\n 4046,\n 4047,\n 4068,\n 4069,\n 4232,\n 4233,\n 4243,\n 4260,\n 4261,\n 4266,\n 4281,\n 4304,\n 4305,\n 4310,\n 4329,\n 4351,\n 4352,\n 4401,\n 4402,\n 4423,\n 4450,\n 4451,\n 4555,\n 4556,\n 4561,\n 4562,\n 5051,\n 5052,\n 5067,\n 5068,\n 5142,\n 5143,\n 5173,\n 5190,\n 5191,\n 5192,\n 5222,\n 5227,\n 5241,\n 5279,\n 5299,\n 5300,\n 5390,\n 5391,\n 5410,\n 5411,\n 5513,\n 5514,\n 5578,\n 5579,\n 5597,\n 5598,\n 5777,\n 5778,\n 5799,\n 5800,\n 5950,\n 5951,\n 5980,\n 5981,\n 6062,\n 6063,\n 6072,\n 6073,\n 6129,\n 6130,\n 6146,\n 6147,\n 6239,\n 6240,\n 6254,\n 6255,\n 6388,\n 6389,\n 6406,\n 6407,\n 6495,\n 6496,\n 6507,\n 6508,\n 6626,\n 6627,\n 6640,\n 6641,\n 6686,\n 6687,\n 6771,\n 6772,\n 6858,\n 6859,\n 6964,\n 6965,\n 7112,\n 7113,\n 7508,\n 7509,\n 7688,\n 7689,\n 7706,\n 7707,\n 7798,\n 7799\n ],\n \"line_end_idx\": [\n 9,\n 10,\n 21,\n 22,\n 319,\n 320,\n 549,\n 550,\n 829,\n 830,\n 1024,\n 1025,\n 1184,\n 1185,\n 1198,\n 1199,\n 1212,\n 1213,\n 1429,\n 1430,\n 1502,\n 1503,\n 1516,\n 1517,\n 1673,\n 1674,\n 1683,\n 1684,\n 1693,\n 1694,\n 1701,\n 1702,\n 1708,\n 1709,\n 1711,\n 1712,\n 1718,\n 1719,\n 1925,\n 1926,\n 1931,\n 1932,\n 2069,\n 2070,\n 2105,\n 2106,\n 2324,\n 2325,\n 2365,\n 2366,\n 2492,\n 2493,\n 2608,\n 2609,\n 2621,\n 2635,\n 2636,\n 2769,\n 2770,\n 3019,\n 3020,\n 3029,\n 3030,\n 3080,\n 3081,\n 3242,\n 3243,\n 3252,\n 3253,\n 3331,\n 3332,\n 3369,\n 3370,\n 3423,\n 3424,\n 3504,\n 3505,\n 3532,\n 3533,\n 3691,\n 3692,\n 3697,\n 3698,\n 3763,\n 3764,\n 3910,\n 3911,\n 3945,\n 3946,\n 4025,\n 4026,\n 4046,\n 4047,\n 4068,\n 4069,\n 4232,\n 4233,\n 4243,\n 4260,\n 4261,\n 4266,\n 4281,\n 4304,\n 4305,\n 4310,\n 4329,\n 4351,\n 4352,\n 4401,\n 4402,\n 4423,\n 4450,\n 4451,\n 4555,\n 4556,\n 4561,\n 4562,\n 5051,\n 5052,\n 5067,\n 5068,\n 5142,\n 5143,\n 5173,\n 5190,\n 5191,\n 5192,\n 5222,\n 5227,\n 5241,\n 5279,\n 5299,\n 5300,\n 5390,\n 5391,\n 5410,\n 5411,\n 5513,\n 5514,\n 5578,\n 5579,\n 5597,\n 5598,\n 5777,\n 5778,\n 5799,\n 5800,\n 5950,\n 5951,\n 5980,\n 5981,\n 6062,\n 6063,\n 6072,\n 6073,\n 6129,\n 6130,\n 6146,\n 6147,\n 6239,\n 6240,\n 6254,\n 6255,\n 6388,\n 6389,\n 6406,\n 6407,\n 6495,\n 6496,\n 6507,\n 6508,\n 6626,\n 6627,\n 6640,\n 6641,\n 6686,\n 6687,\n 6771,\n 6772,\n 6858,\n 6859,\n 6964,\n 6965,\n 7112,\n 7113,\n 7508,\n 7509,\n 7688,\n 7689,\n 7706,\n 7707,\n 7798,\n 7799,\n 8519\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 8519,\n \"ccnet_original_nlines\": 193,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 1,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.35744422674179077,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.027727549895644188,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.1820373684167862,\n \"rps_doc_frac_unique_words\": 0.4214559495449066,\n \"rps_doc_mean_word_length\": 5.193103313446045,\n \"rps_doc_num_sentences\": 101,\n \"rps_doc_symbol_to_word_ratio\": 0.004822180140763521,\n \"rps_doc_unigram_entropy\": 5.6434006690979,\n \"rps_doc_word_count\": 1305,\n \"rps_doc_frac_chars_dupe_10grams\": 0,\n \"rps_doc_frac_chars_dupe_5grams\": 0,\n \"rps_doc_frac_chars_dupe_6grams\": 0,\n \"rps_doc_frac_chars_dupe_7grams\": 0,\n \"rps_doc_frac_chars_dupe_8grams\": 0,\n \"rps_doc_frac_chars_dupe_9grams\": 0,\n \"rps_doc_frac_chars_top_2gram\": 0.0066401101648807526,\n \"rps_doc_frac_chars_top_3gram\": 0.005754760000854731,\n \"rps_doc_frac_chars_top_4gram\": 0.006492550019174814,\n \"rps_doc_books_importance\": -710.98583984375,\n \"rps_doc_books_importance_length_correction\": -710.98583984375,\n \"rps_doc_openwebtext_importance\": -479.4742431640625,\n \"rps_doc_openwebtext_importance_length_correction\": -479.4742431640625,\n \"rps_doc_wikipedia_importance\": -394.8897705078125,\n \"rps_doc_wikipedia_importance_length_correction\": -394.8897705078125\n },\n \"fasttext\": {\n \"dclm\": 0.032624781131744385,\n \"english\": 0.8867133855819702,\n \"fineweb_edu_approx\": 2.2432198524475098,\n \"eai_general_math\": 0.7344209551811218,\n \"eai_open_web_math\": 0.2666524052619934,\n \"eai_web_code\": 0.8519213199615479\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.1332\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"005.133\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Code/Software\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n },\n \"secondary\": {\n \"code\": \"10\",\n \"label\": \"Knowledge Article\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Graduate/Expert Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192841,"cells":{"id":{"kind":"number","value":-6584412756605508000,"string":"-6,584,412,756,605,508,000"},"text":{"kind":"string","value":"Difference between revisions of \"Authentication Cheat Sheet\"\n\nFrom OWASP\nJump to: navigation, search\n(removing extra info)\n(removed footer and the modification tag)\n \n(21 intermediate revisions by 6 users not shown)\nLine 2: Line 2:\n \n
[[File:Cheatsheets-header.jpg|link=]]
\n \n
[[File:Cheatsheets-header.jpg|link=]]
\n  \n{| style=\"padding: 0;margin:0;margin-top:10px;text-align:left;\" |-\n+\nThe Cheat Sheet Series project has been moved to [https://github.com/OWASP/CheatSheetSeries GitHub]!\n| valign=\"top\"  style=\"border-right: 1px dotted gray;padding-right:25px;\" |\n \nLast revision (mm/dd/yy): '''{{REVISIONMONTH}}/{{REVISIONDAY}}/{{REVISIONYEAR}}'''\n \n
English | [[Authentication_Cheat_Sheet_Español | Spanish]]
\n \n
\n \n__TOC__{{TOC hidden}}\n \n= Introduction  =\n \n  \n'''Authentication''' is the process of verification that an individual, entity  or website is who it claims to be. Authentication in the context of web applications is commonly performed by submitting a user name or ID and one or more items of private information that only a given user should know.\n+\nPlease visit [https://github.com/OWASP/CheatSheetSeries/blob/master/cheatsheets/Authentication_Cheat_Sheet.md Authentication Cheat Sheet] to see the latest version of the cheat sheet.\n \n \n'''Session Management''' is a process by which a server maintains the state of an entity interacting with it. This is required for a server to remember how to react to subsequent requests throughout a transaction. Sessions are maintained on the server by a session identifier which can be passed back and forward between the client and server when transmitting and receiving requests. Sessions should be unique per user and computationally very difficult to predict.\n \n \n \n== Authentication General Guidelines  ==\n \n \n \n=== User IDs ===\n \n \n \nMake sure your usernames/userids are case insensitive. User 'smith' and user 'Smith' should be the same user. User names should also be unique. For high security applications usernames could be assigned and secret instead of user-defined public data.\n \n \n \n==== Email address as a User ID ====\n \n \n \nFor information on validation email addresses, please visit the [https://www.owasp.org/index.php/Input_Validation_Cheat_Sheet#Email_Address_Validation email validaiton cheatsheet]].\n \n \n \n===== Validation =====\n \nMany web applications contain computationally expensive and inaccurate regular expressions that attempt to validate email addresses.\n \n \n \nRecent changes to the landscape mean that the number of false-negatives will increase, particularly due to:\n \n* Increased popularity of sub-addressing by providers such as Gmail (commonly using + as a token in the local-part to affect delivery)\n \n* New gTLDs with long names (many regular expressions check the number and length of each label in the domain)\n \n \n \nFollowing RFC 5321, best practice for validating an email address would be to:\n \n* Check for presence of at least one @ symbol in the address\n \n* Ensure the local-part is no longer than 64 octets\n \n* Ensure the domain is no longer than 255 octets\n \n* Ensure the address is deliverable\n \n \n \nTo ensure an address is deliverable, the only way to check this is to send the user an email and have the user take action to confirm receipt.\n \nBeyond confirming that the email address is valid and deliverable, this also provides a positive acknowledgement that the user has access to the mailbox and is likely to be authorised to use it. This does not mean that other users cannot access this mailbox, for example when the user makes use of a service that generates a throw away email address.\n \n \n \n* Email verification links should only satisfy the requirement of verify email address ownership and should not provide the user with an authenticated session (e.g. the user must still authenticate as normal to access the application).\n \n* Email verification codes must expire after the first use or expire after 8 hours if not used.\n \n \n \n===== Address Normalization =====\n \nAs the local-part of email addresses are, in fact - case sensitive, it is important to store and compare email addresses correctly.\n \nTo normalise an email address input, you would convert the domain part ONLY to lowercase.\n \n \n \nUnfortunately this does and will make input harder to normalise and correctly match to a users intent.\n \n \n \nIt is reasonable to only accept one unique capitalisation of an otherwise identical address, however in this case it is critical to:\n \n* Store the user-part as provided and verified by user verification\n \n* Perform comparisons by lowercase(provided)==lowercase(persisted)\n \n \n \n=== Implement Proper Password Strength Controls ===\n \n \n \nA key concern when using passwords for authentication is password strength. A \"strong\" password policy makes it difficult or even improbable for one to guess the password through either manual or automated means. The following characteristics define a strong password:\n \n \n \n==== Warning ====\n \n \n \nThe following advice is disputed. Please view the OWASP presentation,  \"[https://www.youtube.com/watch?v=zUM7i8fsf0g Your Password Complexity Requirements are Worthless - OWASP AppSecUSA 2014]\" for more information.\n \n \n \n==== Password Length ====\n \n \n \nLonger passwords provide a greater combination of characters and consequently make it more difficult for an attacker to guess.\n \n \n \n* '''Minimum''' length of the passwords should be '''enforced''' by the application.\n \n** Passwords '''shorter than 10 characters''' are considered to be weak ([http://csrc.nist.gov/publications/nistpubs/800-132/nist-sp800-132.pdf]).\n \n \n \nWhile minimum length enforcement may cause problems with memorizing passwords among some users, applications should encourage them to set ''passphrases'' (sentences or combination of words) that can be much longer than typical passwords and yet much easier to remember.\n \n \n \n* '''Maximum''' password length should not be set '''too low''', as it will prevent users from creating passphrases. Typical maximum length is 128 characters.\n \n** Passphrases shorter than 20 characters are usually considered weak if they only consist of lower case Latin characters.\n \n \n \n==== Password Complexity ====\n \n \n \nApplications should enforce password complexity rules to discourage easy to guess passwords. Password mechanisms should allow virtually any character the user can type to be part of their password, including the space character. Passwords should, obviously, be case sensitive in order to increase their complexity. Occasionally, we find systems where passwords aren't case sensitive, frequently due to legacy system issues like old mainframes that didn't have case sensitive passwords.\n \n \n \nThe password change mechanism should require a minimum level of complexity that makes sense for the application and its user population. For example:\n \n \n \n*Password must meet at least 3 out of the following 4 complexity rules\n \n**at least 1 uppercase character (A-Z)\n \n**at least 1 lowercase character (a-z)\n \n**at least 1 digit (0-9)\n \n**at least 1 [[Password special characters|special character (punctuation)]] &mdash; do not forget to treat space as special characters too\n \n*at least 10 characters\n \n*at most 128 characters\n \n*not more than 2 identical characters in a row (e.g., 111 not allowed)\n \n \n \n==== Password Topologies ====\n \n \n \n* Ban commonly used password topologies\n \n* Force multiple users to use different password topologies\n \n* Require a minimum topology change between old and new passwords\n \n \n \n== Online Password Guessing and Password Attacks ==\n \nApplications must defend against online password guessing attempts by one of the following methods:\n \n* Account Lockout - Lock account after 5 failed password attempts\n \n* Temporary Account Lockout- Temporarily lock account after 5 failed password attempts\n \n* Anti-automation Captcha - Require a captcha to be successfully completed after 5 failed password attempts\n \n[https://www.owasp.org/index.php/Blocking_Brute_Force_Attacks Additional Reading]\n \n \n \n=== Password Reset Functions ===\n \n \n \n* Where applicable use out of band verification while resetting passwords. For Example, use One Time Passwords (OTPs) sent on a registered mobile or email ids. In this process do not ask the user to enter email id / phone number as the malicious user can use it to his/her advanatage.\n \n* Where possible verify the user's identity by asking security questions\n \n \n \n \n \n==== Additional Information ====\n \n \n \n*Make sure that every character the user types in is actually included in the password. We've seen systems that truncate the password at a length shorter than what the user provided (e.g., truncated at 15 characters when they entered 20).\n \n**This is usually handled by setting the length of ALL password input fields to be exactly the same length as the maximum length password. This is particularly important if your max password length is short, like 20-30 characters.\n \n \n \nAs application's require more complex password policies, they need to be very clear about what these policies are.\n \n*The required policy needs to be explicitly stated on the password change page\n \n** be sure to list every special character you allow, so it's obvious to the user\n \n \n \nRecommendation:\n \n* Ideally, the application would indicate to the user as they type in their new password how much of the complexity policy their new password meets\n \n**In fact, the submit button should be grayed out until the new password meets the complexity policy and the 2nd copy of the new password matches the 1st. This will make it far easier for the user to understand and comply with your complexity policy.\n \n \n \nRegardless of how the UI behaves, when a user submits their password change request:\n \n*If the new password doesn't comply with the complexity policy, the error message should describe EVERY complexity rule that the new password does not comply with, not just the 1st rule it doesn't comply with.\n \n \n \n=== Implement Secure Password Recovery Mechanism ===\n \n \n \nIt is common for an application to have a mechanism that provides a means for a user to gain access to their account in the event they forget their password. Please see [[Forgot Password Cheat Sheet]] for details on this feature.\n \n \n \n=== Store Passwords in a Secure Fashion ===\n \n \n \nIt is critical for a application to store a password using the right cryptographic technique. Please see [[Password Storage Cheat Sheet]] for details on this feature.\n \n \n \n=== Transmit Passwords Only Over TLS or Other Strong Transport ===\n \n \n \nSee: [[Transport Layer Protection Cheat Sheet]]\n \n \n \nThe login page and all subsequent authenticated pages must be exclusively accessed over TLS or other strong transport. The initial login page, referred to as the \"login landing page\", must be served over TLS or other strong transport. Failure to utilize TLS or other strong transport for the login landing page allows an attacker to modify the login form action, causing the user's credentials to be posted to an arbitrary location. Failure to utilize TLS  or other strong transport for authenticated pages after the login enables an attacker to view the unencrypted session ID and compromise the user's authenticated session.\n \n \n \n=== Require Re-authentication for Sensitive Features ===\n \n \n \nIn order to mitigate CSRF and session hijacking, it's important to require the current credentials for an account before updating sensitive account information such as the user's password, user's email, or before sensitive transactions, such as shipping a purchase to a new address.  Without this countermeasure, an attacker may be able to execute sensitive transactions through a CSRF or XSS attack without needing to know the user's current credentials.  Additionally, an attacker may get temporary physical access to a user's browser or steal their session ID to take over the user's session.\n \n \n \n=== Consider Strong Transaction Authentication ===\n \n \n \nSome applications should use a second factor to check whether a user may perform sensitive operations. For more information see the [Transaction Authorization Cheat Sheet].\n \n \n \n==== TLS Client Authentication ====\n \n \n \nTLS Client Authentication, also known as two-way TLS authentication, consists of both, browser and server, sending their respective TLS certificates during the TLS handshake process. Just as you can validate the authenticity of a server by using the certificate and asking a well known Certificate Authority (CA) if the certificate is valid, the server can authenticate the user by receiving a certificate from the client and validating against a third party CA or its own CA. To do this, the server must provide the user with a certificate generated specifically for him, assigning values to the subject so that these can be used to determine what user the certificate should validate. The user installs the certificate on a browser and now uses it for the website.\n \n \n \nIt is a good idea to do this when:\n \n \n \n*It is acceptable (or even preferred) that the user only has access to the website from only a single computer/browser.\n \n*The user is not easily scared by the process of installing TLS certificates on his browser or there will be someone, probably from IT support, that will do this for the user.\n \n*The website requires an extra step of security.\n \n*It is also a good thing to use when the website is for an intranet of a company or organization.\n \n \n \nIt is generally not a good idea to use this method for widely and publicly available websites that will have an average user. For example, it wouldn't be a good idea to implement this for a website like Facebook. While this technique can prevent the user from having to type a password (thus protecting against an average keylogger from stealing it), it is still considered a good idea to consider using both a password and TLS client authentication combined.\n \n \n \nFor more information, see: [https://en.wikipedia.org/wiki/Transport_Layer_Security#Client-authenticated_TLS_handshake Client-authenticated TLS handshake]\n \n \n \n=== Authentication and Error Messages ===\n \n \n \nIncorrectly implemented error messages in the case of authentication functionality can be used for the purposes of user ID and password enumeration. An application should respond (both HTTP and HTML) in a generic manner.\n \n \n \n===== Authentication Responses =====\n \n \n \nAn application should respond with a generic error message regardless of whether the user ID or password was incorrect. It should also give no indication to the status of an existing account.\n \n \n \n===== Incorrect Response Examples =====\n \n \n \n*\"Login for User foo: invalid password\"\n \n*\"Login failed, invalid user ID\"\n \n*\"Login failed; account disabled\"\n \n*\"Login failed; this user is not active\"\n \n \n \n===== Correct Response Example =====\n \n \n \n*\"Login failed; Invalid userID or password\"\n \n \n \nThe correct response does not indicate if the user ID or password is the incorrect parameter and hence inferring a valid user ID.\n \n \n \n===== Error Codes and URLs =====\n \n \n \nThe application may return a different HTTP Error code depending on the authentication attempt response. It may respond with a 200 for a positive result and a 403 for a negative result. Even though a generic error page is shown to a user, the HTTP response code may differ which can leak information about whether the account is valid or not.\n \n \n \n=== Prevent Brute-Force Attacks ===\n \n \n \nIf an attacker is able to guess passwords without the account becoming disabled due to failed authentication attempts, the attacker has an opportunity to continue with a brute force attack until the account is compromised.  Automating brute-force/password guessing attacks on web applications is a trivial challenge. Password lockout mechanisms should be employed that lock out an account if more than a preset number of unsuccessful login attempts are made.  Password lockout mechanisms have a logical weakness. An attacker that undertakes a large number of authentication attempts on known account names can produce a result that locks out entire blocks of user accounts.  Given that the intent of a password lockout system is to protect from brute-force attacks, a sensible strategy is to lockout accounts for a period of time (e.g., 20 minutes). This significantly slows down attackers, while allowing the accounts to reopen automatically for legitimate users.\n \n \n \nAlso, multi-factor authentication is a very powerful deterrent when trying to prevent brute force attacks since the credentials are a moving target. When multi-factor is implemented and active, account lockout may no longer be necessary.\n \n \n \n== Logging and Monitoring ==\n \nEnable logging and monitoring of authentication functions to detect attacks / failures on a real time basis\n \n \n \n*Ensure that all failures are logged and reviewed\n \n*Ensure that all password failures are logged and reviewed\n \n*Ensure that all account lockouts are logged and reviewed\n \n \n \n== Use of authentication protocols that require no password ==\n \n \n \nWhile authentication through a user/password combination and using multi-factor authentication is considered generally secure, there are use cases where it isn't considered the best option or even safe. An example of this are third party applications that desire connecting to the web application, either from a mobile device, another website, desktop or other situations. When this happens, it is NOT considered safe to allow the third party application to store the user/password combo, since then it extends the attack surface into their hands, where it isn't in your control. For this, and other use cases, there are several authentication protocols that can protect you from exposing your users' data to attackers.\n \n \n \n=== OAuth ===\n \n \n \nOpen Authorization (OAuth) is a protocol that allows an application to authenticate against a server as a user, without requiring passwords or any third party server that acts as an identity provider. It uses a token generated by the server, and provides how the authorization flows most occur, so that a client, such as a mobile application, can tell the server what user is using the service.\n \n \n \nThe recommendation is to use and implement OAuth 1.0a or OAuth 2.0, since the very first version (OAuth1.0) has been found to be vulnerable to session fixation.\n \n \n \nOAuth 2.0 relies on HTTPS for security and is currently used and implemented by API's from companies such as Facebook, Google, Twitter and Microsoft. OAuth1.0a is more difficult to use because it requires the use of cryptographic libraries for digital signatures, however does not rely on HTTPS for security and can therefore be more suited for higher risk transactions.\n \n \n \n=== OpenId ===\n \n \n \nOpenId is an HTTP-based protocol that uses identity providers to validate that a user is who he says he is. It is a very simple protocol which allows a service provider initiated way for single sign-on (SSO). This allows the user to re-use a single identity given to a trusted OpenId identity provider and be the same user in multiple websites, without the need to provide any website the password, except for the OpenId identity provider.\n \n \n \nDue to its simplicity and that it provides protection of passwords, OpenId has been well adopted. Some of the well known identity providers for OpenId are Stack Exchange, Google, Facebook and Yahoo!\n \n \n \nFor non-enterprise environment, OpenId is considered a secure and often better choice, as long as the identity provider is of trust.\n \n \n \n=== SAML ===\n \n \n \nSecurity Assertion Markup Language (SAML) is often considered to compete with OpenId. The most recommended version is 2.0, since it is very feature complete and provides a strong security. Like with OpenId, SAML uses identity providers, but unlike it, it is XML-based and provides more flexibility. SAML is based on browser redirects which send XML data. Unlike SAML, it isn't only initiated by a service provider, but it can also be initiated from the identity provider. This allows the user to navigate through different portals while still being authenticated without having to do anything, making the process transparent.\n \n \n \nWhile OpenId has taken most of the consumer market, SAML is often the choice for enterprise applications. The reason for this is often that there are few OpenId identity providers which are considered of enterprise class (meaning that the way they validate the user identity doesn't have high standards required for enterprise identity). It is more common to see SAML being used inside of intranet websites, sometimes even using a server from the intranet as the identity provider.\n \n \n \nIn the past few years, applications like SAP ERP and SharePoint (SharePoint by using Active Directory Federation Services 2.0) have decided to use SAML 2.0 authentication as an often preferred method for single sign-on implementations whenever enterprise federation is required for web services and web applications.\n \n \n \n'''See also: [[SAML Security Cheat Sheet]]'''\n \n \n \n=== FIDO ===\n \nThe Fast Identity Online (FIDO) Alliance has created two protocols to facilitate online authentication : the Universal Authentication Framework (UAF) protocol and the Universal Second Factor (U2F) protocol. While UAF focuses on passwordless authentication, U2F allows the addition of a second factor to existing password-based authentication. Both protocols are based on a public key cryptography challenge-response model.\n \n \n \nUAF takes advantage of existing security technologies present on devices for authentication including fingerprint sensors, cameras(face biometrics), microphones(voice biometrics), Trusted Execution Environments(TEEs), Secure Elements(SEs) and others. The protocol is designed to plug-in these device capabilities into a common authentication framework. UAF works with both native applications and web applications.\n \n \n \nU2F augments password-based authentication using a hardware token (typically USB) that stores cryptographic authentication keys and uses them for signing. The user can use the same token as a second factor for multiple applications. U2F works with web applications. It provides '''protection against phishing''' by using the URL of the website to lookup the stored authentication key.\n \n \n \n== Session Management General Guidelines  ==\n \n \n \nSession management is directly related to authentication. The '''Session Management General Guidelines''' previously available on this OWASP Authentication Cheat Sheet have been integrated into the [[Session Management Cheat Sheet]].\n \n \n \n== Password Managers ==\n \n \n \nPassword managers are programs, browser plugins or web services that automate management of large number of different credentials, including memorizing and filling-in, generating random passwords on different sites etc. The web application can help password managers by:\n \n \n \n* using standard HTML forms for username and password input,\n \n* not disabling copy and paste on HTML form fields,\n \n* allowing very long passwords,\n \n* not using multi-stage login schemes (username on first screen, then password),\n \n* not using highly scripted (JavaScript) authentication schemes.\n \n \n \n== Additional Resources ==\n \n \n \nA PDF of this cheatsheet has been created here. https://magic.piktochart.com/output/7003174-authentication-cheat-sheet\n \n \n \n== Authors and Primary Editors  ==\n \n \n \nEoin Keary eoinkeary[at]owasp.org
\n \nJim Manico
\n \nTimo Goosen
\n \nPawel Krawczyk
\n \nSven Neuhaus
\n \nManuel Aude Morales\n \n \n \n== Other Cheatsheets ==\n \n \n \n{{Cheatsheet_Navigation_Body}}\n \n[[Category:Cheatsheets]]\n \n\nLatest revision as of 05:33, 14 February 2019\n\nCheatsheets-header.jpg\n\nThe Cheat Sheet Series project has been moved to GitHub!\n\nPlease visit Authentication Cheat Sheet to see the latest version of the cheat sheet."},"metadata":{"kind":"string","value":"{\n \"url\": \"https://www.owasp.org/index.php?title=Authentication_Cheat_Sheet&diff=247458&oldid=206361\",\n \"source_domain\": \"www.owasp.org\",\n \"snapshot_id\": \"crawl=CC-MAIN-2019-13\",\n \"warc_metadata\": {\n \"Content-Length\": \"84861\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:DABAR7DHFPSCPKZ4RDYK5N2ERAK7EKYI\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2019-03-22T23:13:08Z\",\n \"WARC-IP-Address\": \"104.130.219.202\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:BYERWKKAHLGX64OPAL63TVKORQHV3R7A\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://www.owasp.org/index.php?title=Authentication_Cheat_Sheet&diff=247458&oldid=206361\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"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 (info@commoncrawl.org)\\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 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/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 61,\n 62,\n 73,\n 101,\n 123,\n 165,\n 167,\n 216,\n 232,\n 234,\n 351,\n 353,\n 470,\n 473,\n 540,\n 542,\n 643,\n 719,\n 721,\n 804,\n 806,\n 882,\n 884,\n 890,\n 892,\n 914,\n 916,\n 934,\n 936,\n 939,\n 1239,\n 1241,\n 1425,\n 1427,\n 1429,\n 1896,\n 1898,\n 1900,\n 1902,\n 1943,\n 1945,\n 1947,\n 1949,\n 1966,\n 1968,\n 1970,\n 1972,\n 2223,\n 2225,\n 2227,\n 2229,\n 2266,\n 2268,\n 2270,\n 2272,\n 2454,\n 2456,\n 2458,\n 2460,\n 2483,\n 2485,\n 2618,\n 2620,\n 2622,\n 2624,\n 2732,\n 2734,\n 2878,\n 2880,\n 2991,\n 2993,\n 2995,\n 2997,\n 3076,\n 3078,\n 3148,\n 3150,\n 3202,\n 3204,\n 3253,\n 3255,\n 3291,\n 3293,\n 3295,\n 3297,\n 3440,\n 3442,\n 3793,\n 3795,\n 3797,\n 3799,\n 4035,\n 4037,\n 4133,\n 4135,\n 4137,\n 4139,\n 4173,\n 4175,\n 4307,\n 4309,\n 4399,\n 4401,\n 4403,\n 4405,\n 4508,\n 4510,\n 4512,\n 4514,\n 4647,\n 4649,\n 4717,\n 4719,\n 4795,\n 4797,\n 4799,\n 4801,\n 4853,\n 4855,\n 4857,\n 4859,\n 5128,\n 5130,\n 5132,\n 5134,\n 5152,\n 5154,\n 5156,\n 5158,\n 5374,\n 5376,\n 5378,\n 5380,\n 5406,\n 5408,\n 5410,\n 5412,\n 5539,\n 5541,\n 5543,\n 5545,\n 5630,\n 5632,\n 5779,\n 5781,\n 5783,\n 5785,\n 6055,\n 6057,\n 6059,\n 6061,\n 6220,\n 6222,\n 6345,\n 6347,\n 6349,\n 6351,\n 6381,\n 6383,\n 6385,\n 6387,\n 6873,\n 6875,\n 6877,\n 6879,\n 7029,\n 7031,\n 7033,\n 7035,\n 7106,\n 7108,\n 7147,\n 7149,\n 7188,\n 7190,\n 7215,\n 7217,\n 7357,\n 7359,\n 7383,\n 7385,\n 7409,\n 7411,\n 7482,\n 7484,\n 7486,\n 7488,\n 7518,\n 7520,\n 7522,\n 7524,\n 7564,\n 7566,\n 7626,\n 7628,\n 7694,\n 7696,\n 7698,\n 7700,\n 7752,\n 7754,\n 7854,\n 7856,\n 7922,\n 7924,\n 8011,\n 8013,\n 8121,\n 8123,\n 8205,\n 8207,\n 8209,\n 8211,\n 8244,\n 8246,\n 8248,\n 8250,\n 8535,\n 8537,\n 8610,\n 8612,\n 8614,\n 8616,\n 8618,\n 8620,\n 8653,\n 8655,\n 8657,\n 8659,\n 8898,\n 8900,\n 9131,\n 9133,\n 9135,\n 9137,\n 9252,\n 9254,\n 9333,\n 9335,\n 9417,\n 9419,\n 9421,\n 9423,\n 9439,\n 9441,\n 9589,\n 9591,\n 9842,\n 9844,\n 9846,\n 9848,\n 9933,\n 9935,\n 10145,\n 10147,\n 10149,\n 10151,\n 10204,\n 10206,\n 10208,\n 10210,\n 10440,\n 10442,\n 10444,\n 10446,\n 10490,\n 10492,\n 10494,\n 10496,\n 10663,\n 10665,\n 10667,\n 10669,\n 10736,\n 10738,\n 10740,\n 10742,\n 10790,\n 10792,\n 10794,\n 10796,\n 11423,\n 11425,\n 11427,\n 11429,\n 11486,\n 11488,\n 11490,\n 11492,\n 12088,\n 12090,\n 12092,\n 12094,\n 12145,\n 12147,\n 12149,\n 12151,\n 12324,\n 12326,\n 12328,\n 12330,\n 12366,\n 12368,\n 12370,\n 12372,\n 13139,\n 13141,\n 13143,\n 13145,\n 13180,\n 13182,\n 13184,\n 13186,\n 13306,\n 13308,\n 13484,\n 13486,\n 13535,\n 13537,\n 13635,\n 13637,\n 13639,\n 13641,\n 14101,\n 14103,\n 14105,\n 14107,\n 14261,\n 14263,\n 14265,\n 14267,\n 14309,\n 14311,\n 14313,\n 14315,\n 14536,\n 14538,\n 14540,\n 14542,\n 14579,\n 14581,\n 14583,\n 14585,\n 14777,\n 14779,\n 14781,\n 14783,\n 14823,\n 14825,\n 14827,\n 14829,\n 14869,\n 14871,\n 14904,\n 14906,\n 14940,\n 14942,\n 14983,\n 14985,\n 14987,\n 14989,\n 15026,\n 15028,\n 15030,\n 15032,\n 15076,\n 15078,\n 15080,\n 15082,\n 15212,\n 15214,\n 15216,\n 15218,\n 15251,\n 15253,\n 15255,\n 15257,\n 15600,\n 15602,\n 15604,\n 15606,\n 15642,\n 15644,\n 15646,\n 15648,\n 16613,\n 16615,\n 16617,\n 16619,\n 16857,\n 16859,\n 16861,\n 16863,\n 16892,\n 16894,\n 17002,\n 17004,\n 17006,\n 17008,\n 17058,\n 17060,\n 17119,\n 17121,\n 17179,\n 17181,\n 17183,\n 17185,\n 17248,\n 17250,\n 17252,\n 17254,\n 17974,\n 17976,\n 17978,\n 17980,\n 17994,\n 17996,\n 17998,\n 18000,\n 18395,\n 18397,\n 18399,\n 18401,\n 18562,\n 18564,\n 18566,\n 18568,\n 18939,\n 18941,\n 18943,\n 18945,\n 18960,\n 18962,\n 18964,\n 18966,\n 19406,\n 19408,\n 19410,\n 19412,\n 19611,\n 19613,\n 19615,\n 19617,\n 19750,\n 19752,\n 19754,\n 19756,\n 19769,\n 19771,\n 19773,\n 19775,\n 20401,\n 20403,\n 20405,\n 20407,\n 20889,\n 20891,\n 20893,\n 20895,\n 21212,\n 21214,\n 21216,\n 21218,\n 21264,\n 21266,\n 21268,\n 21270,\n 21283,\n 21285,\n 21708,\n 21710,\n 21712,\n 21714,\n 22129,\n 22131,\n 22133,\n 22135,\n 22520,\n 22522,\n 22524,\n 22526,\n 22571,\n 22573,\n 22575,\n 22577,\n 22811,\n 22813,\n 22815,\n 22817,\n 22841,\n 22843,\n 22845,\n 22847,\n 23118,\n 23120,\n 23122,\n 23124,\n 23185,\n 23187,\n 23239,\n 23241,\n 23273,\n 23275,\n 23356,\n 23358,\n 23423,\n 23425,\n 23427,\n 23429,\n 23456,\n 23458,\n 23460,\n 23462,\n 23581,\n 23583,\n 23585,\n 23587,\n 23622,\n 23624,\n 23626,\n 23628,\n 23668,\n 23670,\n 23686,\n 23688,\n 23705,\n 23707,\n 23727,\n 23729,\n 23747,\n 23749,\n 23769,\n 23771,\n 23773,\n 23775,\n 23799,\n 23801,\n 23803,\n 23805,\n 23836,\n 23838,\n 23863,\n 23865,\n 23866,\n 23912,\n 23913,\n 23936,\n 23937,\n 23994,\n 23995\n ],\n \"line_end_idx\": [\n 61,\n 62,\n 73,\n 101,\n 123,\n 165,\n 167,\n 216,\n 232,\n 234,\n 351,\n 353,\n 470,\n 473,\n 540,\n 542,\n 643,\n 719,\n 721,\n 804,\n 806,\n 882,\n 884,\n 890,\n 892,\n 914,\n 916,\n 934,\n 936,\n 939,\n 1239,\n 1241,\n 1425,\n 1427,\n 1429,\n 1896,\n 1898,\n 1900,\n 1902,\n 1943,\n 1945,\n 1947,\n 1949,\n 1966,\n 1968,\n 1970,\n 1972,\n 2223,\n 2225,\n 2227,\n 2229,\n 2266,\n 2268,\n 2270,\n 2272,\n 2454,\n 2456,\n 2458,\n 2460,\n 2483,\n 2485,\n 2618,\n 2620,\n 2622,\n 2624,\n 2732,\n 2734,\n 2878,\n 2880,\n 2991,\n 2993,\n 2995,\n 2997,\n 3076,\n 3078,\n 3148,\n 3150,\n 3202,\n 3204,\n 3253,\n 3255,\n 3291,\n 3293,\n 3295,\n 3297,\n 3440,\n 3442,\n 3793,\n 3795,\n 3797,\n 3799,\n 4035,\n 4037,\n 4133,\n 4135,\n 4137,\n 4139,\n 4173,\n 4175,\n 4307,\n 4309,\n 4399,\n 4401,\n 4403,\n 4405,\n 4508,\n 4510,\n 4512,\n 4514,\n 4647,\n 4649,\n 4717,\n 4719,\n 4795,\n 4797,\n 4799,\n 4801,\n 4853,\n 4855,\n 4857,\n 4859,\n 5128,\n 5130,\n 5132,\n 5134,\n 5152,\n 5154,\n 5156,\n 5158,\n 5374,\n 5376,\n 5378,\n 5380,\n 5406,\n 5408,\n 5410,\n 5412,\n 5539,\n 5541,\n 5543,\n 5545,\n 5630,\n 5632,\n 5779,\n 5781,\n 5783,\n 5785,\n 6055,\n 6057,\n 6059,\n 6061,\n 6220,\n 6222,\n 6345,\n 6347,\n 6349,\n 6351,\n 6381,\n 6383,\n 6385,\n 6387,\n 6873,\n 6875,\n 6877,\n 6879,\n 7029,\n 7031,\n 7033,\n 7035,\n 7106,\n 7108,\n 7147,\n 7149,\n 7188,\n 7190,\n 7215,\n 7217,\n 7357,\n 7359,\n 7383,\n 7385,\n 7409,\n 7411,\n 7482,\n 7484,\n 7486,\n 7488,\n 7518,\n 7520,\n 7522,\n 7524,\n 7564,\n 7566,\n 7626,\n 7628,\n 7694,\n 7696,\n 7698,\n 7700,\n 7752,\n 7754,\n 7854,\n 7856,\n 7922,\n 7924,\n 8011,\n 8013,\n 8121,\n 8123,\n 8205,\n 8207,\n 8209,\n 8211,\n 8244,\n 8246,\n 8248,\n 8250,\n 8535,\n 8537,\n 8610,\n 8612,\n 8614,\n 8616,\n 8618,\n 8620,\n 8653,\n 8655,\n 8657,\n 8659,\n 8898,\n 8900,\n 9131,\n 9133,\n 9135,\n 9137,\n 9252,\n 9254,\n 9333,\n 9335,\n 9417,\n 9419,\n 9421,\n 9423,\n 9439,\n 9441,\n 9589,\n 9591,\n 9842,\n 9844,\n 9846,\n 9848,\n 9933,\n 9935,\n 10145,\n 10147,\n 10149,\n 10151,\n 10204,\n 10206,\n 10208,\n 10210,\n 10440,\n 10442,\n 10444,\n 10446,\n 10490,\n 10492,\n 10494,\n 10496,\n 10663,\n 10665,\n 10667,\n 10669,\n 10736,\n 10738,\n 10740,\n 10742,\n 10790,\n 10792,\n 10794,\n 10796,\n 11423,\n 11425,\n 11427,\n 11429,\n 11486,\n 11488,\n 11490,\n 11492,\n 12088,\n 12090,\n 12092,\n 12094,\n 12145,\n 12147,\n 12149,\n 12151,\n 12324,\n 12326,\n 12328,\n 12330,\n 12366,\n 12368,\n 12370,\n 12372,\n 13139,\n 13141,\n 13143,\n 13145,\n 13180,\n 13182,\n 13184,\n 13186,\n 13306,\n 13308,\n 13484,\n 13486,\n 13535,\n 13537,\n 13635,\n 13637,\n 13639,\n 13641,\n 14101,\n 14103,\n 14105,\n 14107,\n 14261,\n 14263,\n 14265,\n 14267,\n 14309,\n 14311,\n 14313,\n 14315,\n 14536,\n 14538,\n 14540,\n 14542,\n 14579,\n 14581,\n 14583,\n 14585,\n 14777,\n 14779,\n 14781,\n 14783,\n 14823,\n 14825,\n 14827,\n 14829,\n 14869,\n 14871,\n 14904,\n 14906,\n 14940,\n 14942,\n 14983,\n 14985,\n 14987,\n 14989,\n 15026,\n 15028,\n 15030,\n 15032,\n 15076,\n 15078,\n 15080,\n 15082,\n 15212,\n 15214,\n 15216,\n 15218,\n 15251,\n 15253,\n 15255,\n 15257,\n 15600,\n 15602,\n 15604,\n 15606,\n 15642,\n 15644,\n 15646,\n 15648,\n 16613,\n 16615,\n 16617,\n 16619,\n 16857,\n 16859,\n 16861,\n 16863,\n 16892,\n 16894,\n 17002,\n 17004,\n 17006,\n 17008,\n 17058,\n 17060,\n 17119,\n 17121,\n 17179,\n 17181,\n 17183,\n 17185,\n 17248,\n 17250,\n 17252,\n 17254,\n 17974,\n 17976,\n 17978,\n 17980,\n 17994,\n 17996,\n 17998,\n 18000,\n 18395,\n 18397,\n 18399,\n 18401,\n 18562,\n 18564,\n 18566,\n 18568,\n 18939,\n 18941,\n 18943,\n 18945,\n 18960,\n 18962,\n 18964,\n 18966,\n 19406,\n 19408,\n 19410,\n 19412,\n 19611,\n 19613,\n 19615,\n 19617,\n 19750,\n 19752,\n 19754,\n 19756,\n 19769,\n 19771,\n 19773,\n 19775,\n 20401,\n 20403,\n 20405,\n 20407,\n 20889,\n 20891,\n 20893,\n 20895,\n 21212,\n 21214,\n 21216,\n 21218,\n 21264,\n 21266,\n 21268,\n 21270,\n 21283,\n 21285,\n 21708,\n 21710,\n 21712,\n 21714,\n 22129,\n 22131,\n 22133,\n 22135,\n 22520,\n 22522,\n 22524,\n 22526,\n 22571,\n 22573,\n 22575,\n 22577,\n 22811,\n 22813,\n 22815,\n 22817,\n 22841,\n 22843,\n 22845,\n 22847,\n 23118,\n 23120,\n 23122,\n 23124,\n 23185,\n 23187,\n 23239,\n 23241,\n 23273,\n 23275,\n 23356,\n 23358,\n 23423,\n 23425,\n 23427,\n 23429,\n 23456,\n 23458,\n 23460,\n 23462,\n 23581,\n 23583,\n 23585,\n 23587,\n 23622,\n 23624,\n 23626,\n 23628,\n 23668,\n 23670,\n 23686,\n 23688,\n 23705,\n 23707,\n 23727,\n 23729,\n 23747,\n 23749,\n 23769,\n 23771,\n 23773,\n 23775,\n 23799,\n 23801,\n 23803,\n 23805,\n 23836,\n 23838,\n 23863,\n 23865,\n 23866,\n 23912,\n 23913,\n 23936,\n 23937,\n 23994,\n 23995,\n 24080\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 24080,\n \"ccnet_original_nlines\": 550,\n \"rps_doc_curly_bracket\": 0.0008720899932086468,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.3563086688518524,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.020151130855083466,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.18983283638954163,\n \"rps_doc_frac_unique_words\": 0.28920990228652954,\n \"rps_doc_mean_word_length\": 5.507665157318115,\n \"rps_doc_num_sentences\": 171,\n \"rps_doc_symbol_to_word_ratio\": 0.0004579800006467849,\n \"rps_doc_unigram_entropy\": 5.89959716796875,\n \"rps_doc_word_count\": 3392,\n \"rps_doc_frac_chars_dupe_10grams\": 0.006423300132155418,\n \"rps_doc_frac_chars_dupe_5grams\": 0.042019061744213104,\n \"rps_doc_frac_chars_dupe_6grams\": 0.03217000141739845,\n \"rps_doc_frac_chars_dupe_7grams\": 0.027513109147548676,\n \"rps_doc_frac_chars_dupe_8grams\": 0.01980515941977501,\n \"rps_doc_frac_chars_dupe_9grams\": 0.015415909700095654,\n \"rps_doc_frac_chars_top_2gram\": 0.00974200014024973,\n \"rps_doc_frac_chars_top_3gram\": 0.0026763700880110264,\n \"rps_doc_frac_chars_top_4gram\": 0.004282199777662754,\n \"rps_doc_books_importance\": -1850.9246826171875,\n \"rps_doc_books_importance_length_correction\": -1850.9246826171875,\n \"rps_doc_openwebtext_importance\": -1269.2235107421875,\n \"rps_doc_openwebtext_importance_length_correction\": -1269.2235107421875,\n \"rps_doc_wikipedia_importance\": -843.3822021484375,\n \"rps_doc_wikipedia_importance_length_correction\": -843.3822021484375\n },\n \"fasttext\": {\n \"dclm\": 0.1177244782447815,\n \"english\": 0.8828503489494324,\n \"fineweb_edu_approx\": 2.190934419631958,\n \"eai_general_math\": 0.013845560140907764,\n \"eai_open_web_math\": 0.21008777618408203,\n \"eai_web_code\": 0.9227436184883118\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.822\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"005.82\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n },\n \"secondary\": {\n \"code\": \"10\",\n \"label\": \"Knowledge Article\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192842,"cells":{"id":{"kind":"number","value":-4431521169506644000,"string":"-4,431,521,169,506,644,000"},"text":{"kind":"string","value":"Tell me more ×\nStack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.\n\nJust started learning how to develop a ASP.NET application, i am puzzled on how to make a checkbox is always unchecked even after form submit where a user tick the checkbox. The checkbox is for acknowledgment that user agrees to the terms and conditions ... and when form submit return some errors I want to display the error message on the screen and keep the checkbox unchecked regardless it was ticked or not.\n\nIn my view I have the following:\n\n<%: Html.CheckBoxFor(m => m.UserAgreement) %>\n\nAnd I have tried both the following in my controller and none of them works:\n\nViewData[\"UserAgreement\"] = false;\n\nreturn View(new MyModel { UserAgreement = false});\n\nAnyone can help on how to achieve what I need? Thank you.\n\nshare|improve this question\nadd comment\n\n4 Answers\n\nThis bothered me for a long time as well, even explicity setting the values in my model to false did not really solve this problem. What I found was that it was also checking the value in the ModelState collection.\n\nThis is probably not the cleanest solution but this is ultimately what worked for me:\n\nprivate ActionResult DisplayView(string viewName, MyModelClass model)\n{\n model.AgreeTerms = false;\n ModelState.Remove(\"AgreeTerms\");\n\n return View(viewName, model);\n}\nshare|improve this answer\nadd comment\n\nThe ASP.NET MVC CheckBox does not retain its state unless you specifically tell it to do so.\n\nThe code you posted above indicates that 'UserAgreement' should be checked (value is TRUE) when the view is returned, not that it should be unchecked.\n\nUnless you specifically set the value of UserAgreement to 'true' before returning the view to the user, the checkbox will be unchecked. Similarly, if your action is receiving a model with the UserAgreement property set to 'true' and you do not set it back to 'false' before returning it to the view, the checkbox will remain checked.\n\nshare|improve this answer\n \nHi Nathan, sorry I made a mistake in my post which I have corrected. I meant to assign false as a value. And I still have my checkbox checked if I checked it before submit. Whatever that I do to the checkbox is retained after submit. That's not something that I want ... I would like to have the checkbox always unchecked regardless it was checked or unchecked before submit. –  user152235 Dec 3 '10 at 5:19\nadd comment\n\nYour value is being saved in the ModelState property. In order to reset the value after a post. You have to cleaer the value in the ModelState property\n\nshare|improve this answer\n \nHi Kyle, and how do I do that? I thought my last line of codes did that? –  user152235 Dec 3 '10 at 5:20\nadd comment\n\nTry ModelState.Remove(\"UserAgreement\"); before you return the view.\n\nshare|improve this answer\nadd comment\n\nYour Answer\n\n \ndiscard\n\nBy posting your answer, you agree to the privacy policy and terms of service.\n\nNot the answer you're looking for? Browse other questions tagged or ask your own question."},"metadata":{"kind":"string","value":"{\n \"url\": \"http://stackoverflow.com/questions/4341572/asp-net-how-to-make-a-checkbox-always-unchecked-even-post-submit/13148340\",\n \"source_domain\": \"stackoverflow.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2013-48\",\n \"warc_metadata\": {\n \"Content-Length\": \"60854\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:PAYRHJXMXVTZRZA2LM3UUKTVEK5LHETG\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2013-12-05T18:48:10Z\",\n \"WARC-IP-Address\": \"198.252.206.16\",\n \"WARC-Identified-Payload-Type\": null,\n \"WARC-Payload-Digest\": \"sha1:A42X5SFVEVD7VKWK2KV3NOWOBVLG7LGY\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"http://stackoverflow.com/questions/4341572/asp-net-how-to-make-a-checkbox-always-unchecked-even-post-submit/13148340\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"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\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 15,\n 147,\n 148,\n 561,\n 562,\n 595,\n 596,\n 642,\n 643,\n 720,\n 721,\n 756,\n 757,\n 808,\n 809,\n 867,\n 868,\n 896,\n 908,\n 909,\n 919,\n 920,\n 1135,\n 1136,\n 1222,\n 1223,\n 1293,\n 1295,\n 1325,\n 1362,\n 1363,\n 1397,\n 1399,\n 1425,\n 1437,\n 1438,\n 1531,\n 1532,\n 1683,\n 1684,\n 2018,\n 2019,\n 2045,\n 2047,\n 2455,\n 2467,\n 2468,\n 2620,\n 2621,\n 2647,\n 2649,\n 2754,\n 2766,\n 2767,\n 2835,\n 2836,\n 2862,\n 2874,\n 2875,\n 2887,\n 2888,\n 2890,\n 2898,\n 2899,\n 2977,\n 2978\n ],\n \"line_end_idx\": [\n 15,\n 147,\n 148,\n 561,\n 562,\n 595,\n 596,\n 642,\n 643,\n 720,\n 721,\n 756,\n 757,\n 808,\n 809,\n 867,\n 868,\n 896,\n 908,\n 909,\n 919,\n 920,\n 1135,\n 1136,\n 1222,\n 1223,\n 1293,\n 1295,\n 1325,\n 1362,\n 1363,\n 1397,\n 1399,\n 1425,\n 1437,\n 1438,\n 1531,\n 1532,\n 1683,\n 1684,\n 2018,\n 2019,\n 2045,\n 2047,\n 2455,\n 2467,\n 2468,\n 2620,\n 2621,\n 2647,\n 2649,\n 2754,\n 2766,\n 2767,\n 2835,\n 2836,\n 2862,\n 2874,\n 2875,\n 2887,\n 2888,\n 2890,\n 2898,\n 2899,\n 2977,\n 2978,\n 3068\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 3068,\n \"ccnet_original_nlines\": 66,\n \"rps_doc_curly_bracket\": 0.0013037800090387464,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.40872374176979065,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.03392568975687027,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.17770597338676453,\n \"rps_doc_frac_unique_words\": 0.4317269027233124,\n \"rps_doc_mean_word_length\": 4.8172688484191895,\n \"rps_doc_num_sentences\": 34,\n \"rps_doc_symbol_to_word_ratio\": 0.0032310199458152056,\n \"rps_doc_unigram_entropy\": 4.881322860717773,\n \"rps_doc_word_count\": 498,\n \"rps_doc_frac_chars_dupe_10grams\": 0,\n \"rps_doc_frac_chars_dupe_5grams\": 0.06169236823916435,\n \"rps_doc_frac_chars_dupe_6grams\": 0.01583993062376976,\n \"rps_doc_frac_chars_dupe_7grams\": 0,\n \"rps_doc_frac_chars_dupe_8grams\": 0,\n \"rps_doc_frac_chars_dupe_9grams\": 0,\n \"rps_doc_frac_chars_top_2gram\": 0.03209671005606651,\n \"rps_doc_frac_chars_top_3gram\": 0.036681950092315674,\n \"rps_doc_frac_chars_top_4gram\": 0.02000834047794342,\n \"rps_doc_books_importance\": -293.0455627441406,\n \"rps_doc_books_importance_length_correction\": -293.0455627441406,\n \"rps_doc_openwebtext_importance\": -157.13758850097656,\n \"rps_doc_openwebtext_importance_length_correction\": -157.13758850097656,\n \"rps_doc_wikipedia_importance\": -89.72760009765625,\n \"rps_doc_wikipedia_importance_length_correction\": -89.72760009765625\n },\n \"fasttext\": {\n \"dclm\": 0.024958310648798943,\n \"english\": 0.9216768145561218,\n \"fineweb_edu_approx\": 1.0294616222381592,\n \"eai_general_math\": 0.010618450120091438,\n \"eai_open_web_math\": 0.17584526538848877,\n \"eai_web_code\": 0.0022622901014983654\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.138\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"005.1\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Social/Forum\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Code/Software\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n },\n \"secondary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"18\",\n \"label\": \"Q&A Forum\"\n },\n \"secondary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Graduate/Expert Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192843,"cells":{"id":{"kind":"number","value":-6660857029351730000,"string":"-6,660,857,029,351,730,000"},"text":{"kind":"string","value":"Meta Stack Exchange is where users like you discuss bugs, features, and support issues that affect the software powering all 158 Stack Exchange communities.\n\nWhat is meta?\nHere's how it works:\n 1. Any Stack Exchange user can ask a question\n 2. The community provides support, votes on ideas, and reports bugs\n 3. Your voice helps shape the way Stack Exchange operates\n\nIt is probably too late now to change it, but I'd prefer the\n\nprev [1] [2] [3] ... next\n\npages on the left at the bottom and the\n\n[15] [30] [50] per page\n\non the right at the bottom of question lists.\n\nshare|improve this question\n2  \nPretty sure it was prev/next on the left before. – random Apr 28 '10 at 8:31\n    \nWe should put the prev next in the middle at the bottom and the per page in the middle at the top. – Ladybug Killer Apr 28 '10 at 8:33\nup vote 1 down vote accepted\n\nThis was actually a bit of a mistake in some refactoring, and I will fix it with the next deployment.\n\nIt's easy now though...\n\n
\n
\n\nGuess what fr and fl stand for?\n\nshare|improve this answer\n7  \nFrance and Florida? – Joe Apr 28 '10 at 11:47\n    \nSo [bug] would have been a more correct tag? :-) – Mark Hurd Apr 29 '10 at 0:37\n\nYou must log in to answer this question.\n\nNot the answer you're looking for? Browse other questions tagged ."},"metadata":{"kind":"string","value":"{\n \"url\": \"http://meta.stackexchange.com/questions/48083/swap-n-per-page-and-page-numbers-at-the-bottom-of-the-question-lists\",\n \"source_domain\": \"meta.stackexchange.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2016-30\",\n \"warc_metadata\": {\n \"Content-Length\": \"70316\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:WG5AD52BDKES4XXOLPBDOD3JEFIIEHA6\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2016-07-29T04:01:28Z\",\n \"WARC-IP-Address\": \"151.101.193.69\",\n \"WARC-Identified-Payload-Type\": null,\n \"WARC-Payload-Digest\": \"sha1:S4BSAMIEWBVIPSMKV7D3MKY66JUDWLL3\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"http://meta.stackexchange.com/questions/48083/swap-n-per-page-and-page-numbers-at-the-bottom-of-the-question-lists\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"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\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 157,\n 158,\n 172,\n 193,\n 241,\n 311,\n 371,\n 372,\n 433,\n 434,\n 460,\n 461,\n 501,\n 502,\n 526,\n 527,\n 573,\n 574,\n 602,\n 606,\n 683,\n 688,\n 823,\n 852,\n 853,\n 955,\n 956,\n 980,\n 981,\n 1009,\n 1033,\n 1034,\n 1066,\n 1067,\n 1093,\n 1097,\n 1143,\n 1148,\n 1228,\n 1229,\n 1270,\n 1271\n ],\n \"line_end_idx\": [\n 157,\n 158,\n 172,\n 193,\n 241,\n 311,\n 371,\n 372,\n 433,\n 434,\n 460,\n 461,\n 501,\n 502,\n 526,\n 527,\n 573,\n 574,\n 602,\n 606,\n 683,\n 688,\n 823,\n 852,\n 853,\n 955,\n 956,\n 980,\n 981,\n 1009,\n 1033,\n 1034,\n 1066,\n 1067,\n 1093,\n 1097,\n 1143,\n 1148,\n 1228,\n 1229,\n 1270,\n 1271,\n 1337\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 1337,\n \"ccnet_original_nlines\": 42,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.33542320132255554,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.006269589997828007,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0.023255810141563416,\n \"rps_doc_frac_no_alph_words\": 0.29467085003852844,\n \"rps_doc_frac_unique_words\": 0.5942623019218445,\n \"rps_doc_mean_word_length\": 4.0368852615356445,\n \"rps_doc_num_sentences\": 17,\n \"rps_doc_symbol_to_word_ratio\": 0.006269589997828007,\n \"rps_doc_unigram_entropy\": 4.685833930969238,\n \"rps_doc_word_count\": 244,\n \"rps_doc_frac_chars_dupe_10grams\": 0,\n \"rps_doc_frac_chars_dupe_5grams\": 0.06192893162369728,\n \"rps_doc_frac_chars_dupe_6grams\": 0,\n \"rps_doc_frac_chars_dupe_7grams\": 0,\n \"rps_doc_frac_chars_dupe_8grams\": 0,\n \"rps_doc_frac_chars_dupe_9grams\": 0,\n \"rps_doc_frac_chars_top_2gram\": 0.05279187858104706,\n \"rps_doc_frac_chars_top_3gram\": 0.03350254148244858,\n \"rps_doc_frac_chars_top_4gram\": 0.027411170303821564,\n \"rps_doc_books_importance\": -125.00143432617188,\n \"rps_doc_books_importance_length_correction\": -125.00142669677734,\n \"rps_doc_openwebtext_importance\": -59.10465621948242,\n \"rps_doc_openwebtext_importance_length_correction\": -59.10465621948242,\n \"rps_doc_wikipedia_importance\": -37.09244918823242,\n \"rps_doc_wikipedia_importance_length_correction\": -37.08871078491211\n },\n \"fasttext\": {\n \"dclm\": 0.06053036078810692,\n \"english\": 0.9103163480758667,\n \"fineweb_edu_approx\": 1.0815072059631348,\n \"eai_general_math\": 0.00026756999432109296,\n \"eai_open_web_math\": 0.3213402032852173,\n \"eai_web_code\": 0.000006910000138304895\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.4\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"004.678\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Social/Forum\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"18\",\n \"label\": \"Q&A Forum\"\n },\n \"secondary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"1\",\n \"label\": \"No Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"6\",\n \"label\": \"Not Applicable/Indeterminate\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"1\",\n \"label\": \"General Audience\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192844,"cells":{"id":{"kind":"number","value":2496871080601660400,"string":"2,496,871,080,601,660,400"},"text":{"kind":"string","value":"Difference between revisions of \"Thunar (Español)\"\n\nFrom ArchWiki\nJump to: navigation, search\n(Montaje automático)\nLine 19: Line 19:\n \nSi ha instalado [[Xfce|Xfce4]] en su sistema, probablemente ya tendrá instalado Thunar.\n \nSi ha instalado [[Xfce|Xfce4]] en su sistema, probablemente ya tendrá instalado Thunar.\n  \n==Montaje automático ==  \n+\n===Montaje automático ===  \n \nThunar utiliza [[gvfs]] para el montaje automático, consulte [[GVFS]] para más detalles para conseguir que funcione.\n \nThunar utiliza [[gvfs]] para el montaje automático, consulte [[GVFS]] para más detalles para conseguir que funcione.\n  \n\nRevision as of 19:45, 25 July 2013\n\nzh-CN:Thunar Template:Article summary start Template:Article summary text Template:Article summary heading Template:Article summary wiki: Thunar viene incorporado por defecto con la instalación del grupo de paquetes xfce4. Template:Article summary text. Template:Article summary end Thunar es un gestor de archivo que está diseñado para ser rápido, ligero, y fácil de usar. Una instalación estándar de xfce4 contendrá Thunar, pero puede ser usado independientemente con otros gestores de ventanas.\n\nInstalación\n\nInstale el paquete thunar disponible en los repositorios oficiales.\n\nSi ha instalado Xfce4 en su sistema, probablemente ya tendrá instalado Thunar.\n\nMontaje automático\n\nThunar utiliza gvfs para el montaje automático, consulte GVFS para más detalles para conseguir que funcione.\n\nAdministrador del Volumen Thunar\n\nMientras Thunar soporta el montaje y desmontaje automático de medios extraíbles, el admnistrador de volúmenes Thunar permite funcionalidades extendidas, tales como la posibilidad de ejecutar comandos particulares para la conexión de un dispositivo periférico o abrir automáticamente una ventana de Thunar al montar el volumen.\n\nInstalación\n\nThunar Volume Manager se puede instalar con el paquete thunar-volman disponible en los repositorios oficiales.\n\nConfiguración\n\nTambién se puede configurar para ejecutar ciertas acciones al conectar cámaras y reproductores de audio. Una vez instalado el plugin:\n\n 1. Lance Thunar y abra Editar -> Preferencias\n 2. Bajo la pestaña \"Avanzado\", marque la casilla \"Habilitar la administración de volúmenes\"\n 3. Pinche en configurar y verifique los siguientes elementos:\n • Montar unidades extraíbles (discos duros) cuando se enciendan.\n • Montar medios extraíbles (USB) cuando se inserten.\n 4. Haga adicionalmente también los cambios que desee (vea el ejemplo a continuación)\n\nHe aquí un ejemplo de ajuste para hacer que Amarok se abra para reproducir un CD de audio al insertarlo.\n\n Multimedia - CD Audio: amarok --cdplay %d\n\nConsejos y trucos\n\nUsar Thunar para explorar zonas remotas\n\nDesde Xfce 4.8 (Thunar 1.2), es posible explorar carpetas en zonas remotas (como servidores FTP o Samba para compartir ficheros) directamente en Thunar, similar a la funcionalidad de GNOME y KDE. Los paquetes gvfs y gvfs-smb son necesarios para habilitar esta funcionalidad. Ambos paquetes están disponibles en los repositorios oficiales.\n\nDespués de reiniciar Xfce se agrega un enlace de \"Red\" a la barra lateral de Thunar y las ubicaciones remotas se pueden abrir con los siguientes esquemas de URI en el campo de diálogo (abierto con Template:Keypress): smb://, ftp://, ssh://\n\nIniciar en modo demonio\n\nThunar puede ejecutarse en modo demonio. Este comportamiento tiene varias ventajas, incluyendo un inicio más rápido de Thunar, haciendo que Thunar se inicialice en segundo plano y sólo se abra una ventana cuando sea necesario (por ejemplo, cuando una unidad USB se inserta).\n\nLas opciones para el inicio automático de Thunar pueden ser o bien usando .xinitrc o bien usando un script de inicio automático (por ejemplo, en Openbox configurando el archivo ~/.config/openbox/autostart). Con ambos métodos se puede poner en marcha, y su elección dependerá de las preferencias de cada usuario.\n\nPara ejecutar Thunar como demonio, puede hacerlo añadiéndolo a su script de arranque automático o ejecutándolo desde un terminal, de este modo:\n\n$ thunar --daemon &\n\nAjustar el tema de iconos\n\nAl usar Thunar fuera de Gnome o Xfce, ciertos paquetes y configuraciones que se utilizan para controlar los iconos pueden estar ausentes. Los gestores de ventanas como Awesome y Xmonad no vienen con el administrador XSETTINGS, que es donde Thunar busca primero su configuración de icono. Es posible instalar y ejecutar xfce-mcs-manager mediante un script de inicio si se va a utilizar Xfce4 conjuntamente con muchas aplicaciones de Gnome. La configuración de gtk-icon-theme-name para gtk2 se puede ajustar para un usuario mediante la adición de algo parecido a lo siguiente en ~/.gtkrc-2.0:\n\n gtk-icon-theme-name = \"Tango\"\n\nPor supuesto, al instalar el paquete gnome-icon-theme dará a Thunar un tema de iconos diferente a los iconos predeterminados para el resto de los elementos.\n\n# pacman -S gnome-icon-theme\n\nResolver problemas con el arranque lento \"en frío\"\n\nAlgunas usuarios todavía tienen problemas con Thunar que tarda mucho tiempo para iniciar la primera vez. Esto es debido a que gvfs verifica la red, impidiendo a Thunar que arranque hasta que gvfs finalice sus operaciones. Para cambiar este comportamiento, edite el archivo usr/share/gvfs/mounts/network.mount y modifique automount=true a automount=false.\n\nOtros plugins y addons\n\nMuchos de estos plugins son parte del grupo xfce4-goodies, así que si lo has descargado, es probable que tenga todos ellos.\n\nPlugin Thunar Archive\n\nEl Plugin Thunar Archive es un frontend para presentar software de compresión de archivos, tales como File Roller, Ark o Xarchiver, que posibilita la integración de uno de estos programas en el menú de Thunar para abrir y descomprimir archivos.\n\nInstalación\n\nSe puede instalar ejecutando:\n\n# pacman -S thunar-archive-plugin\n\nPlugin Thunar Media Tags\n\nEl plugin multimedia tags mostrará información detallada acerca de los archivos multimedia. Es compatible con la etiqueta ID3 (el formato de archivo MP3) y los formatos Ogg/Vorbis. También tiene un renombrador y permite la edición de las etiquetas de los elementos multimedia.\n\nInstalación\n\nSe puede instalar ejecutando:\n\n# pacman -S thunar-media-tags-plugin\n\nThunar thumbnails\n\nThunar se basa en un programa externo llamado tumbler para generar imágenes en miniatura. tumbler se puede instalar desde los repositorios oficiales.\n\n# pacman -S tumbler\n\nPara generar miniaturas de vídeo, se tienen que instalar ffmpegthumbnailer.\n\n# pacman -S ffmpegthumbnailer\n\nThunar Shares\n\nThunar Shares es un plugin que le permite compartir rápidamente una carpeta con Samba desde Thunar sin requerir acceso como root.\n\nInstale el paquete thunar-shares-pluginAUR disponible en AUR. Véase esto para configurarlo.\n\nConfiguración\n\nMerge-arrows-2.pngThis article or section is a candidate for merging with Samba.Merge-arrows-2.png\n\nNotes: These are samba configuration, should merge to Samba and leave link here. (Discuss in Talk:Thunar (Español)#)\n\nÉsto marca los objetos nombrados para la exportación automática al entorno de comandos que se ejecutan posteriormente:\n\n# export USERSHARES_DIR=\"/var/lib/samba/usershares\"\n# export USERSHARES_GROUP=\"sambashare\"\n\nÉsto crea el directorio usershares en var/lib/samba:\n\n# mkdir -p ${USERSHARES_DIR}\n\nÉsto crea el grupo sambashare:\n\n# groupadd ${USERSHARES_GROUP}\n\nÉsto cambia el propietario del directorio y el grupo que acaba de crear para root:\n\n# chown root:${USERSHARES_GROUP} ${USERSHARES_DIR}\n\nÉsto cambia los permisos del directorio usershares para que los usuarios del grupo sambashare puedan leer, escribir y ejecutar archivos:\n\n# chmod 01770 ${USERSHARES_DIR}\n\nUtilizando su editor de texto favorito como root, cree el archivo /etc/samba/smb.conf\n\n# joe /etc/samba/smb.conf\n\nUtilice este archivo de configuración smb.conf:\n\n/etc/samba/smb.conf\n ##This is the main Samba configuration file. You should read the\n ##smb.conf(5) manual page in order to understand the options listed\n ##here. Samba has a huge number of configurable options (perhaps too\n ##many!) most of which are not shown in this example\n ##\n ##For a step to step guide on installing, configuring and using samba, \n ## read the Samba-HOWTO-Collection. This may be obtained from:\n ## http://www.samba.org/samba/docs/Samba-HOWTO-Collection.pdf\n ##\n ## Many working examples of smb.conf files can be found in the \n ## Samba-Guide which is generated daily and can be downloaded from: \n ## http://www.samba.org/samba/docs/Samba-Guide.pdf\n ##\n ## Any line which starts with a ; (semi-colon) or a # (hash) \n ## is a comment and is ignored. In this example we will use a #\n ## for commentry and a ; for parts of the config file that you\n ## may wish to enable\n ##\n ## NOTE: Whenever you modify this file you should run the command \"testparm\"\n ## to check that you have not made any basic syntactic errors. \n ##\n #[global]\n # workgroup = WORKGROUP\n # security = share\n # server string = My Share\n # load printers = yes\n # log file = /var/log/samba/%m.log\n # max log size = 50\n # usershare path = /var/lib/samba/usershares\n # usershare max shares = 100\n # usershare allow guests = yes\n # usershare owner only = yes\n # \n #\n # #Windows Internet Name Serving Support Section:\n #\n # #WINS Support - Tells the NMBD component of Samba to enable it's WINS Server\n #; wins support = yes\n #\n ## WINS Server - Tells the NMBD components of Samba to be a WINS Client\n ##\tNote: Samba can be either a WINS Server, or a WINS Client, but NOT both\n #; wins server = w.x.y.z\n #\n ##WINS Proxy - Tells Samba to answer name resolution queries on\n ## behalf of a non WINS capable client, for this to work there must be\n ## at least one\tWINS Server on the network. The default is NO.\n #; wins proxy = yes\n\nGuarde el archivo y luego agregue su usuario al grupo sambashares sustituyendo \"your_username\" con su nombre de usuario:\n\n# usermod -a -G ${USERSHARES_GROUP} your_username\n\nReinicie Samba:\n\n# /etc/rc.d/samba restart\n\nSi aparece el error You are not the owner of the folder - No eres el propietario de la carpeta, simplemente pruebe reiniciando el sistema. Para tener samba siempre activo, añada samba a los demonios en su archivo /etc/rc.conf . Para obtener más información, visite la página wiki Samba .\n\nAcciones personalizadas\n\nEsta sección trata de acciones personalizadas útiles que se pueden obtener a través del menú Editar -> Configuración de acciones personalizadas. Se enumeran más ejemplos en la wiki de thunar.\n\nEscanear virus\n\nPara utilizar esta acción es necesario tener instalado clamav y clamtk.\n\nNombre Comando Patrones de archivos Aparecerá si está en la selección\nAnalizar en busca de virus clamtk %F * Seleccionar todo\n\n\nEnlace a Dropbox\n\nNombre Comando Patrones de archivos Aparecerá si está en la selección\nEnlace a Dropbox ln -s %f /ruta/a/Carpeta_Dropbox * Directorios, otros archivos\n\nTenga en cuenta que cuando se utilizan muchos enlaces simbólicos de archivos y carpetas a un lugar particular, podría ser útil ponerlos en la carpeta Enviar a del menú contextual para evitar que el mismo menú se sobredimensione. Esto es bastante fácil de lograr y requiere un archivo .desktop en ~/.local/share/Thunar/sendto para cada acción a realizar. Por ejemplo, si quiere un enlace simbólico a la carpeta dropbox en Enviar a, creamos un archivo dropbox_folder.desktop con el contenido de abajo. La nueva acción personalizada se activará después de reiniciar Thunar.\n\n[Desktop Entry]\nType=Application\nVersion=1.0\nEncoding=UTF-8\nExec=ln -s %f /percorso/alla/cartella/dropbox\nIcon=/usr/share/icons/dropbox.png\nName=Dropbox\n\nEnlaces y Referencias"},"metadata":{"kind":"string","value":"{\n \"url\": \"https://wiki.archlinux.org/index.php?title=Thunar_(Espa%C3%B1ol)&diff=next&oldid=260688\",\n \"source_domain\": \"wiki.archlinux.org\",\n \"snapshot_id\": \"crawl=CC-MAIN-2018-26\",\n \"warc_metadata\": {\n \"Content-Length\": \"45381\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:PQHNA2QAAOX6ZIX6K3TAQ2ZDSEL577NH\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2018-06-21T00:43:06Z\",\n \"WARC-IP-Address\": \"138.201.81.199\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:IIL4W4EKLADQAHMV6DQE4HX3DXDNEWZD\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://wiki.archlinux.org/index.php?title=Thunar_(Espa%C3%B1ol)&diff=next&oldid=260688\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"robots: classic\\r\\nhostname: ip-10-109-239-82.ec2.internal\\r\\nsoftware: Nutch 1.6 (CC)\\r\\nisPartOf: CC-MAIN-2018-26\\r\\noperator: Common Crawl Admin\\r\\ndescription: Wide crawl of the web for June 2018\\r\\npublisher: Common Crawl\\r\\nformat: WARC File Format 1.0\\r\\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 51,\n 52,\n 66,\n 94,\n 115,\n 133,\n 135,\n 223,\n 225,\n 313,\n 316,\n 342,\n 344,\n 372,\n 374,\n 491,\n 493,\n 610,\n 613,\n 614,\n 649,\n 650,\n 1148,\n 1149,\n 1161,\n 1162,\n 1230,\n 1231,\n 1310,\n 1311,\n 1330,\n 1331,\n 1440,\n 1441,\n 1474,\n 1475,\n 1802,\n 1803,\n 1815,\n 1816,\n 1927,\n 1928,\n 1942,\n 1943,\n 2077,\n 2078,\n 2126,\n 2220,\n 2284,\n 2353,\n 2410,\n 2497,\n 2498,\n 2603,\n 2604,\n 2647,\n 2648,\n 2666,\n 2667,\n 2707,\n 2708,\n 3047,\n 3048,\n 3288,\n 3289,\n 3313,\n 3314,\n 3589,\n 3590,\n 3902,\n 3903,\n 4047,\n 4048,\n 4068,\n 4069,\n 4095,\n 4096,\n 4687,\n 4688,\n 4719,\n 4720,\n 4877,\n 4878,\n 4907,\n 4908,\n 4959,\n 4960,\n 5315,\n 5316,\n 5339,\n 5340,\n 5464,\n 5465,\n 5487,\n 5488,\n 5733,\n 5734,\n 5746,\n 5747,\n 5777,\n 5778,\n 5812,\n 5813,\n 5838,\n 5839,\n 6116,\n 6117,\n 6129,\n 6130,\n 6160,\n 6161,\n 6198,\n 6199,\n 6217,\n 6218,\n 6368,\n 6369,\n 6389,\n 6390,\n 6466,\n 6467,\n 6497,\n 6498,\n 6512,\n 6513,\n 6643,\n 6644,\n 6736,\n 6737,\n 6751,\n 6752,\n 6851,\n 6852,\n 6969,\n 6970,\n 7089,\n 7090,\n 7142,\n 7181,\n 7182,\n 7235,\n 7236,\n 7265,\n 7266,\n 7297,\n 7298,\n 7329,\n 7330,\n 7413,\n 7414,\n 7465,\n 7466,\n 7603,\n 7604,\n 7636,\n 7637,\n 7723,\n 7724,\n 7750,\n 7751,\n 7799,\n 7800,\n 7820,\n 7887,\n 7957,\n 8028,\n 8083,\n 8088,\n 8162,\n 8227,\n 8292,\n 8297,\n 8363,\n 8434,\n 8488,\n 8493,\n 8557,\n 8623,\n 8688,\n 8712,\n 8717,\n 8796,\n 8862,\n 8867,\n 8879,\n 8906,\n 8928,\n 8958,\n 8983,\n 9021,\n 9044,\n 9092,\n 9124,\n 9158,\n 9190,\n 9196,\n 9200,\n 9252,\n 9256,\n 9337,\n 9363,\n 9367,\n 9441,\n 9518,\n 9547,\n 9551,\n 9617,\n 9690,\n 9755,\n 9779,\n 9780,\n 9901,\n 9902,\n 9952,\n 9953,\n 9969,\n 9970,\n 9996,\n 9997,\n 10285,\n 10286,\n 10310,\n 10311,\n 10503,\n 10504,\n 10519,\n 10520,\n 10592,\n 10593,\n 10663,\n 10719,\n 10720,\n 10721,\n 10738,\n 10739,\n 10809,\n 10889,\n 10890,\n 11461,\n 11462,\n 11478,\n 11495,\n 11507,\n 11522,\n 11568,\n 11602,\n 11615,\n 11616\n ],\n \"line_end_idx\": [\n 51,\n 52,\n 66,\n 94,\n 115,\n 133,\n 135,\n 223,\n 225,\n 313,\n 316,\n 342,\n 344,\n 372,\n 374,\n 491,\n 493,\n 610,\n 613,\n 614,\n 649,\n 650,\n 1148,\n 1149,\n 1161,\n 1162,\n 1230,\n 1231,\n 1310,\n 1311,\n 1330,\n 1331,\n 1440,\n 1441,\n 1474,\n 1475,\n 1802,\n 1803,\n 1815,\n 1816,\n 1927,\n 1928,\n 1942,\n 1943,\n 2077,\n 2078,\n 2126,\n 2220,\n 2284,\n 2353,\n 2410,\n 2497,\n 2498,\n 2603,\n 2604,\n 2647,\n 2648,\n 2666,\n 2667,\n 2707,\n 2708,\n 3047,\n 3048,\n 3288,\n 3289,\n 3313,\n 3314,\n 3589,\n 3590,\n 3902,\n 3903,\n 4047,\n 4048,\n 4068,\n 4069,\n 4095,\n 4096,\n 4687,\n 4688,\n 4719,\n 4720,\n 4877,\n 4878,\n 4907,\n 4908,\n 4959,\n 4960,\n 5315,\n 5316,\n 5339,\n 5340,\n 5464,\n 5465,\n 5487,\n 5488,\n 5733,\n 5734,\n 5746,\n 5747,\n 5777,\n 5778,\n 5812,\n 5813,\n 5838,\n 5839,\n 6116,\n 6117,\n 6129,\n 6130,\n 6160,\n 6161,\n 6198,\n 6199,\n 6217,\n 6218,\n 6368,\n 6369,\n 6389,\n 6390,\n 6466,\n 6467,\n 6497,\n 6498,\n 6512,\n 6513,\n 6643,\n 6644,\n 6736,\n 6737,\n 6751,\n 6752,\n 6851,\n 6852,\n 6969,\n 6970,\n 7089,\n 7090,\n 7142,\n 7181,\n 7182,\n 7235,\n 7236,\n 7265,\n 7266,\n 7297,\n 7298,\n 7329,\n 7330,\n 7413,\n 7414,\n 7465,\n 7466,\n 7603,\n 7604,\n 7636,\n 7637,\n 7723,\n 7724,\n 7750,\n 7751,\n 7799,\n 7800,\n 7820,\n 7887,\n 7957,\n 8028,\n 8083,\n 8088,\n 8162,\n 8227,\n 8292,\n 8297,\n 8363,\n 8434,\n 8488,\n 8493,\n 8557,\n 8623,\n 8688,\n 8712,\n 8717,\n 8796,\n 8862,\n 8867,\n 8879,\n 8906,\n 8928,\n 8958,\n 8983,\n 9021,\n 9044,\n 9092,\n 9124,\n 9158,\n 9190,\n 9196,\n 9200,\n 9252,\n 9256,\n 9337,\n 9363,\n 9367,\n 9441,\n 9518,\n 9547,\n 9551,\n 9617,\n 9690,\n 9755,\n 9779,\n 9780,\n 9901,\n 9902,\n 9952,\n 9953,\n 9969,\n 9970,\n 9996,\n 9997,\n 10285,\n 10286,\n 10310,\n 10311,\n 10503,\n 10504,\n 10519,\n 10520,\n 10592,\n 10593,\n 10663,\n 10719,\n 10720,\n 10721,\n 10738,\n 10739,\n 10809,\n 10889,\n 10890,\n 11461,\n 11462,\n 11478,\n 11495,\n 11507,\n 11522,\n 11568,\n 11602,\n 11615,\n 11616,\n 11637\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 11637,\n \"ccnet_original_nlines\": 248,\n \"rps_doc_curly_bracket\": 0.0010311900405213237,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.11764705926179886,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.021836010739207268,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.2232620269060135,\n \"rps_doc_frac_unique_words\": 0.4201834797859192,\n \"rps_doc_mean_word_length\": 5.633639335632324,\n \"rps_doc_num_sentences\": 99,\n \"rps_doc_symbol_to_word_ratio\": 0.040998220443725586,\n \"rps_doc_unigram_entropy\": 5.8703293800354,\n \"rps_doc_word_count\": 1635,\n \"rps_doc_frac_chars_dupe_10grams\": 0.07002496719360352,\n \"rps_doc_frac_chars_dupe_5grams\": 0.09781783074140549,\n \"rps_doc_frac_chars_dupe_6grams\": 0.07957875728607178,\n \"rps_doc_frac_chars_dupe_7grams\": 0.07957875728607178,\n \"rps_doc_frac_chars_dupe_8grams\": 0.07002496719360352,\n \"rps_doc_frac_chars_dupe_9grams\": 0.07002496719360352,\n \"rps_doc_frac_chars_top_2gram\": 0.01367930043488741,\n \"rps_doc_frac_chars_top_3gram\": 0.01042232010513544,\n \"rps_doc_frac_chars_top_4gram\": 0.007816740311682224,\n \"rps_doc_books_importance\": -1273.0250244140625,\n \"rps_doc_books_importance_length_correction\": -1273.0250244140625,\n \"rps_doc_openwebtext_importance\": -615.3908081054688,\n \"rps_doc_openwebtext_importance_length_correction\": -615.3908081054688,\n \"rps_doc_wikipedia_importance\": -455.8459167480469,\n \"rps_doc_wikipedia_importance_length_correction\": -455.8459167480469\n },\n \"fasttext\": {\n \"dclm\": 0.8826531767845154,\n \"english\": 0.01752639003098011,\n \"fineweb_edu_approx\": 1.757310390472412,\n \"eai_general_math\": 0.009295700117945671,\n \"eai_open_web_math\": 0.33230161666870117,\n \"eai_web_code\": 0.6249059438705444\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.462\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"004.67\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n },\n \"secondary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n },\n \"secondary\": {\n \"code\": \"23\",\n \"label\": \"Tutorial\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Graduate/Expert Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192845,"cells":{"id":{"kind":"number","value":8543941865525169000,"string":"8,543,941,865,525,169,000"},"text":{"kind":"string","value":"3\n$\\begingroup$\n\nI come from a primarily Bayesian background when using performing statistical analysis. In the context of linear regression, I would look at the posterior distributions for each regression coefficient. If a given coefficient was distributed ~N(1,1), I might not be terribly convinced of the associated variable's influence on the dependent variable.\n\nFrom a frequentist perspective, regression coefficients often have p-values assigned. And I'm not quite sure what to make of this coming from a bayesian, full posterior interpretation. Is the idea that there's only an x% chance that we would have observed this specific regression coefficient inferred by accident?\n\n$\\endgroup$\n2\n\n3 Answers 3\n\n19\n$\\begingroup$\n\nA p value is the probability of observing a test statistic as or more extreme than the researcher's own test statistic, assuming the null hypothesis, and an assumed distribution model are both true.\n\nSo when you see frequentist statistical software provide regression output that includes something like:\n\nname estimate S.E. t (or z) p value\ncons 3.0 0.015 200 <0.001\nbeta 0.5 0.18 2.78 0.003\n\nThe default null hypothesis for regression coefficients in most stats software I am familiar with is $\\text{H}_{0}\\text{: }\\beta = 0$, with $\\text{H}_{\\text{A}}\\text{: }\\beta \\ne 0$. You should read the $p = 0.003$ as $p = P(|T_{\\text{df}}|\\ge |t|)$ given $\\text{H}_{0}$, or in plain language: the probability of observing a value of $\\widehat{\\beta}$ as or more extreme than 0.5 is 0.003, assuming the null hypothesis is true (and assuming Student's t distribution truly describes the distribution of your test statistic). If a priori you had an $\\alpha =0.01$, then you would interpret that p value as evidence against the null hypothesis, and for the alternative hypothesis (i.e. you found evidence that $\\beta \\ne 0$).\n\n$\\endgroup$\n6\n • 1\n $\\begingroup$ Isn't the distribution model part of the null hypothesis? A complete null hypothesis would be something like \"All the variables have IID normal distributions\" (if the means are identical, then $\\beta=0$, and if the SD are the same, then $\\hat \\beta$ will have a Student's t distribution). $\\endgroup$ Aug 19, 2021 at 2:54\n • 1\n $\\begingroup$ I think the null hypothesis and the assumptions of the test are typically considered to be two different things. That's certainly the way I think about it, & I've never seen a book that introduced the null as, say, \"$H_0: \\mu_1 = \\mu_2\\ \\&\\ \\mu_2-\\mu_1 \\sim \\mathcal N(0, \\sigma^2_{\\mu_2-\\mu_1})$\". $\\endgroup$ Aug 19, 2021 at 13:21\n • $\\begingroup$ @Alexis: I think it makes sense to mention that the $H_0$ for a specific $\\beta$ implies that all other variables are still in the model (if there is more than one) and can be nonzero. $\\endgroup$ Aug 19, 2021 at 13:44\n • $\\begingroup$ @Acccumulation: You are right that the full specification of the $H_0$ would require all other model assumptions (iid normal should hold for error terms, not for \"all variables\"). However, the test statistic is constructed to specifically distinguish $\\beta=0$ from $\\beta\\neq 0$. Technically the rest of the assumptions go into both $H_0$ and $H_A$. $\\endgroup$ Aug 19, 2021 at 13:48\n • $\\begingroup$ @Acccumulation I like to think of the distribution model as part of the null hypothesis. However, not all statisticians agree with that (like the lovely gung - Reinstate Monica), so I do not get pushy about it. :) $\\endgroup$\n – Alexis\n Aug 19, 2021 at 16:46\n0\n$\\begingroup$\n\nThese numbers are unreliable if your predictors are correlated.\n\nSuppose for example that the value to be predicted is the sum of two hidden N(0,1) random variables $Y=Z_1+Z_2$ and $Z_2$ is unobserved, and you have observations of $X_1 = Z_1+N(0, 0.01), X_2 = Z_1+N(0, 0.01)$\n\nThen the linear regression is degenerate. Any solution is equally good, in which the coefficients of $X_1, X_2$ sum to one. No magic with p-values can help you choose.\n\nPerfect degeneracy like this is rare, but some level of correlation is common. Take home lesson: correlation is not causation.\n\n$\\endgroup$\n4\n • 2\n $\\begingroup$ Sorry, how does the “take home lesson” follow from the earlier claims? $\\endgroup$ Aug 18, 2021 at 15:50\n • $\\begingroup$ \"Any solution is equally good, in which the coefficients of X1,X2 sum to one.\" Do you mean \"All solutions in which the coefficient of $X_1$ and $X_2$ sum to one are equally good\"? $\\endgroup$ Aug 19, 2021 at 2:57\n • 4\n $\\begingroup$ @AryaMcCarthy, well, the answer correlates with the take home lesson, but it doesn't cause it. $\\endgroup$\n – justhalf\n Aug 19, 2021 at 9:59\n • 1\n $\\begingroup$ \"These numbers are unreliable if your predictors are correlated.\" These numbers are perfectly reliable if they are not interpreted as being more than they actually are. They are not meant to be \"magic to help choosing\". $\\endgroup$ Aug 19, 2021 at 13:50\n0\n$\\begingroup$\n\nIn most regression software you can also request confidence intervals for the regression coefficients. The confidence interval is a set of plausible true values of the parameter, given the observed data. A 90% confidence interval contains all the hypotheses for the parameter under which the statistic is not significant at the two-sided 10% level. While this does not have the same interpretation as a 90% credible interval, it serves the same purpose. If the 90% confidence interval contains zero (two-sided p-value testing $H_0:\\beta=0$ is greater than 0.10) you would not be convinced at the two-sided 10% level of the association between the covariate and the dependent variable. If the 90% confidence interval excludes zero (two-sided p-value testing $H_0:\\beta=0$ is less than 0.10) this could be interpreted as evidence (not proof) of an association at the two-sided 10% level (or one-sided 5% level).\n\nIf you use something like Proc MCMC you are used to getting kernel density estimates for the posterior distribution of a parameter. You can analogously produce confidence curves using the point estimate and standard error. These curves show p-values and confidence intervals of all levels for hypotheses concerning the parameter.\n\nThe upper-tailed p-value for a standard issue Wald test as a function of the hypothesis would take the form\n\n$$H(\\beta,\\boldsymbol{x})=1-\\Phi\\bigg(\\frac{\\hat{\\beta}-\\beta}{\\hat{\\text{se}}}\\bigg).$$\n\nAnalogously, the lower-tailed p-value is $$H^{-}(\\beta,\\boldsymbol{x})=\\Phi\\bigg(\\frac{\\hat{\\beta}-\\beta}{\\hat{\\text{se}}}\\bigg).$$\n\nThe corresponding confidence curve, $C(\\beta,\\boldsymbol{x})$, can then be defined as\n\n$$C(\\beta,\\boldsymbol{x})=H(\\beta,\\boldsymbol{x})\\text{, if $\\beta < \\hat{\\beta}$ }$$ $$C(\\beta,\\boldsymbol{x})=H^{-}(\\beta,\\boldsymbol{x})\\text{, if $\\beta > \\hat{\\beta}$ }$$.\n\nThe confidence curve will look like a teepee or a pyramid on the parameter space depicting ex-post sampling probability of the experiment (frequentist confidence).\n\nIf, say, you have an estimated beta coefficient of 0.5 and an estimated standard error of 0.18, the figure below depicts the corresponding confidence curve for inference on the unknown fixed true $\\beta$.\n\nenter image description here\n\ndata norm;\ndo beta=-0.6 to 1.6 by 0.001;\nbeta_hat=0.5;\nse=0.18;\n\nC_lower=1-cdf('normal',(beta_hat-beta)/se,0,1); if beta gt beta_hat then C_lower=.;\nC_upper=cdf('normal',(beta_hat-beta)/se,0,1); if beta lt beta_hat then C_upper=.;\n\noutput;\nend;\nrun;\n\nproc sql noprint;\nselect max(beta)\ninto: lower\nfrom norm\nwhere . lt C_lower le 0.05;\n\nselect min(beta)\ninto: upper\nfrom norm\nwhere . lt C_upper le 0.05;\nquit;\n\ndata norm;\nset norm;\nlower=&lower.;\nupper=&upper.;\nyscatter=-0.035;\nrun;\n\nods escapechar=\"^\";\nods graphics / height=3in width=6in border=no;\nproc sgplot data=norm noautolegend;\nseries x=beta y=C_lower / lineattrs=(color=darkblue) name=\"cc\" legendlabel=\"Confidence curve (one-sided p-value) with 90% confidence interval\";\nseries x=beta y=C_upper / lineattrs=(color=darkblue);\nscatter x=beta_hat y=yscatter / xerrorlower=lower xerrorupper=upper errorbarattrs=(color=darkblue) markerattrs=(color=darkblue);\nrefline 0 / axis=y;\nyaxis max=0.6 label=\"p-value\" min=0 offsetmin=0.1;\nxaxis label=\"^{unicode beta}\" min=-0.5 max=1.5;\nkeylegend \"cc\";\nrun;\n$\\endgroup$\n2\n • $\\begingroup$ \"all the hypotheses for the parameter that are not significant at the two-sided 10% level\" Hypotheses do not have significance level. The precise statement is \"all the hypotheses under which the statistic is not significant at the two-sided 10% level\". $\\endgroup$ Aug 19, 2021 at 3:00\n • $\\begingroup$ Thank you! Duly noted and corrected. $\\endgroup$ Aug 19, 2021 at 13:04\n\nYour Answer\n\nBy clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.\n\nNot the answer you're looking for? Browse other questions tagged or ask your own question."},"metadata":{"kind":"string","value":"{\n \"url\": \"https://stats.stackexchange.com/questions/540575/frequentist-perspective-of-regression-coefficients-and-significance-coming-from\",\n \"source_domain\": \"stats.stackexchange.com\",\n \"snapshot_id\": \"CC-MAIN-2024-22\",\n \"warc_metadata\": {\n \"Content-Length\": \"200548\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:JMQY6I5LJOHOM6AQX3YDIVV7CNRMLAKU\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2024-05-18T14:39:39Z\",\n \"WARC-IP-Address\": \"172.64.144.30\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:EOEQ267HFEITDDMACWGXG226GJQOPXEJ\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://stats.stackexchange.com/questions/540575/frequentist-perspective-of-regression-coefficients-and-significance-coming-from\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"isPartOf: CC-MAIN-2024-22\\r\\npublisher: Common Crawl\\r\\ndescription: Wide crawl of the web for May 2024\\r\\noperator: Common Crawl Admin (info@commoncrawl.org)\\r\\nhostname: ip-10-67-67-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/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 2,\n 16,\n 17,\n 367,\n 368,\n 683,\n 684,\n 696,\n 698,\n 699,\n 711,\n 712,\n 715,\n 729,\n 730,\n 929,\n 930,\n 1035,\n 1036,\n 1072,\n 1098,\n 1123,\n 1124,\n 1847,\n 1848,\n 1860,\n 1862,\n 1868,\n 2208,\n 2214,\n 2565,\n 2802,\n 3205,\n 3449,\n 3462,\n 3488,\n 3490,\n 3504,\n 3505,\n 3569,\n 3570,\n 3781,\n 3782,\n 3950,\n 3951,\n 4078,\n 4079,\n 4091,\n 4093,\n 4099,\n 4222,\n 4453,\n 4459,\n 4584,\n 4599,\n 4624,\n 4630,\n 4902,\n 4904,\n 4918,\n 4919,\n 5829,\n 5830,\n 6160,\n 6161,\n 6269,\n 6270,\n 6359,\n 6360,\n 6492,\n 6493,\n 6579,\n 6580,\n 6757,\n 6758,\n 6922,\n 6923,\n 7128,\n 7129,\n 7158,\n 7159,\n 7170,\n 7200,\n 7214,\n 7223,\n 7224,\n 7308,\n 7390,\n 7391,\n 7399,\n 7404,\n 7409,\n 7410,\n 7428,\n 7445,\n 7457,\n 7467,\n 7495,\n 7496,\n 7513,\n 7525,\n 7535,\n 7563,\n 7569,\n 7570,\n 7581,\n 7591,\n 7606,\n 7621,\n 7638,\n 7643,\n 7644,\n 7664,\n 7711,\n 7747,\n 7891,\n 7945,\n 8074,\n 8094,\n 8145,\n 8193,\n 8209,\n 8214,\n 8226,\n 8228,\n 8532,\n 8621,\n 8622,\n 8634,\n 8635,\n 8751,\n 8752\n ],\n \"line_end_idx\": [\n 2,\n 16,\n 17,\n 367,\n 368,\n 683,\n 684,\n 696,\n 698,\n 699,\n 711,\n 712,\n 715,\n 729,\n 730,\n 929,\n 930,\n 1035,\n 1036,\n 1072,\n 1098,\n 1123,\n 1124,\n 1847,\n 1848,\n 1860,\n 1862,\n 1868,\n 2208,\n 2214,\n 2565,\n 2802,\n 3205,\n 3449,\n 3462,\n 3488,\n 3490,\n 3504,\n 3505,\n 3569,\n 3570,\n 3781,\n 3782,\n 3950,\n 3951,\n 4078,\n 4079,\n 4091,\n 4093,\n 4099,\n 4222,\n 4453,\n 4459,\n 4584,\n 4599,\n 4624,\n 4630,\n 4902,\n 4904,\n 4918,\n 4919,\n 5829,\n 5830,\n 6160,\n 6161,\n 6269,\n 6270,\n 6359,\n 6360,\n 6492,\n 6493,\n 6579,\n 6580,\n 6757,\n 6758,\n 6922,\n 6923,\n 7128,\n 7129,\n 7158,\n 7159,\n 7170,\n 7200,\n 7214,\n 7223,\n 7224,\n 7308,\n 7390,\n 7391,\n 7399,\n 7404,\n 7409,\n 7410,\n 7428,\n 7445,\n 7457,\n 7467,\n 7495,\n 7496,\n 7513,\n 7525,\n 7535,\n 7563,\n 7569,\n 7570,\n 7581,\n 7591,\n 7606,\n 7621,\n 7638,\n 7643,\n 7644,\n 7664,\n 7711,\n 7747,\n 7891,\n 7945,\n 8074,\n 8094,\n 8145,\n 8193,\n 8209,\n 8214,\n 8226,\n 8228,\n 8532,\n 8621,\n 8622,\n 8634,\n 8635,\n 8751,\n 8752,\n 8842\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 8842,\n \"ccnet_original_nlines\": 132,\n \"rps_doc_curly_bracket\": 0.008369149640202522,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.28681424260139465,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.02791145071387291,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.35996150970458984,\n \"rps_doc_frac_unique_words\": 0.3810264468193054,\n \"rps_doc_mean_word_length\": 5.135303497314453,\n \"rps_doc_num_sentences\": 93,\n \"rps_doc_symbol_to_word_ratio\": 0,\n \"rps_doc_unigram_entropy\": 5.552037715911865,\n \"rps_doc_word_count\": 1286,\n \"rps_doc_frac_chars_dupe_10grams\": 0.05148395150899887,\n \"rps_doc_frac_chars_dupe_5grams\": 0.13355542719364166,\n \"rps_doc_frac_chars_dupe_6grams\": 0.07631737738847733,\n \"rps_doc_frac_chars_dupe_7grams\": 0.05663233995437622,\n \"rps_doc_frac_chars_dupe_8grams\": 0.05148395150899887,\n \"rps_doc_frac_chars_dupe_9grams\": 0.05148395150899887,\n \"rps_doc_frac_chars_top_2gram\": 0.008328289724886417,\n \"rps_doc_frac_chars_top_3gram\": 0.013628100045025349,\n \"rps_doc_frac_chars_top_4gram\": 0.01665657013654709,\n \"rps_doc_books_importance\": -1059.1103515625,\n \"rps_doc_books_importance_length_correction\": -1059.1103515625,\n \"rps_doc_openwebtext_importance\": -542.840576171875,\n \"rps_doc_openwebtext_importance_length_correction\": -542.840576171875,\n \"rps_doc_wikipedia_importance\": -406.6361999511719,\n \"rps_doc_wikipedia_importance_length_correction\": -406.6361999511719\n },\n \"fasttext\": {\n \"dclm\": 0.11536514759063721,\n \"english\": 0.8272268176078796,\n \"fineweb_edu_approx\": 2.0153210163116455,\n \"eai_general_math\": 0.8837906718254089,\n \"eai_open_web_math\": 0.693799614906311,\n \"eai_web_code\": 0.32974982261657715\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"519.5\",\n \"labels\": {\n \"level_1\": \"Science and Natural history\",\n \"level_2\": \"Mathematics\",\n \"level_3\": \"Probabilities; or, Mathematical statistics\"\n }\n },\n \"secondary\": {\n \"code\": \"519.536\",\n \"labels\": {\n \"level_1\": \"Science and Natural history\",\n \"level_2\": \"Mathematics\",\n \"level_3\": \"Probabilities; or, Mathematical statistics\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Analyze\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Social/Forum\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"1\",\n \"label\": \"Leftover HTML\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Text Extraction Errors\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Missing Images or Figures\"\n },\n \"secondary\": {\n \"code\": \"6\",\n \"label\": \"Indeterminate\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"18\",\n \"label\": \"Q&A Forum\"\n },\n \"secondary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Advanced Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"5\",\n \"label\": \"Exceptionally Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Graduate/Expert Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192846,"cells":{"id":{"kind":"number","value":-1964914325492552200,"string":"-1,964,914,325,492,552,200"},"text":{"kind":"string","value":"Examen Parcial de Operaciones Fundamentales\n • 1. Suma los siguientes polinomios (3x2+2x-5)+(7-3x+4x2)\nA) -7x2+x-2\nB) 7x2-5x+9\nC) 7x2+5x-9\nD) 7x2-x+2\n • 2. Suma los siguientes polinomios (4m3-2m2+5m)+(-2m-3m2+m3)\nA) -5m3+5m2-3m\nB) 6m3-5m2+6m\nC) -6m3+5m2-6m\nD) 5m3-5m2+3m\n • 3. Suma los siguientes polinomios (2x3+5x−3)+(4x−3x2+2x3)\nA) 4x3-3x2+9x-3\nB) -4x3+3x2-9x+3\nC) -6x3+2x2-7x-3\nD) 6x3+2x2+7x-3\n • 4. Suma los siguientes polinomios (2x2+5)+(x3-5x2-2x+3)\nA) x3-5x2-2x+3\nB) -x3-3x2+2x+8\nC) x3-3x2-2x+8\nD) 2x2+5\n • 5. Suma los siguientes polinomios (-4x³+6x²-8x+1)+(2x²+7x-7)\nA) -4x3+8x2+x+6\nB) 2x²+7x-7\nC) -4x3+8x2-x-6\nD) -4x³+6x²-8x+1\n • 6. Resta los siguientes polinomios (x+2)-(x+2)\nA) 2X+4\nB) 0\nC) X+4\nD) X2+4\n • 7. Resta los siguientes polinomios (x+4)-(2X+5)\nA) -3X-9\nB) 3X-9\nC) -X-1\nD) 3X+9\n • 8. Resta los siguientes polinomios (X2+3x+5)-(X2+3x+5)\nA) 0\nB) 22+6X-10\nC) X2+6x+10\nD) 24+6X+10\n • 9. Resta los siguientes polinomios (X2+3x+5)-(X4+3x+5)\nA) -X4+X2\nB) X4+5X+10\nC) X4+5X-10\nD) X4+5X+10\n • 10. Resta los siguientes polinomios (X2+3x+5)-(X4+2x+6)\nA) -X4+5X+10\nB) -X4+X2\nC) -X4+X2+X-1\nD) X4+5X+10\n • 11. Multiplica los siguientes monomios ( - 4x )( 5x )\nA) - 20x2\nB) - 20x3\nC) - 20x\nD) 20x2\n • 12. Multiplica los siguientes monomios 2x( - 10x3y)\nA) 20xy\nB) - 20x4y\nC) 20x4\nD) - 20xy\n • 13. Realiza la siguiente multiplicación de un monomio por un polinomio 6y ( 5y2 - 4y + 2)\nA) - 30y3 + 24y2\nB) - 30y3 + 24y - 6y\nC) - 30y3 + 24y2 - 6y\nD) 30y3 - 24y2 - 6y\n • 14. Multiplica los siguientes polinomios ( 2x + 5y )( 2x + 5y )\nA) 4x2 - 20xy + 25y2\nB) 9x2 + 20xy + 20y2\nC) 4x2 + xy + 25y2\nD) 4x2 + 20xy + 25y2\n • 15. Multiplica los siguientes polinomios ( 1 - 2m + 5m2).( 8 - 6m )\nA) 8 - 22m + 52m2 - 30m3\nB) - 22m + 52m2 - 30m3\nC) 25 - 22m + 52m2 - m3\nD) 8 + m + 52m2 - 30m3\n • 16. Realiza las siguientes division entre monomios y polinomios (-64 x5 y6) entre ( 4 x3 y4)\nA) 16 x8 y10\nB) - 16 x2 y2\nC) - 64 x2 y2\nD) - 8 x4 y4\n • 17. Realiza las siguientes division entre monomios ( 32 m5 n6 ) entre ( 2 m3 n)\nA) -16 m2 n5\nB) 16 m2 n5\nC) 16 m-2 n-5\nD) 8 m2 n5\n • 18. Realiza las siguientes division entre monomios (-256x5y4)entre(-16x8y9)\nA) 32x-3y-5\nB) -16x-3y-5\nC) 16x-3y-5\nD) 256x-3y-5\n • 19. Realiza las siguientes division de un polinomio y un monomio (4x3y-32x2y2+16xy3)entre(4xy)\nA) -x2y-8xy-16xy2\nB) x2y+8xy-16xy2\nC) x2y-8xy+16xy2\nD) x2-8xy+4y2\n • 20. Realiza las siguientes division de un polinomio y un monomio (x8+2x7-3x6+2x5-x4)entre(x4)\nA) x4+x3-x2+x-1\nB) -x4-2x3-3x2-2x-1\nC) x4+2x3-3x2+2x-1\nD) x4+4x3-6x2+2x-4\nOtros exámenes de interés :\n\nExamen creado con That Quiz — donde se practican las matemáticas."},"metadata":{"kind":"string","value":"{\n \"url\": \"https://www.thatquiz.org/es/preview?c=k4s8wwdf&s=ncl6nf\",\n \"source_domain\": \"www.thatquiz.org\",\n \"snapshot_id\": \"crawl=CC-MAIN-2022-05\",\n \"warc_metadata\": {\n \"Content-Length\": \"14157\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:Z2OGCZADCKRDM5F6QYUMHXN7HSTHVI3T\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2022-01-29T01:16:40Z\",\n \"WARC-IP-Address\": \"34.231.43.152\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:SXTIUO5DFA4ERZ6GMMSXJV2EFMLSEH4M\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://www.thatquiz.org/es/preview?c=k4s8wwdf&s=ncl6nf\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"isPartOf: CC-MAIN-2022-05\\r\\npublisher: Common Crawl\\r\\ndescription: Wide crawl of the web for January 2022\\r\\noperator: Common Crawl Admin (info@commoncrawl.org)\\r\\nhostname: ip-10-67-67-45\\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/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 44,\n 104,\n 116,\n 128,\n 140,\n 151,\n 215,\n 230,\n 244,\n 259,\n 273,\n 335,\n 351,\n 368,\n 385,\n 401,\n 461,\n 476,\n 492,\n 507,\n 516,\n 581,\n 597,\n 609,\n 625,\n 642,\n 693,\n 701,\n 706,\n 713,\n 721,\n 773,\n 782,\n 790,\n 798,\n 806,\n 865,\n 870,\n 882,\n 894,\n 906,\n 965,\n 975,\n 987,\n 999,\n 1011,\n 1071,\n 1084,\n 1094,\n 1108,\n 1120,\n 1178,\n 1188,\n 1198,\n 1207,\n 1215,\n 1271,\n 1279,\n 1290,\n 1298,\n 1308,\n 1402,\n 1419,\n 1440,\n 1462,\n 1482,\n 1550,\n 1571,\n 1592,\n 1611,\n 1632,\n 1704,\n 1729,\n 1752,\n 1776,\n 1799,\n 1896,\n 1909,\n 1923,\n 1937,\n 1950,\n 2034,\n 2047,\n 2059,\n 2073,\n 2084,\n 2164,\n 2176,\n 2189,\n 2201,\n 2214,\n 2313,\n 2331,\n 2348,\n 2365,\n 2379,\n 2477,\n 2493,\n 2513,\n 2532,\n 2551,\n 2579,\n 2580\n ],\n \"line_end_idx\": [\n 44,\n 104,\n 116,\n 128,\n 140,\n 151,\n 215,\n 230,\n 244,\n 259,\n 273,\n 335,\n 351,\n 368,\n 385,\n 401,\n 461,\n 476,\n 492,\n 507,\n 516,\n 581,\n 597,\n 609,\n 625,\n 642,\n 693,\n 701,\n 706,\n 713,\n 721,\n 773,\n 782,\n 790,\n 798,\n 806,\n 865,\n 870,\n 882,\n 894,\n 906,\n 965,\n 975,\n 987,\n 999,\n 1011,\n 1071,\n 1084,\n 1094,\n 1108,\n 1120,\n 1178,\n 1188,\n 1198,\n 1207,\n 1215,\n 1271,\n 1279,\n 1290,\n 1298,\n 1308,\n 1402,\n 1419,\n 1440,\n 1462,\n 1482,\n 1550,\n 1571,\n 1592,\n 1611,\n 1632,\n 1704,\n 1729,\n 1752,\n 1776,\n 1799,\n 1896,\n 1909,\n 1923,\n 1937,\n 1950,\n 2034,\n 2047,\n 2059,\n 2073,\n 2084,\n 2164,\n 2176,\n 2189,\n 2201,\n 2214,\n 2313,\n 2331,\n 2348,\n 2365,\n 2379,\n 2477,\n 2493,\n 2513,\n 2532,\n 2551,\n 2579,\n 2580,\n 2645\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 2645,\n \"ccnet_original_nlines\": 103,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.0217166505753994,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.1178903803229332,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.5243019461631775,\n \"rps_doc_frac_unique_words\": 0.3689320385456085,\n \"rps_doc_mean_word_length\": 4.1844658851623535,\n \"rps_doc_num_sentences\": 22,\n \"rps_doc_symbol_to_word_ratio\": 0,\n \"rps_doc_unigram_entropy\": 4.4466423988342285,\n \"rps_doc_word_count\": 412,\n \"rps_doc_frac_chars_dupe_10grams\": 0.059164728969335556,\n \"rps_doc_frac_chars_dupe_5grams\": 0.13051043450832367,\n \"rps_doc_frac_chars_dupe_6grams\": 0.13051043450832367,\n \"rps_doc_frac_chars_dupe_7grams\": 0.059164728969335556,\n \"rps_doc_frac_chars_dupe_8grams\": 0.059164728969335556,\n \"rps_doc_frac_chars_dupe_9grams\": 0.059164728969335556,\n \"rps_doc_frac_chars_top_2gram\": 0.10556845366954803,\n \"rps_doc_frac_chars_top_3gram\": 0.1600928157567978,\n \"rps_doc_frac_chars_top_4gram\": 0.07830625772476196,\n \"rps_doc_books_importance\": -593.0524291992188,\n \"rps_doc_books_importance_length_correction\": -593.0524291992188,\n \"rps_doc_openwebtext_importance\": -203.181396484375,\n \"rps_doc_openwebtext_importance_length_correction\": -203.181396484375,\n \"rps_doc_wikipedia_importance\": -243.96302795410156,\n \"rps_doc_wikipedia_importance_length_correction\": -243.96302795410156\n },\n \"fasttext\": {\n \"dclm\": 0.9998512268066406,\n \"english\": 0.01802629977464676,\n \"fineweb_edu_approx\": 1.6597484350204468,\n \"eai_general_math\": 0.4010884165763855,\n \"eai_open_web_math\": 0.9702568054199219,\n \"eai_web_code\": 0.03015756979584694\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"512.94\",\n \"labels\": {\n \"level_1\": \"Science and Natural history\",\n \"level_2\": \"Mathematics\",\n \"level_3\": \"Algebra\"\n }\n },\n \"secondary\": {\n \"code\": \"512\",\n \"labels\": {\n \"level_1\": \"Science and Natural history\",\n \"level_2\": \"Mathematics\",\n \"level_3\": \"Algebra\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"23\",\n \"label\": \"Tutorial\"\n },\n \"secondary\": {\n \"code\": \"6\",\n \"label\": \"Content Listing\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192847,"cells":{"id":{"kind":"number","value":-3406418156366295600,"string":"-3,406,418,156,366,295,600"},"text":{"kind":"string","value":"Home Search Center Encyclopedia Online Courses Online Support\n\nWhat Is MPLS?\n\nProposed by the Internet Engineering Task Force (IETF), MPLS is a protocol that uses labels to guide forwarding of data packets at a high speed over the IP backbone network. MPLS is a more efficient alternative to traditional IP routing and works by mapping an IP address to a short and fixed-length label of local significance, replacing IP table lookups with label swapping. In addition, MPLS labels can be used to establish a logical tunnel on the IP network. MPLS is compatible with different network-layer and link-layer protocols. Therefore, it can provide public network tunnels for various L2VPN, L3VPN, and EVPN services.\n\nWhy Do We Need MPLS?\n\nIn the mid-1990s, the volume of data transmitted across the Internet increased sharply with the rapid development of IP networks. Due to hardware limitations back then, IP technologies, using the longest match rule, had to use software for route lookups, resulting in low forwarding performance. This also restricted the development of IP networks. Against this backdrop, the IETF proposed the MPLS protocol to improve the forwarding performance of routing devices on IP networks.\n\nComparison between IP routing and MPLS forwarding\nComparison between IP routing and MPLS forwarding\n\nCompared with traditional IP routing, MPLS improves forwarding performance in the following ways:\n\n • It replaces time-consuming IP routing table lookups with simple label swapping, significantly reducing the time needed to guide packet forwarding.\n • After a packet enters an MPLS domain, only the ingress and egress at the edge of the MPLS domain need to parse the IP packet header and encapsulate or decapsulate labels. The transit nodes only need to swap labels, further speeding up packet forwarding.\n\nMPLS stopped providing notable improvements in forwarding performance of IP networks as application-specific integrated circuit (ASIC) technology developed and hardware took over as a fast way to process IP routing table lookups.\n\nNevertheless, MPLS found another purpose as its label-based forwarding is essentially a tunneling technology that can encapsulate multi-layer labels. In addition, MPLS works well with multiple network-layer and link-layer protocols, making it suitable for establishing public network tunnels in various VPN services. Finally, because MPLS packet forwarding depends on fixed label swapping paths, MPLS is a connection-oriented forwarding technology. This has resulted in its wide application across areas such as traffic engineering (TE) and QoS.\n\nWhat Are the Characteristics of MPLS?\n\nWhat Basic Concepts Are Involved in MPLS?\n\nTo understand what MPLS is, you need to first understand the concepts behind it. The following describes several core concepts.\n\nFEC\n\nMPLS is a class-based forwarding technology. It classifies data packets that may be forwarded the same way into one class, called forwarding equivalence class (FEC). MPLS processes data packets with the same FEC in the same way.\n\nPackets can be classified into FECs based on any combination of the following elements: source address, destination address, source port, destination port, protocol type, service type, and so on. For example, all packets destined for the same destination address in IP routing using the longest match rule would be classified into the same FEC.\n\nMPLS label\n\nAn MPLS label is a short, fixed-length identifier that has only local significance. It uniquely identifies the FEC to which a packet belongs. In some cases (for example, when load balancing is required), one FEC may be mapped to multiple MPLS labels. However, one label can represent only one FEC on one device.\n\nAn MPLS label has 4 bytes. The following figure shows how it is encapsulated.\n\nEncapsulation structure of an MPLS label\nEncapsulation structure of an MPLS label\n\nAn MPLS label has the following four fields:\n\n • Label: a 20-bit field that identifies a label value.\n\n • Exp: a 3-bit field used for extensions. Currently, this field is usually used for class of service (CoS).\n\n • BoS: a 1-bit field that identifies the bottom of a label stack. MPLS supports multiple labels, that is, label nesting. If the BoS field of a label is set to 1, the label is at the bottom of the label stack.\n\n • TTL: an 8-bit field indicating a time to live (TTL) value. This field is the same as the TTL field in IP packets.\n\nAn MPLS label is encapsulated between the link layer and network layer. The following figure shows where an MPLS label is encapsulated in a packet. MPLS labels are supported by all link-layer protocols.\n\nEncapsulation position of an MPLS label\nEncapsulation position of an MPLS label\n\nAn MPLS label stack is also called an MPLS multi-layer label. It contains an ordered set of MPLS labels, as shown in the following figure. The label close to the Layer 2 header is known as the label \"on top of the stack\" or the outer label; the label close to the IP header is known as the label \"at the bottom of the stack\" or the inner label. The labels are processed from the top of the label stack in a last in first out manner.\n\nMPLS label stack\nMPLS label stack\n\nLabel operations\n\nThe basic operations on MPLS labels include label push, label swap, and label pop. They are basic actions of label forwarding and a part of the label forwarding information base (LFIB).\n\nBasic label operations\nBasic label operations\n\nThe basic operations on MPLS labels are as follows:\n\n • Push: When an IP packet enters an MPLS domain, the ingress adds a label between the Layer 2 header and the IP header of the packet. When the packet reaches a transit node, the transit node can also add a label to the top of the label stack (label nesting) as needed.\n\n • Swap: When the packet is forwarded inside the MPLS domain, a transit node searches the LFIB and replaces the label on top of the stack in the MPLS packet with the label that is assigned by the next hop.\n\n • Pop: When the packet leaves the MPLS domain, the egress removes the MPLS label; or the MPLS node at the penultimate hop removes the label on top of the stack to reduce the number of labels in the label stack.\n\nBecause MPLS labels are useless for the egress, you can configure penultimate hop popping (PHP) on the egress to allow the node at the penultimate hop to pop the label out of an MPLS packet so that the egress can directly forward the packet over IP or based on the inner label, thereby reducing the processing load on the egress.\n\nPHP is implemented by allocating a special label value 3. A label with value 3 indicates an implicit-null label that never appears in a label stack. When the node at the penultimate hop finds that it is allocated with label value 3, it does not replace the label on top of the stack with this label. Instead, it pops the label so that the egress directly forwards the packet over IP or based on the inner label.\n\nLSP\n\nA label switched path (LSP) is a path along which packets that belong to the same FEC (that is, packets encapsulated with MPLS labels) are forwarded in an MPLS domain, as shown in the following figure.\n\nLSP networking\nLSP networking\n\nAn LSP is a unidirectional channel from the ingress to the egress. An LSP has the following roles:\n\n • Ingress: the start node of an LSP. An LSP has only one ingress. The ingress pushes an MPLS label into an IP packet and encapsulates the packet into an MPLS packet.\n\n • Transit node: an intermediate node on an LSP. An LSP may have any number of transit nodes, including zero. A transit node searches the LFIB and forwards MPLS packets through label swapping.\n\n • Egress: the last node of an LSP. An LSP has only one egress. The egress pops the label out of an MPLS packet and restores the original packet before forwarding it.\n\nHow Is an MPLS Network Structured?\n\nThe following figure shows the typical structure of an MPLS network.\n\nMPLS network structure\nMPLS network structure\n\nAn MPLS network consists of the following elements:\n\n • Label switching router (LSR): an MPLS-capable network device, which is fundamental to an MPLS network. A series of continuous LSRs constitutes an MPLS domain.\n • Core LSR: resides in an MPLS domain and connects only to LSRs inside the domain.\n • Label edge router (LER): resides on the edge of an MPLS domain and connects to one or more MPLS-incapable nodes.\n\nOn an MPLS network, an LSP can be set up between any two LERs to forward packets that enter an MPLS domain and can pass through one or more core LSRs. Therefore, the ingress and egress of an LSP are LERs, and transit nodes are core LSRs.\n\nWhat Are the Benefits of MPLS?\n\nMPLS is widely used on IP networks and provides the following benefits:\n\n • MPLS is completely compatible with and is an improvement upon the IP network, making it easy to promote for its low construction costs.\n • The control and forwarding planes of MPLS are separated. On the control plane, LSPs are set up based on IP routes. MPLS can borrow the flexibility and reliability mechanisms of IP routes where needed. On the connection-oriented forwarding plane, packets are transmitted over LSPs. In addition, MPLS can effectively implement TE and QoS.\n • MPLS is independent of link-layer protocols. It supports protocols such as frame relay, ATM, PPP, and SDH, ensuring interworking of multiple types of networks and providing good compatibility.\n • An MPLS network supports a hierarchical topology and is suitable for deployment on the IP backbone network.\n • Theoretically, the MPLS label stack supports unlimited label nesting, which meets the requirements of VPN services for multi-layer encapsulation of public and private network labels. Therefore, MPLS provides strong support for the development of VPN services.\n\nHow Does MPLS Work?\n\nSimply speaking, MPLS must correctly forward packets that enter an MPLS domain to their destination. This process is divided into two parts: LSP establishment and packet forwarding along the LSP.\n\nHow Does MPLS Establish LSPs?\n\nMPLS is a technology that uses labels to guide packet forwarding. Therefore, the establishment of an LSP is a process in which LSRs along the LSP determine the labels for a specific FEC.\n\nMPLS labels are assigned and distributed by a downstream LSR to an upstream LSR. As shown in the following figure, the downstream LSR classifies FECs based on the destination addresses of IP routes and allocates labels to the FECs corresponding to specified destination addresses. Then, the downstream LSR sends the labels to the upstream LSR, triggering the upstream LSR to establish an LFIB. Eventually, the series of LSRs form an LSP.\n\nProcess of establishing an LSP\nProcess of establishing an LSP\n\nLSPs can be classified into static LSPs and dynamic LSPs based on how they are established:\n\n • Static LSPs are established by manually assigning labels to FECs. When manually assigning labels, the outgoing label value of the upstream LSR must be the same as the incoming label value of the downstream LSR.\n • A dynamic LSP is set up when an LSR uses a label distribution protocol to dynamically generate and distribute labels. A downstream LSR uses IP routes to send labels to an upstream LSR. MPLS supports multiple label distribution protocols, such as the Label Distribution Protocol (LDP), Resource Reservation Protocol-Traffic Engineering (RSVP-TE), and Multiprotocol Extensions for Border Gateway Protocol (MP-BGP).\n\nHow Are Packets Forwarded Along LSPs?\n\nTake a PHP-capable LSP as an example. MPLS packets are forwarded along the LSP as follows:\n\n 1. After receiving an IP packet destined for 192.168.1.1/24, the ingress pushes label Y into the packet, encapsulates the packet into an MPLS one, and forwards it.\n\n 2. Upon receipt, the first transit node swaps label Y with label X.\n\n 3. The transit node at the penultimate hop receives the MPLS packet and pops label X because the label value assigned by the egress is 3. The transit node then forwards the IP packet to the egress.\n\n 4. After receiving the IP packet, the egress forwards it to the destination address 192.168.1.1/24.\n\nPacket forwarding through an LSP\nPacket forwarding through an LSP\n\nWhat Is an MPLS VPN?\n\nMPLS VPN is a technology that uses MPLS to construct VPNs on an IP backbone network. The essence of VPN is to transmit service data across a public network as if it was on a private network. This requires a tunnel to be set up on the public network so that data packets can be transmitted directly to the destination through the tunnel. Generally, MPLS VPN uses LSPs established using MPLS as public network tunnels to transmit private network service data.\n\nThe basic MPLS VPN model consists of the following roles:\n\n • Customer edge (CE): an edge device on a user network. A CE is directly connected to a service provider (SP) network through interfaces. The VPN sites of users are connected to the SP network through the CE. A CE can be a network device or a host. Generally, CEs are unaware of VPNs and do not need to support MPLS.\n\n • Provider edge (PE): an edge device on an SP network. A PE is directly connected to a CE. On an MPLS network, PEs function as LSRs and process all MPLS and VPN services. This places high requirements on the performance of PEs.\n\n • Provider (P): a backbone device on an SP network. A P is not directly connected to a CE. On an MPLS network, a P functions as an LSR and only needs to process MPLS services. It does not need to maintain VPN information.\n\nBasic MPLS VPN model\nBasic MPLS VPN model\n\nMPLS VPN fully leverages the technical advantages of MPLS and is the most widely used VPN technology. MPLS VPN offers the following benefits to users:\n\n • An MPLS label corresponds to the data flow of a specified service (specific FEC), which helps to isolate services of different users.\n • MPLS provides TE and QoS capabilities. Users can use MPLS to fully optimize VPN resource configuration.\n • In addition, MPLS VPN provides flexible policy control to meet the special requirements of different users and implement value-added services quickly.\nAbout This Topic\n • Author: Guo Fenghai\n • Updated on: 2021-09-30\n • Views: 2807\n • Average rating:"},"metadata":{"kind":"string","value":"{\n \"url\": \"https://info.support.huawei.com/info-finder/encyclopedia/en/MPLS.html\",\n \"source_domain\": \"info.support.huawei.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2022-21\",\n \"warc_metadata\": {\n \"Content-Length\": \"77335\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:BWYJDCCKNNGUNX2F4563OA7M3ONTA73Y\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2022-05-21T22:08:14Z\",\n \"WARC-IP-Address\": \"121.37.49.92\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:KGJ4RMTGBMHFS5PQOHFDH5GBVORB4WMK\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://info.support.huawei.com/info-finder/encyclopedia/en/MPLS.html\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"isPartOf: CC-MAIN-2022-21\\r\\npublisher: Common Crawl\\r\\ndescription: Wide crawl of the web for May 2022\\r\\noperator: Common Crawl Admin (info@commoncrawl.org)\\r\\nhostname: ip-10-67-67-116\\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/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 62,\n 63,\n 77,\n 78,\n 709,\n 710,\n 731,\n 732,\n 1213,\n 1214,\n 1264,\n 1314,\n 1315,\n 1413,\n 1414,\n 1565,\n 1823,\n 1824,\n 2053,\n 2054,\n 2600,\n 2601,\n 2639,\n 2640,\n 2682,\n 2683,\n 2811,\n 2812,\n 2816,\n 2817,\n 3046,\n 3047,\n 3392,\n 3393,\n 3404,\n 3405,\n 3717,\n 3718,\n 3796,\n 3797,\n 3838,\n 3879,\n 3880,\n 3925,\n 3926,\n 3983,\n 3984,\n 4094,\n 4095,\n 4306,\n 4307,\n 4425,\n 4426,\n 4629,\n 4630,\n 4670,\n 4710,\n 4711,\n 5144,\n 5145,\n 5162,\n 5179,\n 5180,\n 5197,\n 5198,\n 5384,\n 5385,\n 5408,\n 5431,\n 5432,\n 5484,\n 5485,\n 5756,\n 5757,\n 5964,\n 5965,\n 6178,\n 6179,\n 6509,\n 6510,\n 6922,\n 6923,\n 6927,\n 6928,\n 7130,\n 7131,\n 7146,\n 7161,\n 7162,\n 7261,\n 7262,\n 7430,\n 7431,\n 7625,\n 7626,\n 7794,\n 7795,\n 7830,\n 7831,\n 7900,\n 7901,\n 7924,\n 7947,\n 7948,\n 8000,\n 8001,\n 8164,\n 8249,\n 8366,\n 8367,\n 8605,\n 8606,\n 8637,\n 8638,\n 8710,\n 8711,\n 8851,\n 9192,\n 9389,\n 9501,\n 9765,\n 9766,\n 9786,\n 9787,\n 9983,\n 9984,\n 10014,\n 10015,\n 10202,\n 10203,\n 10641,\n 10642,\n 10673,\n 10704,\n 10705,\n 10797,\n 10798,\n 11013,\n 11430,\n 11431,\n 11469,\n 11470,\n 11561,\n 11562,\n 11728,\n 11729,\n 11799,\n 11800,\n 12000,\n 12001,\n 12103,\n 12104,\n 12137,\n 12170,\n 12171,\n 12192,\n 12193,\n 12651,\n 12652,\n 12710,\n 12711,\n 13030,\n 13031,\n 13261,\n 13262,\n 13486,\n 13487,\n 13508,\n 13529,\n 13530,\n 13681,\n 13682,\n 13820,\n 13928,\n 14083,\n 14100,\n 14124,\n 14151,\n 14167\n ],\n \"line_end_idx\": [\n 62,\n 63,\n 77,\n 78,\n 709,\n 710,\n 731,\n 732,\n 1213,\n 1214,\n 1264,\n 1314,\n 1315,\n 1413,\n 1414,\n 1565,\n 1823,\n 1824,\n 2053,\n 2054,\n 2600,\n 2601,\n 2639,\n 2640,\n 2682,\n 2683,\n 2811,\n 2812,\n 2816,\n 2817,\n 3046,\n 3047,\n 3392,\n 3393,\n 3404,\n 3405,\n 3717,\n 3718,\n 3796,\n 3797,\n 3838,\n 3879,\n 3880,\n 3925,\n 3926,\n 3983,\n 3984,\n 4094,\n 4095,\n 4306,\n 4307,\n 4425,\n 4426,\n 4629,\n 4630,\n 4670,\n 4710,\n 4711,\n 5144,\n 5145,\n 5162,\n 5179,\n 5180,\n 5197,\n 5198,\n 5384,\n 5385,\n 5408,\n 5431,\n 5432,\n 5484,\n 5485,\n 5756,\n 5757,\n 5964,\n 5965,\n 6178,\n 6179,\n 6509,\n 6510,\n 6922,\n 6923,\n 6927,\n 6928,\n 7130,\n 7131,\n 7146,\n 7161,\n 7162,\n 7261,\n 7262,\n 7430,\n 7431,\n 7625,\n 7626,\n 7794,\n 7795,\n 7830,\n 7831,\n 7900,\n 7901,\n 7924,\n 7947,\n 7948,\n 8000,\n 8001,\n 8164,\n 8249,\n 8366,\n 8367,\n 8605,\n 8606,\n 8637,\n 8638,\n 8710,\n 8711,\n 8851,\n 9192,\n 9389,\n 9501,\n 9765,\n 9766,\n 9786,\n 9787,\n 9983,\n 9984,\n 10014,\n 10015,\n 10202,\n 10203,\n 10641,\n 10642,\n 10673,\n 10704,\n 10705,\n 10797,\n 10798,\n 11013,\n 11430,\n 11431,\n 11469,\n 11470,\n 11561,\n 11562,\n 11728,\n 11729,\n 11799,\n 11800,\n 12000,\n 12001,\n 12103,\n 12104,\n 12137,\n 12170,\n 12171,\n 12192,\n 12193,\n 12651,\n 12652,\n 12710,\n 12711,\n 13030,\n 13031,\n 13261,\n 13262,\n 13486,\n 13487,\n 13508,\n 13529,\n 13530,\n 13681,\n 13682,\n 13820,\n 13928,\n 14083,\n 14100,\n 14124,\n 14151,\n 14167,\n 14186\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 14186,\n \"ccnet_original_nlines\": 179,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.3369644284248352,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.0976761132478714,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.14451706409454346,\n \"rps_doc_frac_unique_words\": 0.2287636697292328,\n \"rps_doc_mean_word_length\": 4.757779598236084,\n \"rps_doc_num_sentences\": 147,\n \"rps_doc_symbol_to_word_ratio\": 0,\n \"rps_doc_unigram_entropy\": 5.215786933898926,\n \"rps_doc_word_count\": 2378,\n \"rps_doc_frac_chars_dupe_10grams\": 0.006540569942444563,\n \"rps_doc_frac_chars_dupe_5grams\": 0.1484885960817337,\n \"rps_doc_frac_chars_dupe_6grams\": 0.10482587665319443,\n \"rps_doc_frac_chars_dupe_7grams\": 0.07185787707567215,\n \"rps_doc_frac_chars_dupe_8grams\": 0.025631960481405258,\n \"rps_doc_frac_chars_dupe_9grams\": 0.01767721027135849,\n \"rps_doc_frac_chars_top_2gram\": 0.018030760809779167,\n \"rps_doc_frac_chars_top_3gram\": 0.011666960082948208,\n \"rps_doc_frac_chars_top_4gram\": 0.004596080165356398,\n \"rps_doc_books_importance\": -1243.828125,\n \"rps_doc_books_importance_length_correction\": -1243.828125,\n \"rps_doc_openwebtext_importance\": -797.6719360351562,\n \"rps_doc_openwebtext_importance_length_correction\": -797.6719360351562,\n \"rps_doc_wikipedia_importance\": -618.8079223632812,\n \"rps_doc_wikipedia_importance_length_correction\": -618.8079223632812\n },\n \"fasttext\": {\n \"dclm\": 0.23411983251571655,\n \"english\": 0.8986372947692871,\n \"fineweb_edu_approx\": 2.886937141418457,\n \"eai_general_math\": 0.8363195061683655,\n \"eai_open_web_math\": 0.4560340642929077,\n \"eai_web_code\": 0.727247416973114\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"004.66\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n },\n \"secondary\": {\n \"code\": \"004.6\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n },\n \"secondary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Missing Images or Figures\"\n },\n \"secondary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"10\",\n \"label\": \"Knowledge Article\"\n },\n \"secondary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192848,"cells":{"id":{"kind":"number","value":6442566999200098000,"string":"6,442,566,999,200,098,000"},"text":{"kind":"string","value":"Answers\n\nSolutions by everydaycalculation.com\n\nAnswers.everydaycalculation.com » Divide fractions\n\nDivide 90/70 with 35/81\n\n1st number: 1 20/70, 2nd number: 35/81\n\n90/70 ÷ 35/81 is 729/245.\n\nSteps for dividing fractions\n\n 1. Find the reciprocal of the divisor\n Reciprocal of 35/81: 81/35\n 2. Now, multiply it with the dividend\n So, 90/70 ÷ 35/81 = 90/70 × 81/35\n 3. = 90 × 81/70 × 35 = 7290/2450\n 4. After reducing the fraction, the answer is 729/245\n 5. In mixed form: 2239/245\n\nMathStep (Works offline)\n\nDownload our mobile app and learn to work with fractions in your own time:\nAndroid and iPhone/ iPad\n\nRelated:\n\n© everydaycalculation.com"},"metadata":{"kind":"string","value":"{\n \"url\": \"https://answers.everydaycalculation.com/divide-fractions/90-70-divided-by-35-81\",\n \"source_domain\": \"answers.everydaycalculation.com\",\n \"snapshot_id\": \"CC-MAIN-2024-22\",\n \"warc_metadata\": {\n \"Content-Length\": \"6759\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:Y4EU7NK27QS5ZNQTZ2OOPM55A6SRVNQI\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2024-05-29T12:53:35Z\",\n \"WARC-IP-Address\": \"96.126.107.130\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:AEGMXOZUQTSDOFVGZEY4RFVAA5TP65DH\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://answers.everydaycalculation.com/divide-fractions/90-70-divided-by-35-81\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"isPartOf: CC-MAIN-2024-22\\r\\npublisher: Common Crawl\\r\\ndescription: Wide crawl of the web for May 2024\\r\\noperator: Common Crawl Admin (info@commoncrawl.org)\\r\\nhostname: ip-10-67-67-211\\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/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 8,\n 9,\n 46,\n 47,\n 98,\n 99,\n 123,\n 124,\n 163,\n 164,\n 190,\n 191,\n 220,\n 221,\n 261,\n 292,\n 332,\n 370,\n 405,\n 461,\n 490,\n 491,\n 516,\n 517,\n 592,\n 617,\n 618,\n 627,\n 628\n ],\n \"line_end_idx\": [\n 8,\n 9,\n 46,\n 47,\n 98,\n 99,\n 123,\n 124,\n 163,\n 164,\n 190,\n 191,\n 220,\n 221,\n 261,\n 292,\n 332,\n 370,\n 405,\n 461,\n 490,\n 491,\n 516,\n 517,\n 592,\n 617,\n 618,\n 627,\n 628,\n 653\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 653,\n \"ccnet_original_nlines\": 29,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.15432098507881165,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.5679012537002563,\n \"rps_doc_frac_unique_words\": 0.704081654548645,\n \"rps_doc_mean_word_length\": 4.908163070678711,\n \"rps_doc_num_sentences\": 11,\n \"rps_doc_symbol_to_word_ratio\": 0,\n \"rps_doc_unigram_entropy\": 4.093512535095215,\n \"rps_doc_word_count\": 98,\n \"rps_doc_frac_chars_dupe_10grams\": 0,\n \"rps_doc_frac_chars_dupe_5grams\": 0,\n \"rps_doc_frac_chars_dupe_6grams\": 0,\n \"rps_doc_frac_chars_dupe_7grams\": 0,\n \"rps_doc_frac_chars_dupe_8grams\": 0,\n \"rps_doc_frac_chars_dupe_9grams\": 0,\n \"rps_doc_frac_chars_top_2gram\": 0.033264029771089554,\n \"rps_doc_frac_chars_top_3gram\": 0.03742203861474991,\n \"rps_doc_frac_chars_top_4gram\": 0,\n \"rps_doc_books_importance\": -89.24578857421875,\n \"rps_doc_books_importance_length_correction\": -98.42523193359375,\n \"rps_doc_openwebtext_importance\": -53.807193756103516,\n \"rps_doc_openwebtext_importance_length_correction\": -62.98663330078125,\n \"rps_doc_wikipedia_importance\": -37.29193115234375,\n \"rps_doc_wikipedia_importance_length_correction\": -46.47137451171875\n },\n \"fasttext\": {\n \"dclm\": 0.9853242635726929,\n \"english\": 0.7957859635353088,\n \"fineweb_edu_approx\": 2.3204617500305176,\n \"eai_general_math\": 0.031201360747218132,\n \"eai_open_web_math\": 0.17164885997772217,\n \"eai_web_code\": 0.000007029999778751517\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"513.2\",\n \"labels\": {\n \"level_1\": \"Science and Natural history\",\n \"level_2\": \"Mathematics\",\n \"level_3\": \"Geometry\"\n }\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"labels\": {\n \"level_1\": \"\",\n \"level_2\": \"\",\n \"level_3\": \"\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"23\",\n \"label\": \"Tutorial\"\n },\n \"secondary\": {\n \"code\": \"21\",\n \"label\": \"Customer Support\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n },\n \"secondary\": {\n \"code\": \"1\",\n \"label\": \"General Audience\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192849,"cells":{"id":{"kind":"number","value":-2725080716887519000,"string":"-2,725,080,716,887,519,000"},"text":{"kind":"string","value":"The Alienware Laptop of the Future!\n\nDiscussion in 'Side Topics' started by Tristan, Apr 4, 2010.\n\nThread Status:\nNot open for further replies.\n 1. Tristan\n\n Tristan ΦΔΘ\n\n Reputations:\n 800\n Messages:\n 1,219\n Likes Received:\n 17\n Trophy Points:\n 56\n 2. Joebarchuck\n\n Joebarchuck Notebook Virtuoso\n\n Reputations:\n 881\n Messages:\n 2,246\n Likes Received:\n 0\n Trophy Points:\n 55\n It's an interesting concept and I am sure it will happen at some point. The only issue with the video clip is the power supply. Anyone can imagine that the future of power supply will be infinite and certainly not from a power outlet...\n  \n 3. CokeCanNinja\n\n CokeCanNinja Notebook Consultant\n\n Reputations:\n 18\n Messages:\n 285\n Likes Received:\n 0\n Trophy Points:\n 30\n It should have wireless power. Would this be able to play Crysis 10 on max settings?\n  \n 4. Megacharge\n\n Megacharge Custom User Title\n\n Reputations:\n 2,223\n Messages:\n 2,402\n Likes Received:\n 4\n Trophy Points:\n 56\n Yeah Intel's Nikola Tesla inspired \"wireless electricity\" adapters might be available by the time we see laptops like this. Interesting laptop concept. Hopefully by then GPU's will be small enough, powerful enough and cool enough to fit in a laptop like that and be able to run the Crysis of that day on all max settings.\n  \n 5. CokeCanNinja\n\n CokeCanNinja Notebook Consultant\n\n Reputations:\n 18\n Messages:\n 285\n Likes Received:\n 0\n Trophy Points:\n 30\n It better be, that thing looks 'spensive.\n  \n 6. ittekimasu\n\n ittekimasu Notebook Consultant\n\n Reputations:\n 2\n Messages:\n 113\n Likes Received:\n 0\n Trophy Points:\n 30\n Neat concept, I just imagine that laptops of the future will maintain the book look possibly just becomming more thinner and possibly including two screens with one acting as a keyboard when needed... kinda like an ipad.. ugh\n  \n 7. Partizan\n\n Partizan Notebook Deity\n\n Reputations:\n 241\n Messages:\n 1,696\n Likes Received:\n 0\n Trophy Points:\n 55\n I prefer walking over the street with a backpack or a postmanbag (don't know how to translate it to english soz) rather than carrying something that reminds me of a purse (its too round, while I prefer square things).\n\n Aside from that the multiple functions which the video showed seem very promising. But i'm glad I'll still be able to buy normal laptops for now, which become thinner and more powerfull and get better and better battery life, which is all I ask for.\n  \n 8. Tristan\n\n Tristan ΦΔΘ\n\n Reputations:\n 800\n Messages:\n 1,219\n Likes Received:\n 17\n Trophy Points:\n 56\n They make purses that thin and tubelike?:confused:\n\n\n The biggest selling point of a laptop like this would be the portability i think. If it was nice and light it would appeal to artists who use computer programs a lot. Save them the cost of materials and the hassle of transporting canvas and media, and replaces them with a nice tablet screen. I'd get one of these for sure, though not for gaming; 1. I don't think gpus are supposed to bend like that 2. it doesnt look intimidating enough to bring to a gaming conference:D\n  \n 9. CokeCanNinja\n\n CokeCanNinja Notebook Consultant\n\n Reputations:\n 18\n Messages:\n 285\n Likes Received:\n 0\n Trophy Points:\n 30\n Yes, I think computers will start to look more and more like the *shudder* Itampon.\n  \n 10. Aikimox\n\n Aikimox Weihenstephaner!\n\n Reputations:\n 5,946\n Messages:\n 10,128\n Likes Received:\n 49\n Trophy Points:\n 466\n Do you really think human race will survive that long? ;)\n  \nLoading...\nThread Status:\nNot open for further replies.\n\nShare This Page"},"metadata":{"kind":"string","value":"{\n \"url\": \"http://forum.notebookreview.com/threads/the-alienware-laptop-of-the-future.473237/\",\n \"source_domain\": \"forum.notebookreview.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2017-09\",\n \"warc_metadata\": {\n \"Content-Length\": \"87101\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:QIRVMFABWQT4TLJITF3ZBTM4DDIIY2TN\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2017-02-22T01:34:27Z\",\n \"WARC-IP-Address\": \"206.19.49.62\",\n \"WARC-Identified-Payload-Type\": null,\n \"WARC-Payload-Digest\": \"sha1:6JO37LJQ6NUGU63DVYPXDZOQRLMUHX6P\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"http://forum.notebookreview.com/threads/the-alienware-laptop-of-the-future.473237/\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"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\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 36,\n 37,\n 98,\n 99,\n 114,\n 144,\n 157,\n 158,\n 174,\n 175,\n 192,\n 200,\n 214,\n 224,\n 244,\n 251,\n 270,\n 277,\n 294,\n 295,\n 329,\n 330,\n 347,\n 355,\n 369,\n 379,\n 399,\n 405,\n 424,\n 431,\n 672,\n 678,\n 696,\n 697,\n 734,\n 735,\n 752,\n 759,\n 773,\n 781,\n 801,\n 807,\n 826,\n 833,\n 922,\n 928,\n 944,\n 945,\n 978,\n 979,\n 996,\n 1006,\n 1020,\n 1030,\n 1050,\n 1056,\n 1075,\n 1082,\n 1408,\n 1414,\n 1432,\n 1433,\n 1470,\n 1471,\n 1488,\n 1495,\n 1509,\n 1517,\n 1537,\n 1543,\n 1562,\n 1569,\n 1615,\n 1621,\n 1637,\n 1638,\n 1673,\n 1674,\n 1691,\n 1697,\n 1711,\n 1719,\n 1739,\n 1745,\n 1764,\n 1771,\n 2001,\n 2007,\n 2021,\n 2022,\n 2050,\n 2051,\n 2068,\n 2076,\n 2090,\n 2100,\n 2120,\n 2126,\n 2145,\n 2152,\n 2374,\n 2375,\n 2629,\n 2635,\n 2648,\n 2649,\n 2665,\n 2666,\n 2683,\n 2691,\n 2705,\n 2715,\n 2735,\n 2742,\n 2761,\n 2768,\n 2823,\n 2824,\n 2825,\n 3301,\n 3307,\n 3325,\n 3326,\n 3363,\n 3364,\n 3381,\n 3388,\n 3402,\n 3410,\n 3430,\n 3436,\n 3455,\n 3462,\n 3550,\n 3556,\n 3570,\n 3571,\n 3600,\n 3601,\n 3618,\n 3628,\n 3642,\n 3653,\n 3673,\n 3680,\n 3699,\n 3707,\n 3769,\n 3775,\n 3786,\n 3801,\n 3831,\n 3832\n ],\n \"line_end_idx\": [\n 36,\n 37,\n 98,\n 99,\n 114,\n 144,\n 157,\n 158,\n 174,\n 175,\n 192,\n 200,\n 214,\n 224,\n 244,\n 251,\n 270,\n 277,\n 294,\n 295,\n 329,\n 330,\n 347,\n 355,\n 369,\n 379,\n 399,\n 405,\n 424,\n 431,\n 672,\n 678,\n 696,\n 697,\n 734,\n 735,\n 752,\n 759,\n 773,\n 781,\n 801,\n 807,\n 826,\n 833,\n 922,\n 928,\n 944,\n 945,\n 978,\n 979,\n 996,\n 1006,\n 1020,\n 1030,\n 1050,\n 1056,\n 1075,\n 1082,\n 1408,\n 1414,\n 1432,\n 1433,\n 1470,\n 1471,\n 1488,\n 1495,\n 1509,\n 1517,\n 1537,\n 1543,\n 1562,\n 1569,\n 1615,\n 1621,\n 1637,\n 1638,\n 1673,\n 1674,\n 1691,\n 1697,\n 1711,\n 1719,\n 1739,\n 1745,\n 1764,\n 1771,\n 2001,\n 2007,\n 2021,\n 2022,\n 2050,\n 2051,\n 2068,\n 2076,\n 2090,\n 2100,\n 2120,\n 2126,\n 2145,\n 2152,\n 2374,\n 2375,\n 2629,\n 2635,\n 2648,\n 2649,\n 2665,\n 2666,\n 2683,\n 2691,\n 2705,\n 2715,\n 2735,\n 2742,\n 2761,\n 2768,\n 2823,\n 2824,\n 2825,\n 3301,\n 3307,\n 3325,\n 3326,\n 3363,\n 3364,\n 3381,\n 3388,\n 3402,\n 3410,\n 3430,\n 3436,\n 3455,\n 3462,\n 3550,\n 3556,\n 3570,\n 3571,\n 3600,\n 3601,\n 3618,\n 3628,\n 3642,\n 3653,\n 3673,\n 3680,\n 3699,\n 3707,\n 3769,\n 3775,\n 3786,\n 3801,\n 3831,\n 3832,\n 3847\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 3847,\n \"ccnet_original_nlines\": 153,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.31049564480781555,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.018950439989566803,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0.012987010180950165,\n \"rps_doc_frac_no_alph_words\": 0.2711370289325714,\n \"rps_doc_frac_unique_words\": 0.4936014711856842,\n \"rps_doc_mean_word_length\": 4.8720293045043945,\n \"rps_doc_num_sentences\": 39,\n \"rps_doc_symbol_to_word_ratio\": 0.004373180214315653,\n \"rps_doc_unigram_entropy\": 5.202525615692139,\n \"rps_doc_word_count\": 547,\n \"rps_doc_frac_chars_dupe_10grams\": 0.16135084629058838,\n \"rps_doc_frac_chars_dupe_5grams\": 0.21988743543624878,\n \"rps_doc_frac_chars_dupe_6grams\": 0.21988743543624878,\n \"rps_doc_frac_chars_dupe_7grams\": 0.18836772441864014,\n \"rps_doc_frac_chars_dupe_8grams\": 0.16135084629058838,\n \"rps_doc_frac_chars_dupe_9grams\": 0.16135084629058838,\n \"rps_doc_frac_chars_top_2gram\": 0.04878048971295357,\n \"rps_doc_frac_chars_top_3gram\": 0.03151969984173775,\n \"rps_doc_frac_chars_top_4gram\": 0.045028138905763626,\n \"rps_doc_books_importance\": -346.7894592285156,\n \"rps_doc_books_importance_length_correction\": -346.7894592285156,\n \"rps_doc_openwebtext_importance\": -206.92308044433594,\n \"rps_doc_openwebtext_importance_length_correction\": -206.92308044433594,\n \"rps_doc_wikipedia_importance\": -195.645751953125,\n \"rps_doc_wikipedia_importance_length_correction\": -195.645751953125\n },\n \"fasttext\": {\n \"dclm\": 0.15455633401870728,\n \"english\": 0.9291087985038757,\n \"fineweb_edu_approx\": 1.2681007385253906,\n \"eai_general_math\": 0.0008469800231978297,\n \"eai_open_web_math\": 0.2844197750091553,\n \"eai_web_code\": 0.00004089000140083954\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"004.15\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n },\n \"secondary\": {\n \"code\": \"621.392\",\n \"labels\": {\n \"level_1\": \"Industrial arts, Technology, and Engineering\",\n \"level_2\": \"Engineering\",\n \"level_3\": \"Mechanical engineering and Machinery\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Analyze\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Social/Forum\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n },\n \"secondary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Missing Images or Figures\"\n },\n \"secondary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"18\",\n \"label\": \"Q&A Forum\"\n },\n \"secondary\": {\n \"code\": \"5\",\n \"label\": \"Comment Section\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"6\",\n \"label\": \"Not Applicable/Indeterminate\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Partially Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"1\",\n \"label\": \"General Audience\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192850,"cells":{"id":{"kind":"number","value":-5029792955481688000,"string":"-5,029,792,955,481,688,000"},"text":{"kind":"string","value":"Skip to content\nFetching contributors…\nCannot retrieve contributors at this time\n1467 lines (1300 sloc) 31.8 KB\n/*\n* This file is covered by the Ruby license. See COPYING for more details.\n*\n* Copyright (C) 2012, The MacRuby Team. All rights reserved.\n* Copyright (C) 2007-2011, Apple Inc. All rights reserved.\n* Copyright (C) 1993-2007 Yukihiro Matsumoto\n* Copyright (C) 2000 Network Applied Communication Laboratory, Inc.\n* Copyright (C) 2000 Information-technology Promotion Agency, Japan\n*/\n#include \n#include \n#include \n#include \n#include \n#include \n#include \"macruby_internal.h\"\n#include \"ruby/node.h\"\n#include \"ruby/encoding.h\"\n#include \"dln.h\"\n#include \"vm.h\"\n#include \"encoding.h\"\n#include \"ruby/util.h\"\n#ifndef HAVE_STDLIB_H\nchar *getenv();\n#endif\n/* TODO: move to VM */\nVALUE ruby_debug = Qfalse;\nVALUE ruby_verbose = Qfalse;\nVALUE ruby_debug_socket_path = Qfalse;\nVALUE ruby_aot_compile = Qfalse;\nVALUE ruby_aot_init_func = Qfalse;\nVALUE ruby_aot_bs_files = Qnil;\nVALUE rb_progname = Qnil;\nstatic int uid, euid, gid, egid;\nstatic void\ninit_ids(void)\n{\nuid = (int)getuid();\neuid = (int)geteuid();\ngid = (int)getgid();\negid = (int)getegid();\nif (uid && (euid != uid || egid != gid)) {\nrb_set_safe_level(1);\n}\n}\n#if !defined(MACRUBY_STATIC)\nVALUE rb_parser_get_yydebug(VALUE);\nVALUE rb_parser_set_yydebug(VALUE, VALUE);\nconst char *ruby_get_inplace_mode(void);\nvoid ruby_set_inplace_mode(const char *);\n#define DISABLE_BIT(bit) (1U << disable_##bit)\nenum disable_flag_bits {\ndisable_gems,\ndisable_rubyopt,\n};\n#define DUMP_BIT(bit) (1U << dump_##bit)\nenum dump_flag_bits {\ndump_insns,\n};\nstruct cmdline_options {\nint sflag, xflag;\nint do_loop, do_print;\nint do_check, do_line;\nint do_split, do_search;\nint usage;\nint version;\nint copyright;\nunsigned int disable;\nint verbose;\nint yydebug;\nunsigned int dump;\nconst char *script;\nVALUE script_name;\nVALUE e_script;\nstruct {\nstruct {\nVALUE name;\nrb_encoding *enc;\n} enc;\n} src, ext;\n};\nstruct cmdline_arguments {\nint argc;\nchar **argv;\nstruct cmdline_options *opt;\n};\nstatic NODE *load_file(VALUE, const char *, int, struct cmdline_options *);\nstatic void forbid_setid(const char *);\nstatic struct {\nint argc;\nchar **argv;\n#if !defined(PSTAT_SETCMD) && !defined(HAVE_SETPROCTITLE)\nint len;\n#endif\n} origarg;\nstatic void\nusage(const char *name)\n{\n/* This message really ought to be max 23 lines.\n* Removed -h because the user already knows that option. Others? */\nstatic const char *const usage_msg[] = {\n\"-0[octal] specify record separator (\\\\0, if no argument)\",\n\"-a autosplit mode with -n or -p (splits $_ into $F)\",\n\"-c check syntax only\",\n\"-Cdirectory cd to directory, before executing your script\",\n\"-d set debugging flags (set $DEBUG to true)\",\n\"-e 'command' one line of script. Several -e's allowed. Omit [programfile]\",\n\"-Eencoding specifies the character encoding for the program codes\",\n\"-Fpattern split() pattern for autosplit (-a)\",\n\"-i[extension] edit ARGV files in place (make backup if extension supplied)\",\n\"-Idirectory specify $LOAD_PATH directory (may be used more than once)\",\n\"-l enable line ending processing\",\n\"-n assume 'while gets(); ... end' loop around your script\",\n\"-p assume loop like -n but print line also like sed\",\n\"-rlibrary require the library, before executing your script\",\n\"-s enable some switch parsing for switches after script name\",\n\"-S look for the script using PATH environment variable\",\n\"-T[level] turn on tainting checks\",\n\"-v print version number, then turn on verbose mode\",\n\"-w turn warnings on for your script\",\n\"-W[level] set warning level; 0=silence, 1=medium, 2=verbose (default)\",\n\"-x[directory] strip off text before #!ruby line and perhaps cd to directory\",\n\"--copyright print the copyright\",\n\"--version print the version\",\nNULL\n};\nconst char *const *p = usage_msg;\nprintf(\"Usage: %s [switches] [--] [programfile] [arguments]\\n\", name);\nwhile (*p)\nprintf(\" %s\\n\", *p++);\n}\nVALUE rb_get_load_path(void);\n#ifndef CharNext /* defined as CharNext[AW] on Windows. */\n#define CharNext(p) ((p) + mblen(p, RUBY_MBCHAR_MAXSIZE))\n#endif\n#define rubylib_mangled_path rb_str_new\n#define rubylib_mangled_path2 rb_str_new2\nstatic void\npush_include(const char *path, VALUE (*filter)(VALUE))\n{\nconst char sep = PATH_SEP_CHAR;\nconst char *p, *s;\nVALUE load_path = rb_vm_load_path();\np = path;\nwhile (*p) {\nwhile (*p == sep) {\np++;\n}\nif (!*p) {\nbreak;\n}\nfor (s = p; *s && *s != sep; s = CharNext(s));\nrb_ary_push(load_path, (*filter)(rubylib_mangled_path(p, s - p)));\np = s;\n}\n}\nvoid\nruby_push_include(const char *path, VALUE (*filter)(VALUE))\n{\nif (path != NULL) {\npush_include(path, filter);\n}\n}\nstatic VALUE\nidentical_path(VALUE path)\n{\nreturn path;\n}\nvoid\nruby_incpush(const char *path)\n{\nruby_push_include(path, identical_path);\n}\nstatic VALUE\nexpand_include_path(VALUE path)\n{\nconst char *p = RSTRING_PTR(path);\nif (!p) {\nreturn path;\n}\nif (*p == '.' && p[1] == '/') {\nreturn path;\n}\nreturn rb_file_expand_path(path, Qnil);\n}\nvoid\nruby_incpush_expand(const char *path)\n{\nruby_push_include(path, expand_include_path);\n}\nstatic CFMutableArrayRef req_list = NULL;\nstatic void\nadd_modules(const char *mod)\n{\nCFStringRef mod_str;\nif (req_list == NULL) {\nreq_list = CFArrayCreateMutable(NULL, 0, &kCFTypeArrayCallBacks);\n}\nmod_str = CFStringCreateWithFileSystemRepresentation(NULL, mod);\nCFArrayAppendValue(req_list, mod_str);\nCFRelease(mod_str);\n}\nextern void Init_ext(void);\nextern VALUE rb_vm_top_self(void);\nvoid\nrb_require_libraries(void)\n{\nstatic bool init = false;\nif (init) {\nreturn;\n}\ninit = true;\nInit_ext(); /* should be called here for some reason :-( */\nif (req_list != NULL) {\nVALUE vm;\nID require;\nint i, count;\nvm = rb_vm_top_self();\nrequire = rb_intern(\"require\");\nfor (i = 0, count = CFArrayGetCount(req_list); i < count; i++) {\nconst void *feature = CFArrayGetValueAtIndex(req_list, i);\nrb_funcall2(vm, require, 1, (VALUE *)&feature);\n}\nCFRelease(req_list);\n}\n}\nstatic void\nprocess_sflag(struct cmdline_options *opt)\n{\nif (opt->sflag) {\nlong i, n;\nVALUE argv = rb_argv;\nn = RARRAY_LEN(argv);\ni = 0;\nwhile (n > 0) {\nVALUE v = RARRAY_AT(argv, i++);\nchar *s = StringValuePtr(v);\nchar *p;\nint hyphen = Qfalse;\nif (s[0] != '-')\nbreak;\nn--;\nif (s[1] == '-' && s[2] == '\\0')\nbreak;\nv = Qtrue;\n/* check if valid name before replacing - with _ */\nfor (p = s + 1; *p; p++) {\nif (*p == '=') {\n*p++ = '\\0';\nv = rb_str_new2(p);\nbreak;\n}\nif (*p == '-') {\nhyphen = Qtrue;\n}\nelse if (*p != '_' && !ISALNUM(*p)) {\nVALUE name_error[2];\nname_error[0] =\nrb_str_new2(\"invalid name for global variable - \");\nif (!(p = strchr(p, '='))) {\nrb_str_cat2(name_error[0], s);\n}\nelse {\nrb_str_cat(name_error[0], s, p - s);\n}\nname_error[1] = RARRAY_AT(argv, -1);\nrb_exc_raise(rb_class_new_instance(2, name_error, rb_eNameError));\n}\n}\ns[0] = '$';\nif (hyphen) {\nfor (p = s + 1; *p; ++p) {\nif (*p == '-')\n*p = '_';\n}\n}\nrb_gv_set(s, v);\n}\nn = RARRAY_LEN(argv) - n;\nwhile (n--) {\nrb_ary_shift(argv);\n}\n}\nopt->sflag = 0;\n}\nNODE *rb_parser_append_print(VALUE, NODE *);\nNODE *rb_parser_while_loop(VALUE, NODE *, int, int);\nstatic int proc_options(int argc, char **argv, struct cmdline_options *opt);\nstatic char *\nmoreswitches(const char *s, struct cmdline_options *opt)\n{\nint argc;\nchar *argv[3];\nconst char *p = s;\nargc = 2;\nargv[0] = argv[2] = 0;\nwhile (*s && !ISSPACE(*s))\ns++;\nargv[1] = ALLOCA_N(char, s - p + 2);\nargv[1][0] = '-';\nstrncpy(argv[1] + 1, p, s - p);\nargv[1][s - p + 1] = '\\0';\nproc_options(argc, argv, opt);\nwhile (*s && ISSPACE(*s))\ns++;\nreturn (char *)s;\n}\n#define NAME_MATCH_P(name, str, len) \\\n((len) < sizeof(name) && strncmp((str), name, (len)) == 0)\n#define UNSET_WHEN(name, bit, str, len) \\\nif (NAME_MATCH_P(name, str, len)) { \\\n*(unsigned int *)arg &= ~(bit); \\\nreturn; \\\n}\n#define SET_WHEN(name, bit, str, len) \\\nif (NAME_MATCH_P(name, str, len)) { \\\n*(unsigned int *)arg |= (bit); \\\nreturn; \\\n}\nstatic void\nenable_option(const char *str, int len, void *arg)\n{\n#define UNSET_WHEN_DISABLE(bit) UNSET_WHEN(#bit, DISABLE_BIT(bit), str, len)\nUNSET_WHEN_DISABLE(gems);\nUNSET_WHEN_DISABLE(rubyopt);\nif (NAME_MATCH_P(\"all\", str, len)) {\n*(unsigned int *)arg = 0U;\nreturn;\n}\nrb_warn(\"unknown argument for --enable: `%.*s'\", len, str);\n}\nstatic void\ndisable_option(const char *str, int len, void *arg)\n{\n#define SET_WHEN_DISABLE(bit) SET_WHEN(#bit, DISABLE_BIT(bit), str, len)\nSET_WHEN_DISABLE(gems);\nSET_WHEN_DISABLE(rubyopt);\nif (NAME_MATCH_P(\"all\", str, len)) {\n*(unsigned int *)arg = ~0U;\nreturn;\n}\nrb_warn(\"unknown argument for --disable: `%.*s'\", len, str);\n}\nstatic void\ndump_option(const char *str, int len, void *arg)\n{\n#define SET_WHEN_DUMP(bit) SET_WHEN(#bit, DUMP_BIT(bit), str, len)\nSET_WHEN_DUMP(insns);\nrb_warn(\"don't know how to dump `%.*s', (insns)\", len, str);\n}\nstatic int\nproc_options(int argc, char **argv, struct cmdline_options *opt)\n{\nint n, argc0 = argc;\nconst char *s;\nif (argc == 0)\nreturn 0;\nfor (argc--, argv++; argc > 0; argc--, argv++) {\nif (argv[0][0] != '-' || !argv[0][1])\nbreak;\ns = argv[0] + 1;\nreswitch:\nswitch (*s) {\ncase 'a':\nopt->do_split = Qtrue;\ns++;\ngoto reswitch;\ncase 'p':\nopt->do_print = Qtrue;\n/* through */\ncase 'n':\nopt->do_loop = Qtrue;\ns++;\ngoto reswitch;\ncase 'd':\nruby_debug = Qtrue;\nruby_verbose = Qtrue;\ns++;\ngoto reswitch;\ncase 'y':\nopt->yydebug = 1;\ns++;\ngoto reswitch;\ncase 'v':\nif (opt->verbose) {\ns++;\ngoto reswitch;\n}\nruby_show_version();\nopt->verbose = 1;\ncase 'w':\nruby_verbose = Qtrue;\ns++;\ngoto reswitch;\ncase 'W':\n{\nsize_t numlen;\nint v = 2; /* -W as -W2 */\nif (*++s) {\nv = scan_oct(s, 1, &numlen);\nif (numlen == 0)\nv = 1;\ns += numlen;\n}\nswitch (v) {\ncase 0:\nruby_verbose = Qnil;\nbreak;\ncase 1:\nruby_verbose = Qfalse;\nbreak;\ndefault:\nruby_verbose = Qtrue;\nbreak;\n}\n}\ngoto reswitch;\ncase 'c':\nopt->do_check = Qtrue;\ns++;\ngoto reswitch;\ncase 's':\nforbid_setid(\"-s\");\nopt->sflag = 1;\ns++;\ngoto reswitch;\ncase 'h':\nusage(origarg.argv[0]);\nrb_exit(EXIT_SUCCESS);\nbreak;\ncase 'l':\nopt->do_line = Qtrue;\nrb_output_rs = rb_rs;\ns++;\ngoto reswitch;\ncase 'S':\nforbid_setid(\"-S\");\nopt->do_search = Qtrue;\ns++;\ngoto reswitch;\ncase 'e':\nforbid_setid(\"-e\");\nif (*++s == '\\0') {\ns = argv[1];\nargc--;\nargv++;\n}\nif (s == NULL) {\nrb_raise(rb_eRuntimeError, \"no code specified for -e\");\n}\nif (opt->e_script == 0) {\nopt->e_script = rb_str_new(NULL, 0);\nif (opt->script == NULL) {\nopt->script = \"-e\";\n}\n}\nrb_str_cat2(opt->e_script, s);\nrb_str_cat2(opt->e_script, \"\\n\");\nbreak;\ncase 'r':\nforbid_setid(\"-r\");\nif (*++s != '\\0') {\nadd_modules(s);\n}\nelse if (argv[1]) {\nadd_modules(argv[1]);\nargc--;\nargv++;\n}\nbreak;\ncase 'i':\nforbid_setid(\"-i\");\nruby_set_inplace_mode(s + 1);\nbreak;\ncase 'x':\nopt->xflag = Qtrue;\ns++;\nif (*s && chdir(s) < 0) {\nrb_fatal(\"Can't chdir to %s\", s);\n}\nbreak;\ncase 'C':\ncase 'X':\ns++;\nif (!*s) {\ns = argv[1];\nargc--, argv++;\n}\nif (!s || !*s) {\nrb_fatal(\"Can't chdir\");\n}\nif (chdir(s) < 0) {\nrb_fatal(\"Can't chdir to %s\", s);\n}\nbreak;\ncase 'F':\nif (*++s) {\nrb_fs = rb_reg_new(s, strlen(s), 0);\n}\nbreak;\ncase 'E':\nif (!*++s) goto next_encoding;\ngoto encoding;\ncase 'K':\nif (*++s) {\nconst char *enc_name = 0;\nswitch (*s) {\ncase 'E': case 'e':\nenc_name = \"EUC-JP\";\nbreak;\ncase 'S': case 's':\nenc_name = \"Windows-31J\";\nbreak;\ncase 'U': case 'u':\nenc_name = \"UTF-8\";\nbreak;\ncase 'N': case 'n': case 'A': case 'a':\nenc_name = \"ASCII-8BIT\";\nbreak;\n}\nif (enc_name) {\nopt->src.enc.name = rb_str_new2(enc_name);\nopt->ext.enc.name = opt->src.enc.name;\n}\ns++;\n}\ngoto reswitch;\ncase 'T':\n{\nsize_t numlen;\nint v = 1;\nif (*++s) {\nv = scan_oct(s, 2, &numlen);\nif (numlen == 0)\nv = 1;\ns += numlen;\n}\nrb_set_safe_level(v);\n}\ngoto reswitch;\ncase 'I':\nforbid_setid(\"-I\");\nif (*++s)\nruby_incpush_expand(s);\nelse if (argv[1]) {\nruby_incpush_expand(argv[1]);\nargc--, argv++;\n}\nbreak;\ncase '0':\n{\nsize_t numlen;\nint v;\nchar c;\nv = scan_oct(s, 4, &numlen);\ns += numlen;\nif (v > 0377)\nrb_rs = Qnil;\nelse if (v == 0 && numlen >= 2) {\nrb_rs = rb_str_new2(\"\\n\\n\");\n}\nelse {\nc = v & 0xff;\nrb_rs = rb_str_new(&c, 1);\n}\n}\ngoto reswitch;\ncase '-':\nif (!s[1] || (s[1] == '\\r' && !s[2])) {\nargc--, argv++;\ngoto switch_end;\n}\ns++;\nif (strcmp(\"copyright\", s) == 0) {\nopt->copyright = 1;\n}\nelse if (strcmp(\"debug\", s) == 0) {\nruby_debug = Qtrue;\nruby_verbose = Qtrue;\n}\nelse if (strncmp(\"enable\", s, n = 6) == 0 &&\n(!s[n] || s[n] == '-' || s[n] == '=')) {\nif ((s += n + 1)[-1] ? !*s : (!--argc || !(s = *++argv))) {\nrb_raise(rb_eRuntimeError, \"missing argument for --enable\");\n}\nruby_each_words(s, enable_option, &opt->disable);\n}\nelse if (strncmp(\"disable\", s, n = 7) == 0 &&\n(!s[n] || s[n] == '-' || s[n] == '=')) {\nif ((s += n + 1)[-1] ? !*s : (!--argc || !(s = *++argv))) {\nrb_raise(rb_eRuntimeError, \"missing argument for --disable\");\n}\nruby_each_words(s, disable_option, &opt->disable);\n}\nelse if (strncmp(\"encoding\", s, n = 8) == 0 && (!s[n] || s[n] == '=')) {\ns += n;\nif (!*s++) {\nnext_encoding:\nif (!--argc || !(s = *++argv)) {\nrb_raise(rb_eRuntimeError, \"missing argument for --encoding\");\n}\n}\nencoding:\nopt->ext.enc.name = rb_str_new2(s);\n}\nelse if (strcmp(\"version\", s) == 0) {\nopt->version = 1;\n}\nelse if (strcmp(\"verbose\", s) == 0) {\nopt->verbose = 1;\nruby_verbose = Qtrue;\n}\nelse if (strcmp(\"yydebug\", s) == 0) {\nopt->yydebug = 1;\n}\nelse if (strncmp(\"dump\", s, n = 4) == 0 && (!s[n] || s[n] == '=')) {\nif (!(s += n + 1)[-1] && (!--argc || !(s = *++argv)) && *s != '-') break;\nruby_each_words(s, dump_option, &opt->dump);\n}\nelse if (strcmp(\"help\", s) == 0) {\nusage(origarg.argv[0]);\nrb_exit(EXIT_SUCCESS);\n}\nelse if (strcmp(\"emit-llvm\", s) == 0) {\n// This option is not documented and only used by macrubyc.\n// Users should use macrubyc and never call this option\n// directly.\nif (argc < 3) {\nrb_raise(rb_eRuntimeError,\n\"expected 2 arguments (output file and init function) for --emit-llvm\");\n}\nruby_aot_compile = rb_str_new2(argv[1]);\nruby_aot_init_func = rb_str_new2(argv[2]);\nGC_RETAIN(ruby_aot_compile);\nGC_RETAIN(ruby_aot_init_func);\nargc--; argv++;\nargc--; argv++;\n}\nelse if (strcmp(\"uses-bs\", s) == 0) {\n// This option is not documented and only used by macrubyc.\n// Users should use macrubyc and never call this option\n// directly.\nif (argc < 2) {\nrb_raise(rb_eRuntimeError,\n\"expected 1 argument (complete BridgeSupport file ) for --uses-bs\");\n}\nif (ruby_aot_bs_files == Qnil) {\nruby_aot_bs_files = rb_ary_new();\nGC_RETAIN(ruby_aot_bs_files);\n}\nrb_ary_push(ruby_aot_bs_files, rb_str_new2(argv[1]));\nargc--; argv++;\n}\nelse if (strcmp(\"debug-mode\", s) == 0) {\n// This option is not documented and only used by macrubyd.\n// Users should use macrubyd and never call this option\n// directly.\nif (argc < 2) {\nrb_raise(rb_eRuntimeError,\n\"expected 1 argument (unix socket path) for --debug-mode\");\n}\nruby_debug_socket_path = rb_str_new2(argv[1]);\nGC_RETAIN(ruby_debug_socket_path);\nargc--; argv++;\n}\nelse {\nrb_raise(rb_eRuntimeError,\n\"invalid option --%s (-h will show valid options)\", s);\n}\nbreak;\ncase '\\r':\nif (!s[1])\nbreak;\ndefault:\n{\nif (ISPRINT(*s)) {\nrb_raise(rb_eRuntimeError,\n\"invalid option -%c (-h will show valid options)\",\n(int)(unsigned char)*s);\n}\nelse {\nrb_raise(rb_eRuntimeError,\n\"invalid option -\\\\x%02X (-h will show valid options)\",\n(int)(unsigned char)*s);\n}\n}\ngoto switch_end;\ncase 0:\nbreak;\n}\n}\nswitch_end:\nreturn argc0 - argc;\n}\nvoid Init_prelude(void);\nstatic void\nruby_init_gems(int enable)\n{\n// TODO\n}\nstatic rb_encoding *\nopt_enc_find(VALUE enc_name)\n{\nrb_encoding *enc = rb_enc_find(RSTRING_PTR(enc_name));\nif (enc == NULL) {\nrb_raise(rb_eRuntimeError, \"unknown encoding name - %s\",\nRSTRING_PTR(enc_name));\n}\nreturn enc;\n}\nVALUE rb_argv0;\nstatic rb_encoding *src_encoding;\nstatic VALUE\nprocess_options(VALUE arg)\n{\nstruct cmdline_arguments *argp = (struct cmdline_arguments *)arg;\nstruct cmdline_options *opt = argp->opt;\nint argc = argp->argc;\nchar **argv = argp->argv;\nNODE *tree = 0;\nVALUE parser;\nrb_encoding *enc, *lenc;\nconst char *s;\nchar fbuf[MAXPATHLEN];\nint i = proc_options(argc, argv, opt);\nint safe;\nargc -= i;\nargv += i;\nif (!(opt->disable & DISABLE_BIT(rubyopt)) &&\nrb_safe_level() == 0 && (s = getenv(\"RUBYOPT\"))) {\nVALUE src_enc_name = opt->src.enc.name;\nVALUE ext_enc_name = opt->ext.enc.name;\nwhile (ISSPACE(*s))\ns++;\nif (*s == 'T' || (*s == '-' && *(s + 1) == 'T')) {\nsize_t numlen;\nint v = 1;\nif (*s != 'T')\n++s;\nif (*++s) {\nv = scan_oct(s, 2, &numlen);\nif (numlen == 0)\nv = 1;\n}\nrb_set_safe_level(v);\n}\nelse {\nwhile (s && *s) {\nif (*s == '-') {\ns++;\nif (ISSPACE(*s)) {\ndo {\ns++;\n} while (ISSPACE(*s));\ncontinue;\n}\n}\nif (!*s)\nbreak;\nif (!strchr(\"EIdvwWrK\", *s))\nrb_raise(rb_eRuntimeError,\n\"invalid switch in RUBYOPT: -%c\", *s);\ns = moreswitches(s, opt);\n}\n}\nif (src_enc_name)\nopt->src.enc.name = src_enc_name;\nif (ext_enc_name)\nopt->ext.enc.name = ext_enc_name;\n}\nif (!ruby_aot_compile) {\nrb_vm_init_jit();\n}\nif (opt->version) {\nruby_show_version();\nreturn Qtrue;\n}\nif (opt->copyright) {\nruby_show_copyright();\n}\nif (rb_safe_level() >= 4) {\nOBJ_TAINT(rb_argv);\nOBJ_TAINT(rb_vm_load_path());\n}\nif (!opt->e_script) {\nif (argc == 0) { /* no more args */\nif (opt->verbose)\nreturn Qtrue;\nopt->script = \"-\";\n}\nelse {\nopt->script = argv[0];\nif (opt->script[0] == '\\0') {\nopt->script = \"-\";\n}\nelse if (opt->do_search) {\nchar *path = getenv(\"RUBYPATH\");\nopt->script = 0;\nif (path) {\nopt->script = dln_find_file_r(argv[0], path, fbuf, sizeof(fbuf));\n}\nif (!opt->script) {\nopt->script = dln_find_file_r(argv[0], getenv(PATH_ENV), fbuf, sizeof(fbuf));\n}\nif (!opt->script)\nopt->script = argv[0];\n}\nargc--;\nargv++;\n}\n}\nruby_script(opt->script);\nGC_WB(&opt->script_name, rb_str_new4(rb_progname));\nopt->script = RSTRING_PTR(opt->script_name);\nruby_set_argv(argc, argv);\nprocess_sflag(opt);\nruby_init_loadpath();\nsafe = rb_safe_level();\nrb_set_safe_level_force(0);\nruby_init_gems(!(opt->disable & DISABLE_BIT(gems)));\nlenc = rb_locale_encoding();\nparser = rb_parser_new();\nif (opt->yydebug) rb_parser_set_yydebug(parser, Qtrue);\nif (opt->ext.enc.name != 0) {\nopt->ext.enc.enc = opt_enc_find(opt->ext.enc.name);\n}\nif (opt->src.enc.name != 0) {\nopt->src.enc.enc = opt_enc_find(opt->src.enc.name);\nsrc_encoding = opt->src.enc.enc;\n}\nif (opt->ext.enc.enc != NULL) {\nenc = opt->ext.enc.enc;\n}\nelse {\nenc = lenc;\n}\nrb_enc_set_default_external(rb_enc_from_encoding(enc));\nrb_set_safe_level_force(safe);\nif (opt->e_script) {\nrb_encoding *eenc;\nif (opt->src.enc.enc != NULL) {\neenc = opt->src.enc.enc;\n}\nelse {\neenc = lenc;\n}\n//require_libraries();\ntree = rb_parser_compile_string(parser, opt->script, opt->e_script, 1);\n}\nelse {\nif (opt->script[0] == '-' && !opt->script[1]) {\nforbid_setid(\"program input from stdin\");\n}\ntree = load_file(parser, opt->script, 1, opt);\n}\nif (!tree) return Qfalse;\nprocess_sflag(opt);\nopt->xflag = 0;\nif (rb_safe_level() >= 4) {\nOBJ_TAINT(rb_argv);\nOBJ_TAINT(rb_vm_load_path());\n}\nif (opt->do_check) {\nprintf(\"Syntax OK\\n\");\nreturn Qtrue;\n}\nif (opt->do_print) {\ntree = rb_parser_append_print(parser, tree);\n}\nif (opt->do_loop) {\ntree = rb_parser_while_loop(parser, tree, opt->do_line, opt->do_split);\n}\nreturn (VALUE)tree;\n}\nstatic NODE *\nload_file(VALUE parser, const char *fname, int script,\nstruct cmdline_options *opt)\n{\nextern VALUE rb_stdin;\nVALUE f;\nint line_start = 1;\nNODE *tree = 0;\nrb_encoding *enc;\nif (fname == NULL) {\nrb_load_fail(fname);\n}\nif (strcmp(fname, \"-\") == 0) {\nf = rb_stdin;\n}\nelse {\nint fd, mode = O_RDONLY;\nif ((fd = open(fname, mode)) < 0) {\nrb_load_fail(fname);\n}\nf = rb_io_fdopen(fd, mode, fname);\n}\nif (script) {\nVALUE c = 1; /* something not nil */\nVALUE line;\nchar *p;\nint no_src_enc = !opt->src.enc.name;\nint no_ext_enc = !opt->ext.enc.name;\nif (opt->xflag) {\nforbid_setid(\"-x\");\nopt->xflag = Qfalse;\nwhile (!NIL_P(line = rb_io_gets(f, 0))) {\nline_start++;\nconst char *lineptr = RSTRING_PTR(line);\nif (RSTRING_LEN(line) > 2\n&& lineptr[0] == '#'\n&& lineptr[1] == '!') {\nif ((p = strstr(lineptr, \"ruby\")) != 0) {\ngoto start_read;\n}\n}\n}\nrb_raise(rb_eLoadError, \"no Ruby script found in input\");\n}\nc = rb_io_getbyte(f, 0);\nif (c == INT2FIX('#')) {\nc = rb_io_getbyte(f, 0);\nif (c == INT2FIX('!')) {\nline = rb_io_gets(f, 0);\nif (NIL_P(line)) {\nreturn 0;\n}\nif ((p = strstr(RSTRING_PTR(line), \"ruby\")) == 0) {\n/* not ruby script, kick the program */\nchar **argv;\nchar *path;\nchar *pend;\nline = rb_str_bstr(line);\np = (char *)rb_bstr_bytes(line);\npend = p + rb_bstr_length(line);\nif (pend[-1] == '\\n') {\npend--; /* chomp line */\n}\nif (pend[-1] == '\\r') {\npend--;\n}\n*pend = '\\0';\nwhile (p < pend && ISSPACE(*p)) {\np++;\n}\npath = p; /* interpreter path */\nwhile (p < pend && !ISSPACE(*p)) {\np++;\n}\n*p++ = '\\0';\nif (p < pend) {\nargv = ALLOCA_N(char *, origarg.argc + 3);\nargv[1] = p;\nMEMCPY(argv + 2, origarg.argv + 1, char *, origarg.argc);\n}\nelse {\nargv = origarg.argv;\n}\nargv[0] = path;\nexecv(path, argv);\nrb_fatal(\"Can't exec %s\", path);\n}\nstart_read:\np += 4;\nchar *linebuf = (char *)rb_bstr_bytes(line);\nconst long linebuflen = rb_bstr_length(line);\nlinebuf[linebuflen - 1] = '\\0';\nif (linebuf[linebuflen - 2] == '\\r') {\nlinebuf[linebuflen - 2] = '\\0';\n}\nif ((p = strstr(p, \" -\")) != 0) {\np++; /* skip space before `-' */\nwhile (*p == '-') {\np = moreswitches(p + 1, opt);\n}\n}\n/* push back shebang for pragma may exist in next line */\nrb_io_ungetc(f, 0, rb_str_new2(\"!\\n\"));\n}\nelse if (!NIL_P(c)) {\nrb_io_ungetc(f, 0, c);\n}\nrb_io_ungetc(f, 0, INT2FIX('#'));\nif (no_src_enc && opt->src.enc.name) {\nopt->src.enc.enc = opt_enc_find(opt->src.enc.name);\nsrc_encoding = opt->src.enc.enc;\n}\nif (no_ext_enc && opt->ext.enc.name) {\nopt->ext.enc.enc = opt_enc_find(opt->ext.enc.name);\n}\n}\nelse if (!NIL_P(c)) {\nrb_io_ungetc(f, 0, c);\n}\n//require_libraries(); /* Why here? unnatural */\n}\nif (opt->src.enc.enc != NULL) {\nenc = opt->src.enc.enc;\n}\nelse {\nenc = rb_locale_encoding();\n}\ntree = (NODE *)rb_parser_compile_file(parser, fname, f, line_start);\nif (script && rb_parser_end_seen_p(parser)) {\nrb_define_global_const(\"DATA\", f);\n}\nelse if (f != rb_stdin) {\nrb_io_close(f);\n}\nreturn tree;\n}\nvoid *\nrb_load_file(const char *fname)\n{\nstruct cmdline_options opt;\nMEMZERO(&opt, opt, 1);\nopt.src.enc.enc = src_encoding;\nreturn load_file(rb_parser_new(), fname, 0, &opt);\n}\n#if !defined(PSTAT_SETCMD) && !defined(HAVE_SETPROCTITLE)\n#if !defined(_WIN32) && !(defined(HAVE_SETENV) && defined(HAVE_UNSETENV))\n#define USE_ENVSPACE_FOR_ARG0\n#endif\n#ifdef USE_ENVSPACE_FOR_ARG0\nextern char **environ;\n#endif\nstatic int\nget_arglen(int argc, char **argv)\n{\nchar *s = argv[0];\nint i;\nif (!argc) return 0;\ns += strlen(s);\n/* See if all the arguments are contiguous in memory */\nfor (i = 1; i < argc; i++) {\nif (argv[i] == s + 1) {\ns++;\ns += strlen(s); /* this one is ok too */\n}\nelse {\nbreak;\n}\n}\n#if defined(USE_ENVSPACE_FOR_ARG0)\nif (environ && (s == environ[0])) {\ns += strlen(s);\nfor (i = 1; environ[i]; i++) {\nif (environ[i] == s + 1) {\ns++;\ns += strlen(s); /* this one is ok too */\n}\n}\nruby_setenv(\"\", NULL); /* duplicate environ vars */\n}\n#endif\nreturn s - argv[0];\n}\n#endif\nstatic void\nforbid_setid(const char *s)\n{\nif (euid != uid) {\nrb_raise(rb_eSecurityError, \"no %s allowed while running setuid\", s);\n}\nif (egid != gid) {\nrb_raise(rb_eSecurityError, \"no %s allowed while running setgid\", s);\n}\nif (rb_safe_level() > 0) {\nrb_raise(rb_eSecurityError, \"no %s allowed in tainted mode\", s);\n}\n}\nstatic VALUE\nfalse_value(void)\n{\nreturn Qfalse;\n}\nstatic VALUE\ntrue_value(void)\n{\nreturn Qtrue;\n}\n#define rb_define_readonly_boolean(name, val) \\\nrb_define_virtual_variable((name), (val) ? true_value : false_value, 0)\nvoid *\nruby_process_options(int argc, char **argv)\n{\nstruct cmdline_arguments *args;\nstruct cmdline_options *opt;\nNODE *tree;\nargs = (struct cmdline_arguments *)xmalloc(sizeof(struct cmdline_arguments));\nopt = (struct cmdline_options *)xmalloc(sizeof(struct cmdline_options));\nMEMZERO(opt, opt, 1);\nruby_script(argv[0]); /* for the time being */\nrb_argv0 = rb_progname;\nGC_RETAIN(rb_argv0);\nargs->argc = argc;\nargs->argv = argv;\nargs->opt = opt;\nopt->src.enc.enc = src_encoding;\nopt->ext.enc.enc = NULL;\ntree = (NODE *)process_options((VALUE)args);\n// tree = (NODE *)rb_vm_call_cfunc(rb_vm_top_self(),\n// process_options, (VALUE)args,\n// 0, rb_progname);\nrb_define_readonly_boolean(\"$-p\", opt->do_print);\nrb_define_readonly_boolean(\"$-l\", opt->do_line);\nrb_define_readonly_boolean(\"$-a\", opt->do_split);\nerrno = 0; // Reset errno value.\nreturn tree;\n}\n#endif // !MACRUBY_STATIC\nvoid\nruby_sysinit(int *argc, char ***argv)\n{\nint i, n = *argc, len = 0;\nchar **v1 = *argv, **v2, *p;\nfor (i = 0; i < n; ++i) {\nlen += strlen(v1[i]) + 1;\n}\nv2 = malloc((n + 1)* sizeof(char*) + len);\nassert(v2 != NULL);\np = (char *)&v2[n + 1];\nfor (i = 0; i < n; ++i) {\nint l = strlen(v1[i]);\nmemcpy(p, v1[i], l + 1);\nv2[i] = p;\np += l + 1;\n}\nv2[n] = 0;\n*argv = v2;\n#if !defined(MACRUBY_STATIC)\norigarg.argc = *argc;\norigarg.argv = *argv;\n# if !defined(PSTAT_SETCMD) && !defined(HAVE_SETPROCTITLE)\norigarg.len = get_arglen(origarg.argc, origarg.argv);\n# endif\n#endif\n}\nvoid\nruby_init_loadpath(void)\n{\n#if !defined(MACRUBY_STATIC)\nVALUE load_path;\n#if defined LOAD_RELATIVE\nchar libpath[MAXPATHLEN + 1];\nchar *p;\nint rest;\nlibpath[sizeof(libpath) - 1] = '\\0';\np = strrchr(libpath, '/');\nif (p) {\n*p = 0;\nif (p - libpath > 3 && !STRCASECMP(p - 4, \"/bin\")) {\np -= 4;\n*p = 0;\n}\n}\nelse {\nstrcpy(libpath, \".\");\np = libpath + 1;\n}\nrest = sizeof(libpath) - 1 - (p - libpath);\n#define RUBY_RELATIVE(path) (strncpy(p, (path), rest), libpath)\n#else\n#define RUBY_RELATIVE(path) (path)\n#endif\n#define incpush(path) rb_ary_push(load_path, rubylib_mangled_path2(path))\nload_path = rb_vm_load_path();\nif (rb_safe_level() == 0) {\nruby_incpush(getenv(\"RUBYLIB\"));\n}\n#ifdef RUBY_SEARCH_PATH\nincpush(RUBY_RELATIVE(RUBY_SEARCH_PATH));\n#endif\nincpush(RUBY_RELATIVE(RUBY_SITE_LIB2));\n#ifdef RUBY_SITE_THIN_ARCHLIB\nincpush(RUBY_RELATIVE(RUBY_SITE_THIN_ARCHLIB));\n#endif\nincpush(RUBY_RELATIVE(RUBY_SITE_ARCHLIB));\nincpush(RUBY_RELATIVE(RUBY_SITE_LIB));\nincpush(RUBY_RELATIVE(RUBY_VENDOR_LIB2));\n#ifdef RUBY_VENDOR_THIN_ARCHLIB\nincpush(RUBY_RELATIVE(RUBY_VENDOR_THIN_ARCHLIB));\n#endif\nincpush(RUBY_RELATIVE(RUBY_VENDOR_ARCHLIB));\nincpush(RUBY_RELATIVE(RUBY_VENDOR_LIB));\nincpush(RUBY_RELATIVE(RUBY_LIB));\n#ifdef RUBY_THIN_ARCHLIB\nincpush(RUBY_RELATIVE(RUBY_THIN_ARCHLIB));\n#endif\nincpush(RUBY_RELATIVE(RUBY_ARCHLIB));\nif (rb_safe_level() == 0) {\nincpush(\".\");\n}\n#endif // !MACRUBY_STATIC\n}\nvoid\nruby_set_argv(int argc, char **argv)\n{\nint i;\nVALUE av = rb_argv;\nrb_ary_clear(av);\nfor (i = 0; i < argc; i++) {\nVALUE arg = rb_tainted_str_new2(argv[i]);\nOBJ_FREEZE(arg);\nrb_ary_push(av, arg);\n}\n}\nvoid\nruby_script(const char *name)\n{\nif (name != NULL) {\nGC_RELEASE(rb_progname);\nrb_progname = rb_tainted_str_new2(name);\nGC_RETAIN(rb_progname);\n}\n}\nstatic void\nverbose_setter(VALUE val, ID id, VALUE *variable)\n{\nruby_verbose = RTEST(val) ? Qtrue : val;\n}\nstatic VALUE\nopt_W_getter(VALUE val, ID id)\n{\nif (ruby_verbose == Qnil) {\nreturn INT2FIX(0);\n}\nif (ruby_verbose == Qfalse) {\nreturn INT2FIX(1);\n}\nif (ruby_verbose == Qtrue) {\nreturn INT2FIX(2);\n}\nreturn Qnil; // not reached\n}\nstatic void\nset_arg0(VALUE val, ID id)\n{\n#if MACRUBY_STATIC\nrb_raise(rb_eRuntimeError,\n\"changing program name is not supported in MacRuby static\");\n#else\nconst char *s;\nlong i;\nif (origarg.argv == 0) {\nrb_raise(rb_eRuntimeError, \"$0 not initialized\");\n}\nStringValue(val);\ns = RSTRING_PTR(val);\ni = RSTRING_LEN(val);\n#if defined(PSTAT_SETCMD)\nif (i > PST_CLEN) {\nunion pstun un;\nchar buf[PST_CLEN + 1]; /* PST_CLEN is 64 (HP-UX 11.23) */\nstrncpy(buf, s, PST_CLEN);\nbuf[PST_CLEN] = '\\0';\nun.pst_command = buf;\npstat(PSTAT_SETCMD, un, PST_CLEN, 0, 0);\n}\nelse {\nunion pstun un;\nun.pst_command = s;\npstat(PSTAT_SETCMD, un, i, 0, 0);\n}\n#elif defined(HAVE_SETPROCTITLE)\nsetproctitle(\"%.*s\", (int)i, s);\n#else\nif (i >= origarg.len) {\ni = origarg.len;\n}\nmemcpy(origarg.argv[0], s, i);\n{\nint j;\nchar *t = origarg.argv[0] + i;\n*t = '\\0';\nif (i + 1 < origarg.len) memset(t + 1, ' ', origarg.len - i - 1);\nfor (j = 1; j < origarg.argc; j++) {\norigarg.argv[j] = t;\n}\n}\n#endif\nGC_RELEASE(rb_progname);\nrb_progname = rb_tainted_str_new(s, i);\nGC_RETAIN(rb_progname);\n#endif // !MACRUBY_STATIC\n}\nvoid\nruby_prog_init(void)\n{\ninit_ids();\nrb_define_hooked_variable(\"$VERBOSE\", &ruby_verbose, 0, verbose_setter);\nrb_define_hooked_variable(\"$-v\", &ruby_verbose, 0, verbose_setter);\nrb_define_hooked_variable(\"$-w\", &ruby_verbose, 0, verbose_setter);\nrb_define_virtual_variable(\"$-W\", opt_W_getter, rb_gvar_readonly_setter);\nrb_define_variable(\"$DEBUG\", &ruby_debug);\nrb_define_variable(\"$-d\", &ruby_debug);\nrb_define_hooked_variable(\"$0\", &rb_progname, 0, set_arg0);\nrb_define_hooked_variable(\"$PROGRAM_NAME\", &rb_progname, 0, set_arg0);\nrb_define_global_const(\"ARGV\", rb_argv);\nrb_vm_set_running(true);\n}\nSomething went wrong with that request. Please try again."},"metadata":{"kind":"string","value":"{\n \"url\": \"https://github.com/MacRuby/MacRuby/blob/eefae4a348945a9340bf5a70f9c0b15ab69fa9e1/ruby.c\",\n \"source_domain\": \"github.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2016-18\",\n \"warc_metadata\": {\n \"Content-Length\": \"424545\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:O4DGHN57T4VBXRAVBI2X56PTQF5LYL6T\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2016-05-02T07:02:04Z\",\n \"WARC-IP-Address\": \"192.30.252.123\",\n \"WARC-Identified-Payload-Type\": null,\n \"WARC-Payload-Digest\": \"sha1:I5JZ4YKFMQP3XEOIUDH3KMF6HCFIEUT3\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://github.com/MacRuby/MacRuby/blob/eefae4a348945a9340bf5a70f9c0b15ab69fa9e1/ruby.c\",\n \"WARC-Truncated\": \"length\",\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"robots: classic\\r\\nhostname: ip-10-239-7-51.ec2.internal\\r\\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\\r\\nisPartOf: CC-MAIN-2016-18\\r\\noperator: CommonCrawl Admin\\r\\ndescription: Wide crawl of the web for April 2016\\r\\npublisher: CommonCrawl\\r\\nformat: WARC File Format 1.0\\r\\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 16,\n 39,\n 81,\n 112,\n 115,\n 189,\n 191,\n 252,\n 311,\n 356,\n 424,\n 492,\n 495,\n 514,\n 537,\n 556,\n 576,\n 595,\n 618,\n 648,\n 671,\n 698,\n 715,\n 731,\n 753,\n 776,\n 798,\n 814,\n 821,\n 844,\n 871,\n 900,\n 939,\n 972,\n 1007,\n 1039,\n 1065,\n 1098,\n 1110,\n 1125,\n 1127,\n 1148,\n 1171,\n 1192,\n 1215,\n 1258,\n 1280,\n 1282,\n 1284,\n 1313,\n 1349,\n 1392,\n 1433,\n 1475,\n 1522,\n 1547,\n 1561,\n 1578,\n 1581,\n 1622,\n 1644,\n 1656,\n 1659,\n 1684,\n 1702,\n 1725,\n 1748,\n 1773,\n 1784,\n 1797,\n 1812,\n 1834,\n 1847,\n 1860,\n 1879,\n 1899,\n 1918,\n 1934,\n 1943,\n 1952,\n 1964,\n 1982,\n 1989,\n 2001,\n 2004,\n 2031,\n 2041,\n 2054,\n 2083,\n 2086,\n 2162,\n 2202,\n 2218,\n 2228,\n 2241,\n 2299,\n 2308,\n 2315,\n 2326,\n 2338,\n 2362,\n 2364,\n 2413,\n 2481,\n 2522,\n 2582,\n 2637,\n 2661,\n 2722,\n 2769,\n 2846,\n 2915,\n 2963,\n 3041,\n 3114,\n 3150,\n 3211,\n 3266,\n 3329,\n 3393,\n 3451,\n 3488,\n 3542,\n 3581,\n 3654,\n 3733,\n 3768,\n 3799,\n 3804,\n 3807,\n 3841,\n 3912,\n 3923,\n 3946,\n 3948,\n 3978,\n 4037,\n 4095,\n 4102,\n 4142,\n 4184,\n 4196,\n 4251,\n 4253,\n 4285,\n 4304,\n 4341,\n 4351,\n 4364,\n 4384,\n 4389,\n 4391,\n 4402,\n 4409,\n 4411,\n 4458,\n 4525,\n 4532,\n 4534,\n 4536,\n 4541,\n 4601,\n 4603,\n 4623,\n 4651,\n 4653,\n 4655,\n 4668,\n 4695,\n 4697,\n 4710,\n 4712,\n 4717,\n 4748,\n 4750,\n 4791,\n 4793,\n 4806,\n 4838,\n 4840,\n 4875,\n 4885,\n 4898,\n 4900,\n 4932,\n 4945,\n 4947,\n 4987,\n 4989,\n 4994,\n 5032,\n 5034,\n 5080,\n 5082,\n 5124,\n 5136,\n 5165,\n 5167,\n 5188,\n 5212,\n 5278,\n 5280,\n 5345,\n 5384,\n 5404,\n 5406,\n 5434,\n 5469,\n 5474,\n 5501,\n 5503,\n 5529,\n 5541,\n 5549,\n 5551,\n 5564,\n 5624,\n 5648,\n 5658,\n 5670,\n 5684,\n 5707,\n 5739,\n 5804,\n 5863,\n 5911,\n 5913,\n 5934,\n 5936,\n 5938,\n 5950,\n 5993,\n 5995,\n 6013,\n 6024,\n 6046,\n 6068,\n 6075,\n 6091,\n 6123,\n 6152,\n 6161,\n 6182,\n 6199,\n 6206,\n 6211,\n 6244,\n 6251,\n 6262,\n 6314,\n 6341,\n 6358,\n 6371,\n 6391,\n 6398,\n 6400,\n 6417,\n 6433,\n 6435,\n 6473,\n 6494,\n 6510,\n 6562,\n 6591,\n 6622,\n 6624,\n 6631,\n 6668,\n 6670,\n 6707,\n 6774,\n 6776,\n 6778,\n 6790,\n 6804,\n 6831,\n 6846,\n 6856,\n 6858,\n 6860,\n 6877,\n 6879,\n 6905,\n 6919,\n 6939,\n 6941,\n 6943,\n 6959,\n 6961,\n 7006,\n 7059,\n 7136,\n 7150,\n 7207,\n 7209,\n 7219,\n 7234,\n 7253,\n 7263,\n 7286,\n 7313,\n 7318,\n 7355,\n 7373,\n 7405,\n 7432,\n 7463,\n 7489,\n 7494,\n 7512,\n 7514,\n 7553,\n 7612,\n 7654,\n 7692,\n 7726,\n 7736,\n 7738,\n 7778,\n 7816,\n 7849,\n 7859,\n 7861,\n 7873,\n 7924,\n 7926,\n 8003,\n 8029,\n 8058,\n 8095,\n 8122,\n 8130,\n 8132,\n 8192,\n 8194,\n 8206,\n 8258,\n 8260,\n 8333,\n 8357,\n 8384,\n 8421,\n 8449,\n 8457,\n 8459,\n 8520,\n 8522,\n 8534,\n 8583,\n 8585,\n 8652,\n 8674,\n 8735,\n 8737,\n 8748,\n 8813,\n 8815,\n 8836,\n 8851,\n 8866,\n 8876,\n 8925,\n 8963,\n 8970,\n 8987,\n 8997,\n 9011,\n 9021,\n 9044,\n 9049,\n 9064,\n 9074,\n 9097,\n 9111,\n 9121,\n 9143,\n 9148,\n 9163,\n 9173,\n 9193,\n 9215,\n 9220,\n 9235,\n 9245,\n 9263,\n 9268,\n 9283,\n 9293,\n 9313,\n 9318,\n 9333,\n 9335,\n 9356,\n 9374,\n 9384,\n 9406,\n 9411,\n 9426,\n 9436,\n 9438,\n 9453,\n 9480,\n 9492,\n 9521,\n 9538,\n 9545,\n 9558,\n 9560,\n 9573,\n 9581,\n 9602,\n 9609,\n 9617,\n 9640,\n 9647,\n 9656,\n 9678,\n 9685,\n 9687,\n 9689,\n 9704,\n 9714,\n 9737,\n 9742,\n 9757,\n 9767,\n 9787,\n 9803,\n 9808,\n 9823,\n 9833,\n 9857,\n 9880,\n 9887,\n 9897,\n 9919,\n 9941,\n 9946,\n 9961,\n 9971,\n 9991,\n 10015,\n 10020,\n 10035,\n 10045,\n 10065,\n 10085,\n 10098,\n 10106,\n 10114,\n 10116,\n 10133,\n 10189,\n 10191,\n 10217,\n 10254,\n 10281,\n 10301,\n 10303,\n 10305,\n 10336,\n 10370,\n 10377,\n 10387,\n 10407,\n 10427,\n 10443,\n 10445,\n 10465,\n 10487,\n 10495,\n 10503,\n 10505,\n 10512,\n 10522,\n 10542,\n 10572,\n 10579,\n 10589,\n 10609,\n 10614,\n 10640,\n 10674,\n 10676,\n 10683,\n 10693,\n 10703,\n 10708,\n 10719,\n 10732,\n 10748,\n 10750,\n 10767,\n 10792,\n 10794,\n 10814,\n 10848,\n 10850,\n 10857,\n 10867,\n 10879,\n 10916,\n 10918,\n 10925,\n 10935,\n 10966,\n 10981,\n 10991,\n 11003,\n 11029,\n 11043,\n 11063,\n 11084,\n 11091,\n 11111,\n 11137,\n 11144,\n 11164,\n 11184,\n 11191,\n 11231,\n 11256,\n 11263,\n 11265,\n 11281,\n 11324,\n 11363,\n 11365,\n 11370,\n 11372,\n 11387,\n 11397,\n 11399,\n 11414,\n 11425,\n 11437,\n 11466,\n 11483,\n 11490,\n 11503,\n 11505,\n 11527,\n 11529,\n 11544,\n 11554,\n 11574,\n 11584,\n 11608,\n 11628,\n 11658,\n 11674,\n 11676,\n 11683,\n 11693,\n 11695,\n 11710,\n 11717,\n 11725,\n 11754,\n 11767,\n 11781,\n 11795,\n 11829,\n 11858,\n 11860,\n 11867,\n 11881,\n 11908,\n 11910,\n 11912,\n 11927,\n 11937,\n 11977,\n 11993,\n 12010,\n 12012,\n 12017,\n 12052,\n 12072,\n 12074,\n 12110,\n 12130,\n 12152,\n 12154,\n 12199,\n 12240,\n 12300,\n 12361,\n 12363,\n 12413,\n 12415,\n 12461,\n 12502,\n 12562,\n 12624,\n 12626,\n 12677,\n 12679,\n 12752,\n 12760,\n 12773,\n 12788,\n 12821,\n 12884,\n 12886,\n 12888,\n 12898,\n 12934,\n 12936,\n 12974,\n 12992,\n 12994,\n 13032,\n 13050,\n 13072,\n 13074,\n 13112,\n 13130,\n 13132,\n 13201,\n 13275,\n 13320,\n 13322,\n 13357,\n 13381,\n 13404,\n 13406,\n 13446,\n 13506,\n 13562,\n 13575,\n 13591,\n 13618,\n 13691,\n 13693,\n 13734,\n 13777,\n 13806,\n 13837,\n 13853,\n 13869,\n 13871,\n 13909,\n 13969,\n 14025,\n 14038,\n 14054,\n 14081,\n 14150,\n 14152,\n 14185,\n 14219,\n 14249,\n 14251,\n 14305,\n 14321,\n 14323,\n 14364,\n 14424,\n 14480,\n 14493,\n 14509,\n 14536,\n 14596,\n 14598,\n 14645,\n 14680,\n 14696,\n 14698,\n 14705,\n 14732,\n 14788,\n 14790,\n 14797,\n 14808,\n 14819,\n 14826,\n 14835,\n 14837,\n 14856,\n 14883,\n 14934,\n 14959,\n 14961,\n 14968,\n 14995,\n 15051,\n 15076,\n 15078,\n 15080,\n 15097,\n 15105,\n 15112,\n 15114,\n 15116,\n 15128,\n 15149,\n 15151,\n 15176,\n 15188,\n 15215,\n 15217,\n 15225,\n 15227,\n 15248,\n 15277,\n 15279,\n 15334,\n 15353,\n 15410,\n 15434,\n 15436,\n 15448,\n 15450,\n 15466,\n 15500,\n 15513,\n 15540,\n 15542,\n 15608,\n 15649,\n 15672,\n 15698,\n 15714,\n 15728,\n 15753,\n 15768,\n 15791,\n 15830,\n 15840,\n 15851,\n 15862,\n 15908,\n 15959,\n 15999,\n 16039,\n 16059,\n 16064,\n 16115,\n 16130,\n 16141,\n 16156,\n 16161,\n 16173,\n 16202,\n 16219,\n 16226,\n 16228,\n 16250,\n 16252,\n 16259,\n 16277,\n 16294,\n 16299,\n 16318,\n 16323,\n 16328,\n 16351,\n 16361,\n 16363,\n 16365,\n 16374,\n 16381,\n 16410,\n 16437,\n 16476,\n 16502,\n 16504,\n 16506,\n 16524,\n 16558,\n 16576,\n 16610,\n 16612,\n 16637,\n 16655,\n 16657,\n 16677,\n 16698,\n 16712,\n 16714,\n 16736,\n 16759,\n 16761,\n 16789,\n 16809,\n 16839,\n 16841,\n 16863,\n 16899,\n 16917,\n 16931,\n 16950,\n 16952,\n 16959,\n 16982,\n 17012,\n 17031,\n 17033,\n 17060,\n 17093,\n 17110,\n 17122,\n 17188,\n 17190,\n 17210,\n 17288,\n 17290,\n 17308,\n 17331,\n 17333,\n 17341,\n 17349,\n 17351,\n 17353,\n 17379,\n 17431,\n 17476,\n 17503,\n 17523,\n 17545,\n 17569,\n 17597,\n 17650,\n 17679,\n 17705,\n 17761,\n 17791,\n 17843,\n 17845,\n 17875,\n 17927,\n 17960,\n 17962,\n 17994,\n 18018,\n 18020,\n 18027,\n 18039,\n 18041,\n 18097,\n 18128,\n 18149,\n 18168,\n 18200,\n 18225,\n 18227,\n 18234,\n 18247,\n 18249,\n 18272,\n 18344,\n 18346,\n 18353,\n 18401,\n 18443,\n 18445,\n 18492,\n 18494,\n 18520,\n 18540,\n 18556,\n 18584,\n 18604,\n 18634,\n 18636,\n 18657,\n 18680,\n 18694,\n 18696,\n 18717,\n 18762,\n 18764,\n 18784,\n 18856,\n 18858,\n 18878,\n 18880,\n 18894,\n 18949,\n 18978,\n 18980,\n 19003,\n 19012,\n 19032,\n 19048,\n 19066,\n 19087,\n 19108,\n 19110,\n 19141,\n 19155,\n 19157,\n 19164,\n 19189,\n 19225,\n 19246,\n 19248,\n 19283,\n 19285,\n 19299,\n 19336,\n 19348,\n 19357,\n 19394,\n 19431,\n 19449,\n 19469,\n 19490,\n 19532,\n 19546,\n 19587,\n 19613,\n 19634,\n 19658,\n 19700,\n 19717,\n 19719,\n 19721,\n 19723,\n 19781,\n 19783,\n 19808,\n 19833,\n 19858,\n 19883,\n 19908,\n 19927,\n 19937,\n 19939,\n 19991,\n 20031,\n 20044,\n 20056,\n 20068,\n 20094,\n 20127,\n 20160,\n 20184,\n 20209,\n 20211,\n 20235,\n 20243,\n 20245,\n 20259,\n 20293,\n 20298,\n 20300,\n 20333,\n 20368,\n 20373,\n 20375,\n 20388,\n 20404,\n 20447,\n 20460,\n 20518,\n 20520,\n 20527,\n 20548,\n 20550,\n 20566,\n 20585,\n 20618,\n 20620,\n 20632,\n 20640,\n 20685,\n 20731,\n 20763,\n 20802,\n 20834,\n 20836,\n 20870,\n 20903,\n 20923,\n 20953,\n 20955,\n 20957,\n 21015,\n 21055,\n 21057,\n 21079,\n 21102,\n 21104,\n 21138,\n 21177,\n 21229,\n 21262,\n 21264,\n 21303,\n 21355,\n 21357,\n 21359,\n 21381,\n 21404,\n 21406,\n 21455,\n 21457,\n 21489,\n 21513,\n 21515,\n 21522,\n 21550,\n 21552,\n 21621,\n 21667,\n 21702,\n 21704,\n 21730,\n 21746,\n 21748,\n 21761,\n 21763,\n 21770,\n 21802,\n 21804,\n 21832,\n 21855,\n 21887,\n 21938,\n 21940,\n 21998,\n 22072,\n 22102,\n 22109,\n 22138,\n 22161,\n 22168,\n 22179,\n 22213,\n 22215,\n 22234,\n 22241,\n 22262,\n 22278,\n 22334,\n 22363,\n 22387,\n 22392,\n 22433,\n 22435,\n 22442,\n 22449,\n 22451,\n 22453,\n 22488,\n 22524,\n 22540,\n 22571,\n 22598,\n 22603,\n 22644,\n 22646,\n 22648,\n 22700,\n 22702,\n 22709,\n 22729,\n 22731,\n 22738,\n 22750,\n 22778,\n 22780,\n 22799,\n 22869,\n 22871,\n 22890,\n 22960,\n 22962,\n 22989,\n 23054,\n 23056,\n 23058,\n 23071,\n 23089,\n 23091,\n 23106,\n 23108,\n 23121,\n 23138,\n 23140,\n 23154,\n 23156,\n 23204,\n 23276,\n 23283,\n 23327,\n 23329,\n 23361,\n 23390,\n 23402,\n 23480,\n 23553,\n 23575,\n 23622,\n 23646,\n 23667,\n 23686,\n 23705,\n 23722,\n 23755,\n 23780,\n 23825,\n 23878,\n 23911,\n 23931,\n 23981,\n 24030,\n 24080,\n 24113,\n 24126,\n 24128,\n 24154,\n 24159,\n 24197,\n 24199,\n 24226,\n 24255,\n 24281,\n 24307,\n 24309,\n 24352,\n 24372,\n 24396,\n 24422,\n 24445,\n 24470,\n 24481,\n 24493,\n 24495,\n 24506,\n 24518,\n 24547,\n 24569,\n 24591,\n 24650,\n 24704,\n 24712,\n 24719,\n 24721,\n 24726,\n 24751,\n 24753,\n 24782,\n 24799,\n 24825,\n 24855,\n 24864,\n 24874,\n 24911,\n 24938,\n 24947,\n 24955,\n 25008,\n 25016,\n 25024,\n 25026,\n 25028,\n 25035,\n 25057,\n 25074,\n 25076,\n 25120,\n 25184,\n 25190,\n 25225,\n 25232,\n 25306,\n 25337,\n 25365,\n 25398,\n 25400,\n 25424,\n 25466,\n 25473,\n 25513,\n 25543,\n 25591,\n 25598,\n 25641,\n 25680,\n 25722,\n 25754,\n 25804,\n 25811,\n 25856,\n 25897,\n 25931,\n 25956,\n 25999,\n 26006,\n 26044,\n 26072,\n 26086,\n 26088,\n 26114,\n 26116,\n 26121,\n 26158,\n 26160,\n 26167,\n 26187,\n 26205,\n 26234,\n 26276,\n 26293,\n 26315,\n 26317,\n 26319,\n 26324,\n 26354,\n 26356,\n 26376,\n 26401,\n 26442,\n 26466,\n 26468,\n 26470,\n 26482,\n 26532,\n 26534,\n 26575,\n 26577,\n 26590,\n 26621,\n 26623,\n 26651,\n 26670,\n 26672,\n 26702,\n 26721,\n 26723,\n 26752,\n 26771,\n 26773,\n 26801,\n 26803,\n 26815,\n 26842,\n 26844,\n 26863,\n 26890,\n 26951,\n 26957,\n 26972,\n 26980,\n 27005,\n 27055,\n 27057,\n 27075,\n 27097,\n 27119,\n 27145,\n 27165,\n 27181,\n 27240,\n 27267,\n 27289,\n 27311,\n 27352,\n 27354,\n 27361,\n 27377,\n 27397,\n 27431,\n 27433,\n 27466,\n 27499,\n 27505,\n 27529,\n 27546,\n 27548,\n 27579,\n 27581,\n 27588,\n 27619,\n 27630,\n 27696,\n 27733,\n 27754,\n 27756,\n 27758,\n 27765,\n 27790,\n 27830,\n 27854,\n 27880,\n 27882,\n 27887,\n 27908,\n 27910,\n 27922,\n 27995,\n 28063,\n 28131,\n 28205,\n 28248,\n 28288,\n 28348,\n 28419,\n 28460,\n 28485,\n 28487\n ],\n \"line_end_idx\": [\n 16,\n 39,\n 81,\n 112,\n 115,\n 189,\n 191,\n 252,\n 311,\n 356,\n 424,\n 492,\n 495,\n 514,\n 537,\n 556,\n 576,\n 595,\n 618,\n 648,\n 671,\n 698,\n 715,\n 731,\n 753,\n 776,\n 798,\n 814,\n 821,\n 844,\n 871,\n 900,\n 939,\n 972,\n 1007,\n 1039,\n 1065,\n 1098,\n 1110,\n 1125,\n 1127,\n 1148,\n 1171,\n 1192,\n 1215,\n 1258,\n 1280,\n 1282,\n 1284,\n 1313,\n 1349,\n 1392,\n 1433,\n 1475,\n 1522,\n 1547,\n 1561,\n 1578,\n 1581,\n 1622,\n 1644,\n 1656,\n 1659,\n 1684,\n 1702,\n 1725,\n 1748,\n 1773,\n 1784,\n 1797,\n 1812,\n 1834,\n 1847,\n 1860,\n 1879,\n 1899,\n 1918,\n 1934,\n 1943,\n 1952,\n 1964,\n 1982,\n 1989,\n 2001,\n 2004,\n 2031,\n 2041,\n 2054,\n 2083,\n 2086,\n 2162,\n 2202,\n 2218,\n 2228,\n 2241,\n 2299,\n 2308,\n 2315,\n 2326,\n 2338,\n 2362,\n 2364,\n 2413,\n 2481,\n 2522,\n 2582,\n 2637,\n 2661,\n 2722,\n 2769,\n 2846,\n 2915,\n 2963,\n 3041,\n 3114,\n 3150,\n 3211,\n 3266,\n 3329,\n 3393,\n 3451,\n 3488,\n 3542,\n 3581,\n 3654,\n 3733,\n 3768,\n 3799,\n 3804,\n 3807,\n 3841,\n 3912,\n 3923,\n 3946,\n 3948,\n 3978,\n 4037,\n 4095,\n 4102,\n 4142,\n 4184,\n 4196,\n 4251,\n 4253,\n 4285,\n 4304,\n 4341,\n 4351,\n 4364,\n 4384,\n 4389,\n 4391,\n 4402,\n 4409,\n 4411,\n 4458,\n 4525,\n 4532,\n 4534,\n 4536,\n 4541,\n 4601,\n 4603,\n 4623,\n 4651,\n 4653,\n 4655,\n 4668,\n 4695,\n 4697,\n 4710,\n 4712,\n 4717,\n 4748,\n 4750,\n 4791,\n 4793,\n 4806,\n 4838,\n 4840,\n 4875,\n 4885,\n 4898,\n 4900,\n 4932,\n 4945,\n 4947,\n 4987,\n 4989,\n 4994,\n 5032,\n 5034,\n 5080,\n 5082,\n 5124,\n 5136,\n 5165,\n 5167,\n 5188,\n 5212,\n 5278,\n 5280,\n 5345,\n 5384,\n 5404,\n 5406,\n 5434,\n 5469,\n 5474,\n 5501,\n 5503,\n 5529,\n 5541,\n 5549,\n 5551,\n 5564,\n 5624,\n 5648,\n 5658,\n 5670,\n 5684,\n 5707,\n 5739,\n 5804,\n 5863,\n 5911,\n 5913,\n 5934,\n 5936,\n 5938,\n 5950,\n 5993,\n 5995,\n 6013,\n 6024,\n 6046,\n 6068,\n 6075,\n 6091,\n 6123,\n 6152,\n 6161,\n 6182,\n 6199,\n 6206,\n 6211,\n 6244,\n 6251,\n 6262,\n 6314,\n 6341,\n 6358,\n 6371,\n 6391,\n 6398,\n 6400,\n 6417,\n 6433,\n 6435,\n 6473,\n 6494,\n 6510,\n 6562,\n 6591,\n 6622,\n 6624,\n 6631,\n 6668,\n 6670,\n 6707,\n 6774,\n 6776,\n 6778,\n 6790,\n 6804,\n 6831,\n 6846,\n 6856,\n 6858,\n 6860,\n 6877,\n 6879,\n 6905,\n 6919,\n 6939,\n 6941,\n 6943,\n 6959,\n 6961,\n 7006,\n 7059,\n 7136,\n 7150,\n 7207,\n 7209,\n 7219,\n 7234,\n 7253,\n 7263,\n 7286,\n 7313,\n 7318,\n 7355,\n 7373,\n 7405,\n 7432,\n 7463,\n 7489,\n 7494,\n 7512,\n 7514,\n 7553,\n 7612,\n 7654,\n 7692,\n 7726,\n 7736,\n 7738,\n 7778,\n 7816,\n 7849,\n 7859,\n 7861,\n 7873,\n 7924,\n 7926,\n 8003,\n 8029,\n 8058,\n 8095,\n 8122,\n 8130,\n 8132,\n 8192,\n 8194,\n 8206,\n 8258,\n 8260,\n 8333,\n 8357,\n 8384,\n 8421,\n 8449,\n 8457,\n 8459,\n 8520,\n 8522,\n 8534,\n 8583,\n 8585,\n 8652,\n 8674,\n 8735,\n 8737,\n 8748,\n 8813,\n 8815,\n 8836,\n 8851,\n 8866,\n 8876,\n 8925,\n 8963,\n 8970,\n 8987,\n 8997,\n 9011,\n 9021,\n 9044,\n 9049,\n 9064,\n 9074,\n 9097,\n 9111,\n 9121,\n 9143,\n 9148,\n 9163,\n 9173,\n 9193,\n 9215,\n 9220,\n 9235,\n 9245,\n 9263,\n 9268,\n 9283,\n 9293,\n 9313,\n 9318,\n 9333,\n 9335,\n 9356,\n 9374,\n 9384,\n 9406,\n 9411,\n 9426,\n 9436,\n 9438,\n 9453,\n 9480,\n 9492,\n 9521,\n 9538,\n 9545,\n 9558,\n 9560,\n 9573,\n 9581,\n 9602,\n 9609,\n 9617,\n 9640,\n 9647,\n 9656,\n 9678,\n 9685,\n 9687,\n 9689,\n 9704,\n 9714,\n 9737,\n 9742,\n 9757,\n 9767,\n 9787,\n 9803,\n 9808,\n 9823,\n 9833,\n 9857,\n 9880,\n 9887,\n 9897,\n 9919,\n 9941,\n 9946,\n 9961,\n 9971,\n 9991,\n 10015,\n 10020,\n 10035,\n 10045,\n 10065,\n 10085,\n 10098,\n 10106,\n 10114,\n 10116,\n 10133,\n 10189,\n 10191,\n 10217,\n 10254,\n 10281,\n 10301,\n 10303,\n 10305,\n 10336,\n 10370,\n 10377,\n 10387,\n 10407,\n 10427,\n 10443,\n 10445,\n 10465,\n 10487,\n 10495,\n 10503,\n 10505,\n 10512,\n 10522,\n 10542,\n 10572,\n 10579,\n 10589,\n 10609,\n 10614,\n 10640,\n 10674,\n 10676,\n 10683,\n 10693,\n 10703,\n 10708,\n 10719,\n 10732,\n 10748,\n 10750,\n 10767,\n 10792,\n 10794,\n 10814,\n 10848,\n 10850,\n 10857,\n 10867,\n 10879,\n 10916,\n 10918,\n 10925,\n 10935,\n 10966,\n 10981,\n 10991,\n 11003,\n 11029,\n 11043,\n 11063,\n 11084,\n 11091,\n 11111,\n 11137,\n 11144,\n 11164,\n 11184,\n 11191,\n 11231,\n 11256,\n 11263,\n 11265,\n 11281,\n 11324,\n 11363,\n 11365,\n 11370,\n 11372,\n 11387,\n 11397,\n 11399,\n 11414,\n 11425,\n 11437,\n 11466,\n 11483,\n 11490,\n 11503,\n 11505,\n 11527,\n 11529,\n 11544,\n 11554,\n 11574,\n 11584,\n 11608,\n 11628,\n 11658,\n 11674,\n 11676,\n 11683,\n 11693,\n 11695,\n 11710,\n 11717,\n 11725,\n 11754,\n 11767,\n 11781,\n 11795,\n 11829,\n 11858,\n 11860,\n 11867,\n 11881,\n 11908,\n 11910,\n 11912,\n 11927,\n 11937,\n 11977,\n 11993,\n 12010,\n 12012,\n 12017,\n 12052,\n 12072,\n 12074,\n 12110,\n 12130,\n 12152,\n 12154,\n 12199,\n 12240,\n 12300,\n 12361,\n 12363,\n 12413,\n 12415,\n 12461,\n 12502,\n 12562,\n 12624,\n 12626,\n 12677,\n 12679,\n 12752,\n 12760,\n 12773,\n 12788,\n 12821,\n 12884,\n 12886,\n 12888,\n 12898,\n 12934,\n 12936,\n 12974,\n 12992,\n 12994,\n 13032,\n 13050,\n 13072,\n 13074,\n 13112,\n 13130,\n 13132,\n 13201,\n 13275,\n 13320,\n 13322,\n 13357,\n 13381,\n 13404,\n 13406,\n 13446,\n 13506,\n 13562,\n 13575,\n 13591,\n 13618,\n 13691,\n 13693,\n 13734,\n 13777,\n 13806,\n 13837,\n 13853,\n 13869,\n 13871,\n 13909,\n 13969,\n 14025,\n 14038,\n 14054,\n 14081,\n 14150,\n 14152,\n 14185,\n 14219,\n 14249,\n 14251,\n 14305,\n 14321,\n 14323,\n 14364,\n 14424,\n 14480,\n 14493,\n 14509,\n 14536,\n 14596,\n 14598,\n 14645,\n 14680,\n 14696,\n 14698,\n 14705,\n 14732,\n 14788,\n 14790,\n 14797,\n 14808,\n 14819,\n 14826,\n 14835,\n 14837,\n 14856,\n 14883,\n 14934,\n 14959,\n 14961,\n 14968,\n 14995,\n 15051,\n 15076,\n 15078,\n 15080,\n 15097,\n 15105,\n 15112,\n 15114,\n 15116,\n 15128,\n 15149,\n 15151,\n 15176,\n 15188,\n 15215,\n 15217,\n 15225,\n 15227,\n 15248,\n 15277,\n 15279,\n 15334,\n 15353,\n 15410,\n 15434,\n 15436,\n 15448,\n 15450,\n 15466,\n 15500,\n 15513,\n 15540,\n 15542,\n 15608,\n 15649,\n 15672,\n 15698,\n 15714,\n 15728,\n 15753,\n 15768,\n 15791,\n 15830,\n 15840,\n 15851,\n 15862,\n 15908,\n 15959,\n 15999,\n 16039,\n 16059,\n 16064,\n 16115,\n 16130,\n 16141,\n 16156,\n 16161,\n 16173,\n 16202,\n 16219,\n 16226,\n 16228,\n 16250,\n 16252,\n 16259,\n 16277,\n 16294,\n 16299,\n 16318,\n 16323,\n 16328,\n 16351,\n 16361,\n 16363,\n 16365,\n 16374,\n 16381,\n 16410,\n 16437,\n 16476,\n 16502,\n 16504,\n 16506,\n 16524,\n 16558,\n 16576,\n 16610,\n 16612,\n 16637,\n 16655,\n 16657,\n 16677,\n 16698,\n 16712,\n 16714,\n 16736,\n 16759,\n 16761,\n 16789,\n 16809,\n 16839,\n 16841,\n 16863,\n 16899,\n 16917,\n 16931,\n 16950,\n 16952,\n 16959,\n 16982,\n 17012,\n 17031,\n 17033,\n 17060,\n 17093,\n 17110,\n 17122,\n 17188,\n 17190,\n 17210,\n 17288,\n 17290,\n 17308,\n 17331,\n 17333,\n 17341,\n 17349,\n 17351,\n 17353,\n 17379,\n 17431,\n 17476,\n 17503,\n 17523,\n 17545,\n 17569,\n 17597,\n 17650,\n 17679,\n 17705,\n 17761,\n 17791,\n 17843,\n 17845,\n 17875,\n 17927,\n 17960,\n 17962,\n 17994,\n 18018,\n 18020,\n 18027,\n 18039,\n 18041,\n 18097,\n 18128,\n 18149,\n 18168,\n 18200,\n 18225,\n 18227,\n 18234,\n 18247,\n 18249,\n 18272,\n 18344,\n 18346,\n 18353,\n 18401,\n 18443,\n 18445,\n 18492,\n 18494,\n 18520,\n 18540,\n 18556,\n 18584,\n 18604,\n 18634,\n 18636,\n 18657,\n 18680,\n 18694,\n 18696,\n 18717,\n 18762,\n 18764,\n 18784,\n 18856,\n 18858,\n 18878,\n 18880,\n 18894,\n 18949,\n 18978,\n 18980,\n 19003,\n 19012,\n 19032,\n 19048,\n 19066,\n 19087,\n 19108,\n 19110,\n 19141,\n 19155,\n 19157,\n 19164,\n 19189,\n 19225,\n 19246,\n 19248,\n 19283,\n 19285,\n 19299,\n 19336,\n 19348,\n 19357,\n 19394,\n 19431,\n 19449,\n 19469,\n 19490,\n 19532,\n 19546,\n 19587,\n 19613,\n 19634,\n 19658,\n 19700,\n 19717,\n 19719,\n 19721,\n 19723,\n 19781,\n 19783,\n 19808,\n 19833,\n 19858,\n 19883,\n 19908,\n 19927,\n 19937,\n 19939,\n 19991,\n 20031,\n 20044,\n 20056,\n 20068,\n 20094,\n 20127,\n 20160,\n 20184,\n 20209,\n 20211,\n 20235,\n 20243,\n 20245,\n 20259,\n 20293,\n 20298,\n 20300,\n 20333,\n 20368,\n 20373,\n 20375,\n 20388,\n 20404,\n 20447,\n 20460,\n 20518,\n 20520,\n 20527,\n 20548,\n 20550,\n 20566,\n 20585,\n 20618,\n 20620,\n 20632,\n 20640,\n 20685,\n 20731,\n 20763,\n 20802,\n 20834,\n 20836,\n 20870,\n 20903,\n 20923,\n 20953,\n 20955,\n 20957,\n 21015,\n 21055,\n 21057,\n 21079,\n 21102,\n 21104,\n 21138,\n 21177,\n 21229,\n 21262,\n 21264,\n 21303,\n 21355,\n 21357,\n 21359,\n 21381,\n 21404,\n 21406,\n 21455,\n 21457,\n 21489,\n 21513,\n 21515,\n 21522,\n 21550,\n 21552,\n 21621,\n 21667,\n 21702,\n 21704,\n 21730,\n 21746,\n 21748,\n 21761,\n 21763,\n 21770,\n 21802,\n 21804,\n 21832,\n 21855,\n 21887,\n 21938,\n 21940,\n 21998,\n 22072,\n 22102,\n 22109,\n 22138,\n 22161,\n 22168,\n 22179,\n 22213,\n 22215,\n 22234,\n 22241,\n 22262,\n 22278,\n 22334,\n 22363,\n 22387,\n 22392,\n 22433,\n 22435,\n 22442,\n 22449,\n 22451,\n 22453,\n 22488,\n 22524,\n 22540,\n 22571,\n 22598,\n 22603,\n 22644,\n 22646,\n 22648,\n 22700,\n 22702,\n 22709,\n 22729,\n 22731,\n 22738,\n 22750,\n 22778,\n 22780,\n 22799,\n 22869,\n 22871,\n 22890,\n 22960,\n 22962,\n 22989,\n 23054,\n 23056,\n 23058,\n 23071,\n 23089,\n 23091,\n 23106,\n 23108,\n 23121,\n 23138,\n 23140,\n 23154,\n 23156,\n 23204,\n 23276,\n 23283,\n 23327,\n 23329,\n 23361,\n 23390,\n 23402,\n 23480,\n 23553,\n 23575,\n 23622,\n 23646,\n 23667,\n 23686,\n 23705,\n 23722,\n 23755,\n 23780,\n 23825,\n 23878,\n 23911,\n 23931,\n 23981,\n 24030,\n 24080,\n 24113,\n 24126,\n 24128,\n 24154,\n 24159,\n 24197,\n 24199,\n 24226,\n 24255,\n 24281,\n 24307,\n 24309,\n 24352,\n 24372,\n 24396,\n 24422,\n 24445,\n 24470,\n 24481,\n 24493,\n 24495,\n 24506,\n 24518,\n 24547,\n 24569,\n 24591,\n 24650,\n 24704,\n 24712,\n 24719,\n 24721,\n 24726,\n 24751,\n 24753,\n 24782,\n 24799,\n 24825,\n 24855,\n 24864,\n 24874,\n 24911,\n 24938,\n 24947,\n 24955,\n 25008,\n 25016,\n 25024,\n 25026,\n 25028,\n 25035,\n 25057,\n 25074,\n 25076,\n 25120,\n 25184,\n 25190,\n 25225,\n 25232,\n 25306,\n 25337,\n 25365,\n 25398,\n 25400,\n 25424,\n 25466,\n 25473,\n 25513,\n 25543,\n 25591,\n 25598,\n 25641,\n 25680,\n 25722,\n 25754,\n 25804,\n 25811,\n 25856,\n 25897,\n 25931,\n 25956,\n 25999,\n 26006,\n 26044,\n 26072,\n 26086,\n 26088,\n 26114,\n 26116,\n 26121,\n 26158,\n 26160,\n 26167,\n 26187,\n 26205,\n 26234,\n 26276,\n 26293,\n 26315,\n 26317,\n 26319,\n 26324,\n 26354,\n 26356,\n 26376,\n 26401,\n 26442,\n 26466,\n 26468,\n 26470,\n 26482,\n 26532,\n 26534,\n 26575,\n 26577,\n 26590,\n 26621,\n 26623,\n 26651,\n 26670,\n 26672,\n 26702,\n 26721,\n 26723,\n 26752,\n 26771,\n 26773,\n 26801,\n 26803,\n 26815,\n 26842,\n 26844,\n 26863,\n 26890,\n 26951,\n 26957,\n 26972,\n 26980,\n 27005,\n 27055,\n 27057,\n 27075,\n 27097,\n 27119,\n 27145,\n 27165,\n 27181,\n 27240,\n 27267,\n 27289,\n 27311,\n 27352,\n 27354,\n 27361,\n 27377,\n 27397,\n 27431,\n 27433,\n 27466,\n 27499,\n 27505,\n 27529,\n 27546,\n 27548,\n 27579,\n 27581,\n 27588,\n 27619,\n 27630,\n 27696,\n 27733,\n 27754,\n 27756,\n 27758,\n 27765,\n 27790,\n 27830,\n 27854,\n 27880,\n 27882,\n 27887,\n 27908,\n 27910,\n 27922,\n 27995,\n 28063,\n 28131,\n 28205,\n 28248,\n 28288,\n 28348,\n 28419,\n 28460,\n 28485,\n 28487,\n 28544\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 28544,\n \"ccnet_original_nlines\": 1304,\n \"rps_doc_curly_bracket\": 0.014714130200445652,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.12652258574962616,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.04007859155535698,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0.0007662799907848239,\n \"rps_doc_frac_no_alph_words\": 0.5423706769943237,\n \"rps_doc_frac_unique_words\": 0.2877984046936035,\n \"rps_doc_mean_word_length\": 6.019894123077393,\n \"rps_doc_num_sentences\": 224,\n \"rps_doc_symbol_to_word_ratio\": 0.010740010067820549,\n \"rps_doc_unigram_entropy\": 5.673943996429443,\n \"rps_doc_word_count\": 3016,\n \"rps_doc_frac_chars_dupe_10grams\": 0.04659616947174072,\n \"rps_doc_frac_chars_dupe_5grams\": 0.12838731706142426,\n \"rps_doc_frac_chars_dupe_6grams\": 0.10167437791824341,\n \"rps_doc_frac_chars_dupe_7grams\": 0.07567746192216873,\n \"rps_doc_frac_chars_dupe_8grams\": 0.06201807036995888,\n \"rps_doc_frac_chars_dupe_9grams\": 0.058272749185562134,\n \"rps_doc_frac_chars_top_2gram\": 0.007270319852977991,\n \"rps_doc_frac_chars_top_3gram\": 0.011456269770860672,\n \"rps_doc_frac_chars_top_4gram\": 0.009363300167024136,\n \"rps_doc_books_importance\": -3287.915771484375,\n \"rps_doc_books_importance_length_correction\": -3287.915771484375,\n \"rps_doc_openwebtext_importance\": -1932.2738037109375,\n \"rps_doc_openwebtext_importance_length_correction\": -1932.2738037109375,\n \"rps_doc_wikipedia_importance\": -1451.733642578125,\n \"rps_doc_wikipedia_importance_length_correction\": -1451.733642578125\n },\n \"fasttext\": {\n \"dclm\": 0.9954296350479126,\n \"english\": 0.20085221529006958,\n \"fineweb_edu_approx\": 2.978259801864624,\n \"eai_general_math\": 0.7926819920539856,\n \"eai_open_web_math\": 0.23550474643707275,\n \"eai_web_code\": 0.6341419219970703\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.1332\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"005.133\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Analyze\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Code/Software\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"1\",\n \"label\": \"Leftover HTML\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Academic Writing\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Advanced Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Graduate/Expert Level\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192851,"cells":{"id":{"kind":"number","value":106602974726008960,"string":"106,602,974,726,008,960"},"text":{"kind":"string","value":" • \"Bwoah.\" - Generic Kimi Quotes.\n 1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.\n 2. If you have any questions, please don't hesitate to ask. There's no such thing as a stupid question.\n\nKicked from the RD server\n\nDiscussion in 'Stock Car Extreme' started by Sean McGrath, Dec 20, 2012.\n\n 1. Sean McGrath\n\n Sean McGrath\n\n Messages:\n 6\n Ratings:\n +0\n The hughs bro's were in the server i tried to join and was constantly kicked before i could type\n  \n 2. Scott Webber\n\n Scott Webber\n\n Messages:\n 7,392\n Ratings:\n +2,397\n i don't see your name on the server log, when was this?\n\n you may have been kicked for various reasons,\n  \n 3. Sean McGrath\n\n Sean McGrath\n\n Messages:\n 6\n Ratings:\n +0\n This would have veen a little over an hour ago, the first time i joined i was able to get on the track for abit before i got droped\n  \n 4. Bram\n\n Bram\n #27 | Roaring Pipes Maniacs Staff Premium\n\n Messages:\n 41,685\n Ratings:\n +15,998\n What was the track / car combination? Addon track maybe?\n  \n 5. Scott Webber\n\n Scott Webber\n\n Messages:\n 7,392\n Ratings:\n +2,397\n have you checked to see if your mods work offline? , like any track you may have downloaded, if it doesn't work then the installation for the track may have been installed in the wrong folder.\n  \n 6. Bram\n\n Bram\n #27 | Roaring Pipes Maniacs Staff Premium\n\n Messages:\n 41,685\n Ratings:\n +15,998\n There is only one server up and that one is for private testing the headlights mod on the ring. Probably been a server of somebody else.\n  \n 7. Nik Hughes\n\n Nik Hughes\n\n Messages:\n 771\n Ratings:\n +399\n There's a public server up for the Ring, says it's an RD one. Noticed Sean join and leave soon after when we were on yesterday, didn't come up with any mismatch warning or anything.\n  \n 8. Bram\n\n Bram\n #27 | Roaring Pipes Maniacs Staff Premium\n\n Messages:\n 41,685\n Ratings:\n +15,998\n Oh but that one probably has our light mod installed for testing. Strange that you guys could join though.\n\n Maybe running with older league skinpacks?\n  \n 9. Jimi Hughes\n\n Jimi Hughes\n RDMCC S6 Champion\n\n Messages:\n 903\n Ratings:\n +445\n Nik and I were both in that server, which was public with no passwords, didn't realise it was supposed to be private and for the light mod testing only... My Bad I guess!\n\n We were only using standard skins not the RDMCC skins. I would guess that any issues with people being booted from the server is due to incorrect installation of the circuit, there was certainly no issues with the server that I was aware of...\n  \n • Like Like x 1\n 10. Bram\n\n Bram\n #27 | Roaring Pipes Maniacs Staff Premium\n\n Messages:\n 41,685\n Ratings:\n +15,998\n • Like Like x 1\n 11. Marco Bijl\n\n Marco Bijl\n adMAXIhater (O.O.O.)\n\n Messages:\n 6,558\n Ratings:\n +3,186\n Using the skinpack from the MCC results in a fault notification in windows, when the track is loading. Should not get you kicked, as when you acknoledge the notification, loading continues, and you can drive. Only thing is that you are seen as a TEMP car by others in the server.\n\n So, it must have been track related. Indeed, check the version of the Nords. Had the same a while back.\n\n The server referred to here, is joinable with and without the lights mod installed. Only the race session is in the dark, so practice and qualify can be driven without the light mod as well.\n  "},"metadata":{"kind":"string","value":"{\n \"url\": \"http://www.racedepartment.com/threads/kicked-from-the-rd-server.61867/\",\n \"source_domain\": \"www.racedepartment.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2017-22\",\n \"warc_metadata\": {\n \"Content-Length\": \"97492\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:GF4CICVPVKQRYU37I4H7RXCXDKOPZ3E7\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2017-05-25T12:43:50Z\",\n \"WARC-IP-Address\": \"31.204.128.181\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:JEMNNFX3WHX6JQURIKHHQICPQKOJ4J7T\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"http://www.racedepartment.com/threads/kicked-from-the-rd-server.61867/\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"robots: classic\\r\\nhostname: ip-10-185-224-210.ec2.internal\\r\\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\\r\\nisPartOf: CC-MAIN-2017-22\\r\\noperator: Common Crawl Admin\\r\\ndescription: Wide crawl of the web for May 2017\\r\\npublisher: Common Crawl\\r\\nformat: WARC File Format 1.0\\r\\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 36,\n 149,\n 255,\n 256,\n 282,\n 283,\n 356,\n 357,\n 375,\n 376,\n 393,\n 394,\n 408,\n 414,\n 427,\n 434,\n 535,\n 541,\n 559,\n 560,\n 577,\n 578,\n 592,\n 602,\n 615,\n 626,\n 686,\n 687,\n 737,\n 743,\n 761,\n 762,\n 779,\n 780,\n 794,\n 800,\n 813,\n 820,\n 956,\n 962,\n 972,\n 973,\n 982,\n 1028,\n 1029,\n 1043,\n 1054,\n 1067,\n 1079,\n 1140,\n 1146,\n 1164,\n 1165,\n 1182,\n 1183,\n 1197,\n 1207,\n 1220,\n 1231,\n 1428,\n 1434,\n 1444,\n 1445,\n 1454,\n 1500,\n 1501,\n 1515,\n 1526,\n 1539,\n 1551,\n 1692,\n 1698,\n 1714,\n 1715,\n 1730,\n 1731,\n 1745,\n 1753,\n 1766,\n 1775,\n 1961,\n 1967,\n 1977,\n 1978,\n 1987,\n 2033,\n 2034,\n 2048,\n 2059,\n 2072,\n 2084,\n 2195,\n 2196,\n 2243,\n 2249,\n 2266,\n 2267,\n 2283,\n 2305,\n 2306,\n 2320,\n 2328,\n 2341,\n 2350,\n 2525,\n 2526,\n 2774,\n 2780,\n 2800,\n 2811,\n 2812,\n 2821,\n 2867,\n 2868,\n 2882,\n 2893,\n 2906,\n 2918,\n 2938,\n 2955,\n 2956,\n 2971,\n 2996,\n 2997,\n 3011,\n 3021,\n 3034,\n 3045,\n 3329,\n 3330,\n 3438,\n 3439,\n 3634\n ],\n \"line_end_idx\": [\n 36,\n 149,\n 255,\n 256,\n 282,\n 283,\n 356,\n 357,\n 375,\n 376,\n 393,\n 394,\n 408,\n 414,\n 427,\n 434,\n 535,\n 541,\n 559,\n 560,\n 577,\n 578,\n 592,\n 602,\n 615,\n 626,\n 686,\n 687,\n 737,\n 743,\n 761,\n 762,\n 779,\n 780,\n 794,\n 800,\n 813,\n 820,\n 956,\n 962,\n 972,\n 973,\n 982,\n 1028,\n 1029,\n 1043,\n 1054,\n 1067,\n 1079,\n 1140,\n 1146,\n 1164,\n 1165,\n 1182,\n 1183,\n 1197,\n 1207,\n 1220,\n 1231,\n 1428,\n 1434,\n 1444,\n 1445,\n 1454,\n 1500,\n 1501,\n 1515,\n 1526,\n 1539,\n 1551,\n 1692,\n 1698,\n 1714,\n 1715,\n 1730,\n 1731,\n 1745,\n 1753,\n 1766,\n 1775,\n 1961,\n 1967,\n 1977,\n 1978,\n 1987,\n 2033,\n 2034,\n 2048,\n 2059,\n 2072,\n 2084,\n 2195,\n 2196,\n 2243,\n 2249,\n 2266,\n 2267,\n 2283,\n 2305,\n 2306,\n 2320,\n 2328,\n 2341,\n 2350,\n 2525,\n 2526,\n 2774,\n 2780,\n 2800,\n 2811,\n 2812,\n 2821,\n 2867,\n 2868,\n 2882,\n 2893,\n 2906,\n 2918,\n 2938,\n 2955,\n 2956,\n 2971,\n 2996,\n 2997,\n 3011,\n 3021,\n 3034,\n 3045,\n 3329,\n 3330,\n 3438,\n 3439,\n 3634,\n 3639\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 3639,\n \"ccnet_original_nlines\": 133,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.3500678539276123,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.01899592950940132,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0.007462690118700266,\n \"rps_doc_frac_no_alph_words\": 0.27137041091918945,\n \"rps_doc_frac_unique_words\": 0.4423076808452606,\n \"rps_doc_mean_word_length\": 4.344405651092529,\n \"rps_doc_num_sentences\": 48,\n \"rps_doc_symbol_to_word_ratio\": 0.008141109719872475,\n \"rps_doc_unigram_entropy\": 5.14096736907959,\n \"rps_doc_word_count\": 572,\n \"rps_doc_frac_chars_dupe_10grams\": 0.10623741894960403,\n \"rps_doc_frac_chars_dupe_5grams\": 0.1826961785554886,\n \"rps_doc_frac_chars_dupe_6grams\": 0.17384305596351624,\n \"rps_doc_frac_chars_dupe_7grams\": 0.17384305596351624,\n \"rps_doc_frac_chars_dupe_8grams\": 0.17384305596351624,\n \"rps_doc_frac_chars_dupe_9grams\": 0.10623741894960403,\n \"rps_doc_frac_chars_top_2gram\": 0.02173038013279438,\n \"rps_doc_frac_chars_top_3gram\": 0.016096580773591995,\n \"rps_doc_frac_chars_top_4gram\": 0.02736419066786766,\n \"rps_doc_books_importance\": -289.4105224609375,\n \"rps_doc_books_importance_length_correction\": -289.4105224609375,\n \"rps_doc_openwebtext_importance\": -183.9044189453125,\n \"rps_doc_openwebtext_importance_length_correction\": -183.9044189453125,\n \"rps_doc_wikipedia_importance\": -149.0006561279297,\n \"rps_doc_wikipedia_importance_length_correction\": -149.0006561279297\n },\n \"fasttext\": {\n \"dclm\": 0.01953626051545143,\n \"english\": 0.9646788239479065,\n \"fineweb_edu_approx\": 1.0211139917373657,\n \"eai_general_math\": 0.004960120189934969,\n \"eai_open_web_math\": 0.2965920567512512,\n \"eai_web_code\": 0.00035678999847732484\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"004.67\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n },\n \"secondary\": {\n \"code\": \"005.1\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Social/Forum\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"18\",\n \"label\": \"Q&A Forum\"\n },\n \"secondary\": {\n \"code\": \"21\",\n \"label\": \"Customer Support\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Partially Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"1\",\n \"label\": \"General Audience\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192852,"cells":{"id":{"kind":"number","value":3266515039604414500,"string":"3,266,515,039,604,414,500"},"text":{"kind":"string","value":"LoginSignup\n6\n5\n\nMore than 3 years have passed since last update.\n\nGatsby.jsで無限スクロールを実装する方法\n\nLast updated at Posted at 2021-01-26\n\nこの記事について\n\n無限スクロールしたいというのは、割と良くあることだと思います。\n純粋なReactだと無限スクロールのコンポーネントはGithubにもたくさん上がっていて、それらを導入するだけで済むのですが、Gatsby.jsを使用する場合にはちょっとした注意点と対策が必要なので、それを書きます。\n\nまず素直に書いてみる\n\n無限スクロールのコンポーネントには、スター数が多いankeetmaini/react-infinite-scroll-componentを使います。\n\nimport React, { useState } from \"react\"\nimport { graphql } from \"gatsby\"\nimport InfiniteScroll from 'react-infinite-scroll-component'\n\nconst IndexPage = ({ data: { allVideo }}) => {\n const [showVideoIndex, setShowVideoIndex] = useState(24)\n const [showVideos, setShowVideos] = useState(allVideo.nodes)\n\n return (\n\n setShowVideoIndex(showVideoIndex + 24)}\n hasMore={showVideos.length > showVideoIndex}\n >\n {showVideos.slice(0, showVideoIndex).map((video, key) => (\n \n ))}\n \n\n
\n )\n}\n\nexport default IndexPage\n\nexport const query = graphql`\n{\n allVideo {\n nodes {\n id\n thumbnail_image {\n childImageSharp {\n fluid(maxWidth: 300) {\n ...GatsbyImageSharpFluid\n }\n }\n }\n }\n }\n}\n`\n\nこれは、動画のサムネイルを表示して、無限スクロールする例です。\n簡単にやっていることを説明すると、allVideoというgraphQLを発行し、全ての動画を配列で取得、スクロールするごとにshowVideoIndexを加算し、allVideo配列の最初からshowVideoIndexまでのサムネイルを表示しています。\n\n問題点\n\n上記のプログラムには、問題があります。\n動画が増えれば増えるほど、このページは読み込みが重くなります。\nさらに、上記のページに全てのページからワンクリックでアクセスできる場合、サイト全体が重くなります。\n\n理由は、Gatsby.jsがバックグラウンドで読ませているpage-data.jsonにあります。\n\nGatsby.jsは、まず初期レンダリングの状態を静的なHTMLとして生成します。上記の例だと、初期のshowVideoIndexは24なので、24個の動画サムネイルが表示される状態のHTMLファイルを生成します。\n\nそれと同時に、上記のページで発行しているgraphQLの結果をpage-data.jsonとして生成しています。\nHTMLファイルと一緒にブラウザに渡して、Hydrateしているみたいです。\n\npage-data.jsonにはクエリ結果が1つのファイルに収められているので、動画数が10000とかになれば、数MBのファイルになるでしょう。\n\nさらに、Gatsbyは、Gatsby Link()先のページのpage-data.jsonもプリフェッチします。\n先ほど全てのページが重くなる可能性があると言ったのは、そのためです。\n\nじゃあapiを作って、そこから読み込むというのが選択肢になるわけですが、外部のAPIを使った場合、Gatsbyの生成した画像URLなどは参照できないわけです。\n\n解決策\n\n一度に読み込む分のデータを切り分けて、jsonファイルにします。\nJSON Outputというめちゃめちゃ便利なGatsbyプラグインがあるので、これを使います。\nJSON Outputをインストールしたら、gatsby-config.jsのpluginsをこんな感じで書き換えます。\n\n// あなたのサイトのURL\nconst siteUrl = `https://example.com`\n\nmodule.exports = {\n siteMetadata: {\n ...\n },\n plugins: [\n {\n resolve: `gatsby-plugin-json-output`,\n options: {\n siteUrl: siteUrl,\n graphQLQuery: `\n {\n allVideo(skip: 24, limit: 240) {\n nodes {\n id\n thumbnail_image {\n childImageSharp {\n fluid {\n aspectRatio\n src\n srcSet\n sizes\n }\n }\n }\n }\n }\n }`,\n serialize: results => results.data.allVideoOrderByReleasedAt.nodes.map(_ => ({\n path: ``, // ファイルを生成する先のパス\n })),\n serializeFeed: results => results.data.allVideo.nodes,\n feedFilename: `all_video`,\n nodesPerFeedFile: 24, // 一回に読み込む数\n }\n },\n ],\n}\n\nこれで、jsonファイルが/all_video-1.json/all_video-2.json...みたいな感じで生成されます。\n\nallVideo(skip: 24, limit: 240)としているのは、最初のプログラムで書いた通り、24個の動画を初期レンダリングさせるつもりなので、最初の24個はjsonデータを生成しなくて良いので、スキップさせています。\n\nnodesPerFeedFileは、jsonファイル一つにつき、いくつの動画データを入れるかという意味です。無限スクロール一回につき、いくつの動画を読み込むかという意味にもなります。\n\nなので、無限スクロールできる回数は、ここのskiplimitと、nodesPerFeedFileの値で決まります。(limit - skip) / nodesPerFeedFile = 無限スクロール可能回数です。余りが出る可能性がある場合は、例外が発生しないように気をつけてください。\n\n注意点1\n\ngatsby-config.jsでは、GraphQLのフラグメントが使えません。...GatsbyImageSharpFluidとかです。\n\nGatsby.jsのGraphQLのフラグメントの中身はgatsby-transformer-sharp/src/fragments.jsに書いてあるので、上記のように中身を直接書きましょう。\n\nbase64というのは、画像が読み込まれるまでに表示されるモヤモヤっとしたモザイク画像みたいなのを表示するためのものですが、jsonファイルのサイズが2倍近くになる可能性があるので、いらないと思います。\n\n注意点2\n\nここで設定したjsonファイル生成は、gatsby developでは機能しません。gatsby buildで生成してください。\n一回gatsby buildで生成してしまえば、gatsby developでフェッチできます。\n\n最初のファイルを書き換える\n\nこんな感じにします。\n\n\nimport React, { useState } from \"react\"\nimport { graphql } from \"gatsby\"\nimport InfiniteScroll from 'react-infinite-scroll-component'\n\nconst IndexPage = ({ data: { allVideo }}) => {\n const [page, setPage] = useState(0)\n const [videos, setVideos] = useState(allVideo.nodes)\n const [hasMore, setHasMore] = useState(true)\n\n const addVideos = (newVideos) => {\n const videosCopy = JSON.parse(JSON.stringify(videos))\n videosCopy.push(...newVideos)\n setVideos(videosCopy)\n }\n\n const fetchVideos = (nextPage) => {\n fetch(`/all_video-${nextPage}.json`)\n .then(response => response.json())\n .then(json => addVideos(json.items))\n .then(() => setPage(nextPage))\n .catch(e => {\n // 取得しようとしたjsonファイルが存在しなかった → もう追加データがない\n setHasMore(true)\n console.log(e)\n })\n }\n\n return (\n
\n fetchVideos(page + 1)}\n hasMore={hasMore}\n >\n {videos.map((video, key) => (\n \n ))}\n \n\n
\n )\n}\n\nexport default IndexPage\n\nexport const query = graphql`\n{\n # limitはgatsby-config.jsに依存\n allVideo(limit: 24) {\n nodes {\n id\n thumbnail_image {\n childImageSharp {\n fluid {\n ...GatsbyImageSharpFluid\n }\n }\n }\n }\n }\n}\n`\n\nスクロールされたら、スクロール回数に応じたjsonファイルをフェッチし、フェッチできなかったら(catchされたら)hasMore=falseにしちゃう感じです。\n\ngraphQLのlimit数がgatsby-config.jsに依存しちゃうので、注意しましょう。(ここのlimit数が10でgatsby-config.jsのskip数が20とかになると、11個目〜20個目が表示されません。)\n\nこれでどれだけ動画数が増えても重くなりませんし、Gatsbyによって生成された画像などを無限スクロールで表示することができます。\n\n6\n5\n0\n\nRegister as a new user and use Qiita more conveniently\n\n 1. You get articles that match your needs\n 2. You can efficiently read back useful information\n 3. You can use dark theme\nWhat you can do with signing up\n6\n5"},"metadata":{"kind":"string","value":"{\n \"url\": \"https://qiita.com/Michinosuke/items/32c3d312d1ef8639c502\",\n \"source_domain\": \"qiita.com\",\n \"snapshot_id\": \"CC-MAIN-2024-22\",\n \"warc_metadata\": {\n \"Content-Length\": \"141480\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:EZTCEI6OE5IT7OTI3ZNJ6SNAEADKIYE5\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2024-05-22T17:37:28Z\",\n \"WARC-IP-Address\": \"52.197.93.140\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:5IRFEJVILSI7ECPUZYOLB7C5D2JJG7G5\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://qiita.com/Michinosuke/items/32c3d312d1ef8639c502\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"isPartOf: CC-MAIN-2024-22\\r\\npublisher: Common Crawl\\r\\ndescription: Wide crawl of the web for May 2024\\r\\noperator: Common Crawl Admin (info@commoncrawl.org)\\r\\nhostname: ip-10-67-67-204\\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/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 12,\n 14,\n 16,\n 17,\n 66,\n 67,\n 92,\n 93,\n 130,\n 131,\n 140,\n 141,\n 173,\n 282,\n 283,\n 294,\n 295,\n 370,\n 371,\n 411,\n 444,\n 505,\n 506,\n 553,\n 614,\n 679,\n 680,\n 693,\n 694,\n 718,\n 758,\n 822,\n 879,\n 889,\n 960,\n 1003,\n 1019,\n 1045,\n 1046,\n 1057,\n 1061,\n 1063,\n 1064,\n 1089,\n 1090,\n 1120,\n 1122,\n 1137,\n 1153,\n 1168,\n 1198,\n 1232,\n 1275,\n 1324,\n 1346,\n 1364,\n 1378,\n 1388,\n 1394,\n 1396,\n 1398,\n 1399,\n 1431,\n 1559,\n 1560,\n 1564,\n 1565,\n 1585,\n 1617,\n 1667,\n 1668,\n 1718,\n 1719,\n 1827,\n 1828,\n 1885,\n 1924,\n 1925,\n 1998,\n 1999,\n 2063,\n 2098,\n 2099,\n 2179,\n 2180,\n 2184,\n 2185,\n 2218,\n 2267,\n 2328,\n 2329,\n 2344,\n 2382,\n 2383,\n 2402,\n 2420,\n 2428,\n 2433,\n 2446,\n 2452,\n 2496,\n 2513,\n 2539,\n 2563,\n 2573,\n 2616,\n 2636,\n 2653,\n 2685,\n 2721,\n 2751,\n 2787,\n 2815,\n 2846,\n 2876,\n 2900,\n 2920,\n 2936,\n 2950,\n 2962,\n 2974,\n 3061,\n 3098,\n 3111,\n 3174,\n 3209,\n 3251,\n 3259,\n 3266,\n 3271,\n 3273,\n 3274,\n 3339,\n 3340,\n 3456,\n 3457,\n 3549,\n 3550,\n 3694,\n 3695,\n 3700,\n 3701,\n 3771,\n 3772,\n 3869,\n 3870,\n 3972,\n 3973,\n 3978,\n 3979,\n 4044,\n 4093,\n 4094,\n 4108,\n 4109,\n 4120,\n 4121,\n 4122,\n 4162,\n 4195,\n 4256,\n 4257,\n 4304,\n 4344,\n 4401,\n 4450,\n 4451,\n 4490,\n 4552,\n 4590,\n 4620,\n 4626,\n 4627,\n 4667,\n 4712,\n 4759,\n 4808,\n 4851,\n 4877,\n 4934,\n 4967,\n 4998,\n 5013,\n 5019,\n 5020,\n 5033,\n 5062,\n 5086,\n 5125,\n 5172,\n 5202,\n 5212,\n 5254,\n 5297,\n 5313,\n 5339,\n 5340,\n 5351,\n 5355,\n 5357,\n 5358,\n 5383,\n 5384,\n 5414,\n 5416,\n 5448,\n 5474,\n 5490,\n 5505,\n 5535,\n 5569,\n 5597,\n 5646,\n 5668,\n 5686,\n 5700,\n 5710,\n 5716,\n 5718,\n 5720,\n 5721,\n 5803,\n 5804,\n 5919,\n 5920,\n 5985,\n 5986,\n 5988,\n 5990,\n 5992,\n 5993,\n 6048,\n 6049,\n 6093,\n 6147,\n 6175,\n 6207,\n 6209\n ],\n \"line_end_idx\": [\n 12,\n 14,\n 16,\n 17,\n 66,\n 67,\n 92,\n 93,\n 130,\n 131,\n 140,\n 141,\n 173,\n 282,\n 283,\n 294,\n 295,\n 370,\n 371,\n 411,\n 444,\n 505,\n 506,\n 553,\n 614,\n 679,\n 680,\n 693,\n 694,\n 718,\n 758,\n 822,\n 879,\n 889,\n 960,\n 1003,\n 1019,\n 1045,\n 1046,\n 1057,\n 1061,\n 1063,\n 1064,\n 1089,\n 1090,\n 1120,\n 1122,\n 1137,\n 1153,\n 1168,\n 1198,\n 1232,\n 1275,\n 1324,\n 1346,\n 1364,\n 1378,\n 1388,\n 1394,\n 1396,\n 1398,\n 1399,\n 1431,\n 1559,\n 1560,\n 1564,\n 1565,\n 1585,\n 1617,\n 1667,\n 1668,\n 1718,\n 1719,\n 1827,\n 1828,\n 1885,\n 1924,\n 1925,\n 1998,\n 1999,\n 2063,\n 2098,\n 2099,\n 2179,\n 2180,\n 2184,\n 2185,\n 2218,\n 2267,\n 2328,\n 2329,\n 2344,\n 2382,\n 2383,\n 2402,\n 2420,\n 2428,\n 2433,\n 2446,\n 2452,\n 2496,\n 2513,\n 2539,\n 2563,\n 2573,\n 2616,\n 2636,\n 2653,\n 2685,\n 2721,\n 2751,\n 2787,\n 2815,\n 2846,\n 2876,\n 2900,\n 2920,\n 2936,\n 2950,\n 2962,\n 2974,\n 3061,\n 3098,\n 3111,\n 3174,\n 3209,\n 3251,\n 3259,\n 3266,\n 3271,\n 3273,\n 3274,\n 3339,\n 3340,\n 3456,\n 3457,\n 3549,\n 3550,\n 3694,\n 3695,\n 3700,\n 3701,\n 3771,\n 3772,\n 3869,\n 3870,\n 3972,\n 3973,\n 3978,\n 3979,\n 4044,\n 4093,\n 4094,\n 4108,\n 4109,\n 4120,\n 4121,\n 4122,\n 4162,\n 4195,\n 4256,\n 4257,\n 4304,\n 4344,\n 4401,\n 4450,\n 4451,\n 4490,\n 4552,\n 4590,\n 4620,\n 4626,\n 4627,\n 4667,\n 4712,\n 4759,\n 4808,\n 4851,\n 4877,\n 4934,\n 4967,\n 4998,\n 5013,\n 5019,\n 5020,\n 5033,\n 5062,\n 5086,\n 5125,\n 5172,\n 5202,\n 5212,\n 5254,\n 5297,\n 5313,\n 5339,\n 5340,\n 5351,\n 5355,\n 5357,\n 5358,\n 5383,\n 5384,\n 5414,\n 5416,\n 5448,\n 5474,\n 5490,\n 5505,\n 5535,\n 5569,\n 5597,\n 5646,\n 5668,\n 5686,\n 5700,\n 5710,\n 5716,\n 5718,\n 5720,\n 5721,\n 5803,\n 5804,\n 5919,\n 5920,\n 5985,\n 5986,\n 5988,\n 5990,\n 5992,\n 5993,\n 6048,\n 6049,\n 6093,\n 6147,\n 6175,\n 6207,\n 6209,\n 6210\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 6210,\n \"ccnet_original_nlines\": 238,\n \"rps_doc_curly_bracket\": 0.015136879868805408,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.043756671249866486,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.010672359727323055,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0.004184099845588207,\n \"rps_doc_frac_no_alph_words\": 0.5923159122467041,\n \"rps_doc_frac_unique_words\": 0.6825938820838928,\n \"rps_doc_mean_word_length\": 14.686006546020508,\n \"rps_doc_num_sentences\": 55,\n \"rps_doc_symbol_to_word_ratio\": 0.007470650132745504,\n \"rps_doc_unigram_entropy\": 5.091024398803711,\n \"rps_doc_word_count\": 293,\n \"rps_doc_frac_chars_dupe_10grams\": 0.101324662566185,\n \"rps_doc_frac_chars_dupe_5grams\": 0.12038113176822662,\n \"rps_doc_frac_chars_dupe_6grams\": 0.101324662566185,\n \"rps_doc_frac_chars_dupe_7grams\": 0.101324662566185,\n \"rps_doc_frac_chars_dupe_8grams\": 0.101324662566185,\n \"rps_doc_frac_chars_dupe_9grams\": 0.101324662566185,\n \"rps_doc_frac_chars_top_2gram\": 0.0013943800004199147,\n \"rps_doc_frac_chars_top_3gram\": 0.014640949666500092,\n \"rps_doc_frac_chars_top_4gram\": 0.0250987708568573,\n \"rps_doc_books_importance\": -380.9415283203125,\n \"rps_doc_books_importance_length_correction\": -380.9415283203125,\n \"rps_doc_openwebtext_importance\": -152.0912322998047,\n \"rps_doc_openwebtext_importance_length_correction\": -152.0912322998047,\n \"rps_doc_wikipedia_importance\": -121.79702758789062,\n \"rps_doc_wikipedia_importance_length_correction\": -121.79702758789062\n },\n \"fasttext\": {\n \"dclm\": 0.9994231462478638,\n \"english\": 0.00504348985850811,\n \"fineweb_edu_approx\": 2.585818290710449,\n \"eai_general_math\": 0.7090398669242859,\n \"eai_open_web_math\": 0.028038619086146355,\n \"eai_web_code\": 0.5431715250015259\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.1\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"004.0285\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Code/Software\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n },\n \"secondary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"23\",\n \"label\": \"Tutorial\"\n },\n \"secondary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192853,"cells":{"id":{"kind":"number","value":-8892489331403975000,"string":"-8,892,489,331,403,975,000"},"text":{"kind":"string","value":"0\n\nI am trying to insert a set of attribute rows into a table based on the range of a unique key (product_id) and three passed variables. This is on a MySQL database. The three variables are the start_product_id, the end_product_id and the batch_attr_id.\n\nThe stored procedure does not return an error, but it does not product any inserts.\n\ncode start here ---------------\n\ninsert into `product_attribute` (`product_id`, `attribute_id`, `language_id`, `text`)\n(\nSELECT a.`product_id` \n ,b.`attr_id`\n ,b.`lang_id`\n ,b.`attr_value`\n\nFROM `product` a \n ,`batch_attr_detail` b\n ,`batch_attr_set` c\n\nWHERE c.`batch_attr_id` = @`batch_attr_id`\n and c.`batch_attr_id` = b.`batch_attr_id`\n and a.`product_id` between @`start_product_id` and @`end_product_id`\n\n );\n --------------end of code \n\n\n------------------------\nI am calling the stored procude with this syntax - \n\n\n\n call batch_update_proc(575,576,112);\n\n\n\nThere are records with both 575 and 576 as product IDs and the batch set 112 exists. If I take the select out of the procedure and substitute scalars, it works fine. Just no insert.\n\nCan any one please tell me what stupid error I am making? I have spent hours on this!\n\nThx - Kat\n3\nContributors\n12\nReplies\n56\nViews\n2 Years\nDiscussion Span\nLast Post by ryantroop\n0\n\nIt would really help to see the whole declaration, so we can see the incoming variables.\n\nAt first glance, it looks like you're doing something funny with your vars by using quotes...\n\n@'foo' should be @foo, And in MySQL, I have found more success just avoiding user declared variables and just using the VARs passed in.\n\nOf course, your mileage may vary...\n\n0\n\nYes, I agree on the declaration. I did not have those in the original, but someone suggested that I explicitly declare the variables. Also on the blasted quotes - I am not sure how or why, but my installation requires the different kind of quotes. If you know how to turn them off, I would be eternally grateful. They are a total PAIN.\n\nHere is an image of the stored procedure as it sit. Notice that I do not have the explicit declaration in this one.\nClick Here\n\nThanks - Kat\n\n0\n\nmay sound silly, but can you try without the () surrounding your select?\n\ninsert into `product_attribute` (`product_id`, `attribute_id`, `language_id`, `text`)\nSELECT a.`product_id` \n ,b.`attr_id`\n ,b.`lang_id`\n ,b.`attr_value`\n\nFROM `product` a \n ,`batch_attr_detail` b\n ,`batch_attr_set` c\n\nWHERE c.`batch_attr_id` = @`batch_attr_id`\n and c.`batch_attr_id` = b.`batch_attr_id`\n and a.`product_id` between @`start_product_id` and @`end_product_id`\n\nOther than that, I am not familliar with the program you are using to manage your SQL, and with that I am not familliar with some of your syntax -- that doesn't mean it's wrong, though.\n\nyou may also want to comment out the insert, and just see if your select is in fact returning any data. If not, you may have to modify your select syntax. I don't often (in fact, never) do macros like you are, where I have a.'foo' instead it's a.foo. Again, however, that may be due to the SQL manager you are using, and less a syntax issue.\n\nEdited by ryantroop\n\n0\n\nThe tool I am using is phpadmin and this is the way it shows stored procedures. I still create them using the DDL, but when I try to edit them, this seems to be the only way to get to them.\n\nSorry, I thought I mentioned before that the select works fine. Very annoying, let me tell you! I will try the parens, and see if that helps.\n\nThx - Kat\n\n0\n\nRemoval of parentheses caused to change in behavior. Select still works.\n\n0\n\nI don't use phpmyadmin, So maybe someone who does may be able to help with debugging... The query looks fine, so all I can go on is assuming that it compiled without error, that your data types match, And that your query does actually return data when run inside the stored procedure. All this things true, the only other things I can think of is that your user does not have insert rights, that you must explicitly commit the insert, or some other quirk with how you are set up.\n\nSorry, but I think I can't help without actually connecting to the database with something like MySQL workbench and trying to run the stuff manually\n\nEdited by ryantroop\n\n0\n\nStored procedures will give you a small performance boost, but mostly they are for doing tasks that are difficult or impossible to do with a simple query. Stored procedures are great for simplifying access to data for many different types of clients. Database administrators love them because they control how the database is used as opposed to leaving those details to the developer.\n\nLook to indexes and proper table design to get better performance.\n\nEdited by joshuajames.delacruz\n\n0\n\nI agree overall on the justification for stored procedures, but that was not really my question. I'm creating a set of stored procedures to simplify an extremely complex set of steps in a critical process. In order to mitigate the risk on programming errors, I am trying to build my components of the process one-by-one. Obviously, I am missing some required components , but I am now close, thanks to the input from others on this list. I will post the completed solution when done. I can write stored procs in four other DBMS environments without a problem, but this situation had me floored! However, I am testing a fix now and will let people know how it goes.\n\n0\nDELIMITER $$\n\nUSE `techrentals`$$\n\nDROP PROCEDURE IF EXISTS `getInvoiceList`$$\n\nCREATE DEFINER=`root`@`%` PROCEDURE `PList`(IN prod_id INT)\n\nBEGIN\n insert into `product_attribute` (`product_id`, `attribute_id`, `language_id`, `text`)\n SELECT \n a.`product_id` \n ,b.`attr_id`\n ,b.`lang_id`\n ,b.`attr_value`\n\n FROM \n `product` a \n ,`batch_attr_detail` b\n ,`batch_attr_set` c\n\n WHERE c.`batch_attr_id` = @`batch_attr_id`\n and c.`batch_attr_id` = b.`batch_attr_id`\n and a.`product_id` between @`start_product_id` and @`end_product_id`\nEND$$\n\nDELIMITER ;\n0\n\nI will have to try that one also. I changed the NO SQL to CONTAINS SQL and also changed the coding convention on the variables. This now works properly. Minor changes, but I really appreciate the help that you guys gave me. I followed that same convention for the next 4 stored procs and they are all working flawlessly.\n\nJust in case someone else has my same weird setup - here is the code:\n\ninsert into `product_attribute` (`product_id`, `attribute_id`, `language_id`, `text`)\n\nSELECT a.`product_id` \n ,b.`attr_id`\n ,b.`lang_id`\n ,b.`attr_value`\n\nFROM `product` a \n ,`batch_attr_detail` b\n ,`batch_attr_set` c\n\nWHERE c.`batch_attr_id` = @p2\n and c.`batch_attr_id` = b.`batch_attr_id`\n and a.`product_id` between @p0 and @p1\n\nthanks again for the help!\n\nKat\n\n0\n\nOops - there are three invariables. The proc would not work until I changed them to @p0, @p1 and @p2.\n\nKat\n\nThis question has already been answered. Start a new discussion instead.\nHave something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules."},"metadata":{"kind":"string","value":"{\n \"url\": \"https://www.daniweb.com/programming/databases/threads/495405/stored-procedure-problem\",\n \"source_domain\": \"www.daniweb.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2018-13\",\n \"warc_metadata\": {\n \"Content-Length\": \"68141\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:2PJGWEO4X6NRAQ2BPUG3LGMME42RIRXB\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2018-03-22T21:17:33Z\",\n \"WARC-IP-Address\": \"198.23.117.137\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:UPA7U6UTRBM4JXPLRNHCJXNZJF2BZSKU\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://www.daniweb.com/programming/databases/threads/495405/stored-procedure-problem\",\n \"WARC-Truncated\": \"length\",\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"robots: classic\\r\\nhostname: ip-10-239-104-149.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\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 2,\n 3,\n 255,\n 256,\n 340,\n 341,\n 373,\n 374,\n 460,\n 462,\n 485,\n 506,\n 527,\n 551,\n 552,\n 574,\n 605,\n 633,\n 634,\n 677,\n 721,\n 792,\n 793,\n 800,\n 830,\n 831,\n 832,\n 857,\n 909,\n 910,\n 911,\n 912,\n 950,\n 951,\n 952,\n 953,\n 1135,\n 1136,\n 1222,\n 1223,\n 1233,\n 1235,\n 1248,\n 1251,\n 1259,\n 1262,\n 1268,\n 1276,\n 1292,\n 1315,\n 1317,\n 1318,\n 1407,\n 1408,\n 1502,\n 1503,\n 1639,\n 1640,\n 1676,\n 1677,\n 1679,\n 1680,\n 2016,\n 2017,\n 2133,\n 2144,\n 2145,\n 2158,\n 2159,\n 2161,\n 2162,\n 2235,\n 2236,\n 2322,\n 2345,\n 2366,\n 2387,\n 2411,\n 2412,\n 2434,\n 2465,\n 2493,\n 2494,\n 2537,\n 2581,\n 2652,\n 2653,\n 2839,\n 2840,\n 3182,\n 3183,\n 3203,\n 3204,\n 3206,\n 3207,\n 3397,\n 3398,\n 3540,\n 3541,\n 3551,\n 3552,\n 3554,\n 3555,\n 3628,\n 3629,\n 3631,\n 3632,\n 4112,\n 4113,\n 4262,\n 4263,\n 4283,\n 4284,\n 4286,\n 4287,\n 4672,\n 4673,\n 4740,\n 4741,\n 4772,\n 4773,\n 4775,\n 4776,\n 5441,\n 5442,\n 5444,\n 5457,\n 5458,\n 5478,\n 5479,\n 5523,\n 5524,\n 5584,\n 5585,\n 5591,\n 5680,\n 5692,\n 5717,\n 5742,\n 5767,\n 5795,\n 5796,\n 5810,\n 5831,\n 5866,\n 5898,\n 5899,\n 5946,\n 5992,\n 6065,\n 6071,\n 6072,\n 6084,\n 6086,\n 6087,\n 6408,\n 6409,\n 6479,\n 6480,\n 6566,\n 6567,\n 6590,\n 6611,\n 6632,\n 6656,\n 6657,\n 6679,\n 6710,\n 6738,\n 6739,\n 6769,\n 6813,\n 6854,\n 6855,\n 6882,\n 6883,\n 6887,\n 6888,\n 6890,\n 6891,\n 6993,\n 6994,\n 6998,\n 6999,\n 7072\n ],\n \"line_end_idx\": [\n 2,\n 3,\n 255,\n 256,\n 340,\n 341,\n 373,\n 374,\n 460,\n 462,\n 485,\n 506,\n 527,\n 551,\n 552,\n 574,\n 605,\n 633,\n 634,\n 677,\n 721,\n 792,\n 793,\n 800,\n 830,\n 831,\n 832,\n 857,\n 909,\n 910,\n 911,\n 912,\n 950,\n 951,\n 952,\n 953,\n 1135,\n 1136,\n 1222,\n 1223,\n 1233,\n 1235,\n 1248,\n 1251,\n 1259,\n 1262,\n 1268,\n 1276,\n 1292,\n 1315,\n 1317,\n 1318,\n 1407,\n 1408,\n 1502,\n 1503,\n 1639,\n 1640,\n 1676,\n 1677,\n 1679,\n 1680,\n 2016,\n 2017,\n 2133,\n 2144,\n 2145,\n 2158,\n 2159,\n 2161,\n 2162,\n 2235,\n 2236,\n 2322,\n 2345,\n 2366,\n 2387,\n 2411,\n 2412,\n 2434,\n 2465,\n 2493,\n 2494,\n 2537,\n 2581,\n 2652,\n 2653,\n 2839,\n 2840,\n 3182,\n 3183,\n 3203,\n 3204,\n 3206,\n 3207,\n 3397,\n 3398,\n 3540,\n 3541,\n 3551,\n 3552,\n 3554,\n 3555,\n 3628,\n 3629,\n 3631,\n 3632,\n 4112,\n 4113,\n 4262,\n 4263,\n 4283,\n 4284,\n 4286,\n 4287,\n 4672,\n 4673,\n 4740,\n 4741,\n 4772,\n 4773,\n 4775,\n 4776,\n 5441,\n 5442,\n 5444,\n 5457,\n 5458,\n 5478,\n 5479,\n 5523,\n 5524,\n 5584,\n 5585,\n 5591,\n 5680,\n 5692,\n 5717,\n 5742,\n 5767,\n 5795,\n 5796,\n 5810,\n 5831,\n 5866,\n 5898,\n 5899,\n 5946,\n 5992,\n 6065,\n 6071,\n 6072,\n 6084,\n 6086,\n 6087,\n 6408,\n 6409,\n 6479,\n 6480,\n 6566,\n 6567,\n 6590,\n 6611,\n 6632,\n 6656,\n 6657,\n 6679,\n 6710,\n 6738,\n 6739,\n 6769,\n 6813,\n 6854,\n 6855,\n 6882,\n 6883,\n 6887,\n 6888,\n 6890,\n 6891,\n 6993,\n 6994,\n 6998,\n 6999,\n 7072,\n 7210\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 7210,\n \"ccnet_original_nlines\": 185,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.4055706560611725,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.05095108970999718,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0.010752690024673939,\n \"rps_doc_frac_no_alph_words\": 0.24048912525177002,\n \"rps_doc_frac_unique_words\": 0.3748854398727417,\n \"rps_doc_mean_word_length\": 4.748854160308838,\n \"rps_doc_num_sentences\": 94,\n \"rps_doc_symbol_to_word_ratio\": 0.002038039965555072,\n \"rps_doc_unigram_entropy\": 5.419632434844971,\n \"rps_doc_word_count\": 1091,\n \"rps_doc_frac_chars_dupe_10grams\": 0.17351862788200378,\n \"rps_doc_frac_chars_dupe_5grams\": 0.19146883487701416,\n \"rps_doc_frac_chars_dupe_6grams\": 0.19146883487701416,\n \"rps_doc_frac_chars_dupe_7grams\": 0.17351862788200378,\n \"rps_doc_frac_chars_dupe_8grams\": 0.17351862788200378,\n \"rps_doc_frac_chars_dupe_9grams\": 0.17351862788200378,\n \"rps_doc_frac_chars_top_2gram\": 0.006369430106133223,\n \"rps_doc_frac_chars_top_3gram\": 0.020073339343070984,\n \"rps_doc_frac_chars_top_4gram\": 0.02702181041240692,\n \"rps_doc_books_importance\": -640.7791137695312,\n \"rps_doc_books_importance_length_correction\": -640.7791137695312,\n \"rps_doc_openwebtext_importance\": -401.96002197265625,\n \"rps_doc_openwebtext_importance_length_correction\": -401.96002197265625,\n \"rps_doc_wikipedia_importance\": -294.0274353027344,\n \"rps_doc_wikipedia_importance_length_correction\": -294.0274353027344\n },\n \"fasttext\": {\n \"dclm\": 0.10881782323122025,\n \"english\": 0.9064891338348389,\n \"fineweb_edu_approx\": 1.700223445892334,\n \"eai_general_math\": 0.8570021986961365,\n \"eai_open_web_math\": 0.3990740180015564,\n \"eai_web_code\": 0.7333714962005615\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.44\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"005.1\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Analyze\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Social/Forum\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Code/Software\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Click Here References\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"18\",\n \"label\": \"Q&A Forum\"\n },\n \"secondary\": {\n \"code\": \"8\",\n \"label\": \"Documentation\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Partially Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192854,"cells":{"id":{"kind":"number","value":3988917237032589000,"string":"3,988,917,237,032,589,000"},"text":{"kind":"string","value":"cancel\nShowing results for \nSearch instead for \nDid you mean: \n\nPlusnet SIM in Router\n\naesmith\nAspiring Pro\nPosts: 570\nThanks: 59\nFixes: 4\nRegistered: ‎26-09-2015\n\nPlusnet SIM in Router\n\nHi,\n\nIs there any reason why a Plusnet SIM wouldn't work in a DSL router or Dongle?  Or any prohibition from Plusnet for that matter.\n\nThanks, Tony S\n\n13 REPLIES 13\nRandallFlagg\nPlusnet Alumni (retired)\nPlusnet Alumni (retired)\nPosts: 1,915\nFixes: 75\nRegistered: ‎11-01-2018\n\nRe: Plusnet SIM in Router\n\n \n\nHi Tony,\n\n \n\nThanks for getting in touch.\n\n \n\nI'm afraid our SIM's don't support the functionality required to operate within a dongle or ADSL router environment - they're designed to be used purely in mobile handsets at present. \n\n \n\nBest wishes\n\n \n\nDave\n\nDS\nChampion\nPosts: 2,187\nThanks: 457\nFixes: 22\nRegistered: ‎06-01-2017\n\nRe: Plusnet SIM in Router\n\nCan't really give too much away here.... But not supporting and actually working are two different things.\n\nA friend whom purchased a PN PAYG sim currently has one installed in a home alarm system Roll_eyes\n\n(he was telling the providers why he wanted one (for his alarm) and all said nope, we don't do that. I told him not to mention why he wanted it and he gave it try) Wink\n\nIt sends via data an arm/disarm message plus both data and text messages whenever it goes off. It's been running for at least 2 months without issue so far. As far as the sim goes, it thinks it's in a phone (uses the PN phone number to send alerts). Being as you want it for a router or dongle, I'm not sure if it'll work for you.\n\nNow I'm not saying you'll have the same luck, but if you have a PN sim card already then you could try it...?\n\n(but don't buy one based on what I've said, as you may not be so lucky)\n\naesmith\nAspiring Pro\nPosts: 570\nThanks: 59\nFixes: 4\nRegistered: ‎26-09-2015\n\nRe: Plusnet SIM in Router\n\nThanks.  I do have a Plusnet SIM at the moment, only with a small data allowance but it would be enough to test. I can but try. \n\nDS\nChampion\nPosts: 2,187\nThanks: 457\nFixes: 22\nRegistered: ‎06-01-2017\n\nRe: Plusnet SIM in Router\n\nSounds like a good plan imho Wink\n\nIf it doesn't work, it's only cost you a bit of wasted time.\n\naesmith\nAspiring Pro\nPosts: 570\nThanks: 59\nFixes: 4\nRegistered: ‎26-09-2015\n\nRe: Plusnet SIM in Router\n\nUnfortunately Plusnet appear to be correct in this instance.  My SIM does not work in the Huawei E3372 dongle that I was testing with.  I'm going to try it in a native 4G router just to see, but I expect that won't work either.   Shame because Plusnet would make quite a good option for 4G backup with a low monthly charge, then just pay for usage when the backup is actually needed.  \n\nDS\nChampion\nPosts: 2,187\nThanks: 457\nFixes: 22\nRegistered: ‎06-01-2017\n\nRe: Plusnet SIM in Router\n\nDoh! so tick that one off as a no then Sad\n\nI still think it was worth wasting time though Wink\n\nHopefully plan b/c/d/e/f might give a better result....? Lips_are_sealed\n\n \n\nMisterW\nSuperuser\nSuperuser\nPosts: 11,663\nThanks: 3,729\nFixes: 283\nRegistered: ‎30-07-2007\n\nRe: Plusnet SIM in Router\n\n@aesmith  did you try manually creating the APN ? Maybe the SIM defaults didn't get assigned correctly\n\nSuperusers are not staff, but they do have a direct line of communication into the business in order to raise issues, concerns and feedback from the community.\n\naesmith\nAspiring Pro\nPosts: 570\nThanks: 59\nFixes: 4\nRegistered: ‎26-09-2015\n\nRe: Plusnet SIM in Router\n\nCheers.  APN settings appeared to populate automatically, but I also tried manually.  FYI the dongle is normally used with an EE data SIM (same APN settings as Plusnet) but it also works with Three just be swapping the SIM.   Will try with a router just for the hell of it but I expect that not to work either.\n\naesmith\nAspiring Pro\nPosts: 570\nThanks: 59\nFixes: 4\nRegistered: ‎26-09-2015\n\nRe: Plusnet SIM in Router\n\nIt works in a Huawei B525 router, and delivers decent speed as well.  I know that will depend on location but it indicates that Plusnet's implementation of EEs network is not overly crippled.  Interestingly it used Band 3 (1800MHz) where the same router in the same location used Band 20 (800MHz) on both O2 and Three.   I'm not sure if that is or isn't significant given that O2 on Band 20 was 50% faster than Plusnet/EE, but Three also on Band 20 was half the speed.  \n\nDS\nChampion\nPosts: 2,187\nThanks: 457\nFixes: 22\nRegistered: ‎06-01-2017\n\nRe: Plusnet SIM in Router\n\nGlad to hear you found something it works in.\n\n(though maybe PN do have future plans, they did say 'at present').\n\nA possible Plusnet Hub 2/Smart Hub with Plusnet Mobile data back up...?\n\naesmith\nAspiring Pro\nPosts: 570\nThanks: 59\nFixes: 4\nRegistered: ‎26-09-2015\n\nRe: Plusnet SIM in Router\n\nMobile data as backup would be a great service for many people.  Nowadays even entry level routers support this using a USB dongle.  One obstacle is a shortage of sensible tariffs suitable for backup, ideally you either want non-expiring PAYG or a low monthly fee for a small data allowance but with reasonable rates for out of plan usage.\n\nIronically we're considering 4G as our main Internet, possibly with DSL as backup.\n\nDS\nChampion\nPosts: 2,187\nThanks: 457\nFixes: 22\nRegistered: ‎06-01-2017\n\nRe: Plusnet SIM in Router\n\nI believe such a thing exists with some variants of the BTH6 - it has a data (back up) facility, though I've only seen them listed with this on an auction site....?\n\nNot one to blow my own trumpet, but I may or may not have told BT management of an idea of mine back in 2008/9 - a method to get their customers back online using a Sim Data 'box', roll on 10 years and they did just that. Still not heard about any royalties I'm due!! (Same for wifi in every room, still waiting for that too).\n\nLet's say PN come up with a router with a mobile data system hard wired into the router, which reverts to data in the event of loss of BB. It should, imho, come as part of the package and thus at no extra cost to us. Let's see if this ever happens and whether I get any thanks for that idea too..?\n\nWe too have been exploring Data as our primary method, which is something I may need to consider in the future Wink\n\n \n\naesmith\nAspiring Pro\nPosts: 570\nThanks: 59\nFixes: 4\nRegistered: ‎26-09-2015\n\nRe: Plusnet SIM in Router\n\nTechnically there's no problem, for example both my Billion and Zyxel routers support 4G backup via a USB dongle so it wouldn't surprise me if the BT Homehub could as well.  It's the tariff where providers need to get clever for it to make sense.  I believe that BT have a scheme where if you have a broadband fault they lift the data cap on any mobiles on the same account.  I guess that Plusnet could do the same if they choose.  Even better would be a tariff where out of bundle usage charges weren't punitive so that customers could switch the 4G say if their broadband was a bit flakey but not actually broken,"},"metadata":{"kind":"string","value":"{\n \"url\": \"https://community.plus.net/t5/Mobile/Plusnet-SIM-in-Router/td-p/1621078\",\n \"source_domain\": \"community.plus.net\",\n \"snapshot_id\": \"CC-MAIN-2023-06\",\n \"warc_metadata\": {\n \"Content-Length\": \"410117\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:6XMVCK4NUN56Y7JAKOSCFN7T7YAXZUYL\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2023-01-27T21:41:45Z\",\n \"WARC-IP-Address\": \"18.67.65.92\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:F7MHU6VHCBA36AA53KDCIUPRTSY3FWJA\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://community.plus.net/t5/Mobile/Plusnet-SIM-in-Router/td-p/1621078\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"isPartOf: CC-MAIN-2023-06\\r\\npublisher: Common Crawl\\r\\ndescription: Wide crawl of the web for January/February 2023\\r\\noperator: Common Crawl Admin (info@commoncrawl.org)\\r\\nhostname: ip-10-67-67-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/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 7,\n 28,\n 48,\n 63,\n 64,\n 86,\n 87,\n 95,\n 108,\n 119,\n 130,\n 139,\n 163,\n 164,\n 186,\n 187,\n 191,\n 192,\n 321,\n 322,\n 337,\n 338,\n 352,\n 365,\n 390,\n 415,\n 428,\n 438,\n 462,\n 463,\n 489,\n 490,\n 492,\n 493,\n 502,\n 503,\n 505,\n 506,\n 535,\n 536,\n 538,\n 539,\n 724,\n 725,\n 727,\n 728,\n 740,\n 741,\n 743,\n 744,\n 749,\n 750,\n 753,\n 762,\n 775,\n 787,\n 797,\n 821,\n 822,\n 848,\n 849,\n 956,\n 957,\n 1056,\n 1057,\n 1226,\n 1227,\n 1558,\n 1559,\n 1669,\n 1670,\n 1742,\n 1743,\n 1751,\n 1764,\n 1775,\n 1786,\n 1795,\n 1819,\n 1820,\n 1846,\n 1847,\n 1976,\n 1977,\n 1980,\n 1989,\n 2002,\n 2014,\n 2024,\n 2048,\n 2049,\n 2075,\n 2076,\n 2110,\n 2111,\n 2172,\n 2173,\n 2181,\n 2194,\n 2205,\n 2216,\n 2225,\n 2249,\n 2250,\n 2276,\n 2277,\n 2663,\n 2664,\n 2667,\n 2676,\n 2689,\n 2701,\n 2711,\n 2735,\n 2736,\n 2762,\n 2763,\n 2806,\n 2807,\n 2859,\n 2860,\n 2933,\n 2934,\n 2936,\n 2937,\n 2945,\n 2955,\n 2965,\n 2979,\n 2993,\n 3004,\n 3028,\n 3029,\n 3055,\n 3056,\n 3159,\n 3160,\n 3320,\n 3321,\n 3329,\n 3342,\n 3353,\n 3364,\n 3373,\n 3397,\n 3398,\n 3424,\n 3425,\n 3736,\n 3737,\n 3745,\n 3758,\n 3769,\n 3780,\n 3789,\n 3813,\n 3814,\n 3840,\n 3841,\n 4312,\n 4313,\n 4316,\n 4325,\n 4338,\n 4350,\n 4360,\n 4384,\n 4385,\n 4411,\n 4412,\n 4458,\n 4459,\n 4526,\n 4527,\n 4599,\n 4600,\n 4608,\n 4621,\n 4632,\n 4643,\n 4652,\n 4676,\n 4677,\n 4703,\n 4704,\n 5044,\n 5045,\n 5128,\n 5129,\n 5132,\n 5141,\n 5154,\n 5166,\n 5176,\n 5200,\n 5201,\n 5227,\n 5228,\n 5393,\n 5394,\n 5721,\n 5722,\n 6020,\n 6021,\n 6137,\n 6138,\n 6140,\n 6141,\n 6149,\n 6162,\n 6173,\n 6184,\n 6193,\n 6217,\n 6218,\n 6244,\n 6245\n ],\n \"line_end_idx\": [\n 7,\n 28,\n 48,\n 63,\n 64,\n 86,\n 87,\n 95,\n 108,\n 119,\n 130,\n 139,\n 163,\n 164,\n 186,\n 187,\n 191,\n 192,\n 321,\n 322,\n 337,\n 338,\n 352,\n 365,\n 390,\n 415,\n 428,\n 438,\n 462,\n 463,\n 489,\n 490,\n 492,\n 493,\n 502,\n 503,\n 505,\n 506,\n 535,\n 536,\n 538,\n 539,\n 724,\n 725,\n 727,\n 728,\n 740,\n 741,\n 743,\n 744,\n 749,\n 750,\n 753,\n 762,\n 775,\n 787,\n 797,\n 821,\n 822,\n 848,\n 849,\n 956,\n 957,\n 1056,\n 1057,\n 1226,\n 1227,\n 1558,\n 1559,\n 1669,\n 1670,\n 1742,\n 1743,\n 1751,\n 1764,\n 1775,\n 1786,\n 1795,\n 1819,\n 1820,\n 1846,\n 1847,\n 1976,\n 1977,\n 1980,\n 1989,\n 2002,\n 2014,\n 2024,\n 2048,\n 2049,\n 2075,\n 2076,\n 2110,\n 2111,\n 2172,\n 2173,\n 2181,\n 2194,\n 2205,\n 2216,\n 2225,\n 2249,\n 2250,\n 2276,\n 2277,\n 2663,\n 2664,\n 2667,\n 2676,\n 2689,\n 2701,\n 2711,\n 2735,\n 2736,\n 2762,\n 2763,\n 2806,\n 2807,\n 2859,\n 2860,\n 2933,\n 2934,\n 2936,\n 2937,\n 2945,\n 2955,\n 2965,\n 2979,\n 2993,\n 3004,\n 3028,\n 3029,\n 3055,\n 3056,\n 3159,\n 3160,\n 3320,\n 3321,\n 3329,\n 3342,\n 3353,\n 3364,\n 3373,\n 3397,\n 3398,\n 3424,\n 3425,\n 3736,\n 3737,\n 3745,\n 3758,\n 3769,\n 3780,\n 3789,\n 3813,\n 3814,\n 3840,\n 3841,\n 4312,\n 4313,\n 4316,\n 4325,\n 4338,\n 4350,\n 4360,\n 4384,\n 4385,\n 4411,\n 4412,\n 4458,\n 4459,\n 4526,\n 4527,\n 4599,\n 4600,\n 4608,\n 4621,\n 4632,\n 4643,\n 4652,\n 4676,\n 4677,\n 4703,\n 4704,\n 5044,\n 5045,\n 5128,\n 5129,\n 5132,\n 5141,\n 5154,\n 5166,\n 5176,\n 5200,\n 5201,\n 5227,\n 5228,\n 5393,\n 5394,\n 5721,\n 5722,\n 6020,\n 6021,\n 6137,\n 6138,\n 6140,\n 6141,\n 6149,\n 6162,\n 6173,\n 6184,\n 6193,\n 6217,\n 6218,\n 6244,\n 6245,\n 6860\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 6860,\n \"ccnet_original_nlines\": 217,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.3774791955947876,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.05502238869667053,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.2373640388250351,\n \"rps_doc_frac_unique_words\": 0.3727422058582306,\n \"rps_doc_mean_word_length\": 4.303776741027832,\n \"rps_doc_num_sentences\": 51,\n \"rps_doc_symbol_to_word_ratio\": 0.003198979888111353,\n \"rps_doc_unigram_entropy\": 5.485989093780518,\n \"rps_doc_word_count\": 1218,\n \"rps_doc_frac_chars_dupe_10grams\": 0.172262504696846,\n \"rps_doc_frac_chars_dupe_5grams\": 0.19725295901298523,\n \"rps_doc_frac_chars_dupe_6grams\": 0.172262504696846,\n \"rps_doc_frac_chars_dupe_7grams\": 0.172262504696846,\n \"rps_doc_frac_chars_dupe_8grams\": 0.172262504696846,\n \"rps_doc_frac_chars_dupe_9grams\": 0.172262504696846,\n \"rps_doc_frac_chars_top_2gram\": 0.03243036940693855,\n \"rps_doc_frac_chars_top_3gram\": 0.03433803841471672,\n \"rps_doc_frac_chars_top_4gram\": 0.05150705948472023,\n \"rps_doc_books_importance\": -558.1393432617188,\n \"rps_doc_books_importance_length_correction\": -558.1393432617188,\n \"rps_doc_openwebtext_importance\": -318.95062255859375,\n \"rps_doc_openwebtext_importance_length_correction\": -318.95062255859375,\n \"rps_doc_wikipedia_importance\": -188.72108459472656,\n \"rps_doc_wikipedia_importance_length_correction\": -188.72108459472656\n },\n \"fasttext\": {\n \"dclm\": 0.024902110919356346,\n \"english\": 0.9401518702507019,\n \"fineweb_edu_approx\": 1.1364269256591797,\n \"eai_general_math\": 0.24793529510498047,\n \"eai_open_web_math\": 0.30956780910491943,\n \"eai_web_code\": 0.0038525499403476715\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"004.68\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n },\n \"secondary\": {\n \"code\": \"621.392\",\n \"labels\": {\n \"level_1\": \"Industrial arts, Technology, and Engineering\",\n \"level_2\": \"Engineering\",\n \"level_3\": \"Mechanical engineering and Machinery\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Social/Forum\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"18\",\n \"label\": \"Q&A Forum\"\n },\n \"secondary\": {\n \"code\": \"21\",\n \"label\": \"Customer Support\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"1\",\n \"label\": \"General Audience\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192855,"cells":{"id":{"kind":"number","value":-8442870823201336000,"string":"-8,442,870,823,201,336,000"},"text":{"kind":"string","value":"Ensurepass\n2017 July CompTIA Official New Released 220-902 Q&As\n100% Free Download! 100% Pass Guaranteed!\nhttp://www.ensurepass.com/220-902.html\n\nCompTIA A+ 220-902 Certification Exam\n\nQUESTION 171\n\nAnn, an end user, receives a call from someone claiming to be from the help desk and asking for her username and password to prevent her email box from being deleted immediately. Which of the following BEST describes this type of attack?\n\n \n\nA.\n\nShoulder surfing\n\nB.\n\nMan-in-the-middle\n\nC.\n\nSocial engineering\n\nD.\n\nRansomware\n\n \n\nCorrect Answer: C\n\n \n\n \n\nQUESTION 172\n\nWhich of the following file formats does Android use for application installation?\n\n \n\nA.\n\n.ipa\n\nB.\n\n.api\n\nC.\n\n.apk\n\nD.\n\n.exe\n\nE.\n\n.sdk\n\n \n\nCorrect Answer: C\n\n \n\n \n\nQUESTION 173\n\nA technician is tasked with installing Windows on numerous network PCs. Which of the following is the QUICKEST method for getting a standard configuration to the PCs?\n\n \n\nA.\n\nPrebuilt image using PXE\n\nB.\n\nSingle solid state/flash drive with answer file\n\nC.\n\nHot swappable image drive\n\nD.\n\nInternal hard drive partition with the image\n\n \n\nCorrect Answer: A\n\n \n\n \n\nQUESTION 174\n\nA technician has purchased a new surge protector to protect equipment in the production environment. The surge protector’s features safeguard the connected equipment by directing surges to the:\n\n \n\nA.\n\npath of shortest conductance.\n\nB.\n\npath of lowest inductance.\n\nC.\n\npath of highest voltage.\n\nD.\n\npath of least resistance.\n\n \n\nCorrect Answer: D\n\n \n\n \n\n \n\n \n\n \n\n \n\nQUESTION 175\n\nA user states that when typing in directions on a navigation website, the map is not viewable in a newer web browser. The technician runs updates to Java, but is still unable to view the map. The technician should change which of the following Internet Options?\n\n \n\nA.\n\nCompatibility view\n\nB.\n\nManage add-ons\n\nC.\n\nClear browser cache\n\nD.\n\nPop-up blocker\n\n \n\nCorrect Answer: A\n\n \n\n \n\nQUESTION 176\n\nA turnstile is an example of which of the following forms of physical security?\n\n \n\nA.\n\nEntry control roster\n\nB.\n\nBiometrics\n\nC.\n\nMantrap\n\nD.\n\nCipher lock\n\n \n\nCorrect Answer: C\n\n \n\n \n\nQUESTION 177\n\nA user has plugged in a mobile phone to a PC and received a message that the driver was not successfully installed. Which of the following system tools should be used to troubleshoot this error?\n\n \n\nA.\n\nDevice Manager\n\nB.\n\nComponent Services\n\nC.\n\nWindows Memory Diagnostics\n\nD.\n\nData Sources\n\n \n\nCorrect Answer: A\n\n \n\n \n\nQUESTION 178\n\nWhich of the following is a risk of implementing a BYOD policy?\n\n \n\nA.\n\nIntroducing malware onto the network\n\nB.\n\nDHCP may fail due to incompatibility\n\nC.\n\nDifferent encryption technology\n\nD.\n\nHigher risk of phishing attacks\n\n \n\nCorrect Answer: A\n\n \n\n \n\nQUESTION 179\n\nA technician has decided to upgrade all users’ iPhones to the latest model. Which of the following is the FIRST thing the technician should advise the users to do with the old phones before turning them in?\n\n \n\nA.\n\nBack up the mobile data with a cloud backup service.\n\nB.\n\nEnable remote wipe to clear all personal and corporate data.\n\nC.\n\nGo into the device settings to remove personal customizations.\n\nD.\n\nFactory reset the old phones to ensure the data is no longer on the device.\n\n \n\nCorrect Answer: A\n\n \n\n \n\nQUESTION 180\n\nWhich of the following best practices is used to fix a zero-day vulnerability on Linux?\n\n \n\nA.\n\nScheduled backup\n\nB.\n\nScheduled disk maintenance\n\nC.\n\nPatch management\n\nD.\n\nAntivirus update\n\n \n\nCorrect Answer: C\n\n100% Free Download!\n—Download Free Demo:220-902 Demo PDF\n100% Pass Guaranteed!\nDownload 2017 Ensurepass 220-902 Full Exam PDF and VCE Q&As:306\n—Get 10% off your purchase! Copy it:TJDN-947R-9CCD [2017.07.01-2017.07.31]\n\nEnsurepass ExamCollection Testking\nLowest Price Guarantee Yes No No\nUp-to-Dated Yes No No\nReal Questions Yes No No\nExplanation Yes No No\nPDF + VCE Yes No No\nFree VCE Simulator Yes No No\nInstant Download Yes No No\n\n2017 Ensurepass IT Certification PDF and VCE"},"metadata":{"kind":"string","value":"{\n \"url\": \"http://www.dumps4shared.com/free-2017july-ensurepass-passguide-comptia-220-902-latest-dumps-171-180.html\",\n \"source_domain\": \"www.dumps4shared.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2018-26\",\n \"warc_metadata\": {\n \"Content-Length\": \"845174\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:YEC6CN5L4OR3TUUM2E5Q7HV6DMS4T7JF\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2018-06-21T18:32:19Z\",\n \"WARC-IP-Address\": \"198.252.98.246\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:MJTJKUP3U7REED3J2C7ZBFK3EJWQSZBT\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"http://www.dumps4shared.com/free-2017july-ensurepass-passguide-comptia-220-902-latest-dumps-171-180.html\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"robots: classic\\r\\nhostname: ip-10-158-203-138.ec2.internal\\r\\nsoftware: Nutch 1.6 (CC)\\r\\nisPartOf: CC-MAIN-2018-26\\r\\noperator: Common Crawl Admin\\r\\ndescription: Wide crawl of the web for June 2018\\r\\npublisher: Common Crawl\\r\\nformat: WARC File Format 1.0\\r\\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 11,\n 64,\n 106,\n 145,\n 146,\n 184,\n 185,\n 198,\n 199,\n 437,\n 438,\n 440,\n 441,\n 444,\n 445,\n 462,\n 463,\n 466,\n 467,\n 485,\n 486,\n 489,\n 490,\n 509,\n 510,\n 513,\n 514,\n 525,\n 526,\n 528,\n 529,\n 547,\n 548,\n 550,\n 551,\n 553,\n 554,\n 567,\n 568,\n 651,\n 652,\n 654,\n 655,\n 658,\n 659,\n 664,\n 665,\n 668,\n 669,\n 674,\n 675,\n 678,\n 679,\n 684,\n 685,\n 688,\n 689,\n 694,\n 695,\n 698,\n 699,\n 704,\n 705,\n 707,\n 708,\n 726,\n 727,\n 729,\n 730,\n 732,\n 733,\n 746,\n 747,\n 914,\n 915,\n 917,\n 918,\n 921,\n 922,\n 947,\n 948,\n 951,\n 952,\n 1000,\n 1001,\n 1004,\n 1005,\n 1031,\n 1032,\n 1035,\n 1036,\n 1081,\n 1082,\n 1084,\n 1085,\n 1103,\n 1104,\n 1106,\n 1107,\n 1109,\n 1110,\n 1123,\n 1124,\n 1318,\n 1319,\n 1321,\n 1322,\n 1325,\n 1326,\n 1356,\n 1357,\n 1360,\n 1361,\n 1388,\n 1389,\n 1392,\n 1393,\n 1418,\n 1419,\n 1422,\n 1423,\n 1449,\n 1450,\n 1452,\n 1453,\n 1471,\n 1472,\n 1474,\n 1475,\n 1477,\n 1478,\n 1480,\n 1481,\n 1483,\n 1484,\n 1486,\n 1487,\n 1489,\n 1490,\n 1503,\n 1504,\n 1766,\n 1767,\n 1769,\n 1770,\n 1773,\n 1774,\n 1793,\n 1794,\n 1797,\n 1798,\n 1813,\n 1814,\n 1817,\n 1818,\n 1838,\n 1839,\n 1842,\n 1843,\n 1858,\n 1859,\n 1861,\n 1862,\n 1880,\n 1881,\n 1883,\n 1884,\n 1886,\n 1887,\n 1900,\n 1901,\n 1981,\n 1982,\n 1984,\n 1985,\n 1988,\n 1989,\n 2010,\n 2011,\n 2014,\n 2015,\n 2026,\n 2027,\n 2030,\n 2031,\n 2039,\n 2040,\n 2043,\n 2044,\n 2056,\n 2057,\n 2059,\n 2060,\n 2078,\n 2079,\n 2081,\n 2082,\n 2084,\n 2085,\n 2098,\n 2099,\n 2294,\n 2295,\n 2297,\n 2298,\n 2301,\n 2302,\n 2317,\n 2318,\n 2321,\n 2322,\n 2341,\n 2342,\n 2345,\n 2346,\n 2373,\n 2374,\n 2377,\n 2378,\n 2391,\n 2392,\n 2394,\n 2395,\n 2413,\n 2414,\n 2416,\n 2417,\n 2419,\n 2420,\n 2433,\n 2434,\n 2498,\n 2499,\n 2501,\n 2502,\n 2505,\n 2506,\n 2543,\n 2544,\n 2547,\n 2548,\n 2585,\n 2586,\n 2589,\n 2590,\n 2622,\n 2623,\n 2626,\n 2627,\n 2659,\n 2660,\n 2662,\n 2663,\n 2681,\n 2682,\n 2684,\n 2685,\n 2687,\n 2688,\n 2701,\n 2702,\n 2909,\n 2910,\n 2912,\n 2913,\n 2916,\n 2917,\n 2970,\n 2971,\n 2974,\n 2975,\n 3036,\n 3037,\n 3040,\n 3041,\n 3104,\n 3105,\n 3108,\n 3109,\n 3185,\n 3186,\n 3188,\n 3189,\n 3207,\n 3208,\n 3210,\n 3211,\n 3213,\n 3214,\n 3227,\n 3228,\n 3316,\n 3317,\n 3319,\n 3320,\n 3323,\n 3324,\n 3341,\n 3342,\n 3345,\n 3346,\n 3373,\n 3374,\n 3377,\n 3378,\n 3395,\n 3396,\n 3399,\n 3400,\n 3417,\n 3418,\n 3420,\n 3421,\n 3439,\n 3440,\n 3460,\n 3497,\n 3519,\n 3583,\n 3658,\n 3659,\n 3694,\n 3727,\n 3749,\n 3774,\n 3796,\n 3816,\n 3845,\n 3872,\n 3873\n ],\n \"line_end_idx\": [\n 11,\n 64,\n 106,\n 145,\n 146,\n 184,\n 185,\n 198,\n 199,\n 437,\n 438,\n 440,\n 441,\n 444,\n 445,\n 462,\n 463,\n 466,\n 467,\n 485,\n 486,\n 489,\n 490,\n 509,\n 510,\n 513,\n 514,\n 525,\n 526,\n 528,\n 529,\n 547,\n 548,\n 550,\n 551,\n 553,\n 554,\n 567,\n 568,\n 651,\n 652,\n 654,\n 655,\n 658,\n 659,\n 664,\n 665,\n 668,\n 669,\n 674,\n 675,\n 678,\n 679,\n 684,\n 685,\n 688,\n 689,\n 694,\n 695,\n 698,\n 699,\n 704,\n 705,\n 707,\n 708,\n 726,\n 727,\n 729,\n 730,\n 732,\n 733,\n 746,\n 747,\n 914,\n 915,\n 917,\n 918,\n 921,\n 922,\n 947,\n 948,\n 951,\n 952,\n 1000,\n 1001,\n 1004,\n 1005,\n 1031,\n 1032,\n 1035,\n 1036,\n 1081,\n 1082,\n 1084,\n 1085,\n 1103,\n 1104,\n 1106,\n 1107,\n 1109,\n 1110,\n 1123,\n 1124,\n 1318,\n 1319,\n 1321,\n 1322,\n 1325,\n 1326,\n 1356,\n 1357,\n 1360,\n 1361,\n 1388,\n 1389,\n 1392,\n 1393,\n 1418,\n 1419,\n 1422,\n 1423,\n 1449,\n 1450,\n 1452,\n 1453,\n 1471,\n 1472,\n 1474,\n 1475,\n 1477,\n 1478,\n 1480,\n 1481,\n 1483,\n 1484,\n 1486,\n 1487,\n 1489,\n 1490,\n 1503,\n 1504,\n 1766,\n 1767,\n 1769,\n 1770,\n 1773,\n 1774,\n 1793,\n 1794,\n 1797,\n 1798,\n 1813,\n 1814,\n 1817,\n 1818,\n 1838,\n 1839,\n 1842,\n 1843,\n 1858,\n 1859,\n 1861,\n 1862,\n 1880,\n 1881,\n 1883,\n 1884,\n 1886,\n 1887,\n 1900,\n 1901,\n 1981,\n 1982,\n 1984,\n 1985,\n 1988,\n 1989,\n 2010,\n 2011,\n 2014,\n 2015,\n 2026,\n 2027,\n 2030,\n 2031,\n 2039,\n 2040,\n 2043,\n 2044,\n 2056,\n 2057,\n 2059,\n 2060,\n 2078,\n 2079,\n 2081,\n 2082,\n 2084,\n 2085,\n 2098,\n 2099,\n 2294,\n 2295,\n 2297,\n 2298,\n 2301,\n 2302,\n 2317,\n 2318,\n 2321,\n 2322,\n 2341,\n 2342,\n 2345,\n 2346,\n 2373,\n 2374,\n 2377,\n 2378,\n 2391,\n 2392,\n 2394,\n 2395,\n 2413,\n 2414,\n 2416,\n 2417,\n 2419,\n 2420,\n 2433,\n 2434,\n 2498,\n 2499,\n 2501,\n 2502,\n 2505,\n 2506,\n 2543,\n 2544,\n 2547,\n 2548,\n 2585,\n 2586,\n 2589,\n 2590,\n 2622,\n 2623,\n 2626,\n 2627,\n 2659,\n 2660,\n 2662,\n 2663,\n 2681,\n 2682,\n 2684,\n 2685,\n 2687,\n 2688,\n 2701,\n 2702,\n 2909,\n 2910,\n 2912,\n 2913,\n 2916,\n 2917,\n 2970,\n 2971,\n 2974,\n 2975,\n 3036,\n 3037,\n 3040,\n 3041,\n 3104,\n 3105,\n 3108,\n 3109,\n 3185,\n 3186,\n 3188,\n 3189,\n 3207,\n 3208,\n 3210,\n 3211,\n 3213,\n 3214,\n 3227,\n 3228,\n 3316,\n 3317,\n 3319,\n 3320,\n 3323,\n 3324,\n 3341,\n 3342,\n 3345,\n 3346,\n 3373,\n 3374,\n 3377,\n 3378,\n 3395,\n 3396,\n 3399,\n 3400,\n 3417,\n 3418,\n 3420,\n 3421,\n 3439,\n 3440,\n 3460,\n 3497,\n 3519,\n 3583,\n 3658,\n 3659,\n 3694,\n 3727,\n 3749,\n 3774,\n 3796,\n 3816,\n 3845,\n 3872,\n 3873,\n 3917\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 3917,\n \"ccnet_original_nlines\": 330,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.23759791254997253,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.11618798971176147,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.22062663733959198,\n \"rps_doc_frac_unique_words\": 0.5,\n \"rps_doc_mean_word_length\": 4.90500020980835,\n \"rps_doc_num_sentences\": 78,\n \"rps_doc_symbol_to_word_ratio\": 0,\n \"rps_doc_unigram_entropy\": 5.106886863708496,\n \"rps_doc_word_count\": 600,\n \"rps_doc_frac_chars_dupe_10grams\": 0,\n \"rps_doc_frac_chars_dupe_5grams\": 0.03907576948404312,\n \"rps_doc_frac_chars_dupe_6grams\": 0.016309890896081924,\n \"rps_doc_frac_chars_dupe_7grams\": 0,\n \"rps_doc_frac_chars_dupe_8grams\": 0,\n \"rps_doc_frac_chars_dupe_9grams\": 0,\n \"rps_doc_frac_chars_top_2gram\": 0.044172611087560654,\n \"rps_doc_frac_chars_top_3gram\": 0.030581040307879448,\n \"rps_doc_frac_chars_top_4gram\": 0.058103978633880615,\n \"rps_doc_books_importance\": -295.89697265625,\n \"rps_doc_books_importance_length_correction\": -295.89697265625,\n \"rps_doc_openwebtext_importance\": -140.1320037841797,\n \"rps_doc_openwebtext_importance_length_correction\": -140.1320037841797,\n \"rps_doc_wikipedia_importance\": -139.6378173828125,\n \"rps_doc_wikipedia_importance_length_correction\": -139.6378173828125\n },\n \"fasttext\": {\n \"dclm\": 0.4896451234817505,\n \"english\": 0.8441296815872192,\n \"fineweb_edu_approx\": 1.6000884771347046,\n \"eai_general_math\": 0.003566439962014556,\n \"eai_open_web_math\": 0.16380512714385986,\n \"eai_web_code\": 0.00001788000008673407\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"004.076\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n },\n \"secondary\": {\n \"code\": \"005.4\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Apply\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Reference/Encyclopedic/Educational\"\n },\n \"secondary\": {\n \"code\": \"6\",\n \"label\": \"Promotional/Advertisement\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Click Here References\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"23\",\n \"label\": \"Tutorial\"\n },\n \"secondary\": {\n \"code\": \"17\",\n \"label\": \"Product Page\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192856,"cells":{"id":{"kind":"number","value":-5749543799854024000,"string":"-5,749,543,799,854,024,000"},"text":{"kind":"string","value":" \nSearch\n • Catherine Norton\n\nLeaving Facebook\n\nUpdated: Nov 22, 2021\n\n\nAfter 13 years and losing 860+ friends, being censored hurts. I've been with Facebook longer than most of my adult relationships.\n\n\nDo you suppose it was because I am a female writer with the audacity to write books specifically for women? Or could it really be the \"scandalous\" art on the book cover that others can post, but the writer cannot? I honestly do not know the answer because there is no one at Facebook to ask these crucial questions.\n\nThere is no legal recourse for censoring, silencing, and oppression on Facebook. A senior attorney at the Civil Liberties Union of NY informed me that Facebook is a private entity and can do whatever they want because we agree to their terms to use it. Although Facebook seems like a public forum, it is not. Free speech and individual rights are not guaranteed as they would be in a public town square.\n\n\nDon't you find it unnerving when friends suddenly disappear without explanation only to emerge a month later feeling ragged and beat down by a system that suddenly yanks access without due process, leaving others shaken and afraid that they will be next?\n\n\nFacebook acts more like a totalitarian regime than a \"social\" media platform, and it is getting worse by the day. What are we really getting in exchange for our freedom and sale of our personal information for advertising and God-knows-what-else? All we want to do is connect with each other, share ideas and laugh at kitten photos. We want community, not an abusive platform that mines our data for dollars and takes money from foreign entities to create division and skew elections.\n\n\nHave you ever wondered how Mark Zuckerberg became a $113.5 billionaire*? He did it by selling our personal data and access to our eyes and minds. There may be no fee to join Facebook, but we definitely pay a cost. He saw our need to connect, rounded us up like cattle and sold us out.\n\n\nI am moving to the MeWe community, an open forum with no censoring, no advertising, and no selling of personal information. Yes, it is new, and most of your friends won't be on it, but it is similar to Facebook and simple to use. Perhaps we can migrate to MeWe as we migrated from MySpace to Facebook years ago. I hope you try MeWe because I will miss seeing photos of your pets, families and the fantastic meals you enjoy! Please friend me at https://mewe.com/i/cathynorton3. If you find any other cool, safe places to connect online, please drop a note in the comments.\n\nI've also decided to move my reader's forum to my website, so I will never lose access to it. I am still setting it up, so please give me a minute to figure it out. Thanks so much.\n\n\n*per Google on 10/30/2021\n\n\n#ReadTheStain\n\n\nImage courtesy of MeWe.com\n\n5 views0 comments\n\nRecent Posts\n\nSee All\n\nHalo\n\n \n "},"metadata":{"kind":"string","value":"{\n \"url\": \"https://www.catherineiversnorton.com/post/leaving-facebook\",\n \"source_domain\": \"www.catherineiversnorton.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2022-33\",\n \"warc_metadata\": {\n \"Content-Length\": \"742716\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:OK2CEPEWFAYSYXI52DWFZJ54WJLUL5TA\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2022-08-16T07:38:37Z\",\n \"WARC-IP-Address\": \"34.117.168.233\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:R5R7R44ZLQFWXIJXL2TCLKHBZMBYJZ2U\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://www.catherineiversnorton.com/post/leaving-facebook\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"isPartOf: CC-MAIN-2022-33\\r\\npublisher: Common Crawl\\r\\ndescription: Wide crawl of the web for August 2022\\r\\noperator: Common Crawl Admin (info@commoncrawl.org)\\r\\nhostname: ip-10-67-67-80\\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/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 2,\n 9,\n 30,\n 31,\n 48,\n 49,\n 71,\n 72,\n 73,\n 203,\n 204,\n 205,\n 521,\n 522,\n 926,\n 927,\n 928,\n 1183,\n 1184,\n 1185,\n 1670,\n 1671,\n 1672,\n 1957,\n 1958,\n 1959,\n 2531,\n 2532,\n 2713,\n 2714,\n 2715,\n 2741,\n 2742,\n 2743,\n 2757,\n 2758,\n 2759,\n 2786,\n 2787,\n 2805,\n 2806,\n 2819,\n 2820,\n 2828,\n 2829,\n 2834,\n 2835,\n 2837\n ],\n \"line_end_idx\": [\n 2,\n 9,\n 30,\n 31,\n 48,\n 49,\n 71,\n 72,\n 73,\n 203,\n 204,\n 205,\n 521,\n 522,\n 926,\n 927,\n 928,\n 1183,\n 1184,\n 1185,\n 1670,\n 1671,\n 1672,\n 1957,\n 1958,\n 1959,\n 2531,\n 2532,\n 2713,\n 2714,\n 2715,\n 2741,\n 2742,\n 2743,\n 2757,\n 2758,\n 2759,\n 2786,\n 2787,\n 2805,\n 2806,\n 2819,\n 2820,\n 2828,\n 2829,\n 2834,\n 2835,\n 2837,\n 2838\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 2838,\n \"ccnet_original_nlines\": 48,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.45423728227615356,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.018644070252776146,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.14576271176338196,\n \"rps_doc_frac_unique_words\": 0.5531061887741089,\n \"rps_doc_mean_word_length\": 4.462925910949707,\n \"rps_doc_num_sentences\": 31,\n \"rps_doc_symbol_to_word_ratio\": 0.0016949200071394444,\n \"rps_doc_unigram_entropy\": 5.23301887512207,\n \"rps_doc_word_count\": 499,\n \"rps_doc_frac_chars_dupe_10grams\": 0,\n \"rps_doc_frac_chars_dupe_5grams\": 0,\n \"rps_doc_frac_chars_dupe_6grams\": 0,\n \"rps_doc_frac_chars_dupe_7grams\": 0,\n \"rps_doc_frac_chars_dupe_8grams\": 0,\n \"rps_doc_frac_chars_dupe_9grams\": 0,\n \"rps_doc_frac_chars_top_2gram\": 0.007184550166130066,\n \"rps_doc_frac_chars_top_3gram\": 0.008082619868218899,\n \"rps_doc_frac_chars_top_4gram\": 0,\n \"rps_doc_books_importance\": -238.93284606933594,\n \"rps_doc_books_importance_length_correction\": -238.93284606933594,\n \"rps_doc_openwebtext_importance\": -132.78749084472656,\n \"rps_doc_openwebtext_importance_length_correction\": -132.78749084472656,\n \"rps_doc_wikipedia_importance\": -95.3597412109375,\n \"rps_doc_wikipedia_importance_length_correction\": -95.3597412109375\n },\n \"fasttext\": {\n \"dclm\": 0.02947830967605114,\n \"english\": 0.9646156430244446,\n \"fineweb_edu_approx\": 0.9713648557662964,\n \"eai_general_math\": 0.003814100055024028,\n \"eai_open_web_math\": 0.043345510959625244,\n \"eai_web_code\": 0.0006373500218614936\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"004.678\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computers and Computer science\"\n }\n },\n \"secondary\": {\n \"code\": \"303.48\",\n \"labels\": {\n \"level_1\": \"Social sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Social sciences — Dictionaries\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Evaluate\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Metacognitive\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"9\",\n \"label\": \"Personal/Misc\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No Artifacts\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Click Here References\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"16\",\n \"label\": \"Personal Blog\"\n },\n \"secondary\": {\n \"code\": \"10\",\n \"label\": \"Knowledge Article\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"6\",\n \"label\": \"Not Applicable/Indeterminate\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Partially Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"1\",\n \"label\": \"General Audience\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192857,"cells":{"id":{"kind":"number","value":-3860252561389504500,"string":"-3,860,252,561,389,504,500"},"text":{"kind":"string","value":"1\n$\\begingroup$\n\nFor example, if they somehow got a function that would churn out any arbitrary amount of primes in a row. Could they break the RSA problem then?\n\n$\\endgroup$\n1\n • 1\n $\\begingroup$ I think this answer probably answers your question (with a little thought). $\\endgroup$\n – Reid\n May 8 '15 at 22:24\n1\n$\\begingroup$\n\nMathematically, yes, it will work. Practically, you will require an extremely very long time and an incredible amount of energy, considering the sizes of the primes involved in RSA (usually around 1024-bit prime numbers). It is about billion and billions of years and billions and billions times the energy of the whole universe (RSA: How effective is this keypair-trash attack)\n\n$\\endgroup$\n\nNot the answer you're looking for? Browse other questions tagged or ask your own question."},"metadata":{"kind":"string","value":"{\n \"url\": \"https://crypto.stackexchange.com/questions/25524/if-someone-had-a-list-of-all-primes-would-it-be-possible-for-them-to-factor-any?noredirect=1\",\n \"source_domain\": \"crypto.stackexchange.com\",\n \"snapshot_id\": \"crawl=CC-MAIN-2022-05\",\n \"warc_metadata\": {\n \"Content-Length\": \"119766\",\n \"Content-Type\": \"application/http; msgtype=response\",\n \"WARC-Block-Digest\": \"sha1:74GWSEX6TPUSETGI6AUJM7HCG2HOUKOQ\",\n \"WARC-Concurrent-To\": \"\",\n \"WARC-Date\": \"2022-01-28T06:02:58Z\",\n \"WARC-IP-Address\": \"151.101.65.69\",\n \"WARC-Identified-Payload-Type\": \"text/html\",\n \"WARC-Payload-Digest\": \"sha1:B3RMTWWI6GFNZYEXQ34YLBXHK27XW3WZ\",\n \"WARC-Record-ID\": \"\",\n \"WARC-Target-URI\": \"https://crypto.stackexchange.com/questions/25524/if-someone-had-a-list-of-all-primes-would-it-be-possible-for-them-to-factor-any?noredirect=1\",\n \"WARC-Truncated\": null,\n \"WARC-Type\": \"response\",\n \"WARC-Warcinfo-ID\": \"\"\n },\n \"warc_info\": \"isPartOf: CC-MAIN-2022-05\\r\\npublisher: Common Crawl\\r\\ndescription: Wide crawl of the web for January 2022\\r\\noperator: Common Crawl Admin (info@commoncrawl.org)\\r\\nhostname: ip-10-67-67-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/\"\n}"},"line_start_n_end_idx":{"kind":"string","value":"{\n \"line_start_idx\": [\n 0,\n 2,\n 16,\n 17,\n 162,\n 163,\n 175,\n 177,\n 183,\n 289,\n 300,\n 323,\n 325,\n 339,\n 340,\n 719,\n 720,\n 732,\n 733\n ],\n \"line_end_idx\": [\n 2,\n 16,\n 17,\n 162,\n 163,\n 175,\n 177,\n 183,\n 289,\n 300,\n 323,\n 325,\n 339,\n 340,\n 719,\n 720,\n 732,\n 733,\n 823\n ]\n}"},"quality_signals":{"kind":"string","value":"{\n \"red_pajama_v2\": {\n \"ccnet_original_length\": 823,\n \"ccnet_original_nlines\": 18,\n \"rps_doc_curly_bracket\": 0,\n \"rps_doc_ldnoobw_words\": 0,\n \"rps_doc_lorem_ipsum\": 0,\n \"rps_doc_stop_word_fraction\": 0.3705882430076599,\n \"rps_doc_ut1_blacklist\": 0,\n \"rps_doc_frac_all_caps_words\": 0.023529410362243652,\n \"rps_doc_frac_lines_end_with_ellipsis\": 0,\n \"rps_doc_frac_no_alph_words\": 0.2647058665752411,\n \"rps_doc_frac_unique_words\": 0.7045454382896423,\n \"rps_doc_mean_word_length\": 4.780303001403809,\n \"rps_doc_num_sentences\": 7,\n \"rps_doc_symbol_to_word_ratio\": 0,\n \"rps_doc_unigram_entropy\": 4.384503364562988,\n \"rps_doc_word_count\": 132,\n \"rps_doc_frac_chars_dupe_10grams\": 0,\n \"rps_doc_frac_chars_dupe_5grams\": 0,\n \"rps_doc_frac_chars_dupe_6grams\": 0,\n \"rps_doc_frac_chars_dupe_7grams\": 0,\n \"rps_doc_frac_chars_dupe_8grams\": 0,\n \"rps_doc_frac_chars_dupe_9grams\": 0,\n \"rps_doc_frac_chars_top_2gram\": 0.052297938615083694,\n \"rps_doc_frac_chars_top_3gram\": 0,\n \"rps_doc_frac_chars_top_4gram\": 0,\n \"rps_doc_books_importance\": -74.56757354736328,\n \"rps_doc_books_importance_length_correction\": -74.56757354736328,\n \"rps_doc_openwebtext_importance\": -48.58305740356445,\n \"rps_doc_openwebtext_importance_length_correction\": -48.45148849487305,\n \"rps_doc_wikipedia_importance\": -22.566539764404297,\n \"rps_doc_wikipedia_importance_length_correction\": -22.566539764404297\n },\n \"fasttext\": {\n \"dclm\": 0.9588716626167297,\n \"english\": 0.8988929390907288,\n \"fineweb_edu_approx\": 2.193901300430298,\n \"eai_general_math\": 0.00038355999276973307,\n \"eai_open_web_math\": 0.47597020864486694,\n \"eai_web_code\": -0.000010009999641624745\n }\n}"},"eai_taxonomy":{"kind":"string","value":"{\n \"free_decimal_correspondence\": {\n \"primary\": {\n \"code\": \"005.82\",\n \"labels\": {\n \"level_1\": \"General works, books and libraries, information sciences\",\n \"level_2\": \"\",\n \"level_3\": \"Computer programming\"\n }\n },\n \"secondary\": {\n \"code\": \"512.7\",\n \"labels\": {\n \"level_1\": \"Science and Natural history\",\n \"level_2\": \"Mathematics\",\n \"level_3\": \"Algebra\"\n }\n }\n },\n \"bloom_cognitive_process\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Understand\"\n },\n \"secondary\": {\n \"code\": \"4\",\n \"label\": \"Analyze\"\n }\n },\n \"bloom_knowledge_domain\": {\n \"primary\": {\n \"code\": \"2\",\n \"label\": \"Conceptual\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Procedural\"\n }\n },\n \"document_type_v1\": {\n \"primary\": {\n \"code\": \"5\",\n \"label\": \"Social/Forum\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"extraction_artifacts\": {\n \"primary\": {\n \"code\": \"1\",\n \"label\": \"Leftover HTML\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Irrelevant Content\"\n }\n },\n \"missing_content\": {\n \"primary\": {\n \"code\": \"0\",\n \"label\": \"No missing content\"\n },\n \"secondary\": {\n \"code\": \"-1\",\n \"label\": \"Abstain\"\n }\n },\n \"document_type_v2\": {\n \"primary\": {\n \"code\": \"18\",\n \"label\": \"Q&A Forum\"\n },\n \"secondary\": {\n \"code\": \"10\",\n \"label\": \"Knowledge Article\"\n }\n },\n \"reasoning_depth\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Intermediate Reasoning\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"Basic Reasoning\"\n }\n },\n \"technical_correctness\": {\n \"primary\": {\n \"code\": \"4\",\n \"label\": \"Highly Correct\"\n },\n \"secondary\": {\n \"code\": \"3\",\n \"label\": \"Mostly Correct\"\n }\n },\n \"education_level\": {\n \"primary\": {\n \"code\": \"3\",\n \"label\": \"Undergraduate Level\"\n },\n \"secondary\": {\n \"code\": \"2\",\n \"label\": \"High School Level\"\n }\n }\n}"},"pid":{"kind":"string","value":"672f1e42c33a7f9846924a2431ea77df"}}},{"rowIdx":46192858,"cells":{"id":{"kind":"number","value":-4393802681987161000,"string":"-4,393,802,681,987,161,000"},"text":{"kind":"string","value":"jp.guihard.net\nhttps://www.jp.guihard.net/spip.php?article133\nCouteau Suisse : lame un sommaire pour vos articles\nvendredi, 15 avril 2011 / Jean-Philippe Guihard\n\nCette page a pour objectif de tester des javascripts qui permettent de placer le sommaire automatique de la lame idoine du couteau suisse dans une fenêtre que l’on peut déplacer à volonté et que l’on peut aussi fermer si on ne veut plus afficher le sommaire.\n\nJ’ai ajouté un paramètre draggable à la boîte sommaire modifiée dans son css. Maintenant, cela fonctionne pil poil me semble-t-il.\n\nReste à faire :\n\nJ’ai tout repris car cela ne fonctionnait pas avec IE7 comme par hasard. Voici le principe du sommaire du plugin Couteau suisse : il a un fond de palette sommaire avec un background que j’ai fixé à son bas pour avoir l’arrondi du bas de palette, on modifie le bg de la partie titre et maintenant cela fonctionne sous IE 7.\n\nJ’ai ôté la partie fermeture de la palette sommaire qui ne sert pas à grand chose contrairement à ce que je pensais. En plus, cela merdouille complètement sous IE7 aussi.\n\nLe principe est de surcharger les fichiers gérant le sommaire du couteau suisse. Surcharger consiste à copier lesdits fichiers dans votre dossier squelettes en respectant la même hiérarchie que dans le dossier du couteau suisse. Le couteau suisse, lorsqu’il appelle une fonction va regarder d’abord dans le dossier squelettes s’il trouve un fichier de même nom. Dans l’affirmative, il va utiliser celui du dossier squelettes en lieu et place de l’original. Vous pouvez donc réécrire, modifier le contenu de cette copie comme bon il vous semble et les fichiers originaux peuvent être mis à jour par le couteau suisse sans que votre beau travail soit détruit.\n\nLes fichiers source sont en téléchargement.\n\nIl vous faut créer un dossier « fonds », un dossier « img », un sous dossier « sommaire » dans le dossier « img » et un dossier « outils » dans votre dossier squelettes. Vous copiez le fichier sommaire .html dans le dossier fonds, le fichier sommaire.css.html dans le dossier outils et les fichiers d’images dans le sous dossier « sommaire » du dossier « img ».\n\nVous avez donc :\n\nLe source du fichier fonds/sommaire.html\n\n[(#REM) l'appel à jquery pour la fonction draggable ]\n\n\n