id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
-5,473,077,581,471,263,000 | 北极寒流 » 网络资源 » WordPress文章内链短代码以及WordPress短代码完全指南 - 2015.11.03
WordPress文章内链短代码以及WordPress短代码完全指南
我们可以用短代码的方式添加文章ID来直接调用文章，非常方便，下面给出实现方法。
下面的代码加入到functions.php
function fa_insert_posts( $atts, $content = null ){
extract( shortcode_atts( array(
'ids' => ''
),
$atts ) );
global $post;
$content = '';
$postids = explode(',', $ids);
$inset_posts = get_posts(array('post__in'=>$postids));
foreach ($inset_posts as $key => $post) {
setup_postdata( $post );
$content .= '<div class="card-today-history"><div class="card-thContents"><div class="card-thLine"></div><div class="card-thHeroTitle"><a target="_blank" class="label--thTitle" href="' . get_permalink() . '">' . get_the_title() . '</a><div class="v-floatRight card-thMeta">' . get_comments_number(). '<i class="iconfont icon-comment"></i></div></div></div></div>';
}
wp_reset_postdata();
return $content;
}
add_shortcode('fa_insert_post', 'fa_insert_posts');
你可以根据你自己的需要来调整代码，也可以自己自定义CSS样式，我这里就不给出CSS代码了。请无视函数中的css命名，我是直接把历史上的今天的样式直接拿过来了。。
至于调用就非常简单了，直接使用短代码[fa_insert_post ids=123,245]即可
如果你不是在文章内容中，而是在其他地方想调用，则可使用do_shortcode('[fa_insert_post ids=123,245]')来调用。
良好的内链结构有助于网站SEO，如果对SEO有关注可以好好关注下内链建设。
资料来源https://fatesinger.com/76585
WordPress短代码的使用非常简单。比如说我们想显示给定的最新文章，我们可以使用类似下面的代码：
[ recent - posts ]
再进一步的，我们可以通过设定一个参数来控制现实的文章的数量：
[ recent - posts posts = "5" ]
更进一步的，我们可以为文章列表增加一个标题：
[ recent - posts posts = "5" ] Posts Heading [ / recent - posts ]
1. 简单的短代码
本教程的第一部分，我们将创建下面这个短代码的代码：
[ recent - posts ]
创建的过程非常简单，不需要很高级的PHP知识。创建过程如下：
1. 创建一个函数，当 WordPress 发现短代码的时候会调用此函数；
2. 通过设置一个唯一的名称来注册短代码；
3. 把注册的函数绑定到Wordpress的action上。
本教程的所有代码都可以直接放到 functions.php 中，也可以放在一个将包含在 functions.php 的单独的PHP文件中。
1.1 创建回调函数
当发现短代码的时候，它会被一个称作回调函数的一段代码所代替。所以我们先创建一个函数，从数据库中获取最新的文章。
function recent_posts_function ( ) {
query_posts ( array ( 'orderby' = > 'date' , 'order' = > 'DESC' , 'showposts' = > 1 ) ) ;
if ( have_posts ( ) ) :
while ( have_posts ( ) ) : the_post ( ) ;
$return_string = '<a href="' . get_permalink ( ) . '">' . get_the_title ( ) . '</a>' ;
endwhile ;
endif ;
wp_reset_query ( ) ;
return $return_string ;
}
如上所示，我们查询数据库，获取最新的文章，并返回一个带有链接的字符串。值得注意的是，回调函数并不打印任何内容，而是返回一个字符串。
1.2 注册短代码
现在，我们告诉Wordpress这个函数是一个短代码：
function register_shortcodes ( ) {
add_shortcode ( 'recent-posts' , 'recent_posts_function' ) ;
}
当在文章的内容中发现短代码 [recent-posts] 时，将会自动调用 recent_posts_function() 函数，我们需要确保短代码的名字是唯一的，以避免重复。
1.3 Hook into WordPress
为了能够执行 recent_posts_function() 函数，我们需要把它绑定在 WordPress 的初始化钩子中。
add_action ( 'init' , 'register_shortcodes' ) ;
1.4 测试短代码
简单的短代码已经准备好了，现在我们需要测试它是否能够正常运行。我们创建一个新的文章（或打开一个已存在的），把下面的代码加入到文章内容中的某个位置：
[ recent - posts ]
发布文章并在浏览器中打开，你将看到一个执行你最新文章的链接，如下图所示：
13153252_Uiv2
2. 进阶短代码
2.1 短代码参数
短代码非常灵活，因为它允许我们添加参数以使它们具有更多的功能。假定我们需要显示一定数量的最新文章。为了实现这个，我们需要给短代码增加额外的选择来指定显示最新的多少篇文章。
我们需要使用两个函数，第一个是Wordpress内置的 shortcode_atts() 函数，它把用户的短代码属性与本地属性结合在一起，并填充到所需要的位置。第二个是PHP的 extract() 函数，顾名思义，它提取短代码的各个属性。
扩展我们的回调函数，我们添加一个参数，它是一个数组，从中我们可以提取到我们需要获取的文章的数量。我们查询数据库，获取指定数量的文章，并返回一个列表：
function recent_posts_function ( $atts ) {
extract ( shortcode_atts ( array (
'posts' = > 1 ,
) , $atts ) ) ;
$return_string = '<ul>' ;
query_posts ( array ( 'orderby' = > 'date' , 'order' = > 'DESC' , 'showposts' = > $posts ) ) ;
if ( have_posts ( ) ) :
while ( have_posts ( ) ) : the_post ( ) ;
$return_string . = '<li><a href="' . get_permalink ( ) . '">' . get_the_title ( ) .'</a></li>' ;
endwhile ;
endif ;
$return_string . = '</ul>' ;
wp_reset_query ( ) ;
return $return_string ;
}
如果用户不指定该选项，1将是默认值。我们可以添加更多的属性，使短代码接受更多的参数。用这个增强的函数，我们可以指定调用最新文章的数量：
[ recent - posts posts = "5" ]
在浏览器中显示时，你将看到最新的五篇文章列表：
13153252_3xEG
2.2 短代码中添加内容
我们可以更进一步扩展我们的短代码，添加一些内容作为参数来传递，这将是最新文章列表的标题。为了实现此功能，我们需要在回调函数中增加第二个参数 $content ，并把它显示在列表前面的一个 <h3> 标签中。新的函数如下：
function recent_posts_function ( $atts , $content = null ) {
extract ( shortcode_atts ( array (
'posts' = > 1 ,
) , $atts ) ) ;
$return_string = '<h3>' . $content . '</h3>' ;
$return_string . = '<ul>' ;
query_posts ( array ( 'orderby' = > 'date' , 'order' = > 'DESC' , 'showposts' = > $posts ) ) ;
if ( have_posts ( ) ) :
while ( have_posts ( ) ) : the_post ( ) ;
$return_string . = '<li><a href="' . get_permalink ( ) . '">' . get_the_title ( ) .'</a></li>' ;
endwhile ;
endif ;
$return_string . = '</ul>' ;
wp_reset_query ( ) ;
return $return_string ;
}
这种短代码类似于一个HTML标签：
[ recent - posts posts = "5" ] This is the list heading [ / recent - posts ]
除了文章列表多了一个标题，其余的内容和上一个示例是一样的：
13153252_9LLG
3. 在任何地方显示短代码
3.1 在侧边栏小工具中使用短代码
默认情况下，侧边栏小工具是忽略短代码的，实例如下：
[ recent - posts posts = "5" ]
如果你把这段代码放在小工具里的时候，你将看到类似下面的结果
13153253_8dDu
我们可以通过一行代码来启用这个函数，为了使侧边栏小工具支持短代码，添加如下的代码：
add_filter ( 'widget_text' , 'do_shortcode' ) ;
现在不需要修改其他任何地方，刷新一下页面看看，侧边栏将会正确的显示：
13153253_9GQ9
同样的，在评论中启用短代码：
add_filter ( 'comment_text' , 'do_shortcode' ) ;
在摘要中启用短代码：
add_filter ( 'the_excerpt' , 'do_shortcode' ) ;
4. TinyMCE编辑器增加短代码按钮
虽然短代码可以方便的为文章添加动态内容，但是这对于普通用户来说可能还是有点复杂，尤其是当参数比较多的时候。大多数用户对于类HTML代码并不熟悉，然而要使用短代码，他们必须记住具体的语法与参数，因为即使是一个小小的语法错误，都可能导致意想不到的结果。
要解决这个，我们可以给 TinyMCE编辑器增加一个按钮，使用户可以通过简单的单击来增加短代码。创建这个按钮仅需两个步骤：
1. 为这个按钮创建一个JS文件
2. 注册按钮与JS文件
4.1 通过JS文件创建按钮
JS文件是通过 TinyMCE API 来注册 TinyMCE 插件的。我们在主题的 js 文件夹下创建 recent-posts.js ，并贴进去下面的代码（需要把图片文件也放在这里）：
( function ( ) {
tinymce . create ( 'tinymce.plugins.recentposts' , {
init : function ( ed , url ) {
ed . addButton ( 'recentposts' , {
title : 'Recent posts' ,
image : url + '/recentpostsbutton.png' ,
onclick : function ( ) {
var posts = prompt ( "调用文章数量" , "1" ) ;
var text = prompt ( "列表标题" , "这里是文章列表标题" ) ;
if ( text != null && text != '' ) {
if ( posts != null && posts != '' )
ed . execCommand ( 'mceInsertContent' , false , '[recent-posts posts="' +posts + '"]' + text + '[/recent-posts]' ) ;
else
ed . execCommand ( 'mceInsertContent' , false , '[recent-posts]' + text +'[/recent-posts]' ) ;
}
else {
if ( posts != null && posts != '' )
ed . execCommand ( 'mceInsertContent' , false , '[recent-posts posts="' +posts + '"]' ) ;
else
ed . execCommand ( 'mceInsertContent' , false , '[recent-posts]' ) ;
}
}
} ) ;
} ,
createControl : function ( n , cm ) {
return null ;
} ,
getInfo : function ( ) {
return {
longname : "Recent Posts" ,
author : 'Specs' ,
authorurl : 'http://9iphp.com' ,
infourl : 'http://9iphp.com/opensystem/wordpress/1094.html' ,
version : "1.0"
} ;
}
} ) ;
tinymce . PluginManager . add ( 'recentposts' , tinymce . plugins . recentposts ) ;
} ) ( ) ;
如下图所示，我们通过调用 tinymce.create() 创建了一个插件。代码中最重要的是 init() 函数，我们定义了一个名字，一个图标文件及 onclick() 事件处理程序。
在 onclick() 函数的前两行，弹出两个对话框让用户输入调用文章数量及列表标题两个参数，然后根据用户输入，把生成的短代码插入到编辑器中。
最后，TinyMCE插件通过 add() 函数添加到 PluginManager。现在我们已经成功的整合了 [recent-posts] 短代码到Wordpress中。
4.2 注册按钮及TinyMCE插件
创建完 JS 文件后，我们现在需要注册它和短代码按钮。所以我们创建两个函数并把它们绑定到合适的Wordpress过滤器中。
第一个叫做 register_button() 的函数把短代码添加到按钮数组中，在现有按钮和新按钮之间添加分割线。
function register_button ( $buttons ) {
array_push ( $buttons , "|" , "recentposts" ) ;
return $buttons ;
}
第二个函数 add_plugin() 指出JS文件的路径及文件名。
function add_plugin ( $plugin_array ) {
$plugin_array [ 'recentposts' ] = get_template_directory_uri ( ) . '/js/recent-posts.js' ;
return $plugin_array ;
}
下一步是添加包含前面两个函数的过滤器。register_button() 函数绑定到 mce_buttons 过滤器，这个会在编辑器加载插件的时候执行； add_plugin() 函数绑定到 mce_external_plugins 过滤器，当加载按钮的时候执行。
function my_recent_posts_button ( ) {
if ( ! current_user_can ( 'edit_posts' ) && ! current_user_can ( 'edit_pages' ) ) {
return ;
}
if ( get_user_option ( 'rich_editing' ) == 'true' ) {
add_filter ( 'mce_external_plugins' , 'add_plugin' ) ;
add_filter ( 'mce_buttons' , 'register_button' ) ;
}
}
当用户没有对文章在可视化编辑器中编辑的权限时，前面的函数不会执行。
最后把函数勾到Wordpress初始化函数
add_action ( 'init' , 'my_recent_posts_button' ) ;
4.3 按钮用法
为了检测代码是否正确，我们打开一篇新的文章，这时一个我们刚刚定义的按钮是不是已经出现在第一行的末尾了？如下图所示：
13153253_gj8a
点击按钮的时候，会弹出对话框让我们输入调用文章的数量：
13153253_Lm3e
输入完点击确定后，会弹出第二个对话框，让我们输入列表的标题：
13153254_lHhi
参数留空的话，不会出现在最后的代码中。最后，短代码会添加到编辑器中：
13153254_tfqq
资料来源：http://9iphp.com/opensystem/wordpress/1094.html
03
WordPress文章内链短代码以及WordPress短代码完全指南
分享到： | {
"url": "http://blog.epinv.com/post/817.html",
"source_domain": "blog.epinv.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "34770",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DCDBX5SRYZQOA3SZVCADBCMXLUIMYAF5",
"WARC-Concurrent-To": "<urn:uuid:a46540ce-be5f-4216-a950-9fac522cc210>",
"WARC-Date": "2018-06-25T12:10:14Z",
"WARC-IP-Address": "115.29.200.152",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:QBWYJUXTXOGS72JOKZDX4F76ZK3MQNAC",
"WARC-Record-ID": "<urn:uuid:439dae40-4669-4271-b468-f62bedc6fb5e>",
"WARC-Target-URI": "http://blog.epinv.com/post/817.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7abf4638-bf36-4b85-a0cb-e63a0b167dcf>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-144-111-253.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
62,
63,
98,
99,
139,
140,
162,
163,
215,
251,
252,
272,
273,
280,
299,
317,
336,
372,
431,
477,
510,
884,
890,
915,
936,
938,
990,
991,
1072,
1073,
1122,
1123,
1199,
1200,
1238,
1239,
1272,
1273,
1324,
1325,
1344,
1345,
1376,
1377,
1408,
1409,
1432,
1433,
1499,
1500,
1510,
1511,
1537,
1538,
1557,
1558,
1589,
1590,
1630,
1654,
1687,
1688,
1758,
1759,
1770,
1771,
1827,
1828,
1865,
1866,
1956,
1957,
1981,
1982,
2024,
2025,
2112,
2113,
2124,
2125,
2133,
2134,
2155,
2156,
2180,
2181,
2183,
2184,
2250,
2251,
2261,
2262,
2290,
2291,
2326,
2327,
2388,
2389,
2391,
2392,
2481,
2482,
2506,
2507,
2570,
2571,
2619,
2620,
2630,
2631,
2705,
2706,
2725,
2726,
2763,
2764,
2778,
2779,
2788,
2789,
2799,
2800,
2886,
2887,
3007,
3008,
3083,
3084,
3127,
3128,
3163,
3164,
3180,
3181,
3197,
3198,
3224,
3225,
3320,
3321,
3345,
3346,
3388,
3389,
3486,
3487,
3498,
3499,
3507,
3508,
3537,
3538,
3559,
3560,
3584,
3585,
3587,
3588,
3656,
3657,
3688,
3689,
3713,
3714,
3728,
3729,
3742,
3743,
3854,
3855,
3916,
3917,
3952,
3953,
3969,
3970,
3986,
3987,
4034,
4035,
4063,
4064,
4159,
4160,
4184,
4185,
4227,
4228,
4325,
4326,
4337,
4338,
4346,
4347,
4376,
4377,
4398,
4399,
4423,
4424,
4426,
4427,
4445,
4446,
4523,
4524,
4554,
4555,
4569,
4570,
4584,
4585,
4603,
4604,
4630,
4631,
4662,
4663,
4693,
4694,
4708,
4709,
4751,
4752,
4800,
4801,
4836,
4837,
4851,
4852,
4867,
4868,
4917,
4918,
4929,
4930,
4978,
4979,
5000,
5001,
5126,
5127,
5189,
5190,
5209,
5224,
5239,
5240,
5335,
5336,
5353,
5354,
5407,
5408,
5439,
5440,
5475,
5476,
5501,
5502,
5543,
5544,
5569,
5570,
5610,
5611,
5656,
5657,
5693,
5694,
5730,
5731,
5848,
5849,
5854,
5855,
5950,
5951,
5953,
5954,
5961,
5962,
5998,
5999,
6089,
6090,
6095,
6096,
6165,
6166,
6168,
6169,
6171,
6172,
6178,
6179,
6183,
6184,
6222,
6223,
6237,
6238,
6242,
6243,
6268,
6269,
6278,
6279,
6307,
6308,
6327,
6328,
6361,
6362,
6424,
6425,
6441,
6442,
6446,
6447,
6449,
6450,
6456,
6457,
6541,
6542,
6552,
6553,
6646,
6647,
6719,
6720,
6805,
6806,
6825,
6826,
6888,
6889,
6947,
6948,
6988,
6989,
7037,
7038,
7056,
7057,
7059,
7060,
7094,
7095,
7135,
7136,
7227,
7228,
7251,
7252,
7254,
7255,
7388,
7389,
7427,
7428,
7512,
7513,
7522,
7523,
7525,
7526,
7580,
7581,
7636,
7637,
7688,
7689,
7691,
7692,
7694,
7695,
7729,
7730,
7752,
7753,
7804,
7805,
7814,
7815,
7873,
7874,
7888,
7889,
7917,
7918,
7932,
7933,
7964,
7965,
7979,
7980,
8015,
8016,
8018,
8019,
8033,
8034,
8087,
8088,
8090,
8091,
8094,
8095,
8130,
8131
],
"line_end_idx": [
62,
63,
98,
99,
139,
140,
162,
163,
215,
251,
252,
272,
273,
280,
299,
317,
336,
372,
431,
477,
510,
884,
890,
915,
936,
938,
990,
991,
1072,
1073,
1122,
1123,
1199,
1200,
1238,
1239,
1272,
1273,
1324,
1325,
1344,
1345,
1376,
1377,
1408,
1409,
1432,
1433,
1499,
1500,
1510,
1511,
1537,
1538,
1557,
1558,
1589,
1590,
1630,
1654,
1687,
1688,
1758,
1759,
1770,
1771,
1827,
1828,
1865,
1866,
1956,
1957,
1981,
1982,
2024,
2025,
2112,
2113,
2124,
2125,
2133,
2134,
2155,
2156,
2180,
2181,
2183,
2184,
2250,
2251,
2261,
2262,
2290,
2291,
2326,
2327,
2388,
2389,
2391,
2392,
2481,
2482,
2506,
2507,
2570,
2571,
2619,
2620,
2630,
2631,
2705,
2706,
2725,
2726,
2763,
2764,
2778,
2779,
2788,
2789,
2799,
2800,
2886,
2887,
3007,
3008,
3083,
3084,
3127,
3128,
3163,
3164,
3180,
3181,
3197,
3198,
3224,
3225,
3320,
3321,
3345,
3346,
3388,
3389,
3486,
3487,
3498,
3499,
3507,
3508,
3537,
3538,
3559,
3560,
3584,
3585,
3587,
3588,
3656,
3657,
3688,
3689,
3713,
3714,
3728,
3729,
3742,
3743,
3854,
3855,
3916,
3917,
3952,
3953,
3969,
3970,
3986,
3987,
4034,
4035,
4063,
4064,
4159,
4160,
4184,
4185,
4227,
4228,
4325,
4326,
4337,
4338,
4346,
4347,
4376,
4377,
4398,
4399,
4423,
4424,
4426,
4427,
4445,
4446,
4523,
4524,
4554,
4555,
4569,
4570,
4584,
4585,
4603,
4604,
4630,
4631,
4662,
4663,
4693,
4694,
4708,
4709,
4751,
4752,
4800,
4801,
4836,
4837,
4851,
4852,
4867,
4868,
4917,
4918,
4929,
4930,
4978,
4979,
5000,
5001,
5126,
5127,
5189,
5190,
5209,
5224,
5239,
5240,
5335,
5336,
5353,
5354,
5407,
5408,
5439,
5440,
5475,
5476,
5501,
5502,
5543,
5544,
5569,
5570,
5610,
5611,
5656,
5657,
5693,
5694,
5730,
5731,
5848,
5849,
5854,
5855,
5950,
5951,
5953,
5954,
5961,
5962,
5998,
5999,
6089,
6090,
6095,
6096,
6165,
6166,
6168,
6169,
6171,
6172,
6178,
6179,
6183,
6184,
6222,
6223,
6237,
6238,
6242,
6243,
6268,
6269,
6278,
6279,
6307,
6308,
6327,
6328,
6361,
6362,
6424,
6425,
6441,
6442,
6446,
6447,
6449,
6450,
6456,
6457,
6541,
6542,
6552,
6553,
6646,
6647,
6719,
6720,
6805,
6806,
6825,
6826,
6888,
6889,
6947,
6948,
6988,
6989,
7037,
7038,
7056,
7057,
7059,
7060,
7094,
7095,
7135,
7136,
7227,
7228,
7251,
7252,
7254,
7255,
7388,
7389,
7427,
7428,
7512,
7513,
7522,
7523,
7525,
7526,
7580,
7581,
7636,
7637,
7688,
7689,
7691,
7692,
7694,
7695,
7729,
7730,
7752,
7753,
7804,
7805,
7814,
7815,
7873,
7874,
7888,
7889,
7917,
7918,
7932,
7933,
7964,
7965,
7979,
7980,
8015,
8016,
8018,
8019,
8033,
8034,
8087,
8088,
8090,
8091,
8094,
8095,
8130,
8131,
8135
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8135,
"ccnet_original_nlines": 412,
"rps_doc_curly_bracket": 0.005162879824638367,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.01996476948261261,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012918380089104176,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7163828611373901,
"rps_doc_frac_unique_words": 0.5184466242790222,
"rps_doc_mean_word_length": 11.124271392822266,
"rps_doc_num_sentences": 79,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.162050724029541,
"rps_doc_word_count": 515,
"rps_doc_frac_chars_dupe_10grams": 0.09355908632278442,
"rps_doc_frac_chars_dupe_5grams": 0.1499389111995697,
"rps_doc_frac_chars_dupe_6grams": 0.1499389111995697,
"rps_doc_frac_chars_dupe_7grams": 0.11555244773626328,
"rps_doc_frac_chars_dupe_8grams": 0.09355908632278442,
"rps_doc_frac_chars_dupe_9grams": 0.09355908632278442,
"rps_doc_frac_chars_top_2gram": 0.02304067090153694,
"rps_doc_frac_chars_top_3gram": 0.013964040204882622,
"rps_doc_frac_chars_top_4gram": 0.014836800284683704,
"rps_doc_books_importance": -917.0257568359375,
"rps_doc_books_importance_length_correction": -917.0257568359375,
"rps_doc_openwebtext_importance": -589.986572265625,
"rps_doc_openwebtext_importance_length_correction": -589.986572265625,
"rps_doc_wikipedia_importance": -627.8553466796875,
"rps_doc_wikipedia_importance_length_correction": -627.8553466796875
},
"fasttext": {
"dclm": 0.37923485040664673,
"english": 0.0243260208517313,
"fineweb_edu_approx": 1.0034586191177368,
"eai_general_math": 0.23688900470733643,
"eai_open_web_math": 0.3935295343399048,
"eai_web_code": 0.7502396702766418
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.87",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-2,072,636,740,854,315,500 | Semantyka zapytań o wartości null
Wprowadzenie
SQL baz danych działają na 3-wartościowej logice ( , , ) podczas wykonywania porównań, w przeciwieństwie do logiki logicznych truefalse języka null C#. Podczas tłumaczenia zapytań LINQ na SQL EF Core kompensować różnicę przez wprowadzenie dodatkowych kontroli wartości null dla niektórych elementów zapytania. Aby to zilustrować, zdefiniujmy następującą jednostkę:
public class NullSemanticsEntity
{
public int Id { get; set; }
public int Int { get; set; }
public int? NullableInt { get; set; }
public string String1 { get; set; }
public string String2 { get; set; }
}
i wyedytuj kilka zapytań:
var query1 = context.Entities.Where(e => e.Id == e.Int);
var query2 = context.Entities.Where(e => e.Id == e.NullableInt);
var query3 = context.Entities.Where(e => e.Id != e.NullableInt);
var query4 = context.Entities.Where(e => e.String1 == e.String2);
var query5 = context.Entities.Where(e => e.String1 != e.String2);
Pierwsze dwa zapytania dają proste porównania. W pierwszym zapytaniu obie kolumny nie mogą dopuszczać wartości null, więc sprawdzanie wartości null nie jest wymagane. W drugim zapytaniu wartość może zawierać wartość , ale nie może mieć wartości null; w porównaniu z wartościami innymi niż null daje wynik, który zostałby odfiltrowany NullableIntnull według IdnullnullWHERE operacji. Dlatego nie są wymagane żadne dodatkowe terminy.
SELECT [e].[Id], [e].[Int], [e].[NullableInt], [e].[String1], [e].[String2]
FROM [Entities] AS [e]
WHERE [e].[Id] = [e].[Int]
SELECT [e].[Id], [e].[Int], [e].[NullableInt], [e].[String1], [e].[String2]
FROM [Entities] AS [e]
WHERE [e].[Id] = [e].[NullableInt]
Trzecie zapytanie wprowadza sprawdzanie wartości null. Kiedy NullableInt to porównanie daje , który nullId <> NullableIntnull zostałby odfiltrowany według WHERE operacji. Jednak z perspektywy logiki logicznych ten przypadek powinien zostać zwrócony jako część wyniku. W EF Core dodaje niezbędne sprawdzanie, aby to zapewnić.
SELECT [e].[Id], [e].[Int], [e].[NullableInt], [e].[String1], [e].[String2]
FROM [Entities] AS [e]
WHERE ([e].[Id] <> [e].[NullableInt]) OR [e].[NullableInt] IS NULL
Zapytania cztery i pięć pokazują wzorzec, gdy obie kolumny mogą dopuszczać wartość null. Warto zauważyć, że operacja generuje bardziej <> skomplikowane (i potencjalnie wolniejsze) zapytanie niż == operacja.
SELECT [e].[Id], [e].[Int], [e].[NullableInt], [e].[String1], [e].[String2]
FROM [Entities] AS [e]
WHERE ([e].[String1] = [e].[String2]) OR ([e].[String1] IS NULL AND [e].[String2] IS NULL)
SELECT [e].[Id], [e].[Int], [e].[NullableInt], [e].[String1], [e].[String2]
FROM [Entities] AS [e]
WHERE (([e].[String1] <> [e].[String2]) OR ([e].[String1] IS NULL OR [e].[String2] IS NULL)) AND ([e].[String1] IS NOT NULL OR [e].[String2] IS NOT NULL)
Traktowanie wartości dopuszczanych do wartości null w funkcjach
Wiele funkcji w SQL może zwrócić wynik tylko wtedy, null gdy niektóre z ich argumentów to null . EF Core z tego rozwiązania, aby tworzyć bardziej wydajne zapytania. Poniższe zapytanie ilustruje optymalizację:
var query = context.Entities.Where(e => e.String1.Substring(0, e.String2.Length) == null);
Wygenerowana SQL jest następująca (nie musimy oceniać funkcji, ponieważ będzie ona mieć wartość null tylko wtedy, gdy jeden z argumentów tej funkcji SUBSTRING ma wartość null):
SELECT [e].[Id], [e].[Int], [e].[NullableInt], [e].[String1], [e].[String2]
FROM [Entities] AS [e]
WHERE [e].[String1] IS NULL OR [e].[String2] IS NULL
Optymalizacja może być również używana dla funkcji zdefiniowanych przez użytkownika. Aby uzyskać więcej informacji, zobacz stronę mapowania funkcji zdefiniowanych przez użytkownika.
Pisanie zapytań o performantach
• Porównywanie kolumn, które nie dopuszczają wartości null, jest prostsze i szybsze niż porównywanie kolumn dopuszczających wartość null. Jeśli to możliwe, należy rozważyć oznaczenie kolumn jako nienadajnych do wartości null.
• Sprawdzanie równości ( ) jest prostsze i szybsze niż sprawdzanie braku równości ( ), ponieważ zapytanie nie musi rozróżniać ==!= wyników i nullfalse . Używaj porównania równości zawsze, gdy jest to możliwe. Jednak po prostu negacja porównania jest w praktyce taka sama jak , więc nie ==!= spowoduje poprawy wydajności.
• W niektórych przypadkach można uprościć złożone porównanie przez jawne odfiltrowanie wartości z kolumny — na przykład gdy nie ma żadnych wartości lub te wartości nie są istotne nullnull w wyniku. Rozpatrzmy następujący przykład:
var query1 = context.Entities.Where(e => e.String1 != e.String2 || e.String1.Length == e.String2.Length);
var query2 = context.Entities.Where(
e => e.String1 != null && e.String2 != null && (e.String1 != e.String2 || e.String1.Length == e.String2.Length));
Te zapytania dają następujące SQL:
SELECT [e].[Id], [e].[Int], [e].[NullableInt], [e].[String1], [e].[String2]
FROM [Entities] AS [e]
WHERE ((([e].[String1] <> [e].[String2]) OR ([e].[String1] IS NULL OR [e].[String2] IS NULL)) AND ([e].[String1] IS NOT NULL OR [e].[String2] IS NOT NULL)) OR ((CAST(LEN([e].[String1]) AS int) = CAST(LEN([e].[String2]) AS int)) OR ([e].[String1] IS NULL AND [e].[String2] IS NULL))
SELECT [e].[Id], [e].[Int], [e].[NullableInt], [e].[String1], [e].[String2]
FROM [Entities] AS [e]
WHERE ([e].[String1] IS NOT NULL AND [e].[String2] IS NOT NULL) AND (([e].[String1] <> [e].[String2]) OR (CAST(LEN([e].[String1]) AS int) = CAST(LEN([e].[String2]) AS int)))
W drugim zapytaniu null wyniki są jawnie filtrowane z String1 kolumny. EF Core można bezpiecznie traktować kolumnę jako nienadajną do wartości null podczas String1 porównywania, co spowoduje prostsze zapytanie.
Korzystanie z semantyki relacyjnej wartości null
Można wyłączyć kompensaty porównania wartości null i bezpośrednio korzystać z relacyjnej semantyki wartości null. Można to zrobić, wywołując UseRelationalNulls(true) metodę w konstruktorze opcji wewnątrz OnConfiguring metody :
new SqlServerDbContextOptionsBuilder(optionsBuilder).UseRelationalNulls();
Ostrzeżenie
W przypadku korzystania z semantyki relacyjnej wartości null zapytania LINQ nie mają już tego samego znaczenia, co w języku C#, i mogą zwracać inne wyniki niż oczekiwano. Podczas korzystania z tego trybu należy zachować ostrożność. | {
"url": "https://docs.microsoft.com/pl-pl/ef/core/querying/null-comparisons",
"source_domain": "docs.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "40095",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6WZJWWYJXU6FDF62Y2YQEDIL75Z4FBSL",
"WARC-Concurrent-To": "<urn:uuid:a4564559-621c-42d6-a941-fc3edaeda436>",
"WARC-Date": "2022-01-26T22:04:25Z",
"WARC-IP-Address": "23.208.54.245",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KH6ZRVYHRJU23V6E5IBRQJHIXZ6KH4RU",
"WARC-Record-ID": "<urn:uuid:ce2d28f7-5ccc-40be-b7dc-e856504f46b5>",
"WARC-Target-URI": "https://docs.microsoft.com/pl-pl/ef/core/querying/null-comparisons",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c433c708-722e-4f35-a933-a19fb5bfb728>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-184\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
34,
35,
48,
49,
414,
415,
448,
450,
482,
515,
557,
597,
637,
639,
640,
666,
667,
724,
789,
854,
920,
986,
987,
1419,
1420,
1496,
1519,
1546,
1547,
1623,
1646,
1681,
1682,
2007,
2008,
2084,
2107,
2174,
2175,
2382,
2383,
2459,
2482,
2573,
2574,
2650,
2673,
2827,
2828,
2892,
2893,
3102,
3103,
3194,
3195,
3372,
3373,
3449,
3472,
3525,
3526,
3708,
3709,
3741,
3742,
3970,
3971,
4294,
4295,
4528,
4529,
4635,
4672,
4790,
4791,
4826,
4827,
4903,
4926,
5208,
5209,
5285,
5308,
5482,
5483,
5694,
5695,
5744,
5745,
5972,
5973,
6048,
6049,
6061,
6062
],
"line_end_idx": [
34,
35,
48,
49,
414,
415,
448,
450,
482,
515,
557,
597,
637,
639,
640,
666,
667,
724,
789,
854,
920,
986,
987,
1419,
1420,
1496,
1519,
1546,
1547,
1623,
1646,
1681,
1682,
2007,
2008,
2084,
2107,
2174,
2175,
2382,
2383,
2459,
2482,
2573,
2574,
2650,
2673,
2827,
2828,
2892,
2893,
3102,
3103,
3194,
3195,
3372,
3373,
3449,
3472,
3525,
3526,
3708,
3709,
3741,
3742,
3970,
3971,
4294,
4295,
4528,
4529,
4635,
4672,
4790,
4791,
4826,
4827,
4903,
4926,
5208,
5209,
5285,
5308,
5482,
5483,
5694,
5695,
5744,
5745,
5972,
5973,
6048,
6049,
6061,
6062,
6293
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6293,
"ccnet_original_nlines": 95,
"rps_doc_curly_bracket": 0.0019068799447268248,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11751825362443924,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0897810235619545,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.35620439052581787,
"rps_doc_frac_unique_words": 0.3898531496524811,
"rps_doc_mean_word_length": 6.457943916320801,
"rps_doc_num_sentences": 156,
"rps_doc_symbol_to_word_ratio": 0.0014598499983549118,
"rps_doc_unigram_entropy": 5.096395969390869,
"rps_doc_word_count": 749,
"rps_doc_frac_chars_dupe_10grams": 0.16559851169586182,
"rps_doc_frac_chars_dupe_5grams": 0.21066777408123016,
"rps_doc_frac_chars_dupe_6grams": 0.18709944188594818,
"rps_doc_frac_chars_dupe_7grams": 0.18709944188594818,
"rps_doc_frac_chars_dupe_8grams": 0.16559851169586182,
"rps_doc_frac_chars_dupe_9grams": 0.16559851169586182,
"rps_doc_frac_chars_top_2gram": 0.05292537063360214,
"rps_doc_frac_chars_top_3gram": 0.021500930190086365,
"rps_doc_frac_chars_top_4gram": 0.041347939521074295,
"rps_doc_books_importance": -632.9851684570312,
"rps_doc_books_importance_length_correction": -632.9851684570312,
"rps_doc_openwebtext_importance": -304.0428466796875,
"rps_doc_openwebtext_importance_length_correction": -304.0428466796875,
"rps_doc_wikipedia_importance": -260.6723937988281,
"rps_doc_wikipedia_importance_length_correction": -260.6723937988281
},
"fasttext": {
"dclm": 0.656740128993988,
"english": 0.006581369787454605,
"fineweb_edu_approx": 1.7524726390838623,
"eai_general_math": 0.0011166899930685759,
"eai_open_web_math": 0.2592851519584656,
"eai_web_code": 0.9738733172416687
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-770,095,174,012,383,900 | 4
Context
I work in the energy domain with devices that send data in clear text over some medium, that finally ends on a computer. The data is there decoded and stored in XML files.
A current XML file storing data for a device looks like this at the moment:
<Device>
<Address>1234</Address>
<SomeOtherParam />
<Data>
<Record>
<Key name="Energy" ... />
<Value unit="kWh">42.56</Value>
</Record>
<Record>
<Key name="Volume" ... />
<Value unit="m3">2.317</Value>
</Record>
...
</Data>
</Device>
Change
Now, with the emergence of IoT, new devices must send some parts of their data encrypted (some parts can still remain unencrypted though). When the data reaches the computer, it's possible (but not mandatory) that the data is still encrypted and could not be decrypted at this moment. However, I still need to save it in XML for a further decryption but the actual XML structure wasn't designed to store encrypted data.
Imagined solutions
Solution 1
<Data>
<Record>
<Key name="Volume" ... />
<Value unit="m3">2.317</Value>
</Record>
...
<EncryptedRecords>4F2B8678...</EncryptedRecords>
</Data>
Solution 2
<Data>
<Decrypted>
<Record>
<Key name="Volume" ... />
<Value unit="m3">2.317</Value>
</Record>
...
</Decrypted>
<Encrypted>
???
</Encrypted>
</Data>
Solution 3
<Data>
<Record>
<Key name="Volume" ... />
<Value unit="m3">2.317</Value>
</Record>
...
</Data>
<EncryptedData>
???
</EncryptedData>
Personal thoughts
• Solution 1: could provide a minimalist working solution
• Solution 2: could possibly break backward-compatibility
• Solution 3: what should replace ??? ?
Question
What would be the ideal evolution of the XML's structure to store the encrypted data (keep in mind that I need to keep backward-compatibility) ?
I also found that the W3C has already published a recommendation long time ago. Should I stick to this instead ? Basically, it means ??? of solution 3 could be filled with a recommended structure.
Precision: these XML files are manipulated with JAXB. If JAXB has any facilitation with encryption, it could be an advantage if the new XML structure is directly supported.
2
• 2
What specifically is your requirement however? If it merely needs to be encrypted on transport, then you could potentially solve this problem with few application changes. Otherwise if the data must be encrypted on the device and/or stored in a backend system in an encrypted manner then it certainly becomes more complicated. Furthermore, how is this data being transported? What protocol and medium is being used? – maple_shaft Mar 18 '16 at 13:27
• Encryption without authentication is useless. XML encryption is tricky. Please have a look at IT Security SE for leads. – Deer Hunter Mar 20 '16 at 17:30
1
One possible suggestion: Add an attribute to any XML tag.
<Record Encrypted="true">ABNSDJDFGHD</Record>
Then when reading you can still read the tag and based on the attribute call an additional function to decrypt the data. The Encrypted attribute could be added to any tag. Your current XML structure would remain the same.
2
• 1
For more general use, I would suggest instead an encryptedWith attribute that could identify the encryption type. You could use values like "AES" or "Blowfish", or internal identifiers if you don't want to identify the algorithm used. – TMN Mar 18 '16 at 13:55
• The problem is that records aren't encrypted one by one but as a whole. Therefore I could only store one encrypted block containing many records, which is semantically speaking different from a single record. – Spotted Mar 18 '16 at 14:00
1
My suggestion based on your description that your device is using Wireless Meter Bus over radio that a simple solution involving secure transport is probably going to be more trouble than it is worth. It appears that in M-Bus (being wholly unfamiliar with it mind you) that it is flexible such that you could feasibly define your own Transport layer thus implementing something like Transmission Control Protocol is TECHNICALLY feasible. I have no idea if this even exists however and it certainly wouldn't be worth implementing all of that just to use something readily available like SSL certificates and handshakes to make sure data is sent securely from client to device.
You mention that you are using JAXB so I assume you have a Java program that can marshall, unmarshall XML via annotations. The Jasypt Framework integrates nicely with JAXB to achieve encryption and decryption of specific fields through the use of adapters.
To be honest though, I am surprised that your device is not only running Java, but has enough computing resources to handle an operating system, the overhead of large Java frameworks like JAXB, and can afford to communicate in verbose XML data. My answer fully assumes that both the device sending the data, as well as the device receiving the data are both running Java programs with sufficient computing resources available to them in an OS that is capable of this.
11
• The device isn't running Java (the firmware is basically written in C), but it isn't the point of interest of my question. The problem I have is on the "server" side, which is a Java program that should handle (decode, decrypt, store, etc.) incoming data from many of these devices. – Spotted Mar 18 '16 at 14:03
• My answer doesn't fundamentally change then. You can still use JAXB with Jasypt to decrypt any fields that are encrypted. I am still confused though as to HOW the data fields are being encrypted? The device firmware would have to be updated to use encryption keys to encrypt the data. Those keys would need to be available on the Java program to decrypt the data. – maple_shaft Mar 18 '16 at 14:12
• Indeed, the firmware knows the key to encrypt the data. But the key is not always known by the Java program. In this case the best I could do is to store the data encrypted. My problem is more: What's the best way to store the encrypted data in xml ? rather than How to decrypt the encrypted data from an xml ? – Spotted Mar 18 '16 at 14:19
• By the way, thank you for having mentionned Jasypt Framework. This could be helpful for me in the future. – Spotted Mar 18 '16 at 14:30
• @Spotted Just store it as is :) You probably want to make sure you have some way to identify the record to a specific device, or else you may not know how to retrieve the decryption key at a later date. There is no problem to store an XML document in a database that has encrypted fields as long as you have some uniquely identifiable fields in that record that can link it directly or indirectly to a specific device or encryption key – maple_shaft Mar 18 '16 at 14:38
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "https://softwareengineering.stackexchange.com/questions/313132/store-encrypted-data-in-xml",
"source_domain": "softwareengineering.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "188414",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HLH4WKVD6D73XHJYYCO66CRVILHGDSNA",
"WARC-Concurrent-To": "<urn:uuid:75bf0b4f-2b38-49a3-be3d-9b31e74401ef>",
"WARC-Date": "2021-05-06T16:46:24Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XMB7RV2HU2EWMN7I5FB7R3J432EILIUB",
"WARC-Record-ID": "<urn:uuid:ad643b3f-c6ce-4475-8871-70ae62f7d9e4>",
"WARC-Target-URI": "https://softwareengineering.stackexchange.com/questions/313132/store-encrypted-data-in-xml",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9ab7c145-bdf5-434e-aea9-581bcf22bbfd>"
},
"warc_info": "isPartOf: CC-MAIN-2021-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-87.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
3,
11,
12,
184,
185,
261,
262,
271,
299,
322,
333,
350,
388,
432,
450,
467,
505,
548,
566,
578,
590,
600,
601,
608,
609,
1029,
1030,
1049,
1050,
1061,
1062,
1069,
1082,
1116,
1155,
1169,
1177,
1230,
1238,
1239,
1250,
1251,
1258,
1274,
1291,
1329,
1372,
1390,
1402,
1419,
1435,
1447,
1464,
1472,
1473,
1484,
1485,
1492,
1505,
1539,
1578,
1592,
1600,
1608,
1624,
1632,
1649,
1650,
1668,
1669,
1729,
1789,
1831,
1832,
1841,
1842,
1987,
1988,
2185,
2186,
2359,
2360,
2362,
2368,
2822,
2980,
2982,
2983,
3041,
3042,
3088,
3089,
3311,
3312,
3314,
3320,
3585,
3828,
3830,
3831,
4507,
4508,
4765,
4766,
5234,
5235,
5238,
5555,
5957,
6302,
6442,
6916,
6917,
6929,
6930,
7030,
7031
],
"line_end_idx": [
2,
3,
11,
12,
184,
185,
261,
262,
271,
299,
322,
333,
350,
388,
432,
450,
467,
505,
548,
566,
578,
590,
600,
601,
608,
609,
1029,
1030,
1049,
1050,
1061,
1062,
1069,
1082,
1116,
1155,
1169,
1177,
1230,
1238,
1239,
1250,
1251,
1258,
1274,
1291,
1329,
1372,
1390,
1402,
1419,
1435,
1447,
1464,
1472,
1473,
1484,
1485,
1492,
1505,
1539,
1578,
1592,
1600,
1608,
1624,
1632,
1649,
1650,
1668,
1669,
1729,
1789,
1831,
1832,
1841,
1842,
1987,
1988,
2185,
2186,
2359,
2360,
2362,
2368,
2822,
2980,
2982,
2983,
3041,
3042,
3088,
3089,
3311,
3312,
3314,
3320,
3585,
3828,
3830,
3831,
4507,
4508,
4765,
4766,
5234,
5235,
5238,
5555,
5957,
6302,
6442,
6916,
6917,
6929,
6930,
7030,
7031,
7121
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7121,
"ccnet_original_nlines": 118,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36652836203575134,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03181188926100731,
"rps_doc_frac_lines_end_with_ellipsis": 0.033613450825214386,
"rps_doc_frac_no_alph_words": 0.24273858964443207,
"rps_doc_frac_unique_words": 0.3600713014602661,
"rps_doc_mean_word_length": 4.745098114013672,
"rps_doc_num_sentences": 71,
"rps_doc_symbol_to_word_ratio": 0.006915629841387272,
"rps_doc_unigram_entropy": 5.341383934020996,
"rps_doc_word_count": 1122,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07663410902023315,
"rps_doc_frac_chars_dupe_6grams": 0.060856498777866364,
"rps_doc_frac_chars_dupe_7grams": 0.028362130746245384,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01577761024236679,
"rps_doc_frac_chars_top_3gram": 0.010518410243093967,
"rps_doc_frac_chars_top_4gram": 0.01352366991341114,
"rps_doc_books_importance": -695.2666015625,
"rps_doc_books_importance_length_correction": -695.2666015625,
"rps_doc_openwebtext_importance": -418.3089294433594,
"rps_doc_openwebtext_importance_length_correction": -418.3089294433594,
"rps_doc_wikipedia_importance": -391.44000244140625,
"rps_doc_wikipedia_importance_length_correction": -391.44000244140625
},
"fasttext": {
"dclm": 0.25725066661834717,
"english": 0.9189392328262329,
"fineweb_edu_approx": 2.0757017135620117,
"eai_general_math": 0.5764928460121155,
"eai_open_web_math": 0.13644027709960938,
"eai_web_code": 0.07926654815673828
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
1,000,740,760,962,259,700 | Une MAJ de sécurité est nécessaire sur notre version actuelle. Elle sera effectuée lundi 02/08 entre 12h30 et 13h. L'interruption de service devrait durer quelques minutes (probablement moins de 5 minutes).
Commit 5c3eeba2 authored by MARCHE Claude's avatar MARCHE Claude
Browse files
Jessie3, functions calls
parent 0a70222c
...@@ -395,6 +395,22 @@ let get_var v = ...@@ -395,6 +395,22 @@ let get_var v =
with Not_found -> with Not_found ->
Self.fatal "program variable %s (%d) not found" v.vname v.vid Self.fatal "program variable %s (%d) not found" v.vname v.vid
let program_funs = Hashtbl.create 257
let create_fun v =
let id = Ident.id_fresh v.vname in
let ty = ctype v.vtype in
Self.result "create program function %s (%d)" v.vname v.vid;
Hashtbl.add program_funs v.vid (id,ty);
(id,ty)
let get_fun v =
try
Hashtbl.find program_funs v.vid
with Not_found ->
Self.fatal "program function %s (%d) not found" v.vname v.vid
let logic_symbols = Hashtbl.create 257 let logic_symbols = Hashtbl.create 257
let create_lsymbol li = let create_lsymbol li =
...@@ -445,10 +461,12 @@ let rec term_node ~label t = ...@@ -445,10 +461,12 @@ let rec term_node ~label t =
| [] -> | [] ->
let ls = get_lsymbol li in let ls = get_lsymbol li in
let args = List.map (fun x -> let args = List.map (fun x ->
let ty,t = term ~label x in let _ty,t = term ~label x in
(*
Self.result "arg = %a, type = %a" Self.result "arg = %a, type = %a"
Cil_printer.pp_term x Cil_printer.pp_term x
Cil_printer.pp_logic_type ty; Cil_printer.pp_logic_type ty;
*)
t) args in t) args in
t_app ls args t_app ls args
| _ -> | _ ->
...@@ -928,6 +946,25 @@ and lval (host,offset) = ...@@ -928,6 +946,25 @@ and lval (host,offset) =
| Mem _, _ -> | Mem _, _ ->
Self.not_yet_implemented "lval Mem" Self.not_yet_implemented "lval Mem"
let functional_expr e =
match e.enode with
| Lval (Var v, NoOffset) ->
let _id,_ty = get_fun v in
assert false (* TODO Mlw_expr.e_arrow id *)
| Lval _
| Const _
| BinOp _
| SizeOf _
| SizeOfE _
| SizeOfStr _
| AlignOf _
| AlignOfE _
| UnOp (_, _, _)
| CastE (_, _)
| AddrOf _
| StartOf _
| Info (_, _)
-> Self.not_yet_implemented "functional_expr"
let assignment (lhost,offset) e _loc = let assignment (lhost,offset) e _loc =
match lhost,offset with match lhost,offset with
...@@ -949,8 +986,11 @@ let assignment (lhost,offset) e _loc = ...@@ -949,8 +986,11 @@ let assignment (lhost,offset) e _loc =
let instr i = let instr i =
match i with match i with
| Set(lv,e,loc) -> assignment lv e loc | Set(lv,e,loc) -> assignment lv e loc
| Call (_, _, _, _) -> | Call (None, _loc, _e, _el) ->
Self.not_yet_implemented "instr Call" Self.not_yet_implemented "instr Call None"
| Call (Some _lv, e, el, _loc) ->
let e = functional_expr e in
Mlw_expr.e_app e (List.map expr el)
| Asm (_, _, _, _, _, _) -> | Asm (_, _, _, _, _, _) ->
Self.not_yet_implemented "instr Asm" Self.not_yet_implemented "instr Asm"
| Skip _loc -> | Skip _loc ->
...@@ -1120,8 +1160,9 @@ let fundecl fdec = ...@@ -1120,8 +1160,9 @@ let fundecl fdec =
l_spec = spec; l_spec = spec;
} }
in in
let x,_ty = create_fun fun_id in
let def = let def =
Mlw_expr.create_fun_defn (Ident.id_fresh fun_id.vname) lambda Mlw_expr.create_fun_defn x lambda
in in
Mlw_decl.create_rec_decl [def] Mlw_decl.create_rec_decl [def]
......
...@@ -6,7 +6,7 @@ ...@@ -6,7 +6,7 @@
//@ logic integer sqr(integer x) = x * x; //@ logic integer sqr(integer x) = x * x;
/*@ requires x >= 0; /*@ requires x >= 0;
@ requires x <= 1000000000; // not avoid integer overflow @ requires x <= 1000000000; // to prevent integer overflow
@ ensures \result >= 0 && sqr(\result+0) <= x && x < sqr(\result + 1); @ ensures \result >= 0 && sqr(\result+0) <= x && x < sqr(\result + 1);
@*/ @*/
int isqrt(int x) { int isqrt(int x) {
...@@ -19,6 +19,7 @@ int isqrt(int x) { ...@@ -19,6 +19,7 @@ int isqrt(int x) {
} }
#if 0 #if 0
//@ ensures \result == 4; //@ ensures \result == 4;
int main () { int main () {
int r; int r;
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment | {
"url": "https://gitlab.inria.fr/why3/why3/-/commit/5c3eeba27643c00f5e8f956d2a36f9fb354313b0?view=parallel",
"source_domain": "gitlab.inria.fr",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "305245",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DMJM5SMQM6UZDACA33Q5EITGDS72CE5Z",
"WARC-Concurrent-To": "<urn:uuid:2ed7feb4-ae93-4869-a8f3-d2c701f405d5>",
"WARC-Date": "2021-07-30T14:06:51Z",
"WARC-IP-Address": "128.93.193.23",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FLIYYYQJ6SOOS2GETFK6DV6PE5HGU6F2",
"WARC-Record-ID": "<urn:uuid:a24b01cd-6057-48f0-b110-d5706414dd61>",
"WARC-Target-URI": "https://gitlab.inria.fr/why3/why3/-/commit/5c3eeba27643c00f5e8f956d2a36f9fb354313b0?view=parallel",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e95fe96b-61a0-4b39-98aa-37c82a0b5098>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-169.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
207,
208,
273,
286,
287,
312,
313,
329,
409,
445,
569,
607,
626,
661,
687,
748,
788,
796,
812,
816,
848,
866,
928,
1006,
1054,
1162,
1178,
1232,
1292,
1349,
1352,
1420,
1464,
1524,
1527,
1549,
1577,
1591,
1689,
1717,
1789,
1813,
1832,
1860,
1887,
1931,
1940,
1950,
1960,
1971,
1983,
1997,
2009,
2022,
2039,
2054,
2065,
2077,
2091,
2137,
2215,
2263,
2389,
2417,
2443,
2521,
2576,
2657,
2691,
2720,
2756,
2812,
2886,
2916,
3004,
3034,
3038,
3044,
3077,
3097,
3193,
3199,
3261,
3268,
3306,
3390,
3432,
3549,
3691,
3699,
3737,
3817,
3821,
3833,
3885,
3913,
3927,
3934,
3956,
3964,
4035,
4070
],
"line_end_idx": [
207,
208,
273,
286,
287,
312,
313,
329,
409,
445,
569,
607,
626,
661,
687,
748,
788,
796,
812,
816,
848,
866,
928,
1006,
1054,
1162,
1178,
1232,
1292,
1349,
1352,
1420,
1464,
1524,
1527,
1549,
1577,
1591,
1689,
1717,
1789,
1813,
1832,
1860,
1887,
1931,
1940,
1950,
1960,
1971,
1983,
1997,
2009,
2022,
2039,
2054,
2065,
2077,
2091,
2137,
2215,
2263,
2389,
2417,
2443,
2521,
2576,
2657,
2691,
2720,
2756,
2812,
2886,
2916,
3004,
3034,
3038,
3044,
3077,
3097,
3193,
3199,
3261,
3268,
3306,
3390,
3432,
3549,
3691,
3699,
3737,
3817,
3821,
3833,
3885,
3913,
3927,
3934,
3956,
3964,
4035,
4070,
4099
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4099,
"ccnet_original_nlines": 102,
"rps_doc_curly_bracket": 0.0024396199733018875,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.14298245310783386,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0043859598226845264,
"rps_doc_frac_lines_end_with_ellipsis": 0.019417479634284973,
"rps_doc_frac_no_alph_words": 0.5201754570007324,
"rps_doc_frac_unique_words": 0.3961164951324463,
"rps_doc_mean_word_length": 5.075727939605713,
"rps_doc_num_sentences": 70,
"rps_doc_symbol_to_word_ratio": 0.017543859779834747,
"rps_doc_unigram_entropy": 4.898855686187744,
"rps_doc_word_count": 515,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.34583014249801636,
"rps_doc_frac_chars_dupe_6grams": 0.21499617397785187,
"rps_doc_frac_chars_dupe_7grams": 0.14078040421009064,
"rps_doc_frac_chars_dupe_8grams": 0.07957153767347336,
"rps_doc_frac_chars_dupe_9grams": 0.03366487845778465,
"rps_doc_frac_chars_top_2gram": 0.011476660147309303,
"rps_doc_frac_chars_top_3gram": 0.03672533109784126,
"rps_doc_frac_chars_top_4gram": 0.03825554996728897,
"rps_doc_books_importance": -562.1022338867188,
"rps_doc_books_importance_length_correction": -562.1022338867188,
"rps_doc_openwebtext_importance": -315.2843933105469,
"rps_doc_openwebtext_importance_length_correction": -315.2843933105469,
"rps_doc_wikipedia_importance": -234.9508514404297,
"rps_doc_wikipedia_importance_length_correction": -234.9508514404297
},
"fasttext": {
"dclm": 0.9088961482048035,
"english": 0.3521193563938141,
"fineweb_edu_approx": 2.203951120376587,
"eai_general_math": 0.38521403074264526,
"eai_open_web_math": 0.6130685210227966,
"eai_web_code": 0.03437739983201027
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "22",
"label": "Truncated"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,116,289,693,098,223,000 | #100DaysOfCode in Python Transcripts
Chapter: Welcome to the course
Lecture: Michael's tool's and setup
Login or purchase this course to watch this video and the rest of the course contents.
0:00 Michael here. It's time to show you how I set up the tools when I'm writing code. Now, I'm going to be using a Mac, Mac OS High Sierra for this course.
0:09 That's the latest at the time of the recording. However, you can use Windows, you can use Linux. They're all basically the same as far as that goes.
0:16 I'm going to be using the editor PyCharm and I'm going to be using Python, the one that I got from Python.org not installed any other way.
0:24 So let's see how that goes. First off, when you're on a Mac if you've taken no actions you don't have Python 3.
0:31 You'll know if you open up your terminal. Come over here and type Python3 -V and you would get the same error something like Python3 not found
0:43 as if there's a Python4. Someday, maybe, not right now. So if you type Python3 -V
1:00 not lowercase v and you get not found you need to install it. If you get something like, 3.5 or above, you're fine, you're done with Python.
1:09 All you got to do is come over here, go to downloads, download right now the latest is 3.6.4. So download that, it gives you an installer.
1:16 Run the installer; you're good to go. The other tool that I use a lot is something called PyCharm. It's an editor for Python.
1:23 One of the richest and most powerful editors. And I really think it's great both for beginners and for professional developers.
1:31 And it comes in two versions. You can see the full fledge Professional or the Community Edition. So you can download the Professional
1:38 or the Community Edition. The Professional one costs money. You can pay for it monthly or you can buy a license.
1:43 Whatever, it's like about eight or nine dollars a month. You can get the Community Edition. It's free and open source, okay.
1:49 This also comes with a month long free trial so you can try it. If you care about the features, say which one comes in which, you can compare them
1:56 down here at the bottom under choose your edition. So it's up to you which one you get. So we can come down here and download this and install it.
2:05 One thing that's cool that you might consider getting is this Toolbox App. This one will sort of keep track of updates for you.
2:11 It looks like this and it gives you access to all of the tools that JetBrains has. So if you're going to install more than one,
2:16 this might be handy but you don't have to get it. Either way, get either PyCharm Pro or Community Edition
2:22 or get this JetBrains Toolbox which I have up here. You can see apparently there's an update for my PyCharm Professional.
2:29 If I want a data grip, I can just click that and install it. Once you have it you can run PyCharm and you'll be able to start creating
2:36 and editing Python projects. That's it, I don't really have anything else installed for working with the code.
2:42 It's just Python, my OS, and PyCharm and we're good to go.
Talk Python's Mastodon Michael Kennedy's Mastodon | {
"url": "https://training.talkpython.fm/courses/transcript/100-days-of-code-in-python/lecture/160112",
"source_domain": "training.talkpython.fm",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "21930",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KBRDECGJDMMMGHL6JWLZU63QTOEPGG7L",
"WARC-Concurrent-To": "<urn:uuid:403a9d8c-41bb-490e-a8c7-1f9a9fcd9f49>",
"WARC-Date": "2022-11-29T15:13:20Z",
"WARC-IP-Address": "138.197.227.137",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NKNODU6PUS2UEHH4KEJDRO2R7DC2LXLM",
"WARC-Record-ID": "<urn:uuid:86de5923-7fdf-4496-bc52-de72d7987fd5>",
"WARC-Target-URI": "https://training.talkpython.fm/courses/transcript/100-days-of-code-in-python/lecture/160112",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a3b77f6d-3a4c-4fd4-8aac-2ff00b3a9066>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-189\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
37,
68,
104,
105,
192,
349,
503,
647,
764,
912,
999,
1145,
1289,
1420,
1553,
1692,
1810,
1940,
2092,
2244,
2377,
2510,
2621,
2748,
2888,
3004,
3068,
3069,
3070
],
"line_end_idx": [
37,
68,
104,
105,
192,
349,
503,
647,
764,
912,
999,
1145,
1289,
1420,
1553,
1692,
1810,
1940,
2092,
2244,
2377,
2510,
2621,
2748,
2888,
3004,
3068,
3069,
3070,
3119
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3119,
"ccnet_original_nlines": 29,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.482051283121109,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020512819290161133,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23589743673801422,
"rps_doc_frac_unique_words": 0.42320817708969116,
"rps_doc_mean_word_length": 4.0904436111450195,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0.0012820500414818525,
"rps_doc_unigram_entropy": 5.017937660217285,
"rps_doc_word_count": 586,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02002502977848053,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.027534419670701027,
"rps_doc_frac_chars_top_3gram": 0.011264080181717873,
"rps_doc_frac_chars_top_4gram": 0.013767209835350513,
"rps_doc_books_importance": -437.8495788574219,
"rps_doc_books_importance_length_correction": -437.8495788574219,
"rps_doc_openwebtext_importance": -258.158447265625,
"rps_doc_openwebtext_importance_length_correction": -258.158447265625,
"rps_doc_wikipedia_importance": -167.60678100585938,
"rps_doc_wikipedia_importance_length_correction": -167.60678100585938
},
"fasttext": {
"dclm": 0.07096142321825027,
"english": 0.9446325898170471,
"fineweb_edu_approx": 1.313080906867981,
"eai_general_math": 0.2684468626976013,
"eai_open_web_math": 0.28229355812072754,
"eai_web_code": 0.2713204622268677
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
1,925,239,857,563,414,800 | Last Comment Bug 648102 - UTF-8 support for shell read/snarf function
: UTF-8 support for shell read/snarf function
Status: RESOLVED FIXED
fixed-in-tracemonkey
:
Product: Core
Classification: Components
Component: JavaScript Engine (show other bugs)
: unspecified
: x86 Mac OS X
-- normal (vote)
: ---
Assigned To: general
:
: Jason Orendorff [:jorendorff]
Mentors:
Depends on: 650526
Blocks: 635933 640855 648596 663552
Show dependency treegraph
Reported: 2011-04-06 13:41 PDT by Dave Herman [:dherman]
Modified: 2012-01-22 17:23 PST (History)
6 users (show)
See Also:
Crash Signature:
(edit)
QA Whiteboard:
Iteration: ---
Points: ---
Has Regression Range: ---
Has STR: ---
Attachments
Quick patch to add -U which sets UTF-8 C strings (2.65 KB, patch)
2011-04-08 10:22 PDT, Wesley W. Garland
gal: review+
mattbasta: feedback+
Details | Diff | Splinter Review
print a smiley! (84 bytes, text/plain)
2011-04-08 11:31 PDT, Colin Walters
no flags Details
Legal JS program with UTF-8 chars in it (55 bytes, text/plain)
2011-04-08 12:02 PDT, Wesley W. Garland
no flags Details
series of patches to improve UTF-8 support in the JS shell (7.15 KB, patch)
2011-04-08 13:31 PDT, Colin Walters
gal: review+
Details | Diff | Splinter Review
Description User image Dave Herman [:dherman] 2011-04-06 13:41:31 PDT
The AMO validator needs to read in UTF-8-encoded files, and read/snarf only reads in bytes with some old encoding. But we have UTF-8 support in the engine so it shouldn't be too hard to create a UTF-8 variant.
This could be in the form of an optional second argument to read/snarf that is a string from a fixed set of recognized encoding names? Or maybe just a boolean to switch between the current encoding and UTF-8?
Dave
Comment 1 User image Wesley W. Garland 2011-04-07 12:06:04 PDT
FileAsString() reads the input file, converting C string to JS string via
JS_NewStringCopyN().
It seems to me that the correct solution is not to add yet-another-code path, but rather use the one we already have: call JS_SetCStringsAreUTF8() before JS_NewRuntime()
Comment 2 User image Colin Walters 2011-04-07 12:08:58 PDT
(In reply to comment #1)
> It seems to me that the correct solution is not to add yet-another-code path,
> but rather use the one we already have: call JS_SetCStringsAreUTF8() before
> JS_NewRuntime()
But if you do that, you lose out on the ability to hold arbitrary binary data in strings, which is in turn necessary if your javascript code doesn't uniformly use Uint8Array.
Comment 3 User image Wesley W. Garland 2011-04-07 14:03:50 PDT
Where does the JS shell use C strings with bytes > 0x7f?
Comment 4 User image Colin Walters 2011-04-07 16:20:08 PDT
(In reply to comment #3)
> Where does the JS shell use C strings with bytes > 0x7f?
Sorry, I don't know all of the context here; it may be in some limited use case one can get away with JS_SetCStringsAreUTF8. But in general it's web-incompatible at least.
Comment 5 User image Wesley W. Garland 2011-04-08 06:03:17 PDT
Colin, whether or not a pointer to char represents ISO-8859-1 or UTF-8 data in the source to your web browser (or, in this case, JS shell) is completely orthognal web-compatibilty.
Comment 6 User image Colin Walters 2011-04-08 08:42:41 PDT
(In reply to comment #5)
> Colin, whether or not a pointer to char represents ISO-8859-1 or UTF-8 data in
> the source to your web browser (or, in this case, JS shell) is completely
> orthognal web-compatibilty.
Setting it makes string handling *very* different from Firefox. Note that Spidermonkey doesn't really try to enforce ISO-8859-1 - in practice it's just "arbitrary binary data".
Let me define "web compatible" here by saying basically if Firefox were to just invoke JS_SetCStringsAreUTF8 today with no other changes, it would probably fail to run many web pages. For example, XPConnect would no longer pass through binary strings, but would throw an exception.
On this particular bug, we have a version of this in GJS too; I think the right approach for the bug is what Dave suggested - a new variant of JS_CompileScript with an encoding argument.
Although, it *would* be nice to eventually switch over spidermonkey to by default convert to UTF-8, and have callers that want access to raw string data just use JS_GetStringCharsAndLength (though even more ideally have a version that returns const uint8* instead of pretending it's valid unicode).
Basically anything calling any of the JS_EncodeString family needs auditing if you're going to set this flag. As is now in the JS shell, it is used for printing out values, as well as the Unix exec() wrapper.
Formerly, looks like if you were printing a binary string, it'd just go straight to your terminal; actually this is a bug either way - in gjs when printing things we detect if the value isn't valid UTF-8 and squash it. Without modification, binary strings would throw an exception and fail to print.
For the exec() case, you'd no longer be able to pass binary data as arguments to subprocesses.
Comment 7 User image Wesley W. Garland 2011-04-08 09:44:13 PDT
So we understand that this switch doesn't affect web correctness, it affects how the embedding or browser communicates with the JS engine.
The proper way to get Unicode data into the JS engine is to transform it to UTF-16 (native endian), from whatever the input encoding happens to be, and to feed it JS_CompileUCScript().
IMO, he JS engine should NOT be doing arbitrary charset transformation: that is iconv's job; also, the browser already knows how to do this.
Anyhow, Dave wasn't suggesting we add that to the JS engine, only to add a helper in the shell. My point is that it's probably easier to just turn on UTF-8 C strings than to write a routine to do this.
For the exec() case - is this really a concern? It's not even built that way unless #if defined(SHELL_HACK) && defined(DEBUG) && defined(XP_UNIX)
Comment 8 User image Colin Walters 2011-04-08 10:00:04 PDT
(In reply to comment #7)
> So we understand that this switch doesn't affect web correctness, it affects
> how the embedding or browser communicates with the JS engine.
True, strictly speaking. But my point remains that Firefox would break messily if this flag was set blindly.
> The proper way to get Unicode data into the JS engine is to transform it to
> UTF-16 (native endian), from whatever the input encoding happens to be, and to
> feed it JS_CompileUCScript().
Ah, that's probably what Firefox does? ... a quick "git grep" later...looks like mostly, yes. A few tests use CompileScript.
> IMO, he JS engine should NOT be doing arbitrary charset transformation: that is
> iconv's job; also, the browser already knows how to do this.
I agree with this generally. In my case I already have high quality Unicode routines in GLib, so I don't really want Spidermonkey doing it too (though probably NSPR has stuff in this area too, which is a different mess).
> Anyhow, Dave wasn't suggesting we add that to the JS engine, only to add a
> helper in the shell. My point is that it's probably easier to just turn on
> UTF-8 C strings than to write a routine to do this.
I think that'd just lead to more confusion down the road when the JS shell behaves differently from Firefox.
The right thing I think is to just kill off JS_SetCStringsAreUTF8. It's an evil temptation for embedders as it is now.
But for this bug, I think we agree the JS shell should:
1) Gain some mechanism for specifying the input encoding of its script. On Unix at least I'd expect this to default to nl_langinfo (CODESET), and maybe have a command line argument?
2) Convert the input into UTF-16 via JS_DecodeBytes, and then feed that to JS_CompileUCScript.
Comment 9 User image Colin Walters 2011-04-08 10:10:20 PDT
Maybe in the future of course we could actually flip the other way and use UTF-8 internally:
Robert O'Callahan has a good post on this:
http://weblogs.mozillazine.org/roc/archives/2008/01/string_theory.html
Though he doesn't mention (or perhaps didn't know) in that post that we need to support non-Unicode data in JavaScript strings for backwards compatibility.
Comment 10 User image Wesley W. Garland 2011-04-08 10:15:08 PDT
Our opinions on what should happen in the long term with JS_SetCStringsAreUTF8() differ by 180 degress- but that's okay, neither of us are the module owner anyhow. :)
> 2) Convert the input into UTF-16 via JS_DecodeBytes, and then
> feed that to JS_CompileUCScript.
The current implementation, which uses JS_NewStringCopyN(), is equivalent to this. It and JS_DecodeBytes() are both implemented in terms of js_InflateStringToBuffer() which requires JS_SetCStringsAreUTF8() if you want the input to be recognized as UTF-8.
Comment 11 User image Wesley W. Garland 2011-04-08 10:19:24 PDT
We mid-aired on the last comment. ROC's post is interesting, and reminds me that Google's engine stores their JS strings internally as either UTF16, UTF8, or "ascii", depending on the string. At least they did a year ago.
I'm ambivalent as to whether the JS engine should change it's internal representation -- I would want to see perf numbers -- but that has no real bearing on the API, or how the shell reads files. It's (mostly) an engine-contained problem. That said, an internal UTF-8 repn would go nicely with UTF-8 C strings.
Comment 12 User image Wesley W. Garland 2011-04-08 10:22:21 PDT
Created attachment 524660 [details] [diff] [review]
Quick patch to add -U which sets UTF-8 C strings
Dave, does this meet your needs?
Comment 13 User image Colin Walters 2011-04-08 10:22:32 PDT
(In reply to comment #10)
> Our opinions on what should happen in the long term with
> JS_SetCStringsAreUTF8() differ by 180 degress- but that's okay, neither of us
> are the module owner anyhow. :)
Wait, do you actually use it?
> The current implementation, which uses JS_NewStringCopyN(), is equivalent to
> this. It and JS_DecodeBytes() are both implemented in terms of
> js_InflateStringToBuffer() which requires JS_SetCStringsAreUTF8() if you want
> the input to be recognized as UTF-8.
Ohh right. So I think the right fix is a public JS_DecodeUTF8 API that doesn't depend on the value of JS_CStringsAreUTF8().
Comment 14 User image Dave Herman [:dherman] 2011-04-08 10:51:27 PDT
> Dave, does this meet your needs?
They're actually Matt Basta's needs, not mine -- the AMO validator isn't my jurisdiction. They're using Reflect.parse, which is how I got involved.
I haven't followed this whole conversation very well, but I'm somewhat ambivalent. I don't really care that much about cleanliness in the shell, because it's a ball of mud to begin with and NPOTB... and anyway, SpiderNode FTW. ;)
Matt: is Wes's patch sufficient for your needs? Basically, it adds a -U command-line option to the shell which changes all I/O to be UTF-8.
Dave
Comment 15 User image Colin Walters 2011-04-08 11:04:57 PDT
To restate more clearly the reason I'm fighting so much on this bug is simply because I've learned over time when using Spidermonkey:
"Do What Firefox Does"
Firefox is where all the effort goes into test suites, where new JS features are driven and prototyped, etc.
Comment 16 User image Wesley W. Garland 2011-04-08 11:14:32 PDT
Normally, I'd agree with you, but I think adding arbitrary character set conversion into the shell is too big a burden at this time.
Feel free to pick up the slack, though.
Comment 17 User image Wesley W. Garland 2011-04-08 11:17:43 PDT
Sorry, I didn't mean that come off as snarky as did.
The point, though, is that the shell doesn't have access to the same libraries that the browser uses to retrieve resources and perform characters set conversion.
This is why the shell uses files, and why I'm suggesting using what resources we have at our disposal to do the conversion.
I would be very sad to see the JS shell start to depend on libiconv, for example.
Comment 18 User image Wesley W. Garland 2011-04-08 11:19:57 PDT
Argh, I meant for this to be comment 15, mid-air collision bit me:
Dave/Matt: Not all I/O - code coming in via JS_CompileFile() - e.g. from -f
command line option - is currently unaffected by this switch. This is an engine
bug I've been meaning to fix for quite some time... Matt will need to use
snarf, read, or run to get the behaviour he wants.
(Full disclosure -- I didn't really test this because I had a hard time generating a test case that didn't involve copy/pasting out of my browser which is causing me charset-grief)
Colin: yes, I do I use UTF8 C strings. IMO, anybody who cares about getting
arbitrary binary data into JS Strings should be relying on the defined
interfaces for doing this rather than the happenstance of ISO-8859-1 -> UTF-16
mapping by the legacy implementation of js_inflateString. (But I prefer
storing arbitrary binary data in byte-oriented data types anyhow)
Comment 19 User image Dave Herman [:dherman] 2011-04-08 11:23:07 PDT
Wes: what effect does -U have on load() then?
Dave
Comment 20 User image Colin Walters 2011-04-08 11:31:29 PDT
(In reply to comment #12)
> Created attachment 524660 [details] [diff] [review]
> Quick patch to add -U which sets UTF-8 C strings
>
> Dave, does this meet your needs?
So what's interesting to me is this patch actually *breaks* UTF-8 input for me. I'll attach a sample test file. But *why* that's the case I'm not sure yet.
Comment 21 User image Colin Walters 2011-04-08 11:31:51 PDT
Created attachment 524687 [details]
print a smiley!
Comment 22 User image Colin Walters 2011-04-08 11:35:48 PDT
But can we get a test case of a file that AMO wants to validate that failed?
Comment 23 User image Wesley W. Garland 2011-04-08 12:02:50 PDT
Created attachment 524699 [details]
Legal JS program with UTF-8 chars in it
Dave -- load() is unaffected by this bug, because it is implemented with JS_CompileFile() which is not aware of the JS_SetCStringsAreUTF8() switch. This is an engine bug, IMHO (there is an old bug on this).
Colin - Not sure what's going on with your test; it works for me, but as I explained on IRC, I'm suspicious of my terminal.
The correct output from this program is "Hello\n174" when the shell is invoked -U; a syntax error results otherwise.
To run the program, save it in a file and use the run() function or paste it into the REPL. Or use snarf()/read() to read it into a JS string and eval() it.
Comment 24 User image Matt Basta [:basta] 2011-04-08 13:02:38 PDT
Hi all, thanks for looking so deep into this.
Dave: That would be fine, it's all we need. Our code looks something like this:
try {
print(JSON.stringify(Reflect.parse(read("foo.js"))));
} catch(e) {
print(JSON.stringify({
"error":true,
"error_message":e.toString(),
"line_number":e.lineNumber
}));
}
As long as the -U flag will allow read() to decode the file, then that should sufficiently meet our needs.
Is the patch ready for us to install/deploy?
Comment 25 User image Wesley W. Garland 2011-04-08 13:07:34 PDT
Matt:
You could certainly *test* the patch, but it can't go into the source tree until it is reviewed by a JS peer.
Are you able to test? If so, please apply locally and test; indicate that it meets your needs by marking feedback+ on the attachment, and I will request peer review. Once reviewed, assuming it passes muster, I can push it into the tracemonkey tree, where it will eventually make it's way into mozilla-central.
Wes
PS: If you don't know how to apply a patch, build spidermonkey, etc -- find me in #jsapi and I will help you.
Comment 26 User image Colin Walters 2011-04-08 13:28:25 PDT
Ok, here's how I'm testing. I have two files:
// begin testValidEscapedUTF8.js
var \u03A9 = "Hello";
print(\u03A9);
// end testValidEscapedUTF8.js
// begin testValidLiteralUTF8.js
var Ω = "Hello";
print(Ω);
// end testValidLiteralUTF8.js
Now, from the current mozilla-central git (I'm using the github mirror):
$ ./shell/js -e 'compile(snarf("/home/walters/tmp/jstest/testValidEscapedUTF8.js"))'
$ ./shell/js -e 'compile(snarf("/home/walters/tmp/jstest/testValidLiteralUTF8.js"))'
<string>:SyntaxError: illegal character:
<string>:var Ω = "Hello";
<string>:.....^
$
We can see that the shell barfs on the literal UTF-8. If I add JS_SetCStringsAreUTF8() before JS_NewRuntime, it does work (so I'm not sure what happened above).
Now, I have a series of patches that give the same result, but don't require calling JS_SetCStringsAreUTF8.
Comment 27 User image Colin Walters 2011-04-08 13:31:04 PDT
Created attachment 524720 [details] [diff] [review]
series of patches to improve UTF-8 support in the JS shell
These patches are a different approach than Wes' - we essentially assume that the shell input is always UTF-8. This is honestly a lot better default than what we're doing now, which is hard to characterize - we're taking each byte of input as the low bit in UTF-16...I think that's basically going to be corrupted unless the input is ASCII.
Comment 28 User image Wesley W. Garland 2011-04-08 13:35:38 PDT
What the current shell does is to treat all input as ISO-8859-1, via the algorithm you described. There is no ambiguity.
Comment 29 User image Colin Walters 2011-04-08 13:59:25 PDT
(In reply to comment #28)
> What the current shell does is to treat all input as ISO-8859-1, via the
> algorithm you described. There is no ambiguity.
You're right, sorry. I had forgotten this property of UTF-16.
So this patch changes the shell to default to UTF-8 instead of ISO-8859-1 unconditionally. I think this is basically unilaterally better because whatever encoding your JavaScript happens to be, you should be able to losslessly convert it to UTF-8 via an external mechanism (be that iconv or whatever).
Comment 30 User image Matt Basta [:basta] 2011-04-14 08:23:41 PDT
Wes: The patch works just fine. All of my tests pass now! Hooray! I'm going to talk to the other AMO guys to see what efforts need to be organized to update Spidermonkey once this makes its way into the source tree.
Thanks for your help!
Comment 31 User image Wesley W. Garland 2011-04-14 08:40:32 PDT
Which patch did you test, Matt?
Comment 32 User image Matt Basta [:basta] 2011-04-14 09:31:55 PDT
Wes's patch from 4/8 (attachment 524660 [details] [diff] [review])
Comment 33 User image Andreas Gal :gal 2011-04-14 10:10:52 PDT
Comment on attachment 524720 [details] [diff] [review]
series of patches to improve UTF-8 support in the JS shell
Changing a public API is frowned upon but this API is really obscure so what the hell.
Comment 34 User image Colin Walters 2011-04-14 11:13:44 PDT
(In reply to comment #33)
> Comment on attachment 524720 [details] [diff] [review]
> series of patches to improve UTF-8 support in the JS shell
>
> Changing a public API is frowned upon but this API is really obscure so what
> the hell.
Yeah, this is basically only used by js "console" implementations, and they probably only have a total of one call in their codebase.
But the other alternative would be introducing a "UC" variant as JS_UCBufferIsCompilableUnit, and using JS_DecodeUTF8 to convert the input into UTF-16 and pass it in there. I started on a patch to do this but ended up deciding a boolean was easier.
Comment 35 User image Wesley W. Garland 2011-04-14 12:56:15 PDT
I agree with Colin w.r.t. the interface, and I actually use it in my REPL. I'll just add an autoconf-style test when the time comes.
Anybody see a reason not to land both these patches?
Comment 36 User image Colin Walters 2011-04-14 13:40:36 PDT
(In reply to comment #35)
> I agree with Colin w.r.t. the interface, and I actually use it in my REPL.
> I'll just add an autoconf-style test when the time comes.
>
> Anybody see a reason not to land both these patches?
The main reason I did mine is I objected to adding JS_SetCStringsAreUTF8() into the js shell =) But yes, they don't actually conflict, they just fix the same problem in different ways.
Comment 38 User image Michael Wu [:mwu] 2011-06-10 15:16:56 PDT
Comment on attachment 524720 [details] [diff] [review]
series of patches to improve UTF-8 support in the JS shell
>@@ -4612,7 +4612,10 @@ JS_BufferIsCompilableUnit(JSContext *cx, JSObject *obj, const char *bytes, size_
>
> CHECK_REQUEST(cx);
> assertSameCompartment(cx, obj);
>- chars = js_InflateString(cx, bytes, &length);
>+ if (bytes_are_utf8)
>+ chars = js_InflateString(cx, bytes, &length, JS_TRUE);
>+ else
>+ chars = js_InflateString(cx, bytes, &length);
> if (!chars)
> return JS_TRUE;
>
Uhh, this is wrong AFAICT since CESU-8 != UTF-8.
Note You need to log in before you can comment on or make changes to this bug. | {
"url": "https://bugzilla.mozilla.org/show_bug.cgi?id=648102",
"source_domain": "bugzilla.mozilla.org",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "96033",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:L6F4VJ643A7K2WW723YHCCYYMZYKXPFP",
"WARC-Concurrent-To": "<urn:uuid:60740b7f-30db-4e35-b052-4ede784f20ad>",
"WARC-Date": "2017-02-23T23:08:13Z",
"WARC-IP-Address": "63.245.215.80",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:2VYRQO2W7RAPTFLUORP33P3NJ7LZBYJR",
"WARC-Record-ID": "<urn:uuid:e2a7d210-8a80-49d1-8dc0-ceceb15a0c24>",
"WARC-Target-URI": "https://bugzilla.mozilla.org/show_bug.cgi?id=648102",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:258b92fc-5719-4dc9-a8a6-2ebfb7ed578b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-09\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
70,
116,
139,
160,
162,
176,
203,
250,
264,
279,
296,
302,
323,
325,
357,
366,
385,
421,
449,
451,
508,
549,
564,
574,
591,
598,
613,
628,
640,
666,
679,
680,
681,
693,
759,
799,
812,
833,
866,
905,
941,
958,
1021,
1061,
1078,
1154,
1190,
1203,
1236,
1237,
1307,
1517,
1518,
1727,
1728,
1733,
1796,
1871,
1892,
1893,
2063,
2122,
2147,
2149,
2229,
2307,
2325,
2326,
2501,
2564,
2621,
2680,
2705,
2764,
2765,
2938,
3001,
3182,
3241,
3266,
3347,
3423,
3453,
3454,
3632,
3633,
3916,
3917,
4104,
4105,
4106,
4405,
4406,
4616,
4617,
4918,
4919,
5014,
5077,
5217,
5218,
5403,
5404,
5545,
5546,
5748,
5749,
5895,
5954,
5979,
6058,
6123,
6124,
6234,
6235,
6313,
6394,
6426,
6427,
6554,
6555,
6637,
6700,
6701,
6923,
6924,
7001,
7078,
7132,
7133,
7242,
7243,
7363,
7364,
7365,
7421,
7422,
7605,
7700,
7759,
7852,
7853,
7896,
7897,
7968,
7969,
8125,
8189,
8356,
8357,
8422,
8457,
8458,
8713,
8777,
9001,
9002,
9314,
9378,
9430,
9479,
9480,
9513,
9573,
9599,
9658,
9738,
9772,
9773,
9803,
9804,
9883,
9948,
10028,
10067,
10068,
10193,
10262,
10297,
10298,
10446,
10447,
10677,
10678,
10818,
10819,
10824,
10884,
11019,
11020,
11043,
11044,
11153,
11217,
11350,
11351,
11391,
11455,
11508,
11509,
11671,
11672,
11796,
11797,
11879,
11943,
12010,
12011,
12087,
12167,
12242,
12293,
12294,
12475,
12476,
12552,
12623,
12702,
12776,
12842,
12911,
12957,
12958,
12963,
13023,
13049,
13103,
13154,
13157,
13192,
13193,
13351,
13411,
13447,
13463,
13523,
13600,
13664,
13700,
13740,
13741,
13949,
13950,
14074,
14075,
14192,
14193,
14350,
14416,
14462,
14463,
14543,
14544,
14550,
14608,
14621,
14648,
14670,
14708,
14743,
14752,
14754,
14755,
14862,
14863,
14908,
14972,
14978,
14979,
15089,
15090,
15402,
15403,
15407,
15408,
15518,
15578,
15625,
15626,
15659,
15681,
15696,
15727,
15728,
15761,
15778,
15788,
15819,
15820,
15893,
15894,
15979,
16064,
16105,
16131,
16147,
16149,
16150,
16312,
16313,
16421,
16481,
16533,
16592,
16593,
16935,
16999,
17121,
17181,
17207,
17282,
17333,
17334,
17399,
17400,
17703,
17769,
17985,
17986,
18008,
18072,
18104,
18170,
18237,
18300,
18355,
18414,
18415,
18502,
18562,
18588,
18645,
18706,
18709,
18788,
18800,
18801,
18935,
18936,
19186,
19250,
19384,
19385,
19438,
19498,
19524,
19602,
19662,
19665,
19720,
19721,
19907,
19971,
20026,
20085,
20086,
20191,
20194,
20219,
20257,
20309,
20335,
20400,
20411,
20467,
20485,
20511,
20514,
20515,
20564,
20565
],
"line_end_idx": [
70,
116,
139,
160,
162,
176,
203,
250,
264,
279,
296,
302,
323,
325,
357,
366,
385,
421,
449,
451,
508,
549,
564,
574,
591,
598,
613,
628,
640,
666,
679,
680,
681,
693,
759,
799,
812,
833,
866,
905,
941,
958,
1021,
1061,
1078,
1154,
1190,
1203,
1236,
1237,
1307,
1517,
1518,
1727,
1728,
1733,
1796,
1871,
1892,
1893,
2063,
2122,
2147,
2149,
2229,
2307,
2325,
2326,
2501,
2564,
2621,
2680,
2705,
2764,
2765,
2938,
3001,
3182,
3241,
3266,
3347,
3423,
3453,
3454,
3632,
3633,
3916,
3917,
4104,
4105,
4106,
4405,
4406,
4616,
4617,
4918,
4919,
5014,
5077,
5217,
5218,
5403,
5404,
5545,
5546,
5748,
5749,
5895,
5954,
5979,
6058,
6123,
6124,
6234,
6235,
6313,
6394,
6426,
6427,
6554,
6555,
6637,
6700,
6701,
6923,
6924,
7001,
7078,
7132,
7133,
7242,
7243,
7363,
7364,
7365,
7421,
7422,
7605,
7700,
7759,
7852,
7853,
7896,
7897,
7968,
7969,
8125,
8189,
8356,
8357,
8422,
8457,
8458,
8713,
8777,
9001,
9002,
9314,
9378,
9430,
9479,
9480,
9513,
9573,
9599,
9658,
9738,
9772,
9773,
9803,
9804,
9883,
9948,
10028,
10067,
10068,
10193,
10262,
10297,
10298,
10446,
10447,
10677,
10678,
10818,
10819,
10824,
10884,
11019,
11020,
11043,
11044,
11153,
11217,
11350,
11351,
11391,
11455,
11508,
11509,
11671,
11672,
11796,
11797,
11879,
11943,
12010,
12011,
12087,
12167,
12242,
12293,
12294,
12475,
12476,
12552,
12623,
12702,
12776,
12842,
12911,
12957,
12958,
12963,
13023,
13049,
13103,
13154,
13157,
13192,
13193,
13351,
13411,
13447,
13463,
13523,
13600,
13664,
13700,
13740,
13741,
13949,
13950,
14074,
14075,
14192,
14193,
14350,
14416,
14462,
14463,
14543,
14544,
14550,
14608,
14621,
14648,
14670,
14708,
14743,
14752,
14754,
14755,
14862,
14863,
14908,
14972,
14978,
14979,
15089,
15090,
15402,
15403,
15407,
15408,
15518,
15578,
15625,
15626,
15659,
15681,
15696,
15727,
15728,
15761,
15778,
15788,
15819,
15820,
15893,
15894,
15979,
16064,
16105,
16131,
16147,
16149,
16150,
16312,
16313,
16421,
16481,
16533,
16592,
16593,
16935,
16999,
17121,
17181,
17207,
17282,
17333,
17334,
17399,
17400,
17703,
17769,
17985,
17986,
18008,
18072,
18104,
18170,
18237,
18300,
18355,
18414,
18415,
18502,
18562,
18588,
18645,
18706,
18709,
18788,
18800,
18801,
18935,
18936,
19186,
19250,
19384,
19385,
19438,
19498,
19524,
19602,
19662,
19665,
19720,
19721,
19907,
19971,
20026,
20085,
20086,
20191,
20194,
20219,
20257,
20309,
20335,
20400,
20411,
20467,
20485,
20511,
20514,
20515,
20564,
20565,
20643
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 20643,
"ccnet_original_nlines": 371,
"rps_doc_curly_bracket": 0.0002906600129790604,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3077720105648041,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05637305974960327,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3177202045917511,
"rps_doc_frac_unique_words": 0.2750532925128937,
"rps_doc_mean_word_length": 4.775815010070801,
"rps_doc_num_sentences": 192,
"rps_doc_symbol_to_word_ratio": 0.003523319959640503,
"rps_doc_unigram_entropy": 5.89261531829834,
"rps_doc_word_count": 3283,
"rps_doc_frac_chars_dupe_10grams": 0.23949231207370758,
"rps_doc_frac_chars_dupe_5grams": 0.34128451347351074,
"rps_doc_frac_chars_dupe_6grams": 0.291408896446228,
"rps_doc_frac_chars_dupe_7grams": 0.24433955550193787,
"rps_doc_frac_chars_dupe_8grams": 0.24433955550193787,
"rps_doc_frac_chars_dupe_9grams": 0.24433955550193787,
"rps_doc_frac_chars_top_2gram": 0.021812619641423225,
"rps_doc_frac_chars_top_3gram": 0.015179540030658245,
"rps_doc_frac_chars_top_4gram": 0.015307099558413029,
"rps_doc_books_importance": -2260.96630859375,
"rps_doc_books_importance_length_correction": -2260.96630859375,
"rps_doc_openwebtext_importance": -1327.2568359375,
"rps_doc_openwebtext_importance_length_correction": -1327.2568359375,
"rps_doc_wikipedia_importance": -1003.301513671875,
"rps_doc_wikipedia_importance_length_correction": -1003.301513671875
},
"fasttext": {
"dclm": 0.03586095944046974,
"english": 0.8928819894790649,
"fineweb_edu_approx": 1.6791763305664062,
"eai_general_math": 0.25653713941574097,
"eai_open_web_math": 0.3658568859100342,
"eai_web_code": 0.13632065057754517
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-5,557,037,805,173,851,000 | アンシブル&ドッカー
2020-12-16 hit count image
アンシブルプレイブック(Ansible Playbook)を使ってvagrant仮想マシン(guest system)にドッカー(Docker)とドッカーコンポーズ(Docker Compose)をインストールしてみます。
概要
サーバー開発にドッカー(Docker)は必須になりました。ここでドッカー(Docker)について全ての説明は難しいと思います。ブログを作成しながらちょっとちょっと説明することでドッカー(Docker)を説明します。このブログではアンシブルプレイブック(Ansible Playbook)を使ってvagrantにドッカー(Docker)とドッカーコンポーズ(Docker Compose)をインストールする方法を紹介します。
このブログは下の3つのブログを全て進めたと思って説明します。
アンシブルプレイブックにドッカー設定
今まで作ったvagrant仮想マシン(guest system)のためのディレクトリ(directory)構造は下記の通りです。
|-- ansible
| |-- init
| | |-- tasks
| | | |-- main.yml
| |-- playbook.yml
|-- Vagrantfile
ここに私たちはドッカー(Docker)インストールに関するroleを定義してアンシブルプレイブック(Ansible Playbook)に追加する予定です。下記のようにansibleフォルダ下へdocker/tasks/main.ymlファイルを追加します。
|-- ansible
| |-- init
| | |-- tasks
| | | |-- main.yml
| |-- docker
| | |-- tasks
| | | |-- main.yml
| |-- playbook.yml
|-- Vagrantfile
アンシブルプレイブック(Ansible Playbook)のスタートポイントであるplaybook.ymlファイルを下のように追加します。
---
- hosts: localhost
connection: local
roles:
- init
- docker
追加したdocker/tasks/main.ymlファイルを下のように修正します。
---
- name: Install docker
shell: curl https://get.docker.com | sh
- name: Modify privilege
become: true
shell: usermod -aG docker $USER
- name: Change privilege of docker
become: true
file: dest=/usr/bin/docker mode=+x
- name: python docker / docker-compse module
pip:
name:
- docker
- docker-compose
今からアンシブル(Ansible)コマンドを1つずつ見ます。
- name: Install docker
shell: curl https://get.docker.com | sh
ドッカー(Docker)インストールスクリプトを使ってドッカー(Docker)をインストールします。
- name: Modify privilege
become: true
shell: usermod -aG docker $USER
- name: Change privilege of docker
become: true
command: chmod +x /usr/bin/docker
ドッカー(Docker)のユーザーや権限を変更します。
- name: python docker / docker-compse module
pip:
name:
- docker
- docker-compose
パイソン(python)のpipを使ってパイソンドッカーモジュール(python docker module)とドッカーコンポーズ(Docker Compose)をインストールします。
アンシブル実行
上でアンシブルプレイブック(Ansible Playbook)へ追加したドッカー(Docker)インストールroleを実行するため下のアンシブル(Ansible)コマンドを仮想マシン(guest system)で実行します。
vagrant ssh
sudo ansible-playbook /vagrant/ansible/playbook.yml
すでに環境がある状態で進めるのでアンシブルプレイブック(Ansible Playbook)を実行しました。新しく開発環境を作るときはvagrantのプロビジョンシェル(provision shell)へアンシブルプレイブック(Ansible Playbook)実行スクリプトを追加したので自動に実行されます。
確認するため下記のvagrantコマンドをローカルマシン(host system)で実行します。
vagrant destroy
vagrant up
ドッカーインストール確認
ドッカー(Docker)がアンシブルプレイブック(Ansible Playbook)で仮想マシン(guest system)に上手くインストールされたかを確認するため下記のドッカー(Docker)コマンドで確認します。
vagrant ssh
docker --version
docker-compose --version
完了
アンシブルプレイブック(Ansible Playbook)でドッカー(Docker)とドッカーコンポーズ(Docker Compose)を追加して仮想マシン(guest system)へインストールする方法を見ました。今からはドッカー(Docker)を使って好きな開発環境を作ることができます。次のブログではドッカー(Docker)とドッカーコンポーズ(Docker Compose)を使ってララベル(Laravel)開発環境を作る方法について説明します。
私のブログが役に立ちましたか？下にコメントを残してください。それは私にとって大きな大きな力になります！
Posts | {
"url": "https://dev-yakuza.posstree.com/environment/ansible-docker/",
"source_domain": "dev-yakuza.posstree.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "43746",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ASNP44FPTFBBM3G5N44TAPSKFUTXOHFK",
"WARC-Concurrent-To": "<urn:uuid:80e27abc-a136-4094-9521-b6cc9340848f>",
"WARC-Date": "2021-07-25T07:10:08Z",
"WARC-IP-Address": "172.67.188.223",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LXE5HEIWI2NIV2DGUFCON7N3FHL6VWYG",
"WARC-Record-ID": "<urn:uuid:77f372f1-84c7-435c-8a96-a1613be8ca8d>",
"WARC-Target-URI": "https://dev-yakuza.posstree.com/environment/ansible-docker/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:263b8b1b-3b53-40e8-a9f5-fea88d07134d>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-218.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
11,
12,
39,
40,
152,
153,
156,
157,
369,
370,
401,
402,
421,
422,
487,
488,
500,
514,
534,
562,
584,
600,
601,
730,
731,
743,
757,
777,
805,
821,
841,
869,
891,
907,
908,
978,
979,
983,
1002,
1022,
1031,
1042,
1055,
1056,
1098,
1099,
1103,
1126,
1168,
1169,
1194,
1209,
1243,
1244,
1279,
1294,
1331,
1332,
1377,
1384,
1394,
1411,
1436,
1437,
1468,
1469,
1492,
1534,
1535,
1586,
1587,
1612,
1627,
1661,
1662,
1697,
1712,
1748,
1749,
1777,
1778,
1823,
1830,
1840,
1857,
1882,
1883,
1976,
1977,
1985,
1986,
2099,
2100,
2112,
2113,
2165,
2166,
2321,
2322,
2371,
2372,
2388,
2399,
2400,
2413,
2414,
2524,
2525,
2537,
2538,
2555,
2580,
2581,
2584,
2585,
2814,
2815,
2867,
2868
],
"line_end_idx": [
11,
12,
39,
40,
152,
153,
156,
157,
369,
370,
401,
402,
421,
422,
487,
488,
500,
514,
534,
562,
584,
600,
601,
730,
731,
743,
757,
777,
805,
821,
841,
869,
891,
907,
908,
978,
979,
983,
1002,
1022,
1031,
1042,
1055,
1056,
1098,
1099,
1103,
1126,
1168,
1169,
1194,
1209,
1243,
1244,
1279,
1294,
1331,
1332,
1377,
1384,
1394,
1411,
1436,
1437,
1468,
1469,
1492,
1534,
1535,
1586,
1587,
1612,
1627,
1661,
1662,
1697,
1712,
1748,
1749,
1777,
1778,
1823,
1830,
1840,
1857,
1882,
1883,
1976,
1977,
1985,
1986,
2099,
2100,
2112,
2113,
2165,
2166,
2321,
2322,
2371,
2372,
2388,
2399,
2400,
2413,
2414,
2524,
2525,
2537,
2538,
2555,
2580,
2581,
2584,
2585,
2814,
2815,
2867,
2868,
2873
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2873,
"ccnet_original_nlines": 119,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04372623935341835,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003802279941737652,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5760456323623657,
"rps_doc_frac_unique_words": 0.5838509202003479,
"rps_doc_mean_word_length": 14.614907264709473,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.26212739944458,
"rps_doc_word_count": 161,
"rps_doc_frac_chars_dupe_10grams": 0.07649809122085571,
"rps_doc_frac_chars_dupe_5grams": 0.16574585437774658,
"rps_doc_frac_chars_dupe_6grams": 0.16574585437774658,
"rps_doc_frac_chars_dupe_7grams": 0.16574585437774658,
"rps_doc_frac_chars_dupe_8grams": 0.12749680876731873,
"rps_doc_frac_chars_dupe_9grams": 0.12749680876731873,
"rps_doc_frac_chars_top_2gram": 0.016999579966068268,
"rps_doc_frac_chars_top_3gram": 0.013599660247564316,
"rps_doc_frac_chars_top_4gram": 0.01954950951039791,
"rps_doc_books_importance": -180.37310791015625,
"rps_doc_books_importance_length_correction": -180.37310791015625,
"rps_doc_openwebtext_importance": -96.76716613769531,
"rps_doc_openwebtext_importance_length_correction": -96.76716613769531,
"rps_doc_wikipedia_importance": -95.80839538574219,
"rps_doc_wikipedia_importance_length_correction": -95.80839538574219
},
"fasttext": {
"dclm": 0.9991625547409058,
"english": 0.0033540199510753155,
"fineweb_edu_approx": 2.1016383171081543,
"eai_general_math": 0.0030924100428819656,
"eai_open_web_math": 0.00008153999806381762,
"eai_web_code": 0.9856591820716858
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,533,991,067,109,420,000 | Sincronizzare i file tra due cartelle – Synchronicity
Synchronicity è un programma gratuito per la sincronizzazione dei file tra due cartelle.
L’applicazione non richiede l’installazione,la configurazione di una nuova operazione di sincronizzazione risulta essere piuttosto semplice.
Come prima cosa bisogna selezionare la directory di origine e quella di destinazione, fatto questo è possibile impostare il tipo di sincronizzazione tra le tre messe a disposizione.
Left to right mirror – Una copia dei file presenti nella directory specificata nella parte sinistra dell’interfaccia viene fatta nell’altra directory. I nuovi file e quelli modificati sovrascrivono quelli presenti e quelli cancellati vengono eliminati.
Left to right incremental – Funziona come il metodo precedente con la differenza che i file eliminati nella directory specificata nella parte sinistra dell’interfaccia non vengono cancellati nell’altra directory.
Two way incremental – I nuovi file e quelli modificati vengono copiati da una cartella all’altra e quelli cancellati non vengono eliminati.
L’applicazione mette a disposizione anche altre opzioni con cui è possibile escludere dalla sincronizzazione specifici file e offre una funzionalità anteprima tramite la quale è possibile verificare le modifiche che sarebbero effettuate eseguendo la sincronizzazione.
Synchronicity è uno strumento per la sincronizzazione di livello buono, manca la possibilità di programmare la sincronizzazione dall’interno dell’applicazione ma è possibile fare questo attraverso le operazioni schedulate di Windows. | {
"url": "http://www.tuttotech.com/archives/6867/sincronizzare-i-file-tra-due-cartelle-synchronicity",
"source_domain": "www.tuttotech.com",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "47054",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VVXIUK6Y3LNQU5JKM4FJNIERFQX3ZJZQ",
"WARC-Concurrent-To": "<urn:uuid:1f353429-a0f2-4ecf-b9f4-c441307ee2e2>",
"WARC-Date": "2018-04-23T15:21:32Z",
"WARC-IP-Address": "129.121.19.67",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WLUS6XHYRAO3NUL6F3MSGYFQU5HQZLN7",
"WARC-Record-ID": "<urn:uuid:dc56735e-a761-4139-a543-a75b08b07cc3>",
"WARC-Target-URI": "http://www.tuttotech.com/archives/6867/sincronizzare-i-file-tra-due-cartelle-synchronicity",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d62cd9fb-c366-463c-b51a-8fab9a1ad4d1>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-45-141-250.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-17\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for April 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
54,
55,
56,
145,
146,
287,
469,
722,
935,
1075,
1076,
1344,
1345
],
"line_end_idx": [
54,
55,
56,
145,
146,
287,
469,
722,
935,
1075,
1076,
1344,
1345,
1578
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1578,
"ccnet_original_nlines": 13,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09677419066429138,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016129029914736748,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12903225421905518,
"rps_doc_frac_unique_words": 0.5441860556602478,
"rps_doc_mean_word_length": 6.30232572555542,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.512840747833252,
"rps_doc_word_count": 215,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.12693727016448975,
"rps_doc_frac_chars_dupe_6grams": 0.12693727016448975,
"rps_doc_frac_chars_dupe_7grams": 0.08708486706018448,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05313653126358986,
"rps_doc_frac_chars_top_3gram": 0.014760149642825127,
"rps_doc_frac_chars_top_4gram": 0.026568269357085228,
"rps_doc_books_importance": -85.12274169921875,
"rps_doc_books_importance_length_correction": -71.97786712646484,
"rps_doc_openwebtext_importance": -57.62724304199219,
"rps_doc_openwebtext_importance_length_correction": -57.62724304199219,
"rps_doc_wikipedia_importance": -46.55028533935547,
"rps_doc_wikipedia_importance_length_correction": -32.73061752319336
},
"fasttext": {
"dclm": 0.5876174569129944,
"english": 0.0012700000079348683,
"fineweb_edu_approx": 0.9021693468093872,
"eai_general_math": 0.0007871999987401068,
"eai_open_web_math": 0.7640925049781799,
"eai_web_code": 0.7827111482620239
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
6,577,392,374,928,858,000 | Explore BrainMass
Explore BrainMass
Normal distributions: distribution of sums
Not what you're looking for? Search our solutions OR ask your own Custom question.
This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!
A straight rod is formed by connecting three sections A, B and C, each of which is manufactured on a different machine. The length of section A, in inches has a normal distribution with mean 20 and variance 0.04. The length of section B, in inches, has a normal distribution with mean 14 and variance 0.01. The length of section C, in inches, has a normal distribution with mean 26 and variance 0.04. The three sections are joined so that there is an overlap of 2 inches at each connection. The rod is used in construction of an airplane wing if its total length is between 55.7 and 56.3. What is the probability that the rod can be used?
© BrainMass Inc. brainmass.com March 4, 2021, 10:09 pm ad1c9bdddf
https://brainmass.com/statistics/normal-distribution/normal-distributions-distribution-sums-304793
Solution Summary
This solution shows how to find the distribution of the sum of a set of normal random variables.
$2.49
ADVERTISEMENT | {
"url": "https://brainmass.com/statistics/normal-distribution/normal-distributions-distribution-sums-304793",
"source_domain": "brainmass.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "330957",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MSD3NQDB4AAZUHGTTSVWOS6YYIBJP4B5",
"WARC-Concurrent-To": "<urn:uuid:3710cdf4-6843-433b-b6c5-04d57546ea52>",
"WARC-Date": "2021-09-22T05:54:52Z",
"WARC-IP-Address": "104.26.5.245",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:46ODFM2HDH4W6IFGMSIKZWHIAQ7RQTGF",
"WARC-Record-ID": "<urn:uuid:577052f2-7cf3-4857-b725-024d9a178999>",
"WARC-Target-URI": "https://brainmass.com/statistics/normal-distribution/normal-distributions-distribution-sums-304793",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:010ea86d-899a-4958-8384-4f956f552566>"
},
"warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-43\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
18,
19,
37,
38,
85,
86,
173,
174,
287,
288,
931,
932,
1002,
1105,
1106,
1127,
1128,
1229,
1230,
1240,
1241
],
"line_end_idx": [
18,
19,
37,
38,
85,
86,
173,
174,
287,
288,
931,
932,
1002,
1105,
1106,
1127,
1128,
1229,
1230,
1240,
1241,
1258
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1258,
"ccnet_original_nlines": 21,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34241244196891785,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.038910508155822754,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26459142565727234,
"rps_doc_frac_unique_words": 0.5684210658073425,
"rps_doc_mean_word_length": 5.1052632331848145,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.380403995513916,
"rps_doc_word_count": 190,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11752577126026154,
"rps_doc_frac_chars_dupe_6grams": 0.11752577126026154,
"rps_doc_frac_chars_dupe_7grams": 0.11752577126026154,
"rps_doc_frac_chars_dupe_8grams": 0.11752577126026154,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.027835050597786903,
"rps_doc_frac_chars_top_3gram": 0.034020621329545975,
"rps_doc_frac_chars_top_4gram": 0.05567010119557381,
"rps_doc_books_importance": -135.86984252929688,
"rps_doc_books_importance_length_correction": -135.86984252929688,
"rps_doc_openwebtext_importance": -84.14525604248047,
"rps_doc_openwebtext_importance_length_correction": -84.14525604248047,
"rps_doc_wikipedia_importance": -61.32796096801758,
"rps_doc_wikipedia_importance_length_correction": -61.32796096801758
},
"fasttext": {
"dclm": 0.13142573833465576,
"english": 0.9166656732559204,
"fineweb_edu_approx": 2.3876004219055176,
"eai_general_math": 0.994428277015686,
"eai_open_web_math": 0.625222384929657,
"eai_web_code": 0.03790045157074928
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "629.132",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "2",
"label": "Academic/Research"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
283,041,813,508,361,820 | Changeset 5243
Ignore:
Timestamp:
Dec 29, 2016, 11:23:44 PM (14 months ago)
Author:
cameron
Message:
Support for write function in CBuilder, use IRBuilder CreateMemMove? for llvm.memmove.p0i8.p0i8.i64
Location:
icGREP/icgrep-devel/icgrep
Files:
5 edited
Legend:
Unmodified
Added
Removed
• icGREP/icgrep-devel/icgrep/IR_Gen/CBuilder.cpp
r5242 r5243
1313#include <llvm/IR/TypeBuilder.h>
1414
15
15
16
17// ssize_t write(int fildes, const void *buf, size_t nbyte);
18Value * CBuilder::CreateWriteCall(Value * fildes, Value * buf, Value * nbyte) {
19 Function * write = mMod->getFunction("write");
20 if (write == nullptr) {
21 IntegerType * sizeTy = getSizeTy();
22 IntegerType * int32Ty = getInt32Ty();
23 PointerType * int8PtrTy = getInt8PtrTy();
24 write = cast<Function>(mMod->getOrInsertFunction("write",
25 AttributeSet().addAttribute(mMod->getContext(), 2U, Attribute::NoAlias),
26 sizeTy, int32Ty, int8PtrTy, sizeTy, nullptr));
27 }
28 return CreateCall(write, {fildes, buf, nbyte});
29}
30
1631Function * CBuilder::GetPrintf() {
1732 Function * printf = mMod->getFunction("printf");
• icGREP/icgrep-devel/icgrep/IR_Gen/CBuilder.h
r5242 r5243
5050
5151
52 // Create calls to unistd.h functions.
53 //
54 // ssize_t write(int fildes, const void *buf, size_t nbyte);
55 Value * CreateWriteCall(Value * fildes, Value * buf, Value * nbyte);
56
5257 // Create calls to Posix thread (pthread.h) functions.
5358 //
• icGREP/icgrep-devel/icgrep/kernels/stdout_kernel.cpp
r5238 r5243
88
99namespace kernel {
10
11 static Function * create_write(Module * const mod, IDISA::IDISA_Builder * builder) {
12 Function * write = mod->getFunction("write");
13 if (write == nullptr) {
14 IntegerType * sizeTy = builder->getSizeTy();
15 IntegerType * int32Ty = builder->getInt32Ty();
16 PointerType * int8PtrTy = builder->getInt8PtrTy();
17 write = cast<Function>(mod->getOrInsertFunction("write",
18 AttributeSet().addAttribute(mod->getContext(), 2U, Attribute::NoAlias),
19 sizeTy, int32Ty, int8PtrTy, sizeTy, nullptr));
20 }
21 return write;
22 }
2310
2411// The doBlock method is deprecated. But in case it is used, just call doSegment with
4128 auto savePoint = iBuilder->saveIP();
4229 Module * m = iBuilder->getModule();
43 Function * writefn = create_write(m, iBuilder);
4430 Function * doSegmentFunction = m->getFunction(mKernelName + doSegment_suffix);
4531 Type * i8PtrTy = iBuilder->getInt8PtrTy();
7359 Value * bytePtr = iBuilder->CreateGEP(iBuilder->CreateBitCast(basePtr, i8PtrTy), byteOffset);
7460
75 iBuilder->CreateCall(writefn, std::vector<Value *>({iBuilder->getInt32(1), bytePtr, iBuilder->CreateMul(itemsToDo, itemBytes)}));
76
61 iBuilder->CreateWriteCall(iBuilder->getInt32(1), bytePtr, iBuilder->CreateMul(itemsToDo, itemBytes));
62
7763 processed = iBuilder->CreateAdd(processed, itemsToDo);
7864 setProcessedItemCount(self, processed);
9783 auto savePoint = iBuilder->saveIP();
9884 Module * m = iBuilder->getModule();
99 Function * writefn = create_write(m, iBuilder);
10085 Function * finalBlockFunction = m->getFunction(mKernelName + finalBlock_suffix);
10186 Type * i8PtrTy = iBuilder->getInt8PtrTy();
11398 Value * byteOffset = iBuilder->CreateMul(iBuilder->CreateURem(processed, blockItems), itemBytes);
11499 Value * bytePtr = iBuilder->CreateGEP(iBuilder->CreateBitCast(basePtr, i8PtrTy), byteOffset);
115 iBuilder->CreateCall(writefn, std::vector<Value *>({iBuilder->getInt32(1), bytePtr, iBuilder->CreateMul(itemsAvail, itemBytes)}));
100 iBuilder->CreateWriteCall(iBuilder->getInt32(1), bytePtr, iBuilder->CreateMul(itemsAvail, itemBytes));
116101 setProcessedItemCount(self, producerPos);
117102 mStreamSetInputBuffers[0]->setConsumerPos(streamStructPtr, producerPos);
• icGREP/icgrep-devel/icgrep/kernels/streamset.cpp
r5240 r5243
128128
129129void LinearCopybackBuffer::setConsumerPos(Value * bufferStructPtr, Value * new_consumer_pos) {
130 Type * const i1 = iBuilder->getInt1Ty();
131130 Type * const i8 = iBuilder->getInt8Ty();
132 Type * const i32 = iBuilder->getInt32Ty();
133131 Type * const i8_ptr = i8->getPointerTo(mAddrSpace);
134132 IntegerType * const sizeTy = iBuilder->getSizeTy();
136134 Module * const M = iBuilder->getModule();
137135
138 Function * const memmoveFunc = cast<Function>(M->getOrInsertFunction("llvm.memmove.p0i8.p0i8.i" + std::to_string(sizeTy->getBitWidth()),
139 iBuilder->getVoidTy(), i8_ptr, i8_ptr, sizeTy, i32, i1, nullptr));
140136 Function * const current = iBuilder->GetInsertBlock()->getParent();
141137 BasicBlock * const copyBackBody = BasicBlock::Create(M->getContext(), "copy_back", current, 0);
175171 Value * const consumerBlock = iBuilder->CreateUDiv(consumerPos, blockWidth);
176172 Value * copyFrom = iBuilder->CreateGEP(bufferPtr, iBuilder->CreateSub(new_consumer_block, consumerBlock));
177 Value * alignment = ConstantInt::get(iBuilder->getInt32Ty(), iBuilder->getBitBlockWidth() / 8);
178
179 iBuilder->CreateCall(memmoveFunc, {iBuilder->CreateBitCast(bufferPtr, i8_ptr), iBuilder->CreateBitCast(copyFrom, i8_ptr), copyLength, alignment, ConstantInt::getNullValue(i1)});
173 unsigned alignment = iBuilder->getBitBlockWidth() / 8;
174 iBuilder->CreateMemMove(iBuilder->CreateBitCast(bufferPtr, i8_ptr), iBuilder->CreateBitCast(copyFrom, i8_ptr), copyLength, alignment);
180175 iBuilder->CreateBr(setConsumerPosExit);
181176 // Copy back done, store the new consumer position.
• icGREP/icgrep-devel/icgrep/u8u16.cpp
r5242 r5243
308308 Type * const inputType = ArrayType::get(ArrayType::get(bitBlockType, 8), 1)->getPointerTo();
309309 Type * const outputType = ArrayType::get(ArrayType::get(bitBlockType, 16), 1)->getPointerTo();
310 Type * const int32ty = iBuilder->getInt32Ty();
311 Type * const int8PtrTy = iBuilder->getInt8PtrTy();
312 Type * const voidPtrTy = iBuilder->getVoidPtrTy();
313310
314311 Function * const main = cast<Function>(mod->getOrInsertFunction("Main", voidTy, inputType, outputType, size_ty, nullptr));
Note: See TracChangeset for help on using the changeset viewer. | {
"url": "http://parabix.costar.sfu.ca/changeset/5243",
"source_domain": "parabix.costar.sfu.ca",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "39492",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PHOQGR4T4J3CNJEE2FPZCXCSHPQ5GFZE",
"WARC-Concurrent-To": "<urn:uuid:cb8420a5-c9be-4065-91fc-028ef8ab5089>",
"WARC-Date": "2018-02-24T03:39:25Z",
"WARC-IP-Address": "206.12.16.200",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:TG27FERSNXKZZCXJ7QPZ5AHCQYHD2GLL",
"WARC-Record-ID": "<urn:uuid:9f2626c0-ef80-4290-9328-751c029611a1>",
"WARC-Target-URI": "http://parabix.costar.sfu.ca/changeset/5243",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1dfc7d74-91ad-40a4-a75d-9e72c4d0f28e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-168-188-114.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
15,
16,
17,
25,
36,
78,
86,
94,
103,
104,
204,
205,
215,
242,
249,
258,
259,
267,
268,
279,
285,
293,
344,
345,
363,
404,
413,
424,
432,
440,
508,
595,
653,
688,
739,
792,
849,
922,
1058,
1168,
1181,
1240,
1249,
1257,
1300,
1361,
1410,
1411,
1429,
1441,
1453,
1503,
1517,
1589,
1669,
1680,
1747,
1762,
1819,
1820,
1838,
1845,
1870,
1878,
1970,
2027,
2062,
2122,
2184,
2250,
2322,
2434,
2521,
2534,
2559,
2568,
2577,
2673,
2679,
2728,
2776,
2835,
2926,
2981,
2987,
3093,
3102,
3243,
3254,
3367,
3375,
3442,
3494,
3500,
3549,
3597,
3656,
3750,
3806,
3812,
3923,
4030,
4173,
4288,
4344,
4431,
4484,
4485,
4503,
4514,
4619,
4672,
4727,
4782,
4848,
4914,
4920,
4976,
4987,
5136,
5277,
5359,
5469,
5475,
5566,
5687,
5795,
5807,
5997,
6064,
6211,
6265,
6331,
6372,
6373,
6391,
6498,
6607,
6666,
6729,
6792,
6806,
6943
],
"line_end_idx": [
15,
16,
17,
25,
36,
78,
86,
94,
103,
104,
204,
205,
215,
242,
249,
258,
259,
267,
268,
279,
285,
293,
344,
345,
363,
404,
413,
424,
432,
440,
508,
595,
653,
688,
739,
792,
849,
922,
1058,
1168,
1181,
1240,
1249,
1257,
1300,
1361,
1410,
1411,
1429,
1441,
1453,
1503,
1517,
1589,
1669,
1680,
1747,
1762,
1819,
1820,
1838,
1845,
1870,
1878,
1970,
2027,
2062,
2122,
2184,
2250,
2322,
2434,
2521,
2534,
2559,
2568,
2577,
2673,
2679,
2728,
2776,
2835,
2926,
2981,
2987,
3093,
3102,
3243,
3254,
3367,
3375,
3442,
3494,
3500,
3549,
3597,
3656,
3750,
3806,
3812,
3923,
4030,
4173,
4288,
4344,
4431,
4484,
4485,
4503,
4514,
4619,
4672,
4727,
4782,
4848,
4914,
4920,
4976,
4987,
5136,
5277,
5359,
5469,
5475,
5566,
5687,
5795,
5807,
5997,
6064,
6211,
6265,
6331,
6372,
6373,
6391,
6498,
6607,
6666,
6729,
6792,
6806,
6943,
7006
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7006,
"ccnet_original_nlines": 143,
"rps_doc_curly_bracket": 0.0027119601145386696,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.03352411836385727,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006541289854794741,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.524938702583313,
"rps_doc_frac_unique_words": 0.6020202040672302,
"rps_doc_mean_word_length": 9.202020645141602,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0.0008176600094884634,
"rps_doc_unigram_entropy": 5.385671615600586,
"rps_doc_word_count": 495,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10230515897274017,
"rps_doc_frac_chars_dupe_6grams": 0.018441269174218178,
"rps_doc_frac_chars_dupe_7grams": 0.018441269174218178,
"rps_doc_frac_chars_dupe_8grams": 0.018441269174218178,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.017782660201191902,
"rps_doc_frac_chars_top_3gram": 0.008781559765338898,
"rps_doc_frac_chars_top_4gram": 0.010976949706673622,
"rps_doc_books_importance": -470.5252685546875,
"rps_doc_books_importance_length_correction": -470.5252685546875,
"rps_doc_openwebtext_importance": -286.16766357421875,
"rps_doc_openwebtext_importance_length_correction": -286.16766357421875,
"rps_doc_wikipedia_importance": -95.74618530273438,
"rps_doc_wikipedia_importance_length_correction": -95.74618530273438
},
"fasttext": {
"dclm": 0.6828896403312683,
"english": 0.16194802522659302,
"fineweb_edu_approx": 3.3691704273223877,
"eai_general_math": -0.000009540000064589549,
"eai_open_web_math": 0.7120695114135742,
"eai_web_code": 0.9980712532997131
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "22",
"label": "Truncated"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
9,221,454,360,505,327,000 | Get number of connected components using Connectivity filter
Hi
I’m using the Connectivity filter to get the connected components in a mesh. Is there a way to get the number of connected components using python?
This is the code I have so far:
from paraview.simple import *
headbinaryzlibvti = XMLImageDataReader(FileName=['head-binary-zlib.vti'])
headbinaryzlibvti.PointArrayStatus = ['Scalars_']
renderView1 = GetActiveViewOrCreate('RenderView')
headbinaryzlibvtiDisplay = Show(headbinaryzlibvti, renderView1)
connectivity1 = Connectivity(Input=headbinaryzlibvti)
connectivity1Display = Show(connectivity1, renderView1) | {
"url": "https://discourse.paraview.org/t/get-number-of-connected-components-using-connectivity-filter/4609",
"source_domain": "discourse.paraview.org",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "13965",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DD6KPUBTWESAFLBBJK426OYGZSMOOB6G",
"WARC-Concurrent-To": "<urn:uuid:c3236929-93a5-4e87-a840-b1a2a524a0ae>",
"WARC-Date": "2022-05-20T00:55:54Z",
"WARC-IP-Address": "50.58.123.179",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:55B2JCUB6KCNWVOJSUFMHQ6OJRA3MFYI",
"WARC-Record-ID": "<urn:uuid:db9b9b14-80ce-4edd-9d33-69d145d3e041>",
"WARC-Target-URI": "https://discourse.paraview.org/t/get-number-of-connected-components-using-connectivity-filter/4609",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f939b050-c5ef-4f5f-8689-0ed5ccdc2386>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-153\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
61,
62,
65,
66,
214,
215,
247,
248,
278,
279,
353,
403,
453,
517,
518,
572
],
"line_end_idx": [
61,
62,
65,
66,
214,
215,
247,
248,
278,
279,
353,
403,
453,
517,
518,
572,
627
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 627,
"ccnet_original_nlines": 16,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22857142984867096,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01904761977493763,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3047618865966797,
"rps_doc_frac_unique_words": 0.6666666865348816,
"rps_doc_mean_word_length": 8.583333015441895,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.565537452697754,
"rps_doc_word_count": 60,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.12427183985710144,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.11067961156368256,
"rps_doc_frac_chars_top_3gram": 0.06601942330598831,
"rps_doc_frac_chars_top_4gram": 0.10485436767339706,
"rps_doc_books_importance": -43.204185485839844,
"rps_doc_books_importance_length_correction": -55.191688537597656,
"rps_doc_openwebtext_importance": -30.332489013671875,
"rps_doc_openwebtext_importance_length_correction": -42.31999206542969,
"rps_doc_wikipedia_importance": -14.696497917175293,
"rps_doc_wikipedia_importance_length_correction": -26.683998107910156
},
"fasttext": {
"dclm": 0.9565510153770447,
"english": 0.6510360240936279,
"fineweb_edu_approx": 3.2764732837677,
"eai_general_math": 0.9999405145645142,
"eai_open_web_math": 0.5784240365028381,
"eai_web_code": 0.9922015070915222
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "621.367",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "1",
"label": "Technically Flawed"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
5,261,527,189,823,020,000 | Questions tagged [elasticsearch]
Elasticsearch is a distributed, open source search and analytics engine.
Filter by
Sorted by
Tagged with
0
votes
1answer
63 views
Geocoding addresses including address cleaning and validation
I am tasked with building a geocoder (and in the long term reverse geocoder) from a local data I own. Since I am new to this and literature is relatively scarce, I would like to know what are some ...
2
votes
1answer
366 views
Better performance for geohash aggregation with PostGIS
I'm using the GeoNames (https://www.geonames.org/) dataset and want to aggregate the points in geohash of a specific precision. Beforehand I'm filtering with an bbox. So this is the query I came up ...
0
votes
0answers
25 views
Parsing text in feature class attachments
Is there any way to parse text in feature class attachments using ArcGIS Desktop? I have a feature class with ~60,000 features, all of which have an associated .pdf file. I would like to query the ...
1
vote
0answers
284 views
Provided shape has duplicate consecutive coordinates at: (-87.2576, 90.0, NaN) [closed]
I get the following error when I send POST request to GeoServer. This error occurs only with particular layer. Other layers work fine. <?xml version="1.0"?> <ServiceExceptionReport version="...
2
votes
1answer
299 views
Geoserver Point-to-Line Aggregation possible?
I'm trying to use Geoserver to serve a WMS displaying lines instead of points, but without changing the underlying data structure. Currently I'm displaying the data as simple points, which works fine. ...
8
votes
1answer
3k views
Calculating Optimal Geohash Precision from Bounding Box
I'm using Elasticsearch's GeoHash grid Aggregation to plot clusters on a map (using Leaflet). I understand that for larger areas a lower precision setting should be used to limit the number of buckets ...
1
vote
0answers
319 views
Get grid area from geographic coordinates
I have a list of geo coordinates. What I want is a list of grid areas and a number of geographic points in that area. By doing this I can get the information in which areas in the world the most ...
1
vote
2answers
1k views
Elasticsearch datastore for GeoServer
When searching for a possibility to use an Elasticsearch data store as a data source in GeoServer, I found this inofficial plugin. Its documentation states that you have to clone the Git repository ...
1
vote
1answer
263 views
ElasticSearch behaving different between cities
I'm experiencing some very strange behavior from Elasticsearch. I am using geo_bounding_box to search the area visible in Google Maps. I have data in New York and San Fransisco. New York behaves as ...
2
votes
2answers
2k views
Geocoding on OSM shapefiles via Elasticsearch
I want to get a geocoding system based on OSM data and Elasticsearch engine. I've tried some projects like komoot\photon, but, as I'm a really newbie in this, I stuck on preparing of the data for my ...
3
votes
1answer
2k views
Points of LinearRing do not form a closed linestring - one point intersection
I'm trying to index geojson data using elasticsearch. There is some kind of polygons that causing an error: "Points of LinearRing do not form a closed linestring". Looks like it happens because ...
2
votes
1answer
2k views
Converting OpenStreetMaps PBF to geojson with geocoding
I am able to convert PBF to geojson, but I lack the additional attributes like state, country, city, suburb, type of business etc which is offered by geocoding service like Nominatim. The geojson ...
5
votes
3answers
1k views
FME and elasticsearch
We are developing a system to disseminate information about roadkills. The source data comes from three different databases. We have set up a FME project which pulls geojson from the source databases, ... | {
"url": "https://gis.stackexchange.com/questions/tagged/elasticsearch",
"source_domain": "gis.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "155682",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VUGJ2ZHPDNYX6CWFEBZMR3JSZWEOMAN5",
"WARC-Concurrent-To": "<urn:uuid:bcf44551-af54-4e80-8bf9-aaafc0305dac>",
"WARC-Date": "2019-10-17T08:26:53Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZEEOUQYILBMWSCBL37R7KTY23F3VVTCC",
"WARC-Record-ID": "<urn:uuid:bc3cef47-cf42-4e4c-9ea6-80401c3350e6>",
"WARC-Target-URI": "https://gis.stackexchange.com/questions/tagged/elasticsearch",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ef2dcdc5-dc62-44c9-bc5c-0d74255fb81f>"
},
"warc_info": "isPartOf: CC-MAIN-2019-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-47.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
33,
34,
107,
108,
118,
128,
140,
142,
148,
156,
165,
166,
228,
229,
430,
432,
438,
446,
456,
457,
513,
514,
716,
718,
724,
733,
742,
743,
785,
786,
987,
989,
994,
1003,
1013,
1014,
1102,
1103,
1297,
1299,
1305,
1313,
1323,
1324,
1370,
1371,
1576,
1578,
1584,
1592,
1601,
1602,
1658,
1659,
1864,
1866,
1871,
1880,
1890,
1891,
1933,
1934,
2133,
2135,
2140,
2149,
2158,
2159,
2197,
2198,
2400,
2402,
2407,
2415,
2425,
2426,
2474,
2475,
2677,
2679,
2685,
2694,
2703,
2704,
2750,
2751,
2954,
2956,
2962,
2970,
2979,
2980,
3058,
3059,
3257,
3259,
3265,
3273,
3282,
3283,
3339,
3340,
3540,
3542,
3548,
3557,
3566,
3567,
3589,
3590
],
"line_end_idx": [
33,
34,
107,
108,
118,
128,
140,
142,
148,
156,
165,
166,
228,
229,
430,
432,
438,
446,
456,
457,
513,
514,
716,
718,
724,
733,
742,
743,
785,
786,
987,
989,
994,
1003,
1013,
1014,
1102,
1103,
1297,
1299,
1305,
1313,
1323,
1324,
1370,
1371,
1576,
1578,
1584,
1592,
1601,
1602,
1658,
1659,
1864,
1866,
1871,
1880,
1890,
1891,
1933,
1934,
2133,
2135,
2140,
2149,
2158,
2159,
2197,
2198,
2400,
2402,
2407,
2415,
2425,
2426,
2474,
2475,
2677,
2679,
2685,
2694,
2703,
2704,
2750,
2751,
2954,
2956,
2962,
2970,
2979,
2980,
3058,
3059,
3257,
3259,
3265,
3273,
3282,
3283,
3339,
3340,
3540,
3542,
3548,
3557,
3566,
3567,
3589,
3590,
3794
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3794,
"ccnet_original_nlines": 110,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3347107470035553,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05096419155597687,
"rps_doc_frac_lines_end_with_ellipsis": 0.11711712181568146,
"rps_doc_frac_no_alph_words": 0.1707988977432251,
"rps_doc_frac_unique_words": 0.4729064106941223,
"rps_doc_mean_word_length": 4.940886497497559,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.017906339839100838,
"rps_doc_unigram_entropy": 5.200084209442139,
"rps_doc_word_count": 609,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04852110147476196,
"rps_doc_frac_chars_dupe_6grams": 0.02924560010433197,
"rps_doc_frac_chars_dupe_7grams": 0.02924560010433197,
"rps_doc_frac_chars_dupe_8grams": 0.02924560010433197,
"rps_doc_frac_chars_dupe_9grams": 0.02924560010433197,
"rps_doc_frac_chars_top_2gram": 0.023928219452500343,
"rps_doc_frac_chars_top_3gram": 0.012961120344698429,
"rps_doc_frac_chars_top_4gram": 0.007976070046424866,
"rps_doc_books_importance": -314.013427734375,
"rps_doc_books_importance_length_correction": -314.013427734375,
"rps_doc_openwebtext_importance": -168.72576904296875,
"rps_doc_openwebtext_importance_length_correction": -168.72576904296875,
"rps_doc_wikipedia_importance": -121.53723907470703,
"rps_doc_wikipedia_importance_length_correction": -121.53723907470703
},
"fasttext": {
"dclm": 0.04135512933135033,
"english": 0.9069898128509521,
"fineweb_edu_approx": 1.2736425399780273,
"eai_general_math": 0.026803910732269287,
"eai_open_web_math": 0.1759064793586731,
"eai_web_code": 0.03479998931288719
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "910.285",
"labels": {
"level_1": "History and Geography",
"level_2": "Geography and Voyages and travels",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-3,146,163,267,333,873,700 | Results 1 to 3 of 3
Thread: Convert set to binary representation
1. #1
Convert set to binary representation
Hey everyone,
I have the following types:
Code:
TMyType = (mtOne = 1, mtTwo = 2, mtFour = 4, mtEight = 8);
TMySet = set of TMyType;
Now I want to define a function that takes a set of TMyType and turns it into a binary representation of that set (a.k.a Flags).
I've done the following:
Code:
r := 0;
for I := low(TMyType) to high(TMyType) do
if I in s then
r := r or Integer(I);
It works but there are some drawbacks:
> It only works for TMyType. I have to define a load of other ones if I have many set types that need conversion.
> It doesn't perform well when TMyType contains elements representing large numbers. The loop will go through all numbers between low(TMyType) and high(TMyType). This is really wastefull because in this case, I'd only use 1,2,4,8,16 etc..
Is there any better way of converting sets to binary representation? I feel that this would be a very powerfull feature. It allows you to make better wrappers for C libraries that make use of flags. Sets are much easier to use and are more high-level.
Thanks
Coders rule nr 1: Face ur bugz.. dont cage them with code, kill'em with ur cursor.
2. #2
Maybe like this?
Code:
procedure Foo;
var
Mask, Index: LongWord;
s: TMySet;
begin
s := [mtOne, mtTwo, mtSixteen];
Index := 1;
Mask := 0;
while Index <= Integer(High(TMyType)) do
begin
if TMyType(Index) in s then
Mask := Mask or Index;
Index := Index * 2;
end;
end;
3. #3
You guys are overdoing it a bit. Delphi already stores sets in the form of flags (only difference is that it uses 16 bytes of memory instead of 4 byte dword), so all you need to do to get your flags is type cast the set to a dword like this:
Flags := LongWord(AnySet);
if you want this to work you will have to use enumeration range from 0 to 31 (type TMyEnum = (meOne, meTwo{these are fine}, meThrityThree = 32{this will be out of range for a dword})
Posting Permissions
• You may not post new threads
• You may not post replies
• You may not post attachments
• You may not edit your posts
•
http://flippulseimages.com/Photos/piaggio-p180.html | {
"url": "http://www.pascalgamedevelopment.com/showthread.php?8037-Convert-set-to-binary-representation",
"source_domain": "www.pascalgamedevelopment.com",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "44542",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JNVEMVTO2ZXL45BVWSD4DNQ7FUXM4SFC",
"WARC-Concurrent-To": "<urn:uuid:0a4bcb40-7c6d-49ff-ba59-fec8d6275322>",
"WARC-Date": "2013-06-19T16:16:58Z",
"WARC-IP-Address": "50.63.75.1",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7VKYXVXV5TXOSEHOXZJLJ4L4WKM673RE",
"WARC-Record-ID": "<urn:uuid:e25249e0-2382-41a7-af65-4be18755ef08>",
"WARC-Target-URI": "http://www.pascalgamedevelopment.com/showthread.php?8037-Convert-set-to-binary-representation",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:144352e3-3a7a-4dd4-80f5-f80f6cab0795>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-60-113-184.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-20\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Spring 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
20,
21,
66,
67,
75,
76,
117,
118,
136,
137,
169,
170,
180,
245,
250,
281,
414,
415,
444,
445,
455,
469,
517,
540,
572,
615,
733,
976,
977,
1233,
1234,
1245,
1332,
1333,
1341,
1362,
1363,
1373,
1392,
1400,
1428,
1444,
1454,
1491,
1508,
1524,
1570,
1581,
1615,
1645,
1671,
1681,
1690,
1691,
1699,
1945,
1976,
2163,
2164,
2184,
2185,
2218,
2247,
2280,
2312,
2318
],
"line_end_idx": [
20,
21,
66,
67,
75,
76,
117,
118,
136,
137,
169,
170,
180,
245,
250,
281,
414,
415,
444,
445,
455,
469,
517,
540,
572,
615,
733,
976,
977,
1233,
1234,
1245,
1332,
1333,
1341,
1362,
1363,
1373,
1392,
1400,
1428,
1444,
1454,
1491,
1508,
1524,
1570,
1581,
1615,
1645,
1671,
1681,
1690,
1691,
1699,
1945,
1976,
2163,
2164,
2184,
2185,
2218,
2247,
2280,
2312,
2318,
2369
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2369,
"ccnet_original_nlines": 66,
"rps_doc_curly_bracket": 0.0016884800279513001,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33908045291900635,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02107279933989048,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.29118773341178894,
"rps_doc_frac_unique_words": 0.4959999918937683,
"rps_doc_mean_word_length": 4.2773332595825195,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0.005747130140662193,
"rps_doc_unigram_entropy": 4.9121174812316895,
"rps_doc_word_count": 375,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06608478724956512,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04987531155347824,
"rps_doc_frac_chars_top_3gram": 0.017456360161304474,
"rps_doc_frac_chars_top_4gram": 0.02493765950202942,
"rps_doc_books_importance": -255.66162109375,
"rps_doc_books_importance_length_correction": -255.66162109375,
"rps_doc_openwebtext_importance": -148.38790893554688,
"rps_doc_openwebtext_importance_length_correction": -148.38790893554688,
"rps_doc_wikipedia_importance": -83.02572631835938,
"rps_doc_wikipedia_importance_length_correction": -83.02572631835938
},
"fasttext": {
"dclm": 0.12389451265335083,
"english": 0.8943747282028198,
"fineweb_edu_approx": 1.7484972476959229,
"eai_general_math": 0.9709369540214539,
"eai_open_web_math": 0.3292360305786133,
"eai_web_code": 0.2953563332557678
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "6",
"label": "Indeterminate"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
4,110,278,640,880,440,300 | As I have mentioned in the previous post, this and the coming posts would describe ASH1 architecture and special features.
Below is the block diagram of ASH1.
ASH1 Block Diagram
It consists of a data stack, a control unit, a program counter, an arithmetic/ logic unit (ALU), a cyclic redundancy checksum (CRC) unit, an input port, two output ports, a wishbone interface unit, a register file, two FIFO buffers, and three flag registers. These components are interconnected among each other via two buses; data bus (dbus) and address bus (abus).
ASH1 instructions are 14-bit wide with one cycle per instruction (except for one type of CRC instruction), while its operands are 8-bit wide. The wishbone bus along with a set of interrupt signals enable ASH1 to communicate with upper controllers (e.g. Master CPU).
The instruction set is made up of 17 instructions optimized for I/O operations in terms of packet fields building and signaling.
Categories: Experiential
Leave a Reply
This site uses Akismet to reduce spam. Learn how your comment data is processed. | {
"url": "https://blog.aeste.my/2011/10/02/ash1-an-overview-2/",
"source_domain": "blog.aeste.my",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "110794",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TALTHAEU5XR7LZHBBDZQYSSUQVWUMWEQ",
"WARC-Concurrent-To": "<urn:uuid:4e9e2a5c-057d-4bc2-8169-466f89a4a4e4>",
"WARC-Date": "2018-11-21T16:13:36Z",
"WARC-IP-Address": "104.24.107.14",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:U7DSVSWQGGQCKRK7MDSQHGOFEJP7NI3R",
"WARC-Record-ID": "<urn:uuid:5b2e186f-4160-4f31-9235-8c717e647a48>",
"WARC-Target-URI": "https://blog.aeste.my/2011/10/02/ash1-an-overview-2/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:787142d1-f3bf-48dd-9471-1f22295a4cae>"
},
"warc_info": "isPartOf: CC-MAIN-2018-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-165-184-173.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
123,
124,
160,
161,
180,
181,
183,
184,
551,
552,
818,
819,
948,
949,
974,
975,
989,
990
],
"line_end_idx": [
123,
124,
160,
161,
180,
181,
183,
184,
551,
552,
818,
819,
948,
949,
974,
975,
989,
990,
1070
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1070,
"ccnet_original_nlines": 18,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.29439252614974976,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0607476606965065,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18691588938236237,
"rps_doc_frac_unique_words": 0.6878612637519836,
"rps_doc_mean_word_length": 4.890173435211182,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.585860729217529,
"rps_doc_word_count": 173,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.028368789702653885,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -92.35013580322266,
"rps_doc_books_importance_length_correction": -92.35013580322266,
"rps_doc_openwebtext_importance": -56.093624114990234,
"rps_doc_openwebtext_importance_length_correction": -44.708656311035156,
"rps_doc_wikipedia_importance": -27.93705940246582,
"rps_doc_wikipedia_importance_length_correction": -27.93705940246582
},
"fasttext": {
"dclm": 0.027511419728398323,
"english": 0.8976324200630188,
"fineweb_edu_approx": 2.5151937007904053,
"eai_general_math": 0.10617560148239136,
"eai_open_web_math": 0.10856592655181885,
"eai_web_code": 0.001249489956535399
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.15",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.22",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
787,200,315,450,564,400 | Boxes and Arrows » Andrew Otwell http://boxesandarrows.com Boxes and Arrows is devoted to the practice, innovation, and discussion of design; including graphic design, interaction design, information architecture and the design of business. Tue, 20 Jan 2015 08:00:56 +0000 en-US hourly 1 http://wordpress.org/?v=4.1 Programming for Information Architects http://boxesandarrows.com/programming-for-information-architects/ http://boxesandarrows.com/programming-for-information-architects/#comments Mon, 31 Mar 2003 23:14:38 +0000 http://boxesandarrows.com/programming-for-information-architects/ “You might have more in common with programmers than you think. Both programming and IA are mindsets oriented towards abstraction. We both generally want to find patterns and rules that describe and predict.”Have you ever been sitting in a meeting that takes a sudden turn for the incomprehensible? “I’ll subclass the DataProvider class to add an array of names, then you can override the sort method on that.” Yep, that’s a programmer talking. Nothing to do with information architecture, right? Well, not really.
You might have more in common with programmers than you think. Both programming and IA are mindsets oriented towards abstraction. We both generally want to find patterns and rules that describe and predict. We both appreciate the value of modular parts and components. We both are often concerned with handling structured content and metadata. But more often than not, IAs don’t know what’s going on with code. In this article, I’ll introduce you to some of the basic building blocks of programming.
I should make it clear right away that I’m not proposing a new method of doing IA or a better way of thinking about content, users, or context. But a better understanding of the programmers’ work might inspire your own. It’s important to focus on users during research and design, but to explain our ideas, IAs need to be able to create design documents that show some awareness of systems, programs, and other nuts and bolts. And of course, shared vocabularies and common understandings can go a long way in fostering better team communication.
What is programming?
Programming means giving instructions to a computer in a language it understands. It’s design in that it is organized, creative problem-solving. Like IA, it’s ideally both an art and a craft, combining learned techniques, creativity and an understanding of material restrictions.
The actual act of programming is almost always writing text, and programs are often written as one or more (often many more) text files and some associated assets, like images. (It’s only when the program is compiled that it’s bundled up into a software application, like the double-clickable software that sits on your desktop. Programs in some languages, like PHP or Perl, aren’t ever compiled into single entities, and always remain text files. Web-based applications are good examples of applications that aren’t compiled.) Except for some programming software that lets you program by dragging and dropping or filling out dialog boxes, coding usually means writing lines of text statements that together make up sets of rules and instructions for how a program should work.
There are “high-level” languages like Java or Perl which let programmers write in an English-like syntax, and “low-level” languages like machine language that aren’t really meant for humans to interact with. A Java programmer relies on several layers of interpretation and translation software to translate her Java instructions into an efficient low-level machine language optimized for the computer’s abilities and needs; in other words, silicon chips cannot flip bits on and off by directly carrying out Java code. Programming languages are, in fact, layers of increasing abstraction built upon each other, each written on top of lower-level languages: Flash’s ActionScript language is part of a program written in C++, which itself is a language written in Assembly language.
But the basic nuts and bolts of most contemporary high-level programming languages aren’t really that different. The rest of this article will look at these common building blocks: variables, conditional structures, loops and functions. In the next article, we’ll look at Object-Oriented Programming, a design and coding methodology used in most projects.
Variables
Like IA work, the problems programmers solve tend to be focused on how to represent and access data in efficient, scalable ways, and how to break a problem into its component parts and instructions. This is a process of abstraction, and the fundamental component of it is the variable.
It’s a lot easier to worry about data that changes, like my age, or the set of books currently in my Amazon shopping cart, by giving those concepts defined names, like myAge or itemsInCart. These names are variables. Variables are named containers for data; they’re like boxes with labels written on the outside. By putting a piece of data inside the box and referring to it by the label, the programmer has created an abstraction of that data which is easy to manipulate with code. You can also think of a variable as a placeholder for data, just like a box on a wireframe can be a placeholder for the information that will eventually appear there.
A programmer can create a variable pretty much any time he wants, simply by declaring it exists. This line of code creates a variable called myName with the value of “Andrew”:
myName = “Andrew”;
Your name probably isn’t the same as mine, so this variable, myName, lets the programmer write code that handles any name. The variable could have any name, although a descriptive name like “myName” is more explanatory and useful than “x.” There are certain words that are not allowed to be used as variable names in each programming language (“new” is a common one), but naming is mostly a matter of personal preference and informal standards among collaborators. Variables are amazingly flexible things; you can put strings of text (like “Boxes & Arrows”), numbers, lists of things (usually called Arrays), or even complicated types of structured data into them.
Whenever the programmer wants to use the value in the variable, he simply calls it by its name:
print(myName);
That line of code uses a function to print whatever the current value of myName is. (Let’s assume for now that “printing” is a built-in function of this programming language. There is more on functions below.) Again, this is a type of abstraction. This line of code will print the current value of myName, no matter what name’s been put in the variable.
Conditional structures
Conditional structures (sometimes called branching structures) are chunks of code that can examine a situation and determine how to respond to it. Assessing conditions and reacting appropriately is what makes software flexible and powerful.
Conditional structures have lots of obvious parallels in IA work, since this is how people think as well as computers: ifI have the time, then I’ll call my parents; if I’m signed in as a member, then I can access the archived articles; if the gas gauge in my car is lower than a quarter-tank AND if I have some cash AND if I’ll still have enough money left over for lunch, then I’ll get some fuel.
Checking a condition and responding to it is typically done with an if/then statement, and most programming languages let you write these in pretty much plain English.
Here, an if/then conditional statement checks to see if the variable myAge is greater than or equal to 18, and prints a message if it is:
if (myAge >= 18) then {
print (“You’re old enough to vote!”);
}
Why is the “myAge >= 18” inside parentheses? That’s the condition that’s checked when the program arrives at that line of code. If the condition evaluates as “true,” (here, if myAge is equal to or greater than 18, the overall condition is true) the computer will carry out the instructions between the { } brackets, otherwise those statements are ignored and the program skips to the next line of code after the closing bracket.
Loops
Computers are good at doing things fast. They’re really good at doing the same thing, or the same thing with slight predictable variations each time, over and over again. You might not enjoy searching through a list of ten thousand names looking for a particular one, but your computer will do it happily and quickly, thanks to the power of loops. Whenever a program needs to count a quantity, or sort things, or find something specific in a mass of information, it relies on some sort of loop.
Programming languages usually provide several ways to set up loops depending on what the programmer needs to do. Usually this means an action can be carried out a specific number of times or carried out repeatedly as long as a certain condition exists.
It’s common to use a “counter” variable to set up loops that run a specific number of times. Here’s an example of a “for” loop:
for (n=1; n <= 10; n++) {
print(“The current value of n is” n);
}
Let’s read this closely. “for” is a keyword that means “do something for this many times.” The three statements separated by semicolons inside the parentheses are the instructions for how to carry out the loop.
1. First, we’re creating a counter variable called n with an initial value of 1 (n=1;). The counter will tell us where we are in the loop.
2. We want the loop to keep running as long as n is less than or equal to 10 (n <= 10;).
3. With each pass through the loop, we increment n by 1 using a shorthand (n++;) that means “add one to the current value of n.” (By the way, this shorthand is where the C++ language gets its name. It’s based on the older C programming language, but it’s “c+1”.)
Just like in conditional structures, the brackets { } contain instructions that are carried out as long as the stated condition is true, in this case as long as n is less than or equal to 10. Here we just print the current value of n. The key is that n will be different each time through the loop. The result would look like this:
The current value of n is 1
The current value of n is 2
The current value of n is 9
The current value of n is 10
Why not just type ten single print() commands and get the identical result? In this case we knew how many times we wanted to loop, but what if our code had to handle a set of search results? How many results are there? There’s no way to know in advance. A search could result in 1, 37, or any number of hits. To display and format those results on the screen, a programmer must use a loop. Why? Because the instructions for handling one search result are the same as those for five, or fifty, or an unknown number, it’s just a question of how many times they’re carried out. Code must be able to handle both predictable and unpredictable situations, or else it will fail. Let’s improve our code with a variable called “totalNumber.”:
for(n=1; n < totalNumber; n++)
print (“The current value of n is” n);
}
Our code will still just print a list of numbers, but now it can handle whatever amount we throw at it as long as we set the variable totalNumber beforehand. We’ve actually done something very powerful here by using abstraction. We could set totalNumber to the number of times the user clicks the mouse in 5 seconds, or the digit the user types in a form field, or the number of results in a search query. Since we’ve successfully abstracted our code by removing the specific value of 10, it doesn’t matter what totalNumber is.
You should see a clear parallel with common information architecture components in loops. Besides lists of search results, loops show up when you list “the five most recent entries in the Resources category,” or “all authors in the system, grouped by Department,” or just “links to our most popular articles.”
Object-Oriented Programming
Variables, conditions, and loops are the basic building blocks of a programming language. You could write a simple program using just these, although it would be pretty inflexible, and it would be very hard to translate any real-world program requirements into code. Luckily in the early 1960’s some Norwegian programmers addressed these problems by inventing object-oriented programming.
What is Object-Oriented Programming?
Object-Oriented Programming (OOP) isn’t a programming language, it’s an approach to designing and building software. Before object-oriented programming, many programs were written as systematic sets of procedural instructions, often with lots of small subsections. Everything depended on everything else, so problems could creep in anywhere and have far-reaching consequences. This approach didn’t scale well, and as software got more complex, a new methodology was created.
Object-oriented programming turns out to be a very reasonable, common sense way of thinking about programming problems, because it breaks those problems down into their component parts and sets out rules for how those components can interact. Using code that’s built out of components means it’s easier to isolate problems and to reuse working components in other situations. If you’ve ever designed a page out of architectural components (like category lists, search box widgets, or “most popular topics” lists), you know how effective this approach can be.
How is it done?
Design using OOP is actually a lot like a top-down IA process: programmers break a large problem down into smaller discrete parts and arrange those parts in a parent-child hierarchy. Each component has a few specialized abilities and probably knows how to communicate with a few other objects in the system. Think about your car as an example: there’s an engine, an electrical system, a steering system, and several others. Your car’s exhaust system and electrical system don’t really have too much to do with each other, though they work together in an overall way to make the car run. Each of these interacting components is itself made up of smaller, replaceable components, like an ignition switch or a muffler. Some of these smaller components are themselves made up of standardized component parts bolted or wired together. This is the essence of OOP: a hierarchical system of independent component objects communicating though predictable ways to achieve an overall goal.
Programmers create classes to define each of the parts of the hierarchy. A class definition is a template from which individual objects can be generated. Typically not much more than a page or so of code, each class definition describes all the things a type of object knows how to do and the data it needs to carry out its functions.
Properties
To write a class definition for an Engine, for instance, we would first identify the crucial properties an engine has, such as having some number of cylinders, some amount of horsepower, running on either unleaded or diesel fuel, and so on.
Notice that our Engine class didn’t describe a specific “six-cylinder, 250 horsepower, unleaded fuel, Ford engine.” That would be one possible object that our class definition would permit. It would also permit a “four-cylinder, 130 horsepower, unleaded fuel, Toyota engine.” The power of the class definition is that it allows a programmer to create any number of objects with lots of variations. It’s only when an object is created (or instantiated) with these kinds of specific details that the programmer has something to work with.
Creating an object from an existing class definition is done by simply creating a variable:
var fordEngine = new Engine(6, 250, “unleaded”);
I’m glossing over some details here, but that line of code would create a variable named fordEngine that is a new object derived from the Engine class, with 6 cylinders, 250 horsepower, and using unleaded fuel. “new” is a command meaning “create a new object.”
Functions
So far, objects aren’t that different from the content objects you might define as an IA. For example, a document might have properties like Author Name, Last Modified Date, Keywords, or User Rating. But full-blown objects aren’t just a collection of properties like “horsepower” or “fuel type.” Their real power is that they also know how to do things. A phone “knows” how to ring when it gets an incoming call, a CD player “knows” how to play, stop, fast-forward, and pause discs in response to buttons on the remote control. A programmer would call these behaviors functions (or methods) of the phone and CD player objects. (You might think of properties as nouns and adjectives, and functions as verbs.) The functions in our Engine class definition would describe in detail the actions that all engines can perform, such as starting, stopping, or responding to changes in the amount of gasoline.
Functions are small sections of code that usually describe a single action. Like variables, they’re named, so print(), sortItems(), or cancelYesterdaysOrderList() could all be functions. The parentheses are used to indicate these are functions, not variable names. Functions can be used (or called) from other places in your program by referring to them by name. For instance, you could define a reusable function for the Engine class called start() that might handle the details of starting an engine. This function has comments instead of real code:
function start() {
// all the actual details of starting would be
// spelled out here, like specifying how electricity
// goes from the battery to the starter motor
}
Once defined, you could call your start() function on any Engine object and they’ll all work the same way. Typically, a function of an object is called by appending it after the object’s name and a dot. We’ll use our fordEngine object:
fordEngine.start();
Functions can also accept values to work with called parameters. Parameters allow functions to work as general-purpose tools that take some raw materials, perform some predictable action on them, and hand back a result in a predetermined form. For our Engine class, regulating the current speed is a function that depends on how much gas the driver’s giving:
function regulateSpeed(gasAmount) {
newEngineSpeed = currentEngineSpeed + gasAmount;
}
Ok, that’s a bit oversimplified, but you get the point. This function regulateSpeed expects a value (gasAmount) to work with and adjusts the speed of the Engine based on that number. You’d call this function just like the start() function, but with some number for gasAmount:
fordEngine.regulateSpeed(5.13);
There are a couple more key ideas to understand about OOP: inheritance and encapsulation.
Inheritance
In any object-oriented system, some classes will be variations on parent classes in a top-down hierarchy. This is called inheritance. The concept of inheritance means that a programmer can create a child class that adds to the abilities of a parent class without affecting existing abilities or data the child learned from its parent. In other words, child objects are born knowing everything their parents know, and more.
That sounds complex, but we can easily state this in a way that will be familiar to IAs. Imagine some information with a general class of content types called “Product Documents” that are different from “Forms” and “Presentations.” “Product Documents” might have metadata properties associated with them that might not be relevant for “Forms” such as “product name,” “author”, “department”, “last updated date” or others.
Perhaps each Product Document could be “subclassed” into more specific sub-types, such as “Technical Documents,” “White Papers” and “Marketing Reports.” As “children” of the Product Document type, these all inherit their parent’s metadata fields, but might also in addition specify metadata fields exclusive to their own uses. For example, Technical Documents might need to keep track of an associated “version number” field. To an IA, these documents are content types with metadata, organized in a meaningful hierarchy. To a programmer, these are custom data types and good candidates for class definitions. They’re objects, each with a set of properties, hierarchically organized according to the principle of inheritance. One big difference is that information architects don’t typically add functions to content types; what does a Product Document “know” how to do, for example?
Encapsulation
Objects are “black boxes.” Do you know how your digital clock works inside? Neither do I, and why should we? It’s basically an enclosed unit that hides its inner workings and exposes a few useful functions to me in an interface, such as the buttons for setting the time and turning the alarm on and off. As long as it keeps time and wakes me up, I don’t need to know much else about it. The concept of encapsulation says that objects should also be “black boxes” that hide the details of how they work, while exposing a few functions in an interface. Since they’re not physical objects, their interfaces aren’t buttons and dials, but specific “public” functions that are available for other programmers and objects to interact with.
If a programmer wants to put a clock into a piece of software, he doesn’t spend time writing a bunch of logic to add 60-second units into minutes and 60-minute units into hours. Instead, he would use an existing object that provided a simple interface to the most useful functions such as showCurrentTime(), setAlarmTime(), snoozeButton() and so on. To the programmer, these functions work exactly like a physical interface. I don’t really know what happens when I smash the Snooze button on my clock except that it stops ringing for 10 minutes. The principle of encapsulation means that the programmer using the digital clock object can confidently write code that uses its snoozeButton() function, without worrying about how that function is implemented.
Conclusion
There’s sometimes a tendency among IAs and designers in general to distance ourselves from the details of programming work. But as we’ve seen, there’s no reason for it to be puzzling or mysterious. I hope this article has cleared up at least some of the terms used in programming and introduced you to some of the basics. We’ve looked at variables, conditional structures, loops, and objects, and seen that these concepts have direct parallels in information architecture. Maybe you’re not ready to take on coding your next project yourself, but I hope you’re better equipped for your next meeting with a programmer.
Andrew Otwell is an information architect and interaction designer living in Austin, Texas. Andrew earned a Master’s degree in Art History at the University of Texas, where he studied Surrealist and Dada art. In 1997, he finally admitted his real interests were with digital design and the web, and so left academia. Fortunately, it turned out that the analysis of visual culture and the analysis of information for the web weren’t so very incompatible, so Andrew found himself doing and teaching information architecture and interaction design in Austin and Berlin. His website is heyotwell.com
]]>
http://boxesandarrows.com/programming-for-information-architects/feed/ 24 | {
"url": "http://boxesandarrows.com/author/andrewotwell/feed/",
"source_domain": "boxesandarrows.com",
"snapshot_id": "crawl=CC-MAIN-2015-06",
"warc_metadata": {
"Content-Length": "28875",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QMQ6LWQVQD3UZFE2JYHWG2PUZ3ZI3OUV",
"WARC-Concurrent-To": "<urn:uuid:07c7fd78-6317-4e9d-bc72-ded1b8669f76>",
"WARC-Date": "2015-01-29T00:15:29Z",
"WARC-IP-Address": "173.255.232.228",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7R46MIHLH5T3ZBWYW2WCAM7MST5DMLIC",
"WARC-Record-ID": "<urn:uuid:984b4898-350c-42ce-a0ed-7ea7b2f05795>",
"WARC-Target-URI": "http://boxesandarrows.com/author/andrewotwell/feed/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c814bd89-6b5a-41bb-8540-0b904a6534ef>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-212-252.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-06\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for January 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
1109,
1110,
1610,
1611,
2157,
2158,
2179,
2459,
2460,
3239,
3240,
4020,
4021,
4377,
4378,
4388,
4674,
5324,
5325,
5501,
5502,
5527,
5528,
6193,
6194,
6290,
6291,
6312,
6313,
6667,
6668,
6691,
6932,
6933,
7331,
7332,
7500,
7501,
7639,
7640,
7670,
7716,
7724,
7725,
8154,
8155,
8161,
8656,
8657,
8910,
8911,
9039,
9040,
9072,
9118,
9126,
9127,
9338,
9339,
9480,
9571,
9836,
9837,
10169,
10170,
10198,
10226,
10227,
10255,
10284,
10285,
11019,
11020,
11059,
11108,
11118,
11119,
11647,
11648,
11958,
11959,
11987,
12376,
12377,
12414,
12889,
12890,
13449,
13450,
13466,
14445,
14446,
14781,
14782,
14793,
15034,
15035,
15572,
15573,
15665,
15666,
15723,
15724,
15985,
15986,
15996,
16896,
16897,
17449,
17450,
17477,
17536,
17601,
17659,
17669,
17670,
17906,
17907,
17935,
17936,
18295,
18296,
18340,
18399,
18409,
18410,
18686,
18687,
18727,
18728,
18818,
18819,
18831,
19254,
19255,
19677,
19678,
20562,
20563,
20577,
21310,
21311,
22068,
22069,
22080,
22697,
22698,
22699,
23295,
23296,
23300
],
"line_end_idx": [
1109,
1110,
1610,
1611,
2157,
2158,
2179,
2459,
2460,
3239,
3240,
4020,
4021,
4377,
4378,
4388,
4674,
5324,
5325,
5501,
5502,
5527,
5528,
6193,
6194,
6290,
6291,
6312,
6313,
6667,
6668,
6691,
6932,
6933,
7331,
7332,
7500,
7501,
7639,
7640,
7670,
7716,
7724,
7725,
8154,
8155,
8161,
8656,
8657,
8910,
8911,
9039,
9040,
9072,
9118,
9126,
9127,
9338,
9339,
9480,
9571,
9836,
9837,
10169,
10170,
10198,
10226,
10227,
10255,
10284,
10285,
11019,
11020,
11059,
11108,
11118,
11119,
11647,
11648,
11958,
11959,
11987,
12376,
12377,
12414,
12889,
12890,
13449,
13450,
13466,
14445,
14446,
14781,
14782,
14793,
15034,
15035,
15572,
15573,
15665,
15666,
15723,
15724,
15985,
15986,
15996,
16896,
16897,
17449,
17450,
17477,
17536,
17601,
17659,
17669,
17670,
17906,
17907,
17935,
17936,
18295,
18296,
18340,
18399,
18409,
18410,
18686,
18687,
18727,
18728,
18818,
18819,
18831,
19254,
19255,
19677,
19678,
20562,
20563,
20577,
21310,
21311,
22068,
22069,
22080,
22697,
22698,
22699,
23295,
23296,
23300,
23373
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 23373,
"ccnet_original_nlines": 151,
"rps_doc_curly_bracket": 0.0005561999860219657,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43095341324806213,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009619499556720257,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17357845604419708,
"rps_doc_frac_unique_words": 0.2836576998233795,
"rps_doc_mean_word_length": 4.981071472167969,
"rps_doc_num_sentences": 196,
"rps_doc_symbol_to_word_ratio": 0.00021377000666689128,
"rps_doc_unigram_entropy": 5.987716197967529,
"rps_doc_word_count": 3751,
"rps_doc_frac_chars_dupe_10grams": 0.02044530026614666,
"rps_doc_frac_chars_dupe_5grams": 0.043299078941345215,
"rps_doc_frac_chars_dupe_6grams": 0.026760859414935112,
"rps_doc_frac_chars_dupe_7grams": 0.02044530026614666,
"rps_doc_frac_chars_dupe_8grams": 0.02044530026614666,
"rps_doc_frac_chars_dupe_9grams": 0.02044530026614666,
"rps_doc_frac_chars_top_2gram": 0.00524513004347682,
"rps_doc_frac_chars_top_3gram": 0.007493040058761835,
"rps_doc_frac_chars_top_4gram": 0.007278960198163986,
"rps_doc_books_importance": -2261.06005859375,
"rps_doc_books_importance_length_correction": -2261.06005859375,
"rps_doc_openwebtext_importance": -1197.6724853515625,
"rps_doc_openwebtext_importance_length_correction": -1197.6724853515625,
"rps_doc_wikipedia_importance": -975.4288940429688,
"rps_doc_wikipedia_importance_length_correction": -975.4288940429688
},
"fasttext": {
"dclm": 0.6135619282722473,
"english": 0.9237754344940186,
"fineweb_edu_approx": 2.897822618484497,
"eai_general_math": 0.9086883664131165,
"eai_open_web_math": 0.2566760778427124,
"eai_web_code": 0.9661259651184082
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "001.51",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Intellectual life"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
3,964,169,964,532,423,700 | proxy problem
Author Message
Stefan 09/30/2005 05:11 am
I did some more work using proxy lists and came across a strange behaviour of OE. I have set the timeout to 10 seconds in the project to make sure that we don`t get stuck with super slow proxies not reacting at all, and it seems that if whenever this timeout is kicking in OE creates a file containing "[ST htt" at the start of the file instead of skipping the file and readding it to the queue.
Stefan
Oleg Chernavin 09/30/2005 06:56 am
Can you create a Project that would reproduce that. Please use Proxy=... line in its URLs field to specify the slow proxy.
Thank you!
Oleg.
Stefan 10/03/2005 08:58 am
I couldn`t set up a test project for you to test it, but from what I see it happens whenver the connection times out (or when the connection timeout time is reached).
Stefan
Oleg Chernavin 10/03/2005 10:02 am
Maybe a very slow proxy server address/port to test with?
Oleg.
Stefan 10/04/2005 04:48 am
I will try to make test case for you as soon as I can construct one.
Stefan | {
"url": "https://metaproducts.com/forum/offline-explorer-pro/2368",
"source_domain": "metaproducts.com",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "22714",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:U3YUNKA7DA22SHF3IAO7XCJP5ECUCTAP",
"WARC-Concurrent-To": "<urn:uuid:9065e399-6b7d-4b2f-bf2d-05ab3c8e1393>",
"WARC-Date": "2019-07-19T12:45:37Z",
"WARC-IP-Address": "107.180.37.105",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QRH4ZZG2XNL77I3RCDKI3QQTUW4YLP5Q",
"WARC-Record-ID": "<urn:uuid:3a3fed2a-5791-43f1-ae3d-0fa8d17a5192>",
"WARC-Target-URI": "https://metaproducts.com/forum/offline-explorer-pro/2368",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bc1ba8e3-34bf-404b-bbc2-0fd86e1fe076>"
},
"warc_info": "isPartOf: CC-MAIN-2019-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-144-233-243.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
14,
15,
30,
57,
453,
454,
461,
496,
619,
620,
631,
632,
638,
665,
832,
833,
840,
875,
933,
934,
940,
967,
1036,
1037
],
"line_end_idx": [
14,
15,
30,
57,
453,
454,
461,
496,
619,
620,
631,
632,
638,
665,
832,
833,
840,
875,
933,
934,
940,
967,
1036,
1037,
1043
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1043,
"ccnet_original_nlines": 24,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.395061731338501,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.037037041038274765,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2469135820865631,
"rps_doc_frac_unique_words": 0.591623067855835,
"rps_doc_mean_word_length": 4.225131034851074,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0.0041152299381792545,
"rps_doc_unigram_entropy": 4.4781494140625,
"rps_doc_word_count": 191,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.011152420192956924,
"rps_doc_frac_chars_top_3gram": 0.047087978571653366,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -91.01375579833984,
"rps_doc_books_importance_length_correction": -91.01375579833984,
"rps_doc_openwebtext_importance": -59.470760345458984,
"rps_doc_openwebtext_importance_length_correction": -46.501502990722656,
"rps_doc_wikipedia_importance": -38.40584182739258,
"rps_doc_wikipedia_importance_length_correction": -38.40584182739258
},
"fasttext": {
"dclm": 0.20388644933700562,
"english": 0.9142415523529053,
"fineweb_edu_approx": 1.2642991542816162,
"eai_general_math": 0.7135618925094604,
"eai_open_web_math": 0.3591023087501526,
"eai_web_code": 0.08988016843795776
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-2,665,338,764,702,477,000 | Real-time Web Apps with Volt in Ruby
volt
Volt is a slick, new Ruby web framework that aims to blur the line between client and server code. The basic idea behind the framework is that you can write your client-side code (which is usually Javascript) in Ruby using Opal, a Ruby runtime within Javascript. In addition, Volt provides some nice ways to relay data between the client-side and the server-side. If you’ve used Meteor before, Volt is a very similar idea, but there are many portions of Meteor which Volt doesn’t have. I think Volt has some real potential. As web apps become more and more client-side heavy, it is a pain to have to switch mental context between Javascript and Ruby. It’s even more of a pain to figure out how to flow simple pieces of data between the client and server. Volt can help you get there quickly.
In this article, I’ll go through how to build an incredibly simple bookmark “app” with Volt. The point of this article is to get you up to speed with some of the very basics and to get you a feel for how the client/server divide works in Volt. Let’s get to it.
Views
First of all, we need a copy of Volt:
gem install volt
If you’ve used Rails before, then you’ll find some of the “volt” command line arguments pretty familiar. Here’s how we create a new project:
volt new volt-example
You should see a familiar-looking (if you’re a Rails kind of person) directory layout:
Gemfile
Gemfile.lock
README.md
app
config
config.ru
lib
spec
To see what Volt has already set up for us, fire up the web server:
bundle exec volt server
You should see something like this:
Volt Web Server
Alright, so where is this page generated, exactly? If you go into the app directory, you should see a “main” directory. Unlike Rails, Volt lets you break your webapp up into “components” (this idea is similar to the Django style of separation). It automatically defines the “main” component for you, so let’s head into that directory. You now see:
assets
config
controllers
models
tasks
views
If you peek in views/main, you can see the views associated with this component. The layout for the views that are part of this component is defined in main.html which looks like:
<:Title>
{{ template main_path, "title", {controller_group: 'main'} }}
<:Body>
<div class="container">
<div class="header">
<ul class="nav nav-pills pull-right">
<:nav href="/" text="Home" />
<:nav href="/about" text="About" />
<:user-templates:menu />
</ul>
<h3 class="text-muted">volt-example</h3>
</div>
<:volt:notices />
{{ template main_path, 'body', {controller_group: 'main'} }}
<div class="footer">
<p>© Company 2014</p>
</div>
</div>
<:Nav>
<li class="{{ if active_tab? }}active{{ end }}">
<a href="{{ attrs.href }}">{{ attrs.text }}</a>
</li>
The odd looking <:body>, <:title>, etc. are a pretty integral part of how views work in Volt. Basically, if you see a tag in the form <:tagname> (note the capitalized first letter), it is defining or utilizing a section. In the layout, we are defining three sections: <:title>, <:body> and <:nav> which include some basic layout and then defer to the template of the action we have called. Specifically, these are the two lines that call the action templates:
{{ template main_path, "title", {controller_group: 'main'} }}
...
{{ template main_path, 'body', {controller_group: 'main'} }}
In Volt, wherever we have some code enclosed by {{ and }}, it is executed as Ruby using Opal. In this case, we’re using some of the variables available in order to pull up the template appropriate for the page using this layout. Alright, let’s look at one of these templates. Open up app/main/views/main/about.html:
<:Title>
About
<:Body>
<h1>About</h1>
<p>About page...</p>
That looks pretty simple! Basically, we’re just filling in the sections in the layout. Let’s jump back to the template to examine it a bit more closely. You might notice that some of tags are in the form <:tagname> (note the lowercase first letter). These are not sections; they are controls. In a sense, they are like Rails’ template helpers (e.g. link_to) since they help you generate some HTML. We’ll see some more of those as we continue.
Routes and Adding a View
Alright, that’s enough knowledge for the timebeing. Let’s get started building our bookmarking app. We’ll need one page where the user can see the list of bookmarks and add a new one. We’ll deal with the functionality as we move along, but first, create a new view and a route to go with it. Creating a view is simple; just create the file app/main/views/main/bookmarks.html:
<:Title>
Bookmarks
<:Body>
<h1>Bookmarks</h1>
To add the route, we go over to config/routes.rb and the following line:
get '/bookmarks', _action: 'bookmarks'
Annnd, that’s it! You’ll have to restart the server (the author of Volt says that soon you won’t have to do this) and then you should see a nice page at localhost:3000/bookmarks. In fact, we can make the bookmarks action the index by changing the last line of config/routes.rb to the following:
get '/', {_action: 'bookmarks'}
Another neat thing about Volt is that it gives you automatic page reloads. If you try changing the contents of app/main/views/main/bookmarks.html and then save the file, you will be able to see the page reload in the browser.
The Basic Pieces
Le’ts figure out how to process a form so that we can actually create new bookmarks. Subsequently, we want to display these bookmarks nicely on a page. Before we do that, it is incredibly important to understand a fundamental difference between Volt and Rails. Volt is a sort of MVVM (Model View, View Model)) framework, not an MVC framework. In practical terms, the view in Volt calls on the controller to get stuff done, not the other way around.
First of all, we need a form. That’s pretty easy, just add the following to the <:body> of bookmarks.html:
<form e-submit="add_bookmark" role="form">
<div class="form-group">
<label>New Bookmark</label>
<input class="form-control" type='text' value="{{ page._new_bookmark._description }}" />
<input class="form-control" type="text" value="{{ page._new_bookmark._url }}" />
<input type="submit" value="Add Bookmark" />
</div>
</form>
Alright, some parts of this code are run-of-the-mill, others aren’t. We have what seems like a simple form element. However, it has some weird attributes, e.g. e-submit. Here, e-submit = "add_bookmark" is telling Volt that the add_bookmark method/action in the controller should be called when data in this form is submitted. The other two weird lines are:
<input class="form-control" type="text" value="{{ page._new_bookmark._description }}" />
<input class="form-control" type="text" value="{{ page._new_bookmark._url }}" />
We are defining text input elements but the magic happens in the value field. Within the value = "..." attribute, we are creating a binding. When the value of those text elements change, the values of the variables page._new_bookmark._description and page._new_bookmark._url will change. At this point, this form will do nothing important since we haven’t really put anything in the add_bookmark controller action. So, open up app/main/controllers/main_controller.rb and the add the following as a method:
def add_bookmark
page._bookmarks << {url: page._new_bookmark._url, description: page._new_bookmark._description}
page._new_bookmark._url = 'URL'
page._new_bookmark._description = 'Description'
end
In Volt, this thing called page is a model. It isn’t a model in the Rails sense of the word – it doesn’t necessarily have anything to do with your database. Instead, a model is a piece of data that the frontend and backend can both get. Remember that Volt is not just a server-side Ruby framework (such as Rails or Sinatra). The point of Volt is that it lets the client-side and server-side interoperate pretty seamlessly.
Back to page. In the form, we’ve bound the variables page._new_bookmark._description and page._new_bookmark._url (notice the underscores prepending the variable names; using those automatically gives us empty models to put data in) to certain form values. In the controller code, we can take these variables and use them! Update them in the view and the changes to those variables are available in the controller. This might not seem all that magical at first glance, but the power of the idea comes from the fact that you could create a model of any kind in the client and then expect it to show up when you call controller code from the view.
The controller then takes page._bookmarks and puts a Ruby hash inside with what represents the data associated with one bookmark in our simple webapp. Before we can see the results of our efforts, we need to have a bit of code in the view that displays these bookmarks:
<ul class="bookmark-list">
{{ page._bookmarks.each do |bookmark| }}
<li>
<a href="{{ bookmark._url }}">{{ bookmark._descr }}</a>
</li>
{{ end }}
</ul>
Alrighty, head over to “localhost:3000”, you’ll see a pretty plain looking form where you can enter a description and a URL, hit enter, and see it appear in the list of bookmarks just below.
Persistence
If you refresh your page after inputting some of those bookmarks, you’re in for a nasty suprise: they probably all just vanished. We need some way to persist that information.
Persistence is really easy in Volt, but it does come with a gotcha: Volt currently only supports MongoDB if you want to use the client-server-sharing magic. You might ask why Volt doesn’t support something more “standard”, like Postgres or MySQL. The problem is that translating JSON objects to and from multiple SQL tables is quite a headache and we’d need an ORM in the middle. Essentially, Volt is part of the camp that believes that having that sort of a translationary ORM within a web framework is a bad idea.
If you don’t have a copy of Mongo, it’s pretty easy to get. On Mac OS X:
brew install mongodb
mongod
If you’re on Linux, for our purposes, using the version of Mongo available in your distribution’s package manager should be fine. With Windows, I’ve found this guide helpful.
If you head over to db/config/app.rb, you;ll find the following lines commented out:
config.db_driver = 'mongo'
config.db_name = (config.app_name + '_' + Volt.env.to_s)
config.db_host = 'localhost'
config.db_port = 27017
Just bring them back into existence. We’ll need to create a model for our bookmarks. Since “models” in Volt aren’t really connected to a “CREATE TABLE” SQL command, we don’t really have to specify much. We just have to create the file app/main/models/bookmark.rb and drop in:
class Bookmark < Volt::Model
end
Your database setup is ready to go after a restart of the Volt server. We do, however, need to change our view and controller a bit. Remember the page._bookmarks array we were putting our bookmarks into? In order to make that sync into MongoDB, we just have to change page._bookmarks to _bookmarks. Volt will handle the rest.
Here are the changed lines:
_bookmarks << {url: page._new_bookmark._url, description: page._new_bookmark._description}
{{ _bookmarks.each do |bookmark| }}
That’s it! Notice how easily we are getting data from the browser to Mongo. However, there are a few issues with this approach. This idea of database syncing between the client and server came into fashion with Meteor. However, Meteor takes the client-server connection a step further with a completely client-side implementation of Mongo. In addition, Meteor lets your app listen for changes in collections on the server and get them pushed directly to the client database. This stuff isn’t part of Volt, as far as one can tell from the existing documentation. So, Volt’s persistence support isn’t quite as powerful as that of Meteor when it comes to real-time applications with live data updates.
That’s a Wrap!
We’ve only scratched the very surface of Volt. In fact, our bookmark manager looks a bit…garbage. But, we’ve come far enough to give you a taste of what the basic idea of Volt is: closer and easier integration between the client and server.
The code for this article can be found on Github.
Sponsors
Replies
1. Thanks for the article on volt smile One thing, in your demo code, when you change to using store, you need to either reference store directly in the views:
store._bookmarks
or you need to set the controllers model to be :store
class MainController < Volt::ModelController
model :store
...
end
Also, Volt has realtime updates like Meteor. We do things a bit different implementation, but the end result is the same, updates are pushed to clients and the DOM updates when the data changes. Let me know if there's anything I can help clarify.
Again, thanks for the great article!
Ryan (volt framework creator)
2. Hi Ryan,
Thanks for the compliments. I had the controller model setting in my code but didn't include it in the article - I'll get it changed right away.
The point I was making about Meteor was just pointing out the differing implementation; as far as I know, Volt does not have a small implementation of MongoDB running in the browser. I can reword it to make that more clear.
Thanks,
Dhaivat
3. Volt looks very interesting. I have held off building anything with it so far, but I'm definitely going to follow this tutorial and go from there. Great article.
4. alpop says:
One funny thing I get - when I enter www.google.com for the url, than the actual url I get in the bookmarks list is localhost:3000/www.google.com. Any idea as to why this happens?
5. @estebanrules Thanks!
@alpop If you add the "http://" at the beginning of the url string, that should enter it correctly. Otherwise, it is rendered as a local, relative path which is why it opens as "localhost:3000/www.google.com/". | {
"url": "https://www.sitepoint.com/real-time-web-apps-volt-ruby/",
"source_domain": "www.sitepoint.com",
"snapshot_id": "crawl=CC-MAIN-2019-13",
"warc_metadata": {
"Content-Length": "75969",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HA3ATMBILIGSZ24YRQ5XK34SGNRDWH7I",
"WARC-Concurrent-To": "<urn:uuid:8f90eb5f-2cc0-486b-b08b-0806b41e917c>",
"WARC-Date": "2019-03-19T02:39:12Z",
"WARC-IP-Address": "54.148.84.95",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7OA5PIYNKEJJGHJ7VRANLA2VPTV57KWI",
"WARC-Record-ID": "<urn:uuid:997ac9ab-1237-4d8c-9ea8-4a0440492e6e>",
"WARC-Target-URI": "https://www.sitepoint.com/real-time-web-apps-volt-ruby/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a5680697-4f6e-4cc0-bdff-1c026a3196a8>"
},
"warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-171-229-147.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
37,
38,
43,
44,
836,
837,
1098,
1099,
1105,
1106,
1144,
1145,
1162,
1163,
1304,
1305,
1327,
1328,
1415,
1416,
1424,
1437,
1447,
1451,
1458,
1468,
1472,
1477,
1478,
1546,
1547,
1571,
1572,
1608,
1609,
1625,
1626,
1974,
1975,
1982,
1989,
2001,
2008,
2014,
2020,
2021,
2201,
2202,
2211,
2275,
2276,
2284,
2310,
2335,
2379,
2417,
2461,
2494,
2506,
2553,
2564,
2565,
2587,
2588,
2653,
2654,
2679,
2712,
2723,
2724,
2733,
2734,
2741,
2792,
2844,
2852,
2853,
3313,
3314,
3376,
3380,
3441,
3442,
3758,
3759,
3768,
3776,
3777,
3785,
3802,
3803,
3826,
3827,
4270,
4271,
4296,
4297,
4673,
4674,
4683,
4695,
4696,
4704,
4725,
4726,
4799,
4800,
4839,
4840,
5135,
5136,
5168,
5169,
5395,
5396,
5413,
5414,
5863,
5864,
5971,
5972,
6015,
6044,
6080,
6177,
6267,
6320,
6331,
6339,
6340,
6697,
6698,
6787,
6868,
6869,
7375,
7376,
7393,
7491,
7525,
7575,
7579,
7580,
8003,
8004,
8649,
8650,
8920,
8921,
8948,
8991,
8998,
9064,
9072,
9084,
9090,
9091,
9282,
9283,
9295,
9296,
9472,
9473,
9989,
9990,
10063,
10064,
10085,
10092,
10093,
10268,
10269,
10354,
10355,
10382,
10439,
10468,
10491,
10492,
10768,
10769,
10798,
10802,
10803,
11129,
11130,
11158,
11159,
11250,
11251,
11287,
11288,
11987,
11988,
12003,
12004,
12245,
12246,
12296,
12297,
12306,
12307,
12315,
12316,
12478,
12479,
12500,
12501,
12559,
12560,
12609,
12628,
12633,
12643,
12651,
12652,
12903,
12904,
12945,
12946,
12980,
12981,
12995,
12996,
13145,
13146,
13374,
13375,
13387,
13388,
13400,
13401,
13568,
13569,
13586,
13587,
13771,
13772,
13799,
13800
],
"line_end_idx": [
37,
38,
43,
44,
836,
837,
1098,
1099,
1105,
1106,
1144,
1145,
1162,
1163,
1304,
1305,
1327,
1328,
1415,
1416,
1424,
1437,
1447,
1451,
1458,
1468,
1472,
1477,
1478,
1546,
1547,
1571,
1572,
1608,
1609,
1625,
1626,
1974,
1975,
1982,
1989,
2001,
2008,
2014,
2020,
2021,
2201,
2202,
2211,
2275,
2276,
2284,
2310,
2335,
2379,
2417,
2461,
2494,
2506,
2553,
2564,
2565,
2587,
2588,
2653,
2654,
2679,
2712,
2723,
2724,
2733,
2734,
2741,
2792,
2844,
2852,
2853,
3313,
3314,
3376,
3380,
3441,
3442,
3758,
3759,
3768,
3776,
3777,
3785,
3802,
3803,
3826,
3827,
4270,
4271,
4296,
4297,
4673,
4674,
4683,
4695,
4696,
4704,
4725,
4726,
4799,
4800,
4839,
4840,
5135,
5136,
5168,
5169,
5395,
5396,
5413,
5414,
5863,
5864,
5971,
5972,
6015,
6044,
6080,
6177,
6267,
6320,
6331,
6339,
6340,
6697,
6698,
6787,
6868,
6869,
7375,
7376,
7393,
7491,
7525,
7575,
7579,
7580,
8003,
8004,
8649,
8650,
8920,
8921,
8948,
8991,
8998,
9064,
9072,
9084,
9090,
9091,
9282,
9283,
9295,
9296,
9472,
9473,
9989,
9990,
10063,
10064,
10085,
10092,
10093,
10268,
10269,
10354,
10355,
10382,
10439,
10468,
10491,
10492,
10768,
10769,
10798,
10802,
10803,
11129,
11130,
11158,
11159,
11250,
11251,
11287,
11288,
11987,
11988,
12003,
12004,
12245,
12246,
12296,
12297,
12306,
12307,
12315,
12316,
12478,
12479,
12500,
12501,
12559,
12560,
12609,
12628,
12633,
12643,
12651,
12652,
12903,
12904,
12945,
12946,
12980,
12981,
12995,
12996,
13145,
13146,
13374,
13375,
13387,
13388,
13400,
13401,
13568,
13569,
13586,
13587,
13771,
13772,
13799,
13800,
14014
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 14014,
"ccnet_original_nlines": 240,
"rps_doc_curly_bracket": 0.006136720068752766,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36247608065605164,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009572429582476616,
"rps_doc_frac_lines_end_with_ellipsis": 0.008298760280013084,
"rps_doc_frac_no_alph_words": 0.24122527241706848,
"rps_doc_frac_unique_words": 0.3144044280052185,
"rps_doc_mean_word_length": 4.858725547790527,
"rps_doc_num_sentences": 191,
"rps_doc_symbol_to_word_ratio": 0.0015954100526869297,
"rps_doc_unigram_entropy": 5.656720161437988,
"rps_doc_word_count": 2166,
"rps_doc_frac_chars_dupe_10grams": 0.02128468081355095,
"rps_doc_frac_chars_dupe_5grams": 0.06223868951201439,
"rps_doc_frac_chars_dupe_6grams": 0.028886349871754646,
"rps_doc_frac_chars_dupe_7grams": 0.02128468081355095,
"rps_doc_frac_chars_dupe_8grams": 0.02128468081355095,
"rps_doc_frac_chars_dupe_9grams": 0.02128468081355095,
"rps_doc_frac_chars_top_2gram": 0.010452300310134888,
"rps_doc_frac_chars_top_3gram": 0.005701249931007624,
"rps_doc_frac_chars_top_4gram": 0.012922840192914009,
"rps_doc_books_importance": -1307.2288818359375,
"rps_doc_books_importance_length_correction": -1307.2288818359375,
"rps_doc_openwebtext_importance": -838.0806274414062,
"rps_doc_openwebtext_importance_length_correction": -838.0806274414062,
"rps_doc_wikipedia_importance": -781.7522583007812,
"rps_doc_wikipedia_importance_length_correction": -781.7522583007812
},
"fasttext": {
"dclm": 0.09083104133605957,
"english": 0.8559783697128296,
"fineweb_edu_approx": 1.928995132446289,
"eai_general_math": 0.7672190070152283,
"eai_open_web_math": 0.24378496408462524,
"eai_web_code": 0.6129068732261658
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-3,970,340,860,499,885,600 |
Dedicated Web Hosting: Summary
Dedicated Web Hosting: Summary
What is dedicated web hosting?
Dedicated hosting companies can alleviate the need to share hardware or software with other websites or web pages. Webmasters get autonomy to decide on programs installed on the server to create specific configurations for their web needs and have the opportunity to provide a secure environment for their website. In comparison with a sharedserver environment, dedicated web hosting providers provide a confidence that a website will be delivered reliably and securely.
There are great benefits of dedicated web hosting, as discussed below. However, the big disadvantage, the cost, is quickly overcome. Due to constant growth in the dedicated web hosting industry, prices for dedicated server plans are rapidly decreasing. A competitive environment drives up the service level and reduces costs. This decrease is driven by an increase of SMEs that get an online presence and the rapid spread of web hosting.
Benefits of dedicated web hosting
Dedicated server hosting is beneficial because of 2 major assets: control and reliability.
Because a dedicated web administrator has more control over a dedicated server, it tends to be more secure than a shared web server. By knowing exactly what is installed on a dedicated server through full root access, a system administrator can obviously make decisions about the software and software updates that are necessary to maintain the dedicated web server and keep it running in its most optimal configuration.
Increased reliability is another important asset to dedicated server web hosting because a server administrator has selfservice to optimize page uploads by customizing variables such as page load speed and overall server resource allocation. This servers reliability goes to customer satisfaction and an increase in the bottom goals for a sites presence.
DisAdvantages of Dedicated Web Hosting
While the benefits of dedicated web server management are evident, the overall consideration, especially for business purposes, is the cost. Dedicated web hosting is significantly more expensive than shared or virtual web hosting, and until recently they could most often be quoted to several hundred dollars to several thousand dollars a month. Although the cost may still be unreasonable, most companies can motivate the use of dedicated servers through a true web analytics to weigh the resources required to run applications and code.
Another drawback is the need to be able to monitor, install, upgrade and configure programs, add sites, manage potential hackers and troubleshooter systems. Therefore, the necessary system management capabilities, unless you own them, can simply inhibit the successful deployment of a website hosting a dedicated web server.
advantages:
The direct benefits of a dedicated hosting company plan on the ability to completely manage a web server. The advantage of being able to effectively maintain a dedicated server lies in ones ability to control the variables associated with reliability and stability. In a dedicated environment, server overload, malicious scripts from other users and too many installed applications are variables that can be controlled, compared to this loss of management in shared server hosting.
Additionally, a dedicated server allows you to install only software or software that applies to the large host target. Conversely, shared web hosting has installed software that may not be related to web hosting goals.
Trust in web hosting services and time delays of platform repairs can be minimized, as you can intervene and provide solutions to existing issues with dedicated web hosting. If you are able to add fixes, upgrades, or tweak performance, it is invaluable and allows the dedicated server administrator to work with 24hour access to perform adjustments, fixes, or updates.
Finally, the speed of downloads can be determined by the amount of bandwidth dedicated to just your site. Statistically, visitors will quickly leave a site if the last time was long. Dedicated servers enable fast delivery of web pages, increasing the likelihood of keeping visitors on a website that can convert them to paying customers. In addition, fastpaced pages improve the companys image and can encourage existing customers to refer your webbased services to others.
Home | Privacy Policy | Contact Us
© Copyright coquegalaxyfr.com 2019 | {
"url": "https://www.coquegalaxyfr.com/dedicated-web-hosting-summary.php",
"source_domain": "www.coquegalaxyfr.com",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "20417",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EOBF4JOQBJDVQB35VIK5UPWQPMDS3KMM",
"WARC-Concurrent-To": "<urn:uuid:e428781c-ea9f-4699-bdbe-22af1052cee5>",
"WARC-Date": "2019-11-12T09:09:58Z",
"WARC-IP-Address": "104.28.4.37",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VR2BOHI2LHVLQ6R357A4J4UTHN2OZMA3",
"WARC-Record-ID": "<urn:uuid:24ca5a9d-d6b3-4112-b837-4807ee0c678e>",
"WARC-Target-URI": "https://www.coquegalaxyfr.com/dedicated-web-hosting-summary.php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9fdaa592-3572-4b30-9d5e-2f15f5ee5af2>"
},
"warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-221.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
1,
32,
33,
64,
65,
96,
97,
568,
569,
1007,
1008,
1042,
1043,
1134,
1135,
1556,
1557,
1912,
1913,
1952,
1953,
2492,
2493,
2818,
2819,
2831,
2832,
3314,
3315,
3535,
3536,
3905,
3906,
4380,
4381,
4382,
4417,
4418
],
"line_end_idx": [
1,
32,
33,
64,
65,
96,
97,
568,
569,
1007,
1008,
1042,
1043,
1134,
1135,
1556,
1557,
1912,
1913,
1952,
1953,
2492,
2493,
2818,
2819,
2831,
2832,
3314,
3315,
3535,
3536,
3905,
3906,
4380,
4381,
4382,
4417,
4418,
4452
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4452,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3771580159664154,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0013280200073495507,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.09960158914327621,
"rps_doc_frac_unique_words": 0.4470588266849518,
"rps_doc_mean_word_length": 5.410294055938721,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.045995712280273,
"rps_doc_word_count": 680,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.015765149146318436,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.043490078300237656,
"rps_doc_frac_chars_top_3gram": 0.051644470542669296,
"rps_doc_frac_chars_top_4gram": 0.01793966069817543,
"rps_doc_books_importance": -263.24560546875,
"rps_doc_books_importance_length_correction": -263.24560546875,
"rps_doc_openwebtext_importance": -132.47630310058594,
"rps_doc_openwebtext_importance_length_correction": -132.47630310058594,
"rps_doc_wikipedia_importance": -118.76271057128906,
"rps_doc_wikipedia_importance_length_correction": -118.76271057128906
},
"fasttext": {
"dclm": 0.29022592306137085,
"english": 0.9384087324142456,
"fineweb_edu_approx": 2.134584426879883,
"eai_general_math": 0.10450392961502075,
"eai_open_web_math": 0.08219295740127563,
"eai_web_code": 0.09901440143585205
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-1,417,526,625,829,394,200 | [PATCH v3] mtd: spi-nor: clear Winbond Extended Address Reg on switch to 3-byte addressing.
NeilBrown neil at brown.name
Fri Apr 20 14:26:34 PDT 2018
Winbond spi-nor flash 32MB and larger have an 'Extended Address
Register' as one option for addressing beyond 16MB (Macronix
has the same concept, Spansion has EXTADD bits in the Bank Address
Register).
According to section
8.2.7 Write Extended Address Register (C5h)
of the Winbond W25Q256FV data sheet (256M-BIT SPI flash)
The Extended Address Register is only effective when the device is
in the 3-Byte Address Mode. When the device operates in the 4-Byte
Address Mode (ADS=1), any command with address input of A31-A24
will replace the Extended Address Register values. It is
recommended to check and update the Extended Address Register if
necessary when the device is switched from 4-Byte to 3-Byte Address
Mode.
So the documentation suggests clearing the EAR after switching to
3-byte mode. Experimentation shows that the EAR is *always* one after
the switch to 3-byte mode, so clearing the EAR is mandatory at
shutdown for a subsequent 3-byte-addressed reboot to work.
Note that some SOCs (e.g. MT7621) do not assert a reset line at normal
reboot, so we cannot rely on hardware reset. The MT7621 does assert a
reset line at watchdog-reset.
This problem is not a regression. However the commit identified below
added support for resetting an spi-nor chip at shutdown, but didn't
achieve the goal for all spi-nor chips. So this patch can be seen as
fixing that one.
Fixes: 59b356ffd0b0 ("mtd: m25p80: restore the status of SPI flash when exiting")
Cc: stable at vger.kernel.org (v4.16)
Signed-off-by: NeilBrown <neil at brown.name>
---
drivers/mtd/spi-nor/spi-nor.c | 14 ++++++++++++++
include/linux/mtd/spi-nor.h | 2 ++
2 files changed, 16 insertions(+)
diff --git a/drivers/mtd/spi-nor/spi-nor.c b/drivers/mtd/spi-nor/spi-nor.c
index 5bfa36e95f35..42ae9a1529bb 100644
--- a/drivers/mtd/spi-nor/spi-nor.c
+++ b/drivers/mtd/spi-nor/spi-nor.c
@@ -284,6 +284,20 @@ static inline int set_4byte(struct spi_nor *nor, const struct flash_info *info,
if (need_wren)
write_disable(nor);
+ if (!status && !enable &&
+ JEDEC_MFR(info) == SNOR_MFR_WINBOND) {
+ /*
+ * On Winbond W25Q256FV, leaving 4byte mode causes
+ * the Extended Address Register to be set to 1, so all
+ * 3-byte-address reads come from the second 16M.
+ * We must clear the register to enable normal behavior.
+ */
+ write_enable(nor);
+ nor->cmd_buf[0] = 0;
+ nor->write_reg(nor, SPINOR_OP_WREAR, nor->cmd_buf, 1);
+ write_disable(nor);
+ }
+
return status;
default:
/* Spansion style */
diff --git a/include/linux/mtd/spi-nor.h b/include/linux/mtd/spi-nor.h
index de36969eb359..e60da0d34cc1 100644
--- a/include/linux/mtd/spi-nor.h
+++ b/include/linux/mtd/spi-nor.h
@@ -62,6 +62,8 @@
#define SPINOR_OP_RDCR 0x35 /* Read configuration register */
#define SPINOR_OP_RDFSR 0x70 /* Read flag status register */
#define SPINOR_OP_CLFSR 0x50 /* Clear flag status register */
+#define SPINOR_OP_RDEAR 0xc8 /* Read Extended Address Register */
+#define SPINOR_OP_WREAR 0xc5 /* Write Extended Address Register */
/* 4-byte address opcodes - used on Spansion and some Macronix flashes. */
#define SPINOR_OP_READ_4B 0x13 /* Read data bytes (low frequency) */
--
2.14.0.rc0.dirty
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 832 bytes
Desc: not available
URL: <http://lists.infradead.org/pipermail/linux-mtd/attachments/20180421/a4713338/attachment-0001.sig>
More information about the linux-mtd mailing list | {
"url": "http://lists.infradead.org/pipermail/linux-mtd/2018-April/080407.html",
"source_domain": "lists.infradead.org",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "7106",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:A3OKF5QHQIY3VPPDGMEA5O3RVVUQVDVV",
"WARC-Concurrent-To": "<urn:uuid:4a3863ef-b4c8-4101-a684-96c583ec2e4f>",
"WARC-Date": "2019-06-18T03:55:31Z",
"WARC-IP-Address": "198.137.202.133",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:P6HTP3FXHH6QOK2CAC7ELWPH7PLRQTMC",
"WARC-Record-ID": "<urn:uuid:b8ecba4d-8b3f-4388-b00c-be220ceb8adf>",
"WARC-Target-URI": "http://lists.infradead.org/pipermail/linux-mtd/2018-April/080407.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:812da0d7-05ae-4be9-a233-3154b8b2c4e0>"
},
"warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-143-92-167.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
92,
93,
122,
151,
152,
153,
217,
278,
345,
356,
357,
378,
425,
426,
483,
484,
554,
625,
692,
752,
820,
891,
900,
901,
967,
1038,
1101,
1160,
1161,
1232,
1303,
1333,
1334,
1405,
1473,
1543,
1560,
1561,
1643,
1681,
1727,
1731,
1782,
1821,
1856,
1857,
1932,
1972,
2008,
2044,
2145,
2163,
2187,
2189,
2218,
2264,
2271,
2326,
2386,
2440,
2501,
2509,
2532,
2557,
2616,
2640,
2645,
2647,
2665,
2676,
2700,
2771,
2811,
2845,
2879,
2897,
2961,
3024,
3088,
3156,
3225,
3227,
3303,
3373,
3377,
3394,
3395,
3435,
3473,
3493,
3525,
3541,
3561,
3665,
3666,
3667
],
"line_end_idx": [
92,
93,
122,
151,
152,
153,
217,
278,
345,
356,
357,
378,
425,
426,
483,
484,
554,
625,
692,
752,
820,
891,
900,
901,
967,
1038,
1101,
1160,
1161,
1232,
1303,
1333,
1334,
1405,
1473,
1543,
1560,
1561,
1643,
1681,
1727,
1731,
1782,
1821,
1856,
1857,
1932,
1972,
2008,
2044,
2145,
2163,
2187,
2189,
2218,
2264,
2271,
2326,
2386,
2440,
2501,
2509,
2532,
2557,
2616,
2640,
2645,
2647,
2665,
2676,
2700,
2771,
2811,
2845,
2879,
2897,
2961,
3024,
3088,
3156,
3225,
3227,
3303,
3373,
3377,
3394,
3395,
3435,
3473,
3493,
3525,
3541,
3561,
3665,
3666,
3667,
3716
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3716,
"ccnet_original_nlines": 96,
"rps_doc_curly_bracket": 0.000538209977094084,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20785218477249146,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.035796768963336945,
"rps_doc_frac_lines_end_with_ellipsis": 0.010309279896318913,
"rps_doc_frac_no_alph_words": 0.38221707940101624,
"rps_doc_frac_unique_words": 0.560538113117218,
"rps_doc_mean_word_length": 6.022421360015869,
"rps_doc_num_sentences": 48,
"rps_doc_symbol_to_word_ratio": 0.008083139546215534,
"rps_doc_unigram_entropy": 5.160559177398682,
"rps_doc_word_count": 446,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.013402829878032207,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05026061087846756,
"rps_doc_frac_chars_top_3gram": 0.06850335001945496,
"rps_doc_frac_chars_top_4gram": 0.038719289004802704,
"rps_doc_books_importance": -342.03594970703125,
"rps_doc_books_importance_length_correction": -342.03594970703125,
"rps_doc_openwebtext_importance": -274.52191162109375,
"rps_doc_openwebtext_importance_length_correction": -274.52191162109375,
"rps_doc_wikipedia_importance": -184.53912353515625,
"rps_doc_wikipedia_importance_length_correction": -184.53912353515625
},
"fasttext": {
"dclm": 0.05397344008088112,
"english": 0.7413468956947327,
"fineweb_edu_approx": 1.5132672786712646,
"eai_general_math": 0.008148189634084702,
"eai_open_web_math": 0.5754595994949341,
"eai_web_code": 0.08617573976516724
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
6,111,569,153,310,743,000 | Luogu P2656 采蘑菇 题解
Describe
题目链接
在一个 $N$ 个点， $M$ 条边的有向图中，每条路可以走无数次，边权为 $w_i$ ，边的恢复系数为 $p_i$ 第二次走时，边权变为 $w_i \times {p_i} $ ，第三次走时，边权变为 $w_i \times {p_i} ^ 2$…第 $k$ 次走时，边权变为 $w_i \times {p_i}^{k-1}$（全部向下取整，直到 $0$ 为止）
问，从 $S$ 出发，最大的路径经过的边权和为多少？(可以重复走)
对于所有数据，$N \leq 80,000 , M \leq 200,000 , 0.1\leq p_i \leq 0.8\text{且仅有一位小数},1\leq S \leq N$。
Solution
显然，只要我们找到一个环，那么我们就可以不停地走这个环，直到环内所有的边权为$0$，所以，只要找环，缩点再遍历一次就好了。
预处理
预处理出每条边的无限次走后的边权。
找环&缩点
看了下$Luogu$题解区内的都是$Tarjan$找环、缩点，那么对于我这种不会$Tarjan$的怎么办呢？当然是用$kosaraju$啦~
什么是$kosaraju$？可以参考我的这篇博客(此文写的时间久远，写的不好勿喷)。
构图
找环&缩点后肯定是要重新构造一个有向无环图啦~
那么怎么构图呢？
直接暴力枚举每条边如果不是在同一个强连通分量，那么很遗憾这条边不能重复走很多次，那么就两个强连通分量间连接一条$w_i$的边即可。如果在同一个强连通分量，那么把所有在这个强连通分量中的所有边的无限次走后的边权的和存成点权。
遍历
最后从$S$出发跑个$dfs$就好了。
Code
#include<bits/stdc++.h>
#define LD double
using namespace std;
inline int read(){
int res=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') res=res*10+ch-'0',ch=getchar();
return res*f;
}
struct edge{int u,v,w;}e[200010];
int n,m,fir[80010],nxt[200010],son[200010],w[200010],tot,sum[200010],val[200010],S,dis[80010],vis[80010],d[80010],t;
vector<int> G[80010],P[80010];
inline void add(int x,int y,int z){++tot;nxt[tot]=fir[x];fir[x]=tot;son[tot]=y;w[tot]=z;}
inline void dfs1(int x){
vis[x]=1;
for(auto i:G[x])//C++11简易写法
if(!vis[i]) dfs1(i);
d[++t]=x;
}
inline void dfs2(int x){
vis[x]=t;
for(auto i:P[x])
if(!vis[i]) dfs2(i);
}
inline void kosaraju(){//缩点
memset(vis,0,sizeof(vis));t=0;
for(int i=1;i<=n;i++)
if(!vis[i]) dfs1(i);
memset(vis,0,sizeof(vis));t=0;
for(int i=n;i>=1;i--)
if(!vis[d[i]]) ++t,dfs2(d[i]);
}
inline void dfs(int x){
if(dis[x]) return ;
dis[x]=val[x];//别忘记加上点权
int Max=0;
for(int to,i=fir[x];i;i=nxt[i]){
to=son[i];
dfs(to);
Max=max(Max,dis[to]+w[i]);
}
dis[x]+=Max;
}
int main(){
n=read();m=read();
for(int x,y,w,i=1;i<=m;i++){
x=read();y=read();w=read();
e[i]=(edge){x,y,w};
G[x].push_back(y);
P[y].push_back(x);//缩点需要建反边
LD s;scanf("%lf",&s);
while(w){//预处理出无限次走的边权
sum[i]+=w;
w=(LD)w*s;
}
}
kosaraju();
for(int i=1;i<=m;i++)
if(vis[e[i].u]!=vis[e[i].v]) add(vis[e[i].u],vis[e[i].v],e[i].w);//不在同一个强连通分量，构图
else val[vis[e[i].u]]+=sum[i];//在同一个强连通分量，累计点权
S=read();
dfs(vis[S]);//最后跑一次dfs求最大值
printf("%d\n",dis[vis[S]]);
}
暂无评论
发送评论 编辑评论
|´・ω・)ノ
ヾ(≧∇≦*)ゝ
(☆ω☆)
（╯‵□′）╯︵┴─┴
￣﹃￣
(/ω＼)
∠( ᐛ 」∠)＿
(๑•̀ㅁ•́ฅ)
→_→
୧(๑•̀⌄•́๑)૭
٩(ˊᗜˋ*)و
(ノ°ο°)ノ
(´இ皿இ｀)
⌇●﹏●⌇
(ฅ´ω`ฅ)
(╯°A°)╯︵○○○
φ(￣∇￣o)
ヾ(´･ ･｀｡)ノ"
( ง ᵒ̌皿ᵒ̌)ง⁼³₌₃
(ó﹏ò｡)
Σ(っ °Д °;)っ
( ,,´･ω･)ﾉ"(´っω･｀｡)
╮(╯▽╰)╭
o(*////▽////*)q
＞﹏＜
( ๑´•ω•) "(ㆆᴗㆆ)
😂
😀
😅
😊
🙂
🙃
😌
😍
😘
😜
😝
😏
😒
🙄
😳
😡
😔
😫
😱
😭
💩
👻
🙌
🖕
👍
👫
👬
👭
🌚
🌝
🙈
💊
😶
🙏
🍦
🍉
😣
Source: github.com/k4yt3x/flowerhd
颜文字
Emoji
小恐龙
花!
上一篇
下一篇 | {
"url": "https://yzxoi.top/archives/1182",
"source_domain": "yzxoi.top",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "116793",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ANPYJUOVCR5F32V427EOFLMU2HCAFVHY",
"WARC-Concurrent-To": "<urn:uuid:8b50186c-3f81-477f-8a94-845218444477>",
"WARC-Date": "2020-12-01T17:16:00Z",
"WARC-IP-Address": "173.82.26.168",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LZBZVXWJ6FMOXQZVK6T3AWI3Z64R2ULS",
"WARC-Record-ID": "<urn:uuid:bcea78d5-bedb-45bd-b9f9-abab25944f19>",
"WARC-Target-URI": "https://yzxoi.top/archives/1182",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ed8dc85f-d201-4142-a77c-173d9af7fb29>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-27.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
19,
20,
29,
30,
35,
36,
219,
253,
346,
347,
356,
357,
419,
420,
424,
425,
443,
444,
450,
451,
522,
565,
566,
569,
570,
594,
603,
715,
716,
719,
720,
740,
741,
746,
747,
771,
789,
810,
829,
866,
924,
984,
1002,
1004,
1038,
1155,
1186,
1276,
1301,
1315,
1347,
1376,
1390,
1392,
1417,
1431,
1452,
1481,
1483,
1511,
1546,
1572,
1601,
1636,
1662,
1701,
1703,
1727,
1751,
1779,
1794,
1831,
1850,
1867,
1902,
1908,
1925,
1927,
1939,
1962,
1995,
2031,
2059,
2086,
2122,
2152,
2183,
2206,
2229,
2239,
2245,
2261,
2287,
2376,
2431,
2445,
2476,
2508,
2510,
2515,
2516,
2526,
2527,
2528,
2533,
2541,
2550,
2556,
2568,
2572,
2578,
2588,
2598,
2602,
2614,
2623,
2631,
2639,
2645,
2653,
2665,
2673,
2685,
2701,
2708,
2720,
2740,
2748,
2764,
2768,
2784,
2786,
2788,
2790,
2792,
2794,
2796,
2798,
2800,
2802,
2804,
2806,
2808,
2810,
2812,
2814,
2816,
2818,
2820,
2822,
2824,
2826,
2828,
2830,
2832,
2834,
2836,
2838,
2840,
2842,
2844,
2846,
2848,
2850,
2852,
2854,
2856,
2858,
2893,
2897,
2903,
2907,
2910,
2914
],
"line_end_idx": [
19,
20,
29,
30,
35,
36,
219,
253,
346,
347,
356,
357,
419,
420,
424,
425,
443,
444,
450,
451,
522,
565,
566,
569,
570,
594,
603,
715,
716,
719,
720,
740,
741,
746,
747,
771,
789,
810,
829,
866,
924,
984,
1002,
1004,
1038,
1155,
1186,
1276,
1301,
1315,
1347,
1376,
1390,
1392,
1417,
1431,
1452,
1481,
1483,
1511,
1546,
1572,
1601,
1636,
1662,
1701,
1703,
1727,
1751,
1779,
1794,
1831,
1850,
1867,
1902,
1908,
1925,
1927,
1939,
1962,
1995,
2031,
2059,
2086,
2122,
2152,
2183,
2206,
2229,
2239,
2245,
2261,
2287,
2376,
2431,
2445,
2476,
2508,
2510,
2515,
2516,
2526,
2527,
2528,
2533,
2541,
2550,
2556,
2568,
2572,
2578,
2588,
2598,
2602,
2614,
2623,
2631,
2639,
2645,
2653,
2665,
2673,
2685,
2701,
2708,
2720,
2740,
2748,
2764,
2768,
2784,
2786,
2788,
2790,
2792,
2794,
2796,
2798,
2800,
2802,
2804,
2806,
2808,
2810,
2812,
2814,
2816,
2818,
2820,
2822,
2824,
2826,
2828,
2830,
2832,
2834,
2836,
2838,
2840,
2842,
2844,
2846,
2848,
2850,
2852,
2854,
2856,
2858,
2893,
2897,
2903,
2907,
2910,
2914,
2917
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2917,
"ccnet_original_nlines": 174,
"rps_doc_curly_bracket": 0.012341449968516827,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.14478763937950134,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025096530094742775,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6602316498756409,
"rps_doc_frac_unique_words": 0.8401639461517334,
"rps_doc_mean_word_length": 7.081967353820801,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.002895750105381012,
"rps_doc_unigram_entropy": 5.205696105957031,
"rps_doc_word_count": 244,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02893519029021263,
"rps_doc_frac_chars_top_3gram": 0.010416669771075249,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -482.5832214355469,
"rps_doc_books_importance_length_correction": -482.5832214355469,
"rps_doc_openwebtext_importance": -253.38609313964844,
"rps_doc_openwebtext_importance_length_correction": -253.38609313964844,
"rps_doc_wikipedia_importance": -168.19189453125,
"rps_doc_wikipedia_importance_length_correction": -168.19189453125
},
"fasttext": {
"dclm": 0.7240281701087952,
"english": 0.03794969990849495,
"fineweb_edu_approx": 1.6986767053604126,
"eai_general_math": 0.45695048570632935,
"eai_open_web_math": 0.9986078143119812,
"eai_web_code": 0.2558095455169678
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "511.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
1,985,715,909,664,516,600 | Zwei-Faktoren-Authentifizierung
Zur Erhöhung der Authentifizierungssicherheit werden Verfahren eingesetzt, die nicht nur mit dem Passwort arbeiten, wie bei der Single-Factor Authentication (SFA), sondern zwei oder drei Sicherheitsfaktoren miteinander kombinieren. Diese Verfahren heißen Two-Factor Athentication (2FA) und Multifactor Authentication (MFA).
Bei der Zwei-Faktoren-Authentifizierung werden zwei Identifikationsmerkmale miteinander kombiniert. Beispielsweise kann ein Passwort, die persönliche Identifikationsnummer oder eine Passphrase mit einem biometrischen Merkmal wie einem Fingerabdruck oder der Iriserkennung kombiniert werden, oder ein statisches Passwort mit einem Einmalpasswort, es können auch eine Knowledge-Based Authentication (KBA) und ein Sicherheits-Token eingesetzt werden, ein Passwort und ein digitales Zertifikat oder das PIN/TAN-Verfahren. Immer Kombinationen zweier verschiedener Verfahren.
Für die Two-Factor Authentication (2FA) wird synonym auch die Bezeichnung Two-Step Verification benutzt. Der Unterschied zwischen beiden Verfahren besteht darin, dass die Two-Step Verification in zwei Stufen erfolgt, und zwar mit der gleichen Authentifizierung. Im Gegensatz dazu arbeitet die Two-Factor Authentication in zwei Stufen mit zwei verschiedenen Authentifizierungen.
Mit Universal Second Factor (U2F), das von der FIDO Alliance publiziert wird, gibt es einen Industriestandard für die Two-Factor Authentication (2FA).
Informationen zum Artikel
Deutsch: Zwei-Faktoren-Authentifizierung
Englisch: two-factor authentication - 2FA
Veröffentlicht: 31.08.2019
Wörter: 175
Tags: IT-Sicherheit
Links: Biometrie, Digitales Zertifikat, , Fingerabdruckerkennung, Iriserkennung | {
"url": "https://www.itwissen.info/2FA-two-factor-authentication-Zwei-Faktoren-Authentifizierung.html",
"source_domain": "www.itwissen.info",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "26987",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NKOBINPHN2FULT3TMRLCU62EZ2EH4HOO",
"WARC-Concurrent-To": "<urn:uuid:7e1367af-992b-4d26-a658-1c8d95a1c42c>",
"WARC-Date": "2021-08-02T07:01:44Z",
"WARC-IP-Address": "116.203.247.198",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NHE4WSYZETCX67ORHOXQONR63RH77GLY",
"WARC-Record-ID": "<urn:uuid:8872ac4c-14ec-4b36-ab1b-23a1d49b68bd>",
"WARC-Target-URI": "https://www.itwissen.info/2FA-two-factor-authentication-Zwei-Faktoren-Authentifizierung.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3e1b698a-2e9e-4f42-8f69-9aede9c610f3>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-216.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
32,
33,
357,
358,
928,
929,
1307,
1308,
1459,
1460,
1486,
1527,
1569,
1596,
1608,
1628
],
"line_end_idx": [
32,
33,
357,
358,
928,
929,
1307,
1308,
1459,
1460,
1486,
1527,
1569,
1596,
1608,
1628,
1707
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1707,
"ccnet_original_nlines": 16,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.010948910377919674,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.043795619159936905,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24087591469287872,
"rps_doc_frac_unique_words": 0.6020942330360413,
"rps_doc_mean_word_length": 7.596858501434326,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.503193378448486,
"rps_doc_word_count": 191,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04548586905002594,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.06340455263853073,
"rps_doc_frac_chars_top_3gram": 0.05375602841377258,
"rps_doc_frac_chars_top_4gram": 0.04135078936815262,
"rps_doc_books_importance": -125.97418212890625,
"rps_doc_books_importance_length_correction": -114.24887084960938,
"rps_doc_openwebtext_importance": -82.88158416748047,
"rps_doc_openwebtext_importance_length_correction": -82.88158416748047,
"rps_doc_wikipedia_importance": -66.7933578491211,
"rps_doc_wikipedia_importance_length_correction": -58.10982131958008
},
"fasttext": {
"dclm": 0.896992564201355,
"english": 0.0018726600101217628,
"fineweb_edu_approx": 2.138514757156372,
"eai_general_math": 0.09363794326782227,
"eai_open_web_math": 0.8127704858779907,
"eai_web_code": 0.6911904215812683
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-5,395,309,378,915,919,000 | Still celebrating National IT Professionals Day with 3 months of free Premium Membership. Use Code ITDAY17
x
?
Solved
Help w Sql Query
Posted on 2014-12-14
6
Medium Priority
?
134 Views
Last Modified: 2015-03-24
Hi everyone,
I have a sql query and I need to add a piece of information to it which should be pretty easy for you experts!
The table in the query below (tblWorshipAttendance) has a record for each worship date. I want to show a field in the results that also tells me the last date they attended. The query right now tells me the persons name and how many times they attended during the year and I just want to add that last field that tells me the last time they attended.
SELECT tpm.FirstName, tpm.LastName, COUNT(twa.Contemporary1100) As AttendanceNos FROM tblPeopleMain tpm, tblWorshipAttendance twa WHERE twa.WorshipDate >= '01/01/2014' AND twa.WorshipDate <= '12/31/2014' AND Contemporary1100 = '1' AND tpm.RecordID = twa.PeopleID Group By tpm.LastName, tpm.FirstName
0
Comment
Question by:jwebster77
[X]
Welcome to Experts Exchange
Add your voice to the tech community where 5M+ people just like you are talking about what matters.
• Help others & share knowledge
• Earn cash & points
• Learn & ask questions
6 Comments
LVL 7
Accepted Solution
by:
Robert Sherman earned 2000 total points
ID: 40498909
I believe you can just add a
MAX(twa.WorshipDate) As LastAttended,
into your SQL statement above.
(Assuming that WorshipDate is the correct field you are looking for to show last date attended.)
0
LVL 66
Expert Comment
by:Jim Horn
ID: 40498917
The above answer is correct. Adding to your query, and re-formatted the query for readability:
SELECT
tpm.FirstName,
tpm.LastName,
COUNT(twa.Contemporary1100) As AttendanceNos,
MAX(twa.WorshipDate) As LastAttended
FROM tblPeopleMain tpm
JOIN tblWorshipAttendance twa ON tpm.RecordID = twa.PeopleID
WHERE twa.WorshipDate >= '2014-01-01' AND twa.WorshipDate <= '2014-12-31' AND Contemporary1100 = '1'
GROUP BY tpm.LastName, tpm.FirstName
Open in new window
Keep in mind that the way the query is written, if someone's LastAttended is before '2014-01-01', then they won't show in the query results. If you need them to show, let us know and we'll provide that code.
btw I have an article called SQL Server GROUP BY Solutions that is a demo and image-heavy tutorial on GROUP BY.
0
LVL 7
Expert Comment
by:Robert Sherman
ID: 40498928
This is just an aside, but just in case it hadn't crossed your mind...
with the grouping that you are doing based on LastName and FirstName you might run into trouble if you have different people with the same first and last name (e.g. father/son). In those cases, you'd be grouping multiple individuals together and getting the aggregate results for each multiple-instance name.
To avoid this, you could GROUP BY the key field from your 'tpm' table instead.
0
Migrating Your Company's PCs
To keep pace with competitors, businesses must keep employees productive, and that means providing them with the latest technology. This document provides the tips and tricks you need to help you migrate an outdated PC fleet to new desktops, laptops, and tablets.
Author Comment
by:jwebster77
ID: 40498973
That is a good point on the grouping. My revised query is this:
SELECT tpm.RecordID,
tpm.FirstName,
tpm.LastName,
COUNT(twa.Contemporary1100) As AttendanceNos,
MAX(twa.WorshipDate) As LastAttended
FROM tblPeopleMain tpm
JOIN tblWorshipAttendance twa ON tpm.RecordID = twa.PeopleID
WHERE twa.WorshipDate >= '2014-01-01' AND twa.WorshipDate <= '2014-12-31' AND Contemporary1100 = '1'
GROUP BY tpm.RecordID
Open in new window
I get an error that states: Column 'tblPeopleMain.FirstName' is invalid in the select list because it is not contained in either an aggregate function or the GROUP BY clause.
This is why I had put them in a grouping. How can I get around the error above?
0
LVL 66
Expert Comment
by:Jim Horn
ID: 40498980
>I get an error that states: Column 'tblPeopleMain.FirstName' is invalid...
Any column you have in the SELECT clause that's not an aggregate needs to be in the GROUP BY clause.
So change your GROUP BY to...
GROUP BY tpm.RecordID, tpm.FirstName, tpm.LastName
Open in new window
0
LVL 49
Expert Comment
by:PortletPaul
ID: 40499561
List all the non-aggregating fields in the GROUP BY clause (Lines 13-16)
Always include the table alias (TWA. was missing) (line 11)
While a date literal format of YYYY-MM-DD is reasonable, the safest date literal in SQL Server is YYYYMMDD (lines 9 & 10)
I recommend including INNER instead of just JOIN (line 8)
SELECT
TPM.RecordID
, TPM.FirstName
, TPM.LastName
, COUNT(TWA.Contemporary1100) AS ATTENDANCENOS
, MAX(TWA.WorshipDate) AS LASTATTENDED
FROM tblPeopleMain TPM
INNER JOIN tblWorshipAttendance TWA ON TPM.RecordID = TWA.PeopleID
WHERE TWA.WorshipDate >= '20140101'
AND TWA.WorshipDate <= '20141231'
AND TWA.Contemporary1100 = '1'
GROUP BY
TPM.RecordID
, TPM.FirstName
, TPM.LastName
;
Open in new window
no points please
0
Featured Post
Amazon Web Services EC2 Cheat Sheet
AWS EC2 is a core part of AWS’s cloud platform, allowing users to spin up virtual machines for a variety of tasks; however, EC2’s offerings can be overwhelming. Learn the basics with our new AWS cheat sheet – this time on EC2!
Question has a verified solution.
If you are experiencing a similar issue, please ask a related question
For both online and offline retail, the cross-channel business is the most recent pattern in the B2C trade space.
Ever wondered why sometimes your SQL Server is slow or unresponsive with connections spiking up but by the time you go in, all is well? The following article will show you how to install and configure a SQL job that will send you email alerts includ…
Via a live example, show how to set up a backup for SQL Server using a Maintenance Plan and how to schedule the job into SQL Server Agent.
Via a live example, show how to setup several different housekeeping processes for a SQL Server.
715 members asked questions and received personalized solutions in the past 7 days.
Join the community of 500,000 technology professionals and ask your questions.
Join & Ask a Question | {
"url": "https://www.experts-exchange.com/questions/28580502/Help-w-Sql-Query.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "189185",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZXANVZHYBHEBMRGBDXFKAMKHVTL5VMI5",
"WARC-Concurrent-To": "<urn:uuid:c4903228-efba-49be-bcc9-e9815201fc67>",
"WARC-Date": "2017-09-23T08:22:57Z",
"WARC-IP-Address": "104.20.168.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:N4S2OYSYUJOLU66UXKOK5RRTOK3FOW66",
"WARC-Record-ID": "<urn:uuid:cfab12dc-98ca-4d07-9af2-fa161f6bea8a>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/28580502/Help-w-Sql-Query.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:458de699-7c48-4ba6-aa82-28c95aa0a70d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-37-236-142.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-39\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for September 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
107,
108,
110,
112,
119,
120,
137,
138,
159,
161,
177,
179,
189,
215,
228,
229,
340,
341,
694,
695,
995,
997,
1005,
1028,
1032,
1060,
1061,
1161,
1162,
1196,
1219,
1245,
1256,
1258,
1264,
1265,
1283,
1284,
1288,
1328,
1341,
1370,
1410,
1441,
1442,
1539,
1541,
1543,
1550,
1551,
1566,
1567,
1579,
1592,
1688,
1696,
1715,
1733,
1783,
1823,
1846,
1911,
2012,
2049,
2050,
2069,
2070,
2071,
2280,
2281,
2393,
2395,
2397,
2403,
2404,
2419,
2420,
2438,
2451,
2522,
2523,
2838,
2839,
2918,
2920,
2949,
2950,
3214,
3215,
3217,
3218,
3233,
3234,
3248,
3261,
3326,
3327,
3349,
3368,
3386,
3436,
3476,
3499,
3564,
3665,
3687,
3688,
3707,
3708,
3709,
3885,
3886,
3967,
3969,
3971,
3978,
3979,
3994,
3995,
4007,
4020,
4097,
4198,
4228,
4229,
4280,
4281,
4300,
4301,
4303,
4305,
4312,
4313,
4328,
4329,
4344,
4357,
4430,
4490,
4612,
4670,
4671,
4678,
4697,
4717,
4736,
4787,
4830,
4853,
4926,
4962,
4996,
5027,
5036,
5055,
5075,
5094,
5096,
5097,
5116,
5117,
5118,
5135,
5137,
5138,
5152,
5153,
5189,
5190,
5417,
5418,
5452,
5453,
5524,
5525,
5639,
5890,
6029,
6126,
6127,
6211,
6212,
6291,
6292
],
"line_end_idx": [
107,
108,
110,
112,
119,
120,
137,
138,
159,
161,
177,
179,
189,
215,
228,
229,
340,
341,
694,
695,
995,
997,
1005,
1028,
1032,
1060,
1061,
1161,
1162,
1196,
1219,
1245,
1256,
1258,
1264,
1265,
1283,
1284,
1288,
1328,
1341,
1370,
1410,
1441,
1442,
1539,
1541,
1543,
1550,
1551,
1566,
1567,
1579,
1592,
1688,
1696,
1715,
1733,
1783,
1823,
1846,
1911,
2012,
2049,
2050,
2069,
2070,
2071,
2280,
2281,
2393,
2395,
2397,
2403,
2404,
2419,
2420,
2438,
2451,
2522,
2523,
2838,
2839,
2918,
2920,
2949,
2950,
3214,
3215,
3217,
3218,
3233,
3234,
3248,
3261,
3326,
3327,
3349,
3368,
3386,
3436,
3476,
3499,
3564,
3665,
3687,
3688,
3707,
3708,
3709,
3885,
3886,
3967,
3969,
3971,
3978,
3979,
3994,
3995,
4007,
4020,
4097,
4198,
4228,
4229,
4280,
4281,
4300,
4301,
4303,
4305,
4312,
4313,
4328,
4329,
4344,
4357,
4430,
4490,
4612,
4670,
4671,
4678,
4697,
4717,
4736,
4787,
4830,
4853,
4926,
4962,
4996,
5027,
5036,
5055,
5075,
5094,
5096,
5097,
5116,
5117,
5118,
5135,
5137,
5138,
5152,
5153,
5189,
5190,
5417,
5418,
5452,
5453,
5524,
5525,
5639,
5890,
6029,
6126,
6127,
6211,
6212,
6291,
6292,
6313
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6313,
"ccnet_original_nlines": 184,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2877643406391144,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.09667673707008362,
"rps_doc_frac_lines_end_with_ellipsis": 0.021621620282530785,
"rps_doc_frac_no_alph_words": 0.25830817222595215,
"rps_doc_frac_unique_words": 0.41701680421829224,
"rps_doc_mean_word_length": 5.1260504722595215,
"rps_doc_num_sentences": 88,
"rps_doc_symbol_to_word_ratio": 0.0030211498960852623,
"rps_doc_unigram_entropy": 5.450292110443115,
"rps_doc_word_count": 952,
"rps_doc_frac_chars_dupe_10grams": 0.17520491778850555,
"rps_doc_frac_chars_dupe_5grams": 0.2428278774023056,
"rps_doc_frac_chars_dupe_6grams": 0.23545081913471222,
"rps_doc_frac_chars_dupe_7grams": 0.22028689086437225,
"rps_doc_frac_chars_dupe_8grams": 0.21045081317424774,
"rps_doc_frac_chars_dupe_9grams": 0.1981557458639145,
"rps_doc_frac_chars_top_2gram": 0.017213109880685806,
"rps_doc_frac_chars_top_3gram": 0.03852459043264389,
"rps_doc_frac_chars_top_4gram": 0.040163930505514145,
"rps_doc_books_importance": -489.8250427246094,
"rps_doc_books_importance_length_correction": -489.8250427246094,
"rps_doc_openwebtext_importance": -278.56756591796875,
"rps_doc_openwebtext_importance_length_correction": -278.56756591796875,
"rps_doc_wikipedia_importance": -224.88528442382812,
"rps_doc_wikipedia_importance_length_correction": -224.88528442382812
},
"fasttext": {
"dclm": 0.026923000812530518,
"english": 0.8347761034965515,
"fineweb_edu_approx": 1.2314674854278564,
"eai_general_math": 0.008429469540715218,
"eai_open_web_math": 0.10820353031158447,
"eai_web_code": 0.009686529636383057
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
6,650,199,536,532,872,000 | <![CDATA[HeyArnold!]]> 2016-05-05T10:42:03-04:00 http://b4thestorm.github.io/ Octopress <![CDATA[POODR Qoutables]]> 2016-05-01T21:26:27-04:00 http://b4thestorm.github.io/blog/2016/05/01/my-poodr-digestion I just finished reading Practical Object Oriented Design Ruby(POODR) by Sandi Metz. This book is a must read. It’s essentially a rule book for writing clean, isolated and flexible Object Oriented Code. If you ever found yourself looking at your code and wondering where you should create a new object, if the code is “clean” or whether one of your classes is doing too much. This book works tirelessly to disspell misplaced or unorganized OO code. This digestion is all about me quoting Sandi, at points where I feel her work must be remembered.
Chapter 1
“Object Oriented design requires that you shift from thinking of the World as a collection of predesigned procedures and start modeling the world as a series of messages that pass through objects”.
“Every Application is a collection of code, the codes arrangement is design”
“Design is not an assembly line where similarly trained workers construct identical widgets ; It’s a studio where like minded artists sculpt custom applications.”
“Just as a suclptor has chisels and files, an object oriented designer has tools - Principles and Patterns”
Design Principles
SOLID
Single Reponsibility
Open Closed
Liskov Substitution
Interface Substitution
Dependency Inversion
Dont Repeat Yourself
Law of Demeter
There is a good amount of research to indicate the correlation of these principles and High Quality code.
Design Patterns
“Design Patterns are simple and elegant solutions to specific problems in Object Oriented software design that you can use to make your own designs more flexible, modular, reusable and understandeable.”
“The notion of design Patterns is incredibly powerful. To name common problems and to solve the problems in common ways brings the fuzzy into focus.”
Yet and still Designing…
Designing Object Oriented Software is hard. Simply knowing design principles and patterns is not enough. “If you think of software as custom furiniture, then principles and patterns are the woodworking tools. Knowing how software should look when its done does not cause it to build itself out. Applications come into existence because some programmer applied the tools. The end result being a beautiful cabinet or a rickety chair, reflects the programmers experience with the tools of design.”
Chapter 2
“The foundation of an object oriented system is the message, but the most visible organizational structure is the class.”
“Your goal is to model your classes such that it does what its supposed to do right now and is also easy to change later.”
“The Quality of easy changeability reveals the craft of programming. Acheiving it takes knowledge, skill and a bit of artistic creativity.”
Easy to change means:
1. “Changes have no unexpected side effects”
2. “Small changes in requirements require correspondingly small changes in code.”
3. “Existing code is easy to reuse. ”
4. “The easiest way to make a change is to add code that in itself is easy to change”
Transparent - The consequences of change should be obvious
Reasonable - The cost of change should not be dramatically felt elsewhere
Usable - It should be able to used in new and unexpected ways
Exemplary - It should encourage others to write the same
Classes should have a Single Responsibility
“In determining that a class has a single responsibility, pretend that its alive and ask it questions. and make sure the answers make Sense.” eg: “Please Mr.Gear, what is your Ratio?” vs “Please Mr.Person, what is the circumference of the earth?”
“Attempt to describe what your class is doing in one sentence. If the description, uses the words [and, or] then your class likely has more than one responsibility.”
Depend on Behavior not Data
“Behavior is captured in methods and is invoked by sending messages”
“Data is held in variables and objects”
Rule 1: Always wrap instance variables in Accessor methods.
- Instead of directly reffering to variables. Hide the variables from the class, by wrapping them. Use attr_reader as an easy way to create encapsulating methods.
Rule 2: Always Hide Data Structures.
-Do not depend on data structures. Because if the structure changes then other code will have to as well.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
#In Ruby Its easy to seperate structure from meaning, with the Struct Class
class RevealingReference
attr_reader :wheels
def initialize(data) # This data is a multi dimensional array
@wheels = wheelify(data)
end
def diameters
@wheels.collect {|wheel| wheel.rim + (wheel.tire * 2)}
#struct gives you wheel.rim instead of wheel[0]. Can you see the benefits there? :)
end
Wheel = Struct.new(:rim, :tire)
def wheelify(data)
data.collect {|cell| Wheel.new(cell[0], cell[1])}
end
end
Rule 3: Extract extra responsibilities from methods.
- This will ensure that each method has a single responsibility.
“The Path to changeable and Maintanable object oriented software begins with classes that have a single responsibility. The isolation that occurs as a result of SRP allows change w/o consequence and reuse w/o duplication.”
Chapter 3
“All of the behavior is dispersed among the objects. Therefore any desired behavior, an object either knows it personally inherits it, or knows another object who knows it.”
An object has a dependency when it knows:
- “The name of another class. (Gear expects a class named Wheel to exist.)”
- “The name of a message that it intends to send to someone other than self. (Gear expects Wheel instance to respond to diameter.)”
- “The arguments that a message requires. (Gear knows that Wheel.new requires a rim and tire.)”
- “The order of those arguments. (Gear knows the first argument to Wheel.new should be rim)”
“The design challenge is to manage dependencies so that each class has the fewest possible.”
“Unmanaged dependencies can cause an entire application to become an entangled mess.”
“Reducing dependencies means recognizing and removing the ones you don’t neeed.” The following techniques reduce dependencies:
Technique 1: INJECT DEPENDENCIES
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
#instead of doing
def gear_inches
ratio * Wheel.new(x,y).diameter
end
#do this
def initialize(chain, cog, wheel)
@chainring = chain
@cog = cog
@wheel = wheel
end
def gear_inches
ratio * wheel.diameter
end
Gear.new(5, 2, Wheel.new(26, 1.5))
“You should isolate unneccessary dependencies and leave the code better than you found it.”
Technique 2: ISOLATE INSTANCE CREATION
If you are constrained in your code and cannot inject an object in the initializer. Then you should isolate the creation of a new object in method of its own in the class you need it to be in. Similar to wrapping an instance variable in an accessor method.
1
2
3
4
5
6
7
8
9
10
11
def initialize(chain, cog, rim, tire)
@chainring = chain
@cog = cog
@rim = rim
@tire = tire
end
def wheel
@wheel ||= Wheel.new(@rim, @tire)
end
Technique 3: ISOLATE VULNERABLE EXTERNAL METHODS
Isolate messages that are sent to someone that is not self, by wrapping the message call in its own method and then referencing the method whenever you need it.
1
2
3
4
5
6
7
8
9
10
11
12
13
#Instead of this
def gear_inches
ration * wheel.diameter
end
#Do This
def gear_inches
ratio * diameter
end
def diameter
wheel.diameter
end
Technique 4: REMOVE ARGUMENT ORDER DEPENDENCIES
When you send a message that requires arguments, one main requirement becomes that you need to pass arguments in a specific fixed order. You can avoid fixed order arguments by passing in a hash instead of specific arguments.
1
2
3
4
5
6
7
def initialize(args)
@chainring = args[:chain]
@cog = args[:cog]
@rim = args[:rim]
end
#Now the order of arguments does not matter.
Technique 5: EXPLICITLY DEFINE DEFAULT VALUES
Its better to use the fetch method to set defaults than to be clever and use the || method. Just Obey this rule.
1
2
3
4
5
6
7
8
9
10
11
12
13
#Instead of this
def initialize(args)
@chainring = args[:chain] || 40
@cog = args[:cog] || 15
@rim = args[:rim] || 10
end
#Do This
def initialize(args)
@chainring = args.fetch(:chain, 40)
@cog = args.fetch(:cog, 15)
@rim = args.fetch(:rim, 10)
end
Chapter 4
“Design is concerned w/ messages that pass between objects.”
“It deals not only w/ what objects know and who they know, but how they talk to one another. Conversations take place using their interfaces.”
Public Interfaces Reveal its primary responsibility
Are expected to be invoked by others
Will not change on a whim
Are thoroughly documented in tests
Private Interfaces Handle implementation details
Are not expected to be sent by other objects
Can change for any reason whatsoever
Are unsafe for others to depend on
May not be reinforced in tests
“Design experts notice Domain Objects, w/o concentrating on them. They focus on messages that pass between objects”
“Domain Objects are easy to find, but they are not at the design center of your application. Instead, they are a trap for the unwary. If you fixate on domain objects you will tend to coerce behavior into them. Design experts notice D/O without concentrating on them. They focus on the messages that pass between the. These messages are guides that lead you to discover other objects, ones that are just as necessary but far less obvious.”
Finding Public Interfaces
A public interface is simply the way that objects talk to one another. Its similar to the idea of the API but its for objects passing messages to one another. ex:
1
2
3
4
5
6
7
8
9
10
#this sets up a public interface
args = {chain: 10, cog: 15, wheel: Wheel.new(10, 1.5)}
gear = Gear.new(args)
#this reveals the public nature
gear.diameter #====> remember diameter is (wheel.diameter)
#here we used the gear object to find out what is the diameter of a wheel.
#this reveals a class who is not a single responsibility class but the fact that it can do something
#with a wheel object indirectly is very useful.
Technique 1: The Sequence Diagram
“They allow you to experiment w/ different object arrangements and message passing.”
“Message based design yields more flexible applications than does class based perspective.”
“Think to yourself: I need to send this message who should respond to it.”
“Often times, a Sequence Diagram can help you figure out if there is a missing Object.”
Technique 2: Ask For What instead of telling How
“A Customer should be able to ask a mechanic to fix a bike and the mechanic should know how to fix a bike. A Customer should not have the methods to know how to fix a bike.”
Technique 3: Keep Context to a minimum
“The context that an object expects has a direct effect on how difficult it is to reuse.” ex:
1
2
3
4
5
args = {chain: 10, cog: 5, Wheel.new(10, 1.5)}
Gear.new(args)
#The context of being able to use some public methods of Gear requires that you pass in a Wheel Object
#The more dependencies on an object. The harder it will be to use. Keep that in mind.
“An object that could collaborate with others w/o knowing who they are or what they could do, could be used in novel and unanticipated ways.”
“Switching your attention from objects to messages allows you to concentrate on designing an application built upon public interfaces.”
Law Of Demeter
LOD is a set of coding rules that Results in loosely coupled code. “Demeter restricts the set of objects to which a method may send messages. It prohibits routing a message to a third object via a second object of a different type. Demeter is often paraphrased as ‘only talk to your immediate neighbors or use only one dot.’”
1
2
3
4
5
6
7
#Blatant Violation of Demeter
customer.bike.wheel.tire
#Alternative Solution
hash.keys.sort.join(', ')
#Check violations of demeter by evaluating the number of intemediary objects
The problem with sending methods(messages) in a chain of methods kind of fashion is that it indicates tightly coupled code. Tightly coupled code is a NONO becuase its hard to manage. If you was to change something in one place, you may have to change things in various other places. And this is not ideal. What you want is to be able to have isolated control over what your messages is doing in various places.
Solving Violations of Demeter is often done by, using delegation methods. If youve read chapters 2-4, each time you was directed to wrap an instance variable or create and isolate an object, you was actually creating delegation methods.
Remember demeter “prohibits routing a message to a third object via a second object of a different type.” If you are calling your own instance method, then type does not change.
You can also try to use the Delegate module in Ruby or the Forwardable Module. Check out this video: https://www.youtube.com/watch?v=jQXtSnUNfMY
SUMMARY
Following these rules leads to clean, flexible, loosely coupled public interfaces. Notice that I didnt say classes remember. The goal of OO Design is to “start modeling the world as a series of messages that pass through objects” We are no longer modeling classes, we are using SOLID, and techniques found in Books like POODR in order to construct flexible and loosely coupled public interfaces. ENJOY!
]]>
<![CDATA[Reverse Engineering to Learn Forward]]> 2016-04-25T16:38:55-04:00 http://b4thestorm.github.io/blog/2016/04/25/reverse-engineering-to-learn-forward I believe that you can learn the basics of whatever you would like to implement, by looking out in to the open source world for muse codebases. The purpose of finding a muse codebase is not to rip or steal, it is to learn and inspect. It’s like asking a teacher to show you something but looking into the teachers brain as opposed to directly asking the teacher. Its harder to do but hard things teach more meaningful and memorable lessons.
In this particular post, I will be reverse engineering a code base on Github which is making use of the Stripe Connect API. Personally, I’ve always wanted to use omniauth to develop but I’ve always been scared of it for some reason. Here I will break a fear and learn a new skill and at the same time share a new skill.
I found a person on Github who had a personal project at: https://github.com/dylandrop/givespend-v3/commits/master
Project Overview
This project seems to allow a person to sell items for a charitable cause. It has the idea of a buyer and also a seller. It was not a completely finished product but there are lessons that it teaches about dealing with Omniauth and the Stripe Api in its seller implementation. So Lets break it down.
Code Walkthrough
I was always told, when trying to get familiar with a rails app its a good idea to take a look at the routes file first. The routes file can show you what the rails app is capable of. Here is what I saw:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
resources :verifications, only: [:new]
resources :items, only: [:new, :create, :show]
resources :transactions, only: [:new, :create]
resource :seller_dashboard, only: [:show]
devise_for :users, :controllers => { :registrations => "registrations", :omniauth_callbacks => "authentications", :sessions => "sessions" }
get "pages/index"
get "pages/about"
get "pages/contact"
root to: "pages#index"
This routes file is simple and shows very clearly that there is a seller dashboard, the ability to make a transaction, the ability to make new items and show items, the ability to register, the ability to process callbacks with omniauth, and last but not least it has 3 different static page routes processed by a Pages Controller. If I was to make a story line out of what I am seeing; this says to me that a seller will post an item and show it and a buyer will probably buy something from the seller. Once the item is bought there will be a record stored about the bought item being shown in the seller dashboard.
Keep in mind: this is a small routes file. On some routes files, there is an even bigger story to tell and takes much more mental work to really grok what the application is doing. We got lucky here. lol
So now I want to track the Stripe Api feature usage on this Application. A trick that I picked up for tracking features on github is to just look at any projects commit history. The commits tell a story in segments that mimic the actual feature development cycle. On github right below the repo description, there is a link that shows how many commits have been made. So I decided to click it and then search through the commit messages to find something that tells me which particular commit is a stripe feature commit.
I pretty much found a commit message that read: “verification with Stripe working”. Bingo!
This file starts with a changelog showing the addition of 3 gems to the gemfile.
1
2
3
gem 'omniauth'
gem 'omniauth-stripe-connect'
gem 'stripe'
The next significant update was a controller called AuthenticationsController which was inheriting from Devise::OmniauthCallbacksController. It had one single method in it:
1
2
3
4
5
6
7
8
+class AuthenticationsController < Devise::OmniauthCallbacksController
+ def stripe_connect
+ omniauth = request.env["omniauth.auth"]
+ current_user.apply_omniauth(omniauth)
+ current_user.save!
+ redirect_to new_item_path
+ end
+end
This method is named after the API its using. Its setting a request env hash value called omniauth.auth to a variable called omniauth. It is then passing the omniauth variable to a method on the user object called apply_omniauth. Then it saves the results on the user and redirects to a new item.
The next file that I see as being changed is the user model. Basically the User file has a few interesting pieces of code to look at.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
devise :database_authenticatable, :registerable, :omniauthable
+ def stripe_parameters
+ {
+ 'stripe_user[business_type]' => 'sole_prop',
+ 'stripe_user[currency]' => 'usd'
+ }
+ end
def apply_omniauth(omniauth)
+ self.secret_key = omniauth['credentials']['token']
+ self.public_key = omniauth['info']['stripe_publishable_key']
+ self.uid = omniauth['uid']
+ end
The first thing I notice is the omniauthable module being included to the devise class method at the top of the file. This means that devise will be making its Omniauth feature available to this application. The second thing I noticed was the apply_omniauth method. This method was called in the stripe connect method in the authentication controller before the user was saved. When I check out this method, I see that it is setting the Secret key, public key and the uid to the user object. When its done setting, the stripe_connect method saves the current users updated fields.
The last thing I noticed was the stripe_paramters method. Its holding a json like structure with 2 hashes inside of it. One hash to specify the business type and the other to specify the currency type. That was pretty much it for the user model.
The next file that was modified was from the verifications new view. Its a html.erb file that has a progress bar a short description paragraph tag and then a verification link.
1
2
3
4
5
+<%= render partial: "layouts/progress_bar", locals: { status: 2, size: 3 } %><br><br>
+<div class="description">
<p>'We need you to create a Stripe account so we can pay out to your bank account. Stripe is Givespends payment processor. You will be briefly redirected to Stripe, and returned to Givespend once you are done.'</p>
+</div>
+<%= link_to "Verify with Stripe", omniauth_authorize_path(:user, :stripe_connect, current_user.stripe_parameters), class: 'call-to-action' %>
In rails, partials are a method of extraction for verbose view logic in order to make the views easier to understand. The most important parts of this particular view is really the ‘verify with stripe’ link and the description paragraph. The link is using a route helper method called omniauth_authorize_path and it is passing a symbol called user and a symbol called stripe connect and the stripe parameters of the current user. It also has a class on it, called call to action.
This is a fairly loaded link helper. But what it’s doing is using a method from devise which creates the call to stripe and returns the result of that call to the callback method specified in the Authentications controller. Its doing all of this with a metaprogrammed method called - omniauth_authorize_path. And it takes three arguments: (resource, provider and additional arguments). see below:
1
2
3
4
def omniauth_authorize_path(resource_or_scope, provider, *args)
scope = Devise::Mapping.find_scope!(resource_or_scope)
_devise_route_context.send("#{scope}_#{provider}_omniauth_authorize_path", *args)
end
Now, after following this workflow I wanted to check the accuracy of my reading and so I read the OmniAuth-stripe-connect gem wiki and it pretty much confirms that this workflow above is how a developer can connect a persons stripe account to the rails app. Once this “connection” is made, a user can use it to make transactions to the stripe account through the app, using the info made available from the request.env[‘omni.auth’]hash.
–Note: One part of the flow here that is missing is the part where the developer signs up for stripe and specifies the callback url and gets the public and secret keys from Stripe. Thats not something that you can see on github, you just have to know to do it.
I will probably post some more about using the stripe API. I like the Stripe Api myself, but thats mostly because its a great way as a developer to get paid. lol
]]>
<![CDATA[Multiple Model Form via FormObject Pattern]]> 2016-04-22T15:14:22-04:00 http://b4thestorm.github.io/blog/2016/04/22/multiple-model-form-via-formobject-pattern Sometimes in life you just have to make your life easer. And the first step anybody can take to make their life easier is to not use Accepts_nested_attributes_for when making multiple model forms. The Problem with accepts_nested_attributes_for is that connecting more than two models in a single form is a headache. In Rails the more graceful way to conveniently connect multiple models is to use the Form Object Pattern.
It’s infinitely easier to set up and gives you a higher level of control when it comes to creating very complex forms. The Process goes like this:
1. Create a PORO in the Model folder of your rails app
2. Inside the PORO Include ActiveModel::Model
3. Inside the PORO create attr_accessors representing all the fields of your form
4. Add your validations for each accessor attribute
5. Inside the PORO, Create a submit method specifying where you want your data to be submitted to.
6. Call “FormObjectName”.new and “FormObjectName”.submit when you want to process your form.
The above process allows you to represent the form you want through a PORO not constrained by the rules of ActiveRecord. Its a very simple process and is extensible in a way, that accepts_nested_attributes_for is not. <> Here is an example of how you would setup a form object:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
class MeetingForm
Include ActiveModel::Model
attr_accessor :meeting_name, :start_time, :end_time, :location_zone, :first_name
validates_presence_of :meeting_name, :start_time, :end_time, :location_zone, :first_name
def submit(options{})
user = User.where(first_name: params[:first_name]).take
event = create_meeting(params[:meeting_name], params[:start_time], params[:end_time], user)
location = create_location(params[:location_zone], event)
end
def create_meeting(name, start_t, end_t, user)
Meeting.create(meeting_name: name, start_time: start_t, end_time: end_t, user: user)
end
def create_location(zone, meeting)
Location.create(location_zone: zone, meeting: meeting)
end
def valid?
false
end
end
This is how you make the form object available in the controller:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
class MeetingsController < ApplicationController
def new
@meeting = MeetingForm.new
@users = User.all
end
def create
@meeting = MeetingForm.new(params)
if @meeting.valid?
@meeting.submit(params)
flash[:notice] = 'Sccessfully created a new meeting'
redirect_to root_path
end
end
end
Notice Above that you didn’t call save on the meetingform object. ActiveModel doesnt have a save method, it has an equivalent ActiveModel#valid? method. This method allows you to check that your validations are passing. Also notice that there is no strong paramters being included in the MeetingController. The Validations are happening on the ActiveModel Object themselves once you run the #valid? method.
And lastly, Here is the form that you need to create to use a FormObject:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
<h2>Create Meeting</h2>
<div>
<%= form_for @meeting do |meet| %>
<%= meet.label :name %>
<%= meet.text_field :meeting_name %>
</br></br>
<%= meet.label :start%>
<%= meet.time_select :start_time, {:ampm => true} %>
</br></br>
<%= meet.label :end %>
<%= meet.time_select :end_time, {:ampm => true} %>
</br></br>
<%= meet.label 'Meeting Location'%>
<%= meet.select(:zone, Location::ZONES)%>
</br></br>
<%= meet.label 'Add Participant' %>
<%= meet.select :first_name , options_for_select(@users), {:size => 5 }%>
</br></br>
<%= meet.submit "Create Meeting"%>
<%end%>
</div>
Notice that this form is not a nested model form. It is a simple and straightforward form. Its purpose is solely to take in the requested data. It has no knowledge of multiple models, and its supported by one simple PORO. However this simple PORO is used to join 3 different models at one time - Meeting,Location,User.
So in Summary:
- A FormObject is good for connecting multiple models in a form.
- A FormObject allows you to build a smart form without using ActiveRecord.
- A FormObject allows you to build a simple form but smart form
- A FormObject is a simple Ruby Object
]]>
<![CDATA[AR association explorations]]> 2016-04-16T10:39:09-04:00 http://b4thestorm.github.io/blog/2016/04/16/ar-association-drill-down Creating ActiveRecord associations are by far one of the most powerful techniques to master when doing rails. And playing with these associations is sort of like an art. Because there are a finite number of associations that you can make in Rails. But you can make connections with them in sooo many interesting ways. As you all know, these associations are made available through the ActiveRecord association methods DSL: has_many, has_one, belongs_to, etc.. These association methods are powerful and if utilized correctly can do wonders for putting rails models together to build interestingly connected business objects.
In this post I will be picking out some associations that I’ve come across out there in the wild(github). The idea is to go over, via repetition how a person would go about reading custom rails associations and therefore informing the creation of custom rails associations. All the while practicing my own rails decoding skills.
The first app that I came across and happened to like can be found here: https://github.com/waterflowseast/waterflowseast/blob/master/app
This application waterfloweast is a great specimen of model associations put to great use. There are 12 models in total and all are very carefully connected in a wide variety of interesting ways. Let us look over these interesting connnections.
First up, there is a model called connecting_relationship.
1
2
3
4
class CollectingRelationship < ActiveRecord::Base
belongs_to :post
belongs_to :user
end
This model is a fairly empty model. However this model is interesting for 2 reasons. For 1, its name is connecting_relationships. For 2 it has exactly 2 belongs to associations with single noun models. Whenever you come across models like this, if you look in the schema you will find most times that this is in fact a join model - they store 2 foreign keys. Meaning that this models purpose is to connect two other models together with their foreign keys stored in its table.
Join Models are used when you want to relate 2 objects in a Many to Many association. Many to Many can be realized more easily by telling yourself many things can belong to many other things. I personally didnt understand this for a while, but after 2 years of doing rails, somehow the language starts to make sense.
If we go to the Users model and to the Post model respectively, we can verify this statement. In the Users Model we see:
1
2
3
4
5
6
class User < ActiveRecord::Base
...
has_many :collecting_relationships, dependent: :destroy
has_many :collections, through: :collecting_relationships, source: :post
...
end
in the Post Model we see:
1
2
3
4
5
6
class Post < ActiveRecord::Base
...
has_many :collecting_relationships, dependent: :destroy
has_many :collectors, through: :collecting_relationships, source: :user
...
end
In the User Model the bottom association is creating a collection proxy object called collections - (a collection proxy object is pretty much an array. You can test this connection in the console by creating a new User object and then typing u.collections. This will return an empty array type structure.) This means that a User can have many post that will be returned by calling User#collections. Furthermore, These posts are being retrieved through a table called collecting_relationships. And because the name “collections” is pretty much a made up name, the association has the source optionbeing specified. The source: :post specification tells the User model to look for the post_id foreign_key on the collecting_relationships table. And thats pretty much it for the users model. From this, you basically can retrieve many posts as a collections array.
This exact same break down is also true of the Post model. There is a collection proxy object called collectors( a made up name). Then the user records are being retrieved from the collecting_relationships join table by saying through: :collecting_relationships. And then finally the source is being specified by saying source: :user wich notifies the post model to look for the user_id foreign key on the collecting_relationships table. All this gives you the ability to get all the users on a specific post. And pretty much that’s how you read a many to many relationship through a join model.
These next 2 associations I am going to go over are actually the types of associations that I will honestly say, are the kinds of associations that once you start making them, pretty much confirms that you are a pretty good rails developer. These are the types of associations in my opinion that give object interactions some very powerful descriptions. Lets take a look at them.
1
2
3
4
5
6
class Invitation < ActiveRecord::Base
belongs_to :sender, class_name: :User
has_one :receiver, class_name: :User
end
These associations are actually two associations belonging to the same model. This class invitation has a sender that belongs to the user class and it also has one reciever that comes from the user class. The special part about this relationship is that it gives you a very descriptive way to get the sender and reciever from off of the User model. This is what I would like to call a Friendly Association. It uses the class_name method to make the invitation model smart enough to know that its going to be storing a foreign key called user_id for a sender object and that its going to have one reciever object that is going to come from the users table.
When you look at the Users model, you find the other side of the relationship which confirmes exactly whats going on here:
1
2
3
4
5
6
class User < ActiveRecord::Base
...
has_many :invitations, foreign_key: :sender_id, dependent: :destroy
belongs_to :invitation
...
end
This association is saying two things. That the User model can have many invitations and that they will be stored with a foreign_key called sender_id on the Invitations table. And the bottom association is saying that this User model belongs to the invitation model. In which case you can expect that the foreign key will be stored on the Users table as invitation_id. The Thing to really note here is one trick that will make your life easy. When you see a has_one or a has_many and there is a foreign_key option being specified on it. This means that this Class will be storing a differently named foreign key than what rails expects on the opposite table. In this case, instead of saving user_id on the opposite table, it will actually be stored as sender_id. This is a very powerful trick to keep in your mind, because this trick will let you create this Friendly Association to describe many other types of interactions. Things like: Buyer - Seller, Sender - Reciever - Sponsor, Sponsee, Worker - Coworker, etc. etc…
There are soo many examples of associations. Maybe, I should start a series that is based on deciphering what associations are giving. My Ethos is that in reading good code, you actually have a good opportunity to sharpen your own code.
]]>
<![CDATA[How to debug Date.parse]]> 2016-03-07T04:28:13-05:00 http://b4thestorm.github.io/blog/2016/03/07/how-to-debug-date-dot-parse This post is geared towards people using ruby 2.1.5 specifically. If you find your self needing to parse a string into a date object. You know that you have to require the Date class at the head of your ruby file, like so:
1
require 'date'
This will give your current model access, to the Date class and its methods. The next step is always to pass the date string into the parse method, like so:
1
2
date_string = '2/13/1987'
date_obj = Date.parse(date_string)
In ruby 2.1.5 this will give you an error. This error will annoy you, because the error will look like this:
1
2
3
ArgumentError: invalid date
from (irb):4:in `parse'
from (irb):4
Clearly it doesnt look like it’s formatted wrong. But unfortunately ruby expects something different, at least in Ruby 2.1.5. The Date class #parse method expects the input to be formatted as (dd/mm/yyyy). If its not formatted that way, you will get an invalid date error. It also looks that strptime also expects the same input. In order to get around this error, you need to switch the date around and then you can use the Date#parse or the Date#strptime methods. Heres one way:
1
2
3
4
date_string = '2/13/1987'
date_string.split('/') # => [2,13,1987]
new_date_string = "#{date_string[1]}/ #{date_string[0]}/ #{date_string[2]}"
date_obj = Date.parse(new_date_string) # => #<Date: 1987-2-13 ((2457056j,0s,0n),+0s,2299161j)>
This is very unexpected behavior, not very friendly for the human programmer, but HEY, what can you do right? Hopefully you’ve stumbled into this post, while your in the middle of your Date.parse hell and I could have helped you get pass the unexpected behavior.
]]>
<![CDATA[Remembering my first day]]> 2016-02-25T14:34:33-05:00 http://b4thestorm.github.io/blog/2016/02/25/remembering-my-first-day This is a post I wrote to myself on October 13th 2014 on my First day at the Startup Institute. I feel it’s always good to look back at where you are coming from. If not for learning then at the very least, its good for the feelings of Nostalgia.
Day 1
Today, Was my very first day at SINY. It was ducking awesome to say the least. I arrived 30 mins early for the 930 start. At the beginning we had a meet and greet over bagels and coffee. I met with some of the folks of the web dev track. A lot of the guys, no matter what culture they came from, they had a similar air to myself. It was pretty surreal getting to meet them, because I met them in contrast to other tracks and inherintely different personality types. It’s pretty weird how similar we are per track. Very eerie
Shaun, started the morning by giving us a history talk of how SINY actually came to be via TechStars. He then also gave us a very useful talk about why some startups fail because bad management of human capital by throwing money at problems instead of the more passionate person. He then lead the conversation into a more engaged autogogy. He asked us to ask him all of our burning questions. The rest of the talks of the morning was guided by the introduction of Lucea, Kelsey, and Allison. They introduced themselves through what their interests were and also what they specialized in at the startup institute.
We reviewed code of conduct, class style, schedule, what success looks like and then we left for lunch. Lunch was pretty damn dope, because we have a full on lounge in the building which was pretty damn cool. Plastic forks spoons, fruit infused water, unlimited beer and even tea!
When we came back from lunch, we did an exercise about what are our weak points and strengths from an emotional stand point. That was pretty cool, I got a chance to see what all of the different people in my track had a insecurity about and what made them more happy throughout life. And to cap it off, we was given a project by a startup named “Stray Boots” which basically had us exploring all of wall st. Learning about the history of the area. Wall st. Is a very old and interesting place, basically now I can understand how it became so popular.
I can already tell, this is going to be exciting.
]]>
<![CDATA[Debugging status 500 errors in production]]> 2016-02-20T15:03:13-05:00 http://b4thestorm.github.io/blog/2016/02/20/debugging-status-500-errors-in-production Deploying a rails project to Heroku can be a headache. In production on Heroku, you are running your application on their servers. Thus you become the client to your app. If you run across a problem with your user experience such as a bad request, you will recieve a splash page saying that an error has happened. The page will have nothing on it, but a http status code and a prompt for you to check heroku logs if you are the admin. Most times, you will probably be able to figure out the problem if you have a 300 or 400 status code. However, things become very difficult if you get a 500 error in production. The 500 status error means that something went wrong with the code in your application. However, the page that you will get back will have no real information to help you fix your error and your heroku logs will be almost as useless as your heroku error splash page.
Thankfully there is a way to debug your applications status 500 errors via your production environment. In rails there is a setting in /configs/environments/production.rb called:
1
config.consider_all_requests_local = false
This setting is set by default to false. This is a security measure, which is definitely very useful because you dont want your code to be shown if an error is thrown by your application. But if you really need to see whats going on and you need a clue and nothing seems to be working. You can set this value to true and go through the process that you would in order to get the 500 error.
1
config.consider_all_requests_local = true
This will give you the same error page that you use in development to debug your problem code. Once you see the error causing code, you have to make sure you reset the settings to false. Make sure you do this very fast. Im very sure there has to be a better way to see where the error is than to risk the security of your application in this way. I will figure it out and then I will make a post on that. But this is a pretty good and straight forward alternative.
]]>
<![CDATA[Sorting Algorithms]]> 2015-12-30T13:18:07-05:00 http://b4thestorm.github.io/blog/2015/12/30/big-o-and-sort-algos Starting my journey off with topics that I find most interesting seems like a good way to begin. Let’s dive in to a short discussion on some basic algorithms. Algorithms generally insight alot of fear and so it is my hope to ease some of the pain for those not very hip to the matter. Coming from a science background my general way of getting to know things of complexity is by starting with the most empirical examples and then kind of gradually building up from there.
Linear Search
Linear search is by far the best first step in any learning of algorithms, based off of its simplicity. Linear Search is a search through a sorted or unsorted list, checking one element at a time in a Linear fashion in order to find a match for some desired element.
Its Worst Case run time is: O(n2)
Its Best Case run time is: Omega(1)
O(n2) means that this search will take an increase in time in a parabolic fashion as the search proceeds in steps. In code this search will translate into no more than 8 lines of code.
[lang: ruby]
1
2
3
4
5
6
7
8
arr = [1,2,3,4,5,6,7,8,9]
target = 5
while i < arr.length
if arr[i] == target
return i
end
i += 1
end
As you can see, this method is mostly brute force and not much complex searching is going on. Lets build from this, onto a more complex algorithm.
Bubble Sort
Bubble sort isn’t an algorithm with many moving parts but it is a bit more complex than a Linear Search. In Bubble Sort you will iterate through a list of numbers and each pair of numbers, you will need to compare them. If the number to the left(n) is bigger than the number to the right(n+1), you will need to swap the larger number for the lesser number. Eventually all the larger numbers will bubble up to the right and the lesser numbers will move to the left. In order to know when to break the sort you need to keep track of swaps. In the end the sort will know to stop when it made a run an no swap was made.
Its Worst Case Run time is: O(N2)
Its Best Case run time is: Omega(1)
[lang: ruby]
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
array = [1,4,5,6,8,9,3,7]
n = array.length
while true #run an infinite loop
swapped = false
(n-1).times do |i|
if array[i] > array[i+1]
array[i], array[i+1] = array[i+1], array[i] # set the left to the right and the right to the left
swapped = true #keep track of swaps
end
end
break if !swapped
end
print array
This algorithm was a bit more complex but in only one of two ways. First and foremost you have to know how to properly use an infinite loop.
Binary Search
A binary search follows the logic that: If given an array of values that are randomly sorted, Check the middle of the array and see if it is the value you are looking for. If it is, return the value. If it is not, Check if it is bigger than the value you are looking for and then throw away the right half and search through the left half from the middle value. If it is not bigger than the value you are searching for, throw away the left half and search through the right half from the middle value.
Binary Search follows a Big O or Asymptotic Complexity of: O(LogN) and it only works if: array is sorted, and that you actually have an array to search
//Set values for the top and bottom of the search lower = 0 upper = n-1
//Binary Search def binary_search(arr, value) while lower <= upper
//Find The Middle
middle = (arr.length)/2
//Compare the middle to the value you want
if arr[middle] == value
return true
elsif arr[middle] < value
lower = middle + 1
else arr[middle] > value
upper = middle - 1
end
end end
]]>
<![CDATA[life is better on a journey]]> 2015-12-26T13:59:25-05:00 http://b4thestorm.github.io/blog/2015/12/26/life-is-better-on-a-journey Im in a pickle currently. A few months ago I landed in a pretty cool startup for my first rails development role after leaving my development bootcamp SINY. The experience was amazing, everyday I felt like I was dreaming, I learned alot, spent time with really cool people and became the professional developer I had dreamed about for almost everyday for 2 years. That lasted for 6 months and then my company pivoted. While Im still good friends with everybody, I am now currently looking for a new job, one that pays more and has a bigger team for me to work with. The problem is, Im facing a lack of some quintessential Comp Sci knowledge and without that knowledge, employers have a tough time trusting in my abilities that I currently possess. But people in my opinion should try to spend less time worrying about their problems and more time fixing it. And So….
Ive decided that now I am going to start taking Moocs to bridge the gap. Ive heard a lot of wonderful things about people in general who take moocs and take them seriously. I personally find it hard to think that an employer would deny me a role at their place of work, if I’ve taken a number of online high level theoretical computer science courses, gained the knowledge, passed them all and did it all on my own accord. But even more rewarding for me as being the proud owner of a bachelors degree in Biology, is the mere thought of me finishing these courses on my own time and effectively self teaching myself to a high degree these already complicated topics. I would be so proud of myself, I don’t think I would know how to handle myself after that feeling.
In that spirit, I am currently taking Harvards cs50 on edx. This course is definitely a challenge but its not foreign to me, Ive been programming for a year almost 2 years now. I’m already very familiar with what a web developer job entails and the kind of character a person needs to cultivate in order to be successful doing this type of work. I really love this course because it is very thorough and to actually finish it would mean that I will have become very well versed in the C language. C is a language that Ruby was actually buit on top of and is still very widely in use for ruby development in the Ruby MRI implementation and even some standard ruby gems that I use today. Its essentially the equivalent of me learning a mother tongue, it will lead to some greater level of understanding of rubys innerworkings along the way. And that to me is a freeing experience.
I don’t know man, I have a lot going on. But on the other side of pain and torture there is peace and a better life, so thats why im challenging myself to know rather than to fold and cry. This is legit what dreams are made of. See you guys soon
]]> | {
"url": "http://b4thestorm.github.io/atom.xml",
"source_domain": "b4thestorm.github.io",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "101161",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RNCBBB5JLFZVRVVNFXFVCF3OCV3SG67I",
"WARC-Concurrent-To": "<urn:uuid:ca60cf46-abc6-40b0-9448-8d4601de532d>",
"WARC-Date": "2019-01-20T19:15:07Z",
"WARC-IP-Address": "185.199.108.153",
"WARC-Identified-Payload-Type": "application/atom+xml",
"WARC-Payload-Digest": "sha1:BAOCSJ642SAELV4LWAPMX6TYAZAGGL47",
"WARC-Record-ID": "<urn:uuid:98b36600-3966-4362-bd63-9c703a8541c3>",
"WARC-Target-URI": "http://b4thestorm.github.io/atom.xml",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3c84b5d1-e3c9-4c77-a836-25dc2d0d06dd>"
},
"warc_info": "isPartOf: CC-MAIN-2019-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-138-249-133.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
751,
752,
762,
763,
961,
962,
1039,
1040,
1203,
1204,
1312,
1313,
1331,
1332,
1333,
1339,
1360,
1372,
1392,
1415,
1436,
1437,
1458,
1459,
1474,
1475,
1581,
1582,
1598,
1599,
1600,
1803,
1804,
1954,
1955,
1980,
1981,
1982,
2477,
2478,
2488,
2489,
2611,
2612,
2735,
2736,
2876,
2877,
2899,
2944,
3026,
3064,
3150,
3151,
3210,
3284,
3346,
3403,
3404,
3448,
3449,
3696,
3697,
3863,
3864,
3892,
3893,
3962,
4002,
4003,
4063,
4226,
4227,
4264,
4370,
4371,
4373,
4375,
4377,
4379,
4381,
4383,
4385,
4387,
4389,
4392,
4395,
4398,
4401,
4404,
4407,
4410,
4413,
4416,
4419,
4495,
4496,
4521,
4543,
4544,
4608,
4635,
4641,
4642,
4658,
4717,
4805,
4811,
4812,
4846,
4867,
4921,
4927,
4931,
4932,
4985,
5050,
5051,
5274,
5275,
5285,
5286,
5460,
5461,
5503,
5579,
5711,
5807,
5900,
5901,
5994,
5995,
6081,
6082,
6209,
6210,
6243,
6244,
6246,
6248,
6250,
6252,
6254,
6256,
6258,
6260,
6262,
6265,
6268,
6271,
6274,
6277,
6280,
6283,
6286,
6305,
6321,
6355,
6359,
6360,
6369,
6403,
6424,
6437,
6454,
6458,
6459,
6475,
6500,
6504,
6505,
6540,
6541,
6633,
6634,
6673,
6674,
6931,
6932,
6934,
6936,
6938,
6940,
6942,
6944,
6946,
6948,
6950,
6953,
6956,
6994,
7015,
7028,
7041,
7056,
7060,
7061,
7062,
7072,
7108,
7112,
7113,
7162,
7163,
7324,
7325,
7327,
7329,
7331,
7333,
7335,
7337,
7339,
7341,
7343,
7346,
7349,
7352,
7355,
7373,
7389,
7414,
7418,
7419,
7428,
7444,
7462,
7466,
7467,
7480,
7497,
7501,
7502,
7550,
7551,
7776,
7777,
7779,
7781,
7783,
7785,
7787,
7789,
7791,
7812,
7838,
7856,
7874,
7878,
7879,
7924,
7925,
7971,
7972,
8085,
8086,
8088,
8090,
8092,
8094,
8096,
8098,
8100,
8102,
8104,
8107,
8110,
8113,
8116,
8133,
8154,
8186,
8210,
8234,
8238,
8239,
8249,
8270,
8307,
8335,
8363,
8367,
8368,
8378,
8379,
8440,
8441,
8584,
8585,
8637,
8674,
8700,
8735,
8736,
8737,
8786,
8831,
8868,
8903,
8904,
8935,
8936,
9052,
9053,
9492,
9493,
9519,
9520,
9683,
9684,
9686,
9688,
9690,
9692,
9694,
9696,
9698,
9700,
9702,
9705,
9738,
9793,
9815,
9816,
9849,
9910,
9911,
9987,
10089,
10137,
10138,
10172,
10173,
10258,
10259,
10351,
10352,
10427,
10428,
10516,
10517,
10566,
10567,
10741,
10742,
10743,
10782,
10783,
10877,
10878,
10880,
10882,
10884,
10886,
10888,
10935,
10950,
10951,
11054,
11140,
11141,
11283,
11284,
11420,
11421,
11436,
11762,
11763,
11765,
11767,
11769,
11771,
11773,
11775,
11777,
11808,
11833,
11834,
11856,
11882,
11883,
11960,
11961,
12372,
12373,
12610,
12611,
12789,
12790,
12935,
12936,
12944,
12945,
13348,
13349,
13353,
13950,
13951,
14271,
14272,
14387,
14388,
14405,
14406,
14706,
14707,
14724,
14725,
14929,
14930,
14932,
14934,
14936,
14938,
14940,
14942,
14944,
14946,
14948,
14951,
14954,
14957,
14960,
14963,
15004,
15053,
15102,
15146,
15147,
15289,
15290,
15310,
15311,
15331,
15332,
15354,
15355,
15380,
15381,
15998,
15999,
16203,
16204,
16725,
16726,
16817,
16818,
16899,
16900,
16902,
16904,
16906,
16921,
16951,
16964,
16965,
17138,
17139,
17141,
17143,
17145,
17147,
17149,
17151,
17153,
17155,
17226,
17249,
17295,
17339,
17364,
17396,
17404,
17410,
17411,
17708,
17709,
17843,
17844,
17846,
17848,
17850,
17852,
17854,
17856,
17858,
17860,
17862,
17865,
17868,
17871,
17874,
17877,
17941,
17942,
17968,
17976,
18029,
18070,
18078,
18086,
18087,
18117,
18174,
18241,
18274,
18282,
18283,
18864,
18865,
19111,
19112,
19289,
19290,
19292,
19294,
19296,
19298,
19300,
19388,
19416,
19631,
19640,
19784,
19785,
20265,
20266,
20663,
20664,
20666,
20668,
20670,
20672,
20736,
20793,
20877,
20881,
20882,
21319,
21320,
21581,
21582,
21744,
21745,
21749,
22339,
22340,
22487,
22488,
22545,
22593,
22677,
22731,
22832,
22927,
22928,
23206,
23207,
23209,
23211,
23213,
23215,
23217,
23219,
23221,
23223,
23225,
23228,
23231,
23234,
23237,
23240,
23243,
23246,
23249,
23252,
23255,
23258,
23261,
23264,
23267,
23270,
23273,
23276,
23294,
23323,
23406,
23407,
23498,
23499,
23523,
23584,
23680,
23743,
23744,
23750,
23751,
23800,
23889,
23895,
23896,
23897,
23934,
23993,
23999,
24000,
24013,
24023,
24029,
24033,
24034,
24100,
24101,
24103,
24105,
24107,
24109,
24111,
24113,
24115,
24117,
24119,
24122,
24125,
24128,
24131,
24134,
24137,
24140,
24143,
24192,
24202,
24233,
24255,
24261,
24262,
24275,
24314,
24315,
24338,
24371,
24433,
24464,
24472,
24478,
24479,
24483,
24484,
24891,
24892,
24966,
24967,
24969,
24971,
24973,
24975,
24977,
24979,
24981,
24983,
24985,
24988,
24991,
24994,
24997,
25000,
25003,
25006,
25009,
25012,
25015,
25018,
25021,
25045,
25051,
25086,
25112,
25151,
25162,
25188,
25243,
25254,
25279,
25332,
25343,
25381,
25425,
25436,
25474,
25550,
25561,
25598,
25606,
25613,
25614,
25933,
25934,
25949,
25950,
26015,
26016,
26092,
26093,
26157,
26158,
26197,
26198,
26202,
26963,
26964,
27293,
27294,
27432,
27433,
27678,
27679,
27738,
27739,
27741,
27743,
27745,
27747,
27797,
27815,
27833,
27837,
27838,
28315,
28316,
28633,
28634,
28755,
28756,
28758,
28760,
28762,
28764,
28766,
28768,
28800,
28805,
28862,
28936,
28941,
28945,
28946,
28972,
28973,
28975,
28977,
28979,
28981,
28983,
28985,
29017,
29021,
29078,
29151,
29155,
29159,
29160,
30020,
30021,
30617,
30618,
30998,
30999,
31001,
31003,
31005,
31007,
31009,
31011,
31049,
31050,
31088,
31125,
31126,
31130,
31131,
31787,
31788,
31911,
31912,
31914,
31916,
31918,
31920,
31922,
31924,
31956,
31960,
32029,
32053,
32057,
32061,
32062,
33084,
33085,
33322,
33323,
33327,
33684,
33685,
33687,
33702,
33703,
33860,
33861,
33863,
33865,
33891,
33926,
33927,
34036,
34037,
34039,
34041,
34043,
34071,
34097,
34112,
34113,
34594,
34595,
34597,
34599,
34601,
34603,
34629,
34669,
34745,
34840,
34841,
35104,
35105,
35109,
35488,
35489,
35495,
35496,
35497,
36022,
36023,
36636,
36637,
36918,
36919,
37470,
37471,
37521,
37522,
37526,
38572,
38573,
38752,
38753,
38755,
38798,
38799,
39189,
39190,
39192,
39234,
39235,
39700,
39701,
39705,
40299,
40300,
40314,
40315,
40582,
40616,
40652,
40837,
40838,
40851,
40853,
40855,
40857,
40859,
40861,
40863,
40865,
40867,
40893,
40904,
40930,
40958,
40976,
40987,
40998,
41006,
41007,
41154,
41155,
41167,
41168,
41784,
41785,
41819,
41855,
41856,
41869,
41871,
41873,
41875,
41877,
41879,
41881,
41883,
41885,
41887,
41890,
41893,
41896,
41899,
41902,
41905,
41908,
41911,
41937,
41938,
41956,
41993,
42013,
42014,
42037,
42069,
42176,
42220,
42230,
42238,
42239,
42262,
42268,
42269,
42283,
42284,
42425,
42426,
42440,
42441,
42943,
42944,
43096,
43097,
43169,
43170,
43237,
43238,
43256,
43282,
43283,
43326,
43351,
43364,
43391,
43411,
43437,
43457,
43463,
43464,
43472,
43473,
43477,
44482,
44483,
45248,
45249,
46128,
46129,
46375,
46376
],
"line_end_idx": [
751,
752,
762,
763,
961,
962,
1039,
1040,
1203,
1204,
1312,
1313,
1331,
1332,
1333,
1339,
1360,
1372,
1392,
1415,
1436,
1437,
1458,
1459,
1474,
1475,
1581,
1582,
1598,
1599,
1600,
1803,
1804,
1954,
1955,
1980,
1981,
1982,
2477,
2478,
2488,
2489,
2611,
2612,
2735,
2736,
2876,
2877,
2899,
2944,
3026,
3064,
3150,
3151,
3210,
3284,
3346,
3403,
3404,
3448,
3449,
3696,
3697,
3863,
3864,
3892,
3893,
3962,
4002,
4003,
4063,
4226,
4227,
4264,
4370,
4371,
4373,
4375,
4377,
4379,
4381,
4383,
4385,
4387,
4389,
4392,
4395,
4398,
4401,
4404,
4407,
4410,
4413,
4416,
4419,
4495,
4496,
4521,
4543,
4544,
4608,
4635,
4641,
4642,
4658,
4717,
4805,
4811,
4812,
4846,
4867,
4921,
4927,
4931,
4932,
4985,
5050,
5051,
5274,
5275,
5285,
5286,
5460,
5461,
5503,
5579,
5711,
5807,
5900,
5901,
5994,
5995,
6081,
6082,
6209,
6210,
6243,
6244,
6246,
6248,
6250,
6252,
6254,
6256,
6258,
6260,
6262,
6265,
6268,
6271,
6274,
6277,
6280,
6283,
6286,
6305,
6321,
6355,
6359,
6360,
6369,
6403,
6424,
6437,
6454,
6458,
6459,
6475,
6500,
6504,
6505,
6540,
6541,
6633,
6634,
6673,
6674,
6931,
6932,
6934,
6936,
6938,
6940,
6942,
6944,
6946,
6948,
6950,
6953,
6956,
6994,
7015,
7028,
7041,
7056,
7060,
7061,
7062,
7072,
7108,
7112,
7113,
7162,
7163,
7324,
7325,
7327,
7329,
7331,
7333,
7335,
7337,
7339,
7341,
7343,
7346,
7349,
7352,
7355,
7373,
7389,
7414,
7418,
7419,
7428,
7444,
7462,
7466,
7467,
7480,
7497,
7501,
7502,
7550,
7551,
7776,
7777,
7779,
7781,
7783,
7785,
7787,
7789,
7791,
7812,
7838,
7856,
7874,
7878,
7879,
7924,
7925,
7971,
7972,
8085,
8086,
8088,
8090,
8092,
8094,
8096,
8098,
8100,
8102,
8104,
8107,
8110,
8113,
8116,
8133,
8154,
8186,
8210,
8234,
8238,
8239,
8249,
8270,
8307,
8335,
8363,
8367,
8368,
8378,
8379,
8440,
8441,
8584,
8585,
8637,
8674,
8700,
8735,
8736,
8737,
8786,
8831,
8868,
8903,
8904,
8935,
8936,
9052,
9053,
9492,
9493,
9519,
9520,
9683,
9684,
9686,
9688,
9690,
9692,
9694,
9696,
9698,
9700,
9702,
9705,
9738,
9793,
9815,
9816,
9849,
9910,
9911,
9987,
10089,
10137,
10138,
10172,
10173,
10258,
10259,
10351,
10352,
10427,
10428,
10516,
10517,
10566,
10567,
10741,
10742,
10743,
10782,
10783,
10877,
10878,
10880,
10882,
10884,
10886,
10888,
10935,
10950,
10951,
11054,
11140,
11141,
11283,
11284,
11420,
11421,
11436,
11762,
11763,
11765,
11767,
11769,
11771,
11773,
11775,
11777,
11808,
11833,
11834,
11856,
11882,
11883,
11960,
11961,
12372,
12373,
12610,
12611,
12789,
12790,
12935,
12936,
12944,
12945,
13348,
13349,
13353,
13950,
13951,
14271,
14272,
14387,
14388,
14405,
14406,
14706,
14707,
14724,
14725,
14929,
14930,
14932,
14934,
14936,
14938,
14940,
14942,
14944,
14946,
14948,
14951,
14954,
14957,
14960,
14963,
15004,
15053,
15102,
15146,
15147,
15289,
15290,
15310,
15311,
15331,
15332,
15354,
15355,
15380,
15381,
15998,
15999,
16203,
16204,
16725,
16726,
16817,
16818,
16899,
16900,
16902,
16904,
16906,
16921,
16951,
16964,
16965,
17138,
17139,
17141,
17143,
17145,
17147,
17149,
17151,
17153,
17155,
17226,
17249,
17295,
17339,
17364,
17396,
17404,
17410,
17411,
17708,
17709,
17843,
17844,
17846,
17848,
17850,
17852,
17854,
17856,
17858,
17860,
17862,
17865,
17868,
17871,
17874,
17877,
17941,
17942,
17968,
17976,
18029,
18070,
18078,
18086,
18087,
18117,
18174,
18241,
18274,
18282,
18283,
18864,
18865,
19111,
19112,
19289,
19290,
19292,
19294,
19296,
19298,
19300,
19388,
19416,
19631,
19640,
19784,
19785,
20265,
20266,
20663,
20664,
20666,
20668,
20670,
20672,
20736,
20793,
20877,
20881,
20882,
21319,
21320,
21581,
21582,
21744,
21745,
21749,
22339,
22340,
22487,
22488,
22545,
22593,
22677,
22731,
22832,
22927,
22928,
23206,
23207,
23209,
23211,
23213,
23215,
23217,
23219,
23221,
23223,
23225,
23228,
23231,
23234,
23237,
23240,
23243,
23246,
23249,
23252,
23255,
23258,
23261,
23264,
23267,
23270,
23273,
23276,
23294,
23323,
23406,
23407,
23498,
23499,
23523,
23584,
23680,
23743,
23744,
23750,
23751,
23800,
23889,
23895,
23896,
23897,
23934,
23993,
23999,
24000,
24013,
24023,
24029,
24033,
24034,
24100,
24101,
24103,
24105,
24107,
24109,
24111,
24113,
24115,
24117,
24119,
24122,
24125,
24128,
24131,
24134,
24137,
24140,
24143,
24192,
24202,
24233,
24255,
24261,
24262,
24275,
24314,
24315,
24338,
24371,
24433,
24464,
24472,
24478,
24479,
24483,
24484,
24891,
24892,
24966,
24967,
24969,
24971,
24973,
24975,
24977,
24979,
24981,
24983,
24985,
24988,
24991,
24994,
24997,
25000,
25003,
25006,
25009,
25012,
25015,
25018,
25021,
25045,
25051,
25086,
25112,
25151,
25162,
25188,
25243,
25254,
25279,
25332,
25343,
25381,
25425,
25436,
25474,
25550,
25561,
25598,
25606,
25613,
25614,
25933,
25934,
25949,
25950,
26015,
26016,
26092,
26093,
26157,
26158,
26197,
26198,
26202,
26963,
26964,
27293,
27294,
27432,
27433,
27678,
27679,
27738,
27739,
27741,
27743,
27745,
27747,
27797,
27815,
27833,
27837,
27838,
28315,
28316,
28633,
28634,
28755,
28756,
28758,
28760,
28762,
28764,
28766,
28768,
28800,
28805,
28862,
28936,
28941,
28945,
28946,
28972,
28973,
28975,
28977,
28979,
28981,
28983,
28985,
29017,
29021,
29078,
29151,
29155,
29159,
29160,
30020,
30021,
30617,
30618,
30998,
30999,
31001,
31003,
31005,
31007,
31009,
31011,
31049,
31050,
31088,
31125,
31126,
31130,
31131,
31787,
31788,
31911,
31912,
31914,
31916,
31918,
31920,
31922,
31924,
31956,
31960,
32029,
32053,
32057,
32061,
32062,
33084,
33085,
33322,
33323,
33327,
33684,
33685,
33687,
33702,
33703,
33860,
33861,
33863,
33865,
33891,
33926,
33927,
34036,
34037,
34039,
34041,
34043,
34071,
34097,
34112,
34113,
34594,
34595,
34597,
34599,
34601,
34603,
34629,
34669,
34745,
34840,
34841,
35104,
35105,
35109,
35488,
35489,
35495,
35496,
35497,
36022,
36023,
36636,
36637,
36918,
36919,
37470,
37471,
37521,
37522,
37526,
38572,
38573,
38752,
38753,
38755,
38798,
38799,
39189,
39190,
39192,
39234,
39235,
39700,
39701,
39705,
40299,
40300,
40314,
40315,
40582,
40616,
40652,
40837,
40838,
40851,
40853,
40855,
40857,
40859,
40861,
40863,
40865,
40867,
40893,
40904,
40930,
40958,
40976,
40987,
40998,
41006,
41007,
41154,
41155,
41167,
41168,
41784,
41785,
41819,
41855,
41856,
41869,
41871,
41873,
41875,
41877,
41879,
41881,
41883,
41885,
41887,
41890,
41893,
41896,
41899,
41902,
41905,
41908,
41911,
41937,
41938,
41956,
41993,
42013,
42014,
42037,
42069,
42176,
42220,
42230,
42238,
42239,
42262,
42268,
42269,
42283,
42284,
42425,
42426,
42440,
42441,
42943,
42944,
43096,
43097,
43169,
43170,
43237,
43238,
43256,
43282,
43283,
43326,
43351,
43364,
43391,
43411,
43437,
43457,
43463,
43464,
43472,
43473,
43477,
44482,
44483,
45248,
45249,
46128,
46129,
46375,
46376,
46379
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 46379,
"ccnet_original_nlines": 975,
"rps_doc_curly_bracket": 0.0006899699801579118,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36637622117996216,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016094310209155083,
"rps_doc_frac_lines_end_with_ellipsis": 0.00819671992212534,
"rps_doc_frac_no_alph_words": 0.2355715036392212,
"rps_doc_frac_unique_words": 0.23330210149288177,
"rps_doc_mean_word_length": 4.80256986618042,
"rps_doc_num_sentences": 502,
"rps_doc_symbol_to_word_ratio": 0.0049205501563847065,
"rps_doc_unigram_entropy": 6.226921081542969,
"rps_doc_word_count": 7471,
"rps_doc_frac_chars_dupe_10grams": 0.021153850480914116,
"rps_doc_frac_chars_dupe_5grams": 0.04715719074010849,
"rps_doc_frac_chars_dupe_6grams": 0.0311594195663929,
"rps_doc_frac_chars_dupe_7grams": 0.023745819926261902,
"rps_doc_frac_chars_dupe_8grams": 0.021488290280103683,
"rps_doc_frac_chars_dupe_9grams": 0.021488290280103683,
"rps_doc_frac_chars_top_2gram": 0.0025919699110090733,
"rps_doc_frac_chars_top_3gram": 0.0022575301118195057,
"rps_doc_frac_chars_top_4gram": 0.0027870701160281897,
"rps_doc_books_importance": -3774.718994140625,
"rps_doc_books_importance_length_correction": -3774.718994140625,
"rps_doc_openwebtext_importance": -2063.110595703125,
"rps_doc_openwebtext_importance_length_correction": -2063.110595703125,
"rps_doc_wikipedia_importance": -1319.2991943359375,
"rps_doc_wikipedia_importance_length_correction": -1319.2991943359375
},
"fasttext": {
"dclm": 0.18841373920440674,
"english": 0.9146650433540344,
"fineweb_edu_approx": 1.9120091199874878,
"eai_general_math": 0.5833152532577515,
"eai_open_web_math": 0.16503387689590454,
"eai_web_code": 0.5728577971458435
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-2,723,908,351,153,852,000 | Fifth batch for 2.19 cycle
[git/git.git] / pretty.h
CommitLineData
cf394719
OT
1#ifndef PRETTY_H
2#define PRETTY_H
3
4struct commit;
5
6/* Commit formats */
7enum cmit_fmt {
8 CMIT_FMT_RAW,
9 CMIT_FMT_MEDIUM,
10 CMIT_FMT_DEFAULT = CMIT_FMT_MEDIUM,
11 CMIT_FMT_SHORT,
12 CMIT_FMT_FULL,
13 CMIT_FMT_FULLER,
14 CMIT_FMT_ONELINE,
15 CMIT_FMT_EMAIL,
16 CMIT_FMT_MBOXRD,
17 CMIT_FMT_USERFORMAT,
18
19 CMIT_FMT_UNSPECIFIED
20};
21
22struct pretty_print_context {
23 /*
24 * Callers should tweak these to change the behavior of pp_* functions.
25 */
26 enum cmit_fmt fmt;
27 int abbrev;
28 const char *after_subject;
29 int preserve_subject;
30 struct date_mode date_mode;
31 unsigned date_mode_explicit:1;
32 int print_email_subject;
33 int expand_tabs_in_log;
34 int need_8bit_cte;
35 char *notes_message;
36 struct reflog_walk_info *reflog_info;
37 struct rev_info *rev;
38 const char *output_encoding;
39 struct string_list *mailmap;
40 int color;
41 struct ident_split *from_ident;
42
43 /*
44 * Fields below here are manipulated internally by pp_* functions and
45 * should not be counted on by callers.
46 */
47 struct string_list in_body_headers;
48 int graph_width;
49};
50
d0e63260 51/* Check whether commit format is mail. */
cf394719
OT
52static inline int cmit_fmt_is_mail(enum cmit_fmt fmt)
53{
54 return (fmt == CMIT_FMT_EMAIL || fmt == CMIT_FMT_MBOXRD);
55}
56
57struct userformat_want {
58 unsigned notes:1;
59};
60
d0e63260 61/* Set the flag "w->notes" if there is placeholder %N in "fmt". */
cf394719 62void userformat_find_requirements(const char *fmt, struct userformat_want *w);
d0e63260
OT
63
64/*
65 * Shortcut for invoking pretty_print_commit if we do not have any context.
66 * Context would be set empty except "fmt".
67 */
cf394719
OT
68void pp_commit_easy(enum cmit_fmt fmt, const struct commit *commit,
69 struct strbuf *sb);
d0e63260
OT
70
71/*
72 * Get information about user and date from "line", format it and
73 * put it into "sb".
74 * Format of "line" must be readable for split_ident_line function.
75 * The resulting format is "what: name <email> date".
76 */
cf394719
OT
77void pp_user_info(struct pretty_print_context *pp, const char *what,
78 struct strbuf *sb, const char *line,
79 const char *encoding);
d0e63260
OT
80
81/*
82 * Format title line of commit message taken from "msg_p" and
83 * put it into "sb".
84 * First line of "msg_p" is also affected.
85 */
cf394719
OT
86void pp_title_line(struct pretty_print_context *pp, const char **msg_p,
87 struct strbuf *sb, const char *encoding,
88 int need_8bit_cte);
d0e63260
OT
89
90/*
91 * Get current state of commit message from "msg_p" and continue formatting
92 * by adding indentation and '>' signs. Put result into "sb".
93 */
cf394719
OT
94void pp_remainder(struct pretty_print_context *pp, const char **msg_p,
95 struct strbuf *sb, int indent);
96
d0e63260
OT
97/*
98 * Create a text message about commit using given "format" and "context".
99 * Put the result to "sb".
100 * Please use this function for custom formats.
101 */
cf394719
OT
102void format_commit_message(const struct commit *commit,
103 const char *format, struct strbuf *sb,
104 const struct pretty_print_context *context);
105
d0e63260
OT
106/*
107 * Parse given arguments from "arg", check it for correctness and
108 * fill struct rev_info.
109 */
cf394719
OT
110void get_commit_format(const char *arg, struct rev_info *);
111
d0e63260
OT
112/*
113 * Make a commit message with all rules from given "pp"
114 * and put it into "sb".
115 * Please use this function if you have a context (candidate for "pp").
116 */
cf394719
OT
117void pretty_print_commit(struct pretty_print_context *pp,
118 const struct commit *commit,
119 struct strbuf *sb);
120
d0e63260
OT
121/*
122 * Change line breaks in "msg" to "line_separator" and put it into "sb".
123 * Return "msg" itself.
124 */
cf394719
OT
125const char *format_subject(struct strbuf *sb, const char *msg,
126 const char *line_separator);
127
d0e63260 128/* Check if "cmit_fmt" will produce an empty output. */
cf394719
OT
129int commit_format_is_empty(enum cmit_fmt);
130
131#endif /* PRETTY_H */ | {
"url": "https://git.uis.cam.ac.uk/x/uis/git/git.git/blame/1d89318c48d233d52f1db230cf622935ac3c69fa:/pretty.h",
"source_domain": "git.uis.cam.ac.uk",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "39963",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3GQBBDTDPBYFEIF3GLANO5GQMRSV6DTL",
"WARC-Concurrent-To": "<urn:uuid:0660cbc2-574c-4479-bb80-814167ada0d5>",
"WARC-Date": "2021-01-18T08:22:54Z",
"WARC-IP-Address": "131.111.9.100",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:AM2RFXNHRJOFCJVOG3UN2BD7Z3YS2L7S",
"WARC-Record-ID": "<urn:uuid:069116c1-f315-46a2-ac61-e6c5c3224338>",
"WARC-Target-URI": "https://git.uis.cam.ac.uk/x/uis/git/git.git/blame/1d89318c48d233d52f1db230cf622935ac3c69fa:/pretty.h",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6d8756d3-65a7-4bb6-8f25-fb070b027e9b>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-52.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
27,
52,
67,
76,
79,
97,
115,
117,
133,
135,
157,
174,
190,
209,
248,
267,
285,
305,
326,
345,
365,
389,
392,
416,
421,
424,
456,
462,
536,
542,
564,
579,
609,
634,
665,
699,
727,
754,
776,
800,
841,
866,
898,
930,
944,
979,
982,
988,
1060,
1102,
1108,
1147,
1167,
1172,
1175,
1229,
1238,
1241,
1297,
1301,
1362,
1366,
1369,
1396,
1417,
1422,
1425,
1503,
1593,
1602,
1605,
1608,
1613,
1691,
1737,
1743,
1752,
1755,
1825,
1848,
1857,
1860,
1863,
1868,
1936,
1959,
2029,
2085,
2091,
2100,
2103,
2174,
2214,
2240,
2249,
2252,
2255,
2260,
2324,
2347,
2392,
2398,
2407,
2410,
2484,
2528,
2551,
2560,
2563,
2566,
2571,
2649,
2713,
2719,
2728,
2731,
2804,
2839,
2842,
2851,
2854,
2859,
2935,
2964,
3015,
3022,
3031,
3034,
3093,
3136,
3185,
3189,
3198,
3201,
3207,
3276,
3304,
3311,
3320,
3323,
3386,
3390,
3399,
3402,
3408,
3467,
3495,
3570,
3577,
3586,
3589,
3650,
3683,
3707,
3711,
3720,
3723,
3729,
3805,
3832,
3839,
3848,
3851,
3917,
3950,
3954,
4022,
4031,
4034,
4080,
4084
],
"line_end_idx": [
27,
52,
67,
76,
79,
97,
115,
117,
133,
135,
157,
174,
190,
209,
248,
267,
285,
305,
326,
345,
365,
389,
392,
416,
421,
424,
456,
462,
536,
542,
564,
579,
609,
634,
665,
699,
727,
754,
776,
800,
841,
866,
898,
930,
944,
979,
982,
988,
1060,
1102,
1108,
1147,
1167,
1172,
1175,
1229,
1238,
1241,
1297,
1301,
1362,
1366,
1369,
1396,
1417,
1422,
1425,
1503,
1593,
1602,
1605,
1608,
1613,
1691,
1737,
1743,
1752,
1755,
1825,
1848,
1857,
1860,
1863,
1868,
1936,
1959,
2029,
2085,
2091,
2100,
2103,
2174,
2214,
2240,
2249,
2252,
2255,
2260,
2324,
2347,
2392,
2398,
2407,
2410,
2484,
2528,
2551,
2560,
2563,
2566,
2571,
2649,
2713,
2719,
2728,
2731,
2804,
2839,
2842,
2851,
2854,
2859,
2935,
2964,
3015,
3022,
3031,
3034,
3093,
3136,
3185,
3189,
3198,
3201,
3207,
3276,
3304,
3311,
3320,
3323,
3386,
3390,
3399,
3402,
3408,
3467,
3495,
3570,
3577,
3586,
3589,
3650,
3683,
3707,
3711,
3720,
3723,
3729,
3805,
3832,
3839,
3848,
3851,
3917,
3950,
3954,
4022,
4031,
4034,
4080,
4084,
4108
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4108,
"ccnet_original_nlines": 171,
"rps_doc_curly_bracket": 0.0019474199507385492,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12266355007886887,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04322430118918419,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.44042056798934937,
"rps_doc_frac_unique_words": 0.5415225028991699,
"rps_doc_mean_word_length": 5.257785320281982,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0.0035046699922531843,
"rps_doc_unigram_entropy": 5.282371997833252,
"rps_doc_word_count": 578,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04606778919696808,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03619612008333206,
"rps_doc_frac_chars_top_3gram": 0.02764067053794861,
"rps_doc_frac_chars_top_4gram": 0.014478449709713459,
"rps_doc_books_importance": -456.9292297363281,
"rps_doc_books_importance_length_correction": -456.9292297363281,
"rps_doc_openwebtext_importance": -239.97604370117188,
"rps_doc_openwebtext_importance_length_correction": -239.97604370117188,
"rps_doc_wikipedia_importance": -126.19786071777344,
"rps_doc_wikipedia_importance_length_correction": -126.19786071777344
},
"fasttext": {
"dclm": 0.246137797832489,
"english": 0.4726165533065796,
"fineweb_edu_approx": 2.016510248184204,
"eai_general_math": 0.15198677778244019,
"eai_open_web_math": 0.12264972925186157,
"eai_web_code": 0.6948888897895813
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-4,955,607,157,465,480,000 | Become a fan of Slashdot on Facebook
Forgot your password?
typodupeerror
Slashdot videos: Now with more Slashdot!
• View
• Discuss
• Share
We've improved Slashdot's video section; now you can view our video interviews, product close-ups and site visits with all the usual Slashdot options to comment, share, etc. No more walled garden! It's a work in progress -- we hope you'll check it out (Learn more about the recent updates).
×
Comment: Re:Apple remains in control through non-free softw (Score 1) 140
by bm_luethke (#34963038) Attached to: No <em>Playboy</em> App For iPad, After All
The primary reason is one of intended use. Smart phones are are billed as a do anything be your central media device. It sucks to then find out that they deny some things based on *content*. One can usually understand why a smart phone isn't going to play DVD's, not so much that you can't get a playboy magazine because the person who runs the smartphones company thinks you shouldn't be watching that. Further it is apps that a good number want to do and find they can't so it is something they notice. When they (and I include all the smart phone makers - this isn't apple centric) market them as general purpose computing devices that happen to make phone calls people expect them to be general purpose computers.
Game consoles are, well game consoles. When they do other things - like watch movies or surf the internet - that is generally a plus. It's rare someone looks and say "Gosh I wish I could do that on this thing but they will not let me". Few complain that they can't reflash their Blu-ray players, TV's, microwaves, non-smartphones, and most other appliances.
Some will always want to hack around on them, but for the most part being able to run Linux on a PS3 is a irrelevancy to all but a handful of PS3 owners because that isn't what you purchased the device to do. You purchase a smart phone to have a portable computer that makes phone calls.
Comment: Umm yea... (Score 0) 406
by bm_luethke (#34895116) Attached to: New York Times Reports US and Israel Behind Stuxnet
Isn't this the same people who told me the Tucson shooter was influenced heavily by Palin, the Tea Party people, and was a right wing zealot? If they can't even get that right why believe them now on highly secret and very competent spy stuff?
Frankly if they *were* responsible for this more would be happy than not - given Iran's govt isn't this how we would want them to act instead of bombing them (and surely no one here thinks a nuclear weaponized Iran is a Good Idea)? Iran's Nuclear program makes few happy outside of Iran and such an easy crippling of it with little to no others damaged is more competent than I think most of the western world is capable of. Indeed should we even believe them as to how much it crippled Iran?
It seems to me that the vast majority of what we "know" about this is from people who can't figure out if a person with extensive postings on the internet a 10 minute search points out is a Lefty, Righty, or a Nihilist why should we believe them on things that take months of research into highly secret areas that leaking information results in long term prison sentences? As far as I can tell they have done extensive research of speculation on the internet and printed it as something more - well yea, those are some of the more likely to be suspected but there are others. They are months behind reading comments here and seem to have about the same level of insight into the thing (which is nothing more than speculation).
Comment: Re:Open Platform? (Score 1) 459
by bm_luethke (#34873750) Attached to: Is Samsung Blocking Updates To Froyo?
Since I made sure I purchased one that I could do what I want on (several out there) quite good.
Nice thing about "open platform", "not locked to a walled garden", and "no need to jailbreak" is that you can serve all your customers. Some want the flexibility, others (as the iPhone people constantly tell us) like to be walled in and told what to do, some even like something in between. With Android I can get any of that, with iOS I get whatever Apple decides I want and nothing else.
So, I would say its going pretty good - how are those sales numbers of the iPhone going for all those that rant against Android?
Comment: Does it matter? (Score 3, Interesting) 221
by bm_luethke (#34845484) Attached to: Tunisian Gov't Spies On Facebook; Does the US?
You are posting to a public gateway and then are afraid that someone is treating that data as public - how dare they!
Really, it isn't private communications and, as such, there is no need for a warrant or anything for anyone to get at it. This is data mining, not spying, and is done all the time. I bet there is a web crawler somewhere on this planet that is "spying" on this post on slashdot too - there is no fourth amendment rights to information you broadcast to everyone on the planet, indeed I do not even see how there could be.
Comment: Re:Oh yeah? (Score 2, Insightful) 550
by bm_luethke (#34811630) Attached to: Android Passes iPhone In US Market Share
Only if you consider 3% market share "a lot". Indeed, the article quoted points out that Android is just slightly outside the margin of error to tie with Apple (rim at .3% higher market share is considered to be tied with either one due to margin of error). With respect to margin of errors both articles agree. However you may want to take a gander at the upper graph in the article linked, Android has 40.8% of new sales and iPhone at 26.9% - roughly a 14 point difference and that *is* major (indeed, at that different a rate the exact date in November of differences in sampling can certainly make enough difference for the discrepancy).
Not sure how that equates to the iPhone still in the lead by a lot, but oh well. Maybe all those people who were holding off purchasing an iPhone waiting on version 4 to come out are now going to rush out and save Apples Market share. Since we haven't seen that phenomenon happen yet (and a few months back it was *obvious* that was going to happen) it should within the next quarter. After all we were supposed to add those people in the last two quarters, might as well shift Apples market by them now too.
Comment: Re:LOL (Score 1) 754
by bm_luethke (#34800762) Attached to: Apple Pulls VLC Media Player From AppStore
Of course it has to do with Apple - they disallow certain licenses. VLC isn't going to be able to have a different license for each OS it may run on nor should they have too. The stupid thing is that VLC ever made it on there in the first place - it isn't like it was a secret that their licenses were incompatible. Apple may have chosen to ignore this and it certainly looks like on of the developers pointed it out to Apple, but that doesn't make it VLC's fault.
If Microsoft were to decide that you aren't legally allowed to run any GPL software in Windows and then removed your ability too (except for the apps they decided to ignore the incompatibility) I'm fairly certain most here - including yourself - would be blaming Microsoft and not calling for the GPL to go away. That's exactly what Apple is doing, you have to run under a license that allows certain restrictions and the GPL doesn't. That Apple and some projects look the other way doesn't make it a non-issue, indeed with the way GPL works it is interesting that Apple could get in trouble by someone other than author who demands their rights under the GPL (further that they chose to enforce it on some project and not others makes another legal issue for them). Its more surprising that anything GPL made it on their store at all than that they took it off. However it is Apple's choice to limit the license that can be used with their store, not that a project decided to go with the GPL.
You may very well like Apple making this type of decision - obviously a number of people really love the idea of a Walled Garden (everyone of these threads will have someone talking about how great it is to not have that many choices), that is a totally other argument. However Apple clearly chose a license that is incompatible with the GPL. They probably didn't do so intentionally (well, kinda - their Walled Garden idea is anathema to the GPL's Open Garden - it is more a clash of ideas and not directed at GPL directly), but it was their choice to go with that license. Its also been there from the beginning so I don't see why so many are surprised, but that still doesn't remove Apples choice being the limiting factor here.
Comment: Re:So what? (Score 2) 292
by bm_luethke (#34741528) Attached to: Apple Support Company Sues Customer For Complaint
It is often not that simple - lawsuits also cost money and time for everyone. More than several companies use the fact that they have bigger pockets and can sue all they want as a weapon. In some cases it can be cheaper to create fear of a lawsuit than the amount of money lost through bad reviews. That's probably not very often and even if the person complaining is truly giving undeserved bad press it is usually worse to sue for it, but hey not everyone sees it that way (see the RIAA/MPAA for a great example). It isn't unreasonable to assume several thousand dollars in defense attorney fees.
There is very much a story about someone suing because someone gave them a bad review. Not sure what to do about it, but there is a story there.
Comment: Angry over the wrong thing (Score 2) 1219
by bm_luethke (#34727842) Attached to: 'No Refusal' DUI Checkpoints Coming To Florida?
The whole issue here is the implied consent, not having judges on site (which is what people here seem to be flipping out over).
These work like a normal DUI checkpoint. Most people have been through them. They have the road blocked, you drive up, they ask for you license. When you hand it to them they smell your breath and the car and shine a flashlight into your eyes to see how they dilate. If any of those offer probably cause they ask you to pull over and go through a sobriety check. Failing that they generally give a breathalyzer test and failing that you get arrested. You, through the fifth amendment, have a right to voluntarily refuse. They, through how our legal system work, then have a right to request a judge review the case and issue a warrant, usually for a blood test as you have no physical control of that (no warrant could make you blow through the tube hard). All of that is perfectly legal and has been since the US was first founded and, IMO is just fine.
Now, people who drive drunk often have tricks, most do not work. One of them that might maybe work is to simply refuse everything and wait for a judge to be consulted, review the case, issue the warrant, get a medical technician down there, and draw blood. A process that can even take a couple of hours on busy nights. During that time you metabolize alcohol and have a chance to fall below the legal limit, especially if you were barely over the limit to begin with.
The *only* difference is that the Judge and medical worker are on site. If, as stated in some of these articles Florida has some "implied consent" then the issue is there, not with this type of checkpoint. They could have a drunk tank collect up people, drive the to the county building, issue the warrants, and take blood already on the simple refusal. This isn't a change in law or a change in practice, it is a change in the amount of time needed. They make the argument (and again, this part is *not* new by any means) that by accepting your drivers license that you have already pre-agreed to take a breathalyzer test any time, anywhere, and for any reason. Not really sure though why you can't suddenly decide that to not be the case as you can certainly decide in a question by question case to exercise your fifth amendment rights, further the fourth amendment isn't a tiny one either and is fairly explicit about refusal not being evidence for a warrant. Obviously given the amount of time this has been in effect it either hasn't been challenged or has and some crazy judge found it constitutional. I suspect that a constitutional fight against an "implied consent" would win (but, as we have seen with our current courts the constitution is seen as a "living document" where the bigger question is can you rationalize it to say what you want it too so who knows), I suspect they know that, and like many other crappy laws they only enforce in places that they know they would not loose.
As for the Judge on site, many other states do them and its a pretty good idea. In most states they can't detain for refusal of the breathalyzer unless they have fairly strong probable cause - basically if they would have detained you and gotten blood before they still can. If the police have probable cause to require testing and given that the most accurate gathering of facts will occur this way it is quite within the intents of our judiciary system to do this. Further with the Judge on site they can personally oversee the idea of probable cause and the treatment of the detainees by the police. Lastly it certainly works well on the whole "speedy justice system". For everyone but the person that is only slightly over the legal limit who would have gotten away with it this is a win. There isn't a constitutional argument that it is his right for a slow gathering of facts simply because that would favor them.
I would bet Florida is on shaky grounds with it not because of the judge on site, but because implied consent is, well, stupid. Having a Judge on site is a pretty good idea IMO.
Comment: Re:Weather Alert (Score 0) 509
by bm_luethke (#34695732) Attached to: Paris To Test Banning SUVs In the City
Personally I love it when people smugly complain about people complaining about smug. Even better when we do smug=smug+1 and prove that to be true (which is I guess what my post is). we can post these posts indefinitely and be useful!
I guess the real question is when does "smug" end?
For myself I consider this truly "smug" - that is people who are the primary source of pollution are projecting their issues on anyone they can rationalize as Teh Evil whilst doing nothing about the real issue. Yea, SUV's give out a higher proportion that than their usage would indicate, but when you are a small percentage of the usage it isn't going to make much difference. It is "smug" in that they hit an easy target that isn't going to do any good other than make people feel better about their choice that is the primary source of pollution yet allow them to continue doing what they have been doing. Even if they cut out *all* SUV driving it would be a drop in the bucket against the primary pollutant which they aren't going to touch with a 200 foot pole as too many will rebel against it (after all, you should be going against someone else as all those others are the ones that do not care - I *CARE* and that is worth a whole PILE of carbon credits and makes my greenhouse emissions be greatly cleaner!!!!!).
But yea, I guess I fear change and find myself a Slashtard. It *couldn't* be that, you know, I would like to see things actually change instead of give most people a warm fuzzy as we go into the abyss. But then isn't this France? Is there any entity on the planet that doesn't expect this behavior from them?
Comment: The orginal Tron wasn't Very good either. (Score 1) 429
by bm_luethke (#34683348) Attached to: <em>Tron: Legacy</em> — Too Much Imagination Required?
Really, as a movie it wasn't very good. It's plot was a strange combination of overused cliche's that were forced into a "modern" setting with much of it left up to the watcher to fill in. If you were technical enough with a good imagination you filled in the blanks to where you liked it, if not then it was just pretty graphics that even 5 years later didn't look that good. Even then most of the enjoyment was technical, not really to do with the story or cinematography.
I liked it and still do today, but I do so because someone somewhere in the process had a good combination of understanding of technology and decision making to force the confusing parts to be done anyway. It created a "realistic" (as much as you can say that) environment for a program to live in. For me the part I truly liked and still love watching is the interaction between Flynn and the Bit - it is one of the best pieces of cyberpunk moviedom out there. Of course part of that is that cyberpunk movies traditionally blow chunks.
I haven't seen the sequel yet - I fell on a patch of ice and injured my back before it came out and until I get the MRI done this Wednesday am not supposed to do that much movement. My guess is it is either the same things and will simply be a cult classic or they just raped the whole thing. It is VERY unlikely that they created something that appeals to such a strange and unforgiving market as the people who love the original Tron and those that watch movies now. Given that I'm one of the ones that liked the original I hope for a cult classic, but I figure they probably raped it.
Comment: Re:How Absurd (Score 1) 545
by bm_luethke (#34669020) Attached to: Does Typing Speed Really Matter For Programmers?
A simple Words per Minute test also excludes a number of quite qualified programmers that I happen to belong too - Dyslexics. My WPM sucks royally, I can't spell to save my life. Were it not for the nice little red lines under words and the ability to right click and find a correct spelling (and it often takes a few attempts to get close enough) my posts would look like a strange five year old posted them (my handwriting looks like a three year old did - bad spelling *and* terrible penmanship). As is a a great deal of the strangely worded sentences are work arounds for the issue. There are times that I just can't even get close enough that the spell/grammar checker can figure out what I want.
I type quite quickly if one were to count "typo's" as only things I didn't mean to hit. That is, the myriad "thier" was intentional and thus not a reduction against my WPM. Indeed, in every job I have had even the secretaries comment on how fast I type, yet I get a TON of red underlines. Were most of them not simply my inability to spell that would be OK, indeed I know the vast majority of times I mis-hit keys (and backspace them out), but that doesn't matter when you have a severe difficulty in telling "their" from "thier" if not for the red underlines the spell checker added.
And yes, this makes weakly typed languages a real pain if they get to be any size at all. However, for the most part it is so common an error outside of when I was first learning it is quickly checked with other automated tools.
Comment: Regulations following.... (Score 1) 208
by bm_luethke (#34658104) Attached to: Aerial Video Footage of New York Taken By RC Plane
in 3..2..1..
Nifty things - I always wondered why the RC aircraft people never really got into this. The technology can't be that tough to do and there looks to be quite a bit of fun involved. As pretty as this was in a city I would *love* to see a number of rural recording through some of the mountainous regions or night flying. Whilst I have a fairly severe fear of heights I normally still request a window seat on air planes because the anxiety is generally worth the view, I've tried to take pictures but commercial airliners windows aren't optimized for taking them. Were I to guess I would have said money is the primary reason - but well I know more than a few into the larger scale RC planes and money isn't their primary concern (many have more invested than they would for a decent car and the *know* at some point it is going to crash). They have all just looked at me like I was crazy when I asked.
I'm also surprised he got permission (and, for the moment, I'll ignore the 900lb gorilla of our current clamp downs) and note that there are two types of RC planes - those that have crashed and burned and those that will. As such even in rural areas if you are going to go outside of a really small range (basically around your own house) you have to go to specific areas designated for them. It's not just other aircraft (it would be ...bad... if a real airplane hit one of these where it wasn't supposed to be) but they are where people normally aren't so they do not crash on unsuspecting heads. Most of those areas in the film are not that - they are dense urban areas. Whilst the footage is neat, had there been one of the not so rare glitches and someone that was simply walking down a street got killed for it, not so much. The video shows more than one place this would *not* have been an unlikely scenario. Heck they keep manned aircraft that are MUCH more stable limited for that reason too.
Not that I'm against this being in our hands, but just that NYC may not be the best place for fly overs :) (lots of really nice non-urban areas).
Comment: Re:Anyone else here wondering? (Score 1) 118
by bm_luethke (#34649748) Attached to: Study Finds DDoS Attacks Threaten Human Rights
There is an old statement out there about it that has been around in one form another for - well - about as long as people have been around.
I'll tell it the way I first heard it (late 80's): "A death of another is comedy, a paper cut on my finger is a tragedy".
That pretty much sums up a great deal of our attitudes going on now. DDoS someone you do not like and it is Power to the People, the only way we can fight back, how *dare* you prosecute them. DDoS someone we like and where are the feds, these people need decades in jail as it is obvious these are private servers - this is a travesty and is near treason!!!! Further I think this attitude is *not* seen as being in conflict with itself and most are confused others do not share it, it isn't a convenient argument but is a truly held belief.
Personally I think what will eventually be seen is that civilization only moves forward faster than its core principles do. This means that whilst the core principles move forward in the long run, short term we move ahead, collapse back behind them, and then move ahead of them again. While that average moves forward at a nice smooth pace the actual in this moment level of civilization swings back and forth. I think we are nearing a swing backwards as these ideas need to be truly internalized and not rationalized to whatever the individual wants at the moment.
Comment: Not the first industry.... (Score 1) 620
by bm_luethke (#34638740) Attached to: Electric Cars May Be Made Noisier By Law
Electric cars aren't the fist industry to be effected by this. They aren't the first electric vehicles around pedestrians in the wild, nor are they they first to find too silent means people get run over.
Ever wonder why so many electric vehicles make that nice annoying beeping when backing up (say, forklifts and such)? That is because so many people got backed over and severely injured even with alert drivers. Tire noise? Yea, that will work in so many places where the noise (even if everyone was electric) is high enough you can't hear the gravel crunching (and woe be to any place that smooths surfaces). Want to have to driver watch - do you *really* want the guy with 4 hours of sleep last night and two beers being the primary responsibility you can walk the rest of your life (again note that tire noise isn't that loud when in most public places)? It may be a moral victory that he was in the wrong, but I would rather have working legs than a moral victory and needing to navigate by pushing a small rod with my tongue.
I've been in more than one place where an electric vehicle pulls up behind me and the drivers voice makes me jump. They have been with cars, forklifts, and simple golf carts. The only ones that have ever truly scared me are the cars - they have been the only ones that *both* of us jumped when it was noticed (and in all cases they were backing - I'm not counting someone focused and alert trying to scare me, those are irritating but not severe accidents due to accidental circumstances). The others all had audible cues when they were moving in any way other than forward, even then being the person outside the reinforced steel cage I wish they had some audible cue they were moving. Whilst I've certainly been one inside of said cage (that is - driving forward whilst alert in an attempt to make someone jump), I've also felt the idea of if the driver had been distracted and rolled a 2 ton monstrosity over me due to inattention so we could be extra quite to be, well, not really a good idea. I rather suspect that most people would feel the same way - that a life in a wheel chair (and I have to note that this is being optimistic and assuming you live through the accident) wasn't worth everyone else not hearing a slight hum.
But hey - lots of people here do not want that noise!!!!
Quite is certainly good and a reduction in noise pollution is certainly a plus for electrics (and hybrids - where most of us have experience with a vehicle running under electric power). Yet one can get too quite when you are talking a high fraction of a metric ton (or usually greater) moving at speeds enough to kill. Tire noise isn't that much and with most electrics that is all you get. Even were it only the blind I would argue for it, however for those of us gifted with sight we *still* use our ears more than our eyes for situational awareness. There isn't *anyone* on this planet that this wouldn't benefit.
Comment: What about everyone? (Score 1) 349
by bm_luethke (#34570716) Attached to: Stuxnet Virus Set Back Iran’s Nuclear Program by 2 Years
Really - does *anyone* out there but Iran want them to have nuclear weapons? Is there a country out there that doesn't at least have one or two decent enough engineers to do this type of work? While many of their engineers may not be immediately trained to do this type of work it isn't *that* hard to do. After all, look at the number of teenagers that do it - they aren't that worldly and have a vast knowledge of the world that a 30+ year old does, they just have motivation to do it. Most then age into engineers that do not do that type of work but excel in more mainstream activities - it isn't like that ability goes away either.
Well, I guess Uzbekistan is probably pretty low on the list, but I bet you can't come up with a country that doesn't at least have two or three capable of doing this (which is all it would take) and would not like to find Iran with a nuclear arsenal. Indeed, I would be happy if it *were* the US that did this as it would be uncharacteristically competent of them. I'll buy Russia or China well before even Israel for the same reason - they would have had to have been hit with the Clue Bat to get this to work out and not be leaked by this point (and no, this has nothing to do with Wikileaks as that has tended to be more an isolated incident that is stirring up all the traffic - though there is a good joke there about secrecy). I would look to, as you say, countries that specialize in this type of thing and that is mostly a short list - however it isn't *that* hard either so I wouldn't limit it to them.
Some people have a great ambition: to build something that will last, at least until they've finished building it.
Working... | {
"url": "http://slashdot.org/~bm_luethke",
"source_domain": "slashdot.org",
"snapshot_id": "crawl=CC-MAIN-2015-11",
"warc_metadata": {
"Content-Length": "110831",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:33QBIIUS7XPCEUHS5PCBL7AVGAVVES4P",
"WARC-Concurrent-To": "<urn:uuid:80d0bfab-2b7e-4ce7-801d-bc74d71ccf0b>",
"WARC-Date": "2015-03-05T22:34:21Z",
"WARC-IP-Address": "216.34.181.45",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:NEDAETGDV7DOAZ7ZP3XEPZLPPGYSGKHN",
"WARC-Record-ID": "<urn:uuid:fa478c52-c401-43e5-ab41-a57b842a824a>",
"WARC-Target-URI": "http://slashdot.org/~bm_luethke",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:129d9db9-ed29-4248-9d6f-3f94c955ca26>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-28-5-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-11\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for February 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
37,
38,
40,
41,
42,
43,
65,
79,
80,
121,
122,
131,
132,
144,
145,
155,
156,
447,
448,
450,
451,
525,
526,
609,
610,
1328,
1329,
1687,
1688,
1976,
1977,
2011,
2012,
2103,
2104,
2348,
2349,
2842,
2843,
3571,
3572,
3613,
3614,
3691,
3692,
3789,
3790,
4180,
4181,
4310,
4311,
4363,
4364,
4450,
4451,
4569,
4570,
4990,
4991,
5038,
5039,
5119,
5120,
5762,
5763,
6272,
6273,
6303,
6304,
6386,
6387,
6852,
6853,
7848,
7849,
8581,
8582,
8617,
8618,
8707,
8708,
9307,
9308,
9453,
9454,
9505,
9506,
9593,
9594,
9723,
9724,
10579,
10580,
11049,
11050,
12548,
12549,
13469,
13470,
13648,
13649,
13689,
13690,
13768,
13769,
14004,
14005,
14056,
14057,
15079,
15080,
15389,
15390,
15455,
15456,
15556,
15557,
16032,
16033,
16570,
16571,
17159,
17160,
17197,
17198,
17286,
17287,
17989,
17990,
18575,
18576,
18805,
18806,
18855,
18856,
18946,
18947,
18960,
18961,
19862,
19863,
20865,
20866,
21012,
21013,
21067,
21068,
21154,
21155,
21296,
21297,
21419,
21420,
21961,
21962,
22528,
22529,
22579,
22580,
22660,
22661,
22866,
22867,
23696,
23697,
24931,
24932,
24989,
24990,
25608,
25609,
25653,
25654,
25756,
25757,
26394,
26395,
27307,
27308,
27423,
27424
],
"line_end_idx": [
37,
38,
40,
41,
42,
43,
65,
79,
80,
121,
122,
131,
132,
144,
145,
155,
156,
447,
448,
450,
451,
525,
526,
609,
610,
1328,
1329,
1687,
1688,
1976,
1977,
2011,
2012,
2103,
2104,
2348,
2349,
2842,
2843,
3571,
3572,
3613,
3614,
3691,
3692,
3789,
3790,
4180,
4181,
4310,
4311,
4363,
4364,
4450,
4451,
4569,
4570,
4990,
4991,
5038,
5039,
5119,
5120,
5762,
5763,
6272,
6273,
6303,
6304,
6386,
6387,
6852,
6853,
7848,
7849,
8581,
8582,
8617,
8618,
8707,
8708,
9307,
9308,
9453,
9454,
9505,
9506,
9593,
9594,
9723,
9724,
10579,
10580,
11049,
11050,
12548,
12549,
13469,
13470,
13648,
13649,
13689,
13690,
13768,
13769,
14004,
14005,
14056,
14057,
15079,
15080,
15389,
15390,
15455,
15456,
15556,
15557,
16032,
16033,
16570,
16571,
17159,
17160,
17197,
17198,
17286,
17287,
17989,
17990,
18575,
18576,
18805,
18806,
18855,
18856,
18946,
18947,
18960,
18961,
19862,
19863,
20865,
20866,
21012,
21013,
21067,
21068,
21154,
21155,
21296,
21297,
21419,
21420,
21961,
21962,
22528,
22529,
22579,
22580,
22660,
22661,
22866,
22867,
23696,
23697,
24931,
24932,
24989,
24990,
25608,
25609,
25653,
25654,
25756,
25757,
26394,
26395,
27307,
27308,
27423,
27424,
27434
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 27434,
"ccnet_original_nlines": 181,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 3,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5074092745780945,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02248338982462883,
"rps_doc_frac_lines_end_with_ellipsis": 0.005494509823620319,
"rps_doc_frac_no_alph_words": 0.14035087823867798,
"rps_doc_frac_unique_words": 0.2606777548789978,
"rps_doc_mean_word_length": 4.301784515380859,
"rps_doc_num_sentences": 206,
"rps_doc_symbol_to_word_ratio": 0.0035769001115113497,
"rps_doc_unigram_entropy": 6.012028694152832,
"rps_doc_word_count": 4987,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.006152989808470011,
"rps_doc_frac_chars_dupe_6grams": 0.0016780899604782462,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.003729080082848668,
"rps_doc_frac_chars_top_3gram": 0.002330679912120104,
"rps_doc_frac_chars_top_4gram": 0.0019577699713408947,
"rps_doc_books_importance": -2260.705810546875,
"rps_doc_books_importance_length_correction": -2260.705810546875,
"rps_doc_openwebtext_importance": -1097.6539306640625,
"rps_doc_openwebtext_importance_length_correction": -1097.6539306640625,
"rps_doc_wikipedia_importance": -1068.8607177734375,
"rps_doc_wikipedia_importance_length_correction": -1068.8607177734375
},
"fasttext": {
"dclm": 0.5920844078063965,
"english": 0.9799296259880066,
"fineweb_edu_approx": 1.5138620138168335,
"eai_general_math": 0.18532127141952515,
"eai_open_web_math": 0.2948722243309021,
"eai_web_code": 0.050376828759908676
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "343.730285",
"labels": {
"level_1": "Social sciences",
"level_2": "Law",
"level_3": "Criminal law"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
9,041,051,635,354,182,000 | ++ed by:
IOANR EGOR SYP SKAUFMAN ZMUGHAL
12 PAUSE user(s)
5 non-PAUSE user(s).
Tobias Leich
and 1 contributors
NAME
SDL::Mixer::Groups - Audio channel group functions
CATEGORY
Mixer
METHODS
reserve_channels
my $reserved = SDL::Mixer::Groups::reserve_channels( $num );
$num is the number of channels to reserve from default mixing. Zero removes all reservations.
Reserve $num channels from being used when playing samples when passing in -1 as a channel number to playback functions. The channels are reserved starting from channel 0 to $num-1. Passing in zero will unreserve all channels. Normally SDL_mixer starts without any channels reserved.
The following functions are affected by this setting:
Returns: The number of channels reserved. Never fails, but may return less channels than you ask for, depending on the number of channels previously allocated (see SDL::Mixer::Channels::allocate_channels).
group_channel
my $grouped = SDL::Mixer::Groups::group_channel( $channel, $group );
Add a channel to group id (any positive integer), or reset it's group to the default group by passing (-1).
Returns: True(1) on success. False(0) is returned when the channel specified is invalid.
group_channels
my $grouped = SDL::Mixer::Groups::group_channels( $from_channel, $to_channel, $group );
Add a range of channels to group id (any positive integer), or reset their group to the default group by passing (-1).
Returns: The number of affected channels.
group_available
my $channel = SDL::Mixer::Groups::group_count( $group );
group_newer returns the first available channel of this group.
group_count
my $channels = SDL::Mixer::Groups::group_count( $group );
group_newer returns the number of channels in this group.
group_oldest
my $channel = SDL::Mixer::Groups::group_oldest( $group );
group_newer returns the channel number which started to play at first.
group_newer
my $channel = SDL::Mixer::Groups::group_newer( $group );
group_newer returns the channel number which started to play at last.
fade_out_group
SDL::Mixer::Groups::fade_out_group( $group, $ms );
Fades out the channels by the given group id. The fade-out-time is specified by $ms.
Returns the number of affected channels.
halt_group
SDL::Mixer::Groups::hals_group( $group );
Halts the channels by the given group id.
Returns 0.
AUTHORS
See "AUTHORS" in SDL. | {
"url": "https://metacpan.org/pod/distribution/SDL/lib/pods/SDL/Mixer/Groups.pod",
"source_domain": "metacpan.org",
"snapshot_id": "crawl=CC-MAIN-2015-18",
"warc_metadata": {
"Content-Length": "61200",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6VJQAUPRBBKWZCDVBSAB3ZO6HD6BJTNK",
"WARC-Concurrent-To": "<urn:uuid:1c5cb62d-e8b7-4391-a7f5-bbc5615948f7>",
"WARC-Date": "2015-04-19T17:47:07Z",
"WARC-IP-Address": "23.235.37.143",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:I5AL6JAVO35ZEWJQPADQUBYMYQPRLP7N",
"WARC-Record-ID": "<urn:uuid:c30817fc-1d1a-459d-8c26-24867f331bd2>",
"WARC-Target-URI": "https://metacpan.org/pod/distribution/SDL/lib/pods/SDL/Mixer/Groups.pod",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b8c35adb-088f-4d90-a171-cfef3053da71>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-10-82.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
9,
41,
42,
59,
80,
81,
94,
113,
114,
119,
120,
171,
172,
181,
182,
188,
189,
197,
198,
215,
216,
278,
279,
373,
374,
658,
659,
713,
714,
920,
921,
935,
936,
1006,
1007,
1115,
1116,
1205,
1206,
1221,
1222,
1311,
1312,
1431,
1432,
1474,
1475,
1491,
1492,
1550,
1551,
1614,
1615,
1627,
1628,
1687,
1688,
1746,
1747,
1760,
1761,
1820,
1821,
1892,
1893,
1905,
1906,
1964,
1965,
2035,
2036,
2051,
2052,
2104,
2105,
2190,
2191,
2232,
2233,
2244,
2245,
2288,
2289,
2331,
2332,
2343,
2344,
2352,
2353
],
"line_end_idx": [
9,
41,
42,
59,
80,
81,
94,
113,
114,
119,
120,
171,
172,
181,
182,
188,
189,
197,
198,
215,
216,
278,
279,
373,
374,
658,
659,
713,
714,
920,
921,
935,
936,
1006,
1007,
1115,
1116,
1205,
1206,
1221,
1222,
1311,
1312,
1431,
1432,
1474,
1475,
1491,
1492,
1550,
1551,
1614,
1615,
1627,
1628,
1687,
1688,
1746,
1747,
1760,
1761,
1820,
1821,
1892,
1893,
1905,
1906,
1964,
1965,
2035,
2036,
2051,
2052,
2104,
2105,
2190,
2191,
2232,
2233,
2244,
2245,
2288,
2289,
2331,
2332,
2343,
2344,
2352,
2353,
2374
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2374,
"ccnet_original_nlines": 89,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23140496015548706,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04958678036928177,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31198346614837646,
"rps_doc_frac_unique_words": 0.4455445408821106,
"rps_doc_mean_word_length": 5.891088962554932,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.427318572998047,
"rps_doc_word_count": 303,
"rps_doc_frac_chars_dupe_10grams": 0.06498599052429199,
"rps_doc_frac_chars_dupe_5grams": 0.2907562851905823,
"rps_doc_frac_chars_dupe_6grams": 0.21232493221759796,
"rps_doc_frac_chars_dupe_7grams": 0.17815126478672028,
"rps_doc_frac_chars_dupe_8grams": 0.14677870273590088,
"rps_doc_frac_chars_dupe_9grams": 0.10868346691131592,
"rps_doc_frac_chars_top_2gram": 0.03921569138765335,
"rps_doc_frac_chars_top_3gram": 0.036974791437387466,
"rps_doc_frac_chars_top_4gram": 0.04257702827453613,
"rps_doc_books_importance": -210.6602783203125,
"rps_doc_books_importance_length_correction": -210.6602783203125,
"rps_doc_openwebtext_importance": -106.78971862792969,
"rps_doc_openwebtext_importance_length_correction": -106.78971862792969,
"rps_doc_wikipedia_importance": -86.25662231445312,
"rps_doc_wikipedia_importance_length_correction": -86.25662231445312
},
"fasttext": {
"dclm": 0.12025421857833862,
"english": 0.8021017909049988,
"fineweb_edu_approx": 1.8742619752883911,
"eai_general_math": 0.45318472385406494,
"eai_open_web_math": 0.05619304999709129,
"eai_web_code": 0.6777000427246094
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "781.5",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": "Music theory"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,041,535,576,331,895,000 | Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free.
I have the following Model.
public class Person
{
public Guid ID { get; set; }
[Required]
[DataType(DataType.Text)]
[Display(Name = "Prénom")]
public string FirstName { get; set; }
[Required]
[DataType(DataType.Text)]
[Display(Name = "Nom")]
public string LastName { get; set; }
[Required]
[DataType("Users")]
[Display(Name = "Adresse")]
public Address Address { get; set; }
As you can see, it contains a public Field of Address Type:
public class Address
{
public Guid ID { get; set; }
[Required]
[DataType(DataType.Text)]
[Display(Name = "Rue")]
public string Street { get; set; }
[Required]
[DataType(DataType.Text)]
[Display(Name = "Ville")]
public string City { get; set; }
[Required]
[DataType(DataType.Text)]
[Display(Name = "Province")]
public string Province { get; set; }
I have no problem creating a new instance. Both the person and the address are posted into the database
[HttpPost]
public ActionResult Create(Person model)
{
if (ModelState.IsValid)
{
db.Persons.Add(model);
db.SaveChanges();
I would like to understand why when I retrieve the Person from the db using the following commands, the Address is always NULL.
return db.Persons.FirstOrDefault();
Thanks
share|improve this question
1 Answer 1
You need to eager load the address property.
return db.Persons.Include("Address").FirstOrDefault();
If you need lazy loading behavior you need to mark Address property as virtual
[Required]
[DataType("Users")]
[Display(Name = "Adresse")]
public virtual Address Address { get; set; }
share|improve this answer
Thanks a lot Eranga, I will try this out today. – Baral Jan 30 '12 at 13:00
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "http://stackoverflow.com/questions/9059051/mvc3-editing-model?answertab=oldest",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "72290",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WHL5NLFN2LWIJFLHFOZ7Q536SQBPIXJ7",
"WARC-Concurrent-To": "<urn:uuid:1dff1ded-ae77-435d-b0c1-12cd541aff79>",
"WARC-Date": "2015-09-04T17:26:26Z",
"WARC-IP-Address": "104.16.102.85",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HLEG23K4CIEVOA6JNBTFQZLO3SKXCKH6",
"WARC-Record-ID": "<urn:uuid:79dcb05f-19d6-401d-a3bb-2a65f64481b9>",
"WARC-Target-URI": "http://stackoverflow.com/questions/9059051/mvc3-editing-model?answertab=oldest",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:78a5ce70-7733-43db-a29b-d6c695accf8a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-96-226.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
25,
131,
132,
160,
161,
182,
184,
217,
218,
233,
263,
294,
336,
337,
352,
382,
410,
451,
452,
467,
491,
523,
564,
565,
625,
626,
651,
653,
686,
687,
702,
732,
760,
799,
800,
815,
845,
875,
912,
913,
928,
958,
991,
1032,
1033,
1137,
1138,
1150,
1195,
1201,
1233,
1243,
1278,
1308,
1309,
1437,
1438,
1475,
1476,
1483,
1484,
1512,
1513,
1524,
1525,
1570,
1571,
1626,
1627,
1706,
1707,
1718,
1738,
1766,
1811,
1837,
1842,
1919,
1920,
1932,
1933,
1935,
1943,
1944,
2022,
2023
],
"line_end_idx": [
25,
131,
132,
160,
161,
182,
184,
217,
218,
233,
263,
294,
336,
337,
352,
382,
410,
451,
452,
467,
491,
523,
564,
565,
625,
626,
651,
653,
686,
687,
702,
732,
760,
799,
800,
815,
845,
875,
912,
913,
928,
958,
991,
1032,
1033,
1137,
1138,
1150,
1195,
1201,
1233,
1243,
1278,
1308,
1309,
1437,
1438,
1475,
1476,
1483,
1484,
1512,
1513,
1524,
1525,
1570,
1571,
1626,
1627,
1706,
1707,
1718,
1738,
1766,
1811,
1837,
1842,
1919,
1920,
1932,
1933,
1935,
1943,
1944,
2022,
2023,
2113
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2113,
"ccnet_original_nlines": 86,
"rps_doc_curly_bracket": 0.010411740280687809,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18666666746139526,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017777780070900917,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3755555748939514,
"rps_doc_frac_unique_words": 0.5275590419769287,
"rps_doc_mean_word_length": 5.69291353225708,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.526461124420166,
"rps_doc_word_count": 254,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.23443983495235443,
"rps_doc_frac_chars_dupe_6grams": 0.07883816957473755,
"rps_doc_frac_chars_dupe_7grams": 0.07883816957473755,
"rps_doc_frac_chars_dupe_8grams": 0.07883816957473755,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.037344399839639664,
"rps_doc_frac_chars_top_3gram": 0.058091290295124054,
"rps_doc_frac_chars_top_4gram": 0.11756569892168045,
"rps_doc_books_importance": -221.96644592285156,
"rps_doc_books_importance_length_correction": -221.96644592285156,
"rps_doc_openwebtext_importance": -136.97427368164062,
"rps_doc_openwebtext_importance_length_correction": -136.97427368164062,
"rps_doc_wikipedia_importance": -111.12823486328125,
"rps_doc_wikipedia_importance_length_correction": -111.12823486328125
},
"fasttext": {
"dclm": 0.9528467655181885,
"english": 0.7483876347541809,
"fineweb_edu_approx": 2.340754508972168,
"eai_general_math": 0.0000036999999792897142,
"eai_open_web_math": 0.04411125183105469,
"eai_web_code": 0.00003396999818505719
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
991,402,496,133,928,800 | LAPACK 3.10.1
LAPACK: Linear Algebra PACKage
ztrtrs.f
Go to the documentation of this file.
1 *> \brief \b ZTRTRS
2 *
3 * =========== DOCUMENTATION ===========
4 *
5 * Online html documentation available at
6 * http://www.netlib.org/lapack/explore-html/
7 *
8 *> \htmlonly
9 *> Download ZTRTRS + dependencies
10 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/ztrtrs.f">
11 *> [TGZ]</a>
12 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/ztrtrs.f">
13 *> [ZIP]</a>
14 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/ztrtrs.f">
15 *> [TXT]</a>
16 *> \endhtmlonly
17 *
18 * Definition:
19 * ===========
20 *
21 * SUBROUTINE ZTRTRS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB,
22 * INFO )
23 *
24 * .. Scalar Arguments ..
25 * CHARACTER DIAG, TRANS, UPLO
26 * INTEGER INFO, LDA, LDB, N, NRHS
27 * ..
28 * .. Array Arguments ..
29 * COMPLEX*16 A( LDA, * ), B( LDB, * )
30 * ..
31 *
32 *
33 *> \par Purpose:
34 * =============
35 *>
36 *> \verbatim
37 *>
38 *> ZTRTRS solves a triangular system of the form
39 *>
40 *> A * X = B, A**T * X = B, or A**H * X = B,
41 *>
42 *> where A is a triangular matrix of order N, and B is an N-by-NRHS
43 *> matrix. A check is made to verify that A is nonsingular.
44 *> \endverbatim
45 *
46 * Arguments:
47 * ==========
48 *
49 *> \param[in] UPLO
50 *> \verbatim
51 *> UPLO is CHARACTER*1
52 *> = 'U': A is upper triangular;
53 *> = 'L': A is lower triangular.
54 *> \endverbatim
55 *>
56 *> \param[in] TRANS
57 *> \verbatim
58 *> TRANS is CHARACTER*1
59 *> Specifies the form of the system of equations:
60 *> = 'N': A * X = B (No transpose)
61 *> = 'T': A**T * X = B (Transpose)
62 *> = 'C': A**H * X = B (Conjugate transpose)
63 *> \endverbatim
64 *>
65 *> \param[in] DIAG
66 *> \verbatim
67 *> DIAG is CHARACTER*1
68 *> = 'N': A is non-unit triangular;
69 *> = 'U': A is unit triangular.
70 *> \endverbatim
71 *>
72 *> \param[in] N
73 *> \verbatim
74 *> N is INTEGER
75 *> The order of the matrix A. N >= 0.
76 *> \endverbatim
77 *>
78 *> \param[in] NRHS
79 *> \verbatim
80 *> NRHS is INTEGER
81 *> The number of right hand sides, i.e., the number of columns
82 *> of the matrix B. NRHS >= 0.
83 *> \endverbatim
84 *>
85 *> \param[in] A
86 *> \verbatim
87 *> A is COMPLEX*16 array, dimension (LDA,N)
88 *> The triangular matrix A. If UPLO = 'U', the leading N-by-N
89 *> upper triangular part of the array A contains the upper
90 *> triangular matrix, and the strictly lower triangular part of
91 *> A is not referenced. If UPLO = 'L', the leading N-by-N lower
92 *> triangular part of the array A contains the lower triangular
93 *> matrix, and the strictly upper triangular part of A is not
94 *> referenced. If DIAG = 'U', the diagonal elements of A are
95 *> also not referenced and are assumed to be 1.
96 *> \endverbatim
97 *>
98 *> \param[in] LDA
99 *> \verbatim
100 *> LDA is INTEGER
101 *> The leading dimension of the array A. LDA >= max(1,N).
102 *> \endverbatim
103 *>
104 *> \param[in,out] B
105 *> \verbatim
106 *> B is COMPLEX*16 array, dimension (LDB,NRHS)
107 *> On entry, the right hand side matrix B.
108 *> On exit, if INFO = 0, the solution matrix X.
109 *> \endverbatim
110 *>
111 *> \param[in] LDB
112 *> \verbatim
113 *> LDB is INTEGER
114 *> The leading dimension of the array B. LDB >= max(1,N).
115 *> \endverbatim
116 *>
117 *> \param[out] INFO
118 *> \verbatim
119 *> INFO is INTEGER
120 *> = 0: successful exit
121 *> < 0: if INFO = -i, the i-th argument had an illegal value
122 *> > 0: if INFO = i, the i-th diagonal element of A is zero,
123 *> indicating that the matrix is singular and the solutions
124 *> X have not been computed.
125 *> \endverbatim
126 *
127 * Authors:
128 * ========
129 *
130 *> \author Univ. of Tennessee
131 *> \author Univ. of California Berkeley
132 *> \author Univ. of Colorado Denver
133 *> \author NAG Ltd.
134 *
135 *> \ingroup complex16OTHERcomputational
136 *
137 * =====================================================================
138 SUBROUTINE ztrtrs( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB,
139 $ INFO )
140 *
141 * -- LAPACK computational routine --
142 * -- LAPACK is a software package provided by Univ. of Tennessee, --
143 * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
144 *
145 * .. Scalar Arguments ..
146 CHARACTER DIAG, TRANS, UPLO
147 INTEGER INFO, LDA, LDB, N, NRHS
148 * ..
149 * .. Array Arguments ..
150 COMPLEX*16 A( LDA, * ), B( LDB, * )
151 * ..
152 *
153 * =====================================================================
154 *
155 * .. Parameters ..
156 COMPLEX*16 ZERO, ONE
157 parameter( zero = ( 0.0d+0, 0.0d+0 ),
158 $ one = ( 1.0d+0, 0.0d+0 ) )
159 * ..
160 * .. Local Scalars ..
161 LOGICAL NOUNIT
162 * ..
163 * .. External Functions ..
164 LOGICAL LSAME
165 EXTERNAL lsame
166 * ..
167 * .. External Subroutines ..
168 EXTERNAL xerbla, ztrsm
169 * ..
170 * .. Intrinsic Functions ..
171 INTRINSIC max
172 * ..
173 * .. Executable Statements ..
174 *
175 * Test the input parameters.
176 *
177 info = 0
178 nounit = lsame( diag, 'N' )
179 IF( .NOT.lsame( uplo, 'U' ) .AND. .NOT.lsame( uplo, 'L' ) ) THEN
180 info = -1
181 ELSE IF( .NOT.lsame( trans, 'N' ) .AND. .NOT.
182 $ lsame( trans, 'T' ) .AND. .NOT.lsame( trans, 'C' ) ) THEN
183 info = -2
184 ELSE IF( .NOT.nounit .AND. .NOT.lsame( diag, 'U' ) ) THEN
185 info = -3
186 ELSE IF( n.LT.0 ) THEN
187 info = -4
188 ELSE IF( nrhs.LT.0 ) THEN
189 info = -5
190 ELSE IF( lda.LT.max( 1, n ) ) THEN
191 info = -7
192 ELSE IF( ldb.LT.max( 1, n ) ) THEN
193 info = -9
194 END IF
195 IF( info.NE.0 ) THEN
196 CALL xerbla( 'ZTRTRS', -info )
197 RETURN
198 END IF
199 *
200 * Quick return if possible
201 *
202 IF( n.EQ.0 )
203 $ RETURN
204 *
205 * Check for singularity.
206 *
207 IF( nounit ) THEN
208 DO 10 info = 1, n
209 IF( a( info, info ).EQ.zero )
210 $ RETURN
211 10 CONTINUE
212 END IF
213 info = 0
214 *
215 * Solve A * x = b, A**T * x = b, or A**H * x = b.
216 *
217 CALL ztrsm( 'Left', uplo, trans, diag, n, nrhs, one, a, lda, b,
218 $ ldb )
219 *
220 RETURN
221 *
222 * End of ZTRTRS
223 *
224 END
subroutine xerbla(SRNAME, INFO)
XERBLA
Definition: xerbla.f:60
subroutine ztrsm(SIDE, UPLO, TRANSA, DIAG, M, N, ALPHA, A, LDA, B, LDB)
ZTRSM
Definition: ztrsm.f:180
subroutine ztrtrs(UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, INFO)
ZTRTRS
Definition: ztrtrs.f:140 | {
"url": "https://netlib.org/lapack/explore-html/d6/dd3/ztrtrs_8f_source.html",
"source_domain": "netlib.org",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "39836",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TVLSFBTCBY5V5XF5QY7DQ7MNLVZO7O3I",
"WARC-Concurrent-To": "<urn:uuid:e5cb5b86-ab1c-4128-b917-29460e12c617>",
"WARC-Date": "2022-10-06T03:51:54Z",
"WARC-IP-Address": "160.36.131.221",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:4Y5HZ7JX465H65XKWFLAZB5NOFG6LABH",
"WARC-Record-ID": "<urn:uuid:20b55870-ce99-4ec2-82c5-2dee82b5a7da>",
"WARC-Target-URI": "https://netlib.org/lapack/explore-html/d6/dd3/ztrtrs_8f_source.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6e08317f-b5bd-4020-930e-a8de14ba4256>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-74\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
15,
46,
55,
93,
115,
119,
161,
165,
208,
255,
259,
274,
310,
425,
441,
556,
572,
687,
703,
722,
727,
744,
761,
766,
834,
846,
851,
879,
912,
949,
957,
984,
1025,
1033,
1038,
1043,
1063,
1082,
1088,
1104,
1110,
1162,
1168,
1216,
1222,
1293,
1356,
1375,
1380,
1396,
1412,
1417,
1439,
1455,
1481,
1517,
1553,
1572,
1578,
1601,
1617,
1644,
1697,
1735,
1773,
1821,
1840,
1846,
1868,
1884,
1910,
1949,
1984,
2003,
2009,
2028,
2044,
2063,
2104,
2123,
2129,
2151,
2167,
2189,
2255,
2289,
2308,
2314,
2333,
2349,
2396,
2461,
2523,
2590,
2657,
2724,
2789,
2853,
2904,
2923,
2929,
2950,
2966,
2988,
3050,
3070,
3077,
3101,
3118,
3169,
3216,
3268,
3288,
3295,
3317,
3334,
3356,
3418,
3438,
3445,
3469,
3486,
3509,
3537,
3602,
3667,
3731,
3764,
3784,
3790,
3805,
3820,
3826,
3860,
3904,
3944,
3968,
3974,
4018,
4024,
4100,
4168,
4182,
4188,
4229,
4302,
4382,
4388,
4417,
4450,
4487,
4496,
4524,
4565,
4574,
4580,
4656,
4662,
4685,
4711,
4754,
4788,
4797,
4823,
4843,
4852,
4883,
4902,
4922,
4931,
4964,
4992,
5001,
5033,
5052,
5061,
5095,
5101,
5134,
5140,
5154,
5187,
5257,
5272,
5323,
5388,
5403,
5466,
5481,
5509,
5524,
5555,
5570,
5610,
5625,
5665,
5680,
5692,
5718,
5754,
5766,
5778,
5784,
5815,
5821,
5839,
5853,
5859,
5888,
5894,
5917,
5940,
5975,
5989,
6006,
6018,
6032,
6038,
6092,
6098,
6167,
6180,
6186,
6198,
6204,
6224,
6230,
6239,
6271,
6278,
6302,
6374,
6380,
6404,
6472,
6479
],
"line_end_idx": [
15,
46,
55,
93,
115,
119,
161,
165,
208,
255,
259,
274,
310,
425,
441,
556,
572,
687,
703,
722,
727,
744,
761,
766,
834,
846,
851,
879,
912,
949,
957,
984,
1025,
1033,
1038,
1043,
1063,
1082,
1088,
1104,
1110,
1162,
1168,
1216,
1222,
1293,
1356,
1375,
1380,
1396,
1412,
1417,
1439,
1455,
1481,
1517,
1553,
1572,
1578,
1601,
1617,
1644,
1697,
1735,
1773,
1821,
1840,
1846,
1868,
1884,
1910,
1949,
1984,
2003,
2009,
2028,
2044,
2063,
2104,
2123,
2129,
2151,
2167,
2189,
2255,
2289,
2308,
2314,
2333,
2349,
2396,
2461,
2523,
2590,
2657,
2724,
2789,
2853,
2904,
2923,
2929,
2950,
2966,
2988,
3050,
3070,
3077,
3101,
3118,
3169,
3216,
3268,
3288,
3295,
3317,
3334,
3356,
3418,
3438,
3445,
3469,
3486,
3509,
3537,
3602,
3667,
3731,
3764,
3784,
3790,
3805,
3820,
3826,
3860,
3904,
3944,
3968,
3974,
4018,
4024,
4100,
4168,
4182,
4188,
4229,
4302,
4382,
4388,
4417,
4450,
4487,
4496,
4524,
4565,
4574,
4580,
4656,
4662,
4685,
4711,
4754,
4788,
4797,
4823,
4843,
4852,
4883,
4902,
4922,
4931,
4964,
4992,
5001,
5033,
5052,
5061,
5095,
5101,
5134,
5140,
5154,
5187,
5257,
5272,
5323,
5388,
5403,
5466,
5481,
5509,
5524,
5555,
5570,
5610,
5625,
5665,
5680,
5692,
5718,
5754,
5766,
5778,
5784,
5815,
5821,
5839,
5853,
5859,
5888,
5894,
5917,
5940,
5975,
5989,
6006,
6018,
6032,
6038,
6092,
6098,
6167,
6180,
6186,
6198,
6204,
6224,
6230,
6239,
6271,
6278,
6302,
6374,
6380,
6404,
6472,
6479,
6503
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6503,
"ccnet_original_nlines": 236,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09573303908109665,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.15426695346832275,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5661925673484802,
"rps_doc_frac_unique_words": 0.45708155632019043,
"rps_doc_mean_word_length": 4.35515022277832,
"rps_doc_num_sentences": 122,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.4111647605896,
"rps_doc_word_count": 932,
"rps_doc_frac_chars_dupe_10grams": 0.027100270614027977,
"rps_doc_frac_chars_dupe_5grams": 0.09509731084108353,
"rps_doc_frac_chars_dupe_6grams": 0.0822862833738327,
"rps_doc_frac_chars_dupe_7grams": 0.05025868117809296,
"rps_doc_frac_chars_dupe_8grams": 0.05025868117809296,
"rps_doc_frac_chars_dupe_9grams": 0.027100270614027977,
"rps_doc_frac_chars_top_2gram": 0.007390980143100023,
"rps_doc_frac_chars_top_3gram": 0.008622810244560242,
"rps_doc_frac_chars_top_4gram": 0.011825569905340672,
"rps_doc_books_importance": -637.12548828125,
"rps_doc_books_importance_length_correction": -637.12548828125,
"rps_doc_openwebtext_importance": -417.4232177734375,
"rps_doc_openwebtext_importance_length_correction": -417.4232177734375,
"rps_doc_wikipedia_importance": -309.883544921875,
"rps_doc_wikipedia_importance_length_correction": -309.883544921875
},
"fasttext": {
"dclm": 0.47112929821014404,
"english": 0.3076554238796234,
"fineweb_edu_approx": 2.8013689517974854,
"eai_general_math": 0.9591922760009766,
"eai_open_web_math": 0.8391439318656921,
"eai_web_code": 0.8656823039054871
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "512.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
6,593,671,596,986,789,000 | Monday, July 10, 2017
PowerCLI script to create multiple PortGroups on a newly added VMhost
This script is useful when you are introducing a a new host to your environment and need to create multiple VLANs on this host.
Both of these script would do the same thing but the only difference is, to make use of first script you first need to create a csv file having VirtualSwitchName, VLANname, VLANid details on the other hand second script would take one host of your choice as reference and would create the same VLANs on target host.
Script 1: -
<# ==================================================================
Title: create_multiple_vlan-2.ps1
Description:this script can be used to create VLANs on a newly added VMhost, it will read VLAN-detail.csv and create VM port groups
Requirements: Windows Powershell with PowerCLI installed
Pre-req: You need to create a vlan-detail.csv with required VirtualSwitchName, VLANname, VLANid, and the the vSwitch should be present on target host
Usage: .\create_multiple_vlan.ps1
==================================================================== #>
Add-PSSnapin VMware.VimAutomation.Core
$myvc = read-host -Prompt "Enter your vCenter server Name or IP name"
Connect-VIServer $myvc
$targetVMhost = read-host -Prompt "Enter your target host name"
$InputFile = “c:\vlan-detail.csv”
$MyVLANFile = Import-CSV $InputFile
ForEach ($VLAN in $MyVLANFile) {
$MyvSwitch = $VLAN.VirtualSwitchName
$MyVLANname = $VLAN.VLANname
$MyVLANid = $VLAN.VLANid
get-vmhost $targetVMhost | Get-VirtualSwitch -Name $MyvSwitch | New-VirtualPortGroup -Name $MyVLANname -VLanId $MyVLANid
}
disconnect-VIServer $myvc -Confirm:$false
Script 2 :-
<# ==================================================================
Title: create_multiple_vlan.ps1
Description:this script can be used to create VLANs on a newly added VMhost by taking referance of any existing host
Requirements: Windows Powershell with PowerCLI installed
pre-req: vSwitch should be present on target gost
Usage: .\create_multiple_vlan.ps1
==================================================================== #>
Add-PSSnapin VMware.VimAutomation.Core
$myvc = read-host -Prompt "Enter your vCenter server Name or IP name"
Connect-VIServer $myvc
$sourceVMhost = read-host -Prompt "Enter your source host name"
$targetVMhost = read-host -Prompt "Enter your target host name"
get-vmhost $sourceVMhost | Get-VirtualSwitch | Get-VirtualPortGroup | select VirtualSwitchName, Name, vlanID | export-csv "c:\vlan-detail.csv" -NoTypeInformation
$InputFile = “c:\vlan-detail.csv”
$MyVLANFile = Import-CSV $InputFile
ForEach ($VLAN in $MyVLANFile) {
$MyvSwitch = $VLAN.VirtualSwitchName
$MyVLANname = $VLAN.name
$MyVLANid = $VLAN.VLANid
get-vmhost $targetVMhost | Get-VirtualSwitch -Name $MyvSwitch | New-VirtualPortGroup -Name $MyVLANname -VLanId $MyVLANid
}
Remove-Item $InputFile
disconnect-VIServer $myvc -Confirm:$false
Hope these scripts would be useful.
That's it... :)
1 comment:
1. Hi, can you show an example how the content in CSV has to look?
ReplyDelete | {
"url": "https://www.vcloudnotes.com/2017/07/powercli-script-to-create-multiple.html",
"source_domain": "www.vcloudnotes.com",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "101619",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RE3J6THNVCC3TZRXJLOL5WHVYZAMHQV5",
"WARC-Concurrent-To": "<urn:uuid:8c50921b-1b15-48cc-80de-8474fba2c097>",
"WARC-Date": "2024-09-20T11:18:34Z",
"WARC-IP-Address": "172.253.122.121",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:X7YV5EFT3CSNMU7BVBF3N3RJZTWV5X4E",
"WARC-Record-ID": "<urn:uuid:20935635-3a90-4ff8-bc6c-e889e21cd024>",
"WARC-Target-URI": "https://www.vcloudnotes.com/2017/07/powercli-script-to-create-multiple.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:94184057-858f-42d5-ac0f-1866d1e44023>"
},
"warc_info": "isPartOf: CC-MAIN-2024-38\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-94\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
22,
23,
93,
94,
222,
538,
550,
551,
621,
622,
656,
657,
789,
790,
847,
848,
998,
999,
1033,
1034,
1106,
1107,
1146,
1147,
1217,
1218,
1241,
1242,
1306,
1307,
1341,
1342,
1378,
1379,
1412,
1413,
1450,
1451,
1480,
1481,
1506,
1507,
1628,
1629,
1631,
1632,
1674,
1675,
1687,
1757,
1758,
1790,
1791,
1908,
1909,
1966,
1967,
2017,
2018,
2052,
2053,
2125,
2126,
2165,
2166,
2236,
2237,
2260,
2261,
2325,
2326,
2390,
2391,
2553,
2554,
2588,
2589,
2625,
2626,
2659,
2660,
2697,
2698,
2723,
2724,
2749,
2750,
2871,
2872,
2874,
2875,
2898,
2899,
2941,
2942,
2978,
2979,
2995,
2996,
2997,
3008,
3009,
3078,
3079
],
"line_end_idx": [
22,
23,
93,
94,
222,
538,
550,
551,
621,
622,
656,
657,
789,
790,
847,
848,
998,
999,
1033,
1034,
1106,
1107,
1146,
1147,
1217,
1218,
1241,
1242,
1306,
1307,
1341,
1342,
1378,
1379,
1412,
1413,
1450,
1451,
1480,
1481,
1506,
1507,
1628,
1629,
1631,
1632,
1674,
1675,
1687,
1757,
1758,
1790,
1791,
1908,
1909,
1966,
1967,
2017,
2018,
2052,
2053,
2125,
2126,
2165,
2166,
2236,
2237,
2260,
2261,
2325,
2326,
2390,
2391,
2553,
2554,
2588,
2589,
2625,
2626,
2659,
2660,
2697,
2698,
2723,
2724,
2749,
2750,
2871,
2872,
2874,
2875,
2898,
2899,
2941,
2942,
2978,
2979,
2995,
2996,
2997,
3008,
3009,
3078,
3079,
3094
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3094,
"ccnet_original_nlines": 104,
"rps_doc_curly_bracket": 0.0012928199721500278,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2083333283662796,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02500000037252903,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3449999988079071,
"rps_doc_frac_unique_words": 0.4222874045372009,
"rps_doc_mean_word_length": 6.375366687774658,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0.008333330042660236,
"rps_doc_unigram_entropy": 4.699862003326416,
"rps_doc_word_count": 341,
"rps_doc_frac_chars_dupe_10grams": 0.39006438851356506,
"rps_doc_frac_chars_dupe_5grams": 0.522999107837677,
"rps_doc_frac_chars_dupe_6grams": 0.5142594575881958,
"rps_doc_frac_chars_dupe_7grams": 0.48666054010391235,
"rps_doc_frac_chars_dupe_8grams": 0.4351425766944885,
"rps_doc_frac_chars_dupe_9grams": 0.39006438851356506,
"rps_doc_frac_chars_top_2gram": 0.022079119458794594,
"rps_doc_frac_chars_top_3gram": 0.043698251247406006,
"rps_doc_frac_chars_top_4gram": 0.05289788171648979,
"rps_doc_books_importance": -253.8363800048828,
"rps_doc_books_importance_length_correction": -253.8363800048828,
"rps_doc_openwebtext_importance": -161.27378845214844,
"rps_doc_openwebtext_importance_length_correction": -161.27378845214844,
"rps_doc_wikipedia_importance": -138.005126953125,
"rps_doc_wikipedia_importance_length_correction": -138.005126953125
},
"fasttext": {
"dclm": 0.8840535879135132,
"english": 0.6430596113204956,
"fineweb_edu_approx": 2.8182194232940674,
"eai_general_math": 0.36098015308380127,
"eai_open_web_math": 0.06842566281557083,
"eai_web_code": 0.30455923080444336
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
7,295,373,699,998,813,000 | Beefy Boxes and Bandwidth Generously Provided by pair Networks Bob
Just another Perl shrine
PerlMonks
Check boxes
by himik (Acolyte)
on May 28, 2012 at 16:21 UTC ( #972839=perlquestion: print w/ replies, xml ) Need Help??
himik has asked for the wisdom of the Perl Monks concerning the following question:
Hello monks. I have some difficulties so i call on you.
So i have at about 100 checkboxes. And every one is different extra for a car ( ABS,ASR,ESP and the list goes on .... until 64 for now, but it will be bigger then 100 ).
So what have i done for now. Every extra abs has decimal number like abs is 1, ASR is 2, ESP is 3 .... This numbers represent the n-th bit of the number of all extras.
explanation if ABS is checked i put 1 only in the field extri on the data base if ABS, ASP are checked i put 3 on my data base. if ABS, ASP, ESP are checked i put 7 on my data base.
so 7 is 0b111? right? And this is my flags for all the extras.
if i have 3 on my field extri then i know (0b11) the first bit and the second one is up then i know that this extras are ABS ASP
Here is the problem
My field extras is big int and it is 64 bits long .... that means i have only 64 extras. so i start to look for solution and i'm thinking for bit var.
but ..... is this the best way to make that?
could you tell me some other solution that is better for the DB, because with this way my searching is so easy just put where clause with
select * from table where (table.extri & b'$extribin_perl')=b'$extribiin_perl'
i do not use any joins
Thank you
Comment on Check boxes
Download Code
Re: Check boxes
by mbethke (Hermit) on May 28, 2012 at 17:18 UTC
The easiest way in terms of SQL would be to have an extra boolean column for each feature. The way you're doing it is certainly the most compact but depending on how many rows you have it can get very slow because the DB has to do a full table scan for each query. And then as you have noticed you run into problems when you need more bits than the largest integer type has. As far as I know there's no nice workaround for >64 features, only ugly ones like splitting them up in "extri" and "extri2" or something. Of course BLOBs could be as big as you like but the boolean operators don't work on them.
If your database server is on the same machine as the application, you could just select everything and do the filtering in Perl, I don't think it would be much slower than doing the same in SQL. Though that goes against pretty much the entire idea of a relational database ...
In the end I'd say you'd be best off to use individual columns. With TINYINTs that would be some 100 bytes per row on MySQL and probably less on Postgres, not that much for all the advantages it brings.
Another option would be to add two new tables and go ahead and do a lookup with a join:
• One table that lists all the options and assigns a key to each one
• A second table that has two columns-- one is just Car_ID and the other is feature_ID. This is the join table.
• If car#23 has features #76, 53, and 99 then it would get three rows in the join table, each of which would be the car ID and one of the numbers.
For the OP this might be overkill, since there aren't likely so many cars that the table will get big, even if it has a lot of columns. It might be slightly slower on the db side, because you have to do a join, but it's probably not significant, again because the tables are probably small. Just another way to do it.
The SQL to ask for several features ("which car has ABS and ESR and teledildonics") would get pretty horrible though as you'd have to join in the features table once for each feature. Possible but very very slow and only halfway readable with DBIx::Class and chained ResultSets.
Re: <strike>Check boxes</strike> SQL Boolean arrays
by NetWallah (Monsignor) on May 28, 2012 at 17:27 UTC
Depending on what SQL you are using, you may be able to define an array of SQL booleans, avoiding lentgh limitations.
<binary string type> ::= BINARY [ <left paren> <length> <right paren> +] | { BINARY VARYING | VARBINARY } <left paren> <length> <right paren +> | LONGVARBINARY [ <left paren> <length> <right paren> ] | <binary l +arge object string type>
If BINARY is used without specifying the length, the length defaults to 1.
I hope life isn't a big joke, because I don't get it.
-SNL
Re: Check boxes
by BrowserUk (Pope) on May 28, 2012 at 17:35 UTC
If you use PostGreSQL, it has bit string types which can be any number of bits and support direct boolean manipulations.
They are directly analogous to Perl's bitstrings which is very useful.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.
The start of some sanity?
Re: Check boxes
by flexvault (Vicar) on May 28, 2012 at 17:53 UTC
himik,
Disclaimer: Have used SQL, but not in a long time. So I'm more interested in the Perl benefits to the solution.
Why not define a string field of 16 characters(128 bits) or whatever and use Perl to encode/decode the 'checkbox' string. if "\0" cannot be supported by you database then this wouldn't work. You can test this by sending a string of '0..255' to the data base and then see if it returns all characters exactly. (Untested).
my $str = ""; for ( 0..255 ) { $str .= chr($_); }
Perl's pack/unpack may be very valuable for this.
Have you ruled out a 128 character string with "Y" or "N" as a possibility? Disk space is pretty cheap today!
Good Luck!
"Well done is better than well said." - Benjamin Franklin
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: perlquestion [id://972839]
Approved by sauoq
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (16)
As of 2013-05-22 09:20 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
The best material for plates (tableware) is:
Results (456 votes), past polls | {
"url": "http://www.perlmonks.org/?node_id=972839",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "29803",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AMZSLT75N5UN55ZHNMLMDTFMUL4ID6GZ",
"WARC-Concurrent-To": "<urn:uuid:938e54ce-6b3d-4a0d-9d95-6a5916318762>",
"WARC-Date": "2013-05-22T09:22:14Z",
"WARC-IP-Address": "66.39.54.27",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:CZQIWHBTIXEBMFFUIMLKT3XHS5QMQBMY",
"WARC-Record-ID": "<urn:uuid:d3e6c364-52e7-4b9d-a32d-52f61c5cbfff>",
"WARC-Target-URI": "http://www.perlmonks.org/?node_id=972839",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2e658f87-8ff0-442e-a010-ae32a39bf280>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-60-113-184.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-20\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Spring 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
67,
92,
94,
106,
107,
119,
120,
139,
228,
312,
313,
369,
370,
540,
541,
709,
710,
892,
893,
956,
957,
1086,
1087,
1107,
1108,
1259,
1260,
1305,
1306,
1444,
1445,
1524,
1525,
1548,
1549,
1559,
1560,
1583,
1597,
1613,
1662,
1663,
2270,
2271,
2553,
2554,
2761,
2762,
2856,
2857,
2930,
3046,
3197,
3198,
3522,
3523,
3810,
3862,
3916,
4038,
4280,
4359,
4360,
4431,
4459,
4460,
4476,
4525,
4526,
4651,
4652,
4727,
4728,
4729,
4836,
4941,
5015,
5092,
5093,
5123,
5124,
5140,
5190,
5191,
5202,
5203,
5319,
5320,
5645,
5646,
5700,
5701,
5755,
5756,
5870,
5871,
5886,
5887,
5949,
5950,
5958,
5968,
5978,
5979,
5999,
6017,
6030,
6043,
6081,
6099,
6104,
6116,
6153,
6154,
6192,
6205,
6238,
6265,
6275,
6288,
6300,
6311,
6329,
6330,
6379,
6380,
6381,
6382,
6383,
6384,
6385,
6386,
6387,
6388
],
"line_end_idx": [
67,
92,
94,
106,
107,
119,
120,
139,
228,
312,
313,
369,
370,
540,
541,
709,
710,
892,
893,
956,
957,
1086,
1087,
1107,
1108,
1259,
1260,
1305,
1306,
1444,
1445,
1524,
1525,
1548,
1549,
1559,
1560,
1583,
1597,
1613,
1662,
1663,
2270,
2271,
2553,
2554,
2761,
2762,
2856,
2857,
2930,
3046,
3197,
3198,
3522,
3523,
3810,
3862,
3916,
4038,
4280,
4359,
4360,
4431,
4459,
4460,
4476,
4525,
4526,
4651,
4652,
4727,
4728,
4729,
4836,
4941,
5015,
5092,
5093,
5123,
5124,
5140,
5190,
5191,
5202,
5203,
5319,
5320,
5645,
5646,
5700,
5701,
5755,
5756,
5870,
5871,
5886,
5887,
5949,
5950,
5958,
5968,
5978,
5979,
5999,
6017,
6030,
6043,
6081,
6099,
6104,
6116,
6153,
6154,
6192,
6205,
6238,
6265,
6275,
6288,
6300,
6311,
6329,
6330,
6379,
6380,
6381,
6382,
6383,
6384,
6385,
6386,
6387,
6388,
6423
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6423,
"ccnet_original_nlines": 134,
"rps_doc_curly_bracket": 0.0006227599806152284,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41283124685287476,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03626219928264618,
"rps_doc_frac_lines_end_with_ellipsis": 0.014814809896051884,
"rps_doc_frac_no_alph_words": 0.22942817211151123,
"rps_doc_frac_unique_words": 0.4117647111415863,
"rps_doc_mean_word_length": 4.209447383880615,
"rps_doc_num_sentences": 74,
"rps_doc_symbol_to_word_ratio": 0.006276149768382311,
"rps_doc_unigram_entropy": 5.55194616317749,
"rps_doc_word_count": 1122,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.038958288729190826,
"rps_doc_frac_chars_dupe_6grams": 0.013127249665558338,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.006351890042424202,
"rps_doc_frac_chars_top_3gram": 0.0074105397798120975,
"rps_doc_frac_chars_top_4gram": 0.011645140126347542,
"rps_doc_books_importance": -541.3565673828125,
"rps_doc_books_importance_length_correction": -541.3565673828125,
"rps_doc_openwebtext_importance": -305.9167785644531,
"rps_doc_openwebtext_importance_length_correction": -305.9167785644531,
"rps_doc_wikipedia_importance": -215.5667724609375,
"rps_doc_wikipedia_importance_length_correction": -215.5667724609375
},
"fasttext": {
"dclm": 0.10420030355453491,
"english": 0.9219509959220886,
"fineweb_edu_approx": 1.4759968519210815,
"eai_general_math": 0.4393575191497803,
"eai_open_web_math": 0.42600423097610474,
"eai_web_code": 0.18871498107910156
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.758",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-4,932,075,429,133,267,000 | Priority ceiling protocol
From Wikipedia, the free encyclopedia
Jump to: navigation, search
In real-time computing, the priority ceiling protocol is a synchronization protocol for shared resources to avoid unbounded priority inversion and mutual deadlock due to wrong nesting of critical sections. In this protocol each resource is assigned a priority ceiling, which is a priority equal to the highest priority of any task which may lock the resource. The protocol works by temporarily raising the priorities of tasks in certain situations, thus it requires a scheduler that supports dynamic priority scheduling. [1]
ICPP versus OCPP[edit]
There are two variants of the protocol: Original Ceiling Priority Protocol (OCPP) and Immediate Ceiling Priority Protocol (ICPP). The worst-case behaviour of the two ceiling schemes is identical from a scheduling view point. Both variants work by temporarily raising the priorities of tasks. [2]
In OCPP, a task X's priority is raised when a higher-priority task Y tries to acquire a resource that X has locked. The task's priority is then raised to the priority ceiling of the resource, ensuring that task X quickly finishes its critical section, unlocking the resource. A task is only allowed to lock a resource if its dynamic priority is higher than the priority ceilings of all resources locked by other tasks. Otherwise the task becomes blocked, waiting for the resource. [2]
In ICPP, a task's priority is immediately raised when it locks a resource. The task's priority is set to the priority ceiling of the resource, thus no task that may lock the resource is able to get scheduled. This ensures the OCPP property that "A task can only lock a resource if its dynamic priority is higher than the priority ceilings of all resources locked by other tasks". [2]
• ICPP is easier to implement than OCPP, as blocking relationships need not be monitored [2]
• ICPP leads to fewer context switches as blocking is prior to first execution[2]
• ICPP requires more priority movements as this happens with all resource usage[2]
• OCPP changes priority only if an actual block has occurred[2]
ICPP is called "Ceiling Locking" in Ada, "Priority Protect Protocol" in POSIX and "Priority Ceiling Emulation" in RTSJ. [3] It is also known as "Highest Locker's Priority Protocol" (HLP). [4]
See also[edit]
References[edit]
1. ^ Renwick, Kyle; Renwick, Bill (May 18, 2004). "How to use priority inheritance". embedded.com. Retrieved November 11, 2014.
2. ^ a b c d e f g http://rtsys.informatik.uni-kiel.de/teaching/ws08-09/v-emb-rt/lectures/lecture13-handout4.pdf
3. ^ Alan Burns; Andy Wellings (March 2001). Real-Time Systems and Programming Languages — Ada 95, Real-Time Java and Real-Time POSIX (3rd ed.). Addison Wesley Longmain. ISBN 0-201-72988-1.
4. ^ http://user.it.uu.se/~yi/courses/rts/dvp-rts-08/notes/synchronization-resource-sharing.pdf | {
"url": "http://en.wikipedia.org/wiki/Priority_ceiling_protocol",
"source_domain": "en.wikipedia.org",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "32996",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LG64DRQQW2A4Y43S37K33R4E4ED4LPNT",
"WARC-Concurrent-To": "<urn:uuid:34923e72-ff85-46d8-8fa3-b3132fed9bff>",
"WARC-Date": "2015-05-23T14:40:36Z",
"WARC-IP-Address": "208.80.154.224",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LFEWRXEM2N42GOOYYT5JF2MJUK3QFV5Y",
"WARC-Record-ID": "<urn:uuid:e83a37c1-ef85-4aa2-aace-a971b08e874c>",
"WARC-Target-URI": "http://en.wikipedia.org/wiki/Priority_ceiling_protocol",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:60f7c623-0c7b-4c3a-9781-34742c33e0f8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-206-219.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
26,
27,
65,
93,
94,
619,
620,
643,
644,
940,
941,
1426,
1427,
1811,
1812,
1907,
1991,
2076,
2142,
2143,
2335,
2336,
2351,
2352,
2369,
2370,
2501,
2616,
2809
],
"line_end_idx": [
26,
27,
65,
93,
94,
619,
620,
643,
644,
940,
941,
1426,
1427,
1811,
1812,
1907,
1991,
2076,
2142,
2143,
2335,
2336,
2351,
2352,
2369,
2370,
2501,
2616,
2809,
2906
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2906,
"ccnet_original_nlines": 29,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26677316427230835,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.038338661193847656,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.274760365486145,
"rps_doc_frac_unique_words": 0.46543779969215393,
"rps_doc_mean_word_length": 5.2672810554504395,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.769280910491943,
"rps_doc_word_count": 434,
"rps_doc_frac_chars_dupe_10grams": 0.08398950099945068,
"rps_doc_frac_chars_dupe_5grams": 0.14785651862621307,
"rps_doc_frac_chars_dupe_6grams": 0.14785651862621307,
"rps_doc_frac_chars_dupe_7grams": 0.14785651862621307,
"rps_doc_frac_chars_dupe_8grams": 0.08398950099945068,
"rps_doc_frac_chars_dupe_9grams": 0.08398950099945068,
"rps_doc_frac_chars_top_2gram": 0.03937007859349251,
"rps_doc_frac_chars_top_3gram": 0.023622050881385803,
"rps_doc_frac_chars_top_4gram": 0.015748029574751854,
"rps_doc_books_importance": -272.0639953613281,
"rps_doc_books_importance_length_correction": -272.0639953613281,
"rps_doc_openwebtext_importance": -122.18873596191406,
"rps_doc_openwebtext_importance_length_correction": -122.18873596191406,
"rps_doc_wikipedia_importance": -90.93318176269531,
"rps_doc_wikipedia_importance_length_correction": -90.93318176269531
},
"fasttext": {
"dclm": 0.21332710981369019,
"english": 0.869361162185669,
"fineweb_edu_approx": 2.709211826324463,
"eai_general_math": 0.4735497832298279,
"eai_open_web_math": 0.32030004262924194,
"eai_web_code": 0.10847800970077515
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.35",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.22",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
7,764,290,059,691,642,000 | cloudnine
By:
cloudnine
Why is console access on Digital Ocean so problematic?
August 21, 2016 779 views
Networking Ubuntu
I have been successfully running a Ubuntu 14.04 production server on D.O for nearly six months now. I couldn't be happier with the level of support received from D.O staff and the excellent tutorials that helped me get going from scratch.
However, I cannot but think that D.O's web based console access is its major problem area. In all these months of trying, I have only been able to get it working once or twice. Having reliable out-of-band access to the server is absolutely essential for an unmanaged service like D.O where the staff can't login to your server when you are locked out of SSH.
Yesterday, I spent several hours trying to get console access to work without success after I was locked out of SSH. D.O Support were courteous and helpful, as always, but they obviously couldn't login to fix the issue. I tried everything - accessing from a desktop, a laptop, a Macbook Pro, trying through Firefox, Safari and Chrome, adding incoming and outgoing rules in the Windows firewall to allow the suggested port range of 6000-7000, restarting my router to get a different dynamic IP for the internet connection to work around my IP being blocked by the server firewall - the works. Nothing helped until I was finally able to connect to SSH after restarting the router for the nth time.
D.O staff suggested that my ISP was blocking those ports, but I doubt it. The irony of the situation is that I am able to launch the web console of Linode (Lish) where I have a couple of servers without any issue at any time on any browser on the same ISP connection. It simply works.
So, my question is, why is D.O's console access so troublesome and error prone when Linode can offer a similar service that works out of the box? And, why has this issue gone unresolved for so long? You only have to do a google search to find dozens of complaints on this issue going back two or three years.
I am not posting this as a rhetorical question but as a genuine concern. Heaven forbid running into a situation where I need out of band access to the production server and the console doesn't work.
Is anyone using any tips or tricks to get console access working reliably?
1 Answer
I personally never had any issues with DO's Console - Ability to copy/paste would be nice though.
Few things I leant overtime about the console is,
1. Some browser extensions can cause problems, such as AdBlock.
2. If the screen is black, you can try clicking on the screen. If that doesn't work you can try typing something. That usually fix the black screen issue for me.
3. Looks like DO Console makes a connection on port 5000, you can try adding this to your firewall. - Not sure why 6000-7000 was suggested, maybe something internal?
4. A reboot of the Droplet can help too if the server is out of sync for some reason.
What exactly happened when you tried to access the console?
• Thanks for your helpful answer.
Unfortunately, I have tried all your suggestions, except a server reboot, which I will try tonight. 6000-7000 was suggested here in several threads, as was 5000. I have tried in Chrome and Firefox on Windows 7 after disabling all the extensions, restarting the browser and logging in and then launching the console. Also tried the same on Safari on Macbook Pro.
In Safari and Chrome, I can at least see the bottom frame which says noVNC ready etc. etc. Firefox doesn't even show that. No amount of clicking on the screen or typing something has any effect. All of these are the latest versions of the respective browsers and OSes (El Capitan and Windows 7 Pro with the latest updates).
I even completely turned off the Windows Firewall on the PC and disabled the real time protection in Microsoft Security Essentials, but without any effect. These are the only two security programs I have on the PC.
D.O staff have repeatedly suggested this might be an ISP issue. But, what beats me is that I have never once had a problem launching the Lish console on Linode on the very same ISP connection. At some point, I can't help but wonder if this is actually a D.O issue in some respects, because reports of this error go back to 2012 and earlier.
This is turning out to be a real head-scratcher :-(
Have another answer? Share your knowledge. | {
"url": "https://www.digitalocean.com/community/questions/why-is-console-access-on-digital-ocean-so-problematic",
"source_domain": "www.digitalocean.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "43797",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:S5OCGFAABTEV3F6YEHVO6PGJ4DXVCW26",
"WARC-Concurrent-To": "<urn:uuid:5e1db122-622a-4fa8-bbb5-d8e06b766956>",
"WARC-Date": "2017-05-22T17:15:29Z",
"WARC-IP-Address": "104.16.24.4",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:O4X5FEZ3R7YJRKVB66ALWPXIFZDZQP7K",
"WARC-Record-ID": "<urn:uuid:cb0fedd6-ae93-46b8-8b11-57b63a71b24a>",
"WARC-Target-URI": "https://www.digitalocean.com/community/questions/why-is-console-access-on-digital-ocean-so-problematic",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:57ef83c9-fb98-456f-bb99-fc99c594d618>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-224-210.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
10,
14,
24,
25,
80,
81,
107,
125,
126,
365,
366,
725,
726,
1422,
1423,
1708,
1709,
2018,
2019,
2218,
2219,
2294,
2295,
2304,
2305,
2403,
2404,
2454,
2455,
2521,
2685,
2853,
2941,
2942,
3002,
3003,
3039,
3040,
3406,
3407,
3735,
3736,
3955,
3956,
4301,
4302,
4358,
4359
],
"line_end_idx": [
10,
14,
24,
25,
80,
81,
107,
125,
126,
365,
366,
725,
726,
1422,
1423,
1708,
1709,
2018,
2019,
2218,
2219,
2294,
2295,
2304,
2305,
2403,
2404,
2454,
2455,
2521,
2685,
2853,
2941,
2942,
3002,
3003,
3039,
3040,
3406,
3407,
3735,
3736,
3955,
3956,
4301,
4302,
4358,
4359,
4401
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4401,
"ccnet_original_nlines": 48,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44008713960647583,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.059912849217653275,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15032680332660675,
"rps_doc_frac_unique_words": 0.416774183511734,
"rps_doc_mean_word_length": 4.454193592071533,
"rps_doc_num_sentences": 59,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.2639665603637695,
"rps_doc_word_count": 775,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.010139049962162971,
"rps_doc_frac_chars_top_3gram": 0.007821549661457539,
"rps_doc_frac_chars_top_4gram": 0.008111240342259407,
"rps_doc_books_importance": -400.2070007324219,
"rps_doc_books_importance_length_correction": -400.2070007324219,
"rps_doc_openwebtext_importance": -232.3297119140625,
"rps_doc_openwebtext_importance_length_correction": -232.3297119140625,
"rps_doc_wikipedia_importance": -149.1663360595703,
"rps_doc_wikipedia_importance_length_correction": -149.1663360595703
},
"fasttext": {
"dclm": 0.1824842095375061,
"english": 0.9646431803703308,
"fineweb_edu_approx": 1.082603931427002,
"eai_general_math": 0.36544108390808105,
"eai_open_web_math": 0.15708661079406738,
"eai_web_code": 0.5534269213676453
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
1,287,716,065,710,083,300 | Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:
Sign up
Here's how it works:
1. Anybody can ask a question
2. Anybody can answer
3. The best answers are voted up and rise to the top
What is the polar form for a superellipse with semidiameters $a$ and $b$, centered at a point $(r_0, θ_0)$, with the $a$ semidiameter at an angle $\varphi$ relative to the polar axis?
share|cite|improve this question
For a regular ellipse oriented with the major axis along $x$, Wikipedia gives $r=\frac{ab}{\sqrt{(b\cos \theta)^2+(a \sin \theta)^2}}$. To rotate this by $\theta_0$, just subtract from $\theta$ giving $r=\frac{ab}{\sqrt{(b\cos (\theta-\theta_0))^2+(a \sin (\theta-\theta_0))^2}}$. To make it a superellipse, just change the exponent to $n$ giving $r=\frac{ab}{\sqrt[n]{|b\cos (\theta-\theta_0)|^n+|a \sin (\theta-\theta_0)|^n}}$. Translations are hard in polar coordinates, so I would give up and go to Cartesian.
share|cite|improve this answer
1
Insert absolute value signs where needed... :) – J. M. Oct 26 '11 at 17:09
@J.M.: Good point. Inserted – Ross Millikan Oct 26 '11 at 17:22
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "http://math.stackexchange.com/questions/76099/polar-form-of-a-superellipse",
"source_domain": "math.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "75768",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VY7VUNRXEIEFC3XC5RYFEQDPJ6254YNA",
"WARC-Concurrent-To": "<urn:uuid:bc85b83d-18d5-454d-af99-25c5e3372a4a>",
"WARC-Date": "2016-07-29T18:19:09Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FXPLOACNSDREXTXOKKUISJBI6N6SNZOY",
"WARC-Record-ID": "<urn:uuid:885f04f3-0ba6-4856-b960-ed55328bd806>",
"WARC-Target-URI": "http://math.stackexchange.com/questions/76099/polar-form-of-a-superellipse",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:30ebcfd7-c7fa-49b6-9c01-4a60a055618f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-27-174.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-30\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for July 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
167,
168,
176,
197,
229,
253,
308,
309,
493,
494,
527,
528,
1042,
1043,
1074,
1078,
1153,
1158,
1222,
1223,
1235,
1236,
1238,
1246,
1247,
1325,
1326
],
"line_end_idx": [
167,
168,
176,
197,
229,
253,
308,
309,
493,
494,
527,
528,
1042,
1043,
1074,
1078,
1153,
1158,
1222,
1223,
1235,
1236,
1238,
1246,
1247,
1325,
1326,
1416
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1416,
"ccnet_original_nlines": 27,
"rps_doc_curly_bracket": 0.012711860239505768,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28939828276634216,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014326649717986584,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.32951289415359497,
"rps_doc_frac_unique_words": 0.6511628031730652,
"rps_doc_mean_word_length": 4.734883785247803,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0.002865330083295703,
"rps_doc_unigram_entropy": 4.704495906829834,
"rps_doc_word_count": 215,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01473477017134428,
"rps_doc_frac_chars_top_3gram": 0.013752459548413754,
"rps_doc_frac_chars_top_4gram": 0.017681730911135674,
"rps_doc_books_importance": -141.0811004638672,
"rps_doc_books_importance_length_correction": -140.4515838623047,
"rps_doc_openwebtext_importance": -82.58763885498047,
"rps_doc_openwebtext_importance_length_correction": -82.58763885498047,
"rps_doc_wikipedia_importance": -64.9374008178711,
"rps_doc_wikipedia_importance_length_correction": -59.721229553222656
},
"fasttext": {
"dclm": 0.8046810626983643,
"english": 0.8122949004173279,
"fineweb_edu_approx": 2.125296115875244,
"eai_general_math": 0.00025313999503850937,
"eai_open_web_math": 0.5586072206497192,
"eai_web_code": -0.000010009999641624745
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "516.35",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "516.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
9,057,412,244,496,454,000 | Cellular Phone Numbers Have Become Personally Identifiable Information PII
3 0
During the rescue operation on Sunday, emergency workers heard people screaming for help from the wreckage and waited for periods of silence to help direct their efforts. “The chances of saving people now are minimal,” Mr Filatov told Reuters news agency. Between 30 to 40 people could still be trapped under the rubble of the nine-storey block, but the city’s mayor Borys Filatov was pessimistic about prospects of more survivors being found. To edit a phone number, tap the number, make your edits, then tap Update. On your primary device, open the WhatsApp app and go to the ‘Settings’ menu.
In more simple terms, that means that we gather data from multiple and varied sources across the United States, analyze it, and make it easily searchable for our users. Our goal is to give users everything they need and want to know about the people in their lives so that they can keep themselves and their family members safe. All you have to do to find out who is calling from unknown numbers is to enter the digits into the phone number search field, and you will have your answer within minutes. But then you assume that at some point there will be a mapping between a specific, named individual and the number, which according to WA is not the case. On the other hand – the number is unique to a person, which means that WA knows what user87989 is doing, without knowing that user87989 is actually John Brown. Which, per literal reading of the PII and other answers still means that this is indeed a PII.
If you want to have more features such as reporting robocall numbers, you’ll have to pay their monthly fee. But otherwise, this is an excellent service that can help you search for suspicious numbers. Whitepages also offers an app available for iOS and Android devices. Those on the service will be able to transfer between devices and Teams endpoints without having to hang up and re-enter a call. Support for using a single number across devices also makes it easier to stay connected to work, according to Verizon. You get full visual voicemail with voicemail to text, through the YouMail app or through the YouMail website – allowing you to access messages on any device, including your computer.
The issue is that the information itself is linked to you, a person. PII is not so much about usage, and more about the static information content of some data. There are plenty of services that FB can give a number to and get quantities of authoritative identity data for. So if the assertion that names are not pulled from contacts, only numbers, is made on privacy grounds, well, that’s at best deceptive. To know more about the phone number error, you can see various tutorials available on YouTube.
In addition to the forgoing, if contract employees become aware of a theft or loss of PII, they are required to immediately inform their DOL contract manager. In the event their DOL contract manager is not available, they are to immediately report the theft or loss to the DOL Computer Security Incident Response Capability team at When approval is granted to take sensitive information away from the office, the employee must adhere to the security policies described above. Saturday’s attack came after Britain had followed France and Poland with promises of further weapons, saying it would send 14 of its Challenger 2 main battle tanks as well as artillery support. In his nightly address, President Volodymyr Zelenskyy vowed to keep looking for survivors of the Dnipro attack.
It may be one of the reasons you see an error message every time you try to send an email. To uninstall Microsoft Office from your computer, follow the steps below. The user can try uninstalling and then reinstalling the Outlook. One limitation of this method is that the users should create a new account after the Uninstallation. The next time you get a mystery phone call, it won’t have to stay a mystery for a long time. With GoLookUp’s advanced reverse phone lookup, any critical information about a number is at your fingertips.
The two most common categories of phone numbers are landline and mobile. Landlines are physically wired into the local telephone network. These phone numbers are assigned to businesses or individuals within specific areas. If the business or person decides to move out of the area, the landline number is returned to the provider. I might be confusing an ID used for a person and an ID to identify a phone, both are an identifier, but not an “identification number” according to you.
And remember, YouMail premium plans have a 14-day risk free guarantee. If you don’t like the service, you can cancel any time within the first 14 days, and get all your money back, no questions asked. Once we have the full name and the location information, we then sift through our address databases to show you the full street address where available. Likewise, sometimes, there might be a likelihood that various records are being utilized on the gadget. Another common way of placing sports bets is through the use of the racing lines. The odds on each horse in a race are posted on the racing board just before the race.
There is a way for you to find out once and for all who is calling you by using reverse phone lookup. As Teams becomes more commonplace in professional settings, a service like Teams Phone Mobile allows users to extend their Teams communication across several devices. Verizon refers to Teams Phone Mobile as a “mobile-first Teams experience for today’s increasingly growing mobile workforce.” There are times when the Office installation errors need some repair. | {
"url": "https://dudewhereismydrone.com/cellular-phone-numbers-have-become-personally-identifiable-information-pii/",
"source_domain": "dudewhereismydrone.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "54761",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OWNY5YMR4ABUIQPQ235NUABXDAUOL2CO",
"WARC-Concurrent-To": "<urn:uuid:15488729-9d32-44e8-8036-2a841438cdd0>",
"WARC-Date": "2023-01-28T06:38:00Z",
"WARC-IP-Address": "104.21.9.143",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3DC2XRACAXSEHTJKHMPUIRATAYLDDQXS",
"WARC-Record-ID": "<urn:uuid:90a3b502-58a3-4732-8157-705bfbbd3893>",
"WARC-Target-URI": "https://dudewhereismydrone.com/cellular-phone-numbers-have-become-personally-identifiable-information-pii/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:abe44f41-3b49-49e5-b4e9-826bad9cc877>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-204\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
75,
76,
80,
81,
676,
677,
1588,
1589,
2290,
2291,
2795,
2796,
3578,
3579,
4114,
4115,
4599,
4600,
5226,
5227
],
"line_end_idx": [
75,
76,
80,
81,
676,
677,
1588,
1589,
2290,
2291,
2795,
2796,
3578,
3579,
4114,
4115,
4599,
4600,
5226,
5227,
5690
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5690,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4622384011745453,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012738849967718124,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11191993206739426,
"rps_doc_frac_unique_words": 0.47125256061553955,
"rps_doc_mean_word_length": 4.731006145477295,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.501482009887695,
"rps_doc_word_count": 974,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.006510419771075249,
"rps_doc_frac_chars_top_3gram": 0.00390625,
"rps_doc_frac_chars_top_4gram": 0.00998263992369175,
"rps_doc_books_importance": -496.7808532714844,
"rps_doc_books_importance_length_correction": -496.7808532714844,
"rps_doc_openwebtext_importance": -284.5737609863281,
"rps_doc_openwebtext_importance_length_correction": -284.5737609863281,
"rps_doc_wikipedia_importance": -214.4072723388672,
"rps_doc_wikipedia_importance_length_correction": -214.4072723388672
},
"fasttext": {
"dclm": 0.0925832986831665,
"english": 0.9531586766242981,
"fineweb_edu_approx": 1.8591808080673218,
"eai_general_math": 0.07199758291244507,
"eai_open_web_math": 0.13107949495315552,
"eai_web_code": 0.10511904954910278
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "352.3",
"labels": {
"level_1": "Social sciences",
"level_2": "Public administration and Military art and science",
"level_3": "Local government"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-5,240,845,155,608,716,000 | Why did the topic of the Crusades gain popularity on the Internet?
Why did the topic of the Crusades gain popularity on the Internet?
Billy Graham - The Speech That Broke The Internet - Most Inspiring Ever
Previous questionWhy did Oxxxymiron and LSP quarrel?
Next questionIs it true that Google can only find 6% of the Internet's information, and the remaining 94% is contained in DarkNet and DeepWeb?
answers (4)
Answer 1
July, 2021
Well, in general, the "knightly" period is shrouded in a veil of romance)))
I think this "romanticization" began in literature and mass consciousness thanks to Sir Thomas Malory (15th century) and his large-scale epic "The Death of Arthur", in which he combined and literary formalized all the most common legends about Arthur and the Knights of the Round Table. It is Malory's book that is the main source for all subsequent Arturians and in general for "knightly" novels
Answer 2
July, 2021
I remembered a joke here:
- Can't you kill? - No you can not. - And for faith? - Well, this is a sacred thing ...
- Can't you kill? - No you can not. - And for faith? - Well, this is a sacred thing ...
- Can't you kill? - No you can not. - And for faith? - Well, this is a sacred thing ...
Answer 3
July, 2021
"Autumn is already entering the Rhine
and we have gone to the ends of the earth
and our bones in the churchyard
The desert sands have been brought.
..and the clouds are burning in the sky
and dust is blowing along the roads
and..The wind is blowing .. the wind is blowing
from the wild, parched deserts.
.. and our wives are waiting for us at home
our brides have bloomed
and our widows cry bitterly
their cry flies to the ends of the earth ... "
Answer 4
July, 2021
Let's start with the fact that Deus Vult is the battle cry of the Crusaders during the first Crusade in 1095. Here, on the Internet, the phrase gained popularity among fans of the game Crusader Kings, and then on political boards in Reddit and Fortchan, in particular in discussions about Islamic extremism. The essence is not very clear, but in short, the topic went from Reddit and Forch.
In 2012, the game Crusader Kings II appeared, where the phrase Deus Vult appears when the Pope announces the beginning of the Crusade.
Throughout 2016, the theme continued to push ahead on Reddit, Imgur and Forchan. On August 22, another video was released:
https://www.youtube.com/embed/time_continue=13?wmode=opaque
In general, as usual, everything went from reddit and Forchana, the only question is who is the instigator.
Related question
Why did the genre "my reaction to" gain popularity on YouTube? Why are we interested in this?
Read more
What topic to create a group in contact to quickly gain popularity? (What topics are the most searched for now?)
Read more
Why did Diana Shurygina gain more popularity and more memes than Sycheva?
Read more
10 Easy Buttons the Tutorial Did NOT Teach You in Crusader Kings 3
Where did it come from, the phrase "well, that's it" And how did it become popular on the Internet?
Read more
Why has the topic of mental illness and disorder become so popular?
Read more
What memes and popular expressions (I watched / did not watch) on the Internet enrage?
Read more
Why is Dmitry Malikov so popular on the Internet?
Read more
What are the names of this kind of photography and why are they so popular on the Internet?
Read more
The 'Author' of My Immortal Emailed Me, And Then It Got Worse
The Internet dates back to the 20th century. Why did it only become popular a few years ago?
Read more
Why is Mayakovsky so popular on the Internet now, if most of his poems are Soviet propaganda?
Read more
Are there any Internet resources on which you can express your opinion to a large audience about a topic, without having popularity?
Read more
What is the reason for the popularity of Ukrainian shows on the Internet?
Read more
Why is astronautics gaining momentum and becoming popular again lately?
Read more
So, Hows LFG Sounding Right About Now?
How to respond to “couch psychiatrists” who make “diagnoses” based on a post on an abstract topic on the Internet?
Read more
People are now very toxic on the Internet, go to comments in any public and there is a war on any topic. What is the meaning of this?
Read more
Why did people become so angry? Impact of the Internet?
Read more
Are users not annoyed by the automatic playback of videos on popular sites (YouTube, VK, etc.)? Why did sites start introducing this all over the place?
Read more
What is the reason for such a rapid growth in the popularity of Yuri Dud (vDud) on the Internet?
Read more
Forging a Kingdom - Introduction: The Duchy of Croatia in 867 | History | Crusader Kings 3
Is it true that Russian is the second most popular language on the Internet after English? If so, why?
Read more
How did the Be Like Petya meme come about? Why did he become so popular?
Read more | {
"url": "https://raywebart.com/q/3-why-did-the-topic-of-the-crusades-gain-popularity-on-the-internet",
"source_domain": "raywebart.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "30867",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YZECUOQMUDVSEV5BNTCZNPYNULULQEA7",
"WARC-Concurrent-To": "<urn:uuid:85824e98-35e0-4c52-bf76-dbe7f8dfa077>",
"WARC-Date": "2021-07-31T16:44:46Z",
"WARC-IP-Address": "104.21.6.28",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:URKE5TC47Y2FBMJ4E7VNSUQNEETFY2B2",
"WARC-Record-ID": "<urn:uuid:803b1c00-d718-4952-b6e8-a9551f71deb2>",
"WARC-Target-URI": "https://raywebart.com/q/3-why-did-the-topic-of-the-crusades-gain-popularity-on-the-internet",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fc30682a-ce59-4a65-87f2-a20f4207f694>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-148.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
67,
68,
135,
136,
208,
209,
262,
405,
406,
418,
419,
428,
439,
440,
516,
913,
914,
923,
934,
935,
961,
962,
1050,
1051,
1139,
1140,
1228,
1229,
1238,
1249,
1250,
1288,
1330,
1362,
1398,
1399,
1400,
1440,
1476,
1524,
1556,
1557,
1558,
1602,
1626,
1654,
1701,
1702,
1711,
1722,
1723,
2114,
2115,
2250,
2251,
2375,
2376,
2436,
2437,
2545,
2546,
2563,
2564,
2658,
2659,
2669,
2670,
2783,
2784,
2794,
2795,
2869,
2870,
2880,
2881,
2948,
2949,
3049,
3050,
3060,
3061,
3129,
3130,
3140,
3141,
3228,
3229,
3239,
3240,
3290,
3291,
3301,
3302,
3394,
3395,
3405,
3406,
3468,
3469,
3562,
3563,
3573,
3574,
3668,
3669,
3679,
3680,
3813,
3814,
3824,
3825,
3899,
3900,
3910,
3911,
3983,
3984,
3994,
3995,
4034,
4035,
4150,
4151,
4161,
4162,
4296,
4297,
4307,
4308,
4364,
4365,
4375,
4376,
4529,
4530,
4540,
4541,
4638,
4639,
4649,
4650,
4741,
4742,
4845,
4846,
4856,
4857,
4930,
4931
],
"line_end_idx": [
67,
68,
135,
136,
208,
209,
262,
405,
406,
418,
419,
428,
439,
440,
516,
913,
914,
923,
934,
935,
961,
962,
1050,
1051,
1139,
1140,
1228,
1229,
1238,
1249,
1250,
1288,
1330,
1362,
1398,
1399,
1400,
1440,
1476,
1524,
1556,
1557,
1558,
1602,
1626,
1654,
1701,
1702,
1711,
1722,
1723,
2114,
2115,
2250,
2251,
2375,
2376,
2436,
2437,
2545,
2546,
2563,
2564,
2658,
2659,
2669,
2670,
2783,
2784,
2794,
2795,
2869,
2870,
2880,
2881,
2948,
2949,
3049,
3050,
3060,
3061,
3129,
3130,
3140,
3141,
3228,
3229,
3239,
3240,
3290,
3291,
3301,
3302,
3394,
3395,
3405,
3406,
3468,
3469,
3562,
3563,
3573,
3574,
3668,
3669,
3679,
3680,
3813,
3814,
3824,
3825,
3899,
3900,
3910,
3911,
3983,
3984,
3994,
3995,
4034,
4035,
4150,
4151,
4161,
4162,
4296,
4297,
4307,
4308,
4364,
4365,
4375,
4376,
4529,
4530,
4540,
4541,
4638,
4639,
4649,
4650,
4741,
4742,
4845,
4846,
4856,
4857,
4930,
4931,
4940
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4940,
"ccnet_original_nlines": 149,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3942028880119324,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007729469798505306,
"rps_doc_frac_lines_end_with_ellipsis": 0.019999999552965164,
"rps_doc_frac_no_alph_words": 0.17777778208255768,
"rps_doc_frac_unique_words": 0.4156908690929413,
"rps_doc_mean_word_length": 4.463700294494629,
"rps_doc_num_sentences": 61,
"rps_doc_symbol_to_word_ratio": 0.0038647300098091364,
"rps_doc_unigram_entropy": 5.078212261199951,
"rps_doc_word_count": 854,
"rps_doc_frac_chars_dupe_10grams": 0.07161594927310944,
"rps_doc_frac_chars_dupe_5grams": 0.15424974262714386,
"rps_doc_frac_chars_dupe_6grams": 0.12539349496364594,
"rps_doc_frac_chars_dupe_7grams": 0.10099685192108154,
"rps_doc_frac_chars_dupe_8grams": 0.07161594927310944,
"rps_doc_frac_chars_dupe_9grams": 0.07161594927310944,
"rps_doc_frac_chars_top_2gram": 0.04197271913290024,
"rps_doc_frac_chars_top_3gram": 0.04433368146419525,
"rps_doc_frac_chars_top_4gram": 0.0348898209631443,
"rps_doc_books_importance": -580.061279296875,
"rps_doc_books_importance_length_correction": -580.061279296875,
"rps_doc_openwebtext_importance": -301.8646545410156,
"rps_doc_openwebtext_importance_length_correction": -301.8646545410156,
"rps_doc_wikipedia_importance": -236.46652221679688,
"rps_doc_wikipedia_importance_length_correction": -236.46652221679688
},
"fasttext": {
"dclm": 0.656559407711029,
"english": 0.9435102939605713,
"fineweb_edu_approx": 2.2689995765686035,
"eai_general_math": 0.013693450018763542,
"eai_open_web_math": 0.25698786973953247,
"eai_web_code": 0.009004349820315838
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "909.04",
"labels": {
"level_1": "History and Geography",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
5,586,390,124,171,873,000 | Rishi Reddy Rishi Reddy - 10 months ago 29
SQL Question
inserting a mysql query in codeigniter
$query = $this->db->query('select
sum(like) as atotal
from
like
where
sfid = '.$short);<br>
print_r($query);
and the error is
Error Number: 1064
You have an error in your SQL syntax; check the manual that
corresponds to your MySQL server version for the right syntax to use
near 'like) as atotal from like where sfid = 11' at line 2
select sum(like) as atotal from like where sfid = 11
Filename: C:\wamp\www\don\system\database\DB_driver.php
Line Number: 330
'like' in sum(like) is column name and 'like' after 'from' is table name
thank you in advance
Answer
You shouldn't use like keyword in your query. It is sql-specific word treated as special keyword. To solve this task, you should change column name in database table or wrap like keyword in backticks either:
$query = $this->db->query('select sum(`like`) as atotal from `like` where sfid = '.$short); | {
"url": "https://codedump.io/share/UBBq95mbIKFJ/1/inserting-a-mysql-query-in-codeigniter",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "26017",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KEE4TJWZ7HMEVJUNRS7LIIFJODRIVO6F",
"WARC-Concurrent-To": "<urn:uuid:92293b25-0798-442c-ae70-f026ed96b077>",
"WARC-Date": "2017-05-28T01:24:57Z",
"WARC-IP-Address": "84.22.103.185",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VCVHLJN3OLYVIEVQ7Y2WK22RNTMDBH4B",
"WARC-Record-ID": "<urn:uuid:046fa349-7f0e-4f46-a15d-dfc58c27bcc7>",
"WARC-Target-URI": "https://codedump.io/share/UBBq95mbIKFJ/1/inserting-a-mysql-query-in-codeigniter",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:128cd61e-403e-48d5-b8d1-a05357ce9d9d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-224-210.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
43,
56,
57,
96,
97,
131,
151,
156,
161,
167,
189,
206,
207,
208,
225,
226,
227,
246,
247,
248,
308,
377,
436,
437,
438,
491,
492,
493,
549,
550,
551,
568,
569,
570,
643,
664,
665,
672,
673,
881,
882
],
"line_end_idx": [
43,
56,
57,
96,
97,
131,
151,
156,
161,
167,
189,
206,
207,
208,
225,
226,
227,
246,
247,
248,
308,
377,
436,
437,
438,
491,
492,
493,
549,
550,
551,
568,
569,
570,
643,
664,
665,
672,
673,
881,
882,
973
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 973,
"ccnet_original_nlines": 41,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31578946113586426,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013157890178263187,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.29385966062545776,
"rps_doc_frac_unique_words": 0.5374149680137634,
"rps_doc_mean_word_length": 4.904761791229248,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.132583141326904,
"rps_doc_word_count": 147,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.23439666628837585,
"rps_doc_frac_chars_dupe_6grams": 0.23439666628837585,
"rps_doc_frac_chars_dupe_7grams": 0.23439666628837585,
"rps_doc_frac_chars_dupe_8grams": 0.14979195594787598,
"rps_doc_frac_chars_dupe_9grams": 0.14979195594787598,
"rps_doc_frac_chars_top_2gram": 0.04438279941678047,
"rps_doc_frac_chars_top_3gram": 0.06657420098781586,
"rps_doc_frac_chars_top_4gram": 0.08876559883356094,
"rps_doc_books_importance": -86.5645523071289,
"rps_doc_books_importance_length_correction": -86.5645523071289,
"rps_doc_openwebtext_importance": -55.715248107910156,
"rps_doc_openwebtext_importance_length_correction": -41.938655853271484,
"rps_doc_wikipedia_importance": -31.210050582885742,
"rps_doc_wikipedia_importance_length_correction": -31.210050582885742
},
"fasttext": {
"dclm": 0.5445349216461182,
"english": 0.8214649558067322,
"fineweb_edu_approx": 2.496082067489624,
"eai_general_math": 0.5325440168380737,
"eai_open_web_math": 0.20143431425094604,
"eai_web_code": 0.0031726399902254343
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
6,549,217,616,324,102,000 | Categorías
getiton pl review
Do Bumble Notify one another Once you Unmatch?
Do Bumble Notify one another Once you Unmatch?
When someone unmatches your on the Bumble, will you be notified? Really does Bumble notify one another when you unmatch them? What can you for those who coordinated together and then require so you’re able to unmatch? These are questions we come across a lot within current email address email here at TechJunkie. Now, we’ll answer the question away from what goes on whenever you unmatch with some one during the Bumble.
Dating can be easier to create than just real world dating but it has got the same anxiousness plus the same dilemma as real-world. Even though it’s a screen doesn’t mean do not get inspired in the same manner if we is declined. So let us dispel a few of the dilemma and address a number of those individuals inquiries.
If someone else unmatches your into Bumble, does Bumble let you know?
Are you informed when someone unmatches your towards the Bumble? For folks who coordinated that have someone and find out the fresh notice, nothing beats you to absolutely nothing take to out of adrenalin you get as you realize the possibility. When you are men, these days it is a located video game. If you find yourself ladies, you will notice the possibility to start a talk.
What goes on 2nd hinges on many parameters. Should your woman enjoys you, they are going to chat. If your man loves you, you have still got in order to initiate the newest talk to discover. When they unmatch your, you would not getting notified, the fresh new suits will simply unofficially decrease out of your Bumble match waiting line. | {
"url": "https://www.macetea.com/?cat=16911",
"source_domain": "www.macetea.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "1049327",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QDURIKNFWN7XSYTFRN3HXGCHLIUVXNCA",
"WARC-Concurrent-To": "<urn:uuid:1b837591-29bd-4747-a03b-862875f4c714>",
"WARC-Date": "2024-02-20T22:09:52Z",
"WARC-IP-Address": "162.19.87.35",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:E6ROGVC4LX5XBDPVULUGO63FT2THC3N4",
"WARC-Record-ID": "<urn:uuid:4d1a619d-5d8e-46a8-a764-c45e29257723>",
"WARC-Target-URI": "https://www.macetea.com/?cat=16911",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:93c73b57-485c-4600-bc00-01a7b651080e>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-229\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
11,
29,
30,
77,
78,
125,
126,
548,
549,
869,
870,
940,
941,
1321,
1322
],
"line_end_idx": [
11,
29,
30,
77,
78,
125,
126,
548,
549,
869,
870,
940,
941,
1321,
1322,
1660
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1660,
"ccnet_original_nlines": 15,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5242424011230469,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10303030163049698,
"rps_doc_frac_unique_words": 0.5429553389549255,
"rps_doc_mean_word_length": 4.584192276000977,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.733005046844482,
"rps_doc_word_count": 291,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.056971509009599686,
"rps_doc_frac_chars_dupe_6grams": 0.056971509009599686,
"rps_doc_frac_chars_dupe_7grams": 0.056971509009599686,
"rps_doc_frac_chars_dupe_8grams": 0.056971509009599686,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.029985010623931885,
"rps_doc_frac_chars_top_3gram": 0.03373312950134277,
"rps_doc_frac_chars_top_4gram": 0.04947526007890701,
"rps_doc_books_importance": -164.01217651367188,
"rps_doc_books_importance_length_correction": -150.6006622314453,
"rps_doc_openwebtext_importance": -89.82454681396484,
"rps_doc_openwebtext_importance_length_correction": -89.82454681396484,
"rps_doc_wikipedia_importance": -44.127685546875,
"rps_doc_wikipedia_importance_length_correction": -32.403934478759766
},
"fasttext": {
"dclm": 0.4345576763153076,
"english": 0.9369039535522461,
"fineweb_edu_approx": 1.2365355491638184,
"eai_general_math": 0.11889327317476273,
"eai_open_web_math": 0.21735715866088867,
"eai_web_code": 0.06710190325975418
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.468",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "302.3",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "9",
"label": "FAQ"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-6,741,268,104,581,666,000 | ;redcode-94x ;name Scythe CX 7 ;author Steve Gunnell ;strategy Bit of Recon 2, bit of Kenshin, ;strategy bit of Racy Helper, bit of Perseus. ;assert CORESIZE==55440 START equ (12005+12005) GAP equ ( 3+14 ) B equ (decoy+35944) LAUNCH equ 18642 PTR equ ( scan - GAP - 2 ) SAFE equ ( tail - loop + GAP + 1 ) STEP equ (25741+25741) loop sub wipe, @s2 scan sne.i START-GAP, START sub wipe, scan clr mov.i wipe, >PTR for 4 mov.i *clr, >PTR rof s2 sne.i *scan, @scan ; check another pair jmp loop, scan slt.b scan, #SAFE ; ignore self here mov.b scan, PTR jmn.b loop, scan jmp loop, }clr wipe spl #STEP, #STEP for 11 DIV.AB #0 ,<0 rof for 2 SUB.A }0 ,}0 rof tail dat #0 , #0 boot mov >fire , }fire for 4+5 mov >fire , }fire rof fire spl LAUNCH , loop for 11+2+6 mov >fire , }fire rof sub.f fire , fire S equ 14 decoy nop {B , {B+S+2 I for (MAXLENGTH-CURLINE) mov.i {B+(S+3)*I , {(B+(S+3)*I+S+2) rof end boot | {
"url": "http://koth.org/users.obs.carnegiescience.edu/birk/COREWAR/X/HILL/scopt3-yfaa.red",
"source_domain": "koth.org",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "1439",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VNGWD3XHWPXSHF4PM7M3AHM3D7RN2ARV",
"WARC-Concurrent-To": "<urn:uuid:3d98b73d-41b8-40d8-a54b-7881bf6f6930>",
"WARC-Date": "2020-07-15T01:59:39Z",
"WARC-IP-Address": "204.107.90.50",
"WARC-Identified-Payload-Type": "text/plain",
"WARC-Payload-Digest": "sha1:W6VXPYMQQX2RUONRY3J7K7B5X24A4YU5",
"WARC-Record-ID": "<urn:uuid:90451dde-1cb2-4a71-80c1-d8b8a2a2cbbf>",
"WARC-Target-URI": "http://koth.org/users.obs.carnegiescience.edu/birk/COREWAR/X/HILL/scopt3-yfaa.red",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2dd715e6-9d6f-41e9-ae67-1ef3468b1457>"
},
"warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-227.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0
],
"line_end_idx": [
900
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 900,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.01111111044883728,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08695652335882187,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.1304347813129425,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.47491639852523804,
"rps_doc_frac_unique_words": 0.4968152940273285,
"rps_doc_mean_word_length": 3.8535032272338867,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0.020066890865564346,
"rps_doc_unigram_entropy": 4.051283836364746,
"rps_doc_word_count": 157,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03305784985423088,
"rps_doc_frac_chars_top_3gram": 0.05454545095562935,
"rps_doc_frac_chars_top_4gram": 0.04628099128603935,
"rps_doc_books_importance": -117.83780670166016,
"rps_doc_books_importance_length_correction": -117.83780670166016,
"rps_doc_openwebtext_importance": -69.27027893066406,
"rps_doc_openwebtext_importance_length_correction": -60.02359390258789,
"rps_doc_wikipedia_importance": -48.23458480834961,
"rps_doc_wikipedia_importance_length_correction": -48.23458480834961
},
"fasttext": {
"dclm": 0.10764133930206299,
"english": 0.36290648579597473,
"fineweb_edu_approx": 0.9153014421463013,
"eai_general_math": 0.10817843675613403,
"eai_open_web_math": 0.15926498174667358,
"eai_web_code": 0.8894646763801575
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
8,795,641,630,290,232,000 | you are viewing a single comment's thread.
view the rest of the comments →
[–]TierbyFive -1 points0 points (3 children)
sorry, this has been archived and can no longer be voted on
I don't believe he insulted him, he just didn't bend and ask the easy questions the PR person behind the camera demanded he asked. Pulling the microphone away before someone is done may look rude but its required in a time limited interview or the interviewee will waffle on an easy question to run down the time.
Is that really a bad thing that he's not put his personal gain ahead of asking nelson questions a lot of people wanted to ask?
[–]shiny_dunsparce 1 point2 points (2 children)
sorry, this has been archived and can no longer be voted on
The PR face of microsoft isn't going to answer those questions on his own, ever. He will only say what he knows he's allowed to.
[–]TierbyFive 0 points1 point (1 child)
sorry, this has been archived and can no longer be voted on
I agree, much in the same way a politician has an army of advisors behind them to make sure they never miss-step in an interview, but people still need to ask. A good interviewer tries get them to slip and show their cards (Don Mattrick saying people without net should just buy an xbox360 jumps to mind), fair enough joe is not a good interviewer in a lot of ways but I don't see why he should be put down for trying
[–]shiny_dunsparce 0 points1 point (0 children)
sorry, this has been archived and can no longer be voted on
I'm saying the opposite, I'm saying he shouldn't be praised for just asking questions he wasn't going to get answered. | {
"url": "http://www.reddit.com/r/gaming/comments/1gr8g2/one_man_deserves_some_special_recognition_for_his/can35w5",
"source_domain": "www.reddit.com",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "52957",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZSLMG3IKEWXWMVYS6JLBX5NUQD2TTTP2",
"WARC-Concurrent-To": "<urn:uuid:064e6b90-171b-499f-ba1c-54f38ba2f69b>",
"WARC-Date": "2014-08-23T13:45:41Z",
"WARC-IP-Address": "198.41.209.143",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5HNN4UOL3GNWMGXQSVKM33HEKZFAMMBT",
"WARC-Record-ID": "<urn:uuid:b57c8f81-a8af-444d-96f8-87c2c201da41>",
"WARC-Target-URI": "http://www.reddit.com/r/gaming/comments/1gr8g2/one_man_deserves_some_special_recognition_for_his/can35w5",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3bf199c1-0267-4b60-88b8-50cdcd5422fa>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-136-8.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for August 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
43,
44,
76,
77,
123,
124,
184,
185,
499,
500,
627,
628,
677,
678,
738,
739,
868,
869,
910,
911,
971,
972,
1390,
1391,
1440,
1441,
1501,
1502
],
"line_end_idx": [
43,
44,
76,
77,
123,
124,
184,
185,
499,
500,
627,
628,
677,
678,
738,
739,
868,
869,
910,
911,
971,
972,
1390,
1391,
1440,
1441,
1501,
1502,
1620
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1620,
"ccnet_original_nlines": 28,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5014244914054871,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022792020812630653,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15099714696407318,
"rps_doc_frac_unique_words": 0.5322033762931824,
"rps_doc_mean_word_length": 4.261016845703125,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.789923667907715,
"rps_doc_word_count": 295,
"rps_doc_frac_chars_dupe_10grams": 0.17024661600589752,
"rps_doc_frac_chars_dupe_5grams": 0.17024661600589752,
"rps_doc_frac_chars_dupe_6grams": 0.17024661600589752,
"rps_doc_frac_chars_dupe_7grams": 0.17024661600589752,
"rps_doc_frac_chars_dupe_8grams": 0.17024661600589752,
"rps_doc_frac_chars_dupe_9grams": 0.17024661600589752,
"rps_doc_frac_chars_top_2gram": 0.028639620169997215,
"rps_doc_frac_chars_top_3gram": 0.03818615898489952,
"rps_doc_frac_chars_top_4gram": 0.05091487988829613,
"rps_doc_books_importance": -160.76141357421875,
"rps_doc_books_importance_length_correction": -146.96133422851562,
"rps_doc_openwebtext_importance": -76.06031799316406,
"rps_doc_openwebtext_importance_length_correction": -76.06031799316406,
"rps_doc_wikipedia_importance": -78.60580444335938,
"rps_doc_wikipedia_importance_length_correction": -65.34103393554688
},
"fasttext": {
"dclm": 0.4041181802749634,
"english": 0.9796625971794128,
"fineweb_edu_approx": 1.0237888097763062,
"eai_general_math": 0.07778072357177734,
"eai_open_web_math": 0.1848103404045105,
"eai_web_code": 0.0009974800050258636
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "302.23",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,236,808,963,354,357,000 | Ethernet.setRetransmissionTimeout()
名称
Ethernet.setRetransmissionTimeout()
説明
イーサネットコントローラのタイムアウトを設定する。初期値は200msである。デフォルトのタイムアウト値である200ms間隔で、8回試行するので、通信が失敗するまでに1600ms、ブロッキングによる遅延が発生する。通信の状態が悪いときに、反応を早くするためには、小さい値を設定する。アプリケーション向けに最適な値を決定するために、実験する必要がある。
書式
void EthernetClass::setRetransmissionTimeout(uint16_t milliseconds);
引数
millisecondsタイムアウト間隔。
戻り値
なし。
使用例
1
2
3
4
5
6
7
8
9
10
11
12
#include <SPI.h>
#include <Ethernet.h>
byte mac[] = {0xDE, 0xAD, 0xBE, 0xEF, 0xFE, 0xED};
IPAddress ip(10, 0, 0, 177);
void setup() {
Ethernet.begin(mac, ip);
Ethernet.setRetransmissionTimeout(50); // set the Ethernet controller's timeout to 50 ms
}
void loop () {}
オリジナルのページ
https://www.arduino.cc/reference/en/libraries/ethernet/ethernet.setretransmissiontimeout/
最終更新日
January 7, 2024
inserted by FC2 system | {
"url": "https://garretlab.web.fc2.com/arduino.cc/www/reference/ja/libraries/ethernet/ethernet.setretransmissiontimeout/",
"source_domain": "garretlab.web.fc2.com",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "32722",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ASYVTWNUVZCHUOE5NDF6EPE3KM7UJ3D7",
"WARC-Concurrent-To": "<urn:uuid:6ab9634e-ec4b-4f4d-88d6-306cba11977b>",
"WARC-Date": "2024-09-15T06:40:31Z",
"WARC-IP-Address": "104.244.99.16",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VRLEJC3AJ3ZDLERUVNZP5PAMKYVEGGGY",
"WARC-Record-ID": "<urn:uuid:5f6762f3-5d04-4c08-b349-ef7bf96352ae>",
"WARC-Target-URI": "https://garretlab.web.fc2.com/arduino.cc/www/reference/ja/libraries/ethernet/ethernet.setretransmissiontimeout/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e8f73482-f94f-400b-92ef-a9c65be3cb21>"
},
"warc_info": "isPartOf: CC-MAIN-2024-38\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-217\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
36,
37,
40,
41,
77,
78,
81,
82,
257,
258,
261,
262,
331,
332,
335,
336,
358,
359,
363,
364,
368,
369,
373,
374,
377,
380,
383,
386,
389,
392,
395,
398,
401,
404,
407,
410,
427,
449,
450,
501,
530,
531,
546,
573,
665,
667,
668,
684,
685,
695,
696,
786,
787,
793,
794,
810,
811
],
"line_end_idx": [
36,
37,
40,
41,
77,
78,
81,
82,
257,
258,
261,
262,
331,
332,
335,
336,
358,
359,
363,
364,
368,
369,
373,
374,
377,
380,
383,
386,
389,
392,
395,
398,
401,
404,
407,
410,
427,
449,
450,
501,
530,
531,
546,
573,
665,
667,
668,
684,
685,
695,
696,
786,
787,
793,
794,
810,
811,
833
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 833,
"ccnet_original_nlines": 57,
"rps_doc_curly_bracket": 0.0072028799913823605,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.03614458069205284,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012048190459609032,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6265060305595398,
"rps_doc_frac_unique_words": 0.9117646813392639,
"rps_doc_mean_word_length": 9.882352828979492,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0.012048190459609032,
"rps_doc_unigram_entropy": 4.0894927978515625,
"rps_doc_word_count": 68,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -66.24282836914062,
"rps_doc_books_importance_length_correction": -66.24282836914062,
"rps_doc_openwebtext_importance": -39.70703125,
"rps_doc_openwebtext_importance_length_correction": -39.068782806396484,
"rps_doc_wikipedia_importance": -31.235370635986328,
"rps_doc_wikipedia_importance_length_correction": -31.235370635986328
},
"fasttext": {
"dclm": 0.4435313940048218,
"english": 0.006043899804353714,
"fineweb_edu_approx": 0.919757604598999,
"eai_general_math": 0.563222348690033,
"eai_open_web_math": 0.16697841882705688,
"eai_web_code": 0.17886584997177124
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-6,956,605,410,680,815,000 | `multipass transfer` command
The multipass transfer command copies files between host and instance, without the need of mounting a folder on the instance.
For example, to copy a local file localfile.txt to the default home folder of the instance good-prawn, we should issue
multipass transfer localfile.txt good-prawn:.
Conversely, to copy a file remotefile.txt on the default home folder of the ample-pigeon instance to the current working folder, we should run
multipass transfer ample-pigeon:remotefile.txt .
The source file can be the host standard input, on which case the stream will be written on the destination file on the instance. In the same way, the destination can be the standard output of the host and the source a file on the instance. In these two cases, standard input and output are specified with -.
The full multipass help transfer output explains the available options:
$ multipass help transfer
Usage: multipass transfer [options] <source> [<source> ...] <destination>
Copy files between the host and instances.
Options:
-h, --help Displays help on commandline options.
--help-all Displays help including Qt specific options.
-v, --verbose Increase logging verbosity. Repeat the 'v' in the short option
for more detail. Maximum verbosity is obtained with 4 (or more)
v's, i.e. -vvvv.
Arguments:
source One or more paths to transfer, prefixed with <name:> for paths
inside the instance, or '-' for stdin
destination The destination path, prefixed with <name:> for a path inside
the instance, or '-' for stdout
Last updated a month ago. | {
"url": "https://multipass.run/docs/transfer-command",
"source_domain": "multipass.run",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "18958",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CXFMJCZ7HPNCO6HCZ7AFOZ6UYT6AXNR7",
"WARC-Concurrent-To": "<urn:uuid:cf87d40f-8ff7-4456-9d53-5247e629bb45>",
"WARC-Date": "2022-05-20T03:46:23Z",
"WARC-IP-Address": "185.125.190.20",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:V66YZW2LQIF5AXYHELDRQV7U72AB3EA7",
"WARC-Record-ID": "<urn:uuid:ef67d655-ed8a-4ff4-9c10-83dd50f7b44c>",
"WARC-Target-URI": "https://multipass.run/docs/transfer-command",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:68580172-4118-4af7-9bb7-52aad05d2c72>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-28\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
29,
30,
156,
157,
276,
277,
323,
324,
467,
468,
517,
518,
827,
828,
900,
901,
927,
1001,
1044,
1045,
1054,
1109,
1171,
1251,
1332,
1366,
1367,
1378,
1458,
1513,
1592,
1641,
1642
],
"line_end_idx": [
29,
30,
156,
157,
276,
277,
323,
324,
467,
468,
517,
518,
827,
828,
900,
901,
927,
1001,
1044,
1045,
1054,
1109,
1171,
1251,
1332,
1366,
1367,
1378,
1458,
1513,
1592,
1641,
1642,
1667
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1667,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32817336916923523,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22910216450691223,
"rps_doc_frac_unique_words": 0.4327731132507324,
"rps_doc_mean_word_length": 5.155462265014648,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0.0030959800351411104,
"rps_doc_unigram_entropy": 4.217349052429199,
"rps_doc_word_count": 238,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10757946223020554,
"rps_doc_frac_chars_dupe_6grams": 0.04074979946017265,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05378973111510277,
"rps_doc_frac_chars_top_3gram": 0.03178483992815018,
"rps_doc_frac_chars_top_4gram": 0.03259984031319618,
"rps_doc_books_importance": -127.55867004394531,
"rps_doc_books_importance_length_correction": -114.31487274169922,
"rps_doc_openwebtext_importance": -89.9645004272461,
"rps_doc_openwebtext_importance_length_correction": -89.9645004272461,
"rps_doc_wikipedia_importance": -79.08515930175781,
"rps_doc_wikipedia_importance_length_correction": -67.73081970214844
},
"fasttext": {
"dclm": 0.07258564233779907,
"english": 0.8012855648994446,
"fineweb_edu_approx": 2.027275562286377,
"eai_general_math": 0.9205315709114075,
"eai_open_web_math": 0.21366232633590698,
"eai_web_code": 0.9234817028045654
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-7,515,036,211,642,468,000 | Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
PerlMonks
Comment on
( #3333=superdoc: print w/replies, xml ) Need Help??
I'm assuming that Net::Server::POP3 inherits from some basic Net::Server module that provides basic server functionality. Even if it doesn't, let's say that it does.
Now, let's say that there is some other server base module, called Net2::Server. It provides a very similar (but not identical) interface, but radically different innards. It's useful for different types of servers.
Now, let's say that I am using five servers, each an object of a class that either inherits from Net::Server or Net2::Server. I don't know which inherits from which. But, I do know that there is one interface difference I need to be aware of - foo() vs. bar(). So, I can do the following:
my $method = $server->can('foo') || $server->can('bar'); $server->$method( @args );
And I guarantee that my code will work, regardless of which baseclass the server inherits from.
------
We are the carpenters and bricklayers of the Information Age.
Then there are Damian modules.... *sigh* ... that's not about being less-lazy -- that's about being on some really good drugs -- you know, there is no spoon. - flyingmoose
In reply to Re: What is this can() and why is breaking it (un)acceptable? by dragonchild
in thread Why breaking can() is acceptable by tilly
Title:
Use: <p> text here (a paragraph) </p>
and: <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":
• Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
• Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
• Read Where should I post X? if you're not absolutely sure you're posting in the right place.
• Please read these before you post! —
• Posts may use any of the Perl Monks Approved HTML tags:
a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
• You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
For: Use:
& &
< <
> >
[ [
] ]
• Link using PerlMonks shortcuts! What shortcuts can I use for linking?
• See Writeup Formatting Tips and other pages linked from there for more info.
• Log In?
Username:
Password:
What's my password?
Create A New User
Chatterbox?
and all is quiet...
How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (5)
As of 2017-02-24 07:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
Before electricity was invented, what was the Electric Eel called?
Results (353 votes). Check out past polls. | {
"url": "http://www.perlmonks.org/?parent=342948;node_id=3333",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "21865",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZP6HF26G62HVJE75II6VETEPUFQLW7YN",
"WARC-Concurrent-To": "<urn:uuid:2757c25b-074b-46ca-8d76-c82a1498bb1c>",
"WARC-Date": "2017-02-24T07:04:20Z",
"WARC-IP-Address": "66.39.54.27",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LY6DTU5IQZC7UTKCJZMDWHOIZXMMY5SF",
"WARC-Record-ID": "<urn:uuid:4cc7a5f7-d895-4bbb-a1b8-6832bab4029f>",
"WARC-Target-URI": "http://www.perlmonks.org/?parent=342948;node_id=3333",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:af73c8c4-7e7b-4017-bf66-81d04e5eb48b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-09\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
63,
88,
90,
102,
103,
114,
115,
168,
334,
335,
551,
552,
841,
842,
926,
927,
1023,
1024,
1031,
1093,
1094,
1266,
1267,
1268,
1357,
1409,
1410,
1417,
1456,
1487,
1540,
1541,
1542,
1543,
1666,
1765,
1862,
1903,
1963,
2229,
2364,
2390,
2402,
2413,
2424,
2436,
2448,
2522,
2603,
2615,
2629,
2643,
2644,
2668,
2690,
2706,
2730,
2731,
2773,
2790,
2830,
2861,
2875,
2892,
2908,
2923,
2943,
3016,
3017,
3018,
3019,
3020,
3021,
3022
],
"line_end_idx": [
63,
88,
90,
102,
103,
114,
115,
168,
334,
335,
551,
552,
841,
842,
926,
927,
1023,
1024,
1031,
1093,
1094,
1266,
1267,
1268,
1357,
1409,
1410,
1417,
1456,
1487,
1540,
1541,
1542,
1543,
1666,
1765,
1862,
1903,
1963,
2229,
2364,
2390,
2402,
2413,
2424,
2436,
2448,
2522,
2603,
2615,
2629,
2643,
2644,
2668,
2690,
2706,
2730,
2731,
2773,
2790,
2830,
2861,
2875,
2892,
2908,
2923,
2943,
3016,
3017,
3018,
3019,
3020,
3021,
3022,
3070
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3070,
"ccnet_original_nlines": 74,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.294765830039978,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024793390184640884,
"rps_doc_frac_lines_end_with_ellipsis": 0.013333329930901527,
"rps_doc_frac_no_alph_words": 0.3278236985206604,
"rps_doc_frac_unique_words": 0.605042040348053,
"rps_doc_mean_word_length": 4.525209903717041,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0.008264459669589996,
"rps_doc_unigram_entropy": 5.389087677001953,
"rps_doc_word_count": 476,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.022284120321273804,
"rps_doc_frac_chars_top_3gram": 0.015320329926908016,
"rps_doc_frac_chars_top_4gram": 0.01299906987696886,
"rps_doc_books_importance": -381.0262145996094,
"rps_doc_books_importance_length_correction": -381.0262145996094,
"rps_doc_openwebtext_importance": -185.1472625732422,
"rps_doc_openwebtext_importance_length_correction": -185.1472625732422,
"rps_doc_wikipedia_importance": -128.609619140625,
"rps_doc_wikipedia_importance_length_correction": -128.609619140625
},
"fasttext": {
"dclm": 0.042077839374542236,
"english": 0.8745378851890564,
"fineweb_edu_approx": 2.4042208194732666,
"eai_general_math": 0.02886730059981346,
"eai_open_web_math": 0.45234256982803345,
"eai_web_code": 0.0005596299888566136
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "6",
"label": "Indeterminate"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-4,542,037,216,202,139,600 | C++ atan()
C++ atan() returns inverse tangent of a number in radians.
Syntax
The syntax of C++ atan() is
atan(x)
where
ParameterDescription
xA double, float, or long double number.
Returns
The atan() function returns the value in the range of [-π/2, π/2].
The synopsis of atan() function is
double atan(double x);
float atan(float x);
long double atan(long double x);
double atan(T x); // for integral type argument values
Example
In this example, we read x value from the user and find the inverse tangent of this value using atan() function.
C++ Program
#include <iostream>
#include<cmath>
using namespace std;
int main() {
float x;
cout << "Enter a value : ";
cin >> x;
double result = atan(x);
cout << "atan(" << x << ") : " << result << " radians" << endl;
}
Output
Enter a value : 235
atan(235) : 1.56654 radians
Program ended with exit code: 0
Enter a value : 0
atan(0) : 0 radians
Program ended with exit code: 0
Conclusion
In this C++ Tutorial, we learned the syntax of C++ atan(), and how to use this function to find inverse tangent of a value, with the help of examples. | {
"url": "https://www.tutorialkart.com/cpp/cpp-cmath-atan-2/",
"source_domain": "www.tutorialkart.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "43324",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DOKYAMP4DJ3KZDT6PCNA4JV6TOLTY6XR",
"WARC-Concurrent-To": "<urn:uuid:f49866ab-0685-49ff-914c-69d9b85e07f5>",
"WARC-Date": "2022-08-19T01:39:30Z",
"WARC-IP-Address": "18.67.65.27",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IN2WQLBG72STI5HFT3YGZZJSOC4QIRBZ",
"WARC-Record-ID": "<urn:uuid:85813aea-7bf8-4237-8ded-49cf8b243233>",
"WARC-Target-URI": "https://www.tutorialkart.com/cpp/cpp-cmath-atan-2/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:59297208-5bdf-4208-9075-1f2071ac1691>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-171\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
11,
12,
71,
72,
79,
80,
108,
109,
117,
118,
124,
125,
146,
187,
188,
196,
197,
264,
265,
300,
301,
324,
345,
378,
433,
434,
442,
443,
556,
557,
569,
570,
590,
606,
627,
628,
641,
654,
686,
700,
709,
738,
806,
808,
809,
816,
817,
837,
865,
897,
915,
935,
967,
968,
979,
980
],
"line_end_idx": [
11,
12,
71,
72,
79,
80,
108,
109,
117,
118,
124,
125,
146,
187,
188,
196,
197,
264,
265,
300,
301,
324,
345,
378,
433,
434,
442,
443,
556,
557,
569,
570,
590,
606,
627,
628,
641,
654,
686,
700,
709,
738,
806,
808,
809,
816,
817,
837,
865,
897,
915,
935,
967,
968,
979,
980,
1130
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1130,
"ccnet_original_nlines": 56,
"rps_doc_curly_bracket": 0.0017699099844321609,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23507462441921234,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026119399815797806,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.35820895433425903,
"rps_doc_frac_unique_words": 0.4393063485622406,
"rps_doc_mean_word_length": 4.4566473960876465,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0.007462690118700266,
"rps_doc_unigram_entropy": 4.043491363525391,
"rps_doc_word_count": 173,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.12451361864805222,
"rps_doc_frac_chars_dupe_6grams": 0.08300907909870148,
"rps_doc_frac_chars_dupe_7grams": 0.08300907909870148,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.025940340012311935,
"rps_doc_frac_chars_top_3gram": 0.06225680932402611,
"rps_doc_frac_chars_top_4gram": 0.04409857094287872,
"rps_doc_books_importance": -128.26821899414062,
"rps_doc_books_importance_length_correction": -128.26821899414062,
"rps_doc_openwebtext_importance": -87.4725570678711,
"rps_doc_openwebtext_importance_length_correction": -82.0179672241211,
"rps_doc_wikipedia_importance": -81.30309295654297,
"rps_doc_wikipedia_importance_length_correction": -81.30309295654297
},
"fasttext": {
"dclm": 0.05876315012574196,
"english": 0.5133482217788696,
"fineweb_edu_approx": 2.1441540718078613,
"eai_general_math": 0.9942458271980286,
"eai_open_web_math": 0.3449445366859436,
"eai_web_code": 0.9928604364395142
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "515.9",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-5,175,196,329,130,679,000 | dslreports logo
site
All Forums Hot Topics Gallery
spc
spacer
how-to block ads
Search Topic:
uniqs
290
share rss forum feed
TMage
join:2002-06-05
Toronto, ON
Rogers High-Speed Download Caps
With all this talk about download caps, I've done some searching and I can't find any current information on if they're going to go through with enforcing a transfer cap.
Does anyone have any new information? I don't download a lot, however, in the evenings, I like to enjoy one or two RTS games, and occationally some streamed video...I rarely (read once every few months) use any file-sharing stuff, but I'm pretty sure I could hit the 5Gb/month cap relatively easy. I'd like to know how this possible cap will affect my usage...
Thanks.
[text was edited by author 2002-06-05 20:51:09]
Bob Carrick
Premium,ExMod 2002
join:2000-04-24
New York, NY
In all their articles all they say is by the end of the summer. It's pretty much easy to guess they will match Sympatico's caps as they have and Bell has also match what the other does. Other then that there is no new information.
--
Bob --»www.carricksolutions.com - The largest PPPoE Help Website, including EnterNet, WinPoet, MacPoet, Access Manager, RASPPPoE, & Networking
TMage
join:2002-06-05
Toronto, ON
reply to TMage
Don't know how true this is (it is a rumour after all), but a friend of mine saw the Global segment and called Rogers. The representative said they were considering alternatives to a D/U cap, but hadn't made any firm decisions. Hopefully, it means if they do place a cap, it'll be at least something reasonable...
Personally, if I have to live with a cap, something like 7.5/5 would be fine. Let people who like to use rich media use it...
The other consideration I'd like to see them consider is if they find you bandwidth hogging (I'm guessing mostly people who run file sharing full time), first you're given a notice, then a bandwidth or transfer cap. The reason I say this (and I'm pretty sure those of you who do use a lot of bandwidth won't like it said) is that if the numbers they present are true (that 1% of the users are taking up 16% of the network capacity or something like that), why are the rest of the users being limited? I feel like I'm being punished because of someone else's actions. While I MAY use up to 5Gb in transfers (this is an approximation), I don't want to have to feel like I have to count the amounts...it's counter-productive and irritating.
I'd rant some more, but I think you get the idea...
HiVolt
Premium
join:2000-12-28
Toronto, ON
kudos:21
Reviews:
·TekSavvy DSL
·TekSavvy Cable
All of us feel the same way, excluding those who work for their ISP's (hehe). I think all ISPs will eventually have caps, but they do need to think of a more down to earth approach that wont classify an internet enthusiast thats gotten used to their high speed high bandwidth service, as a bandwidth hog. Because thats what's happening now.
--
Thanks Leafs for a great season & playoffs.
Robert
Premium
join:2002-03-11
St John'S, NL
reply to TMage
I am just impressed how civil and well laid out your rant was, and I agree 100%!!!
Cheers
TMage
join:2002-06-05
Toronto, ON
said by rojohi:
I am just impressed how civil and well laid out your rant was, and I agree 100%!!!
Cheers
(LONG MESSAGE)
Thanks. I just feel frustrated that all these companies are encouraging rich media (For example, Sympatico's and Rogers' start pages), but then imposing transfer caps. They haven't really gone to ask their members for input or suggestions. They just arbitrarily impose a limitation that goes contrary to what they're trying to promote...and will probably not stop the abusers anyway. Very un-customer-oriented (another thing they need to learn). They're obviously able to identify who is overtaxing the service...why not do something to contain them...or think of a way to make more money off of them (which is why they provide the service).
Let me use Rogers as an example since I'm most familiar with them...Ensure that bandwidth hogs are subscribed the the VIP program or a digital bundle. Rogers has both these wonderful things that could encourage more users, yet they're not really promoting either (I haven't seen any ads for it . I only found out about them because I went to Roger's main site to check out pricing on cell phones. An e-mail would go a long way to notifying people...
Another option is educating the users. Now, you might say huh? wuzzat?... The average person who uses file sharing doesn't know that much about what they're doing. They just want files (primarily MP3 and MPEG videos), but they don't know how to configure their software properly, and leave themselves open to abuse. Teach them what they're getting themselves into (especially parents who have teen kids but aren't tech savey themselves). Another source of problems are people who have viruses and trojans....
All of these are ways to lower the bandwidth issues that I don't think have been considered. As for the smaller percentage who aren't covered by the above, I'm sure I could think of some way to cut their bandwidth usage (while not inconveniencing them too much)...
Anon Tech2
join:2002-02-02
London, ON
reply to TMage
As long as it's flatrate, i'm not really to concerned with what the price is.
They've set the inital boundary with the Rogers lite service at around $25. From there, they have lots of room to tier the price and speeds up. As long as the upstream is kept moderatly low, the downstream should never be excessively saturated.
Granted, however, I have a bit of a skewed view on what could be considered excessive downloads :P Typically I use about 75gigs down in a month.
What does this transfer rate mean? Well, 75gigs would take ~3 hours to transfer on a 55mbit connection. Assuming that speed of connection was $20,000/month, my bandwidth cost comes in at around $80
For what i'm currently getting, i'd pay ~$100 without blinking, up to $200 i'd flinch but pay it... More then that and i'd change my habits.
A $150/month bill with $80 in transfer costs would leave ~$70/month to maintain infrastructure and profits, and would hopefully put both Rogers&Myself in a win-win proposition.
[text was edited by author 2002-06-07 02:51:41]
waxmuseum
join:2002-05-29
Toronto, ON
reply to TMage
well i have decided that if for some reason my new isp decides to start with the cap crap. im going to go back to 56k dial up.
cause i wont beable to do what i got hi speed for anyway,
and what bell and rogers made me feel like i needed it for.
why dont they find out who is running ftp sites and slow them right the hell down.
or why not just have a slow down cap?
once you hit 5 gig it gets a 1/4 slower and when you hit 7 it gets even slower and so on till its next to nothing?
anyone else think thats fair?
waxmuseum
join:2002-05-29
Toronto, ON
reply to TMage
bye the way we can all thank anon tech for the caps he is an obviouse abuser and is going to cost us alot of money
TMage
join:2002-06-05
Toronto, ON
reply to waxmuseum
said by waxmuseum:
why dont they find out who is running ftp sites and slow them right the hell down.
anyone else think thats fair?
(Long Message)
I don't see FTP as the problem. Like I said, I suspect the problem is file sharing and (one I forgot about) newsgroups. Both which unfortunately consume large amounts of bandwidth. What I don't understand is why Rogers (and by extension, Bell and any other broadband ISP) doesn't actually enforce their EUA. For example...
7k of their agreement says you won't run any servers (I'd quote the entire thing, but I don't think it's necessary). They can give some flexibility for the people who are just testing software on their computer, or don't cause a load. Something I'd like to point out to the people at Rogers and everyone else...(And forgive me if I'm a little rude about it)..."GUESS WHAT PEOPLE? FILE SHARING SOFTWARE IS FORM OF SERVER SOFTWARE!" And if you're causing a serious load on the network, you're also breaking conditions 7h and 7i where you won't disrupt or interfere with the network. People who run Kazaa or Morpheus or Limewire or whatever for the hour or two a day (get in, get what you want and get out) won't necessarily be seen as a heavy load (and if they've been configured intelligently, then they can lessen the load even more). But those who run 24/7 can be cut off at the discretion of the ISP.
Newsgroups are a different issue, but can be addressed (partly) by locking out certain newsgroups (namely some ALT.BINARIES.* ... once filtered through, it takes about five minutes a day for any new newsgroups to be authorized...it also makes for some good laughs when people try to request certain newsgroups). Now, this might cause the people to access other companies' news servers, But it is a start.
The other issue is getting software to throttle people down like that. Something like that would cost quite a bit, and slowing them down won't necessarily stop them.
I've said it before, and I'll probably be quoting this when I'm old and grey....there are other methods to deal with bandwidth hogs without having to punish everyone else with a heavy hand. Unfortunately, many ISPs (and many companies I know) forget about customer service, and customer input and just make decisions arbitrarily.
waxmuseum
join:2002-05-29
Toronto, ON
reply to waxmuseum
well ftp sites can be a problem when one of yourt friends is uploading/downloading 20 gig a day
combine all the ftp losers and you have a problem
TMage
join:2002-06-05
Toronto, ON
said by waxmuseum:
well ftp sites can be a problem when one of yourt friends is uploading/downloading 20 gig a day
combine all the ftp losers and you have a problem
True, but the number of people doing that are much fewer.
As well, that server clause could be used to deal with these people too. Besides, transferring 20gigs per day...I guess they're not doing much else with their connection.
waxmuseum
join:2002-05-29
Toronto, ON
reply to waxmuseum
no they arent doing much else with there connection
i would much rather a small increase in what im paying for my dsl than to have to worry about going over my 5 gig.
if my current supplier decides to impose a cap i will be out of a job.
currently where i live i can only get dsl or cable so im pretty screwed. Guess its back to school for me, or moving | {
"url": "http://www.dslreports.com/forum/r3486703-Rogers-High-Speed-Download-Caps",
"source_domain": "www.dslreports.com",
"snapshot_id": "crawl=CC-MAIN-2014-49",
"warc_metadata": {
"Content-Length": "52365",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TDSSWJVZ5CKNW5RFGZEBTE5GNB2GQERZ",
"WARC-Concurrent-To": "<urn:uuid:7d1929df-7159-4fde-b044-90590c951dca>",
"WARC-Date": "2014-11-22T21:22:14Z",
"WARC-IP-Address": "64.91.255.98",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ODIJMSLMNT7NKNGWNG2KSJ7M5UNGNPAF",
"WARC-Record-ID": "<urn:uuid:bc8c1474-3c0a-49e9-9aff-1e092acad221>",
"WARC-Target-URI": "http://www.dslreports.com/forum/r3486703-Rogers-High-Speed-Download-Caps",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8b6aec70-c5cf-43a4-89c2-412ba0e630a9>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-23-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-49\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for November 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
16,
21,
23,
57,
61,
62,
69,
70,
71,
72,
73,
90,
91,
92,
106,
112,
116,
137,
138,
144,
145,
161,
173,
174,
206,
207,
378,
379,
740,
741,
749,
797,
798,
799,
811,
830,
846,
859,
1090,
1093,
1236,
1237,
1243,
1244,
1260,
1272,
1287,
1601,
1602,
1728,
1729,
2467,
2468,
2520,
2521,
2522,
2529,
2537,
2553,
2565,
2574,
2583,
2597,
2613,
2954,
2957,
3001,
3002,
3003,
3010,
3018,
3034,
3048,
3063,
3146,
3147,
3154,
3155,
3161,
3162,
3178,
3190,
3206,
3289,
3290,
3297,
3298,
3313,
3314,
3956,
3957,
4407,
4408,
4917,
4918,
5183,
5184,
5195,
5196,
5212,
5223,
5224,
5239,
5317,
5318,
5563,
5564,
5709,
5710,
5908,
5909,
6050,
6051,
6228,
6229,
6277,
6278,
6279,
6289,
6290,
6306,
6318,
6333,
6460,
6518,
6578,
6579,
6662,
6663,
6701,
6816,
6817,
6847,
6848,
6849,
6859,
6860,
6876,
6888,
6903,
7018,
7019,
7025,
7026,
7042,
7054,
7073,
7092,
7175,
7176,
7206,
7221,
7222,
7545,
7546,
8449,
8450,
8855,
8856,
9022,
9023,
9353,
9354,
9355,
9365,
9366,
9382,
9394,
9413,
9509,
9510,
9560,
9561,
9567,
9568,
9584,
9596,
9615,
9711,
9712,
9762,
9820,
9821,
9992,
9993,
9994,
10004,
10005,
10021,
10033,
10052,
10104,
10105,
10220,
10221,
10292,
10293
],
"line_end_idx": [
16,
21,
23,
57,
61,
62,
69,
70,
71,
72,
73,
90,
91,
92,
106,
112,
116,
137,
138,
144,
145,
161,
173,
174,
206,
207,
378,
379,
740,
741,
749,
797,
798,
799,
811,
830,
846,
859,
1090,
1093,
1236,
1237,
1243,
1244,
1260,
1272,
1287,
1601,
1602,
1728,
1729,
2467,
2468,
2520,
2521,
2522,
2529,
2537,
2553,
2565,
2574,
2583,
2597,
2613,
2954,
2957,
3001,
3002,
3003,
3010,
3018,
3034,
3048,
3063,
3146,
3147,
3154,
3155,
3161,
3162,
3178,
3190,
3206,
3289,
3290,
3297,
3298,
3313,
3314,
3956,
3957,
4407,
4408,
4917,
4918,
5183,
5184,
5195,
5196,
5212,
5223,
5224,
5239,
5317,
5318,
5563,
5564,
5709,
5710,
5908,
5909,
6050,
6051,
6228,
6229,
6277,
6278,
6279,
6289,
6290,
6306,
6318,
6333,
6460,
6518,
6578,
6579,
6662,
6663,
6701,
6816,
6817,
6847,
6848,
6849,
6859,
6860,
6876,
6888,
6903,
7018,
7019,
7025,
7026,
7042,
7054,
7073,
7092,
7175,
7176,
7206,
7221,
7222,
7545,
7546,
8449,
8450,
8855,
8856,
9022,
9023,
9353,
9354,
9355,
9365,
9366,
9382,
9394,
9413,
9509,
9510,
9560,
9561,
9567,
9568,
9584,
9596,
9615,
9711,
9712,
9762,
9820,
9821,
9992,
9993,
9994,
10004,
10005,
10021,
10033,
10052,
10104,
10105,
10220,
10221,
10292,
10293,
10408
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 10408,
"ccnet_original_nlines": 197,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4403945207595825,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0398799292743206,
"rps_doc_frac_lines_end_with_ellipsis": 0.04040404036641121,
"rps_doc_frac_no_alph_words": 0.1976843923330307,
"rps_doc_frac_unique_words": 0.3655555546283722,
"rps_doc_mean_word_length": 4.481666564941406,
"rps_doc_num_sentences": 103,
"rps_doc_symbol_to_word_ratio": 0.009433959610760212,
"rps_doc_unigram_entropy": 5.805007457733154,
"rps_doc_word_count": 1800,
"rps_doc_frac_chars_dupe_10grams": 0.06396429985761642,
"rps_doc_frac_chars_dupe_5grams": 0.11367298662662506,
"rps_doc_frac_chars_dupe_6grams": 0.10078095644712448,
"rps_doc_frac_chars_dupe_7grams": 0.08466591686010361,
"rps_doc_frac_chars_dupe_8grams": 0.06396429985761642,
"rps_doc_frac_chars_dupe_9grams": 0.06396429985761642,
"rps_doc_frac_chars_top_2gram": 0.01115655992180109,
"rps_doc_frac_chars_top_3gram": 0.007809590082615614,
"rps_doc_frac_chars_top_4gram": 0.01190032996237278,
"rps_doc_books_importance": -1017.5042724609375,
"rps_doc_books_importance_length_correction": -1017.5042724609375,
"rps_doc_openwebtext_importance": -505.701416015625,
"rps_doc_openwebtext_importance_length_correction": -505.701416015625,
"rps_doc_wikipedia_importance": -418.86773681640625,
"rps_doc_wikipedia_importance_length_correction": -418.86773681640625
},
"fasttext": {
"dclm": 0.4245889186859131,
"english": 0.9654778838157654,
"fineweb_edu_approx": 1.297499179840088,
"eai_general_math": 0.1458449363708496,
"eai_open_web_math": 0.211713969707489,
"eai_web_code": 0.06918936967849731
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "384.76",
"labels": {
"level_1": "Social sciences",
"level_2": "Commerce and Communication and traffic",
"level_3": "Telecommunication"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-1,868,878,104,222,645,800 | How to Search for Messages on WeChat
If you’ve already downloaded and installed the WeChat app, and have learned how to use WeChat, you may be wondering how to use WeChat to search for something you need, such as a message, a contact, or a Moment, or search for an official WeChat account. Searching on WeChat is easy, and we’ll show you exactly how to do it below.
To search on WeChat:
1. Launch the WeChat app and sign into your account.
2. From any of the main menu screens (Chats, Contacts, Discover, and Me), tap the magnifying glass icon at the top-right of the screen.
3. Type your search query in the box labelled “Search” using your keyboard.
4. Tap on any result as it appears to access it.
Do you want a little more information? Our detailed instructions below can help you with each step of the way. We’ve even got pictures for you so you don’t miss anything!
Detailed Instructions for how to search on WeChat
1. Launch the WeChat app, sign into your account, and access any main menu.
Tap the WeChat icon on your device’s home screen to launch the app. From there, make sure you are signed into your account. Access any main menu by tapping on it, choosing from Chats, Contacts, Discover, and Me. The menu you choose does not affect the search results you get.
WeChat main menus
2. Begin a search within the app.
Tap the magnifying glass icon at the top right of any of these screens to begin a search.
WeChat search function
3. Using your keyboard, type your search query and look through results as they appear on the screen.
Using the keyword(s) you type, WeChat will search through all of the data on your app, helping you quickly find contacts or messages you’re looking for.
Type keyword searches into WeChat
4. Tap on any result as it appears to access that item within the app.
This will give you details about the item, helping you find it in the app, or will take you directly to what you are looking for.
WeChat search results
And that’s how you search on WeChat. Before typing any words into the search bar, you can also tap on the icons listed to make your search more specific, choosing from Moments, Articles, or Official Accounts.
Filter WeChat search results
Congrats! You’ve now learnt how to search for anything you want on the WeChat app! To learn more about all of the great things you can do with WeChat, consider checking out our other step-by-step tutorial on how to use WeChat.
How to Delete WeChat Messages
Now that you have downloaded and installed WeChat, and you’ve learned all about how to use the app, you may be wondering how to delete your WeChat messages, especially if your chat page is overloaded with messages. In this tutorial we’ll explain how to delete messages, and how to clear your chat history.
Remember that if you delete messages, they are only deleted from your own personal device, not the devices of other users you were talking with. So always think carefully before you send!
To delete WeChat messages:
1. Tap the WeChat icon on your mobile device to launch the app.
2. Ensure you are signed into your personal account.
3. Find the message you want to delete in a conversation, from either your Chats or Contacts menu, and open it.
4. Tap the message and hold your finger down until a menu pops up.
5. Tap Delete.
Detailed Instructions for deleting WeChat messages
1. Open the WeChat app on your mobile device.
Tap the green WeChat icon on your homepage to launch the app.
WeChat app icon on device home screen
2. Sign into your personal WeChat account.
Enter your mobile phone number and password, and tap Log In, if you aren’t already signed in automatically.
WeChat log in screen
3. Find the conversation that contains the message you want to delete.
Tapping either the Chats or Contacts menu, search for the conversation you’ve had that contains the message(s) you want to delete.
Find WeChat conversation
4. Locate the message you want to delete.
Scroll through the conversation and find the message you want to delete. Make sure it is visible on the screen.
Find the message you want to delete
5. To remove the message from your history, tap and hold on the individual message, and then tap Delete.
Tap on the message and hold your finger down until a menu pops up on the screen. Remove your finger, and tap Delete.
Tap on message to delete
Your message is now deleted! You can do this as often as you like, but you will need to do it individually! If you want to delete more messages at once, read below.
To delete WeChat conversations:
1. Tap the WeChat icon on your mobile device to launch the app.
2. Sign into your account.
3. Find the conversation you want to delete by tapping the Chats menu, and scroll until you locate the chat. Make it visible on the screen.
4. Tap the conversation and hold your finger down until a menu pops up.
5. Tap Delete.
Delete WeChat conversation
To clear your WeChat chat history:
1. Launch the WeChat app on your mobile device.
2. Sign into your account.
3. Tap Me on the menu at the bottom of the screen.
4. Tap Settings.
5. Tap Chat from the categories of available settings.
6. Tap Clear Chat History.
7. On the pop-up window, confirm you want to delete your chat history by tapping Clear.
Clear WeChat chat history
And that’s how you delete WeChat messages. If you want to learn more about how to become a WeChat pro, check out our other step-by-step tutorials on how to search old messages, and how to use WeChat. If you’re looking to delete WeChat for good, check out our article on how to delete your account.
How to Use WeChat
Now that you’ve signed up for your own WeChat account, you’re probably ready to start using WeChat to send messages. In this tutorial, we’ll break down all the functions of the app, and explain each feature step-by-step (with pictures!), so you can get started sending messages to your loved ones, all over the world.
Before we begin, make sure you have downloaded and installed the app. If not, give our step-by-step tutorial on how to download the WeChat app a quick read first.
How to use WeChat
To sign in to your WeChat account:
1. Using your mobile device, tap the WeChat icon on your home screen to launch the app.
2. On the first screen, tap Log In.
3. Tap the box labelled “Enter Password,” as your mobile number will already be at the top of the screen.
4. Using your on-screen keyboard, type your password.
5. Tap Log In.
WeChat sign in screen
When using WeChat, there is a main menu that always runs along the bottom of your screen. Your tap-able options are Chats, Contacts, Discover, and Me. Use these functions to navigate through WeChat as you follow our tutorial.
WeChat main menu
Add Contacts
Adding contacts is the first step to using WeChat as your go-to messenger. When you sign up for WeChat, the app will ask if you want to import the contacts from your mobile device. If you want to give the app permission to do this, tap Allow. However, you can also manually add contacts in a variety of ways.
Add a contact by WeChat ID or phone number
From the main screen, tap the Contacts menu. In the top right corner of the screen, tap the + symbol, and select Add Contacts from the drop-down menu.
Add WeChat contacts
Tap the box at the top labelled “WeChat ID/Phone” and use your keyboard to type a person’s mobile phone number or their unique WeChat ID number, if you know it. Tap the box labelled “Search:” to see your results. Tap the person’s name if there are multiple suggestions, and if not, simply tap the green Add button.
Add contact by WeChat ID or phone number
They will now be added to your contacts!
Scan a code
To scan a QR code, tap Contacts on the menu. Tap the + button in the top-right corner of the screen, and tap Scan QR Code from the drop-down menu.
Add contact with QR code
A window will appear on your screen with an image of a frame, and a green line will move slowly down the frame. Hold your camera up to the contact’s QR code, and ensure the entire square of their code is visible in the frame. Your camera will adjust to put their code in focus, and then show you their name on another screen when WeChat identifies them. Tap their name, and then tap Add to add them to your contacts.
QR scanning screen
Alternatively, you can also complete this process by tapping Discover on the menu, and then tapping Scan QR Code.
To make your QR code appear to other users so they can add you, tap Me, and tap the small QR icon beside your name. If you can’t find it, tap your name, and then tap My QR Code.
Show your QR code
Add tags to contacts
Once you’ve added some contacts to your WeChat, you may need to consider sorting and organizing them. One way to do this is by adding tags to their name. In the Contacts menu, tap the Tags box. Then tap Create Tag to start a new tag.
Add tags to contacts
Tap the check box beside the contact’s name who you would like to tag. You may also tap multiple names to apply to tag to multiple contacts. When you’re finished selecting, tap OK() in the top-right, which will display the number of contacts you have selected within the parenthesis.
Choose contacts to add to WeChat tag
In the box labelled “Such as Family and Friends,” type the name of the tag. When you’re finished, tap Save.
Name a tag
Once you’re started creating tags, if you tap Tags from the Contacts screen, you can see all of the tags you have. Tap on any one to see your contacts in that group, and if you want, you can delete a tag by tapping Delete Tag on the tag’s screen. If you want to create a new tag, tap New Tag in the top-right of the screen.
View tags you have created
Create contact groups
To create a group chat, tap Saved Groups on the Contacts menu page. Tap the + symbol in the top-right corner, and choose the contacts you want to add to the group. From there, you can message the contacts all simultaneously.
Create a WeChat group chat
To instant message a contact:
Sending instant messages is one of the most popular ways people utilize WeChat. It sends messages to people’s WeChat profiles, or mobile phones as text messages if they don’t. To get started, tap on any of your contacts, and tap Message.
Message WeChat contacts
If you’ve already started a conversation with them, or you want to find your previous conversations, tap the Chats menu, and then tap on the contact’s name. A window will open with all of your previous conversations. From there, just tap the blank line at the bottom of the screen to open your on-screen keyboard, and then begin typing. When you’re done, tap the green Send button.
WeChat messaging screen
People Nearby
You can also send greetings to people nearby. Tap Discover on the menu, and then tap People Nearby. If your location services are enabled, you can find people close to you, and tap their name. Then tap Send Greeting to connect with them. From there, you will be able to add them to your contacts if they respond.
See WeChat users near you
You can also choose to filter your results by tapping the Additional Options (three vertical dots) button in the top right corner, and then tapping on one of the options that appear. You can choose Females Only to display only females in your results, or Males Only to display only males. If you have selected one of these, tap View All to display all users. If you tap Greetings, you can see users who have sent you greetings, and tap on one to read and respond to it if you wish. Finally, you can tap Clear Location to remove your profile from this list.
Filter nearby search results
Remember that when using People Nearby, your profile will be visible to others for up to thirty minutes after using it. Remember to tap Clear Location if you don’t want to be visible, or simply turn off location services on your device.
To send a WeChat voice call:
1. Find a contact and tap on their name, either on the Chats or the Contacts menu.
2. Tap the + icon at the bottom-right of the screen.
3. Tap the Voice Call button.
4. Wait for your contact to answer.
5. Use the Mute button to mute your microphone, and use the Speaker button to put the call on speaker phone.
WeChat voice call
To send a WeChat video call:
1. Find a contact and tap on their name, either on the Chats or the Contacts menu.
2. Tap the + icon at the bottom-right of the screen.
3. Tap the Video Call button.
4. Wait for your contact to answer, and line your phone screen up with your face.
5. Tap Switch to Voice Call to remove the image, or Cancel to end the call.
WeChat video call
To send a voice recording:
1. Find a contact and tap on their name, either on the Chats or the Contacts menu.
2. At the bottom-left of the screen, tap the speaker icon.
3. Tap the Hold to Talk button and begin speaking.
4. When you’re done, release your finger to send the message.
5. To cancel, slide your finger up on the screen before releasing.
Send WeChat voice recording
To send a contact card or favorite memory:
Find a contact from the Chats or Contacts menu and tap on their name. Tap the + icon at the bottom-right of the screen, and then tap Contact Card to send them the information of one of your contacts (by tapping on the contact’s name on the next screen), or tap Favorites to send one of your favorite memories. Read below to learn about WeChat Moments that you can save to your profile and share with your contacts.
WeChat Moments
WeChat Moments is a way for you to share things from your life and “post” for your contacts to see, or the public – your choice! Add photos of what you do or see, and caption them. You can even save them as favorites and share them with your contacts easily through the chat.
To add a WeChat moment:
1. Tap the Discover menu.
2. Tap Moments.
3. Tap the camera icon in the top-right corner.
4. Choose Photos or Sight from the pop-up menu.
5. Select an image (or multiple images) by tapping on it, or take a photo now. When you’ve chosen your image(s), tap Done.
6. Tap “Say Something” and type a message.
7. Tap Send.
Add a WeChat moment
You can choose up to 9 images at one time to share. In addition, you can tap Share To to choose your audience, from Public (all your friends), Private (just you), Share List (choose from your groups and tags), or Do Not Share List (exclude contacts or groups you select). You can also tap Mention to tag a friend in your post. Simply tap their name (from the alphabetized list) or search for them, tap their name, and then tap OK.
Update your WeChat Profile
To update any aspect of your profile, always begin by selecting Me from the bottom menu, and then tapping on your name at the top of the screen.
WeChat personal profile page
To add or change your WeChat profile picture:
1. Tap Me, followed by your name at the top of the screen.
2. Tap Profile Photo.
3. Choose from the images stored on your mobile device, which are sorted from newest to oldest.
4. Tap a photo to select it, or tap Take Photo to take a new photo now.
5. Tap the frame and move it around the screen to crop the image.
6. Tap OK.
To change your profile information and WeChat ID:
After tapping Me on the main menu, followed by your name at the top of the screen, you can tap various options on your profile page. To change how your name appears, tap Name, type a new name, and tap Save.
Add information to WeChat profile
Tap What’s Up to enter a current status of what you’re doing, that will be visible to all other users who find you. Tap Save when you’re finished.
Add status to WeChat profile
You can also select a Region, or update your Gender from this screen, as well as add a WeChat ID. Choose any unique ID (that no other users has), and select carefully, as you can only set your WeChat ID one time – it can never be changed! Make sure it is easy to remember as well, as you can tell people this ID to have them add you easily to their contacts. Tap Save when you’re finished.
Update WeChat profile information
You will also be able to now log in to WeChat using this ID number and your password, meaning you can access your profile on other devices!
How to favorite WeChat messages or Moments, and access them:
1. Find the message or Moment you want to favorite in your chats or your posts.
2. Tap and hold your finger on the item until more options appear.
3. Tap Favorite on the pop-up menu to save the item to your Favorites.
4. To find your favorites, tap the Me menu, then tap Favorites.
5. Tap on any one to access it.
Add and access favorite messages or WeChat Moments
From the Favorites screen, you can also tap the + button in the top-right corner to compose and save notes for yourself. Simply type a note and tap Save. These will appear in your favorites, along with messages and Moments posts.
To change WeChat Settings:
Tap Me on the bottom menu, and then tap Settings. Choose from categories such as Notifications, Chat, or Privacy by tapping on them. On the page that opens, tap on any toggle to enable or disable a feature. If a toggle is green and pushed right, the feature is enabled. If it is grey and pushed left, it is disabled.
Below are the following categories you can choose from, and examples of settings you can change while in that category:
• Notifications – Choose how and when you want to be alerted of new messages, and whether sound or vibrations will be part of the notifications.
• Do Not Disturb – Choose hours to disable notifications.
• Chat – Features of the chat such as pressing the “Enter” key to send messages faster, adding backgrounds, your Stickers, and your chat history and log settings.
• Privacy – Decide how other users can find you, how to connect with others using the app, who to share Moments with, and block unfriendly users.
• General – Choose display settings including text size, data usage settings, enable NFC (near field communication), and your language preferences.
• My Account – View information including your WeChat ID, display name, phone number, email, and Facebook account, set up a Voiceprint password, change your password, delete your account, or resolve security issues such as resetting your password.
• Like us on Facebook – Will open a browser tab to like the WeChat Facebook profile.
• Follow us on Twitter – Will open a browser tab to like the WeChat Twitter feed.
WeChat settings categories
WeChat Shake
WeChat Shake is a feature that allows you to connect with users all over the world who are “shaking” at the same time as you. To use WeChat Shake:
1. Tap Discover on the menu at the bottom of the screen.
2. Tap Shake (and ensure location services are enabled).
3. Holding your device, shake it from left to right vigorously. You will hear a noise, indicating it is working.
4. A list of users shaking at the same time, and how far away they are from you will appear.
WeChat Shake
You may receive greetings from these users, and you can choose to respond to them. To see your greetings, tap X New Greetings immediately after shaking, or tap the gear icon in the top-right corner, followed by Greetings. Tap a greeting, and then tap Accept if you want to add them as a contact.
Download WeChat stickers
Tap Me on the bottom menu, followed by Sticker Gallery. View trending and popular packages of stickers you can add to your chats, and if you find one you like, tap Download. You can tap the magnifying glass icon to search for specific stickers.
Download WeChat stickers
Log out of WeChat
To sign out of your account, simply tap Me on the bottom menu, followed by Settings. At the bottom of the screen, tap Log Out. You will be asked if you really want to sign out, and if you do, tap Log Out again. If you want to use WeChat on this device again, you will need to sign in with your password.
Log out of WeChat
And that’s how you use WeChat! If you want to learn more about this communication app, our WeChat course we’ve got you covered with more great step-by-step tutorials including how to delete messages, how to search old messages, and we can tell you all about the other great messaging apps like WeChat.
How to Create a WeChat Account to Send Messages
Congrats! You now know what WeChat is, and you’ve downloaded and installed the app, you are ready to create your own WeChat account. In this tutorial, we’ll explain the process step-by-step, so you can create a new account today, and start messaging in just a few minutes!
To create a WeChat account:
1. Tap the WeChat icon to launch the app.
2. Tap Sign Up.
3. Tap in the box labelled “Full Name” and enter your name.
4. Tap in the box labelled “Phone Number” and enter your mobile number.
5. Tap in the box labelled “Password” and create a password.
6. Tap Sign Up.
7. Wait for WeChat to confirm your phone number by SMS message, which will happen automatically.
If that was a little too fast for you and you need a bit more instruction, check out our step-by-step instructions below (with pictures) so you don’t miss a beat!
Detailed instructions for how to create a WeChat account
1. Launch the WeChat app and indicate you want to create an account.
Launch the app by tapping the WeChat icon on your home screen. When it opens, tap the white Sign Up button in the bottom-right corner of the screen.
Launch WeChat app to sign up
2. Enter your personal information including name and phone number, and create a secure password for your account.
In the labelled boxes, enter the information required. Tap the “Full Name” box and enter your name, and tap the “Phone Number” box to enter your mobile phone number. Then tap the “Password” box to create a password for your account.
WeChat sign up form
3. Tap the green Sign Up button.
When you’re finished and have double-checked that all your information is correct, tap the green Sign Up button at the bottom of the screen.
Create a WeChat account
4. Wait for WeChat to send you an SMS message to verify your phone number.
WeChat will send a text message to your mobile phone now, verifying the number you entered was correct. This process will happen automatically, as WeChat can detect if you received the message on your device. The process should take less than a minute, so if it takes longer, check the number you entered again.
Verify phone number for WeChat
And that’s how you create a new WeChat account! Check out our next tutorial on how to use WeChat, so you can become a WeChat pro today!
How to Download and Install WeChat
Now that you know a little bit about what WeChat is and how it works, and you’ve read our review of WeChat to determine if it’s the right app for you, you may be ready to start using it as your messaging service. To do this, the first step is to download the app. In this article, we’ll lay it out for you step-by-step, so you can start using WeChat today!
To download and install WeChat:
1. Using your Android or Apple device, tap the Play Store/App Store to open it.
2. Tap the search bar, and use your on-screen keyboard to type “WeChat,” and then tap the search icon.
3. Tap the first box that appears.
4. Tap Install.
5. Wait for the app to download and install, and then click Open to launch the app.
Do you need a little more detail than that? If so, read below where we’ve broken each step down for you, and added some screenshots to help you out. For this tutorial, we’ll be using an Android device, but the process is very similar with an Apple device.
Detailed instructions for downloading and installing WeChat
1. Using your device, open the Play Store (Android) or App Store (Apple) by tapping the icon on your screen.
Tap the icon for your app store on your home screen to launch it. As long as you are using an Apple or Android device such as a smartphone or tablet, you will be able to find and download the app in your app store.
Open Play Store on device
2. Tap the search bar and type “WeChat.” Tap the search icon on your on-screen keyboard to begin the search. Then, tap the first box that appears.
Be sure your search includes “WeChat” with no typos, as you could return results for other less reputable messaging services if you make a mistake. As you’re searching be sure to look for a green icon with two speech bubbles. That is the WeChat logo!
Search for WeChat app in Play Store
3. Tap the Install button (or Get and then Install for Apple).
You are now installing the app. Simply wait for the download to complete and then you can start using the app right away!
Download and install the WeChat app
And that’s how you complete your WeChat download! When you’re finished, if you want to launch the app, simply click Open in the app store, or click the WeChat icon on the home screen of your device. If you’re ready to start using the app, be sure to check out our next tutorial on how to create an account. | {
"url": "https://techboomers.com/tutorial-sets/how-to-use-wechat",
"source_domain": "techboomers.com",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "277269",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NYTS4YLXBKNHIS4CM4FVEIT5KYV3YX42",
"WARC-Concurrent-To": "<urn:uuid:84a784cc-6a15-42b8-9027-3d73b6defe1b>",
"WARC-Date": "2018-03-19T12:18:14Z",
"WARC-IP-Address": "35.196.104.31",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MM7IDWWBZ2CKFIFTGUUBE7UUTSO6S5KU",
"WARC-Record-ID": "<urn:uuid:595679b7-2e19-4732-8f1f-dbfc7e3ab904>",
"WARC-Target-URI": "https://techboomers.com/tutorial-sets/how-to-use-wechat",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c79b9ce4-f966-425c-8245-0dad19ba1128>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-228-204-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"
} | {
"line_start_idx": [
0,
37,
38,
367,
368,
389,
390,
445,
583,
661,
712,
713,
884,
885,
935,
936,
1012,
1013,
1289,
1290,
1308,
1309,
1343,
1344,
1434,
1435,
1458,
1459,
1561,
1562,
1715,
1716,
1750,
1751,
1822,
1823,
1953,
1954,
1976,
1977,
2186,
2187,
2216,
2217,
2219,
2220,
2447,
2448,
2449,
2479,
2480,
2786,
2787,
2975,
2976,
3003,
3004,
3070,
3125,
3239,
3308,
3325,
3326,
3377,
3378,
3424,
3425,
3487,
3488,
3526,
3527,
3570,
3571,
3679,
3680,
3701,
3702,
3773,
3774,
3905,
3906,
3931,
3932,
3974,
3975,
4087,
4088,
4124,
4125,
4230,
4231,
4348,
4349,
4374,
4375,
4540,
4541,
4573,
4574,
4640,
4669,
4811,
4885,
4902,
4903,
4930,
4931,
4966,
4967,
5017,
5046,
5099,
5118,
5175,
5204,
5294,
5295,
5321,
5322,
5324,
5325,
5623,
5624,
5625,
5643,
5644,
5962,
5963,
6126,
6127,
6145,
6146,
6181,
6182,
6272,
6310,
6418,
6474,
6491,
6492,
6514,
6515,
6741,
6742,
6759,
6760,
6773,
6774,
7083,
7084,
7127,
7128,
7279,
7280,
7300,
7301,
7616,
7617,
7658,
7659,
7700,
7701,
7713,
7714,
7861,
7862,
7887,
7888,
8305,
8306,
8325,
8326,
8440,
8441,
8619,
8620,
8638,
8639,
8660,
8661,
8895,
8896,
8917,
8918,
9202,
9203,
9240,
9241,
9349,
9350,
9361,
9362,
9686,
9687,
9714,
9715,
9737,
9738,
9963,
9964,
9991,
9992,
10022,
10023,
10261,
10262,
10286,
10287,
10669,
10670,
10694,
10695,
10709,
10710,
11023,
11024,
11050,
11051,
11608,
11609,
11638,
11639,
11878,
11879,
11908,
11909,
11994,
12049,
12081,
12119,
12230,
12231,
12249,
12250,
12279,
12280,
12365,
12420,
12452,
12536,
12614,
12615,
12633,
12634,
12661,
12662,
12747,
12808,
12861,
12925,
12994,
12995,
13023,
13024,
13067,
13068,
13483,
13484,
13499,
13500,
13776,
13777,
13801,
13802,
13830,
13848,
13898,
13948,
14073,
14118,
14133,
14134,
14154,
14155,
14586,
14587,
14614,
14615,
14760,
14761,
14790,
14791,
14837,
14838,
14899,
14923,
15021,
15095,
15163,
15176,
15177,
15227,
15228,
15435,
15436,
15470,
15471,
15618,
15619,
15648,
15649,
16039,
16040,
16074,
16075,
16215,
16216,
16277,
16278,
16360,
16429,
16502,
16568,
16602,
16603,
16654,
16655,
16885,
16886,
16913,
16914,
17231,
17232,
17352,
17353,
17500,
17560,
17725,
17873,
18023,
18273,
18360,
18444,
18445,
18472,
18473,
18486,
18487,
18634,
18635,
18694,
18753,
18868,
18963,
18964,
18977,
18978,
19274,
19275,
19300,
19301,
19546,
19547,
19572,
19573,
19591,
19592,
19896,
19897,
19915,
19916,
19918,
19919,
20221,
20222,
20223,
20271,
20272,
20545,
20546,
20574,
20575,
20619,
20637,
20699,
20773,
20836,
20854,
20953,
20954,
21117,
21118,
21175,
21176,
21245,
21246,
21395,
21396,
21425,
21426,
21541,
21542,
21775,
21776,
21796,
21797,
21830,
21831,
21972,
21973,
21997,
21998,
22073,
22074,
22386,
22387,
22418,
22419,
22421,
22422,
22558,
22559,
22560,
22595,
22596,
22953,
22954,
22986,
22987,
23069,
23174,
23211,
23229,
23315,
23316,
23572,
23573,
23633,
23634,
23743,
23744,
23959,
23960,
23986,
23987,
24134,
24135,
24386,
24387,
24423,
24424,
24487,
24488,
24610,
24611,
24647,
24648,
24650,
24651
],
"line_end_idx": [
37,
38,
367,
368,
389,
390,
445,
583,
661,
712,
713,
884,
885,
935,
936,
1012,
1013,
1289,
1290,
1308,
1309,
1343,
1344,
1434,
1435,
1458,
1459,
1561,
1562,
1715,
1716,
1750,
1751,
1822,
1823,
1953,
1954,
1976,
1977,
2186,
2187,
2216,
2217,
2219,
2220,
2447,
2448,
2449,
2479,
2480,
2786,
2787,
2975,
2976,
3003,
3004,
3070,
3125,
3239,
3308,
3325,
3326,
3377,
3378,
3424,
3425,
3487,
3488,
3526,
3527,
3570,
3571,
3679,
3680,
3701,
3702,
3773,
3774,
3905,
3906,
3931,
3932,
3974,
3975,
4087,
4088,
4124,
4125,
4230,
4231,
4348,
4349,
4374,
4375,
4540,
4541,
4573,
4574,
4640,
4669,
4811,
4885,
4902,
4903,
4930,
4931,
4966,
4967,
5017,
5046,
5099,
5118,
5175,
5204,
5294,
5295,
5321,
5322,
5324,
5325,
5623,
5624,
5625,
5643,
5644,
5962,
5963,
6126,
6127,
6145,
6146,
6181,
6182,
6272,
6310,
6418,
6474,
6491,
6492,
6514,
6515,
6741,
6742,
6759,
6760,
6773,
6774,
7083,
7084,
7127,
7128,
7279,
7280,
7300,
7301,
7616,
7617,
7658,
7659,
7700,
7701,
7713,
7714,
7861,
7862,
7887,
7888,
8305,
8306,
8325,
8326,
8440,
8441,
8619,
8620,
8638,
8639,
8660,
8661,
8895,
8896,
8917,
8918,
9202,
9203,
9240,
9241,
9349,
9350,
9361,
9362,
9686,
9687,
9714,
9715,
9737,
9738,
9963,
9964,
9991,
9992,
10022,
10023,
10261,
10262,
10286,
10287,
10669,
10670,
10694,
10695,
10709,
10710,
11023,
11024,
11050,
11051,
11608,
11609,
11638,
11639,
11878,
11879,
11908,
11909,
11994,
12049,
12081,
12119,
12230,
12231,
12249,
12250,
12279,
12280,
12365,
12420,
12452,
12536,
12614,
12615,
12633,
12634,
12661,
12662,
12747,
12808,
12861,
12925,
12994,
12995,
13023,
13024,
13067,
13068,
13483,
13484,
13499,
13500,
13776,
13777,
13801,
13802,
13830,
13848,
13898,
13948,
14073,
14118,
14133,
14134,
14154,
14155,
14586,
14587,
14614,
14615,
14760,
14761,
14790,
14791,
14837,
14838,
14899,
14923,
15021,
15095,
15163,
15176,
15177,
15227,
15228,
15435,
15436,
15470,
15471,
15618,
15619,
15648,
15649,
16039,
16040,
16074,
16075,
16215,
16216,
16277,
16278,
16360,
16429,
16502,
16568,
16602,
16603,
16654,
16655,
16885,
16886,
16913,
16914,
17231,
17232,
17352,
17353,
17500,
17560,
17725,
17873,
18023,
18273,
18360,
18444,
18445,
18472,
18473,
18486,
18487,
18634,
18635,
18694,
18753,
18868,
18963,
18964,
18977,
18978,
19274,
19275,
19300,
19301,
19546,
19547,
19572,
19573,
19591,
19592,
19896,
19897,
19915,
19916,
19918,
19919,
20221,
20222,
20223,
20271,
20272,
20545,
20546,
20574,
20575,
20619,
20637,
20699,
20773,
20836,
20854,
20953,
20954,
21117,
21118,
21175,
21176,
21245,
21246,
21395,
21396,
21425,
21426,
21541,
21542,
21775,
21776,
21796,
21797,
21830,
21831,
21972,
21973,
21997,
21998,
22073,
22074,
22386,
22387,
22418,
22419,
22421,
22422,
22558,
22559,
22560,
22595,
22596,
22953,
22954,
22986,
22987,
23069,
23174,
23211,
23229,
23315,
23316,
23572,
23573,
23633,
23634,
23743,
23744,
23959,
23960,
23986,
23987,
24134,
24135,
24386,
24387,
24423,
24424,
24487,
24488,
24610,
24611,
24647,
24648,
24650,
24651,
24958
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 24958,
"ccnet_original_nlines": 448,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41529953479766846,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005714289844036102,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16663594543933868,
"rps_doc_frac_unique_words": 0.1404283493757248,
"rps_doc_mean_word_length": 4.268270969390869,
"rps_doc_num_sentences": 362,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.268774509429932,
"rps_doc_word_count": 4529,
"rps_doc_frac_chars_dupe_10grams": 0.038849521428346634,
"rps_doc_frac_chars_dupe_5grams": 0.18115979433059692,
"rps_doc_frac_chars_dupe_6grams": 0.12239407747983932,
"rps_doc_frac_chars_dupe_7grams": 0.08432052284479141,
"rps_doc_frac_chars_dupe_8grams": 0.059024371206760406,
"rps_doc_frac_chars_dupe_9grams": 0.051419999450445175,
"rps_doc_frac_chars_top_2gram": 0.01676063984632492,
"rps_doc_frac_chars_top_3gram": 0.010242619551718235,
"rps_doc_frac_chars_top_4gram": 0.006983600091189146,
"rps_doc_books_importance": -2480.87646484375,
"rps_doc_books_importance_length_correction": -2480.87646484375,
"rps_doc_openwebtext_importance": -1510.012451171875,
"rps_doc_openwebtext_importance_length_correction": -1510.012451171875,
"rps_doc_wikipedia_importance": -1169.41845703125,
"rps_doc_wikipedia_importance_length_correction": -1169.41845703125
},
"fasttext": {
"dclm": 0.027234550565481186,
"english": 0.8993597030639648,
"fineweb_edu_approx": 1.2256697416305542,
"eai_general_math": 0.007390500046312809,
"eai_open_web_math": 0.04383474960923195,
"eai_web_code": 0.02048617973923683
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-7,596,093,119,679,564,000 | Terminology
O Goireasan Akerbeltz
Jump to navigation Jump to search
Here are short explanations for some of the geek speak you are likely to encounter:
Bug
No, not an insect. A bug is basically something in a program that's not working as it should. Often leads to a bug report and bug fixing.
Locale
That's your language, plus a bit of extra info. Not all languages are locales and vice versa. For example, French is one language but it usually comes marked as fr-CA and fr-FR. That's because something that applies in Canada (CA) might not apply in France (FR). The currency for example, so if you're software is aiming at Canada, you want CA$, not €.
Chinese usually comes as two locales but covering just the one language. Usually you'll get zh-TW and zh-HANS (or something like that). Both are for the language Mandarin but essentially (currency and suchlike aside) they cover the differences in the writing system: the long character forms used in Taiwan and Hong Kong (e.g. 中國) and the abbreviated forms (e.g. 中国) used in Mainland China. But both are pronounced zhōngguó.
Then there's other stuff that is linked to your language and country, things like the date formats (month before day or day before month), what separates digits (1,000 or 1.000), whether to use 24 hour clock or AM/PM and so on. It can get quite elaborate but you don't have to compose War and Peace, most are quite simple.
So, in software terms, your language will usually be referred to as a locale.
Localization
Often abbreviated l10n (don't ask why), the first letter being an L. To you and me, translation. A new word was coined because when you translate software, it's not just translation. Other things get involved, like setting the right codes which tell the software what language its in, picking search engines which are right for your language, changes number settings (for example, does your language use a comma or dot as a separator between thousands: 1,000 or 1.000?). Stuff like that.
l10n for Humans
Basics - Projects - Gear - Terminology - Other neat stuff | {
"url": "https://akerbeltz.org/index.php?title=Terminology&oldid=1535",
"source_domain": "akerbeltz.org",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "17547",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WGLQF332RYGDSUZ2OMZYXFNASLKLIQVH",
"WARC-Concurrent-To": "<urn:uuid:008786af-9e35-4015-aa37-dc14e85f48d3>",
"WARC-Date": "2022-12-08T05:27:16Z",
"WARC-IP-Address": "217.160.0.67",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KFS2NADUAYB7Y4YZEDD6CWTMV5U6LEEY",
"WARC-Record-ID": "<urn:uuid:dfca8312-446d-487c-9fa3-9e6d534393d0>",
"WARC-Target-URI": "https://akerbeltz.org/index.php?title=Terminology&oldid=1535",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e880d38f-0a50-42a2-820d-68834c2b7522>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-146\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
12,
13,
35,
69,
70,
154,
155,
159,
160,
298,
299,
306,
307,
660,
661,
1086,
1087,
1410,
1411,
1489,
1490,
1503,
1504,
1992,
1993,
2009
],
"line_end_idx": [
12,
13,
35,
69,
70,
154,
155,
159,
160,
298,
299,
306,
307,
660,
661,
1086,
1087,
1410,
1411,
1489,
1490,
1503,
1504,
1992,
1993,
2009,
2066
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2066,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4247787594795227,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028761060908436775,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2057522088289261,
"rps_doc_frac_unique_words": 0.5470085740089417,
"rps_doc_mean_word_length": 4.592592716217041,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.946598052978516,
"rps_doc_word_count": 351,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03722083941102028,
"rps_doc_frac_chars_top_3gram": 0.012406949885189533,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -205.7802734375,
"rps_doc_books_importance_length_correction": -205.7802734375,
"rps_doc_openwebtext_importance": -123.6976089477539,
"rps_doc_openwebtext_importance_length_correction": -123.6976089477539,
"rps_doc_wikipedia_importance": -94.23585510253906,
"rps_doc_wikipedia_importance_length_correction": -94.23585510253906
},
"fasttext": {
"dclm": 0.959989607334137,
"english": 0.9410218000411987,
"fineweb_edu_approx": 3.084564447402954,
"eai_general_math": 0.6356366276741028,
"eai_open_web_math": 0.4939553141593933,
"eai_web_code": 0.7673801779747009
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "418",
"labels": {
"level_1": "Philology; or, Language and languages",
"level_2": "Linguistics",
"level_3": "Language acquisition and Applied linguistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
2,038,970,409,748,895,000 | Take the 2-minute tour ×
Super User is a question and answer site for computer enthusiasts and power users. It's 100% free, no registration required.
I've been using CopSSH (that uses OpenSSH and Cygwin, so I don't know which of the three is the problem) as my SSH server application at home on Windows 7 Ultimate 32 bit. I have used it for about a year with no real problems, other than it sometimes takes 2 or 3 connection attempts to get through, but it's always worked within a few attempts.
A few days ago, it just stopped working. The Windows service is still running, and I've rebooted, restarted the service, etc. with no change. On the client (using Putty on Windows), I get the message "Software caused connection abort". On the server, my event viewer registers the following:
fatal: Write failed: Socket operation on non-socket
I finally got it working, but only by executing sshd.exe directly from the command line on the server. No special flags or options, just straight execution, and then when I connect remotely, it goes through.
I do have firewall and anti-virus software which appears to be configured properly, but the fact that things work when running sshd.exe also indicates that the firewall is fine.
I thought the service and executable did exactly the same thing, but apparently there's some difference. Does anyone have any ideas on where I should look for the problem?
If I can't find something, I suppose I can write a Windows service or scheduled task that fires off sshd.exe directly and ensures that it stays running, but that's kind of a last resort, since it's just wrapping around something that should already work.
I appreciate your help.
share|improve this question
FYI: Things magically started working again yesterday with no explanation why... Except now I'm still getting the "you already have a console session" error, after I connected once, disconnected, then attempted to connect again. Who knows why... – Joe Enos Jun 21 '10 at 19:26
add comment
1 Answer
up vote 0 down vote accepted
Well, this question got me the tumbleweed badge, so I guess it's a pretty good question...
I did find out that running sshd.exe directly isn't the answer - it works for normal SSH connections, but it won't let me RDP in, telling me I already have a console open and can't open another. Doesn't make sense to me, but such is life.
I think my next step is probably to dump CopSSH and try again from scratch.
share|improve this answer
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "http://superuser.com/questions/151831/unable-to-connect-to-copssh-when-running-windows-service-works-when-running-ssh",
"source_domain": "superuser.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "62985",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JATJPLFXTPUQNQ6FEUWY663IJSG4JCUF",
"WARC-Concurrent-To": "<urn:uuid:d1d99ac8-2f43-4004-8b0d-5e418577e99f>",
"WARC-Date": "2014-03-07T10:36:27Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:Q3VNREO2HFD7MVMHLPO3YR4IRK7STR3G",
"WARC-Record-ID": "<urn:uuid:45407baa-64d9-44cf-a04b-841399384b8c>",
"WARC-Target-URI": "http://superuser.com/questions/151831/unable-to-connect-to-copssh-when-running-windows-service-works-when-running-ssh",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:13add506-d24c-4680-abaa-5583fbba9eed>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
25,
150,
151,
497,
498,
790,
791,
843,
844,
1052,
1053,
1231,
1232,
1404,
1405,
1660,
1661,
1685,
1686,
1714,
1716,
1994,
2006,
2007,
2016,
2017,
2046,
2047,
2138,
2139,
2378,
2379,
2455,
2456,
2482,
2494,
2495,
2507,
2508,
2510,
2518,
2519,
2597,
2598
],
"line_end_idx": [
25,
150,
151,
497,
498,
790,
791,
843,
844,
1052,
1053,
1231,
1232,
1404,
1405,
1660,
1661,
1685,
1686,
1714,
1716,
1994,
2006,
2007,
2016,
2017,
2046,
2047,
2138,
2139,
2378,
2379,
2455,
2456,
2482,
2494,
2495,
2507,
2508,
2510,
2518,
2519,
2597,
2598,
2688
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2688,
"ccnet_original_nlines": 44,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4097222089767456,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0434027798473835,
"rps_doc_frac_lines_end_with_ellipsis": 0.02222222089767456,
"rps_doc_frac_no_alph_words": 0.1840277761220932,
"rps_doc_frac_unique_words": 0.5742357969284058,
"rps_doc_mean_word_length": 4.59825325012207,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.005208330228924751,
"rps_doc_unigram_entropy": 5.216498851776123,
"rps_doc_word_count": 458,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.008547009900212288,
"rps_doc_frac_chars_top_3gram": 0.010446339845657349,
"rps_doc_frac_chars_top_4gram": 0.018043680116534233,
"rps_doc_books_importance": -235.62461853027344,
"rps_doc_books_importance_length_correction": -235.62461853027344,
"rps_doc_openwebtext_importance": -149.36183166503906,
"rps_doc_openwebtext_importance_length_correction": -149.36183166503906,
"rps_doc_wikipedia_importance": -99.20061492919922,
"rps_doc_wikipedia_importance_length_correction": -99.20061492919922
},
"fasttext": {
"dclm": 0.3122987151145935,
"english": 0.9556728601455688,
"fineweb_edu_approx": 0.9764895439147949,
"eai_general_math": 0.026241360232234,
"eai_open_web_math": 0.19257259368896484,
"eai_web_code": 0.004131020046770573
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
1,849,305,348,951,565,300 | C#: Counting specific characters in a string
Quick and simple: –
var count = mrString.Count(x => x == '$')
.NET: Deserializing XML
Quick example of deserializing a chunk of XML into a set of classes: –
<?xml version="1.0" encoding="UTF-8"?>
<!-- Parser configuration control XML -->
<parserConfig version="1.0">
<parsers>
<!-- Test-->
<parse count="6" output="[0][3] = [5];">
<checks>
<check index="0" type="whiteSpace" />
<check index="1" type="alphaNumeric" content="test"/>
<check index="2" type="whiteSpace" />
<check index="3" type="alphaNumeric" />
<check index="4" type="separator" />
<check index="5" type="alphaNumeric" />
</checks>
</parse>
<!-- Test2-->
<parse count="4" output="[0][3]();">
<checks>
<check index="0" type="whiteSpace" />
<check index="1" type="alphaNumeric" content="test2"/>
<check index="2" type="whiteSpace" />
</checks>
</parse>
</parsers>
</parserConfig>
[Serializable()]
public class Parse
{
[XmlAttribute("count")]
public int Count { get; set; }
[XmlAttribute("output")]
public string Output { get; set; }
[XmlArray("checks")]
[XmlArrayItem("check", typeof(Check))]
public Check[] Check { get; set; }
}
[Serializable()]
public class Check
{
[XmlAttribute("index")]
public int Index { get; set; }
[XmlAttribute("type")]
public string Type { get; set; }
[XmlAttribute("content")]
public string Content { get; set; }
}
[Serializable()]
[XmlRoot("parserConfig")]
public class ParserCollection
{
[XmlArray("parsers")]
[XmlArrayItem("parse", typeof(Parse))]
public Parse[] Parse { get; set; }
}
public Parser()
{
ParserCollection config = null;
string path = "../../../config.xml";
XmlSerializer serializer = new XmlSerializer(typeof(ParserCollection));
StreamReader reader = new StreamReader(path);
config = (ParserCollection)serializer.Deserialize(reader);
reader.Close();
}
Unity: Get all scene names
Quick code snippet to grab all scene names in a project: –
public List<string> scenes;
int sceneCount = UnityEngine.SceneManagement.SceneManager.sceneCountInBuildSettings;
for (int i = 0; i < sceneCount; i++)
{
string sceneName = System.IO.Path.GetFileNameWithoutExtension(UnityEngine.SceneManagement.SceneUtility.GetScenePathByBuildIndex(i));
scenes.Add(sceneName);
Debug.Log("Scene: " + sceneName);
}
| {
"url": "https://grumpycodedude.com/2018/11/",
"source_domain": "grumpycodedude.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "66983",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6FFSNEZONSF2JBFZ5RQBVIXZCDTJ3VT7",
"WARC-Concurrent-To": "<urn:uuid:47cb581a-81a4-4c71-909f-91e3dfeacfc0>",
"WARC-Date": "2022-12-01T09:57:39Z",
"WARC-IP-Address": "192.0.78.25",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AVSUJLZRKQ2EGX757OQ67EVT5SCMIAN5",
"WARC-Record-ID": "<urn:uuid:dbd32d89-7fd9-44b2-83b6-98f20706ed3f>",
"WARC-Target-URI": "https://grumpycodedude.com/2018/11/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2a6289a7-a0d3-4e9b-8ff7-c7950fbb3ddb>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-92\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
45,
46,
66,
67,
109,
110,
112,
113,
115,
116,
140,
141,
212,
213,
252,
253,
295,
324,
325,
335,
336,
349,
390,
399,
437,
491,
529,
569,
606,
646,
656,
665,
666,
680,
717,
726,
764,
819,
857,
867,
876,
877,
888,
889,
905,
922,
941,
943,
969,
1002,
1003,
1030,
1067,
1068,
1091,
1132,
1169,
1171,
1172,
1189,
1208,
1210,
1236,
1269,
1270,
1295,
1330,
1331,
1359,
1397,
1399,
1400,
1417,
1443,
1473,
1475,
1499,
1540,
1577,
1579,
1580,
1596,
1598,
1632,
1671,
1672,
1746,
1747,
1795,
1856,
1874,
1876,
1877,
1879,
1880,
1882,
1883,
1885,
1886,
1888,
1889,
1891,
1892,
1894,
1895,
1897,
1898,
1900,
1901,
1903,
1904,
1906,
1907,
1909,
1910,
1912,
1913,
1915,
1916,
1918,
1919,
1921,
1922,
1924,
1925,
1927,
1928,
1955,
1956,
2015,
2016,
2044,
2045,
2130,
2167,
2169,
2304,
2329,
2365,
2367,
2368,
2370,
2371,
2373,
2374
],
"line_end_idx": [
45,
46,
66,
67,
109,
110,
112,
113,
115,
116,
140,
141,
212,
213,
252,
253,
295,
324,
325,
335,
336,
349,
390,
399,
437,
491,
529,
569,
606,
646,
656,
665,
666,
680,
717,
726,
764,
819,
857,
867,
876,
877,
888,
889,
905,
922,
941,
943,
969,
1002,
1003,
1030,
1067,
1068,
1091,
1132,
1169,
1171,
1172,
1189,
1208,
1210,
1236,
1269,
1270,
1295,
1330,
1331,
1359,
1397,
1399,
1400,
1417,
1443,
1473,
1475,
1499,
1540,
1577,
1579,
1580,
1596,
1598,
1632,
1671,
1672,
1746,
1747,
1795,
1856,
1874,
1876,
1877,
1879,
1880,
1882,
1883,
1885,
1886,
1888,
1889,
1891,
1892,
1894,
1895,
1897,
1898,
1900,
1901,
1903,
1904,
1906,
1907,
1909,
1910,
1912,
1913,
1915,
1916,
1918,
1919,
1921,
1922,
1924,
1925,
1927,
1928,
1955,
1956,
2015,
2016,
2044,
2045,
2130,
2167,
2169,
2304,
2329,
2365,
2367,
2368,
2370,
2371,
2373,
2374,
2375
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2375,
"ccnet_original_nlines": 145,
"rps_doc_curly_bracket": 0.010105259716510773,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.05893535912036896,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013307980261743069,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5304182767868042,
"rps_doc_frac_unique_words": 0.5247524976730347,
"rps_doc_mean_word_length": 7.841584205627441,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0.001901139970868826,
"rps_doc_unigram_entropy": 4.334671497344971,
"rps_doc_word_count": 202,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07323232293128967,
"rps_doc_frac_chars_dupe_6grams": 0.07323232293128967,
"rps_doc_frac_chars_dupe_7grams": 0.07323232293128967,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02651515044271946,
"rps_doc_frac_chars_top_3gram": 0.021464649587869644,
"rps_doc_frac_chars_top_4gram": 0.03914140909910202,
"rps_doc_books_importance": -286.416259765625,
"rps_doc_books_importance_length_correction": -286.416259765625,
"rps_doc_openwebtext_importance": -134.96875,
"rps_doc_openwebtext_importance_length_correction": -134.96875,
"rps_doc_wikipedia_importance": -123.3586654663086,
"rps_doc_wikipedia_importance_length_correction": -123.3586654663086
},
"fasttext": {
"dclm": 0.6381605863571167,
"english": 0.2655102610588074,
"fineweb_edu_approx": 3.1862144470214844,
"eai_general_math": 0.00265908008441329,
"eai_open_web_math": 0.06721199303865433,
"eai_web_code": 0.9998165965080261
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
5,494,007,414,228,780,000 | 6
My source goes like this:
<div name="something" id="something"....>IPS125</div>
the number after IPS always changes. So I need to give the identification attribute as partial text "IPS". (name and id are horribly changing every time I open source.)
3 Answers 3
6
Use contains() or starts-with() function in XPath:
Solution :
With contains():
//*[contains(@id,'IPS')]
With starts-with():
//*[starts-with(@id,'IPS')]
Where * means any element. Let me know If any query.
3
You should use xpath. If your text 'IPS' is the text inside tag use this: //*[contains(.,'IPS')].
If 'IPS' is for example part of @class atrribute use this: //*[contains(@class,'IPS')].
If 'IPS' is always at the begginig of the text you can use starts-with command instead of contains.
Unfortunately web browsers dont support Xpath 2.0 which provides regular expressions.
1
• After the edit the answer is quite simple. Use the first option from my answer: //div[contains(.,'IPS')]
– kotoj
Apr 28, 2016 at 12:25
0
I use this function with good results:
static WebElement getElementsWithAlteratingNames(String PartialName, String Tag, WebDriver driver, String Attribute) {
try {
List<WebElement> Elements = driver.findElements(By.tagName(Tag));
String[] ElementStrings = new String[Elements.size()];
System.out.println(Elements.size());
for (int LoopCounter = 0; LoopCounter < Elements.size(); LoopCounter++) {
ElementStrings[LoopCounter] = Elements.get(LoopCounter).getAttribute(Attribute).toString();
if (ElementStrings[LoopCounter].contains(PartialName)) {
System.out.println(ElementStrings[LoopCounter]);
return Elements.get(LoopCounter);
}
}
} catch (Exception e) {
System.out.println("Could not generate a list of elements");
}
return null;
}
I've kept it fairly abstract so you can easily costumize it to serve the individual needs of your wanted Element.
Update
Since the Method is just not good and throws away efficiency if made a small update that does pretty much the same:
static WebElement findElem(String Tag, String Att, String Value){
List<WebElement>Elems = driver.findElements(By.tagName(Tag));
for(WebElement Elem : Elems){
if(Elem.getAttribute(Att).contains(Value)) return Elem;
}
}
Since the code above isn't something that would pass a code review if one of my team did it I wouldn't feel good to leave it that way.
4
• what is Elemente in Elemente.get(LoopCounter).getAttribute? If you would, include import statements.
– Thufir
Jul 13, 2017 at 1:28
• Elements, it should be Elements. I guess my german broke through. I'll edit it, thanks for the heads up.
– Daniel
Jul 13, 2017 at 7:21
• That method makes me dizzy, lol.
– FDM
Jul 13, 2017 at 8:24
• That's because, looking at it now, it's just not good. static WebElement findElem(String Tag, String Att, String Value){ List<WebElement>Elems = driver.findElements(By.tagName(Tag)); for(WebElement Elem : Elems){ if(Elem.getAttribute(Att).contains(Value)) return Elem; } } is much more concise and leaves out all the useless boilerplate.
– Daniel
Jul 13, 2017 at 8:29
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "https://sqa.stackexchange.com/questions/18354/how-to-identify-element-with-knowledge-of-partial-text-for-any-tag-eg-div-span",
"source_domain": "sqa.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "184375",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BLWLHMSQYJ6JZSGJV2F53IYFBXNDAVY4",
"WARC-Concurrent-To": "<urn:uuid:4f85489c-d9aa-414b-a1aa-7fd1c29f047a>",
"WARC-Date": "2024-02-25T22:29:37Z",
"WARC-IP-Address": "104.18.43.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2I2UB533W35EFCVI32BVKTZNKDJUL5X4",
"WARC-Record-ID": "<urn:uuid:3808a54d-835e-4a8b-b303-254b4d727331>",
"WARC-Target-URI": "https://sqa.stackexchange.com/questions/18354/how-to-identify-element-with-knowledge-of-partial-text-for-any-tag-eg-div-span",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f85a885b-773f-458d-95b6-d0d50b7220dd>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-183\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
3,
29,
30,
84,
85,
254,
255,
267,
268,
270,
271,
322,
323,
334,
335,
352,
353,
378,
379,
399,
400,
428,
429,
482,
483,
485,
486,
584,
585,
673,
674,
774,
775,
861,
862,
864,
973,
985,
1011,
1013,
1014,
1053,
1054,
1177,
1187,
1261,
1324,
1369,
1451,
1555,
1624,
1689,
1739,
1753,
1763,
1764,
1792,
1861,
1867,
1884,
1886,
1887,
2001,
2002,
2009,
2010,
2126,
2127,
2194,
2261,
2299,
2367,
2376,
2384,
2385,
2520,
2521,
2523,
2628,
2641,
2666,
2775,
2788,
2813,
2850,
2860,
2885,
3227,
3240,
3265,
3266,
3278,
3279,
3395,
3396
],
"line_end_idx": [
2,
3,
29,
30,
84,
85,
254,
255,
267,
268,
270,
271,
322,
323,
334,
335,
352,
353,
378,
379,
399,
400,
428,
429,
482,
483,
485,
486,
584,
585,
673,
674,
774,
775,
861,
862,
864,
973,
985,
1011,
1013,
1014,
1053,
1054,
1177,
1187,
1261,
1324,
1369,
1451,
1555,
1624,
1689,
1739,
1753,
1763,
1764,
1792,
1861,
1867,
1884,
1886,
1887,
2001,
2002,
2009,
2010,
2126,
2127,
2194,
2261,
2299,
2367,
2376,
2384,
2385,
2520,
2521,
2523,
2628,
2641,
2666,
2775,
2788,
2813,
2850,
2860,
2885,
3227,
3240,
3265,
3266,
3278,
3279,
3395,
3396,
3486
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3486,
"ccnet_original_nlines": 96,
"rps_doc_curly_bracket": 0.005163509864360094,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2574124038219452,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025606470182538033,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.35175201296806335,
"rps_doc_frac_unique_words": 0.5694444179534912,
"rps_doc_mean_word_length": 5.706018447875977,
"rps_doc_num_sentences": 54,
"rps_doc_symbol_to_word_ratio": 0.0013477100292220712,
"rps_doc_unigram_entropy": 5.228274822235107,
"rps_doc_word_count": 432,
"rps_doc_frac_chars_dupe_10grams": 0.13630832731723785,
"rps_doc_frac_chars_dupe_5grams": 0.15091277658939362,
"rps_doc_frac_chars_dupe_6grams": 0.15091277658939362,
"rps_doc_frac_chars_dupe_7grams": 0.13630832731723785,
"rps_doc_frac_chars_dupe_8grams": 0.13630832731723785,
"rps_doc_frac_chars_dupe_9grams": 0.13630832731723785,
"rps_doc_frac_chars_top_2gram": 0.008113590069115162,
"rps_doc_frac_chars_top_3gram": 0.014604460448026657,
"rps_doc_frac_chars_top_4gram": 0.01784989982843399,
"rps_doc_books_importance": -354.8774719238281,
"rps_doc_books_importance_length_correction": -354.8774719238281,
"rps_doc_openwebtext_importance": -199.11358642578125,
"rps_doc_openwebtext_importance_length_correction": -199.11358642578125,
"rps_doc_wikipedia_importance": -110.75554656982422,
"rps_doc_wikipedia_importance_length_correction": -110.75554656982422
},
"fasttext": {
"dclm": 0.44874459505081177,
"english": 0.7130881547927856,
"fineweb_edu_approx": 1.6516996622085571,
"eai_general_math": 0.06899791955947876,
"eai_open_web_math": 0.25994789600372314,
"eai_web_code": 0.0012777999509125948
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.7",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
8,911,539,297,822,872,000 | ahmd0 ahmd0 - 9 months ago 51
C# Question
Formula to calculate average number on expanding data array
Say, if I had a final array of numbers, say:
{1, 5, 7, 2}
the average for them will be:
(1 + 5 + 7 + 2) / 4; //Or, sum of all elements, divided by their number
But what if my array is constantly growing and I need to know the current average number at an instance of time when the full array is not known yet. How do you calculate that?
Say, like when I'm trying to display current data transfer rate.
Answer Source
I would go with a simple approach for having a running total (cumulative) with a constant space complexity (1). And on request of avg, return the result which is running total/total number of item. No extended time complexity since we don't iterate array afterwards to find cumulative sum. | {
"url": "https://codedump.io/share/6FRulqSnpV2C/1/formula-to-calculate-average-number-on-expanding-data-array",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "38630",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BGNYNVZQBFDR567D54MSY62QK23CQRHK",
"WARC-Concurrent-To": "<urn:uuid:ea1628cd-22b1-4b27-9b7b-fdff8f9d9a9e>",
"WARC-Date": "2017-08-19T13:48:46Z",
"WARC-IP-Address": "84.22.103.185",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ORY7OJE2GKSW2347FGWSU5DAQXHTQ66K",
"WARC-Record-ID": "<urn:uuid:1ed03d26-4c71-4d1f-bb76-c793994255ab>",
"WARC-Target-URI": "https://codedump.io/share/6FRulqSnpV2C/1/formula-to-calculate-average-number-on-expanding-data-array",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bbeea757-0ca4-4b6c-ae2a-213830032cbe>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-178-11-99.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-34\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for August 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
30,
42,
43,
103,
104,
149,
150,
163,
164,
165,
195,
196,
268,
269,
270,
447,
448,
513,
514,
528,
529
],
"line_end_idx": [
30,
42,
43,
103,
104,
149,
150,
163,
164,
165,
195,
196,
268,
269,
270,
447,
448,
513,
514,
528,
529,
818
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 818,
"ccnet_original_nlines": 21,
"rps_doc_curly_bracket": 0.0024449899792671204,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3351351320743561,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027027029544115067,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2540540397167206,
"rps_doc_frac_unique_words": 0.6734693646430969,
"rps_doc_mean_word_length": 4.2108845710754395,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0.0054054101929068565,
"rps_doc_unigram_entropy": 4.448204040527344,
"rps_doc_word_count": 147,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04200322926044464,
"rps_doc_frac_chars_top_3gram": 0.00969304982572794,
"rps_doc_frac_chars_top_4gram": 0.012924069538712502,
"rps_doc_books_importance": -64.8990707397461,
"rps_doc_books_importance_length_correction": -64.8990707397461,
"rps_doc_openwebtext_importance": -48.29669189453125,
"rps_doc_openwebtext_importance_length_correction": -48.2447509765625,
"rps_doc_wikipedia_importance": -26.376052856445312,
"rps_doc_wikipedia_importance_length_correction": -26.376052856445312
},
"fasttext": {
"dclm": 0.9263584017753601,
"english": 0.9308353066444397,
"fineweb_edu_approx": 1.1064847707748413,
"eai_general_math": 0.9501636624336243,
"eai_open_web_math": 0.22389793395996094,
"eai_web_code": 0.1375383734703064
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-3,367,441,078,643,657,000 | Quantcast
• Ti capitano dei problemi con i tipi di file sconosciuti?
Sei in un posto giusto, ti aiuteremo a risolvere i problemi!
L’estensione Del File JKM
Se hai trovato questo sito è molto probabile che hai un problema con il file JKM. Se vuoi aprire il file JKM, oppure risolvere un altro problema riguardante questo tipo di file, leggi attentamente le informazioni fornite in questo sito web.
Informazioni sul file JKM
L’intero nome del file Produttore Popolarità
JAWS Ini Configuration Format Freedom Scientific
Che cosa è il file JKM?
File utilizzato da JAWS, un programma di lettura dello schermo che consente la funzionalità di testo a funzionalità vocale in Windows. Salva le assegnazioni di tasti che fungono da tasti di scelta rapida per interagire con il software JAWS. Può essere la mappa chiave predefinita utilizzata dal software o una mappa chiave personalizzata definita dall'utente.
I file JKM utilizzano un testo normale, formato delimitato da virgole. Memorizzano i codici hotkey ei nomi delle funzioni corrispondenti che vengono eseguiti quando vengono richiamati i tasti di scelta rapida.
I file JKM vengono modificati utilizzando Keyboard Manager, incluso in JAWS.
Come aprire il file JKM?
Il problema principale che appare al momento quando non puoi aprire il file JKM è chiaro: semplicemente non hai un’applicazione opportuna installata sul tuo dispositivo. La soluzione è molto semplice, basta selezionare e installare un programma (oppure alcuni programmi) per aprire JKM dalla lista che troverai su questo sito web. Dopo l’installazione corretta il computer dovrebbe da solo associare il software appena installato con il file JKM che non riesci ad aprire.
Programmi con quali si può aprire il file JKM
Altri problemi con il file JKM
Hai scaricato e installato correttamente uno dei programmi, però ciò nonostante il problema con l’apertura del file JKM sussiste ancora? Sono possibili ragioni diverse di una tale situazione – qui in seguito presentiamo alcune ragioni che causano la maggior parte dei problemi con i file JKM:
• Il file JKM con quale c’è un problema è danneggiato
• Il file non è stato scaricato interamente (scarica il file un’altra volta dallo stesso sito web, oppure dall’allegato della e-mail)
• Nel "Registro Windows" non esiste un’associazione corretta tra il file JKM e il programma installato per utilizzarlo
• Il file è infettato da un virus o un malware
• L’applicazione che apre il file JKM non può accedere alle risorse adeguate del computer, oppure non sono stati installati i driver necessari per poter permettere al programma di essere avviato
Trova il file | {
"url": "https://www.filetypes.it/extension/jkm",
"source_domain": "www.filetypes.it",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "23715",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CUMX5UNYHJOBAZXUG3RQ2ROS5HKU4VTC",
"WARC-Concurrent-To": "<urn:uuid:8030b5b3-f6a0-455c-ae14-c16498c534b8>",
"WARC-Date": "2021-06-20T22:31:28Z",
"WARC-IP-Address": "91.134.203.246",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UOZA3VMHBITRBF3IQSFQAFP4ST6FOVCR",
"WARC-Record-ID": "<urn:uuid:afa13f6d-f718-4c3b-91a2-7eb8e82beb5b>",
"WARC-Target-URI": "https://www.filetypes.it/extension/jkm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f269cebe-0831-4020-b617-c597c136bb99>"
},
"warc_info": "isPartOf: CC-MAIN-2021-25\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-217.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
10,
71,
72,
137,
138,
164,
165,
406,
407,
433,
434,
479,
528,
529,
553,
554,
914,
915,
1125,
1126,
1203,
1204,
1229,
1230,
1702,
1703,
1749,
1750,
1781,
1782,
2075,
2076,
2132,
2268,
2389,
2438,
2635
],
"line_end_idx": [
10,
71,
72,
137,
138,
164,
165,
406,
407,
433,
434,
479,
528,
529,
553,
554,
914,
915,
1125,
1126,
1203,
1204,
1229,
1230,
1702,
1703,
1749,
1750,
1781,
1782,
2075,
2076,
2132,
2268,
2389,
2438,
2635,
2648
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2648,
"ccnet_original_nlines": 37,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09414225816726685,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.056485358625650406,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1276150643825531,
"rps_doc_frac_unique_words": 0.5047618746757507,
"rps_doc_mean_word_length": 5.185714244842529,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.878166198730469,
"rps_doc_word_count": 420,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.054637279361486435,
"rps_doc_frac_chars_top_3gram": 0.04545455053448677,
"rps_doc_frac_chars_top_4gram": 0.027548210695385933,
"rps_doc_books_importance": -196.6474151611328,
"rps_doc_books_importance_length_correction": -196.6474151611328,
"rps_doc_openwebtext_importance": -135.54910278320312,
"rps_doc_openwebtext_importance_length_correction": -135.54910278320312,
"rps_doc_wikipedia_importance": -79.79121398925781,
"rps_doc_wikipedia_importance_length_correction": -79.79121398925781
},
"fasttext": {
"dclm": 0.36305898427963257,
"english": 0.0010295299580320716,
"fineweb_edu_approx": 1.5350341796875,
"eai_general_math": 0.00004029000047012232,
"eai_open_web_math": 0.7274301052093506,
"eai_web_code": 0.3501574993133545
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
4,490,108,239,698,644,000 | 3C資訊
手動造輪子——基於.NetCore的RPC框架DotNetCoreRpc
前言
一直以來對內部服務間使用RPC的方式調用都比較贊同,因為內部間沒有這麼多限制，最簡單明了的方式就是最合適的方式。個人比較喜歡類似Dubbo的那種使用方式，採用和本地方法相同的方式，把接口層獨立出來作為服務契約，為服務端提供服務，客戶端也通過此契約調用服務。.Net平台上類似Dubbo這種相對比較完善的RPC框架還是比較少的，GRPC確實是一款非常優秀的RPC框架，能跨語言調用，但是每次還得編寫proto文件，個人感覺還是比較麻煩的。如今服務拆分，微服務架構比較盛行的潮流下，一個簡單實用的RPC框架確實可以提升很多開發效率。
簡介
隨着.Net Core逐漸成熟穩定，為我一直以來想實現的這個目標提供了便利的方式。於是利用閑暇時間本人手寫了一套基於Asp.Net Core的RPC框架，算是實現了一個自己的小目標。大致的實現方式，Server端依賴Asp.Net Core，採用的是中間件的方式攔截處理請求比較方便。Client端可以是任何可承載.Net Core的宿主程序。通信方式是HTTP協議，使用的是HttpClientFactory。至於為什麼使用HttpClientFactory，因為HttpClientFactory可以更輕鬆的實現服務發現，而且可以很好的集成Polly，很方便的實現，超時重試，熔斷降級這些，給開發過程中提供了很多便利。由於本人能力有限，基於這些便利，站在巨人的肩膀上，簡單的實現了一個RPC框架,項目託管在GitHub上https://github.com/softlgl/DotNetCoreRpc有興趣的可以自行查閱。
開發環境
• Visual Studio 2019
• .Net Standard 2.1
• Asp.Net Core 3.1.x
使用方式
打開Visual Studio先新建一個RPC契約接口層，這裏我起的名字叫IRpcService。然後新建一個Client層(可以是任何可承載.Net Core的宿主程序)叫ClientDemo,然後建立一個Server層(必須是Asp.Net Core項目)叫WebDemo,文末附本文Demo連接,建完這些之後項目結構如下:
Client端配置
Client端引入DotNetCoreRpc.Client包，並引入自定義的契約接口層
<PackageReference Include="DotNetCoreRpc.Client" Version="1.0.2" />
然後可以愉快的編碼了，大致編碼如下
class Program
{
static void Main(string[] args)
{
IServiceCollection services = new ServiceCollection();
//*註冊DotNetCoreRpcClient核心服務
services.AddDotNetCoreRpcClient()
//*通信是基於HTTP的,內部使用的HttpClientFactory,自行註冊即可
.AddHttpClient("WebDemo", client => { client.BaseAddress = new Uri("http://localhost:13285/"); });
IServiceProvider serviceProvider = services.BuildServiceProvider();
//*獲取RpcClient使用這個類創建具體服務代理對象
RpcClient rpcClient = serviceProvider.GetRequiredService<RpcClient>();
//IPersonService是我引入的服務包interface，需要提供ServiceName,即AddHttpClient的名稱
IPersonService personService = rpcClient.CreateClient<IPersonService>("WebDemo");
PersonDto personDto = new PersonDto
{
Id = 1,
Name = "yi念之間",
Address = "中國",
BirthDay = new DateTime(2000,12,12),
IsMarried = true,
Tel = 88888888888
};
bool addFlag = personService.Add(personDto);
Console.WriteLine($"添加結果=[{addFlag}]");
var person = personService.Get(personDto.Id);
Console.WriteLine($"獲取person結果=[{person.ToJson()}]");
var persons = personService.GetAll();
Console.WriteLine($"獲取persons結果=[{persons.ToList().ToJson()}]");
personService.Delete(person.Id);
Console.WriteLine($"刪除完成");
Console.ReadLine();
}
}
到這裏Client端的代碼就編寫完成了
Server端配置
Client端引入DotNetCoreRpc.Client包，並引入自定義的契約接口層
<PackageReference Include="DotNetCoreRpc.Server" Version="1.0.2" />
然後編寫契約接口實現類，比如我的叫PersonService
//實現契約接口IPersonService
public class PersonService:IPersonService
{
private readonly ConcurrentDictionary<int, PersonDto> persons = new ConcurrentDictionary<int, PersonDto>();
public bool Add(PersonDto person)
{
return persons.TryAdd(person.Id, person);
}
public void Delete(int id)
{
persons.Remove(id,out PersonDto person);
}
//自定義Filter
[CacheFilter(CacheTime = 500)]
public PersonDto Get(int id)
{
return persons.GetValueOrDefault(id);
}
//自定義Filter
[CacheFilter(CacheTime = 300)]
public IEnumerable<PersonDto> GetAll()
{
foreach (var item in persons)
{
yield return item.Value;
}
}
}
通過上面的代碼可以看出，我自定義了Filter，這裏的Filter並非Asp.Net Core框架定義的Filter，而是DotNetCoreRpc框架定義的Filter,自定義Filter的方式如下
//*要繼承自抽象類RpcFilterAttribute
public class CacheFilterAttribute: RpcFilterAttribute
{
public int CacheTime { get; set; }
//*支持屬性注入,可以是public或者private
//*這裏的FromServices並非Asp.Net Core命名空間下的,而是來自DotNetCoreRpc.Core命名空間
[FromServices]
private RedisConfigOptions RedisConfig { get; set; }
[FromServices]
public ILogger<CacheFilterAttribute> Logger { get; set; }
public override async Task InvokeAsync(RpcContext context, RpcRequestDelegate next)
{
Logger.LogInformation($"CacheFilterAttribute Begin,CacheTime=[{CacheTime}],Class=[{context.TargetType.FullName}],Method=[{context.Method.Name}],Params=[{JsonConvert.SerializeObject(context.Parameters)}]");
await next(context);
Logger.LogInformation($"CacheFilterAttribute End,ReturnValue=[{JsonConvert.SerializeObject(context.ReturnValue)}]");
}
}
以上代碼基本上完成了對服務端業務代碼的操作,接下來我們來看如何在Asp.Net Core中配置使用DotNetCoreRpc。打開Startup,配置如下代碼既可
public class Startup
{
public void ConfigureServices(IServiceCollection services)
{
services.AddSingleton<IPersonService, PersonService>()
.AddSingleton(new RedisConfigOptions { Address = "127.0.0.1:6379", Db = 10 })
//*註冊DotNetCoreRpcServer
.AddDotNetCoreRpcServer(options => {
//*確保添加的契約服務接口事先已經被註冊到DI容器中
//添加契約接口
//options.AddService<IPersonService>();
//或添加契約接口名稱以xxx為結尾的
//options.AddService("*Service");
//或添加具體名稱為xxx的契約接口
//options.AddService("IPersonService");
//或掃描具體命名空間下的契約接口
options.AddNameSpace("IRpcService");
//可以添加全局過濾器,實現方式和CacheFilterAttribute一致
options.AddFilter<LoggerFilterAttribute>();
});
}
public void Configure(IApplicationBuilder app, IWebHostEnvironment env)
{
//這一堆可以不要+1
if (env.IsDevelopment())
{
app.UseDeveloperExceptionPage();
}
//添加DotNetCoreRpc中間件既可
app.UseDotNetCoreRpc();
//這一堆可以不要+2
app.UseRouting();
//這一堆可以不要+3
app.UseEndpoints(endpoints =>
{
endpoints.MapGet("/", async context =>
{
await context.Response.WriteAsync("Server Start!");
});
});
}
}
以上就是Server端簡單的使用和配置,是不是感覺非常的Easy。附上可運行的Demo地址，具體編碼可查看Demo.
總結
能自己實現一套RPC框架是我近期以來的一個願望,現在可以說實現了。雖然看起來沒這麼高大上，但是整體還是符合RPC的思想。主要還是想自身實地的實踐一下，順便也希望能給大家提供一些簡單的思路。不是說我說得一定是對的，我講得可能很多是不對的，但是我說的東西都是我自身的體驗和思考，也許能給你帶來一秒鐘、半秒鐘的思考，亦或是哪怕你覺得我哪一句話說的有點道理，能引發你內心的感觸，這就是我做這件事的意義。最後，歡迎大家評論區或本項目GitHub下批評指導。
歡迎掃碼關注 本站聲明:網站內容來源於博客園,如有侵權,請聯繫我們,我們將及時處理
【其他文章推薦】
※別再煩惱如何寫文案,掌握八大原則!
網頁設計一頭霧水該從何著手呢? 台北網頁設計公司幫您輕鬆架站!
※超省錢租車方案
※教你寫出一流的銷售文案?
網頁設計最專業,超強功能平台可客製化
※產品缺大量曝光嗎?你需要的是一流包裝設計! | {
"url": "https://www.3chy2.com.tw/3c%E8%B3%87%E8%A8%8A/%E6%89%8B%E5%8B%95%E9%80%A0%E8%BC%AA%E5%AD%90-%E5%9F%BA%E6%96%BC-netcore%E7%9A%84rpc%E6%A1%86%E6%9E%B6dotnetcorerpc/",
"source_domain": "www.3chy2.com.tw",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "47379",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3BZ76NFFMZSZDIP6IEXIEI7BV4L2BUWS",
"WARC-Concurrent-To": "<urn:uuid:d78b002f-e3a6-438a-be19-08257f326f05>",
"WARC-Date": "2022-01-22T02:37:44Z",
"WARC-IP-Address": "206.108.48.242",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7BUFEVX6ES2SSYOYG6I22AU4TPFGNXIF",
"WARC-Record-ID": "<urn:uuid:a66a5f15-f48c-460c-9c10-0b47841aa393>",
"WARC-Target-URI": "https://www.3chy2.com.tw/3c%E8%B3%87%E8%A8%8A/%E6%89%8B%E5%8B%95%E9%80%A0%E8%BC%AA%E5%AD%90-%E5%9F%BA%E6%96%BC-netcore%E7%9A%84rpc%E6%A1%86%E6%9E%B6dotnetcorerpc/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9d88c12a-23e5-4148-b7ea-cd951ee5495a>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-78\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
5,
6,
43,
44,
47,
48,
317,
318,
321,
322,
740,
741,
746,
747,
770,
792,
815,
816,
821,
822,
991,
992,
1002,
1003,
1047,
1048,
1116,
1117,
1135,
1136,
1150,
1152,
1188,
1194,
1257,
1294,
1336,
1388,
1495,
1496,
1572,
1610,
1689,
1690,
1766,
1856,
1857,
1901,
1911,
1931,
1959,
1987,
2036,
2066,
2096,
2107,
2108,
2161,
2209,
2210,
2264,
2326,
2327,
2373,
2446,
2447,
2488,
2524,
2525,
2553,
2559,
2561,
2562,
2582,
2583,
2593,
2594,
2638,
2639,
2707,
2708,
2739,
2740,
2763,
2805,
2807,
2919,
2957,
2963,
3013,
3019,
3020,
3051,
3057,
3106,
3112,
3113,
3129,
3164,
3197,
3203,
3249,
3255,
3256,
3272,
3307,
3350,
3356,
3394,
3404,
3441,
3451,
3457,
3459,
3460,
3561,
3562,
3591,
3645,
3647,
3686,
3687,
3720,
3790,
3809,
3866,
3867,
3886,
3948,
3949,
4037,
4043,
4257,
4286,
4411,
4417,
4419,
4420,
4502,
4503,
4524,
4526,
4589,
4595,
4658,
4744,
4777,
4822,
4862,
4863,
4884,
4936,
4937,
4969,
5015,
5016,
5047,
5099,
5100,
5130,
5179,
5180,
5232,
5288,
5300,
5306,
5307,
5383,
5389,
5409,
5442,
5452,
5497,
5507,
5508,
5539,
5571,
5572,
5592,
5618,
5619,
5639,
5677,
5687,
5738,
5752,
5820,
5836,
5848,
5854,
5856,
5857,
5916,
5917,
5920,
5921,
6149,
6150,
6192,
6193,
6202,
6203,
6222,
6223,
6255,
6256,
6265,
6266,
6280,
6281,
6300,
6301
],
"line_end_idx": [
5,
6,
43,
44,
47,
48,
317,
318,
321,
322,
740,
741,
746,
747,
770,
792,
815,
816,
821,
822,
991,
992,
1002,
1003,
1047,
1048,
1116,
1117,
1135,
1136,
1150,
1152,
1188,
1194,
1257,
1294,
1336,
1388,
1495,
1496,
1572,
1610,
1689,
1690,
1766,
1856,
1857,
1901,
1911,
1931,
1959,
1987,
2036,
2066,
2096,
2107,
2108,
2161,
2209,
2210,
2264,
2326,
2327,
2373,
2446,
2447,
2488,
2524,
2525,
2553,
2559,
2561,
2562,
2582,
2583,
2593,
2594,
2638,
2639,
2707,
2708,
2739,
2740,
2763,
2805,
2807,
2919,
2957,
2963,
3013,
3019,
3020,
3051,
3057,
3106,
3112,
3113,
3129,
3164,
3197,
3203,
3249,
3255,
3256,
3272,
3307,
3350,
3356,
3394,
3404,
3441,
3451,
3457,
3459,
3460,
3561,
3562,
3591,
3645,
3647,
3686,
3687,
3720,
3790,
3809,
3866,
3867,
3886,
3948,
3949,
4037,
4043,
4257,
4286,
4411,
4417,
4419,
4420,
4502,
4503,
4524,
4526,
4589,
4595,
4658,
4744,
4777,
4822,
4862,
4863,
4884,
4936,
4937,
4969,
5015,
5016,
5047,
5099,
5100,
5130,
5179,
5180,
5232,
5288,
5300,
5306,
5307,
5383,
5389,
5409,
5442,
5452,
5497,
5507,
5508,
5539,
5571,
5572,
5592,
5618,
5619,
5639,
5677,
5687,
5738,
5752,
5820,
5836,
5848,
5854,
5856,
5857,
5916,
5917,
5920,
5921,
6149,
6150,
6192,
6193,
6202,
6203,
6222,
6223,
6255,
6256,
6265,
6266,
6280,
6281,
6300,
6301,
6323
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6323,
"ccnet_original_nlines": 212,
"rps_doc_curly_bracket": 0.009805469773709774,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.017094019800424576,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010683760046958923,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5897436141967773,
"rps_doc_frac_unique_words": 0.7548637986183167,
"rps_doc_mean_word_length": 17.67315101623535,
"rps_doc_num_sentences": 88,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.091747760772705,
"rps_doc_word_count": 257,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.007265519816428423,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -459.1402587890625,
"rps_doc_books_importance_length_correction": -459.1402587890625,
"rps_doc_openwebtext_importance": -271.7095947265625,
"rps_doc_openwebtext_importance_length_correction": -271.7095947265625,
"rps_doc_wikipedia_importance": -193.990234375,
"rps_doc_wikipedia_importance_length_correction": -193.990234375
},
"fasttext": {
"dclm": 0.9973664283752441,
"english": 0.04977048933506012,
"fineweb_edu_approx": 3.308176279067993,
"eai_general_math": 0.08295238018035889,
"eai_open_web_math": 0.006728949956595898,
"eai_web_code": 0.949238657951355
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-9,210,708,813,793,885,000 | summaryrefslogtreecommitdiff
path: root/pages/help/2.php
diff options
context:
space:
mode:
Diffstat (limited to 'pages/help/2.php')
-rw-r--r--pages/help/2.php79
1 files changed, 79 insertions, 0 deletions
diff --git a/pages/help/2.php b/pages/help/2.php
new file mode 100644
index 0000000..5dd86c4
--- /dev/null
+++ b/pages/help/2.php
@@ -0,0 +1,79 @@
+<? /*
+ LibreSSL - CAcert web application
+ Copyright (C) 2004-2008 CAcert Inc.
+
+ This program is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; version 2 of the License.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, write to the Free Software
+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+*/ ?>
+<ul>
+ <li><a href="#whatFor"><?=_("What is it for?")?></a></li>
+ <li><a href="#whyEmails"><?=_("Why digitally sign your own emails?! (weirdo..)")?></a></li>
+ <li><a href="#freedom"><?=_("How it prepares us to protect our freedom")?></a></li>
+ <li><a href="#whyAdopt"><?=_("Why isn't it being adopted by everyone?")?></a></li>
+ <li><a href="#whyAccept"><?=_("Why is the digital signature described as 'not valid/not trusted'?")?></a></li>
+ <li><a href="#proof"><?=_("But, er, is this really proof of your email identity?")?></a></li>
+ <li><a href="#gimme"><?=_("How do I create my own digital signature?!")?></a><br></li>
+ <li><a href="#encrypt"><?=_("I can't wait to start sending encrypted emails!")?></a></li>
+ <li><a href="#notes"><?=_("Notes for the strangely curious")?></a></li>
+ <li><a href="#refs"><?=_("References")?></a></li>
+</ul>
+<br>
+<h3><a name="whatFor"></a><?=_("What is it for?")?></h3>
+<p><?=_("The purpose of digital signing is to prove, electronically, one's identity")?>. <?=_("You see this all the time on the Internet - every time you go to a secure page on a web site, for example to enter personal details, or to make a purchase, every day you browse web sites that have been digitally signed by a Certificate Authority that is accepted as having the authority to sign it. This is all invisible to the user, except that you may be aware that you are entering a secure zone (e.g. SSL and HTTPS).")?></p>
+<p><?=_("Your browser includes special digital (root) certificates from a number of these 'Certificate Authorities' by default, and all web sites use certificates that are validated by one of these companies, which you as a user implicitly trust every time you go to the secure part of a web site. (You might ask, who validates the security of the Certificate Authorities, and why should you trust them?!")?>.... <a href="#notes"><?=_("Good question")?></a>.)</p>
+<p><?=_("Digital signing thus provides security on the Internet.")?></p>
+
+<h3><a name="whyEmails"></a><?=_("Why digitally sign your own emails?! (weirdo..)")?></h3>
+<p><?=_("Emails are not secure. In fact emails are VERY not secure!")?></p>
+<p><?=_("To get from computer Internet User A to Internet User B an email may pass through tens of anonymous computers on the Internet. These 'Internet infrastructure' computers are all free to inspect and change the contents of your email as they see fit. Governments systematically browse the contents of all emails going in/out/within their country, e.g. the")?> <a href="http://www.cnn.com/2000/TECH/computing/07/28/uk.surveillance.idg/"><?=_("UK Government has done this since the year 2000")?></a>. (<a href="#freedom"><?=_("How it prepares us to protect our freedom")?></a>). <?=_("Ever requested a password that you lost to be emailed to you? That password was wide open to inspection by potential crackers.")?></p>
+<p><?=_("As anyone who has received an email containing a virus from a strange address knows, emails can be easily spoofed. The identity of the sender is very easy to forge via email. Thus a great advantage is that digital signing provides a means of ensuring that an email is really from the person you think it is. If everyone digitally signed their emails, it would be much easier to know whether an email is legitimate and unchanged and to the great relief of many, spamming would be much easier to control, and viruses that forge the sender's address would be obvious and therefore easier to control.")?></p>
+
+<h3><a name="freedom"></a><?=_("How it prepares us to protect our freedom")?></h3>
+<p><?=_("But perhaps, fundamentally, the most important reason for digital signing is awareness and privacy. It creates awareness of the (lack of) security of the Internet, and the tools that we can arm ourselves with to ensure our personal security. And in sensitising people to digital signatures, we become aware of the possibility of privacy and encryption.")?></p>
+<p><?=_("Most people would object if they found that all their postal letters are being opened, read and possibly recorded by the Government before being passed on to the intended recipient, resealed as if nothing had happened. And yet this is what happens every day with your emails (in the UK). There are some who have objected to this intrusion of privacy, but their voices are small and fall on deaf ears. However the most effective way to combat this intrusion is to seal the envelope shut in a miniature bank vault, i.e. encrypt your email. If all emails were encrypted, it would be very hard for Government, or other organisations/individual crackers, to monitor the general public. They would only realistically have enough resources to monitor those they had reason to suspect. Why? Because encryption can be broken, but it takes a lot of computing power and there wouldn't be enough to monitor the whole population of any given country.")?></p>
+<p><?=_("The reason digital signatures prepare us for encryption is that if everyone were setup to be able to generate their own digital signatures, it would be technically very easy to make the next step from digital signatures to encryption. And that would be great for privacy, the fight against spamming, and a safer Internet.")?></p>
+
+<h3><a name="whyAdopt"></a><?=_("Why isn't it being adopted by everyone?")?></h3>
+<p><?=_("Of the biggest reasons why most people haven't started doing this, apart from being slightly technical, the reason is financial. You need your own certificate to digitally sign your emails. And the Certificate Authorities charge money to provide you with your own certificate. Need I say more. Dosh = no thanks I'd rather walk home. But organisations are emerging to provide the common fool in the street with a free alternative. However, given the obvious lack of funding and the emphasis on money to get enrolled, these organisations do not yet have the money to get themselves established as trusted Certificate Authorities. Thus it is currently down to trust. The decision of the individual to trust an unknown Certificate Authority. However once you have put your trust in a Certificate Authority you can implicitly trust the digital signatures generated using their certificates. In other words, if you trust (and accept the certificate of) the Certificate Authority that I use, you can automatically trust my digital signature. Trust me!")?></p>
+
+<h3><a name="whyAccept"></a><?=_("Why is the digital signature described as 'not valid/not trusted'?")?></h3>
+<p><?=_("To fully understand, read the section directly above. I am using a free Certificate Authority to provide me with the ability to digitally sign my emails. As a result, this Certificate Authority is not (yet) recognised by your email software as it is a new organisation that is not yet fully established, although it is probably being included in the Mozilla browser. If you choose to, you can go the their site at CAcert.org to install the root certificate. You may be told that the certificate is untrusted - that is normal and I suggest that you continue installation regardless. Be aware that this implies your acceptance that you trust their secure distribution and storing of digital signatures, such as mine. (You already do this all the time). The CAcert.org root certificate will then automatically provide the safe validation of my digital signature, which I have entrusted to them. Or you can simply decide that you've wasted your time reading this and do nothing (humbug!). Shame on you! :-)")?></p>
+
+<h3><a name="proof"></a><?=_("But, er, is this really proof of your email identity?")?></h3>
+<p><?=_("Security is a serious matter. For a digital certificate with full rights to be issued to an individual by a Certificate Authority, stringent tests must be conducted, including meeting the physical person to verify their identity. At the current moment in time, my physical identity has not been verified by CAcert.org, but they have verified my email address. Installing their root certificate (see above) will thus automatically allow you to validate my digital signature. You can then be confident of the authenticity of my email address - only I have the ability to digitally sign my emails using my CAcert.org certificate, so if you get an email that I digitally signed and which is validated by your email software using the CAcert.org root certificate that you installed, you know it's from me. (Visually you get a simple indication that my email is signed and trusted). Technically, they haven't verified that I really am me! But you have the guarantee that emails from my address are sent by the person who physically administers that address, i.e. me! The only way that someone could forge my digital signature would be if they logged on to my home computer (using the password) and ran my email software (using the password) to send you a digitally signed email from my address. Although I have noticed the cats watching me logon...")?></p>
+
+<h3><a name="gimme"></a><?=_("Cool man! How do I create my own digital signature?!")?></h3>
+<p><?=_("Easy. Ish. Go to CAcert.org, install their root certificate and then follow their joining instructions. Once you have joined, request a certificate from the menu. You will receive an email with a link to the certificate. Click on the link from your email software, and hopefully it will be seamlessly installed. Next find the security section of the settings in your email software and configure digital signatures using the certificate you just downloaded. Hmm. Call me if you want, I'll guide you through it.")?></p>
+
+<h3><a name="encrypt"></a><?=_("I can't wait to start sending encrypted emails!")?></h3>
+<p><?=_("There's nothing to it. I mean literally, you can already start sending your emails encrypted. Assuming of course you have your own digital signature certificate (e.g. as per above), and the person you want to send an encrypted email to also has a digital signature certificate, and has recently sent you a digitally signed email with it. If all these conditions hold, you just have to change the settings in your email software to send the email encrypted and hey presto! Your email software (probably Outlook I guess) should suss out the rest.")?></p>
+
+<h3><a name="notes"></a><?=_("Notes for the strangely curious")?></h3>
+<p><?=_("You are putting your trust in people you don't know!")?><br><?=_("One assumes that if a site has an SSL certificate (that's what enables secure communication, for exchanging personal details, credit card numbers, etc. and gives the 'lock' icon in the browser) that they have obtained that certificate from a reliable source (a Certificate Authority), which has the appropriate stringent credentials for issuing something so vital to the security of the Internet, and the security of your communications. You have probably never even asked yourself the question of who decided to trust these Certificate Authorities, because your browser comes with their (root) certificates pre-installed, so any web site that you come across that has an SSL certificate signed by one of them, is automatically accepted (by your browser) as trustworthy.")?></p>
+<p><?=_("Thus, having now asked the question, you suppose that it's the people who make the browser software that have carefully decided who is a trustworthy Certificate Authority. Funnily enough, the mainstream browsers have not, historically, had public policies on how they decide whether a Certificate Authority gets added to their browser. All of the Certificate Authorities that have found themselves in the browser software, are big names, probably with big profits (so they must be doing a good job!).")?></p>
+<p><?=_("That situation has changed, and Internet Explorer, being the most obvious example, now insists that any Certificate Authorities are 'audited' by an 'independent' organisation, the American Institute for Certified Public Accountant's (AICPA). So now, if you have the money needed (from US$75000 up to US$250000 and beyond) you can get these accountants, who clearly know a lot about money, to approve you as having the required technical infrastructure and business processes to be a Certificate Authority. And they get a nice wad of money for the pleasure. And the Certificate Authorities, having a kind of monopoly as a result, charge a lot for certificates and also get a nice wad of money. And everyone's happy.")?></p>
+<p><?=_("But, with all this money, and all this responsibility, they must be taking a lot of care to ensure the Certificate Authorities do their jobs well, and keep doing their jobs well, right? Well right?!")?></p>
+<p><?=_("And they are making mistakes")?></p>
+<p><?=_("So if you don't pass the audit, you don't get to be a Certificate Authority. And to pass the audit, well, you've got to show that you can do a good job issuing certificates. That they're secure, you only give them to the right people, etc. So what happens when you make a mistake and you erroneously issue a certificate that risks the entire Internet browsing population, like Verisign did? Well, er, nothing actually. They already paid for their audit, and damn it, they're so big now, we couldn't possibly revoke their Certificate Authority status. (There's too much money at stake!)")?></p>
+
+<h3><?=_("So, dammit, what's the point of all this then?")?></h3>
+<p><?=_("The point is, as the current situation holds, you should be wary of anyone making decisions for you (i.e. pre-installed certificates in your browser), and you should be weary of anyone else's certificates that you install. But at the end of the day, it all boils down to trust. If an independent Certificate Authority seems to be reputable to you, and you can find evidence to support this claim, there's no reason why you shouldn't trust it any less than you implicitly trust the people who have already made mistakes.")?></p>
+<h3><a name="refs"></a><?=_("References")?></h3>
+<p><a href="http://www.schneier.com/paper-pki.pdf"><?=_("Ten Risks of PKI: What You're not Being Told about Public Key Infrastructure")?></a> - http://www.counterpane.com/pki-risks.pdf</p>
+<p><a href="http://www.webtrust.org/certauth.htm"><?=_("WebTrust for Certification Authorities")?></a> - http://www.webtrust.org/certauth.htm</p>
+<p><a href="http://www.microsoft.com/technet/treeview/default.asp?url=/technet/security/bulletin/MS01-017.asp"><?=_("Erroneous Verisign Issued Digital Certificates Pose Spoofing Hazard")?></a> - http://www.microsoft.com/technet/treeview/default.asp?url=/technet/security/bulletin/MS01-017.asp</p>
+<p><a href="http://www.microsoft.com/technet/treeview/default.asp?url=/technet/security/news/rootcert.asp"><?=_("Microsoft Root Certificate Program")?></a> - http://www.microsoft.com/technet/treeview/default.asp?url=/technet/security/news/rootcert.asp</p>
+<p><a href="http://www.homeoffice.gov.uk/crimpol/crimreduc/regulation/index.html"><?=_("The Regulation of Investigational Powers Act (RIPA)</a> ('Snooping Bill' official gov site, UK)")?> - http://www.homeoffice.gov.uk/crimpol/crimreduc/regulation/index.html</p>
+<p><a href="http://www.cnn.com/2000/TECH/computing/07/28/uk.surveillance.idg/"><?=_("U.K. e-mail snooping bill passed")?></a> (UK) - http://www.cnn.com/2000/TECH/computing/07/28/uk.surveillance.idg/</p>
+<p><?=_("Disclaimer : These are the author's opinions, but they should not be considered 'truth' without personal verification. The author may have made mistakes and any mistakes will be willingly rectified by contacting the administrator of elucido.net, contact details available from the normal domain registration information services (e.g. whois.net). No recommendation to install a Certificate Authority's root certificate is either intended nor implied.")?></p>
+<p><? printf(_("The page has been reproduced on %s with explicit permission from %sthe author%s with the information being copyrighted to the author (name with held by request)"), "<a href='http://www.CAcert.org'>CAcert.org</a>", "<a href='http://elucido.net/'>", "</a>")?></p> | {
"url": "https://git.cacert.org/cacert-devel.git/diff/pages/help/2.php?h=bug-1237&id=9dceece06fbdc98add6f76f0b1aec05891a394c4",
"source_domain": "git.cacert.org",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "36859",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PPV24FXZ2HTD2Y3ZX62HJQMUXEBAWJHO",
"WARC-Concurrent-To": "<urn:uuid:a1c63eb4-fffc-4ce9-8981-304f15078f69>",
"WARC-Date": "2022-12-01T21:01:20Z",
"WARC-IP-Address": "213.154.225.250",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PJQDDWWZJ3AYYE7BKJLM2QOOTHEKJLD7",
"WARC-Record-ID": "<urn:uuid:440f2ea3-8966-44a3-af4c-411942e7cde7>",
"WARC-Target-URI": "https://git.cacert.org/cacert-devel.git/diff/pages/help/2.php?h=bug-1237&id=9dceece06fbdc98add6f76f0b1aec05891a394c4",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2948a621-76e0-4ceb-99a9-9b4dcfb64132>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-196\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
29,
57,
70,
79,
86,
92,
133,
162,
206,
255,
276,
299,
313,
336,
353,
360,
396,
434,
436,
507,
578,
636,
638,
704,
769,
832,
879,
881,
949,
1011,
1090,
1097,
1103,
1163,
1257,
1343,
1428,
1541,
1637,
1726,
1818,
1892,
1944,
1951,
1957,
2015,
2540,
3005,
3079,
3081,
3173,
3250,
3975,
4590,
4592,
4676,
5047,
6003,
6343,
6345,
6428,
7491,
7493,
7604,
8625,
8627,
8721,
10082,
10084,
10177,
10706,
10708,
10798,
11361,
11363,
11435,
12290,
12809,
13542,
13759,
13806,
14410,
14412,
14479,
15017,
15067,
15257,
15404,
15702,
15959,
16223,
16427,
16902
],
"line_end_idx": [
29,
57,
70,
79,
86,
92,
133,
162,
206,
255,
276,
299,
313,
336,
353,
360,
396,
434,
436,
507,
578,
636,
638,
704,
769,
832,
879,
881,
949,
1011,
1090,
1097,
1103,
1163,
1257,
1343,
1428,
1541,
1637,
1726,
1818,
1892,
1944,
1951,
1957,
2015,
2540,
3005,
3079,
3081,
3173,
3250,
3975,
4590,
4592,
4676,
5047,
6003,
6343,
6345,
6428,
7491,
7493,
7604,
8625,
8627,
8721,
10082,
10084,
10177,
10706,
10708,
10798,
11361,
11363,
11435,
12290,
12809,
13542,
13759,
13806,
14410,
14412,
14479,
15017,
15067,
15257,
15404,
15702,
15959,
16223,
16427,
16902,
17180
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 17180,
"ccnet_original_nlines": 93,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3650546073913574,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014300569891929626,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.27249088883399963,
"rps_doc_frac_unique_words": 0.3359569311141968,
"rps_doc_mean_word_length": 5.328500270843506,
"rps_doc_num_sentences": 290,
"rps_doc_symbol_to_word_ratio": 0.0036401499528437853,
"rps_doc_unigram_entropy": 5.767076015472412,
"rps_doc_word_count": 2414,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07105652242898941,
"rps_doc_frac_chars_dupe_6grams": 0.052709318697452545,
"rps_doc_frac_chars_dupe_7grams": 0.02238979935646057,
"rps_doc_frac_chars_dupe_8grams": 0.011350380256772041,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0058306800201535225,
"rps_doc_frac_chars_top_3gram": 0.011428129859268665,
"rps_doc_frac_chars_top_4gram": 0.00443131010979414,
"rps_doc_books_importance": -1830.9940185546875,
"rps_doc_books_importance_length_correction": -1830.9940185546875,
"rps_doc_openwebtext_importance": -1061.4921875,
"rps_doc_openwebtext_importance_length_correction": -1061.4921875,
"rps_doc_wikipedia_importance": -972.2838134765625,
"rps_doc_wikipedia_importance_length_correction": -972.2838134765625
},
"fasttext": {
"dclm": 0.1839907169342041,
"english": 0.9099321961402893,
"fineweb_edu_approx": 1.3679559230804443,
"eai_general_math": 0.08600509166717529,
"eai_open_web_math": 0.1454474925994873,
"eai_web_code": 0.13979649543762207
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "353.0285",
"labels": {
"level_1": "Social sciences",
"level_2": "Public administration and Military art and science",
"level_3": "United States — Politics and government and State governments"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
6,408,942,558,904,547,000 | llvm.org GIT mirror llvm / df2c69a docs / Passes.rst
df2c69a
Tree @df2c69a (Download .tar.gz)
Passes.rst @df2c69aview markup · raw · history · blame
LLVM's Analysis and Transform Passes
Introduction
This document serves as a high level summary of the optimization features that LLVM provides. Optimizations are implemented as Passes that traverse some portion of a program to either collect information or transform the program. The table below divides the passes that LLVM provides into three categories. Analysis passes compute information that other passes can use or for debugging or program visualization purposes. Transform passes can use (or invalidate) the analysis passes. Transform passes all mutate the program in some way. Utility passes provides some utility but don't otherwise fit categorization. For example passes to extract functions to bitcode or write a module to bitcode are neither analysis nor transform passes. The table of contents above provides a quick summary of each pass and links to the more complete pass description later in the document.
Analysis Passes
This section describes the LLVM Analysis Passes.
-aa-eval: Exhaustive Alias Analysis Precision Evaluator
This is a simple N^2 alias analysis accuracy evaluator. Basically, for each function in the program, it simply queries to see how the alias analysis implementation answers alias queries between each pair of pointers in the function.
This is inspired and adapted from code by: Naveen Neelakantam, Francesco Spadini, and Wojciech Stryjewski.
-basicaa: Basic Alias Analysis (stateless AA impl)
A basic alias analysis pass that implements identities (two different globals cannot alias, etc), but does no stateful analysis.
-count-aa: Count Alias Analysis Query Responses
A pass which can be used to count how many alias queries are being made and how the alias analysis implementation being used responds.
-da: Dependence Analysis
Dependence analysis framework, which is used to detect dependences in memory accesses.
-debug-aa: AA use debugger
This simple pass checks alias analysis users to ensure that if they create a new value, they do not query AA without informing it of the value. It acts as a shim over any other AA pass you want.
Yes keeping track of every value in the program is expensive, but this is a debugging pass.
-domfrontier: Dominance Frontier Construction
This pass is a simple dominator construction algorithm for finding forward dominator frontiers.
-domtree: Dominator Tree Construction
This pass is a simple dominator construction algorithm for finding forward dominators.
-dot-callgraph: Print Call Graph to "dot" file
This pass, only available in opt, prints the call graph into a .dot graph. This graph can then be processed with the "dot" tool to convert it to postscript or some other suitable format.
-dot-cfg: Print CFG of function to "dot" file
This pass, only available in opt, prints the control flow graph into a .dot graph. This graph can then be processed with the :program:`dot` tool to convert it to postscript or some other suitable format.
-dot-cfg-only: Print CFG of function to "dot" file (with no function bodies)
This pass, only available in opt, prints the control flow graph into a .dot graph, omitting the function bodies. This graph can then be processed with the :program:`dot` tool to convert it to postscript or some other suitable format.
-dot-dom: Print dominance tree of function to "dot" file
This pass, only available in opt, prints the dominator tree into a .dot graph. This graph can then be processed with the :program:`dot` tool to convert it to postscript or some other suitable format.
-dot-dom-only: Print dominance tree of function to "dot" file (with no function bodies)
This pass, only available in opt, prints the dominator tree into a .dot graph, omitting the function bodies. This graph can then be processed with the :program:`dot` tool to convert it to postscript or some other suitable format.
-dot-postdom: Print postdominance tree of function to "dot" file
This pass, only available in opt, prints the post dominator tree into a .dot graph. This graph can then be processed with the :program:`dot` tool to convert it to postscript or some other suitable format.
-dot-postdom-only: Print postdominance tree of function to "dot" file (with no function bodies)
This pass, only available in opt, prints the post dominator tree into a .dot graph, omitting the function bodies. This graph can then be processed with the :program:`dot` tool to convert it to postscript or some other suitable format.
-globalsmodref-aa: Simple mod/ref analysis for globals
This simple pass provides alias and mod/ref information for global values that do not have their address taken, and keeps track of whether functions read or write memory (are "pure"). For this simple (but very common) case, we can provide pretty accurate and useful information.
-instcount: Counts the various types of Instructions
This pass collects the count of all instructions and reports them.
-intervals: Interval Partition Construction
This analysis calculates and represents the interval partition of a function, or a preexisting interval partition.
In this way, the interval partition may be used to reduce a flow graph down to its degenerate single node interval partition (unless it is irreducible).
-iv-users: Induction Variable Users
Bookkeeping for "interesting" users of expressions computed from induction variables.
-lazy-value-info: Lazy Value Information Analysis
Interface for lazy computation of value constraint information.
-libcall-aa: LibCall Alias Analysis
LibCall Alias Analysis.
-lint: Statically lint-checks LLVM IR
This pass statically checks for common and easily-identified constructs which produce undefined or likely unintended behavior in LLVM IR.
It is not a guarantee of correctness, in two ways. First, it isn't comprehensive. There are checks which could be done statically which are not yet implemented. Some of these are indicated by TODO comments, but those aren't comprehensive either. Second, many conditions cannot be checked statically. This pass does no dynamic instrumentation, so it can't check for all possible problems.
Another limitation is that it assumes all code will be executed. A store through a null pointer in a basic block which is never reached is harmless, but this pass will warn about it anyway.
Optimization passes may make conditions that this pass checks for more or less obvious. If an optimization pass appears to be introducing a warning, it may be that the optimization pass is merely exposing an existing condition in the code.
This code may be run before :ref:`instcombine <passes-instcombine>`. In many cases, instcombine checks for the same kinds of things and turns instructions with undefined behavior into unreachable (or equivalent). Because of this, this pass makes some effort to look through bitcasts and so on.
-loops: Natural Loop Information
This analysis is used to identify natural loops and determine the loop depth of various nodes of the CFG. Note that the loops identified may actually be several natural loops that share the same header node... not just a single natural loop.
-memdep: Memory Dependence Analysis
An analysis that determines, for a given memory operation, what preceding memory operations it depends on. It builds on alias analysis information, and tries to provide a lazy, caching interface to a common kind of alias information query.
-module-debuginfo: Decodes module-level debug info
This pass decodes the debug info metadata in a module and prints in a (sufficiently-prepared-) human-readable form.
For example, run this pass from opt along with the -analyze option, and it'll print to standard output.
-no-aa: No Alias Analysis (always returns 'may' alias)
This is the default implementation of the Alias Analysis interface. It always returns "I don't know" for alias queries. NoAA is unlike other alias analysis implementations, in that it does not chain to a previous analysis. As such it doesn't follow many of the rules that other alias analyses must.
-postdomfrontier: Post-Dominance Frontier Construction
This pass is a simple post-dominator construction algorithm for finding post-dominator frontiers.
-postdomtree: Post-Dominator Tree Construction
This pass is a simple post-dominator construction algorithm for finding post-dominators.
-regions: Detect single entry single exit regions
The RegionInfo pass detects single entry single exit regions in a function, where a region is defined as any subgraph that is connected to the remaining graph at only two spots. Furthermore, an hierarchical region tree is built.
-scalar-evolution: Scalar Evolution Analysis
The ScalarEvolution analysis can be used to analyze and catagorize scalar expressions in loops. It specializes in recognizing general induction variables, representing them with the abstract and opaque SCEV class. Given this analysis, trip counts of loops and other important properties can be obtained.
This analysis is primarily useful for induction variable substitution and strength reduction.
-scev-aa: ScalarEvolution-based Alias Analysis
Simple alias analysis implemented in terms of ScalarEvolution queries.
This differs from traditional loop dependence analysis in that it tests for dependencies within a single iteration of a loop, rather than dependencies between different iterations.
ScalarEvolution has a more complete understanding of pointer arithmetic than BasicAliasAnalysis' collection of ad-hoc analyses.
-targetdata: Target Data Layout
Provides other passes access to information on how the size and alignment required by the target ABI for various data types.
Transform Passes
This section describes the LLVM Transform Passes.
-adce: Aggressive Dead Code Elimination
ADCE aggressively tries to eliminate code. This pass is similar to :ref:`DCE <passes-dce>` but it assumes that values are dead until proven otherwise. This is similar to :ref:`SCCP <passes-sccp>`, except applied to the liveness of values.
-always-inline: Inliner for always_inline functions
A custom inliner that handles only functions that are marked as "always inline".
-argpromotion: Promote 'by reference' arguments to scalars
This pass promotes "by reference" arguments to be "by value" arguments. In practice, this means looking for internal functions that have pointer arguments. If it can prove, through the use of alias analysis, that an argument is only loaded, then it can pass the value into the function instead of the address of the value. This can cause recursive simplification of code and lead to the elimination of allocas (especially in C++ template code like the STL).
This pass also handles aggregate arguments that are passed into a function, scalarizing them if the elements of the aggregate are only loaded. Note that it refuses to scalarize aggregates which would require passing in more than three operands to the function, because passing thousands of operands for a large array or structure is unprofitable!
Note that this transformation could also be done for arguments that are only stored to (returning the value instead), but does not currently. This case would be best handled when and if LLVM starts supporting multiple return values from functions.
-bb-vectorize: Basic-Block Vectorization
This pass combines instructions inside basic blocks to form vector instructions. It iterates over each basic block, attempting to pair compatible instructions, repeating this process until no additional pairs are selected for vectorization. When the outputs of some pair of compatible instructions are used as inputs by some other pair of compatible instructions, those pairs are part of a potential vectorization chain. Instruction pairs are only fused into vector instructions when they are part of a chain longer than some threshold length. Moreover, the pass attempts to find the best possible chain for each pair of compatible instructions. These heuristics are intended to prevent vectorization in cases where it would not yield a performance increase of the resulting code.
-block-placement: Profile Guided Basic Block Placement
This pass is a very simple profile guided basic block placement algorithm. The idea is to put frequently executed blocks together at the start of the function and hopefully increase the number of fall-through conditional branches. If there is no profile information for a particular function, this pass basically orders blocks in depth-first order.
-break-crit-edges: Break critical edges in CFG
Break all of the critical edges in the CFG by inserting a dummy basic block. It may be "required" by passes that cannot deal with critical edges. This transformation obviously invalidates the CFG, but can update forward dominator (set, immediate dominators, tree, and frontier) information.
-codegenprepare: Optimize for code generation
This pass munges the code in the input function to better prepare it for SelectionDAG-based code generation. This works around limitations in its basic-block-at-a-time approach. It should eventually be removed.
-constmerge: Merge Duplicate Global Constants
Merges duplicate global constants together into a single constant that is shared. This is useful because some passes (i.e., TraceValues) insert a lot of string constants into the program, regardless of whether or not an existing string is available.
-constprop: Simple constant propagation
This pass implements constant propagation and merging. It looks for instructions involving only constant operands and replaces them with a constant value instead of an instruction. For example:
add i32 1, 2
becomes
i32 3
NOTE: this pass has a habit of making definitions be dead. It is a good idea to run a :ref:`Dead Instruction Elimination <passes-die>` pass sometime after running this pass.
-dce: Dead Code Elimination
Dead code elimination is similar to :ref:`dead instruction elimination <passes-die>`, but it rechecks instructions that were used by removed instructions to see if they are newly dead.
-deadargelim: Dead Argument Elimination
This pass deletes dead arguments from internal functions. Dead argument elimination removes arguments which are directly dead, as well as arguments only passed into function calls as dead arguments of other functions. This pass also deletes dead arguments in a similar way.
This pass is often useful as a cleanup pass to run after aggressive interprocedural passes, which add possibly-dead arguments.
-deadtypeelim: Dead Type Elimination
This pass is used to cleanup the output of GCC. It eliminate names for types that are unused in the entire translation unit, using the :ref:`find used types <passes-print-used-types>` pass.
-die: Dead Instruction Elimination
Dead instruction elimination performs a single pass over the function, removing instructions that are obviously dead.
-dse: Dead Store Elimination
A trivial dead store elimination that only considers basic-block local redundant stores.
-functionattrs: Deduce function attributes
A simple interprocedural pass which walks the call-graph, looking for functions which do not access or only read non-local memory, and marking them readnone/readonly. In addition, it marks function arguments (of pointer type) "nocapture" if a call to the function does not create any copies of the pointer value that outlive the call. This more or less means that the pointer is only dereferenced, and not returned from the function or stored in a global. This pass is implemented as a bottom-up traversal of the call-graph.
-globaldce: Dead Global Elimination
This transform is designed to eliminate unreachable internal globals from the program. It uses an aggressive algorithm, searching out globals that are known to be alive. After it finds all of the globals which are needed, it deletes whatever is left over. This allows it to delete recursive chunks of the program which are unreachable.
-globalopt: Global Variable Optimizer
This pass transforms simple global variables that never have their address taken. If obviously true, it marks read/write globals as constant, deletes variables only stored to, etc.
-gvn: Global Value Numbering
This pass performs global value numbering to eliminate fully and partially redundant instructions. It also performs redundant load elimination.
-indvars: Canonicalize Induction Variables
This transformation analyzes and transforms the induction variables (and computations derived from them) into simpler forms suitable for subsequent analysis and transformation.
This transformation makes the following changes to each loop with an identifiable induction variable:
• All loops are transformed to have a single canonical induction variable which starts at zero and steps by one.
• The canonical induction variable is guaranteed to be the first PHI node in the loop header block.
• Any pointer arithmetic recurrences are raised to use array subscripts.
If the trip count of a loop is computable, this pass also makes the following changes:
• The exit condition for the loop is canonicalized to compare the induction value against the exit value. This turns loops like:
for (i = 7; i*i < 1000; ++i)
into
for (i = 0; i != 25; ++i)
• Any use outside of the loop of an expression derived from the indvar is changed to compute the derived value outside of the loop, eliminating the dependence on the exit value of the induction variable. If the only purpose of the loop is to compute the exit value of some derived expression, this transformation will make the loop dead.
This transformation should be followed by strength reduction after all of the desired loop transformations have been performed. Additionally, on targets where it is profitable, the loop could be transformed to count down to zero (the "do loop" optimization).
-inline: Function Integration/Inlining
Bottom-up inlining of functions into callees.
-instcombine: Combine redundant instructions
Combine instructions to form fewer, simple instructions. This pass does not modify the CFG. This pass is where algebraic simplification happens.
This pass combines things like:
%Y = add i32 %X, 1
%Z = add i32 %Y, 1
into:
%Z = add i32 %X, 2
This is a simple worklist driven algorithm.
This pass guarantees that the following canonicalizations are performed on the program:
1. If a binary operator has a constant operand, it is moved to the right-hand side.
2. Bitwise operators with constant operands are always grouped so that shifts are performed first, then ors, then ands, then xors.
3. Compare instructions are converted from <, >, , or to = or if possible.
4. All cmp instructions on boolean values are replaced with logical operations.
5. add X, X is represented as mul X, 2shl X, 1
6. Multiplies with a constant power-of-two argument are transformed into shifts.
7. … etc.
This pass can also simplify calls to specific well-known function calls (e.g. runtime library functions). For example, a call exit(3) that occurs within the main() function can be transformed into simply return 3. Whether or not library calls are simplified is controlled by the :ref:`-functionattrs <passes-functionattrs>` pass and LLVM's knowledge of library calls on different targets.
-internalize: Internalize Global Symbols
This pass loops over all of the functions in the input module, looking for a main function. If a main function is found, all other functions and all global variables with initializers are marked as internal.
-ipconstprop: Interprocedural constant propagation
This pass implements an extremely simple interprocedural constant propagation pass. It could certainly be improved in many different ways, like using a worklist. This pass makes arguments dead, but does not remove them. The existing dead argument elimination pass should be run after this to clean up the mess.
-jump-threading: Jump Threading
Jump threading tries to find distinct threads of control flow running through a basic block. This pass looks at blocks that have multiple predecessors and multiple successors. If one or more of the predecessors of the block can be proven to always cause a jump to one of the successors, we forward the edge from the predecessor to the successor by duplicating the contents of this block.
An example of when this can occur is code like this:
if () { ...
X = 4;
}
if (X < 3) {
In this case, the unconditional branch at the end of the first if can be revectored to the false side of the second if.
-lcssa: Loop-Closed SSA Form Pass
This pass transforms loops by placing phi nodes at the end of the loops for all values that are live across the loop boundary. For example, it turns the left into the right code:
for (...) for (...)
if (c) if (c)
X1 = ... X1 = ...
else else
X2 = ... X2 = ...
X3 = phi(X1, X2) X3 = phi(X1, X2)
... = X3 + 4 X4 = phi(X3)
... = X4 + 4
This is still valid LLVM; the extra phi nodes are purely redundant, and will be trivially eliminated by InstCombine. The major benefit of this transformation is that it makes many other loop optimizations, such as LoopUnswitching, simpler.
-licm: Loop Invariant Code Motion
This pass performs loop invariant code motion, attempting to remove as much code from the body of a loop as possible. It does this by either hoisting code into the preheader block, or by sinking code to the exit blocks if it is safe. This pass also promotes must-aliased memory locations in the loop to live in registers, thus hoisting and sinking "invariant" loads and stores.
This pass uses alias analysis for two purposes:
1. Moving loop invariant loads and calls out of loops. If we can determine that a load or call inside of a loop never aliases anything stored to, we can hoist it or sink it like any other instruction.
2. Scalar Promotion of Memory. If there is a store instruction inside of the loop, we try to move the store to happen AFTER the loop instead of inside of the loop. This can only happen if a few conditions are true:
1. The pointer stored through is loop invariant.
2. There are no stores or loads in the loop which may alias the pointer. There are no calls in the loop which mod/ref the pointer.
If these conditions are true, we can promote the loads and stores in the loop of the pointer to use a temporary alloca'd variable. We then use the :ref:`mem2reg <passes-mem2reg>` functionality to construct the appropriate SSA form for the variable.
-loop-deletion: Delete dead loops
This file implements the Dead Loop Deletion Pass. This pass is responsible for eliminating loops with non-infinite computable trip counts that have no side effects or volatile instructions, and do not contribute to the computation of the function's return value.
-loop-extract: Extract loops into new functions
A pass wrapper around the ExtractLoop() scalar transformation to extract each top-level loop into its own new function. If the loop is the only loop in a given function, it is not touched. This is a pass most useful for debugging via bugpoint.
-loop-extract-single: Extract at most one loop into a new function
Similar to :ref:`Extract loops into new functions <passes-loop-extract>`, this pass extracts one natural loop from the program into a function if it can. This is used by :program:`bugpoint`.
-loop-reduce: Loop Strength Reduction
This pass performs a strength reduction on array references inside loops that have as one or more of their components the loop induction variable. This is accomplished by creating a new value to hold the initial value of the array access for the first iteration, and then creating a new GEP instruction in the loop to increment the value by the appropriate amount.
-loop-rotate: Rotate Loops
A simple loop rotation transformation.
-loop-simplify: Canonicalize natural loops
This pass performs several transformations to transform natural loops into a simpler form, which makes subsequent analyses and transformations simpler and more effective.
Loop pre-header insertion guarantees that there is a single, non-critical entry edge from outside of the loop to the loop header. This simplifies a number of analyses and transformations, such as :ref:`LICM <passes-licm>`.
Loop exit-block insertion guarantees that all exit blocks from the loop (blocks which are outside of the loop that have predecessors inside of the loop) only have predecessors from inside of the loop (and are thus dominated by the loop header). This simplifies transformations such as store-sinking that are built into LICM.
This pass also guarantees that loops will have exactly one backedge.
Note that the :ref:`simplifycfg <passes-simplifycfg>` pass will clean up blocks which are split out but end up being unnecessary, so usage of this pass should not pessimize generated code.
This pass obviously modifies the CFG, but updates loop information and dominator information.
-loop-unroll: Unroll loops
This pass implements a simple loop unroller. It works best when loops have been canonicalized by the :ref:`indvars <passes-indvars>` pass, allowing it to determine the trip counts of loops easily.
-loop-unswitch: Unswitch loops
This pass transforms loops that contain branches on loop-invariant conditions to have multiple loops. For example, it turns the left into the right code:
for (...) if (lic)
A for (...)
if (lic) A; B; C
B else
C for (...)
A; C
This can increase the size of the code exponentially (doubling it every time a loop is unswitched) so we only unswitch if the resultant code will be smaller than a threshold.
This pass expects :ref:`LICM <passes-licm>` to be run before it to hoist invariant conditions out of the loop, to make the unswitching opportunity obvious.
-loweratomic: Lower atomic intrinsics to non-atomic form
This pass lowers atomic intrinsics to non-atomic form for use in a known non-preemptible environment.
The pass does not verify that the environment is non-preemptible (in general this would require knowledge of the entire call graph of the program including any libraries which may not be available in bitcode form); it simply lowers every atomic intrinsic.
-lowerinvoke: Lower invokes to calls, for unwindless code generators
This transformation is designed for use by code generators which do not yet support stack unwinding. This pass converts invoke instructions to call instructions, so that any exception-handling landingpad blocks become dead code (which can be removed by running the -simplifycfg pass afterwards).
-lowerswitch: Lower SwitchInsts to branches
Rewrites switch instructions with a sequence of branches, which allows targets to get away with not implementing the switch instruction until it is convenient.
-mem2reg: Promote Memory to Register
This file promotes memory references to be register references. It promotes alloca instructions which only have loads and stores as uses. An alloca is transformed by using dominator frontiers to place phi nodes, then traversing the function in depth-first order to rewrite loads and stores as appropriate. This is just the standard SSA construction algorithm to construct "pruned" SSA form.
-memcpyopt: MemCpy Optimization
This pass performs various transformations related to eliminating memcpy calls, or transforming sets of stores into memsets.
-mergefunc: Merge Functions
This pass looks for equivalent functions that are mergable and folds them.
Total-ordering is introduced among the functions set: we define comparison that answers for every two functions which of them is greater. It allows to arrange functions into the binary tree.
For every new function we check for equivalent in tree.
If equivalent exists we fold such functions. If both functions are overridable, we move the functionality into a new internal function and leave two overridable thunks to it.
If there is no equivalent, then we add this function to tree.
Lookup routine has O(log(n)) complexity, while whole merging process has complexity of O(n*log(n)).
Read :doc:`this <MergeFunctions>` article for more details.
-mergereturn: Unify function exit nodes
Ensure that functions have at most one ret instruction in them. Additionally, it keeps track of which node is the new exit node of the CFG.
-partial-inliner: Partial Inliner
This pass performs partial inlining, typically by inlining an if statement that surrounds the body of the function.
-prune-eh: Remove unused exception handling info
This file implements a simple interprocedural pass which walks the call-graph, turning invoke instructions into call instructions if and only if the callee cannot throw an exception. It implements this as a bottom-up traversal of the call-graph.
-reassociate: Reassociate expressions
This pass reassociates commutative expressions in an order that is designed to promote better constant propagation, GCSE, :ref:`LICM <passes-licm>`, PRE, etc.
For example: 4 + (x + 5) ⇒ x + (4 + 5)
In the implementation of this algorithm, constants are assigned rank = 0, function arguments are rank = 1, and other values are assigned ranks corresponding to the reverse post order traversal of current function (starting at 2), which effectively gives values in deep loops higher rank than values not in loops.
-reg2mem: Demote all values to stack slots
This file demotes all registers to memory references. It is intended to be the inverse of :ref:`mem2reg <passes-mem2reg>`. By converting to load instructions, the only values live across basic blocks are alloca instructions and load instructions before phi nodes. It is intended that this should make CFG hacking much easier. To make later hacking easier, the entry block is split into two, such that all introduced alloca instructions (and nothing else) are in the entry block.
-scalarrepl: Scalar Replacement of Aggregates (DT)
The well-known scalar replacement of aggregates transformation. This transform breaks up alloca instructions of aggregate type (structure or array) into individual alloca instructions for each member if possible. Then, if possible, it transforms the individual alloca instructions into nice clean scalar SSA form.
This combines a simple scalar replacement of aggregates algorithm with the :ref:`mem2reg <passes-mem2reg>` algorithm because they often interact, especially for C++ programs. As such, iterating between scalarrepl, then :ref:`mem2reg <passes-mem2reg>` until we run out of things to promote works well.
-sccp: Sparse Conditional Constant Propagation
Sparse conditional constant propagation and merging, which can be summarized as:
• Assumes values are constant unless proven otherwise
• Assumes BasicBlocks are dead unless proven otherwise
• Proves values to be constant, and replaces them with constants
• Proves conditional branches to be unconditional
Note that this pass has a habit of making definitions be dead. It is a good idea to run a :ref:`DCE <passes-dce>` pass sometime after running this pass.
-simplifycfg: Simplify the CFG
Performs dead code elimination and basic block merging. Specifically:
• Removes basic blocks with no predecessors.
• Merges a basic block into its predecessor if there is only one and the predecessor only has one successor.
• Eliminates PHI nodes for basic blocks with a single predecessor.
• Eliminates a basic block that only contains an unconditional branch.
-sink: Code sinking
This pass moves instructions into successor blocks, when possible, so that they aren't executed on paths where their results aren't needed.
-strip: Strip all symbols from a module
Performs code stripping. This transformation can delete:
• names for virtual registers
• symbols for internal globals and functions
• debug information
Note that this transformation makes code much less readable, so it should only be used in situations where the strip utility would be used, such as reducing code size or making it harder to reverse engineer code.
-strip-dead-debug-info: Strip debug info for unused symbols
performs code stripping. this transformation can delete:
• names for virtual registers
• symbols for internal globals and functions
• debug information
note that this transformation makes code much less readable, so it should only be used in situations where the strip utility would be used, such as reducing code size or making it harder to reverse engineer code.
-strip-dead-prototypes: Strip Unused Function Prototypes
This pass loops over all of the functions in the input module, looking for dead declarations and removes them. Dead declarations are declarations of functions for which no implementation is available (i.e., declarations for unused library functions).
-strip-debug-declare: Strip all llvm.dbg.declare intrinsics
This pass implements code stripping. Specifically, it can delete:
1. names for virtual registers
2. symbols for internal globals and functions
3. debug information
Note that this transformation makes code much less readable, so it should only be used in situations where the 'strip' utility would be used, such as reducing code size or making it harder to reverse engineer code.
-strip-nondebug: Strip all symbols, except dbg symbols, from a module
This pass implements code stripping. Specifically, it can delete:
1. names for virtual registers
2. symbols for internal globals and functions
3. debug information
Note that this transformation makes code much less readable, so it should only be used in situations where the 'strip' utility would be used, such as reducing code size or making it harder to reverse engineer code.
-tailcallelim: Tail Call Elimination
This file transforms calls of the current function (self recursion) followed by a return instruction with a branch to the entry of the function, creating a loop. This pass also implements the following extensions to the basic algorithm:
1. Trivial instructions between the call and return do not prevent the transformation from taking place, though currently the analysis cannot support moving any really useful instructions (only dead ones).
2. This pass transforms functions that are prevented from being tail recursive by an associative expression to use an accumulator variable, thus compiling the typical naive factorial or fib implementation into efficient code.
3. TRE is performed if the function returns void, if the return returns the result returned by the call, or if the function returns a run-time constant on all exits from the function. It is possible, though unlikely, that the return returns something else (like constant 0), and can still be TRE'd. It can be TRE'd if all other return instructions in the function return the exact same value.
4. If it can prove that callees do not access theier caller stack frame, they are marked as eligible for tail call elimination (by the code generator).
Utility Passes
This section describes the LLVM Utility Passes.
-deadarghaX0r: Dead Argument Hacking (BUGPOINT USE ONLY; DO NOT USE)
Same as dead argument elimination, but deletes arguments to functions which are external. This is only for use by :doc:`bugpoint <Bugpoint>`.
-extract-blocks: Extract Basic Blocks From Module (for bugpoint use)
This pass is used by bugpoint to extract all blocks from the module into their own functions.
-instnamer: Assign names to anonymous instructions
This is a little utility pass that gives instructions names, this is mostly useful when diffing the effect of an optimization because deleting an unnamed instruction can change all other instruction numbering, making the diff very noisy.
-verify: Module Verifier
Verifies an LLVM IR code. This is useful to run after an optimization which is undergoing testing. Note that llvm-as verifies its input before emitting bitcode, and also that malformed bitcode is likely to make LLVM crash. All language front-ends are therefore encouraged to verify their output before performing optimizing transformations.
1. Both of a binary operator's parameters are of the same type.
2. Verify that the indices of mem access instructions match other operands.
3. Verify that arithmetic and other things are only performed on first-class types. Verify that shifts and logicals only happen on integrals f.e.
4. All of the constants in a switch statement are of the correct type.
5. The code is in valid SSA form.
6. It is illegal to put a label into any other type (like a structure) or to return one.
7. Only phi nodes can be self referential: %x = add i32 %x, %x is invalid.
8. PHI nodes must have an entry for each predecessor, with no extras.
9. PHI nodes must be the first thing in a basic block, all grouped together.
10. PHI nodes must have at least one entry.
11. All basic blocks should only end with terminator insts, not contain them.
12. The entry node to a function must not have predecessors.
13. All Instructions must be embedded into a basic block.
14. Functions cannot take a void-typed parameter.
15. Verify that a function's argument list agrees with its declared type.
16. It is illegal to specify a name for a void value.
17. It is illegal to have an internal global value with no initializer.
18. It is illegal to have a ret instruction that returns a value that does not agree with the function return value type.
19. Function call argument types match the function prototype.
20. All other things that are tested by asserts spread about the code.
Note that this does not provide full security verification (like Java), but instead just tries to ensure that code is well-formed.
-view-cfg: View CFG of function
Displays the control flow graph using the GraphViz tool.
-view-cfg-only: View CFG of function (with no function bodies)
Displays the control flow graph using the GraphViz tool, but omitting function bodies.
-view-dom: View dominance tree of function
Displays the dominator tree using the GraphViz tool.
-view-dom-only: View dominance tree of function (with no function bodies)
Displays the dominator tree using the GraphViz tool, but omitting function bodies.
-view-postdom: View postdominance tree of function
Displays the post dominator tree using the GraphViz tool.
-view-postdom-only: View postdominance tree of function (with no function bodies)
Displays the post dominator tree using the GraphViz tool, but omitting function bodies. | {
"url": "https://git.llvm.org/klaus/llvm/blob/df2c69a0e69c251daa2dd021d700cd2358ddeb80/docs/Passes.rst",
"source_domain": "git.llvm.org",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "115992",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GSLAEBBAQ3XPIUAJRCMDSC7ZRXYUNWRF",
"WARC-Concurrent-To": "<urn:uuid:f3860e4c-0026-433f-8b7f-0763662edfb9>",
"WARC-Date": "2019-10-14T05:31:56Z",
"WARC-IP-Address": "54.67.122.174",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:M4TZ74XW7LVPB6XU3LQ45SUB7VAV3OKL",
"WARC-Record-ID": "<urn:uuid:e505b354-79d9-47a3-ab9a-184c1d4bb8f6>",
"WARC-Target-URI": "https://git.llvm.org/klaus/llvm/blob/df2c69a0e69c251daa2dd021d700cd2358ddeb80/docs/Passes.rst",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e5bd4bff-76fd-43df-bc44-ececa74eddc7>"
},
"warc_info": "isPartOf: CC-MAIN-2019-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-47.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
53,
61,
62,
95,
96,
151,
152,
189,
190,
203,
204,
1077,
1078,
1094,
1095,
1144,
1145,
1201,
1202,
1435,
1436,
1543,
1544,
1595,
1596,
1725,
1726,
1774,
1775,
1910,
1911,
1936,
1937,
2024,
2025,
2052,
2053,
2248,
2249,
2341,
2342,
2388,
2389,
2485,
2486,
2524,
2525,
2612,
2613,
2660,
2661,
2848,
2849,
2895,
2896,
3100,
3101,
3178,
3179,
3413,
3414,
3471,
3472,
3672,
3673,
3761,
3762,
3992,
3993,
4058,
4059,
4264,
4265,
4361,
4362,
4597,
4598,
4653,
4654,
4933,
4934,
4987,
4988,
5055,
5056,
5100,
5101,
5216,
5217,
5370,
5371,
5407,
5408,
5494,
5495,
5545,
5546,
5610,
5611,
5647,
5648,
5672,
5673,
5711,
5712,
5850,
5851,
6239,
6240,
6430,
6431,
6671,
6672,
6966,
6967,
7000,
7001,
7243,
7244,
7280,
7281,
7521,
7522,
7573,
7574,
7690,
7691,
7795,
7796,
7851,
7852,
8151,
8152,
8207,
8208,
8306,
8307,
8354,
8355,
8444,
8445,
8495,
8496,
8725,
8726,
8771,
8772,
9076,
9077,
9171,
9172,
9219,
9220,
9291,
9292,
9473,
9474,
9602,
9603,
9635,
9636,
9761,
9762,
9779,
9780,
9830,
9831,
9871,
9872,
10111,
10112,
10164,
10165,
10246,
10247,
10306,
10307,
10765,
10766,
11113,
11114,
11362,
11363,
11404,
11405,
12186,
12187,
12242,
12243,
12592,
12593,
12640,
12641,
12932,
12933,
12979,
12980,
13191,
13192,
13238,
13239,
13489,
13490,
13530,
13531,
13725,
13726,
13739,
13740,
13748,
13749,
13755,
13756,
13930,
13931,
13959,
13960,
14145,
14146,
14186,
14187,
14461,
14462,
14589,
14590,
14627,
14628,
14818,
14819,
14854,
14855,
14973,
14974,
15003,
15004,
15093,
15094,
15137,
15138,
15663,
15664,
15700,
15701,
16037,
16038,
16076,
16077,
16258,
16259,
16288,
16289,
16433,
16434,
16477,
16478,
16655,
16656,
16758,
16759,
16874,
16976,
17051,
17052,
17139,
17140,
17271,
17272,
17305,
17310,
17319,
17324,
17354,
17359,
17699,
17700,
17959,
17960,
17999,
18000,
18046,
18047,
18092,
18093,
18238,
18239,
18271,
18272,
18291,
18310,
18311,
18317,
18318,
18337,
18338,
18382,
18383,
18471,
18472,
18558,
18691,
18768,
18850,
18899,
18982,
18994,
18995,
19384,
19385,
19426,
19427,
19635,
19636,
19687,
19688,
19999,
20000,
20032,
20033,
20421,
20422,
20475,
20476,
20488,
20497,
20499,
20512,
20513,
20633,
20634,
20668,
20669,
20848,
20849,
20884,
20920,
20962,
20996,
21038,
21084,
21123,
21164,
21165,
21405,
21406,
21440,
21441,
21819,
21820,
21868,
21869,
22072,
22073,
22290,
22291,
22344,
22479,
22480,
22733,
22734,
22768,
22769,
23032,
23033,
23081,
23082,
23326,
23327,
23394,
23395,
23586,
23587,
23625,
23626,
23991,
23992,
24019,
24020,
24059,
24060,
24103,
24104,
24275,
24276,
24499,
24500,
24825,
24826,
24895,
24896,
25085,
25086,
25180,
25181,
25208,
25209,
25406,
25407,
25438,
25439,
25593,
25594,
25630,
25671,
25714,
25746,
25787,
25827,
25828,
26003,
26004,
26160,
26161,
26218,
26219,
26321,
26322,
26578,
26579,
26648,
26649,
26945,
26946,
26990,
26991,
27151,
27152,
27189,
27190,
27581,
27582,
27614,
27615,
27740,
27741,
27769,
27770,
27845,
27846,
28037,
28038,
28094,
28095,
28270,
28271,
28333,
28334,
28434,
28435,
28495,
28496,
28536,
28537,
28677,
28678,
28712,
28713,
28829,
28830,
28879,
28880,
29126,
29127,
29165,
29166,
29325,
29326,
29365,
29366,
29679,
29680,
29723,
29724,
30203,
30204,
30255,
30256,
30570,
30571,
30872,
30873,
30920,
30921,
31002,
31003,
31059,
31116,
31183,
31235,
31236,
31389,
31390,
31421,
31422,
31492,
31493,
31540,
31651,
31720,
31793,
31794,
31814,
31815,
31955,
31956,
31996,
31997,
32054,
32055,
32087,
32134,
32156,
32157,
32370,
32371,
32431,
32432,
32489,
32490,
32522,
32569,
32591,
32592,
32805,
32806,
32863,
32864,
33115,
33116,
33176,
33177,
33243,
33244,
33277,
33325,
33348,
33349,
33564,
33565,
33635,
33636,
33702,
33703,
33736,
33784,
33807,
33808,
34023,
34024,
34061,
34062,
34299,
34300,
34508,
34736,
35131,
35285,
35286,
35301,
35302,
35350,
35351,
35420,
35421,
35563,
35564,
35633,
35634,
35728,
35729,
35780,
35781,
36019,
36020,
36045,
36046,
36387,
36388,
36454,
36532,
36680,
36753,
36789,
36880,
36957,
37029,
37108,
37154,
37234,
37297,
37357,
37409,
37485,
37541,
37615,
37739,
37804,
37877,
37878,
38009,
38010,
38042,
38043,
38100,
38101,
38164,
38165,
38252,
38253,
38296,
38297,
38350,
38351,
38425,
38426,
38509,
38510,
38561,
38562,
38620,
38621,
38703,
38704
],
"line_end_idx": [
53,
61,
62,
95,
96,
151,
152,
189,
190,
203,
204,
1077,
1078,
1094,
1095,
1144,
1145,
1201,
1202,
1435,
1436,
1543,
1544,
1595,
1596,
1725,
1726,
1774,
1775,
1910,
1911,
1936,
1937,
2024,
2025,
2052,
2053,
2248,
2249,
2341,
2342,
2388,
2389,
2485,
2486,
2524,
2525,
2612,
2613,
2660,
2661,
2848,
2849,
2895,
2896,
3100,
3101,
3178,
3179,
3413,
3414,
3471,
3472,
3672,
3673,
3761,
3762,
3992,
3993,
4058,
4059,
4264,
4265,
4361,
4362,
4597,
4598,
4653,
4654,
4933,
4934,
4987,
4988,
5055,
5056,
5100,
5101,
5216,
5217,
5370,
5371,
5407,
5408,
5494,
5495,
5545,
5546,
5610,
5611,
5647,
5648,
5672,
5673,
5711,
5712,
5850,
5851,
6239,
6240,
6430,
6431,
6671,
6672,
6966,
6967,
7000,
7001,
7243,
7244,
7280,
7281,
7521,
7522,
7573,
7574,
7690,
7691,
7795,
7796,
7851,
7852,
8151,
8152,
8207,
8208,
8306,
8307,
8354,
8355,
8444,
8445,
8495,
8496,
8725,
8726,
8771,
8772,
9076,
9077,
9171,
9172,
9219,
9220,
9291,
9292,
9473,
9474,
9602,
9603,
9635,
9636,
9761,
9762,
9779,
9780,
9830,
9831,
9871,
9872,
10111,
10112,
10164,
10165,
10246,
10247,
10306,
10307,
10765,
10766,
11113,
11114,
11362,
11363,
11404,
11405,
12186,
12187,
12242,
12243,
12592,
12593,
12640,
12641,
12932,
12933,
12979,
12980,
13191,
13192,
13238,
13239,
13489,
13490,
13530,
13531,
13725,
13726,
13739,
13740,
13748,
13749,
13755,
13756,
13930,
13931,
13959,
13960,
14145,
14146,
14186,
14187,
14461,
14462,
14589,
14590,
14627,
14628,
14818,
14819,
14854,
14855,
14973,
14974,
15003,
15004,
15093,
15094,
15137,
15138,
15663,
15664,
15700,
15701,
16037,
16038,
16076,
16077,
16258,
16259,
16288,
16289,
16433,
16434,
16477,
16478,
16655,
16656,
16758,
16759,
16874,
16976,
17051,
17052,
17139,
17140,
17271,
17272,
17305,
17310,
17319,
17324,
17354,
17359,
17699,
17700,
17959,
17960,
17999,
18000,
18046,
18047,
18092,
18093,
18238,
18239,
18271,
18272,
18291,
18310,
18311,
18317,
18318,
18337,
18338,
18382,
18383,
18471,
18472,
18558,
18691,
18768,
18850,
18899,
18982,
18994,
18995,
19384,
19385,
19426,
19427,
19635,
19636,
19687,
19688,
19999,
20000,
20032,
20033,
20421,
20422,
20475,
20476,
20488,
20497,
20499,
20512,
20513,
20633,
20634,
20668,
20669,
20848,
20849,
20884,
20920,
20962,
20996,
21038,
21084,
21123,
21164,
21165,
21405,
21406,
21440,
21441,
21819,
21820,
21868,
21869,
22072,
22073,
22290,
22291,
22344,
22479,
22480,
22733,
22734,
22768,
22769,
23032,
23033,
23081,
23082,
23326,
23327,
23394,
23395,
23586,
23587,
23625,
23626,
23991,
23992,
24019,
24020,
24059,
24060,
24103,
24104,
24275,
24276,
24499,
24500,
24825,
24826,
24895,
24896,
25085,
25086,
25180,
25181,
25208,
25209,
25406,
25407,
25438,
25439,
25593,
25594,
25630,
25671,
25714,
25746,
25787,
25827,
25828,
26003,
26004,
26160,
26161,
26218,
26219,
26321,
26322,
26578,
26579,
26648,
26649,
26945,
26946,
26990,
26991,
27151,
27152,
27189,
27190,
27581,
27582,
27614,
27615,
27740,
27741,
27769,
27770,
27845,
27846,
28037,
28038,
28094,
28095,
28270,
28271,
28333,
28334,
28434,
28435,
28495,
28496,
28536,
28537,
28677,
28678,
28712,
28713,
28829,
28830,
28879,
28880,
29126,
29127,
29165,
29166,
29325,
29326,
29365,
29366,
29679,
29680,
29723,
29724,
30203,
30204,
30255,
30256,
30570,
30571,
30872,
30873,
30920,
30921,
31002,
31003,
31059,
31116,
31183,
31235,
31236,
31389,
31390,
31421,
31422,
31492,
31493,
31540,
31651,
31720,
31793,
31794,
31814,
31815,
31955,
31956,
31996,
31997,
32054,
32055,
32087,
32134,
32156,
32157,
32370,
32371,
32431,
32432,
32489,
32490,
32522,
32569,
32591,
32592,
32805,
32806,
32863,
32864,
33115,
33116,
33176,
33177,
33243,
33244,
33277,
33325,
33348,
33349,
33564,
33565,
33635,
33636,
33702,
33703,
33736,
33784,
33807,
33808,
34023,
34024,
34061,
34062,
34299,
34300,
34508,
34736,
35131,
35285,
35286,
35301,
35302,
35350,
35351,
35420,
35421,
35563,
35564,
35633,
35634,
35728,
35729,
35780,
35781,
36019,
36020,
36045,
36046,
36387,
36388,
36454,
36532,
36680,
36753,
36789,
36880,
36957,
37029,
37108,
37154,
37234,
37297,
37357,
37409,
37485,
37541,
37615,
37739,
37804,
37877,
37878,
38009,
38010,
38042,
38043,
38100,
38101,
38164,
38165,
38252,
38253,
38296,
38297,
38350,
38351,
38425,
38426,
38509,
38510,
38561,
38562,
38620,
38621,
38703,
38704,
38791
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 38791,
"ccnet_original_nlines": 622,
"rps_doc_curly_bracket": 0.00007734000246273354,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35170069336891174,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01646259054541588,
"rps_doc_frac_lines_end_with_ellipsis": 0.004815409891307354,
"rps_doc_frac_no_alph_words": 0.18299320340156555,
"rps_doc_frac_unique_words": 0.21871285140514374,
"rps_doc_mean_word_length": 5.215486526489258,
"rps_doc_num_sentences": 379,
"rps_doc_symbol_to_word_ratio": 0.0019047600217163563,
"rps_doc_unigram_entropy": 5.975785255432129,
"rps_doc_word_count": 5889,
"rps_doc_frac_chars_dupe_10grams": 0.10832194238901138,
"rps_doc_frac_chars_dupe_5grams": 0.15103861689567566,
"rps_doc_frac_chars_dupe_6grams": 0.13326169550418854,
"rps_doc_frac_chars_dupe_7grams": 0.12795467674732208,
"rps_doc_frac_chars_dupe_8grams": 0.12443836778402328,
"rps_doc_frac_chars_dupe_9grams": 0.11600573360919952,
"rps_doc_frac_chars_top_2gram": 0.019535070285201073,
"rps_doc_frac_chars_top_3gram": 0.003907009959220886,
"rps_doc_frac_chars_top_4gram": 0.0047860899940133095,
"rps_doc_books_importance": -3156.031982421875,
"rps_doc_books_importance_length_correction": -3156.031982421875,
"rps_doc_openwebtext_importance": -1827.361572265625,
"rps_doc_openwebtext_importance_length_correction": -1827.361572265625,
"rps_doc_wikipedia_importance": -1390.8492431640625,
"rps_doc_wikipedia_importance_length_correction": -1390.8492431640625
},
"fasttext": {
"dclm": 0.5221790671348572,
"english": 0.8711274266242981,
"fineweb_edu_approx": 2.79280686378479,
"eai_general_math": 0.9444919228553772,
"eai_open_web_math": 0.21268564462661743,
"eai_web_code": 0.9199182987213135
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-1,001,769,573,591,826,300 | Drivers.Tips
Acer Travelmate 4200 Drivers
Install and download Acer Travelmate 4200 drivers from the web to your computer so that you may install an external hardware device, make it work and perform like it was new. Drivers are just simple files used by the operating system that are made entirely of computer code for the CPU to interpret and put into action so that you may use the hardware that the small driver file corresponds to. Without proper drivers the piece of hardware is absolutely of no use whatsoever and cannot be communicated with by the operating system in the computer. You would need to have the right files correctly installed on your Windows operating system so the hardware is usable.
Every device connected to your computer should have driver files that have to be installed onto the operating system in order for them to work correctly. These devices can be a printer, floppy drive, cell phone or anything that can be connected to a computer in some way or another.
• BRAND: Acer
• MODEL: Travelmate 4200
• SYSTEM TYPE: Personal Computer
• OS: Windows XP, Vista, 7, 8, 10
Because there are differences within each device, each driver file must be different, too. This is the biggest reason why it is a mammoth task to find a Acer Travelmate 4200 driver for a specific device. For instance, all the many different Motorola cell phone models needs its own specific driver to work right. That adds up to thousands and thousands of drivers available to download simply for a specific brand of hardware devices.
Hunting down the correct Travelmate 4200 driver for your particular device can be a difficult and dangerous journey. Just remember that you are not alone is this. Here are a few things you need to know as you descend into the realm of driver downloads.
1. The brand of the device (if it came already connected to the computer then the brand of the PC is what you should use)
2. You have the brand now you need the model.
3. The type of Windows operating system that is installed on your computer system. (for all Windows PCs, right-click on "My Computer" or aka "Computer" and left-click on "Properties". All of the important information will be located in the window that pops up)
4. You need to know if you have a 32-bit or 64-bit operating system. (if it is a 64-bit system then it will show up in the Window that opens when you right-click on "My Computer" or "Computer" and left-click on "Properties". If is does not state 64-bit then go ahead and assume 32-bit.)
Make sure you know the model and brand of the piece of hardware and OS type that you are going to install the device driver files onto. After you have the correct information about the hardware device, you should now start your search for Acer Travelmate 4200 drivers and install them on your PC.
Windows, especially newer versions of Windows (7, 8, 8.1, and 10) will do most of work for you and is capable of installing the proper drivers onto the system for the user whenever it detects any new hardware or device attached to the computer. Windows is not flawless, therefore there might be an instance in which you will need to hunt down the Travelmate 4200 driver because Windows was not able to fully install it for one reason or another. It is most likely the reason why you came here!
Most brands offer downloads of their device drivers for use on their customer computers. Most, but not all branded sites are real easy to search for and they may not all be constructed for easy navigation. Some websites do not take into consideration to think of Joe Consumer and how difficult it is installing Acer Travelmate 4200 drivers into Windows operating systems. A lot of people have a tough time understanding what they are searching for and trying to navigate through a poorly designed site can be strenuous.
Be wary of downloading Travelmate 4200 drivers from 3rd party websites. For safety reasons, try to only download from a hardware maker's website to be safe. Viruses and other malware can make their way into a lot of different unsuspected files. Installing a file that you think is a Travelmate 4200 driver is a huge mistake if it turns out to be a virus. No anti-virus software can not stop ALL viruses. This is why we send you directly to the manufacturer's website. The manufacturer's sites are more trusted than other third party websites.
Once you have located and then download the right driver for your hardware or peripheral device, you should install it. After you have downloaded the file you may have to uncompress it especially if it ends with a .zip or .rar. After you do that you can install the driver to your system. If the driver fails to install you might have to go ahead and install the Acer Travelmate 4200 driver manually.
Here are the instructions for installing a Acer Travelmate 4200 driver by hand:
1. Go ahead and Right-click on "My Computer" or "Computer". Left-click on "Manage".
2. After the window opens up, left-click on "Device Manager". You should now see all the hardware devices that are connected to your computer system.
3. Double-click on the yellow exclamation point. A new window should open up.
4. Find and click on the tab called "Driver".
5. Then click on "Update Driver" and follow the prompts.
6. If you are told to provide a location of the driver on your system, point the system to the Acer Travelmate 4200 driver you have already downloaded.
7. After you have finished, a reboot is most likely next.
Download Acer Travelmate 4200 driver using the link below.
Download Acer Travelmate 4200 Drivers
We make every effort to make sure every link is working as it should. | {
"url": "http://www.drivers.tips/Acer/Travelmate_4200/",
"source_domain": "www.drivers.tips",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "10150",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LELIF7KAHX6XFWHFFFPEC6CU2B2FQYCF",
"WARC-Concurrent-To": "<urn:uuid:c1179dc3-7317-4421-8233-0b35b5a8add9>",
"WARC-Date": "2017-03-28T02:23:04Z",
"WARC-IP-Address": "104.18.56.224",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:IAGIYTCC4MF6YF2VRW455SOMMT3I6P5S",
"WARC-Record-ID": "<urn:uuid:5f8ef0f8-b9b1-4868-bc4b-ef3875babdbe>",
"WARC-Target-URI": "http://www.drivers.tips/Acer/Travelmate_4200/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:54e5d893-59c7-4894-b67f-ae38f6162993>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
13,
14,
43,
44,
711,
994,
1010,
1037,
1072,
1108,
1543,
1796,
1920,
1968,
2231,
2520,
2817,
3311,
3831,
4374,
4775,
4855,
4941,
5093,
5173,
5221,
5280,
5434,
5494,
5553,
5591
],
"line_end_idx": [
13,
14,
43,
44,
711,
994,
1010,
1037,
1072,
1108,
1543,
1796,
1920,
1968,
2231,
2520,
2817,
3311,
3831,
4374,
4775,
4855,
4941,
5093,
5173,
5221,
5280,
5434,
5494,
5553,
5591,
5660
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5660,
"ccnet_original_nlines": 31,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.45375218987464905,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011343800462782383,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15619546175003052,
"rps_doc_frac_unique_words": 0.31786075234413147,
"rps_doc_mean_word_length": 4.53582239151001,
"rps_doc_num_sentences": 66,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.064199447631836,
"rps_doc_word_count": 991,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06985539197921753,
"rps_doc_frac_chars_dupe_6grams": 0.014238039962947369,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04671857878565788,
"rps_doc_frac_chars_top_3gram": 0.04004449024796486,
"rps_doc_frac_chars_top_4gram": 0.02780867926776409,
"rps_doc_books_importance": -455.0868835449219,
"rps_doc_books_importance_length_correction": -455.0868835449219,
"rps_doc_openwebtext_importance": -285.28521728515625,
"rps_doc_openwebtext_importance_length_correction": -285.28521728515625,
"rps_doc_wikipedia_importance": -171.8095703125,
"rps_doc_wikipedia_importance_length_correction": -171.8095703125
},
"fasttext": {
"dclm": 0.15684932470321655,
"english": 0.9466570615768433,
"fineweb_edu_approx": 2.0943870544433594,
"eai_general_math": 0.20256060361862183,
"eai_open_web_math": 0.22423386573791504,
"eai_web_code": 0.1755286455154419
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-6,674,404,547,012,496,000 | Free to use with no registration required. Online Word Cloud Generator Paste text to automatically generate a Word Cloud! Simply enter your scrambled letters you wish to unscramble in the first input field, labeled Enter your letters here.Now press the Generate button and get words that can be created from your scrambled letters. i would like to share with you laravel 7 generate word document. Populate a Microsoft Word template: Reads a Microsoft Word template to then fill the template fields with selected dynamic values to generate a Word document. Azgaar's Fantasy Map Generator and Editor. You'll learn laravel 7 generate docx. You have plenty of tools available to tame those crafty fractal generators. An online tool for creating word search puzzles which can be played instantly or printed out. Save or share the resulting image. In other words, you can provide additional source code as input to a compilation while the code is being compiled. If you want to use random (yet coherent) text as filler content in your Word document, you can use the random content generation formula provided by Word. Mission completed! Paste text or upload documents and select shape, colors and font to create your own word cloud. A world file is a six line plain text sidecar file used by geographic information systems (GIS) to georeference raster map images. About word clouds. This newly improved and still free online word converter tool will take the contents of a doc or docx file and convert the word text into HTML code. You are just able to use this generator for the next 14:44 minutes! The importance of each word is shown with font size or color. Download test files of any size. A secured protocol is used to convert PDF to Word. Which is quite easy to perform. The word processor converters supplied with Word create temporary files in Rich Text Format (RTF), which Word uses to access specific converters. Partilhe-os com outros utilizadores e trabalhe em conjunto ao mesmo tempo. The first generator gives you strongly typed access to CSV data. Guarde documentos no OneDrive. It uses Intergovernmental Panel on Climate Change (IPCC) Third Assessment Report model summary data of the HadCM3 A2 experiment ensemble which is available … What name, what logo and others of this kind. It's very useful for generating fancy symbols to make your profile fantastic.. Fantasy Calendar Generator; Fantasy World Generator; Medieval Demographics Calculator; My Random Campaign; Random Adventure Generator; Random Dungeon Generator; Random Inn Generator; Random Town Generator There are, however, a few notes to make when using this function, depending on how much text you need. Wait for the conversion process to finish. Convert Word Document to PDF: Gets a PDF version of the selected file. Сlick the arrow button for options. Random Word Generator has had 1 … Obtaining the JSON file. RoadGenerator is a module script that I put together that will allow you to generate real world roads from a JSON file containing the road data. How to use. When combined, these two things are what make Source Generators so useful. Generate Random Text with the Rand Formula. Struggle with a report you can't complete? Then we grabbed the most popular words and built this word randomizer. Corrupt any file with our free, online service. First you need to obtain your JSON file containing the road data. Our online text fonts generator converts your simple text into Stylish & Cool Text. This article will give you simple example of create doc file in php laravel 7 example. We trimmed some fat to take away really odd words and determiners. The size of a word shows how important it is e.g. Click the UPLOAD FILES button and select up to 20 Word files you wish to convert. Download the results either file by file or click the DOWNLOAD ALL button to get them all at once in a ZIP archive. Mods 220,658 Downloads Last Updated: Jan 17, 2021 Game Version: 1.16.5. World of Tanks online generator. This format is useful for quickly perceiving the most prominent terms and for locating a term alphabetically to determine its relative prominence. Import a hand drawn mockup if you'd like, or design completely within World Machine. These kinds of generators mostly combine to words to a fantasy name. You just need to some step to done create word document file in laravel 7. A word cloud is a graphical representation of word frequency. A word cloud is an image made of words that together resemble a cloudy shape. The basic feature is to unscramble words from a bunch of letters. Locked Files (Temp Directory) When you open a file that is locked, either because it is open in another window of Word or because another user on the network has it open, you can work with a copy of the file. How to corrupt a file? Random Word Generator. Tired with this code which won't work? Business Name Generator. Creating a new business, there are ever some basic tasks. What is CCWorldWeatherGen? Wordclouds.com is a free online word cloud generator and tag cloud generator, similar to Wordle. The climate change world weather file generator (CCWorldWeatherGen) allows you to generate climate change weather files for world-wide locations ready for use in building performance simulation programs. You can use our tool to generate your .htaccess/.htpasswd files fast and easily. Download over the network or generate large files on your machine. To generate MS Word (.docx) document now, simply drag and drop any PDF file here We secure your files and data privacy! How does word generator work. Quickly and easily generate .htaccess files to prevent indexing issues, redirect pages or cache files..htaccess Generator. Load from a file, or guide mountains with our tools; Detail with fractal noise, then erode the results; Sketch the location of major rivers and have them carve river valleys. Phillip introduced C# Source Generators here. Download crunch - wordlist generator for free. All files are totally safe and protected. Download Random Word Generator for Windows to generate random, artificial words using a configurable method of construction. This doc converter strips as many unnecessary styles and extra mark-up code as it can. Recent Files View All. Mod to pregenerate MC World ... World Pre Generator. Random file generator - Magnetic energy generator. crunch can generate all possible combinations and permutations. Even more serial numbers might be present in our database for this title. Fake Credit Card Generator You can build Word templates on either Windows or your Mac by enabling the Developer tab. The file specification was introduced by Esri, and consists of six coefficients of an affine transformation that describes the location, scale and rotation of … Here, i will show you how to works laravel 7 generate word document. It's the Best Text Fonts Generator website in the whole world. From there you can easily order some logo and the rest of the branding. This post describes two new generators that we added to the samples project in the Roslyn SDK github repo. Send us your file and we corrupt it. Find all the serial numbers we have in our database for: . People typically use word clouds to easily produce a summary of large documents (reports, speeches), to create art on a topic (gifts, displays) or to visualise data (tables, surveys). The second one creates string constants based on Mustache specifications. Random File Generator generator A dynamo or similar machine for converting mechanical energy into electricity an apparatus that produces a vapor or gas A thing that generates something, in particular engine that converts mechanical energy into electrical energy by electromagnetic induction someone who originates or causes or initiates… Crunch is a wordlist generator where you can specify a standard character set or a character set you specify. Colabore gratuitamente com uma versão online do Microsoft Word. Wordclouds.com can also generate clickable word clouds with links (image map). Currently I have a flow that takes my JSON data from my PowerApps and using the Word Business I have populated a word template. Windows includes a utility that allows you to quickly generate a file of any size instantly. Open an administrative level command prompt. Including 1GB, 2GB, 5GB, 10GB or generate a file of any size. Supposedly there are over one million words in the English Language. Using RoadGenerator is quite simple. What I would like is to have a copy of the same file in the same spot but a PDF version. Just keep clicking generate—chances are you won't find a repeat! Bored by this Excel sheet? It produces a much cleaner html code than the Microsoft Word software normally produces. Erode, create rivers and lakes, apply sediments, transform, stylize, simulate water flow and sediment transport as well as sediment deposit, and so much more, entirely in real-time. Your boss, customer or teacher will think you delivered on time, yet he can't open it due to technology hassle. This text fonts website allows you to generate cool text fonts that you can copy and paste into your online social account. how often it appears in a text — its frequency. after that the word generated file is saved in the Shared Documents in my Share Point site. Zoom in to see the map in details Here is a business name generator really helpful. Create your own word clouds and tag clouds. World Creators unique and powerful generator allows you to apply and combine many different kind of filters to modify the terrain you created or imported from another source. Generate C# source files that can be added to a Compilation object during the course of compilation. Convert Word DOC to HTML. The importance of each word is shown with font size or color font to create your own cloud. You can use our tool to generate cool text fonts Generator converts your text! ( image map ) it appears in a ZIP archive are ever some tasks. Or printed out use this Generator for the next 14:44 minutes from there you can copy and paste into online! Two new generators that we added to a compilation object during the course of compilation have populated a cloud! When combined, these two things are what make source generators so useful laravel 7 online service you specify 220,658! Generators that we added to a compilation object during the course of compilation each word is shown with font or! Laravel 7 example term alphabetically to determine its relative prominence Generator has had 1 … Business name.... Spot but a PDF version Colabore gratuitamente com uma versão online do Microsoft word boss. To have a flow that takes my JSON data from my PowerApps and using word. Social account or teacher will think you delivered on time, yet he ca n't open it to...: Jan 17, 2021 Game version: 1.16.5 Windows to generate your.htaccess/.htpasswd files fast and easily using configurable! What name, what logo and the rest of the same file in the English Language PDF... Files fast and easily generate.htaccess files to prevent indexing issues, redirect pages or files... Windows includes a utility that allows you to generate cool text delivered on time, yet he ca open. Logo and others of this kind to 20 word files you wish to convert many styles! Styles and extra mark-up code as input to a fantasy name crafty fractal generators doc. Outros utilizadores e trabalhe em conjunto ao mesmo tempo to automatically generate a word cloud Generator paste to... You are just able to use this Generator for Windows to generate cool.! Compilation while the code is being compiled serial numbers we have in our database for this.... Within World machine of generators mostly combine to words to a fantasy name over the network or generate large on! To some step to done create word document to PDF: Gets a version... Compilation while the code is being compiled very useful for generating fancy symbols to make when using function! Able to use this Generator for the next 14:44 minutes gives you typed! We have in our database for this title input to a compilation while code. Same spot but a PDF version also generate clickable word clouds with links ( image map..: Jan 17, 2021 Game version: 1.16.5 just keep clicking generate—chances are wo! Or a character set you specify he ca n't open it due technology! My JSON data from my PowerApps and using the word Business I have a flow takes... C # source files that can be added to the samples project in the English Language Generator... Within World machine website in the Roslyn SDK github repo doc file in laravel.... Populated a word shows how important it is e.g and font to create your own word is... 'D world file generator, or design completely within World machine 2GB, 5GB, 10GB or generate large files on machine! Post describes two new generators that we added to a compilation object during the course of compilation word you! Be present in our database for: file containing the road data generate—chances... Built this word randomizer name, what logo and the rest of the branding boss, customer teacher. Your simple text world file generator Stylish & cool text the English Language much cleaner code. Saved in the whole World as many unnecessary styles and extra mark-up code as input a! Fantasy name in the whole World any file with our free, online service to done create word.! Course of compilation our free, online service cloud Generator paste text automatically. This article will give you simple example of create doc file in 7! Set you specify word software normally world file generator mesmo tempo, redirect pages or cache..... 'S very useful for quickly perceiving the most prominent terms and for locating term... From there you can easily order some logo and the rest of the selected.! In our database for: protocol is used to convert PDF to word the upload files button select! Social account.htaccess/.htpasswd files fast and easily generate.htaccess files to prevent indexing issues, redirect pages or files!, a few notes to make your profile fantastic first Generator gives you world file generator typed access to CSV.! Terms and for locating a term alphabetically to determine its relative prominence in the same but... For locating a term alphabetically to determine its relative prominence you have plenty of tools available to tame crafty! Doc converter strips as many unnecessary styles and extra mark-up code as input to a fantasy name machine. Serial numbers we have in our database for this title bunch of letters copy and paste your! Profile fantastic mostly combine to words to a compilation object during the course of compilation your machine gratuitamente! Up to 20 word files you wish to convert in laravel 7 generate word document to PDF Gets... Pdf version can specify a standard character set you specify, customer or teacher will you! As many unnecessary styles and extra mark-up code as it can tool to generate,... Pdf: Gets a PDF version of the same spot but a version! Results either file by file or click the download all button to get them all at once a! 14:44 minutes for the next 14:44 minutes have populated a word shows how important it e.g... When using this function, depending on how much text you need to your., customer or teacher will think you delivered on time, yet he ca n't it... Upload files button and select shape, colors and font to create own! Ever some basic tasks while the code is being compiled create your own cloud... Jan 17, 2021 Game version: 1.16.5 object during the course of compilation that... The size of a word cloud generated file is saved in the documents... 10Gb or generate large files on your machine crunch is a graphical representation of word frequency built... Rest of the same spot but a PDF version a hand drawn mockup if you 'd,! Or color tame those crafty fractal generators my share Point site Best text fonts website allows you to generate.htaccess/.htpasswd! Often it appears in a ZIP archive one million words in the English Language first you to! Strongly typed access to CSV data where you can easily order some logo and others of kind... You laravel 7 example it appears in a ZIP archive words and built this word.. Give you simple example of create doc file in laravel 7 generate word document find... Often it appears in a text — its frequency free, online service generate... Character set you specify Windows or your Mac by enabling the Developer tab instantly printed! After that the word Business I have world file generator copy of the branding teacher will you. Into your online social account than the Microsoft word you delivered on time yet... Button and select shape, colors and font to create your own word cloud Best text fonts website you. Laravel 7 generate word document to PDF: Gets a PDF version of the branding yet he ca n't it. 1 … Business name Generator, customer or teacher will think you delivered on time, yet he ca open.
Led Structure In Optical Communication, Simpson Strong-tie® Fascia Board Screws, Jci Accreditation Hospitals, Infinity Primus P163 Specs, Farmtrac Dealers Near Me, Marketing Management In Small Business Pdf, | {
"url": "http://lapvet.sk/eyy040y/8e3d2b-world-file-generator",
"source_domain": "lapvet.sk",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "22043",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BWETJCCMIDKBBJBQOCLAHH3XNLLVBWQL",
"WARC-Concurrent-To": "<urn:uuid:96144f8c-a2d0-4e98-880c-2b8244207c01>",
"WARC-Date": "2021-04-11T09:43:50Z",
"WARC-IP-Address": "37.9.175.13",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RQAQCXPKZCZPGH5YNHSUGP6IYPERIHIW",
"WARC-Record-ID": "<urn:uuid:72d21500-b691-4476-8141-94d8d072d74c>",
"WARC-Target-URI": "http://lapvet.sk/eyy040y/8e3d2b-world-file-generator",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:db6cf209-50d4-4116-ae09-ea936aaa4fe2>"
},
"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 ([email protected])\r\nhostname: ip-10-67-67-132.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
16896,
16897
],
"line_end_idx": [
16896,
16897,
17104
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 17104,
"ccnet_original_nlines": 2,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3658093810081482,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020574890077114105,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13222390413284302,
"rps_doc_frac_unique_words": 0.23650296032428741,
"rps_doc_mean_word_length": 4.795541763305664,
"rps_doc_num_sentences": 220,
"rps_doc_symbol_to_word_ratio": 0.011195160448551178,
"rps_doc_unigram_entropy": 5.6781134605407715,
"rps_doc_word_count": 2871,
"rps_doc_frac_chars_dupe_10grams": 0.1752614825963974,
"rps_doc_frac_chars_dupe_5grams": 0.4907030761241913,
"rps_doc_frac_chars_dupe_6grams": 0.43281522393226624,
"rps_doc_frac_chars_dupe_7grams": 0.34471237659454346,
"rps_doc_frac_chars_dupe_8grams": 0.2898750603199005,
"rps_doc_frac_chars_dupe_9grams": 0.2352556735277176,
"rps_doc_frac_chars_top_2gram": 0.005084250122308731,
"rps_doc_frac_chars_top_3gram": 0.007117949891835451,
"rps_doc_frac_chars_top_4gram": 0.008134810253977776,
"rps_doc_books_importance": -1816.457763671875,
"rps_doc_books_importance_length_correction": -1816.457763671875,
"rps_doc_openwebtext_importance": -1138.609375,
"rps_doc_openwebtext_importance_length_correction": -1138.609375,
"rps_doc_wikipedia_importance": -871.8197021484375,
"rps_doc_wikipedia_importance_length_correction": -871.8197021484375
},
"fasttext": {
"dclm": 0.061198171228170395,
"english": 0.8652535676956177,
"fineweb_edu_approx": 2.52605938911438,
"eai_general_math": 0.12588918209075928,
"eai_open_web_math": 0.13975226879119873,
"eai_web_code": 0.023702440783381462
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-7,531,147,588,475,012,000 | Adding Video to concrete5 Pages
adding video to concrete5 pages hero image
In addition to adding images to concrete5 pages, it is also possible to add video files, either directly or via YouTube. Whether it is a custom video, or sharing a favorite video from YouTube, video players serve as eye-catching elements on any web page. In this article, we will outline the process for adding video to concrete5 pages.
Adding Video to concrete5 Pages
1. First, log into your concrete5 account.
2. Next, access the page editor.
3. Once in the page editor, click the + sign to add blocks.
4. In the block menu, scroll down to the Multimedia section.
5. In the Multimedia section there are two options for video:
Video Player – This block allows you to import a video file that will then play back on the website in a video player interface.
YouTube Video – This block allows you to embed a youtube video in the page. the video needs to be live on youtube for this to function properly.
6. To add a video file, drag and drop the Video Player block into the desired area. This will open the video player menu.
7. Under the Video Files section of the video player menu, you have the option to upload a video file in a few different formats. Upload the file using one of the supported formats. You can also upload an image to function as a placeholder thumbnail image for the video before it starts playing. Generally, you want the placeholder image to accurately represent the contents of the video itself.
8. Once the file has been selected, the Video Size section allows you to select the size of the video player window. This is useful if you plan to have multiple high-resolution video players on a single page.
9. Once done, click the Add button to add the video file.
Congratulations, you now know how to add video to concrete5 pages!
Install WordPress, Drupal, and other programs in just a few clicks with Softaculous Instant installer.
InMotion Hosting Contributor
InMotion Hosting Contributor Content Writer
InMotion Hosting contributors are highly knowledgeable individuals who create relevant content on new trends and troubleshooting techniques to help you achieve your online goals!
More Articles by InMotion Hosting
Was this article helpful? Join the conversation! | {
"url": "https://www.inmotionhosting.com/support/edu/software/concrete5/video-to-concrete5/",
"source_domain": "www.inmotionhosting.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "382706",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ROJU6MRMRPENJLO3TLLIXIZAPE4KQT3M",
"WARC-Concurrent-To": "<urn:uuid:b1c4791f-52c9-4339-813f-f1f8e19b2c6c>",
"WARC-Date": "2024-03-01T04:05:47Z",
"WARC-IP-Address": "172.66.41.31",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SJR2Q6L3227MM4GFEISJTMX225N2FIC7",
"WARC-Record-ID": "<urn:uuid:34794e4c-469b-4ca8-82fb-eba901ba3b20>",
"WARC-Target-URI": "https://www.inmotionhosting.com/support/edu/software/concrete5/video-to-concrete5/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a51a6afa-fbb3-4027-a453-089d38dac43e>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-150\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
32,
33,
76,
77,
416,
417,
449,
450,
495,
530,
593,
657,
721,
722,
855,
856,
1006,
1130,
1529,
1741,
1802,
1803,
1870,
1871,
1974,
2003,
2047,
2048,
2227,
2228,
2262,
2263
],
"line_end_idx": [
32,
33,
76,
77,
416,
417,
449,
450,
495,
530,
593,
657,
721,
722,
855,
856,
1006,
1130,
1529,
1741,
1802,
1803,
1870,
1871,
1974,
2003,
2047,
2048,
2227,
2228,
2262,
2263,
2311
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2311,
"ccnet_original_nlines": 32,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3558558523654938,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14639639854431152,
"rps_doc_frac_unique_words": 0.4613402187824249,
"rps_doc_mean_word_length": 4.701030731201172,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.606042861938477,
"rps_doc_word_count": 388,
"rps_doc_frac_chars_dupe_10grams": 0.059210531413555145,
"rps_doc_frac_chars_dupe_5grams": 0.08223684132099152,
"rps_doc_frac_chars_dupe_6grams": 0.08223684132099152,
"rps_doc_frac_chars_dupe_7grams": 0.059210531413555145,
"rps_doc_frac_chars_dupe_8grams": 0.059210531413555145,
"rps_doc_frac_chars_dupe_9grams": 0.059210531413555145,
"rps_doc_frac_chars_top_2gram": 0.04385964944958687,
"rps_doc_frac_chars_top_3gram": 0.05263157933950424,
"rps_doc_frac_chars_top_4gram": 0.05756578966975212,
"rps_doc_books_importance": -250.567626953125,
"rps_doc_books_importance_length_correction": -250.567626953125,
"rps_doc_openwebtext_importance": -138.98214721679688,
"rps_doc_openwebtext_importance_length_correction": -138.98214721679688,
"rps_doc_wikipedia_importance": -107.66193389892578,
"rps_doc_wikipedia_importance_length_correction": -107.66193389892578
},
"fasttext": {
"dclm": 0.0512886606156826,
"english": 0.8331138491630554,
"fineweb_edu_approx": 1.324041485786438,
"eai_general_math": 0.018463850021362305,
"eai_open_web_math": 0.127241313457489,
"eai_web_code": 0.004073800053447485
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "006.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
6,923,805,285,665,195,000 | Home Anything Goes
At The Mix, we want to make our services as helpful as we can. To do this, we’d love to ask you a few questions about you, your visit to The Mix and its impact. It should take only about 5-10 minutes to complete. Take this survey and get a chance at winning a £200 Amazon voucher.
Come and join our Support Circle, every Tuesday, 8 - 9:30pm! Sign up here
I would like a phone and camera
2»
Comments
• Former MemberFormer Member Posts: 1,876,324 The Mix Honorary Guru
:eek2:
No no no!!
upload it to imageshack or somewhere free, write down the url (http://www.imageshack.us/image) or something, then type it into your WAP browser and it will say there is a download do you want to download, say yes. Completely free :cool:
Thanks for the tip.
I'm not sure I trust any make other than nokia. Actually, my girlfriend just got a nice one... cant remember the make now :p. It slides! But it doesn't break!!! Siemens are absolute piles of shit. Whats a cheap and cheerful but goes for ages kinda phone? With a nice screen, preferably :)
You mean it slides like the Samsung D600?
I used to have a nOkia, but I'm not sure if it's what you want - it's a 3200 and the camera isn't that good, tbh.
• Former MemberFormer Member Posts: 1,876,324 The Mix Honorary Guru
Sofie wrote:
You mean it slides like the Samsung D600?
I used to have a nOkia, but I'm not sure if it's what you want - it's a 3200 and the camera isn't that good, tbh.
I think its either that or the mini one of them. really little phone :p I do like her phone actually. I'm not too fussed. Just something that works. And is practical. Preferably with a nice big screen :p
Sign In or Register to comment. | {
"url": "https://community.themix.org.uk/discussion/comment/2114323",
"source_domain": "community.themix.org.uk",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "101510",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LL7G5GN4BIZZ4JTC6IH2LJH5KTMM537O",
"WARC-Concurrent-To": "<urn:uuid:189a9ce4-05ee-43e8-82ba-4c26def8b6a3>",
"WARC-Date": "2021-09-17T00:29:25Z",
"WARC-IP-Address": "162.159.128.79",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BBRSX2FTKM7GLZEBQMI7TG7DMHFEACRM",
"WARC-Record-ID": "<urn:uuid:88f4fb0d-575f-40ab-a110-a0be2c51d478>",
"WARC-Target-URI": "https://community.themix.org.uk/discussion/comment/2114323",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f305cc10-27f8-458b-a542-f15c09076f5f>"
},
"warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-22\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
19,
301,
375,
376,
408,
409,
412,
413,
422,
423,
493,
504,
505,
520,
521,
762,
763,
787,
1080,
1081,
1127,
1245,
1315,
1332,
1378,
1496,
1497,
1705
],
"line_end_idx": [
19,
301,
375,
376,
408,
409,
412,
413,
422,
423,
493,
504,
505,
520,
521,
762,
763,
787,
1080,
1081,
1127,
1245,
1315,
1332,
1378,
1496,
1497,
1705,
1736
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1736,
"ccnet_original_nlines": 28,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42168673872947693,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03132529929280281,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22891566157341003,
"rps_doc_frac_unique_words": 0.522292971611023,
"rps_doc_mean_word_length": 4.070063591003418,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0.0024096400011330843,
"rps_doc_unigram_entropy": 4.808260440826416,
"rps_doc_word_count": 314,
"rps_doc_frac_chars_dupe_10grams": 0.2629108130931854,
"rps_doc_frac_chars_dupe_5grams": 0.2629108130931854,
"rps_doc_frac_chars_dupe_6grams": 0.2629108130931854,
"rps_doc_frac_chars_dupe_7grams": 0.2629108130931854,
"rps_doc_frac_chars_dupe_8grams": 0.2629108130931854,
"rps_doc_frac_chars_dupe_9grams": 0.2629108130931854,
"rps_doc_frac_chars_top_2gram": 0.018779339268803596,
"rps_doc_frac_chars_top_3gram": 0.0211267601698637,
"rps_doc_frac_chars_top_4gram": 0.03912362828850746,
"rps_doc_books_importance": -188.4146270751953,
"rps_doc_books_importance_length_correction": -178.37744140625,
"rps_doc_openwebtext_importance": -117.46199798583984,
"rps_doc_openwebtext_importance_length_correction": -117.46199798583984,
"rps_doc_wikipedia_importance": -68.94632720947266,
"rps_doc_wikipedia_importance_length_correction": -62.7845458984375
},
"fasttext": {
"dclm": 0.021878600120544434,
"english": 0.9554131627082825,
"fineweb_edu_approx": 0.8983005881309509,
"eai_general_math": 0.05167299881577492,
"eai_open_web_math": 0.19243431091308594,
"eai_web_code": 0.000754480017349124
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.68",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
4,706,970,529,967,449,000 | Changes of the V4L2 API
Early Versions
V4L2 Version 0.16 1999-01-31
V4L2 Version 0.18 1999-03-16
V4L2 Version 0.19 1999-06-05
V4L2 Version 0.20 (1999-09-10)
V4L2 Version 0.20 incremental changes
V4L2 Version 0.20 2000-11-23
V4L2 Version 0.20 2002-07-25
V4L2 in Linux 2.5.46, 2002-10
V4L2 2003-06-19
V4L2 2003-11-05
V4L2 in Linux 2.6.6, 2004-05-09
V4L2 in Linux 2.6.8
V4L2 spec erratum 2004-08-01
V4L2 in Linux 2.6.14
V4L2 in Linux 2.6.15
V4L2 spec erratum 2005-11-27
V4L2 spec erratum 2006-01-10
V4L2 spec erratum 2006-02-03
V4L2 spec erratum 2006-02-04
V4L2 in Linux 2.6.17
V4L2 spec erratum 2006-09-23 (Draft 0.15)
V4L2 in Linux 2.6.18
V4L2 in Linux 2.6.19
V4L2 spec erratum 2006-10-12 (Draft 0.17)
V4L2 in Linux 2.6.21
V4L2 in Linux 2.6.22
V4L2 in Linux 2.6.24
V4L2 in Linux 2.6.25
V4L2 in Linux 2.6.26
V4L2 in Linux 2.6.27
V4L2 in Linux 2.6.28
V4L2 in Linux 2.6.29
V4L2 in Linux 2.6.30
V4L2 in Linux 2.6.32
V4L2 in Linux 2.6.33
V4L2 in Linux 2.6.34
V4L2 in Linux 2.6.37
V4L2 in Linux 2.6.39
V4L2 in Linux 3.1
V4L2 in Linux 3.2
V4L2 in Linux 3.3
V4L2 in Linux 3.4
V4L2 in Linux 3.5
V4L2 in Linux 3.6
V4L2 in Linux 3.9
V4L2 in Linux 3.10
V4L2 in Linux 3.11
V4L2 in Linux 3.14
V4L2 in Linux 3.15
V4L2 in Linux 3.16
V4L2 in Linux 3.17
V4L2 in Linux 3.18
V4L2 in Linux 3.19
V4L2 in Linux 4.4
Relation of V4L2 to other Linux multimedia APIs
Experimental API Elements
Obsolete API Elements
Soon after the V4L API was added to the kernel it was criticised as too inflexible. In August 1998 Bill Dirks proposed a number of improvements and began to work on documentation, example drivers and applications. With the help of other volunteers this eventually became the V4L2 API, not just an extension but a replacement for the V4L API. However it took another four years and two stable kernel releases until the new API was finally accepted for inclusion into the kernel in its present form.
Early Versions
1998-08-20: First version.
1998-08-27: The select() function was introduced.
1998-09-10: New video standard interface.
1998-09-18: The VIDIOC_NONCAP ioctl was replaced by the otherwise meaningless O_TRUNC open() flag, and the aliases O_NONCAP and O_NOIO were defined. Applications can set this flag if they intend to access controls only, as opposed to capture applications which need exclusive access. The VIDEO_STD_XXX identifiers are now ordinals instead of flags, and the video_std_construct() helper function takes id and transmission arguments.
1998-09-28: Revamped video standard. Made video controls individually enumerable.
1998-10-02: The id field was removed from struct video_standard and the color subcarrier fields were renamed. The VIDIOC_QUERYSTD ioctl was renamed to VIDIOC_ENUMSTD, VIDIOC_G_INPUT to VIDIOC_ENUMINPUT. A first draft of the Codec API was released.
1998-11-08: Many minor changes. Most symbols have been renamed. Some material changes to struct v4l2_capability.
1998-11-12: The read/write directon of some ioctls was misdefined.
1998-11-14: V4L2_PIX_FMT_RGB24 changed to V4L2_PIX_FMT_BGR24, and V4L2_PIX_FMT_RGB32 changed to V4L2_PIX_FMT_BGR32. Audio controls are now accessible with the VIDIOC_G_CTRL and VIDIOC_S_CTRL ioctls under names starting with V4L2_CID_AUDIO. The V4L2_MAJOR define was removed from videodev.h since it was only used once in the videodev kernel module. The YUV422 and YUV411 planar image formats were added.
1998-11-28: A few ioctl symbols changed. Interfaces for codecs and video output devices were added.
1999-01-14: A raw VBI capture interface was added.
1999-01-19: The VIDIOC_NEXTBUF ioctl was removed.
V4L2 Version 0.16 1999-01-31
1999-01-27: There is now one QBUF ioctl, VIDIOC_QWBUF and VIDIOC_QRBUF are gone. VIDIOC_QBUF takes a v4l2_buffer as a parameter. Added digital zoom (cropping) controls.
V4L2 Version 0.18 1999-03-16
Added a v4l to V4L2 ioctl compatibility layer to videodev.c. Driver writers, this changes how you implement your ioctl handler. See the Driver Writer's Guide. Added some more control id codes.
V4L2 Version 0.19 1999-06-05
1999-03-18: Fill in the category and catname fields of v4l2_queryctrl objects before passing them to the driver. Required a minor change to the VIDIOC_QUERYCTRL handlers in the sample drivers.
1999-03-31: Better compatibility for v4l memory capture ioctls. Requires changes to drivers to fully support new compatibility features, see Driver Writer's Guide and v4l2cap.c. Added new control IDs: V4L2_CID_HFLIP, _VFLIP. Changed V4L2_PIX_FMT_YUV422P to _YUV422P, and _YUV411P to _YUV411P.
1999-04-04: Added a few more control IDs.
1999-04-07: Added the button control type.
1999-05-02: Fixed a typo in videodev.h, and added the V4L2_CTRL_FLAG_GRAYED (later V4L2_CTRL_FLAG_GRABBED) flag.
1999-05-20: Definition of VIDIOC_G_CTRL was wrong causing a malfunction of this ioctl.
1999-06-05: Changed the value of V4L2_CID_WHITENESS.
V4L2 Version 0.20 (1999-09-10)
Version 0.20 introduced a number of changes which were not backward compatible with 0.19 and earlier versions. Purpose of these changes was to simplify the API, while making it more extensible and following common Linux driver API conventions.
1. Some typos in V4L2_FMT_FLAG symbols were fixed. struct v4l2_clip was changed for compatibility with v4l. (1999-08-30)
2. V4L2_TUNER_SUB_LANG1 was added. (1999-09-05)
3. All ioctl() commands that used an integer argument now take a pointer to an integer. Where it makes sense, ioctls will return the actual new value in the integer pointed to by the argument, a common convention in the V4L2 API. The affected ioctls are: VIDIOC_PREVIEW, VIDIOC_STREAMON, VIDIOC_STREAMOFF, VIDIOC_S_FREQ, VIDIOC_S_INPUT, VIDIOC_S_OUTPUT, VIDIOC_S_EFFECT. For example
err = ioctl (fd, VIDIOC_XXX, V4L2_XXX);
becomes
int a = V4L2_XXX; err = ioctl(fd, VIDIOC_XXX, &a);
4. All the different get- and set-format commands were swept into one VIDIOC_G_FMT and VIDIOC_S_FMT ioctl taking a union and a type field selecting the union member as parameter. Purpose is to simplify the API by eliminating several ioctls and to allow new and driver private data streams without adding new ioctls.
This change obsoletes the following ioctls: VIDIOC_S_INFMT, VIDIOC_G_INFMT, VIDIOC_S_OUTFMT, VIDIOC_G_OUTFMT, VIDIOC_S_VBIFMT and VIDIOC_G_VBIFMT. The image format structure v4l2_format was renamed to struct v4l2_pix_format, while struct v4l2_format is now the envelopping structure for all format negotiations.
5. Similar to the changes above, the VIDIOC_G_PARM and VIDIOC_S_PARM ioctls were merged with VIDIOC_G_OUTPARM and VIDIOC_S_OUTPARM. A type field in the new struct v4l2_streamparm selects the respective union member.
This change obsoletes the VIDIOC_G_OUTPARM and VIDIOC_S_OUTPARM ioctls.
6. Control enumeration was simplified, and two new control flags were introduced and one dropped. The catname field was replaced by a group field.
Drivers can now flag unsupported and temporarily unavailable controls with V4L2_CTRL_FLAG_DISABLED and V4L2_CTRL_FLAG_GRABBED respectively. The group name indicates a possibly narrower classification than the category. In other words, there may be multiple groups within a category. Controls within a group would typically be drawn within a group box. Controls in different categories might have a greater separation, or may even appear in separate windows.
7. The struct v4l2_buffer timestamp was changed to a 64 bit integer, containing the sampling or output time of the frame in nanoseconds. Additionally timestamps will be in absolute system time, not starting from zero at the beginning of a stream. The data type name for timestamps is stamp_t, defined as a signed 64-bit integer. Output devices should not send a buffer out until the time in the timestamp field has arrived. I would like to follow SGI's lead, and adopt a multimedia timestamping system like their UST (Unadjusted System Time). See http://web.archive.org/web/*/http://reality.sgi.com /cpirazzi_engr/lg/time/intro.html. UST uses timestamps that are 64-bit signed integers (not struct timeval's) and given in nanosecond units. The UST clock starts at zero when the system is booted and runs continuously and uniformly. It takes a little over 292 years for UST to overflow. There is no way to set the UST clock. The regular Linux time-of-day clock can be changed periodically, which would cause errors if it were being used for timestamping a multimedia stream. A real UST style clock will require some support in the kernel that is not there yet. But in anticipation, I will change the timestamp field to a 64-bit integer, and I will change the v4l2_masterclock_gettime() function (used only by drivers) to return a 64-bit integer.
8. A sequence field was added to struct v4l2_buffer. The sequence field counts captured frames, it is ignored by output devices. When a capture driver drops a frame, the sequence number of that frame is skipped.
V4L2 Version 0.20 incremental changes
1999-12-23: In struct v4l2_vbi_format the reserved1 field became offset. Previously drivers were required to clear the reserved1 field.
2000-01-13: The V4L2_FMT_FLAG_NOT_INTERLACED flag was added.
2000-07-31: The linux/poll.h header is now included by videodev.h for compatibility with the original videodev.h file.
2000-11-20: V4L2_TYPE_VBI_OUTPUT and V4L2_PIX_FMT_Y41P were added.
2000-11-25: V4L2_TYPE_VBI_INPUT was added.
2000-12-04: A couple typos in symbol names were fixed.
2001-01-18: To avoid namespace conflicts the fourcc macro defined in the videodev.h header file was renamed to v4l2_fourcc.
2001-01-25: A possible driver-level compatibility problem between the videodev.h file in Linux 2.4.0 and the videodev.h file included in the videodevX patch was fixed. Users of an earlier version of videodevX on Linux 2.4.0 should recompile their V4L and V4L2 drivers.
2001-01-26: A possible kernel-level incompatibility between the videodev.h file in the videodevX patch and the videodev.h file in Linux 2.2.x with devfs patches applied was fixed.
2001-03-02: Certain V4L ioctls which pass data in both direction although they are defined with read-only parameter, did not work correctly through the backward compatibility layer. [Solution?]
2001-04-13: Big endian 16-bit RGB formats were added.
2001-09-17: New YUV formats and the VIDIOC_G_FREQUENCY and VIDIOC_S_FREQUENCY ioctls were added. (The old VIDIOC_G_FREQ and VIDIOC_S_FREQ ioctls did not take multiple tuners into account.)
2000-09-18: V4L2_BUF_TYPE_VBI was added. This may break compatibility as the VIDIOC_G_FMT and VIDIOC_S_FMT ioctls may fail now if the struct v4l2_fmt type field does not contain V4L2_BUF_TYPE_VBI. In the documentation of the struct v4l2_vbi_format offset field the ambiguous phrase "rising edge" was changed to "leading edge".
V4L2 Version 0.20 2000-11-23
A number of changes were made to the raw VBI interface.
1. Figures clarifying the line numbering scheme were added to the V4L2 API specification. The start[0] and start[1] fields no longer count line numbers beginning at zero. Rationale: a) The previous definition was unclear. b) The start[] values are ordinal numbers. c) There is no point in inventing a new line numbering scheme. We now use line number as defined by ITU-R, period. Compatibility: Add one to the start values. Applications depending on the previous semantics may not function correctly.
2. The restriction "count[0] > 0 and count[1] > 0" has been relaxed to "(count[0] + count[1]) > 0". Rationale: Drivers may allocate resources at scan line granularity and some data services are transmitted only on the first field. The comment that both count values will usually be equal is misleading and pointless and has been removed. This change breaks compatibility with earlier versions: Drivers may return EINVAL, applications may not function correctly.
3. Drivers are again permitted to return negative (unknown) start values as proposed earlier. Why this feature was dropped is unclear. This change may break compatibility with applications depending on the start values being positive. The use of EBUSY and EINVAL error codes with the VIDIOC_S_FMT ioctl was clarified. The EBUSY error code was finally documented, and the reserved2 field which was previously mentioned only in the videodev.h header file.
4. New buffer types V4L2_TYPE_VBI_INPUT and V4L2_TYPE_VBI_OUTPUT were added. The former is an alias for the old V4L2_TYPE_VBI, the latter was missing in the videodev.h file.
V4L2 Version 0.20 2002-07-25
Added sliced VBI interface proposal.
V4L2 in Linux 2.5.46, 2002-10
Around October-November 2002, prior to an announced feature freeze of Linux 2.5, the API was revised, drawing from experience with V4L2 0.20. This unnamed version was finally merged into Linux 2.5.46.
1. As specified in the section called “Related Devices”, drivers must make related device functions available under all minor device numbers.
2. The open() function requires access mode O_RDWR regardless of the device type. All V4L2 drivers exchanging data with applications must support the O_NONBLOCK flag. The O_NOIO flag, a V4L2 symbol which aliased the meaningless O_TRUNC to indicate accesses without data exchange (panel applications) was dropped. Drivers must stay in "panel mode" until the application attempts to initiate a data exchange, see the section called “Opening and Closing Devices”.
3. The struct v4l2_capability changed dramatically. Note that also the size of the structure changed, which is encoded in the ioctl request code, thus older V4L2 devices will respond with an EINVAL error code to the new VIDIOC_QUERYCAP ioctl.
There are new fields to identify the driver, a new RDS device function V4L2_CAP_RDS_CAPTURE, the V4L2_CAP_AUDIO flag indicates if the device has any audio connectors, another I/O capability V4L2_CAP_ASYNCIO can be flagged. In response to these changes the type field became a bit set and was merged into the flags field. V4L2_FLAG_TUNER was renamed to V4L2_CAP_TUNER, V4L2_CAP_VIDEO_OVERLAY replaced V4L2_FLAG_PREVIEW and V4L2_CAP_VBI_CAPTURE and V4L2_CAP_VBI_OUTPUT replaced V4L2_FLAG_DATA_SERVICE. V4L2_FLAG_READ and V4L2_FLAG_WRITE were merged into V4L2_CAP_READWRITE.
The redundant fields inputs, outputs and audios were removed. These properties can be determined as described in the section called “Video Inputs and Outputs” and the section called “Audio Inputs and Outputs”.
The somewhat volatile and therefore barely useful fields maxwidth, maxheight, minwidth, minheight, maxframerate were removed. This information is available as described in the section called “Data Formats” and the section called “Video Standards”.
V4L2_FLAG_SELECT was removed. We believe the select() function is important enough to require support of it in all V4L2 drivers exchanging data with applications. The redundant V4L2_FLAG_MONOCHROME flag was removed, this information is available as described in the section called “Data Formats”.
4. In struct v4l2_input the assoc_audio field and the capability field and its only flag V4L2_INPUT_CAP_AUDIO was replaced by the new audioset field. Instead of linking one video input to one audio input this field reports all audio inputs this video input combines with.
New fields are tuner (reversing the former link from tuners to video inputs), std and status.
Accordingly struct v4l2_output lost its capability and assoc_audio fields. audioset, modulator and std where added instead.
5. The struct v4l2_audio field audio was renamed to index, for consistency with other structures. A new capability flag V4L2_AUDCAP_STEREO was added to indicated if the audio input in question supports stereo sound. V4L2_AUDCAP_EFFECTS and the corresponding V4L2_AUDMODE flags where removed. This can be easily implemented using controls. (However the same applies to AVL which is still there.)
Again for consistency the struct v4l2_audioout field audio was renamed to index.
6. The struct v4l2_tuner input field was replaced by an index field, permitting devices with multiple tuners. The link between video inputs and tuners is now reversed, inputs point to their tuner. The std substructure became a simple set (more about this below) and moved into struct v4l2_input. A type field was added.
Accordingly in struct v4l2_modulator the output was replaced by an index field.
In struct v4l2_frequency the port field was replaced by a tuner field containing the respective tuner or modulator index number. A tuner type field was added and the reserved field became larger for future extensions (satellite tuners in particular).
7. The idea of completely transparent video standards was dropped. Experience showed that applications must be able to work with video standards beyond presenting the user a menu. Instead of enumerating supported standards with an ioctl applications can now refer to standards by v4l2_std_id and symbols defined in the videodev2.h header file. For details see the section called “Video Standards”. The VIDIOC_G_STD and VIDIOC_S_STD now take a pointer to this type as argument. VIDIOC_QUERYSTD was added to autodetect the received standard, if the hardware has this capability. In struct v4l2_standard an index field was added for VIDIOC_ENUMSTD. A v4l2_std_id field named id was added as machine readable identifier, also replacing the transmission field. The misleading framerate field was renamed to frameperiod. The now obsolete colorstandard information, originally needed to distguish between variations of standards, were removed.
Struct v4l2_enumstd ceased to be. VIDIOC_ENUMSTD now takes a pointer to a struct v4l2_standard directly. The information which standards are supported by a particular video input or output moved into struct v4l2_input and struct v4l2_output fields named std, respectively.
8. The struct v4l2_queryctrl fields category and group did not catch on and/or were not implemented as expected and therefore removed.
9. The VIDIOC_TRY_FMT ioctl was added to negotiate data formats as with VIDIOC_S_FMT, but without the overhead of programming the hardware and regardless of I/O in progress.
In struct v4l2_format the fmt union was extended to contain struct v4l2_window. All image format negotiations are now possible with VIDIOC_G_FMT, VIDIOC_S_FMT and VIDIOC_TRY_FMT; ioctl. The VIDIOC_G_WIN and VIDIOC_S_WIN ioctls to prepare for a video overlay were removed. The type field changed to type enum v4l2_buf_type and the buffer type names changed as follows.
Old definesenum v4l2_buf_type
V4L2_BUF_TYPE_CAPTUREV4L2_BUF_TYPE_VIDEO_CAPTURE
V4L2_BUF_TYPE_CODECINOmitted for now
V4L2_BUF_TYPE_CODECOUTOmitted for now
V4L2_BUF_TYPE_EFFECTSINOmitted for now
V4L2_BUF_TYPE_EFFECTSIN2Omitted for now
V4L2_BUF_TYPE_EFFECTSOUTOmitted for now
V4L2_BUF_TYPE_VIDEOOUTV4L2_BUF_TYPE_VIDEO_OUTPUT
-V4L2_BUF_TYPE_VIDEO_OVERLAY
-V4L2_BUF_TYPE_VBI_CAPTURE
-V4L2_BUF_TYPE_VBI_OUTPUT
-V4L2_BUF_TYPE_SLICED_VBI_CAPTURE
-V4L2_BUF_TYPE_SLICED_VBI_OUTPUT
V4L2_BUF_TYPE_PRIVATE_BASEV4L2_BUF_TYPE_PRIVATE (but this is deprecated)
10. In struct v4l2_fmtdesc a enum v4l2_buf_type field named type was added as in struct v4l2_format. The VIDIOC_ENUM_FBUFFMT ioctl is no longer needed and was removed. These calls can be replaced by VIDIOC_ENUM_FMT with type V4L2_BUF_TYPE_VIDEO_OVERLAY.
11. In struct v4l2_pix_format the depth field was removed, assuming applications which recognize the format by its four-character-code already know the color depth, and others do not care about it. The same rationale lead to the removal of the V4L2_FMT_FLAG_COMPRESSED flag. The V4L2_FMT_FLAG_SWCONVECOMPRESSED flag was removed because drivers are not supposed to convert images in kernel space. A user library of conversion functions should be provided instead. The V4L2_FMT_FLAG_BYTESPERLINE flag was redundant. Applications can set the bytesperline field to zero to get a reasonable default. Since the remaining flags were replaced as well, the flags field itself was removed.
The interlace flags were replaced by a enum v4l2_field value in a newly added field field.
Old flagenum v4l2_field
V4L2_FMT_FLAG_NOT_INTERLACED?
V4L2_FMT_FLAG_INTERLACED = V4L2_FMT_FLAG_COMBINEDV4L2_FIELD_INTERLACED
V4L2_FMT_FLAG_TOPFIELD = V4L2_FMT_FLAG_ODDFIELDV4L2_FIELD_TOP
V4L2_FMT_FLAG_BOTFIELD = V4L2_FMT_FLAG_EVENFIELDV4L2_FIELD_BOTTOM
-V4L2_FIELD_SEQ_TB
-V4L2_FIELD_SEQ_BT
-V4L2_FIELD_ALTERNATE
The color space flags were replaced by a enum v4l2_colorspace value in a newly added colorspace field, where one of V4L2_COLORSPACE_SMPTE170M, V4L2_COLORSPACE_BT878, V4L2_COLORSPACE_470_SYSTEM_M or V4L2_COLORSPACE_470_SYSTEM_BG replaces V4L2_FMT_CS_601YUV.
12. In struct v4l2_requestbuffers the type field was properly defined as enum v4l2_buf_type. Buffer types changed as mentioned above. A new memory field of type enum v4l2_memory was added to distinguish between I/O methods using buffers allocated by the driver or the application. See Chapter 3, Input/Output for details.
13. In struct v4l2_buffer the type field was properly defined as enum v4l2_buf_type. Buffer types changed as mentioned above. A field field of type enum v4l2_field was added to indicate if a buffer contains a top or bottom field. The old field flags were removed. Since no unadjusted system time clock was added to the kernel as planned, the timestamp field changed back from type stamp_t, an unsigned 64 bit integer expressing the sample time in nanoseconds, to struct timeval. With the addition of a second memory mapping method the offset field moved into union m, and a new memory field of type enum v4l2_memory was added to distinguish between I/O methods. See Chapter 3, Input/Output for details.
The V4L2_BUF_REQ_CONTIG flag was used by the V4L compatibility layer, after changes to this code it was no longer needed. The V4L2_BUF_ATTR_DEVICEMEM flag would indicate if the buffer was indeed allocated in device memory rather than DMA-able system memory. It was barely useful and so was removed.
14. In struct v4l2_framebuffer the base[3] array anticipating double- and triple-buffering in off-screen video memory, however without defining a synchronization mechanism, was replaced by a single pointer. The V4L2_FBUF_CAP_SCALEUP and V4L2_FBUF_CAP_SCALEDOWN flags were removed. Applications can determine this capability more accurately using the new cropping and scaling interface. The V4L2_FBUF_CAP_CLIPPING flag was replaced by V4L2_FBUF_CAP_LIST_CLIPPING and V4L2_FBUF_CAP_BITMAP_CLIPPING.
15. In struct v4l2_clip the x, y, width and height field moved into a c substructure of type struct v4l2_rect. The x and y fields were renamed to left and top, i. e. offsets to a context dependent origin.
16. In struct v4l2_window the x, y, width and height field moved into a w substructure as above. A field field of type %v4l2-field; was added to distinguish between field and frame (interlaced) overlay.
17. The digital zoom interface, including struct v4l2_zoomcap, struct v4l2_zoom, V4L2_ZOOM_NONCAP and V4L2_ZOOM_WHILESTREAMING was replaced by a new cropping and scaling interface. The previously unused struct v4l2_cropcap and v4l2_crop where redefined for this purpose. See the section called “Image Cropping, Insertion and Scaling” for details.
18. In struct v4l2_vbi_format the SAMPLE_FORMAT field now contains a four-character-code as used to identify video image formats and V4L2_PIX_FMT_GREY replaces the V4L2_VBI_SF_UBYTE define. The reserved field was extended.
19. In struct v4l2_captureparm the type of the timeperframe field changed from unsigned long to struct v4l2_fract. This allows the accurate expression of multiples of the NTSC-M frame rate 30000 / 1001. A new field readbuffers was added to control the driver behaviour in read I/O mode.
Similar changes were made to struct v4l2_outputparm.
20. The struct v4l2_performance and VIDIOC_G_PERF ioctl were dropped. Except when using the read/write I/O method, which is limited anyway, this information is already available to applications.
21. The example transformation from RGB to YCbCr color space in the old V4L2 documentation was inaccurate, this has been corrected in Chapter 2, Image Formats.
V4L2 2003-06-19
1. A new capability flag V4L2_CAP_RADIO was added for radio devices. Prior to this change radio devices would identify solely by having exactly one tuner whose type field reads V4L2_TUNER_RADIO.
2. An optional driver access priority mechanism was added, see the section called “Application Priority” for details.
3. The audio input and output interface was found to be incomplete.
Previously the VIDIOC_G_AUDIO ioctl would enumerate the available audio inputs. An ioctl to determine the current audio input, if more than one combines with the current video input, did not exist. So VIDIOC_G_AUDIO was renamed to VIDIOC_G_AUDIO_OLD, this ioctl was removed on Kernel 2.6.39. The VIDIOC_ENUMAUDIO ioctl was added to enumerate audio inputs, while VIDIOC_G_AUDIO now reports the current audio input.
The same changes were made to VIDIOC_G_AUDOUT and VIDIOC_ENUMAUDOUT.
Until further the "videodev" module will automatically translate between the old and new ioctls, but drivers and applications must be updated to successfully compile again.
4. The VIDIOC_OVERLAY ioctl was incorrectly defined with write-read parameter. It was changed to write-only, while the write-read version was renamed to VIDIOC_OVERLAY_OLD. The old ioctl was removed on Kernel 2.6.39. Until further the "videodev" kernel module will automatically translate to the new version, so drivers must be recompiled, but not applications.
5. the section called “Video Overlay Interface” incorrectly stated that clipping rectangles define regions where the video can be seen. Correct is that clipping rectangles define regions where no video shall be displayed and so the graphics surface can be seen.
6. The VIDIOC_S_PARM and VIDIOC_S_CTRL ioctls were defined with write-only parameter, inconsistent with other ioctls modifying their argument. They were changed to write-read, while a _OLD suffix was added to the write-only versions. The old ioctls were removed on Kernel 2.6.39. Drivers and applications assuming a constant parameter need an update.
V4L2 2003-11-05
1. In the section called “RGB Formats” the following pixel formats were incorrectly transferred from Bill Dirks' V4L2 specification. Descriptions below refer to bytes in memory, in ascending address order.
SymbolIn this document prior to revision 0.5Corrected
V4L2_PIX_FMT_RGB24B, G, RR, G, B
V4L2_PIX_FMT_BGR24R, G, BB, G, R
V4L2_PIX_FMT_RGB32B, G, R, XR, G, B, X
V4L2_PIX_FMT_BGR32R, G, B, XB, G, R, X
The V4L2_PIX_FMT_BGR24 example was always correct.
In the section called “Image Properties” the mapping of the V4L VIDEO_PALETTE_RGB24 and VIDEO_PALETTE_RGB32 formats to V4L2 pixel formats was accordingly corrected.
2. Unrelated to the fixes above, drivers may still interpret some V4L2 RGB pixel formats differently. These issues have yet to be addressed, for details see the section called “RGB Formats”.
V4L2 in Linux 2.6.6, 2004-05-09
1. The VIDIOC_CROPCAP ioctl was incorrectly defined with read-only parameter. It is now defined as write-read ioctl, while the read-only version was renamed to VIDIOC_CROPCAP_OLD. The old ioctl was removed on Kernel 2.6.39.
V4L2 in Linux 2.6.8
1. A new field input (former reserved[0]) was added to the struct v4l2_buffer structure. Purpose of this field is to alternate between video inputs (e. g. cameras) in step with the video capturing process. This function must be enabled with the new V4L2_BUF_FLAG_INPUT flag. The flags field is no longer read-only.
V4L2 spec erratum 2004-08-01
1. The return value of the V4L2 open()(2) function was incorrectly documented.
2. Audio output ioctls end in -AUDOUT, not -AUDIOOUT.
3. In the Current Audio Input example the VIDIOC_G_AUDIO ioctl took the wrong argument.
4. The documentation of the VIDIOC_QBUF and VIDIOC_DQBUF ioctls did not mention the struct v4l2_buffer memory field. It was also missing from examples. Also on the VIDIOC_DQBUF page the EIO error code was not documented.
V4L2 in Linux 2.6.14
1. A new sliced VBI interface was added. It is documented in the section called “Sliced VBI Data Interface” and replaces the interface first proposed in V4L2 specification 0.8.
V4L2 in Linux 2.6.15
1. The VIDIOC_LOG_STATUS ioctl was added.
2. New video standards V4L2_STD_NTSC_443, V4L2_STD_SECAM_LC, V4L2_STD_SECAM_DK (a set of SECAM D, K and K1), and V4L2_STD_ATSC (a set of V4L2_STD_ATSC_8_VSB and V4L2_STD_ATSC_16_VSB) were defined. Note the V4L2_STD_525_60 set now includes V4L2_STD_NTSC_443. See also Table A.48, “typedef v4l2_std_id.
3. The VIDIOC_G_COMP and VIDIOC_S_COMP ioctl were renamed to VIDIOC_G_MPEGCOMP and VIDIOC_S_MPEGCOMP respectively. Their argument was replaced by a struct v4l2_mpeg_compression pointer. (The VIDIOC_G_MPEGCOMP and VIDIOC_S_MPEGCOMP ioctls where removed in Linux 2.6.25.)
V4L2 spec erratum 2005-11-27
The capture example in Appendix D, Video Capture Example called the VIDIOC_S_CROP ioctl without checking if cropping is supported. In the video standard selection example in the section called “Video Standards” the VIDIOC_S_STD call used the wrong argument type.
V4L2 spec erratum 2006-01-10
1. The V4L2_IN_ST_COLOR_KILL flag in struct v4l2_input not only indicates if the color killer is enabled, but also if it is active. (The color killer disables color decoding when it detects no color in the video signal to improve the image quality.)
2. VIDIOC_S_PARM is a write-read ioctl, not write-only as stated on its reference page. The ioctl changed in 2003 as noted above.
V4L2 spec erratum 2006-02-03
1. In struct v4l2_captureparm and struct v4l2_outputparm the timeperframe field gives the time in seconds, not microseconds.
V4L2 spec erratum 2006-02-04
1. The clips field in struct v4l2_window must point to an array of struct v4l2_clip, not a linked list, because drivers ignore the struct v4l2_clip.next pointer.
V4L2 in Linux 2.6.17
1. New video standard macros were added: V4L2_STD_NTSC_M_KR (NTSC M South Korea), and the sets V4L2_STD_MN, V4L2_STD_B, V4L2_STD_GH and V4L2_STD_DK. The V4L2_STD_NTSC and V4L2_STD_SECAM sets now include V4L2_STD_NTSC_M_KR and V4L2_STD_SECAM_LC respectively.
2. A new V4L2_TUNER_MODE_LANG1_LANG2 was defined to record both languages of a bilingual program. The use of V4L2_TUNER_MODE_STEREO for this purpose is deprecated now. See the VIDIOC_G_TUNER section for details.
V4L2 spec erratum 2006-09-23 (Draft 0.15)
1. In various places V4L2_BUF_TYPE_SLICED_VBI_CAPTURE and V4L2_BUF_TYPE_SLICED_VBI_OUTPUT of the sliced VBI interface were not mentioned along with other buffer types.
2. In ioctl VIDIOC_G_AUDIO, VIDIOC_S_AUDIO(2) it was clarified that the struct v4l2_audio mode field is a flags field.
3. ioctl VIDIOC_QUERYCAP(2) did not mention the sliced VBI and radio capability flags.
4. In ioctl VIDIOC_G_FREQUENCY, VIDIOC_S_FREQUENCY(2) it was clarified that applications must initialize the tuner type field of struct v4l2_frequency before calling VIDIOC_S_FREQUENCY.
5. The reserved array in struct v4l2_requestbuffers has 2 elements, not 32.
6. In the section called “Video Output Interface” and the section called “Raw VBI Data Interface” the device file names /dev/vout which never caught on were replaced by /dev/video.
7. With Linux 2.6.15 the possible range for VBI device minor numbers was extended from 224-239 to 224-255. Accordingly device file names /dev/vbi0 to /dev/vbi31 are possible now.
V4L2 in Linux 2.6.18
1. New ioctls VIDIOC_G_EXT_CTRLS, VIDIOC_S_EXT_CTRLS and VIDIOC_TRY_EXT_CTRLS were added, a flag to skip unsupported controls with VIDIOC_QUERYCTRL, new control types V4L2_CTRL_TYPE_INTEGER64 and V4L2_CTRL_TYPE_CTRL_CLASS (Table A.98, “enum v4l2_ctrl_type”), and new control flags V4L2_CTRL_FLAG_READ_ONLY, V4L2_CTRL_FLAG_UPDATE, V4L2_CTRL_FLAG_INACTIVE and V4L2_CTRL_FLAG_SLIDER (Table A.99, “Control Flags”). See the section called “Extended Controls” for details.
V4L2 in Linux 2.6.19
1. In struct v4l2_sliced_vbi_cap a buffer type field was added replacing a reserved field. Note on architectures where the size of enum types differs from int types the size of the structure changed. The VIDIOC_G_SLICED_VBI_CAP ioctl was redefined from being read-only to write-read. Applications must initialize the type field and clear the reserved fields now. These changes may break the compatibility with older drivers and applications.
2. The ioctls VIDIOC_ENUM_FRAMESIZES and VIDIOC_ENUM_FRAMEINTERVALS were added.
3. A new pixel format V4L2_PIX_FMT_RGB444 (Table 2.18, “Packed RGB Image Formats”) was added.
V4L2 spec erratum 2006-10-12 (Draft 0.17)
1. V4L2_PIX_FMT_HM12 (Table 2.22, “Reserved Image Formats”) is a YUV 4:2:0, not 4:2:2 format.
V4L2 in Linux 2.6.21
1. The videodev2.h header file is now dual licensed under GNU General Public License version two or later, and under a 3-clause BSD-style license.
V4L2 in Linux 2.6.22
1. Two new field orders V4L2_FIELD_INTERLACED_TB and V4L2_FIELD_INTERLACED_BT were added. See Table 3.9, “enum v4l2_field” for details.
2. Three new clipping/blending methods with a global or straight or inverted local alpha value were added to the video overlay interface. See the description of the VIDIOC_G_FBUF and VIDIOC_S_FBUF ioctls for details.
A new global_alpha field was added to v4l2_window, extending the structure. This may break compatibility with applications using a struct v4l2_window directly. However the VIDIOC_G/S/TRY_FMT ioctls, which take a pointer to a v4l2_format parent structure with padding bytes at the end, are not affected.
3. The format of the chromakey field in struct v4l2_window changed from "host order RGB32" to a pixel value in the same format as the framebuffer. This may break compatibility with existing applications. Drivers supporting the "host order RGB32" format are not known.
V4L2 in Linux 2.6.24
1. The pixel formats V4L2_PIX_FMT_PAL8, V4L2_PIX_FMT_YUV444, V4L2_PIX_FMT_YUV555, V4L2_PIX_FMT_YUV565 and V4L2_PIX_FMT_YUV32 were added.
V4L2 in Linux 2.6.25
1. The pixel formats V4L2_PIX_FMT_Y16 and V4L2_PIX_FMT_SBGGR16 were added.
2. New controls V4L2_CID_POWER_LINE_FREQUENCY, V4L2_CID_HUE_AUTO, V4L2_CID_WHITE_BALANCE_TEMPERATURE, V4L2_CID_SHARPNESS and V4L2_CID_BACKLIGHT_COMPENSATION were added. The controls V4L2_CID_BLACK_LEVEL, V4L2_CID_WHITENESS, V4L2_CID_HCENTER and V4L2_CID_VCENTER were deprecated.
3. A Camera controls class was added, with the new controls V4L2_CID_EXPOSURE_AUTO, V4L2_CID_EXPOSURE_ABSOLUTE, V4L2_CID_EXPOSURE_AUTO_PRIORITY, V4L2_CID_PAN_RELATIVE, V4L2_CID_TILT_RELATIVE, V4L2_CID_PAN_RESET, V4L2_CID_TILT_RESET, V4L2_CID_PAN_ABSOLUTE, V4L2_CID_TILT_ABSOLUTE, V4L2_CID_FOCUS_ABSOLUTE, V4L2_CID_FOCUS_RELATIVE and V4L2_CID_FOCUS_AUTO.
4. The VIDIOC_G_MPEGCOMP and VIDIOC_S_MPEGCOMP ioctls, which were superseded by the extended controls interface in Linux 2.6.18, where finally removed from the videodev2.h header file.
V4L2 in Linux 2.6.26
1. The pixel formats V4L2_PIX_FMT_Y16 and V4L2_PIX_FMT_SBGGR16 were added.
2. Added user controls V4L2_CID_CHROMA_AGC and V4L2_CID_COLOR_KILLER.
V4L2 in Linux 2.6.27
1. The VIDIOC_S_HW_FREQ_SEEK ioctl and the V4L2_CAP_HW_FREQ_SEEK capability were added.
2. The pixel formats V4L2_PIX_FMT_YVYU, V4L2_PIX_FMT_PCA501, V4L2_PIX_FMT_PCA505, V4L2_PIX_FMT_PCA508, V4L2_PIX_FMT_PCA561, V4L2_PIX_FMT_SGBRG8, V4L2_PIX_FMT_PAC207 and V4L2_PIX_FMT_PJPG were added.
V4L2 in Linux 2.6.28
1. Added V4L2_MPEG_AUDIO_ENCODING_AAC and V4L2_MPEG_AUDIO_ENCODING_AC3 MPEG audio encodings.
2. Added V4L2_MPEG_VIDEO_ENCODING_MPEG_4_AVC MPEG video encoding.
3. The pixel formats V4L2_PIX_FMT_SGRBG10 and V4L2_PIX_FMT_SGRBG10DPCM8 were added.
V4L2 in Linux 2.6.29
1. The VIDIOC_G_CHIP_IDENT ioctl was renamed to VIDIOC_G_CHIP_IDENT_OLD and VIDIOC_DBG_G_CHIP_IDENT was introduced in its place. The old struct v4l2_chip_ident was renamed to v4l2_chip_ident_old.
2. The pixel formats V4L2_PIX_FMT_VYUY, V4L2_PIX_FMT_NV16 and V4L2_PIX_FMT_NV61 were added.
3. Added camera controls V4L2_CID_ZOOM_ABSOLUTE, V4L2_CID_ZOOM_RELATIVE, V4L2_CID_ZOOM_CONTINUOUS and V4L2_CID_PRIVACY.
V4L2 in Linux 2.6.30
1. New control flag V4L2_CTRL_FLAG_WRITE_ONLY was added.
2. New control V4L2_CID_COLORFX was added.
V4L2 in Linux 2.6.32
1. In order to be easier to compare a V4L2 API and a kernel version, now V4L2 API is numbered using the Linux Kernel version numeration.
2. Finalized the RDS capture API. See the section called “RDS Interface” for more information.
3. Added new capabilities for modulators and RDS encoders.
4. Add description for libv4l API.
5. Added support for string controls via new type V4L2_CTRL_TYPE_STRING.
6. Added V4L2_CID_BAND_STOP_FILTER documentation.
7. Added FM Modulator (FM TX) Extended Control Class: V4L2_CTRL_CLASS_FM_TX and their Control IDs.
8. Added FM Receiver (FM RX) Extended Control Class: V4L2_CTRL_CLASS_FM_RX and their Control IDs.
9. Added Remote Controller chapter, describing the default Remote Controller mapping for media devices.
V4L2 in Linux 2.6.33
1. Added support for Digital Video timings in order to support HDTV receivers and transmitters.
V4L2 in Linux 2.6.34
1. Added V4L2_CID_IRIS_ABSOLUTE and V4L2_CID_IRIS_RELATIVE controls to the Camera controls class.
V4L2 in Linux 2.6.37
1. Remove the vtx (videotext/teletext) API. This API was no longer used and no hardware exists to verify the API. Nor were any userspace applications found that used it. It was originally scheduled for removal in 2.6.35.
V4L2 in Linux 2.6.39
1. The old VIDIOC_*_OLD symbols and V4L1 support were removed.
2. Multi-planar API added. Does not affect the compatibility of current drivers and applications. See multi-planar API for details.
V4L2 in Linux 3.1
1. VIDIOC_QUERYCAP now returns a per-subsystem version instead of a per-driver one.
Standardize an error code for invalid ioctl.
Added V4L2_CTRL_TYPE_BITMASK.
V4L2 in Linux 3.2
1. V4L2_CTRL_FLAG_VOLATILE was added to signal volatile controls to userspace.
2. Add selection API for extended control over cropping and composing. Does not affect the compatibility of current drivers and applications. See selection API for details.
V4L2 in Linux 3.3
1. Added V4L2_CID_ALPHA_COMPONENT control to the User controls class.
2. Added the device_caps field to struct v4l2_capabilities and added the new V4L2_CAP_DEVICE_CAPS capability.
V4L2 in Linux 3.4
V4L2 in Linux 3.5
1. Added integer menus, the new type will be V4L2_CTRL_TYPE_INTEGER_MENU.
2. Added selection API for V4L2 subdev interface: VIDIOC_SUBDEV_G_SELECTION and VIDIOC_SUBDEV_S_SELECTION.
3. Added V4L2_COLORFX_ANTIQUE, V4L2_COLORFX_ART_FREEZE, V4L2_COLORFX_AQUA, V4L2_COLORFX_SILHOUETTE, V4L2_COLORFX_SOLARIZATION, V4L2_COLORFX_VIVID and V4L2_COLORFX_ARBITRARY_CBCR menu items to the V4L2_CID_COLORFX control.
4. Added V4L2_CID_COLORFX_CBCR control.
5. Added camera controls V4L2_CID_AUTO_EXPOSURE_BIAS, V4L2_CID_AUTO_N_PRESET_WHITE_BALANCE, V4L2_CID_IMAGE_STABILIZATION, V4L2_CID_ISO_SENSITIVITY, V4L2_CID_ISO_SENSITIVITY_AUTO, V4L2_CID_EXPOSURE_METERING, V4L2_CID_SCENE_MODE, V4L2_CID_3A_LOCK, V4L2_CID_AUTO_FOCUS_START, V4L2_CID_AUTO_FOCUS_STOP, V4L2_CID_AUTO_FOCUS_STATUS and V4L2_CID_AUTO_FOCUS_RANGE.
V4L2 in Linux 3.6
1. Replaced input in v4l2_buffer by reserved2 and removed V4L2_BUF_FLAG_INPUT.
2. Added V4L2_CAP_VIDEO_M2M and V4L2_CAP_VIDEO_M2M_MPLANE capabilities.
3. Added support for frequency band enumerations: VIDIOC_ENUM_FREQ_BANDS.
V4L2 in Linux 3.9
1. Added timestamp types to flags field in v4l2_buffer. See Table 3.4, “Buffer Flags”.
2. Added V4L2_EVENT_CTRL_CH_RANGE control event changes flag. See Table A.19, “Control Changes”.
V4L2 in Linux 3.10
1. Removed obsolete and unused DV_PRESET ioctls VIDIOC_G_DV_PRESET, VIDIOC_S_DV_PRESET, VIDIOC_QUERY_DV_PRESET and VIDIOC_ENUM_DV_PRESET. Remove the related v4l2_input/output capability flags V4L2_IN_CAP_PRESETS and V4L2_OUT_CAP_PRESETS.
2. Added new debugging ioctl VIDIOC_DBG_G_CHIP_INFO.
V4L2 in Linux 3.11
1. Remove obsolete VIDIOC_DBG_G_CHIP_IDENT ioctl.
V4L2 in Linux 3.14
1. In struct v4l2_rect, the type of width and height fields changed from _s32 to _u32.
V4L2 in Linux 3.15
1. Added Software Defined Radio (SDR) Interface.
V4L2 in Linux 3.16
1. Added event V4L2_EVENT_SOURCE_CHANGE.
V4L2 in Linux 3.17
1. Extended struct v4l2_pix_format. Added format flags.
2. Added compound control types and VIDIOC_QUERY_EXT_CTRL.
V4L2 in Linux 3.18
1. Added V4L2_CID_PAN_SPEED and V4L2_CID_TILT_SPEED camera controls.
V4L2 in Linux 3.19
1. Rewrote Colorspace chapter, added new enum v4l2_ycbcr_encoding and enum v4l2_quantization fields to struct v4l2_pix_format, struct v4l2_pix_format_mplane and struct v4l2_mbus_framefmt.
V4L2 in Linux 4.4
1. Renamed V4L2_TUNER_ADC to V4L2_TUNER_SDR. The use of V4L2_TUNER_ADC is deprecated now.
2. Added V4L2_CID_RF_TUNER_RF_GAIN RF Tuner control.
3. Added transmitter support for Software Defined Radio (SDR) Interface.
Relation of V4L2 to other Linux multimedia APIs
X Video Extension
The X Video Extension (abbreviated XVideo or just Xv) is an extension of the X Window system, implemented for example by the XFree86 project. Its scope is similar to V4L2, an API to video capture and output devices for X clients. Xv allows applications to display live video in a window, send window contents to a TV output, and capture or output still images in XPixmaps[17]. With their implementation XFree86 makes the extension available across many operating systems and architectures.
Because the driver is embedded into the X server Xv has a number of advantages over the V4L2 video overlay interface. The driver can easily determine the overlay target, i. e. visible graphics memory or off-screen buffers for a destructive overlay. It can program the RAMDAC for a non-destructive overlay, scaling or color-keying, or the clipping functions of the video capture hardware, always in sync with drawing operations or windows moving or changing their stacking order.
To combine the advantages of Xv and V4L a special Xv driver exists in XFree86 and XOrg, just programming any overlay capable Video4Linux device it finds. To enable it /etc/X11/XF86Config must contain these lines:
Section "Module"
Load "v4l"
EndSection
As of XFree86 4.2 this driver still supports only V4L ioctls, however it should work just fine with all V4L2 devices through the V4L2 backward-compatibility layer. Since V4L2 permits multiple opens it is possible (if supported by the V4L2 driver) to capture video while an X client requested video overlay. Restrictions of simultaneous capturing and overlay are discussed in the section called “Video Overlay Interface” apply.
Only marginally related to V4L2, XFree86 extended Xv to support hardware YUV to RGB conversion and scaling for faster video playback, and added an interface to MPEG-2 decoding hardware. This API is useful to display images captured with V4L2 devices.
Digital Video
V4L2 does not support digital terrestrial, cable or satellite broadcast. A separate project aiming at digital receivers exists. You can find its homepage at https://linuxtv.org. The Linux DVB API has no connection to the V4L2 API except that drivers for hybrid hardware may support both.
Audio Interfaces
[to do - OSS/ALSA]
Experimental API Elements
The following V4L2 API elements are currently experimental and may change in the future.
Obsolete API Elements
The following V4L2 API elements were superseded by new interfaces and should not be implemented in new drivers.
[17] This is not implemented in XFree86. | {
"url": "https://linuxtv.org/downloads/v4l-dvb-apis/hist-v4l2.html",
"source_domain": "linuxtv.org",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "104365",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YNXP2YRHEVZVJDTPZPNQI742HPU4HFJF",
"WARC-Concurrent-To": "<urn:uuid:e77a7810-f7ac-480c-b36e-08b916bd0730>",
"WARC-Date": "2016-07-28T02:55:48Z",
"WARC-IP-Address": "130.149.80.248",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:JI4IZII4VH4WBAFAKLKV72KYUSLVMWDA",
"WARC-Record-ID": "<urn:uuid:977e23f5-6e7d-419c-bd35-9c3218d24cba>",
"WARC-Target-URI": "https://linuxtv.org/downloads/v4l-dvb-apis/hist-v4l2.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:207b3535-3e04-4a75-af4a-d2699f1fcadf>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-27-174.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-30\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for July 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
24,
25,
40,
69,
98,
127,
158,
196,
225,
254,
284,
300,
316,
348,
368,
397,
418,
439,
468,
497,
526,
555,
576,
618,
639,
660,
702,
723,
744,
765,
786,
807,
828,
849,
870,
891,
912,
933,
954,
975,
996,
1014,
1032,
1050,
1068,
1086,
1104,
1122,
1141,
1160,
1179,
1198,
1217,
1236,
1255,
1274,
1292,
1340,
1366,
1388,
1389,
1887,
1888,
1903,
1904,
1931,
1932,
1982,
1983,
2025,
2026,
2458,
2459,
2541,
2542,
2790,
2791,
2904,
2905,
2972,
2973,
3377,
3378,
3478,
3479,
3530,
3531,
3581,
3582,
3611,
3612,
3781,
3782,
3811,
3812,
4005,
4006,
4035,
4036,
4229,
4230,
4523,
4524,
4566,
4567,
4610,
4611,
4724,
4725,
4812,
4813,
4866,
4867,
4898,
4899,
5143,
5144,
5267,
5268,
5318,
5319,
5704,
5705,
5749,
5754,
5755,
5767,
5768,
5823,
5828,
5829,
6147,
6148,
6464,
6465,
6683,
6684,
6760,
6761,
6910,
6911,
7373,
7374,
8721,
8722,
8936,
8937,
8975,
8976,
9112,
9113,
9174,
9175,
9294,
9295,
9362,
9363,
9406,
9407,
9462,
9463,
9587,
9588,
9857,
9858,
10038,
10039,
10233,
10234,
10288,
10289,
10478,
10479,
10806,
10807,
10836,
10837,
10893,
10894,
11397,
11398,
11862,
11863,
12319,
12320,
12496,
12497,
12526,
12527,
12564,
12565,
12595,
12596,
12797,
12798,
12942,
12943,
13406,
13407,
13652,
13653,
14229,
14230,
14444,
14445,
14697,
14698,
14999,
15000,
15274,
15275,
15373,
15374,
15502,
15503,
15900,
15901,
15986,
15987,
16309,
16310,
16394,
16395,
16650,
16651,
17590,
17591,
17868,
17869,
18006,
18007,
18183,
18184,
18556,
18557,
18591,
18644,
18685,
18727,
18770,
18814,
18858,
18911,
18944,
18975,
19005,
19043,
19080,
19157,
19413,
19414,
20096,
20097,
20192,
20193,
20221,
20255,
20330,
20396,
20466,
20489,
20512,
20538,
20539,
20800,
20801,
21125,
21126,
21831,
21832,
22135,
22136,
22635,
22636,
22843,
22844,
23049,
23050,
23399,
23400,
23625,
23626,
23915,
23916,
23973,
23974,
24171,
24172,
24334,
24335,
24351,
24352,
24549,
24550,
24670,
24671,
24741,
24742,
25160,
25161,
25234,
25235,
25412,
25413,
25777,
25778,
26042,
26043,
26396,
26397,
26413,
26414,
26622,
26623,
26681,
26718,
26755,
26798,
26841,
26842,
26897,
26898,
27067,
27068,
27261,
27262,
27294,
27295,
27521,
27522,
27542,
27543,
27860,
27861,
27890,
27891,
27972,
27973,
28029,
28030,
28120,
28121,
28344,
28345,
28366,
28367,
28546,
28547,
28568,
28569,
28613,
28614,
28917,
28918,
29190,
29191,
29220,
29221,
29484,
29485,
29514,
29515,
29767,
29768,
29900,
29901,
29930,
29931,
30058,
30059,
30088,
30089,
30253,
30254,
30275,
30276,
30536,
30537,
30751,
30752,
30794,
30795,
30965,
30966,
31087,
31088,
31177,
31178,
31366,
31367,
31445,
31446,
31629,
31630,
31811,
31812,
31833,
31834,
32303,
32304,
32325,
32326,
32770,
32771,
32853,
32854,
32950,
32951,
32993,
32994,
33090,
33091,
33112,
33113,
33262,
33263,
33284,
33285,
33423,
33424,
33643,
33644,
33951,
33952,
34222,
34223,
34244,
34245,
34384,
34385,
34406,
34407,
34484,
34485,
34766,
34767,
35123,
35124,
35311,
35312,
35333,
35334,
35411,
35412,
35484,
35485,
35506,
35507,
35597,
35598,
35799,
35800,
35821,
35822,
35917,
35918,
35986,
35987,
36073,
36074,
36095,
36096,
36294,
36295,
36389,
36390,
36512,
36513,
36534,
36535,
36594,
36595,
36640,
36641,
36662,
36663,
36802,
36803,
36900,
36901,
36962,
36963,
37000,
37001,
37076,
37077,
37129,
37130,
37231,
37232,
37332,
37333,
37439,
37440,
37461,
37462,
37560,
37561,
37582,
37583,
37683,
37684,
37705,
37706,
37929,
37930,
37951,
37952,
38017,
38018,
38152,
38153,
38171,
38172,
38258,
38259,
38308,
38309,
38343,
38344,
38362,
38363,
38444,
38445,
38620,
38621,
38639,
38640,
38712,
38713,
38825,
38826,
38844,
38845,
38863,
38864,
38940,
38941,
39050,
39051,
39275,
39276,
39318,
39319,
39678,
39679,
39697,
39698,
39779,
39780,
39854,
39855,
39931,
39932,
39950,
39951,
40040,
40041,
40140,
40141,
40160,
40161,
40401,
40402,
40457,
40458,
40477,
40478,
40530,
40531,
40550,
40551,
40640,
40641,
40660,
40661,
40712,
40713,
40732,
40733,
40776,
40777,
40796,
40797,
40855,
40856,
40917,
40918,
40937,
40938,
41009,
41010,
41029,
41030,
41220,
41221,
41239,
41240,
41332,
41333,
41388,
41389,
41464,
41465,
41513,
41514,
41532,
41533,
42023,
42024,
42503,
42504,
42717,
42718,
42735,
42750,
42761,
42762,
43189,
43190,
43441,
43442,
43456,
43457,
43745,
43746,
43763,
43764,
43783,
43784,
43810,
43811,
43900,
43901,
43923,
43924,
44036,
44037,
44038,
44039
],
"line_end_idx": [
24,
25,
40,
69,
98,
127,
158,
196,
225,
254,
284,
300,
316,
348,
368,
397,
418,
439,
468,
497,
526,
555,
576,
618,
639,
660,
702,
723,
744,
765,
786,
807,
828,
849,
870,
891,
912,
933,
954,
975,
996,
1014,
1032,
1050,
1068,
1086,
1104,
1122,
1141,
1160,
1179,
1198,
1217,
1236,
1255,
1274,
1292,
1340,
1366,
1388,
1389,
1887,
1888,
1903,
1904,
1931,
1932,
1982,
1983,
2025,
2026,
2458,
2459,
2541,
2542,
2790,
2791,
2904,
2905,
2972,
2973,
3377,
3378,
3478,
3479,
3530,
3531,
3581,
3582,
3611,
3612,
3781,
3782,
3811,
3812,
4005,
4006,
4035,
4036,
4229,
4230,
4523,
4524,
4566,
4567,
4610,
4611,
4724,
4725,
4812,
4813,
4866,
4867,
4898,
4899,
5143,
5144,
5267,
5268,
5318,
5319,
5704,
5705,
5749,
5754,
5755,
5767,
5768,
5823,
5828,
5829,
6147,
6148,
6464,
6465,
6683,
6684,
6760,
6761,
6910,
6911,
7373,
7374,
8721,
8722,
8936,
8937,
8975,
8976,
9112,
9113,
9174,
9175,
9294,
9295,
9362,
9363,
9406,
9407,
9462,
9463,
9587,
9588,
9857,
9858,
10038,
10039,
10233,
10234,
10288,
10289,
10478,
10479,
10806,
10807,
10836,
10837,
10893,
10894,
11397,
11398,
11862,
11863,
12319,
12320,
12496,
12497,
12526,
12527,
12564,
12565,
12595,
12596,
12797,
12798,
12942,
12943,
13406,
13407,
13652,
13653,
14229,
14230,
14444,
14445,
14697,
14698,
14999,
15000,
15274,
15275,
15373,
15374,
15502,
15503,
15900,
15901,
15986,
15987,
16309,
16310,
16394,
16395,
16650,
16651,
17590,
17591,
17868,
17869,
18006,
18007,
18183,
18184,
18556,
18557,
18591,
18644,
18685,
18727,
18770,
18814,
18858,
18911,
18944,
18975,
19005,
19043,
19080,
19157,
19413,
19414,
20096,
20097,
20192,
20193,
20221,
20255,
20330,
20396,
20466,
20489,
20512,
20538,
20539,
20800,
20801,
21125,
21126,
21831,
21832,
22135,
22136,
22635,
22636,
22843,
22844,
23049,
23050,
23399,
23400,
23625,
23626,
23915,
23916,
23973,
23974,
24171,
24172,
24334,
24335,
24351,
24352,
24549,
24550,
24670,
24671,
24741,
24742,
25160,
25161,
25234,
25235,
25412,
25413,
25777,
25778,
26042,
26043,
26396,
26397,
26413,
26414,
26622,
26623,
26681,
26718,
26755,
26798,
26841,
26842,
26897,
26898,
27067,
27068,
27261,
27262,
27294,
27295,
27521,
27522,
27542,
27543,
27860,
27861,
27890,
27891,
27972,
27973,
28029,
28030,
28120,
28121,
28344,
28345,
28366,
28367,
28546,
28547,
28568,
28569,
28613,
28614,
28917,
28918,
29190,
29191,
29220,
29221,
29484,
29485,
29514,
29515,
29767,
29768,
29900,
29901,
29930,
29931,
30058,
30059,
30088,
30089,
30253,
30254,
30275,
30276,
30536,
30537,
30751,
30752,
30794,
30795,
30965,
30966,
31087,
31088,
31177,
31178,
31366,
31367,
31445,
31446,
31629,
31630,
31811,
31812,
31833,
31834,
32303,
32304,
32325,
32326,
32770,
32771,
32853,
32854,
32950,
32951,
32993,
32994,
33090,
33091,
33112,
33113,
33262,
33263,
33284,
33285,
33423,
33424,
33643,
33644,
33951,
33952,
34222,
34223,
34244,
34245,
34384,
34385,
34406,
34407,
34484,
34485,
34766,
34767,
35123,
35124,
35311,
35312,
35333,
35334,
35411,
35412,
35484,
35485,
35506,
35507,
35597,
35598,
35799,
35800,
35821,
35822,
35917,
35918,
35986,
35987,
36073,
36074,
36095,
36096,
36294,
36295,
36389,
36390,
36512,
36513,
36534,
36535,
36594,
36595,
36640,
36641,
36662,
36663,
36802,
36803,
36900,
36901,
36962,
36963,
37000,
37001,
37076,
37077,
37129,
37130,
37231,
37232,
37332,
37333,
37439,
37440,
37461,
37462,
37560,
37561,
37582,
37583,
37683,
37684,
37705,
37706,
37929,
37930,
37951,
37952,
38017,
38018,
38152,
38153,
38171,
38172,
38258,
38259,
38308,
38309,
38343,
38344,
38362,
38363,
38444,
38445,
38620,
38621,
38639,
38640,
38712,
38713,
38825,
38826,
38844,
38845,
38863,
38864,
38940,
38941,
39050,
39051,
39275,
39276,
39318,
39319,
39678,
39679,
39697,
39698,
39779,
39780,
39854,
39855,
39931,
39932,
39950,
39951,
40040,
40041,
40140,
40141,
40160,
40161,
40401,
40402,
40457,
40458,
40477,
40478,
40530,
40531,
40550,
40551,
40640,
40641,
40660,
40661,
40712,
40713,
40732,
40733,
40776,
40777,
40796,
40797,
40855,
40856,
40917,
40918,
40937,
40938,
41009,
41010,
41029,
41030,
41220,
41221,
41239,
41240,
41332,
41333,
41388,
41389,
41464,
41465,
41513,
41514,
41532,
41533,
42023,
42024,
42503,
42504,
42717,
42718,
42735,
42750,
42761,
42762,
43189,
43190,
43441,
43442,
43456,
43457,
43745,
43746,
43763,
43764,
43783,
43784,
43810,
43811,
43900,
43901,
43923,
43924,
44036,
44037,
44038,
44039,
44079
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 44079,
"ccnet_original_nlines": 640,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27083075046539307,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08667577058076859,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26834720373153687,
"rps_doc_frac_unique_words": 0.25967031717300415,
"rps_doc_mean_word_length": 5.645013809204102,
"rps_doc_num_sentences": 752,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 6.055678844451904,
"rps_doc_word_count": 6127,
"rps_doc_frac_chars_dupe_10grams": 0.022233789786696434,
"rps_doc_frac_chars_dupe_5grams": 0.08549454808235168,
"rps_doc_frac_chars_dupe_6grams": 0.05796976014971733,
"rps_doc_frac_chars_dupe_7grams": 0.032700151205062866,
"rps_doc_frac_chars_dupe_8grams": 0.027958480641245842,
"rps_doc_frac_chars_dupe_9grams": 0.022233789786696434,
"rps_doc_frac_chars_top_2gram": 0.01619105041027069,
"rps_doc_frac_chars_top_3gram": 0.024170929566025734,
"rps_doc_frac_chars_top_4gram": 0.005204270128160715,
"rps_doc_books_importance": -3043.232421875,
"rps_doc_books_importance_length_correction": -3043.232421875,
"rps_doc_openwebtext_importance": -1802.9073486328125,
"rps_doc_openwebtext_importance_length_correction": -1802.9073486328125,
"rps_doc_wikipedia_importance": -1172.679443359375,
"rps_doc_wikipedia_importance_length_correction": -1172.679443359375
},
"fasttext": {
"dclm": 0.142314612865448,
"english": 0.8706046938896179,
"fineweb_edu_approx": 2.552953004837036,
"eai_general_math": 0.5190492868423462,
"eai_open_web_math": 0.24293172359466553,
"eai_web_code": 0.702625036239624
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
6,322,400,693,727,613,000 | Anyone running Vista?
Welcome to our Community
Wanting to join the rest of our members? Feel free to sign up today.
Sign up
Spin This!
New Member
Silver
May 4, 2007
504
0
0
#1
My roommates have a 360 so we tried installing Vista on my box so we could see how MCE works. Honestly it's not as bad as some critics claim but definitely not my cup of tea, compared to XP.
I really tried to like it but there's a lot of weird changes in it that Microsoft seemily just changed for the sake of change. And the "advanced" effects in the Aero theme you just end up just turning off after awhile. Senseless eye candy doesn't get any work done... Mac OS X is much better in this respect.
Thoughts?
joe
New Member
Gold
May 5, 2007
1,113
0
0
#3
Nope, running XP Pro on our test system until we hear enough folks are running Vista to install another tester. Sounds like that might be a while. :laugh2:
chris
Administrator
Administrator
Jun 10, 2006
11,810
1,775
113
Long Island, NY
#4
I'm a die hard Mac user, but recently purchased a PC w/ Vista for a program I needed to run. (Tried to use Virtual PC, but it was a complete dog on my G5). First off, I had to upgrade my memory, graphics card and Vista version in order to get all the supposed "cool" features. I do like the overall look of the OS as it is very Mac reminiscent. The "gadgets" are not as functional as Widgets. For example, I can click on weather and get a five day forecast on the web. I've also had a few incidents where it would go to sleep and never wake up. Earlier this week, it booted up and said, "Something was installed and Windows Vista cannot startup, please select Startup Repair". So, I figure ok Startup Repair will take care of this. It runs it's course and says, "Try starting up Windows Vista, Startup Repair attempted to fix the problem. If it did, Windows Vista will startup. If not, you will be prompted to use Startup Repair."
Now, that's not word for word, but you get the idea. My take is, "something is messed up and we don't know if we can fix". Funny thing is, I didn't install anything. Microsoft on the other hand is installing updates regularly. Seems to be quite a few fixes happening.
I've had the box for 2 weeks or so and it's already got problems that I've never experienced on my Mac. If this were my daily driver, I'd really be up a creak.
Do I like Vista? Yes, but it's safe to say that XP is more stable platform. Will it make me forget about my Mac. Definitely not. Half of the new features have been standard on the Mac for quite some time. Widgets, Spotlight to mention a few.
-Chris
wot_fan
New Member
Silver
Mar 7, 2007
586
0
0
48
Chicagoland
web.mac.com
#5
Thanks for the info Chris. It is good to hear a Mac users opinion of Vista. I do have one question for you though. In your opinion, are there any feature in Vista that are not on a Mac or work better than the Mac equivalent?
chris
Administrator
Administrator
Jun 10, 2006
11,810
1,775
113
Long Island, NY
#6
Thanks for the info Chris. It is good to hear a Mac users opinion of Vista. I do have one question for you though. In your opinion, are there any feature in Vista that are not on a Mac or work better than the Mac equivalent?
I'm admittedly biased and to be honest I haven't worked on it enough to find anything. As I use it more, I'll share my findings.
Here's on thing that bugged me. They ship the computer without an OS CD/DVD. So if you want to do a clean install of the OS, you're out of luck. You need to call or email them to get a copy. Even that transaction wasn't so easy. I exchanged a few emails with DELL support until they finally understood. Not like I was asking to do 3d modeling. I even filled out a form on DELL's site that is there for this exact request. When they finally understood, they said I would be receiving my Windows XP CD in the next few days. I shook my head and politely asked for Windows Vista. Oh that wonderful DELL technical support. :mad: BTW, I did finally receive it and considering a clean install to get rid of all of the trial software. Yes, the commercials are true.:p
-Chris
archer6
New Member
Bronze
May 15, 2007
129
0
0
#8
As a software engineer that does a lot of cross platform work, I've been working extensively with OS X, Linux, Unix, and Windows in their various forms, for years.
Most specifically (to the Vista question) I've been working with Vista since the first beta and now with the "over the counter" released product.
Respecting my multiple NDA's on all fronts I will share this general info.
Disclaimer: I must state that I've always been pro-mac. However that said I focus on being as neutral as possible. I find the positives in all platforms and build around that.
Compromise: While I'm stating the obvious, nonetheless I must say that as everyone knows, every single product, which in this case is operating systems, always involve compromises. It's a matter of balance. It's a matter of packing in as many features as possible while facing the overwhelming challenge of trying to satisfy a huge group of people all of whom have a wide range of preferences. No one OS can be everything to everyone, hence the huge challenge and every growing list of compromises.
So, for sake of comparison, I will categorize users into the two most common groups and sub groups.
1) * Consumers *
a) General broad usage
b) Gamers
2) * Business Users *
a) Large Scale Enterprise
b) Small to Medium Businesses
Now lets' reduce this down to consumers as individually that's how we use our personal machines.
I give the nod to OS X.
Eventually (approx 1 yr) Vista will be more stable, refined, improved, with added features. At that point it may be a closer competitor to OS X. Notice I said "May". At this point it's simply crazy to predict ahead that far. However it does seem to be going in that direction at a fairly steady pace. And then again, so is OS X, thereforee it's anyones guess.
Presently other than some networking advantages that Vista has, on a general level I would much rather use OS X.
joe
New Member
Gold
May 5, 2007
1,113
0
0
#9
I give the nod to OS X.
Eventually (approx 1 yr) Vista will be more stable, refined, improved, with added features. At that point it may be a closer competitor to OS X. Notice I said "May". At this point it's simply crazy to predict ahead that far. However it does seem to be going in that direction at a fairly steady pace. And then again, so is OS X, thereforee it's anyones guess.
Presently other than some networking advantages that Vista has, on a general level I would much rather use OS X.
Good to hear! Tiger (out for 2y now) is already ahead of Vista. Now in a year's time Leopard will have been out for a while and Vista will just be becoming stable/useable.
Spin This!
New Member
Silver
May 4, 2007
504
0
0
#10
I hear the networking is better in Vista than on a Mac. :p
Funny you should mention that. Compared to my Macs (and to a lesser extent XP), Vista kept dropping the connection. I want to chalk it up to beta network drivers but as a Mac fanboy I'll just say Vista. ;) Those little "repair" things are somewhat helpful but it seems like it takes forever to "repair" the connection (at least compared to XP). Mac OS X is way better in this respect.
After using Tiger's widgets since its inception, Vista's Gadgets just look like knockoffs. Apple's Expose feature to bring them in and out can't be beat. (If you need them to stay on the deskop, developer mode can be handy.)
Honestly I'm biased as well... been Mac user since the LCIII.
In your opinion, are there any feature in Vista that are not on a Mac or work better than the Mac equivalent?
I really can't think of anything... everything's so different. The Window switcher where it stacks your Windows (a la Exposé) is an improvement from XP but I wouldn't say it's better than Mac OS X's Exposé.
Honestly, my time is limited to a couple days using it but I can tell you it felt like a real cheap knock off Mac OS X. After Vista kept freezing, I went back to XP and everything was OK. I really only use my Windows box for recording TV shows off the air, among other things.
| {
"url": "http://forums.everythingicafe.com/threads/anyone-running-vista.741/",
"source_domain": "forums.everythingicafe.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "103204",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZHSFJF23ZH2RCRDQDSVY44AY76OUCCWD",
"WARC-Concurrent-To": "<urn:uuid:cfe1f33f-9388-4c6e-9997-26a2cf9312f1>",
"WARC-Date": "2017-12-13T14:49:20Z",
"WARC-IP-Address": "67.225.188.206",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6RC35IOQQWMKN4G7RBZXQFRULQXKDHAA",
"WARC-Record-ID": "<urn:uuid:9e97d15e-da51-4fad-9e21-c97c650e2adc>",
"WARC-Target-URI": "http://forums.everythingicafe.com/threads/anyone-running-vista.741/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:11eb6f64-fccb-42bd-a55d-ab045440a4c7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-159-16-27.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
22,
23,
48,
117,
125,
126,
137,
138,
149,
156,
168,
172,
174,
176,
179,
370,
371,
680,
681,
691,
693,
694,
698,
699,
710,
715,
727,
733,
735,
737,
740,
896,
898,
899,
905,
906,
920,
934,
947,
954,
960,
964,
980,
983,
1914,
1915,
2183,
2184,
2344,
2345,
2587,
2588,
2595,
2597,
2598,
2606,
2607,
2618,
2625,
2637,
2641,
2643,
2645,
2648,
2660,
2672,
2675,
2900,
2902,
2903,
2909,
2910,
2924,
2938,
2951,
2958,
2964,
2968,
2984,
2987,
3212,
3341,
3342,
4102,
4103,
4110,
4112,
4113,
4121,
4122,
4133,
4140,
4153,
4157,
4159,
4161,
4164,
4328,
4329,
4475,
4476,
4551,
4552,
4728,
4729,
5228,
5229,
5329,
5330,
5347,
5370,
5380,
5402,
5428,
5458,
5459,
5556,
5557,
5581,
5582,
5942,
5943,
6056,
6058,
6059,
6063,
6064,
6075,
6080,
6092,
6098,
6100,
6102,
6105,
6129,
6130,
6490,
6491,
6604,
6776,
6778,
6779,
6790,
6791,
6802,
6809,
6821,
6825,
6827,
6829,
6833,
6892,
7277,
7278,
7503,
7504,
7566,
7567,
7677,
7884,
7885,
8162
],
"line_end_idx": [
22,
23,
48,
117,
125,
126,
137,
138,
149,
156,
168,
172,
174,
176,
179,
370,
371,
680,
681,
691,
693,
694,
698,
699,
710,
715,
727,
733,
735,
737,
740,
896,
898,
899,
905,
906,
920,
934,
947,
954,
960,
964,
980,
983,
1914,
1915,
2183,
2184,
2344,
2345,
2587,
2588,
2595,
2597,
2598,
2606,
2607,
2618,
2625,
2637,
2641,
2643,
2645,
2648,
2660,
2672,
2675,
2900,
2902,
2903,
2909,
2910,
2924,
2938,
2951,
2958,
2964,
2968,
2984,
2987,
3212,
3341,
3342,
4102,
4103,
4110,
4112,
4113,
4121,
4122,
4133,
4140,
4153,
4157,
4159,
4161,
4164,
4328,
4329,
4475,
4476,
4551,
4552,
4728,
4729,
5228,
5229,
5329,
5330,
5347,
5370,
5380,
5402,
5428,
5458,
5459,
5556,
5557,
5581,
5582,
5942,
5943,
6056,
6058,
6059,
6063,
6064,
6075,
6080,
6092,
6098,
6100,
6102,
6105,
6129,
6130,
6490,
6491,
6604,
6776,
6778,
6779,
6790,
6791,
6802,
6809,
6821,
6825,
6827,
6829,
6833,
6892,
7277,
7278,
7503,
7504,
7566,
7567,
7677,
7884,
7885,
8162,
8163
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8163,
"ccnet_original_nlines": 162,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41586795449256897,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.055910538882017136,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19116081297397614,
"rps_doc_frac_unique_words": 0.37097832560539246,
"rps_doc_mean_word_length": 4.11359167098999,
"rps_doc_num_sentences": 113,
"rps_doc_symbol_to_word_ratio": 0.005857289768755436,
"rps_doc_unigram_entropy": 5.6583571434021,
"rps_doc_word_count": 1523,
"rps_doc_frac_chars_dupe_10grams": 0.2330407053232193,
"rps_doc_frac_chars_dupe_5grams": 0.2330407053232193,
"rps_doc_frac_chars_dupe_6grams": 0.2330407053232193,
"rps_doc_frac_chars_dupe_7grams": 0.2330407053232193,
"rps_doc_frac_chars_dupe_8grams": 0.2330407053232193,
"rps_doc_frac_chars_dupe_9grams": 0.2330407053232193,
"rps_doc_frac_chars_top_2gram": 0.005746209993958473,
"rps_doc_frac_chars_top_3gram": 0.0038308100774884224,
"rps_doc_frac_chars_top_4gram": 0.007661609910428524,
"rps_doc_books_importance": -921.1159057617188,
"rps_doc_books_importance_length_correction": -921.1159057617188,
"rps_doc_openwebtext_importance": -501.6561279296875,
"rps_doc_openwebtext_importance_length_correction": -501.6561279296875,
"rps_doc_wikipedia_importance": -372.0907897949219,
"rps_doc_wikipedia_importance_length_correction": -372.0907897949219
},
"fasttext": {
"dclm": 0.0325927697122097,
"english": 0.9646676778793335,
"fineweb_edu_approx": 1.0293461084365845,
"eai_general_math": 0.24253559112548828,
"eai_open_web_math": 0.2582622170448303,
"eai_web_code": 0.030408019199967384
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-7,739,460,630,707,928,000 | Isosceles triangle calculator (a,b)
Please enter two properties of the isosceles triangle
Use symbols: a, b, h, T, p, A, B, C, r, R
You have entered side a and b.
Acute isosceles triangle.
Sides: a = 46.545 b = 46.545 c = 34.909
Area: T = 753.1322338481
Perimeter: p = 127.999
Semiperimeter: s = 643.9995
Angle ∠ A = α = 67.97655211781° = 67°58'32″ = 1.18663966553 rad
Angle ∠ B = β = 67.97655211781° = 67°58'32″ = 1.18663966553 rad
Angle ∠ C = γ = 44.04989576438° = 44°2'56″ = 0.7698799343 rad
Height: ha = 32.36114711991
Height: hb = 32.36114711991
Height: hc = 43.14883192575
Median: ma = 33.92553356174
Median: mb = 33.92553356174
Median: mc = 43.14883192575
Inradius: r = 11.76877847246
Circumradius: R = 25.10545354985
Vertex coordinates: A[34.909; 0] B[0; 0] C[17.45545; 43.14883192575]
Centroid: CG[17.45545; 14.38327730858]
Coordinates of the circumscribed circle: U[17.45545; 18.04437837591]
Coordinates of the inscribed circle: I[17.45545; 11.76877847246]
Exterior(or external, outer) angles of the triangle:
∠ A' = α' = 112.0244478822° = 112°1'28″ = 1.18663966553 rad
∠ B' = β' = 112.0244478822° = 112°1'28″ = 1.18663966553 rad
∠ C' = γ' = 135.9511042356° = 135°57'4″ = 0.7698799343 rad
Calculate another triangle
How did we calculate this triangle?
Now we know the lengths of all three sides of the triangle and the triangle is uniquely determined. Next we calculate another its characteristics - same procedure as calculation of the triangle from the known three sides SSS.
a = 46.55 ; ; b = 46.55 ; ; c = 34.91 ; ;
1. The triangle circumference is the sum of the lengths of its three sides
p = a+b+c = 46.55+46.55+34.91 = 128 ; ;
2. Semiperimeter of the triangle
s = fraction{ o }{ 2 } = fraction{ 128 }{ 2 } = 64 ; ;
3. The triangle area using Heron's formula
T = sqrt{ s(s-a)(s-b)(s-c) } ; ; T = sqrt{ 64 * (64-46.55)(64-46.55)(64-34.91) } ; ; T = sqrt{ 567208.32 } = 753.13 ; ;
4. Calculate the heights of the triangle from its area.
T = fraction{ a h _a }{ 2 } ; ; h _a = fraction{ 2 T }{ a } = fraction{ 2 * 753.13 }{ 46.55 } = 32.36 ; ; h _b = fraction{ 2 T }{ b } = fraction{ 2 * 753.13 }{ 46.55 } = 32.36 ; ; h _c = fraction{ 2 T }{ c } = fraction{ 2 * 753.13 }{ 34.91 } = 43.15 ; ;
5. Calculation of the inner angles of the triangle using a Law of Cosines
a**2 = b**2+c**2 - 2bc cos alpha ; ; alpha = arccos( fraction{ b**2+c**2-a**2 }{ 2bc } ) = arccos( fraction{ 46.55**2+34.91**2-46.55**2 }{ 2 * 46.55 * 34.91 } ) = 67° 58'32" ; ; b**2 = a**2+c**2 - 2ac cos beta ; ; beta = arccos( fraction{ a**2+c**2-b**2 }{ 2ac } ) = arccos( fraction{ 46.55**2+34.91**2-46.55**2 }{ 2 * 46.55 * 34.91 } ) = 67° 58'32" ; ; gamma = 180° - alpha - beta = 180° - 67° 58'32" - 67° 58'32" = 44° 2'56" ; ;
6. Inradius
T = rs ; ; r = fraction{ T }{ s } = fraction{ 753.13 }{ 64 } = 11.77 ; ;
7. Circumradius
R = fraction{ a }{ 2 * sin alpha } = fraction{ 46.55 }{ 2 * sin 67° 58'32" } = 25.1 ; ;
8. Calculation of medians
m_a = fraction{ sqrt{ 2 b**2+2c**2 - a**2 } }{ 2 } = fraction{ sqrt{ 2 * 46.55**2+2 * 34.91**2 - 46.55**2 } }{ 2 } = 33.925 ; ; m_b = fraction{ sqrt{ 2 c**2+2a**2 - b**2 } }{ 2 } = fraction{ sqrt{ 2 * 34.91**2+2 * 46.55**2 - 46.55**2 } }{ 2 } = 33.925 ; ; m_c = fraction{ sqrt{ 2 b**2+2a**2 - c**2 } }{ 2 } = fraction{ sqrt{ 2 * 46.55**2+2 * 46.55**2 - 34.91**2 } }{ 2 } = 43.148 ; ;
Calculate another triangle
Look also our friend's collection of math examples and problems:
See more informations about triangles or more information about solving triangles. | {
"url": "https://www.triangle-calculator.com/?a=a%3D46.545+b%3D34.909&q=a%3D10+b%3D5&what=iso",
"source_domain": "www.triangle-calculator.com",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "18955",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DQEX6BVBPQUFCV7OR2W4QZGW4YOWRX6X",
"WARC-Concurrent-To": "<urn:uuid:6aae7865-d420-4645-9130-9455b7684da1>",
"WARC-Date": "2019-06-17T07:38:10Z",
"WARC-IP-Address": "104.28.12.22",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JZHQSGIE7IBLM55DWYWCFRTGA5IIQIWE",
"WARC-Record-ID": "<urn:uuid:f0c73fd0-ff72-4133-bd23-2ef58689d69b>",
"WARC-Target-URI": "https://www.triangle-calculator.com/?a=a%3D46.545+b%3D34.909&q=a%3D10+b%3D5&what=iso",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8b0c1c7f-afec-4bf8-a25d-49e3cc6d08ad>"
},
"warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-156-104-6.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
36,
37,
91,
92,
134,
135,
136,
167,
168,
194,
195,
239,
240,
265,
288,
316,
317,
381,
445,
507,
508,
536,
564,
592,
593,
621,
649,
677,
678,
707,
740,
741,
810,
849,
918,
983,
984,
1037,
1097,
1157,
1216,
1217,
1244,
1245,
1246,
1247,
1248,
1284,
1285,
1511,
1512,
1554,
1555,
1630,
1631,
1671,
1672,
1705,
1706,
1761,
1762,
1805,
1806,
1926,
1927,
1983,
1984,
2238,
2239,
2313,
2314,
2745,
2746,
2758,
2759,
2832,
2833,
2849,
2850,
2938,
2939,
2965,
2966,
3350,
3377,
3378,
3443,
3444
],
"line_end_idx": [
36,
37,
91,
92,
134,
135,
136,
167,
168,
194,
195,
239,
240,
265,
288,
316,
317,
381,
445,
507,
508,
536,
564,
592,
593,
621,
649,
677,
678,
707,
740,
741,
810,
849,
918,
983,
984,
1037,
1097,
1157,
1216,
1217,
1244,
1245,
1246,
1247,
1248,
1284,
1285,
1511,
1512,
1554,
1555,
1630,
1631,
1671,
1672,
1705,
1706,
1761,
1762,
1805,
1806,
1926,
1927,
1983,
1984,
2238,
2239,
2313,
2314,
2745,
2746,
2758,
2759,
2832,
2833,
2849,
2850,
2938,
2939,
2965,
2966,
3350,
3377,
3378,
3443,
3444,
3526
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3526,
"ccnet_original_nlines": 88,
"rps_doc_curly_bracket": 0.031196819618344307,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11492280662059784,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025728989392518997,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7058318853378296,
"rps_doc_frac_unique_words": 0.4134199023246765,
"rps_doc_mean_word_length": 4.8246750831604,
"rps_doc_num_sentences": 96,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.752500534057617,
"rps_doc_word_count": 462,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1516375094652176,
"rps_doc_frac_chars_dupe_6grams": 0.09959623217582703,
"rps_doc_frac_chars_dupe_7grams": 0.040376849472522736,
"rps_doc_frac_chars_dupe_8grams": 0.040376849472522736,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.024674739688634872,
"rps_doc_frac_chars_top_3gram": 0.03499326854944229,
"rps_doc_frac_chars_top_4gram": 0.018842529505491257,
"rps_doc_books_importance": -612.8590087890625,
"rps_doc_books_importance_length_correction": -612.8590087890625,
"rps_doc_openwebtext_importance": -409.8932189941406,
"rps_doc_openwebtext_importance_length_correction": -409.8932189941406,
"rps_doc_wikipedia_importance": -313.981201171875,
"rps_doc_wikipedia_importance_length_correction": -313.981201171875
},
"fasttext": {
"dclm": 0.9999954700469971,
"english": 0.5040981769561768,
"fineweb_edu_approx": 3.791153907775879,
"eai_general_math": 0.9991576671600342,
"eai_open_web_math": 0.9329409599304199,
"eai_web_code": 0.6021708846092224
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "516.22",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
6,592,199,457,390,581,000 | Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
Is there a way to test if a certain element (.container) is hidden, in a whole document? Such as (which doesn't work properly):
$(".showall").click(
function () {
if ($(".container").is("hidden"))
{perform a task}
else
{return false;}
});
share|improve this question
add comment
2 Answers
up vote 4 down vote accepted
It sounds like you want to test if at least one of the .container elements is hidden.
If so, you can use the :hidden selector, and check the length property to see how many were returned.
$(".showall").click(
function () {
if ($(".container:hidden").length)
// found at least one hidden
else
// didn't find any hidden
});
If you wanted to test to see if all were hidden, use the :visible selector like this:
$(".showall").click(
function () {
if ($(".container:visible").length)
// found at least one visible
else
// didn't find any visible
});
share|improve this answer
2
Why was this down voted? What is incorrect? The question isn't entirely clear. OP said in a whole document which sounds like OP is testing for any or all hidden or visible. – user113716 Jun 24 '10 at 3:46
You were correct. The code works perfectly :) – steve Jun 24 '10 at 3:55
@steve - Glad it helped. :o) – user113716 Jun 24 '10 at 3:59
add comment
You mean to use is visible:
$(".showall").click(
function () {
if ($('.container').is(":visible") == false)
{perform a task}
else
{return false;}
});
share|improve this answer
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "http://stackoverflow.com/questions/3107076/jquery-if-any-of-a-certain-class-is-hidden-perform-a-task-else-perform-another?answertab=oldest",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "67880",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:R23C4B4JTIIONMCCJRD6WRYRUTF2XH66",
"WARC-Concurrent-To": "<urn:uuid:5522bce4-4675-43bb-b981-218b2f129ca8>",
"WARC-Date": "2014-03-13T09:32:30Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:KM72L6L4UKYW3C3FSOSM3KGXBTT7OZ4C",
"WARC-Record-ID": "<urn:uuid:a215e2a5-3c99-4204-aaf2-f893eb211cc8>",
"WARC-Target-URI": "http://stackoverflow.com/questions/3107076/jquery-if-any-of-a-certain-class-is-hidden-perform-a-task-else-perform-another?answertab=oldest",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f0681d93-9d3e-4572-ad18-cbd171f08c7d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
25,
157,
158,
286,
287,
308,
326,
368,
401,
418,
450,
458,
486,
498,
499,
509,
510,
539,
540,
626,
627,
729,
730,
751,
769,
812,
854,
867,
906,
914,
915,
1001,
1002,
1023,
1041,
1085,
1128,
1141,
1181,
1189,
1215,
1219,
1425,
1427,
1501,
1503,
1565,
1577,
1578,
1606,
1607,
1628,
1646,
1699,
1732,
1749,
1781,
1789,
1815,
1827,
1828,
1840,
1841,
1843,
1851,
1852,
1930,
1931
],
"line_end_idx": [
25,
157,
158,
286,
287,
308,
326,
368,
401,
418,
450,
458,
486,
498,
499,
509,
510,
539,
540,
626,
627,
729,
730,
751,
769,
812,
854,
867,
906,
914,
915,
1001,
1002,
1023,
1041,
1085,
1128,
1141,
1181,
1189,
1215,
1219,
1425,
1427,
1501,
1503,
1565,
1577,
1578,
1606,
1607,
1628,
1646,
1699,
1732,
1749,
1781,
1789,
1815,
1827,
1828,
1840,
1841,
1843,
1851,
1852,
1930,
1931,
2021
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2021,
"ccnet_original_nlines": 68,
"rps_doc_curly_bracket": 0.007916869595646858,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3128078877925873,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004926110152155161,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3103448152542114,
"rps_doc_frac_unique_words": 0.5036231875419617,
"rps_doc_mean_word_length": 4.724637508392334,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.6735992431640625,
"rps_doc_word_count": 276,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09662576764822006,
"rps_doc_frac_chars_dupe_6grams": 0.09662576764822006,
"rps_doc_frac_chars_dupe_7grams": 0.0659509226679802,
"rps_doc_frac_chars_dupe_8grams": 0.0659509226679802,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.061349689960479736,
"rps_doc_frac_chars_top_3gram": 0.06748466193675995,
"rps_doc_frac_chars_top_4gram": 0.02070551924407482,
"rps_doc_books_importance": -182.1927947998047,
"rps_doc_books_importance_length_correction": -182.1927947998047,
"rps_doc_openwebtext_importance": -103.21672058105469,
"rps_doc_openwebtext_importance_length_correction": -103.21672058105469,
"rps_doc_wikipedia_importance": -85.44900512695312,
"rps_doc_wikipedia_importance_length_correction": -85.44900512695312
},
"fasttext": {
"dclm": 0.821688711643219,
"english": 0.7898546457290649,
"fineweb_edu_approx": 1.8182264566421509,
"eai_general_math": 0.00012290000449866056,
"eai_open_web_math": 0.07824456691741943,
"eai_web_code": -0.000008820000402920414
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
8,972,132,903,729,840,000 | Documentation Home
MySQL 5.7 Reference Manual
Related Documentation Download this Manual
PDF (US Ltr) - 36.3Mb
PDF (A4) - 36.3Mb
PDF (RPM) - 36.3Mb
HTML Download (TGZ) - 10.4Mb
HTML Download (Zip) - 10.5Mb
HTML Download (RPM) - 9.2Mb
Man Pages (TGZ) - 224.6Kb
Man Pages (Zip) - 332.7Kb
Info (Gzip) - 3.3Mb
Info (Zip) - 3.3Mb
Excerpts from this Manual
3.3.4.5 Date Calculations
MySQL provides several functions that you can use to perform calculations on dates, for example, to calculate ages or extract parts of dates.
To determine how many years old each of your pets is, use the TIMESTAMPDIFF() function. Its arguments are the unit in which you want the result expressed, and the two dates for which to take the difference. The following query shows, for each pet, the birth date, the current date, and the age in years. An alias (age) is used to make the final output column label more meaningful.
mysql> SELECT name, birth, CURDATE(),
TIMESTAMPDIFF(YEAR,birth,CURDATE()) AS age
FROM pet;
+----------+------------+------------+------+
| name | birth | CURDATE() | age |
+----------+------------+------------+------+
| Fluffy | 1993-02-04 | 2003-08-19 | 10 |
| Claws | 1994-03-17 | 2003-08-19 | 9 |
| Buffy | 1989-05-13 | 2003-08-19 | 14 |
| Fang | 1990-08-27 | 2003-08-19 | 12 |
| Bowser | 1989-08-31 | 2003-08-19 | 13 |
| Chirpy | 1998-09-11 | 2003-08-19 | 4 |
| Whistler | 1997-12-09 | 2003-08-19 | 5 |
| Slim | 1996-04-29 | 2003-08-19 | 7 |
| Puffball | 1999-03-30 | 2003-08-19 | 4 |
+----------+------------+------------+------+
The query works, but the result could be scanned more easily if the rows were presented in some order. This can be done by adding an ORDER BY name clause to sort the output by name:
mysql> SELECT name, birth, CURDATE(),
TIMESTAMPDIFF(YEAR,birth,CURDATE()) AS age
FROM pet ORDER BY name;
+----------+------------+------------+------+
| name | birth | CURDATE() | age |
+----------+------------+------------+------+
| Bowser | 1989-08-31 | 2003-08-19 | 13 |
| Buffy | 1989-05-13 | 2003-08-19 | 14 |
| Chirpy | 1998-09-11 | 2003-08-19 | 4 |
| Claws | 1994-03-17 | 2003-08-19 | 9 |
| Fang | 1990-08-27 | 2003-08-19 | 12 |
| Fluffy | 1993-02-04 | 2003-08-19 | 10 |
| Puffball | 1999-03-30 | 2003-08-19 | 4 |
| Slim | 1996-04-29 | 2003-08-19 | 7 |
| Whistler | 1997-12-09 | 2003-08-19 | 5 |
+----------+------------+------------+------+
To sort the output by age rather than name, just use a different ORDER BY clause:
mysql> SELECT name, birth, CURDATE(),
TIMESTAMPDIFF(YEAR,birth,CURDATE()) AS age
FROM pet ORDER BY age;
+----------+------------+------------+------+
| name | birth | CURDATE() | age |
+----------+------------+------------+------+
| Chirpy | 1998-09-11 | 2003-08-19 | 4 |
| Puffball | 1999-03-30 | 2003-08-19 | 4 |
| Whistler | 1997-12-09 | 2003-08-19 | 5 |
| Slim | 1996-04-29 | 2003-08-19 | 7 |
| Claws | 1994-03-17 | 2003-08-19 | 9 |
| Fluffy | 1993-02-04 | 2003-08-19 | 10 |
| Fang | 1990-08-27 | 2003-08-19 | 12 |
| Bowser | 1989-08-31 | 2003-08-19 | 13 |
| Buffy | 1989-05-13 | 2003-08-19 | 14 |
+----------+------------+------------+------+
A similar query can be used to determine age at death for animals that have died. You determine which animals these are by checking whether the death value is NULL. Then, for those with non-NULL values, compute the difference between the death and birth values:
mysql> SELECT name, birth, death,
TIMESTAMPDIFF(YEAR,birth,death) AS age
FROM pet WHERE death IS NOT NULL ORDER BY age;
+--------+------------+------------+------+
| name | birth | death | age |
+--------+------------+------------+------+
| Bowser | 1989-08-31 | 1995-07-29 | 5 |
+--------+------------+------------+------+
The query uses death IS NOT NULL rather than death <> NULL because NULL is a special value that cannot be compared using the usual comparison operators. This is discussed later. See Section 3.3.4.6, “Working with NULL Values”.
What if you want to know which animals have birthdays next month? For this type of calculation, year and day are irrelevant; you simply want to extract the month part of the birth column. MySQL provides several functions for extracting parts of dates, such as YEAR(), MONTH(), and DAYOFMONTH(). MONTH() is the appropriate function here. To see how it works, run a simple query that displays the value of both birth and MONTH(birth):
mysql> SELECT name, birth, MONTH(birth) FROM pet;
+----------+------------+--------------+
| name | birth | MONTH(birth) |
+----------+------------+--------------+
| Fluffy | 1993-02-04 | 2 |
| Claws | 1994-03-17 | 3 |
| Buffy | 1989-05-13 | 5 |
| Fang | 1990-08-27 | 8 |
| Bowser | 1989-08-31 | 8 |
| Chirpy | 1998-09-11 | 9 |
| Whistler | 1997-12-09 | 12 |
| Slim | 1996-04-29 | 4 |
| Puffball | 1999-03-30 | 3 |
+----------+------------+--------------+
Finding animals with birthdays in the upcoming month is also simple. Suppose that the current month is April. Then the month value is 4 and you can look for animals born in May (month 5) like this:
mysql> SELECT name, birth FROM pet WHERE MONTH(birth) = 5;
+-------+------------+
| name | birth |
+-------+------------+
| Buffy | 1989-05-13 |
+-------+------------+
There is a small complication if the current month is December. You cannot merely add one to the month number (12) and look for animals born in month 13, because there is no such month. Instead, you look for animals born in January (month 1).
You can write the query so that it works no matter what the current month is, so that you do not have to use the number for a particular month. DATE_ADD() enables you to add a time interval to a given date. If you add a month to the value of CURDATE(), then extract the month part with MONTH(), the result produces the month in which to look for birthdays:
mysql> SELECT name, birth FROM pet
WHERE MONTH(birth) = MONTH(DATE_ADD(CURDATE(),INTERVAL 1 MONTH));
A different way to accomplish the same task is to add 1 to get the next month after the current one after using the modulo function (MOD) to wrap the month value to 0 if it is currently 12:
mysql> SELECT name, birth FROM pet
WHERE MONTH(birth) = MOD(MONTH(CURDATE()), 12) + 1;
MONTH() returns a number between 1 and 12. And MOD(something,12) returns a number between 0 and 11. So the addition has to be after the MOD(), otherwise we would go from November (11) to January (1).
If a calculation uses invalid dates, the calculation fails and produces warnings:
mysql> SELECT '2018-10-31' + INTERVAL 1 DAY;
+-------------------------------+
| '2018-10-31' + INTERVAL 1 DAY |
+-------------------------------+
| 2018-11-01 |
+-------------------------------+
mysql> SELECT '2018-10-32' + INTERVAL 1 DAY;
+-------------------------------+
| '2018-10-32' + INTERVAL 1 DAY |
+-------------------------------+
| NULL |
+-------------------------------+
mysql> SHOW WARNINGS;
+---------+------+----------------------------------------+
| Level | Code | Message |
+---------+------+----------------------------------------+
| Warning | 1292 | Incorrect datetime value: '2018-10-32' |
+---------+------+----------------------------------------+ | {
"url": "https://dev.mysql.com/doc/refman/5.7/en/date-calculations.html",
"source_domain": "dev.mysql.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "62476",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YQRHXR6ULWJBKQL6KQPCELJXTK7FUEWY",
"WARC-Concurrent-To": "<urn:uuid:c2b75be6-91e2-47a6-82bf-cd18731ff8ef>",
"WARC-Date": "2020-11-26T10:30:34Z",
"WARC-IP-Address": "137.254.60.11",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BLCUHTWPYMMTWZTZTOYVKXCUMATEBJAF",
"WARC-Record-ID": "<urn:uuid:b23fcc2a-009b-42eb-97f7-92541604f9a3>",
"WARC-Target-URI": "https://dev.mysql.com/doc/refman/5.7/en/date-calculations.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:83dc681a-10e6-434a-8fd6-260721220b5d>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-96.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
19,
46,
89,
111,
129,
148,
177,
206,
234,
260,
286,
306,
325,
351,
352,
378,
379,
521,
522,
904,
905,
943,
993,
1010,
1056,
1102,
1148,
1194,
1240,
1286,
1332,
1378,
1424,
1470,
1516,
1562,
1608,
1609,
1791,
1792,
1830,
1880,
1911,
1957,
2003,
2049,
2095,
2141,
2187,
2233,
2279,
2325,
2371,
2417,
2463,
2509,
2510,
2592,
2593,
2631,
2681,
2711,
2757,
2803,
2849,
2895,
2941,
2987,
3033,
3079,
3125,
3171,
3217,
3263,
3309,
3310,
3572,
3573,
3607,
3653,
3707,
3751,
3795,
3839,
3883,
3927,
3928,
4155,
4156,
4589,
4590,
4640,
4681,
4722,
4763,
4804,
4845,
4886,
4927,
4968,
5009,
5050,
5091,
5132,
5173,
5174,
5372,
5373,
5432,
5455,
5478,
5501,
5524,
5547,
5548,
5791,
5792,
6149,
6150,
6185,
6258,
6259,
6449,
6450,
6485,
6544,
6545,
6745,
6746,
6828,
6829,
6874,
6908,
6942,
6976,
7010,
7044,
7089,
7123,
7157,
7191,
7225,
7259,
7281,
7341,
7401,
7461,
7521
],
"line_end_idx": [
19,
46,
89,
111,
129,
148,
177,
206,
234,
260,
286,
306,
325,
351,
352,
378,
379,
521,
522,
904,
905,
943,
993,
1010,
1056,
1102,
1148,
1194,
1240,
1286,
1332,
1378,
1424,
1470,
1516,
1562,
1608,
1609,
1791,
1792,
1830,
1880,
1911,
1957,
2003,
2049,
2095,
2141,
2187,
2233,
2279,
2325,
2371,
2417,
2463,
2509,
2510,
2592,
2593,
2631,
2681,
2711,
2757,
2803,
2849,
2895,
2941,
2987,
3033,
3079,
3125,
3171,
3217,
3263,
3309,
3310,
3572,
3573,
3607,
3653,
3707,
3751,
3795,
3839,
3883,
3927,
3928,
4155,
4156,
4589,
4590,
4640,
4681,
4722,
4763,
4804,
4845,
4886,
4927,
4968,
5009,
5050,
5091,
5132,
5173,
5174,
5372,
5373,
5432,
5455,
5478,
5501,
5524,
5547,
5548,
5791,
5792,
6149,
6150,
6185,
6258,
6259,
6449,
6450,
6485,
6544,
6545,
6745,
6746,
6828,
6829,
6874,
6908,
6942,
6976,
7010,
7044,
7089,
7123,
7157,
7191,
7225,
7259,
7281,
7341,
7401,
7461,
7521,
7580
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7580,
"ccnet_original_nlines": 148,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18360070884227753,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06833036243915558,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5424836874008179,
"rps_doc_frac_unique_words": 0.31931817531585693,
"rps_doc_mean_word_length": 4.801136493682861,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.111382007598877,
"rps_doc_word_count": 880,
"rps_doc_frac_chars_dupe_10grams": 0.07763314247131348,
"rps_doc_frac_chars_dupe_5grams": 0.17538462579250336,
"rps_doc_frac_chars_dupe_6grams": 0.14579881727695465,
"rps_doc_frac_chars_dupe_7grams": 0.14579881727695465,
"rps_doc_frac_chars_dupe_8grams": 0.14579881727695465,
"rps_doc_frac_chars_dupe_9grams": 0.07763314247131348,
"rps_doc_frac_chars_top_2gram": 0.029822489246726036,
"rps_doc_frac_chars_top_3gram": 0.02840236946940422,
"rps_doc_frac_chars_top_4gram": 0.03786981850862503,
"rps_doc_books_importance": -818.3964233398438,
"rps_doc_books_importance_length_correction": -818.3964233398438,
"rps_doc_openwebtext_importance": -458.2976989746094,
"rps_doc_openwebtext_importance_length_correction": -458.2976989746094,
"rps_doc_wikipedia_importance": -476.7261962890625,
"rps_doc_wikipedia_importance_length_correction": -476.7261962890625
},
"fasttext": {
"dclm": 0.9952642917633057,
"english": 0.7000635862350464,
"fineweb_edu_approx": 2.1135308742523193,
"eai_general_math": 0.11440998315811157,
"eai_open_web_math": 0.13234096765518188,
"eai_web_code": 0.9676092267036438
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.746",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-5,281,361,617,482,623,000 | X hits on this document
PDF document
- page 44 / 70
246 views
0 shares
0 downloads
0 comments
44 / 70
Operating Example
and should be planned for. This suggests that the selection of bus architecture (and its adapter interface) should not be part of a proposed standard but left up to the manufacturer(s). An alternate viewpoint is that the RG may not become a standard without an agreed upon bus protocol, with designers having to support multiple protocols. The standards implementation groups should decide this issue.
Here is an example of the possible operation of the adapters in the RG. The details of how the RG actually operates will be defined during the standardization process.
Typically, each adapter will be servicing multiple data streams; for example, multiple telephone calls, multiple Internet accesses, or multiple video streams. When the RG is configured initially, and thereafter whenever an adapter is added or removed, each adapter registers with the system manager the services that are connected. For example, it might register that two telephones with distinct telephone numbers are attached; or it might register that it offers one or more access network services. When an adapter on the residence side initiates a new session, for example, Internet access or video-on-demand access, the adapter associates a stream identifier with the new session and requests the system manager to allocate an appropriate inbound (and outbound) transport to it. This is done by setting registers on the adapters and then interrupting the system processor; the RG control microprocessor collects the data from the adapter and passes it to the system manager program. If there is available capacity, the system manager returns the bus address of a register on the appropriate adapter (typically the access network
37
Document info
Document views246
Page views246
Page last viewedWed Dec 07 09:09:42 UTC 2016
Pages70
Paragraphs1218
Words14747
Comments | {
"url": "https://www.hitpages.com/doc/4509348575313920/44/",
"source_domain": "www.hitpages.com",
"snapshot_id": "crawl=CC-MAIN-2016-50",
"warc_metadata": {
"Content-Length": "104908",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:42SVDBIVR2WT2OLSMSHXK2GUKCMT2DZU",
"WARC-Concurrent-To": "<urn:uuid:4e69eeb4-749f-41a8-b413-1c135b1f4a5d>",
"WARC-Date": "2016-12-07T10:52:17Z",
"WARC-IP-Address": "172.217.1.19",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:525YJ4PHOKKQUZAM7KUIDMIVZGHRN6E5",
"WARC-Record-ID": "<urn:uuid:c6b34c21-858d-4c6f-9493-d9fea34271b4>",
"WARC-Target-URI": "https://www.hitpages.com/doc/4509348575313920/44/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:34a55105-e8ab-4425-a537-b8e3b532e663>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-31-129-80.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-50\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for November 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
24,
25,
38,
39,
70,
71,
81,
82,
91,
92,
104,
105,
116,
117,
125,
126,
144,
145,
547,
548,
716,
717,
1851,
1852,
1855,
1856,
1870,
1888,
1902,
1947,
1955,
1970,
1981,
1982
],
"line_end_idx": [
24,
25,
38,
39,
70,
71,
81,
82,
91,
92,
104,
105,
116,
117,
125,
126,
144,
145,
547,
548,
716,
717,
1851,
1852,
1855,
1856,
1870,
1888,
1902,
1947,
1955,
1970,
1981,
1982,
1990
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1990,
"ccnet_original_nlines": 34,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3926553726196289,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02259887009859085,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15536722540855408,
"rps_doc_frac_unique_words": 0.5258064270019531,
"rps_doc_mean_word_length": 5.238709449768066,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.715132713317871,
"rps_doc_word_count": 310,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.015394089743494987,
"rps_doc_frac_chars_top_3gram": 0.03940887004137039,
"rps_doc_frac_chars_top_4gram": 0.02339901030063629,
"rps_doc_books_importance": -123.21804809570312,
"rps_doc_books_importance_length_correction": -123.21804809570312,
"rps_doc_openwebtext_importance": -102.40336608886719,
"rps_doc_openwebtext_importance_length_correction": -102.40336608886719,
"rps_doc_wikipedia_importance": -75.14285278320312,
"rps_doc_wikipedia_importance_length_correction": -75.14285278320312
},
"fasttext": {
"dclm": 0.031193729490041733,
"english": 0.8914792537689209,
"fineweb_edu_approx": 1.9904028177261353,
"eai_general_math": 0.3831389546394348,
"eai_open_web_math": 0.055556770414114,
"eai_web_code": 0.680669903755188
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-7,715,579,039,195,634,000 | Tuesday, June 18, 2013
Highs, lows & random rants on SharePoint 2013
Here’s the presentation Harald Fianbakken and I gave at the Norwegian SharePoint Community meeting June 17th, 2013.
Basically a talk where we ranted on our experiences with 2013, highlighting the issues we ran into, and what we really love.
Here’s a small narrative per slide to give it all some more context.
Slide 6-8: The quality management system is an external system which stores it’s data as static HTML files. Along these files are corresponding image files when the artifact is a process diagram. The files are imported with a custom application which parses the <meta> tags of the HTML files, and stores the parsed data as publishing pages with custom columns to hold the metadata inside of SharePoint. The page library have several content types, and the right one is chosen on import depending on the parsed data. The images are stored in an image library.
The HTML files also contains image maps, which we parse and store the coordinates in order to re-create the navigation experience later inside of SharePoint.
Some of the metadata are stored as Managed Metadata, and a taxonomy is built upon import.
Slide 9: We auto-generate Content Types and lists based on reflection on annotated Poco’s. The poco’s are annotated using http://nuget.org/packages/Fianbakken.SharePointations/. Puzzlepart also has a framework which allows the use of Linq queries on the CT’s/Lists, instead of using CAML. Sort of like SP Metal, but you start with the poco, not the other way around.
Slide 11-13: The solution has a part which is an “Improvement Potential” log. When someone reports an improvement a workflow is started. We encountered multiple issues when developing this, mainly on the test server. The root cause was most of the time missing user profiles and missing e-mail addresses.
Slide 14: There is a bug in Workflows as of now which comes into play if you add custom task outcomes to the task form. Meaning, you want more than just Approve/Reject. If you add more, then the outcome is always “Approve”. You can however retrieve the real value in your workflow, and then act on it as a workaround. This took us one week to figure out (see the blogs referenced at the end slide for more info).
Slide 15: If you don’t click “Publish” before exporting a workflow you will get an error upon feature activation. Also, you have to retract/redploy your workflow if you re-export as the WSP’s get new id’s. This is an issue if you develop the workflow on one server and want to move it to another.
Slide 18-19: Excel rest is a good way to get graphs/named entities from within Excel files without having an Enterprise license.
Slide 20-21: See http://techmikael.blogspot.se/2013/04/how-to-enable-page-previews-in.html for more information.
Slide 23-24: By using the SP2013 social api, we can follow or bookmark publishing pages in SharePoint, allowing users to have favorites.
Slide 26-34: We use custom display templates, result sources, query rules and display blocks in order to create a sort of 360-view for processes. Searching for a process will show related improvements and related documents to a specific process.
The issues we encountered where related to pulling back managed properties for certain content types, and getting the display templates to trigger correctly. It’s all a bit buggy at the moment, but I’ve been told there are fixes coming in later CU’s.
What seems to work the best is to create managed properties on the SSA, stay away from the auto-generated ones, and have one result block per query rule, even though the rules are the same.
Slide 36-40: By using custom properties on terms, we created a configuration option for display forms. The taxonomy states which fields should be shown in our dynamic form based on values you choose, and which fields should show in new/edit mode. Basically we used the terms store as a way to configure an input form. The other choice would have been to create multiple forms to cover all scenarios. But the requirements kept changing, and this gave us flexibility and ease of configuration.
Slide 42-45: Be sure to keep people who know HTML and know SharePoint HTML at hand when implementing a custom design. It saves time!
| {
"url": "https://www.techmikael.com/2013/06/highs-lows-random-rants-on-sharepoint.html",
"source_domain": "www.techmikael.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "79081",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FEFXO5TH47IQNK62KK2ANJA2ZTSXYSD3",
"WARC-Concurrent-To": "<urn:uuid:2c6f79c0-eb51-421c-b4da-bc256dd6ef61>",
"WARC-Date": "2020-11-24T10:04:42Z",
"WARC-IP-Address": "172.217.9.211",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:DXZFNLRNRHMKATWU6R5KIUDHB3IJYIVB",
"WARC-Record-ID": "<urn:uuid:9871d371-eeba-4b7d-9e6f-681ee2d30350>",
"WARC-Target-URI": "https://www.techmikael.com/2013/06/highs-lows-random-rants-on-sharepoint.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9b342238-5423-4953-a9ff-8d45faf342a3>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-121.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
23,
24,
70,
71,
187,
188,
313,
314,
383,
384,
943,
944,
1102,
1103,
1193,
1194,
1561,
1562,
1867,
1868,
2281,
2282,
2579,
2580,
2709,
2710,
2823,
2824,
2961,
2962,
3208,
3209,
3460,
3461,
3651,
3652,
4144,
4145,
4278,
4279
],
"line_end_idx": [
23,
24,
70,
71,
187,
188,
313,
314,
383,
384,
943,
944,
1102,
1103,
1193,
1194,
1561,
1562,
1867,
1868,
2281,
2282,
2579,
2580,
2709,
2710,
2823,
2824,
2961,
2962,
3208,
3209,
3460,
3461,
3651,
3652,
4144,
4145,
4278,
4279,
4280
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4280,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.390625,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015625,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1852678656578064,
"rps_doc_frac_unique_words": 0.48801127076148987,
"rps_doc_mean_word_length": 4.825105667114258,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.321671009063721,
"rps_doc_word_count": 709,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.007307799998670816,
"rps_doc_frac_chars_top_3gram": 0.013154050335288048,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -359.0070495605469,
"rps_doc_books_importance_length_correction": -359.0070495605469,
"rps_doc_openwebtext_importance": -232.57913208007812,
"rps_doc_openwebtext_importance_length_correction": -232.57913208007812,
"rps_doc_wikipedia_importance": -233.2068328857422,
"rps_doc_wikipedia_importance_length_correction": -233.2068328857422
},
"fasttext": {
"dclm": 0.0337984599173069,
"english": 0.9024518728256226,
"fineweb_edu_approx": 1.6934924125671387,
"eai_general_math": 0.6185268759727478,
"eai_open_web_math": 0.17657238245010376,
"eai_web_code": 0.1779266595840454
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-1,583,576,079,794,082,800 | Sign up ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.
Consider a space $X$ and the group $Homeo(X)/\sim$ of homeomorphisms on $X$ modulo homotopies which are homeomorphisms in each step. One could also consider diffeomorphisms on $X$ or whatsoever.
Have these groups a special name or is there a name for a theory dealing with these kind of groups? Does anybody have a reference where such groups are computed? Thank you.
share|cite|improve this question
Following Todd Trimble''s answer below, perhaps you should look into Teichmuller Theory. This certainly covers the mapping class group of some special $X$ and has a very nice (and very popular) theory developed presently. – David White Jul 13 '11 at 21:56
2 Answers 2
Perhaps the mapping class group of $X$? There is an extensive theory for mapping class groups and their computations. The mapping class group of the (2-dimensional) torus is $SL_2(\mathbb{Z})$.
share|cite|improve this answer
1
But beware that sometimes MCG is used to mean homotopy equivalences up to homotopy rather than homeomorphisms up to isotopy (or diffeomorphisms up to smooth isotopy). In many important cases (such as most surfaces) the homotopical notion coincides with the other, but in general not. – Tom Goodwillie Jul 13 '11 at 18:03
1. How about $\pi_0(\text{Homeo}(X))$?
2. The papers of Weiss and Williams (automorphisms of manifolds and algebraic $K$-theory...) are relevant since they reduce computations of $\pi_i(\text{aut}(X))$ for $X$ a compact manifold ($\text{aut} = \text{Homeo}, \text{Diff}$) to homotopy theory plus algebraic K-theory in a certain range (the "concordance stable range"). These papers build on results of Hsiang and Anderson.
share|cite|improve this answer
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "http://mathoverflow.net/questions/70233/has-this-kind-of-question-in-topology-a-special-name",
"source_domain": "mathoverflow.net",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "61125",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SFUJIBG6TCTIJQST7MDCP7AENP4CIFRE",
"WARC-Concurrent-To": "<urn:uuid:f8bc8860-9825-438d-b8cc-25546bab104d>",
"WARC-Date": "2015-11-28T17:06:48Z",
"WARC-IP-Address": "104.16.49.236",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LTSD2L7AL6GY5AARJXYBV4Z5OEYY2JFN",
"WARC-Record-ID": "<urn:uuid:67ca425b-e0f9-4ceb-a371-029a18af9aa2>",
"WARC-Target-URI": "http://mathoverflow.net/questions/70233/has-this-kind-of-question-in-topology-a-special-name",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e0c8ed69-6aa2-42d6-b0a7-2153415341fc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-71-132-137.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for Nov 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
10,
128,
129,
324,
325,
498,
499,
532,
537,
793,
794,
806,
807,
1001,
1002,
1033,
1037,
1358,
1399,
1400,
1785,
1786,
1817,
1818,
1830,
1831,
1833,
1841,
1842,
1920,
1921
],
"line_end_idx": [
10,
128,
129,
324,
325,
498,
499,
532,
537,
793,
794,
806,
807,
1001,
1002,
1033,
1037,
1358,
1399,
1400,
1785,
1786,
1817,
1818,
1830,
1831,
1833,
1841,
1842,
1920,
1921,
2011
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2011,
"ccnet_original_nlines": 31,
"rps_doc_curly_bracket": 0.005967179778963327,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3183962404727936,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.033018868416547775,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25943395495414734,
"rps_doc_frac_unique_words": 0.5672131180763245,
"rps_doc_mean_word_length": 5.098360538482666,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0.002358489902690053,
"rps_doc_unigram_entropy": 4.867217063903809,
"rps_doc_word_count": 305,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04244372993707657,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0308681707829237,
"rps_doc_frac_chars_top_3gram": 0.028938909992575645,
"rps_doc_frac_chars_top_4gram": 0.03858520835638046,
"rps_doc_books_importance": -194.77149963378906,
"rps_doc_books_importance_length_correction": -194.77149963378906,
"rps_doc_openwebtext_importance": -111.41606140136719,
"rps_doc_openwebtext_importance_length_correction": -111.41606140136719,
"rps_doc_wikipedia_importance": -80.05502319335938,
"rps_doc_wikipedia_importance_length_correction": -80.05502319335938
},
"fasttext": {
"dclm": 0.13393878936767578,
"english": 0.9205076694488525,
"fineweb_edu_approx": 1.8368253707885742,
"eai_general_math": 0.024387719109654427,
"eai_open_web_math": 0.4030218720436096,
"eai_web_code": 0.0000021500000002561137
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "514.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Trigonometry and Topology"
}
},
"secondary": {
"code": "512.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
1,587,670,415,036,714,200 | A Guide to Enabling Inter-Domain Data Sharing
For many, the appeal of a decentralized data architecture relates to its potential for enhanced collaboration. But to achieve this kind of streamlined collaboration, your team must first establish a system of secure, self-service domains.
In a previous blog, we explored how to make decentralized data mesh architectures a reality based on phData’s experience with our customers. In this blog, we delve into the intricacies of implementing decentralized domain-based architectures and enabling seamless data sharing for data-driven collaboration. We will explore the common challenges organizations face in this endeavor, and how phData’s proven process for domain implementation addresses these hurdles. Additionally, we will examine the implications and best practices for inter-domain data sharing, striking the right balance between domain autonomy and global data access governance.
By combining theoretical principles with practical insights, this blog aims to equip organizations with the knowledge and tools to engage in decentralized data mesh sharing and collaboration successfully.
What is phData’s Approach to Domain Implementation?
phData’s approach to implementing decentralized domain-based architectures follows a structured and phased process, designed to ensure both a seamless initial integration and long-term success. This process includes:
• Conducting a comprehensive assessment of an organization’s data landscape, identifying potential domains based on business functions, data usage patterns, and cross-functional dependencies.
• Engaging with stakeholders across different business units to gather domain-specific requirements and establish a shared understanding of domain boundaries.
• Defining clear domain ownership and governance models, aligning with the organization’s overall data strategy.
Following these initial steps, our team is able to work with an organization to develop and implement the various project, use case, or team-specific domains their business requires. The timeline for this process should follow the model below:
[Read More] How to Make Data Mesh a Reality: An Implementation Roadmap
https://www.immuta.com/wp-content/uploads/2024/04/image6.png
Tools for Enabling Inter-Domain Data Sharing
Once domains have been developed, organizations can explore streamlined opportunities for more collaborative data use. For the decentralized implementation example that we’ll examine in this article, each domain team/business unit will independently manage their data’s transformation, curation, and security. However, this decentralized independence must be balanced with seamless and efficient access to data across these business units, along with effective data governance.
In this example, we are using the Snowflake Data Cloud to support the organization’s domains. Compared to other popular approaches, we’ve organized a separate Snowflake account per each domain in this instance. Snowflake’s data sharing capabilities helped us achieve this, ensuring business continuity.
Leveraging Snowflake’s self-service searchability across enterprise data catalogs and subscription data in the Snowflake data warehouse, we are able to implement an access management process that enables just-in-time access upon successful completion of workflows via the organization’s existing ITSM tools and phData’s provision tool’s resource management.
NOTE: phData’s provision tool allows you to manage Snowflake resource lifecycles — creating, updating, and destroying — with a templated approach to provide a well-structured information architecture.
Additionally, we use a centralized account to store the catalog information, contract details, approval workflow policies, and access management details for the organization’s decentralized data mesh architecture.
The Main Challenges to Inter-Domain Data Sharing
When attempting to achieve secure domain-based collaboration, teams should be aware of the following challenges:
Scalable Data Sharing:
Heterogeneous data access policies and agreements across business domains can complicate the implementation of data sharing. Maintaining these data access policies and masking rules as new data shares are created can easily become complex and error-prone. Leveraging tools like the Immuta Data Security Platform can help simplify and scale the management of data sharing policies.
Data Discoverability and Documentation:
As your decentralized data expands, there’s a risk of creating data silos and limiting visibility if metadata and documentation are not properly managed. Robust metadata management and advanced search capabilities are crucial for helping users discover relevant data products. Comprehensive documentation on data products’ purpose, schema, lineage, ownership, and other details is essential.
Governance and Operational Efficiency:
A growing data mesh requires ongoing housekeeping to manage technical debt, such as deprecated assets and inefficient processes. This requires robust governance frameworks and tooling that can identify and address these issues proactively. Cost management and budget control are also important considerations as the data mesh scales, as you need to ensure that operational costs are supported by business-driving results.
Data Privacy and Compliance:
Adhering to data privacy compliance requirements is a key challenge, requiring a robust data privacy framework and governance controls that incorporate the standards of compliance laws and regulations, contracts, industry standards, and more. Techniques like data masking, data access controls, and auditing must be consistently implemented across the data mesh to enforce and maintain compliance.
Three Key Requirements for Inter-Domain Data Sharing
An organization can enable secure and efficient inter-domain data sharing by incorporating the following key centralized modules:
1. A Data Contract Framework
2. A Centralized Data Catalog
3. Self-Service Platform Enablement
https://www.immuta.com/wp-content/uploads/2024/04/image5.png
1. Data Contract Framework
The data contracts framework acts as a central governance mechanism, ensuring that data products across domains conform to agreed-upon schemas, semantics, interoperability with other data products, and quality levels. It enables efficient collaboration and data-driven decision-making by providing a consistent and reliable foundation for data sharing within the decentralized data architecture.
By implementing a robust data contracts framework, organizations ensure that inter-domain data sharing adheres to well-defined standards and expectations. This framework not only promotes trust and transparency among data consumers but also facilitates domain autonomy by enabling domain teams to evolve their data products independently – while maintaining compatibility, security, and quality guarantees.
https://www.immuta.com/wp-content/uploads/2024/04/image4-1.png
For this implementation example, we have used a centralized Snowflake account that is well suited to serve as a registry for the data contract framework that hosts and stores the data product schema, definitions, versioning, service level agreements, privacy policies, and workflows for the access management process. In addition, a contract registry serves both as the store for state management and monitor access patterns.
https://www.immuta.com/wp-content/uploads/2024/04/image7-1.png
[Read More] What is dbt Mesh and How to Adopt It?
2. A Centralized Data Catalog
In this implementation example, we’ve created a data catalog repository within the centralized Snowflake account in its simplest form. With this in place, we can automate the metadata sharing process in a secure manner. This automation also includes a mechanism to update the catalog as new data sets become available, keeping metadata fresh throughout the decentralized ecosystem. These kinds of implementations may involve third party tools that support data catalog features at enterprise level, such as Alation and Collibra.
[Read More] How to choose the right data catalog for your business
https://www.immuta.com/wp-content/uploads/2024/04/image2-1.png
3. Self-Service Platform Enablement
To ensure domains are adopted by data owners and leveraged for enhanced sharing purposes, you need to make sure that your team is enabled with contextual information and best practices. Without effective change management, your domain-based ecosystem is likely doomed from the start.
Domain owners must be brought up to speed on their new responsibilities, preparing them to manage new data products, prioritize various initiatives, and control data access. They need to know how to generate and manage data use standards and access controls in order to keep their data secure while allowing access for a larger number of decentralized data users.
The Inter-Domain Data Product Access Flow
With the aforementioned platforms, frameworks, and tools in place, how might shared access look in this new decentralized ecosystem?
The process flow starts with registering domain-specific metadata to the central Snowflake account. Consumers can search for available data products through the data marketplace, as well as request access to the data by searching the available data product catalog. The approval process will then be triggered through the central account.
The steps of the process flow are as follows:
1. All the data products and metadata are registered in a centralized account.
2. Users can browse the data catalog to find the data products available across the organization.
3. Users can request access and a workflow gets triggered that sends the request to the data product owner. Upon the data product owner’s approval, access is granted.
4. Consumers can then access the shared data product via a data share.
https://www.immuta.com/wp-content/uploads/2024/04/image3-1.png
Conclusion
In this article, we provided a high-level overview of how a modern organization can implement a decentralized architecture that supports inter-domain data sharing and collaboration. By working with tools and providers that support distributed domains while maintaining cohesive data governance, compliance, and accessibility – such as Snowflake, phData, and Immuta – you can create a scalable data mesh that meets your organization’s collaborative, self-service data needs.
To jumpstart your Snowflake data sharing knowledge, check out phData’s quick start guide and this Immuta Snowflake data sharing guide. To explore how you can get started with secure, collaborative domains, request a demo from Immuta.
Start Collaborating with Data
Get in touch to learn more about secure domains today.
Request a Demo
Blog
Related stories | {
"url": "https://www.immuta.com/blog/a-guide-to-enabling-inter-domain-data-sharing/",
"source_domain": "www.immuta.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "140419",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6YCY7J3QYW7677G5GVNGIMWLUCWYYZLZ",
"WARC-Concurrent-To": "<urn:uuid:8523c7a2-5e84-4576-9580-a843c44f3cdb>",
"WARC-Date": "2024-05-24T04:57:36Z",
"WARC-IP-Address": "141.193.213.20",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UDPROXIMVR3U3DOLKK2M2TKS7QYC275X",
"WARC-Record-ID": "<urn:uuid:f40caaf8-b06f-46e5-bcac-00ee0b115141>",
"WARC-Target-URI": "https://www.immuta.com/blog/a-guide-to-enabling-inter-domain-data-sharing/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c76d3b37-af6e-46c5-ac0f-ab774e5f7e83>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-33\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
46,
47,
286,
287,
936,
937,
1142,
1143,
1195,
1196,
1413,
1414,
1608,
1769,
1884,
1885,
2129,
2130,
2201,
2202,
2263,
2264,
2309,
2310,
2788,
2789,
3094,
3095,
3453,
3454,
3655,
3656,
3870,
3871,
3920,
3921,
4034,
4035,
4058,
4059,
4440,
4441,
4481,
4482,
4874,
4875,
4914,
4915,
5337,
5338,
5367,
5368,
5766,
5767,
5820,
5821,
5951,
5952,
5983,
6015,
6053,
6114,
6115,
6142,
6143,
6539,
6540,
6947,
6948,
7011,
7012,
7440,
7441,
7504,
7505,
7556,
7557,
7587,
7588,
8118,
8119,
8186,
8187,
8250,
8251,
8287,
8288,
8572,
8573,
8937,
8938,
8980,
8981,
9114,
9115,
9454,
9455,
9501,
9502,
9584,
9684,
9853,
9926,
9989,
9990,
10001,
10002,
10478,
10479,
10714,
10715,
10745,
10746,
10801,
10802,
10817,
10822,
10823
],
"line_end_idx": [
46,
47,
286,
287,
936,
937,
1142,
1143,
1195,
1196,
1413,
1414,
1608,
1769,
1884,
1885,
2129,
2130,
2201,
2202,
2263,
2264,
2309,
2310,
2788,
2789,
3094,
3095,
3453,
3454,
3655,
3656,
3870,
3871,
3920,
3921,
4034,
4035,
4058,
4059,
4440,
4441,
4481,
4482,
4874,
4875,
4914,
4915,
5337,
5338,
5367,
5368,
5766,
5767,
5820,
5821,
5951,
5952,
5983,
6015,
6053,
6114,
6115,
6142,
6143,
6539,
6540,
6947,
6948,
7011,
7012,
7440,
7441,
7504,
7505,
7556,
7557,
7587,
7588,
8118,
8119,
8186,
8187,
8250,
8251,
8287,
8288,
8572,
8573,
8937,
8938,
8980,
8981,
9114,
9115,
9454,
9455,
9501,
9502,
9584,
9684,
9853,
9926,
9989,
9990,
10001,
10002,
10478,
10479,
10714,
10715,
10745,
10746,
10801,
10802,
10817,
10822,
10823,
10838
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 10838,
"ccnet_original_nlines": 118,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.29182058572769165,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0036939301062375307,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17361478507518768,
"rps_doc_frac_unique_words": 0.3569979667663574,
"rps_doc_mean_word_length": 6.0797834396362305,
"rps_doc_num_sentences": 91,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.463698863983154,
"rps_doc_word_count": 1479,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0053380802273750305,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.019572950899600983,
"rps_doc_frac_chars_top_3gram": 0.019572950899600983,
"rps_doc_frac_chars_top_4gram": 0.006672599818557501,
"rps_doc_books_importance": -925.664306640625,
"rps_doc_books_importance_length_correction": -925.664306640625,
"rps_doc_openwebtext_importance": -525.0125732421875,
"rps_doc_openwebtext_importance_length_correction": -525.0125732421875,
"rps_doc_wikipedia_importance": -430.9549865722656,
"rps_doc_wikipedia_importance_length_correction": -430.9549865722656
},
"fasttext": {
"dclm": 0.03722798824310303,
"english": 0.881535530090332,
"fineweb_edu_approx": 1.7314375638961792,
"eai_general_math": 0.07632941007614136,
"eai_open_web_math": 0.031186040490865707,
"eai_web_code": 0.4347882866859436
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
2,050,773,783,281,752,800 | Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
I have highchart like this.
How can I display the legend (Firebox,IE,chrome...) text in next row if the text is too long?
Image describing my problem is Here
P.S. I am not familiar with jQuery. Expecting a solution
share|improve this question
[whathaveyoutried.com/](What have you tried)? This is not a give-me-the-code site. Show what you have tried yourself and where you got stuck. – dgw Nov 21 '12 at 8:54
In legend i tried like this, width, itemWidth,labelFormatter.. but no use i cant find the solution – RaJeSh Nov 21 '12 at 9:00
how can i fix this issue – RaJeSh Nov 21 '12 at 9:03
add comment
1 Answer
up vote 4 down vote accepted
You will need to make use of a labelFormatter
labelFormatter: function()
{
var legendName = this.name;
var match = legendName.match(/.{1,10}/g);
return match.toString().replace(/\,/g,"<br/>");
}
I have made an edit to the fiddle and you can find it Here. It pushes the legend item text to next line after every 10 characters. Guess this is what you needed.
Hope this helps.
share|improve this answer
actually its not exactly i need. if the end, the next string will be placed on next line. for ex here in your text after is the last string in 1st row after that every comes to 2nd exactly i need this. – RaJeSh Nov 21 '12 at 12:35
got my question?? – RaJeSh Nov 21 '12 at 12:48
Can you please elaborate, may be with the aid of an example ? – Gopinagh.R Nov 21 '12 at 12:54
result : product,price, place, and promation... here product displys 1st row and then price, place,and promation displays 2nd row. but here there is more sapce available in 1st row. this is my problem. – RaJeSh Nov 21 '12 at 13:02
Do you have an image or a link of an example of how exactly your chart's legend should look like ? – Gopinagh.R Nov 21 '12 at 13:18
show 5 more comments
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "http://stackoverflow.com/questions/13487486/in-a-highchart-how-to-display-the-legend-text-in-next-row-if-the-text-is-too-lo/13491932",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "72604",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5FFCZXDQRXEBVFZTFWFBJAJCLQVVAURQ",
"WARC-Concurrent-To": "<urn:uuid:94aca1a6-60ec-40a3-9a94-c0167e875d6d>",
"WARC-Date": "2014-07-14T04:02:08Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:F24ISX7DCT4G3ZOYD55JSUGXL5GVCTTC",
"WARC-Record-ID": "<urn:uuid:bdb6e819-d044-4f4d-8156-d489f434c0ec>",
"WARC-Target-URI": "http://stackoverflow.com/questions/13487486/in-a-highchart-how-to-display-the-legend-text-in-next-row-if-the-text-is-too-lo/13491932",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0d5428d9-d456-43be-a02a-7799e39af6d2>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-212-248.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-23\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for July 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
25,
157,
158,
186,
280,
316,
317,
374,
375,
403,
408,
576,
581,
709,
714,
768,
780,
781,
790,
791,
820,
821,
867,
868,
912,
930,
980,
1044,
1114,
1133,
1134,
1296,
1313,
1314,
1340,
1345,
1577,
1582,
1630,
1635,
1731,
1736,
1968,
1973,
2106,
2127,
2128,
2140,
2141,
2143,
2151,
2152,
2230,
2231
],
"line_end_idx": [
25,
157,
158,
186,
280,
316,
317,
374,
375,
403,
408,
576,
581,
709,
714,
768,
780,
781,
790,
791,
820,
821,
867,
868,
912,
930,
980,
1044,
1114,
1133,
1134,
1296,
1313,
1314,
1340,
1345,
1577,
1582,
1630,
1635,
1731,
1736,
1968,
1973,
2106,
2127,
2128,
2140,
2141,
2143,
2151,
2152,
2230,
2231,
2321
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2321,
"ccnet_original_nlines": 54,
"rps_doc_curly_bracket": 0.0017233999678865075,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3747534453868866,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017751479521393776,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2820512652397156,
"rps_doc_frac_unique_words": 0.485411137342453,
"rps_doc_mean_word_length": 4.342175006866455,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0.0039447699673473835,
"rps_doc_unigram_entropy": 4.8736982345581055,
"rps_doc_word_count": 377,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07208307832479477,
"rps_doc_frac_chars_dupe_6grams": 0.07208307832479477,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02443494088947773,
"rps_doc_frac_chars_top_3gram": 0.03420891985297203,
"rps_doc_frac_chars_top_4gram": 0.04398290067911148,
"rps_doc_books_importance": -245.2882537841797,
"rps_doc_books_importance_length_correction": -245.2882537841797,
"rps_doc_openwebtext_importance": -160.3146209716797,
"rps_doc_openwebtext_importance_length_correction": -160.3146209716797,
"rps_doc_wikipedia_importance": -139.17660522460938,
"rps_doc_wikipedia_importance_length_correction": -139.17660522460938
},
"fasttext": {
"dclm": 0.03044050931930542,
"english": 0.8629929423332214,
"fineweb_edu_approx": 1.2045185565948486,
"eai_general_math": 0.00017278999439440668,
"eai_open_web_math": 0.2576393485069275,
"eai_web_code": -0.00000965999970503617
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-1,748,106,856,881,922,300 | Добавил:
Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз: Предмет: Файл:
ELIK / ELIK / ALL.DOC
Скачиваний:
10
Добавлен:
16.04.2013
Размер:
4.19 Mб
Скачать
Технический проект
В данном разделе рассматриваются наиболее сложные алгоритмы, используемые в программе, а именно - алгоритмы трансляции данных в формат решателя UnioCalc.
Конфигурация технических средств
Требования к составу и параметрам технических средств соответствуют требованиям к программному продукту - системе моделирования макроэкономики.
Минимально необходимое оборудование:
PC 80486 SX2-66;
RAM 12 MB;
HDD 50 MB свободных;
Screen Color VGA.
Рекомендуемое оборудование:
PC Pentium 133 МГц;
RAM 32 MB;
HDD 30 MB свободных;
Screen Color SVGA;
Необходимое программное обеспечение:
ОС Windows’95;
Машина баз данных Borland DataBase Engine 3.0;
Приложение Система моделирования макроэкономики.
Алгоритмы предварительной подготовки данных для расчета экономической модели Общий алгоритм работы программы
Алгоритм работы транслятора данных из базы данных в формат вычислительного ядра UniCalc
Алгоритм работы транслятора формул из формата макета в формат вычислительного ядра
Данный транслятор построен на основе грамматики вида:
S ® t { K | e
K ® A } S
A ® B,A | B
B ® C | D | E
C ® t
D ® t + p | t - p
E ® t > p | t >= p | t < p | t<= p | t = p
t ® A | ... | Z | a | ... | z | 1 | ... | 9 | 0 | + | - | * | /
p ® 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 0
где t - терминальные символы - латинский алфавит и цифры, p - цифры, e - пустой символ. Символ ‘|’ означает ‘или’.
Данная грамматика реализована методом рекурсивного спуска, т.е. здесь каждый нетерминальный символ грамматики реализован в виде отдельного алгоритма разбора формулы, оформленного в виде подпрограммы. Таким образом каждая подпрограмма S, K, A, B, C, D, E отвечает за свою конструкцию языка.
Алгоритм работы блокаS
Алгоритм работы блока K
Алгоритм работы блока A
Алгоритм блока B
Алгоритм работы блока C
Алгоритм блока D
Алгоритм блока E
Рабочий проект
В рабочем проекте рассмотрена структура программы, показана реализация реализация алгоритмов, описанных в техническом проекте
Структура программы
Структура программы представлена на риc.5.
Рис.5. Структура программы.
Данная схема описывает лишь укрупненную структуру программы, здесь не показаны разбивка на модули и уточненные форматы данных. Для детализации необходимо рассмотреть работу каждой части программы. Реализация каждой из частей будет описана в дальнейшем. Основной структурой, хранящей все текущие значения, является класс основного окна fmMain (модуль psMain.pas):
TfmMain = class(TForm)
mmMain: TMainMenu;
N1: TMenuItem; // Элемент меню «Файл»
N2: TMenuItem; // Элемент меню «Новая модель»
N3: TMenuItem; // Элемент меню «Открыть»
N4: TMenuItem; // Элемент меню «Сохранить»
N5: TMenuItem; // Элемент меню «Просмотр»
N7: TMenuItem; // Элемент меню «Формулы
N8: TMenuItem; // Элемент меню - разделитель
N9: TMenuItem; // Элемент меню «Выход
N10: TMenuItem; // Элемент меню «Структура»
N11: TMenuItem; // Элемент меню «Индексы»
qMain: TQuery; // для реализации SQL-запросов к БД
qSec: TQuery; // для реализации вспомогательных SQL-запросов к БД
N12: TMenuItem; // Элемент меню «Счет»
N13: TMenuItem; // Элемент меню «Закрыть»
procedure N9Click(Sender: TObject); // Завершение работы программы
procedure FormClose(Sender: TObject; var Action: TCloseAction); // действия при // завершении работы программы
procedure N10Click(Sender: TObject); // действие на выбор пункта меню «Структура»
procedure FormCreate(Sender: TObject);// Действия при инициализации основного окна программы
procedure N2Click(Sender: TObject); // Создание новой модели
procedure N3Click(Sender: TObject); // Открытие существующей модели
procedure N12Click(Sender: TObject); // Запуск модели на счет
procedure N11Click(Sender: TObject); // вызов формы редактирования индексов
procedure N13Click(Sender: TObject); // предварительные действия до закрытия программы
procedure N7Click(Sender: TObject); // Вызов редактора формул
private
procedure Variables2Formulas(var L : TStringList);// Преобразование данных из БД в формат вычислителя
public
FModel : String; // Название файла модели
TypeCount : integer; // Количество таблиц значений параметров
Model : String; // Алиас модели, используется для регистрации в BDE
DbPath : String; // Путь к базе данных 'верхней' (основной) модели
NewModel : Boolean; // True, если модель создается с нуля
Result : Boolean; // успешно ли прошли расчеты
Version : integer // номер текущей версии
end;
Тут вы можете оставить комментарий к выбранному абзацу или сообщить об ошибке.
Оставленные комментарии видны всем.
Соседние файлы в папке ELIK | {
"url": "https://studfile.net/preview/273138/page:6/",
"source_domain": "studfile.net",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "59341",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DAGSME7ZMVHNGPY2K52MOMQWCC5UVRJQ",
"WARC-Concurrent-To": "<urn:uuid:9632be64-f0ce-4825-8bf6-5134d6980298>",
"WARC-Date": "2021-04-11T02:34:51Z",
"WARC-IP-Address": "185.26.99.9",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:VDTRKTW47DBO5H5UHJHMU4D4XGEN7GVH",
"WARC-Record-ID": "<urn:uuid:06e530b4-9feb-45a9-8e8c-aab5e974797d>",
"WARC-Target-URI": "https://studfile.net/preview/273138/page:6/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:95da9132-aa69-4956-9a1e-1a40147b8f00>"
},
"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 ([email protected])\r\nhostname: ip-10-67-67-215.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
9,
78,
98,
120,
132,
135,
145,
156,
164,
172,
180,
181,
200,
201,
355,
356,
389,
390,
534,
535,
572,
573,
590,
591,
602,
603,
624,
625,
643,
644,
672,
673,
693,
694,
705,
706,
727,
728,
747,
748,
785,
786,
801,
802,
849,
850,
899,
900,
1009,
1010,
1098,
1099,
1182,
1183,
1237,
1238,
1252,
1253,
1263,
1264,
1276,
1277,
1291,
1292,
1298,
1299,
1317,
1318,
1361,
1362,
1426,
1427,
1469,
1470,
1585,
1586,
1876,
1877,
1900,
1901,
1925,
1926,
1950,
1951,
1968,
1969,
1993,
1994,
2011,
2012,
2029,
2030,
2045,
2046,
2172,
2173,
2193,
2194,
2237,
2238,
2266,
2267,
2630,
2631,
2654,
2655,
2674,
2675,
2713,
2714,
2760,
2761,
2802,
2803,
2846,
2847,
2889,
2890,
2930,
2931,
2976,
2977,
3015,
3016,
3060,
3061,
3103,
3104,
3155,
3156,
3222,
3223,
3262,
3263,
3305,
3306,
3373,
3374,
3485,
3486,
3568,
3569,
3662,
3663,
3724,
3725,
3793,
3794,
3856,
3857,
3933,
3934,
4021,
4022,
4084,
4085,
4093,
4094,
4196,
4197,
4204,
4205,
4247,
4248,
4310,
4311,
4379,
4380,
4447,
4448,
4506,
4507,
4554,
4555,
4597,
4598,
4603,
4604,
4683,
4684,
4720,
4721
],
"line_end_idx": [
9,
78,
98,
120,
132,
135,
145,
156,
164,
172,
180,
181,
200,
201,
355,
356,
389,
390,
534,
535,
572,
573,
590,
591,
602,
603,
624,
625,
643,
644,
672,
673,
693,
694,
705,
706,
727,
728,
747,
748,
785,
786,
801,
802,
849,
850,
899,
900,
1009,
1010,
1098,
1099,
1182,
1183,
1237,
1238,
1252,
1253,
1263,
1264,
1276,
1277,
1291,
1292,
1298,
1299,
1317,
1318,
1361,
1362,
1426,
1427,
1469,
1470,
1585,
1586,
1876,
1877,
1900,
1901,
1925,
1926,
1950,
1951,
1968,
1969,
1993,
1994,
2011,
2012,
2029,
2030,
2045,
2046,
2172,
2173,
2193,
2194,
2237,
2238,
2266,
2267,
2630,
2631,
2654,
2655,
2674,
2675,
2713,
2714,
2760,
2761,
2802,
2803,
2846,
2847,
2889,
2890,
2930,
2931,
2976,
2977,
3015,
3016,
3060,
3061,
3103,
3104,
3155,
3156,
3222,
3223,
3262,
3263,
3305,
3306,
3373,
3374,
3485,
3486,
3568,
3569,
3662,
3663,
3724,
3725,
3793,
3794,
3856,
3857,
3933,
3934,
4021,
4022,
4084,
4085,
4093,
4094,
4196,
4197,
4204,
4205,
4247,
4248,
4310,
4311,
4379,
4380,
4447,
4448,
4506,
4507,
4554,
4555,
4597,
4598,
4603,
4604,
4683,
4684,
4720,
4721,
4748
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4748,
"ccnet_original_nlines": 182,
"rps_doc_curly_bracket": 0.0004212300118524581,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.02672605961561203,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07906459271907806,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7861915230751038,
"rps_doc_frac_unique_words": 0.5996677875518799,
"rps_doc_mean_word_length": 6.142857074737549,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0.003340760013088584,
"rps_doc_unigram_entropy": 5.520418643951416,
"rps_doc_word_count": 602,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.004597079940140247,
"rps_doc_frac_chars_dupe_6grams": 0.00297458004206419,
"rps_doc_frac_chars_dupe_7grams": 0.00297458004206419,
"rps_doc_frac_chars_dupe_8grams": 0.00297458004206419,
"rps_doc_frac_chars_dupe_9grams": 0.00297458004206419,
"rps_doc_frac_chars_top_2gram": 0.05191995948553085,
"rps_doc_frac_chars_top_3gram": 0.06489995121955872,
"rps_doc_frac_chars_top_4gram": 0.005408329889178276,
"rps_doc_books_importance": -450.359375,
"rps_doc_books_importance_length_correction": -450.359375,
"rps_doc_openwebtext_importance": -252.89312744140625,
"rps_doc_openwebtext_importance_length_correction": -252.89312744140625,
"rps_doc_wikipedia_importance": -170.32272338867188,
"rps_doc_wikipedia_importance_length_correction": -170.32272338867188
},
"fasttext": {
"dclm": 0.0662451982498169,
"english": 0.00011999999696854502,
"fineweb_edu_approx": 1.3386379480361938,
"eai_general_math": 0.0019539000932127237,
"eai_open_web_math": 0.0815693736076355,
"eai_web_code": 0.774139940738678
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "330",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "2",
"label": "Academic/Research"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
1,408,193,374,970,503,000 | Big Data & Analytics
Big data & Analytics is the use of advanced computing technologies on huge data sets to discover valuable correlations, patterns, trends, and preferences for companies to make better decisions. In Industry 4.0, big data analytics plays a role in a few areas including in smart factories, where sensor data from production machinery is analyzed to predict when maintenance and repair operations will be needed. Through application of it, manufacturers experience production efficiency, understand their real-time data with self-service systems, predictive maintenance optimization, and production management automation.
How do businesses use big data analytics?
Businesses use big data analytics to improve business decisions by understand patterns and picking up on trends from huge amounts of customer data.
How is big data analytics used in Industry 4.0?
Manufacturers use big data analytics in the same way as most other commercial entities except with a narrower focus. They collect huge amounts of data from smart sensors through cloud computing and IIoT platforms that allow them to uncover patterns that help them improve the efficiency of supply chain management.
Big data analytics can help them discover hidden variables causing bottlenecks in production that they didn’t even know existed. After identifying the source of the problem, manufacturers use targeted data analytics to better understand the underlying cause of bottleneck variables. This helps manufacturers improve output while reducing cost and eliminating waste.
Production efficiency and assets are everything the manufacturing industry. The manufacturers’ ability to maintain their means of production and keep schedules tight and on track can mean the difference between a good reputation and a bad one. Big data analytics reduces breakdowns and unscheduled downtime by about 25 percent.
Big data analytics is crucial to real-time performance, supply chain optimization, price optimization, fault prediction, product development, and smart factory design.
Big Data Analytics through Self-Service Systems
Adopting self-service analytics in engineering can help consolidate large bulks of big data from production plants. For example, global chip-maker Intel has smart factory equipment that sends real-time data into a big data analytics system. The self-service system then breaks down the real-time data and finds patterns, detects faults, and creates visualization for key decision makers.
Big Data Analytics and Predictive Maintenance
Engineers use big data analytics output generated from the system to make decisions. With this information, they prioritize changes and actions to be taken to avoid unscheduled downtime or equipment malfunction.
Big data analytics is synonymous with predictive maintenance and in Intel’s case, reduces reaction time drastically. Without big data analytics, reaction time is about 4 hours. With it, that number is cut down to 30 seconds. The savings were huge, estimated figures were $100 million in savings.
Automate Production Management with Big Data Analytics
Another way big data analytics is used by manufacturers is to automate production management. This implies reducing the amount of human input and action needed in a manufacturing facility. It works by analyzing historical data of a production process, coupling it with real-time information of that particular production process, and automating physical changes to equipment using actuators and advanced robotics that are connected to control software. The control software takes inferences made from big data analytics and sends out targeted commands to these actuators and robots that will physically alter settings on equipment and machinery without any human intervention whatsoever.
Looking for a First-Class Business Plan Consultant?
This website uses cookies and asks your personal data to enhance your browsing experience. | {
"url": "https://thesecondarysector.com/portfolio/big-data-analytics/",
"source_domain": "thesecondarysector.com",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "168366",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TIA7QFW3YTAUKKXBL4TWU22V3T5GWRJB",
"WARC-Concurrent-To": "<urn:uuid:df1422a6-bd06-4f01-9ff2-9e57681d905c>",
"WARC-Date": "2021-04-21T21:27:51Z",
"WARC-IP-Address": "172.67.175.184",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KAMJUCW45FJBHKE43HPQMD7JZ6JFBRNF",
"WARC-Record-ID": "<urn:uuid:9f39a694-15b3-4359-b7b2-111b3d656cdb>",
"WARC-Target-URI": "https://thesecondarysector.com/portfolio/big-data-analytics/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:541745e1-5a26-468a-9616-109afdf6f9a9>"
},
"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 ([email protected])\r\nhostname: ip-10-67-67-55.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
21,
22,
641,
642,
684,
685,
833,
834,
882,
883,
1198,
1199,
1565,
1566,
1894,
1895,
2063,
2064,
2112,
2113,
2501,
2502,
2548,
2549,
2761,
2762,
3058,
3059,
3114,
3115,
3803,
3804,
3856,
3857
],
"line_end_idx": [
21,
22,
641,
642,
684,
685,
833,
834,
882,
883,
1198,
1199,
1565,
1566,
1894,
1895,
2063,
2064,
2112,
2113,
2501,
2502,
2548,
2549,
2761,
2762,
3058,
3059,
3114,
3115,
3803,
3804,
3856,
3857,
3947
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3947,
"ccnet_original_nlines": 34,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31164902448654175,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12405446171760559,
"rps_doc_frac_unique_words": 0.4597901999950409,
"rps_doc_mean_word_length": 5.744755268096924,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.029410362243652,
"rps_doc_word_count": 572,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01765063963830471,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04260499030351639,
"rps_doc_frac_chars_top_3gram": 0.09251368790864944,
"rps_doc_frac_chars_top_4gram": 0.0219111405313015,
"rps_doc_books_importance": -294.7656555175781,
"rps_doc_books_importance_length_correction": -294.7656555175781,
"rps_doc_openwebtext_importance": -178.9165496826172,
"rps_doc_openwebtext_importance_length_correction": -178.9165496826172,
"rps_doc_wikipedia_importance": -159.71994018554688,
"rps_doc_wikipedia_importance_length_correction": -159.71994018554688
},
"fasttext": {
"dclm": 0.1492598056793213,
"english": 0.8911857008934021,
"fineweb_edu_approx": 2.6032984256744385,
"eai_general_math": 0.034765779972076416,
"eai_open_web_math": 0.2076461911201477,
"eai_web_code": 0.05915302038192749
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.75",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.4038",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-2,844,052,934,747,458,000 | Wikia
The IT Law Wiki
Computer system
30,445pages on
this wiki
Talk0
Tower
Definition Edit
A computer system (also called a computing system)
encompasses everything from small handheld devices to Netbooks to corporate data centers to massive server farms that offer cloud computing to the masses.[1]
Overview Edit
Today, a typical computer system consists of hardware and software that process data and is likely to include:
Computer systems take many forms, such as laptops, desktops, tower computers, rack-mounted systems, minicomputers, and mainframe computers. Additional components and peripheral devices include modems, routers, printers, scanners, and docking stations.
References Edit
1. The Future of Computing Performance: Game Over or Next Level?, at 50 n.2.
See also Edit
Around Wikia's network
Random Wiki | {
"url": "http://itlaw.wikia.com/wiki/Computer_system",
"source_domain": "itlaw.wikia.com",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "60422",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MM4BVD3YE6BI5AY23ARZIP47MRRG22UZ",
"WARC-Concurrent-To": "<urn:uuid:c65a90fe-53dc-48cd-94e4-cadfe44984d1>",
"WARC-Date": "2015-09-05T05:42:40Z",
"WARC-IP-Address": "23.235.39.194",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ZRJGKHBZ2FLRZ6UL6UUOSQW4PMFVOXXK",
"WARC-Record-ID": "<urn:uuid:241e9135-ccd1-485f-b1c7-389b1837141b>",
"WARC-Target-URI": "http://itlaw.wikia.com/wiki/Computer_system",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2b5a3364-796b-43eb-83b2-3e2ef07c7946>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-96-226.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
6,
7,
23,
24,
40,
41,
56,
66,
72,
78,
79,
95,
96,
147,
148,
306,
307,
321,
322,
433,
434,
687,
688,
704,
705,
784,
785,
799,
800,
823,
824
],
"line_end_idx": [
6,
7,
23,
24,
40,
41,
56,
66,
72,
78,
79,
95,
96,
147,
148,
306,
307,
321,
322,
433,
434,
687,
688,
704,
705,
784,
785,
799,
800,
823,
824,
835
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 835,
"ccnet_original_nlines": 31,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21568627655506134,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013071900233626366,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20915032923221588,
"rps_doc_frac_unique_words": 0.7166666984558105,
"rps_doc_mean_word_length": 5.599999904632568,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.300909042358398,
"rps_doc_word_count": 120,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0625,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -63.28110885620117,
"rps_doc_books_importance_length_correction": -63.28110885620117,
"rps_doc_openwebtext_importance": -47.41167449951172,
"rps_doc_openwebtext_importance_length_correction": -46.59004592895508,
"rps_doc_wikipedia_importance": -24.478710174560547,
"rps_doc_wikipedia_importance_length_correction": -24.478710174560547
},
"fasttext": {
"dclm": 0.32660675048828125,
"english": 0.9089739322662354,
"fineweb_edu_approx": 3.2448999881744385,
"eai_general_math": 0.0336228609085083,
"eai_open_web_math": 0.5030724406242371,
"eai_web_code": 0.0014115599915385246
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-2,985,483,051,359,182,300 | 시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 512 MB150163751045.699%
문제
S는 다음과 같이 정의된다.
• S(0, n) = n (모든 양의 정수 n)
• S(k, n) = S(k-1, 1) + S(k-1, 2) + ... + S(k-1, n) (모든 양의 정수 k, n)
k와 n이 주어졌을 때, S(k, n)을 1,000,000,007로 나눈 나머지를 구하는 프로그램을 작성하시오.
입력
첫째 줄에 k와 n이 주어진다. (1 ≤ k ≤ 50, 1 ≤ n ≤ 1,000,000,000)
출력
첫째 줄에 S(k, n)을 1,000,000,007로 나눈 나머지를 출력한다.
예제 입력 1
1 3
예제 출력 1
6
예제 입력 2
2 3
예제 출력 2
10
예제 입력 3
4 10
예제 출력 3
2002
출처 | {
"url": "https://www.acmicpc.net/problem/13430",
"source_domain": "www.acmicpc.net",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "27989",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ABDK5WPCZOWVIVAF6YGCG4GIDYEHBUBI",
"WARC-Concurrent-To": "<urn:uuid:c9bb3912-8340-4306-af70-ccbe30b5aaf9>",
"WARC-Date": "2024-04-15T12:53:19Z",
"WARC-IP-Address": "54.64.167.118",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QR2MC7EXH5LVV725SXJVP7TN3ZMPJ6NR",
"WARC-Record-ID": "<urn:uuid:c7acf299-dc6b-45c9-84b0-4fd0f35abacb>",
"WARC-Target-URI": "https://www.acmicpc.net/problem/13430",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1346b1a5-e99c-44c4-8a3e-1870336c9253>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-192\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
26,
54,
55,
58,
59,
75,
76,
105,
175,
176,
239,
240,
243,
244,
298,
299,
302,
303,
347,
348,
356,
357,
361,
362,
370,
371,
373,
374,
382,
383,
387,
388,
396,
397,
400,
401,
409,
410,
415,
416,
424,
425,
430,
431
],
"line_end_idx": [
26,
54,
55,
58,
59,
75,
76,
105,
175,
176,
239,
240,
243,
244,
298,
299,
302,
303,
347,
348,
356,
357,
361,
362,
370,
371,
373,
374,
382,
383,
387,
388,
396,
397,
400,
401,
409,
410,
415,
416,
424,
425,
430,
431,
433
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 433,
"ccnet_original_nlines": 44,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09604520350694656,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.050847459584474564,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.8305084705352783,
"rps_doc_frac_unique_words": 0.5049505233764648,
"rps_doc_mean_word_length": 4.336633682250977,
"rps_doc_num_sentences": 7,
"rps_doc_symbol_to_word_ratio": 0.005649719852954149,
"rps_doc_unigram_entropy": 3.710663318634033,
"rps_doc_word_count": 101,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.14611871540546417,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.06849315017461777,
"rps_doc_frac_chars_top_3gram": 0.0502283088862896,
"rps_doc_frac_chars_top_4gram": 0.07305935770273209,
"rps_doc_books_importance": -90.38536834716797,
"rps_doc_books_importance_length_correction": -90.39448547363281,
"rps_doc_openwebtext_importance": -37.6979866027832,
"rps_doc_openwebtext_importance_length_correction": -37.70710372924805,
"rps_doc_wikipedia_importance": -32.960105895996094,
"rps_doc_wikipedia_importance_length_correction": -32.96922302246094
},
"fasttext": {
"dclm": 0.28626346588134766,
"english": 0.00022029000683687627,
"fineweb_edu_approx": 0.8055460453033447,
"eai_general_math": 0.4862186312675476,
"eai_open_web_math": 0.17412567138671875,
"eai_web_code": 0.014515760354697704
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
7,185,285,037,003,330,000 | How To Get A Hong Kong IP Address In Canada With A VPN
Do you want to watch your favorite TV shows while traveling and keep your data private? We’ll show you how to get a Hong Kong IP address in Canada through a VPN so you can enjoy your favorites and keep your information private.
You may connect to servers all across the world with Virtual Private Networks (VPNs). Large streaming platforms perform IP address checks on their users before allowing them to view anything.
If you have a server in Hong Kong and can get a Hong Kong IP address in Canada, it become easy to trick these services into allowing you to access your favorite content from Canada.
Many individuals are under the misconception that their online activities are secure. Hackers are always a danger, but you’re far more likely to get caught by your organization, government, ISP, or employer if you use Tor.
However, since your data is encrypted while you’re connected to a VPN, no third parties can access it. In a nutshell, when you use a virtual private network (VPN), you become nearly entirely anonymous on the internet.
How To Get A Hong Kong IP Address In Canada
Even if you’ve never used a VPN before, it’s simple to overcome geographical barriers and gain access to anything you want on the internet: VPN is considered to be the safest way to get a Hong Kong IP address in Canada.
1. Choose a trustworthy VPN service. We recommend ExpressVPN as a safe and secure app.
.
2. To ensure that the program is compatible with your computer’s operating system, double-check the package and verify that it was installed correctly.
3. To connect to a Hong Kong domain location server, you’ll need to use a VPN in Hong Kong. Is it feasible to discover a geo-blocked Hong Kong website? If you still can’t access the page, clear your browser’s cache and cookies before reloading it.
Express hongkong
Which VPN Should I Use To Get A Hong Kong IP Address In Canada?
The greatest VPNs are available to get a Hong Kong IP address in Canada. You can get a French or German IP address from these providers, as well as Israel, Greece, South Korea, Chile, or Luxembourg.
1. The best way to get a Hong Kong IP address in Canada is with ExpressVPN. In Hong Kong, ExpressVPN offers quick servers. They are operating with 3000 servers over the globe.
2. NordVPN is one of the most popular VPN services on the market, with 5200 fast servers that allow you to unblock geo-blocks in 80+ countries. Apps that are both safe and secure. If you don’t like it after the first month, there’s a 30-day money-back guarantee.
3. CyberGhost is a fantastic alternative with 1300 servers over the world. The usage of applications and downloads is simple, making it an ideal choice for newcomers.
4. PrivateVPN: The newest supplier here with 200+ servers on 63 locations, still developing its network, but speeds are quick and ideal for unblocking streaming services.
A Quick Look At The Best Available VPN Services
1 – ExpressVPN
expressvpn
Features
• A wide range of operating systems using this software. Windows, Mac OS X, iOS and Android are a few of them.
• There are more than 3,000 workstations spanning the globe in a network that is well-connected.
• As many as 52 weeks of service.
• There is split-tunneling to get around.
• Netflix and Amazon Prime Video are accessible
• You can download unlimited movies and TV shows.
• Each IP address can have up to 5 network connection.
• In 94 countries, we work.
ExpressVPN is a great tool to get a Hong Kong IP address in Canada. With a 30-day money-back guarantee, unrestricted bandwidth, and servers in Hong Kong, it’s safe to say that ExpressVPN is one of the best VPNs on the market. It can stream HD or even 4K content without interruption and has no perceptible buffering when streaming online media. It’s also capable of bypassing regional restrictions.
All of your data is encrypted by default with 256-bit AES encryption, but ExpressVPN offers a desktop version with a kill switch and perfect forward secrecy, as well as DNS and IPv6 leak protection.
ExpressVPN does not collect any information that might identify you, but you may register anonymously using Bitcoin if that is your preference. You can get assistance 24 hours a day, seven days a week by visiting the live chat area.
There are a few options for purchasing a VPN. ExpressVPN offers apps for Windows, Android, Linux, MacOS, and iOS as well as custom router firmware that makes installation easier.
Pros
1. This utility is ideal for getting around geo-restrictions.
2. Instant customer service
3. The ability of the toilet to unblock effectively is excellent.
4. Quick connectivity
5. Extremely secure
6. Availability round the clock
Cons
1. Cheaper than most competitors
2 – NordVPN
nordvpn
Features
• Compatibility with the following operating systems: MAC, Linux, Android, Windows, and iOS.
• There are over 70+ servers in Hong Kong
• NordVPN recommended streaming servers is “hk289.nordvpn.com”
• Over 5200 servers are located throughout the world.
• Access to online streaming services.
• SLAs are available in Hong Kong for periods of 30 days, 60 days, and one year.
• It’s simple to discover one of the 55,00+ IP addresses accepted by torrent sites.
• Over sixty-two regions in which the service is available
The robust network of NordVPN makes its a unique service to get a Hong Kong IP address in Canada. NordVPN provides access to over 5,000 servers in 59 countries, including 70+ in Hong Kong. This service is incredibly quick, allows for P2P activity, and has no bandwidth restrictions. Users may also use obfuscated servers if they wish to visit the Chinese mainland.
NordVPN lets you have six connections at once and can even unblock sites that are difficult to access from other countries, making it ideal for watching when traveling.
nord hong kong
For a low-cost VPN, NordVPN provides a wide range of security features. Malware scanning, DNS, IPv6, WebRTC, a customizable kill switch, 256-bit encryption, an ad blocker, and port forwarding leak protection are all offered.
There are plenty of options for multi-hop VPN and Tor over VPN. NordVPN does not keep any records, so you can sign up anonymously with Bitcoin. Support is available 24 hours a day, seven days a week via live chat.
There are Android, Linux, iOS, Windows, and macOS versions of NordVPN. Manual installation is available on select wireless routers.
Pros
1. There is a significant premium on security.
2. A huge server network is maintained.
3. Quick connectivity
4. Extreme unblocking
5. Chat assistance is available 24 hours a day, seven days a week.
Cons
1. It might take a few minutes to connect to certain servers.
2. Static IP addresses
3- CyberGhost VPN
Features
• Using Microsoft Windows and Linux is the best way to go.
• There are 7700 servers around the world.
• 60+ servers in Hong Kong.
• Services like Netflix and Amazon Prime are easy to find.
• Encryption technology and high-tech security measures are very important.
• 89 or more countries have been served by this company so far.
Its takes no time for CyberGhost to get a Hong Kong IP address in Canada for its users. CyberGhost is a truly user-friendly VPN with over 7700 servers out of which 60 are placed in Hong Kong. With each of CyberGhost’s fast servers displaying its current load and many displaying the streaming service they can unblock, getting started is as simple as pie.
CyberGhost allows you to protect all of your equipment with just one account. You can connect up to seven devices at the same time with CyberGhost.
With just a few clicks, CyberGhost hides your IP address and encrypts all of the data that you send through their servers. It has automated malware scanning, a kill switch that can’t be disabled, 256-bit encryption, protection against DNS and IPv6 leaks, and ad blocking
CyberGhost keeps no personally identifiable information, but you may create an account with Bitcoin and a fake email address. You can get in touch with support 24 hours a day, seven days a week through live chat if you run into any problems.
CyberGhost provides apps for Android, iOS, Windows, and macOS. It may be manually configured to function on Linux systems and compatible network routers.
Pros
1. Easy for novices to use
2. Connections that are quick, dependable
3. Active kill switch option is available
4. Security is comprehensive.
Cons
1. There are no extra features to manage.
4- PrivateVPN
private vpn
Features
• Optimized performance for Windows, Android, Mac OS X, and Linux
• They have over 200 servers situated across the world
• 60 server locations available for use.
• Recommended streaming servers are “hk-china.pvdata.host” & “hk-hon.pvdata.host”.
• Advanced encryption
• Through the use of cutting-edge technology, ensures the security of online transactions.
• Streaming is a brilliant.
• There is no delay in connectivity
• Reliable transmission
• Discounted package deals.
Private VPN is another reliable service to get a Hong Kong IP address in Canada. While most VPNs slow down your internet connection, this one doesn’t. While it has fewer servers based in Hong Kong, it makes up for it by providing quick connections. It’s also excellent at unblocking geo-restricted media from other countries.
By using 256-bit encryption, PrivateVPN is one of the most secure VPNs on the market. It also includes WebRTC, DNS, and IPV6leak protection, as well as strict no-logs policies. If you want to be more anonymous, you may pay with Bitcoin for even greater privacy.
PrivateVPN offers 24/7 live chat support, which is accessible through its website or through the customer care software. The software may be remotely installed and configured with your permission, which is great news for those of us who aren’t computer experts. PrivateVPN provides apps for Android, iOS, Windows, and Mac devices. It works on Linux as well.
Pros
1. Faster connections
2. No-Logging policy
3. Extreme unblocking
Cons
1. The network is limited.
2. There is no live chat assistance.
What Is The Purpose To Get A Hong Kong IP Address in Canada?
You could get a Hong Kong IP Address in Canada for the following reasons:
• The act of accessing your bank’s website from multiple geographical locations.
• It’s critical that geo-restricted services like Netflix and Hulu remain accessible.
• If no one outside the area has access to any private or secret information.
What Are The Most Important Factors To Consider When Selecting A VPN?
It’s tough to decide which VPN is the best option for you. After all, there are numerous options to select from, and they’re always adding new ones.
To get a Hong Kong IP address in Canada, we searched for companies that satisfied the following criteria:
1. In Hong Kong, there should be a robust network of high-quality servers.
2. Quick connectivity is required
3. Extreme encryption to save the data is required.
4. Must have compatibility with all the renowned Operating systems.
5. There should be strong no logs policy.
Frequently Asked Questions
Many services now, including PayPal and most online banking platforms, automatically send notifications when your account is accessed from another region. Some even restrict access until you’ve confirmed your identity.
Only the VPN’s servers in your home country will be able to identify you as being abroad, giving you access to all of the things that matter. If, for example, you get stranded abroad with no way of contacting your bank account, this may cause problems.
When you’re on vacation, you’ll usually be using public Wi-Fi networks. Of course, these present their own set of challenges: they may restrict access to certain websites and there’s no way to know who is monitoring your activities. Not only is your traffic indecipherable while you use a VPN, but you may also freely access whatever content you want because of the ability to bypass any filtering.
Free VPNs want you to believe that their services are comparable to those offered by paid providers, but this isn’t always true. Because they have fewer servers but larger user bases, there’s a lot of pressure on their networks all the time.
VPNs can also cause connection problems in various ways. The most common and well-known way is through the use of shared IP addresses.
How do free VPNs manage to run an international server network while still providing a service for free? How do free VPNs manage to establish and maintain an overseas server network when it’s so expensive? They’ll almost certainly use tracking cookies to collect important user information, such as which pages you visit.
VPNs are marketed as a means to keep your privacy, but they actively jeopardize it by monitoring and selling information about your activities to the highest bidders.
Finally, there’s no assurance that the service you pick will be secure. According to recent research, over 39% of 302 free VPN apps tested contained malware, 20% never used any form of encryption, and 77% were susceptible to DNS leaks.
We’ve even seen well-known services employ unscrupulous business tactics, such as when Hola was discovered selling its users’ bandwidth to help establish a botnet in 2016.
To keep yourself safe, we strongly advise you to use a VPN that has a proven track record of safeguarding its users’ privacy.
After you’ve linked to a server in Hong Kong, you can utilize services like MyTV, ViuTV, or Netflix from Canada since popular movies and TV shows will be available.
It’s worth noting that some platforms restrict access in various ways. If you’re instructed to pay with a Hong Kong-only credit card or need to document your residency, it’s difficult for someone who lives outside of the region. However, if you’re a Hongkonger currently living away from home, you’ll be able to sign up using a common payment method.
In contrast to China, the internet in Hong Kong is largely unrestricted. Only websites that provide authorized content are banned. This is a typical practice throughout much of Europe but is practically unheard-of in Asia.
According to the Interception of Communications and Surveillance Ordinance 2006, law enforcement must first obtain permission from a panel before eavesdropping on a user’s traffic. According to statistics released by the Home Affairs Department in 2017, 1,314 applications were granted and just one was denied, resulting in 170 arrests.
According to the Interception of Communications and Surveillance Ordinance 2006, law enforcement must first obtain permission from a panel before interception of a user’s traffic is permissible. However, in 2017, 1,314 applications were granted and only one was refused, resulting in 170 arrests.
Conclusion
This article goes through all of the legal methods to get a Hong Kong IP address in Canada. We usually use a VPN (only premium and recommended service, not the free version) because they are easy to use and provide the best results when compared to other techniques.
Another alternative is to use a proxy server or TOR, but if you have adequate technical skills, we recommend you utilize them. | {
"url": "https://www.howtochangeipaddress.com/ca/get-a-hong-kong-ip-address-in-canada/",
"source_domain": "www.howtochangeipaddress.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "66866",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MZE65ED7MNS4WSSXOM7FHZFRM6LFMYM4",
"WARC-Concurrent-To": "<urn:uuid:4c52b092-bd17-4760-8f35-023854afef69>",
"WARC-Date": "2022-05-19T15:51:13Z",
"WARC-IP-Address": "45.63.65.131",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:V4MJBX4N42AAVA24AWM7GFJ6PDE42CUQ",
"WARC-Record-ID": "<urn:uuid:a0146b5a-9ea1-4226-bc6d-077632fdc450>",
"WARC-Target-URI": "https://www.howtochangeipaddress.com/ca/get-a-hong-kong-ip-address-in-canada/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bde0ff9e-0a4b-4bc7-b0ba-1c303338a387>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-243\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
55,
56,
284,
285,
477,
478,
660,
661,
884,
885,
1103,
1104,
1105,
1149,
1150,
1370,
1371,
1458,
1459,
1461,
1462,
1614,
1615,
1617,
1618,
1866,
1867,
1884,
1885,
1886,
1950,
1951,
2150,
2151,
2329,
2594,
2763,
2936,
2937,
2938,
2986,
2987,
2989,
2990,
3005,
3006,
3017,
3018,
3027,
3028,
3141,
3240,
3276,
3320,
3370,
3422,
3479,
3509,
3510,
3909,
3910,
4109,
4110,
4343,
4344,
4523,
4524,
4529,
4530,
4594,
4624,
4692,
4716,
4738,
4772,
4773,
4778,
4779,
4814,
4815,
4827,
4828,
4836,
4837,
4846,
4847,
4942,
4986,
5051,
5107,
5148,
5231,
5317,
5378,
5379,
5744,
5745,
5914,
5915,
5930,
5931,
6156,
6157,
6371,
6372,
6504,
6505,
6510,
6511,
6560,
6602,
6626,
6650,
6719,
6720,
6725,
6726,
6790,
6815,
6816,
6834,
6835,
6844,
6845,
6906,
6951,
6981,
7042,
7120,
7186,
7187,
7543,
7544,
7692,
7693,
7964,
7965,
8207,
8208,
8362,
8363,
8368,
8369,
8398,
8442,
8486,
8518,
8519,
8524,
8525,
8569,
8570,
8584,
8585,
8597,
8598,
8607,
8608,
8676,
8733,
8776,
8861,
8885,
8978,
9008,
9046,
9072,
9102,
9103,
9429,
9430,
9692,
9693,
10051,
10052,
10057,
10058,
10082,
10105,
10129,
10130,
10135,
10136,
10165,
10204,
10205,
10206,
10267,
10268,
10342,
10343,
10426,
10514,
10594,
10595,
10665,
10666,
10815,
10816,
10922,
10923,
11000,
11036,
11090,
11160,
11204,
11205,
11232,
11233,
11452,
11453,
11706,
11707,
12106,
12107,
12109,
12110,
12111,
12353,
12354,
12489,
12490,
12812,
12813,
12980,
12981,
13217,
13218,
13390,
13391,
13517,
13518,
13520,
13521,
13522,
13687,
13688,
14039,
14040,
14042,
14043,
14044,
14267,
14268,
14605,
14606,
14903,
14904,
14906,
14907,
14908,
14909,
14920,
14921,
15188,
15189
],
"line_end_idx": [
55,
56,
284,
285,
477,
478,
660,
661,
884,
885,
1103,
1104,
1105,
1149,
1150,
1370,
1371,
1458,
1459,
1461,
1462,
1614,
1615,
1617,
1618,
1866,
1867,
1884,
1885,
1886,
1950,
1951,
2150,
2151,
2329,
2594,
2763,
2936,
2937,
2938,
2986,
2987,
2989,
2990,
3005,
3006,
3017,
3018,
3027,
3028,
3141,
3240,
3276,
3320,
3370,
3422,
3479,
3509,
3510,
3909,
3910,
4109,
4110,
4343,
4344,
4523,
4524,
4529,
4530,
4594,
4624,
4692,
4716,
4738,
4772,
4773,
4778,
4779,
4814,
4815,
4827,
4828,
4836,
4837,
4846,
4847,
4942,
4986,
5051,
5107,
5148,
5231,
5317,
5378,
5379,
5744,
5745,
5914,
5915,
5930,
5931,
6156,
6157,
6371,
6372,
6504,
6505,
6510,
6511,
6560,
6602,
6626,
6650,
6719,
6720,
6725,
6726,
6790,
6815,
6816,
6834,
6835,
6844,
6845,
6906,
6951,
6981,
7042,
7120,
7186,
7187,
7543,
7544,
7692,
7693,
7964,
7965,
8207,
8208,
8362,
8363,
8368,
8369,
8398,
8442,
8486,
8518,
8519,
8524,
8525,
8569,
8570,
8584,
8585,
8597,
8598,
8607,
8608,
8676,
8733,
8776,
8861,
8885,
8978,
9008,
9046,
9072,
9102,
9103,
9429,
9430,
9692,
9693,
10051,
10052,
10057,
10058,
10082,
10105,
10129,
10130,
10135,
10136,
10165,
10204,
10205,
10206,
10267,
10268,
10342,
10343,
10426,
10514,
10594,
10595,
10665,
10666,
10815,
10816,
10922,
10923,
11000,
11036,
11090,
11160,
11204,
11205,
11232,
11233,
11452,
11453,
11706,
11707,
12106,
12107,
12109,
12110,
12111,
12353,
12354,
12489,
12490,
12812,
12813,
12980,
12981,
13217,
13218,
13390,
13391,
13517,
13518,
13520,
13521,
13522,
13687,
13688,
14039,
14040,
14042,
14043,
14044,
14267,
14268,
14605,
14606,
14903,
14904,
14906,
14907,
14908,
14909,
14920,
14921,
15188,
15189,
15315
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 15315,
"ccnet_original_nlines": 256,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3725040853023529,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025204580277204514,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18428805470466614,
"rps_doc_frac_unique_words": 0.3010244369506836,
"rps_doc_mean_word_length": 4.782505989074707,
"rps_doc_num_sentences": 190,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.79817008972168,
"rps_doc_word_count": 2538,
"rps_doc_frac_chars_dupe_10grams": 0.06121271848678589,
"rps_doc_frac_chars_dupe_5grams": 0.1017465814948082,
"rps_doc_frac_chars_dupe_6grams": 0.09087163954973221,
"rps_doc_frac_chars_dupe_7grams": 0.08741144090890884,
"rps_doc_frac_chars_dupe_8grams": 0.0757126435637474,
"rps_doc_frac_chars_dupe_9grams": 0.06920415163040161,
"rps_doc_frac_chars_top_2gram": 0.021090790629386902,
"rps_doc_frac_chars_top_3gram": 0.012605040334165096,
"rps_doc_frac_chars_top_4gram": 0.015818089246749878,
"rps_doc_books_importance": -1420.8709716796875,
"rps_doc_books_importance_length_correction": -1420.8709716796875,
"rps_doc_openwebtext_importance": -866.65625,
"rps_doc_openwebtext_importance_length_correction": -866.65625,
"rps_doc_wikipedia_importance": -462.8487854003906,
"rps_doc_wikipedia_importance_length_correction": -462.8487854003906
},
"fasttext": {
"dclm": 0.018386779353022575,
"english": 0.9281045198440552,
"fineweb_edu_approx": 1.5190460681915283,
"eai_general_math": 0.013226930052042007,
"eai_open_web_math": 0.10679023712873459,
"eai_web_code": 0.0017154200468212366
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.677",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "352.32",
"labels": {
"level_1": "Social sciences",
"level_2": "Public administration and Military art and science",
"level_3": "Local government"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,575,362,607,882,076,000 | Added pawn promotion and locales support!
pull/17/head
spla 2 years ago
parent 2d43565417
commit 8ec306c680
1. 48
locales/cat.txt
2. 48
locales/eng.txt
3. 349
mastochess.py
4. 36
setup.py
@ -0,0 +1,48 @@
search_end: fi
search_move: mou
search_new: nova
search_games: jocs
search_send: envia
new_game_started: partida iniciada! Esperant jugador...
playing_with: jugues amb
your_turn: el teu torn
game_name: partida
chess_hashtag: #escacs
send_error: error al enviar les anotacions :-(
game_number_anotations: les anotacions de la partida n.
anotations_sent: enviades amb èxit!
game_no_exists: la partida n.
it_not_exists: no existeix...
game_already_started: ja tenies iniciada una partida!
wait_other_player: espera l'altre jugador
is_not_legal_move: és un moviment il·legal. Torna a tirar.
check_done: t'ha fet escac!
check_mate: Escac i mat! (en
check_mate_movements: moviments)
the_winner_is: El guanyador és:
well_done: ben jugat!
winned_games: Partides guanyades:
wins_of_many: de
lost_piece: * has perdut
not_legal_move_str: moviment il·legal!
player_leave_game: ha deixat la partida amb
leave_waiting_game: has abandonat la partida en espera.
started_games: partides iniciades:
game_is_waiting: en espera...
game_is_on_going: (en joc)
no_on_going_games: cap partida en joc
is_not_your_turn: no és el teu torn.
is_the_turn_of: és el torn de
pawn_piece: un peó
knight_piece: un cavall
bishop_piece: l'alfil
rook_piece: una torre
queen_piece: la Dama
king_piece: el Rei
pawn_piece_letter: P
knight_piece_letter: C
bishop_piece_letter: A
rook_piece_letter: T
queen_piece_letter: D
king_piece_letter: R
email_subject: Anotacions partida n.
@ -0,0 +1,48 @@
search_end: end
search_move: move
search_new: new
search_games: games
search_send: send
new_game_started: game started! Waiting for the second player...
playing_with: you play with
your_turn: it's your turn
game_name: game
chess_hashtag: #chess
send_error: sending anotations error :-(
game_number_anotations: the anotations of game n.
anotations_sent: succesfully sent!
game_no_exists: the game n.
it_not_exists: don't exists...
game_already_started: you already started a game!
wait_other_player: wait for the second player
is_not_legal_move: is not a legal move. Play again.
check_done: you are in check!
check_mate: it's a checkmate! (in
check_mate_movements: moves)
the_winner_is: The winner is:
well_done: well done!
winned_games: Won games:
wins_of_many: of
lost_piece: * you have lost
not_legal_move_str: not a legal move!
player_leave_game: has left the game with
leave_waiting_game: you have left the game in hold.
started_games: started games:
game_is_waiting: on hold...
game_is_on_going: (on going)
no_on_going_games: no games
is_not_your_turn: it's not your turn.
is_the_turn_of: it's the turn of
pawn_piece: a pawn
knight_piece: one knight
bishop_piece: one bishop
rook_piece: a rook
queen_piece: the Queen
king_piece: the King
pawn_piece_letter: P
knight_piece_letter: N
bishop_piece_letter: B
rook_piece_letter: R
queen_piece_letter: Q
king_piece_letter: K
email_subject: Anotations of game n.
@ -101,27 +101,27 @@ def get_piece_name(captured_piece):
if captured_piece == 1:
piece_name = "un Peó"
piece_name = pawn_piece
if captured_piece == 2:
piece_name = "un cavall"
piece_name = knight_piece
if captured_piece == 3:
piece_name = "l'àlfil"
piece_name = bishop_piece
if captured_piece == 4:
piece_name = "una torre"
piece_name = rook_piece
if captured_piece == 5:
piece_name = "la Dama"
piece_name = queen_piece
if captured_piece == 6:
piece_name = "el Rei"
piece_name = king_piece
return piece_name
@ -129,27 +129,27 @@ def get_moved_piece_name(moved_piece):
if moved_piece == 1:
moved_piece_name = "P"
moved_piece_name = pawn_piece_letter
if moved_piece == 2:
moved_piece_name = "C"
moved_piece_name = knight_piece_letter
if moved_piece == 3:
moved_piece_name = "A"
moved_piece_name = bishop_piece_letter
if moved_piece == 4:
moved_piece_name = "T"
moved_piece_name = rook_piece_letter
if moved_piece == 5:
moved_piece_name = "D"
moved_piece_name = queen_piece_letter
if moved_piece == 6:
moved_piece_name = "R"
moved_piece_name = king_piece_letter
return moved_piece_name
@ -167,7 +167,7 @@ def get_notification_data():
url_lst = []
search_text = ['fi','mou','nova','jocs', 'envia']
search_text = [search_end, search_move, search_new, search_games, search_send]
conn = None
@ -511,13 +511,23 @@ def update_game(board_game, toot_url):
conn.close()
def save_annotation():
def save_anotation(moving):
square_index = chess.SQUARE_NAMES.index(moving[2:])
if moving_piece != 1:
moved_piece = board.piece_type_at(square_index)
square_index = chess.SQUARE_NAMES.index(moving[2:])
moved_piece_name = get_moved_piece_name(moved_piece)
moved_piece = board.piece_type_at(square_index)
moved_piece_name = get_moved_piece_name(moved_piece)
else:
moved_piece_name = 'P'
if promoted == True:
moving = moving + 'q'
game_file = "anotations/" + str(game_id) + ".txt"
@ -541,7 +551,13 @@ def save_annotation():
if check != True and checkmate != True:
line_data = str(board.fullmove_number) + ". " + moved_piece_name + moving[2:]
if promoted != True:
line_data = str(board.fullmove_number) + ". " + moved_piece_name + moving[2:]
else:
line_data = str(board.fullmove_number) + ". " + moved_piece_name + "=D"
else:
@ -553,15 +569,20 @@ def save_annotation():
if check != True and checkmate != True:
line_data = " - " + moved_piece_name + moving[2:] + "\n"
if promoted != True:
line_data = " - " + moved_piece_name + moving[2:] + "\n"
else:
line_data = " - " + moved_piece_name + "=D"
else:
line_data = " - " + moved_piece_name + "\n"
if not os.path.isfile(game_file):
file_header = "Partida: " + str(game_id) + "\n" + white_user + " / " + black_user + "\n\n"
file_header = game_name + ': ' + str(game_id) + "\n" + white_user + " / " + black_user + "\n\n"
with open(game_file, 'w+') as f:
@ -621,7 +642,7 @@ def send_anotation(game_id):
# Declare message elements
msg['From'] = smtp_user_login
msg['To'] = username_email
msg['Subject'] = "Anotaciones partida n." + game_id
msg['Subject'] = email_subject + game_id
# Attach the game anotation
file_to_attach = "anotations/" + game_id + ".txt"
@ -967,30 +988,30 @@ def replying():
if unidecode.unidecode(question)[0:query_word_length] == query_word:
if query_word[0:4] == 'nova':
if query_word == search_new:
reply = True
reply = True
elif query_word[0:3] == 'mou':
elif query_word[:search_move_slicing] == search_move:
moving = query_word[4:query_word_length].replace(" ","")
reply = True
moving = query_word[4:query_word_length].replace(" ","")
reply = True
elif query_word[0:2] == 'fi':
elif query_word == search_end:
reply = True
reply = True
elif query_word[0:4] == 'jocs':
elif query_word == search_games:
reply = True
reply = True
elif query_word[0:5] == 'envia':
elif query_word[:search_send_slicing] == search_send:
reply = True
reply = True
else:
else:
reply = False
reply = False
return (reply, query_word, moving)
@ -998,6 +1019,84 @@ def replying():
print(v_error)
def load_strings(bot_lang):
search_end = get_parameter("search_end", language_filepath)
search_move = get_parameter("search_move", language_filepath)
search_new = get_parameter("search_new", language_filepath)
search_games = get_parameter("search_games", language_filepath)
search_send = get_parameter("search_send", language_filepath)
new_game_started = get_parameter("new_game_started", language_filepath)
playing_with = get_parameter("playing_with", language_filepath)
your_turn = get_parameter("your_turn", language_filepath)
game_name = get_parameter("game_name", language_filepath)
chess_hashtag = get_parameter("chess_hashtag", language_filepath)
send_error = get_parameter("send_error", language_filepath)
return (search_end, search_move, search_new, search_games, search_send, new_game_started, playing_with, your_turn, game_name, chess_hashtag, send_error)
def load_strings1(bot_lang):
game_number_anotations = get_parameter("game_number_anotations", language_filepath)
anotations_sent = get_parameter("anotations_sent", language_filepath)
game_no_exists = get_parameter("game_no_exists", language_filepath)
it_not_exists = get_parameter("it_not_exists", language_filepath)
game_already_started = get_parameter("game_already_started", language_filepath)
wait_other_player = get_parameter("wait_other_player", language_filepath)
is_not_legal_move = get_parameter("is_not_legal_move", language_filepath)
check_done = get_parameter("check_done", language_filepath)
check_mate = get_parameter("check_mate", language_filepath)
return (game_number_anotations, anotations_sent, game_no_exists, it_not_exists, game_already_started, wait_other_player, is_not_legal_move, check_done, check_mate)
def load_strings2(bot_lang):
check_mate_movements = get_parameter("check_mate_movements", language_filepath)
the_winner_is = get_parameter("the_winner_is", language_filepath)
well_done = get_parameter("well_done", language_filepath)
winned_games = get_parameter("winned_games", language_filepath)
wins_of_many = get_parameter("wins_of_many", language_filepath)
lost_piece = get_parameter("lost_piece", language_filepath)
not_legal_move_str = get_parameter("not_legal_move_str", language_filepath)
player_leave_game = get_parameter("player_leave_game", language_filepath)
return (check_mate_movements, the_winner_is, well_done, winned_games, wins_of_many, lost_piece, not_legal_move_str, player_leave_game)
def load_strings3(bot_lang):
leave_waiting_game = get_parameter("leave_waiting_game", language_filepath)
started_games = get_parameter("started_games", language_filepath)
game_is_waiting = get_parameter("game_is_waiting", language_filepath)
game_is_on_going = get_parameter("game_is_on_going", language_filepath)
no_on_going_games = get_parameter("no_on_going_games", language_filepath)
is_not_your_turn = get_parameter("is_not_your_turn", language_filepath)
is_the_turn_of = get_parameter("is_the_turn_of", language_filepath)
return (leave_waiting_game, started_games, game_is_waiting, game_is_on_going, no_on_going_games, is_not_your_turn, is_the_turn_of)
def load_strings4(bot_lang):
pawn_piece = get_parameter("pawn_piece", language_filepath)
knight_piece = get_parameter("knight_piece", language_filepath)
bishop_piece = get_parameter("bishop_piece", language_filepath)
rook_piece = get_parameter("rook_piece", language_filepath)
queen_piece = get_parameter("queen_piece", language_filepath)
king_piece = get_parameter("king_piece", language_filepath)
return (pawn_piece, knight_piece, bishop_piece, rook_piece, queen_piece, king_piece)
def load_strings5(bot_lang):
pawn_piece_letter = get_parameter("pawn_piece_letter", language_filepath)
knight_piece_letter = get_parameter("knight_piece_letter", language_filepath)
bishop_piece_letter = get_parameter("bishop_piece_letter", language_filepath)
rook_piece_letter = get_parameter("rook_piece_letter", language_filepath)
queen_piece_letter = get_parameter("queen_piece_letter", language_filepath)
king_piece_letter = get_parameter("king_piece_letter", language_filepath)
email_subject = get_parameter("email_subject", language_filepath)
return (pawn_piece_letter, knight_piece_letter, bishop_piece_letter, rook_piece_letter, queen_piece_letter, king_piece_letter, email_subject)
def mastodon():
# Load secrets from secrets file
@ -1066,7 +1165,7 @@ def create_dir():
def usage():
print('usage: python ' + sys.argv[0] + ' --play')
print('usage: python ' + sys.argv[0] + ' --play' + ' --eng')
###############################################################################
# main
@ -1079,10 +1178,58 @@ if __name__ == '__main__':
usage()
elif len(sys.argv) == 2:
elif len(sys.argv) >= 2:
if sys.argv[1] == '--play':
if len(sys.argv) == 3:
if sys.argv[2] == '--eng':
bot_lang = 'eng'
else:
bot_lang = 'ca'
if bot_lang == "ca":
language_filepath = "locales/cat.txt"
elif bot_lang == "eng":
language_filepath = "locales/eng.txt"
else:
print("\nOnly 'cat' and 'eng' languages are supported.\n")
sys.exit(0)
if bot_lang == 'ca':
search_move_slicing = 3
search_send_slicing = 5
send_game_slicing = 6
elif bot_lang == 'eng':
search_move_slicing = 4
search_send_slicing = 4
send_game_slicing = 5
search_end, search_move, search_new, search_games, search_send, new_game_started, playing_with, your_turn, game_name, chess_hashtag, send_error = load_strings(bot_lang)
game_number_anotations, anotations_sent, game_no_exists, it_not_exists, game_already_started, wait_other_player, is_not_legal_move, check_done, check_mate = load_strings1(bot_lang)
check_mate_movements, the_winner_is, well_done, winned_games, wins_of_many, lost_piece, not_legal_move_str, player_leave_game = load_strings2(bot_lang)
leave_waiting_game, started_games, game_is_waiting, game_is_on_going, no_on_going_games, is_not_your_turn, is_the_turn_of = load_strings3(bot_lang)
pawn_piece, knight_piece, bishop_piece, rook_piece, queen_piece, king_piece = load_strings4(bot_lang)
pawn_piece_letter, knight_piece_letter, bishop_piece_letter, rook_piece_letter, queen_piece_letter, king_piece_letter, email_subject = load_strings5(bot_lang)
mastodon, mastodon_hostname, bot_username = mastodon()
mastodon_db, mastodon_db_user, chess_db, chess_db_user = db_config()
@ -1130,7 +1277,7 @@ if __name__ == '__main__':
status_url = url_lst[i]
if query_word != "jocs":
if query_word != search_games:
is_playing, game_id, white_user, black_user, on_going_game, waiting, playing_user = check_games()
@ -1144,7 +1291,7 @@ if __name__ == '__main__':
if reply == True and is_playing == False:
if query_word == 'nova' and not game_waiting:
if query_word == search_new and not game_waiting:
board = chess.Board()
@ -1154,7 +1301,7 @@ if __name__ == '__main__':
svg2png(bytestring=svgfile,write_to=board_file)
toot_text = "@"+username+ " partida iniciada! Esperant jugador... " +"\n"
toot_text = '@'+username + ' ' + new_game_started + '\n'
toot_text += '\n'
@ -1168,7 +1315,7 @@ if __name__ == '__main__':
update_replies(status_id, username, now)
elif query_word == 'nova' and game_waiting:
elif query_word == search_new and game_waiting:
game_status, white_user, chess_game = join_player()
@ -1184,15 +1331,15 @@ if __name__ == '__main__':
svg2png(bytestring=svgfile,write_to=board_file)
toot_text = "@"+username + " jugues amb " + white_user + "\n"
toot_text = '@'+username + ' ' + playing_with + ' ' + white_user + "\n"
toot_text += '\n'
toot_text += "@"+white_user + ": el teu torn" + "\n"
toot_text += '@'+white_user + ': ' + your_turn + "\n"
toot_text += '\n'
toot_text += 'partida: ' + str(game_id) + ' ' + '#escacs' + '\n'
toot_text += game_name + ': ' + str(game_id) + ' ' + chess_hashtag + '\n'
image_id = mastodon.media_post(board_file, "image/png").id
@ -1204,25 +1351,25 @@ if __name__ == '__main__':
update_replies(status_id, username, now)
elif query_word[0:5] == 'envia':
elif query_word[:search_send_slicing] == search_send:
query_word_length = len(query_word)
send_game = query_word[6:query_word_length].replace(' ', '')
send_game = query_word[send_game_slicing:query_word_length].replace(' ', '')
emailed, game_id, game_found = send_anotation(send_game)
if emailed == False and game_found == True:
toot_text = "@"+username + " error al enviar les anotacions :-("
toot_text = '@'+username + send_error
elif emailed == True and game_found == True:
toot_text = "@"+username + " les anotaciones de la partida n." + str(game_id) + " enviades amb èxit!"
toot_text = '@'+username + ' ' + game_number_anotations + str(game_id) + ' ' + anotations_sent
elif emailed == False and game_found == False:
toot_text = "@"+username + " la partida n." + str(game_id) + " no existeix..."
toot_text = '@'+username + ' ' + game_no_exists + str(game_id) + ' ' + it_not_exists
mastodon.status_post(toot_text, in_reply_to_id=status_id,visibility=visibility)
@ -1234,9 +1381,9 @@ if __name__ == '__main__':
elif reply and is_playing:
if query_word == 'nova':
if query_word == search_new:
toot_text = "@"+username + ' ja tenies iniciada una partida!' + '\n'
toot_text = '@'+username + ' ' + game_already_started + '\n'
if black_user != '':
@ -1244,11 +1391,11 @@ if __name__ == '__main__':
else:
toot_text += "espera l'altre jugador" + '\n'
toot_text += wait_other_player + '\n'
toot_text += '\n'
toot_text += 'partida: ' + str(game_id) + ' ' + '#escacs' + '\n'
toot_text += game_name + ': ' + str(game_id) + ' ' + chess_hashtag + '\n'
board = chess.Board(on_going_game)
@ -1264,15 +1411,47 @@ if __name__ == '__main__':
update_replies(status_id, username, now)
elif query_word[0:3] == 'mou' and playing_user == username:
elif query_word[:search_move_slicing] == search_move and playing_user == username:
board = chess.Board(on_going_game)
promoted = False
try:
if chess.Move.from_uci(moving) not in board.legal_moves:
piece_square_index = chess.SQUARE_NAMES.index(moving[:2])
moving_piece = board.piece_type_at(piece_square_index)
if moving_piece == 1:
square_index = chess.SQUARE_NAMES.index(moving[2:4])
if bool(board.turn == chess.WHITE) == True:
square_rank_trigger = 7
elif bool(board.turn == chess.BLACK) == True:
square_rank_trigger = 0
if chess.square_rank(square_index) == square_rank_trigger:
promoted = True
if len(moving) == 4:
moving = moving + 'q'
not_legal_move = chess.Move.from_uci(moving) not in board.legal_moves
else:
not_legal_move = chess.Move.from_uci(moving) not in board.legal_moves
if not_legal_move:
toot_text = "@"+username + ": " + moving + " és un moviment il·legal. Torna a tirar." + "\n"
toot_text = '@'+username + ': ' + moving + ' ' + is_not_legal_move + '\n'
mastodon.status_post(toot_text, in_reply_to_id=status_id,visibility=visibility)
@ -1288,7 +1467,7 @@ if __name__ == '__main__':
capture = True
square_capture_index = chess.SQUARE_NAMES.index(moving[2:])
square_capture_index = chess.SQUARE_NAMES.index(moving[2:4])
captured_piece = board.piece_type_at(square_capture_index)
@ -1326,33 +1505,33 @@ if __name__ == '__main__':
if check == True and checkmate == False:
toot_text = "@"+playing_user + " " + username + " t'ha fet escac!\n"
toot_text = "@"+playing_user + " " + username + ' ' + check_done + '\n'
elif check == True and checkmate == True:
toot_text = "\nEscac i mat! (en " + str(game_moves) + " moviments)" + "\n\nEl guanyador és: " + "@"+username + '\n'
toot_text = '\n' + check_mate + ' ' + str(game_moves) + ' ' + check_mate_movements + '\n\n' + the_winner_is + ' ' + "@"+username + '\n'
toot_text += "\n@"+playing_user + ": ben jugat!" + "\n"
toot_text += "\n@"+playing_user + ': ' + well_done + "\n"
toot_text += "\nPartides guanyades:" + "\n"
toot_text += '\n' + winned_games + "\n"
played_games, wins = get_stats(username)
toot_text += username + ": " + str(wins) + " de " + str(played_games) + "\n"
toot_text += username + ': ' + str(wins) + ' ' + wins_of_many + ' ' + str(played_games) + "\n"
played_games, wins = get_stats(playing_user)
toot_text += playing_user + ": " + str(wins) + " de " + str(played_games) + "\n"
toot_text += playing_user + ': ' + str(wins) + ' ' + wins_of_many + ' ' + str(played_games) + "\n"
else:
toot_text = "@"+playing_user + ' el teu torn.'+ '\n'
toot_text = '@'+playing_user + ' ' + your_turn + '\n'
if capture == True and checkmate == False:
toot_text += "\n* has perdut " + piece_name + "!\n"
toot_text += '\n' + lost_piece + ' ' + piece_name + '!\n'
toot_text += '\npartida: ' + str(game_id) + ' ' + '#escacs' + '\n'
toot_text += '\n' + game_name + ': ' + str(game_id) + ' ' + chess_hashtag + '\n'
if username == white_user:
@ -1390,7 +1569,7 @@ if __name__ == '__main__':
game_moves = board.ply()
save_annotation()
save_anotation(moving)
update_moves(username, game_moves)
@ -1400,7 +1579,7 @@ if __name__ == '__main__':
print(v_error)
toot_text = "@"+username + ' moviment il·legal! (' + moving + '!?)\n'
toot_text = '@'+username + ' ' + not_legal_move_str + moving + '!?)\n'
mastodon.status_post(toot_text, in_reply_to_id=status_id,visibility=visibility)
@ -1412,7 +1591,7 @@ if __name__ == '__main__':
print(a_error)
toot_text = "@"+username + ' moviment il·legal! (' + moving + '!?)\n'
toot_text = '@'+username + ' ' + not_legal_move_str + moving + '!?)\n'
mastodon.status_post(toot_text, in_reply_to_id=status_id,visibility=visibility)
@ -1420,13 +1599,13 @@ if __name__ == '__main__':
pass
elif query_word[0:2] == 'fi':
elif query_word == search_end:
if black_user != '':
if username == white_user:
toot_text = "@"+username + " ha deixat la partida amb " + "@"+black_user
toot_text = '@'+username + ' ' + player_leave_game + ' ' + '@'+black_user
mastodon.status_post(toot_text, in_reply_to_id=status_id,visibility=visibility)
@ -1440,7 +1619,7 @@ if __name__ == '__main__':
else:
toot_text = "@"+username + " ha deixat la partida amb " + white_user
toot_text = '@'+username + ' ' + player_leave_game + ' ' + white_user
mastodon.status_post(toot_text, in_reply_to_id=status_id,visibility=visibility)
@ -1454,7 +1633,7 @@ if __name__ == '__main__':
else:
toot_text = "@"+username + " has abandonat la partida en espera."
toot_text = '@'+username + ' ' + leave_waiting_game
mastodon.status_post(toot_text, in_reply_to_id=status_id, visibility=visibility)
@ -1466,30 +1645,30 @@ if __name__ == '__main__':
continue
elif query_word == 'jocs':
elif query_word == search_games:
player1_name_lst, player2_name_lst, game_status_lst, game_link_lst, next_move_lst = current_games()
if len(player1_name_lst) > 0:
toot_text = "@"+username + " partides iniciades:" + "\n"
toot_text = "@"+username + ' ' + started_games + "\n"
i = 0
while i < len(player1_name_lst):
if game_status_lst[i] == 'waiting':
toot_text += "\n" + player1_name_lst[i] + " / " + player2_name_lst[i] + " (en espera...)" + "\n"
toot_text += '\n' + player1_name_lst[i] + ' / ' + player2_name_lst[i] + ' ' + game_is_waiting + "\n"
else:
if next_move_lst[i] == player1_name_lst[i]:
toot_text += "\n*" + player1_name_lst[i] + " / " + player2_name_lst[i] + " (en joc)" + "\n"
toot_text += '\n*' + player1_name_lst[i] + ' / ' + player2_name_lst[i] + ' ' + game_is_on_going + '\n'
else:
toot_text += "\n" + player1_name_lst[i] + " / *" + player2_name_lst[i] + " (en joc)" + "\n"
toot_text += '\n' + player1_name_lst[i] + ' / *' + player2_name_lst[i] + ' ' + game_is_on_going + '\n'
if game_link_lst[i] != None:
@ -1501,13 +1680,13 @@ if __name__ == '__main__':
else:
toot_text = "@"+username + " cap partida en joc" + "\n"
toot_text = '@'+username + ' ' + no_on_going_games + '\n'
mastodon.status_post(toot_text, in_reply_to_id=status_id,visibility=visibility)
update_replies(status_id, username, now)
elif query_word[0:5] == 'envia':
elif query_word[:search_send_slicing] == search_send:
query_word_length = len(query_word)
@ -1517,15 +1696,15 @@ if __name__ == '__main__':
if emailed == False and game_found == True:
toot_text = "@"+username + " error al enviar les anotacions :-("
toot_text = '@'+username + ' ' + send_error
elif emailed == True and game_found == True:
toot_text = "@"+username + " les anotaciones de la partida n." + str(game_id) + " enviades amb èxit!"
toot_text = '@'+username + ' ' + game_number_anotations + str(game_id) + ' ' + anotations_sent
elif emailed == False and game_found == False:
toot_text = "@"+username + " la partida n." + str(game_id) + " no existeix..."
toot_text = '@'+username + ' ' + game_no_exists + str(game_id) + ' ' + it_not_exists
mastodon.status_post(toot_text, in_reply_to_id=status_id,visibility=visibility)
@ -1535,15 +1714,15 @@ if __name__ == '__main__':
if playing_user == None:
toot_text = "@"+username + " no és el teu torn." + "\n"
toot_text = '@'+username + ' ' + is_not_your_turn + '\n'
else:
toot_text = "@"+username + " és el torn de " + playing_user + "\n"
toot_text = '@'+username + ' ' + is_the_turn_of + ' ' + playing_user + "\n"
toot_text += '\n'
toot_text += 'partida: ' + str(game_id) + ' ' + '#escacs' + '\n'
toot_text += game_name + ': ' + str(game_id) + ' ' + chess_hashtag + '\n'
board = chess.Board(on_going_game)
@ -39,11 +39,6 @@ def write_config():
print("Writing parameters names 'mastodon_hostname' and 'bot_username' to " + config_filepath)
the_file.write('mastodon_hostname: \n' + 'bot_username: \n')
def write_lang_config():
with open(lang_config_filepath, 'a') as lang_file:
lang_file.write('bot_lang: \n')
print("adding Bot lang parameter name 'bot_lang' to "+ lang_config_filepath)
def read_client_lines(self):
client_path = 'app_clientcred.txt'
with open(client_path) as fp:
@ -72,12 +67,6 @@ def read_config_line():
modify_file(config_filepath, "mastodon_hostname: ", value=hostname)
modify_file(config_filepath, "bot_username: ", value=bot_username)
def read_lang_config_line():
with open(lang_config_filepath) as fp:
line = fp.readline()
lang = input("Enter Bot lang, ex. en or ca: ")
modify_file(lang_config_filepath, "bot_lang: ", value=lang)
def log_in():
error = 0
try:
@ -195,27 +184,6 @@ def get_hostname( parameter, config_filepath ):
print("setup done!")
sys.exit(0)
# Returns the parameter from the specified file
def get_lang( parameter, lang_config_filepath ):
# Check if lang file exists
if not os.path.isfile(lang_config_filepath):
print("File %s not found, creating it."%lang_config_filepath)
create_lang_config()
# Find parameter in file
with open( lang_config_filepath ) as f:
for line in f:
if line.startswith( parameter ):
return line.replace(parameter + ":", "").strip()
# Cannot find parameter, exit
print(lang_config_filepath + " Missing parameter %s "%parameter)
write_lang_config()
read_lang_config_line()
print("Bot lang setup done!")
sys.exit(0)
###############################################################################
# main
@ -232,7 +200,3 @@ if __name__ == '__main__':
mastodon_hostname = get_hostname("mastodon_hostname", config_filepath)
bot_username = get_parameter("bot_username", config_filepath)
# Load Bot lang from config file
lang_config_filepath = "config/lang_config.txt"
bot_lang = get_lang("bot_lang", lang_config_filepath) # E.g., en or ca
Loading…
Cancel
Save | {
"url": "https://git.mastodont.cat/spla/mastochess/commit/8ec306c6806ac54a8c3c685746fd4a1ab8d128c2",
"source_domain": "git.mastodont.cat",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "735712",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OLVAHHT7A3R72CIDNFMDJNKBIDA53XQB",
"WARC-Concurrent-To": "<urn:uuid:bacd4e03-e262-40d9-8f7c-23761f06d5ea>",
"WARC-Date": "2022-12-10T09:56:19Z",
"WARC-IP-Address": "65.109.31.111",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KIYF4JNDPE2HULIDCM43LBSHQWUJJ664",
"WARC-Record-ID": "<urn:uuid:330fe4d3-9e0c-4c36-a2af-f2fa574531d2>",
"WARC-Target-URI": "https://git.mastodont.cat/spla/mastochess/commit/8ec306c6806ac54a8c3c685746fd4a1ab8d128c2",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cc562cf7-8697-49e7-b1d2-10b2ba2727d1>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-16\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
42,
43,
56,
73,
91,
109,
117,
139,
147,
169,
178,
198,
206,
221,
222,
238,
253,
270,
287,
306,
325,
381,
406,
429,
448,
471,
518,
574,
610,
640,
670,
724,
766,
825,
853,
882,
915,
947,
969,
1003,
1020,
1045,
1084,
1128,
1184,
1219,
1249,
1276,
1314,
1351,
1381,
1400,
1424,
1446,
1468,
1489,
1508,
1529,
1552,
1575,
1596,
1618,
1639,
1676,
1677,
1693,
1709,
1727,
1743,
1763,
1781,
1846,
1874,
1900,
1916,
1938,
1979,
2029,
2064,
2092,
2123,
2173,
2219,
2271,
2301,
2335,
2364,
2394,
2416,
2441,
2458,
2486,
2524,
2566,
2618,
2648,
2676,
2705,
2733,
2771,
2804,
2823,
2848,
2873,
2892,
2915,
2936,
2957,
2980,
3003,
3024,
3046,
3067,
3104,
3105,
3162,
3186,
3208,
3232,
3256,
3281,
3307,
3331,
3354,
3380,
3404,
3429,
3453,
3477,
3500,
3525,
3549,
3571,
3595,
3613,
3673,
3694,
3717,
3754,
3775,
3798,
3837,
3858,
3881,
3920,
3941,
3964,
4001,
4022,
4045,
4083,
4104,
4127,
4164,
4188,
4236,
4249,
4299,
4378,
4390,
4450,
4463,
4486,
4514,
4566,
4588,
4636,
4688,
4741,
4789,
4842,
4848,
4871,
4892,
4914,
4964,
5007,
5047,
5125,
5146,
5224,
5230,
5302,
5308,
5352,
5392,
5449,
5470,
5527,
5533,
5577,
5583,
5627,
5661,
5752,
5848,
5881,
5929,
5956,
5986,
6013,
6065,
6106,
6134,
6184,
6221,
6290,
6320,
6349,
6362,
6375,
6406,
6460,
6517,
6530,
6587,
6600,
6630,
6661,
6674,
6687,
6719,
6752,
6765,
6778,
6811,
6865,
6878,
6891,
6897,
6903,
6917,
6931,
6966,
7003,
7018,
7046,
7106,
7168,
7228,
7292,
7354,
7426,
7490,
7548,
7606,
7672,
7732,
7885,
7914,
7998,
8068,
8136,
8202,
8282,
8356,
8430,
8490,
8550,
8714,
8743,
8823,
8889,
8947,
9011,
9075,
9135,
9211,
9285,
9420,
9449,
9525,
9591,
9661,
9733,
9807,
9879,
9947,
10078,
10107,
10167,
10231,
10295,
10355,
10417,
10477,
10562,
10591,
10665,
10743,
10821,
10895,
10971,
11045,
11111,
11253,
11269,
11302,
11341,
11354,
11404,
11465,
11545,
11552,
11602,
11610,
11635,
11660,
11688,
11711,
11738,
11755,
11761,
11777,
11798,
11836,
11860,
11898,
11904,
11963,
11975,
11996,
12020,
12044,
12066,
12090,
12114,
12138,
12160,
12329,
12510,
12662,
12810,
12912,
13071,
13126,
13195,
13243,
13267,
13292,
13323,
13421,
13469,
13511,
13557,
13607,
13629,
13677,
13725,
13799,
13856,
13874,
13922,
13963,
14007,
14055,
14107,
14157,
14205,
14267,
14339,
14357,
14410,
14464,
14482,
14547,
14621,
14680,
14730,
14771,
14804,
14858,
14894,
14955,
15032,
15089,
15133,
15198,
15236,
15281,
15383,
15478,
15525,
15604,
15689,
15769,
15817,
15844,
15869,
15898,
15967,
16028,
16049,
16099,
16105,
16150,
16188,
16206,
16271,
16345,
16380,
16430,
16471,
16531,
16614,
16649,
16666,
16671,
16728,
16786,
16841,
16863,
16916,
16960,
16984,
17030,
17054,
17113,
17129,
17150,
17172,
17242,
17248,
17318,
17337,
17430,
17504,
17584,
17632,
17647,
17707,
17768,
17827,
17877,
17918,
17987,
18059,
18101,
18217,
18353,
18409,
18467,
18511,
18551,
18592,
18669,
18764,
18809,
18890,
18989,
18995,
19048,
19102,
19145,
19197,
19255,
19322,
19403,
19430,
19478,
19503,
19521,
19544,
19579,
19627,
19642,
19712,
19783,
19863,
19911,
19926,
19996,
20067,
20147,
20197,
20202,
20232,
20263,
20284,
20311,
20384,
20458,
20538,
20586,
20592,
20661,
20731,
20811,
20859,
20865,
20931,
20983,
21064,
21114,
21123,
21150,
21183,
21283,
21313,
21370,
21424,
21430,
21463,
21499,
21596,
21697,
21703,
21747,
21839,
21942,
21948,
22040,
22143,
22172,
22222,
22228,
22284,
22342,
22422,
22463,
22496,
22550,
22586,
22636,
22680,
22745,
22789,
22834,
22936,
23031,
23078,
23157,
23242,
23322,
23372,
23397,
23453,
23510,
23516,
23583,
23659,
23677,
23742,
23816,
23851,
23852,
23890,
23985,
24046,
24071,
24122,
24154,
24231,
24260,
24295,
24325,
24367,
24435,
24502,
24531,
24570,
24591,
24638,
24698,
24712,
24722,
24727,
24795,
24816,
24828,
24876,
24925,
24953,
24998,
25060,
25081,
25106,
25146,
25161,
25194,
25243,
25273,
25338,
25358,
25382,
25412,
25424,
25504,
25511,
25557,
25628,
25690,
25723,
25771,
25842,
25843,
25852,
25859
],
"line_end_idx": [
42,
43,
56,
73,
91,
109,
117,
139,
147,
169,
178,
198,
206,
221,
222,
238,
253,
270,
287,
306,
325,
381,
406,
429,
448,
471,
518,
574,
610,
640,
670,
724,
766,
825,
853,
882,
915,
947,
969,
1003,
1020,
1045,
1084,
1128,
1184,
1219,
1249,
1276,
1314,
1351,
1381,
1400,
1424,
1446,
1468,
1489,
1508,
1529,
1552,
1575,
1596,
1618,
1639,
1676,
1677,
1693,
1709,
1727,
1743,
1763,
1781,
1846,
1874,
1900,
1916,
1938,
1979,
2029,
2064,
2092,
2123,
2173,
2219,
2271,
2301,
2335,
2364,
2394,
2416,
2441,
2458,
2486,
2524,
2566,
2618,
2648,
2676,
2705,
2733,
2771,
2804,
2823,
2848,
2873,
2892,
2915,
2936,
2957,
2980,
3003,
3024,
3046,
3067,
3104,
3105,
3162,
3186,
3208,
3232,
3256,
3281,
3307,
3331,
3354,
3380,
3404,
3429,
3453,
3477,
3500,
3525,
3549,
3571,
3595,
3613,
3673,
3694,
3717,
3754,
3775,
3798,
3837,
3858,
3881,
3920,
3941,
3964,
4001,
4022,
4045,
4083,
4104,
4127,
4164,
4188,
4236,
4249,
4299,
4378,
4390,
4450,
4463,
4486,
4514,
4566,
4588,
4636,
4688,
4741,
4789,
4842,
4848,
4871,
4892,
4914,
4964,
5007,
5047,
5125,
5146,
5224,
5230,
5302,
5308,
5352,
5392,
5449,
5470,
5527,
5533,
5577,
5583,
5627,
5661,
5752,
5848,
5881,
5929,
5956,
5986,
6013,
6065,
6106,
6134,
6184,
6221,
6290,
6320,
6349,
6362,
6375,
6406,
6460,
6517,
6530,
6587,
6600,
6630,
6661,
6674,
6687,
6719,
6752,
6765,
6778,
6811,
6865,
6878,
6891,
6897,
6903,
6917,
6931,
6966,
7003,
7018,
7046,
7106,
7168,
7228,
7292,
7354,
7426,
7490,
7548,
7606,
7672,
7732,
7885,
7914,
7998,
8068,
8136,
8202,
8282,
8356,
8430,
8490,
8550,
8714,
8743,
8823,
8889,
8947,
9011,
9075,
9135,
9211,
9285,
9420,
9449,
9525,
9591,
9661,
9733,
9807,
9879,
9947,
10078,
10107,
10167,
10231,
10295,
10355,
10417,
10477,
10562,
10591,
10665,
10743,
10821,
10895,
10971,
11045,
11111,
11253,
11269,
11302,
11341,
11354,
11404,
11465,
11545,
11552,
11602,
11610,
11635,
11660,
11688,
11711,
11738,
11755,
11761,
11777,
11798,
11836,
11860,
11898,
11904,
11963,
11975,
11996,
12020,
12044,
12066,
12090,
12114,
12138,
12160,
12329,
12510,
12662,
12810,
12912,
13071,
13126,
13195,
13243,
13267,
13292,
13323,
13421,
13469,
13511,
13557,
13607,
13629,
13677,
13725,
13799,
13856,
13874,
13922,
13963,
14007,
14055,
14107,
14157,
14205,
14267,
14339,
14357,
14410,
14464,
14482,
14547,
14621,
14680,
14730,
14771,
14804,
14858,
14894,
14955,
15032,
15089,
15133,
15198,
15236,
15281,
15383,
15478,
15525,
15604,
15689,
15769,
15817,
15844,
15869,
15898,
15967,
16028,
16049,
16099,
16105,
16150,
16188,
16206,
16271,
16345,
16380,
16430,
16471,
16531,
16614,
16649,
16666,
16671,
16728,
16786,
16841,
16863,
16916,
16960,
16984,
17030,
17054,
17113,
17129,
17150,
17172,
17242,
17248,
17318,
17337,
17430,
17504,
17584,
17632,
17647,
17707,
17768,
17827,
17877,
17918,
17987,
18059,
18101,
18217,
18353,
18409,
18467,
18511,
18551,
18592,
18669,
18764,
18809,
18890,
18989,
18995,
19048,
19102,
19145,
19197,
19255,
19322,
19403,
19430,
19478,
19503,
19521,
19544,
19579,
19627,
19642,
19712,
19783,
19863,
19911,
19926,
19996,
20067,
20147,
20197,
20202,
20232,
20263,
20284,
20311,
20384,
20458,
20538,
20586,
20592,
20661,
20731,
20811,
20859,
20865,
20931,
20983,
21064,
21114,
21123,
21150,
21183,
21283,
21313,
21370,
21424,
21430,
21463,
21499,
21596,
21697,
21703,
21747,
21839,
21942,
21948,
22040,
22143,
22172,
22222,
22228,
22284,
22342,
22422,
22463,
22496,
22550,
22586,
22636,
22680,
22745,
22789,
22834,
22936,
23031,
23078,
23157,
23242,
23322,
23372,
23397,
23453,
23510,
23516,
23583,
23659,
23677,
23742,
23816,
23851,
23852,
23890,
23985,
24046,
24071,
24122,
24154,
24231,
24260,
24295,
24325,
24367,
24435,
24502,
24531,
24570,
24591,
24638,
24698,
24712,
24722,
24727,
24795,
24816,
24828,
24876,
24925,
24953,
24998,
25060,
25081,
25106,
25146,
25161,
25194,
25243,
25273,
25338,
25358,
25382,
25412,
25424,
25504,
25511,
25557,
25628,
25690,
25723,
25771,
25842,
25843,
25852,
25859,
25863
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 25863,
"ccnet_original_nlines": 598,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07327180355787277,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005650780163705349,
"rps_doc_frac_lines_end_with_ellipsis": 0.011686139740049839,
"rps_doc_frac_no_alph_words": 0.5564136505126953,
"rps_doc_frac_unique_words": 0.2752729058265686,
"rps_doc_mean_word_length": 8.29283332824707,
"rps_doc_num_sentences": 176,
"rps_doc_symbol_to_word_ratio": 0.03503485023975372,
"rps_doc_unigram_entropy": 5.603548526763916,
"rps_doc_word_count": 2107,
"rps_doc_frac_chars_dupe_10grams": 0.12127281725406647,
"rps_doc_frac_chars_dupe_5grams": 0.2677273452281952,
"rps_doc_frac_chars_dupe_6grams": 0.21845132112503052,
"rps_doc_frac_chars_dupe_7grams": 0.1886911243200302,
"rps_doc_frac_chars_dupe_8grams": 0.15229210257530212,
"rps_doc_frac_chars_dupe_9grams": 0.14118926227092743,
"rps_doc_frac_chars_top_2gram": 0.03662794083356857,
"rps_doc_frac_chars_top_3gram": 0.013163169845938683,
"rps_doc_frac_chars_top_4gram": 0.013392089866101742,
"rps_doc_books_importance": -1930.26171875,
"rps_doc_books_importance_length_correction": -1930.26171875,
"rps_doc_openwebtext_importance": -1374.923095703125,
"rps_doc_openwebtext_importance_length_correction": -1374.923095703125,
"rps_doc_wikipedia_importance": -1119.2918701171875,
"rps_doc_wikipedia_importance_length_correction": -1119.2918701171875
},
"fasttext": {
"dclm": 0.9998838901519775,
"english": 0.4780537784099579,
"fineweb_edu_approx": 1.544625997543335,
"eai_general_math": 0.8293949961662292,
"eai_open_web_math": 0.6206725835800171,
"eai_web_code": 0.6588315367698669
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.12",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "22",
"label": "Truncated"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-3,450,081,446,147,264,500 | In Praise of Process: How Continuous Delivery Accelerates DevOps
Illuminated highway traffic at night
My productivity for any given day is determined by a three-step process. It may sound a bit odd, but hear me out. Every day I have to do the following (in this particular order): Fill my coffee cup. Put my headphones on. Listen to John Coltrane’s “Blue Train” in its entirety. You could call it […] | {
"url": "https://www.27global.com/blog/tag/continuous-delivery/",
"source_domain": "www.27global.com",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "70589",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y3JIVONUHBUFBZYQBSKDEDVTFDPO5WQ6",
"WARC-Concurrent-To": "<urn:uuid:68851f2a-f956-4962-9b45-7bbc3f039e2c>",
"WARC-Date": "2024-07-20T19:51:53Z",
"WARC-IP-Address": "141.193.213.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TFIQH2CYACPO2FMIRE4X2O5X6ULCJYLY",
"WARC-Record-ID": "<urn:uuid:5efce9a1-01ee-47a5-9c00-1462d8cb1e8b>",
"WARC-Target-URI": "https://www.27global.com/blog/tag/continuous-delivery/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:69089ce7-3f80-4445-aed3-920b519f0e8e>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-110\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
65,
66,
103,
104
],
"line_end_idx": [
65,
66,
103,
104,
402
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 402,
"ccnet_original_nlines": 4,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.364705890417099,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0117647098377347,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16470588743686676,
"rps_doc_frac_unique_words": 0.8714285492897034,
"rps_doc_mean_word_length": 4.5428571701049805,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0.0117647098377347,
"rps_doc_unigram_entropy": 4.055307388305664,
"rps_doc_word_count": 70,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -34.61697006225586,
"rps_doc_books_importance_length_correction": -34.61697006225586,
"rps_doc_openwebtext_importance": -24.33934211730957,
"rps_doc_openwebtext_importance_length_correction": -24.33934211730957,
"rps_doc_wikipedia_importance": -22.94683265686035,
"rps_doc_wikipedia_importance_length_correction": -22.94683265686035
},
"fasttext": {
"dclm": 0.03550500050187111,
"english": 0.9348072409629822,
"fineweb_edu_approx": 0.9451164603233337,
"eai_general_math": 0.13778400421142578,
"eai_open_web_math": 0.12423312664031982,
"eai_web_code": 0.0011040599783882499
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.403",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-180,604,427,971,000,030 | Sign up ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free.
Whilst trying to get our app working in Firefox (I'm a big proponent of X-Browser support but our lead dev is resisting me saying IE is good enough). So I'm doing a little side project to see how much work it is to convert.
I've hit a problem straight away.
The main.aspx page binds to a webservice using the IE only method of adding behaviour through a htc file, which is auto-generated by VS I beleive.
Firefox doesn't support this but there is an xml bindings file which can be used to enable htc support (see here: http://dean.edwards.name/moz-behaviors/overview/). The examples work in FF3 but when I use my webservice.htc as I normally would e.g.:
//Main.aspx
/*SNIP*/
<style type="text/css" media="all">
#webservice
{
behavior:url(webservice.htc);
-moz-binding:url(bindings.xml#webservice.htc);
}
</style>
</head>
<body>
<div id="webservice"></div> <!-- we use this div to load the webservice stuff -->
/*SNIP*/
//Main.js
webservice.useService(url + asmpath + "/WebServiceWrapper.asmx?WSDL","WebServiceWrapper");
I get webservice is not defined (works fine in IE), I obviously tried
var webservice = document.getElementById("webservice")
and
$("#webservice").useService(url + asmpath + "/WebServiceWrapper.asmx?WSDL","WebServiceWrapper");
as well which just gives me "useService is not defined" in Firebug. Which leads me to beleive that the binding is not working. However I can see that webservice.htc is being loaded by Firefox in the Firebug console window.
Anyone got any experience of this?
Am I going to have to rewrite how the webservice is called?
Cheers, Rob
share|improve this question
2 Answers 2
up vote 2 down vote accepted
I don't think that you are on the right way for achieving real cross-browser compatibility. Adding support for IE-specific features for Firefox is definitely not the way to go. What about Opera, Safari, Chrome...? If the app you're working on is used strictly on the intranet then supporting Firefox may be enough however...
IMHO, the code should be refactored, but in an other way. If you are working with ASP.NET 2.0 (in this case you'd need ASP.NET Ajax) or newer, you can create proxy between Ajax and SOAP web services. In that case you would need to rewrite all your behaviors as a JavaScript code which may not be a small feat.
On a side note: AFAIK VS.NET does not generate behaviors.
Sorry if this is not too helpful :(
share|improve this answer
Your jQuery snippet has an error: since useService is a method defined on the node itself, not the jQuery object, you'd have to do:
$("#webservice")[0].useService(url + asmpath +
"/WebServiceWrapper.asmx?WSDL","WebServiceWrapper");
share|improve this answer
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "http://stackoverflow.com/questions/253360/webservice-htc-moz-behaviors-and-firefox-3",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-40",
"warc_metadata": {
"Content-Length": "80705",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2RNUBRXHGW5VVDV675RHMXI6WYWXLBAD",
"WARC-Concurrent-To": "<urn:uuid:f64e6c2a-0c90-4c47-a37e-e674c45499c0>",
"WARC-Date": "2015-10-04T09:54:05Z",
"WARC-IP-Address": "104.16.103.85",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LQD6GTSOGYSJQBXT2Q7VDMI3GEBKZFXZ",
"WARC-Record-ID": "<urn:uuid:0876f5cd-21a1-47af-bf39-54e5e7fab951>",
"WARC-Target-URI": "http://stackoverflow.com/questions/253360/webservice-htc-moz-behaviors-and-firefox-3",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cae049f9-dc3e-4d33-ae34-f98ef47a8340>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-137-6-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-40\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for September 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
10,
116,
117,
341,
342,
376,
377,
524,
525,
774,
775,
787,
796,
832,
848,
854,
892,
947,
953,
962,
970,
977,
1059,
1068,
1069,
1079,
1170,
1171,
1241,
1242,
1297,
1298,
1302,
1303,
1400,
1401,
1624,
1625,
1660,
1661,
1721,
1722,
1734,
1735,
1763,
1764,
1776,
1777,
1806,
1807,
2132,
2133,
2443,
2444,
2502,
2503,
2539,
2540,
2566,
2567,
2699,
2700,
2747,
2802,
2828,
2829,
2841,
2842,
2844,
2852,
2853,
2931,
2932
],
"line_end_idx": [
10,
116,
117,
341,
342,
376,
377,
524,
525,
774,
775,
787,
796,
832,
848,
854,
892,
947,
953,
962,
970,
977,
1059,
1068,
1069,
1079,
1170,
1171,
1241,
1242,
1297,
1298,
1302,
1303,
1400,
1401,
1624,
1625,
1660,
1661,
1721,
1722,
1734,
1735,
1763,
1764,
1776,
1777,
1806,
1807,
2132,
2133,
2443,
2444,
2502,
2503,
2539,
2540,
2566,
2567,
2699,
2700,
2747,
2802,
2828,
2829,
2841,
2842,
2844,
2852,
2853,
2931,
2932,
3022
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3022,
"ccnet_original_nlines": 73,
"rps_doc_curly_bracket": 0.00066180998692289,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34487950801849365,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.048192769289016724,
"rps_doc_frac_lines_end_with_ellipsis": 0.01351351011544466,
"rps_doc_frac_no_alph_words": 0.24397589266300201,
"rps_doc_frac_unique_words": 0.5348314642906189,
"rps_doc_mean_word_length": 5.143820285797119,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0.009036139585077763,
"rps_doc_unigram_entropy": 5.132235050201416,
"rps_doc_word_count": 445,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.008737440221011639,
"rps_doc_frac_chars_top_3gram": 0.0629095733165741,
"rps_doc_frac_chars_top_4gram": 0.022717339918017387,
"rps_doc_books_importance": -308.30767822265625,
"rps_doc_books_importance_length_correction": -308.30767822265625,
"rps_doc_openwebtext_importance": -165.73475646972656,
"rps_doc_openwebtext_importance_length_correction": -165.73475646972656,
"rps_doc_wikipedia_importance": -166.15109252929688,
"rps_doc_wikipedia_importance_length_correction": -166.15109252929688
},
"fasttext": {
"dclm": 0.18351513147354126,
"english": 0.8824456334114075,
"fineweb_edu_approx": 1.2839552164077759,
"eai_general_math": 0.002445880090817809,
"eai_open_web_math": 0.2141081690788269,
"eai_web_code": 0.0006405700114555657
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
4,643,111,734,629,131,000 | [TO]What's the big deal with EJB? [Re: PEP scepticism]
Nicola Musatti objectway at divalsim.it
Fri Jul 6 16:00:45 CEST 2001
Ciao, Alex.
Alex Martelli wrote:
[...]
> Haven't done *identical* projects in C++ and Python yet, except
> for Python extensions prototyped in Python then coded with Boost
> Python, and for those (small extensions) it seems I'm about 4
> times more productive in Python than in C++. I have no personal
> experience doing the same task in Python and Java, yet.
How do you measure your productivity?
Cheers,
Nicola
More information about the Python-list mailing list | {
"url": "https://mail.python.org/pipermail/python-list/2001-July/103453.html",
"source_domain": "mail.python.org",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "3512",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:37VJUZWQBPX7K75UY2B2NBINRYGWY7Q3",
"WARC-Concurrent-To": "<urn:uuid:2e85529e-7a66-4e38-a518-1f591229a78a>",
"WARC-Date": "2019-08-21T18:29:55Z",
"WARC-IP-Address": "188.166.95.178",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VAYL3FZIWRWSBZKRJMHBKGSSOYQBBLT2",
"WARC-Record-ID": "<urn:uuid:7e8e38c4-31cd-474b-8f83-9d062f06815e>",
"WARC-Target-URI": "https://mail.python.org/pipermail/python-list/2001-July/103453.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4611b4aa-f17c-4b49-90ea-90fd1b9a86b1>"
},
"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 ([email protected])\r\nhostname: ip-10-67-67-36.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
55,
56,
96,
125,
126,
127,
139,
140,
161,
167,
233,
300,
364,
431,
489,
490,
528,
529,
537,
544,
545,
546,
547
],
"line_end_idx": [
55,
56,
96,
125,
126,
127,
139,
140,
161,
167,
233,
300,
364,
431,
489,
490,
528,
529,
537,
544,
545,
546,
547,
598
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 598,
"ccnet_original_nlines": 23,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2888889014720917,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05925925821065903,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.29629629850387573,
"rps_doc_frac_unique_words": 0.7634408473968506,
"rps_doc_mean_word_length": 4.8279571533203125,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0.007407410070300102,
"rps_doc_unigram_entropy": 4.125437259674072,
"rps_doc_word_count": 93,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05345211923122406,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -43.172489166259766,
"rps_doc_books_importance_length_correction": -57.018802642822266,
"rps_doc_openwebtext_importance": -29.137392044067383,
"rps_doc_openwebtext_importance_length_correction": -42.983707427978516,
"rps_doc_wikipedia_importance": -19.120271682739258,
"rps_doc_wikipedia_importance_length_correction": -32.96658706665039
},
"fasttext": {
"dclm": 0.06981855630874634,
"english": 0.8887698650360107,
"fineweb_edu_approx": 1.137503981590271,
"eai_general_math": 0.005934949964284897,
"eai_open_web_math": 0.0718265175819397,
"eai_web_code": 0.0002585100010037422
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.136",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-8,052,393,704,192,569,000 | lkml.org
[lkml] [2012] [Feb] [5] [last100] RSS Feed
Views: [wrap][no wrap] [headers] [forward]
Messages in this thread
/
Date
From
SubjectRe: [PATCH, v2] checkpatch: Warn on code with 6+ tab indentation, remove 80col warning
* Joe Perches <[email protected]> wrote:
> + $line =~ /^\+\s*"[^"]*"\s*(?:\s*|,|\)\s*;)\s*$/) {
> + if ($length > $max_line_len_strict) {
> + CHK("LONG_LINE",
> + "line over $max_line_len_strict characters\n" . $herecurr);
> + }
> + if ($length > $max_line_len_warn) {
> + WARN("LONG_LINE",
> + "line over $max_line_len_warn characters\n" . $herecurr);
> + }
In practice patch submitters take warnings just as seriously.
If it is emitted by the default checkpatch run, it's acted
upon. That is the human behavior that is a given.
If warnings are often crap and should not be acted upon then
frankly, don't emit them by default.
I don't care *how* that warning is removed - whether it's
removed from checkpatch or just hidden from the default view -
but it needs to be removed or people like Pekka (or me) stop
using it.
Thanks,
Ingo
\
\ /
Last update: 2012-02-05 12:41 [W:0.128 / U:6.068 seconds]
©2003-2017 Jasper Spaans. hosted at Digital OceanAdvertise on this site
| {
"url": "http://lkml.org/lkml/2012/2/5/83",
"source_domain": "lkml.org",
"snapshot_id": "crawl=CC-MAIN-2017-30",
"warc_metadata": {
"Content-Length": "7666",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RCOEKVHO22OGOULVFQEFF7B6DRUJR7JK",
"WARC-Concurrent-To": "<urn:uuid:095dea17-97fc-4663-8b91-948dc4f5ce00>",
"WARC-Date": "2017-07-23T03:12:17Z",
"WARC-IP-Address": "104.24.100.12",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:7IBR6VRTSSZRSUWTUH6ONY6KB4QORP45",
"WARC-Record-ID": "<urn:uuid:2e8cb57b-0499-442e-bb00-84b073f152c9>",
"WARC-Target-URI": "http://lkml.org/lkml/2012/2/5/83",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d232cbd8-9d89-4d8b-af54-797492558add>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-99-90.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
10,
63,
110,
112,
136,
138,
143,
148,
242,
243,
282,
283,
338,
380,
401,
465,
471,
511,
533,
595,
601,
602,
664,
723,
773,
774,
835,
872,
873,
931,
994,
1055,
1065,
1066,
1074,
1075,
1080,
1081,
1082,
1084,
1086,
1091,
1154,
1226
],
"line_end_idx": [
10,
63,
110,
112,
136,
138,
143,
148,
242,
243,
282,
283,
338,
380,
401,
465,
471,
511,
533,
595,
601,
602,
664,
723,
773,
774,
835,
872,
873,
931,
994,
1055,
1065,
1066,
1074,
1075,
1080,
1081,
1082,
1084,
1086,
1091,
1154,
1226,
1227
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1227,
"ccnet_original_nlines": 44,
"rps_doc_curly_bracket": 0.004074980039149523,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23051947355270386,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029220780357718468,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.45129871368408203,
"rps_doc_frac_unique_words": 0.7295597791671753,
"rps_doc_mean_word_length": 5.163522243499756,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.646938800811768,
"rps_doc_word_count": 159,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01948842965066433,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -142.10894775390625,
"rps_doc_books_importance_length_correction": -142.10894775390625,
"rps_doc_openwebtext_importance": -78.4300537109375,
"rps_doc_openwebtext_importance_length_correction": -78.4300308227539,
"rps_doc_wikipedia_importance": -56.81619644165039,
"rps_doc_wikipedia_importance_length_correction": -56.81619644165039
},
"fasttext": {
"dclm": 0.09423022717237473,
"english": 0.7509233951568604,
"fineweb_edu_approx": 1.8381657600402832,
"eai_general_math": 0.0001980700035346672,
"eai_open_web_math": 0.3088957667350769,
"eai_web_code": -6.000000212225132e-7
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-9,158,236,618,367,844,000 | INTERVALO.CONFIANZA (CONFIDENCE)
Calcula el ancho del intervalo de confianza para la media de una población con distribución normal.
Ejemplo de uso
INTERVALO.CONFIANZA(0,05;1;6;250)
INTERVALO.CONFIANZA(A2;A3;A4)
Sintaxis
INTERVALO.CONFIANZA(alfa; desviación_estándar; tamaño_pob)
• alfa: equivale a uno menos el nivel de confianza deseado. Por ejemplo, 0,1 si la confianza es de 0,9, es decir, del 90 %.
• desviación_estándar: desviación estándar de la población.
• tamaño_pob: tamaño de la población.
Notas
• INTERVALO.CONFIANZA calcula el ancho de la mitad del intervalo de confianza de modo que un valor elegido de forma aleatoria del conjunto de datos tenga una probabilidad igual a 1-alfa de encontrarse en la media más o menos el resultado de INTERVALO.CONFIANZA.
• Puedes ejecutar esta función con INTERVALO.CONFIANZA o INTERVALO.CONFIANZA.NORM
Consulta también
PRUEBA.Z: Ofrece el valor P bilateral de una prueba Z con una distribución estándar.
Ejemplos
¿Te ha resultado útil esta información?
¿Cómo podemos mejorar esta página? | {
"url": "https://support.google.com/docs/answer/3093988?hl=es",
"source_domain": "support.google.com",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "651137",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZN6D323MDEWQ6SUDFE2HG6PL2IXVYKIC",
"WARC-Concurrent-To": "<urn:uuid:ca17c0da-82e7-428c-a1ad-826aa0593673>",
"WARC-Date": "2020-09-22T12:28:46Z",
"WARC-IP-Address": "172.217.9.206",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MJNVHHD3K4FR4KVGP7Y24HFRTLENOZSH",
"WARC-Record-ID": "<urn:uuid:25066250-0dba-46c4-b216-03b1813b48f0>",
"WARC-Target-URI": "https://support.google.com/docs/answer/3093988?hl=es",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:db83415d-e67a-40c3-b507-b4431c861cda>"
},
"warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-112.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
33,
34,
134,
135,
150,
151,
185,
186,
216,
217,
226,
227,
286,
287,
413,
414,
476,
477,
517,
518,
524,
525,
789,
873,
874,
891,
892,
977,
978,
987,
988,
1028
],
"line_end_idx": [
33,
34,
134,
135,
150,
151,
185,
186,
216,
217,
226,
227,
286,
287,
413,
414,
476,
477,
517,
518,
524,
525,
789,
873,
874,
891,
892,
977,
978,
987,
988,
1028,
1062
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1062,
"ccnet_original_nlines": 32,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.028037380427122116,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.11682242900133133,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.29439252614974976,
"rps_doc_frac_unique_words": 0.5862069129943848,
"rps_doc_mean_word_length": 5.958620548248291,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.146883010864258,
"rps_doc_word_count": 145,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.038194440305233,
"rps_doc_frac_chars_top_3gram": 0.03240741044282913,
"rps_doc_frac_chars_top_4gram": 0.053240738809108734,
"rps_doc_books_importance": -85.62860107421875,
"rps_doc_books_importance_length_correction": -85.62860107421875,
"rps_doc_openwebtext_importance": -54.814884185791016,
"rps_doc_openwebtext_importance_length_correction": -42.88872146606445,
"rps_doc_wikipedia_importance": -43.15059280395508,
"rps_doc_wikipedia_importance_length_correction": -43.15059280395508
},
"fasttext": {
"dclm": 0.1661427617073059,
"english": 0.0006815000087954104,
"fineweb_edu_approx": 1.0843479633331299,
"eai_general_math": 0.00006818999827373773,
"eai_open_web_math": 0.8964536786079407,
"eai_web_code": 0.6040090322494507
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
2,007,526,725,136,291,300 | Intermediate Certificate Chains
Context: The Wormly SSL Tester verifies whether a server has correctly installed all necessary intermediate certificates.
One of the features of the SSL certificate ecosystem is that the authority to sign certificates can be delegated down a chain.
Let’s use our domain name - www.wormly.com - as an example. Our certificate was issued by a certificate authority (CA) named “RapidSSL”.
However this authority is most likely not explicitly trusted by your browser or operating system.
RapidSSL utilizes a certificate signing key which is in turn certified by “GeoTrust Global”.
Because your browser or OS does explicitly trust GeoTrust Global, who in turn trusts RapidSSL, the end result is that you implicitly trust RapidSSL, and their assertion that we legitimately control the domain www.wormly.com.
The caveat is that our server must present to you both the www.wormly.com certificate (signed by RapidSSL), and also present RapidSSL's certificate (signed by GeoTrust Global) when a connection is established.
This is described as including the intermediate certificate(s).
If you fail to include the intermediate certificates, then the end user is presented with a certificate signed by a CA which they do not explicitly trust.
If the Wormly SSL Tester indicates that your certificate is not trusted, this is most likely the reason why.
But my browser accepts the certificate!
Indeed it does, but why? Most modern browsers will, when faced with a non-trusted certificate, examine the certificate for an extension named “Authority Information”. This extension will usually contain a URL to the missing intermediate certificate. The browser then fetches this certificate, and if it is trusted (i.e. signed by a trusted CA) the browser will be satisfied that it can trust your certificate as per the chaining process described above.
You should not rely on this behavior, most significantly because it substantially increases the length of time taken to establish the initial connection to your server - consider the time taken to make another HTTP request to retrieve the intermediate certificate from a 3rd party server.
Additionally, this behavior cannot be relied on to exist across all platforms that your users might utilize.
So be sure to install all necessary intermediate certificates on your web server! For the Apache HTTP server, the relevant configuration directive is:
SSLCACertificateFile /path/to/your/certificate_chain.pem
Downtime Hurts. Start monitoring and stop worrying.
Our monitoring service continually tests your servers & web sites to keep you online and performing fast. Fully-featured plans start from just $39 / month.
But don't listen to our spiel - Decide for yourself with a free trial » | {
"url": "https://www.wormly.com/help/ssl-tests/intermediate-cert-chain",
"source_domain": "www.wormly.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "11110",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LXJSFVLGTL6ZY7IONYE7J4VNB3TKW5D4",
"WARC-Concurrent-To": "<urn:uuid:057b7b94-be25-4454-b359-48b8ea3300e5>",
"WARC-Date": "2021-10-26T00:02:28Z",
"WARC-IP-Address": "54.204.242.48",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GG65DQ4V34T5PGKSRPFT7E2UCDP24SIR",
"WARC-Record-ID": "<urn:uuid:427b6c84-70b3-4634-bdb9-ba5972798fd5>",
"WARC-Target-URI": "https://www.wormly.com/help/ssl-tests/intermediate-cert-chain",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1bf8df22-9f2e-4aaf-bc1b-768faff47bbe>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-175\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
32,
33,
155,
156,
283,
284,
421,
422,
520,
521,
614,
615,
840,
841,
1051,
1052,
1116,
1117,
1272,
1273,
1382,
1383,
1423,
1424,
1878,
1879,
2168,
2169,
2278,
2279,
2430,
2431,
2488,
2489,
2541,
2542,
2698,
2699
],
"line_end_idx": [
32,
33,
155,
156,
283,
284,
421,
422,
520,
521,
614,
615,
840,
841,
1051,
1052,
1116,
1117,
1272,
1273,
1382,
1383,
1423,
1424,
1878,
1879,
2168,
2169,
2278,
2279,
2430,
2431,
2488,
2489,
2541,
2542,
2698,
2699,
2770
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2770,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4055117964744568,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019685039296746254,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14960630238056183,
"rps_doc_frac_unique_words": 0.4916067123413086,
"rps_doc_mean_word_length": 5.410071849822998,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.902961254119873,
"rps_doc_word_count": 417,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.042553190141916275,
"rps_doc_frac_chars_top_3gram": 0.02526596002280712,
"rps_doc_frac_chars_top_4gram": 0.01595745049417019,
"rps_doc_books_importance": -211.25424194335938,
"rps_doc_books_importance_length_correction": -211.25424194335938,
"rps_doc_openwebtext_importance": -123.98368072509766,
"rps_doc_openwebtext_importance_length_correction": -123.98368072509766,
"rps_doc_wikipedia_importance": -108.4245834350586,
"rps_doc_wikipedia_importance_length_correction": -108.4245834350586
},
"fasttext": {
"dclm": 0.12700796127319336,
"english": 0.9256239533424377,
"fineweb_edu_approx": 1.9491764307022095,
"eai_general_math": 0.35391032695770264,
"eai_open_web_math": 0.23435968160629272,
"eai_web_code": 0.6378902196884155
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
8,897,734,813,039,193,000 | back to article Sweet murmuring Siri opens stalker vulnerability hole in iOS 7
It has not been a good week for Apple on the security front, and there's no relief in sight after an Israeli researcher found a way to access a locked iPhone's contacts and messages database using Siri. In a YouTube video, Dany Lisiansky showed how a locked phone running iOS 7.0.2 can be opened by using Siri's voice control …
COMMENTS
This topic is closed for new posts.
Anonymous Coward
Why would you even
Have that as an option?!
'so, everyone is agreed. Our default position will be no opening the prison gates. But anyone outside is free to talk to the Inmates'.
3
0
Anonymous Coward
Apple users showed one possible way around this – using their nipples instead – but that's unlikely to take off for most users.
Disappointed.. hey if you saw the lasses where I work.
1
0
Silver badge
Coat
@ obnoxiousGit
I don't know if I'm disappointed about this. I'm not sure I'm ready for fishnet T-shirts to become standard office wear, even on casual Fridays.
Mines the one with the.....well, you'd rather not know.
2
0
Anonymous Coward
poorly designed OS creaking at the seams
Every week a new iOS security problem. An OS that's creaking at the seams. As Android marches forward, Apple hack more things in, in a lame attempt at keeping up.
8
11
Anonymous Coward
Re: poorly designed OS creaking at the seams
" As Android marches forward"
Are you perhaps suggesting that Android is secure? If so, excuse me whilst I smirk.
Smirk.
14
6
Silver badge
Re: poorly designed OS creaking at the seams
Are you actually reading the stories?
Here's what users want a phone to do: (i) lock itself if left unattended; and (ii) be usable hands free, such as in cars.
The 'security' problems with iOS are nothing to do with the technical underpinnings. They're the direct result of the inherent conflict of those two goals. There's no hint of creaking internals whatsoever.
3
6
Re: poorly designed OS creaking at the seams
"(i) lock itself if left unattended; and (ii) be usable hands free, such as in cars."
Why do you think there is an inherent contradiction between these two goals? How difficult is it to disable automatic locking when the phone is paired with a bluetooth device such as a hands-free kit in your car (where I live it is illegal to use a mobile while driving without such kit, which is a good idea, IMHO)? There is an app for Android, at least, that does it. It should be built-in, not an add-on, and I would very much like an option to only do it when paired with one of the specific devices that I could configure, but it is usable even without these enhancements. When get into my car I switch BT on, and the screen lock is disabled.
My Android phone actually has a "driving mode", but its functionality is basically useless, e.g., disabling screen lock is not a part of it. The mode is not simple to switch on/off - it is hidden behind several menu levels. There is no reason, however, why proper design should not let a user tell the phone, "I am driving now, change the settings/profile accordingly: switch bluetooth on, disable screen lock, read out arriving text messages, etc." More generally, switching between "profiles" (switch BT on while driving, switch Wi-Fi on when at work, etc.) would be useful as a design feature.
Both iOS and Android are very poorly designed, IMHO (I have yet to see WP in the wild, so no comment). They are designed without any thought devoted to what the phone should do as a system. Rather, the mindset is, "someone will write an app for that". Obviously, the various apps do not work (together?) very well, which renders "creaking at the seams" a reasonable opinion. Your example of 2 conflicting requirements is perfectly valid, but the conflict is not "inherent" - it is due to lousy design. (In particular, using the phone while driving is not designed in at all - that would require, among other things, calendar and contacts and dialer and maps and GPS to be integrated into a single system, in addition to "profiles").
1
0
Re: poorly designed OS creaking at the seams
if you have the nokia car kit with a compatible windows phone, will pair via BT (like a normal phone) and NFC automatically toggles the phones car mode when you place the phone in the holder - oh, it also charges wirelessly too while there!
Car mode changes the ring profile and also replaces the normal start screen with a few giant buttons to operate a cut down UI with favourites based addressbook, navigation and music....
0
0
Silver badge
Re: poorly designed OS creaking at the seams (@TFM)
If the phone doesn't lock when paired with a hands-free device then the phone of anyone with a bluetooth headset is permanently unlocked. So as soon as one of those people leaves their phone on the bus, on their desk, is pick-pocketed, etc, the story would be that a security vulnerability had allowed their contacts/email/the rest to be accessed.
I also think Siri is Apple's attempt to integrate calendar, dialler, maps, GPS, etc. I'm don't think it's a good implementation but it's an attempt, at least.
Regardless, answer this: are there — as the poster suggests — any grounds whatsoever to conclude that because one of the supplied, first-party applications displays information when we as users wouldn't want it to, the operating system must be "creaking at the seams"?
0
0
Silver badge
Facepalm
Siri.....find...Chinese...restaurant....
(Siri voice) confirmed, all contacts broadcast to China....
Siri!...No!!
(Siri) Correct, all contact sent now.....
Argh!! Siri, WHY???!!!
(Siri) Because all your contacts R belong to me.......
4
0
Re: Siri.....find...Chinese...restaurant....
That's really the best you can do? The original has "are belong to us." If you just changed the casing from "us" to "US", you'd have a much more apt line of text. It could be improved in other areas too, but this is a glaring point.
2
0
Wait... if you have to unlock the phone, surely you're already going to be able to access contacts anyway?
1
4
I just love apple security flaws.
But don't you have to be connected to wifi to use facetime? (i could be wrong but i was under the impression that it usually asks you to connect to wifi) Going off the basis that you need wifi, for someone to dupe you in this way they would have to steal your phone from home or work and perform this task on site... Seems a bit mission impossible to me. But then again office pranks are fun.
0
0
Silver badge
Re: I just love apple security flaws.
No — that was true across the board when the feature launched but Apple lets the individual carriers dictate it. E.g. AT&T announced in May that they'd be allowing access by the end of the year (source: http://www.theverge.com/2013/5/20/4348672/att-will-allow-all-video-chat-apps-on-its-network-by-end-of-2013 ) and various individuals started reporting access somewhere around mid-June. I've no idea if it's nationwide yet but if it isn't then it will be soon. Other networks no doubt have similar plans.
0
0
Silver badge
This is a lot like the hole they just plugged for the lockscreen
It seems Apple needs to add a global variable "screenlocked" to iOS and check it in a few more places or something. People are obviously checking every possible permutation to get from the lockscreen into the phone, and rather than plugging up each combination one by one, I hope they take the time to make a proper fix that addresses them all rather than see another one pop up after 7.0.3 is released to fix this one on Friday...
0
0
Anonymous Coward
Re: This is a lot like the hole they just plugged for the lockscreen
Well, you're saying two things. First you describe the implementation they seem to have now--a global variable, or whatever, that gets checked a bunch of places, and sometimes not in the places where it should be. And then you say they should make a proper fix.
I think the proper fix is probably to have some kind of watchdog process running if the screen is locked and checking to see if anything is going on that isn't allowed, i.e., have a small list of activities that are allowed, and start killing processes if they aren't on the whitelist.
1
0
Anonymous Coward
Re: start killing processes if they aren't on the whitelist.
Wow, Apple are so stupid. They should have asked the anonymous internet users how to design their OS. What could possibly go wrong?
1
0
Photos too
Watching the video he was able to attach a photo to the message he was going to send. That means being able to browse the photos on the device too.
3
0
Silver badge
Erm, to use the vernacular of my own wife:
"Uhhh, Duhha!"
As I trained her partially to information security, need one say more?
Since nobody has managed to yet hack, phish or otherwise pilfer her data and accounts?
0
0
Silver badge
need one say more?
Not until one learns how to construct a coherent post, no.
1
0
FAIL
This was identified 2 years ago when the 4s / siri was launched
http://www.theage.com.au/it-pro/security-it/iphone-4s-security-hole-uncovered-20111019-1m6xt.html
Nice to see they did f'all about it other than the expand the crack
0
0
I am Shocked! Shocked! that Siri will take instructions from any voice instead of just the owner .....
0
0
Here is an idea...
Dont use Siri - its fucking hopeless anyway, works fine in the house when there is no noise and i have my hands available anyway, get in to a place where you really need to use it in anger and the conditions are not perfect, not a chance in hell. I try it for a week, its now disabled never to be heard from again.
1
0
Meh
not quite as bad as it seems
firstly, to get Siri to call someone, you need to know that the person you are trying to call is stored in the contacts. Yeah, i suppose you could try "siri, call Mum" but you can't guarentee that will work.
secondly, the number you're calling from step one, has to have facetime available, so either another iOS device, or a Mac.
Lastly, you need access to that other device to be able to end / cancel the facetime call.
So, yeah, while possible, not exactly plausable. It's not like i can walk through an office, grab someones iPhone off their desk, and use this to get access to their phone / contacts.
0
0
Anonymous Coward
Is it April already?
The instructions for this 'exploit' include "4. Unlock the iPhone.". If you can do that, what's the point of all the Siri/facetime voodoo nonsense?
0
0
This topic is closed for new posts.
Forums
Biting the hand that feeds IT © 1998–2017 | {
"url": "https://forums.theregister.co.uk/forum/1/2013/09/30/sweettalking_siri_opens_stalking_security_hole_in_ios_7/",
"source_domain": "forums.theregister.co.uk",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "99321",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JX3IJAYKA4V7HQEFH4QNBLGAN7QT5CPZ",
"WARC-Concurrent-To": "<urn:uuid:6d3d9e05-9458-4f17-ad73-997baed73959>",
"WARC-Date": "2017-05-23T05:18:45Z",
"WARC-IP-Address": "104.20.251.41",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WVSVSFLGJSQZM4QMMULCC27CYNUMXP7E",
"WARC-Record-ID": "<urn:uuid:0163c75f-97e0-45bf-a4dc-007fb44e1b8d>",
"WARC-Target-URI": "https://forums.theregister.co.uk/forum/1/2013/09/30/sweettalking_siri_opens_stalking_security_hole_in_ios_7/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f6f313f0-d323-4019-b60e-78267a35eec3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-224-210.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
79,
80,
408,
409,
418,
419,
455,
472,
473,
492,
493,
518,
519,
654,
655,
657,
659,
676,
677,
805,
806,
861,
862,
864,
866,
879,
884,
885,
900,
901,
1046,
1047,
1103,
1104,
1106,
1108,
1125,
1126,
1167,
1168,
1331,
1332,
1334,
1337,
1354,
1355,
1400,
1401,
1431,
1432,
1516,
1517,
1524,
1525,
1528,
1530,
1543,
1544,
1589,
1590,
1628,
1629,
1751,
1752,
1958,
1959,
1961,
1963,
1964,
2009,
2010,
2096,
2097,
2745,
2746,
3343,
3344,
4077,
4078,
4080,
4082,
4083,
4128,
4129,
4370,
4371,
4557,
4558,
4560,
4562,
4575,
4576,
4628,
4629,
4977,
4978,
5137,
5138,
5407,
5408,
5410,
5412,
5425,
5434,
5435,
5476,
5477,
5537,
5538,
5551,
5552,
5594,
5595,
5618,
5619,
5674,
5675,
5677,
5679,
5680,
5725,
5726,
5959,
5960,
5962,
5964,
5965,
6072,
6073,
6075,
6077,
6078,
6112,
6113,
6506,
6507,
6509,
6511,
6524,
6525,
6563,
6564,
7070,
7071,
7073,
7075,
7088,
7089,
7154,
7155,
7587,
7588,
7590,
7592,
7609,
7610,
7679,
7680,
7942,
7943,
8229,
8230,
8232,
8234,
8251,
8252,
8313,
8314,
8446,
8447,
8449,
8451,
8452,
8463,
8464,
8612,
8613,
8615,
8617,
8630,
8631,
8674,
8675,
8690,
8691,
8762,
8763,
8850,
8851,
8853,
8855,
8868,
8869,
8888,
8889,
8948,
8949,
8951,
8953,
8958,
8959,
9023,
9024,
9122,
9123,
9191,
9192,
9194,
9196,
9197,
9300,
9301,
9303,
9305,
9306,
9325,
9326,
9641,
9642,
9644,
9646,
9650,
9651,
9680,
9681,
9889,
9890,
10013,
10014,
10105,
10106,
10290,
10291,
10293,
10295,
10312,
10313,
10334,
10335,
10483,
10484,
10486,
10488,
10524,
10525,
10532,
10533
],
"line_end_idx": [
79,
80,
408,
409,
418,
419,
455,
472,
473,
492,
493,
518,
519,
654,
655,
657,
659,
676,
677,
805,
806,
861,
862,
864,
866,
879,
884,
885,
900,
901,
1046,
1047,
1103,
1104,
1106,
1108,
1125,
1126,
1167,
1168,
1331,
1332,
1334,
1337,
1354,
1355,
1400,
1401,
1431,
1432,
1516,
1517,
1524,
1525,
1528,
1530,
1543,
1544,
1589,
1590,
1628,
1629,
1751,
1752,
1958,
1959,
1961,
1963,
1964,
2009,
2010,
2096,
2097,
2745,
2746,
3343,
3344,
4077,
4078,
4080,
4082,
4083,
4128,
4129,
4370,
4371,
4557,
4558,
4560,
4562,
4575,
4576,
4628,
4629,
4977,
4978,
5137,
5138,
5407,
5408,
5410,
5412,
5425,
5434,
5435,
5476,
5477,
5537,
5538,
5551,
5552,
5594,
5595,
5618,
5619,
5674,
5675,
5677,
5679,
5680,
5725,
5726,
5959,
5960,
5962,
5964,
5965,
6072,
6073,
6075,
6077,
6078,
6112,
6113,
6506,
6507,
6509,
6511,
6524,
6525,
6563,
6564,
7070,
7071,
7073,
7075,
7088,
7089,
7154,
7155,
7587,
7588,
7590,
7592,
7609,
7610,
7679,
7680,
7942,
7943,
8229,
8230,
8232,
8234,
8251,
8252,
8313,
8314,
8446,
8447,
8449,
8451,
8452,
8463,
8464,
8612,
8613,
8615,
8617,
8630,
8631,
8674,
8675,
8690,
8691,
8762,
8763,
8850,
8851,
8853,
8855,
8868,
8869,
8888,
8889,
8948,
8949,
8951,
8953,
8958,
8959,
9023,
9024,
9122,
9123,
9191,
9192,
9194,
9196,
9197,
9300,
9301,
9303,
9305,
9306,
9325,
9326,
9641,
9642,
9644,
9646,
9650,
9651,
9680,
9681,
9889,
9890,
10013,
10014,
10105,
10106,
10290,
10291,
10293,
10295,
10312,
10313,
10334,
10335,
10483,
10484,
10486,
10488,
10524,
10525,
10532,
10533,
10574
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 10574,
"ccnet_original_nlines": 247,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43283581733703613,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02174839936196804,
"rps_doc_frac_lines_end_with_ellipsis": 0.04032257944345474,
"rps_doc_frac_no_alph_words": 0.19872067868709564,
"rps_doc_frac_unique_words": 0.356601744890213,
"rps_doc_mean_word_length": 4.40043306350708,
"rps_doc_num_sentences": 131,
"rps_doc_symbol_to_word_ratio": 0.008955219760537148,
"rps_doc_unigram_entropy": 5.743276596069336,
"rps_doc_word_count": 1848,
"rps_doc_frac_chars_dupe_10grams": 0.039350710809230804,
"rps_doc_frac_chars_dupe_5grams": 0.09161338210105896,
"rps_doc_frac_chars_dupe_6grams": 0.08952286839485168,
"rps_doc_frac_chars_dupe_7grams": 0.08288244158029556,
"rps_doc_frac_chars_dupe_8grams": 0.07181505113840103,
"rps_doc_frac_chars_dupe_9grams": 0.05066404119133949,
"rps_doc_frac_chars_top_2gram": 0.0024594198912382126,
"rps_doc_frac_chars_top_3gram": 0.014387600123882294,
"rps_doc_frac_chars_top_4gram": 0.019921299070119858,
"rps_doc_books_importance": -1259.483154296875,
"rps_doc_books_importance_length_correction": -1259.483154296875,
"rps_doc_openwebtext_importance": -653.7215576171875,
"rps_doc_openwebtext_importance_length_correction": -653.7215576171875,
"rps_doc_wikipedia_importance": -584.4695434570312,
"rps_doc_wikipedia_importance_length_correction": -584.4695434570312
},
"fasttext": {
"dclm": 0.28760409355163574,
"english": 0.9598178267478943,
"fineweb_edu_approx": 1.4690884351730347,
"eai_general_math": 0.16719311475753784,
"eai_open_web_math": 0.2433614730834961,
"eai_web_code": 0.06764643639326096
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "14",
"label": "News Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-3,021,201,036,857,564,000 | The Most Important Drawback Of Utilizing Minecraft Server Host
提供: The Carlyle
2021年11月17日 (水) 08:08時点におけるStantonOverlock (トーク | 投稿記録)による版 (ページの作成:「<br> The game's energy is not a finite story or super graphics -- because of this, it has a seemingly timeless attraction that catches new youngsters as they grow outdate…」)
(差分) ← 古い版 | 最新版 (差分) | 新しい版 → (差分)
ナビゲーションに移動 検索に移動
The game's energy is not a finite story or super graphics -- because of this, it has a seemingly timeless attraction that catches new youngsters as they grow outdated enough to play it. A cult curio with restricted enchantment when it was launched in 2000, the movie emerged over the last 18 years as an unlikely cultural touchstone - celebrated by Edgar Wright and Quentin Tarantino, serverrestorer plugin inescapable on the house video market, and so tenaciously influential that its presence may be felt in all the pieces from The Starvation Video games to NBC’s Misplaced . You'll find our information on putting in Minecraft Forge right here. Before you begin on the lookout for mods to obtain and install (not least since you don’t must, we've got a nice checklist of cool mods here), we encourage you to observe this checklist of safety checks. If you want having a mini-map in your display, that is the proper Minecraft mod you're on the lookout for.
In the event you don’t obtain the dependencies, the mod is not going to function properly or could cause the game to crash. Minecraft Servers additionally allow for customizations reminiscent of plugins and mods, and for growth globally so your server can entice extra than simply your group of pals. Most commonly this is attributable to a duplicate mod, missing dependency mods, or incorrect mod variations. When you've got this situation, ensure that the mod you are using has an replace for the model of Forge you are operating. If the activities are squeezed in a ZIP file, you will want a free system like Winzip or Stuffit Expander (Mac) to decompress the file. We provide a free Minecraft server hosting with the total performance of a paid server. 6. Open Minecraft again and click Play, and the mods ought to now be loaded. 4. Enter the mods folder. To the left of the sport panel, click on FTP File Access and go into the mods folder.
Merely go into the FTP File Entry, the mods folder, and delete the additional mod. If it doesn’t, then you definately won’t be ready to use the mod in your server. Minecraft by default does not run mods so you need to make use of a mod loader, Forge. You will note an error that says "Duplicate Mods" with the mod identify listed beneath it. From this error, we will see that the lacking mod is JEI. This super handy mod stores all of your items by turning them into energy saved on the exhausting drive in your system. It is because there are two screens and it's a must to grab items off the smaller display for them to be added to your stock. Mods could be added with just some steps. You may test this by clicking the Mods tab on the Minecraft homepage. Head back to the mods web page. 3. Head back to the mods page. There are multiple alternative ways you'll be able to add mods whether or not you're just putting in Forge. The stay chat could be utilized by any user. " login credentials. If thefile doesn't exist, it's corrupt or no consumer is logged in, the person must enter a valid Premium account, otherwise the person will probably be directed to play the demo model or purchase the game.
If this is the case, you will have to install the right model of Forge on your mod manually. For every mod that goes into your server, it must be run consumer-side. The place can you run this program? If cuboid reproductions of Nintendo sixty four video games really are your bag, child, then hit the source hyperlink for information about how you can scope out the public alpha test and download the map for yourself. 3. Once they are uploaded, head back to the game Panel and start the server. They do provide alerts in your control panel in case of any downtime or upkeep problem. In case you host your server with Apex, you additionally get access to our premade gametypes, modpacks, 24/7 support, and customized sport panel. GoDaddy gives 24/7 phone support. The Hostgator will offer you CMS help which will facilitate streamline scheduling. Consider getting your mods from a reputable creator, so you possibly can make sure that it won't trigger problems like infecting your pc of viruses, corrupt sport recordsdata, delete information, or cause the game to crash. They are displayed as objects that you can interact with. | {
"url": "http://www.thecarlyle.shop/index.php?title=The_Most_Important_Drawback_Of_Utilizing_Minecraft_Server_Host&oldid=23787",
"source_domain": "www.thecarlyle.shop",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "22731",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:462GQARMYMYBA2FRU6BV5RRESLD4MNS2",
"WARC-Concurrent-To": "<urn:uuid:de31b50f-5cca-4748-b06b-805bf12c5516>",
"WARC-Date": "2022-01-29T02:21:25Z",
"WARC-IP-Address": "150.95.9.42",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WZP42NRDH3OKZTJ3HMU44VX5M5GLJUQ3",
"WARC-Record-ID": "<urn:uuid:a59d3558-f3d3-4596-910f-88c253d96f0c>",
"WARC-Target-URI": "http://www.thecarlyle.shop/index.php?title=The_Most_Important_Drawback_Of_Utilizing_Minecraft_Server_Host&oldid=23787",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8e0098c9-4c61-4955-aed8-812a5ac6695a>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-200\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
63,
64,
80,
323,
359,
376,
377,
378,
1337,
1338,
1339,
1340,
2286,
2287,
2288,
2289,
3491,
3492,
3493,
3494
],
"line_end_idx": [
63,
64,
80,
323,
359,
376,
377,
378,
1337,
1338,
1339,
1340,
2286,
2287,
2288,
2289,
3491,
3492,
3493,
3494,
4622
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4622,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4112734794616699,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007306890096515417,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1649269312620163,
"rps_doc_frac_unique_words": 0.45895522832870483,
"rps_doc_mean_word_length": 4.5696516036987305,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.001043839962221682,
"rps_doc_unigram_entropy": 5.32298469543457,
"rps_doc_word_count": 804,
"rps_doc_frac_chars_dupe_10grams": 0.06859008967876434,
"rps_doc_frac_chars_dupe_5grams": 0.08818726241588593,
"rps_doc_frac_chars_dupe_6grams": 0.06859008967876434,
"rps_doc_frac_chars_dupe_7grams": 0.06859008967876434,
"rps_doc_frac_chars_dupe_8grams": 0.06859008967876434,
"rps_doc_frac_chars_dupe_9grams": 0.06859008967876434,
"rps_doc_frac_chars_top_2gram": 0.013336960226297379,
"rps_doc_frac_chars_top_3gram": 0.010615129955112934,
"rps_doc_frac_chars_top_4gram": 0.010615129955112934,
"rps_doc_books_importance": -400.2104797363281,
"rps_doc_books_importance_length_correction": -400.2104797363281,
"rps_doc_openwebtext_importance": -228.845458984375,
"rps_doc_openwebtext_importance_length_correction": -228.845458984375,
"rps_doc_wikipedia_importance": -195.9140167236328,
"rps_doc_wikipedia_importance_length_correction": -195.9140167236328
},
"fasttext": {
"dclm": 0.06762635707855225,
"english": 0.9039165377616882,
"fineweb_edu_approx": 1.3596901893615723,
"eai_general_math": 0.15197205543518066,
"eai_open_web_math": 0.1235201433300972,
"eai_web_code": 0.1539967656135559
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
706,214,013,569,610,100 | Announcement
Collapse
No announcement yet.
Question on managing a set of arrays
Collapse
X
• Filter
• Time
• Show
Clear All
new posts
• Question on managing a set of arrays
I've got a situation where I need to maintain a set of arrays. The number of arrays is dynamic - determined by the user. The type of the arrays is known - they are all LONG arrays. The UBOUND of the arrays can vary. Any suggestions on how I can best manage them?
If all the arrays had the same dimension (UBOUND), I'd just create a multi-dimension array to house them.
Bernard Ertl
InterPlan Systems
• #2
Bern
You do keep asking fun questions. It seems you need a redimable array of arrays. To explain you would have a redimable array of pointers to array descriptors (obviously checking for Nulls if the array referenced no longer exists). Not sure how it could work with PB arrays (is late I will dream about it) but if all dynamically created arrays were Safe Arrays then then that pointer could easily be used to determine bounds and memory location of the first element so that you could do A Redim AT to access or change the data. I suspect it could be done with PB arrays as well but too late at night for me to look.
John
Comment
• #3
So, is memory an issue?
If not, then go ahead and use a single multi-dimensioned array anyway but keep track of the "UBound" of each dimension in another array.
Comment
• #4
Gary
Were life so simple. Bern is an experienced programmer. Redim Preserve only allows you to change one bound so depending on choices that would be the number of arrays or the number of entries thus his question which require changing both.
John
Comment
• #5
Code:
Redim [PRESERVE] MyArrayOfArrays (somenumber) AS VARIANT
LET MyArrayofArrays(subscript) = LongArray()
Getting your array back will take a little effort, but it's doable. There are some safearray functions in the Samples\VB32 folder installed with compiler to get you started.
However... I handle getting a PB array from a variant here:
Generic 'ADO' Connection and Query Tester (CC 5+/Win 9+) 11-02-08
You should be able to adapt that to a LONG array without a whole lot of effort.
MCM
Last edited by Michael Mattias; 13 May 2009, 02:49 PM.
Michael Mattias
Tal Systems (retired)
Port Washington WI USA
[email protected]
http://www.talsystems.com
Comment
• #6
Originally posted by John Petty View Post
... It seems you need a redimable array of arrays.
Correct.
I'm thinking I might have to simulate it using an array of strings and DIM AT for access. I might need to develop a DLL library (or INClude file of MACROs) to encapsulate all the array handling routines I need.
Originally posted by Michael Mattias View Post
Code:
Redim [PRESERVE] MyArrayOfArrays (somenumber) AS VARIANT
LET MyArrayofArrays(subscript) = LongArray()
Getting your array back will take a little effort, but it's doable. There are some safearray functions in the Samples\VB32 folder installed with compiler to get you started.
However... I handle getting a PB array from a variant here:
Generic 'ADO' Connection and Query Tester (CC 5+/Win 9+) 11-02-08
You should be able to adapt that to a LONG array without a whole lot of effort.
MCM
Thanks. I'll need to investigate that.
Bernard Ertl
InterPlan Systems
Comment
• #7
Code:
INIT:
REDIM AofA (number) AS LONG ' holds handles
ADD:
'add LONG array "L()" to AofA() at end:
LOCAL pl AS LONG PTR
nEl = ARRAYATTR(L(),4) ' element count of new array L()
GLOBALMEM ALLOC (nEl+1) * 4 to Hmem ' 4 = SIZEOF(LONG), but compiler won't accept that
GLOBALMEM LOCK hMem TO pL ' pointer to start of block
@pl = nel ' store element count at offset zero
INCR pl ' up we go
CopyMemory BYVAL pL, VARPTR(L(LBOUND (L,1))), nel * 4
' there's that pesky old SIZEOF(LONG) thing again. Darn, that would be handy wouldn't it?
GLOBALMEM UNLOCK hMem
REDIM PRESERVE AofA (UBOUND(AofA,1) + 1)
AofA (UBOUND(AofA,1)) = hMem ' store handle as new last element
GET:
' get back a desired array subscript into a working array "L()"
hMem = AofA (subscript)
GLOBALMEM LOCK hMem TO pl
nel = pl
INCR pl
REDIM L(nel-1) AT pl ' you could copy it off as above if you don't want
' to work with it in place.
' ------------------------
' work with L() here
' -------------------------
GLOBALMEM UNLOCK hMem ' CANNOT 'UNLOCK' until we are done with L() here
MCM
Michael Mattias
Tal Systems (retired)
Port Washington WI USA
[email protected]
http://www.talsystems.com
Comment
• #8
Experienced he may be, but you didn't understand the solution I suggested.
Bern didn't say he had a memory problem and I didn't say anything about ReDIM Preserve.
The "UBound" in quotes referred to a pointer for each of the dimensions in the big array, where no data would exist past that pointer in each of the array dimensions.
Pointer = number of the array element in a dimension of the big array corresponding to a "virtual" UBound for that dimension
Code:
Dim BigArray(100,1000) '100 arrays, each with 1000 elements
Dim iMax As Long 'number of valid "arrays" as defined by the user
Dim APointer(100) 'maximum position in each dimension (virtual UBound)
Just don't use what you don't need.
Last edited by Gary Beene; 13 May 2009, 03:51 PM.
Comment
• #9
Like I said fun, the real problem seems to be not how you access them but how do you create them.
Comment
• #10
John,
You fooled me! I was reading the responses and I'd have sworn it was MCM talking. I laughed out loud when I re-read your response and realized who had really spoken.
Please - take no offense nor compliment from my mistake! <g>
Comment
• #11
Why are you keeping me awake? Without resorting to my rusty assmbeler then if if the size of the new dynamic array can be predetermined in advance and won't change then I would add it to a redimmmable string array with a string size of expected entries x 4 as say spaces or chr$(0) then to access you could REDIM AT STRPTR(array member) AS LONG with a size of LEN(array member \ 4). You might need another array to keep track what each array member means. Of course if you need to change the size of the array then you would do it as a string length change, let the OLE engine reallocate space in basically a REDIM PRESEVE mode, determine its new address and REDIM AT that location.
Comment
• #12
Originally posted by Gary Beene View Post
John,
You fooled me! I was reading the responses and I'd have sworn it was MCM talking. I laughed out loud when I re-read your response and realized who had really spoken.
Please - take no offense nor compliment from my mistake! <g>
No offense taken, as I did miss both the simplicity and elegance of your solution. While it imposes fixed limitations on both array dimensions it may be the best solution.
Comment
• #13
I went ahead and developed a simple wrapper over an array of strings:
Code:
' ==========================================================================
' | |
' | Array of Arrays |
' | |
' ==========================================================================
' Allows you to manage a set of LONG arrays where the number of arrays is
' variable and the UBOUND for each array in the set is also variable.
'
' Notes: these routines were built for a specific circumstances:
' * all arrays are assumed to be built sorted in ascending order
' * all data in arrays are assumed to be >= 0 (ie. no negative numbers)
' * all arrays use 0 as the LBOUND
'
' -> .lMaxValue may not be necessary for a more general application
' -> binary search does not work if arrays are not sorted
' -> if you need to store negative numbers, you will need to adjust the
' AoA_Get function to return value in a parameter separate from error code
'
' * Critical sections to make thread safe not fully implemented (not sure I need it yet)
' ==========================================================================
' PUBLIC DOMAIN SOFTWARE
' The author or authors of this code dedicate any and all
' copyright interest in this code to the public domain.
' Anyone is free to copy, modify, publish, use, compile,
' sell, or distribute the original code, either in source
' code form or as a compiled binary, for any purpose,
' commercial or non-commercial, and by any means.
' Bern Ertl - May 2009
' ==========================================================================
#COMPILE DLL
#DIM ALL
'============================<[ Equates ]>=============================
'=============================<[ Types ]>==============================
TYPE ArrayInfo
lKey AS LONG 'Each array is indexed to a 'key' supplied by the application
plData AS LONG PTR
lUpperBound AS LONG
lMaxValue AS LONG
END TYPE
'=============================<[ Macros ]>=============================
'============================<[ Globals ]>=============================
GLOBAL gCriticalSection AS CRITICAL_SECTION ' Critical section handle
GLOBAL gsArrayData() AS STRING
GLOBAL guArrayInfo() AS ArrayInfo
'============================<[ Functions ]>===========================
SUB AoA_DIM ALIAS "AoA_DIM" (BYVAL lKey AS LONG, _
BYVAL lUpperBound AS LONG) EXPORT
REGISTER I AS LONG, J AS LONG
J = UBOUND( guArrayInfo)
'Check if key already exists
FOR I = 0 TO J
IF guArrayInfo( I).lKey = lKey THEN
IF guArrayInfo( I).lUpperBound <> lUpperBound THEN
guArrayInfo( I).lUpperBound = lUpperBound
guArrayInfo( I).lMaxValue = 0
gsArrayData( I) = STRING$( (lUpperBound + 1) * 4, 0)
guArrayInfo( I).plData = STRPTR( gsArrayData( I))
END IF
EXIT SUB
END IF
NEXT
'Add lKey to guArrayInfo
INCR J
REDIM PRESERVE gsArrayData( J)
REDIM PRESERVE guArrayInfo( J)
guArrayInfo( J).lKey = lKey
guArrayInfo( J).lUpperBound = lUpperBound
guArrayInfo( J).lMaxValue = 0
gsArrayData( J) = STRING$( (lUpperBound + 1) * 4, 0)
guArrayInfo( J).plData = STRPTR( gsArrayData( J))
END SUB
'------------------------------------------------------------------------
SUB AoA_REDIM ALIAS "AoA_REDIM" (BYVAL lKey AS LONG, _
BYVAL lUpperBound AS LONG) EXPORT
'ReDim PRESERVE
REGISTER I AS LONG, J AS LONG
J = UBOUND( guArrayInfo)
'Check if key already exists
FOR I = 0 TO J
IF guArrayInfo( I).lKey = lKey THEN
SELECT CASE AS LONG guArrayInfo( I).lUpperBound
CASE < lUpperBound
'Expand array
gsArrayData( I) += STRING$( (lUpperBound - guArrayInfo( I).lUpperBound) * 4, 0)
guArrayInfo( I).lUpperBound = lUpperBound
guArrayInfo( I).plData = STRPTR( gsArrayData( I))
CASE = lUpperBound
'Do nothing
CASE > lUpperBound
'Reduce array
gsArrayData( I) = LEFT$( gsArrayData( I), (lUpperBound + 1) * 4)
guArrayInfo( I).lUpperBound = lUpperBound
guArrayInfo( I).plData = STRPTR( gsArrayData( I))
guArrayInfo( I).lMaxValue = CVL( gsArrayData( I), lUpperBound * 4 + 1)
END SELECT
EXIT SUB
END IF
NEXT
'Add lKey to guArrayInfo
INCR J
REDIM PRESERVE gsArrayData( J)
REDIM PRESERVE guArrayInfo( J)
guArrayInfo( J).lKey = lKey
guArrayInfo( J).lUpperBound = lUpperBound
guArrayInfo( J).lMaxValue = 0
gsArrayData( J) = STRING$( (lUpperBound + 1) * 4, 0)
guArrayInfo( J).plData = STRPTR( gsArrayData( J))
END SUB
'------------------------------------------------------------------------
FUNCTION AoA_Put ALIAS "AoA_Put" (BYVAL lKey AS LONG, _
BYVAL lSubscript AS LONG, _
BYVAL lValue AS LONG) EXPORT AS LONG
'Returns %True if successful
REGISTER I AS LONG, J AS LONG
J = UBOUND( guArrayInfo)
'Find key
FOR I = 0 TO J
IF guArrayInfo( I).lKey = lKey THEN
IF lSubscript >=0 AND lSubscript < guArrayInfo( I).lUpperBound THEN
guArrayInfo( I)[email protected][ lSubscript] = lValue
FUNCTION = %True
EXIT FUNCTION
ELSEIF lSubscript = guArrayInfo( I).lUpperBound THEN
guArrayInfo( I)[email protected][ lSubscript] = lValue
guArrayInfo( I).lMaxValue = lValue
FUNCTION = %True
END IF
EXIT FUNCTION
END IF
NEXT
END FUNCTION
'------------------------------------------------------------------------
FUNCTION AoA_Get ALIAS "AoA_Get" (BYVAL lKey AS LONG, _
BYVAL lSubscript AS LONG) EXPORT AS LONG
'Returns data from array if successful,
'returns -1 if lSubscript out of bounds
'returns -2 if lKey not found
REGISTER I AS LONG, J AS LONG
J = UBOUND( guArrayInfo)
'Find key
FOR I = 0 TO J
IF guArrayInfo( I).lKey = lKey THEN
IF lSubscript >=0 AND lSubscript <= guArrayInfo( I).lUpperBound THEN
FUNCTION = guArrayInfo( I)[email protected][ lSubscript]
EXIT FUNCTION
ELSE
'Need to expand UBOUND of array...
FUNCTION = -1
END IF
EXIT FUNCTION
END IF
NEXT
'Need to add array for lKey...
FUNCTION = -2
END FUNCTION
'------------------------------------------------------------------------
FUNCTION AoA_BinarySearch ALIAS "AoA_BinarySearch" (BYVAL lKey AS LONG, _
BYVAL lValue AS LONG) EXPORT AS LONG
'Returns subscript from array matching lValue OR returns subscript from array containing largest value that is less than lValue
'Assumes array(0) = 0
'returns 0 if lValue <= 0
'returns -1 if lValue > .lMaxValue
'returns -2 if lKey not found
REGISTER I AS LONG, J AS LONG
LOCAL lArraySubscript AS LONG, lIndex AS LONG
IF lValue <= 0 THEN
FUNCTION = 0
EXIT FUNCTION
END IF
J = UBOUND( guArrayInfo)
'Find key
FOR I = 0 TO J
IF guArrayInfo( I).lKey = lKey THEN
IF lValue > guArrayInfo( I).lMaxValue THEN
'Need to expand UBOUND of array...
FUNCTION = -1
EXIT FUNCTION
END IF
lArraySubscript = I
I = 0
J = guArrayInfo( lArraySubscript).lUpperBound
DO
lIndex = (I + J) \ 2
SELECT CASE AS LONG guArrayInfo( lArraySubscript)[email protected][ lIndex]
CASE > lValue
J = lIndex - 1
CASE < lValue
I = lIndex + 1
CASE ELSE ' = lValue
FUNCTION = lIndex
EXIT FUNCTION
END SELECT
LOOP UNTIL J < I
IF guArrayInfo( lArraySubscript)[email protected][ lIndex] > lValue THEN DECR lIndex
FUNCTION = lIndex
EXIT FUNCTION
END IF
NEXT
'Need to add array for lKey...
FUNCTION = -2
END FUNCTION
'============================<[ Lib Main ]>============================
FUNCTION LIBMAIN(BYVAL InstDLL AS LONG, _
BYVAL Reason AS LONG, _
BYVAL Reserved AS LONG)AS LONG
' InstDLL is the DLL's instance handle. This handle is used by the calling
' application to identify the DLL being called.
' Reason specifies a flag indicating why the DLL entry-point is being called.
' It can be one of the following values:
' %DLL_PROCESS_ATTACH=1: Indicates that the DLL is being loaded by another process
' (a DLL or EXE is loading the DLL). DLLs can use this opportunity to initialize
' any instance or global data, such as arrays.
' %DLL_PROCESS_DETACH=0: Indicates that the DLL is being unloaded or detached from
' the calling application. DLLs can take this opportunity to clean up all
' resources for all threads attached and known to the DLL.
' %DLL_THREAD_ATTACH=2: Indicates that the DLL is being loaded by a new thread in
' the calling application. DLLs can use this opportunity to initialize any thread
' local storage (TLS).
' %DLL_THREAD_DETACH=3: Indicates that the thread is exiting cleanly. If the DLL
' has allocated any thread local storage, it should be released.
' Reserved specifies further aspects of the DLL initialization and cleanup. If
' Reason is %DLL_PROCESS_ATTACH, Reserved is NULL (zero) for dynamic loads
' and non-NULL for static loads. If Reason is %DLL_PROCESS_DETACH, Reserved
' is NULL if LibMain has been called by using the FreeLibrary API call and
' non-NULL if LibMain has been called during process termination.
' Return: If LibMain is called with %DLL_PROCESS_ATTACH, your LibMain function should
' return a zero (0) if any part of your initialization process fails or a one (1)
' if no errors were encountered. If a zero is returned, Windows will abort and
' unload the DLL from memory. When LibMain is called with any other value than
' %DLL_PROCESS_ATTACH, the return value is ignored.
IF Reason = 1 THEN
InitializeCriticalSection gCriticalSection
ELSEIF Reason = 0 THEN
DeleteCriticalSection gCriticalSection
END IF
FUNCTION = 1
END FUNCTION
#ENDIF
Bernard Ertl
InterPlan Systems
Comment
• #14
I am wondering if it may be easier (well, easier to read and maintain in the long run) to use a array of classes. Each class could contain any number of different types of variables, including an array. You could dim/redim your main array of classes and also work with properties/methods to manipulate the array within the class you're interested in.
(no code... just thinking out loud). You'd need PB9 of course.
I've used the manual approach to allocating arrays in arrays for several years and it is (in my opinion) much more cumbersome than using PB's new class features.
Paul Squires
FireFly Visual Designer (for PowerBASIC Windows 10+)
Version 3 now available.
http://www.planetsquires.com
Comment
• #15
A Dictionary Object may be worth investigating also.
James
Comment
• #16
Sound like you want a jagged array.
I posted a LONG jagged array in the Source forum.
LONG: Jagged and Two Dim Array (DLL & Class)
However, it's not made with PB arrays.
index always ONE based
ReDim is automatic for all operations, data always preserved.
Array automatically ReDim for append, insert and deletes.
You can append/insert/delet new arrays anywhere in host array.
You can append/insert/delet values at any position on a particular row.
You can ReDim the host array, or ReDim the array on a particular row.
However, it does require a DLL.
There's a different zip for a Class or handle reference.
There's too many dependencies to post the source.
stanthemanstan~gmail
Dead Theory Walking
Range Trie Tree
HLib ~ Free Data Container Lib ~ Arrays, Lists, Stacks, Queues, Deques, Trees, Hashes
Comment
• #17
The way I would do it is to have one large array to hold all of the LONGs, and a dynamic string array to hold the location of each array's first element followed by an array name. Use REDIM PRESERVE and ARRAY INSERT or ARRAY DELETE to modify the arrays.
Comment
Working...
X | {
"url": "https://forum.powerbasic.com/forum/user-to-user-discussions/powerbasic-for-windows/41597-question-on-managing-a-set-of-arrays?t=40556",
"source_domain": "forum.powerbasic.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "247517",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QIIWEP2L5YQAZCV5ZWFXDTIU6FYHZQYF",
"WARC-Concurrent-To": "<urn:uuid:e19fdac9-0147-41d7-bc9b-e74512c43bc0>",
"WARC-Date": "2023-03-21T07:00:48Z",
"WARC-IP-Address": "104.16.200.6",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:4IABFFQEIW53JADPYEKMGFEFNCOIDZL4",
"WARC-Record-ID": "<urn:uuid:53737adf-bbeb-40b1-a0b8-af784338619a>",
"WARC-Target-URI": "https://forum.powerbasic.com/forum/user-to-user-discussions/powerbasic-for-windows/41597-question-on-managing-a-set-of-arrays?t=40556",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f1cb47cc-c379-49b2-b4ed-1c15d8e454c1>"
},
"warc_info": "isPartOf: CC-MAIN-2023-14\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-113\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
13,
14,
23,
44,
45,
82,
83,
92,
94,
96,
107,
116,
125,
135,
145,
146,
187,
188,
455,
456,
566,
583,
605,
606,
613,
622,
1241,
1250,
1251,
1263,
1264,
1265,
1274,
1304,
1305,
1448,
1449,
1463,
1464,
1465,
1476,
1489,
1735,
1748,
1749,
1765,
1766,
1767,
1780,
1796,
1867,
1927,
2111,
2112,
2182,
2258,
2259,
2349,
2350,
2364,
2429,
2455,
2487,
2520,
2548,
2584,
2585,
2603,
2604,
2605,
2620,
2674,
2737,
2758,
2759,
2982,
2983,
3042,
3060,
3133,
3195,
3381,
3382,
3454,
3532,
3533,
3625,
3626,
3642,
3693,
3718,
3748,
3749,
3769,
3770,
3771,
3788,
3808,
3829,
3891,
3906,
3925,
3980,
4019,
4117,
4225,
4310,
4404,
4450,
4528,
4639,
4681,
4740,
4828,
4843,
4862,
4941,
4988,
5034,
5064,
5094,
5188,
5260,
5304,
5343,
5389,
5483,
5501,
5531,
5567,
5604,
5636,
5676,
5677,
5699,
5700,
5701,
5720,
5811,
5812,
5916,
5917,
6100,
6101,
6242,
6243,
6265,
6346,
6439,
6536,
6588,
6654,
6655,
6679,
6680,
6681,
6702,
6818,
6819,
6845,
6846,
6847,
6871,
6897,
6898,
7084,
7085,
7166,
7167,
7195,
7196,
7197,
7223,
7928,
7929,
7959,
7960,
7961,
7989,
8055,
8085,
8086,
8276,
8277,
8362,
8558,
8559,
8591,
8592,
8593,
8623,
8719,
8751,
8855,
8959,
9063,
9167,
9271,
9372,
9469,
9497,
9589,
9684,
9786,
9851,
9879,
9977,
10065,
10167,
10277,
10305,
10424,
10528,
10580,
10665,
10748,
10832,
10917,
10998,
11075,
11125,
11229,
11256,
11295,
11330,
11357,
11455,
11482,
11580,
11621,
11734,
11785,
11832,
11879,
11914,
11941,
12039,
12066,
12164,
12260,
12287,
12344,
12404,
12431,
12529,
12556,
12633,
12698,
12725,
12782,
12809,
12861,
12917,
12959,
13023,
13103,
13175,
13235,
13318,
13398,
13434,
13472,
13507,
13539,
13566,
13618,
13652,
13710,
13768,
13795,
13850,
13919,
13976,
14056,
14133,
14160,
14194,
14221,
14321,
14348,
14429,
14493,
14520,
14563,
14590,
14647,
14674,
14726,
14782,
14824,
14888,
14965,
15014,
15059,
15170,
15243,
15324,
15373,
15416,
15465,
15510,
15606,
15679,
15760,
15862,
15902,
15940,
15975,
16007,
16034,
16086,
16120,
16178,
16236,
16263,
16318,
16387,
16444,
16524,
16601,
16628,
16662,
16689,
16789,
16816,
16898,
16957,
17025,
17052,
17108,
17135,
17192,
17219,
17271,
17308,
17350,
17414,
17511,
17596,
17643,
17687,
17769,
17854,
17919,
17966,
18002,
18045,
18080,
18112,
18139,
18178,
18205,
18305,
18332,
18414,
18486,
18513,
18580,
18649,
18708,
18735,
18792,
18819,
18871,
18908,
18950,
19014,
19112,
19199,
19243,
19277,
19342,
19386,
19422,
19465,
19500,
19532,
19559,
19617,
19658,
19685,
19724,
19751,
19851,
19878,
19978,
20046,
20073,
20228,
20277,
20332,
20396,
20455,
20482,
20539,
20566,
20639,
20666,
20713,
20754,
20796,
20830,
20857,
20909,
20946,
20988,
21052,
21124,
21189,
21233,
21277,
21313,
21340,
21389,
21416,
21451,
21526,
21553,
21585,
21637,
21744,
21790,
21838,
21884,
21932,
21986,
22037,
22084,
22126,
22172,
22199,
22313,
22360,
22403,
22438,
22470,
22497,
22555,
22596,
22623,
22662,
22689,
22787,
22858,
22914,
22975,
23077,
23154,
23258,
23328,
23440,
23551,
23627,
23739,
23843,
23931,
24042,
24154,
24206,
24317,
24411,
24517,
24621,
24727,
24831,
24926,
25038,
25149,
25258,
25366,
25447,
25474,
25520,
25591,
25641,
25708,
25742,
25782,
25821,
25848,
25875,
25908,
25947,
25991,
25992,
26026,
26027,
26028,
26060,
26439,
26440,
26531,
26532,
26722,
26763,
26844,
26897,
26954,
26955,
26991,
26992,
26993,
27027,
27110,
27111,
27147,
27148,
27186,
27187,
27188,
27224,
27292,
27293,
27375,
27376,
27453,
27454,
27455,
27526,
27527,
27582,
27583,
27677,
27767,
27768,
27863,
27967,
27968,
28070,
28071,
28135,
28224,
28306,
28359,
28411,
28459,
28577,
28578,
28618,
28619,
28620,
28658,
28946,
28947,
28989,
28990,
29035
],
"line_end_idx": [
13,
14,
23,
44,
45,
82,
83,
92,
94,
96,
107,
116,
125,
135,
145,
146,
187,
188,
455,
456,
566,
583,
605,
606,
613,
622,
1241,
1250,
1251,
1263,
1264,
1265,
1274,
1304,
1305,
1448,
1449,
1463,
1464,
1465,
1476,
1489,
1735,
1748,
1749,
1765,
1766,
1767,
1780,
1796,
1867,
1927,
2111,
2112,
2182,
2258,
2259,
2349,
2350,
2364,
2429,
2455,
2487,
2520,
2548,
2584,
2585,
2603,
2604,
2605,
2620,
2674,
2737,
2758,
2759,
2982,
2983,
3042,
3060,
3133,
3195,
3381,
3382,
3454,
3532,
3533,
3625,
3626,
3642,
3693,
3718,
3748,
3749,
3769,
3770,
3771,
3788,
3808,
3829,
3891,
3906,
3925,
3980,
4019,
4117,
4225,
4310,
4404,
4450,
4528,
4639,
4681,
4740,
4828,
4843,
4862,
4941,
4988,
5034,
5064,
5094,
5188,
5260,
5304,
5343,
5389,
5483,
5501,
5531,
5567,
5604,
5636,
5676,
5677,
5699,
5700,
5701,
5720,
5811,
5812,
5916,
5917,
6100,
6101,
6242,
6243,
6265,
6346,
6439,
6536,
6588,
6654,
6655,
6679,
6680,
6681,
6702,
6818,
6819,
6845,
6846,
6847,
6871,
6897,
6898,
7084,
7085,
7166,
7167,
7195,
7196,
7197,
7223,
7928,
7929,
7959,
7960,
7961,
7989,
8055,
8085,
8086,
8276,
8277,
8362,
8558,
8559,
8591,
8592,
8593,
8623,
8719,
8751,
8855,
8959,
9063,
9167,
9271,
9372,
9469,
9497,
9589,
9684,
9786,
9851,
9879,
9977,
10065,
10167,
10277,
10305,
10424,
10528,
10580,
10665,
10748,
10832,
10917,
10998,
11075,
11125,
11229,
11256,
11295,
11330,
11357,
11455,
11482,
11580,
11621,
11734,
11785,
11832,
11879,
11914,
11941,
12039,
12066,
12164,
12260,
12287,
12344,
12404,
12431,
12529,
12556,
12633,
12698,
12725,
12782,
12809,
12861,
12917,
12959,
13023,
13103,
13175,
13235,
13318,
13398,
13434,
13472,
13507,
13539,
13566,
13618,
13652,
13710,
13768,
13795,
13850,
13919,
13976,
14056,
14133,
14160,
14194,
14221,
14321,
14348,
14429,
14493,
14520,
14563,
14590,
14647,
14674,
14726,
14782,
14824,
14888,
14965,
15014,
15059,
15170,
15243,
15324,
15373,
15416,
15465,
15510,
15606,
15679,
15760,
15862,
15902,
15940,
15975,
16007,
16034,
16086,
16120,
16178,
16236,
16263,
16318,
16387,
16444,
16524,
16601,
16628,
16662,
16689,
16789,
16816,
16898,
16957,
17025,
17052,
17108,
17135,
17192,
17219,
17271,
17308,
17350,
17414,
17511,
17596,
17643,
17687,
17769,
17854,
17919,
17966,
18002,
18045,
18080,
18112,
18139,
18178,
18205,
18305,
18332,
18414,
18486,
18513,
18580,
18649,
18708,
18735,
18792,
18819,
18871,
18908,
18950,
19014,
19112,
19199,
19243,
19277,
19342,
19386,
19422,
19465,
19500,
19532,
19559,
19617,
19658,
19685,
19724,
19751,
19851,
19878,
19978,
20046,
20073,
20228,
20277,
20332,
20396,
20455,
20482,
20539,
20566,
20639,
20666,
20713,
20754,
20796,
20830,
20857,
20909,
20946,
20988,
21052,
21124,
21189,
21233,
21277,
21313,
21340,
21389,
21416,
21451,
21526,
21553,
21585,
21637,
21744,
21790,
21838,
21884,
21932,
21986,
22037,
22084,
22126,
22172,
22199,
22313,
22360,
22403,
22438,
22470,
22497,
22555,
22596,
22623,
22662,
22689,
22787,
22858,
22914,
22975,
23077,
23154,
23258,
23328,
23440,
23551,
23627,
23739,
23843,
23931,
24042,
24154,
24206,
24317,
24411,
24517,
24621,
24727,
24831,
24926,
25038,
25149,
25258,
25366,
25447,
25474,
25520,
25591,
25641,
25708,
25742,
25782,
25821,
25848,
25875,
25908,
25947,
25991,
25992,
26026,
26027,
26028,
26060,
26439,
26440,
26531,
26532,
26722,
26763,
26844,
26897,
26954,
26955,
26991,
26992,
26993,
27027,
27110,
27111,
27147,
27148,
27186,
27187,
27188,
27224,
27292,
27293,
27375,
27376,
27453,
27454,
27455,
27526,
27527,
27582,
27583,
27677,
27767,
27768,
27863,
27967,
27968,
28070,
28071,
28135,
28224,
28306,
28359,
28411,
28459,
28577,
28578,
28618,
28619,
28620,
28658,
28946,
28947,
28989,
28990,
29035,
29070
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 29070,
"ccnet_original_nlines": 547,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2548103332519531,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.1517317146062851,
"rps_doc_frac_lines_end_with_ellipsis": 0.00912408996373415,
"rps_doc_frac_no_alph_words": 0.27212753891944885,
"rps_doc_frac_unique_words": 0.2677224576473236,
"rps_doc_mean_word_length": 4.768099784851074,
"rps_doc_num_sentences": 143,
"rps_doc_symbol_to_word_ratio": 0.007696540094912052,
"rps_doc_unigram_entropy": 5.74127197265625,
"rps_doc_word_count": 2652,
"rps_doc_frac_chars_dupe_10grams": 0.20521944761276245,
"rps_doc_frac_chars_dupe_5grams": 0.30676156282424927,
"rps_doc_frac_chars_dupe_6grams": 0.27955713868141174,
"rps_doc_frac_chars_dupe_7grams": 0.26801106333732605,
"rps_doc_frac_chars_dupe_8grams": 0.2608145475387573,
"rps_doc_frac_chars_dupe_9grams": 0.2274416834115982,
"rps_doc_frac_chars_top_2gram": 0.018030840903520584,
"rps_doc_frac_chars_top_3gram": 0.0049822102300822735,
"rps_doc_frac_chars_top_4gram": 0.005931199993938208,
"rps_doc_books_importance": -1332.09765625,
"rps_doc_books_importance_length_correction": -1332.09765625,
"rps_doc_openwebtext_importance": -807.6181030273438,
"rps_doc_openwebtext_importance_length_correction": -807.6181030273438,
"rps_doc_wikipedia_importance": -576.4683227539062,
"rps_doc_wikipedia_importance_length_correction": -576.4683227539062
},
"fasttext": {
"dclm": 0.28772521018981934,
"english": 0.7566661834716797,
"fineweb_edu_approx": 1.6096994876861572,
"eai_general_math": 0.7256804704666138,
"eai_open_web_math": 0.30414438247680664,
"eai_web_code": 0.29825133085250854
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
6,719,031,835,847,004,000 | \label{doc_decisions_default_values_md_md_doc_decisions_default_values}% \Hypertarget{doc_decisions_default_values_md_md_doc_decisions_default_values}% \hypertarget{doc_decisions_default_values_md_autotoc_md1761}{}\doxysection{Problem}\label{doc_decisions_default_values_md_autotoc_md1761} \begin{DoxyItemize} \item Key\+Set might get modified on access (hash rebuilds) \item Expectation that already all keys are there after {\ttfamily \mbox{\hyperlink{group__kdb_ga28e385fd9cb7ccfe0b2f1ed2f62453a1}{kdb\+Get()}}} \item No default value calculation \end{DoxyItemize}\hypertarget{doc_decisions_default_values_md_autotoc_md1762}{}\doxysection{Constraints}\label{doc_decisions_default_values_md_autotoc_md1762} \begin{DoxyItemize} \item Should work with dynamic search for keys \end{DoxyItemize}\hypertarget{doc_decisions_default_values_md_autotoc_md1763}{}\doxysection{Assumptions}\label{doc_decisions_default_values_md_autotoc_md1763} \hypertarget{doc_decisions_default_values_md_autotoc_md1764}{}\doxysection{Considered Alternatives}\label{doc_decisions_default_values_md_autotoc_md1764} \hypertarget{doc_decisions_default_values_md_autotoc_md1765}{}\doxysection{Decision}\label{doc_decisions_default_values_md_autotoc_md1765} \begin{DoxyItemize} \item spec-\/plugin does a lookup for values (Maybe also resolving missing fallback/override links?) \end{DoxyItemize}\hypertarget{doc_decisions_default_values_md_autotoc_md1766}{}\doxysection{Rationale}\label{doc_decisions_default_values_md_autotoc_md1766} \hypertarget{doc_decisions_default_values_md_autotoc_md1767}{}\doxysection{Implications}\label{doc_decisions_default_values_md_autotoc_md1767} \hypertarget{doc_decisions_default_values_md_autotoc_md1768}{}\doxysection{Related Decisions}\label{doc_decisions_default_values_md_autotoc_md1768} \hypertarget{doc_decisions_default_values_md_autotoc_md1769}{}\doxysection{Notes}\label{doc_decisions_default_values_md_autotoc_md1769} \begin{DoxyItemize} \item \#533 \item \#972 \end{DoxyItemize} | {
"url": "https://doc.libelektra.org/api/latest/latex/doc_decisions_default_values_md.tex",
"source_domain": "doc.libelektra.org",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "2287",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6Z3UWRNGTLML6J5XVNAJVSCEAU5V7E2I",
"WARC-Concurrent-To": "<urn:uuid:ef6503df-0b94-412b-a076-9cf12a3d25e5>",
"WARC-Date": "2023-02-06T16:55:01Z",
"WARC-IP-Address": "95.217.75.163",
"WARC-Identified-Payload-Type": "application/x-tex",
"WARC-Payload-Digest": "sha1:B4XPS4DHG7EVC6VKPJRZREGJMO67GA2N",
"WARC-Record-ID": "<urn:uuid:31eaf9e5-b313-4cb7-8d02-2d8ab69e2711>",
"WARC-Target-URI": "https://doc.libelektra.org/api/latest/latex/doc_decisions_default_values_md.tex",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0f45ee86-c0bf-4992-9d61-3e332029700b>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-163\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0
],
"line_end_idx": [
1994
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1994,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.05015045031905174,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06504064798355103,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4674796760082245,
"rps_doc_frac_unique_words": 0.8382353186607361,
"rps_doc_mean_word_length": 23.97058868408203,
"rps_doc_num_sentences": 2,
"rps_doc_symbol_to_word_ratio": 0.008130080066621304,
"rps_doc_unigram_entropy": 3.8968732357025146,
"rps_doc_word_count": 68,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04907974973320961,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -97.61983489990234,
"rps_doc_books_importance_length_correction": -97.61983489990234,
"rps_doc_openwebtext_importance": -83.38101959228516,
"rps_doc_openwebtext_importance_length_correction": -83.38101959228516,
"rps_doc_wikipedia_importance": -55.342323303222656,
"rps_doc_wikipedia_importance_length_correction": -55.342323303222656
},
"fasttext": {
"dclm": 0.5732195973396301,
"english": 0.11640799045562744,
"fineweb_edu_approx": 0.9330602884292603,
"eai_general_math": 0.9945185780525208,
"eai_open_web_math": 0.9999933242797852,
"eai_web_code": 0.9666933417320251
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "2",
"label": "Text Extraction Errors"
}
},
"missing_content": {
"primary": {
"code": "6",
"label": "Indeterminate"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
1,226,635,997,942,314,500 | Customising Blogger
Like many new bloggers, I have the uncontrollable urge to customise my blog to my own particular specifications in order to make my blog unique and work exactly as I want it to.
It can't be helped, despite my resolutions to concentrate only on Glam-Mum-Ous subjects... So for the next few weeks, I'll blog a series of articles about what I'm doing to my Blogger template.
At least until I've got it out of my system!
I've started with the classic Rounders4 Blogger template, as I like the colour scheme and the segmentation of the sidebars. Here's what I plan to do in order to evolve my template to something completely glamumous:
1. Add a custom header
2. Create a 3 column layout (featuring an extra sidebar on the left)
3. Add trackback functionality
4. Create a "label cloud", so that my post labels are in a pretty cloud shape instead of simply a long list!
5. Perhaps more... I've yet to decide what else I'd like to do!
From this point forward, all posts related to the customisation of my blog will be featured under the label "customising blogger". Watch this space for changes in the near future, and please leave your comments and opinions on my design as it develops.
Related posts:
Technorati Tags: | | | | {
"url": "http://www.glamumous.co.uk/2007/04/customising-blogger.html",
"source_domain": "www.glamumous.co.uk",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "76685",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4QHURB7MQ3I5SI5B5ASI3ZOJVGQJG3FV",
"WARC-Concurrent-To": "<urn:uuid:06f0d664-cb78-4d71-b1da-b582c2e0b1f6>",
"WARC-Date": "2018-03-23T20:24:58Z",
"WARC-IP-Address": "172.217.13.83",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:APIRXCA54ZMK2W5PSIXGOV3GUAYPNZNU",
"WARC-Record-ID": "<urn:uuid:8f579ce2-400c-42d9-bd21-3ef139609f36>",
"WARC-Target-URI": "http://www.glamumous.co.uk/2007/04/customising-blogger.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:01e75632-0c61-483c-ae45-6ce6ed498d46>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-184-170-133.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
20,
21,
22,
23,
201,
202,
396,
397,
442,
443,
658,
659,
684,
755,
788,
899,
965,
966,
1219,
1220,
1235,
1236
],
"line_end_idx": [
20,
21,
22,
23,
201,
202,
396,
397,
442,
443,
658,
659,
684,
755,
788,
899,
965,
966,
1219,
1220,
1235,
1236,
1258
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1258,
"ccnet_original_nlines": 22,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4148148000240326,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.037037041038274765,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17777778208255768,
"rps_doc_frac_unique_words": 0.6238532066345215,
"rps_doc_mean_word_length": 4.449541091918945,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0.007407410070300102,
"rps_doc_unigram_entropy": 4.617877960205078,
"rps_doc_word_count": 218,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01855669915676117,
"rps_doc_frac_chars_top_3gram": 0.01855669915676117,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -102.70154571533203,
"rps_doc_books_importance_length_correction": -102.70154571533203,
"rps_doc_openwebtext_importance": -53.38032150268555,
"rps_doc_openwebtext_importance_length_correction": -53.38032150268555,
"rps_doc_wikipedia_importance": -53.24098587036133,
"rps_doc_wikipedia_importance_length_correction": -53.24098587036133
},
"fasttext": {
"dclm": 0.025329409167170525,
"english": 0.9250357747077942,
"fineweb_edu_approx": 0.6275326609611511,
"eai_general_math": 0.020444270223379135,
"eai_open_web_math": 0.02553052082657814,
"eai_web_code": 0.02699410915374756
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.7",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-516,804,992,314,404,300 | Changes
Jump to: navigation, search
Error handling
473 bytes added, 17:49, 2 February 2009
New page: =General rule: provide a sane, hierarchical set of error classes and hooks to catch them as necessary= ==Specific rule: THROW SOME DARN ERRORS!!!!== Don’t be an idiot. Things will fail...
=General rule: provide a sane, hierarchical set of error classes and hooks to catch them as necessary=
==Specific rule: THROW SOME DARN ERRORS!!!!==
Don’t be an idiot. Things will fail. In the absense of Design by Contract or somesuch, errors will happen. Throw them. Catch them. But at least throw them, instead of letting your code die six hundred lines later with a “Cannot cast null value to string” when you finally get around to trying to print something out.
Navigation menu | {
"url": "https://wiki.code4lib.org/Special:MobileDiff/2064",
"source_domain": "wiki.code4lib.org",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "12321",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3STJUPE3Z4T277WZZJJGZQTNBXLNTGHP",
"WARC-Concurrent-To": "<urn:uuid:9e5da664-73dc-4a52-bc8f-7dd50da16d7b>",
"WARC-Date": "2020-01-23T23:22:16Z",
"WARC-IP-Address": "128.193.164.120",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FOR5SL662S6UPWCMGOXZPCHDKKVWFGSD",
"WARC-Record-ID": "<urn:uuid:e5338589-c862-436a-bad5-04e7fe42b3e8>",
"WARC-Target-URI": "https://wiki.code4lib.org/Special:MobileDiff/2064",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eb43964c-9477-45f4-b67f-256f9236ef8a>"
},
"warc_info": "isPartOf: CC-MAIN-2020-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-217.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
8,
9,
37,
38,
53,
54,
94,
292,
395,
396,
442,
443,
760,
761
],
"line_end_idx": [
8,
9,
37,
38,
53,
54,
94,
292,
395,
396,
442,
443,
760,
761,
776
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 776,
"ccnet_original_nlines": 14,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30909091234207153,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04848485067486763,
"rps_doc_frac_lines_end_with_ellipsis": 0.06666667014360428,
"rps_doc_frac_no_alph_words": 0.23636363446712494,
"rps_doc_frac_unique_words": 0.625,
"rps_doc_mean_word_length": 4.6796875,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0.006060610059648752,
"rps_doc_unigram_entropy": 4.229855537414551,
"rps_doc_word_count": 128,
"rps_doc_frac_chars_dupe_10grams": 0.47078463435173035,
"rps_doc_frac_chars_dupe_5grams": 0.47078463435173035,
"rps_doc_frac_chars_dupe_6grams": 0.47078463435173035,
"rps_doc_frac_chars_dupe_7grams": 0.47078463435173035,
"rps_doc_frac_chars_dupe_8grams": 0.47078463435173035,
"rps_doc_frac_chars_dupe_9grams": 0.47078463435173035,
"rps_doc_frac_chars_top_2gram": 0.045075129717588425,
"rps_doc_frac_chars_top_3gram": 0.06010017171502113,
"rps_doc_frac_chars_top_4gram": 0.06343907117843628,
"rps_doc_books_importance": -74.57343292236328,
"rps_doc_books_importance_length_correction": -74.57343292236328,
"rps_doc_openwebtext_importance": -45.38744354248047,
"rps_doc_openwebtext_importance_length_correction": -45.3874397277832,
"rps_doc_wikipedia_importance": -35.01298904418945,
"rps_doc_wikipedia_importance_length_correction": -35.01298904418945
},
"fasttext": {
"dclm": 0.03652561083436012,
"english": 0.8874585628509521,
"fineweb_edu_approx": 1.915450096130371,
"eai_general_math": 0.3585037589073181,
"eai_open_web_math": 0.11409711837768555,
"eai_web_code": 0.07477139681577682
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.13",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-2,648,088,387,343,011,000 | Delphi Programming
Advertisement
This page is intended as a supplement to the official documentation on Delphi programming. CodeGear is in the process of putting the Delphi documentation on the Web. Once they have done so, this page will link to the relevant page in the official documentation.
Stub.gif
This article is a stub.
Please help enhance the Delphi Programming Wiki by expanding it.
Info.png
see the VCL Documentation Guidelines for an overview on doc pages
Unit[]
Description[]
function RightStr(const AText: AnsiString; const ACount: Integer): AnsiString; overload;
function RightStr(const AText: WideString; const ACount: Integer): WideString; overload;
The RightStr function takes 2 parameters. The first parameter is the source string and the second is an index integer which counts backwards from the end of the string.
The result is a substring at the very end of the source string with the length given in the second parameter.
Technical Comments[]
(Known issues / Documentation clarifications / Things to be aware of)
Examples[]
uses
StrUtils;
...
var
SourceString, SubString: String;
SubStringLength: Integer;
begin
SourceString := 'Delphi Wikia'; //string length is 12
SubStringLength := 5;
SubString := RightStr(SourceString, SubStringLength);
ShowMessage(SubString); //will show 'Wikia'
SubStringLength := 20; //length is more then the source string
SubString := RightStr(SourceString, SubStringLength);
ShowMessage(SubString); //will show the complete SourceString 'Delphi Wikia'
SubStringLength := -1;
SubString := RightStr(SourceString, SubStringLength);
ShowMessage(SubString); //If the SubStringLength is anything lower than 1 then then result will be empty
end;
See Also[]
(Please provide links to items specifically related to this item.)
User Comments/Tips[]
(Please leave your name with your comment.)
Advertisement | {
"url": "https://delphi.fandom.com/wiki/RightStr_Routine",
"source_domain": "delphi.fandom.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "324415",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6UZXTFJMZ6RJRXJNFR57EHE745NWF2Z7",
"WARC-Concurrent-To": "<urn:uuid:cb7976a1-4180-415e-9622-e96097c06527>",
"WARC-Date": "2022-06-26T01:25:25Z",
"WARC-IP-Address": "151.101.64.194",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:36OBTZEQ3D6RAU27V4PHWSLYFWYGRJSY",
"WARC-Record-ID": "<urn:uuid:59db362e-dc8f-423c-98b5-ff8b2c1a2b65>",
"WARC-Target-URI": "https://delphi.fandom.com/wiki/RightStr_Routine",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a811a437-e6df-4d78-83f7-d3364aa4e40e>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-203\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
19,
33,
295,
304,
328,
393,
402,
468,
469,
476,
477,
491,
492,
583,
674,
675,
844,
845,
955,
956,
977,
978,
1048,
1049,
1060,
1061,
1066,
1078,
1082,
1086,
1121,
1149,
1155,
1211,
1235,
1291,
1337,
1342,
1407,
1463,
1542,
1543,
1569,
1625,
1732,
1737,
1738,
1749,
1750,
1817,
1818,
1839,
1840,
1884,
1885
],
"line_end_idx": [
19,
33,
295,
304,
328,
393,
402,
468,
469,
476,
477,
491,
492,
583,
674,
675,
844,
845,
955,
956,
977,
978,
1048,
1049,
1060,
1061,
1066,
1078,
1082,
1086,
1121,
1149,
1155,
1211,
1235,
1291,
1337,
1342,
1407,
1463,
1542,
1543,
1569,
1625,
1732,
1737,
1738,
1749,
1750,
1817,
1818,
1839,
1840,
1884,
1885,
1898
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1898,
"ccnet_original_nlines": 55,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25513195991516113,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0029325499199330807,
"rps_doc_frac_lines_end_with_ellipsis": 0.01785713993012905,
"rps_doc_frac_no_alph_words": 0.2668621838092804,
"rps_doc_frac_unique_words": 0.514285683631897,
"rps_doc_mean_word_length": 6.028571605682373,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0.0029325499199330807,
"rps_doc_unigram_entropy": 4.488955974578857,
"rps_doc_word_count": 245,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09749492257833481,
"rps_doc_frac_chars_dupe_6grams": 0.09749492257833481,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03452945128083229,
"rps_doc_frac_chars_top_3gram": 0.030467160046100616,
"rps_doc_frac_chars_top_4gram": 0.1299932301044464,
"rps_doc_books_importance": -107.58413696289062,
"rps_doc_books_importance_length_correction": -107.58383178710938,
"rps_doc_openwebtext_importance": -49.217063903808594,
"rps_doc_openwebtext_importance_length_correction": -49.217063903808594,
"rps_doc_wikipedia_importance": -32.80078887939453,
"rps_doc_wikipedia_importance_length_correction": -32.80078887939453
},
"fasttext": {
"dclm": 0.02396743930876255,
"english": 0.6008773446083069,
"fineweb_edu_approx": 1.6883724927902222,
"eai_general_math": 0.0822453498840332,
"eai_open_web_math": 0.19652748107910156,
"eai_web_code": 0.1555095911026001
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-6,353,835,993,477,104,000 | 点击回首页
我的浏览记录 | | 帮助?
当前位置：
源码截图
源码目录树
当前路径：LetSearch/js/src/slider.js // script.aculo.us slider.js v1.7.0, Fri Jan 19 19:16:36 CET 2007
// Copyright (c) 2005, 2006 Marty Haught, Thomas Fuchs
//
// script.aculo.us is freely distributable under the terms of an MIT-style license.
// For details, see the script.aculo.us web site: http://script.aculo.us/
if(!Control) var Control = {};
Control.Slider = Class.create();
// options:
// axis: 'vertical', or 'horizontal' (default)
//
// callbacks:
// onChange(value)
// onSlide(value)
Control.Slider.prototype = {
initialize: function(handle, track, options) {
var slider = this;
if(handle instanceof Array) {
this.handles = handle.collect( function(e) { return $(e) });
} else {
this.handles = [$(handle)];
}
this.track = $(track);
this.options = options || {};
this.axis = this.options.axis || 'horizontal';
this.increment = this.options.increment || 1;
this.step = parseInt(this.options.step || '1');
this.range = this.options.range || $R(0,1);
this.value = 0; // assure backwards compat
this.values = this.handles.map( function() { return 0 });
this.spans = this.options.spans ? this.options.spans.map(function(s){ return $(s) }) : false;
this.options.startSpan = $(this.options.startSpan || null);
this.options.endSpan = $(this.options.endSpan || null);
this.restricted = this.options.restricted || false;
this.maximum = this.options.maximum || this.range.end;
this.minimum = this.options.minimum || this.range.start;
// Will be used to align the handle onto the track, if necessary
this.alignX = parseInt(this.options.alignX || '0');
this.alignY = parseInt(this.options.alignY || '0');
this.trackLength = this.maximumOffset() - this.minimumOffset();
this.handleLength = this.isVertical() ?
(this.handles[0].offsetHeight != 0 ?
this.handles[0].offsetHeight : this.handles[0].style.height.replace(/px$/,"")) :
(this.handles[0].offsetWidth != 0 ? this.handles[0].offsetWidth :
this.handles[0].style.width.replace(/px$/,""));
this.active = false;
this.dragging = false;
this.disabled = false;
if(this.options.disabled) this.setDisabled();
// Allowed values array
this.allowedValues = this.options.values ? this.options.values.sortBy(Prototype.K) : false;
if(this.allowedValues) {
this.minimum = this.allowedValues.min();
this.maximum = this.allowedValues.max();
}
this.eventMouseDown = this.startDrag.bindAsEventListener(this);
this.eventMouseUp = this.endDrag.bindAsEventListener(this);
this.eventMouseMove = this.update.bindAsEventListener(this);
// Initialize handles in reverse (make sure first handle is active)
this.handles.each( function(h,i) {
i = slider.handles.length-1-i;
slider.setValue(parseFloat(
(slider.options.sliderValue instanceof Array ?
slider.options.sliderValue[i] : slider.options.sliderValue) ||
slider.range.start), i);
Element.makePositioned(h); // fix IE
Event.observe(h, "mousedown", slider.eventMouseDown);
});
Event.observe(this.track, "mousedown", this.eventMouseDown);
Event.observe(document, "mouseup", this.eventMouseUp);
Event.observe(document, "mousemove", this.eventMouseMove);
this.initialized = true;
},
dispose: function() {
var slider = this;
Event.stopObserving(this.track, "mousedown", this.eventMouseDown);
Event.stopObserving(document, "mouseup", this.eventMouseUp);
Event.stopObserving(document, "mousemove", this.eventMouseMove);
this.handles.each( function(h) {
Event.stopObserving(h, "mousedown", slider.eventMouseDown);
});
},
setDisabled: function(){
this.disabled = true;
},
setEnabled: function(){
this.disabled = false;
},
getNearestValue: function(value){
if(this.allowedValues){
if(value >= this.allowedValues.max()) return(this.allowedValues.max());
if(value <= this.allowedValues.min()) return(this.allowedValues.min());
var offset = Math.abs(this.allowedValues[0] - value);
var newValue = this.allowedValues[0];
this.allowedValues.each( function(v) {
var currentOffset = Math.abs(v - value);
if(currentOffset <= offset){
newValue = v;
offset = currentOffset;
}
});
return newValue;
}
if(value > this.range.end) return this.range.end;
if(value < this.range.start) return this.range.start;
return value;
},
setValue: function(sliderValue, handleIdx){
if(!this.active) {
this.activeHandleIdx = handleIdx || 0;
this.activeHandle = this.handles[this.activeHandleIdx];
this.updateStyles();
}
handleIdx = handleIdx || this.activeHandleIdx || 0;
if(this.initialized && this.restricted) {
if((handleIdx>0) && (sliderValue<this.values[handleIdx-1]))
sliderValue = this.values[handleIdx-1];
if((handleIdx < (this.handles.length-1)) && (sliderValue>this.values[handleIdx+1]))
sliderValue = this.values[handleIdx+1];
}
sliderValue = this.getNearestValue(sliderValue);
this.values[handleIdx] = sliderValue;
this.value = this.values[0]; // assure backwards compat
this.handles[handleIdx].style[this.isVertical() ? 'top' : 'left'] =
this.translateToPx(sliderValue);
this.drawSpans();
if(!this.dragging || !this.event) this.updateFinished();
},
setValueBy: function(delta, handleIdx) {
this.setValue(this.values[handleIdx || this.activeHandleIdx || 0] + delta,
handleIdx || this.activeHandleIdx || 0);
},
translateToPx: function(value) {
return Math.round(
((this.trackLength-this.handleLength)/(this.range.end-this.range.start)) *
(value - this.range.start)) + "px";
},
translateToValue: function(offset) {
return ((offset/(this.trackLength-this.handleLength) *
(this.range.end-this.range.start)) + this.range.start);
},
getRange: function(range) {
var v = this.values.sortBy(Prototype.K);
range = range || 0;
return $R(v[range],v[range+1]);
},
minimumOffset: function(){
return(this.isVertical() ? this.alignY : this.alignX);
},
maximumOffset: function(){
return(this.isVertical() ?
(this.track.offsetHeight != 0 ? this.track.offsetHeight :
this.track.style.height.replace(/px$/,"")) - this.alignY :
(this.track.offsetWidth != 0 ? this.track.offsetWidth :
this.track.style.width.replace(/px$/,"")) - this.alignY);
},
isVertical: function(){
return (this.axis == 'vertical');
},
drawSpans: function() {
var slider = this;
if(this.spans)
$R(0, this.spans.length-1).each(function(r) { slider.setSpan(slider.spans[r], slider.getRange(r)) });
if(this.options.startSpan)
this.setSpan(this.options.startSpan,
$R(0, this.values.length>1 ? this.getRange(0).min() : this.value ));
if(this.options.endSpan)
this.setSpan(this.options.endSpan,
$R(this.values.length>1 ? this.getRange(this.spans.length-1).max() : this.value, this.maximum));
},
setSpan: function(span, range) {
if(this.isVertical()) {
span.style.top = this.translateToPx(range.start);
span.style.height = this.translateToPx(range.end - range.start + this.range.start);
} else {
span.style.left = this.translateToPx(range.start);
span.style.width = this.translateToPx(range.end - range.start + this.range.start);
}
},
updateStyles: function() {
this.handles.each( function(h){ Element.removeClassName(h, 'selected') });
Element.addClassName(this.activeHandle, 'selected');
},
startDrag: function(event) {
if(Event.isLeftClick(event)) {
if(!this.disabled){
this.active = true;
var handle = Event.element(event);
var pointer = [Event.pointerX(event), Event.pointerY(event)];
var track = handle;
if(track==this.track) {
var offsets = Position.cumulativeOffset(this.track);
this.event = event;
this.setValue(this.translateToValue(
(this.isVertical() ? pointer[1]-offsets[1] : pointer[0]-offsets[0])-(this.handleLength/2)
));
var offsets = Position.cumulativeOffset(this.activeHandle);
this.offsetX = (pointer[0] - offsets[0]);
this.offsetY = (pointer[1] - offsets[1]);
} else {
// find the handle (prevents issues with Safari)
while((this.handles.indexOf(handle) == -1) && handle.parentNode)
handle = handle.parentNode;
if(this.handles.indexOf(handle)!=-1) {
this.activeHandle = handle;
this.activeHandleIdx = this.handles.indexOf(this.activeHandle);
this.updateStyles();
var offsets = Position.cumulativeOffset(this.activeHandle);
this.offsetX = (pointer[0] - offsets[0]);
this.offsetY = (pointer[1] - offsets[1]);
}
}
}
Event.stop(event);
}
},
update: function(event) {
if(this.active) {
if(!this.dragging) this.dragging = true;
this.draw(event);
// fix AppleWebKit rendering
if(navigator.appVersion.indexOf('AppleWebKit')>0) window.scrollBy(0,0);
Event.stop(event);
}
},
draw: function(event) {
var pointer = [Event.pointerX(event), Event.pointerY(event)];
var offsets = Position.cumulativeOffset(this.track);
pointer[0] -= this.offsetX + offsets[0];
pointer[1] -= this.offsetY + offsets[1];
this.event = event;
this.setValue(this.translateToValue( this.isVertical() ? pointer[1] : pointer[0] ));
if(this.initialized && this.options.onSlide)
this.options.onSlide(this.values.length>1 ? this.values : this.value, this);
},
endDrag: function(event) {
if(this.active && this.dragging) {
this.finishDrag(event, true);
Event.stop(event);
}
this.active = false;
this.dragging = false;
},
finishDrag: function(event, success) {
this.active = false;
this.dragging = false;
this.updateFinished();
},
updateFinished: function() {
if(this.initialized && this.options.onChange)
this.options.onChange(this.values.length>1 ? this.values : this.value, this);
this.event = null;
}
}
关于我们 | 顾问团队 | 发展历程 | 联系我们 | 源码上传
联系电话(Tel)：4008-010-151(免长途) 企业QQ：4000410510
地址：北京市海淀区中关村鼎好大厦A座二层 邮编：100080
Room A-801,Dinghao Building,Zhongguancun,Beijing,China,100080
51Aspx.com 版权所有 CopyRight © 2006-2015. 京ICP备09089570号 | 京公网安备11010702000869号
在线客服
分享该页面
关闭侧边栏 | {
"url": "http://codefile.51aspx.com/HouseSpiderSystem/LetSearch/js/src/slider.js.html",
"source_domain": "codefile.51aspx.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "93341",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LOLNSQF4EUOWON75U2M3QFTVODXI5ZM3",
"WARC-Concurrent-To": "<urn:uuid:ea828f3e-2c6d-4ebf-a493-69ff011ebc9f>",
"WARC-Date": "2017-05-22T18:09:15Z",
"WARC-IP-Address": "219.148.38.23",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WSW6JSF2EDD6GTKCNYEIXPZGVMWIAONA",
"WARC-Record-ID": "<urn:uuid:cf785f63-c332-40ba-a799-3d795c3c4ef4>",
"WARC-Target-URI": "http://codefile.51aspx.com/HouseSpiderSystem/LetSearch/js/src/slider.js.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:36fae14f-3ad9-44d4-b278-9671c2871729>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-224-210.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
6,
21,
27,
28,
33,
34,
40,
41,
143,
144,
200,
203,
287,
361,
362,
393,
426,
427,
439,
487,
490,
504,
524,
543,
572,
621,
644,
649,
683,
750,
763,
797,
803,
808,
837,
871,
872,
928,
978,
1035,
1087,
1092,
1143,
1208,
1310,
1374,
1436,
1437,
1493,
1494,
1555,
1618,
1619,
1688,
1744,
1800,
1805,
1873,
1874,
1919,
1963,
2053,
2126,
2182,
2183,
2210,
2237,
2264,
2265,
2315,
2316,
2344,
2440,
2469,
2516,
2563,
2569,
2570,
2638,
2704,
2769,
2770,
2842,
2881,
2918,
2952,
3008,
3082,
3116,
3159,
3219,
3227,
3232,
3297,
3356,
3419,
3424,
3453,
3458,
3482,
3509,
3580,
3645,
3714,
3751,
3817,
3825,
3830,
3857,
3883,
3888,
3914,
3941,
3948,
3984,
4012,
4090,
4168,
4175,
4235,
4279,
4324,
4373,
4410,
4434,
4468,
4479,
4489,
4512,
4518,
4572,
4630,
4648,
4653,
4699,
4722,
4767,
4832,
4859,
4865,
4921,
4967,
5033,
5081,
5171,
5219,
5225,
5278,
5320,
5380,
5385,
5458,
5497,
5502,
5524,
5585,
5590,
5633,
5713,
5760,
5765,
5800,
5823,
5905,
5947,
5952,
5991,
6051,
6113,
6118,
6148,
6194,
6218,
6254,
6259,
6288,
6347,
6352,
6381,
6413,
6477,
6545,
6608,
6674,
6681,
6708,
6746,
6751,
6777,
6800,
6819,
6927,
6958,
7001,
7078,
7107,
7149,
7254,
7259,
7294,
7322,
7378,
7468,
7481,
7538,
7627,
7633,
7638,
7667,
7746,
7803,
7808,
7839,
7874,
7900,
7928,
7937,
7980,
8051,
8079,
8111,
8176,
8206,
8254,
8355,
8369,
8440,
8492,
8544,
8561,
8620,
8696,
8736,
8749,
8798,
8841,
8917,
8950,
8963,
9036,
9090,
9144,
9156,
9166,
9174,
9199,
9205,
9210,
9238,
9259,
9306,
9330,
9365,
9443,
9468,
9473,
9478,
9504,
9570,
9627,
9672,
9717,
9741,
9830,
9879,
9962,
9967,
9996,
10035,
10071,
10096,
10102,
10127,
10154,
10161,
10202,
10227,
10254,
10281,
10286,
10317,
10368,
10452,
10475,
10479,
10481,
10514,
10558,
10589,
10651,
10728,
10733,
10739
],
"line_end_idx": [
6,
21,
27,
28,
33,
34,
40,
41,
143,
144,
200,
203,
287,
361,
362,
393,
426,
427,
439,
487,
490,
504,
524,
543,
572,
621,
644,
649,
683,
750,
763,
797,
803,
808,
837,
871,
872,
928,
978,
1035,
1087,
1092,
1143,
1208,
1310,
1374,
1436,
1437,
1493,
1494,
1555,
1618,
1619,
1688,
1744,
1800,
1805,
1873,
1874,
1919,
1963,
2053,
2126,
2182,
2183,
2210,
2237,
2264,
2265,
2315,
2316,
2344,
2440,
2469,
2516,
2563,
2569,
2570,
2638,
2704,
2769,
2770,
2842,
2881,
2918,
2952,
3008,
3082,
3116,
3159,
3219,
3227,
3232,
3297,
3356,
3419,
3424,
3453,
3458,
3482,
3509,
3580,
3645,
3714,
3751,
3817,
3825,
3830,
3857,
3883,
3888,
3914,
3941,
3948,
3984,
4012,
4090,
4168,
4175,
4235,
4279,
4324,
4373,
4410,
4434,
4468,
4479,
4489,
4512,
4518,
4572,
4630,
4648,
4653,
4699,
4722,
4767,
4832,
4859,
4865,
4921,
4967,
5033,
5081,
5171,
5219,
5225,
5278,
5320,
5380,
5385,
5458,
5497,
5502,
5524,
5585,
5590,
5633,
5713,
5760,
5765,
5800,
5823,
5905,
5947,
5952,
5991,
6051,
6113,
6118,
6148,
6194,
6218,
6254,
6259,
6288,
6347,
6352,
6381,
6413,
6477,
6545,
6608,
6674,
6681,
6708,
6746,
6751,
6777,
6800,
6819,
6927,
6958,
7001,
7078,
7107,
7149,
7254,
7259,
7294,
7322,
7378,
7468,
7481,
7538,
7627,
7633,
7638,
7667,
7746,
7803,
7808,
7839,
7874,
7900,
7928,
7937,
7980,
8051,
8079,
8111,
8176,
8206,
8254,
8355,
8369,
8440,
8492,
8544,
8561,
8620,
8696,
8736,
8749,
8798,
8841,
8917,
8950,
8963,
9036,
9090,
9144,
9156,
9166,
9174,
9199,
9205,
9210,
9238,
9259,
9306,
9330,
9365,
9443,
9468,
9473,
9478,
9504,
9570,
9627,
9672,
9717,
9741,
9830,
9879,
9962,
9967,
9996,
10035,
10071,
10096,
10102,
10127,
10154,
10161,
10202,
10227,
10254,
10281,
10286,
10317,
10368,
10452,
10475,
10479,
10481,
10514,
10558,
10589,
10651,
10728,
10733,
10739,
10744
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 10744,
"ccnet_original_nlines": 293,
"rps_doc_curly_bracket": 0.009121369570493698,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1360161006450653,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005633799824863672,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5585513114929199,
"rps_doc_frac_unique_words": 0.5860306620597839,
"rps_doc_mean_word_length": 11.700170516967773,
"rps_doc_num_sentences": 426,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.56333589553833,
"rps_doc_word_count": 587,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0445544607937336,
"rps_doc_frac_chars_dupe_6grams": 0.03028538078069687,
"rps_doc_frac_chars_dupe_7grams": 0.03028538078069687,
"rps_doc_frac_chars_dupe_8grams": 0.03028538078069687,
"rps_doc_frac_chars_dupe_9grams": 0.03028538078069687,
"rps_doc_frac_chars_top_2gram": 0.005824110005050898,
"rps_doc_frac_chars_top_3gram": 0.0056785098277032375,
"rps_doc_frac_chars_top_4gram": 0.013977870345115662,
"rps_doc_books_importance": -1369.9678955078125,
"rps_doc_books_importance_length_correction": -1369.9678955078125,
"rps_doc_openwebtext_importance": -838.6885375976562,
"rps_doc_openwebtext_importance_length_correction": -838.6885375976562,
"rps_doc_wikipedia_importance": -621.7740478515625,
"rps_doc_wikipedia_importance_length_correction": -621.7740478515625
},
"fasttext": {
"dclm": 0.9953256845474243,
"english": 0.20691370964050293,
"fineweb_edu_approx": 3.549799680709839,
"eai_general_math": 0.1161271333694458,
"eai_open_web_math": 0.01091409008949995,
"eai_web_code": 0.7018048763275146
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-1,397,932,366,856,986,600 | Prove 1(1!) + 2(2!)+3(3!)+...+n(n!)=(n+1)!-1 by using mathematical induction
1 Answer | Add Yours
Top Answer
selmasharafaz's profile pic
selmasharafaz | College Teacher | (Level 3) Adjunct Educator
Posted on
To prove,
1(1!) + 2(2!) + 3(3!) + ... + n(n!) = (n+1)! - 1
LHS = 1(1!) + 2(2!) + 3(3!) + ... + n(n!)
RHS = (n+1)! - 1
By mathematical induction:
Let n = 1,
Then, LHS = 1(1!) = 1 x 1 = 1
And RHS = (1 + 1)! - 1 = 2! - 1 = 2 - 1 = 1
So, both LHS and RHS = 1 and equation is true at n=1.
Now, second part is the assumption part where n=k holds true for the equation.
Let n = k,
The equation is assumed to be true, and is
1(1!) + 2(2!) + 3(3!) + ...... + k(k!) = (k+1)! - 1 ------------ (a)
Third part of induction is that, since the equation held true for k, it will hold true for k+1.
Let n = k+1,
RHS = [(k+1) + 1]! - 1
= (k+2)! - 1
LHS = 1(1!) + 2(2!) + 3(3!) + ...... + k(k!) + (k+1)[(k+1)!]
= {1(1!) + 2(2!) + 3(3!) + ...... + k(k!)} + (k+1)[(k+1)!]
= { (k+1)! - 1 } + (k+1)[(k+1)!] ------- substituting eq. (a).
= (k+1)! + (k+1)[(k+1)!] - 1 (simply re-written)
= (k+1)! [ 1 + (k+1) ] - 1
= (k+1)! x (k+2) - 1
By formula, a! x (a+1) = (a+1)!
Therefore, LHS = (k+2)! - 1 and RHS = (k+2)! - 1
ie., LHS = RHS . The equation holds true for n=1, n=k and n=k+1
Hence the equation 1(1!) + 2(2!)+3(3!)+...+n(n!)=(n+1)!-1
is proved.
We’ve answered 333,670 questions. We can answer yours, too.
Ask a question | {
"url": "http://www.enotes.com/homework-help/prove-1-1-2-2-3-3-n-n-n-n-1-by-using-mathematical-451979",
"source_domain": "www.enotes.com",
"snapshot_id": "crawl=CC-MAIN-2016-36",
"warc_metadata": {
"Content-Length": "39597",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6SBCY276DHNVXCDAGMX4VJAMD7AYZWS3",
"WARC-Concurrent-To": "<urn:uuid:ec7b1408-02f8-4d66-8477-19d4d2047f00>",
"WARC-Date": "2016-08-26T07:01:21Z",
"WARC-IP-Address": "52.200.215.13",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:2YQRJQUPBW2FO4YQ6DSGTUCE7D5WXLY4",
"WARC-Record-ID": "<urn:uuid:1f6a9528-c8e6-4faa-8163-294b90402600>",
"WARC-Target-URI": "http://www.enotes.com/homework-help/prove-1-1-2-2-3-3-n-n-n-n-1-by-using-mathematical-451979",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9411e5e8-087b-4cbe-973d-905fe2115b3a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-153-172-175.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-36\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
77,
78,
99,
100,
111,
112,
140,
141,
202,
203,
213,
214,
224,
225,
274,
275,
317,
318,
335,
336,
363,
364,
375,
376,
406,
407,
455,
456,
510,
511,
590,
591,
602,
603,
647,
648,
718,
719,
815,
816,
829,
830,
853,
854,
875,
876,
937,
938,
1004,
1005,
1075,
1076,
1141,
1142,
1180,
1181,
1214,
1215,
1249,
1250,
1251,
1301,
1302,
1366,
1367,
1425,
1426,
1437,
1438,
1498,
1499
],
"line_end_idx": [
77,
78,
99,
100,
111,
112,
140,
141,
202,
203,
213,
214,
224,
225,
274,
275,
317,
318,
335,
336,
363,
364,
375,
376,
406,
407,
455,
456,
510,
511,
590,
591,
602,
603,
647,
648,
718,
719,
815,
816,
829,
830,
853,
854,
875,
876,
937,
938,
1004,
1005,
1075,
1076,
1141,
1142,
1180,
1181,
1214,
1215,
1249,
1250,
1251,
1301,
1302,
1366,
1367,
1425,
1426,
1437,
1438,
1498,
1499,
1513
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1513,
"ccnet_original_nlines": 71,
"rps_doc_curly_bracket": 0.002643750049173832,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18148820102214813,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02177857980132103,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6660616993904114,
"rps_doc_frac_unique_words": 0.4150943458080292,
"rps_doc_mean_word_length": 3.457547187805176,
"rps_doc_num_sentences": 61,
"rps_doc_symbol_to_word_ratio": 0.018148820847272873,
"rps_doc_unigram_entropy": 4.047281742095947,
"rps_doc_word_count": 212,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.051841750741004944,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.027285130694508553,
"rps_doc_frac_chars_top_3gram": 0.040927689522504807,
"rps_doc_frac_chars_top_4gram": 0.03274216130375862,
"rps_doc_books_importance": -324.3419494628906,
"rps_doc_books_importance_length_correction": -314.4252624511719,
"rps_doc_openwebtext_importance": -123.33406829833984,
"rps_doc_openwebtext_importance_length_correction": -123.33406829833984,
"rps_doc_wikipedia_importance": -85.19052124023438,
"rps_doc_wikipedia_importance_length_correction": -72.72631072998047
},
"fasttext": {
"dclm": 0.9958530068397522,
"english": 0.6110979914665222,
"fineweb_edu_approx": 2.639273166656494,
"eai_general_math": 0.49375802278518677,
"eai_open_web_math": 0.7473248243331909,
"eai_web_code": 0.1250479817390442
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "511.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
8,747,531,648,340,157,000 | Does Live limit the number of VST plugin output channels you can access?
I'm running 64-bit Windows with 64-bit Live 9, but I've seen this same behavior in Live 8. It appears that Live only lets you access a maximum of 16 total output channels from a multi-output VST plugin, even if the plugin is capable of exporting more.
For example, Kontakt 5 exports up to 64 channels (12 stereo pairs, 40 mono channels). However, when I'm doing multi-output setup in Live, I appear to only be able to access 28 channels total (12 stereo pairs + 4 mono). The Audio To menu doesn't seem to let me select anything beyond that. There is no scroll bar in the Audio To list, and using arrow keys to move down the list just rolls you back up to the top of the list if you try to go past the last entry in the list.
Is this a hard limit of Live, or is there a way to work around it?
Note: it's not just Kontakt- I've seen the same behavior with UVI Workstation, which exports 17 stereo pairs, but Live only lets me access the first 16.
Thanks.
2 answers
• mdefiore
contribution
1 answer
1 vote received
1 vote
What's the deal with this??? I'm having the same problems too in live 9.
2 years ago | 0 comments
• bleblans
contribution
5 answers
5 votes received
1 vote
I have the same issue with Kontakt player 5: it has 16 outs + 4aux but I only het 4 aux and 12 channels in live ...
8 months ago | 0 comments
You need to be logged in, have a Live license, and have a username set in your account to be able to answer questions.
Answers is a new product and we'd like to hear your wishes, problems or ideas. | {
"url": "https://www.ableton.com/answers/does-live-limit-the-number-of-vst-plugin-output-channels-you-can-access",
"source_domain": "www.ableton.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "32090",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:W3CN42ERSR5ZKBG4HEJSDOFUQYLT5TGY",
"WARC-Concurrent-To": "<urn:uuid:6d986421-e7c1-4c59-b107-8a39540210f6>",
"WARC-Date": "2017-12-13T15:10:27Z",
"WARC-IP-Address": "212.162.0.87",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:6E64N2VVVOLLBEFMLGHUK3YJRNUVBZBC",
"WARC-Record-ID": "<urn:uuid:73ac1225-b367-4399-bb07-77e2747f1f8d>",
"WARC-Target-URI": "https://www.ableton.com/answers/does-live-limit-the-number-of-vst-plugin-output-channels-you-can-access",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ec84fd7b-f483-44c5-8035-c1351a5f0349>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-156-45-70.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
73,
74,
326,
327,
800,
801,
868,
869,
1022,
1023,
1031,
1032,
1042,
1043,
1056,
1073,
1086,
1106,
1117,
1118,
1195,
1196,
1225,
1238,
1255,
1269,
1290,
1301,
1302,
1422,
1423,
1453,
1454,
1573,
1574
],
"line_end_idx": [
73,
74,
326,
327,
800,
801,
868,
869,
1022,
1023,
1031,
1032,
1042,
1043,
1056,
1073,
1086,
1106,
1117,
1118,
1195,
1196,
1225,
1238,
1255,
1269,
1290,
1301,
1302,
1422,
1423,
1453,
1454,
1573,
1574,
1652
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1652,
"ccnet_original_nlines": 35,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37837839126586914,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029729729518294334,
"rps_doc_frac_lines_end_with_ellipsis": 0.0277777798473835,
"rps_doc_frac_no_alph_words": 0.22162161767482758,
"rps_doc_frac_unique_words": 0.5016286373138428,
"rps_doc_mean_word_length": 3.9739413261413574,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0.002702699974179268,
"rps_doc_unigram_entropy": 4.739872455596924,
"rps_doc_word_count": 307,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.019672129303216934,
"rps_doc_frac_chars_top_3gram": 0.01147541031241417,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -153.09539794921875,
"rps_doc_books_importance_length_correction": -139.52833557128906,
"rps_doc_openwebtext_importance": -81.78388214111328,
"rps_doc_openwebtext_importance_length_correction": -81.78388214111328,
"rps_doc_wikipedia_importance": -73.19522857666016,
"rps_doc_wikipedia_importance_length_correction": -61.0854377746582
},
"fasttext": {
"dclm": 0.12329989671707153,
"english": 0.9262176156044006,
"fineweb_edu_approx": 0.8956849575042725,
"eai_general_math": 0.2856331467628479,
"eai_open_web_math": 0.08182317018508911,
"eai_web_code": 0.20873397588729858
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "781.7",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": "Music theory"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
762,259,525,060,430,200 | titanium module java进阶：在java代码的callback之后，如何把结果返回给titanium处理 ?
访问量: 1583
refer to: http://www.appcelerator.com/blog/2013/07/callbacks-in-appcelerator-titanium-modules/ （以及下面的链接）
我们知道，在js 中调用java 代码很简单：
// app.js
my_module = require('com.my.module');
my_module.say_hi("Jim");
// com.my.module.java:
@Kroll.method
public void say_hi(String name){
System.out.println("hi " + name);
}
但是，如果对应的Module 有个call back 函数，该怎么办呢？ 比如单点登录， 触发之后， 需要等待用户进行操作，然后在java代码中定义 onComplete, onError, onCancel:
public void onComplete(Platform platform, int action, HashMap res) {
if (action == Platform.ACTION_USER_INFOR) {
Message msg = new Message();
msg.what = MSG_AUTH_COMPLETE;
msg.obj = new Object[] {platform.getName(), res};
handler.sendMessage(msg);
}
}
public void onError(Platform platform, int action, Throwable t) {
if (action == Platform.ACTION_USER_INFOR) {
handler.sendEmptyMessage(MSG_AUTH_ERROR);
}
t.printStackTrace();
}
我希望在上面的 onComplete() 方法中，再调用js 函数，比如：
function send_user_info_to_server(){
HTTP.post('http://myserver.com/interface/register_user', my_data)
if(this.responseText == 'success') {
Alloy.createController('index').getView().open();
}
}
我们期望的调用方式是：
my_module = require('com.my.module');
my_module.say_hi("Jim", function(e) {
// error handler
}, function(e){
// sunccess handler
});
KrollFunction： 在java 代码中调用 js
http://docs.appcelerator.com/module-apidoc/latest/android/org/appcelerator/kroll/KrollFunction.html 和： https://developer.appcelerator.com/question/129607/krollfunction
这个interface 的作用，就是允许java代码调用js. 两个主要方法： call （同步）, callAsync （异步调用）.
订阅/RSS Feed
Subscribe
分类/category | {
"url": "http://siwei.me/blog/posts/titanium-module-java-java-callback-titanium",
"source_domain": "siwei.me",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "8238",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AH33CPV2IF4DCPIKZMDD4IUERPKUKJP5",
"WARC-Concurrent-To": "<urn:uuid:a6d2b9ec-442e-4ca3-87e5-937939d7d771>",
"WARC-Date": "2020-01-28T08:15:13Z",
"WARC-IP-Address": "47.52.44.250",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:I5XKUTI2MAEQ5PXCVADBOLK2ONYLVMDU",
"WARC-Record-ID": "<urn:uuid:26c27bee-79b5-4717-857e-930d9e7ac05e>",
"WARC-Target-URI": "http://siwei.me/blog/posts/titanium-module-java-java-callback-titanium",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9cf9555e-260f-4ba2-8114-fcc4e47e8000>"
},
"warc_info": "isPartOf: CC-MAIN-2020-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-251.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
63,
64,
74,
75,
182,
183,
207,
208,
218,
256,
281,
282,
305,
306,
320,
353,
390,
392,
393,
500,
501,
572,
620,
655,
691,
747,
779,
785,
789,
790,
858,
906,
954,
960,
985,
989,
990,
1028,
1029,
1066,
1137,
1178,
1236,
1242,
1244,
1245,
1257,
1258,
1296,
1334,
1354,
1370,
1393,
1397,
1398,
1428,
1429,
1599,
1600,
1674,
1675,
1687,
1688,
1698,
1699
],
"line_end_idx": [
63,
64,
74,
75,
182,
183,
207,
208,
218,
256,
281,
282,
305,
306,
320,
353,
390,
392,
393,
500,
501,
572,
620,
655,
691,
747,
779,
785,
789,
790,
858,
906,
954,
960,
985,
989,
990,
1028,
1029,
1066,
1137,
1178,
1236,
1242,
1244,
1245,
1257,
1258,
1296,
1334,
1354,
1370,
1393,
1397,
1398,
1428,
1429,
1599,
1600,
1674,
1675,
1687,
1688,
1698,
1699,
1710
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1710,
"ccnet_original_nlines": 65,
"rps_doc_curly_bracket": 0.01169591024518013,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07356947660446167,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016348769888281822,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5449591279029846,
"rps_doc_frac_unique_words": 0.8073394298553467,
"rps_doc_mean_word_length": 11.256880760192871,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.401944637298584,
"rps_doc_word_count": 109,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.024449879303574562,
"rps_doc_frac_chars_top_3gram": 0.0684596598148346,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -147.89437866210938,
"rps_doc_books_importance_length_correction": -136.32101440429688,
"rps_doc_openwebtext_importance": -95.15325164794922,
"rps_doc_openwebtext_importance_length_correction": -95.15325164794922,
"rps_doc_wikipedia_importance": -57.90879440307617,
"rps_doc_wikipedia_importance_length_correction": -49.463592529296875
},
"fasttext": {
"dclm": 0.9265632629394531,
"english": 0.10213281214237213,
"fineweb_edu_approx": 2.0594515800476074,
"eai_general_math": 0.01919502019882202,
"eai_open_web_math": 0.01619965024292469,
"eai_web_code": 0.3913140296936035
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
1,189,089,154,383,607,000 | iPage vs HostGator
iPage vs HostGator: Shared Hosting Plans Comparison
In Web Hosting by Fathi ArfaouiLeave a Comment
For many years, the web hosting has been easy to find, to select and to build a business with. But later, things become harder, especially in terms of comparisons of the server features, and of course the prices. In today’s post, I’ll compare iPage to HostGator, as they are two popular hosting providers with millions of customers.
The big issue here is how your website needs can get the right resources and speed, without paying more money. There are thousands of reviews about iPage and HostGator, and not all of them are honest.
Hosting resources compared
When I first started with HostGator, I noticed the big promises and the unlimited resources that everyone was talking about. But later, things looked completely different, here is the case, HostGator started alerting customers when they got some hundreds of visitors per day.
Please notice here that the disk space and also the monthly bandwidth, are not unlimited there, and of course, the company will terminate your account without any notice.
On the other side, iPage offers unlimited resources, such as the disk space, the bandwidth, and the hosted domains. That’s all with a free domain name, the difference here is that this company doesn’t disturb you with alerts and notices that you don’t need. It’s a different kind of web hosting with better customer support and features.
You’ll find that other people are recommending HostGator, but I’m only talking about truths and not promises, iPage a better and a cheaper web host, at the same time.
Prices
For only $3.5 per month, you get unlimited web hosting with iPage of the yearly plan, the more years you sign up for, the cheaper, you’ll host. On the other side, HostGator prices are more expensive for the same period, for the yearly hosting, they charge you $9.56 and that’s nearly the triple cost of what iPage offers.
The first plan of HostGator offers limited hosting for a single domain, and even, that’s expensive compared to the second company. The winner hosting here is iPage, they have cheaper prices with more features and easier sign-up process.
Shared hosting limitations
It’s really vital for a website or a blog to get the resources and the speed that they need. For that reason, installing a caching plugin for your WordPress website or any other software is important. The page caching system lets your visitors getting a faster website, and you’ll save bandwidth and resources. HostGator was not allowing a caching plugin, and even, if they do, they’ll bombard your inbox with alerts about the resources.
The bigger problem here is that HostGator lets you backup your website every day, but guess what? When you want to restore that data, they’ll ask you for extra fees without any notice. So, you get nothing as a backup, as you’ll pay multiple times the cost of a regular backup service with any other trusted web hosting provider.
iPage vs Hostgator Web Hosting
Unlike many other hosts, iPage is a real friendly shared web host, it’s a service that understands your needs without being aggressive in costs and limitations.
The customer support
Both companies offer support by phone, live chat, and tickets, So, you don’t have to worry about the support here. However, the iPage customer support is faster, especially with the live chat and the phone.
With HostGator, you get a help, but not the same way like the other host. They’re more friendly, better and faster at once. So, if you don’t need support and you know what you do, then, both companies will work. But if you think you’ll need help, then, only, iPage is what you’re looking for.
Server security
HostGator is known for the high number of hacked websites, their security system is not that strong as they talk about. On the other side, iPage has a stronger security system with daily malware and virus scanning. Also, they offer a complete security suite that secures every website and email. Best of all, the whole data center is protected by a high level of business protection, and every connection is fully scanned and protected.
VPS and dedicated servers
The two companies offer hosting plans for VPS, and dedicated servers. However, the iPage plans are cheaper with the same resources than HostGator. So, you’ll just pay higher with HostGator without any additional features or resources.
The winner host
I’ll make it simple and easy for you, if you’re a blogger or a business owner who looks for affordable and reliable web hosting, then, iPage is the right solution. You’ll get the unlimited web hosting with unlimited domains to host. And of course, that’s all with amazing features and cheap cost.
That way, you save money and you get exactly what your website or blog needs as resources. Also, you get advertising credits with Google and Bing, and also a free toll-free phone number for your business.
Fathi Arfaoui: A Physicist, Blogger, and the founder and owner of Trustiko.com. He shares Business, Blogging, WordPress, Web Safety, and Blogging tips to build better websites and blogs. Also, he shares online marketing strategies and recommendations.
Leave a Comment | {
"url": "https://trustiko.com/ipage-vs-hostgator/",
"source_domain": "trustiko.com",
"snapshot_id": "crawl=CC-MAIN-2017-30",
"warc_metadata": {
"Content-Length": "41476",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UANH5IRBL5LIBAN6RGJB4QZWWDMFD5N3",
"WARC-Concurrent-To": "<urn:uuid:ffd17ae3-9ea1-4089-a5f6-57156620f8a3>",
"WARC-Date": "2017-07-25T02:46:16Z",
"WARC-IP-Address": "97.107.138.113",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PUCQJOQDVLGKF2DAURLBLNHBU5TOFDFG",
"WARC-Record-ID": "<urn:uuid:af60e5d0-8a2d-4554-b00a-30bfcf76445d>",
"WARC-Target-URI": "https://trustiko.com/ipage-vs-hostgator/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7e01d722-ed84-4f59-a990-46aeb7c7c30b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-143-26-145.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
19,
20,
72,
73,
120,
121,
454,
455,
656,
657,
684,
685,
961,
962,
1133,
1134,
1472,
1473,
1640,
1641,
1648,
1649,
1971,
1972,
2209,
2210,
2237,
2238,
2676,
2677,
3006,
3007,
3038,
3039,
3200,
3201,
3222,
3223,
3430,
3431,
3724,
3725,
3741,
3742,
4179,
4180,
4206,
4207,
4442,
4443,
4459,
4460,
4757,
4758,
4963,
4964,
5216,
5217
],
"line_end_idx": [
19,
20,
72,
73,
120,
121,
454,
455,
656,
657,
684,
685,
961,
962,
1133,
1134,
1472,
1473,
1640,
1641,
1648,
1649,
1971,
1972,
2209,
2210,
2237,
2238,
2676,
2677,
3006,
3007,
3038,
3039,
3200,
3201,
3222,
3223,
3430,
3431,
3724,
3725,
3741,
3742,
4179,
4180,
4206,
4207,
4442,
4443,
4459,
4460,
4757,
4758,
4963,
4964,
5216,
5217,
5232
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5232,
"ccnet_original_nlines": 58,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42282506823539734,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00748362997546792,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15622076392173767,
"rps_doc_frac_unique_words": 0.3558352291584015,
"rps_doc_mean_word_length": 4.798626899719238,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.128790855407715,
"rps_doc_word_count": 874,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.009060559794306755,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01907487027347088,
"rps_doc_frac_chars_top_3gram": 0.011444919742643833,
"rps_doc_frac_chars_top_4gram": 0.010014309547841549,
"rps_doc_books_importance": -478.46905517578125,
"rps_doc_books_importance_length_correction": -478.46905517578125,
"rps_doc_openwebtext_importance": -238.92733764648438,
"rps_doc_openwebtext_importance_length_correction": -238.92733764648438,
"rps_doc_wikipedia_importance": -161.30958557128906,
"rps_doc_wikipedia_importance_length_correction": -161.30958557128906
},
"fasttext": {
"dclm": 0.022615250200033188,
"english": 0.9355175495147705,
"fineweb_edu_approx": 1.2793207168579102,
"eai_general_math": 0.07632976770401001,
"eai_open_web_math": 0.055473800748586655,
"eai_web_code": 0.0181122999638319
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "14",
"label": "Reviews/Critiques"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-3,237,276,992,634,597,000 | Acerca del control de distribución de software
10 de noviembre de 2022
ID 166296
La generación de las reglas de Control de inicio de aplicaciones puede ser complicada si también tiene que controlar la distribución del software en un dispositivo protegido, por ejemplo, en dispositivos protegidos donde el software instalado se actualiza periódicamente en forma automática. En este caso, se debe actualizar la lista de reglas de autorización después de cada actualización de software para que los archivos creados recientemente se consideren en la configuración de la tarea Control de inicio de aplicaciones. Para simplificar el control de inicio en situaciones de distribución de software, puede usar el subsistema de Control de distribución de software.
Un paquete de distribución de software (en adelante, denominado "paquete") representa una aplicación de software que se instala en un dispositivo protegido. Cada paquete contiene al menos una aplicación, y también puede contener archivos individuales, actualizaciones o hasta un comando individuales, además de las aplicaciones, en particular cuando se instala una aplicación o una actualización de software.
El subsistema de Control de distribución de software se implementa como lista de exclusiones adicional. Cuando agrega un paquete de distribución del software a esta lista, la aplicación permite que estos paquetes de confianza se descompriman y permite que el software instalado o modificado por un paquete de confianza se inicie automáticamente. Los archivos extraídos pueden heredar el atributo de confianza de un paquete de distribución principal. Un paquete de distribución principal es un paquete que el usuario agregó a la lista de exclusiones de Control de distribución de software y se convirtió en un paquete de confianza.
Kaspersky Embedded Systems Security controla solo los ciclos completos de distribución de software. La aplicación no puede procesar correctamente el inicio de archivos modificados por un paquete de confianza si, cuando el paquete se inicia por primera vez, se desactiva el control de distribución de software o no se instala el componente Control de inicio de aplicaciones.
El Control de distribución de software no está disponible si se desactiva la casilla de verificación Aplicar reglas a archivos ejecutables en la configuración de la tarea Control de inicio de aplicaciones.
Caché de distribución del software
Kaspersky Embedded Systems Security utiliza un caché de distribución de software generado dinámicamente ("caché de distribución") para establecer la relación entre paquetes de confianza y archivos creados durante la distribución del software. Cuando un paquete se inicia por primera vez, Kaspersky Embedded Systems Security detecta todos los archivos creados por el paquete durante el proceso de distribución del software y almacena sumas de control del archivo y rutas en el caché de distribución. Entonces se permite a todos los archivos en el caché de distribución iniciarse de forma predeterminada.
No puede revisar, limpiar ni modificar manualmente el caché de distribución mediante la interfaz de usuario. Kaspersky Embedded Systems Security completa y controla el caché.
Puede exportar el caché de distribución a un archivo de configuración (en formato XML) y borrar el caché con opciones de la línea de comandos.
Para exportar el caché de distribución a un archivo de configuración, ejecute el siguiente comando:
kavshell appcontrol /config /savetofile:<ruta de acceso completa> /sdc
Para borrar el caché de distribución, ejecute el siguiente comando:
kavshell appcontrol /config /clearsdc
Kaspersky Embedded Systems Security actualiza el caché de distribución cada 24 horas. Si la suma de control de un archivo anteriormente permitido se cambia, la aplicación elimina el registro de este archivo desde el caché de distribución. Si la tarea Control de inicio de aplicaciones se inicia en un modo Activo, los intentos posteriores de iniciar este archivo se bloquearán. Si se cambia la ruta completa al archivo anteriormente permitido, los intentos subsecuentes de iniciar este archivo no se bloquearán, porque la suma de control se almacena dentro del caché de distribución.
Procesamiento de los archivos extraídos
Todos los archivos extraídos de un paquete de confianza heredan el atributo de confianza sobre el primer inicio del paquete. Si desactiva la casilla después del primer inicio, todos los archivos extraídos del paquete conservarán el atributo heredado. Para reiniciar el atributo heredado para todos los archivos extraídos, debe borrar el caché de distribución y desactivar la casilla de verificación Permitir la distribución adicional de los programas creados desde este paquete de distribución antes de volver a iniciar el paquete de distribución de confianza.
Los archivos y paquetes extraídos creados por un paquete de distribución principal heredan el atributo de confianza, ya que sus sumas de control se agregan al caché de distribución cuando el paquete de distribución del software de la lista de exclusiones se abre por primera vez. Por lo tanto, el propio paquete de distribución y todos los archivos extraídos de este paquete también serán de confianza. De forma predeterminada, la cantidad de niveles de la herencia del atributo de confianza es ilimitada.
Los archivos extraídos conservarán el atributo de confianza después de reiniciar el sistema operativo.
El procesamiento de archivos se define en la Configuración de Control de distribución de software mediante la selección o la desactivación de la casilla de verificación Permitir la distribución adicional de los programas creados desde este paquete de distribución.
Por ejemplo, supongamos que agrega un paquete test.msi que contiene varios otros paquetes y aplicaciones a la lista de exclusiones y selecciona la casilla. En este caso, se permite la ejecución y la extracción de todos los paquetes y las aplicaciones contenidos en el paquete test.msi, si contienen otros archivos. Esta situación funciona para archivos extraídos en todos los niveles anidados.
Si agrega un paquete test.msi a la lista de exclusiones y desactiva la casilla de verificación Permitir la distribución adicional de los programas creados desde este paquete de distribución, la aplicación asignará el atributo de confianza solo a los paquetes y archivos ejecutables extraídos directamente de un paquete de confianza principal (en el primer nivel de anidación). Las sumas de control de estos archivos se almacenan en el caché de distribución. Todos los archivos en el segundo nivel de anidación y superiores serán bloqueados por el principio de denegación predeterminada.
Trabajar con la lista de reglas de Control de inicio de aplicaciones
La lista de paquetes de confianza del subsistema de control de distribución de software es una lista de exclusiones que amplifica pero no reemplaza la lista general de reglas de Control de inicio de aplicaciones.
Las reglas de denegación de Control de inicio de aplicaciones tienen la prioridad más alta: se bloqueará la descompresión del paquete de confianza y el inicio de archivos nuevos o modificados si estos paquetes y archivos están afectados por las reglas de denegación de control del inicio de aplicaciones.
Las exclusiones de control de distribución de software se aplican tanto para paquetes de confianza como para archivos creados o modificados por estos paquetes si no se aplica ninguna regla de denegación en la lista de Control de inicio de aplicaciones para esos paquetes y archivos.
Uso de las conclusiones de KSN
Las conclusiones de KSN que un archivo es no confiable tienen una prioridad más alta que las exclusiones de control de distribución de software: la descompresión de paquetes de confianza y el inicio de archivos creados o modificados por estos paquetes se bloquearán si KSN informa que estos archivos son no confiables.
En ese momento, después de descomprimir los datos de un paquete de confianza, todos los archivos secundarios podrán ejecutarse independientemente del uso de KSN dentro del alcance del control de inicio de aplicaciones. En ese momento, los estados de las casillas de verificación Denegar inicio de aplicaciones no confiables según KSN y Autorizar inicio de aplicaciones confiables según KSN no afectan el funcionamiento de la casilla de verificación Permitir la distribución adicional de los programas creados desde este paquete de distribución.
¿El artículo le resultó útil?
¿En qué podemos mejorar?
¡Gracias por sus comentarios! Nos está ayudando a mejorar.
¡Gracias por sus comentarios! Nos está ayudando a mejorar. | {
"url": "https://support.kaspersky.com/mx/kess/3.0/166296",
"source_domain": "support.kaspersky.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "225903",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:53RRA2DW3E434FZGQRBXXBTDKLXLOVGG",
"WARC-Concurrent-To": "<urn:uuid:df4ed88c-ffb6-4a4b-8218-17f1c7df9bff>",
"WARC-Date": "2024-08-05T00:42:28Z",
"WARC-IP-Address": "144.121.3.183",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VWJT6UIXAS4HRRW6P7AD5BN7Z4FGLCW5",
"WARC-Record-ID": "<urn:uuid:60f48714-663c-417a-877d-c92c3cc4d829>",
"WARC-Target-URI": "https://support.kaspersky.com/mx/kess/3.0/166296",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:da412545-c297-4fcd-8eeb-68b32028ae56>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-209\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
47,
48,
72,
73,
83,
84,
758,
759,
1168,
1169,
1800,
1801,
2175,
2176,
2382,
2383,
2418,
2419,
3022,
3023,
3198,
3199,
3342,
3343,
3443,
3444,
3515,
3516,
3584,
3585,
3623,
3624,
4208,
4209,
4249,
4250,
4811,
4812,
5318,
5319,
5422,
5423,
5688,
5689,
6083,
6084,
6671,
6672,
6741,
6742,
6955,
6956,
7261,
7262,
7545,
7546,
7577,
7578,
7897,
7898,
8443,
8444,
8474,
8499,
8558
],
"line_end_idx": [
47,
48,
72,
73,
83,
84,
758,
759,
1168,
1169,
1800,
1801,
2175,
2176,
2382,
2383,
2418,
2419,
3022,
3023,
3198,
3199,
3342,
3343,
3443,
3444,
3515,
3516,
3584,
3585,
3623,
3624,
4208,
4209,
4249,
4250,
4811,
4812,
5318,
5319,
5422,
5423,
5688,
5689,
6083,
6084,
6671,
6672,
6741,
6742,
6955,
6956,
7261,
7262,
7545,
7546,
7577,
7578,
7897,
7898,
8443,
8444,
8474,
8499,
8558,
8616
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8616,
"ccnet_original_nlines": 65,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06245613843202591,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005614039953798056,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.07719297707080841,
"rps_doc_frac_unique_words": 0.2258555144071579,
"rps_doc_mean_word_length": 5.558935165405273,
"rps_doc_num_sentences": 51,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.592776298522949,
"rps_doc_word_count": 1315,
"rps_doc_frac_chars_dupe_10grams": 0.1049247607588768,
"rps_doc_frac_chars_dupe_5grams": 0.3435020446777344,
"rps_doc_frac_chars_dupe_6grams": 0.24076606333255768,
"rps_doc_frac_chars_dupe_7grams": 0.19630643725395203,
"rps_doc_frac_chars_dupe_8grams": 0.14131326973438263,
"rps_doc_frac_chars_dupe_9grams": 0.1049247607588768,
"rps_doc_frac_chars_top_2gram": 0.08207934349775314,
"rps_doc_frac_chars_top_3gram": 0.03488371893763542,
"rps_doc_frac_chars_top_4gram": 0.047879621386528015,
"rps_doc_books_importance": -658.7233276367188,
"rps_doc_books_importance_length_correction": -658.7233276367188,
"rps_doc_openwebtext_importance": -388.4066467285156,
"rps_doc_openwebtext_importance_length_correction": -388.4066467285156,
"rps_doc_wikipedia_importance": -326.3883056640625,
"rps_doc_wikipedia_importance_length_correction": -326.3883056640625
},
"fasttext": {
"dclm": 0.6272653341293335,
"english": 0.0005219000158831477,
"fineweb_edu_approx": 1.0849323272705078,
"eai_general_math": 0.00006890000076964498,
"eai_open_web_math": 0.4964085817337036,
"eai_web_code": 0.8428137898445129
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
793,406,338,253,721,100 | Guides / Building Search UI / Widgets
Create your own React InstantSearch widgets
We released React InstantSearch Hooks, a new InstantSearch library for React. We recommend using React InstantSearch Hooks in new projects or upgrading from React InstantSearch.
Creating your own widgets
Creating React InstantSearch widgets is the third layer of Algolia’s API. Read about the two others possibilities in the React InstantSearch guide.
You are trying to create your own widget with React InstantSearch and that’s awesome but that also means that you couldn’t find the widgets or built-in options you were looking for. Algolia would love to hear about your use case as the aim of the InstantSearch libraries is to provide the best out-of-the-box experience. Don’t hesitate to send a quick message explaining what you were trying to achieve either using the form at the end of that page or directly by submitting a feature request.
When to create widgets?
You can create completely new widgets with new behaviors that aren’t available in the existing widgets. Don’t create a new widget if all you want is to extend a widget, like redefining the DOM of an existing widget.
React InstantSearch is a pluggable library that can solve most use cases with simple API entries. But it can’t solve everything, there will be some cases where the API can’t fulfill this promise of simplicity.
If that’s not the case, or you are in doubt, before diving into custom connectors please come to Discourse or GitHub first, where you can explain your situation and ask questions.
Quick start
You can use create-instantsearch-app. Similar to other interactive command-line applications, you can run it either with npx or with yarn:
1
2
3
npx create-instantsearch-app@latest --template 'React InstantSearch widget' 'my-widget'
# or
yarn create instantsearch-app "--template 'React InstantSearch widget' 'my-widget'"
How to create a new widget
To create new widgets, the process is the same as for extending widgets, but instead of reusing an existing connector you would create your own connector. To do that you will need to create your own connector via the createConnector function.
To do that, the best way is to read how connectors are actually built, have a look at the connectRefinementList code in the React InstantSearch project. You can also check the example at the bottom of this page. It’s an implementation of a custom connector commented to help you understand the API.
Lifecycle and API
The function createConnector accepts an object that takes several attributes. You can find below the list of attributes used in this guide (the full list of attributes is available in the API reference).
• displayName: name that will be applied on the higher-order component.
• getProvidedProps(props, searchState, searchResults): this function should return the props to forward to the composed component. It takes in the current props of the higher-order component, the search state of all widgets, the results of the search.
• refine(props, searchState, ...args): this function defines exactly how the refine prop of widgets affects the search state. It takes in the current props of the higher-order component, the search state of all widgets, as well as all arguments passed to the refine and createURL props of stateful widgets, and returns a new state.
• getSearchParameters(searchParameters, props, searchState): this function applies the current props and state to the provided SearchParameters, and returns a new SearchParameters. The SearchParameters type is described in the Helper’s documentation.
• cleanUp(props, searchState): this function is called when a widget is about to unmount to clean the searchState. It takes in the current props of the higher-order component and the searchState of all widgets and expects a new searchState in return.
Usage
Here is example that creates a connector which allows a component to update the current query.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
import { createConnector } from 'react-instantsearch-dom';
const connectWithQuery = createConnector({
displayName: 'WidgetWithQuery',
getProvidedProps(props, searchState) {
// Since the `attributeForMyQuery` searchState entry isn't
// necessarily defined, we need to default its value.
const currentRefinement = searchState.attributeForMyQuery || '';
// Connect the underlying component with the `currentRefinement`
return { currentRefinement };
},
refine(props, searchState, nextRefinement) {
// When the underlying component calls its `refine` prop,
// we update the searchState with the provided refinement.
return {
// `searchState` represents the search state of *all* widgets. We need to extend it
// instead of replacing it, otherwise other widgets will lose their respective state.
...searchState,
attributeForMyQuery: nextRefinement,
};
},
getSearchParameters(searchParameters, props, searchState) {
// When the `attributeForMyQuery` state entry changes, we update the query
return searchParameters.setQuery(searchState.attributeForMyQuery || '');
},
cleanUp(props, searchState) {
// When the widget is unmounted, we omit the entry `attributeForMyQuery`
// from the `searchState`, then on the next request the query will
// be empty
const { attributeForMyQuery, ...nextSearchState } = searchState;
return nextSearchState;
},
});
const MySearchBox = ({ currentRefinement, refine }) => (
<input
type="input"
value={currentRefinement}
onChange={e => refine(e.currentTarget.value)}
/>
);
const ConnectedSearchBox = connectWithQuery(MySearchBox);
Did you find this page helpful? | {
"url": "https://www.algolia.com/doc/guides/building-search-ui/widgets/create-your-own-widgets/react/",
"source_domain": "www.algolia.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "437875",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DZUGUWPU5DSUIMDGHPMCJGHYKWED4AE6",
"WARC-Concurrent-To": "<urn:uuid:cc5100ca-0909-4a90-8e70-767235042bb8>",
"WARC-Date": "2023-01-28T19:10:11Z",
"WARC-IP-Address": "104.16.46.55",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:A756NRZYIOEJRLI4UIVBLOELW53BUMR3",
"WARC-Record-ID": "<urn:uuid:dedc4fe8-c6b7-4db5-a7f6-92effeeebc2f>",
"WARC-Target-URI": "https://www.algolia.com/doc/guides/building-search-ui/widgets/create-your-own-widgets/react/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3e6d90e6-478d-4cf2-a8d9-fd93f271bb4b>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-254\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
38,
39,
83,
84,
262,
263,
289,
290,
438,
439,
933,
934,
958,
959,
1175,
1176,
1386,
1387,
1567,
1568,
1580,
1581,
1720,
1721,
1723,
1725,
1727,
1815,
1820,
1904,
1905,
1932,
1933,
2176,
2177,
2476,
2477,
2495,
2496,
2700,
2701,
2775,
3029,
3363,
3616,
3869,
3870,
3876,
3877,
3972,
3973,
3975,
3977,
3979,
3981,
3983,
3985,
3987,
3989,
3991,
3994,
3997,
4000,
4003,
4006,
4009,
4012,
4015,
4018,
4021,
4024,
4027,
4030,
4033,
4036,
4039,
4042,
4045,
4048,
4051,
4054,
4057,
4060,
4063,
4066,
4069,
4072,
4075,
4078,
4081,
4084,
4087,
4090,
4093,
4096,
4099,
4158,
4159,
4202,
4236,
4277,
4340,
4398,
4467,
4468,
4537,
4571,
4576,
4623,
4685,
4748,
4761,
4851,
4943,
4965,
5008,
5015,
5020,
5082,
5161,
5238,
5243,
5275,
5352,
5423,
5439,
5508,
5509,
5537,
5542,
5546,
5547,
5604,
5613,
5630,
5660,
5710,
5715,
5718,
5719,
5777
],
"line_end_idx": [
38,
39,
83,
84,
262,
263,
289,
290,
438,
439,
933,
934,
958,
959,
1175,
1176,
1386,
1387,
1567,
1568,
1580,
1581,
1720,
1721,
1723,
1725,
1727,
1815,
1820,
1904,
1905,
1932,
1933,
2176,
2177,
2476,
2477,
2495,
2496,
2700,
2701,
2775,
3029,
3363,
3616,
3869,
3870,
3876,
3877,
3972,
3973,
3975,
3977,
3979,
3981,
3983,
3985,
3987,
3989,
3991,
3994,
3997,
4000,
4003,
4006,
4009,
4012,
4015,
4018,
4021,
4024,
4027,
4030,
4033,
4036,
4039,
4042,
4045,
4048,
4051,
4054,
4057,
4060,
4063,
4066,
4069,
4072,
4075,
4078,
4081,
4084,
4087,
4090,
4093,
4096,
4099,
4158,
4159,
4202,
4236,
4277,
4340,
4398,
4467,
4468,
4537,
4571,
4576,
4623,
4685,
4748,
4761,
4851,
4943,
4965,
5008,
5015,
5020,
5082,
5161,
5238,
5243,
5275,
5352,
5423,
5439,
5508,
5509,
5537,
5542,
5546,
5547,
5604,
5613,
5630,
5660,
5710,
5715,
5718,
5719,
5777,
5808
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5808,
"ccnet_original_nlines": 141,
"rps_doc_curly_bracket": 0.004132229834794998,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34738773107528687,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00733271986246109,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25572869181632996,
"rps_doc_frac_unique_words": 0.4061349630355835,
"rps_doc_mean_word_length": 5.543558120727539,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.003666359931230545,
"rps_doc_unigram_entropy": 5.165265083312988,
"rps_doc_word_count": 815,
"rps_doc_frac_chars_dupe_10grams": 0.04404604062438011,
"rps_doc_frac_chars_dupe_5grams": 0.06750775128602982,
"rps_doc_frac_chars_dupe_6grams": 0.049800798296928406,
"rps_doc_frac_chars_dupe_7grams": 0.04404604062438011,
"rps_doc_frac_chars_dupe_8grams": 0.04404604062438011,
"rps_doc_frac_chars_dupe_9grams": 0.04404604062438011,
"rps_doc_frac_chars_top_2gram": 0.0438246987760067,
"rps_doc_frac_chars_top_3gram": 0.011509520001709461,
"rps_doc_frac_chars_top_4gram": 0.007968129590153694,
"rps_doc_books_importance": -494.546630859375,
"rps_doc_books_importance_length_correction": -494.546630859375,
"rps_doc_openwebtext_importance": -270.09210205078125,
"rps_doc_openwebtext_importance_length_correction": -270.09210205078125,
"rps_doc_wikipedia_importance": -212.33953857421875,
"rps_doc_wikipedia_importance_length_correction": -212.33953857421875
},
"fasttext": {
"dclm": 0.11355727910995483,
"english": 0.7733018398284912,
"fineweb_edu_approx": 1.673049807548523,
"eai_general_math": 0.3338012099266052,
"eai_open_web_math": 0.06862139701843262,
"eai_web_code": 0.8590138554573059
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
956,323,617,077,201,800 | Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
PerlMonks
Re: Back to Remedial Perl for Me: map{} function
by dchetlin (Friar)
on Dec 16, 2000 at 01:33 UTC ( #46938=note: print w/replies, xml ) Need Help??
in reply to Back to Remedial Perl for Me: map{} function
A note on efficiency:
`map EXPR, LIST' is in general quite a bit faster than `map BLOCK LIST', so you should probably try to use EXPRs rather than BLOCKs whenever possible in a map.
For instance, here are your first examples recoded as EXPRs:
my @adjusted_array = map $_ * 10, @array;
my %hash = map split /-/, @array;
Why is it faster? Using the BLOCK introduces a new scope, which adds some extra ops and time to start and finish. BLOCKs do give you extra power and flexibility, but try to use them only when necessary.
-dlc
Replies are listed 'Best First'.
(tye)Re: Back to Remedial Perl for Me: map{} function
by tye (Sage) on Dec 18, 2000 at 23:54 UTC
Why is it faster?
Because the optimizer is "broken". (:
- tye (but my friends call me "Tye")
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://46938]
help
Chatterbox?
NodeReaper files his shovel
How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (4)
As of 2016-12-03 16:55 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
On a regular basis, I'm most likely to spy upon:
Results (56 votes). Check out past polls. | {
"url": "http://www.perlmonks.org/?node_id=46938",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2016-50",
"warc_metadata": {
"Content-Length": "19713",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IXMOPM6MYYXPA5FDQPUZHCT5VX3PXMOK",
"WARC-Concurrent-To": "<urn:uuid:34fa870d-a448-4612-9d87-9d1f17d534f8>",
"WARC-Date": "2016-12-03T16:58:37Z",
"WARC-IP-Address": "209.197.123.153",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:G5CLFKB7FDL3RTSX63HWLQMEI5IVL7RU",
"WARC-Record-ID": "<urn:uuid:26a0bd58-4b13-4828-8647-7df16c01a996>",
"WARC-Target-URI": "http://www.perlmonks.org/?node_id=46938",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fab35234-c74a-4c40-822c-1e88149be334>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-31-129-80.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-50\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for November 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
63,
83,
85,
97,
98,
147,
148,
168,
247,
248,
249,
306,
307,
329,
330,
490,
491,
552,
553,
595,
596,
630,
631,
834,
835,
840,
841,
874,
928,
971,
972,
994,
995,
1037,
1038,
1087,
1088,
1096,
1106,
1116,
1117,
1137,
1155,
1168,
1181,
1210,
1215,
1227,
1255,
1256,
1294,
1307,
1349,
1376,
1386,
1399,
1411,
1422,
1440,
1493,
1494,
1495,
1496,
1497,
1498,
1499,
1500,
1501,
1502,
1503,
1504,
1505,
1506
],
"line_end_idx": [
63,
83,
85,
97,
98,
147,
148,
168,
247,
248,
249,
306,
307,
329,
330,
490,
491,
552,
553,
595,
596,
630,
631,
834,
835,
840,
841,
874,
928,
971,
972,
994,
995,
1037,
1038,
1087,
1088,
1096,
1106,
1116,
1117,
1137,
1155,
1168,
1181,
1210,
1215,
1227,
1255,
1256,
1294,
1307,
1349,
1376,
1386,
1399,
1411,
1422,
1440,
1493,
1494,
1495,
1496,
1497,
1498,
1499,
1500,
1501,
1502,
1503,
1504,
1505,
1506,
1551
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1551,
"ccnet_original_nlines": 73,
"rps_doc_curly_bracket": 0.0038684699684381485,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25418993830680847,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03631284832954407,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31564244627952576,
"rps_doc_frac_unique_words": 0.658730149269104,
"rps_doc_mean_word_length": 4.412698268890381,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0.0027932999655604362,
"rps_doc_unigram_entropy": 4.926889896392822,
"rps_doc_word_count": 252,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09532374143600464,
"rps_doc_frac_chars_dupe_6grams": 0.09532374143600464,
"rps_doc_frac_chars_dupe_7grams": 0.09532374143600464,
"rps_doc_frac_chars_dupe_8grams": 0.09532374143600464,
"rps_doc_frac_chars_dupe_9grams": 0.06474819779396057,
"rps_doc_frac_chars_top_2gram": 0.016187049448490143,
"rps_doc_frac_chars_top_3gram": 0.037769779562950134,
"rps_doc_frac_chars_top_4gram": 0.04856114834547043,
"rps_doc_books_importance": -168.42079162597656,
"rps_doc_books_importance_length_correction": -156.28541564941406,
"rps_doc_openwebtext_importance": -84.66332244873047,
"rps_doc_openwebtext_importance_length_correction": -84.66332244873047,
"rps_doc_wikipedia_importance": -69.91390991210938,
"rps_doc_wikipedia_importance_length_correction": -56.325828552246094
},
"fasttext": {
"dclm": 0.047188758850097656,
"english": 0.8369607329368591,
"fineweb_edu_approx": 2.032745599746704,
"eai_general_math": 0.012093069963157177,
"eai_open_web_math": 0.46270251274108887,
"eai_web_code": 0.00003778999962378293
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-7,426,527,436,305,972,000 | Mi primer formulario HTML
El primer artículo de nuestra serie te proporciona una primera experiencia de creación de un formulario web, que incluye diseñar un formulario sencillo con controles de formulario adecuados y otros elementos HTML, añadir un poco de estilo muy simple con CSS y describir cómo se envían los datos a un servidor. Ampliaremos cada uno de estos subtemas más adelante.
Prerrequisitos: Conocimientos básicos de informática y de lenguaje HTML.
Objetivo: Familiarizarse con los formularios web, para qué se usan, cómo diseñarlos y qué elementos HTML básicos vas a necesitar para casos sencillos.
¿Qué son los formularios web?
Los formularios web son uno de los principales puntos de interacción entre un usuario y un sitio web o aplicación. Los formularios permiten a los usuarios la introducción de datos, que generalmente se envían a un servidor web para su procesamiento y almacenamiento (consulta Enviar los datos de un formulario más adelante en el módulo), o se usan en el lado del cliente para provocar de alguna manera una actualización inmediata de la interfaz (por ejemplo, se añade otro elemento a una lista, o se muestra u oculta una función de interfaz de usuario).
El HTML de un formulario web está compuesto por uno o más controles de formulario (a veces llamados widgets), además de algunos elementos adicionales que ayudan a estructurar el formulario general; a menudo se los conoce como formularios HTML. Los controles pueden ser campos de texto de una o varias líneas, cajas desplegables, botones, casillas de verificación o botones de opción, y se crean principalmente con el elemento <input>, aunque hay algunos otros elementos que también hay que conocer.
Los controles de formulario también se pueden programar para forzar la introducción de formatos o valores específicos (validación de formulario), y se combinan con etiquetas de texto que describen su propósito para los usuarios con y sin discapacidad visual.
Diseñar tu formulario
Antes de comenzar a escribir código, siempre es mejor dar un paso atrás y tomarte el tiempo necesario para pensar en tu formulario. Diseñar una maqueta rápida te ayudará a definir el conjunto de datos adecuado que deseas pedirle al usuario que introduzca. Desde el punto de vista de la experiencia del usuario (UX), es importante recordar que cuanto más grande es tu formulario, más te arriesgas a frustrar a las personas y perder usuarios. Tiene que ser simple y conciso: solicita solo los datos que necesitas.
Diseñar formularios es un paso importante cuando creas un sitio web o una aplicación. Va más allá del alcance de este artículo exponer la experiencia de usuario de los formularios, pero si deseas profundizar en ese tema, puedes leer los artículos siguientes:
En este artículo, vamos a crear un formulario de contacto sencillo. Hagamos un esbozo.
Esbozo aproximado del formulario que vamos a construir
Nuestro formulario va a tener tres campos de texto y un botón. Le pedimos al usuario su nombre, su correo electrónico y el mensaje que desea enviar. Al pulsar el botón sus datos se enviarán a un servidor web.
Aprendizaje activo: La implementación de nuestro formulario HTML
De acuerdo, intentemos crear el HTML para nuestro formulario. Vamos a utilizar los elementos HTML siguientes: <form>, <label>, <input>, <textarea> y <button>.
Antes de continuar, haz una copia local de nuestra plantilla HTML simple: introduce aquí tu formulario HTML.
El elemento <form>
Todos los formularios comienzan con un elemento <form>, como este:
html
<form action="/my-handling-form-page" method="post"></form>
Este elemento define formalmente un formulario. Es un elemento contenedor, como un elemento <section> o <footer>, pero específico para contener formularios; también admite algunos atributos específicos para la configuración de la forma en que se comporta el formulario. Todos sus atributos son opcionales, pero es una práctica estándar establecer siempre al menos los atributos action y method:
• El atributo action define la ubicación (URL) donde se envían los datos que el formulario ha recopilado cuando se validan.
• El atributo method define con qué método HTTP se envían los datos (generalmente get o post).
Nota: Veremos cómo funcionan esos atributos en nuestro artículo Enviar los datos de un formulario que encontrarás más adelante.
Por ahora, añade el elemento <form> anterior a tu elemento HTML <body>.
Los elementos <label>, <input> y <textarea>
Nuestro formulario de contacto no es complejo: la parte para la entrada de datos contiene tres campos de texto, cada uno con su elemento <label> correspondiente:
En términos de código HTML, para implementar estos controles de formulario necesitamos algo como lo siguiente:
html
<form action="/my-handling-form-page" method="post">
<ul>
<li>
<label for="name">Nombre:</label>
<input type="text" id="name" name="user_name" />
</li>
<li>
<label for="mail">Correo electrónico:</label>
<input type="email" id="mail" name="user_mail" />
</li>
<li>
<label for="msg">Mensaje:</label>
<textarea id="msg" name="user_message"></textarea>
</li>
</ul>
</form>
Actualiza el código de tu formulario para que se vea como el anterior.
Los elementos <li> están ahí para estructurar nuestro código convenientemente y facilitar la aplicación de estilo (ver más adelante en el artículo). Por motivos de usabilidad y accesibilidad incluimos una etiqueta explícita para cada control de formulario. Ten en cuenta el uso del atributo for (en-US) en todos los elementos <label>, que toma como valor el id del control de formulario con el que está asociado; así es como asocias un formulario con su etiqueta.
Hacer esto presenta muchas ventajas porque la etiqueta está asociada al control del formulario y permite que los usuarios con ratón, panel táctil y dispositivos táctiles hagan clic en la etiqueta para activar el control correspondiente, y también proporciona accesibilidad con un nombre que los lectores de pantalla leen a sus usuarios. Encontrarás más detalles sobre las etiquetas de los formularios en Cómo estructurar un formulario web.
En el elemento <input>, el atributo más importante es type. Este atributo es muy importante porque define la forma en que el elemento <input> aparece y se comporta. Encontrarás más información sobre esto en el artículo sobre Controles de formularios nativos básicos más adelante.
• En nuestro ejemplo sencillo, usamos el valor <input/text> para la primera entrada, el valor predeterminado para este atributo. Representa un campo de texto básico de una sola línea que acepta cualquier tipo de entrada de texto.
• Para la segunda entrada, usamos el valor <input/email>, que define un campo de texto de una sola línea que solo acepta una dirección de correo electrónico. Esto convierte un campo de texto básico en una especie de campo «inteligente» que efectúa algunas comprobaciones de validación de los datos que el usuario escribe. También hace que aparezca un diseño de teclado más apropiado para introducir direcciones de correo electrónico (por ejemplo, con un símbolo @ por defecto) en dispositivos con teclados dinámicos, como teléfonos inteligentes. Encontrarás más información sobre la validación de formularios en el artículo de Validación de formularios por parte del cliente más adelante.
Por último, pero no por ello menos importante, ten en cuenta la sintaxis de <input> en contraposición con la de <textarea></textarea>. Esta es una de las rarezas del HTML. La etiqueta <input> es un elemento vacío, lo que significa que no necesita una etiqueta de cierre. El elemento <textarea> no es un elemento vacío, lo que significa que debe cerrarse con la etiqueta de cierre adecuada. Esto tiene un impacto en una característica específica de los formularios: el modo en que defines el valor predeterminado. Para definir el valor predeterminado de un elemento <input>, debes usar el atributo value de esta manera:
html
<input type="text" value="por defecto este elemento se llena con este texto" />
Por otro lado, si deseas definir un valor predeterminado para un elemento <textarea>, lo colocas entre las etiquetas de apertura y cierre del elemento <textarea>, así:
html
<textarea>
Por defecto, este elemento contiene este texto
</textarea>
El elemento <button>
El marcado de nuestro formulario está casi completo; solo necesitamos añadir un botón para permitir que el usuario envíe sus datos una vez que haya completado el formulario. Esto se hace con el elemento <button>; añade lo siguiente justo encima de la etiqueta de cierre </form>:
html
<li class="button">
<button type="submit">Envíe su mensaje</button>
</li>
El elemento <button> también acepta un atributo de type, que a su vez acepta uno de estos tres valores: submit, reset o button.
• Un clic en un botón submit (el valor predeterminado) envía los datos del formulario a la página web definida por el atributo action del elemento <form>.
• Un clic en un botón reset restablece de inmediato todos los controles de formulario a su valor predeterminado. Desde el punto de vista de UX, esto se considera una mala práctica, por lo que debes evitar usar este tipo de botones a menos que realmente tengas una buena razón para incluirlos.
• Un clic en un botón button no hace... ¡nada! Eso suena tonto, pero es muy útil para crear botones personalizados: puedes definir su función con JavaScript.
Nota: También puedes usar el elemento <input> con el atributo type correspondiente para generar un botón, por ejemplo <input type="submit">. La ventaja principal del elemento <button> es que el elemento <input> solo permite texto sin formato en su etiqueta, mientras que el elemento <button> permite contenido HTML completo, lo que permite generar botones creativos más complejos.
Aplicar estilo básico a un formulario
Ahora que has terminado de escribir el código HTML de tu formulario, guárdalo y observa lo que ocurre en un navegador. Por ahora, se verá bastante feo.
Nota: Si crees que no has escrito bien el código HTML, compáralo con nuestro ejemplo final: véase first-form.html (ver en vivo).
Resulta notablemente difícil aplicar estilo a los formularios. Está más allá del alcance de este artículo enseñarte cómo aplicar estilo a los formularios en detalle, por lo que por el momento solo vamos a exponer cómo añadir un poco de CSS para que se vea un poco bien.
En primer lugar, añade un elemento <style> a tu página, dentro de la cabecera del HTML. Debe quedar así:
html
<style></style>
Dentro de las etiquetas style, añade el código CSS siguiente:
css
form {
/* Centrar el formulario en la página */
margin: 0 auto;
width: 400px;
/* Esquema del formulario */
padding: 1em;
border: 1px solid #ccc;
border-radius: 1em;
}
ul {
list-style: none;
padding: 0;
margin: 0;
}
form li + li {
margin-top: 1em;
}
label {
/* Tamaño y alineación uniforme */
display: inline-block;
width: 90px;
text-align: right;
}
input,
textarea {
/* Para asegurarse de que todos los campos de texto tienen la misma configuración de letra
Por defecto, las áreas de texto tienen un tipo de letra monoespaciada */
font: 1em sans-serif;
/* Tamaño uniforme del campo de texto */
width: 300px;
box-sizing: border-box;
/* Hacer coincidir los bordes del campo del formulario */
border: 1px solid #999;
}
input:focus,
textarea:focus {
/* Destacado adicional para elementos que tienen el cursor */
border-color: #000;
}
textarea {
/* Alinear los campos de texto multilínea con sus etiquetas */
vertical-align: top;
/* Proporcionar espacio para escribir texto */
height: 5em;
}
.button {
/* Alinear los botones con los campos de texto */
padding-left: 90px; /* mismo tamaño que los elementos de la etiqueta */
}
button {
/* Este margen adicional representa aproximadamente el mismo espacio que el espacio
entre las etiquetas y sus campos de texto */
margin-left: 0.5em;
}
Guarda y vuelve a cargar, y observa que tu formulario presenta un aspecto mucho menos feo.
Nota: Puedes encontrar nuestra versión en GitHub en first-form-styled.html (ver en vivo).
Enviar los datos del formulario a un servidor web
La última parte, y quizás la más complicada, es manejar los datos del formulario en el lado del servidor. El elemento <form> define dónde y cómo enviar los datos gracias a los atributos action y method.
Proporcionamos un nombre (name) a cada control de formulario. Los nombres son importantes tanto en el lado del cliente como del servidor; le dicen al navegador qué nombre debe dar a cada dato y, en el lado del servidor, dejan que el servidor maneje cada dato por su nombre. Los datos del formulario se envían al servidor como pares de nombre/valor.
Para poner nombre a los diversos datos que se introducen en un formulario, debes usar el atributo name en cada control de formulario que recopila un dato específico. Veamos de nuevo algunos de nuestros códigos de formulario:
html
<form action="/my-handling-form-page" method="post">
<ul>
<li>
<label for="name">Nombre:</label>
<input type="text" id="name" name="user_name" />
</li>
<li>
<label for="mail">Correo electrónico:</label>
<input type="email" id="mail" name="user_email" />
</li>
<li>
<label for="msg">Mensaje:</label>
<textarea id="msg" name="user_message"></textarea>
</li>
...
</ul>
</form>
En nuestro ejemplo, el formulario envía tres datos denominados «user_name», «user_email» y «user_message». Esos datos se envían a la URL «/my-handling-form-page» utilizando el método post de HTTP.
En el lado del servidor, la secuencia de comandos de la URL «/my-handling-form-page» recibe los datos como una lista de tres elementos clave/valor contenidos en la solicitud HTTP. La forma en que este script maneja esos datos depende de ti. Cada lenguaje de servidor (PHP, Python, Ruby, Java, C#, etc.) tiene su propio mecanismo de manipulación de datos de formulario. No profundizaremos sobre el tema en esta guía, pero si deseas obtener más información, proporcionamos algunos ejemplos en nuestro artículo Enviar los datos de un formulario que encontrarás más adelante.
Resumen
¡Enhorabuena!, has creado tu primer formulario web. Debería verse así:
Pero esto es solo el comienzo: ahora ha llegado el momento de profundizar en el tema. Los formularios tienen mucho más potencial de lo que hemos visto aquí y los artículos siguientes de este módulo te ayudarán a dominarlo.
Temas avanzados | {
"url": "https://developer.mozilla.org/es/docs/Learn/Forms/Your_first_form",
"source_domain": "developer.mozilla.org",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "240658",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:INUOYJ5PBEDLURFIHPDGSMJXJJFXCXI4",
"WARC-Concurrent-To": "<urn:uuid:9dc604a3-52d5-4466-9c86-7d9cfed92715>",
"WARC-Date": "2023-12-05T19:56:20Z",
"WARC-IP-Address": "34.111.97.67",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZBRBFJPL7D7SN3V6N3CBIDIHIHEMIDDY",
"WARC-Record-ID": "<urn:uuid:cc46978d-9d3b-456d-9ee7-f5654144a211>",
"WARC-Target-URI": "https://developer.mozilla.org/es/docs/Learn/Forms/Your_first_form",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:295ad6db-1585-4bba-860a-275a61038bdc>"
},
"warc_info": "isPartOf: CC-MAIN-2023-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-195\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
26,
27,
390,
391,
464,
615,
616,
646,
647,
1200,
1201,
1700,
1701,
1960,
1961,
1983,
1984,
2496,
2497,
2756,
2757,
2844,
2845,
2900,
2901,
3110,
3111,
3176,
3177,
3336,
3337,
3446,
3447,
3466,
3467,
3534,
3535,
3540,
3541,
3601,
3602,
3997,
3998,
4124,
4221,
4222,
4350,
4351,
4423,
4424,
4468,
4469,
4631,
4632,
4743,
4744,
4749,
4750,
4803,
4810,
4819,
4859,
4914,
4924,
4933,
4985,
5041,
5051,
5060,
5100,
5157,
5167,
5175,
5183,
5184,
5255,
5256,
5720,
5721,
6161,
6162,
6442,
6443,
6675,
7366,
7367,
7986,
7987,
7992,
7993,
8073,
8074,
8242,
8243,
8248,
8249,
8260,
8307,
8319,
8320,
8341,
8342,
8621,
8622,
8627,
8628,
8648,
8698,
8704,
8705,
8833,
8834,
8991,
9286,
9446,
9447,
9828,
9829,
9867,
9868,
10020,
10021,
10150,
10151,
10421,
10422,
10527,
10528,
10533,
10534,
10550,
10551,
10613,
10614,
10618,
10619,
10626,
10669,
10687,
10703,
10734,
10750,
10776,
10798,
10800,
10801,
10806,
10826,
10840,
10853,
10855,
10856,
10871,
10890,
10892,
10893,
10901,
10938,
10963,
10978,
10999,
11001,
11002,
11009,
11020,
11113,
11191,
11215,
11216,
11259,
11275,
11301,
11302,
11362,
11388,
11390,
11391,
11404,
11421,
11485,
11507,
11509,
11510,
11521,
11586,
11609,
11610,
11659,
11674,
11676,
11677,
11687,
11739,
11813,
11815,
11816,
11825,
11911,
11961,
11983,
11985,
11986,
12077,
12078,
12168,
12169,
12219,
12220,
12423,
12424,
12773,
12774,
12999,
13000,
13005,
13006,
13059,
13066,
13075,
13115,
13170,
13180,
13189,
13241,
13298,
13308,
13317,
13357,
13414,
13424,
13425,
13433,
13441,
13449,
13450,
13647,
13648,
14220,
14221,
14229,
14230,
14301,
14302,
14525,
14526
],
"line_end_idx": [
26,
27,
390,
391,
464,
615,
616,
646,
647,
1200,
1201,
1700,
1701,
1960,
1961,
1983,
1984,
2496,
2497,
2756,
2757,
2844,
2845,
2900,
2901,
3110,
3111,
3176,
3177,
3336,
3337,
3446,
3447,
3466,
3467,
3534,
3535,
3540,
3541,
3601,
3602,
3997,
3998,
4124,
4221,
4222,
4350,
4351,
4423,
4424,
4468,
4469,
4631,
4632,
4743,
4744,
4749,
4750,
4803,
4810,
4819,
4859,
4914,
4924,
4933,
4985,
5041,
5051,
5060,
5100,
5157,
5167,
5175,
5183,
5184,
5255,
5256,
5720,
5721,
6161,
6162,
6442,
6443,
6675,
7366,
7367,
7986,
7987,
7992,
7993,
8073,
8074,
8242,
8243,
8248,
8249,
8260,
8307,
8319,
8320,
8341,
8342,
8621,
8622,
8627,
8628,
8648,
8698,
8704,
8705,
8833,
8834,
8991,
9286,
9446,
9447,
9828,
9829,
9867,
9868,
10020,
10021,
10150,
10151,
10421,
10422,
10527,
10528,
10533,
10534,
10550,
10551,
10613,
10614,
10618,
10619,
10626,
10669,
10687,
10703,
10734,
10750,
10776,
10798,
10800,
10801,
10806,
10826,
10840,
10853,
10855,
10856,
10871,
10890,
10892,
10893,
10901,
10938,
10963,
10978,
10999,
11001,
11002,
11009,
11020,
11113,
11191,
11215,
11216,
11259,
11275,
11301,
11302,
11362,
11388,
11390,
11391,
11404,
11421,
11485,
11507,
11509,
11510,
11521,
11586,
11609,
11610,
11659,
11674,
11676,
11677,
11687,
11739,
11813,
11815,
11816,
11825,
11911,
11961,
11983,
11985,
11986,
12077,
12078,
12168,
12169,
12219,
12220,
12423,
12424,
12773,
12774,
12999,
13000,
13005,
13006,
13059,
13066,
13075,
13115,
13170,
13180,
13189,
13241,
13298,
13308,
13317,
13357,
13414,
13424,
13425,
13433,
13441,
13449,
13450,
13647,
13648,
14220,
14221,
14229,
14230,
14301,
14302,
14525,
14526,
14541
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 14541,
"ccnet_original_nlines": 245,
"rps_doc_curly_bracket": 0.0012378799729049206,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08184680342674255,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011192720383405685,
"rps_doc_frac_lines_end_with_ellipsis": 0.004065040033310652,
"rps_doc_frac_no_alph_words": 0.20846450328826904,
"rps_doc_frac_unique_words": 0.29304027557373047,
"rps_doc_mean_word_length": 5.255494594573975,
"rps_doc_num_sentences": 90,
"rps_doc_symbol_to_word_ratio": 0.0020986399613320827,
"rps_doc_unigram_entropy": 5.5056352615356445,
"rps_doc_word_count": 2184,
"rps_doc_frac_chars_dupe_10grams": 0.05279665067791939,
"rps_doc_frac_chars_dupe_5grams": 0.10332810878753662,
"rps_doc_frac_chars_dupe_6grams": 0.07536155730485916,
"rps_doc_frac_chars_dupe_7grams": 0.06481964886188507,
"rps_doc_frac_chars_dupe_8grams": 0.058895278722047806,
"rps_doc_frac_chars_dupe_9grams": 0.05279665067791939,
"rps_doc_frac_chars_top_2gram": 0.00975780002772808,
"rps_doc_frac_chars_top_3gram": 0.007928210310637951,
"rps_doc_frac_chars_top_4gram": 0.004791779909282923,
"rps_doc_books_importance": -1325.6046142578125,
"rps_doc_books_importance_length_correction": -1325.6046142578125,
"rps_doc_openwebtext_importance": -817.7913818359375,
"rps_doc_openwebtext_importance_length_correction": -817.7913818359375,
"rps_doc_wikipedia_importance": -610.8033447265625,
"rps_doc_wikipedia_importance_length_correction": -610.8033447265625
},
"fasttext": {
"dclm": 0.9166690111160278,
"english": 0.0008657299913465977,
"fineweb_edu_approx": 1.4203457832336426,
"eai_general_math": 0.00017231999663636088,
"eai_open_web_math": 0.4588583707809448,
"eai_web_code": 0.8736459612846375
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "006.31",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-4,761,512,141,263,807,000 | Mastering the Maze of Successful Pen Testing
Pen Testing Blue maze with a glowing blue wire navigating through.
Jan 24, 2024 by Tim Lewis
Enhancing your organization’s cybersecurity posture requires a thorough understanding of not only active vulnerabilities, but potential vulnerabilities as well. This is where penetration testing, or pen testing, comes into play – which can be used as a tool to fortify your defenses.
As we delve into the complex world of cybersecurity, it becomes paramount to understand the importance of proactive measures. Here, we’ll shed light on the fundamentals of pen testing, exploring its methodologies, purposes, and the role it plays in safeguarding your digital assets and IT infrastructure.
What Is Pen Testing?
“We need to have a penetration test.”
That is how the conversation usually begins. Not intending to sound philosophical, my response is often, “what does that [penetration test] mean to you?” I ask because most people have different expectations when it comes to penetration testing. If anything, setting and managing realistic expectations is key.
According to CrowdStrike, pen testing is, “The simulation of real-world cyber attacks in order to test an organization’s cybersecurity capabilities and expose vulnerabilities.” Well, that’s much easier said than done. So, where do you start, and what should you take into consideration?
Considerations For A Successful Pen Test
Your Readiness
The first question that needs to be answered is, “Are you even ready for a pen test?” Sometimes, during a call, we find out the client does not have a patching policy, their firewall is not configured to use UTM, or they are otherwise operationally immature. In this scenario, there are so many potential entry points that a pen test is not going to find them all. Conducting a pen test is not a good use of resources.
Not sure if you’re ready for a pen test? Reach out to us and we can help.
Choose Your Starting Point
If you are ready, what should you expect on this journey? Where will the pen test begin? Do you need to perform an external or an internal pen test? Or do we only need to test a web application? Let’s explore the different types of pen testing:
External Pen Testing
Focuses on examining your systems exposed to the Internet. Its goal is to identify exploitable vulnerabilities that could potentially expose data or allow unauthorized access to external entities. The assessment involves tasks such as system identification, enumeration, discovering vulnerabilities, and exploiting them. The thing to remember is an external pen test simulates an attacker with no connection trying to get in from a remote location.
Internal Pen Testing
Evaluate the internal systems of your organization to determine potential lateral movements within your network. This assessment includes activities such as system identification, enumeration, vulnerability identification, exploitation, privilege escalation, lateral movement, and achievement of specified objectives. The genesis of an internal pen test is from the perspective of a compromised computer inside your network, assuming that the starting point is one of your computers taken over by an attacker.
Web Application Pen Testing
Assesses your web application through a three-step procedure. The initial phase involves reconnaissance, during which the team uncovers details such as the operating system and utilized services/resources. Subsequently, in the discovery phase, the team seeks to pinpoint vulnerabilities. The final stage is exploitation, where the team utilizes the identified vulnerabilities to gain unauthorized access to sensitive data.
Wireless Pen Testing
Detects the potential risks and vulnerabilities associated with your wireless network. The team evaluates weaknesses, including but not limited to de-authentication attacks, misconfigurations, session reuse, and the presence of unauthorized wireless devices.
Physical Pen Testing
Recognizes the risks and vulnerabilities impacting your physical security, aiming to access a corporate computer system. The team evaluates weaknesses, covering aspects like social engineeringtailgating, and other objectives related to physical security.
Understand The Limitations Of A Pen Test
It’s easy to assume that when getting a pen test, you are paying a hacker to do hacker stuff. This is a common misconception. There are several reasons a pen test is not apples to apples with a cybercriminal’s process.
Pen testers work within a set timeframe, with a clear start and end date, and have certain no-go zones. Cybercriminals, on the other hand, do not have a time constraint – and your entire IT infrastructure is their playground. For pen testers, they must balance breaking into your environment without breaking your environment.
Additionally, pen testers cannot touch certain things due to legal restrictions. For this reason, a good pen tester will list a series of “will do” and “won’t do” items. Another limitation is that the pen test captures a snapshot in time. The landscape is always changing, and new vulnerabilities emerge every day – emphasizing the importance of regularly performing pen tests.
The Do’s And Don’ts Of Pen Testing
The Do’s
OSINT Investigation
Many penetration testing services fail to conduct an OSINT investigation. OSINT involves gathering publicly available information about your company, network, etc. This information can include IP addresses, usernames, passwords, software versions, and anything else that can be used.
Keep It Under Wraps
We also encourage you to avoid informing the company or even all the IT staff that the test is happening. This prevents people from cramming for the exam, so to speak. Additionally, you should ask your primary point of contact to notify you immediately if their systems or staff detect something suspicious. If they detect my pen testing efforts, include that information in the report. If something is detected and it’s not me, we may have bigger problems.
The Don’ts
Due to legal reasons, a professional pen tester should avoid certain actions. These include:
DOS Testing
Unless there is a specific request, pen testers will try to avoid causing system downtime. Again, they need to balance breaking into your environment without breaking your environment. environment.
Social Engineering
Cybercriminals are known to research employees/associates of their intended victims and even engage them on social media. An employer does not have the authority to allow a pen tester to engage employees on non-company systems (BYOD, social media, etc.).
Equipment You Don’t Own
Pen testers should steer clear testing against ISP equipment or other equipment they don’t manage or own. This can be a serious legal landmine.
In conclusion, pen testing is vital for strengthening cybersecurity defenses against evolving threats. To maximize benefits, set realistic expectations, assess readiness, and choose the right test. Embrace the do’s and avoid the don’ts to effectively fortify cybersecurity and safeguard your digital assets and IT infrastructure.
If you’re interested in learning more about pen testing and protecting your IT infrastructure, please contact us by calling (502) 240-0404 or emailing [email protected].
Press enter to search | {
"url": "https://www.mirazon.com/mastering-the-maze-of-successful-pen-testing/",
"source_domain": "www.mirazon.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "149589",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WP36LGJOTAAJW2VO5LT533VKI6WVFBWW",
"WARC-Concurrent-To": "<urn:uuid:c08b0577-51da-4c9a-ade1-174e2980fd08>",
"WARC-Date": "2024-08-12T16:26:11Z",
"WARC-IP-Address": "141.193.213.11",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QG3FDN3ITCP7PCY4VIHEZ75JI36DMKEI",
"WARC-Record-ID": "<urn:uuid:ca6acaaa-f8a5-4bfe-8994-e83c0cc01ef3>",
"WARC-Target-URI": "https://www.mirazon.com/mastering-the-maze-of-successful-pen-testing/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:47a1c260-5697-44db-abce-0bd9630e4b68>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-71\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
45,
46,
113,
114,
140,
141,
425,
426,
731,
732,
753,
754,
792,
793,
1104,
1105,
1392,
1393,
1434,
1435,
1450,
1451,
1870,
1871,
1945,
1946,
1973,
1974,
2219,
2220,
2241,
2242,
2691,
2692,
2713,
2714,
3224,
3225,
3253,
3254,
3677,
3678,
3699,
3700,
3959,
3960,
3981,
3982,
4237,
4238,
4279,
4280,
4499,
4500,
4827,
4828,
5206,
5207,
5242,
5243,
5252,
5253,
5273,
5557,
5558,
5578,
6036,
6037,
6048,
6049,
6142,
6143,
6155,
6353,
6354,
6373,
6628,
6629,
6653,
6797,
6798,
7128,
7129,
7298,
7299
],
"line_end_idx": [
45,
46,
113,
114,
140,
141,
425,
426,
731,
732,
753,
754,
792,
793,
1104,
1105,
1392,
1393,
1434,
1435,
1450,
1451,
1870,
1871,
1945,
1946,
1973,
1974,
2219,
2220,
2241,
2242,
2691,
2692,
2713,
2714,
3224,
3225,
3253,
3254,
3677,
3678,
3699,
3700,
3959,
3960,
3981,
3982,
4237,
4238,
4279,
4280,
4499,
4500,
4827,
4828,
5206,
5207,
5242,
5243,
5252,
5253,
5273,
5557,
5558,
5578,
6036,
6037,
6048,
6049,
6142,
6143,
6155,
6353,
6354,
6373,
6628,
6629,
6653,
6797,
6798,
7128,
7129,
7298,
7299,
7320
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7320,
"ccnet_original_nlines": 85,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3703148365020752,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01199399959295988,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14617690443992615,
"rps_doc_frac_unique_words": 0.43381038308143616,
"rps_doc_mean_word_length": 5.367620944976807,
"rps_doc_num_sentences": 71,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.518656253814697,
"rps_doc_word_count": 1118,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.052157968282699585,
"rps_doc_frac_chars_dupe_6grams": 0.03332778066396713,
"rps_doc_frac_chars_dupe_7grams": 0.02132977917790413,
"rps_doc_frac_chars_dupe_8grams": 0.02132977917790413,
"rps_doc_frac_chars_dupe_9grams": 0.02132977917790413,
"rps_doc_frac_chars_top_2gram": 0.026662219315767288,
"rps_doc_frac_chars_top_3gram": 0.00799867045134306,
"rps_doc_frac_chars_top_4gram": 0.004999170079827309,
"rps_doc_books_importance": -479.51885986328125,
"rps_doc_books_importance_length_correction": -479.51885986328125,
"rps_doc_openwebtext_importance": -268.2186279296875,
"rps_doc_openwebtext_importance_length_correction": -268.2186279296875,
"rps_doc_wikipedia_importance": -194.71469116210938,
"rps_doc_wikipedia_importance_length_correction": -194.71469116210938
},
"fasttext": {
"dclm": 0.17258107662200928,
"english": 0.9193643927574158,
"fineweb_edu_approx": 2.6379196643829346,
"eai_general_math": 0.11376714706420898,
"eai_open_web_math": 0.1766110062599182,
"eai_web_code": 0.13346832990646362
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.8",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
-3,470,204,928,509,698,600 | Caché MultiValue Basic Reference
SIN
[Home] [Back] [Next]
InterSystems: The power behind what matters
Class Reference
Search:
Returns the sine of an angle.
Synopsis
SIN(number)
Arguments
number An expression that resolves to a number that expresses an angle in degrees.
Description
The SIN function takes an angle in degrees and returns the ratio of two sides of a right triangle. The ratio is the length of the side opposite the angle divided by the length of the hypotenuse, a value in the range -1 to 1 (inclusive).
To return results in radians, set $OPTIONS RADIANS.
To convert degrees to radians, multiply degrees by pi/180. To convert radians to degrees, multiply radians by 180/pi.
Examples
The following example uses the SIN function to return the sine of an angle:
DIM MyAngle
MyAngle = 1.3; ! Define angle in degrees.
PRINT SIN(MyAngle); ! Return sine in radians.
The following example uses the SIN function to return the cosecant of an angle:
DIM MyAngle, MyCosecant
MyAngle = 1.3; ! Define angle in degrees.
MyCosecant = 1 / SIN(MyAngle); ! Calculate cosecant.
PRINT MyCosecant
See Also | {
"url": "https://cedocs.intersystems.com/latest/csp/docbook/DocBook.UI.Page.cls?KEY=RVBS_fsin",
"source_domain": "cedocs.intersystems.com",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "9487",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4GJKK7GNZWP2BM2P6OVWYYTYJRMHGYEW",
"WARC-Concurrent-To": "<urn:uuid:4a57d1fa-8245-43a1-9efd-1045f56e910e>",
"WARC-Date": "2019-08-20T16:09:33Z",
"WARC-IP-Address": "38.97.67.131",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LIWVPXALDTZ2NAXKSAGAA6ABH2OCULLU",
"WARC-Record-ID": "<urn:uuid:7fdee4be-a623-4eb7-8f30-1a447a0b9dd6>",
"WARC-Target-URI": "https://cedocs.intersystems.com/latest/csp/docbook/DocBook.UI.Page.cls?KEY=RVBS_fsin",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9b3181f6-3a4c-4cdf-9d87-9080884cce0d>"
},
"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 ([email protected])\r\nhostname: ip-10-67-67-52.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
33,
37,
58,
105,
124,
136,
137,
167,
176,
188,
198,
281,
293,
530,
582,
700,
709,
785,
797,
845,
892,
972,
996,
1055,
1109,
1126
],
"line_end_idx": [
33,
37,
58,
105,
124,
136,
137,
167,
176,
188,
198,
281,
293,
530,
582,
700,
709,
785,
797,
845,
892,
972,
996,
1055,
1109,
1126,
1134
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1134,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25217390060424805,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.056521739810705185,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25217390060424805,
"rps_doc_frac_unique_words": 0.44252875447273254,
"rps_doc_mean_word_length": 4.977011680603027,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.9698715209960938,
"rps_doc_word_count": 174,
"rps_doc_frac_chars_dupe_10grams": 0.11085449904203415,
"rps_doc_frac_chars_dupe_5grams": 0.24480369687080383,
"rps_doc_frac_chars_dupe_6grams": 0.1778291016817093,
"rps_doc_frac_chars_dupe_7grams": 0.11085449904203415,
"rps_doc_frac_chars_dupe_8grams": 0.11085449904203415,
"rps_doc_frac_chars_dupe_9grams": 0.11085449904203415,
"rps_doc_frac_chars_top_2gram": 0.040415700525045395,
"rps_doc_frac_chars_top_3gram": 0.06466513127088547,
"rps_doc_frac_chars_top_4gram": 0.02540416084229946,
"rps_doc_books_importance": -86.24050903320312,
"rps_doc_books_importance_length_correction": -86.24050903320312,
"rps_doc_openwebtext_importance": -51.34490966796875,
"rps_doc_openwebtext_importance_length_correction": -46.39826202392578,
"rps_doc_wikipedia_importance": -9.128728866577148,
"rps_doc_wikipedia_importance_length_correction": -9.128728866577148
},
"fasttext": {
"dclm": 0.14083409309387207,
"english": 0.6883766651153564,
"fineweb_edu_approx": 3.2692179679870605,
"eai_general_math": 0.9963133335113525,
"eai_open_web_math": 0.7945243716239929,
"eai_web_code": 0.12866121530532837
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "516",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
2,444,386,634,342,257,700 | Swift Program to Subtract Two Numbers
1. Introduction
Subtraction is one of the four elementary arithmetic operations. While the act of subtracting two numbers is straightforward, implementing it in a new programming language is a fundamental step for many beginners. This guide focuses on creating a Swift program that subtracts two numbers, giving insights into variable usage, arithmetic operations, and output in Swift.
2. Program Overview
This Swift program aims to subtract one number from another and then display the result to the console. Using Swift's variable declaration, arithmetic operations, and the built-in print function, we will achieve our goal.
3. Code Program
// Declare two numbers for the subtraction operation
let num1 = 8.0
let num2 = 3.0
// Perform the subtraction
let difference = num1 - num2
// Print the result to the console
print("The difference between \(num1) and \(num2) is \(difference)")
Output:
The difference between 8.0 and 3.0 is 5.0
4. Step By Step Explanation
1. let num1 = 8.0: We begin by declaring a constant named num1 and assigning it a value of 8.0. The let keyword in Swift is used for declaring constants, which means once a value is assigned, it cannot be modified.
2. let num2 = 3.0: Another constant named num2 is declared, assigned a value of 3.0.
3. let difference = num1 - num2: This line carries out the subtraction operation. The values of num1 and num2 are subtracted, and the result is assigned to a new constant named difference.
4. print("The difference between \(num1) and \(num2) is \(difference)"): The result is then displayed using Swift's print function. We utilize string interpolation, represented by the \(variableName) syntax, to embed the values of the constants directly within the output string.
Comments | {
"url": "https://www.sourcecodeexamples.net/2023/09/swift-program-to-subtract-two-numbers.html",
"source_domain": "www.sourcecodeexamples.net",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "152424",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4DJ7WHEFGAQ2Q3YFWEONMYZJVZLUWHQ6",
"WARC-Concurrent-To": "<urn:uuid:eba2a48c-f2b5-4a4b-a697-3274beee41b8>",
"WARC-Date": "2024-06-21T00:27:12Z",
"WARC-IP-Address": "172.253.122.121",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:7PQFJPORPEBH3J36GLG7BQZJATGAVC5L",
"WARC-Record-ID": "<urn:uuid:b534ebf1-1826-464a-a8dd-6e7f84c7cb73>",
"WARC-Target-URI": "https://www.sourcecodeexamples.net/2023/09/swift-program-to-subtract-two-numbers.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cb609398-f560-413d-ba18-628f8954864d>"
},
"warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-185\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
38,
39,
55,
56,
426,
427,
447,
448,
670,
671,
687,
688,
741,
756,
771,
772,
799,
828,
829,
864,
933,
934,
942,
943,
985,
986,
1014,
1015,
1230,
1231,
1316,
1317,
1506,
1507,
1787,
1788,
1789
],
"line_end_idx": [
38,
39,
55,
56,
426,
427,
447,
448,
670,
671,
687,
688,
741,
756,
771,
772,
799,
828,
829,
864,
933,
934,
942,
943,
985,
986,
1014,
1015,
1230,
1231,
1316,
1317,
1506,
1507,
1787,
1788,
1789,
1797
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1797,
"ccnet_original_nlines": 37,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.29972752928733826,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2779291570186615,
"rps_doc_frac_unique_words": 0.42960289120674133,
"rps_doc_mean_word_length": 5.05415153503418,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.419737339019775,
"rps_doc_word_count": 277,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09857142716646194,
"rps_doc_frac_chars_dupe_6grams": 0.06857143342494965,
"rps_doc_frac_chars_dupe_7grams": 0.06857143342494965,
"rps_doc_frac_chars_dupe_8grams": 0.06857143342494965,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02857143059372902,
"rps_doc_frac_chars_top_3gram": 0.023571429774165154,
"rps_doc_frac_chars_top_4gram": 0.019999999552965164,
"rps_doc_books_importance": -243.07423400878906,
"rps_doc_books_importance_length_correction": -238.1520233154297,
"rps_doc_openwebtext_importance": -146.42984008789062,
"rps_doc_openwebtext_importance_length_correction": -146.42984008789062,
"rps_doc_wikipedia_importance": -94.37409210205078,
"rps_doc_wikipedia_importance_length_correction": -93.97753143310547
},
"fasttext": {
"dclm": 0.9753477573394775,
"english": 0.8645679950714111,
"fineweb_edu_approx": 3.3359243869781494,
"eai_general_math": 0.956932544708252,
"eai_open_web_math": 0.1889587640762329,
"eai_web_code": 0.5117657780647278
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "512.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
4,890,020,553,970,893,000 | • Inok Systems
Footprints Integration with SCCM
User Rating: / 0
PoorBest
Is it possible to have integration between Footprints and SCCM? the answer is yes it's possible, there are two kinds of integrations that can be done as below:
1. Integration with Footprints Service Core using SCCM Add Ons
If SCCM Add Ons is enabled, Footprints can automatically search and retrieve the Requestor's (Contact) asset details from SCCM to Footprints. This will be very useful for the agents if they want to search the requestor's asset details, especially when they need to obtain asset detail information which may not be maintain in Footprints CMDB.
2. Integration with Footprints CMDB
Footprints CMDB will pull the asset details information from SCCM tables, you will need to connect to SCCM database using ODBC and create a database view by joining all the asset details information from several tables in SCCM. I have created a view to get the asset details such as Computer/Server name, Model, Serial Number, Manufacturer, IP Addresses, MAC Addresses, Operating System, Processor Type, Processor Speed, Total RAM, Total HDD, etc. The benefits of this is you no longer need to worry whether your CMDB is up to date or not, since SCCM will do the scans of all the machines, and Footprints CMDB will regulary pull that information from SCCM into CMDB so your CMDB will always be in sync with SCCM. And Footprints CMDB integration is not limited to only SCCM database, in fact it can be integrated to any other database as long you can connect using ODBC and you know the database schema.
Random Blogpost
I had a customer who came to me, asking me to derive a ROI for implementing Footprints and ITIL. I really don’t have an answer for that….. This is like asking “come up with a ROI for buying that screwdriver”. Footprints is a tool and ITIL is a framework, both to aid the IT department in several ways, but this is not an investment where you get to see the tangible benefits immediately.
Read more... | {
"url": "http://www.inoks.com/en/blog/98-footprints-integration-with-sccm",
"source_domain": "www.inoks.com",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "37115",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AU7THDMEL4THHJGSKBRD67XXXJKFN5B2",
"WARC-Concurrent-To": "<urn:uuid:02fcbd5c-13b9-4ae4-a957-3d863dc739e2>",
"WARC-Date": "2017-11-21T17:36:40Z",
"WARC-IP-Address": "166.62.2.1",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:CVCFWZLEVTXJ7QW5GT25A2KOCIE7AA72",
"WARC-Record-ID": "<urn:uuid:5d87925c-e7bc-4b3b-aa8a-846859bef134>",
"WARC-Target-URI": "http://www.inoks.com/en/blog/98-footprints-integration-with-sccm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b90d7555-39e3-4638-b40f-10482a241d15>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-146-22-70.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-47\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for November 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
17,
18,
51,
52,
70,
80,
81,
83,
84,
244,
245,
308,
652,
653,
689,
1593,
1594,
1596,
1597,
1599,
1600,
1602,
1603,
1619,
1620,
1621,
2010,
2011
],
"line_end_idx": [
17,
18,
51,
52,
70,
80,
81,
83,
84,
244,
245,
308,
652,
653,
689,
1593,
1594,
1596,
1597,
1599,
1600,
1602,
1603,
1619,
1620,
1621,
2010,
2011,
2023
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2023,
"ccnet_original_nlines": 28,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.46192893385887146,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08629442006349564,
"rps_doc_frac_lines_end_with_ellipsis": 0.03448275849223137,
"rps_doc_frac_no_alph_words": 0.12690354883670807,
"rps_doc_frac_unique_words": 0.48688048124313354,
"rps_doc_mean_word_length": 4.679300308227539,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0.0050761401653289795,
"rps_doc_unigram_entropy": 4.734464168548584,
"rps_doc_word_count": 343,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03738318011164665,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03738318011164665,
"rps_doc_frac_chars_top_3gram": 0.028037380427122116,
"rps_doc_frac_chars_top_4gram": 0.03239874914288521,
"rps_doc_books_importance": -165.29006958007812,
"rps_doc_books_importance_length_correction": -165.29006958007812,
"rps_doc_openwebtext_importance": -82.64796447753906,
"rps_doc_openwebtext_importance_length_correction": -82.64796447753906,
"rps_doc_wikipedia_importance": -71.72508239746094,
"rps_doc_wikipedia_importance_length_correction": -71.72508239746094
},
"fasttext": {
"dclm": 0.14668190479278564,
"english": 0.9210920333862305,
"fineweb_edu_approx": 1.5619800090789795,
"eai_general_math": 0.11438090354204178,
"eai_open_web_math": 0.21850675344467163,
"eai_web_code": 0.33222997188568115
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 672f1e42c33a7f9846924a2431ea77df |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.